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

A node is a leaf holding data or an internal node holding children. More...

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

Public Attributes
bool	leaf = true
Array< Entry >	data = Array<Entry>(0)
	Data entries (used iff leaf).
Array< Child >	children = Array<Child>(0)
	Child entries (used iff not leaf).

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

A node is a leaf holding data or an internal node holding children.

Definition at line 170 of file tpl_r_tree.H.

Member Data Documentation

children

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

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

Child entries (used iff not leaf).

Definition at line 174 of file tpl_r_tree.H.

Referenced by Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::choose_subtree(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::collect_data_entries(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::compute_mbr(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::data_entry_count(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::entry_count(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::for_each_containing_rec(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::for_each_intersecting_rec(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::insert_descend(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::rstar_choose_overlap(), and Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::verify_rec().

data

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

Array<Entry> Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::Node::data = Array<Entry>(0)

Data entries (used iff leaf).

Definition at line 173 of file tpl_r_tree.H.

Referenced by Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::collect_data_entries(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::compute_mbr(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::data_entry_count(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::entry_count(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::for_each_containing_rec(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::for_each_intersecting_rec(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::insert_descend(), and Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::reinsert_farthest().

leaf

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

bool Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::Node::leaf = true

Definition at line 172 of file tpl_r_tree.H.

Referenced by Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::collect_data_entries(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::compute_mbr(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::data_entry_count(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::entry_count(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::for_each_containing_rec(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::for_each_intersecting_rec(), Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::insert_descend(), and Aleph::RTree< Payload, MaxEntries, MinEntries, Variant >::verify_rec().

---

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

• tpl_r_tree.H