diskann-providers 0.51.0

DiskANN is a fast approximate nearest neighbor search library for high dimensional data
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

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

//! Native (DiskANN built-in) data providers and strategies for async index build and search.

use diskann::graph::workingset;

mod provider;
pub use provider::{DefaultProvider, DefaultProviderParameters, SetStartPoints};

/// The in-mem providers pass through prune elements straight back to their underlying
/// providers. This is the working-set precursor and is a ZST because ... it doesn't need to
/// do anything!
#[derive(Debug, Clone, Copy)]
pub struct PassThrough;

impl workingset::AsWorkingSet<Self> for PassThrough {
    fn as_working_set(&self, _capacity: usize) -> Self {
        *self
    }
}

// Extensions
mod scalar;
pub use scalar::{SQError, SQStore, WithBits};

#[cfg(not(test))]
mod product;
pub use product::DefaultQuant;

pub mod spherical;

mod full_precision;
pub use full_precision::{
    CreateFullPrecision, FullAccessor, FullPrecisionProvider, FullPrecisionStore,
};
pub(super) use full_precision::{GetFullPrecision, Rerank};

#[cfg(test)]
pub mod product;
#[cfg(test)]
pub(crate) mod test;