Classes |
class | csRedBlackTreeMap< K, T, Allocator, Ordering >::ConstIterator |
| Const iterator for map. More...
|
class | csRedBlackTree< K, Allocator, Ordering >::ConstIterator |
| Const iterator for tree. More...
|
class | csRedBlackTreeMap< K, T, Allocator, Ordering >::ConstReverseIterator |
| Const reverse iterator for map. More...
|
class | csRedBlackTree< K, Allocator, Ordering >::ConstReverseIterator |
| Const reverse iterator for tree. More...
|
class | csRedBlackTree< K, Allocator, Ordering > |
| A red-black-tree. More...
|
class | csRedBlackTreeMap< K, T, Allocator, Ordering > |
| Key-value-map, backed by csRedBlackTree. More...
|
class | csRedBlackTreePayload< K, T > |
| Helper template to allow storage of a payload together with a key in a csRedBlackTree. More...
|
struct | CS::Container::DefaultRedBlackTreeAllocator< K > |
| Default allocator for red black trees. More...
|
class | csRedBlackTreeMap< K, T, Allocator, Ordering >::Iterator |
| Iterator for map. More...
|
class | csRedBlackTree< K, Allocator, Ordering >::Iterator |
| Iterator for tree. More...
|
class | CS::Container::RedBlackTreeOrderingPartial< K, K2 > |
| Partial ordering (http://en.wikipedia.org/wiki/Partial_order) for red-black-trees. More...
|
class | CS::Container::RedBlackTreeOrderingStrictWeak< K, K2 > |
| Strict weak ordering (http://en.wikipedia.org/wiki/Strict_weak_ordering) for red-black-trees. More...
|
class | CS::Container::RedBlackTreeOrderingTotal< K, K2 > |
| Total ordering (http://en.wikipedia.org/wiki/Total_ordering) for red-black-trees. More...
|
class | csRedBlackTreeMap< K, T, Allocator, Ordering >::ReverseIterator |
| Reverse iterator for map. More...
|
class | csRedBlackTree< K, Allocator, Ordering >::ReverseIterator |
| Reverse iterator for tree. More...
|
Namespaces |
namespace | CS |
| Main namespace for CrystalSpace.
|
namespace | CS::Container |
| Container classes.
|
Implementation of a red-black-tree.