CrystalSpace

Public API Reference

csRedBlackTree< K, Allocator, Ordering > Member List

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

Generated for Crystal Space 2.1 by doxygen 1.6.1