diskann-quantization 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

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

//! Binary quantization compression and distance comparisions.
//!
//! Binary quantization works by compressing each dimension of a vector to just 1 bit,
//! where that bit is "1" is that value is positive and "0" if negative.
//!
//! The main quantizer is [`BinaryQuantizer`].
//!
//! Distances are computed using the [`crate::distances::Hamming`] distance function where
//! [`crate::bits::BitSlice::<1, crate::bits::Binary>`] is the compressed-representation
//! for binary vectors.

mod quantizer;

/////////////
// Exports //
/////////////

pub use quantizer::BinaryQuantizer;