#include <elm/data/HashTable.h>

Inheritance diagram for HashTable< T, H, A >:

Classes
class	Iter

Public Types
typedef HashTable< T, H, A >	self_t

Public Member Functions
	HashTable (int _size=211)

	HashTable (const self_t &h)

	~HashTable (void)

const H &	hash () const

H &	hash ()

const A &	allocator () const

A &	allocator ()

const T *	get (const T &key) const

const T *	get_const (const T &key) const

bool	hasKey (const T &key) const

bool	hasKey_const (const T &key) const

bool	exists (const T &key) const

bool	exists_const (const T &key) const

void	put (const T &data)

template<class CC >
void	putAll (const CC &c)

bool	isEmpty (void) const

	operator bool () const

int	count (void) const

bool	contains (const T &x) const

bool	contains_const (const T &x) const

template<class CC >
bool	containsAll (const CC &c) const

template<class CC >
bool	containsAll_const (const CC &c) const

Iter	begin () const

Iter	end () const

bool	equals (const HashTable< T > &h) const

bool	equals_const (const HashTable< T > &h) const

bool	operator== (const HashTable< T > &t) const

bool	operator!= (const HashTable< T > &t) const

void	clear (void)

T *	add (const T &data)

self_t &	operator+= (const T &x)

template<class C >
void	addAll (const C &c)

void	remove (const T &key)

template<class C >
void	removeAll (const C &c)

self_t &	operator-= (const T &x)

void	remove (const Iter &i)

void	copy (const HashTable< T, H > &t)

self_t &	operator= (const HashTable< T, H > &c)

T *	get (const T &key)

Public Member Functions inherited from HashKey< T >
t::hash	computeHash (const T &key) const

bool	isEqual (const T &key1, const T &key2) const

Public Member Functions inherited from DefaultAllocatorDelegate
t::ptr	allocate (t::size size) const

void	free (t::ptr p) const

template<class T >
T *	alloc () const

Protected Member Functions
node_t *	find (const T &key) const

node_t *	find_const (const T &key) const

Additional Inherited Members
Static Public Member Functions inherited from HashKey< T >
static t::hash	hash (const T &key)

static bool	equals (const T &key1, const T &key2)

Detailed Description

template<class T, class H = HashKey<T>, class A = DefaultAlloc>
class elm::HashTable< T, H, A >

This class provides an hashing table implementation as an array of linked list. A small caching feature put to the head of the linked list last accessed items.

This class is the basic implementation of hash table. To use it as a map, refer to HashMap. To use it as a set, refer to HashSet.

Parameters

T	Type of stored data.
A	Adapter to access key information (must implement concept::Adapter).
M	Manager of the hash table providing hashing and allocation services.

Deprecated:: Use HashMap instead.

Member Typedef Documentation

◆ self_t

typedef HashTable<T, H, A> self_t

Constructor & Destructor Documentation

◆ HashTable() [1/2]

HashTable ( int size = 211 )

inline

Build an hash table with the given size. Improved efficiency is obtained with prime number as sizes.

Parameters

size	Table size (default to 211).

◆ HashTable() [2/2]

HashTable ( const self_t & h )

inline

◆ ~HashTable()

~HashTable ( void )

inline

Member Function Documentation

◆ add()

T* add ( const T & data )

inline

Referenced by HashMap< elm::CString, void * >::add(), HashTable< Pair< const void *, bool >, AssocHashKey< const void *, bool, HashKey< const void * > >, DefaultAlloc >::addAll(), HashMap< elm::CString, void * >::fetch(), HashTable< Pair< const void *, bool >, AssocHashKey< const void *, bool, HashKey< const void * > >, DefaultAlloc >::operator+=(), and HashTable< Pair< const void *, bool >, AssocHashKey< const void *, bool, HashKey< const void * > >, DefaultAlloc >::put().

◆ addAll()

void addAll ( const C & c )

inline

◆ allocator() [1/2]

A& allocator ( )

inline

◆ allocator() [2/2]

const A& allocator ( ) const

inline

Referenced by HashSet< T, H, A >::allocator(), and HashMap< elm::CString, void * >::allocator().

◆ begin()

Iter begin ( ) const

inline

◆ clear()

void clear ( void )

inline

Remove all items of the table.

Referenced by HashMap< elm::CString, void * >::clear(), HashSet< T, H, A >::clear(), HashTable< Pair< const void *, bool >, AssocHashKey< const void *, bool, HashKey< const void * > >, DefaultAlloc >::copy(), and HashTable< Pair< const void *, bool >, AssocHashKey< const void *, bool, HashKey< const void * > >, DefaultAlloc >::~HashTable().

◆ contains()

bool contains ( const T & x ) const

inline

Referenced by HashTable< Pair< const void *, bool >, AssocHashKey< const void *, bool, HashKey< const void * > >, DefaultAlloc >::containsAll().

◆ contains_const()

bool contains_const ( const T & x ) const

inline

Referenced by HashTable< Pair< const void *, bool >, AssocHashKey< const void *, bool, HashKey< const void * > >, DefaultAlloc >::containsAll_const().

◆ containsAll()

bool containsAll ( const CC & c ) const

inline

Referenced by HashTable< Pair< const void *, bool >, AssocHashKey< const void *, bool, HashKey< const void * > >, DefaultAlloc >::equals().

◆ containsAll_const()

bool containsAll_const ( const CC & c ) const

inline

Referenced by HashTable< Pair< const void *, bool >, AssocHashKey< const void *, bool, HashKey< const void * > >, DefaultAlloc >::equals_const().

◆ copy()

void copy ( const HashTable< T, H > & t )

inline

Referenced by HashSet< T, H, A >::copy(), and HashTable< Pair< const void *, bool >, AssocHashKey< const void *, bool, HashKey< const void * > >, DefaultAlloc >::operator=().

◆ count()

int count ( void ) const

inline

Count the number of items in the table.

Returns: Count of items.

Referenced by HashSet< T, H, A >::count(), and HashMap< elm::CString, void * >::count().

◆ end()

Iter end ( ) const

inline

◆ equals()

bool equals ( const HashTable< T > & h ) const

inline

Referenced by HashSet< T, H, A >::equals(), HashTable< Pair< const void *, bool >, AssocHashKey< const void *, bool, HashKey< const void * > >, DefaultAlloc >::operator!=(), and HashTable< Pair< const void *, bool >, AssocHashKey< const void *, bool, HashKey< const void * > >, DefaultAlloc >::operator==().

◆ equals_const()

bool equals_const ( const HashTable< T > & h ) const

inline

◆ exists()

bool exists ( const T & key ) const

inline

Same as hasKey().

◆ exists_const()

bool exists_const ( const T & key ) const

inline

◆ find()

node_t* find ( const T & key ) const

inlineprotected

◆ find_const()

node_t* find_const ( const T & key ) const

inlineprotected

Referenced by HashTable< Pair< const void *, bool >, AssocHashKey< const void *, bool, HashKey< const void * > >, DefaultAlloc >::contains_const(), HashTable< Pair< const void *, bool >, AssocHashKey< const void *, bool, HashKey< const void * > >, DefaultAlloc >::get_const(), and HashTable< Pair< const void *, bool >, AssocHashKey< const void *, bool, HashKey< const void * > >, DefaultAlloc >::hasKey_const().

◆ get() [1/2]

T* get ( const T & key )

inline

◆ get() [2/2]

const T* get ( const T & key ) const

inline

Referenced by HashMap< elm::CString, void * >::fetch(), HashMap< elm::CString, void * >::get(), and HashMap< elm::CString, void * >::operator[]().

◆ get_const()

const T* get_const ( const T & key ) const

inline

Referenced by HashMap< elm::CString, void * >::get_const().

◆ hash() [1/2]

H& hash ( )

inline

◆ hash() [2/2]

const H& hash ( ) const

inline

Referenced by HashSet< T, H, A >::hash(), and HashMap< elm::CString, void * >::hash().

◆ hasKey()

bool hasKey ( const T & key ) const

inline

Test if a key is in the table.

Parameters

key	Tested key.

Returns: True if there is an item in the table with the given key, false else.

Referenced by HashSet< T, H, A >::contains(), HashTable< Pair< const void *, bool >, AssocHashKey< const void *, bool, HashKey< const void * > >, DefaultAlloc >::exists(), and HashMap< elm::CString, void * >::hasKey().

◆ hasKey_const()

bool hasKey_const ( const T & key ) const

inline

Referenced by HashTable< Pair< const void *, bool >, AssocHashKey< const void *, bool, HashKey< const void * > >, DefaultAlloc >::exists_const(), and HashMap< elm::CString, void * >::hasKey_const().

◆ isEmpty()

bool isEmpty ( void ) const

inline

HashTable::HashTable(const self_t& h); Clone constructor.

Parameters

h	Hash table to clone.

Test if the table is empty.

Returns: True if the table is empty, false else.

Referenced by HashSet< T, H, A >::isEmpty(), HashMap< elm::CString, void * >::isEmpty(), and HashTable< Pair< const void *, bool >, AssocHashKey< const void *, bool, HashKey< const void * > >, DefaultAlloc >::operator bool().

◆ operator bool()

operator bool ( ) const

inline

◆ operator!=()

bool operator!= ( const HashTable< T > & t ) const

inline

◆ operator+=()

self_t& operator+= ( const T & x )

inline

◆ operator-=()

self_t& operator-= ( const T & x )

inline

◆ operator=()

self_t& operator= ( const HashTable< T, H > & c )

inline

◆ operator==()

bool operator== ( const HashTable< T > & t ) const

inline

◆ put()

void put ( const T & data )

inline

Add a data in the table ensuring there is only one data with the corresponding key.

Parameters

data	Added data.

Referenced by HashSet< T, H, A >::insert(), HashMap< elm::CString, void * >::put(), and HashTable< Pair< const void *, bool >, AssocHashKey< const void *, bool, HashKey< const void * > >, DefaultAlloc >::putAll().

◆ putAll()

void putAll ( const CC & c )

inline

Add the items of the given table to the current one.

Parameters

m	Added table.

Referenced by HashTable< Pair< const void *, bool >, AssocHashKey< const void *, bool, HashKey< const void * > >, DefaultAlloc >::copy(), and HashTable< Pair< const void *, bool >, AssocHashKey< const void *, bool, HashKey< const void * > >, DefaultAlloc >::HashTable().

◆ remove() [1/2]

void remove ( const Iter & i )

inline

◆ remove() [2/2]

void remove ( const T & key )

inline

Referenced by HashTable< Pair< const void *, bool >, AssocHashKey< const void *, bool, HashKey< const void * > >, DefaultAlloc >::operator-=(), HashSet< T, H, A >::remove(), HashMap< elm::CString, void * >::remove(), and HashTable< Pair< const void *, bool >, AssocHashKey< const void *, bool, HashKey< const void * > >, DefaultAlloc >::removeAll().

◆ removeAll()

void removeAll ( const C & c )

inline

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

include/elm/data/HashTable.h
src/data_HashTable.cpp

Classes

Public Types

Public Member Functions

Protected Member Functions

Additional Inherited Members

Detailed Description

template<class T, class H = HashKey<T>, class A = DefaultAlloc> class elm::HashTable< T, H, A >

Member Typedef Documentation

◆ self_t

Constructor & Destructor Documentation

◆ HashTable() [1/2]

◆ HashTable() [2/2]

◆ ~HashTable()

Member Function Documentation

◆ add()

◆ addAll()

◆ allocator() [1/2]

◆ allocator() [2/2]

◆ begin()

◆ clear()

◆ contains()

◆ contains_const()

◆ containsAll()

◆ containsAll_const()

◆ copy()

◆ count()

◆ end()

◆ equals()

◆ equals_const()

◆ exists()

◆ exists_const()

◆ find()

◆ find_const()

◆ get() [1/2]

◆ get() [2/2]

◆ get_const()

◆ hash() [1/2]

◆ hash() [2/2]

◆ hasKey()

◆ hasKey_const()

◆ isEmpty()

◆ operator bool()

◆ operator!=()

◆ operator+=()

◆ operator-=()

◆ operator=()

◆ operator==()

◆ put()

◆ putAll()

◆ remove() [1/2]

◆ remove() [2/2]

◆ removeAll()

template<class T, class H = HashKey<T>, class A = DefaultAlloc>
class elm::HashTable< T, H, A >