1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129
use std::marker::PhantomData; use crate::Mutator; pub struct MapMutator<From, To, M, Parse, Map> where From: Clone, To: Clone, M: Mutator<From>, Parse: Fn(&To) -> Option<From>, Map: Fn(&From) -> To, { pub mutator: M, pub parse: Parse, pub map: Map, _phantom: PhantomData<(From, To)>, } impl<From, To, M, Parse, Map> MapMutator<From, To, M, Parse, Map> where From: Clone, To: Clone, M: Mutator<From>, Parse: Fn(&To) -> Option<From>, Map: Fn(&From) -> To, { #[no_coverage] pub fn new(mutator: M, parse: Parse, map: Map) -> Self { Self { mutator, parse, map, _phantom: PhantomData, } } } pub struct Cache<From, M> where From: Clone, M: Mutator<From>, { from_value: From, from_cache: M::Cache, } impl<From, To, M, Parse, Map> Mutator<To> for MapMutator<From, To, M, Parse, Map> where From: Clone, To: Clone, M: Mutator<From>, Parse: Fn(&To) -> Option<From>, Map: Fn(&From) -> To, { type Cache = Cache<From, M>; type MutationStep = M::MutationStep; type ArbitraryStep = M::ArbitraryStep; type UnmutateToken = M::UnmutateToken; #[no_coverage] fn default_arbitrary_step(&self) -> Self::ArbitraryStep { self.mutator.default_arbitrary_step() } #[no_coverage] fn validate_value(&self, to_value: &To) -> Option<(Self::Cache, Self::MutationStep)> { let from_value = (self.parse)(to_value)?; let (from_cache, step) = self.mutator.validate_value(&from_value)?; Some((Cache { from_value, from_cache }, step)) } #[no_coverage] fn max_complexity(&self) -> f64 { self.mutator.max_complexity() } #[no_coverage] fn min_complexity(&self) -> f64 { self.mutator.min_complexity() } #[no_coverage] fn complexity(&self, _value: &To, cache: &Self::Cache) -> f64 { self.mutator.complexity(&cache.from_value, &cache.from_cache) } #[no_coverage] fn ordered_arbitrary(&self, step: &mut Self::ArbitraryStep, max_cplx: f64) -> Option<(To, f64)> { let (from_value, cplx) = self.mutator.ordered_arbitrary(step, max_cplx)?; let to_value = (self.map)(&from_value); Some((to_value, cplx)) } #[no_coverage] fn random_arbitrary(&self, max_cplx: f64) -> (To, f64) { let (from_value, cplx) = self.mutator.random_arbitrary(max_cplx); let to_value = (self.map)(&from_value); (to_value, cplx) } #[no_coverage] fn ordered_mutate( &self, value: &mut To, cache: &mut Self::Cache, step: &mut Self::MutationStep, max_cplx: f64, ) -> Option<(Self::UnmutateToken, f64)> { let (token, cplx) = self.mutator .ordered_mutate(&mut cache.from_value, &mut cache.from_cache, step, max_cplx)?; *value = (self.map)(&cache.from_value); Some((token, cplx)) } #[no_coverage] fn random_mutate(&self, value: &mut To, cache: &mut Self::Cache, max_cplx: f64) -> (Self::UnmutateToken, f64) { let (token, cplx) = self .mutator .random_mutate(&mut cache.from_value, &mut cache.from_cache, max_cplx); *value = (self.map)(&cache.from_value); (token, cplx) } #[no_coverage] fn unmutate(&self, value: &mut To, cache: &mut Self::Cache, t: Self::UnmutateToken) { self.mutator.unmutate(&mut cache.from_value, &mut cache.from_cache, t); *value = (self.map)(&cache.from_value); } }