convergent 0.1.0

Lightweight, composable CRDTs for decentralized systems
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32

//! # Convergent
//!
//! Lightweight, composable CRDTs (Conflict-Free Replicated Data Types)
//! for decentralized systems.
//!
//! CRDTs are data structures that can be replicated across nodes,
//! modified independently, and merged with a mathematically guaranteed
//! consistent result — no central coordination required.
//!
//! ## Available types
//!
//! | Type | Description |
//! |------|-------------|
//! | [`GCounter`] | Grow-only counter |
//! | [`PNCounter`] | Positive-Negative counter |
//! | [`LWWRegister`] | Last-Writer-Wins register (uses HLC timestamps) |
//! | [`ORSet`] | Observed-Remove set |
//!
//! Every type implements the [`Merge`] trait, which guarantees
//! commutativity, associativity, and idempotence.

mod gcounter;
mod lww_register;
mod merge;
mod or_set;
mod pncounter;

pub use gcounter::GCounter;
pub use lww_register::LWWRegister;
pub use merge::Merge;
pub use or_set::ORSet;
pub use pncounter::PNCounter;