Struct Explanation 

pub struct Explanation {
    pub key: Key,
    pub chosen: Tier,
    pub row: Row,
    pub pinned: bool,
    pub candidates: Vec<(Tier, Cost)>,
    pub because: String,
}

Why a node’s placement is what it is — the content of beck explain place.

Fields

key: Key

chosen: Tier

row: Row

pinned: bool

True when the tier was decided by a rule rather than by cost — an @on(...), purity, or a Signal[Html]. The candidate costs below are still real, and for a pinned node the chosen one is not required to be the cheapest: that is what pinning means.

candidates: Vec<(Tier, Cost)>

Every tier, with the whole program’s cost when this node sits there and everything else stays where the solver put it. §4.7’s “candidates : data (cost 1.0), server (cost 3.1), …”.

because: String

Trait Implementations

impl Clone for Explanation

fn clone(&self) -> Explanation

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Explanation

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

Formats the value using the given formatter.