Struct GBestSearcher 

pub struct GBestSearcher<TUnit, TFit, TMover>
where
    TUnit: Unit,
    TFit: FitCalc,
    TMover: ParticleMover,
{ /* private fields */ }

Global-best PSO searcher.

Implementations

impl<TUnit, TFit, TMover> GBestSearcher<TUnit, TFit, TMover>

where TUnit: Unit, TFit: FitCalc<T = TUnit>, TMover: ParticleMover<TUnit = TUnit>,

pub fn new(fit_calc: TFit, mover: TMover) -> Self

RNG is OS-seeded; call Searcher::reseed for determinism.

Trait Implementations

impl<TUnit, TFit, TMover> Clone for GBestSearcher<TUnit, TFit, TMover>

where TUnit: Unit + Clone, TFit: FitCalc + Clone, TMover: ParticleMover + Clone,

fn clone(&self) -> GBestSearcher<TUnit, TFit, TMover>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<TUnit, TFit, TMover, TContext> Contextful for GBestSearcher<TUnit, TFit, TMover>

where TFit: FitCalc<T = TUnit, TContext = TContext>, TMover: ParticleMover<TUnit = TUnit, TCommon = Best<TUnit>, TContext = TContext>, TUnit: Unit, TContext: Copy,

type TContext = TContext

Reparameterization payload.

fn set_context(&mut self, context: Self::TContext)

Replace the current context. Defaults to a no-op; override when the impl actually reads TContext.

fn set_iteration(&mut self, iteration: usize, max_iteration: usize)

iteration is 1-based; the init (fitness-only) pass runs before any call. Override for iteration-dependent schedules.

impl<TUnit, TFit, TMover> Debug for GBestSearcher<TUnit, TFit, TMover>

where TUnit: Unit + Debug, TFit: FitCalc + Debug, TMover: ParticleMover + Debug,

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

Formats the value using the given formatter.

impl<TUnit, TFit, TMover, TContext> Searcher for GBestSearcher<TUnit, TFit, TMover>

where TFit: FitCalc<T = TUnit, TContext = TContext>, TMover: ParticleMover<TUnit = TUnit, TCommon = Best<TUnit>, TContext = TContext>, TUnit: Unit, TContext: Copy,

type TUnit = TUnit

The particle unit this searcher iterates over.

fn init(&mut self, particles: &mut Group<Self::TUnit>)

Initial fitness pass + per-particle state seed.

fn next(&mut self, particles: &mut Group<Self::TUnit>) -> &Best<TUnit>

Advance the swarm one step; return the swarm-wide best so far.

fn reseed<R: Rng>(&mut self, rng: &mut R)

Reseed the searcher’s RNG.

fn nested<TInit>( self, max_iteration: usize, particle_init: TInit, ) -> NestedMover<<Self::TUnit as SetTo>::TTarget, Self::TUnit, Self, TInit>

where Self: Sized, Self::TUnit: SetTo, TInit: ParticleInitDependent<TIn = <Self::TUnit as SetTo>::TTarget, TOut = Self::TUnit>,

Wrap this searcher in a NestedMover.

fn iter<'a>( &'a mut self, max_iteration: usize, group: &'a mut Group<Self::TUnit>, evolution: Option<&'a mut Evolution<Self::TUnit>>, ) -> SearcherIter<'a, Self::TUnit, Self>

where Self: Sized,

Drive the searcher as an Iterator<Item = Best<TUnit>> for max_iteration steps; optionally record each step’s Group snapshot into evolution.