Struct ReconciliationRow 

pub struct ReconciliationRow {
    pub leg: ExplainLeg,
    pub predicted: f64,
    pub explained: f64,
    pub difference: f64,
    pub own_gamma: f64,
    pub cross_gamma: f64,
    pub residual: f64,
}

One leg of a reconciliation, its terms named.

Fields

leg: ExplainLeg

The leg: the resets, an axis, or the off-axis remainder.

predicted: f64

The first-order term from risk on the axis — the prediction. For the resets leg, the prediction’s own reset step, which is the same exact revaluation, so that row’s difference is zero.

explained: f64

The ladder’s leg on the axis — the revaluation.

difference: f64

explained − predicted: what the leg holds beyond its first order, made of the three terms below.

own_gamma: f64

The own gamma of the groups this leg moves: their own terms, and the cross terms among them where the leg moves several together.

cross_gamma: f64

The cross gamma between this leg’s groups and every group an earlier leg moved — the ladder’s step-order effect, as a number.

residual: f64

difference − own_gamma − cross_gamma: what neither the first nor the second order explains on this leg.

Trait Implementations

impl Clone for ReconciliationRow

fn clone(&self) -> ReconciliationRow

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ReconciliationRow

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

Formats the value using the given formatter.

impl PartialEq for ReconciliationRow

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