Population

evo_rl::population

Struct Population

pub struct Population {
    pub agents: Vec<Agent>,
    pub size: usize,
    pub topology_mutation_rate: f32,
    pub mutation_rate: f32,
    pub mutation_effect_sd: f32,
    pub generation: usize,
    pub population_fitness: f32,
    /* private fields */
}

Expand description

§`Population`

Purpose: Represents a population in the evolutionary algorithm.

Fields§

§agents: Vec<Agent>§size: usize§topology_mutation_rate: f32§mutation_rate: f32§mutation_effect_sd: f32§generation: usize§population_fitness: f32

Implementations§

impl Population

pub fn new( genome_base: EneCode, population_size: usize, survival_rate: f32, mutation_rate: f32, topology_mutation_rate: f32, ) -> Self

pub fn evolve_step(&mut self, pop_config: &PopulationConfig)

§`evolve_step`

Purpose: Runs a single round of evolution and increments one generation

pub fn update_population_fitness(&mut self)

pub fn report(&self, pop_config: &PopulationConfig)

pub fn write_agent_genome( &self, idx: usize, file_path: PathBuf, ) -> FileResult<()>

Auto Trait Implementations§

impl Freeze for Population

impl RefUnwindSafe for Population

impl Send for Population

impl Sync for Population

impl Unpin for Population

impl UnwindSafe for Population

Blanket Implementations§

impl<T> Any for T
where T: 'static + ?Sized,

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

impl<T> Borrow<T> for T
where T: ?Sized,

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

impl<T> BorrowMut<T> for T
where T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

impl<T> From<T> for T

fn from(t: T) -> T

Returns the argument unchanged.

impl<T, U> Into<U> for T
where U: From<T>,

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

impl<T> Same for T

type Output = T

Should always be Self

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

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

Checks if self is actually part of its subset T (and can be converted to it).

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

The inclusion map: converts self to the equivalent element of its superset.

impl<T, U> TryFrom<U> for T
where U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

fn vzip(self) -> V

impl<T> Ungil for T
where T: Send,