Struct SolveReport 

pub struct SolveReport {
    pub converged: bool,
    pub max_residual: f64,
    pub iterations: usize,
    pub dof: usize,
    pub free_points: BTreeMap<PointId, bool>,
    pub free_curves: BTreeMap<CurveId, bool>,
    pub failed_constraints: Vec<ConstraintId>,
}

The outcome of a solve.

Fields

converged: bool

Every constraint holds (to [RELATIVE_TOLERANCE] of the sketch size).

max_residual: f64

Largest remaining constraint residual, in sketch units.

iterations: usize

dof: usize

Remaining degrees of freedom: variables minus independent constraints.

free_points: BTreeMap<PointId, bool>

Per point: whether it can still move without violating a constraint.

free_curves: BTreeMap<CurveId, bool>

Per curve: whether any of its points or its own sweep/radius can still change.

failed_constraints: Vec<ConstraintId>

The constraints left unsatisfied (conflicting or unreachable), empty when converged.

Trait Implementations

impl Clone for SolveReport

fn clone(&self) -> SolveReport

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SolveReport

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

Formats the value using the given formatter.

impl PartialEq for SolveReport

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

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 SolveReport