Struct Set 

pub struct Set<T, Tag, CL>
where
    T: Key,
    Tag: TagT,
    CL: CausalLength,
{ /* private fields */ }

Causal Length Set

Set implements the set described in the paper, with the addition of a tag. Set only uses the tag for garbage collection of old removed members.

Implementations

impl<T, Tag, CL> Set<T, Tag, CL>

where T: Key, Tag: TagT, CL: CausalLength,

pub fn new() -> Set<T, Tag, CL>

Create a new empty Set

pub fn get<Q>(&self, member: Q) -> Option<Tag>

where Q: Borrow<T>,

Returns None if member is not present in the set. If present returns Some(Tag)

pub fn contains<Q>(&self, member: Q) -> bool

where Q: Borrow<T>,

Returns true if the set contains a value.

pub fn add(&mut self, member: T, tag: Tag)

Add a value to a set.

pub fn remove(&mut self, member: T, tag: Tag)

Removes a value from the set.

pub fn iter(&self) -> impl Iterator<Item = (&T, Tag)> + '_

An iterator visiting all elements and tags in arbitrary order.

pub fn register_iter(&self) -> impl Iterator<Item = Register<T, Tag, CL>> + '_

An iterator visiting all registers in arbitrary order.

pub fn merge_register(&mut self, delta: Register<T, Tag, CL>, min_tag: Tag)

Merge a delta Register into a set.

Remove registers with a tag value less than min_tag will be ignored.

pub fn merge(&mut self, other: &Self, min_tag: Tag)

Merge two sets.

Remove deltas with a tag value less than min_tag will be ignored.

pub fn retain(&mut self, min_tag: Tag)

Filter out old remove tombstone deltas from the set.

Remove deltas with a tag value less than min_tag will be removed.

Trait Implementations

impl<T, Tag, CL> Clone for Set<T, Tag, CL>

where T: Key + Clone, Tag: TagT + Clone, CL: CausalLength + Clone,

fn clone(&self) -> Set<T, Tag, CL>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T, Tag, CL> Debug for Set<T, Tag, CL>

where T: Key + Debug, Tag: TagT + Debug, CL: CausalLength + Debug,

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

Formats the value using the given formatter.

impl<T, Tag, CL> Default for Set<T, Tag, CL>

where T: Key + Default, Tag: TagT + Default, CL: CausalLength + Default,

fn default() -> Set<T, Tag, CL>

Returns the “default value” for a type.

impl<'de, T, Tag, CL> Deserialize<'de> for Set<T, Tag, CL>

where T: Eq + Hash + Clone + Deserialize<'de>, Tag: TagT + Deserialize<'de>, CL: CausalLength + Deserialize<'de>,

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T, Tag, CL> Eq for Set<T, Tag, CL>

where T: Key + Eq, Tag: TagT + Eq, CL: CausalLength + Eq,

impl<K, V, Tag, CL> From<Map<K, V, Tag, CL>> for Set<(K, V), Tag, CL>

where K: Key + Ord, V: Value + Hash + Eq + Ord, Tag: TagT, CL: CausalLength,

fn from(m: Map<K, V, Tag, CL>) -> Self

Converts to this type from the input type.

impl<K, V, Tag, CL> From<Set<(K, V), Tag, CL>> for Map<K, V, Tag, CL>

where K: Key + Ord, V: Value + Hash + Eq + Ord, Tag: TagT, CL: CausalLength,

fn from(s: Set<(K, V), Tag, CL>) -> Self

Converts to this type from the input type.

impl<T, Tag, CL> PartialEq for Set<T, Tag, CL>

where T: Key + PartialEq, Tag: TagT + PartialEq, CL: CausalLength + PartialEq,

fn eq(&self, other: &Set<T, Tag, CL>) -> bool

Equality operator ==.

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

Inequality operator !=.

impl<T, Tag, CL> Serialize for Set<T, Tag, CL>

where T: Key + Serialize, Tag: TagT + Serialize, CL: CausalLength + Serialize,

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>

where S: Serializer,

Serialize this value into the given Serde serializer.

impl<T, Tag, CL> StructuralPartialEq for Set<T, Tag, CL>

where T: Key + PartialEq, Tag: TagT + PartialEq, CL: CausalLength + PartialEq,