|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
BST comparator for intervals: order by (low, then high). More...
#include <tpl_interval_tree.H>
Public Member Functions | |
| Interval_Less (const Compare &c=Compare()) noexcept(std::is_nothrow_copy_constructible_v< Compare >) | |
| Constructor. | |
| bool | operator() (const Interval< T > &a, const Interval< T > &b) const noexcept(std::is_nothrow_invocable_v< const Compare &, const T &, const T & >) |
| Comparison operator. | |
Public Attributes | |
| Compare | cmp |
BST comparator for intervals: order by (low, then high).
| T | Endpoint type. |
| Compare | Comparison functor for endpoints. |
Definition at line 205 of file tpl_interval_tree.H.
|
inlinenoexcept |
Constructor.
| [in] | c | Endpoint comparison functor. |
| none |
Definition at line 213 of file tpl_interval_tree.H.
|
inlinenoexcept |
Comparison operator.
| [in] | a | First interval. |
| [in] | b | Second interval. |
| none |
Definition at line 223 of file tpl_interval_tree.H.
References Aleph::Interval_Less< T, Compare >::cmp.
| Compare Aleph::Interval_Less< T, Compare >::cmp |
Definition at line 207 of file tpl_interval_tree.H.
Referenced by Aleph::Interval_Less< T, Compare >::operator()().