pub struct VSearcher<'a> { /* private fields */ }Expand description
Per-thread search state for one VGraph.
Implementations§
Source§impl VSearcher<'_>
impl VSearcher<'_>
Sourcepub fn last_screened(&self) -> usize
pub fn last_screened(&self) -> usize
Neighbours the screen skipped (no 8-bit estimate) in the last search.
Sourcepub fn knobs(&self) -> SearchKnobs
pub fn knobs(&self) -> SearchKnobs
The knobs this searcher runs with.
Sourcepub fn search(
&mut self,
query: &[f32],
k: usize,
params: VSearchParams,
out: &mut Vec<u32>,
) -> Result<usize, WarmError>
pub fn search( &mut self, query: &[f32], k: usize, params: VSearchParams, out: &mut Vec<u32>, ) -> Result<usize, WarmError>
Searches this index with the searcher’s reusable buffers.
Returns min(k, n) distinct neighbors, restarting from an unseen vertex only when
traversal would otherwise return too few candidates.
Auto Trait Implementations§
impl<'a> Freeze for VSearcher<'a>
impl<'a> RefUnwindSafe for VSearcher<'a>
impl<'a> Send for VSearcher<'a>
impl<'a> Sync for VSearcher<'a>
impl<'a> Unpin for VSearcher<'a>
impl<'a> UnsafeUnpin for VSearcher<'a>
impl<'a> UnwindSafe for VSearcher<'a>
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> 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 more§impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§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 more§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).§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.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.