Struct crdts::gset::GSet

pub struct GSet<T: Ord> { /* private fields */ }

A GSet is a grow-only set.

Implementations

impl<T: Ord> GSet<T>

pub fn new() -> Self

Instantiates an empty GSet.

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

Inserts an element into this GSet.

Examples

use crdts::GSet;
let mut a = GSet::new();
a.insert(1);
assert!(a.contains(&1));

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

Returns true if the GSet contains the element.

Examples

use crdts::GSet;
let mut a = GSet::new();
a.insert(1);
assert!(a.contains(&1));

pub fn read(&self) -> BTreeSet<T>where T: Clone,

Returns the BTreeSet for this GSet.

Examples

use crdts::GSet;
use std::collections::BTreeSet;
let mut a = GSet::new();
let mut b = BTreeSet::new();
for i in 1..10 {
    a.insert(i);
    b.insert(i);
}

assert_eq!(a.read(), b);

Trait Implementations

impl<T: Clone + Ord> Clone for GSet<T>

fn clone(&self) -> GSet<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Ord> CmRDT for GSet<T>

type Op = T

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 = Infallible

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<T: Ord> CvRDT for GSet<T>

fn merge(&mut self, other: Self)

Merges another GSet into this one.

Examples

use crdts::{GSet, CvRDT, CmRDT};
let (mut a, mut b) = (GSet::new(), GSet::new());
a.insert(1);
b.insert(2);
a.merge(b);
assert!(a.contains(&1));
assert!(a.contains(&2));

type Validation = Infallible

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<T: Debug + Ord> Debug for GSet<T>

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

Formats the value using the given formatter.

impl<T: Ord> Default for GSet<T>

fn default() -> Self

Returns the “default value” for a type.

impl<'de, T> Deserialize<'de> for GSet<T>where T: Deserialize<'de> + Ord,

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

Deserialize this value from the given Serde deserializer.

impl<T: Ord> From<GSet<T>> for BTreeSet<T>

fn from(gset: GSet<T>) -> BTreeSet<T>

Converts to this type from the input type.

impl<T: Hash + Ord> Hash for GSet<T>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<T: PartialEq + Ord> PartialEq<GSet<T>> for GSet<T>

fn eq(&self, other: &GSet<T>) -> 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<T> Serialize for GSet<T>where T: Serialize + Ord,

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

Serialize this value into the given Serde serializer.

impl<T: Eq + Ord> Eq for GSet<T>

impl<T: Ord> StructuralEq for GSet<T>

impl<T: Ord> StructuralPartialEq for GSet<T>