Package akka.cluster.ddata

Class ORSet.AtomicDeltaOp<A>

java.lang.Object

akka.cluster.ddata.ORSet.AtomicDeltaOp<A>

All Implemented Interfaces:

ORSet.DeltaOp, ReplicatedData, ReplicatedDataSerialization, ReplicatedDelta, ReplicatedDeltaSize, RequiresCausalDeliveryOfDeltas, java.io.Serializable

Direct Known Subclasses:

ORSet.AddDeltaOp, ORSet.FullStateDeltaOp, ORSet.RemoveDeltaOp

Enclosing class:

ORSet<A>

public abstract static class ORSet.AtomicDeltaOp<A>
extends java.lang.Object
implements ORSet.DeltaOp, ReplicatedDeltaSize

See Also:

Serialized Form

Constructor Summary

Constructors

Constructor	Description
AtomicDeltaOp()	Implements a 'Observed Remove Set' CRDT, also called a 'OR-Set'.

Method Summary

Modifier and Type	Method	Description
int	deltaSize()
abstract ORSet<A>	underlying()
ORSet<A>	zero()	The empty full state.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface akka.cluster.ddata.ReplicatedData

merge

Constructor Detail

AtomicDeltaOp

public AtomicDeltaOp()

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.

Method Detail

deltaSize

public int deltaSize()

Specified by:

deltaSize in interface ReplicatedDeltaSize

underlying

public abstract ORSet<A> underlying()

zero

public ORSet<A> zero()

Description copied from interface: ReplicatedDelta

The empty full state. This is used when a delta is received and no existing full state exists on the receiving side. Then the delta is merged into the zero to create the initial full state.

Specified by:

zero in interface ReplicatedDelta