#include <aaboxtree.h>
◆ Leaf()
Tree::AABoxTree::Leaf::Leaf |
( |
Branch * | pParent, |
|
|
const Primitive2D::AABoundingBox & | box ) |
◆ ~Leaf()
virtual Tree::AABoxTree::Leaf::~Leaf |
( |
| ) |
|
|
virtual |
◆ find()
virtual Leaf * Tree::AABoxTree::Leaf::find |
( |
const Primitive2D::AABoundingBox & | box | ) |
|
|
virtual |
◆ getBaseIndex()
Handle Tree::AABoxTree::Leaf::getBaseIndex |
( |
| ) |
const |
|
inline |
- Returns
- The index in the super-class AABoxTree:pNode.
◆ getLeaves()
virtual HeapArray< Leaf * > Tree::AABoxTree::Leaf::getLeaves |
( |
| ) |
|
|
virtual |
◆ hasDuplicates()
bool Tree::AABoxTree::Leaf::hasDuplicates |
( |
| ) |
const |
|
inline |
◆ inside() [1/2]
virtual HeapArray< Leaf * > Tree::AABoxTree::Leaf::inside |
( |
const Primitive2D::AABoundingBox & | box, |
|
|
float | precision = 0.0f ) |
|
virtual |
◆ inside() [2/2]
virtual HeapArray< Leaf * > Tree::AABoxTree::Leaf::inside |
( |
const Vertex2f & | v, |
|
|
float | precision = 0.0f ) |
|
virtual |
◆ intersect()
virtual HeapArray< Leaf * > Tree::AABoxTree::Leaf::intersect |
( |
const Primitive2D::AABoundingBox & | box | ) |
|
|
virtual |
◆ nearest()
virtual Leaf * Tree::AABoxTree::Leaf::nearest |
( |
const Vertex2f & | vertex | ) |
|
|
virtual |
◆ within()
virtual HeapArray< Leaf * > Tree::AABoxTree::Leaf::within |
( |
const Primitive2D::AABoundingBox & | box, |
|
|
float | precision = 0.0f ) |
|
virtual |
◆ AABoxTree
The documentation for this class was generated from the following file: