Struct OrderingCost 

pub struct OrderingCost {
    pub ordering: BlobOrdering,
    pub scrub: QueryCost,
    pub pan: QueryCost,
    pub total_reads: u64,
    pub total_bytes_read: u64,
    pub cost: u64,
}

Aggregate cost of one ordering across the canonical query mix.

Fields

ordering: BlobOrdering

scrub: QueryCost

pan: QueryCost

total_reads: u64

total_bytes_read: u64

cost: u64

Blended cost in bytes-equivalent: total_bytes_read + total_reads * gap. The reader over-reads up to gap bytes to save one request, so it prices a request at exactly gap bytes — this is the same trade the coalescer makes, so ranking by it is self-consistent. Request count alone is a broken proxy (fusing an entire archive into “1 read” of hundreds of MiB would look free); bytes alone ignores per-request latency.

Trait Implementations

impl Clone for OrderingCost

fn clone(&self) -> OrderingCost

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for OrderingCost

impl Debug for OrderingCost

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

Formats the value using the given formatter.