15 #ifndef GEOS_INDEX_STRTREE_SIRTREE_H 16 #define GEOS_INDEX_STRTREE_SIRTREE_H 18 #include <geos/export.h> 20 #include <geos/index/strtree/AbstractSTRtree.h> 21 #include <geos/index/strtree/Interval.h> 56 SIRtree(std::size_t nodeCapacity);
60 void insert(
double x1,
double x2,
void* item);
66 std::vector<void*>*
query(
double x1,
double x2)
68 std::vector<void*>* results =
new std::vector<void*>();
69 Interval interval(std::min(x1, x2), std::max(x1, x2));
77 std::vector<void*>*
query(
double x) {
return query(x,x); }
84 bool intersects(
const void* aBounds,
const void* bBounds);
91 std::auto_ptr<BoundableList> createParentBoundables(
94 AbstractNode* createNode(
int level);
98 std::auto_ptr<BoundableList> sortBoundables(
const BoundableList* input);
102 IntersectsOp* intersectsOp;
110 #endif // GEOS_INDEX_STRTREE_SIRTREE_H A contiguous portion of 1D-space. Used internally by SIRtree.
Definition: strtree/Interval.h:28
std::vector< void * > * query(double x1, double x2)
Definition: SIRtree.h:66
std::vector< void * > * query(double x)
Definition: SIRtree.h:77
Base class for STRtree and SIRtree.
Definition: AbstractSTRtree.h:132
IntersectsOp * getIntersectsOp()
Definition: SIRtree.h:96
A test for intersection between two bounds, necessary because subclasses of AbstractSTRtree have diff...
Definition: AbstractSTRtree.h:166
virtual void insert(const void *bounds, void *item)
Also builds the tree, if necessary.
Basic namespace for all GEOS functionalities.
Definition: IndexedNestedRingTester.h:25
void query(const void *searchBounds, std::vector< void *> &foundItems)
Also builds the tree, if necessary.
One-dimensional version of an STR-packed R-tree.
Definition: SIRtree.h:41
std::vector< Boundable * > BoundableList
A list of boundables. TODO: use a list.
Definition: AbstractSTRtree.h:44