|
| const NodeVec & | nodes () const |
| | const-access to all not-leaf nodes, a tree with N leaves has N-1 nodes
|
| const Node & | operator[] (NodeId nid) const |
| | const-access to any not-leaf node
|
| const Leaves & | leaves () const |
| | all leaves in the order of the tree right after its construction
|
| const Leaf & | leaf (NodeId n) const |
| | returns the leaf encoded in given node id
|
| LeafId | leafId (NodeId n) const |
| | returns the id of the leaf encoded in given node id
|
| const BoxT & | box (NodeId n) const |
| | returns the bounding box of given node or leaf
|
| bool | empty () const |
| | returns true if the tree has no leaves
|
| NodeId | rootNodeId () const |
| BoxT | getBoundingBox () const |
| | returns the root node bounding box
|
| size_t | heapBytes () const |
| | returns the amount of memory this object occupies on heap
|
| size_t | numLeaves () const |
| | returns the number of leaves in whole tree
|
| std::vector< NodeId > | getSubtrees (int minNum) const |
| | returns at least given number of top-level not-intersecting subtrees (some can be leaves), union of which contain all tree leaves
|
| LeafBitSet | getSubtreeLeaves (NodeId subtreeRoot) const |
| | returns all leaves in the subtree with given root (can be a leaf)
|
| NodeBitSet | getNodesFromLeaves (const LeafBitSet &leaves) const |
| | returns set of not-leaf nodes containing among direct or indirect children given leaves
|
| void | getLeafOrder (LeafBMap &leafMap) const |
| void | getLeafOrderAndReset (LeafBMap &leafMap) |
template<typename T>
class MR::AABBTreeBase< T >
base class for the AABB-trees of polylines and objects