#include <sspt_hashtable.h>
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) |
T | 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 () |
sspt_HashTable< K, T, HashOp >::sspt_HashTable | ( | unsigned long | n | ) | [inline] |
sspt_HashTable< K, T, HashOp >::~sspt_HashTable | ( | ) | [inline] |
void sspt_HashTable< K, T, HashOp >::clear | ( | ) | [inline] |
void sspt_HashTable< K, T, HashOp >::contents | ( | sspt_List< T > * | results | ) | [inline] |
bool sspt_HashTable< K, T, HashOp >::find | ( | const K & | key, | |
T * | item | |||
) | [inline] |
void sspt_HashTable< K, T, HashOp >::insert | ( | const K & | key, | |
T | item | |||
) | [inline] |
bool sspt_HashTable< K, T, HashOp >::isKey | ( | const K & | key | ) | [inline] |
void sspt_HashTable< K, T, HashOp >::keys | ( | sspt_List< K > * | results | ) | [inline] |
T sspt_HashTable< K, T, HashOp >::remove | ( | const K & | key | ) | [inline] |
bool sspt_HashTable< K, T, HashOp >::update | ( | const K & | key, | |
T | item, | |||
bool | autoInsert = false | |||
) | [inline] |