Crate space[][src]

Expand description

See the Crates.io page for the README.

Structs

Performs a linear knn search by iterating over everything in the space and performing a binary search on running set of neighbors.

For k-NN algorithms to return neighbors.

Traits

Implement this trait on data structures (or wrappers) which perform KNN searches.

This trait is implemented for points that exist in a metric space. It is primarily used for keys in nearest neighbor searches. When implementing this trait, you should always choose the smallest unsigned integer that represents your metric space.