Struct OrderedRhoBounds 

pub struct OrderedRhoBounds { /* private fields */ }

A validated, finite, ordered ρ (log-λ) seed interval [lo, hi].

Every seed clamp in the outer-optimizer prepass and the candidate lattice derives a trial ρ and pins it into a single uniform box assembled from two independently-owned constants — the outer ρ lower wall (options.rho_lower_bound) and an over-smoothing ceiling (RHO_BOUND or an effective-df crossing). When those constants drift apart the interval inverts (lo > hi): the #2370 disease, where an edf-ceiling that used to equal -rho_lower_bound was moved by #2356 and the emitted upper bound dropped below the lower one. The historical response — silently swapping the pair (normalize_seed_bounds) — does not make the fit correct; it makes the optimizer solve a different, silently substituted box and return a model as if nothing were wrong. That is strictly worse than the panic it replaced: a panic is loud, a silently-wrong λ-box is not.

This type makes the inverted state unrepresentable. It is constructed only through OrderedRhoBounds::new, which refuses an inverted or non-finite interval with the same typed [EstimationError::InvalidInput] the outer entry (run_outer_uncertified) now enforces (#2379 / #2370). Every downstream clamp then operates on an interval that is ordered by construction, so f64::clamp’s min <= max precondition can never be violated.

Implementations

impl OrderedRhoBounds

pub fn new(lo: f64, hi: f64) -> Result<Self, EstimationError>

Validate and wrap a [lo, hi] ρ interval. Refuses (rather than silently reorders) an inverted (lo > hi) or non-finite interval, naming both endpoints. lo == hi is a valid degenerate single-point box.

pub fn lower(self) -> f64

The (validated) lower endpoint.

pub fn upper(self) -> f64

The (validated) upper endpoint.

pub fn clamp(self, value: f64) -> f64

Clamp value into [lo, hi]. Infallible: the interval is ordered by construction, so f64::clamp’s min <= max precondition always holds.

pub fn with_upper_at_least(self, floor: f64) -> Self

Raise the upper endpoint to at least floor, preserving orderedness.

The criterion-ranked prepass widens its over-smoothing bound to the full range the outer optimizer can reach (RHO_BOUND) so a genuinely large λ seed is not clipped to the seed band. This only ever raises hi, so the interval stays valid by construction. A non-finite floor is ignored to preserve the finiteness invariant (callers pass the finite RHO_BOUND).

Trait Implementations

impl Clone for OrderedRhoBounds

fn clone(&self) -> OrderedRhoBounds

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for OrderedRhoBounds

impl Debug for OrderedRhoBounds

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

Formats the value using the given formatter.

impl PartialEq for OrderedRhoBounds

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for OrderedRhoBounds