|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Full tree structure captured for visualization/debugging. More...
#include <tpl_r_tree.H>
Public Attributes | |
| Array< DebugNode > | nodes |
| Every node, in preorder. | |
| size_t | root = std::numeric_limits<size_t>::max() |
| Index of the root in nodes. | |
Full tree structure captured for visualization/debugging.
Payload: it is available regardless of whether Payload is copyable or even move-only. Definition at line 153 of file tpl_r_tree.H.
| Array<DebugNode> Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::DebugSnapshot::nodes |
Every node, in preorder.
Definition at line 155 of file tpl_r_tree.H.
| size_t Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::DebugSnapshot::root = std::numeric_limits<size_t>::max() |
Index of the root in nodes.
Definition at line 156 of file tpl_r_tree.H.