pub struct ContinuousUMDA<F, Fit, Term>where
F: FitnessValue,{ /* private fields */ }Expand description
UMDA for continuous optimization
Implementations§
Source§impl<F, Fit, Term> ContinuousUMDA<F, Fit, Term>where
F: FitnessValue + Send,
Fit: Fitness<Genome = RealVector, Value = F> + Sync,
Term: TerminationCriterion<RealVector, F>,
impl<F, Fit, Term> ContinuousUMDA<F, Fit, Term>where
F: FitnessValue + Send,
Fit: Fitness<Genome = RealVector, Value = F> + Sync,
Term: TerminationCriterion<RealVector, F>,
Sourcepub fn builder() -> UMDABuilder<RealVector, F, (), ()>
pub fn builder() -> UMDABuilder<RealVector, F, (), ()>
Create a builder for continuous UMDA
Sourcepub fn run<R: Rng>(
&self,
rng: &mut R,
) -> Result<EvolutionResult<RealVector, F>, EvolutionError>
pub fn run<R: Rng>( &self, rng: &mut R, ) -> Result<EvolutionResult<RealVector, F>, EvolutionError>
Run the UMDA algorithm
Auto Trait Implementations§
impl<F, Fit, Term> Freeze for ContinuousUMDA<F, Fit, Term>
impl<F, Fit, Term> RefUnwindSafe for ContinuousUMDA<F, Fit, Term>
impl<F, Fit, Term> Send for ContinuousUMDA<F, Fit, Term>
impl<F, Fit, Term> Sync for ContinuousUMDA<F, Fit, Term>
impl<F, Fit, Term> Unpin for ContinuousUMDA<F, Fit, Term>
impl<F, Fit, Term> UnsafeUnpin for ContinuousUMDA<F, Fit, Term>where
Fit: UnsafeUnpin,
Term: UnsafeUnpin,
impl<F, Fit, Term> UnwindSafe for ContinuousUMDA<F, Fit, Term>
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.