tools/fs_shell/OpenHashTable.h

36 		typedef	Foo		ValueType;
43 		size_t Hash(ValueType* value) const
48 		bool Compare(KeyType key, ValueType* value) const
53 		ValueType*& GetLink(ValueType* value) const
80  * The link between entries is part of the ValueType stored items, which makes
90 	typedef typename Definition::ValueType	ValueType;
153 	ValueType* Lookup(typename TypeOperation<KeyType>::ConstRefT key) const
159 		ValueType* slot = fTable[index];
170 	status_t Insert(ValueType* value)
187 	void InsertUnchecked(ValueType* value)
201 	// TODO: a ValueType* Remove(const KeyType& key) method is missing
203 	bool Remove(ValueType* value)
224 	bool RemoveUnchecked(ValueType* value)
227 		ValueType* previous = NULL;
228 		ValueType* slot = fTable[index];
231 			ValueType* next = _Link(slot);
266 	ValueType* Clear(bool returnElements = false)
271 		ValueType* result = NULL;
274 			ValueType** nextPointer = &result;
278 				ValueType* element = fTable[i];
293 		memset(this->fTable, 0, sizeof(ValueType*) * this->fTableSize);
322 		return size * sizeof(ValueType*);
343 		_Resize((ValueType**)allocation, size / sizeof(ValueType*), oldTable);
360 		Iterator(const HashTable* table, size_t index, ValueType* value)
365 		ValueType* Next()
367 			ValueType* current = fNext;
394 		ValueType* fNext;
408 		ValueType* slot = fTable[index];
426 	void _Insert(ValueType** table, size_t tableSize, ValueType* value)
436 		ValueType** newTable
437 			= (ValueType**)fAllocator.Allocate(sizeof(ValueType*) * newSize);
445 	void _Resize(ValueType** newTable, size_t newSize, void** _oldTable = NULL)
452 				ValueType* bucket = fTable[i];
454 					ValueType* next = _Link(bucket);
471 	ValueType*& _Link(ValueType* bucket) const
476 	bool _ExhaustiveSearch(ValueType* value) const
479 			ValueType* bucket = fTable[i];
494 	ValueType**		fTable;