Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::DebugSnapshot Struct Reference

Full tree structure captured for visualization/debugging. More...

#include <tpl_r_tree.H>

Collaboration diagram for Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::DebugSnapshot:
[legend]

Public Attributes

Array< DebugNode > nodes
 Every node, in preorder.
 
size_t root = std::numeric_limits<size_t>::max()
 Index of the root in nodes.
 

Detailed Description

template<typename Payload, size_t MaxEntries = 16, size_t MinEntries = MaxEntries / 2, RTreeVariant Variant = RTreeVariant::Guttman>
struct Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::DebugSnapshot

Full tree structure captured for visualization/debugging.

Note
Intentionally omits Payload: it is available regardless of whether Payload is copyable or even move-only.

Definition at line 153 of file tpl_r_tree.H.

Member Data Documentation

◆ nodes

template<typename Payload , size_t MaxEntries = 16, size_t MinEntries = MaxEntries / 2, RTreeVariant Variant = RTreeVariant::Guttman>
Array<DebugNode> Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::DebugSnapshot::nodes

Every node, in preorder.

Definition at line 155 of file tpl_r_tree.H.

◆ root

template<typename Payload , size_t MaxEntries = 16, size_t MinEntries = MaxEntries / 2, RTreeVariant Variant = RTreeVariant::Guttman>
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.


The documentation for this struct was generated from the following file: