CrystalSpace

Public API Reference

csRedBlackTreeMap< K, T, Allocator, Ordering > Member List

This is the complete list of members for csRedBlackTreeMap< K, T, Allocator, Ordering >, including all inherited members.
ConstIterator classcsRedBlackTreeMap< K, T, Allocator, Ordering > [friend]
ConstReverseIterator classcsRedBlackTreeMap< K, T, Allocator, Ordering > [friend]
Contains(const csRedBlackTreePayload< K, T > &key) constcsRedBlackTree< csRedBlackTreePayload< K, T >, Allocator, Ordering > [inline, protected]
CreateNode(Node *parent, const csRedBlackTreePayload< K, T > &key)csRedBlackTree< csRedBlackTreePayload< K, T >, Allocator, Ordering > [inline, protected]
csRedBlackTree(const Allocator &alloc=Allocator())csRedBlackTree< csRedBlackTreePayload< K, T >, Allocator, Ordering > [inline, protected]
Delete(const K &key)csRedBlackTreeMap< K, T, Allocator, Ordering > [inline]
Delete(Iterator &it)csRedBlackTreeMap< K, T, Allocator, Ordering > [inline]
csRedBlackTree< csRedBlackTreePayload< K, T >, Allocator, Ordering >::Delete(const csRedBlackTreePayload< K, T > &key)csRedBlackTree< csRedBlackTreePayload< K, T >, Allocator, Ordering > [inline, protected]
csRedBlackTree< csRedBlackTreePayload< K, T >, Allocator, Ordering >::Delete(Iterator &it)csRedBlackTree< csRedBlackTreePayload< K, T >, Allocator, Ordering > [inline, protected]
DeleteAll()csRedBlackTreeMap< K, T, Allocator, Ordering > [inline]
DeleteExact(const csRedBlackTreePayload< K, T > *key)csRedBlackTree< csRedBlackTreePayload< K, T >, Allocator, Ordering > [inline, protected]
DeleteFixup(Node *node, Node *nilParent)csRedBlackTree< csRedBlackTreePayload< K, T >, Allocator, Ordering > [inline, protected]
DeleteNode(Node *node)csRedBlackTree< csRedBlackTreePayload< K, T >, Allocator, Ordering > [inline, protected]
Empty()csRedBlackTreeMap< K, T, Allocator, Ordering > [inline]
Find(const K2 &other) constcsRedBlackTree< csRedBlackTreePayload< K, T >, Allocator, Ordering > [inline, protected]
Find(const K2 &other, const csRedBlackTreePayload< K, T > &fallback) constcsRedBlackTree< csRedBlackTreePayload< K, T >, Allocator, Ordering > [inline, protected]
FindGreatestSmallerEqual(const K2 &other) constcsRedBlackTree< csRedBlackTreePayload< K, T >, Allocator, Ordering > [inline, protected]
FindGreatestSmallerEqual(const K2 &other, const csRedBlackTreePayload< K, T > &fallback) constcsRedBlackTree< csRedBlackTreePayload< K, T >, Allocator, Ordering > [inline, protected]
FindInternal(const K2 &other)csRedBlackTree< csRedBlackTreePayload< K, T >, Allocator, Ordering > [inline, protected]
FindInternal(const K2 &other, csRedBlackTreePayload< K, T > &fallback)csRedBlackTree< csRedBlackTreePayload< K, T >, Allocator, Ordering > [inline, protected]
FindSmallestGreaterEqual(const K2 &other) constcsRedBlackTree< csRedBlackTreePayload< K, T >, Allocator, Ordering > [inline, protected]
FindSmallestGreaterEqual(const K2 &other, const csRedBlackTreePayload< K, T > &fallback) constcsRedBlackTree< csRedBlackTreePayload< K, T >, Allocator, Ordering > [inline, protected]
Get(const K &key, const T &fallback) const csRedBlackTreeMap< K, T, Allocator, Ordering > [inline]
Get(const K &key, T &fallback)csRedBlackTreeMap< K, T, Allocator, Ordering > [inline]
GetElementPointer(const K &key) const csRedBlackTreeMap< K, T, Allocator, Ordering > [inline]
GetElementPointer(const K &key)csRedBlackTreeMap< K, T, Allocator, Ordering > [inline]
GetIterator() const csRedBlackTreeMap< K, T, Allocator, Ordering > [inline]
GetIterator()csRedBlackTreeMap< K, T, Allocator, Ordering > [inline]
GetReverseIterator() const csRedBlackTreeMap< K, T, Allocator, Ordering > [inline]
GetReverseIterator()csRedBlackTreeMap< K, T, Allocator, Ordering > [inline]
In(const csRedBlackTreePayload< K, T > &key) constcsRedBlackTree< csRedBlackTreePayload< K, T >, Allocator, Ordering > [inline, protected]
Insert(const csRedBlackTreePayload< K, T > &key)csRedBlackTree< csRedBlackTreePayload< K, T >, Allocator, Ordering > [inline, protected]
InsertFixup(Node *node)csRedBlackTree< csRedBlackTreePayload< K, T >, Allocator, Ordering > [inline, protected]
IsBlack(Node *node) constcsRedBlackTree< csRedBlackTreePayload< K, T >, Allocator, Ordering > [inline, protected]
IsEmpty() const csRedBlackTreeMap< K, T, Allocator, Ordering > [inline]
IsRed(Node *node) constcsRedBlackTree< csRedBlackTreePayload< K, T >, Allocator, Ordering > [inline, protected]
Iterator classcsRedBlackTreeMap< K, T, Allocator, Ordering > [friend]
LocateNode(Node *node, const K2 &other) constcsRedBlackTree< csRedBlackTreePayload< K, T >, Allocator, Ordering > [inline, protected]
LocateNodeExact(Node *node, const csRedBlackTreePayload< K, T > *key) constcsRedBlackTree< csRedBlackTreePayload< K, T >, Allocator, Ordering > [inline, protected]
Predecessor(const Node *node)csRedBlackTree< csRedBlackTreePayload< K, T >, Allocator, Ordering > [inline, protected, static]
Put(const K &key, const T &value)csRedBlackTreeMap< K, T, Allocator, Ordering > [inline]
RecursiveCopy(Node *&to, Node *parent, const Node *from)csRedBlackTree< csRedBlackTreePayload< K, T >, Allocator, Ordering > [inline, protected]
RecursiveDelete(Node *node)csRedBlackTree< csRedBlackTreePayload< K, T >, Allocator, Ordering > [inline, protected]
RecursiveFindGSE(Node *node, const K2 &other) constcsRedBlackTree< csRedBlackTreePayload< K, T >, Allocator, Ordering > [inline, protected]
RecursiveFindInsertCandidate(Node *parent, Node *&node, const csRedBlackTreePayload< K, T > &key, uint depth, InsertCandidate &candidate)csRedBlackTree< csRedBlackTreePayload< K, T >, Allocator, Ordering > [inline, protected]
RecursiveFindSGE(Node *node, const K2 &other) constcsRedBlackTree< csRedBlackTreePayload< K, T >, Allocator, Ordering > [inline, protected]
RecursiveTraverseInOrder(Node *node, CB &callback) constcsRedBlackTree< csRedBlackTreePayload< K, T >, Allocator, Ordering > [inline, protected]
ReverseIterator classcsRedBlackTreeMap< K, T, Allocator, Ordering > [friend]
RotateLeft(Node *pivot)csRedBlackTree< csRedBlackTreePayload< K, T >, Allocator, Ordering > [inline, protected]
RotateRight(Node *pivot)csRedBlackTree< csRedBlackTreePayload< K, T >, Allocator, Ordering > [inline, protected]
Successor(const Node *node)csRedBlackTree< csRedBlackTreePayload< K, T >, Allocator, Ordering > [inline, protected, static]
TraverseInOrder(CB &callback) const csRedBlackTreeMap< K, T, Allocator, Ordering > [inline]
~csRedBlackTree()csRedBlackTree< csRedBlackTreePayload< K, T >, Allocator, Ordering > [inline, protected]

Generated for Crystal Space 2.0 by doxygen 1.6.1