Lines Matching refs:table
74 /** Implements an hash table with open hashing, that is, colliding entries are
75 * stored in a linked list. The table may be made to adjust its number of slots
81 * sure the table can always accept new items and will never fail because it is
182 /*! \brief Inserts a value without resizing the table.
184 Use this method if you need to insert a value into the table while
191 panic("Hash Table: value already in table.");
193 debugger("Hash Table: value already in table.");
215 /*! \brief Removes a value without resizing the table.
217 Use this method if you need to remove a value from the table while
222 table again.
260 /*! \brief Removes all elements from the hash table.
263 is \c true, the method returns all elements chained via their hash table
299 /*! If the table needs resizing, the number of bytes for the required
306 // grow table
312 // shrink table
325 /*! Resizes the table using the given allocation. The allocation must not
332 If \a oldTable is non-null and resizing is successful, the old table
350 the table, unless the removal triggers a resize.
354 Iterator(const HashTable* table)
355 : fTable(table)
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)
430 _Link(value) = table[index];
431 table[index] = value;