pub struct EvolutionStep<G, F>{ /* private fields */ }Expand description
A single step in the evolutionary Markov chain
This represents the transition kernel for MCMC-style evolution.
Implementations§
Source§impl<G, F> EvolutionStep<G, F>
impl<G, F> EvolutionStep<G, F>
Sourcepub fn new(model: EvolutionModel<G, F>, config: EvolutionChainConfig) -> Self
pub fn new(model: EvolutionModel<G, F>, config: EvolutionChainConfig) -> Self
Create a new evolution step
Sourcepub fn acceptance_probability(&self, current: &G, proposed: &G) -> f64
pub fn acceptance_probability(&self, current: &G, proposed: &G) -> f64
Compute acceptance probability (Metropolis-Hastings)
α(x, x’) = min(1, exp(f(x’) - f(x)) / T)
Auto Trait Implementations§
impl<G, F> Freeze for EvolutionStep<G, F>where
F: Freeze,
impl<G, F> RefUnwindSafe for EvolutionStep<G, F>where
F: RefUnwindSafe,
G: RefUnwindSafe,
impl<G, F> Send for EvolutionStep<G, F>
impl<G, F> Sync for EvolutionStep<G, F>
impl<G, F> Unpin for EvolutionStep<G, F>
impl<G, F> UnsafeUnpin for EvolutionStep<G, F>where
F: UnsafeUnpin,
impl<G, F> UnwindSafe for EvolutionStep<G, F>where
F: UnwindSafe,
G: UnwindSafe,
Blanket Implementations§
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
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 more§impl<T> Pointable for T
impl<T> Pointable for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§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 more§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).§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.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.