GEOS
3.6.1
|
One-dimensional version of an STR-packed R-tree. More...
#include <SIRtree.h>
Public Member Functions | |
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) |
![]() | |
AbstractSTRtree (std::size_t newNodeCapacity) | |
virtual void | build () |
virtual std::size_t | getNodeCapacity () |
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 () |
Protected Member Functions | |
std::auto_ptr< BoundableList > | createParentBoundables (BoundableList *childBoundables, int newLevel) |
Sorts the childBoundables then divides them into groups of size M, where M is the node capacity. | |
AbstractNode * | createNode (int level) |
IntersectsOp * | getIntersectsOp () |
std::auto_ptr< BoundableList > | sortBoundables (const BoundableList *input) |
![]() | |
virtual AbstractNode * | lastNode (BoundableList *nodes) |
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::auto_ptr< BoundableList > | boundablesAtLevel (int level) |
Additional Inherited Members | |
![]() | |
static bool | compareDoubles (double a, double b) |
![]() | |
AbstractNode * | root |
std::vector< AbstractNode * > * | nodes |
std::size_t | nodeCapacity |
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.
|
inlineprotectedvirtual |
Implements geos::index::strtree::AbstractSTRtree.
|
inline |
Returns items whose bounds intersect the given bounds.
x1 | possibly equal to x2 |
References geos::index::strtree::AbstractSTRtree::query().
|
inline |