This file documents recent notable changes to this project. The format of this file is based on Keep a Changelog, and this project adheres to Semantic Versioning.
BallTree
andVantagePointTree
accept an ndarray as a point.
0.4.0 - 2020-06-01
- A vantage point tree data structure to find nearest points.
BallTree
accepts not only anf64
array but also anf32
one.BallTree::euclidean
to create a ball tree withoug having to pass a distance metric as an argument.
- The codinates of each point must be stored in a contiguous area in memory.
- A distance metric is now a function, not a trait.
0.3.0 - 2020-04-17
- The ownership of the input can be transferred to
BallTree
, which accepts both an owned array and a view. - An error is returned, rather than a panic, if an empty array is given to
construct a
BallTree
. query_one
has been renamedquery_nearest
.query
returns indices and distances separately, so that data of the same type are stored together.
0.2.0 - 2020-04-09
BallTree
takesArrayBase
as its input, instead ofArrayView
, to allow more types in ndarray.
0.1.0 - 2019-11-20
- A ball tree data structure to find nearest neighbors.