20 #ifndef GEOS_INDEX_STRTREE_STRTREE_H
21 #define GEOS_INDEX_STRTREE_STRTREE_H
23 #include <geos/export.h>
24 #include <geos/index/strtree/AbstractSTRtree.h>
25 #include <geos/index/SpatialIndex.h>
26 #include <geos/geom/Envelope.h>
32 #pragma warning(disable: 4251) // warning C4251: needs to have dll-interface to be used by clients of class
71 bool intersects(
const void* aBounds,
const void* bBounds);
81 std::auto_ptr<BoundableList> createParentBoundables(
BoundableList* childBoundables,
int newLevel);
83 std::auto_ptr<BoundableList> createParentBoundablesFromVerticalSlices(std::vector<BoundableList*>* verticalSlices,
int newLevel);
85 STRIntersectsOp intersectsOp;
87 std::auto_ptr<BoundableList> sortBoundables(
const BoundableList* input);
89 std::auto_ptr<BoundableList> createParentBoundablesFromVerticalSlice(
98 std::vector<BoundableList*>* verticalSlices(
108 return &intersectsOp;
119 STRtree(std::size_t nodeCapacity=10);
125 static double avg(
double a,
double b) {
126 return (a + b) / 2.0;
142 return AbstractSTRtree::remove(itemEnv, item);
155 #endif // GEOS_INDEX_STRTREE_STRTREE_H
An Envelope defines a rectangulare region of the 2D coordinate plane.
Definition: Envelope.h:54
Base class for STRtree and SIRtree.
Definition: AbstractSTRtree.h:133
void query(const void *searchBounds, std::vector< void * > &foundItems)
Also builds the tree, if necessary.
void query(const geom::Envelope *searchEnv, ItemVisitor &visitor)
Queries the index for all items whose extents intersect the given search Envelope and applies an Item...
Definition: STRtree.h:137
A query-only R-tree created using the Sort-Tile-Recursive (STR) algorithm. For two-dimensional spatia...
Definition: STRtree.h:63
void query(const geom::Envelope *searchEnv, std::vector< void * > &matches)
Queries the index for all items whose extents intersect the given search Envelope.
Definition: STRtree.h:133
Abstract class defines basic insertion and query operations supported by classes implementing spatial...
Definition: SpatialIndex.h:48
A test for intersection between two bounds, necessary because subclasses of AbstractSTRtree have diff...
Definition: AbstractSTRtree.h:167
A visitor for items in an index.
Definition: ItemVisitor.h:30
virtual void insert(const void *bounds, void *item)
Also builds the tree, if necessary.
A node of the STR tree.
Definition: AbstractNode.h:43
std::vector< Boundable * > BoundableList
A list of boundables. TODO: use a list.
Definition: AbstractSTRtree.h:45
IntersectsOp * getIntersectsOp()
Definition: STRtree.h:107