public class SortedPackedIntervalRTree extends 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 and Description|
|Modifier and Type||Method and Description|
Adds an item to the index which is associated with the given interval
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, Object item)
min- the lower bound of the item interval
max- the upper bound of the item interval
item- the item to insert
IllegalStateException- if the index has already been queried
public void query(double min, double max, ItemVisitor visitor)
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
Copyright © 2020. All rights reserved.