pub struct RejectEscalator { /* private fields */ }Expand description
Geometric damping escalator for one reject chain
(Madsen–Nielsen–Tingleff eq 3.16: the multiplier starts at 2 and
doubles on every rejection, so successive bumps are ×2, ×4, ×8, …).
Owns the factor and the reject count as one indivisible discipline —
no branch can bump the damping without advancing the schedule, the
drift mode behind #874. Deliberately does NOT own the per-iteration
count; that is IterationBound’s job (see module docs for why the
two must not be one type).
Implementations§
Source§impl RejectEscalator
impl RejectEscalator
pub fn new() -> Self
Sourcepub fn escalate(&mut self, damping: &mut f64)
pub fn escalate(&mut self, damping: &mut f64)
Record a rejection: bumps the damping and advances the geometric schedule in one indivisible step.
Trait Implementations§
Source§impl Clone for RejectEscalator
impl Clone for RejectEscalator
Source§fn clone(&self) -> RejectEscalator
fn clone(&self) -> RejectEscalator
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for RejectEscalator
impl Debug for RejectEscalator
Auto Trait Implementations§
impl Freeze for RejectEscalator
impl RefUnwindSafe for RejectEscalator
impl Send for RejectEscalator
impl Sync for RejectEscalator
impl Unpin for RejectEscalator
impl UnsafeUnpin for RejectEscalator
impl UnwindSafe for RejectEscalator
Blanket Implementations§
impl<T> Allocation for T
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T> DistributionExt for Twhere
T: ?Sized,
impl<T, U> Imply<T> for U
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.