| Box(const Coordinate *min_coordinates, const Coordinate *max_coordinates) | ugdk::ikdtree::Box< DIMENSIONS > | |
| Box(const Box &box) | ugdk::ikdtree::Box< DIMENSIONS > | |
| Clear() | ugdk::ikdtree::Node< T, DIMENSIONS > | |
| Contains(const Box &box) const | ugdk::ikdtree::Box< DIMENSIONS > | |
| depth_ | ugdk::ikdtree::Node< T, DIMENSIONS > | |
| division_boundary_ | ugdk::ikdtree::Node< T, DIMENSIONS > | |
| getIntersectingItems(const Box< DIMENSIONS > &boundary, std::vector< T > *items) const | ugdk::ikdtree::Node< T, DIMENSIONS > | |
| has_children_ | ugdk::ikdtree::Node< T, DIMENSIONS > | |
| InsertItem(Item< T, DIMENSIONS > *item) | ugdk::ikdtree::Node< T, DIMENSIONS > | |
| Intersects(const Box *box) const | ugdk::ikdtree::Box< DIMENSIONS > | |
| IsAbove(int depth, Coordinate boundary) const | ugdk::ikdtree::Box< DIMENSIONS > | |
| IsBelow(int depth, Coordinate boundary) const | ugdk::ikdtree::Box< DIMENSIONS > | |
| max_coordinates_ | ugdk::ikdtree::Box< DIMENSIONS > | protected |
| min_coordinates_ | ugdk::ikdtree::Box< DIMENSIONS > | protected |
| Node(IntervalKDTree< T, DIMENSIONS > *const tree, Node *parent, int depth, Coordinate *min_coordinates, Coordinate *max_coordinates) | ugdk::ikdtree::Node< T, DIMENSIONS > | |
| Node(IntervalKDTree< T, DIMENSIONS > *const tree, Node *parent, int depth, const Box< DIMENSIONS > &coordinates) | ugdk::ikdtree::Node< T, DIMENSIONS > | |
| RemoveItem(Item< T, DIMENSIONS > *item) | ugdk::ikdtree::Node< T, DIMENSIONS > | |
| setBox(const Box &box) | ugdk::ikdtree::Box< DIMENSIONS > | |
| ~Box() | ugdk::ikdtree::Box< DIMENSIONS > | |
| ~Node() | ugdk::ikdtree::Node< T, DIMENSIONS > | |