Struct QuantAccessor 

pub struct QuantAccessor<'a, T>
where
    T: VectorRepr,
{ /* private fields */ }

An accessor that retrieves the quantized portion of the BfTreeProvider.

This type implements the following traits:

• [Accessor] for the BfTreeProvider.

Trait Implementations

impl<T> HasId for QuantAccessor<'_, T>

where T: VectorRepr,

type Id = u32

impl<T> SearchAccessor for QuantAccessor<'_, T>

where T: VectorRepr,

fn starting_points(&self) -> impl Future<Output = ANNResult<Vec<u32>>>

Return the starting points for this search.

async fn start_point_distances<F>(&mut self, f: F) -> ANNResult<()>

where F: FnMut(Self::Id, f32) + Send,

Compute the distance to all start points, invoking f with all results.

async fn expand_beam<Itr, P, F>( &mut self, ids: Itr, pred: P, on_neighbors: F, ) -> ANNResult<()>

where Itr: Iterator<Item = Self::Id> + Send, P: HybridPredicate<Self::Id> + Send + Sync, F: FnMut(Self::Id, f32) + Send,

A primitive routine used by graph search. This is purposely implemented as a coarse-grained operation to enable optimization opportunities by the backend.

fn terminate_early(&mut self) -> bool

Indicate that search should terminate as soon as possible.

fn is_not_start_point( &self, ) -> impl Future<Output = Result<impl Fn(Self::Id) + Send + Sync + 'static, ANNError>> + Send

Return a closure to evaluate whether or not an ID is associated with a start point.

fn num_starting_points( &self, ) -> impl Future<Output = Result<usize, ANNError>> + Send

Return the number of starting points.

impl<'a, T> SearchPostProcess<QuantAccessor<'a, T>, &[T]> for Rerank

where T: VectorRepr,

type Error = ANNError

fn post_process<I, B>( &self, accessor: &mut QuantAccessor<'a, T>, query: &[T], candidates: I, output: &mut B, ) -> impl Future<Output = Result<usize, Self::Error>> + Send

where I: Iterator<Item = Neighbor<u32>> + Send, B: SearchOutputBuffer<u32> + Send + ?Sized,

Populate output with the entries in candidates. Correct implementations must return the number of results copied into output on success.