Struct VectorClock 

pub struct VectorClock<const N: usize> {
    pub clock: [u64; N],
}

Per-node monotonic counters. N is the number of nodes in the system; clock[i] is node i’s observed event count. Causal ordering: a causally precedes b when every component of a is <= the corresponding component of b, with at least one strict less-than.

Fields

clock: [u64; N]

Implementations

impl<const N: usize> VectorClock<N>

pub const fn zero() -> Self

pub fn increment(&mut self, node_idx: usize)

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

Causal-order check: returns Less when self happens-before other (every component <= and at least one <), Greater when other happens-before self, Equal when identical, None when concurrent (incomparable).

pub fn merge(&self, other: &Self) -> Self

Trait Implementations

impl<const N: usize> Clone for VectorClock<N>

fn clone(&self) -> VectorClock<N>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<const N: usize> Copy for VectorClock<N>

impl<const N: usize> Debug for VectorClock<N>

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

Formats the value using the given formatter.

impl<const N: usize> Eq for VectorClock<N>

impl<const N: usize> Hash for VectorClock<N>

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<const N: usize> PartialEq for VectorClock<N>

fn eq(&self, other: &VectorClock<N>) -> bool

Equality operator ==.

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

Inequality operator !=.

impl<const N: usize> StructuralPartialEq for VectorClock<N>