Struct ORSet 

pub struct ORSet<T: Ord + Clone> { /* private fields */ }

An Observed-Remove Set (OR-Set) CRDT with add-wins semantics.

Each insertion is tagged with a globally unique Tag. A remove operation only removes the tags that were observed at the time of removal. This means a concurrent add and remove results in the element being present (add wins).

Supports delta-state replication via the DeltaCRDT trait.

Implementations

impl<T: Ord + Clone> ORSet<T>

pub fn new() -> Self

Create a new empty OR-Set.

pub fn add(&mut self, replica_id: &str, value: T)

Add an element with a new unique tag

pub fn remove(&mut self, value: &T)

Remove all observed instances of an element

pub fn contains(&self, value: &T) -> bool

Check whether value is present in the set (has at least one live tag).

pub fn iter(&self) -> impl Iterator<Item = &T>

Iterate over all elements currently in the set.

pub fn len(&self) -> usize

Return the number of distinct elements in the set.

pub fn is_empty(&self) -> bool

Return true if the set contains no elements.

Trait Implementations

impl<T: Clone + Ord + Clone> Clone for ORSet<T>

fn clone(&self) -> ORSet<T>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Debug + Ord + Clone> Debug for ORSet<T>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T: Ord + Clone> Default for ORSet<T>

fn default() -> Self

Returns the “default value” for a type.

impl<T: Ord + Clone> DeltaCRDT for ORSet<T>

type Delta = ORSetDelta<T>

The delta state type (often the same as Self)

fn split_delta(&mut self) -> Option<Self::Delta>

Split off pending deltas, returning them and resetting internal delta buffer

fn apply_delta(&mut self, delta: &Self::Delta)

Apply a delta to the state

impl<'de, T> Deserialize<'de> for ORSet<T>

where T: Deserialize<'de> + Default + Ord + Clone,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T: Ord + Clone> Lattice for ORSet<T>

fn bottom() -> Self

The bottom element (identity for join)

fn join(&self, other: &Self) -> Self

Join operation (least upper bound) Must be commutative, associative, and idempotent

fn partial_cmp_lattice(&self, other: &Self) -> Option<Ordering>

Partial order derived from join: a ≤ b iff a ⊔ b = b

fn leq(&self, other: &Self) -> bool

Check if self ≤ other in the lattice order

fn join_assign(&mut self, other: &Self)

Join-assign: self = self ⊔ other

impl<T: PartialEq + Ord + Clone> PartialEq for ORSet<T>

fn eq(&self, other: &ORSet<T>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T> Serialize for ORSet<T>

where T: Serialize + Ord + Clone,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<T: Eq + Ord + Clone> Eq for ORSet<T>

impl<T: Ord + Clone> StructuralPartialEq for ORSet<T>