Struct PathInit 

pub struct PathInit<'a, const N: usize, SB, WS, TFit>
where
    SB: Sailboat,
    WS: WindSource,
    TFit: FitCalc<T = Path<N>> + SailboatFitData,
{ /* private fields */ }

Implementations

impl<'a, const N: usize, SB, WS, TFit> PathInit<'a, N, SB, WS, TFit>

where SB: Sailboat, WS: WindSource, TFit: FitCalc<T = Path<N>> + SailboatFitData,

pub fn new( bounds: &'a RouteBounds, boat: &'a SB, wind_source: &'a WS, fit_calc: &'a TFit, particle_count: usize, init_shares: InitShares, baseline_shares: BaselineShares, ) -> Self

pub fn init_with_partition<R: Rng>( &self, rng: &mut R, ) -> (Group<Path<N>>, Vec<Range<usize>>)

Same as ParticleInit::init plus a per-baseline partition for the niched topology — one Range per cohort in the order the internal baseline-computation routine emits, empty cohorts absent. RNG draws match init so the same seed produces the identical layout.

Trait Implementations

impl<const N: usize, SB, WS, TFit> ParticleInit for PathInit<'_, N, SB, WS, TFit>

where SB: Sailboat, WS: WindSource, TFit: FitCalc<T = Path<N>> + SailboatFitData,

type T = Path<N>

The particle unit.

fn init_pos<R: Rng>(&self, rng: &mut R) -> Vec<Self::T>

One initial position per particle.

fn init_vel<R: Rng>(&self, rng: &mut R) -> Vec<Self::T>

One initial velocity per particle.

fn init<R>(&self, rng: &mut R) -> Group<Self::T>

where R: Rng,

Zip init_pos and init_vel into a Group with f64::MIN fitness; the searcher’s first fitness pass overwrites it.