ORSet
Related Docs:
object ORSet
| package ddata
The type of the delta.
The type of the delta. To be specified by subclass.
It may be the same type as T or a different type if needed.
For example GSet uses the same type and ORSet uses different types.
The type of the concrete implementation, e.g.
The type of the concrete implementation, e.g. GSet[A].
To be specified by subclass.
Adds an element to the set
Removes an element from the set.
Adds an element to the set
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.
The accumulated delta of mutator operations since previous #resetDelta.
The accumulated delta of mutator operations since previous
#resetDelta. When the Replicator invokes the modify function
of the Update message and the user code is invoking one or more mutator
operations the data is collecting the delta of the operations and makes
it available for the Replicator with the #delta accessor. The
modify function shall still return the full state in the same way as
ReplicatedData without support for deltas.
Scala API
Java API
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
When delta is merged into the full state this method is used.
When delta is merged into the full state this method is used.
When the type D of the delta is of the same type as the full state T
this method can be implemented by delegating to merge.
The nodes that have changed the state for this data and would need pruning when such node is no longer part of the cluster.
The nodes that have changed the state for this data and would need pruning when such node is no longer part of the cluster.
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.
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.
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.
Removes an element from the set.
Reset collection of deltas from mutator operations.
Reset collection of deltas from mutator operations. When the Replicator
invokes the modify function of the Update message the delta is always
"reset" and when the user code is invoking one or more mutator operations the
data is collecting the delta of the operations and makes it available for
the Replicator with the #delta accessor. When the Replicator has
grabbed the delta it will invoke this method to get a clean data instance
without the delta.
(oRSet: any2stringadd[ORSet[A]]).+(other)
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 -> countpair 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 thenode -> countversion 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
dotof 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.