Struct OptimizeProposal 

pub struct OptimizeProposal {
    pub year: i32,
    pub baseline_tax: Usd,
    pub optimized_tax: Usd,
    pub delta: Usd,
    pub per_disposal: Vec<DisposalProposal>,
    pub marginal_rates: MarginalRates,
    pub approximate: bool,
    pub approx_reason: Option<ApproxReason>,
}

Mode-1 proposal: what-if by default (running this binds NOTHING — §C.2).

Fields

year: i32

baseline_tax: Usd

optimized_tax: Usd

delta: Usd

per_disposal: Vec<DisposalProposal>

marginal_rates: MarginalRates

approximate: bool

false ⇔ the vertex set was FULLY enumerated AND exhaustively scored — i.e. EVERY target disposal’s pool was ≤ LOT_ENUM_BOUND (complete vertex enumeration, NOT a heuristic subset — R2-C1), the overall product was ≤ MAX_COMBOS (exhaustive, not coordinate-descent), AND every contended pool was jointly enumerated. ONLY then is the result the PROVEN global minimum over the vertex space. true ⇔ ANY of those failed (a disclosed LOCAL / under-enumerated / heuristic-pool result) — the renderer MUST print the “APPROXIMATE — not a guaranteed global minimum” banner and the CLI MUST log approx_reason (R0-C1/C3, R2-C1). NEVER render optimized_tax as “the optimum” when this is true.

approx_reason: Option<ApproxReason>

Trait Implementations

impl Clone for OptimizeProposal

fn clone(&self) -> OptimizeProposal

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for OptimizeProposal

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

Formats the value using the given formatter.

impl Eq for OptimizeProposal

impl PartialEq for OptimizeProposal

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for OptimizeProposal