Uses of Class
smile.neighbor.Neighbor

Packages that use Neighbor

Package	Description
smile.neighbor	Nearest neighbor search.

Uses of Neighbor in smile.neighbor

Subclasses of Neighbor in smile.neighbor

Modifier and Type	Class and Description
class	SimpleNeighbor<T> The simple neighbor object, in which key and object are the same.

Methods in smile.neighbor that return Neighbor

Modifier and Type	Method and Description
Neighbor<double[],E>[]	LSH.knn(double[] q, int k)
Neighbor<double[],E>[]	KDTree.knn(double[] q, int k)
Neighbor<E,E>[]	CoverTree.knn(E q, int k)
Neighbor<K,V>[]	KNNSearch.knn(K q, int k) Search the k nearest neighbors to the query.
Neighbor<T,T>[]	LinearSearch.knn(T q, int k)
Neighbor<double[],E>	LSH.nearest(double[] q)
Neighbor<double[],E>	KDTree.nearest(double[] q)
Neighbor<E,E>	CoverTree.nearest(E q)
Neighbor<K,V>	NearestNeighborSearch.nearest(K q) Search the nearest neighbor to the given sample.
Neighbor<T,T>	LinearSearch.nearest(T q)

Methods in smile.neighbor with parameters of type Neighbor

Modifier and Type	Method and Description
int	Neighbor.compareTo(Neighbor<K,V> o)

Method parameters in smile.neighbor with type arguments of type Neighbor

Modifier and Type	Method and Description
void	LSH.range(double[] q, double radius, List<Neighbor<double[],E>> neighbors)
void	KDTree.range(double[] q, double radius, List<Neighbor<double[],E>> neighbors)
void	CoverTree.range(E q, double radius, List<Neighbor<E,E>> neighbors)
void	BKTree.range(E q, double radius, List<Neighbor<E,E>> neighbors)
void	BKTree.range(E q, int radius, List<Neighbor<E,E>> neighbors) Search the neighbors in the given radius of query object, i.e.
void	RNNSearch.range(K q, double radius, List<Neighbor<K,V>> neighbors) Search the neighbors in the given radius of query object, i.e.
void	LinearSearch.range(T q, double radius, List<Neighbor<T,T>> neighbors)