Lines Matching defs:key
112 Address key = keys_[next_index];
113 if (key == not_mapped) break;
115 int expected_index = Hash(key) & mask_;
133 int IdentityMapBase::Lookup(Address key) const {
134 uint32_t hash = Hash(key);
135 int index = ScanKeysFor(key, hash);
139 index = ScanKeysFor(key, hash);
144 std::pair<int, bool> IdentityMapBase::LookupOrInsert(Address key) {
145 uint32_t hash = Hash(key);
147 int index = ScanKeysFor(key, hash);
152 std::tie(index, already_exists) = InsertKey(key, hash);
165 // Searches this map for the given key using the object's address
170 Address key) {
173 return {InsertEntry(key), false};
175 auto lookup_result = LookupOrInsert(key);
179 // Searches this map for the given key using the object's address
183 IdentityMapBase::RawEntry IdentityMapBase::FindEntry(Address key) const {
184 // Don't allow find by key while iterable (might rehash).
187 int index = Lookup(key);
191 // Inserts the given key using the object's address as the identity, returning
193 IdentityMapBase::RawEntry IdentityMapBase::InsertEntry(Address key) {
194 // Don't allow find by key while iterable (might rehash).
218 std::tie(index, already_exists) = InsertKey(key, Hash(key));
223 // Deletes the given key from the map using the object's address as the
224 // identity, returning true iff the key was found (in which case, the value
226 bool IdentityMapBase::DeleteEntry(Address key, uintptr_t* deleted_value) {
227 CHECK(!is_iterable()); // Don't allow deletion by key while iterable.
229 int index = Lookup(key);
288 // Reinsert all the key/value pairs that were in the wrong place.
298 // Resize the internal storage and reinsert all the key/value pairs.