Struct DecodeCost 

pub struct DecodeCost {
    pub machine: &'static str,
    pub chips: u32,
    pub stages: Vec<StageCost>,
    pub floor_s: f64,
    pub floor_binds: Bind,
    pub time_s: Option<f64>,
    pub collectives: usize,
    pub residency: Vec<(TierKind, f64)>,
    pub provenance: Provenance,
}

One token of a step on a machine.

Fields

machine: &'static str

chips: u32

stages: Vec<StageCost>

floor_s: f64

No implementation decodes a token faster: the largest of the summed memory, compute and collective terms, with undeclared terms at zero.

floor_binds: Bind

time_s: Option<f64>

Each stage’s roofline plus its collective and its overhead, summed along the chain — None while any term it needs is undeclared.

collectives: usize

Reductions across chips per token.

residency: Vec<(TierKind, f64)>

Of each tier, the share of the held bytes it keeps, per chip.

provenance: Provenance

The weakest fact the price rests on.

Implementations

impl DecodeCost

pub fn floor_tokens_per_s(&self) -> f64

pub fn tokens_per_s(&self) -> Option<f64>

Trait Implementations

impl Clone for DecodeCost

fn clone(&self) -> DecodeCost

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for DecodeCost

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

Formats the value using the given formatter.

impl PartialEq for DecodeCost

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for DecodeCost

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 DecodeCost