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

Internal-node entry: a child subtree plus its tight bounding box. More...

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

Public Attributes

Rectangle bbox
 Tight MBR of child.
 
std::unique_ptr< Node > child
 Owned child subtree.
 

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

Internal-node entry: a child subtree plus its tight bounding box.

Definition at line 163 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 >::Child::bbox

Tight MBR of child.

Definition at line 165 of file tpl_r_tree.H.

Referenced by Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::erase_descend().

◆ child

template<typename Payload , size_t MaxEntries = 16, size_t MinEntries = MaxEntries / 2, RTreeVariant Variant = RTreeVariant::Guttman>
std::unique_ptr<Node> Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::Child::child

Owned child subtree.

Definition at line 166 of file tpl_r_tree.H.

Referenced by Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::erase_descend().


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