| BBox typedef | geom::BBoxTreeLeaf< N, T > | |
| BBoxTreeLeaf(ObjectIter base, ObjectIterIter begin, ObjectIterIter end) | geom::BBoxTreeLeaf< N, T > | |
| checkValidity(const std::vector< BBox > &boxes) const | geom::BBoxTreeLeaf< N, T > | [virtual] |
| computeDomain(const std::vector< BBox > &boxes) | geom::BBoxTreeLeaf< N, T > | [virtual] |
| computeMinimumDistanceQuery(std::vector< const Leaf * > &leaves, const Point &x, Number *upperBound) const | geom::BBoxTreeLeaf< N, T > | |
| geom::BBoxTreeNode::computeMinimumDistanceQuery(std::vector< const Leaf * > &leaves, const Point &x, Number *upperBound) const =0 | geom::BBoxTreeNode< N, T > | [pure virtual] |
| computePointQuery(std::vector< const Leaf * > &leaves, const Point &x) const | geom::BBoxTreeLeaf< N, T > | [inline] |
| geom::BBoxTreeNode::computePointQuery(std::vector< const Leaf * > &leaves, const Point &x) const =0 | geom::BBoxTreeNode< N, T > | [pure virtual] |
| computeWindowQuery(std::vector< const Leaf * > &leaves, const BBox &window) const | geom::BBoxTreeLeaf< N, T > | [inline] |
| geom::BBoxTreeNode::computeWindowQuery(std::vector< const Leaf * > &leaves, const BBox &window) const =0 | geom::BBoxTreeNode< N, T > | [pure virtual] |
| getDomain() const | geom::BBoxTreeLeaf< N, T > | [inline, virtual] |
| getIndicesBeginning() const | geom::BBoxTreeLeaf< N, T > | [inline] |
| getIndicesEnd() const | geom::BBoxTreeLeaf< N, T > | [inline] |
| getMemoryUsage() const | geom::BBoxTreeLeaf< N, T > | [inline, virtual] |
| IndexConstIterator typedef | geom::BBoxTreeLeaf< N, T > | |
| Number typedef | geom::BBoxTreeLeaf< N, T > | |
| operator<<(std::ostream &out, const BBoxTreeNode< N, T > &node) | geom::BBoxTreeNode< N, T > | [related] |
| Point typedef | geom::BBoxTreeLeaf< N, T > | |
| printAscii(std::ostream &out) const | geom::BBoxTreeLeaf< N, T > | [virtual] |
| SizeType typedef | geom::BBoxTreeLeaf< N, T > | |
| ~BBoxTreeLeaf() | geom::BBoxTreeLeaf< N, T > | [inline, virtual] |
| ~BBoxTreeNode() | geom::BBoxTreeNode< N, T > | [inline, virtual] |
