Include dependency graph for HashTable.H:

This graph shows which files directly or indirectly include this file:

Classes
class	List< T >
	A 1D array of objects of type <T>, where the size of the vector is known and used for subscript bounds checking, etc. More...

class	UList< T >
	A 1D vector of objects of type <T>, where the size of the vector is known and can be used for subscript bounds checking, etc. More...

class	UPtrList< T >
	A list of pointers to objects of type <T>, without allocation/deallocation management of the pointers - this is to be done elsewhere. The operator[] returns a reference to the object (not the pointer). More...

class	FixedList< T, N >
	A 1D vector of objects of type <T> with a fixed length <N>. More...

class	HashTable< T, Key, Hash >
	A HashTable similar to `std::unordered_map`. More...

class	HashTable< T, Key, Hash >
	A HashTable similar to `std::unordered_map`. More...

class	HashTable< T, Key, Hash >::Iterator< Const >
	Internally used base for iterator and const_iterator. More...

class	HashTable< T, Key, Hash >::Iterator< Const >
	Internally used base for iterator and const_iterator. More...

class	HashTable< T, Key, Hash >::iterator
	Forward iterator with non-const access. More...

class	HashTable< T, Key, Hash >::const_iterator
	Forward iterator with const access. More...

class	HashTable< T, Key, Hash >::key_iterator_base< Iter >
	An iterator wrapper for returning a reference to the key. More...

Functions
template<class T , class Key , class Hash >
Istream &	operator>> (Istream &, HashTable< T, Key, Hash > &)

template<class T , class Key , class Hash >
Ostream &	operator<< (Ostream &, const HashTable< T, Key, Hash > &)

Detailed Description

Original source file HashTable.H

Definition in file HashTable.H.

Classes