final class ORSet[A] extends ReplicatedData with ReplicatedDataSerialization with RemovedNodePruning with FastMerge

Implements a 'Observed Remove Set' CRDT, also called a 'OR-Set'. Elements can be added and removed any number of times. Concurrent add wins over remove.

It is not implemented as in the paper A comprehensive study of Convergent and Commutative Replicated Data Types. This is more space efficient and doesn't accumulate garbage for removed elements. It is described in the paper An optimized conflict-free replicated set The implementation is inspired by the Riak DT riak_dt_orswot.

The ORSet has a version vector that is incremented when an element is added to the set. The node -> count pair for that increment is stored against the element as its "birth dot". Every time the element is re-added to the set, its "birth dot" is updated to that of the node -> count version vector entry resulting from the add. When an element is removed, we simply drop it, no tombstones.

When an element exists in replica A and not replica B, is it because A added it and B has not yet seen that, or that B removed it and A has not yet seen that? In this implementation we compare the dot of the present element to the version vector in the Set it is absent from. If the element dot is not "seen" by the Set version vector, that means the other set has yet to see this add, and the item is in the merged Set. If the Set version vector dominates the dot, that means the other Set has removed this element already, and the item is not in the merged Set.

This class is immutable, i.e. "modifying" methods return a new instance.

Annotations
@SerialVersionUID()
Source
ORSet.scala
Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ORSet
  2. FastMerge
  3. RemovedNodePruning
  4. ReplicatedDataSerialization
  5. Serializable
  6. Serializable
  7. ReplicatedData
  8. AnyRef
  9. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Type Members

  1. type T = ORSet[A]

    The type of the concrete implementation, e.g.

    The type of the concrete implementation, e.g. GSet[A]. To be specified by subclass.

    Definition Classes
    ORSetReplicatedData

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def +(element: A)(implicit node: Cluster): ORSet[A]

    Adds an element to the set

  4. def -(element: A)(implicit node: Cluster): ORSet[A]

    Removes an element from the set.

  5. def ->[B](y: B): (ORSet[A], B)
    Implicit
    This member is added by an implicit conversion from ORSet[A] to ArrowAssoc[ORSet[A]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  6. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  7. def add(node: Cluster, element: A): ORSet[A]

    Adds an element to the set

  8. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  9. def clear(node: Cluster): ORSet[A]

    Removes all elements from the set, but keeps the history.

    Removes all elements from the set, but keeps the history. This has the same result as using #remove for each element, but it is more efficient.

  10. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  11. def contains(a: A): Boolean
  12. def elements: Set[A]

    Scala API

  13. def ensuring(cond: (ORSet[A]) ⇒ Boolean, msg: ⇒ Any): ORSet[A]
    Implicit
    This member is added by an implicit conversion from ORSet[A] to Ensuring[ORSet[A]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  14. def ensuring(cond: (ORSet[A]) ⇒ Boolean): ORSet[A]
    Implicit
    This member is added by an implicit conversion from ORSet[A] to Ensuring[ORSet[A]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  15. def ensuring(cond: Boolean, msg: ⇒ Any): ORSet[A]
    Implicit
    This member is added by an implicit conversion from ORSet[A] to Ensuring[ORSet[A]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  16. def ensuring(cond: Boolean): ORSet[A]
    Implicit
    This member is added by an implicit conversion from ORSet[A] to Ensuring[ORSet[A]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  17. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  18. def equals(o: Any): Boolean
    Definition Classes
    ORSet → AnyRef → Any
  19. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  20. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from ORSet[A] to StringFormat[ORSet[A]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  21. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
  22. def getElements(): Set[A]

    Java API

  23. def hashCode(): Int
    Definition Classes
    ORSet → AnyRef → Any
  24. def isEmpty: Boolean
  25. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  26. def merge(that: ORSet[A]): ORSet[A]

    When element is in this Set but not in that Set: Compare the "birth dot" of the present element to the version vector in the Set it is absent from.

    When element is in this Set but not in that Set: Compare the "birth dot" of the present element to the version vector in the Set it is absent from. If the element dot is not "seen" by other Set version vector, that means the other set has yet to see this add, and the element is to be in the merged Set. If the other Set version vector dominates the dot, that means the other Set has removed the element already, and the element is not to be in the merged Set.

    When element in both this Set and in that Set: Some dots may still need to be shed. If this Set has dots that the other Set does not have, and the other Set version vector dominates those dots, then we need to drop those dots. Keep only common dots, and dots that are not dominated by the other sides version vector

    Definition Classes
    ORSetReplicatedData
  27. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  28. def needPruningFrom(removedNode: UniqueAddress): Boolean

    Does it have any state changes from a specific node, which has been removed from the cluster.

    Does it have any state changes from a specific node, which has been removed from the cluster.

    Definition Classes
    ORSetRemovedNodePruning
  29. final def notify(): Unit
    Definition Classes
    AnyRef
  30. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  31. def prune(removedNode: UniqueAddress, collapseInto: UniqueAddress): ORSet[A]

    When the removed node has been removed from the cluster the state changes from that node will be pruned by collapsing the data entries to another node.

    When the removed node has been removed from the cluster the state changes from that node will be pruned by collapsing the data entries to another node.

    Definition Classes
    ORSetRemovedNodePruning
  32. def pruningCleanup(removedNode: UniqueAddress): ORSet[A]

    Remove data entries from a node that has been removed from the cluster and already been pruned.

    Remove data entries from a node that has been removed from the cluster and already been pruned.

    Definition Classes
    ORSetRemovedNodePruning
  33. def remove(node: Cluster, element: A): ORSet[A]

    Removes an element from the set.

  34. def size: Int
  35. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  36. def toString(): String
    Definition Classes
    ORSet → AnyRef → Any
  37. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  38. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  39. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  40. def [B](y: B): (ORSet[A], B)
    Implicit
    This member is added by an implicit conversion from ORSet[A] to ArrowAssoc[ORSet[A]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc

Shadowed Implicit Value Members

  1. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from ORSet[A] to any2stringadd[ORSet[A]] performed by method any2stringadd in scala.Predef.
    Shadowing
    This implicitly inherited member is shadowed by one or more members in this class.
    To access this member you can use a type ascription:
    (oRSet: any2stringadd[ORSet[A]]).+(other)
    Definition Classes
    any2stringadd

Inherited from FastMerge

Inherited from RemovedNodePruning

Inherited from Serializable

Inherited from Serializable

Inherited from ReplicatedData

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion any2stringadd from ORSet[A] to any2stringadd[ORSet[A]]

Inherited by implicit conversion StringFormat from ORSet[A] to StringFormat[ORSet[A]]

Inherited by implicit conversion Ensuring from ORSet[A] to Ensuring[ORSet[A]]

Inherited by implicit conversion ArrowAssoc from ORSet[A] to ArrowAssoc[ORSet[A]]

Ungrouped