Lines Matching refs:Hash
48 // initial_capacity is the size of the initial hash map;
56 // HashMap entries are (key, value, hash) triplets.
62 uint32_t hash; // The full hash value for key
69 // corresponding key, key hash, and NULL value.
71 Entry* Lookup(void* key, uint32_t hash, bool insert,
77 void* Remove(void* key, uint32_t hash);
79 // Empties the hash map (occupancy() == 0).
108 Entry* Probe(void* key, uint32_t hash);
132 void* key, uint32_t hash, bool insert, AllocationPolicy allocator) {
134 Entry* p = Probe(key, hash);
143 p->hash = hash;
150 p = Probe(key, hash);
162 void* TemplateHashMapImpl<AllocationPolicy>::Remove(void* key, uint32_t hash) {
164 Entry* p = Probe(key, hash);
204 Entry* r = map_ + (q->hash & (capacity_ - 1));
257 TemplateHashMapImpl<AllocationPolicy>::Probe(void* key, uint32_t hash) {
261 Entry* p = map_ + (hash & (capacity_ - 1));
266 while (p->key != NULL && (hash != p->hash || !match_(key, p->key))) {
302 Entry* entry = Lookup(p->key, p->hash, true, allocator);
314 // A hash map for pointer keys and values with an STL-like interface.
358 return Iterator(this, this->Lookup(key, key->Hash(), insert, allocator));
