Struct spdkit::engine::EvolutionAlgorithm
source · pub struct EvolutionAlgorithm<G, B, S>where
G: Genome,
B: Breed<G>,
S: Survive<G>,{ /* private fields */ }
Implementations§
Trait Implementations§
source§impl<G, C, B, S, F> Evolve<G, F, C> for EvolutionAlgorithm<G, B, S>where
G: Genome,
C: EvaluateObjectiveValue<G>,
B: Breed<G>,
S: Survive<G>,
F: EvaluateFitness<G>,
impl<G, C, B, S, F> Evolve<G, F, C> for EvolutionAlgorithm<G, B, S>where G: Genome, C: EvaluateObjectiveValue<G>, B: Breed<G>, S: Survive<G>, F: EvaluateFitness<G>,
fn next_generation( &mut self, cur_population: &Population<G>, valuer: &mut Valuer<G, F, C> ) -> Population<G>
Auto Trait Implementations§
impl<G, B, S> RefUnwindSafe for EvolutionAlgorithm<G, B, S>where B: RefUnwindSafe, G: RefUnwindSafe, S: RefUnwindSafe,
impl<G, B, S> Send for EvolutionAlgorithm<G, B, S>where B: Send, S: Send,
impl<G, B, S> Sync for EvolutionAlgorithm<G, B, S>where B: Sync, G: Sync, S: Sync,
impl<G, B, S> Unpin for EvolutionAlgorithm<G, B, S>where B: Unpin, G: Unpin, S: Unpin,
impl<G, B, S> UnwindSafe for EvolutionAlgorithm<G, B, S>where B: UnwindSafe, G: UnwindSafe, S: UnwindSafe,
Blanket Implementations§
§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.