Struct PillarSolve 

pub struct PillarSolve {
    pub pillar: usize,
    pub iterations: usize,
    pub backtracks: usize,
    pub residual: f64,
}

The result of one pillar’s solve, for a caller that wants to see the work.

Fields

pillar: usize

Which pillar, counting from the short end.

iterations: usize

How many Newton steps it took.

backtracks: usize

How many times a step was halved because the full one would have made the residual worse.

Counted apart from iterations on purpose: they are different costs, and folding them together would quietly change what an iteration count means to everything that reads one. Zero on a well-conditioned ladder.

residual: f64

The residual it finished at.

Implementations

impl PillarSolve

fn at(pillar: usize) -> Self

Pillar pillar, before any step.

fn absorb(&mut self, solved: &SolvedPillar)

Adds a re-solve’s steps, so the report says what the whole solve cost, not what its last sweep did; the residual is the latest.

Trait Implementations

impl Clone for PillarSolve

fn clone(&self) -> PillarSolve

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for PillarSolve

impl Debug for PillarSolve

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

Formats the value using the given formatter.

impl PartialEq for PillarSolve

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