A vantage-point tree implementation backed by a vector for good performance with zero lines of unsafe
code.
Provides bulk insert/removal operations (to maintain balance without too much extra bookkeeping), and the k-Nearest Neighbors (k-NN) algorithm.
Multiple distance functions are provided by default, including Hamming and Levenshtein distance functions for strings.
Licensed under either of
- Apache License, Version 2.0, (LICENSE-APACHE or http://www.apache.org/licenses/LICENSE-2.0)
- MIT license (LICENSE-MIT or http://opensource.org/licenses/MIT)
at your option.
Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.