Lines Matching defs:key
13 /** A set that contains pointers to instances of T. Instances can be looked up with key Key.
14 * Multiple (possibly same) values can have the same key.
24 static uint32_t Hash(const Key& key) { return HashTraits::Hash(key); }
48 void insert(const Key& key, T* value) {
49 ValueList* list = fHash.find(key);
66 void remove(const Key& key, const T* value) {
67 ValueList* list = fHash.find(key);
79 this->internalRemove(prev, list, key);
89 this->internalRemove(prev, list, key);
94 T* find(const Key& key) const {
95 ValueList* list = fHash.find(key);
103 T* find(const Key& key, const FindPredicate f) {
104 ValueList* list = fHash.find(key);
115 T* findAndRemove(const Key& key, const FindPredicate f) {
116 ValueList* list = fHash.find(key);
122 this->internalRemove(prev, list, key);
143 bool has(const T* value, const Key& key) const {
144 for (ValueList* list = fHash.find(key); list; list = list->fNext) {
153 int countForKey(const Key& key) const {
155 ValueList* list = fHash.find(key);
168 void internalRemove(ValueList* prev, ValueList* elem, const Key& key) {
178 fHash.remove(key);