Crate space

See the Crates.io page for the README.

Structs

LinearKnn

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

Neighbor

For k-NN algorithms to return neighbors.

Traits

Knn

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

KnnMap

This trait gives knn search collections the ability to give the nearest neighbor values back.

KnnPoints

This trait gives knn search collections the ability to give the nearest neighbor keys back.

MetricPoint

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.