qdrant-edge 0.8.0

A lightweight, in-process vector search engine designed for embedded devices, autonomous systems, and mobile agents.
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

use bitvec::order::{BitOrder, Lsb0};
use bitvec::store::BitStore;

use crate::common::types::PointOffsetType;

pub type BitVec = bitvec::vec::BitVec<u64, Lsb0>;
pub type BitSlice = bitvec::slice::BitSlice<u64, Lsb0>;

/// Set deleted state in given bitvec.
///
/// Grows bitvec automatically if it is not big enough.
///
/// Returns previous deleted state of the given point.
#[inline]
pub fn bitvec_set_deleted(bitvec: &mut BitVec, point_id: PointOffsetType, deleted: bool) -> bool {
    // Set deleted flag if bitvec is large enough, no need to check bounds
    if (point_id as usize) < bitvec.len() {
        return unsafe { bitvec.replace_unchecked(point_id as usize, deleted) };
    }

    // Bitvec is too small; grow and set the deletion flag, no need to check bounds
    if deleted {
        bitvec.resize(point_id as usize + 1, false);
        unsafe { bitvec.set_unchecked(point_id as usize, true) };
    }
    false
}

pub trait BitSliceExt {
    /// Get a single bit from the slice.
    /// A convenience wrapper around [`BitSlice::get`].
    fn get_bit(&self, index: usize) -> Option<bool>;
}

impl<T: BitStore, O: BitOrder> BitSliceExt for bitvec::slice::BitSlice<T, O> {
    #[inline]
    fn get_bit(&self, index: usize) -> Option<bool> {
        self.get(index).as_deref().copied()
    }
}

/// Wrapper around [BitVec] with following assumptions:
/// - Out-of-range points are considered deleted/not active.
/// - The bitvec never grows.
pub struct DeletedBitVec {
    bits: BitVec,
    count: usize,
}

impl DeletedBitVec {
    pub fn new(deleted: BitVec) -> Self {
        Self {
            count: deleted.count_ones(),
            bits: deleted,
        }
    }

    #[inline]
    pub fn is_active(&self, point_id: PointOffsetType) -> bool {
        self.bits.get_bit(point_id as usize) == Some(false)
    }

    pub fn mark_deleted(&mut self, point_id: PointOffsetType) -> bool {
        let newly_marked = self.is_active(point_id);
        if newly_marked {
            self.bits.set(point_id as usize, true);
            self.count += 1;
        }
        newly_marked
    }

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

    pub fn active_count(&self) -> usize {
        self.bits.len() - self.count
    }

    pub fn ram_usage_bytes(&self) -> usize {
        self.bits.capacity().div_ceil(u8::BITS as usize)
    }
}