Lines Matching defs:key
33 HashMapElement(const Key& key, const Value& value)
35 fKey(key),
53 size_t HashKey(const KeyType& key) const
54 { return key.GetHashCode(); }
57 bool Compare(const KeyType& key, const ValueType* value) const
58 { return value->fKey == key; }
71 Entry(const Key& key, Value value) : key(key), value(value) {}
73 Key key;
135 status_t Put(const Key& key, const Value& value);
136 Value Remove(const Key& key);
139 Value Get(const Key& key) const;
140 bool Get(const Key& key, Value*& _value) const;
142 bool ContainsKey(const Key& key) const;
173 status_t Put(const Key& key, const Value& value)
178 return fMap.Put(key, value);
181 Value Remove(const Key& key)
186 return fMap.Remove(key);
203 Value Get(const Key& key) const
209 return fMap.Get(key);
212 bool ContainsKey(const Key& key) const
218 return fMap.ContainsKey(key);
376 HashMap<Key, Value>::Put(const Key& key, const Value& value)
378 Element* element = fTable.Lookup(key);
380 // already contains the key: just set the new value
385 // does not contain the key yet: create an element and add it
386 element = new(std::nothrow) Element(key, value);
401 HashMap<Key, Value>::Remove(const Key& key)
403 Element* element = fTable.Lookup(key);
452 HashMap<Key, Value>::Get(const Key& key) const
454 if (Element* element = fTable.Lookup(key))
463 HashMap<Key, Value>::Get(const Key& key, Value*& _value) const
465 if (Element* element = fTable.Lookup(key)) {
476 HashMap<Key, Value>::ContainsKey(const Key& key) const
478 return fTable.Lookup(key) != NULL;