case class AddWinsSet[A](store: Map[A, Set[Dot]], context: Set[Dot]) extends Product with Serializable
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- AddWinsSet
- Serializable
- Product
- Equals
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- 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
- Definition Classes
- Any
- def clear: AddWinsSet[A]
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @IntrinsicCandidate()
- def contains(e: A): Boolean
- val context: Set[Dot]
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @IntrinsicCandidate()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
- def productElementNames: Iterator[String]
- Definition Classes
- Product
- 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.
Merging removes all elements the other side should known (based on the causal context), but does not contain. Thus, the delta for removal is the empty map, with the dot of the removed element in the context.
- val store: Map[A, Set[Dot]]
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def toSet: Set[A]
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])