Struct Cost 

pub struct Cost {
    pub warm: u64,
    pub cold: u64,
}

What pulling content via a route costs, in two magnitudes that accumulate together and are compared in that order: lower warm wins, and cold breaks the tie.

Both are the same path priced against different cache states. warm is what one more subscription would cost the mesh right now; cold prices the identical path as if nothing were cached, so it stays meaningful once discounts have flattened warm.

Fields

warm: u64

The cost of pulling content via this route as the mesh stands today, accumulated per link. Lower wins.

The original publisher seeds it with its production cost (zero for a live publish, something large for a standby that would have to start working, like a cold transcoder), and each link adds its own configured price as the announcement crosses it, so a route over a metered backbone ranks worse than an equal-length one within a datacenter.

cold: u64

The same path with every warm discount removed: what pulling the content would cost if no relay along it were carrying anything.

Accumulates exactly like warm but never restarts. MAX when the peer’s wire cannot express it (pre-lite-06, or the MoQ Cluster extension), which ranks last rather than pretending the path is free.

Implementations

impl Cost

pub const MAX: Self

The highest cost either half can take, and where accumulation saturates.

A draining session stamps this on its routes so every other candidate outranks them while they stay selectable as the last path to the content. Draining is not a distinct state: cost is the whole mechanism, and a route whose accumulated cost saturates the wire ceiling ranks (and is treated) the same way.

pub const DRAIN: Self = Self::MAX

A draining route: MAX in both magnitudes, so every other candidate outranks it.

pub const fn new(cost: u64) -> Self

Both magnitudes at cost: an undiscounted route, which is what a publisher seeding its production cost means.

Trait Implementations

impl Clone for Cost

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 Cost

impl Debug for Cost

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

Formats the value using the given formatter.

impl Default for Cost

fn default() -> Self

Returns the “default value” for a type.

impl Eq for Cost

impl From<u64> for Cost

fn from(cost: u64) -> Self

Converts to this type from the input type.

impl Ord for Cost

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

fn clamp_to<R>(self, range: R) -> Self

where Self: Sized, R: ClampBounds<Self>,

🔬This is a nightly-only experimental API. (clamp_to)

Restrict a value to a certain range.

impl PartialEq for Cost

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

Equality operator ==.

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

Inequality operator !=.

impl PartialOrd for Cost

fn partial_cmp(&self, other: &Self) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl StructuralPartialEq for Cost