pub struct BatchSearchEngine { /* private fields */ }Expand description
Concurrent batch search over multiple query vectors.
Wraps a SimdVectorSearch index and executes multiple queries in
parallel using scirs2_core::parallel_ops.
Implementations§
Source§impl BatchSearchEngine
impl BatchSearchEngine
Sourcepub fn new(index: SimdVectorSearch) -> Self
pub fn new(index: SimdVectorSearch) -> Self
Wrap an existing SimdVectorSearch index.
Sourcepub fn batch_search(
&self,
queries: &[Vec<f32>],
k: usize,
) -> Result<Vec<Vec<(String, f32)>>>
pub fn batch_search( &self, queries: &[Vec<f32>], k: usize, ) -> Result<Vec<Vec<(String, f32)>>>
Execute queries in parallel, each returning the k nearest
neighbours. The outer Vec preserves query ordering.
Sourcepub fn timed_search(
&self,
query: &[f32],
k: usize,
metrics: &SearchMetrics,
) -> Result<Vec<(String, f32)>>
pub fn timed_search( &self, query: &[f32], k: usize, metrics: &SearchMetrics, ) -> Result<Vec<(String, f32)>>
Search for a single query and record the latency into metrics.
Sourcepub fn index_size(&self) -> usize
pub fn index_size(&self) -> usize
Return the number of vectors in the underlying index.
Trait Implementations§
Auto Trait Implementations§
impl Freeze for BatchSearchEngine
impl RefUnwindSafe for BatchSearchEngine
impl Send for BatchSearchEngine
impl Sync for BatchSearchEngine
impl Unpin for BatchSearchEngine
impl UnsafeUnpin for BatchSearchEngine
impl UnwindSafe for BatchSearchEngine
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.