Struct Grid 

pub struct Grid {
    pub steps: usize,
}

Walk the whole space and stop.

The only scheme that runs out: ask answers None once every combination is handed out, which is how a study written as a for stops without being told a number. What is continuous is cut by steps, and an Int narrower than that is taken whole. The first dimension varies fastest, which is worth knowing when a grid is stopped early.

Fields

steps: usize

How many values to take from each continuous knob.

Implementations

impl Grid

pub fn ask( &self, space: &Space, trial: usize, _seen: &[(Point, Option<f64>)], ) -> Option<Point>

The trial-th combination, or None when there are no more.

It looks at neither the finished trials nor a seed: a grid is a function of the space and the index alone.

pub fn total(&self, space: &Space) -> usize

How many combinations there are — which is how many trials a grid search is, and something a caller wants before it starts one.

Trait Implementations

impl Clone for Grid

fn clone(&self) -> Grid

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Grid

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

Formats the value using the given formatter.

impl From<Grid> for Sampler

fn from(how: Grid) -> Self

Converts to this type from the input type.

impl Hash for Grid

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for Grid

fn eq(&self, other: &Grid) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for Grid

impl StructuralPartialEq for Grid