Struct Step 

pub struct Step {
    pub advance: u8,
    pub cost: f32,
}

One transition of a Trellis: how far it moves, and what it costs.

Fields

advance: u8

How many positions it advances. Read into a cell it comes from position - advance; read out of one it goes to position + advance. Must not exceed Trellis::REACH.

cost: f32

The whole cost of taking it in this frame: a structural penalty and whatever the frame charges for what it reads, already multiplied together. Costs are negative log probabilities, so smaller is better.

Implementations

impl Step

pub const ABSENT: Self

A transition that is not available at this cell.

A trellis has the same number of transitions everywhere, which is the meaning of Trellis’s DEGREE, so an edge case is expressed by a transition costing infinity rather than by returning fewer of them. It is also the only way to say “this one would run off the start”, which the solver relies on: a step whose advance exceeds its cell’s position must be absent.

pub const fn new(advance: u8, cost: f32) -> Self

A transition advancing advance positions at cost cost.

Trait Implementations

impl Clone for Step

fn clone(&self) -> Step

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for Step

impl Debug for Step

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

Formats the value using the given formatter.

impl PartialEq for Step

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for Step