sspt_HashTable< K, T, HashOp > Class Template Reference

simple hash table with chaining to handle collisions More...

#include <sspt_hashtable.h>

List of all members.

Classes

class  RemovePredicate

Public Member Functions

 sspt_HashTable (unsigned long n)
 ~sspt_HashTable ()
bool isKey (const K &key)
void insert (const K &key, T item)
remove (const K &key)
bool find (const K &key, T *item)
bool update (const K &key, T item, bool autoInsert=false)
void keys (sspt_List< K > *results)
void contents (sspt_List< T > *results)
void clear ()


Detailed Description

template<class K, class T, class HashOp = sspt_GenericHashOperator<K>>
class sspt_HashTable< K, T, HashOp >

simple hash table with chaining to handle collisions

Constructor & Destructor Documentation

template<class K , class T , class HashOp >
sspt_HashTable< K, T, HashOp >::sspt_HashTable ( unsigned long  n  )  [inline]

template<class K , class T , class HashOp >
sspt_HashTable< K, T, HashOp >::~sspt_HashTable (  )  [inline]


Member Function Documentation

template<class K , class T , class HashOp >
void sspt_HashTable< K, T, HashOp >::clear (  )  [inline]

template<class K , class T, class HashOp >
void sspt_HashTable< K, T, HashOp >::contents ( sspt_List< T > *  results  )  [inline]

template<class K, class T, class HashOp >
bool sspt_HashTable< K, T, HashOp >::find ( const K &  key,
T *  item 
) [inline]

template<class K, class T, class HashOp >
void sspt_HashTable< K, T, HashOp >::insert ( const K &  key,
item 
) [inline]

template<class K, class T , class HashOp >
bool sspt_HashTable< K, T, HashOp >::isKey ( const K &  key  )  [inline]

template<class K, class T , class HashOp >
void sspt_HashTable< K, T, HashOp >::keys ( sspt_List< K > *  results  )  [inline]

template<class K, class T , class HashOp >
T sspt_HashTable< K, T, HashOp >::remove ( const K &  key  )  [inline]

template<class K, class T, class HashOp >
bool sspt_HashTable< K, T, HashOp >::update ( const K &  key,
item,
bool  autoInsert = false 
) [inline]


doxygen