public class SortedPackedIntervalRTree
extends java.lang.Object
This index structure is static - items cannot be added or removed once the first query has been made. The advantage of this characteristic is that the index performance can be optimized based on a fixed set of items.
Constructor | Description |
---|---|
SortedPackedIntervalRTree() |
Modifier and Type | Method | Description |
---|---|---|
void |
insert(double min,
double max,
java.lang.Object item) |
Adds an item to the index which is associated with the given interval
|
void |
query(double min,
double max,
ItemVisitor visitor) |
Search for intervals in the index which intersect the given closed interval
and apply the visitor to them.
|
public void insert(double min, double max, java.lang.Object item)
min
- the lower bound of the item intervalmax
- the upper bound of the item intervalitem
- the item to insertjava.lang.IllegalStateException
- if the index has already been queriedpublic void query(double min, double max, ItemVisitor visitor)
min
- the lower bound of the query intervalmax
- the upper bound of the query intervalvisitor
- the visitor to pass any matched items toCopyright © 2018. All rights reserved.