haiku/headers/private/kernel/util/MultiHashTable.h

/*
 * Copyright 2007, Hugo Santos. All Rights Reserved.
 * Distributed under the terms of the MIT License.
 *
 * Authors:
 *      Hugo Santos, hugosantos@gmail.com
 */


#ifndef _MULTI_HASH_TABLE_H_
#define _MULTI_HASH_TABLE_H_

#include <KernelExport.h>
#include <util/kernel_cpp.h>
#include <util/OpenHashTable.h>

// MultiHashTable is a container which acts a bit like multimap<>
// but with hash table semantics.

// refer to OpenHashTable.h for how to use this container.

template<typename Definition, bool AutoExpand = true,
	bool CheckDuplicates = false>
class MultiHashTable : private OpenHashTable<Definition,
	AutoExpand, CheckDuplicates> {
public:
	typedef OpenHashTable<Definition, AutoExpand, CheckDuplicates> HashTable;
	typedef MultiHashTable<Definition, AutoExpand, CheckDuplicates> MultiTable;

	typedef typename HashTable::Iterator Iterator;
	typedef typename Definition::KeyType KeyType;
	typedef typename Definition::ValueType ValueType;

	MultiHashTable(size_t initialSize = HashTable::kMinimumSize)
		: HashTable(initialSize) {}

	MultiHashTable(typename Definition::ParentType *parent,
		size_t initialSize = HashTable::kMinimumSize)
		: HashTable(parent, initialSize) {}

	status_t InitCheck() const { return HashTable::InitCheck(); }

	Iterator Lookup(const KeyType &key) const
	{
		size_t index = HashTable::fDefinition.HashKey(key)
			& (HashTable::fTableSize - 1);
		ValueType *slot = HashTable::fTable[index];

		while (slot) {
			if (HashTable::fDefinition.Compare(key, slot))
				break;
			slot = HashTable::_Link(slot)->fNext;
		}

		if (slot == NULL)
			return Iterator(this, HashTable::fTableSize, NULL);

		return Iterator(this, index, slot);
	}

	void Insert(ValueType *value)
	{
		if (AutoExpand
			&& HashTable::fItemCount >= (HashTable::fTableSize * 200 / 256))
			_Resize(HashTable::fTableSize * 2);

		InsertUnchecked(value);
	}

	void InsertUnchecked(ValueType *value)
	{
		_Insert(HashTable::fTable, HashTable::fTableSize, value);
		HashTable::fItemCount++;
	}

	bool Remove(ValueType *value)
	{
		if (!HashTable::RemoveUnchecked(value))
			return false;

		if (AutoExpand && HashTable::fTableSize > HashTable::kMinimumSize
			&& HashTable::fItemCount < (HashTable::fTableSize * 50 / 256))
			_Resize(HashTable::fTableSize / 2);

		return true;
	}

private:
	void _Insert(ValueType **table, size_t tableSize, ValueType *value)
	{
		size_t index = HashTable::fDefinition.Hash(value) & (tableSize - 1);

		ValueType *previous;

		// group values with the same key
		for (previous = table[index]; previous
				&& !HashTable::fDefinition.CompareValues(previous, value);
				previous = HashTable::_Link(previous)->fNext);

		if (previous) {
			_Link(value)->fNext = _Link(previous)->fNext;
			_Link(previous)->fNext = value;
		} else {
			_Link(value)->fNext = table[index];
			table[index] = value;
		}
	}

	// TODO use OpenHashTable's _Resize
	bool _Resize(size_t newSize)
	{
		ValueType **newTable = new ValueType *[newSize];
		if (newTable == NULL)
			return false;

		for (size_t i = 0; i < newSize; i++)
			newTable[i] = NULL;

		if (HashTable::fTable) {
			for (size_t i = 0; i < HashTable::fTableSize; i++) {
				ValueType *bucket = HashTable::fTable[i];
				while (bucket) {
					ValueType *next = _Link(bucket)->fNext;
					_Insert(newTable, newSize, bucket);
					bucket = next;
				}
			}

			delete [] HashTable::fTable;
		}

		HashTable::fTableSize = newSize;
		HashTable::fTable = newTable;
		return true;
	}
};

#endif