pub struct GSet<T: Ord + Clone> { /* private fields */ }Expand description
A grow-only set (G-Set).
Elements can be added but never removed. Merge is simply the union of both sets. This is the simplest set CRDT.
§Example
use crdt_kit::prelude::*;
let mut s1 = GSet::new();
s1.insert("apple");
s1.insert("banana");
let mut s2 = GSet::new();
s2.insert("cherry");
s1.merge(&s2);
assert_eq!(s1.len(), 3);
assert!(s1.contains(&"cherry"));Implementations§
Trait Implementations§
Source§impl<T: Ord + Clone> FromIterator<T> for GSet<T>
impl<T: Ord + Clone> FromIterator<T> for GSet<T>
Source§fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Self
fn from_iter<I: IntoIterator<Item = T>>(iter: I) -> Self
Creates a value from an iterator. Read more
impl<T: Eq + Ord + Clone> Eq for GSet<T>
impl<T: Ord + Clone> StructuralPartialEq for GSet<T>
Auto Trait Implementations§
impl<T> Freeze for GSet<T>
impl<T> RefUnwindSafe for GSet<T>where
T: RefUnwindSafe,
impl<T> Send for GSet<T>where
T: Send,
impl<T> Sync for GSet<T>where
T: Sync,
impl<T> Unpin for GSet<T>
impl<T> UnwindSafe for GSet<T>where
T: RefUnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more