template<class Key, class Type, class Compare>
class FbxSimpleMap< Key, Type, Compare >
A simple map class representing a dictionary-like data
structure.
Definition at line 255 of file fbxmap.h.
Public Types
|
typedef
FbxMap< Key,
Type,
Compare >::RecordType * |
Iterator |
Public Member Functions
|
| void |
Add
(const Key &pKey, const Type &pValue) |
| |
Add a key-value pair as an element.
|
| Iterator |
Find
(const Key &pKey) const |
| |
Find an element with a given key.
|
| Iterator |
Find
(const Type &pValue) const |
| |
Find an element with a given value.
|
| void |
Remove
(Iterator
pIterator) |
| |
Remove an element from the map.
|
| Iterator |
GetFirst
() const |
| |
Get the first element.
|
| Iterator |
GetNext
(Iterator
pIterator) const |
| |
Get the next element of a given element.
|
| void |
Clear
() |
| |
Remove all of the elements.
|
| void |
Reserve
(int pSize) |
| |
Reserve the space for given number elements.
|
| int |
GetCount
() const |
| |
Query the count of elements in the map.
|