Total ordering (http://en.wikipedia.org/wiki/Total_ordering) for red-black-trees.
More...
#include <csutil/redblacktree.h>
List of all members.
Detailed Description
template<typename K, typename K2>
class CS::Container::RedBlackTreeOrderingTotal< K, K2 >
Total ordering (http://en.wikipedia.org/wiki/Total_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, a <= b && b <= c => a <= c
Definition at line 161 of file redblacktree.h.
The documentation for this class was generated from the following file: