Skip to main content

GepConfig

Struct GepConfig 

Source
pub struct GepConfig {
    pub head_len: usize,
    pub tail_len: usize,
    pub pop_size: usize,
    pub n_vars: usize,
    pub mutation_rate: Probability,
    pub is_transpose_rate: Probability,
    pub ris_transpose_rate: Probability,
    pub crossover_1p_rate: Probability,
    pub crossover_2p_rate: Probability,
}
Expand description

Static parameters for a GepStrategy run.

GEP chromosomes are fixed-length: a head of head_len loci (which may hold any symbol) followed by a tail of tail_len loci (terminals only). The tail length is not a free parameter — it is derived from the head length and the function set’s maximum arity so that every chromosome decodes to a complete expression tree without repair (see GepConfig::new).

Unlike the const-generic experiments considered during design, the genome dimensions are ordinary runtime fields (matching the shipped CgpConfig precedent); no generic_const_exprs is required.

Fields§

§head_len: usize

Head length: number of leading loci that may hold any symbol.

§tail_len: usize

Tail length: number of trailing loci that may hold terminals only.

Derived in GepConfig::new as head_len * (max_arity - 1) + 1.

§pop_size: usize

Number of individuals in the population.

§n_vars: usize

Number of input variables the program sees.

§mutation_rate: Probability

Per-gene point-mutation probability. Valid by construction ([0, 1]).

§is_transpose_rate: Probability

Per-individual probability of applying one IS transposition. Valid by construction ([0, 1]).

§ris_transpose_rate: Probability

Per-individual probability of applying one RIS transposition. Valid by construction ([0, 1]).

§crossover_1p_rate: Probability

Per-pair probability of one-point crossover. Valid by construction ([0, 1]).

§crossover_2p_rate: Probability

Per-pair probability of two-point crossover. Valid by construction ([0, 1]).

Implementations§

Source§

impl GepConfig

Source

pub fn new( head_len: usize, max_arity: usize, n_vars: usize, pop_size: usize, ) -> Result<Self, ConfigError>

Builds a config, deriving and validating the tail length.

The tail length is set to head_len * (max_arity - 1) + 1, the minimum that guarantees any head/tail-respecting chromosome decodes to a complete tree. max_arity is the function set’s largest arity (FunctionSet::max_arity).

Operator rates default to canonical Ferreira (2001) values; assign a validated Probability to the public fields afterwards to override. The point-mutation rate defaults to 2 / genome_len (≈ two genes per chromosome). Because the rates are Probability, a NaN/Inf/ out-of-[0, 1] rate is unrepresentable — the silent operator degeneracy of a bare f32 rate cannot occur.

§Errors

Returns a ConfigError if max_arity, head_len, n_vars, or pop_size is zero — each would make the genome layout or the tree decode degenerate. max_arity is checked here (it is consumed to derive tail_len rather than stored); the remaining field invariants are checked via Validate.

Source

pub fn genome_len(&self) -> usize

Total chromosome length (head_len + tail_len).

Trait Implementations§

Source§

impl Clone for GepConfig

Source§

fn clone(&self) -> GepConfig

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl Debug for GepConfig

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more
Source§

impl Validate for GepConfig

Source§

fn validate(&self) -> Result<(), ConfigError>

Returns Ok(()) when every invariant holds, or the first ConfigError otherwise. Read more
Source§

fn validate_all(&self) -> Result<(), Vec<ConfigError>>

Returns every violated invariant rather than just the first. Read more

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Adaptor<()> for T

Source§

fn adapt(&self)

Adapt the type to be passed to a metric.
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<C> CloneExpand for C
where C: Clone,

Source§

fn __expand_clone_method(&self, _scope: &mut Scope) -> C

Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> Downcast<T> for T

Source§

fn downcast(&self) -> &T

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T> Instrument for T

Source§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
Source§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
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> IntoComptime for T

Source§

fn comptime(self) -> Self

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

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

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

Initializes a with the given initializer. Read more
Source§

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

Dereferences the given pointer. Read more
Source§

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

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

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

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
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.
Source§

impl<T> TuneInputs for T
where T: Clone + Send + Sync + 'static,

Source§

type At<'a> = T

The concrete input type at lifetime 'a.
Source§

impl<T> Upcast<T> for T

Source§

fn upcast(&self) -> Option<&T>

Source§

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

Source§

impl<T> WasmNotSendSync for T

Source§

impl<T> WasmNotSync for T
where T: Sync,

Source§

impl<T> WithSubscriber for T

Source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
Source§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more