17#include <geos/export.h>
19#include <geos/index/strtree/AbstractSTRtree.h>
20#include <geos/index/strtree/Interval.h>
59 void insert(
double x1,
double x2,
void* item);
69 std::vector<void*>* results =
new std::vector<void*>();
70 Interval interval(std::min(x1, x2), std::max(x1, x2));
95 bool intersects(
const void* aBounds,
const void* bBounds)
override;
113 std::unique_ptr<BoundableList> sortBoundables(
const BoundableList* input);
116 IntersectsOp* intersectsOp;
117 std::vector<std::unique_ptr<Interval>> intervals;
A node of the STR tree.
Definition: AbstractNode.h:43
A test for intersection between two bounds, necessary because subclasses of AbstractSTRtree have diff...
Definition: AbstractSTRtree.h:175
Base class for STRtree and SIRtree.
Definition: AbstractSTRtree.h:138
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.
A contiguous portion of 1D-space. Used internally by SIRtree.
Definition: strtree/Interval.h:29
One-dimensional version of an STR-packed R-tree.
Definition: SIRtree.h:40
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.
std::vector< void * > * query(double x)
Definition: SIRtree.h:79
SIRtree(const SIRtree &)=delete
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.
std::vector< void * > * query(double x1, double x2)
Definition: SIRtree.h:67
IntersectsOp * getIntersectsOp() override
Definition: SIRtree.h:108
std::vector< Boundable * > BoundableList
A list of boundables. TODO: use a list.
Definition: AbstractSTRtree.h:43
Basic namespace for all GEOS functionalities.
Definition: geos.h:39