Lines Matching defs:value
43 size_t Hash(ValueType* value) const
45 return HashKey(value->bar);
48 bool Compare(KeyType key, ValueType* value) const
50 return value->bar == key;
53 ValueType*& GetLink(ValueType* value) const
55 return value->fNext;
170 status_t Insert(ValueType* value)
178 InsertUnchecked(value);
182 /*! \brief Inserts a value without resizing the table.
184 Use this method if you need to insert a value into the table while
187 void InsertUnchecked(ValueType* value)
189 if (CheckDuplicates && _ExhaustiveSearch(value)) {
191 panic("Hash Table: value already in table.");
193 debugger("Hash Table: value already in table.");
197 _Insert(fTable, fTableSize, value);
203 bool Remove(ValueType* value)
205 if (!RemoveUnchecked(value))
215 /*! \brief Removes a value without resizing the table.
217 Use this method if you need to remove a value from the table while
224 bool RemoveUnchecked(ValueType* value)
226 size_t index = fDefinition.Hash(value) & (fTableSize - 1);
233 if (value == slot) {
248 if (CheckDuplicates && _ExhaustiveSearch(value)) {
326 be \c NULL. It must be of size \a size, which must be a value returned
360 Iterator(const HashTable* table, size_t index, ValueType* value)
361 : fTable(table), fIndex(index), fNext(value) {}
426 void _Insert(ValueType** table, size_t tableSize, ValueType* value)
428 size_t index = fDefinition.Hash(value) & (tableSize - 1);
430 _Link(value) = table[index];
431 table[index] = value;
476 bool _ExhaustiveSearch(ValueType* value) const
481 if (bucket == value)