Struct ReadCost 

pub struct ReadCost {
    pub depth: u32,
    pub inflated: u64,
    pub external_base: bool,
}

What one read actually cost, measured by the read rather than predicted.

The whole point of carrying it: the cache admission decision needs to know whether an object was expensive to produce, and the reader that just produced it is the only thing in the system that knows for certain. The index could carry a depth column instead — git’s .idx does not, but the walk computes one — and it would still be a prediction of what a read will cost, while this is the bill.

Fields

depth: u32

Delta links followed. 0 is a whole object: one inflate of one zlib stream at one offset, which is what makes a direct read cheap enough that caching it would be a waste of somebody’s quota.

inflated: u64

Bytes the chain produced.

external_base: bool

The chain bottomed out on an object this archive does not hold, so a BaseSource paid for it. Rare, and never cheap.

Trait Implementations

impl Clone for ReadCost

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 ReadCost

impl Debug for ReadCost

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

Formats the value using the given formatter.

impl Default for ReadCost

fn default() -> Self

Returns the “default value” for a type.

impl Eq for ReadCost

impl PartialEq for ReadCost

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for ReadCost