Skip to main content

SteadyStateGA

fugue_evo::algorithms::steady_state

Struct SteadyStateGA 

Source 
pub struct SteadyStateGA<G, F, S, C, M, Fit, Term>
where
    G: EvolutionaryGenome,
    F: FitnessValue,
{ /* private fields */ }
Expand description

Steady-State Genetic Algorithm

A GA variant that replaces only a few individuals per generation step, maintaining a more continuous population transition.

Implementations§

Source§

impl<G, F, S, C, M, Fit, Term> SteadyStateGA<G, F, S, C, M, Fit, Term>
where G: EvolutionaryGenome + Send + Sync, F: FitnessValue + Send, S: SelectionOperator<G>, C: CrossoverOperator<G>, M: MutationOperator<G>, Fit: Fitness<Genome = G, Value = F> + Sync, Term: TerminationCriterion<G, F>,

Source

pub fn builder() -> SteadyStateBuilder<G, F, (), (), (), (), ()>

Create a builder for SteadyStateGA

Source

pub fn run<R: Rng>( &self, rng: &mut R, ) -> Result<EvolutionResult<G, F>, EvolutionError>

Run the steady-state genetic algorithm

Source§

impl<G, F, S, C, M, Fit, Term> SteadyStateGA<G, F, S, C, M, Fit, Term>
where G: EvolutionaryGenome + Send + Sync, F: FitnessValue + Send, S: SelectionOperator<G>, C: BoundedCrossoverOperator<G>, M: BoundedMutationOperator<G>, Fit: Fitness<Genome = G, Value = F> + Sync, Term: TerminationCriterion<G, F>,

Source

pub fn run_bounded<R: Rng>( &self, rng: &mut R, ) -> Result<EvolutionResult<G, F>, EvolutionError>

Run the steady-state genetic algorithm with bounded operators

Auto Trait Implementations§

§

impl<G, F, S, C, M, Fit, Term> Freeze for SteadyStateGA<G, F, S, C, M, Fit, Term>
where S: Freeze, C: Freeze, M: Freeze, Fit: Freeze, Term: Freeze,

§

impl<G, F, S, C, M, Fit, Term> RefUnwindSafe for SteadyStateGA<G, F, S, C, M, Fit, Term>
where S: RefUnwindSafe, C: RefUnwindSafe, M: RefUnwindSafe, Fit: RefUnwindSafe, Term: RefUnwindSafe, G: RefUnwindSafe, F: RefUnwindSafe,

§

impl<G, F, S, C, M, Fit, Term> Send for SteadyStateGA<G, F, S, C, M, Fit, Term>
where S: Send, C: Send, M: Send, Fit: Send, Term: Send,

§

impl<G, F, S, C, M, Fit, Term> Sync for SteadyStateGA<G, F, S, C, M, Fit, Term>
where S: Sync, C: Sync, M: Sync, Fit: Sync, Term: Sync,

§

impl<G, F, S, C, M, Fit, Term> Unpin for SteadyStateGA<G, F, S, C, M, Fit, Term>
where S: Unpin, C: Unpin, M: Unpin, Fit: Unpin, Term: Unpin, G: Unpin, F: Unpin,

§

impl<G, F, S, C, M, Fit, Term> UnsafeUnpin for SteadyStateGA<G, F, S, C, M, Fit, Term>
where S: UnsafeUnpin, C: UnsafeUnpin, M: UnsafeUnpin, Fit: UnsafeUnpin, Term: UnsafeUnpin,

§

impl<G, F, S, C, M, Fit, Term> UnwindSafe for SteadyStateGA<G, F, S, C, M, Fit, Term>
where S: UnwindSafe, C: UnwindSafe, M: UnwindSafe, Fit: UnwindSafe, Term: UnwindSafe, G: UnwindSafe, F: UnwindSafe,

Blanket Implementations§

Source§

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

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

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

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

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

Source§

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

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

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

Source§

fn into(self) -> U

Calls U::from(self).

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

Source§

impl<T> IntoEither for T

Source§

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 more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

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

§

const ALIGN: usize

The alignment of pointer.
§

type Init = T

The type for initializers.
§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Same for T

Source§

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.
Source§

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

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

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

Performs the conversion.
Source§

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

Source§

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

The type returned in the event of a conversion error.
Source§

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