pub struct ProductSearchIndex { /* private fields */ }Expand description
Multi-vector product search index.
Implementations§
Source§impl ProductSearchIndex
impl ProductSearchIndex
Sourcepub fn new(config: ProductSearchConfig) -> Self
pub fn new(config: ProductSearchConfig) -> Self
Create an empty index.
Sourcepub fn insert(&mut self, item: MultiVector)
pub fn insert(&mut self, item: MultiVector)
Insert an item into the index.
Sourcepub fn search(&self, query: &MultiVector, k: usize) -> Vec<SearchCandidate>
pub fn search(&self, query: &MultiVector, k: usize) -> Vec<SearchCandidate>
Search for the k nearest items to query across all sub-vectors.
The combined score is the mean of per-sub-vector scores. Items are returned sorted by combined score (descending for similarity metrics).
Sourcepub fn search_sub(
&self,
query_sub: &[f32],
sub_idx: usize,
k: usize,
) -> Vec<SearchCandidate>
pub fn search_sub( &self, query_sub: &[f32], sub_idx: usize, k: usize, ) -> Vec<SearchCandidate>
Search using only the sub-vector at index sub_idx.
Sourcepub fn item_count(&self) -> usize
pub fn item_count(&self) -> usize
Number of items in the index.
Sourcepub fn sub_dimension_count(&self) -> usize
pub fn sub_dimension_count(&self) -> usize
The configured number of sub-dimensions.
Auto Trait Implementations§
impl Freeze for ProductSearchIndex
impl RefUnwindSafe for ProductSearchIndex
impl Send for ProductSearchIndex
impl Sync for ProductSearchIndex
impl Unpin for ProductSearchIndex
impl UnsafeUnpin for ProductSearchIndex
impl UnwindSafe for ProductSearchIndex
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> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
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<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt for Twhere
T: ?Sized,
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.