Struct CostTable 

pub struct CostTable {
    pub key: TableKey,
    /* private fields */
}

2026-10-04: A parsed, validated cost table.

Fields

key: TableKey

Implementations

impl CostTable

pub fn parse(text: &str) -> Result<Self, String>

2026-10-04: Parses a table file’s text and validates it: schema SCHEMA, at least one width, every listed width measured at every depth 0..=max_k, no duplicate cell, every cost finite and positive (a draft cost of exactly 0 is required at k = 0).

pub fn render(key: &TableKey, cells: &[Cell]) -> Result<String, String>

2026-10-04: The table file text for key and cells, in the format Self::parse reads; validated by parsing it back, so a grid that would be refused at serve time is refused when written.

pub fn max_k(&self) -> usize

2026-10-04: Deepest draft count the table measured.

pub fn cell(&self, n: usize, k: usize) -> Option<Cell>

2026-10-04: The cost of a step at width n and depth k (k <= max_k), linearly interpolated between the two measured widths around n; the nearest measured width outside the measured range. None above max_k.

Trait Implementations

impl Clone for CostTable

fn clone(&self) -> CostTable

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for CostTable

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

Formats the value using the given formatter.

impl PartialEq for CostTable

fn eq(&self, other: &CostTable) -> 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 StructuralPartialEq for CostTable