17#include <geos/export.h>
22#pragma warning(disable: 4251)
89 std::vector<void*>* iterator();
91 std::vector<void*>* query(
double x);
93 std::vector<void*>* query(
Interval* interval);
96 std::vector<void*>* foundItems);
100 std::vector<Interval*>newIntervals;
116 void collectStats(
Interval* interval);
A BinTree (or "Binary Interval Tree") is a 1-dimensional version of a quadtree.
Definition Bintree.h:53
static Interval * ensureExtent(const Interval *itemInterval, double minExtent)
Ensure that the Interval for the inserted item has non-zero extents.
void insert(Interval *itemInterval, void *item)
Represents an (1-dimensional) closed interval on the Real number line.
Definition bintree/Interval.h:24
The root node of a single Bintree.
Definition bintree/Root.h:40
Basic namespace for all GEOS functionalities.
Definition geos.h:39