class TMDictionaryAsHashTable

Public Methods

•  TMDictionaryAsHashTable ( unsigned size = DEFAULT_HASH_TABLE_SIZE )
•  ~TMDictionaryAsHashTable ()
• int  Add ( const T& t )
• int  Detach ( const T& t, DeleteType dt = DefDelete )
• T * Find ( const T& t )
• void  Flush ( DeleteType dt = DefDelete )
• void  ForEach ( void (*func)(T&, void *), void *args )
• unsigned  GetItemsInContainer () const
• int  IsEmpty () const

Public Members

• friend class TMDictionaryAsHashTableIterator

Protected Members

• TMHashTableImp HashTable

Private Methods

• template int  Detach ( const T& t, DeleteType dt )
• template void  Flush ( DeleteType dt )
• template void  DeleteElement ( T& t, void * )

Private Static Methods

• static void  DeleteElement ( T& t, void * )

Detailed Description

template class TMDictionaryAsHashTable template class TMDictionaryAsHashTableIterator

Managed dictionary and iterator

Implements the dictionary container using a hash table. Assumes that T is of class TAssociation.

empty the array; if the ownership is on also the elements in the array will be destroyed

auto iterator: use an iterator function calling it for every element of the bag; the function must have a prototype like this: void iterFunc(T&, void* args);

[const]

[const]

[protected]

[private static]

[private]

[private]

[private]