Struct Random 

pub struct Random { /* private fields */ }

Uniform random sampling within parameter bounds.

At each call, a parameter is chosen uniformly at random, then a value is sampled uniformly from its [min, max] range and quantized to the nearest step (if configured). The sample is rejected if it was already visited. Returns None after 1000 consecutive rejections (the space is considered effectively exhausted for this seed).

The internal RNG is wrapped in a Mutex so that Random implements Sync, which is required by VariationGenerator to allow ExperimentEngine to be used in an async context. The experiment loop is sequential, so the mutex is never contended.

Examples

use std::collections::HashSet;
use zeph_experiments::{ConfigSnapshot, Random, SearchSpace, VariationGenerator};

let mut generator = Random::new(SearchSpace::default(), 42);
let baseline = ConfigSnapshot::default();
let visited = HashSet::new();

// Two generators with the same seed produce the same first variation.
let mut gen2 = Random::new(SearchSpace::default(), 42);
let v1 = generator.next(&baseline, &visited);
let v2 = gen2.next(&baseline, &visited);
assert_eq!(v1, v2);

Implementations

impl Random

pub fn new(search_space: SearchSpace, seed: u64) -> Self

Create a new Random generator with a deterministic seed.

Generators with the same seed and search_space will produce identical variation sequences, making experiments reproducible.

Examples

use zeph_experiments::{Random, SearchSpace, VariationGenerator};

let generator = Random::new(SearchSpace::default(), 1234);
assert_eq!(generator.name(), "random");

Trait Implementations

impl VariationGenerator for Random

fn next( &mut self, _baseline: &ConfigSnapshot, visited: &HashSet<Variation>, ) -> Option<Variation>

Produce the next untested variation, or None if the space is exhausted.

fn name(&self) -> &'static str

Strategy name used in log messages and experiment reports.