AlgorithmSpecificState

scirs2_optimize::gpu::acceleration

Enum AlgorithmSpecificState 

Source 
pub enum AlgorithmSpecificState {
    ParticleSwarm {
        inertia_weights: Array1<f64>,
        acceleration_coefficients: Array2<f64>,
        neighborhood_topology: Array2<bool>,
    },
    AntColony {
        pheromone_matrix: Array2<f64>,
        pheromone_update_matrix: Array2<f64>,
        evaporation_rate: f64,
        pheromone_deposit: f64,
    },
    ArtificialBee {
        employed_bees: Array1<bool>,
        onlooker_bees: Array1<bool>,
        scout_bees: Array1<bool>,
        trial_counters: Array1<usize>,
        nectar_amounts: Array1<f64>,
    },
    Firefly {
        brightness_matrix: Array2<f64>,
        attraction_matrix: Array2<f64>,
        randomization_factors: Array1<f64>,
        light_absorption: f64,
    },
    CuckooSearch {
        levy_flights: Array2<f64>,
        discovery_probability: f64,
        step_sizes: Array1<f64>,
    },
    BacterialForaging {
        chemotactic_steps: Array1<usize>,
        health_status: Array1<f64>,
        reproduction_pool: Array1<bool>,
        elimination_pool: Array1<bool>,
    },
    GreyWolf {
        alpha_wolf: Array1<f64>,
        beta_wolf: Array1<f64>,
        delta_wolf: Array1<f64>,
        pack_hierarchy: Array1<usize>,
    },
    WhaleOptimization {
        spiral_constants: Array1<f64>,
        encircling_coefficients: Array2<f64>,
        bubble_net_feeding: Array1<bool>,
    },
}
Expand description

Algorithm-specific state storage

Variants§

§

ParticleSwarm

Fields

§inertia_weights: Array1<f64>
§acceleration_coefficients: Array2<f64>
§neighborhood_topology: Array2<bool>
§

AntColony

Fields

§pheromone_matrix: Array2<f64>
§pheromone_update_matrix: Array2<f64>
§evaporation_rate: f64
§pheromone_deposit: f64
§

ArtificialBee

Fields

§employed_bees: Array1<bool>
§onlooker_bees: Array1<bool>
§scout_bees: Array1<bool>
§trial_counters: Array1<usize>
§nectar_amounts: Array1<f64>
§

Firefly

Fields

§brightness_matrix: Array2<f64>
§attraction_matrix: Array2<f64>
§randomization_factors: Array1<f64>
§light_absorption: f64
§

CuckooSearch

Fields

§levy_flights: Array2<f64>
§discovery_probability: f64
§step_sizes: Array1<f64>
§

BacterialForaging

Fields

§chemotactic_steps: Array1<usize>
§health_status: Array1<f64>
§reproduction_pool: Array1<bool>
§elimination_pool: Array1<bool>
§

GreyWolf

Fields

§alpha_wolf: Array1<f64>
§beta_wolf: Array1<f64>
§delta_wolf: Array1<f64>
§pack_hierarchy: Array1<usize>
§

WhaleOptimization

Fields

§spiral_constants: Array1<f64>
§encircling_coefficients: Array2<f64>
§bubble_net_feeding: Array1<bool>

Trait Implementations§

Source§

impl Clone for AlgorithmSpecificState

Source§

fn clone(&self) -> AlgorithmSpecificState

Returns a duplicate of the value. Read more
1.0.0 · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Debug for AlgorithmSpecificState

Source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

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> 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> 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
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> Same for T

Source§

type Output = T

Should always be Self
Source§

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

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

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

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

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

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

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

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

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
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<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V