Skip to main content

ApproxReason

Enum ApproxReason 

Source
pub enum ApproxReason {
    ComboCapExceeded {
        combos: usize,
        cap: usize,
    },
    ContentionUnenumerated {
        contended: usize,
        combos: usize,
        cap: usize,
    },
    PoolHeuristic {
        lots: usize,
        bound: usize,
    },
}
Expand description

Why a proposal is only APPROXIMATE (not a proven global minimum). Carried OUT of core (core has no logger) so the CLI can log the cap/why and the renderer can show the banner. Plain counts only → deterministic + serde/Eq-friendly (R0-C1/C3 fold).

Variants§

§

ComboCapExceeded

The cartesian product of per-group candidate lists exceeded MAX_COMBOS; the baseline-seeded coordinate-descent fallback ran (a LOCAL optimum — disclosed, and never worse than baseline).

Fields

§combos: usize
§cap: usize
§

ContentionUnenumerated

≥1 contended same-wallet pool could not be JOINTLY enumerated within the bound; its disposals fell back to per-disposal-independent generation (a cross-period reassignment optimum may be missed — R0-C3). contended = number of disposals in the un-enumerated contention group(s).

Fields

§contended: usize
§combos: usize
§cap: usize
§

PoolHeuristic

≥1 target disposal’s available pool exceeded LOT_ENUM_BOUND, so candidate_selections returned a deterministic but INCOMPLETE heuristic SUBSET of that pool’s vertices (not the full vertex enumeration) — the result over that pool is therefore NOT a proven global minimum (R2-C1). Common in practice (weekly-DCA / active-trading pools with > 12 lots). lots = the largest heuristic pool’s lot count; bound = LOT_ENUM_BOUND. Baseline-seeded, so delta ≤ 0 still holds — the disclosure corrects the false “proven optimum” claim, not the pick’s safety.

Fields

§lots: usize
§bound: usize

Trait Implementations§

Source§

impl Clone for ApproxReason

Source§

fn clone(&self) -> ApproxReason

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Copy for ApproxReason

Source§

impl Debug for ApproxReason

Source§

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

Formats the value using the given formatter. Read more
Source§

impl Eq for ApproxReason

Source§

impl PartialEq for ApproxReason

Source§

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

Equality operator ==. Read more
1.0.0 (const: unstable) · Source§

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

Inequality operator !=. Read more
Source§

impl StructuralPartialEq for ApproxReason

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
Source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source§

fn equivalent(&self, key: &K) -> bool

Checks if this value is equivalent to the given key. Read more
Source§

impl<Q, K> Equivalent<K> for Q
where Q: Eq + ?Sized, K: Borrow<Q> + ?Sized,

Source§

fn equivalent(&self, key: &K) -> bool

Compare self to key and return true if they are equal.
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> Read<Exclusive, BecauseExclusive> for T
where T: ?Sized,

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.