Struct Ladder 

pub struct Ladder {
    pub declared: Vec<u32>,
    pub derived: Vec<u32>,
    pub slots_admitted: SlotsAdmitted,
}

PP-24 — the band ladder: declared, and what both servers actually admitted.

A c = 16 band against a subject that admitted 11 slots measured a queue, not a server. So the bands that may carry numbers are derived from the admissions rather than declared by the harness.

Fields

declared: Vec<u32>

The bands the matrix declares.

derived: Vec<u32>

{c ∈ declared : c ≤ min(slots_admitted)}.

slots_admitted: SlotsAdmitted

What each lane reported.

Implementations

impl Ladder

pub fn derive(declared: &[u32], slots_admitted: SlotsAdmitted) -> Self

Derive the ladder from the declared bands and the two servers’ reports.

When neither lane reported a slot count the derived ladder is the declared one — and the caller names the absence in unproduced_fields, which ReceiptInput::render does. Silently narrowing the ladder on no evidence would drop bands that ran perfectly well.

pub fn is_underived(&self) -> bool

True when neither lane reported a slot count, so the ladder is the declared one on no evidence.

Trait Implementations

impl Clone for Ladder

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Ladder

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for Ladder

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for Ladder

impl PartialEq for Ladder

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

Equality operator ==.

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

Inequality operator !=.

impl Serialize for Ladder

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 Ladder