Gray C++ Libraries  0.0.2
A set of C++ libraries for MSVC, GNU on Windows, WinCE, Linux
Public Types | Public Member Functions | List of all members
Gray::cHashTableStruct< TYPE, TYPE_HASHCODE, TYPE_HASHBITS > Class Template Reference

#include <cHashTable.h>

Inheritance diagram for Gray::cHashTableStruct< TYPE, TYPE_HASHCODE, TYPE_HASHBITS >:
Gray::cHashTableT< cArraySortStructHash< TYPE, HASHCODE_t >, TYPE, HASHCODE_t, 5 >

Public Types

typedef cHashTableT< cArraySortStructHash< TYPE, TYPE_HASHCODE >, TYPE, TYPE_HASHCODE, TYPE_HASHBITS > SUPER_t
 
typedef const TYPE & REF_t
 
- Public Types inherited from Gray::cHashTableT< cArraySortStructHash< TYPE, HASHCODE_t >, TYPE, HASHCODE_t, 5 >
typedef cHashIterator iterator
 

Public Member Functions

const TYPE * FindArgForKey (TYPE_HASHCODE rid) const
 
const TYPE & GetAtHash (const cHashIterator &i) const
 
cHashIterator FindHash (TYPE_HASHCODE rid) const
 
const TYPE & Add (REF_t rNew)
 
TYPE * AddSpecial (REF_t rNew)
 
- Public Member Functions inherited from Gray::cHashTableT< cArraySortStructHash< TYPE, HASHCODE_t >, TYPE, HASHCODE_t, 5 >
int get_HashBits () const
 
ITERATE_t get_HashArrayQty () const
 
ITERATE_t GetHashArray (HASHCODE_t rid) const
 
ITERATE_t GetArraySize (ITERATE_t iArray) const
 
iterator FindIForKey (HASHCODE_t rid) const
 
HASHCODE_t FindKeyFree (HASHCODE_t rid) const
 
bool DeleteKey (HASHCODE_t rid)
 
bool IsEmpty () const
 
ITERATE_t get_TotalCount () const
 
void RemoveAt (iterator &i)
 
void RemoveAll ()
 
void Empty ()
 

Additional Inherited Members

- Public Attributes inherited from Gray::cHashTableT< cArraySortStructHash< TYPE, HASHCODE_t >, TYPE, HASHCODE_t, 5 >
cArraySortStructHash< TYPE, HASHCODE_t > m_aTable [k_HASH_ARRAY_QTY]
 
- Static Public Attributes inherited from Gray::cHashTableT< cArraySortStructHash< TYPE, HASHCODE_t >, TYPE, HASHCODE_t, 5 >
static const ITERATE_t k_HASH_ARRAY_QTY
 

Detailed Description

template<class TYPE, typename TYPE_HASHCODE = HASHCODE_t, int TYPE_HASHBITS = 5>
class Gray::cHashTableStruct< TYPE, TYPE_HASHCODE, TYPE_HASHBITS >

ASSUME TYPE is just a class that has a get_HashCode() method.

Member Typedef Documentation

◆ REF_t

template<class TYPE , typename TYPE_HASHCODE = HASHCODE_t, int TYPE_HASHBITS = 5>
typedef const TYPE& Gray::cHashTableStruct< TYPE, TYPE_HASHCODE, TYPE_HASHBITS >::REF_t

◆ SUPER_t

template<class TYPE , typename TYPE_HASHCODE = HASHCODE_t, int TYPE_HASHBITS = 5>
typedef cHashTableT< cArraySortStructHash<TYPE, TYPE_HASHCODE>, TYPE, TYPE_HASHCODE, TYPE_HASHBITS > Gray::cHashTableStruct< TYPE, TYPE_HASHCODE, TYPE_HASHBITS >::SUPER_t

Member Function Documentation

◆ Add()

template<class TYPE , typename TYPE_HASHCODE = HASHCODE_t, int TYPE_HASHBITS = 5>
const TYPE& Gray::cHashTableStruct< TYPE, TYPE_HASHCODE, TYPE_HASHBITS >::Add ( REF_t  rNew)
inline

◆ AddSpecial()

template<class TYPE , typename TYPE_HASHCODE = HASHCODE_t, int TYPE_HASHBITS = 5>
TYPE* Gray::cHashTableStruct< TYPE, TYPE_HASHCODE, TYPE_HASHBITS >::AddSpecial ( REF_t  rNew)
inline

◆ FindArgForKey()

template<class TYPE , typename TYPE_HASHCODE = HASHCODE_t, int TYPE_HASHBITS = 5>
const TYPE* Gray::cHashTableStruct< TYPE, TYPE_HASHCODE, TYPE_HASHBITS >::FindArgForKey ( TYPE_HASHCODE  rid) const
inline

◆ FindHash()

template<class TYPE , typename TYPE_HASHCODE = HASHCODE_t, int TYPE_HASHBITS = 5>
cHashIterator Gray::cHashTableStruct< TYPE, TYPE_HASHCODE, TYPE_HASHBITS >::FindHash ( TYPE_HASHCODE  rid) const
inline

◆ GetAtHash()

template<class TYPE , typename TYPE_HASHCODE = HASHCODE_t, int TYPE_HASHBITS = 5>
const TYPE& Gray::cHashTableStruct< TYPE, TYPE_HASHCODE, TYPE_HASHBITS >::GetAtHash ( const cHashIterator &  i) const
inline

get from hash table. i must exist.

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