Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::DebugNode Struct Reference

One node of a debug_snapshot, independent of Payload. More...

#include <tpl_r_tree.H>

Collaboration diagram for Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::DebugNode:

Public Attributes
Rectangle	bbox
	Tight MBR of this node.
bool	is_leaf = false
	True for leaf nodes (see entry_boxes).
size_t	depth = 0
	Root is 0, increasing towards the leaves.
Array< size_t >	children = Array<size_t>(0)
	Indices into DebugSnapshot::nodes (internal nodes).
Array< Rectangle >	entry_boxes = Array<Rectangle>(0)
	Data-entry boxes stored here (leaves only).

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 >::DebugNode

One node of a debug_snapshot, independent of Payload.

Unlike AABBTree::DebugNode, an R-tree node may have more than two children, so children lists every child by index into the enclosing DebugSnapshot::nodes rather than a fixed left/right pair.

Definition at line 140 of file tpl_r_tree.H.

Member Data Documentation

bbox

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

Rectangle Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::DebugNode::bbox

Tight MBR of this node.

Definition at line 142 of file tpl_r_tree.H.

children

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

Array<size_t> Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::DebugNode::children = Array<size_t>(0)

Indices into DebugSnapshot::nodes (internal nodes).

Definition at line 145 of file tpl_r_tree.H.

depth

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

size_t Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::DebugNode::depth = 0

Root is 0, increasing towards the leaves.

Definition at line 144 of file tpl_r_tree.H.

entry_boxes

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

Array<Rectangle> Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::DebugNode::entry_boxes = Array<Rectangle>(0)

Data-entry boxes stored here (leaves only).

Definition at line 146 of file tpl_r_tree.H.

is_leaf

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

bool Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::DebugNode::is_leaf = false

True for leaf nodes (see entry_boxes).

Definition at line 143 of file tpl_r_tree.H.

---

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

• tpl_r_tree.H