Struct OrSet 

pub struct OrSet<T: Ord, K: Ord> { /* private fields */ }

Observed-remove set with add-wins semantics.

Lean model: Crdt.ORSet.State α τ = Finset (α × τ) × Finset τ.

Implementations

impl<T: Ord, K: Ord> OrSet<T, K>

pub fn new() -> Self

pub fn add(&mut self, element: T, token: K)

pub fn apply_remove<I>(&mut self, tokens: I)

where I: IntoIterator<Item = K>,

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

where T: Clone, K: Clone,

pub fn adds(&self) -> &BTreeSet<(T, K)>

pub fn tombstones(&self) -> &BTreeSet<K>

impl<T: Ord + Clone, K: Ord + Clone> OrSet<T, K>

pub fn observed_tokens(&self, element: &T) -> BTreeSet<K>

Return the live add tokens for element, excluding tombstoned tokens.

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

pub fn elements(&self) -> BTreeSet<T>

Trait Implementations

impl<T: Clone + Ord, K: Clone + Ord> Clone for OrSet<T, K>

fn clone(&self) -> OrSet<T, K>

Returns a duplicate of the value. Read more

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

Performs copy-assignment from source. Read more

impl<T: Ord + Clone, K: Ord + Clone> Crdt for OrSet<T, K>

fn validate_record( &self, id: RecordId, delta: &Self::Delta, ) -> Result<(), WireError>

Refuses sequence-0 adds and removes with WireError::ZeroSequenceAdd and WireError::ZeroSequenceRemove. RecordKernel.permitted requires a positive sequence for every payload. Adds also mint a token at their record ID; allocateToken requires a positive sequence. These checks need no writer count, so the raw carrier applies them too. The author bound and add token value stay with the checked writers.

Every positive-sequence record is accepted. An add joins the add set, even when its token is already tombstoned (that is the observed-remove rule, and a fresh set applies it). A remove tombstones every token it names whether or not this replica observed them (RecordKernel.payloadOwned .remove), so a fresh set applies it too. A remove naming no tokens is the lattice bottom: the local writer emits it for an absent element, and joining ⊥ on any carrier is the correct application of that record, not a dropped one.

type Delta = OrSetDelta<T, K>

fn apply_delta(&mut self, delta: Self::Delta)

fn replica_count(&self) -> Option<usize>

Fixed replica domain, or None for CRDTs without a fixed arity.

impl<T: Debug + Ord, K: Debug + Ord> Debug for OrSet<T, K>

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

Formats the value using the given formatter. Read more

impl<T: Ord, K: Ord> Default for OrSet<T, K>

fn default() -> Self

Returns the “default value” for a type. Read more

impl<T: Ord + Clone, K: Ord + Clone> Mergeable for OrSet<T, K>

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

Join compatible states, returning an error if their replica domains differ.

impl<T: PartialEq + Ord, K: PartialEq + Ord> PartialEq for OrSet<T, K>

fn eq(&self, other: &OrSet<T, K>) -> 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 WireDecode for OrSet<String, u64>

fn decode_wire(cursor: &mut WireCursor<'_>) -> Result<Self, WireError>

fn decode_wire_with_collection_limits( cursor: &mut WireCursor<'_>, limits: CollectionLimits, ) -> Result<Self, WireError>

Decode a nested payload with a collection budget. Other payload types retain their ordinary decoder unless they implement this method.

fn decode_wire_with_limits( cursor: &mut WireCursor<'_>, collections: CollectionLimits, _max_records: Option<usize>, ) -> Result<Self, WireError>

Decode a payload nested in an EventLog with its record budget.

fn from_wire_bytes_with_collection_limits( bytes: &[u8], limits: CollectionLimits, ) -> Result<Self, WireError>

Decode a complete wire value with an explicit collection ceiling.

fn from_wire_bytes(bytes: &[u8]) -> Result<Self, WireError>

impl WireDecode for OrSet<u64, u64>

fn decode_wire(cursor: &mut WireCursor<'_>) -> Result<Self, WireError>

fn decode_wire_with_collection_limits( cursor: &mut WireCursor<'_>, limits: CollectionLimits, ) -> Result<Self, WireError>

Decode a nested payload with a collection budget. Other payload types retain their ordinary decoder unless they implement this method.

fn decode_wire_with_limits( cursor: &mut WireCursor<'_>, collections: CollectionLimits, _max_records: Option<usize>, ) -> Result<Self, WireError>

Decode a payload nested in an EventLog with its record budget.

fn from_wire_bytes_with_collection_limits( bytes: &[u8], limits: CollectionLimits, ) -> Result<Self, WireError>

Decode a complete wire value with an explicit collection ceiling.

fn from_wire_bytes(bytes: &[u8]) -> Result<Self, WireError>

impl WireEncode for OrSet<String, u64>

fn encode_wire(&self, out: &mut Vec<u8>) -> Result<(), WireError>

fn to_wire_bytes(&self) -> Result<Vec<u8>, WireError>

impl WireEncode for OrSet<u64, u64>

fn encode_wire(&self, out: &mut Vec<u8>) -> Result<(), WireError>

fn to_wire_bytes(&self) -> Result<Vec<u8>, WireError>

impl WireSchema for OrSet<String, u64>

const REQUIRES_ARITY: bool = false

fn wire_schema() -> Cow<'static, [u8]>

Borrow fixed identities; return owned bytes for composed schemas.

impl WireSchema for OrSet<u64, u64>

const REQUIRES_ARITY: bool = false

fn wire_schema() -> Cow<'static, [u8]>

Borrow fixed identities; return owned bytes for composed schemas.

impl<T: Eq + Ord, K: Eq + Ord> Eq for OrSet<T, K>

impl<T: Ord, K: Ord> StructuralPartialEq for OrSet<T, K>