| D | hash_table.h | 63 class Partition {
65 Partition(Index size, const Hash& hasher);
69 void InsertAll(const Partition& src);
81 insertion_table_.reset(new Partition(kInitialHashBuckets, hasher_)); in hasher_()
102 std::unique_ptr<Partition> full_table_;
103 std::unique_ptr<Partition> insertion_table_;
108 HashTable<Key, T, Hash>::Partition::Partition(Index size, const Hash& hasher) in Partition() function
126 bool HashTable<Key, T, Hash>::Partition::Insert(T* value) { in Insert()
147 T* HashTable<Key, T, Hash>::Partition::Lookup(const Key& key, uint32_t hash_value) const { in Lookup()
163 void HashTable<Key, T, Hash>::Partition::InsertAll(const Partition& src) { in InsertAll()
[all …]
|