acap

Crates.ioacap
lib.rsacap
version0.4.0
created_at2020-06-24 15:05:55.622818+00
updated_at2025-02-18 15:50:49.209957+00
descriptionAs Close As Possible — nearest neighbor search in Rust.
homepage
repositoryhttps://github.com/tavianator/acap
max_upload_size
id257593
size127,971
Tavian Barnes (tavianator)

documentation

README

acap

crates.io Documentation License CI Status

As Close As Possible — nearest neighbor search in Rust.

Example

use acap::euclid::Euclidean;
use acap::vp::VpTree;
use acap::NearestNeighbors;

let tree = VpTree::balanced(vec![
    Euclidean([3, 4]),
    Euclidean([5, 12]),
    Euclidean([8, 15]),
    Euclidean([7, 24]),
]);

let nearest = tree.nearest(&[7, 7]).unwrap();
assert_eq!(nearest.item, &Euclidean([3, 4]));
assert_eq!(nearest.distance, 5);
Commit count: 68

cargo fmt