![]() |
Gray C++ Libraries
0.0.2
A set of C++ libraries for MSVC, GNU on Windows, WinCE, Linux
|
#include <cHashTable.h>
Public Types | |
typedef cHashIterator | iterator |
Public Member Functions | |
int | get_HashBits () const |
ITERATE_t | get_HashArrayQty () const |
ITERATE_t | GetHashArray (TYPE_HASHCODE rid) const |
ITERATE_t | GetArraySize (ITERATE_t iArray) const |
iterator | FindIForKey (TYPE_HASHCODE rid) const |
TYPE_HASHCODE | FindKeyFree (TYPE_HASHCODE rid) const |
bool | DeleteKey (TYPE_HASHCODE rid) |
bool | IsEmpty () const |
ITERATE_t | get_TotalCount () const |
void | RemoveAt (iterator &i) |
void | RemoveAll () |
void | Empty () |
Public Attributes | |
_TYPEARRAY | m_aTable [k_HASH_ARRAY_QTY] |
Static Public Attributes | |
static const ITERATE_t | k_HASH_ARRAY_QTY = (((size_t)1)<<( TYPE_HASHBITS )) |
Friends | |
class | cHashTableTests |
base class for a full hash table. similar to CMap in MFC
typedef cHashIterator Gray::cHashTableT< _TYPEARRAY, TYPE, TYPE_HASHCODE, TYPE_HASHBITS >::iterator |
|
inline |
delete it
|
inline |
|
inline |
|
inline |
Find the next free/unused TYPE_HASHCODE key after rid.
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
friend |
|
static |
_TYPEARRAY Gray::cHashTableT< _TYPEARRAY, TYPE, TYPE_HASHCODE, TYPE_HASHBITS >::m_aTable[k_HASH_ARRAY_QTY] |