Struct GridSampler 

pub struct GridSampler { /* private fields */ }

Exhaustive grid search over all combinations.

Uses lazy index-based generation: instead of building the full cartesian product in memory, it computes the parameter set for a given trial index on the fly. Safe for large search spaces.

Implementations

impl GridSampler

pub fn new(points_per_dim: usize) -> Self

A grid with points_per_dim values per continuous dimension (categorical dimensions contribute every choice).

Trait Implementations

impl Sampler for GridSampler

fn prepare(&mut self, space: &SearchSpace)

Called once before the trial loop with the resolved search space. Lets samplers precompute state — e.g. GridSampler resolves its dimension grid here so n_trials is correct before the first sample.

fn sample( &mut self, space: &SearchSpace, trial_index: usize, ) -> Result<Option<HashMap<String, Value>>>

Sample the next set of parameters. Returns None when exhausted.

fn n_trials(&self) -> Option<usize>

Total number of trials this sampler will produce (if known).

fn record_result(&mut self, _params: &HashMap<String, Value>, _value: f64)

Feedback for a completed trial. value is normalized so that higher is always better (the runner negates for Minimize). Default: no-op (stateless samplers ignore feedback).