|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Internal-node entry: a child subtree plus its tight bounding box. More...
Public Attributes | |
| Rectangle | bbox |
| Tight MBR of child. | |
| std::unique_ptr< Node > | child |
| Owned child subtree. | |
Internal-node entry: a child subtree plus its tight bounding box.
Definition at line 163 of file tpl_r_tree.H.
| 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().
| 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().