|
| SIRtree () |
| Constructs an SIRtree with the default node capacity.
|
|
| SIRtree (std::size_t nodeCapacity) |
| Constructs an SIRtree with the given maximum number of child nodes that a node may have.
|
|
void | insert (double x1, double x2, void *item) |
|
std::vector< void * > * | query (double x1, double x2) |
|
std::vector< void * > * | query (double x) |
|
| SIRtree (const SIRtree &)=delete |
|
SIRtree & | operator= (const SIRtree &)=delete |
|
| AbstractSTRtree (std::size_t newNodeCapacity) |
| Constructs an AbstractSTRtree with the specified maximum number of child nodes that a node may have.
|
|
virtual void | build () |
| Creates parent nodes, grandparent nodes, and so forth up to the root node, for the data that has been inserted into the tree. More...
|
|
virtual std::size_t | getNodeCapacity () |
| Returns the maximum number of child nodes that a node may have.
|
|
virtual void | query (const void *searchBounds, const AbstractNode *node, std::vector< void * > *matches) |
|
void | iterate (ItemVisitor &visitor) |
|
virtual void | boundablesAtLevel (int level, AbstractNode *top, BoundableList *boundables) |
|
ItemsList * | itemsTree () |
| Gets a tree structure (as a nested list) corresponding to the structure of the items and nodes in this tree. More...
|
|
|
std::unique_ptr< BoundableList > | createParentBoundables (BoundableList *childBoundables, int newLevel) override |
| Sorts the childBoundables then divides them into groups of size M, where M is the node capacity.
|
|
AbstractNode * | createNode (int level) override |
|
IntersectsOp * | getIntersectsOp () override |
|
std::unique_ptr< BoundableList > | sortBoundables (const BoundableList *input) |
|
virtual AbstractNode * | lastNode (BoundableList *nodeList) |
|
virtual AbstractNode * | getRoot () |
|
virtual void | insert (const void *bounds, void *item) |
| Also builds the tree, if necessary.
|
|
void | query (const void *searchBounds, std::vector< void * > &foundItems) |
| Also builds the tree, if necessary.
|
|
void | query (const void *searchBounds, ItemVisitor &visitor) |
| Also builds the tree, if necessary.
|
|
void | query (const void *searchBounds, const AbstractNode &node, ItemVisitor &visitor) |
|
bool | remove (const void *itemEnv, void *item) |
| Also builds the tree, if necessary.
|
|
std::unique_ptr< BoundableList > | boundablesAtLevel (int level) |
|
One-dimensional version of an STR-packed R-tree.
SIR stands for "Sort-Interval-Recursive".
STR-packed R-trees are described in: P. Rigaux, Michel Scholl and Agnes Voisard. Spatial Databases With Application To GIS. Morgan Kaufmann, San Francisco, 2002.
- See also
- STRtree