Struct spdkit::population::Population
source · pub struct Population<G>where
G: Genome,{ /* private fields */ }
Expand description
A population is a collection of evaluated individuals (fitness).
Implementations§
source§impl<G> Population<G>where
G: Genome,
impl<G> Population<G>where G: Genome,
sourcepub fn individuals(&self) -> &[Individual<G>]
pub fn individuals(&self) -> &[Individual<G>]
Return a list of individuals in this population.
sourcepub fn is_oversized(&self) -> bool
pub fn is_oversized(&self) -> bool
Return true of there are too many individuals in this population.
sourcepub fn size_limit(&self) -> usize
pub fn size_limit(&self) -> usize
Return population size limit.
sourcepub fn evaluate_with<F: EvaluateFitness<G>>(&mut self, fitness: &mut F)
pub fn evaluate_with<F: EvaluateFitness<G>>(&mut self, fitness: &mut F)
Re-evaluate individuals in population with fitness
function.
sourcepub fn weight_with(&mut self, weight: f64)
pub fn weight_with(&mut self, weight: f64)
Re-evaluate individual fitness with individual weight.
sourcepub fn build<F>(indvs: Vec<Individual<G>>, fitness: &mut F) -> Selfwhere
F: EvaluateFitness<G>,
pub fn build<F>(indvs: Vec<Individual<G>>, fitness: &mut F) -> Selfwhere F: EvaluateFitness<G>,
Build a population from individuals indvs
and fitness function.
The population size limit is set as the size of indvs
.
sourcepub fn with_size_limit(self, limit: usize) -> Self
pub fn with_size_limit(self, limit: usize) -> Self
Construct with population size limit.
source§impl<G> Population<G>where
G: Genome,
impl<G> Population<G>where G: Genome,
Trait Implementations§
Auto Trait Implementations§
impl<G> RefUnwindSafe for Population<G>where G: RefUnwindSafe,
impl<G> Send for Population<G>
impl<G> Sync for Population<G>where G: Sync,
impl<G> Unpin for Population<G>where G: Unpin,
impl<G> UnwindSafe for Population<G>where G: 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.