pub struct GaRunner<P: GaProblem> { /* private fields */ }Expand description
Genetic algorithm runner.
Implementations§
Source§impl<P: GaProblem> GaRunner<P>
impl<P: GaProblem> GaRunner<P>
Sourcepub fn cancel_handle(&self) -> Arc<AtomicBool>
pub fn cancel_handle(&self) -> Arc<AtomicBool>
Returns a handle to cancel the algorithm.
Sourcepub fn run(&self) -> GaResult<P::Individual>
pub fn run(&self) -> GaResult<P::Individual>
Runs the genetic algorithm.
Sourcepub fn run_with_progress<F>(
&self,
progress_callback: F,
) -> GaResult<P::Individual>
pub fn run_with_progress<F>( &self, progress_callback: F, ) -> GaResult<P::Individual>
Runs the genetic algorithm with a progress callback.
Sourcepub fn run_with_rng<R: Rng>(&self, rng: &mut R) -> GaResult<P::Individual>
pub fn run_with_rng<R: Rng>(&self, rng: &mut R) -> GaResult<P::Individual>
Runs the genetic algorithm with a specific RNG.
Sourcepub fn run_with_rng_and_progress<R: Rng, F>(
&self,
rng: &mut R,
progress_callback: Option<F>,
) -> GaResult<P::Individual>
pub fn run_with_rng_and_progress<R: Rng, F>( &self, rng: &mut R, progress_callback: Option<F>, ) -> GaResult<P::Individual>
Runs the genetic algorithm with a specific RNG and optional progress callback.
Auto Trait Implementations§
impl<P> Freeze for GaRunner<P>where
P: Freeze,
impl<P> RefUnwindSafe for GaRunner<P>where
P: RefUnwindSafe,
impl<P> Send for GaRunner<P>
impl<P> Sync for GaRunner<P>
impl<P> Unpin for GaRunner<P>where
P: Unpin,
impl<P> UnwindSafe for GaRunner<P>where
P: UnwindSafe,
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
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
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 moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
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 moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§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 moreSource§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).Source§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.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.