pub struct GeneticAlgorithm { /* private fields */ }Expand description
A generational genetic algorithm.
Implementations§
Source§impl GeneticAlgorithm
impl GeneticAlgorithm
Sourcepub fn new(
space: SearchSpace,
settings: GeneticSettings,
objective: Objective,
max_evaluations: u64,
seed: u64,
) -> Result<Self, SearchSpecError>
pub fn new( space: SearchSpace, settings: GeneticSettings, objective: Objective, max_evaluations: u64, seed: u64, ) -> Result<Self, SearchSpecError>
Returns a genetic algorithm of max_evaluations evaluations over space, drawing from seed.
Note that generation 0 is smaller than the population when the space has fewer configs.
§Errors
Returns SearchSpecError when GeneticSettings::check rejects settings.
Trait Implementations§
Source§impl Clone for GeneticAlgorithm
impl Clone for GeneticAlgorithm
Source§impl Debug for GeneticAlgorithm
impl Debug for GeneticAlgorithm
Source§impl Searcher for GeneticAlgorithm
impl Searcher for GeneticAlgorithm
Source§fn ask(&mut self, max: usize) -> Vec<Candidate>
fn ask(&mut self, max: usize) -> Vec<Candidate>
Returns up to
max candidates to evaluate next. Read moreSource§fn tell(&mut self, evaluations: &[Evaluation])
fn tell(&mut self, evaluations: &[Evaluation])
Accepts the evaluations of the candidates that the last ask returned, sorted by candidate id. Read more
Source§fn is_done(&self) -> bool
fn is_done(&self) -> bool
Returns whether the search has issued its whole budget and been told every evaluation.
Source§fn report(&self) -> SearchReport
fn report(&self) -> SearchReport
Returns every candidate scored so far, best first, with the finished generations and the archive. Read more
Source§fn best(&self) -> Option<RankingEntry>
fn best(&self) -> Option<RankingEntry>
Returns the best candidate so far, or
None before any evaluation or for a Pattern Space Exploration.Source§fn ranking_entry(&self, candidate_id: u64) -> Option<RankingEntry>
fn ranking_entry(&self, candidate_id: u64) -> Option<RankingEntry>
Returns candidate
candidate_id with its objective over every replicate it has, or None for a candidate
never told or a Pattern Space Exploration.Source§fn generations(&self) -> &[GenerationSummary]
fn generations(&self) -> &[GenerationSummary]
Finished generations of a genetic algorithm, in order, empty for any other search.
Source§fn archive_entry(&self, _cell: PatternCell) -> Option<ArchiveEntry>
fn archive_entry(&self, _cell: PatternCell) -> Option<ArchiveEntry>
Returns the archive entry of
cell, or None for an empty cell or a search other than a Pattern Space
Exploration.Source§fn filled_cells(&self) -> u64
fn filled_cells(&self) -> u64
Number of filled cells in the archive of a Pattern Space Exploration, 0 for any other search.
Source§fn pattern_settings(&self) -> Option<&PatternSpaceSettings>
fn pattern_settings(&self) -> Option<&PatternSpaceSettings>
Returns the settings that a Pattern Space Exploration uses to place outputs, each axis with its range, or
None while an automatic range waits for the initial samples or for any other search.Auto Trait Implementations§
impl Freeze for GeneticAlgorithm
impl RefUnwindSafe for GeneticAlgorithm
impl Send for GeneticAlgorithm
impl Sync for GeneticAlgorithm
impl Unpin for GeneticAlgorithm
impl UnsafeUnpin for GeneticAlgorithm
impl UnwindSafe for GeneticAlgorithm
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