A node of the STR tree. More...
#include <AbstractNode.h>
Public Member Functions | |
| AbstractNode (int newLevel, std::size_t capacity=10) | |
| std::vector< Boundable * > * | getChildBoundables () |
| const std::vector< Boundable * > * | getChildBoundables () const |
| const void * | getBounds () const override |
| int | getLevel () |
| void | addChildBoundable (Boundable *childBoundable) |
| bool | isLeaf () const override |
Protected Member Functions | |
| virtual void * | computeBounds () const =0 |
Protected Attributes | |
| void * | bounds |
Detailed Description
A node of the STR tree.
The children of this node are either more nodes (AbstractNodes) or real data (ItemBoundables).
If this node contains real data (rather than nodes), then we say that this node is a "leaf node".
Member Function Documentation
◆ addChildBoundable()
|
inline |
Adds either an AbstractNode, or if this is a leaf node, a data object (wrapped in an ItemBoundable)
◆ getBounds()
|
inlineoverridevirtual |
Returns a representation of space that encloses this Boundable, preferably not much bigger than this Boundable's boundary yet fast to test for intersection with the bounds of other Boundables. The class of object returned depends on the subclass of AbstractSTRtree.
- Returns
- an Envelope (for STRtrees), an Interval (for SIRtrees), or other object (for other subclasses of AbstractSTRtree)
- See also
- AbstractSTRtree::IntersectsOp
Implements geos::index::strtree::Boundable.
◆ getLevel()
|
inline |
Returns 0 if this node is a leaf, 1 if a parent of a leaf, and so on; the root node will have the highest level
The documentation for this class was generated from the following file:
