pub struct SearchReceiptIvfV1 {
pub schema: String,
pub indexed_count: usize,
pub top_k: usize,
pub oversample: usize,
pub candidate_count: usize,
pub approximate_only: bool,
pub exact_rerank_required: bool,
pub elapsed_micros: u128,
pub num_centroids: usize,
pub nprobe: usize,
pub entries_scored: usize,
pub ivf_used: bool,
}Expand description
Receipt documenting an IVF-accelerated approximate sidecar search.
Extends SearchReceiptV1 with IVF-specific metadata: number of
centroids, cells probed, and entries scored.
Fields§
§schema: StringSchema marker, always "fib_sidecar_search_ivf_receipt_v1".
indexed_count: usizeNumber of encoded entries currently in the index.
top_k: usizeRequested top_k.
oversample: usizeRequested oversample factor.
candidate_count: usizeNumber of candidates actually returned (≤ top_k * oversample).
approximate_only: boolAlways true: this is an approximate index.
exact_rerank_required: boolAlways true: callers must rerank with exact inner product.
elapsed_micros: u128Elapsed time of the search in microseconds.
num_centroids: usizeNumber of centroids in the IVF coarse quantizer.
nprobe: usizeNumber of cells (centroids) probed at query time.
entries_scored: usizeNumber of entries that fell into the probed cells (actually scored).
ivf_used: boolWhether IVF was used (false if fallback to linear scan).
Trait Implementations§
Source§impl Clone for SearchReceiptIvfV1
impl Clone for SearchReceiptIvfV1
Source§fn clone(&self) -> SearchReceiptIvfV1
fn clone(&self) -> SearchReceiptIvfV1
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for SearchReceiptIvfV1
impl Debug for SearchReceiptIvfV1
Source§impl PartialEq for SearchReceiptIvfV1
impl PartialEq for SearchReceiptIvfV1
impl StructuralPartialEq for SearchReceiptIvfV1
Auto Trait Implementations§
impl Freeze for SearchReceiptIvfV1
impl RefUnwindSafe for SearchReceiptIvfV1
impl Send for SearchReceiptIvfV1
impl Sync for SearchReceiptIvfV1
impl Unpin for SearchReceiptIvfV1
impl UnsafeUnpin for SearchReceiptIvfV1
impl UnwindSafe for SearchReceiptIvfV1
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> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
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
impl<T> Scalar for T
impl<T> Scalar for T
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.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.