Struct LwwMap 

pub struct LwwMap<K: Ord, V: Ord> { /* private fields */ }

Last-writer-wins map.

This is a flat tested-not-proven type. Each key has an optional max-dot value entry and an optional max-dot remove tombstone. A key is visible when its value dot is greater than its remove dot.

Implementations

impl<K: Ord, V: Ord> LwwMap<K, V>

pub fn new() -> Self

pub fn set(&mut self, key: K, timestamp: u64, replica: u64, value: V)

pub fn remove(&mut self, key: K, timestamp: u64, replica: u64)

pub fn get(&self, key: &K) -> Option<&V>

pub fn visible_entry(&self, key: &K) -> Option<&LwwEntry<V>>

pub fn entries(&self) -> &BTreeMap<K, LwwEntry<V>>

pub fn removals(&self) -> &BTreeMap<K, LwwDot>

impl<K: Ord + Clone, V: Ord + Clone> LwwMap<K, V>

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

pub fn value(&self) -> BTreeMap<K, V>

Trait Implementations

impl<K: Clone + Ord, V: Clone + Ord> Clone for LwwMap<K, V>

fn clone(&self) -> LwwMap<K, V>

Returns a duplicate of the value. Read more

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

Performs copy-assignment from source. Read more

impl<K: Ord + Clone, V: Ord + Clone> Crdt for LwwMap<K, V>

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

Sets and removes may only assign their author’s dot. Losing operations with a matching author remain valid and are subsumed by the max-dot rule.

type Delta = LwwMapDelta<K, V>

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<K: Debug + Ord, V: Debug + Ord> Debug for LwwMap<K, V>

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

Formats the value using the given formatter. Read more

impl<K: Ord, V: Ord> Default for LwwMap<K, V>

fn default() -> Self

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

impl<K: Ord + Clone, V: Ord + Clone> Mergeable for LwwMap<K, V>

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

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

impl<K: PartialEq + Ord, V: PartialEq + Ord> PartialEq for LwwMap<K, V>

fn eq(&self, other: &LwwMap<K, V>) -> 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 LwwMap<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 LwwMap<u64, u64>

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

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

impl WireSchema for LwwMap<u64, u64>

const REQUIRES_ARITY: bool = false

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

Borrow fixed identities; return owned bytes for composed schemas.

impl<K: Eq + Ord, V: Eq + Ord> Eq for LwwMap<K, V>

impl<K: Ord, V: Ord> StructuralPartialEq for LwwMap<K, V>