hannoy 0.1.3

HNSW Approximate Nearest Neighbors in Rust, based on LMDB and optimized for memory usage
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
46
47
48
49
50
51
52

use heed::RoTxn;

use crate::distance::Distance;
use crate::internals::KeyCodec;
use crate::key::{Prefix, PrefixCodec};
use crate::node::Item;
use crate::{Database, ItemId, Node, NodeCodec, Result};

// used by the reader
pub struct ItemIter<'t, D: Distance> {
    pub inner: heed::RoPrefix<'t, KeyCodec, NodeCodec<D>>,
    dimensions: usize,
}

impl<'t, D: Distance> ItemIter<'t, D> {
    pub fn new(
        database: Database<D>,
        index: u16,
        dimensions: usize,
        rtxn: &'t RoTxn,
    ) -> heed::Result<Self> {
        Ok(ItemIter {
            inner: database
                .remap_key_type::<PrefixCodec>()
                .prefix_iter(rtxn, &Prefix::item(index))?
                .remap_key_type::<KeyCodec>(),
            dimensions,
        })
    }
}

impl<D: Distance> Iterator for ItemIter<'_, D> {
    type Item = Result<(ItemId, Vec<f32>)>;

    fn next(&mut self) -> Option<Self::Item> {
        match self.inner.next() {
            Some(Ok((key, node))) => match node {
                Node::Item(Item { header: _, vector }) => {
                    let mut vector = vector.to_vec();
                    if vector.len() != self.dimensions {
                        // quantized codecs pad to 8-bytes so we truncate to recover len
                        vector.truncate(self.dimensions);
                    }
                    Some(Ok((key.node.item, vector)))
                }
                Node::Links(_) => unreachable!("Node must not be a link"),
            },
            Some(Err(e)) => Some(Err(e.into())),
            None => None,
        }
    }
}