Struct RecurToMutator 

pub struct RecurToMutator<M> { /* private fields */ }

Trait Implementations

impl<M> From<&Weak<M>> for RecurToMutator<M>

fn from(reference: &Weak<M>) -> Self

Converts to this type from the input type.

impl<T, M> Mutator<T> for RecurToMutator<M>

where M: Mutator<T>, T: Clone,

type Cache = <M as Mutator<T>>::Cache

type MutationStep = <M as Mutator<T>>::MutationStep

type ArbitraryStep = RecursingArbitraryStep<<M as Mutator<T>>::ArbitraryStep>

type UnmutateToken = <M as Mutator<T>>::UnmutateToken

fn cache_from_value(&self, value: &T) -> Self::Cache

Compute the cache for the given value

fn initial_step_from_value(&self, value: &T) -> Self::MutationStep

Compute the initial mutation step for the given value

fn max_complexity(&self) -> f64

The maximum complexity of an input of this type

fn min_complexity(&self) -> f64

The minimum complexity of an input of this type

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

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

fn random_arbitrary(&self, max_cplx: f64) -> (T, Self::Cache)

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

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

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