Home | Namespaces | Hierarchy | Alphabetical List | Class list | Files | Namespace Members | Class members | File members | Tutorials |
map template for associative arrays using a red-black tree More...
#include <irrMap.h>
Classes | |
class | AccessClass |
class | Iterator |
Normal Iterator. More... | |
class | ParentFirstIterator |
Parent First Iterator. More... | |
class | ParentLastIterator |
Parent Last Iterator. More... | |
class | RBTree |
red/black tree for map |
Public Types | |
typedef RBTree< KeyType, ValueType > | Node |
Public Member Functions | |
void | clear () |
Clear the entire tree. | |
Node * | delink (const KeyType &k) |
Removes a node from the tree and returns it. | |
bool | empty () const |
Node * | find (const KeyType &keyToFind) const |
Iterator | getIterator () |
Returns an iterator. | |
ParentFirstIterator | getParentFirstIterator () |
ParentLastIterator | getParentLastIterator () |
Node * | getRoot () const |
bool | insert (const KeyType &keyNew, const ValueType &v) |
Inserts a new node into the tree. | |
_IRR_DEPRECATED_ bool | isEmpty () const |
map () | |
AccessClass | operator[] (const KeyType &k) |
operator [] for access to elements | |
bool | remove (const KeyType &k) |
Removes a node from the tree and deletes it. | |
void | set (const KeyType &k, const ValueType &v) |
Replaces the value if the key already exists, otherwise inserts a new element. | |
u32 | size () const |
Returns the number of nodes in the tree. | |
void | swap (map< KeyType, ValueType > &other) |
Swap the content of this map container with the content of another map. | |
~map () |
map template for associative arrays using a red-black tree
typedef RBTree<KeyType,ValueType> irr::core::map< KeyType, ValueType >::Node |
|
inline |
|
inline |
Definition at line 528 of file irrMap.h.
References irr::core::map< KeyType, ValueType >::clear().
|
inline |
Clear the entire tree.
Definition at line 717 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 636 of file irrMap.h.
References irr::core::map< KeyType, ValueType >::find().
|
inline |
Is the tree empty?
Definition at line 734 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 749 of file irrMap.h.
Referenced by irr::core::map< KeyType, ValueType >::delink(), irr::core::map< KeyType, ValueType >::AccessClass::operator ValueType(), irr::core::map< KeyType, ValueType >::remove(), and irr::core::map< KeyType, ValueType >::set().
|
inline |
Returns an iterator.
Definition at line 798 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 808 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 818 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 771 of file irrMap.h.
Referenced by 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.
\param keyNew: the index for this value
v,: | the value to insert |
Definition at line 541 of file irrMap.h.
References _IRR_IMPLEMENT_MANAGED_MARSHALLING_BUGFIX.
Referenced by irr::core::map< KeyType, ValueType >::set().
|
inline |
Definition at line 741 of file irrMap.h.
References irr::core::map< KeyType, ValueType >::empty().
|
inline |
|
inline |
Removes a node from the tree and deletes it.
Definition at line 675 of file irrMap.h.
References _IRR_IMPLEMENT_MANAGED_MARSHALLING_BUGFIX, and irr::core::map< KeyType, ValueType >::find().
|
inline |
Replaces the value if the key already exists, otherwise inserts a new element.
\param k The index for this value
v | The new value of |
Definition at line 623 of file irrMap.h.
References irr::core::map< KeyType, ValueType >::find(), and irr::core::map< KeyType, ValueType >::insert().
Referenced by irr::core::map< KeyType, ValueType >::AccessClass::operator=().
|
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 |
The Irrlicht
Engine Documentation © 2003-2010 by Nikolaus Gebhardt. Generated
on Fri Mar 21 2014 04:40:21 by Doxygen
(1.8.1.2) |