15 #ifndef GEOS_IDX_BINTREE_BINTREE_H 16 #define GEOS_IDX_BINTREE_BINTREE_H 18 #include <geos/export.h> 23 #pragma warning(disable: 4251) // warning C4251: needs to have dll-interface to be used by clients of class 89 void insert(
Interval *itemInterval,
void* item);
91 std::vector<void*>* iterator();
93 std::vector<void*>* query(
double x);
95 std::vector<void*>* query(
Interval *interval);
98 std::vector<void*> *foundItems);
102 std::vector<Interval *>newIntervals;
118 void collectStats(
Interval *interval);
129 #endif // GEOS_IDX_BINTREE_BINTREE_H Represents an (1-dimensional) closed interval on the Real number line.
Definition: bintree/Interval.h:25
An BinTree (or "Binary Interval Tree") is a 1-dimensional version of a quadtree.
Definition: Bintree.h:56
Basic namespace for all GEOS functionalities.
Definition: IndexedNestedRingTester.h:25
The root node of a single Bintree.
Definition: bintree/Root.h:41