kannolo 0.3.5

kANNolo is designed for easy prototyping of ANN Search algorithms while ensuring high effectiveness and efficiency over both dense and sparse vectors.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14

pub trait OnlineTopKSelector {
    fn new(k: usize) -> Self;

    fn push(&mut self, distance: f32);

    fn push_with_id(&mut self, distance: f32, id: usize);

    fn extend(&mut self, distances: &[f32]);

    fn topk(&self) -> Vec<(f32, usize)>;
}

pub mod topk_heap;
pub use topk_heap::TopkHeap;