Lines Matching defs:key
27 HashSetElement(const Key& key)
29 fKey(key)
43 size_t HashKey(const KeyType& key) const
44 { return key.GetHashCode(); }
47 bool Compare(const KeyType& key, const ValueType* value) const
48 { return value->fKey == key; }
130 status_t Add(const Key& key);
131 bool Remove(const Key& key);
133 bool Contains(const Key& key) const;
163 status_t Add(const Key& key)
168 return fSet.Add(key);
171 bool Remove(const Key& key)
176 return fSet.Remove(key);
185 bool Contains(const Key& key) const
191 return fSet.Contains(key);
249 HashSet<Key>::Add(const Key& key)
251 Element* element = fTable.Lookup(key);
257 // does not contain the key yet: create an element and add it
258 element = new(std::nothrow) Element(key);
273 HashSet<Key>::Remove(const Key& key)
275 Element* element = fTable.Lookup(key);
304 HashSet<Key>::Contains(const Key& key) const
306 return fTable.Lookup(key) != NULL;
329 HashSet<Key>::_FindElement(const Key& key) const
331 Element* element = fTable.FindFirst(key.GetHashCode());
332 while (element && element->fKey != key) {