public class SIRtree extends AbstractSTRtree
This class is thread-safe. Building the tree is synchronized, and querying is stateless.
STRtree
,
Serialized FormAbstractSTRtree.IntersectsOp
root
Constructor and Description |
---|
SIRtree()
Constructs an SIRtree with the default node capacity.
|
SIRtree(int nodeCapacity)
Constructs an SIRtree with the given maximum number of child nodes that
a node may have
|
Modifier and Type | Method and Description |
---|---|
protected AbstractNode |
createNode(int level) |
protected Comparator |
getComparator() |
protected AbstractSTRtree.IntersectsOp |
getIntersectsOp() |
void |
insert(double x1,
double x2,
Object item)
Inserts an item having the given bounds into the tree.
|
List |
query(double x)
Returns items whose bounds intersect the given value.
|
List |
query(double x1,
double x2)
Returns items whose bounds intersect the given bounds.
|
boundablesAtLevel, build, compareDoubles, createParentBoundables, depth, depth, getNodeCapacity, getRoot, insert, isEmpty, itemsTree, lastNode, query, query, remove, size, size
public SIRtree()
public SIRtree(int nodeCapacity)
protected AbstractNode createNode(int level)
createNode
in class AbstractSTRtree
public void insert(double x1, double x2, Object item)
public List query(double x)
public List query(double x1, double x2)
x1
- possibly equal to x2protected AbstractSTRtree.IntersectsOp getIntersectsOp()
getIntersectsOp
in class AbstractSTRtree
AbstractSTRtree.IntersectsOp
protected Comparator getComparator()
getComparator
in class AbstractSTRtree
Copyright © 2016. All rights reserved.