#include <SortedPackedIntervalRTree.h>
Public Member Functions | |
| void | insert (double min, double max, void *item) |
| void | query (double min, double max, index::ItemVisitor *visitor) |
It supports range searching, where the range is an interval of the real line (which may be a single point). A common use is to index 1-dimensional intervals which are the projection of 2-D objects onto an axis of the coordinate system.
This index structure is static
| void geos::index::intervalrtree::SortedPackedIntervalRTree::insert | ( | double | min, | |
| double | max, | |||
| void * | item | |||
| ) |
| void geos::index::intervalrtree::SortedPackedIntervalRTree::query | ( | double | min, | |
| double | max, | |||
| index::ItemVisitor * | visitor | |||
| ) |
Search for intervals in the index which intersect the given closed interval and apply the visitor to them.
| min | the lower bound of the query interval | |
| max | the upper bound of the query interval | |
| visitor | the visitor to pass any matched items to |
1.5.4