Struct crdts::orswot::Orswot

pub struct Orswot<M: Hash + Eq, A: Ord + Hash> { /* private fields */ }

Orswot is an add-biased or-set without tombstones ported from the riak_dt CRDT library.

Implementations

impl<M: Hash + Clone + Eq, A: Ord + Hash + Clone> Orswot<M, A>

pub fn new() -> Self

Returns a new Orswot instance.

pub fn clock(&self) -> VClock<A>

Return a snapshot of the ORSWOT clock

pub fn add(&self, member: M, ctx: AddCtx<A>) -> Op<M, A>

Add a single element.

pub fn add_all<I: IntoIterator<Item = M>>( &self, members: I, ctx: AddCtx<A> ) -> Op<M, A>

Add multiple elements.

pub fn rm(&self, member: M, ctx: RmCtx<A>) -> Op<M, A>

Remove a member with a witnessing ctx.

pub fn rm_all<I: IntoIterator<Item = M>>( &self, members: I, ctx: RmCtx<A> ) -> Op<M, A>

Remove members with a witnessing ctx.

pub fn contains(&self, member: &M) -> ReadCtx<bool, A>

Check if the set contains a member

pub fn iter(&self) -> impl Iterator<Item = ReadCtx<&M, A>>

Gets an iterator over the entries of the Map.

Examples

use crdts::{Orswot, CmRDT};

let actor = "actor";

let mut set: Orswot<u8, &'static str> = Default::default();

let add_ctx = set.read_ctx().derive_add_ctx(actor);
set.apply(set.add(100, add_ctx));

let add_ctx = set.read_ctx().derive_add_ctx(actor);
set.apply(set.add(50, add_ctx));

let mut items: Vec<_> = set
    .iter()
    .map(|item_ctx| *item_ctx.val)
    .collect();

items.sort();

assert_eq!(items, &[50, 100]);

pub fn read(&self) -> ReadCtx<HashSet<M>, A>

Retrieve the current members.

pub fn read_ctx(&self) -> ReadCtx<(), A>

Retrieve the current read context

Trait Implementations

impl<M: Clone + Hash + Eq, A: Clone + Ord + Hash> Clone for Orswot<M, A>

fn clone(&self) -> Orswot<M, A>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<M: Hash + Clone + Eq, A: Ord + Hash + Clone + Debug> CmRDT for Orswot<M, A>

type Op = Op<M, A>

Op defines a mutation to the CRDT. As long as Op’s from one actor are replayed in exactly the same order they were generated by that actor, the CRDT will converge. In other words, we must have a total ordering on each actors operations, while requiring only a partial order over all ops. E.g.

type Validation = <VClock<A> as CmRDT>::Validation

The validation error returned by validate_op.

fn validate_op(&self, op: &Self::Op) -> Result<(), Self::Validation>

Some CRDT’s have stricter requirements on how they must be used. To avoid violating these requirements, CRDT’s provide an interface to optionally validate op’s before they are applied.

fn apply(&mut self, op: Self::Op)

Apply an Op to the CRDT

impl<M: Hash + Eq + Clone + Debug, A: Ord + Hash + Clone + Debug> CvRDT for Orswot<M, A>

fn merge(&mut self, other: Self)

Merge combines another Orswot with this one.

type Validation = Validation<M, A>

The validation error returned by validate_merge.

fn validate_merge(&self, other: &Self) -> Result<(), Self::Validation>

Some CRDT’s have stricter requirements on how they must be used. To avoid violating these requirements, CRDT’s provide an interface to optionally validate merge compatibility before attempting to merge.

impl<M: Debug + Hash + Eq, A: Debug + Ord + Hash> Debug for Orswot<M, A>

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

Formats the value using the given formatter.

impl<M: Hash + Eq, A: Ord + Hash> Default for Orswot<M, A>

fn default() -> Self

Returns the “default value” for a type.

impl<'de, M, A> Deserialize<'de> for Orswot<M, A>where M: Deserialize<'de> + Hash + Eq, A: Deserialize<'de> + Ord + Hash,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<M: PartialEq + Hash + Eq, A: PartialEq + Ord + Hash> PartialEq<Orswot<M, A>> for Orswot<M, A>

fn eq(&self, other: &Orswot<M, A>) -> bool

This method tests for self and other values to be equal, and is used by ==.

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

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

impl<M: Hash + Clone + Eq, A: Ord + Hash> ResetRemove<A> for Orswot<M, A>

fn reset_remove(&mut self, clock: &VClock<A>)

Remove data that is strictly smaller than this clock

impl<M, A> Serialize for Orswot<M, A>where M: Serialize + Hash + Eq, A: Serialize + Ord + Hash,

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

Serialize this value into the given Serde serializer.

impl<M: Eq + Hash + Eq, A: Eq + Ord + Hash> Eq for Orswot<M, A>

impl<M: Hash + Eq, A: Ord + Hash> StructuralEq for Orswot<M, A>

impl<M: Hash + Eq, A: Ord + Hash> StructuralPartialEq for Orswot<M, A>