Index (jvptree 0.2 API)

A C D G I M R S T V

A

add(E) - Method in class com.eatthepath.jvptree.VPTree
addAll(Collection<? extends E>) - Method in class com.eatthepath.jvptree.VPTree

C

clear() - Method in class com.eatthepath.jvptree.VPTree
com.eatthepath.jvptree - package com.eatthepath.jvptree: Contains core classes and interfaces for working with vantage-point trees.
com.eatthepath.jvptree.util - package com.eatthepath.jvptree.util: Contains utility classes and concrete implementations of threshold selection strategies.
compare(T, T) - Method in class com.eatthepath.jvptree.DistanceComparator: Compares two points by their distance from this distance comparator's origin point.
contains(Object) - Method in class com.eatthepath.jvptree.VPTree
containsAll(Collection<?>) - Method in class com.eatthepath.jvptree.VPTree

D

DEFAULT_NODE_CAPACITY - Static variable in class com.eatthepath.jvptree.VPTree
DEFAULT_NUMBER_OF_SAMPLES - Static variable in class com.eatthepath.jvptree.util.SamplingMedianDistanceThresholdSelectionStrategy
DistanceComparator<T> - Class in com.eatthepath.jvptree: A Comparator that orders points by their distance (as determined by a given distance function) from a given origin point.
DistanceComparator(T, DistanceFunction<? super T>) - Constructor for class com.eatthepath.jvptree.DistanceComparator: Constructs a new distance comparator with the given origin point and distance function.
DistanceFunction<T> - Interface in com.eatthepath.jvptree: A function that calculates the distance between two points.

G

getAllWithinDistance(P, double) - Method in interface com.eatthepath.jvptree.SpatialIndex: Returns a list of all points within a given distance to a query point.
getAllWithinDistance(P, double) - Method in class com.eatthepath.jvptree.VPTree
getDistance(T, T) - Method in interface com.eatthepath.jvptree.DistanceFunction: Returns the distance between two points.
getNearestNeighbors(P, int) - Method in interface com.eatthepath.jvptree.SpatialIndex: Returns a list of the nearest neighbors to a given query point.
getNearestNeighbors(P, int) - Method in class com.eatthepath.jvptree.VPTree

I

isEmpty() - Method in class com.eatthepath.jvptree.VPTree
iterator() - Method in class com.eatthepath.jvptree.VPTree

M

MedianDistanceThresholdSelectionStrategy<P,E extends P> - Class in com.eatthepath.jvptree.util: A threshold distance selection strategy that uses the median distance from the origin as the threshold.
MedianDistanceThresholdSelectionStrategy() - Constructor for class com.eatthepath.jvptree.util.MedianDistanceThresholdSelectionStrategy

R

remove(Object) - Method in class com.eatthepath.jvptree.VPTree
removeAll(Collection<?>) - Method in class com.eatthepath.jvptree.VPTree
retainAll(Collection<?>) - Method in class com.eatthepath.jvptree.VPTree

S

SamplingMedianDistanceThresholdSelectionStrategy<P,E extends P> - Class in com.eatthepath.jvptree.util: A threshold distance selection strategy that uses the median distance from the origin to a subset of the given list of points as the threshold.
SamplingMedianDistanceThresholdSelectionStrategy(int) - Constructor for class com.eatthepath.jvptree.util.SamplingMedianDistanceThresholdSelectionStrategy: Constructs a threshold selector that uses up to the given number of samples from a list of points to choose a median distance.
selectThreshold(List<E>, P, DistanceFunction) - Method in interface com.eatthepath.jvptree.ThresholdSelectionStrategy: Chooses a partitioning distance threshold appropriate for the given list of points.
selectThreshold(List<E>, P, DistanceFunction) - Method in class com.eatthepath.jvptree.util.MedianDistanceThresholdSelectionStrategy: Returns the median distance of the given points from the given origin.
selectThreshold(List<E>, P, DistanceFunction) - Method in class com.eatthepath.jvptree.util.SamplingMedianDistanceThresholdSelectionStrategy: Returns the median distance of a subset of the given points from the given origin.
size() - Method in class com.eatthepath.jvptree.VPTree
SpatialIndex<P,E extends P> - Interface in com.eatthepath.jvptree: A collection of points that can be searched efficiently to find points near a given query point.

T

ThresholdSelectionStrategy<P,E extends P> - Interface in com.eatthepath.jvptree: A strategy for choosing a distance threshold for vp-tree nodes.
toArray() - Method in class com.eatthepath.jvptree.VPTree
toArray(T[]) - Method in class com.eatthepath.jvptree.VPTree

V

VPTree<P,E extends P> - Class in com.eatthepath.jvptree: A vantage-point tree (or vp-tree) is a binary space partitioning collection of points in a metric space.
VPTree(DistanceFunction) - Constructor for class com.eatthepath.jvptree.VPTree: Constructs a new vp-tree that uses the given distance function and is initially empty.
VPTree(DistanceFunction, Collection<E>) - Constructor for class com.eatthepath.jvptree.VPTree: Constructs a new vp-tree that uses the given distance function and is initially populated with the given collection of points.
VPTree(DistanceFunction, ThresholdSelectionStrategy<P, E>) - Constructor for class com.eatthepath.jvptree.VPTree: Constructs a new vp-tree that uses the given distance function and threshold selection strategy to partition points.
VPTree(DistanceFunction, ThresholdSelectionStrategy<P, E>, Collection<E>) - Constructor for class com.eatthepath.jvptree.VPTree: Constructs a new vp-tree that uses the given distance function and threshold selection strategy to partition points.
VPTree(DistanceFunction, ThresholdSelectionStrategy<P, E>, int) - Constructor for class com.eatthepath.jvptree.VPTree: Constructs a new vp-tree that uses the given distance function and threshold selection strategy to partition points and is initially empty.
VPTree(DistanceFunction, ThresholdSelectionStrategy<P, E>, int, Collection<E>) - Constructor for class com.eatthepath.jvptree.VPTree: Constructs a new vp-tree that uses the given distance function and threshold selection strategy to partition points.

A C D G I M R S T V