GraphLab: Distributed Graph-Parallel API
2.1
|
#include <graphlab/util/cuckoo_map.hpp>
Public Member Functions | |
cuckoo_map (key_type illegalkey, index_type stashsize=8, hasher const &h=hasher(), key_equal const &k=key_equal()) | |
cuckoo_map & | operator= (const cuckoo_map &other) |
const key_type & | illegal_key () const |
index_type | size () |
iterator | begin () |
iterator | end () |
const_iterator | begin () const |
const_iterator | end () const |
index_type | compute_hash (size_t k, const uint32_t seed) const |
void | rehash () |
void | reserve (size_t newlen) |
std::pair< iterator, bool > | insert (const value_type &v_) |
iterator | insert (const_iterator hint, value_type const &v) |
iterator | find (key_type const &k) |
const_iterator | find (key_type const &k) const |
size_t | count (key_type const &k) const |
void | erase (iterator iter) |
void | erase (key_type const &k) |
void | swap (cuckoo_map &other) |
mapped_type & | operator[] (const key_type &i) |
key_equal | key_eq () const |
void | clear () |
float | load_factor () const |
void | save (oarchive &oarc) const |
void | load (iarchive &iarc) |
Static Public Member Functions | |
static size_t | mix (size_t state) |
A cuckoo hash map which requires the user to provide an "illegal" value thus avoiding the need for a seperate bitmap. More or less similar interface as boost::unordered_map, not necessarily entirely STL compliant.
Definition at line 49 of file cuckoo_map.hpp.