Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
Aleph::AABBTree::Node Struct Reference

Internal tree node structure. More...

Collaboration diagram for Aleph::AABBTree::Node:
[legend]

Public Member Functions

bool is_leaf () const
 Checks if this node is a leaf.
 

Public Attributes

Rectangle bbox
 Bounding box enclosing all descendants.
 
size_t left = ~static_cast<size_t>(0)
 Left child index.
 
size_t right = ~static_cast<size_t>(0)
 Right child index.
 
size_t entry_idx = ~static_cast<size_t>(0)
 Index in entries_ (leaf only).
 

Detailed Description

Internal tree node structure.

Definition at line 12103 of file geom_algorithms.H.

Member Function Documentation

◆ is_leaf()

bool Aleph::AABBTree::Node::is_leaf ( ) const
inline

Member Data Documentation

◆ bbox

Rectangle Aleph::AABBTree::Node::bbox

Bounding box enclosing all descendants.

Definition at line 12105 of file geom_algorithms.H.

Referenced by Aleph::AABBTree::build(), Aleph::AABBTree::debug_snapshot(), Aleph::AABBTree::query_impl(), and Aleph::AABBTree::query_point_impl().

◆ entry_idx

size_t Aleph::AABBTree::Node::entry_idx = ~static_cast<size_t>(0)

◆ left

size_t Aleph::AABBTree::Node::left = ~static_cast<size_t>(0)

◆ right

size_t Aleph::AABBTree::Node::right = ~static_cast<size_t>(0)

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