pub struct SelfModifyingLoop { /* private fields */ }Expand description
Self-modifying loop that evolves its own code and parameters
Implementations§
Source§impl SelfModifyingLoop
impl SelfModifyingLoop
pub fn new(mutation_rate: f64) -> Self
Sourcepub fn get_metrics(&self) -> EvolutionMetrics
pub fn get_metrics(&self) -> EvolutionMetrics
Get evolutionary metrics
Auto Trait Implementations§
impl Freeze for SelfModifyingLoop
impl RefUnwindSafe for SelfModifyingLoop
impl Send for SelfModifyingLoop
impl Sync for SelfModifyingLoop
impl Unpin for SelfModifyingLoop
impl UnwindSafe for SelfModifyingLoop
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> 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.