HashTable< Key, Elem, hashtable_len > Class Template Reference

#include <hashtable.h>

List of all members.

template<class Key, class Elem, unsigned hashtable_len = DEFAULT_HASH_TABLE_LENGTH>
class HashTable< Key, Elem, hashtable_len >

Public Member Functions
	HashTable (HashFunc_t fnptr=0)
Elem *	Lookup (Key key)
Elem *	Insert (Key key, Elem &data, bool unique=true)
void	Remove (Key key)
unsigned	GetItemCount ()
Elem *	get_first_item ()
Elem *	get_next_item (Key prev_key, Elem &prev)
Classes
class	IntHashEntry
class	IntHashItem
class	IntHashLink

---

Constructor & Destructor Documentation

template<class Key, class Elem, unsigned hashtable_len = DEFAULT_HASH_TABLE_LENGTH>

HashTable< Key, Elem, hashtable_len >.HashTable

(

HashFunc_t

fnptr = 0

)

---

Member Function Documentation

template<class Key, class Elem, unsigned hashtable_len = DEFAULT_HASH_TABLE_LENGTH>

Elem* HashTable< Key, Elem, hashtable_len >.Lookup

(

Key

key

)

template<class Key, class Elem, unsigned hashtable_len = DEFAULT_HASH_TABLE_LENGTH>

Elem* HashTable< Key, Elem, hashtable_len >.Insert	(	Key	key,
		Elem &	data,
		bool	unique = true
	)

template<class Key, class Elem, unsigned hashtable_len = DEFAULT_HASH_TABLE_LENGTH>

void HashTable< Key, Elem, hashtable_len >.Remove

(

Key

key

)

template<class Key, class Elem, unsigned hashtable_len = DEFAULT_HASH_TABLE_LENGTH>

unsigned HashTable< Key, Elem, hashtable_len >.GetItemCount

(

)

template<class Key, class Elem, unsigned hashtable_len = DEFAULT_HASH_TABLE_LENGTH>

Elem* HashTable< Key, Elem, hashtable_len >.get_first_item

(

)

template<class Key, class Elem, unsigned hashtable_len = DEFAULT_HASH_TABLE_LENGTH>

Elem* HashTable< Key, Elem, hashtable_len >.get_next_item	(	Key	prev_key,
		Elem &	prev
	)

---

The documentation for this class was generated from the following file:

• hashtable.h

---