pub struct SieveRouter<'a> {
pub collection: &'a SieveCollection,
pub fallback: &'a HnswIndex,
}Expand description
Routes a filtered ANN query to the right index.
- If
predicate_signatureisSome(sig)and a subindex exists forsig, the query is executed directly on that subindex (no bitmap needed). - Otherwise the query falls back to
navix_searchon the global fallback index usingallowedas the sideways-information bitmap.
Fields§
§collection: &'a SieveCollectionCollection of specialized subindices.
fallback: &'a HnswIndexGlobal index used when no subindex matches.
Implementations§
Source§impl<'a> SieveRouter<'a>
impl<'a> SieveRouter<'a>
Sourcepub fn route(
&self,
query: &[f32],
predicate_signature: Option<&PredicateSignature>,
allowed: RoaringBitmap,
k: usize,
ef_search: usize,
metric: DistanceMetric,
) -> Vec<SearchResult>
pub fn route( &self, query: &[f32], predicate_signature: Option<&PredicateSignature>, allowed: RoaringBitmap, k: usize, ef_search: usize, metric: DistanceMetric, ) -> Vec<SearchResult>
Execute a filtered k-NN query.
§Parameters
query— query vector.predicate_signature— optional stable predicate; if present and a subindex exists for it, that subindex is used directly.allowed— bitmap of allowed IDs for the NaviX fallback path. Ignored when a subindex is matched.k— number of nearest neighbours to return.ef_search— beam width for HNSW/NaviX traversal.metric— distance metric.
§Returns
Up to k nearest-neighbour results, sorted by ascending distance.
Auto Trait Implementations§
impl<'a> Freeze for SieveRouter<'a>
impl<'a> !RefUnwindSafe for SieveRouter<'a>
impl<'a> !Send for SieveRouter<'a>
impl<'a> !Sync for SieveRouter<'a>
impl<'a> Unpin for SieveRouter<'a>
impl<'a> UnsafeUnpin for SieveRouter<'a>
impl<'a> !UnwindSafe for SieveRouter<'a>
Blanket Implementations§
Source§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
Source§type ArchivedMetadata = ()
type ArchivedMetadata = ()
The archived version of the pointer metadata for this type.
Source§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
Converts some archived metadata to the pointer metadata for itself.
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> LayoutRaw for T
impl<T> LayoutRaw for T
Source§fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError>
Returns the layout of the type.
Source§impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
Source§unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
Returns whether the given value has been niched. Read more
Source§fn resolve_niched(out: Place<NichedOption<T, N1>>)
fn resolve_niched(out: Place<NichedOption<T, N1>>)
Writes data to
out indicating that a T is niched.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.