Struct LWWRegister 

pub struct LWWRegister<T: Ord + Clone, K: Ord + Clone> { /* private fields */ }

A Last-Write-Wins Register CRDT

Stores a value along with a timestamp and replica ID. The value with the highest timestamp (tie-break on replica_id) always wins.

Implementations

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

pub fn new(replica_id: K) -> Self

Create a new LWW Register with no value

pub fn set(&mut self, value: T, timestamp: u64, replica_id: K)

Set a new value with the given timestamp

pub fn get(&self) -> Option<&T>

Get the current value if it exists

pub fn timestamp(&self) -> u64

Get the timestamp of the current value

pub fn replica_id(&self) -> &K

Get the replica ID that wrote the current value

pub fn is_empty(&self) -> bool

Check if the register is empty (no value set)

pub fn clear(&mut self)

Clear the register (set to empty state)

Trait Implementations

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

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug + Ord + Clone, K: Debug + Ord + Clone> Debug for LWWRegister<T, K>

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

Formats the value using the given formatter.

impl<T: Ord + Clone, K: Ord + Clone + Default> Default for LWWRegister<T, K>

fn default() -> Self

Returns the “default value” for a type.

impl<'de, T, K> Deserialize<'de> for LWWRegister<T, K>

where T: Deserialize<'de> + Ord + Clone, K: Deserialize<'de> + Ord + Clone,

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T: Ord + Clone, K: Ord + Clone + Default> Lattice for LWWRegister<T, K>

fn join(&self, other: &Self) -> Self

Join operation: keep the value with the highest timestamp Tie-break on replica_id (higher wins), then on value (higher wins)

fn bottom() -> Self

The bottom element (identity for join)

fn partial_cmp_lattice(&self, other: &Self) -> Option<Ordering>

Partial order derived from join: a ≤ b iff a ⊔ b = b

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

Check if self ≤ other in the lattice order

fn join_assign(&mut self, other: &Self)

Join-assign: self = self ⊔ other

impl<T: PartialEq + Ord + Clone, K: PartialEq + Ord + Clone> PartialEq for LWWRegister<T, K>

fn eq(&self, other: &LWWRegister<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<T, K> Serialize for LWWRegister<T, K>

where T: Serialize + Ord + Clone, K: Serialize + Ord + Clone,

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 + Clone, K: Eq + Ord + Clone> Eq for LWWRegister<T, K>

impl<T: Ord + Clone, K: Ord + Clone> StructuralPartialEq for LWWRegister<T, K>