| AGenericHash(int SizeWanted, ACompareNodesAlgorithm< Key, ConfigData > *Compare, AHashAlgorithm< Key > *Hash, DeleteHashDataEnum DeleteHashData=NO_DELETE_HASH_ITEM) | AGenericHash< Key, ConfigData > | [protected] |
| Copy(AGenericHash< Key, ConfigData > *Hash) | AGenericHash< Key, ConfigData > | [protected, virtual] |
| DeleteItems() | AGenericHash< Key, ConfigData > | [virtual] |
| ForEach(AProcessHashAlgorithm< Key, ConfigData > *ProcessFunc, ConfigData *UserData) | GLIBHash< Key, ConfigData > | |
| ForEachRemove(RemoveHashAlgorithm< Key, ConfigData > *RemoveFunc, ConfigData *configData) | GLIBHash< Key, ConfigData > | |
| Freeze() | GLIBHash< Key, ConfigData > | |
| GetSize() | GLIBHash< Key, ConfigData > | |
| GLIBHash(int SizeWanted, ACompareNodesAlgorithm< Key, ConfigData > *Compare, AHashAlgorithm< Key > *Hash, DeleteHashDataEnum DeleteHashData=NO_DELETE_HASH_ITEM) | GLIBHash< Key, ConfigData > | |
| Insert(Key *key, bool OptimizeForCaching) | GLIBHash< Key, ConfigData > | [virtual] |
| Insert(Key *key, int Value) | GLIBHash< Key, ConfigData > | [protected] |
| Lookup(Key *key) | GLIBHash< Key, ConfigData > | |
| LookupExtended(Key *LookupKey, Key **OriginalKey, int **Value) | GLIBHash< Key, ConfigData > | |
| LookupNode(Key *key) | GLIBHash< Key, ConfigData > | [protected] |
| m_Compare | AGenericHash< Key, ConfigData > | [protected] |
| m_DeleteHashData | AGenericHash< Key, ConfigData > | [protected] |
| m_Frozen | GLIBHash< Key, ConfigData > | [private] |
| m_Hash | AGenericHash< Key, ConfigData > | [protected] |
| m_Nodes | GLIBHash< Key, ConfigData > | [private] |
| m_NumberOfElements | AGenericHash< Key, ConfigData > | [protected] |
| m_Size | AGenericHash< Key, ConfigData > | [protected] |
| Remove(Key *key) | GLIBHash< Key, ConfigData > | |
| Resize() | GLIBHash< Key, ConfigData > | |
| Thaw() | GLIBHash< Key, ConfigData > | |
| ~AGenericHash() | AGenericHash< Key, ConfigData > | [virtual] |
| ~GLIBHash() | GLIBHash< Key, ConfigData > | [virtual] |
