Classes |
Public Member Functions |
Protected Types |
Protected Member Functions |
Protected Attributes |
List of all members
CXpHashTable< KEY, TYPE > Class Template Reference
#include <xphashtable.h>
Classes | |
struct SNode | |
Public Member Functions | |
CXpHashTable (const INT_PTR nHashTableSize, const bool bCalculate=true) | |
virtual ~CXpHashTable () | |
HRESULT Insert (const KEY &Key, const TYPE &Value) | |
HRESULT Remove (const KEY &Key) | |
void RemoveAll () | |
INT_PTR GetCount () const | |
bool HasKey (const KEY &Key) const | |
TXpTableItem FindKey (const KEY &Key) const | |
bool FindValue (const KEY &Key, TYPE &Value) const | |
const KEY & GetKey (const TXpTableItem Item) const | |
const TYPE & GetValue (const TXpTableItem Item) const | |
TYPE & GetValue (const TXpTableItem Item) | |
void GetPair (const TXpTableItem Item, KEY &Key, TYPE &Value) const | |
TXpTableItem GetFirst () const | |
TXpTableItem GetNext (const TXpTableItem Item) const | |
HRESULT Copy (const CXpHashTable &HashTable) | |
HRESULT Intersection (const CXpHashTable &HashTable, CXpHashTable &Result) | |
HRESULT Union (const CXpHashTable &HashTable, CXpHashTable &Result) | |
HRESULT Difference (const CXpHashTable &HashTable, CXpHashTable &Result) | |
bool operator== (const CXpHashTable &HashTable) const | |
Protected Types | |
typedef CXpArray< SNode * > CPtrArray | |
Protected Member Functions | |
CXpHashTable & operator= (const CXpHashTable &HashTable) | |
INT_PTR GetBucket (const KEY &Key) const | |
bool IsPrime (const INT_PTR nNbr) | |
INT_PTR GetClosestPrime (const INT_PTR nNbr) | |
Protected Attributes | |
CPtrArray m_Buckets | |
INT_PTR m_nCount | |
Member Typedef Documentation
◆ CPtrArray
template<class KEY , class TYPE >
|
protected |
Constructor & Destructor Documentation
◆ CXpHashTable()
template<class KEY , class TYPE >
CXpHashTable< KEY, TYPE >::CXpHashTable | ( | const INT_PTR | nHashTableSize, |
const bool | bCalculate = true |
||
) |
◆ ~CXpHashTable()
template<class KEY , class TYPE >
|
virtual |
Member Function Documentation
◆ Copy()
template<class KEY , class TYPE >
|
inline |
◆ Difference()
template<class KEY , class TYPE >
|
inline |
◆ FindKey()
template<class KEY , class TYPE >
|
inline |
◆ FindValue()
template<class KEY , class TYPE >
|
inline |
◆ GetBucket()
template<class KEY , class TYPE >
|
inlineprotected |
◆ GetClosestPrime()
template<class KEY , class TYPE >
|
protected |
◆ GetCount()
template<class KEY , class TYPE >
|
inline |
◆ GetFirst()
template<class KEY , class TYPE >
|
inline |
◆ GetKey()
template<class KEY , class TYPE >
|
inline |
◆ GetNext()
template<class KEY , class TYPE >
|
inline |
◆ GetPair()
template<class KEY , class TYPE >
|
inline |
◆ GetValue() [1/2]
template<class KEY , class TYPE >
|
inline |
◆ GetValue() [2/2]
template<class KEY , class TYPE >
|
inline |
◆ HasKey()
template<class KEY , class TYPE >
|
inline |
◆ Insert()
template<class KEY , class TYPE >
|
inline |
◆ Intersection()
template<class KEY , class TYPE >
|
inline |
◆ IsPrime()
template<class KEY , class TYPE >
|
protected |
◆ operator=()
template<class KEY , class TYPE >
|
protected |
◆ operator==()
template<class KEY , class TYPE >
|
inline |
◆ Remove()
template<class KEY , class TYPE >
|
inline |
◆ RemoveAll()
template<class KEY , class TYPE >
|
inline |
◆ Union()
template<class KEY , class TYPE >
|
inline |
Member Data Documentation
◆ m_Buckets
template<class KEY , class TYPE >
|
protected |
◆ m_nCount
template<class KEY , class TYPE >
|
protected |