diskann-inmem 0.56.0

DiskANN3 is a composable library for bringing scalable, accurate and cost-effective vector indexing to multiple databases.
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
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173

/*
 * Copyright (c) Microsoft Corporation.
 * Licensed under the MIT license.
 */

pub(crate) use inner::{Counters, LocalCounters};

#[cfg(not(feature = "integration-test"))]
mod inner {
    use std::marker::PhantomData;

    #[derive(Debug, Default)]
    pub(crate) struct Counters;

    impl Counters {
        pub(crate) fn new() -> Self {
            Self
        }

        pub(crate) fn local(&self) -> LocalCounters<'_> {
            LocalCounters::new()
        }
    }

    #[derive(Debug)]
    pub(crate) struct LocalCounters<'a> {
        _marker: PhantomData<&'a ()>,
    }

    impl LocalCounters<'_> {
        fn new() -> Self {
            Self {
                _marker: PhantomData,
            }
        }

        pub(crate) fn fork(&self) -> Self {
            Self::new()
        }

        pub(crate) fn query_distance(&mut self, _i: u64) {}
        pub(crate) fn distance_ref(&self, _i: u64) {}
        pub(crate) fn get_vector(&mut self, _i: u64) {}
        pub(crate) fn get_vector_ref(&self, _i: u64) {}
        pub(crate) fn set_vector(&mut self, _i: u64) {}
        pub(crate) fn get_neighbors(&mut self, _i: u64) {}
        pub(crate) fn set_neighbors(&mut self, _i: u64) {}
        pub(crate) fn append_vector(&mut self, _i: u64) {}
    }
}

#[cfg(feature = "integration-test")]
mod inner {
    use std::sync::atomic::{AtomicU64, Ordering::Relaxed};

    #[derive(Debug, Default)]
    pub(crate) struct Counters {
        query_distance: AtomicU64,
        distance: AtomicU64,
        get_vector: AtomicU64,
        set_vector: AtomicU64,
        get_neighbors: AtomicU64,
        set_neighbors: AtomicU64,
        append_neighbors: AtomicU64,
    }

    impl Counters {
        pub(crate) fn new() -> Self {
            Self::default()
        }

        pub(crate) fn local(&self) -> LocalCounters<'_> {
            LocalCounters::new(self)
        }

        pub(crate) fn snapshot(&self) -> crate::integration::counters::CounterSnapshot {
            crate::integration::counters::CounterSnapshot {
                query_distance: self.query_distance.load(Relaxed),
                distance: self.distance.load(Relaxed),
                get_vector: self.get_vector.load(Relaxed),
                set_vector: self.set_vector.load(Relaxed),
                get_neighbors: self.get_neighbors.load(Relaxed),
                set_neighbors: self.set_neighbors.load(Relaxed),
                append_neighbors: self.append_neighbors.load(Relaxed),
            }
        }
    }

    #[derive(Debug)]
    pub(crate) struct LocalCounters<'a> {
        query_distance: u64,
        // This fields needs to be `AtomicU64` because we increment in some loops where we
        // have to increment it behind a shared reference.
        distance: AtomicU64,
        // This fields needs to be `AtomicU64` because we increment in some loops where we
        // have to increment it behind a shared reference.
        get_vector: AtomicU64,
        set_vector: u64,
        get_neighbors: u64,
        set_neighbors: u64,
        append_neighbors: u64,
        parent: &'a Counters,
    }

    impl<'a> LocalCounters<'a> {
        fn new(parent: &'a Counters) -> Self {
            Self {
                query_distance: 0,
                distance: AtomicU64::new(0),
                get_vector: AtomicU64::new(0),
                set_vector: 0,
                get_neighbors: 0,
                set_neighbors: 0,
                append_neighbors: 0,
                parent,
            }
        }

        pub(crate) fn fork(&self) -> LocalCounters<'a> {
            Self::new(self.parent)
        }

        pub(crate) fn query_distance(&mut self, i: u64) {
            self.query_distance += i;
        }

        pub(crate) fn distance_ref(&self, i: u64) {
            self.distance.fetch_add(i, Relaxed);
        }

        pub(crate) fn get_vector(&mut self, i: u64) {
            *self.get_vector.get_mut() += i;
        }

        pub(crate) fn get_vector_ref(&self, i: u64) {
            self.get_vector.fetch_add(i, Relaxed);
        }

        pub(crate) fn set_vector(&mut self, i: u64) {
            self.set_vector += i;
        }

        pub(crate) fn get_neighbors(&mut self, i: u64) {
            self.get_neighbors += i;
        }

        pub(crate) fn set_neighbors(&mut self, i: u64) {
            self.set_neighbors += i;
        }

        pub(crate) fn append_vector(&mut self, i: u64) {
            self.append_neighbors += i;
        }
    }

    impl Drop for LocalCounters<'_> {
        fn drop(&mut self) {
            let parent = self.parent;

            fn update(dst: &AtomicU64, src: u64) {
                dst.fetch_add(src, Relaxed);
            }

            update(&parent.query_distance, self.query_distance);
            update(&parent.distance, *self.distance.get_mut());
            update(&parent.get_vector, *self.get_vector.get_mut());
            update(&parent.set_vector, self.set_vector);
            update(&parent.get_neighbors, self.get_neighbors);
            update(&parent.set_neighbors, self.set_neighbors);
            update(&parent.append_neighbors, self.append_neighbors);
        }
    }
}