csRedBlackTreeMap< K, T > Class Template Reference
[Containers]
Key-value-map, backed by csRedBlackTree.
More...
#include <csutil/redblacktree.h>
Inheritance diagram for csRedBlackTreeMap< K, T >:

Public Member Functions | |
bool | Delete (const K &key) |
Delete element from map,. | |
void | DeleteAll () |
Delete all keys. | |
void | Empty () |
Delete all the keys. (Idiomatic alias for DeleteAll().). | |
bool | IsEmpty () const |
Returns whether this map has no nodes. | |
T * | Put (const K &key, const T &value) |
Add element to map,. | |
T & | Get (const K &key, T &fallback) |
const T & | Get (const K &key, const T &fallback) const |
Get the element matching the given key, or fallback if there is none. | |
T * | GetElementPointer (const K &key) |
const T * | GetElementPointer (const K &key) const |
Get a pointer to the element matching the given key, or 0 if there is none. | |
template<typename CB> | |
void | TraverseInOrder (CB &callback) const |
Traverse tree. |
Detailed Description
template<typename K, typename T>
class csRedBlackTreeMap< K, T >
Key-value-map, backed by csRedBlackTree.
- Remarks:
- As with csRedBlackTree, every key must be unique.
Definition at line 550 of file redblacktree.h.
Member Function Documentation
|
Delete element from map,.
Definition at line 582 of file redblacktree.h. References csRedBlackTree< csRedBlackTreePayload< K, T > >::Delete(), and csRedBlackTree< csRedBlackTreePayload< K, T > >::Find(). |
|
Delete all keys.
Reimplemented from csRedBlackTree< csRedBlackTreePayload< K, T > >. Definition at line 625 of file redblacktree.h. References csRedBlackTree< csRedBlackTreePayload< K, T > >::Empty(). Referenced by csRedBlackTreeMap< K, T >::Empty(). |
|
Delete all the keys. (Idiomatic alias for DeleteAll().).
Reimplemented from csRedBlackTree< csRedBlackTreePayload< K, T > >. Definition at line 627 of file redblacktree.h. References csRedBlackTreeMap< K, T >::DeleteAll(). |
|
Get the element matching the given key, or
Definition at line 611 of file redblacktree.h. References csRedBlackTree< csRedBlackTreePayload< K, T > >::Find(), and csRedBlackTreePayload< K, T >::GetValue(). |
|
Get a pointer to the element matching the given key, or 0 if there is none.
Definition at line 593 of file redblacktree.h. References csRedBlackTree< csRedBlackTreePayload< K, T > >::Find(), and csRedBlackTreePayload< K, T >::GetValue(). |
|
Returns whether this map has no nodes.
Reimplemented from csRedBlackTree< csRedBlackTreePayload< K, T > >. Definition at line 629 of file redblacktree.h. References csRedBlackTree< csRedBlackTreePayload< K, T > >::IsEmpty(). |
|
Add element to map,.
Definition at line 571 of file redblacktree.h. References csRedBlackTreePayload< K, T >::GetValue(), and csRedBlackTree< csRedBlackTreePayload< K, T > >::Insert(). |
|
Traverse tree.
Reimplemented from csRedBlackTree< csRedBlackTreePayload< K, T > >. Definition at line 634 of file redblacktree.h. References csRedBlackTree< csRedBlackTreePayload< K, T > >::TraverseInOrder(). |
The documentation for this class was generated from the following file:
- csutil/redblacktree.h
Generated for Crystal Space by doxygen 1.4.6