Struct ResultMutator

pub struct ResultMutator<T, E, M0_0, M1_0>
where
    T: Clone + 'static,
    E: Clone + 'static,
    M0_0: Mutator<T>,
    M1_0: Mutator<E>,
{ /* private fields */ }

A mutator for Result

Generated by a procedural macro of fuzzcheck

Implementations

impl<T, E, M0_0, M1_0> ResultMutator<T, E, M0_0, M1_0>

where T: Clone + 'static, E: Clone + 'static, M0_0: Mutator<T>, M1_0: Mutator<E>,

pub fn new(mutator_Ok_0: M0_0, mutator_Err_0: M1_0) -> Self

Trait Implementations

impl<T, E, M0_0, M1_0> Mutator<Result<T, E>> for ResultMutator<T, E, M0_0, M1_0>

where T: Clone + 'static, E: Clone + 'static, M0_0: Mutator<T>, M1_0: Mutator<E>,

type Cache: Clone

Accompanies each value to help compute its complexity and mutate it efficiently.

type MutationStep: Clone

Contains information about what mutations have already been tried.

type ArbitraryStep: Clone

Contains information about what arbitrary values have already been generated.

type UnmutateToken

Describes how to reverse a mutation

fn initialize(&self)

Must be called after creating a mutator, to initialise its internal state.

fn default_arbitrary_step(&self) -> Self::ArbitraryStep

The first ArbitraryStep value to be passed to ordered_arbitrary

fn is_valid(&self, value: &Value) -> bool

Quickly verifies that the value conforms to the mutator’s expectations

fn validate_value(&self, value: &Value) -> Option<Self::Cache>

Verifies that the value conforms to the mutator’s expectations and, if it does, returns the Cache associated with that value.

fn default_mutation_step( &self, value: &Value, cache: &Self::Cache, ) -> Self::MutationStep

Returns the first MutationStep associated with the value and cache.

fn global_search_space_complexity(&self) -> f64

The log2 of the number of values that can be produced by this mutator, or an approximation of this number (e.g. the number of bits that are needed to identify each possible value).

fn max_complexity(&self) -> f64

The maximum complexity that a value can possibly have.

fn min_complexity(&self) -> f64

The minimum complexity that a value can possibly have.

fn complexity(&self, value: &Value, cache: &Self::Cache) -> f64

Computes the complexity of the value.

fn ordered_arbitrary( &self, step: &mut Self::ArbitraryStep, max_cplx: f64, ) -> Option<(Value, f64)>

Generates an entirely new value based on the given ArbitraryStep.

fn random_arbitrary(&self, max_cplx: f64) -> (Value, f64)

Generates an entirely new value.

fn ordered_mutate( &self, value: &mut Value, cache: &mut Self::Cache, step: &mut Self::MutationStep, subvalue_provider: &dyn SubValueProvider, max_cplx: f64, ) -> Option<(Self::UnmutateToken, f64)>

Mutates a value (and optionally its cache) based on the given MutationStep.

fn random_mutate( &self, value: &mut Value, cache: &mut Self::Cache, max_cplx: f64, ) -> (Self::UnmutateToken, f64)

Mutates a value (and optionally its cache).

fn unmutate( &self, value: &mut Value, cache: &mut Self::Cache, t: Self::UnmutateToken, )

Undoes a mutation performed on the given value and cache, described by the given UnmutateToken.

fn visit_subvalues<'a>( &self, value: &'a Value, cache: &'a Self::Cache, visit: &mut dyn FnMut(&'a dyn Any, f64), )

Call the given closure on all subvalues and their complexities.