bbqvec 0.0.10

Scalable, embeddable, vector storage for approximate K-nearest-neighbors (AKNN)
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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142

use crate::ID;
use std::ops::{BitOrAssign, BitXorAssign, SubAssign};

pub use bitvec::prelude::BitVec;
pub use croaring::Bitmap as CRoaringBitmap;
pub use roaring::RoaringBitmap;

pub trait Bitmap: std::fmt::Debug + Default + Clone + Send {
    fn new() -> Self;
    fn count(&self) -> usize;
    fn is_empty(&self) -> bool;
    fn add(&mut self, id: ID);
    fn iter_elems(&self) -> impl Iterator<Item = ID>;
    fn and_not(&mut self, rhs: &Self);
    fn or(&mut self, rhs: &Self);
    fn xor(&mut self, rhs: &Self);
    fn estimate_size(&self) -> usize;
}

impl Bitmap for roaring::RoaringBitmap {
    fn new() -> Self {
        roaring::RoaringBitmap::new()
    }

    fn is_empty(&self) -> bool {
        self.is_empty()
    }

    fn count(&self) -> usize {
        self.len() as usize
    }

    fn add(&mut self, id: ID) {
        self.insert(id as u32);
    }

    fn iter_elems(&self) -> impl Iterator<Item = ID> {
        self.iter().map(|x| x as ID)
    }
    fn and_not(&mut self, rhs: &Self) {
        self.sub_assign(rhs)
    }
    fn or(&mut self, rhs: &Self) {
        self.bitor_assign(rhs)
    }
    fn xor(&mut self, rhs: &Self) {
        self.bitxor_assign(rhs)
    }
    fn estimate_size(&self) -> usize {
        self.serialized_size()
    }
}

impl Bitmap for bitvec::prelude::BitVec {
    fn new() -> Self {
        bitvec::prelude::BitVec::new()
    }

    fn count(&self) -> usize {
        self.count_ones()
    }

    fn is_empty(&self) -> bool {
        self.is_empty()
    }

    fn add(&mut self, id: ID) {
        if self.len() <= id as usize {
            self.resize((id + 1) as usize, false)
        }
        self.set(id as usize, true)
    }

    fn iter_elems(&self) -> impl Iterator<Item = ID> {
        self.iter_ones().map(|x| x as ID)
    }

    #[inline]
    fn and_not(&mut self, rhs: &Self) {
        for elem in self.as_raw_mut_slice().iter_mut().zip(rhs.as_raw_slice()) {
            *elem.0 &= !elem.1
        }
    }

    #[inline]
    fn or(&mut self, rhs: &Self) {
        if self.len() < rhs.len() {
            self.resize(rhs.len(), false)
        }
        self.bitor_assign(rhs)
    }

    #[inline]
    fn xor(&mut self, rhs: &Self) {
        if self.len() < rhs.len() {
            self.resize(rhs.len(), false)
        }
        self.bitxor_assign(rhs)
    }

    fn estimate_size(&self) -> usize {
        std::mem::size_of_val(self.as_raw_slice())
    }
}

impl Bitmap for croaring::Bitmap {
    fn new() -> Self {
        croaring::Bitmap::new()
    }

    fn is_empty(&self) -> bool {
        self.is_empty()
    }

    fn count(&self) -> usize {
        self.cardinality() as usize
    }

    fn add(&mut self, id: ID) {
        self.add(id as u32)
    }

    fn iter_elems(&self) -> impl Iterator<Item = ID> {
        self.iter().map(|x| x as ID)
    }

    fn and_not(&mut self, rhs: &Self) {
        self.andnot_inplace(rhs)
    }

    fn or(&mut self, rhs: &Self) {
        self.or_inplace(rhs)
    }

    fn xor(&mut self, rhs: &Self) {
        self.xor_inplace(rhs)
    }

    fn estimate_size(&self) -> usize {
        self.get_serialized_size_in_bytes::<croaring::Native>()
    }
}