SortedPackedIntervalRTree class
A static index on a set of 1-dimensional intervals, using an R-Tree packed based on the order of the interval midpoints. 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 - 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.
@author Martin Davis
Constructors
Properties
- hashCode → int
-
The hash code for this object.
no setterinherited
- leaves ↔ List
-
getter/setter pair
- level ↔ int
-
getter/setter pair
- root ↔ IntervalRTreeNode?
-
If root is null that indicates
that the tree has not yet been built,
OR nothing has been added to the tree.
In both cases, the tree is still open for insertions.
getter/setter pair
- runtimeType → Type
-
A representation of the runtime type of the object.
no setterinherited
Methods
-
buildLevel(
List src, List dest) → void -
buildRoot(
) → void -
buildTree(
) → IntervalRTreeNode -
init(
) → void -
insert(
double min, double max, Object item) → void - Adds an item to the index which is associated with the given interval
-
noSuchMethod(
Invocation invocation) → dynamic -
Invoked when a nonexistent method or property is accessed.
inherited
-
printNode(
IntervalRTreeNode node) → void -
query(
double min, double max, ItemVisitor visitor) → void - Search for intervals in the index which intersect the given closed interval and apply the visitor to them.
-
toString(
) → String -
A string representation of this object.
inherited
Operators
-
operator ==(
Object other) → bool -
The equality operator.
inherited