Struct FullAccessor 

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

An accessor for retrieving full-precision vectors from the BfTreeProvider.

This type implements the following traits:

• [Accessor] for the BfTreeProvider.
• [BuildQueryComputer].

Trait Implementations

impl<T, Q> HasId for FullAccessor<'_, T, Q>

where T: VectorRepr, Q: AsyncFriendly,

type Id = u32

impl<T, Q> SearchAccessor for FullAccessor<'_, T, Q>

where T: VectorRepr, Q: AsyncFriendly,

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.