libmoost
|
#include <boost/random/mersenne_twister.hpp>
#include "partitioner.hpp"
#include <vector>
#include <algorithm>
#include <limits>
Go to the source code of this file.
Classes | |
class | moost::algorithm::ketama_partitioner< T > |
ketama_partitioner implements consistent hashing, such that the addition or removal of buckets does not significantly change the mapping of keys to buckets. By using consistent hashing, only K/n keys need to be remapped on average, where K is the number of keys, and n is the number of buckets. More... | |
struct | moost::algorithm::ketama_partitioner< T >::bucket_hash |
Namespaces | |
namespace | moost |
Creates a unique temporary directory; removed on scope exit. | |
namespace | moost::algorithm |