Struct SearchReceiptV1 

pub struct SearchReceiptV1 {
    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,
}

Receipt documenting an approximate sidecar search.

This is deliberately lightweight compared to the turbo-quant analogue: the fib-quant sidecar does not own the original vectors or codebook digests beyond the profile, so the receipt captures only the operational parameters and timing of the search.

Fields

schema: String

Schema marker, always "fib_sidecar_search_receipt_v1".

indexed_count: usize

Number of encoded entries currently in the index.

top_k: usize

Requested top_k.

oversample: usize

Requested oversample factor.

candidate_count: usize

Number of candidates actually returned (≤ top_k * oversample).

approximate_only: bool

Always true: this is an approximate index.

exact_rerank_required: bool

Always true: callers must rerank with exact inner product.

elapsed_micros: u128

Elapsed time of the search in microseconds.

Trait Implementations

impl Clone for SearchReceiptV1

fn clone(&self) -> SearchReceiptV1

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for SearchReceiptV1

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl PartialEq for SearchReceiptV1

fn eq(&self, other: &SearchReceiptV1) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for SearchReceiptV1