pub struct RaBitQIndex {
pub codebook: RaBitQCodebook,
pub centroid: Vec<f32>,
pub vectors: Vec<QuantizedVector>,
pub raw_vectors: Option<Vec<Vec<f32>>>,
}Expand description
Standalone RaBitQ index for small datasets
Uses brute-force search over all quantized vectors.
For larger datasets, use IVFRaBitQIndex instead.
Fields§
§codebook: RaBitQCodebookRaBitQ codebook (random transform parameters)
centroid: Vec<f32>Centroid of all indexed vectors
vectors: Vec<QuantizedVector>Quantized vectors
raw_vectors: Option<Vec<Vec<f32>>>Raw vectors for re-ranking (optional)
Implementations§
Source§impl RaBitQIndex
impl RaBitQIndex
Sourcepub fn new(config: RaBitQConfig) -> Self
pub fn new(config: RaBitQConfig) -> Self
Create a new empty RaBitQ index
Sourcepub fn build(
config: RaBitQConfig,
vectors: &[Vec<f32>],
store_raw: bool,
) -> Self
pub fn build( config: RaBitQConfig, vectors: &[Vec<f32>], store_raw: bool, ) -> Self
Build index from a set of vectors
Sourcepub fn prepare_query(&self, query: &[f32]) -> QuantizedQuery
pub fn prepare_query(&self, query: &[f32]) -> QuantizedQuery
Prepare a query for fast distance estimation
Sourcepub fn estimate_distance(&self, query: &QuantizedQuery, vec_idx: usize) -> f32
pub fn estimate_distance(&self, query: &QuantizedQuery, vec_idx: usize) -> f32
Estimate squared distance between query and a quantized vector
Sourcepub fn search(
&self,
query: &[f32],
k: usize,
rerank_factor: usize,
) -> Vec<(usize, f32)>
pub fn search( &self, query: &[f32], k: usize, rerank_factor: usize, ) -> Vec<(usize, f32)>
Search for k nearest neighbors
pub fn is_empty(&self) -> bool
Sourcepub fn size_bytes(&self) -> usize
pub fn size_bytes(&self) -> usize
Memory usage in bytes
Sourcepub fn compression_ratio(&self) -> f32
pub fn compression_ratio(&self) -> f32
Compression ratio compared to raw float32 vectors
Sourcepub fn from_bytes(data: &[u8]) -> Result<Self>
pub fn from_bytes(data: &[u8]) -> Result<Self>
Deserialize from bytes
Trait Implementations§
Source§impl Clone for RaBitQIndex
impl Clone for RaBitQIndex
Source§fn clone(&self) -> RaBitQIndex
fn clone(&self) -> RaBitQIndex
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for RaBitQIndex
impl Debug for RaBitQIndex
Source§impl<'de> Deserialize<'de> for RaBitQIndex
impl<'de> Deserialize<'de> for RaBitQIndex
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
Auto Trait Implementations§
impl Freeze for RaBitQIndex
impl RefUnwindSafe for RaBitQIndex
impl Send for RaBitQIndex
impl Sync for RaBitQIndex
impl Unpin for RaBitQIndex
impl UnwindSafe for RaBitQIndex
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.