package search
Type Members
 class HeapSelect[T <: Comparable[T]] extends AnyRef
 trait KNNSearch[K, V] extends AnyRef
 class Math extends AnyRef

trait
NearestNeighbourSearch[K, V] extends AnyRef
Nearest neighbor search, also known as proximity search, similarity search or closest point search, is an optimization problem for finding closest points in metric spaces.
Nearest neighbor search, also known as proximity search, similarity search or closest point search, is an optimization problem for finding closest points in metric spaces. The problem is: given a set S of points in a metric space M and a query point q ∈ M, find the closest point in S to q.
 class Neighbour[K, V] extends Comparable[Neighbour[K, V]]

trait
RNNSearch[K, V] extends AnyRef
A range nearest neighbor search retrieves the nearest neighbors to a query in a range.
A range nearest neighbor search retrieves the nearest neighbors to a query in a range. It is a natural generalization of point and continuous nearest neighbor queries and has many applications.

case class
Recipe(node: Node, begin: Int, end: Int, isLower: Boolean) extends Product with Serializable
 Attributes
 protected
 class SerializableKDTree[E <: TreeData] extends NearestNeighbourSearch[Array[Float], E] with KNNSearch[Array[Float], E] with RNNSearch[Array[Float], E] with Serializable