kannolo 0.1.6

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
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45

pub trait Decoder {
    fn decode(&mut self) -> usize;
}

pub struct PQDecoder8<'a> {
    code: &'a [u8],
    position: usize,
}

impl<'a> PQDecoder8<'a> {
    pub fn new(code: &'a [u8]) -> Self {
        PQDecoder8 { code, position: 0 }
    }

    #[inline]
    fn decode_8(&mut self) -> usize {
        let result = self.code[self.position] as usize;
        self.position += 1;
        result
    }
}

impl<'a> Decoder for PQDecoder8<'a> {
    fn decode(&mut self) -> usize {
        self.decode_8()
    }
}

impl<'a, T> Decoder for &'a mut T
where
    T: Decoder + ?Sized,
{
    fn decode(&mut self) -> usize {
        (**self).decode()
    }
}

impl<T> Decoder for Box<T>
where
    T: Decoder + ?Sized,
{
    fn decode(&mut self) -> usize {
        (**self).decode()
    }
}