CS::Container::RedBlackTreeOrderingStrictWeak< K, K2 > Class Template Reference (Crystal Space 2.0 Public API Reference)

| ## Public API Reference

- Main Page
- Related Pages
- Modules
- Namespaces
- Classes
- Files

- Class List
- Class Index
- Class Hierarchy
- Class Members

CS::Container::RedBlackTreeOrderingStrictWeak< K, K2 > Class Template Reference

Strict weak ordering (http://en.wikipedia.org/wiki/Strict_weak_ordering) for red-black-trees. More...

`#include <csutil/redblacktree.h>`

List of all members.

## Detailed Description

### template<typename K, typename K2>
class CS::Container::RedBlackTreeOrderingStrictWeak< K, K2 >

Strict weak ordering (http://en.wikipedia.org/wiki/Strict_weak_ordering) for red-black-trees.

  requires the key type to implement `operator<()` and `operator==()`

  the following axioms shall be true: !(a < a), a < b <=> !(b < a), a < b && b < c <=> a < c

Definition at line 137 of file redblacktree.h.

The documentation for this class was generated from the following file:

- csutil/redblacktree.h