AddWinsSet

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def add(element: A, replicaID: Id): AddWinsSet[A]

def addRandom(e: A): AddWinsSet[A]

Adds a value conceptually from a new random replica

def addΔ(element: A, replicaID: Id): AddWinsSet[A]

Adding an element adds it to the current dot store as well as to the causal context (past).

final def asInstanceOf[T0]: T0

def clear: AddWinsSet[A]

def clone(): AnyRef

def contains(e: A): Boolean

val context: Set[Dot]

final def eq(arg0: AnyRef): Boolean

final def getClass(): Class[_]

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def remove(element: A): AddWinsSet[A]

def removeΔ(e: A): AddWinsSet[A]

Merging removes all elements the other side should known (based on the causal context), but does not contain.

val store: Map[A, Set[Dot]]

final def synchronized[T0](arg0: ⇒ T0): T0

def toSet: Set[A]

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

final def wait(): Unit

def finalize(): Unit