CXpHashTable< KEY, TYPE > Member List

This is the complete list of members for CXpHashTable< KEY, TYPE >, including all inherited members.

Copy(const CXpHashTable &HashTable)CXpHashTable< KEY, TYPE >inline
CPtrArray typedefCXpHashTable< KEY, TYPE >protected
CXpHashTable(const INT_PTR nHashTableSize, const bool bCalculate=true)CXpHashTable< KEY, TYPE >
Difference(const CXpHashTable &HashTable, CXpHashTable &Result)CXpHashTable< KEY, TYPE >inline
FindKey(const KEY &Key) constCXpHashTable< KEY, TYPE >inline
FindValue(const KEY &Key, TYPE &Value) constCXpHashTable< KEY, TYPE >inline
GetBucket(const KEY &Key) constCXpHashTable< KEY, TYPE >inlineprotected
GetClosestPrime(const INT_PTR nNbr)CXpHashTable< KEY, TYPE >protected
GetCount() constCXpHashTable< KEY, TYPE >inline
GetFirst() constCXpHashTable< KEY, TYPE >inline
GetKey(const TXpTableItem Item) constCXpHashTable< KEY, TYPE >inline
GetNext(const TXpTableItem Item) constCXpHashTable< KEY, TYPE >inline
GetPair(const TXpTableItem Item, KEY &Key, TYPE &Value) constCXpHashTable< KEY, TYPE >inline
GetValue(const TXpTableItem Item) constCXpHashTable< KEY, TYPE >inline
GetValue(const TXpTableItem Item)CXpHashTable< KEY, TYPE >inline
HasKey(const KEY &Key) constCXpHashTable< KEY, TYPE >inline
Insert(const KEY &Key, const TYPE &Value)CXpHashTable< KEY, TYPE >inline
Intersection(const CXpHashTable &HashTable, CXpHashTable &Result)CXpHashTable< KEY, TYPE >inline
IsPrime(const INT_PTR nNbr)CXpHashTable< KEY, TYPE >protected
m_BucketsCXpHashTable< KEY, TYPE >protected
m_nCountCXpHashTable< KEY, TYPE >protected
operator=(const CXpHashTable &HashTable)CXpHashTable< KEY, TYPE >protected
operator==(const CXpHashTable &HashTable) constCXpHashTable< KEY, TYPE >inline
Remove(const KEY &Key)CXpHashTable< KEY, TYPE >inline
RemoveAll()CXpHashTable< KEY, TYPE >inline
Union(const CXpHashTable &HashTable, CXpHashTable &Result)CXpHashTable< KEY, TYPE >inline
~CXpHashTable()CXpHashTable< KEY, TYPE >virtual

Distributed under the Apache License, Version 2.0.

See accompanying NOTICE file for details.