#include <kmap.h>
Classes |
|
class | KKeyValuePair |
Public Types |
|
typedef VALUE_TYPE | ValueType |
typedef KEY_TYPE | KeyType |
typedef StorageType::RecordType | RecordType |
typedef StorageType::IteratorType | Iterator |
typedef StorageType::ConstIteratorType |
ConstIterator |
Public Member Functions |
|
KMap () | |
KMap (KMap const &pMap) | |
~KMap () | |
void | Reserve (unsigned int pRecordCount) |
int | GetSize () const |
KPair< RecordType *, bool > | Insert (KeyType const &pKey, ValueType const &pValue) |
int | Remove (KeyType const &pKey) |
void | Clear () |
bool | Empty () const |
Iterator | Begin () |
Iterator | End () |
ConstIterator | Begin () const |
ConstIterator | End () const |
RecordType const * | Find (KeyType const &pKey) const |
RecordType * | Find (KeyType const &pKey) |
RecordType const * | UpperBound (KeyType const &pKey) const |
RecordType * | UpperBound (KeyType const &pKey) |
ValueType & | operator[] (KeyType const &pKey) |
RecordType const * | Minimum () const |
RecordType * | Minimum () |
RecordType const * | Maximum () const |
RecordType * | Maximum () |
Protected Types |
|
typedef
KRedBlackTree < KKeyValuePair, KEY_COMPARE_FUNCTOR, ALLOCATOR > |
StorageType |
Protected Attributes |
|
StorageType | mTree |
typedef KRedBlackTree<KKeyValuePair,
KEY_COMPARE_FUNCTOR, ALLOCATOR> StorageType
[protected] |
typedef VALUE_TYPE ValueType |
typedef KEY_TYPE KeyType |
typedef StorageType::RecordType RecordType |
typedef StorageType::IteratorType Iterator |
void Reserve | ( | unsigned int | pRecordCount | ) | [inline] |
int GetSize | ( | ) | const [inline] |
KPair<RecordType*, bool> Insert | ( | KeyType const & | pKey, |
ValueType const & | pValue | ||
) | [inline] |
int Remove | ( | KeyType const & | pKey | ) | [inline] |
void Clear | ( | ) | [inline] |
bool Empty | ( | ) | const [inline] |
Iterator Begin | ( | ) | [inline] |
Iterator End | ( | ) | [inline] |
ConstIterator Begin | ( | ) | const [inline] |
Definition at line 1560 of file kmap.h.
{ return ConstIterator(Minimum()); }
ConstIterator End | ( | ) | const [inline] |
RecordType const* Find | ( | KeyType const & | pKey | ) | const [inline] |
RecordType* Find | ( | KeyType const & | pKey | ) | [inline] |
RecordType const* UpperBound | ( | KeyType const & | pKey | ) | const [inline] |
Definition at line 1580 of file kmap.h.
{ return mTree.UpperBound(pKey); }
RecordType* UpperBound | ( | KeyType const & | pKey | ) | [inline] |
Definition at line 1585 of file kmap.h.
{ return mTree.UpperBound(pKey); }
RecordType const* Minimum | ( | ) | const [inline] |
RecordType* Minimum | ( | ) | [inline] |
RecordType const* Maximum | ( | ) | const [inline] |
RecordType* Maximum | ( | ) | [inline] |
StorageType mTree
[protected] |