Box() | ugdk::structure::Box< DIMENSIONS > | |
Box(const Point &min_coordinates, const Point &max_coordinates) | ugdk::structure::Box< DIMENSIONS > | |
Clear() | ugdk::structure::ikdtree::Node< T, DIMENSIONS > | |
Contains(const Box &box) const | ugdk::structure::Box< DIMENSIONS > | |
depth_ | ugdk::structure::ikdtree::Node< T, DIMENSIONS > | |
division_boundary_ | ugdk::structure::ikdtree::Node< T, DIMENSIONS > | |
FindIntersectingItems(const Box< DIMENSIONS > &boundary, Iterator it) const | ugdk::structure::ikdtree::Node< T, DIMENSIONS > | |
has_children_ | ugdk::structure::ikdtree::Node< T, DIMENSIONS > | |
InsertItem(Item< T, DIMENSIONS > *item) | ugdk::structure::ikdtree::Node< T, DIMENSIONS > | |
Intersects(const Box *box) const | ugdk::structure::Box< DIMENSIONS > | |
IsAbove(int depth, Coordinate boundary) const | ugdk::structure::Box< DIMENSIONS > | |
IsBelow(int depth, Coordinate boundary) const | ugdk::structure::Box< DIMENSIONS > | |
max_coordinates() const | ugdk::structure::Box< DIMENSIONS > | |
max_coordinates_ | ugdk::structure::Box< DIMENSIONS > | protected |
min_coordinates() const | ugdk::structure::Box< DIMENSIONS > | |
min_coordinates_ | ugdk::structure::Box< DIMENSIONS > | protected |
Node(IntervalKDTree< T, DIMENSIONS > *tree, Node *parent, int depth, const std::array< Coordinate, DIMENSIONS > &min_coordinates, const std::array< Coordinate, DIMENSIONS > &max_coordinates) | ugdk::structure::ikdtree::Node< T, DIMENSIONS > | |
Node(IntervalKDTree< T, DIMENSIONS > *tree, Node *parent, int depth, const Box< DIMENSIONS > &coordinates) | ugdk::structure::ikdtree::Node< T, DIMENSIONS > | |
Point typedef | ugdk::structure::Box< DIMENSIONS > | |
RemoveItem(Item< T, DIMENSIONS > *item) | ugdk::structure::ikdtree::Node< T, DIMENSIONS > | |
UpdateBox(const Box &) | ugdk::structure::Box< DIMENSIONS > | |
~Box() | ugdk::structure::Box< DIMENSIONS > | virtual |
~Node() | ugdk::structure::ikdtree::Node< T, DIMENSIONS > | |