Struct OrSet 

pub struct OrSet<T>
where
    T: Clone + Eq + Hash,
{ /* private fields */ }

Observed-Remove Set

A CRDT set that supports add and remove operations. Each add operation gets a unique ID, and removes only affect observed add operations. This ensures that concurrent add/remove operations are handled correctly.

Example

use oxigdal_sync::crdt::{OrSet, Crdt};

let mut set1 = OrSet::new("device-1".to_string());
set1.insert("apple".to_string());
set1.insert("banana".to_string());

let mut set2 = OrSet::new("device-2".to_string());
set2.insert("cherry".to_string());

set1.merge(&set2).ok();
assert_eq!(set1.len(), 3);

Implementations

impl<T> OrSet<T>

where T: Clone + Eq + Hash,

pub fn new(device_id: DeviceId) -> Self

Creates a new OR-Set

Arguments

• device_id - The device ID

pub fn insert(&mut self, element: T) -> bool

Inserts an element into the set

Arguments

• element - The element to insert

Returns

True if the element was newly inserted, false if already present

pub fn remove(&mut self, element: &T) -> bool

Removes an element from the set

Arguments

• element - The element to remove

Returns

True if the element was present and removed

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

Checks if the set contains an element

Arguments

• element - The element to check

Returns

True if the element is in the set

pub fn len(&self) -> usize

Gets the number of elements in the set

pub fn is_empty(&self) -> bool

Checks if the set is empty

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

Gets an iterator over the elements

pub fn to_hashset(&self) -> HashSet<T>

Converts the set to a HashSet

pub fn clear(&mut self)

Clears all elements from the set

Trait Implementations

impl<T> Clone for OrSet<T>

where T: Clone + Eq + Hash + Clone,

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> Crdt for OrSet<T>

where T: Clone + Eq + Hash + Serialize + for<'de> Deserialize<'de>,

fn merge(&mut self, other: &Self) -> SyncResult<()>

Merges another CRDT state into this one

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

Checks if this CRDT is causally dominated by another

impl<T> Debug for OrSet<T>

where T: Clone + Eq + Hash + Debug,

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

Formats the value using the given formatter.

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

where T: Clone + Eq + Hash + DeserializeOwned,

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T> DeviceAware for OrSet<T>

where T: Clone + Eq + Hash + Serialize + for<'de> Deserialize<'de>,

fn device_id(&self) -> &DeviceId

Gets the device ID associated with this CRDT

fn set_device_id(&mut self, device_id: DeviceId)

Sets the device ID

impl<T> PartialEq for OrSet<T>

where T: Clone + Eq + Hash,

fn eq(&self, other: &Self) -> 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: Clone + Eq + Hash + Serialize,

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

where __S: Serializer,

Serialize this value into the given Serde serializer.