crdt-kit 0.5.1

use alloc::collections::BTreeMap;

use crate::{Crdt, DeltaCrdt, NodeId};

/// A grow-only counter (G-Counter).
///
/// Each replica maintains its own count. The total value is the sum of all
/// replica counts. This counter can only be incremented, never decremented.
///
/// # Example
///
/// ```
/// use crdt_kit::prelude::*;
///
/// let mut c1 = GCounter::new(1);
/// c1.increment();
/// c1.increment();
///
/// let mut c2 = GCounter::new(2);
/// c2.increment();
///
/// c1.merge(&c2);
/// assert_eq!(c1.value(), 3);
/// ```
#[derive(Debug, Clone, PartialEq, Eq)]
#[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))]
pub struct GCounter {
    actor: NodeId,
    counts: BTreeMap<NodeId, u64>,
}

impl GCounter {
    /// Create a new G-Counter for the given node.
    pub fn new(actor: NodeId) -> Self {
        Self {
            actor,
            counts: BTreeMap::new(),
        }
    }

    /// Increment this replica's count by 1.
    pub fn increment(&mut self) {
        *self.counts.entry(self.actor).or_insert(0) += 1;
    }

    /// Increment this replica's count by `n`.
    pub fn increment_by(&mut self, n: u64) {
        *self.counts.entry(self.actor).or_insert(0) += n;
    }

    /// Get the total counter value across all replicas.
    #[must_use]
    pub fn value(&self) -> u64 {
        self.counts.values().sum()
    }

    /// Get this replica's node ID.
    #[must_use]
    pub fn actor(&self) -> NodeId {
        self.actor
    }

    /// Get the count for a specific node.
    #[must_use]
    pub fn count_for(&self, actor: NodeId) -> u64 {
        self.counts.get(&actor).copied().unwrap_or(0)
    }
}

impl Crdt for GCounter {
    fn merge(&mut self, other: &Self) {
        for (&actor, &count) in &other.counts {
            let entry = self.counts.entry(actor).or_insert(0);
            *entry = (*entry).max(count);
        }
    }
}

/// Delta for [`GCounter`]: only the entries where `self` is ahead of `other`.
#[derive(Debug, Clone, PartialEq, Eq)]
#[cfg_attr(feature = "serde", derive(serde::Serialize, serde::Deserialize))]
pub struct GCounterDelta {
    counts: BTreeMap<NodeId, u64>,
}

impl DeltaCrdt for GCounter {
    type Delta = GCounterDelta;

    fn delta(&self, other: &Self) -> GCounterDelta {
        let mut counts = BTreeMap::new();
        for (&actor, &self_count) in &self.counts {
            let other_count = other.counts.get(&actor).copied().unwrap_or(0);
            if self_count > other_count {
                counts.insert(actor, self_count);
            }
        }
        GCounterDelta { counts }
    }

    fn apply_delta(&mut self, delta: &GCounterDelta) {
        for (&actor, &count) in &delta.counts {
            let entry = self.counts.entry(actor).or_insert(0);
            *entry = (*entry).max(count);
        }
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn new_counter_is_zero() {
        let c = GCounter::new(1);
        assert_eq!(c.value(), 0);
    }

    #[test]
    fn increment_increases_value() {
        let mut c = GCounter::new(1);
        c.increment();
        assert_eq!(c.value(), 1);
        c.increment();
        assert_eq!(c.value(), 2);
    }

    #[test]
    fn increment_by() {
        let mut c = GCounter::new(1);
        c.increment_by(5);
        assert_eq!(c.value(), 5);
    }

    #[test]
    fn merge_takes_max() {
        let mut c1 = GCounter::new(1);
        c1.increment();
        c1.increment();

        let mut c2 = GCounter::new(1);
        c2.increment();

        c1.merge(&c2);
        assert_eq!(c1.value(), 2);
    }

    #[test]
    fn merge_different_actors() {
        let mut c1 = GCounter::new(1);
        c1.increment();

        let mut c2 = GCounter::new(2);
        c2.increment();
        c2.increment();

        c1.merge(&c2);
        assert_eq!(c1.value(), 3);
    }

    #[test]
    fn merge_is_commutative() {
        let mut c1 = GCounter::new(1);
        c1.increment();

        let mut c2 = GCounter::new(2);
        c2.increment();
        c2.increment();

        let mut left = c1.clone();
        left.merge(&c2);

        let mut right = c2.clone();
        right.merge(&c1);

        assert_eq!(left.value(), right.value());
    }

    #[test]
    fn merge_is_idempotent() {
        let mut c1 = GCounter::new(1);
        c1.increment();

        let mut c2 = GCounter::new(2);
        c2.increment();

        c1.merge(&c2);
        let after_first = c1.clone();
        c1.merge(&c2);

        assert_eq!(c1, after_first);
    }

    #[test]
    fn count_for_actor() {
        let mut c = GCounter::new(1);
        c.increment();
        c.increment();
        assert_eq!(c.count_for(1), 2);
        assert_eq!(c.count_for(2), 0);
    }

    #[test]
    fn delta_contains_only_new_entries() {
        let mut c1 = GCounter::new(1);
        c1.increment();
        c1.increment();

        let mut c2 = GCounter::new(2);
        c2.increment();

        let d = c1.delta(&c2);
        assert_eq!(d.counts.get(&1), Some(&2));
        assert!(!d.counts.contains_key(&2));
    }

    #[test]
    fn apply_delta_updates_state() {
        let mut c1 = GCounter::new(1);
        c1.increment();
        c1.increment();

        let mut c2 = GCounter::new(2);
        c2.increment();

        let d = c1.delta(&c2);
        c2.apply_delta(&d);
        assert_eq!(c2.value(), 3);
    }

    #[test]
    fn delta_is_empty_when_equal() {
        let mut c1 = GCounter::new(1);
        c1.increment();

        let c2 = c1.clone();
        let d = c1.delta(&c2);
        assert!(d.counts.is_empty());
    }

    #[test]
    fn delta_equivalent_to_full_merge() {
        let mut c1 = GCounter::new(1);
        c1.increment();
        c1.increment();

        let mut c2 = GCounter::new(2);
        c2.increment();

        let mut full = c2.clone();
        full.merge(&c1);

        let mut via_delta = c2.clone();
        let d = c1.delta(&c2);
        via_delta.apply_delta(&d);

        assert_eq!(full.value(), via_delta.value());
    }
}