Struct PNCounter 

pub struct PNCounter<K: Ord + Clone> { /* private fields */ }

A Positive-Negative Counter CRDT

Supports both increment and decrement by maintaining two separate counters. Value = sum(increments) - sum(decrements)

Implementations

impl<K: Ord + Clone> PNCounter<K>

pub fn new() -> Self

Create a new PN-Counter

pub fn increment(&mut self, replica_id: K, amount: u64)

Increment the counter for a specific replica

pub fn decrement(&mut self, replica_id: K, amount: u64)

Decrement the counter for a specific replica

pub fn value(&self) -> i64

Get the current value (sum of increments - sum of decrements)

pub fn get_increment(&self, replica_id: &K) -> u64

Get the increment counter for a replica

pub fn get_decrement(&self, replica_id: &K) -> u64

Get the decrement counter for a replica

pub fn increments(&self) -> &BTreeMap<K, u64>

Get a reference to all increment counters

pub fn decrements(&self) -> &BTreeMap<K, u64>

Get a reference to all decrement counters

Trait Implementations

impl<K: Clone + Ord + Clone> Clone for PNCounter<K>

fn clone(&self) -> PNCounter<K>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug + Ord + Clone> Debug for PNCounter<K>

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

Formats the value using the given formatter.

impl<K: Ord + Clone> Default for PNCounter<K>

fn default() -> Self

Returns the “default value” for a type.

impl<'de, K> Deserialize<'de> for PNCounter<K>

where 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<K: Ord + Clone> Lattice for PNCounter<K>

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

Join operation performs component-wise max on both counters This ensures that concurrent updates always converge to the same value

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<K: PartialEq + Ord + Clone> PartialEq for PNCounter<K>

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

where 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<K: Eq + Ord + Clone> Eq for PNCounter<K>

impl<K: Ord + Clone> StructuralPartialEq for PNCounter<K>