Struct snowcap::optimizers::NaiveRandomOptimizer

pub struct NaiveRandomOptimizer<P> { /* fields omitted */ }

The Naive Random Optimizer

This strategy exists only for evaluation purpose. The idea is, that it tries completely random orderings, until it succeeds.

Trait Implementations

impl<P> Optimizer<P> for NaiveRandomOptimizer<P> where
    P: SoftPolicy + Clone, 

fn new(
    net: Network,
    modifiers: Vec<ConfigModifier>,
    hard_policy: HardPolicy,
    soft_policy: P,
    time_budget: Option<Duration>
) -> Result<Box<Self>, Error>

Create the strategy

fn work(&mut self, abort: Stopper) -> Result<(Vec<ConfigModifier>, f64), Error>

Main function to find a valid reconfiguration sequence (if it exists) and return it. The function also returns the cost of the sequence.

fn num_states(&self) -> usize

Returns the number of states explored by the strategy.

fn synthesize(
    net: Network,
    end_config: Config,
    hard_policy: HardPolicy,
    soft_policy: P,
    time_budget: Option<Duration>,
    abort: Stopper
) -> Result<(Vec<ConfigModifier>, f64), Error>

Wrapper, that creates the optimizer and synthesizes the network update order.