Implementation of a consistent choose k hashing algorithm.
It returns k distinct consistent hashes in the range 0..n.
The hashes are consistent when n changes and when k changes!
I.e. one hash changes with probability k/(n+1) when n increases by one,
resp. one hash gets added when k is increased. Additionally, the returned k tuple
is guaranteed to be uniformly chosen from all possible n-choose-k tuples.
Wrapper around ConsistentHashIterator and ConsistentHashRevIterator to compute
the next or previous consistent hash for a given key for a given number of nodes n.
Reservoir of size k whose contents track the consistent top-k
by ConsistentPermutation rank, with explicit support for
growing the universe one Feistel layer at a time.
A trait for building a special bit mask and sequences of hashes for different bit positions.
Note: the hasher must have been seeded with the key during construction.
A trait which behaves like a pseudo-random number generator.
It is used to generate consistent hashes within one bucket.
Note: the hasher must have been seeded with the key during construction.