consistent_hasher 0.1.5

An implementation of consistent hashing, a technique commonly used in distributed systems to map keys (such as data items or requests) to nodes (e.g., servers or storage units) in a way that minimizes disruptions when nodes are added or removed.
Documentation 
1
2
3
4
5
6
7
8
9

pub (crate) mod node;
pub(crate) mod circularbtreemap;
pub mod transaction;

pub mod ldb;
pub use ldb::LDB;
pub use ldb::Identifier;
pub use circularbtreemap::CircularBTreeMap;
pub use transaction::Transaction;