Lines Matching full:hash
43 // initial_capacity is the size of the initial hash map;
49 // HashMap entries are (key, value, hash) triplets.
55 uint32_t hash; // the full hash value for key
61 // corresponding key, key hash, and NULL value.
63 Entry* Lookup(void* key, uint32_t hash, bool insert);
66 void Remove(void* key, uint32_t hash);
68 // Empties the hash map (occupancy() == 0).
97 Entry* Probe(void* key, uint32_t hash);
120 void* key, uint32_t hash, bool insert) {
122 Entry* p = Probe(key, hash);
131 p->hash = hash;
137 p = Probe(key, hash);
149 void TemplateHashMapImpl<P>::Remove(void* key, uint32_t hash) {
151 Entry* p = Probe(key, hash);
190 Entry* r = map_ + (q->hash & (capacity_ - 1));
241 uint32_t hash) {
245 Entry* p = map_ + (hash & (capacity_ - 1));
250 while (p->key != NULL && (hash != p->hash || !match_(key, p->key))) {
285 Lookup(p->key, p->hash, true)->value = p->value;
295 // A hash map for pointer keys and values with an STL-like interface.
334 return Iterator(this, this->Lookup(key, key->Hash(), insert));
