| Package | Description |
|---|---|
| com.github.davidmoten.rtree2 | |
| com.github.davidmoten.rtree2.geometry | |
| com.github.davidmoten.rtree2.geometry.internal | |
| com.github.davidmoten.rtree2.internal |
| Modifier and Type | Class and Description |
|---|---|
class |
Context<T,S extends Geometry>
Configures an RTree prior to instantiation of an
RTree. |
interface |
Entry<T,S extends Geometry> |
interface |
EntryFactory<T,S extends Geometry> |
interface |
Factory<T,S extends Geometry> |
interface |
Leaf<T,S extends Geometry> |
interface |
LeafFactory<T,S extends Geometry> |
interface |
Node<T,S extends Geometry> |
interface |
NonLeaf<T,S extends Geometry> |
interface |
NonLeafFactory<T,S extends Geometry> |
class |
RTree<T,S extends Geometry>
Immutable in-memory 2D R-Tree with configurable splitter heuristic.
|
| Modifier and Type | Method and Description |
|---|---|
static <T,S extends Geometry> |
RTree.create()
Returns a new Builder instance for
RTree. |
<T,S extends Geometry> |
RTree.Builder.create()
Builds the
RTree. |
static <T,S extends Geometry> |
RTree.create(List<Entry<T,S>> entries)
Construct an Rtree through STR bulk loading.
|
<T,S extends Geometry> |
RTree.Builder.create(List<Entry<T,S>> entries)
Create an RTree by bulk loading, using the STR method.
|
static <T,S extends Geometry> |
Factories.defaultFactory() |
static <T,S extends Geometry> |
Entries.entry(T object,
S geometry) |
<R extends Geometry> |
RTree.search(R g,
BiPredicate<? super S,? super R> intersects)
Returns the intersections with the the given (arbitrary) geometry using an
intersection function to filter the search results returned from a search of
the mbr of
g. |
<R extends Geometry> |
RTree.search(R g,
double maxDistance,
BiFunction<? super S,? super R,Double> distance)
Returns all entries strictly less than
maxDistance from the
given geometry. |
<T,S extends Geometry> |
SelectorRStar.select(Geometry g,
List<? extends Node<T,S>> nodes) |
<T,S extends Geometry> |
Selector.select(Geometry g,
List<? extends Node<T,S>> nodes)
Returns the node from a list of nodes that an object with the given
geometry would be added to.
|
<T,S extends Geometry> |
SelectorMinimalOverlapArea.select(Geometry g,
List<? extends Node<T,S>> nodes) |
<T,S extends Geometry> |
SelectorMinimalAreaIncrease.select(Geometry g,
List<? extends Node<T,S>> nodes) |
| Modifier and Type | Method and Description |
|---|---|
static Predicate<Geometry> |
RTree.intersects(Rectangle r)
Returns a predicate function that indicates if
Geometry intersects
with a given rectangle. |
| Modifier and Type | Method and Description |
|---|---|
<T,S extends Geometry> |
SelectorRStar.select(Geometry g,
List<? extends Node<T,S>> nodes) |
<T,S extends Geometry> |
Selector.select(Geometry g,
List<? extends Node<T,S>> nodes)
Returns the node from a list of nodes that an object with the given
geometry would be added to.
|
<T,S extends Geometry> |
SelectorMinimalOverlapArea.select(Geometry g,
List<? extends Node<T,S>> nodes) |
<T,S extends Geometry> |
SelectorMinimalAreaIncrease.select(Geometry g,
List<? extends Node<T,S>> nodes) |
| Modifier and Type | Method and Description |
|---|---|
RTree.Builder |
RTree.Builder.factory(Factory<?,? extends Geometry> factory) |
| Modifier and Type | Interface and Description |
|---|---|
interface |
Circle |
interface |
Line |
interface |
Point |
interface |
Rectangle |
| Modifier and Type | Field and Description |
|---|---|
static BiPredicate<Circle,Geometry> |
Intersects.circleIntersectsGeometry |
static BiPredicate<Geometry,Circle> |
Intersects.geometryIntersectsCircle |
static BiPredicate<Geometry,Line> |
Intersects.geometryIntersectsLine |
static BiPredicate<Geometry,Point> |
Intersects.geometryIntersectsPoint |
static BiPredicate<Geometry,Rectangle> |
Intersects.geometryIntersectsRectangle |
static BiPredicate<Point,Geometry> |
Intersects.pointIntersectsGeometry |
static BiPredicate<Rectangle,Geometry> |
Intersects.rectangleIntersectsGeometry |
| Modifier and Type | Method and Description |
|---|---|
Geometry |
HasGeometry.geometry() |
Geometry |
Group.geometry() |
| Modifier and Type | Class and Description |
|---|---|
class |
CircleDouble |
class |
CircleFloat |
class |
LineDouble
A line segment.
|
class |
LineFloat
A line segment.
|
class |
PointDouble |
class |
PointFloat |
class |
RectangleDouble |
class |
RectangleFloat |
| Modifier and Type | Method and Description |
|---|---|
Geometry |
RectangleFloat.geometry() |
Geometry |
PointDouble.geometry() |
Geometry |
PointFloat.geometry() |
Geometry |
RectangleDouble.geometry() |
| Modifier and Type | Class and Description |
|---|---|
class |
EntryDefault<T,S extends Geometry>
An entry in the R-tree which has a spatial representation.
|
class |
FactoryDefault<T,S extends Geometry> |
class |
LeafDefault<T,S extends Geometry> |
class |
NodeAndEntries<T,S extends Geometry>
Used for tracking deletions through recursive calls.
|
class |
NonLeafDefault<T,S extends Geometry> |
| Modifier and Type | Method and Description |
|---|---|
static <T,S extends Geometry> |
LeafHelper.add(Entry<? extends T,? extends S> entry,
Leaf<T,S> leaf) |
static <T,S extends Geometry> |
NonLeafHelper.add(Entry<? extends T,? extends S> entry,
NonLeaf<T,S> node) |
static <T,S extends Geometry> |
Comparators.ascendingDistance(Rectangle r)
Returns a comparator that can be used to sort entries returned by search
methods.
|
static <T,S extends Geometry> |
LeafHelper.delete(Entry<? extends T,? extends S> entry,
boolean all,
Leaf<T,S> leaf) |
static <T,S extends Geometry> |
NonLeafHelper.delete(Entry<? extends T,? extends S> entry,
boolean all,
NonLeaf<T,S> node) |
static <T,S extends Geometry> |
EntryDefault.entry(T value,
S geometry)
Factory method.
|
static <T,S extends Geometry> |
FactoryDefault.instance() |
| Modifier and Type | Method and Description |
|---|---|
Geometry |
NonLeafDefault.geometry() |
Geometry |
LeafDefault.geometry() |
Copyright © 2013–2022. All rights reserved.