Struct ORSet 

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

Observed-remove set.

Each addition is tagged with a unique (node, sequence) pair. Removal only deletes the tags observed at remove time, so concurrent adds of the same element survive removal.

Implementations

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

pub fn new() -> Self

Creates a new empty set.

pub fn add(&mut self, value: V, node: &NodeId)

Adds a value, tagging the addition with the given node.

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

Removes a value by clearing all currently observed tags.

Concurrent adds (with tags not yet observed) will survive.

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

Returns true if the value is present (has at least one live tag).

pub fn elements(&self) -> impl Iterator<Item = &V>

Returns an iterator over the current elements.

pub fn len(&self) -> usize

Returns the number of distinct elements in the set.

pub fn is_empty(&self) -> bool

Returns true if the set is empty.

Trait Implementations

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

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

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

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

Formats the value using the given formatter.

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

fn default() -> Self

Returns the “default value” for a type.

impl<V: Ord + Clone> Merge for ORSet<V>

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

Merge another replica’s state into self.

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

fn eq(&self, other: &ORSet<V>) -> 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<V: Eq + Ord + Clone> Eq for ORSet<V>

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