Crate ball_tree

Structs

BallTree

A BallTree is a space-partitioning data-structure that allows for finding nearest neighbors in logarithmic time.

Iter

Iterator over the nearest neighbors.

Query

A context for repeated nearest-neighbor queries that internally re-uses memory across queries.

Traits

Point

A Point is something that exists in some sort of metric space, and can thus calculate its distance to another Point, and can be moved a certain distance towards another Point.