Lines Matching refs:Entry
37 using Entry = TemplateHashMapEntry<Key, Value>;
66 Entry* Lookup(const Key& key, uint32_t hash) const;
71 Entry* LookupOrInsert(const Key& key, uint32_t hash);
77 Entry* LookupOrInsert(const Key& key, uint32_t hash, const Func& value_func);
90 Entry* LookupOrInsert(const LookupKey& lookup_key, uint32_t hash,
93 Entry* InsertNew(const Key& key, uint32_t hash);
120 // for (Entry* p = map.Start(); p != nullptr; p = map.Next(p)) {
126 Entry* Start() const;
127 Entry* Next(Entry* entry) const;
135 Entry* map_end() const { return impl_.map_ + impl_.capacity_; }
137 Entry* Probe(const LookupKey& key, uint32_t hash) const;
138 Entry* FillEmptyEntry(Entry* entry, const Key& key, const Value& value,
178 Entry* map_ = nullptr;
200 impl_.map_ = impl_.allocator().template NewArray<Entry>(capacity());
201 memcpy(impl_.map_, original->impl_.map_, capacity() * sizeof(Entry));
213 typename TemplateHashMapImpl<Key, Value, MatchFun, AllocationPolicy>::Entry*
216 Entry* entry = Probe(key, hash);
222 typename TemplateHashMapImpl<Key, Value, MatchFun, AllocationPolicy>::Entry*
231 typename TemplateHashMapImpl<Key, Value, MatchFun, AllocationPolicy>::Entry*
241 typename TemplateHashMapImpl<Key, Value, MatchFun, AllocationPolicy>::Entry*
246 Entry* entry = Probe(lookup_key, hash);
256 typename TemplateHashMapImpl<Key, Value, MatchFun, AllocationPolicy>::Entry*
259 Entry* entry = Probe(key, hash);
268 Entry* p = Probe(key, hash);
292 Entry* q = p; // Start at the entry to remove.
308 Entry* r = impl_.map_ + (q->hash & (capacity() - 1));
337 typename TemplateHashMapImpl<Key, Value, MatchFun, AllocationPolicy>::Entry*
344 typename TemplateHashMapImpl<Key, Value, MatchFun, AllocationPolicy>::Entry*
346 Entry* entry) const {
347 const Entry* end = map_end();
360 typename TemplateHashMapImpl<Key, Value, MatchFun, AllocationPolicy>::Entry*
368 Entry* map = impl_.map_;
379 typename TemplateHashMapImpl<Key, Value, MatchFun, AllocationPolicy>::Entry*
381 Entry* entry, const Key& key, const Value& value, uint32_t hash) {
384 new (entry) Entry(key, value, hash);
401 impl_.map_ = impl_.allocator().template NewArray<Entry>(capacity);
413 Entry* old_map = impl_.map_;
421 for (Entry* entry = old_map; n > 0; entry++) {
423 Entry* new_entry = Probe(entry->key, entry->hash);
551 Iterator(const Base* map, typename Base::Entry* entry)
555 typename Base::Entry* entry_;