Classes
|
| class
|
FbxRedBack_IteratorType<
RecordType > |
| class
|
FbxRedBack_ConstIteratorType<
RecordType > |
| class
|
FbxRedBlackTree< DATA_TYPE,
KEY_COMPARE_FUNCTOR, ALLOCATOR > |
| |
Implements an efficient ordered data
storage. More...
|
| class
|
FbxRedBlackTree<
DATA_TYPE, KEY_COMPARE_FUNCTOR, ALLOCATOR >::RecordType |
| |
This class represents a node in the tree.
More...
|
| struct
|
FbxLessCompare< T > |
| |
Default comparator for
FbxMap and
FbxSet2, which assumes operator < is defined. More...
|
| class
|
FbxMap< KEY_TYPE, VALUE_TYPE,
KEY_COMPARE_FUNCTOR, ALLOCATOR > |
| |
This class implements an efficient map based
on key comparison, which stores key-value pairs. More...
|
| class
|
FbxMap< KEY_TYPE,
VALUE_TYPE, KEY_COMPARE_FUNCTOR, ALLOCATOR
>::FbxKeyValuePair |
| |
This class defines the key-value pairs used
in
FbxMap. More...
|
| class
|
FbxSet2< VALUE_TYPE, KEY_COMPARE_FUNCTOR,
ALLOCATOR > |
| |
This class implements an efficient set based
on value comparison, which stores values. More...
|
| class
|
FbxSet2< VALUE_TYPE,
KEY_COMPARE_FUNCTOR, ALLOCATOR >::FbxValue |
Definition in file fbxmap.h.