Uses of Class
com.github.davidmoten.rtree.Entry

Packages that use Entry

Package	Description
com.github.davidmoten.rtree

Uses of Entry in com.github.davidmoten.rtree

Methods in com.github.davidmoten.rtree that return Entry

Modifier and Type	Method and Description
static <T,S extends Geometry> Entry<T,S>	Entry.entry(T value, S geometry) Factory method.

Methods in com.github.davidmoten.rtree that return types with arguments of type Entry

Modifier and Type	Method and Description
static <T,S extends Geometry> Comparator<Entry<T,S>>	Comparators.ascendingDistance(Rectangle r) Returns a comparator that can be used to sort entries returned by search methods.
rx.Observable<Entry<T,S>>	RTree.entries() Returns all entries in the tree as an Observable sequence.
rx.Observable<Entry<T,S>>	RTree.nearest(Point p, double maxDistance, int maxCount) Returns the nearest k entries (k=maxCount) to the given point where the entries are strictly less than a given maximum distance from the point.
rx.Observable<Entry<T,S>>	RTree.nearest(Rectangle r, double maxDistance, int maxCount) Returns the nearest k entries (k=maxCount) to the given rectangle where the entries are strictly less than a given maximum distance from the rectangle.
rx.Observable<Entry<T,S>>	RTree.search(Point p) Returns an Observable sequence of all Entrys in the R-tree whose minimum bounding rectangle intersects with the given point.
rx.Observable<Entry<T,S>>	RTree.search(Point p, double maxDistance) Returns an Observable sequence of all Entrys in the R-tree whose minimum bounding rectangles are within maxDistance from the given point.
<R extends Geometry> rx.Observable<Entry<T,S>>	RTree.search(R g, double maxDistance, rx.functions.Func2<? super S,? super R,Double> distance) Returns all entries strictly less than maxDistance from the given geometry.
rx.Observable<Entry<T,S>>	RTree.search(Rectangle r) Returns an Observable sequence of all Entrys in the R-tree whose minimum bounding rectangle intersects with the given rectangle.
rx.Observable<Entry<T,S>>	RTree.search(Rectangle r, double maxDistance) Returns an Observable sequence of all Entrys in the R-tree whose minimum bounding rectangles are strictly less than maxDistance from the given rectangle.
<R extends Geometry> rx.Observable<Entry<T,S>>	RTree.search(R g, rx.functions.Func2<? super S,? super R,Boolean> 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.

Methods in com.github.davidmoten.rtree with parameters of type Entry

Modifier and Type	Method and Description
RTree<T,S>	RTree.add(Entry<? extends T,? extends S> entry) Returns an immutable copy of the RTree with the addition of given entry.
RTree<T,S>	RTree.delete(Entry<? extends T,? extends S> entry) Deletes one entry if it exists, returning an immutable copy of the RTree without that entry.
RTree<T,S>	RTree.delete(Entry<? extends T,? extends S> entry, boolean all) Deletes one or all matching entries depending on the value of all.

Method parameters in com.github.davidmoten.rtree with type arguments of type Entry

Modifier and Type	Method and Description
RTree<T,S>	RTree.add(Iterable<Entry<T,S>> entries) Returns an immutable RTree with the current entries and the additional entries supplied as a parameter.
rx.Observable<RTree<T,S>>	RTree.add(rx.Observable<Entry<T,S>> entries) Returns the Observable sequence of trees created by progressively adding entries.
RTree<T,S>	RTree.delete(Iterable<Entry<T,S>> entries) Returns a new R-tree with the given entries deleted but only one matching occurence of each entry is deleted.
RTree<T,S>	RTree.delete(Iterable<Entry<T,S>> entries, boolean all) Returns a new R-tree with the given entries deleted.
rx.Observable<RTree<T,S>>	RTree.delete(rx.Observable<Entry<T,S>> entries, boolean all) Returns the Observable sequence of trees created by progressively deleting entries.