consist: Rust consistent hashing

Consistent Hashing is a technique invented by David Karger and colleagues in their 1997 paper Consistent Hashing and Random Trees.

consist is a simple library implementing a consistent hash ring. Hash rings are commonly used for sharding in distributed systems, and have been implemented as part of Varnish as well as in various client-side libraries for Redis, notably redis-rb.

It uses the btree_range feature, thus you need to build on nightly until its API is finalized.

Note: As of 24 Jan 2017, you need to be on at least the following versions:

$ rustc --version
rustc 1.16.0-nightly (7821a9b99 2017-01-23)

$ cargo --version
cargo 0.17.0-nightly (2324c2b 2017-01-21)

Filing PRs and issues is welcome.

• Crates.io
• Documentation
• Usage Examples