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

Packages that use Entry

Package	Description
com.github.davidmoten.rtree
com.github.davidmoten.rtree.fbs
com.github.davidmoten.rtree.internal

Uses of Entry in com.github.davidmoten.rtree

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

Modifier and Type	Method and Description
Entry<T,S>	EntryFactory.createEntry(T value, S geometry)
Entry<T,S>	Leaf.entry(int i) Returns the ith entry (0-based).
static <T,S extends Geometry> Entry<T,S>	Entries.entry(T object, S geometry)

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

Modifier and Type	Method and Description
List<Entry<T,S>>	Leaf.entries()
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(Circle circle)
rx.Observable<Entry<T,S>>	RTree.search(Line line)
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
List<Node<T,S>>	Node.add(Entry<? extends T,? extends S> entry)
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.
NodeAndEntries<T,S>	Node.delete(Entry<? extends T,? extends S> entry, boolean all)
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.
static <T,S extends Geometry> RTree<T,S>	RTree.create(List<Entry<T,S>> entries) Construct an Rtree through STR bulk loading.
<T,S extends Geometry> RTree<T,S>	RTree.Builder.create(List<Entry<T,S>> entries) Create an RTree by bulk loading, using the STR method.
Leaf<T,S>	LeafFactory.createLeaf(List<Entry<T,S>> entries, Context<T,S> context)
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.
void	Node.searchWithoutBackpressure(rx.functions.Func1<? super Geometry,Boolean> criterion, rx.Subscriber<? super Entry<T,S>> subscriber) Run when a search requests Long.MAX_VALUE results.

Uses of Entry in com.github.davidmoten.rtree.fbs

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

Modifier and Type	Method and Description
Entry<T,S>	FactoryFlatBuffers.createEntry(T value, S geometry)

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

Modifier and Type	Method and Description
Leaf<T,S>	FactoryFlatBuffers.createLeaf(List<Entry<T,S>> entries, Context<T,S> context)

Uses of Entry in com.github.davidmoten.rtree.internal

Classes in com.github.davidmoten.rtree.internal that implement Entry

Modifier and Type	Class and Description
class	EntryDefault<T,S extends Geometry> An entry in the R-tree which has a spatial representation.

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

Modifier and Type	Method and Description
Entry<T,S>	FactoryDefault.createEntry(T value, S geometry)
Entry<T,S>	LeafDefault.entry(int i)
static <T,S extends Geometry> Entry<T,S>	EntryDefault.entry(T value, S geometry) Factory method.

Methods in com.github.davidmoten.rtree.internal 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.
List<Entry<T,S>>	LeafDefault.entries()
List<Entry<T,S>>	NodeAndEntries.entriesToAdd()

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

Modifier and Type	Method and Description
List<Node<T,S>>	NonLeafDefault.add(Entry<? extends T,? extends S> entry)
List<Node<T,S>>	LeafDefault.add(Entry<? extends T,? extends S> entry)
static <T,S extends Geometry> List<Node<T,S>>	LeafHelper.add(Entry<? extends T,? extends S> entry, Leaf<T,S> leaf)
static <T,S extends Geometry> List<Node<T,S>>	NonLeafHelper.add(Entry<? extends T,? extends S> entry, NonLeaf<T,S> node)
NodeAndEntries<T,S>	NonLeafDefault.delete(Entry<? extends T,? extends S> entry, boolean all)
NodeAndEntries<T,S>	LeafDefault.delete(Entry<? extends T,? extends S> entry, boolean all)
static <T,S extends Geometry> NodeAndEntries<T,S>	LeafHelper.delete(Entry<? extends T,? extends S> entry, boolean all, Leaf<T,S> leaf)
static <T,S extends Geometry> NodeAndEntries<T,S>	NonLeafHelper.delete(Entry<? extends T,? extends S> entry, boolean all, NonLeaf<T,S> node)

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

Modifier and Type	Method and Description
Leaf<T,S>	FactoryDefault.createLeaf(List<Entry<T,S>> entries, Context<T,S> context)
static <T,S extends Geometry> void	LeafHelper.search(rx.functions.Func1<? super Geometry,Boolean> condition, rx.Subscriber<? super Entry<T,S>> subscriber, Leaf<T,S> leaf)
static <T,S extends Geometry> void	NonLeafHelper.search(rx.functions.Func1<? super Geometry,Boolean> criterion, rx.Subscriber<? super Entry<T,S>> subscriber, NonLeaf<T,S> node)
void	NonLeafDefault.searchWithoutBackpressure(rx.functions.Func1<? super Geometry,Boolean> criterion, rx.Subscriber<? super Entry<T,S>> subscriber)
void	LeafDefault.searchWithoutBackpressure(rx.functions.Func1<? super Geometry,Boolean> condition, rx.Subscriber<? super Entry<T,S>> subscriber)

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

Constructor and Description
LeafDefault(List<Entry<T,S>> entries, Context<T,S> context)
NodeAndEntries(Optional<? extends Node<T,S>> node, List<Entry<T,S>> entries, int countDeleted) Constructor.