Struct DistanceCost 

pub struct DistanceCost {
    pub approx_s: f64,
    pub exact_s: f64,
}

Per-operation cost of distance computation on the active CPU.

Approximate distances are PQ/ADC table lookups over RAM-resident codes and are cheap; exact distances are full d-dimensional SIMD reductions over a fetched vector. Keeping the two priced separately is what makes the approximate-gate trade — spend cheap approximate ops to avoid expensive exact fetches — legible in the cost model.

Costs are in seconds per operation and are expected to be obtained by offline micro-benchmarking (the SIMD bench harness) for a given dimensionality, dtype, and instruction set.

Fields

approx_s: f64

Seconds per approximate (PQ/ADC lookup) distance.

exact_s: f64

Seconds per exact (full SIMD) distance.

Implementations

impl DistanceCost

pub const fn new(approx_s: f64, exact_s: f64) -> Self

Construct an explicit per-op cost pair.

Trait Implementations

impl Clone for DistanceCost

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for DistanceCost

impl Debug for DistanceCost

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for DistanceCost

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl PartialEq for DistanceCost

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

Equality operator ==.

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

Inequality operator !=.

impl Serialize for DistanceCost

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for DistanceCost