Lines Matching refs:value
33 HashMapElement(const Key& key, const Value& value)
36 fValue(value),
55 size_t Hash(const ValueType* value) const
56 { return HashKey(value->fKey); }
57 bool Compare(const KeyType& key, const ValueType* value) const
58 { return value->fKey == key; }
59 ValueType*& GetLink(ValueType* value) const
60 { return value->fNext; }
71 Entry(const Key& key, Value value) : key(key), value(value) {}
74 Value value;
135 status_t Put(const Key& key, const Value& value);
173 status_t Put(const Key& key, const Value& value)
178 return fMap.Put(key, value);
247 HashKey32(const Value& value) : value(value) {}
251 return (uint32)value;
256 value = other.value;
262 return (value == other.value);
267 return (value != other.value);
270 Value value;
278 HashKey64(const Value& value) : value(value) {}
282 uint64 v = (uint64)value;
288 value = other.value;
294 return (value == other.value);
299 return (value != other.value);
302 Value value;
310 HashKeyPointer(const Value& value) : value(value) {}
315 return (uint32)(addr_t)value;
317 uint64 v = (uint64)(addr_t)value;
326 value = other.value;
332 return (value == other.value);
337 return (value != other.value);
340 Value value;
376 HashMap<Key, Value>::Put(const Key& key, const Value& value)
380 // already contains the key: just set the new value
381 element->fValue = value;
386 element = new(std::nothrow) Element(key, value);
408 Value value = element->fValue;
411 return value;
424 Value value = element->fValue;
430 return value;