Struct ComplexityDelta 

pub struct ComplexityDelta {
    pub compute_order: Ordering,
    pub memory_order: Ordering,
    pub rationale: &'static str,
}

Strict-improvement vector along the (compute, memory) dimensions (spec §10.10.2 + §10.10.3 catalog table).

A non-empty finding must have at least one dimension Less and the other ≤ Equal. The optimizer rejects findings that are Equal on both dimensions.

Fields

compute_order: Ordering

How the compute cost of the witness compares to the input’s.

memory_order: Ordering

How its memory cost compares.

rationale: &'static str

Why the ordering holds.

Implementations

impl ComplexityDelta

pub fn less_compute() -> Self

Rule reduces compute, no change to memory.

pub fn less_memory() -> Self

Rule reduces memory, no change to compute.

pub fn less_both() -> Self

Rule reduces both compute and memory.

pub fn equal() -> Self

No change in either dimension. Used for the empty finding; the optimizer never produces a Reduction with this delta.

pub fn is_strict_improvement(&self) -> bool

true if at least one dimension is strictly Less and the other is at most Equal. Per spec §10.10.2 this is the condition for a non-empty finding to be valid.

Trait Implementations

impl Clone for ComplexityDelta

fn clone(&self) -> ComplexityDelta

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ComplexityDelta

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

Formats the value using the given formatter.

impl Eq for ComplexityDelta

impl PartialEq for ComplexityDelta

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for ComplexityDelta