|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Data portion of an interval tree node. More...
#include <tpl_interval_tree.H>
Public Member Functions | |
| Interval_Tree_Node_Data () noexcept(std::is_nothrow_default_constructible_v< T >) | |
| Interval_Tree_Node_Data (SentinelCtor) noexcept(std::is_nothrow_default_constructible_v< T >) | |
| unsigned long & | getPriority () noexcept |
| T & | getMaxEndpoint () noexcept |
| const T & | getMaxEndpoint () const noexcept |
Static Public Member Functions | |
| static void | reset () noexcept |
Private Attributes | |
| unsigned long | priority |
| T | max_endpoint |
Data portion of an interval tree node.
Stores the random priority (for treap heap property) and the maximum endpoint in the subtree (for interval query pruning).
| T | Endpoint type. |
Definition at line 259 of file tpl_interval_tree.H.
|
inlinenoexcept |
Definition at line 265 of file tpl_interval_tree.H.
|
inlinenoexcept |
Definition at line 269 of file tpl_interval_tree.H.
|
inlinenoexcept |
Definition at line 276 of file tpl_interval_tree.H.
References Aleph::Interval_Tree_Node_Data< T >::max_endpoint.
|
inlinenoexcept |
Definition at line 275 of file tpl_interval_tree.H.
References Aleph::Interval_Tree_Node_Data< T >::max_endpoint.
Referenced by Aleph::MAX_EP().
|
inlinenoexcept |
Definition at line 273 of file tpl_interval_tree.H.
References Aleph::Interval_Tree_Node_Data< T >::priority.
|
inlinestaticnoexcept |
Definition at line 278 of file tpl_interval_tree.H.
Referenced by Aleph::Interval_Tree_Node< Key >::reset(), and Aleph::Interval_Tree_NodeVtl< Key >::reset().
|
private |
Definition at line 262 of file tpl_interval_tree.H.
Referenced by Aleph::Interval_Tree_Node_Data< T >::getMaxEndpoint(), and Aleph::Interval_Tree_Node_Data< T >::getMaxEndpoint().
Definition at line 261 of file tpl_interval_tree.H.
Referenced by Aleph::Interval_Tree_Node_Data< T >::getPriority().