15 #ifndef GEOS_IDX_BINTREE_BINTREE_H
16 #define GEOS_IDX_BINTREE_BINTREE_H
18 #include <geos/export.h>
23 #pragma warning(disable: 4251)
90 std::vector<void*>* iterator();
92 std::vector<void*>* query(
double x);
94 std::vector<void*>* query(
Interval* interval);
97 std::vector<void*>* foundItems);
101 std::vector<Interval*>newIntervals;
117 void collectStats(
Interval* interval);
A BinTree (or "Binary Interval Tree") is a 1-dimensional version of a quadtree.
Definition: Bintree.h:54
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:25
The root node of a single Bintree.
Definition: bintree/Root.h:41
Basic namespace for all GEOS functionalities.
Definition: IndexedNestedRingTester.h:26