|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Strict weak ordering constraint for BST comparators. More...
#include <ah-concepts.H>
Strict weak ordering constraint for BST comparators.
Used by BST classes (Gen_Avl_Tree, Gen_Rb_Tree, etc.) to constrain the Compare template parameter. Based on std::strict_weak_order, which requires the functor to be a regular invocable returning a boolean-testable result.
| F | functor type. |
| T | key type. |
Definition at line 84 of file ah-concepts.H.