Grow Only Counter CRDT Implementation. Notes: It implements an array of nodes where the value of array works as a counter. T

Grow Only Set CRDT Implementation. Notes: A set of elements where elements can only be added and once an element is added, it cannot

A class to create a node with a id. Attributes: id (any_type): ID of the Node object.

Observed-Removed Set CRDT Implementation. Notes: Similar to LWW-Element-Set, except that it unique tags are used instead of timestam

Positive-Negative Counter CRDT Implementation. Notes: This counter supports both increment and decrement operations. It comb

Sequence CRDT Implementation. Notes: An ordered set, list or a sequence of elements. This CRDT can be build on top of other

Two-Phase Set CRDT Implementation. Notes: A set in which elements can be added as well as removed. It combines two G-Sets namely “ad

A class to provide static methods to LWWElementSet Class

A class to provide static methods to ORSet Class

A class to provide static methods to Sequence Class

Last-Writer-Wins Element Set CRDT Implementation. Notes: Similar to 2P-Set except each element is added/removed with a timestamp.