#include <probing_hash_table.hh>
Public Member Functions | |
| DivMod (std::size_t buckets) | |
| template<class It > | |
| It | Ideal (It begin, uint64_t hash) const |
| template<class BaseIt , class OutIt > | |
| void | Next (BaseIt begin, BaseIt end, OutIt &it) const |
| void | Double () |
Static Public Member Functions | |
| static std::size_t | RoundBuckets (std::size_t from) |
Definition at line 29 of file probing_hash_table.hh.
| util::DivMod::DivMod | ( | std::size_t | buckets | ) | [inline, explicit] |
Definition at line 31 of file probing_hash_table.hh.
| void util::DivMod::Double | ( | ) | [inline] |
Definition at line 45 of file probing_hash_table.hh.
Referenced by util::ProbingHashTable< ProbingVocabularyEntry, util::IdentityHash >::Double().

| It util::DivMod::Ideal | ( | It | begin, | |
| uint64_t | hash | |||
| ) | const [inline] |
Definition at line 37 of file probing_hash_table.hh.
Referenced by util::ProbingHashTable< ProbingVocabularyEntry, util::IdentityHash >::Ideal().

| void util::DivMod::Next | ( | BaseIt | begin, | |
| BaseIt | end, | |||
| OutIt & | it | |||
| ) | const [inline] |
Definition at line 41 of file probing_hash_table.hh.
Referenced by util::ProbingHashTable< ProbingVocabularyEntry, util::IdentityHash >::FindFromIdeal(), util::ProbingHashTable< ProbingVocabularyEntry, util::IdentityHash >::FindOrInsert(), util::ProbingHashTable< ProbingVocabularyEntry, util::IdentityHash >::MustFind(), util::ProbingHashTable< ProbingVocabularyEntry, util::IdentityHash >::UnsafeMutableFind(), and util::ProbingHashTable< ProbingVocabularyEntry, util::IdentityHash >::UnsafeMutableMustFind().

| static std::size_t util::DivMod::RoundBuckets | ( | std::size_t | from | ) | [inline, static] |
Definition at line 33 of file probing_hash_table.hh.
1.5.9