Struct PlanPath 

pub struct PlanPath {
    pub chain: Vec<String>,
    pub total_cost: u64,
    pub fits: bool,
    pub effects: BTreeSet<String>,
}

One linear chain from goal to a leaf, with its total cost and the union of effects along it.

Fields

chain: Vec<String>

Functions in call order — chain[0] is always goal.

total_cost: u64

Sum of declared [budget(N)] for every fn in chain. Recursive self-calls are counted once (the cycle is broken at the second visit) — see expand_paths for the visited-set.

fits: bool

true iff total_cost <= effective_cap (whichever of max_cost and the session-remaining is smaller). Always true when no cap applies.

effects: BTreeSet<String>

Union of effect names declared on every fn in the chain (excluding the budget pseudo-effect, which is the cost dimension itself).

Trait Implementations

impl Clone for PlanPath

fn clone(&self) -> PlanPath

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PlanPath

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for PlanPath

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for PlanPath

impl PartialEq for PlanPath

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

Equality operator ==.

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

Inequality operator !=.

impl Serialize for PlanPath

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 PlanPath