map template for associative arrays using a red-black tree More...
#include <irrMap.h>
Classes | |
class | AccessClass |
class | ConstIterator |
Const Iterator. More... | |
class | Iterator |
Normal Iterator. More... | |
class | ParentFirstIterator |
Parent First Iterator. More... | |
class | ParentLastIterator |
Parent Last Iterator. More... | |
Public Types | |
typedef RBTree< KeyType, ValueType > | Node |
Public Member Functions | |
map () | |
~map () | |
void | clear () |
Clear the entire tree. More... | |
Node * | delink (const KeyType &k) |
Removes a node from the tree and returns it. More... | |
bool | empty () const |
Node * | find (const KeyType &keyToFind) const |
ConstIterator | getConstIterator () const |
Returns a Constiterator. More... | |
Iterator | getIterator () const |
Returns an iterator. More... | |
ParentFirstIterator | getParentFirstIterator () const |
ParentLastIterator | getParentLastIterator () const |
Node * | getRoot () const |
bool | insert (const KeyType &keyNew, const ValueType &v) |
Inserts a new node into the tree. More... | |
_IRR_DEPRECATED_ bool | isEmpty () const |
AccessClass | operator[] (const KeyType &k) |
operator [] for access to elements More... | |
bool | remove (const KeyType &k) |
Removes a node from the tree and deletes it. More... | |
bool | remove (Node *p) |
Removes a node from the tree and deletes it. More... | |
void | set (const KeyType &k, const ValueType &v) |
Replaces the value if the key already exists, otherwise inserts a new element. More... | |
u32 | size () const |
Returns the number of nodes in the tree. More... | |
void | swap (map< KeyType, ValueType > &other) |
Swap the content of this map container with the content of another map. More... | |
map template for associative arrays using a red-black tree
typedef RBTree<KeyType,ValueType> irr::core::map< KeyType, ValueType >::Node |
|
inline |
Definition at line 673 of file irrMap.h.
Referenced by irr::core::map< KeyType, ValueType >::operator[]().
|
inline |
Definition at line 676 of file irrMap.h.
References irr::core::map< KeyType, ValueType >::clear().
|
inline |
Clear the entire tree.
Definition at line 872 of file irrMap.h.
References irr::core::map< KeyType, ValueType >::ParentLastIterator::atEnd(), irr::core::map< KeyType, ValueType >::ParentLastIterator::getNode(), and irr::core::map< KeyType, ValueType >::getParentLastIterator().
Referenced by irr::core::map< KeyType, ValueType >::~map().
|
inline |
Removes a node from the tree and returns it.
The returned node must be deleted by the user
k | the key to remove |
Definition at line 784 of file irrMap.h.
References irr::core::map< KeyType, ValueType >::find().
|
inline |
Is the tree empty?
Definition at line 889 of file irrMap.h.
References _IRR_IMPLEMENT_MANAGED_MARSHALLING_BUGFIX.
Referenced by irr::core::map< KeyType, ValueType >::isEmpty().
|
inline |
Search for a node with the specified key.
keyToFind | The key to find |
Definition at line 904 of file irrMap.h.
Referenced by irr::core::map< KeyType, ValueType >::delink(), irr::core::map< KeyType, ValueType >::remove(), and irr::core::map< KeyType, ValueType >::set().
|
inline |
Returns a Constiterator.
Definition at line 960 of file irrMap.h.
References irr::core::map< KeyType, ValueType >::getRoot().
|
inline |
Returns an iterator.
Definition at line 953 of file irrMap.h.
References irr::core::map< KeyType, ValueType >::getRoot().
|
inline |
Returns a ParentFirstIterator. Traverses the tree from top to bottom. Typical usage is when storing the tree structure, because when reading it later (and inserting elements) the tree structure will be the same.
Definition at line 971 of file irrMap.h.
References irr::core::map< KeyType, ValueType >::getRoot().
|
inline |
Returns a ParentLastIterator to traverse the tree from bottom to top. Typical usage is when deleting all elements in the tree because you must delete the children before you delete their parent.
Definition at line 982 of file irrMap.h.
References irr::core::map< KeyType, ValueType >::getRoot().
Referenced by irr::core::map< KeyType, ValueType >::clear().
|
inline |
Gets the root element.
Definition at line 926 of file irrMap.h.
Referenced by irr::core::map< KeyType, ValueType >::getConstIterator(), irr::core::map< KeyType, ValueType >::getIterator(), irr::core::map< KeyType, ValueType >::getParentFirstIterator(), and irr::core::map< KeyType, ValueType >::getParentLastIterator().
|
inline |
Inserts a new node into the tree.
keyNew | the index for this value |
v | the value to insert |
Definition at line 689 of file irrMap.h.
References _IRR_IMPLEMENT_MANAGED_MARSHALLING_BUGFIX.
Referenced by irr::core::map< KeyType, ValueType >::operator[](), and irr::core::map< KeyType, ValueType >::set().
|
inline |
Definition at line 896 of file irrMap.h.
References irr::core::map< KeyType, ValueType >::empty().
|
inline |
operator [] for access to elements
for example myMap["key"]
Definition at line 994 of file irrMap.h.
References _IRR_IMPLEMENT_MANAGED_MARSHALLING_BUGFIX, irr::core::map< KeyType, ValueType >::insert(), and irr::core::map< KeyType, ValueType >::map().
|
inline |
Removes a node from the tree and deletes it.
Definition at line 823 of file irrMap.h.
References irr::core::map< KeyType, ValueType >::find().
|
inline |
Removes a node from the tree and deletes it.
Definition at line 831 of file irrMap.h.
References _IRR_IMPLEMENT_MANAGED_MARSHALLING_BUGFIX.
|
inline |
Replaces the value if the key already exists, otherwise inserts a new element.
k | The index for this value |
v | The new value of |
Definition at line 771 of file irrMap.h.
References irr::core::map< KeyType, ValueType >::find(), and irr::core::map< KeyType, ValueType >::insert().
|
inline |
|
inline |
Swap the content of this map container with the content of another map.
Afterwards this object will contain the content of the other object and the other object will contain the content of this object. Iterators will afterwards be valid for the swapped object.
other | Swap content with this object |
Definition at line 942 of file irrMap.h.
References irr::core::swap().