Package | Description |
---|---|
org.locationtech.jts.index.bintree |
Contains classes that implement a Binary Interval Tree index
|
Modifier and Type | Method | Description |
---|---|---|
static Interval |
Bintree.ensureExtent(Interval itemInterval,
double minExtent) |
Ensure that the Interval for the inserted item has non-zero extents.
|
Interval |
Key.getInterval() |
|
Interval |
Node.getInterval() |
Modifier and Type | Method | Description |
---|---|---|
void |
NodeBase.addAllItemsFromOverlapping(Interval interval,
java.util.Collection resultItems) |
Adds items in the tree which potentially overlap the query interval
to the given collection.
|
void |
Key.computeKey(Interval itemInterval) |
return a square envelope containing the argument envelope,
whose extent is a power of two and which is based at a power of 2
|
static int |
Key.computeLevel(Interval interval) |
|
boolean |
Interval.contains(Interval interval) |
|
static Node |
Node.createExpanded(Node node,
Interval addInterval) |
|
static Node |
Node.createNode(Interval itemInterval) |
|
static Interval |
Bintree.ensureExtent(Interval itemInterval,
double minExtent) |
Ensure that the Interval for the inserted item has non-zero extents.
|
void |
Interval.expandToInclude(Interval interval) |
|
NodeBase |
Node.find(Interval searchInterval) |
Returns the smallest existing
node containing the envelope.
|
Node |
Node.getNode(Interval searchInterval) |
Returns the subnode containing the envelope.
|
static int |
NodeBase.getSubnodeIndex(Interval interval,
double centre) |
Returns the index of the subnode that wholely contains the given interval.
|
void |
Bintree.insert(Interval itemInterval,
java.lang.Object item) |
|
void |
Root.insert(Interval itemInterval,
java.lang.Object item) |
Insert an item into the tree this is the root of.
|
boolean |
Interval.overlaps(Interval interval) |
|
java.util.List |
Bintree.query(Interval interval) |
Queries the tree to find all candidate items which
may overlap the query interval.
|
void |
Bintree.query(Interval interval,
java.util.Collection foundItems) |
Adds items in the tree which potentially overlap the query interval
to the given collection.
|
boolean |
Bintree.remove(Interval itemInterval,
java.lang.Object item) |
Removes a single item from the tree.
|
boolean |
NodeBase.remove(Interval itemInterval,
java.lang.Object item) |
Removes a single item from this subtree.
|
Constructor | Description |
---|---|
Interval(Interval interval) |
|
Key(Interval interval) |
|
Node(Interval interval,
int level) |
Copyright © 2018. All rights reserved.