#include <vtkObjectBaseHashMap.h>
Inheritance diagram for vtkObjectBaseHashMap:
A hash map is a Hashed Associative Container that associates a key string with objects. It is also a Unique Associative Container, meaning that no two items have keys that compare equal.
Looking up an item in a hash map by its key is efficient, so a hash map is useful for "dictionaries" where the order of items is irrelevant. If it is important for the items to be in a particular order, however, then map is more appropriate.
Definition at line 40 of file vtkObjectBaseHashMap.h.
Public Member Functions | |
vtkTypeRevisionMacro (vtkObjectBaseHashMap, vtkAssociativeContainer) | |
void | PrintSelf (ostream &, vtkIndent) |
virtual vtkIdType | GetSize (void) const |
Returns the number of items in the container. | |
virtual int | IsEmpty (void) const |
Returns true if this container is empty. | |
virtual vtkIdType | GetMaxSize (void) const |
Returns the maximum size of this container. | |
virtual int | Clear (void) |
Erase ALL items in the container. | |
virtual int | Swap (vtkObjectBaseHashMap *container) |
Swaps items of this container with those of the specified container. | |
virtual int | Copy (vtkObjectBaseHashMap *container) |
Copy all items from the specified container into this container. | |
vtkIdType | GetCapacity (void) const |
Returns the total number of items that the map can hold before needing to allocate more memory. | |
vtkObjectBase * | Find (const char *key) const |
Find the item in the table with the given key string. | |
int | Insert (const char *key, vtkObjectBase *item) |
Insert an item into the table paired with a key string. | |
int | Erase (const char *key) |
Erase the entry matching a given key string. | |
const char * | FindKey (const vtkObjectBase *item) |
Find the first key in the map associated with an item. | |
const char * | FindNextKey (void) |
Find the next key in the map associated with the item specified in a previous call to FindKey . | |
vtkObjectBaseHashMapIterator * | CreateIterator (void) |
Create an iterator. | |
int | GetCheckUnique (void) const |
Toggle enforcement of uniqueness among key strings (default: true). | |
void | SetCheckUnique (int a) |
Toggle enforcement of uniqueness among key strings (default: true). | |
int | GetCheckCase (void) const |
Toggle matching of upper/lower case characters in keys (default: true). | |
void | SetCheckCase (int a) |
Toggle matching of upper/lower case characters in keys (default: true). | |
Data Access Methods | |
vtkObjectBase * | Front (void) const |
Returns the first item in the container, or null if the container is empty. | |
virtual int | Front (const char *&key, vtkObjectBase *&item) const |
Gets the first key - item association in the map. | |
vtkObjectBase * | Back (void) const |
Returns the last item in the container, or null if the container is empty. | |
virtual int | Back (const char *&key, vtkObjectBase *&item) const |
Gets the last key - item association in the map. | |
Static Public Member Functions | |
vtkObjectBaseHashMap * | New (void) |
Protected Member Functions | |
vtkObjectBaseHashMap (void) | |
~vtkObjectBaseHashMap () | |
void | ReportReferences (vtkGarbageCollector *) |
Friends | |
class | vtkObjectBaseHashMapIterator |
|
|
|
|
|
Gets the last key - item association in the map.
Reimplemented from vtkAssociativeContainer. |
|
Returns the last item in the container, or
Reimplemented from vtkContainer. Reimplemented in vtkObjectHashMap. |
|
Erase ALL items in the container.
Implements vtkContainer. |
|
Copy all items from the specified container into this container.
|
|
Create an iterator.
Implements vtkAssociativeContainer. Reimplemented in vtkObjectHashMap. |
|
Erase the entry matching a given key string.
Implements vtkAssociativeContainer. |
|
Find the item in the table with the given key string.
Reimplemented from vtkAssociativeContainer. Reimplemented in vtkObjectHashMap. |
|
Find the first key in the map associated with an item.
Implements vtkAssociativeContainer. |
|
Find the next key in the map associated with the item specified in a previous call to
Implements vtkAssociativeContainer. |
|
Gets the first key - item association in the map.
Reimplemented from vtkAssociativeContainer. |
|
Returns the first item in the container, or
Reimplemented from vtkContainer. Reimplemented in vtkObjectHashMap. |
|
Returns the total number of items that the map can hold before needing to allocate more memory.
Reimplemented from vtkAssociativeContainer. |
|
Toggle matching of upper/lower case characters in keys (default: true).
Reimplemented from vtkAssociativeContainer. |
|
Toggle enforcement of uniqueness among key strings (default: true).
Reimplemented from vtkAssociativeContainer. |
|
Returns the maximum size of this container.
Reimplemented from vtkContainer. |
|
Returns the number of items in the container.
Reimplemented from vtkContainer. |
|
Insert an item into the table paired with a
Implements vtkAssociativeContainer. |
|
Returns
Reimplemented from vtkContainer. |
|
Reimplemented from vtkObject. Reimplemented in vtkObjectHashMap. |
|
Reimplemented from vtkAssociativeContainer. Reimplemented in vtkObjectHashMap. |
|
|
|
Toggle matching of upper/lower case characters in keys (default: true).
Reimplemented from vtkAssociativeContainer. |
|
Toggle enforcement of uniqueness among key strings (default: true).
Reimplemented from vtkAssociativeContainer. |
|
Swaps items of this container with those of the specified container.
|
|
|
|
Definition at line 180 of file vtkObjectBaseHashMap.h. |