Trait proptest::strategy::ValueTree [−][src]
A generated value and its associated shrinker.
Conceptually, a ValueTree
represents a spectrum between a "minimally
complex" value and a starting, randomly-chosen value. For values such as
numbers, this can be thought of as a simple binary search, and this is how
the ValueTree
state machine is defined.
The ValueTree
state machine notionally has three fields: low, current,
and high. Initially, low is the "minimally complex" value for the type, and
high and current are both the initially chosen value. It can be queried for
its current state. When shrinking, the controlling code tries simplifying
the value one step. If the test failure still happens with the simplified
value, further simplification occurs. Otherwise, the code steps back up
towards the prior complexity.
The main invariants here are that the "high" value always corresponds to a
failing test case, and that repeated calls to complicate()
will return
false
only once the "current" value has returned to what it was before
the last call to simplify()
.
While it would be possible for default do-nothing implementations of
simplify()
and complicate()
to be provided, this was not done
deliberately since the majority of strategies will want to define their own
shrinking anyway, and the minority that do not must call it out explicitly
by their own implementation.
Associated Types
Loading content...Required methods
fn current(&self) -> Self::Value
[src]
Returns the current value.
fn simplify(&mut self) -> bool
[src]
Attempts to simplify the current value. Notionally, this sets the "high" value to the current value, and the current value to a "halfway point" between high and low, rounding towards low.
Returns whether any state changed as a result of this call. This does
not necessarily imply that the value of current()
has changed, since
in the most general case, it is not possible for an implementation to
determine this.
This call needs to correctly handle being called even immediately after
it had been called previously and returned false
.
fn complicate(&mut self) -> bool
[src]
Attempts to partially undo the last simplification. Notionally, this sets the "low" value to one plus the current value, and the current value to a "halfway point" between high and the new low, rounding towards low.
Returns whether any state changed as a result of this call. This does
not necessarily imply that the value of current()
has changed, since
in the most general case, it is not possible for an implementation to
determine this.
It is usually expected that, immediately after a call to simplify()
which returns true, this call will itself return true. However, this is
not always the case; in some strategies, particularly those that use
some form of rejection sampling, the act of trying to simplify may
change the state such that simplify()
returns true, yet ultimately
left the resulting value unchanged, in which case there is nothing left
to complicate.
This call does not need to gracefully handle being called before
simplify()
was ever called, but does need to correctly handle being
called even immediately after it had been called previously and
returned false
.
Implementations on Foreign Types
impl<T: Debug> ValueTree for fn() -> T
[src]
type Value = T
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
fn current(&self) -> Self::Value
[src]
impl<T: ValueTree + ?Sized> ValueTree for Box<T>
[src]
type Value = T::Value
fn current(&self) -> Self::Value
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
Implementors
impl ValueTree for BoolValueTree
[src]
type Value = bool
fn current(&self) -> bool
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl ValueTree for CharValueTree
[src]
type Value = char
fn current(&self) -> char
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl ValueTree for proptest::num::f32::BinarySearch
[src]
type Value = f32
fn current(&self) -> f32
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl ValueTree for proptest::num::f64::BinarySearch
[src]
type Value = f64
fn current(&self) -> f64
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl ValueTree for proptest::num::i8::BinarySearch
[src]
type Value = i8
fn current(&self) -> i8
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl ValueTree for proptest::num::i16::BinarySearch
[src]
type Value = i16
fn current(&self) -> i16
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl ValueTree for proptest::num::i32::BinarySearch
[src]
type Value = i32
fn current(&self) -> i32
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl ValueTree for proptest::num::i64::BinarySearch
[src]
type Value = i64
fn current(&self) -> i64
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl ValueTree for proptest::num::i128::BinarySearch
[src]
type Value = i128
fn current(&self) -> i128
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl ValueTree for proptest::num::isize::BinarySearch
[src]
type Value = isize
fn current(&self) -> isize
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl ValueTree for proptest::num::u8::BinarySearch
[src]
type Value = u8
fn current(&self) -> u8
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl ValueTree for proptest::num::u16::BinarySearch
[src]
type Value = u16
fn current(&self) -> u16
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl ValueTree for proptest::num::u32::BinarySearch
[src]
type Value = u32
fn current(&self) -> u32
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl ValueTree for proptest::num::u64::BinarySearch
[src]
type Value = u64
fn current(&self) -> u64
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl ValueTree for proptest::num::u128::BinarySearch
[src]
type Value = u128
fn current(&self) -> u128
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl ValueTree for proptest::num::usize::BinarySearch
[src]
type Value = usize
fn current(&self) -> usize
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl ValueTree for IndexValueTree
[src]
type Value = Index
fn current(&self) -> Self::Value
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl ValueTree for SelectorValueTree
[src]
type Value = Selector
fn current(&self) -> Selector
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<A: Strategy, B: Strategy<Value = A::Value>> ValueTree for TupleUnionValueTree<(LazyValueTree<A>, Option<LazyValueTree<B>>)>
[src]
type Value = A::Value
fn current(&self) -> Self::Value
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<A: Strategy, B: Strategy<Value = A::Value>, C: Strategy<Value = A::Value>> ValueTree for TupleUnionValueTree<(LazyValueTree<A>, Option<LazyValueTree<B>>, Option<LazyValueTree<C>>)>
[src]
type Value = A::Value
fn current(&self) -> Self::Value
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<A: Strategy, B: Strategy<Value = A::Value>, C: Strategy<Value = A::Value>, D: Strategy<Value = A::Value>> ValueTree for TupleUnionValueTree<(LazyValueTree<A>, Option<LazyValueTree<B>>, Option<LazyValueTree<C>>, Option<LazyValueTree<D>>)>
[src]
type Value = A::Value
fn current(&self) -> Self::Value
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<A: Strategy, B: Strategy<Value = A::Value>, C: Strategy<Value = A::Value>, D: Strategy<Value = A::Value>, E: Strategy<Value = A::Value>> ValueTree for TupleUnionValueTree<(LazyValueTree<A>, Option<LazyValueTree<B>>, Option<LazyValueTree<C>>, Option<LazyValueTree<D>>, Option<LazyValueTree<E>>)>
[src]
type Value = A::Value
fn current(&self) -> Self::Value
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<A: Strategy, B: Strategy<Value = A::Value>, C: Strategy<Value = A::Value>, D: Strategy<Value = A::Value>, E: Strategy<Value = A::Value>, F: Strategy<Value = A::Value>> ValueTree for TupleUnionValueTree<(LazyValueTree<A>, Option<LazyValueTree<B>>, Option<LazyValueTree<C>>, Option<LazyValueTree<D>>, Option<LazyValueTree<E>>, Option<LazyValueTree<F>>)>
[src]
type Value = A::Value
fn current(&self) -> Self::Value
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<A: Strategy, B: Strategy<Value = A::Value>, C: Strategy<Value = A::Value>, D: Strategy<Value = A::Value>, E: Strategy<Value = A::Value>, F: Strategy<Value = A::Value>, G: Strategy<Value = A::Value>> ValueTree for TupleUnionValueTree<(LazyValueTree<A>, Option<LazyValueTree<B>>, Option<LazyValueTree<C>>, Option<LazyValueTree<D>>, Option<LazyValueTree<E>>, Option<LazyValueTree<F>>, Option<LazyValueTree<G>>)>
[src]
type Value = A::Value
fn current(&self) -> Self::Value
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<A: Strategy, B: Strategy<Value = A::Value>, C: Strategy<Value = A::Value>, D: Strategy<Value = A::Value>, E: Strategy<Value = A::Value>, F: Strategy<Value = A::Value>, G: Strategy<Value = A::Value>, H: Strategy<Value = A::Value>> ValueTree for TupleUnionValueTree<(LazyValueTree<A>, Option<LazyValueTree<B>>, Option<LazyValueTree<C>>, Option<LazyValueTree<D>>, Option<LazyValueTree<E>>, Option<LazyValueTree<F>>, Option<LazyValueTree<G>>, Option<LazyValueTree<H>>)>
[src]
type Value = A::Value
fn current(&self) -> Self::Value
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<A: Strategy, B: Strategy<Value = A::Value>, C: Strategy<Value = A::Value>, D: Strategy<Value = A::Value>, E: Strategy<Value = A::Value>, F: Strategy<Value = A::Value>, G: Strategy<Value = A::Value>, H: Strategy<Value = A::Value>, I: Strategy<Value = A::Value>> ValueTree for TupleUnionValueTree<(LazyValueTree<A>, Option<LazyValueTree<B>>, Option<LazyValueTree<C>>, Option<LazyValueTree<D>>, Option<LazyValueTree<E>>, Option<LazyValueTree<F>>, Option<LazyValueTree<G>>, Option<LazyValueTree<H>>, Option<LazyValueTree<I>>)>
[src]
type Value = A::Value
fn current(&self) -> Self::Value
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<A: Strategy, B: Strategy<Value = A::Value>, C: Strategy<Value = A::Value>, D: Strategy<Value = A::Value>, E: Strategy<Value = A::Value>, F: Strategy<Value = A::Value>, G: Strategy<Value = A::Value>, H: Strategy<Value = A::Value>, I: Strategy<Value = A::Value>, J: Strategy<Value = A::Value>> ValueTree for TupleUnionValueTree<(LazyValueTree<A>, Option<LazyValueTree<B>>, Option<LazyValueTree<C>>, Option<LazyValueTree<D>>, Option<LazyValueTree<E>>, Option<LazyValueTree<F>>, Option<LazyValueTree<G>>, Option<LazyValueTree<H>>, Option<LazyValueTree<I>>, Option<LazyValueTree<J>>)>
[src]
type Value = A::Value
fn current(&self) -> Self::Value
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<A: ValueTree> ValueTree for TupleValueTree<(A,)>
[src]
type Value = (A::Value,)
fn current(&self) -> Self::Value
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<A: ValueTree, B: ValueTree> ValueTree for TupleValueTree<(A, B)>
[src]
type Value = (A::Value, B::Value)
fn current(&self) -> Self::Value
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<A: ValueTree, B: ValueTree, C: ValueTree> ValueTree for TupleValueTree<(A, B, C)>
[src]
type Value = (A::Value, B::Value, C::Value)
fn current(&self) -> Self::Value
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<A: ValueTree, B: ValueTree, C: ValueTree, D: ValueTree> ValueTree for TupleValueTree<(A, B, C, D)>
[src]
type Value = (A::Value, B::Value, C::Value, D::Value)
fn current(&self) -> Self::Value
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<A: ValueTree, B: ValueTree, C: ValueTree, D: ValueTree, E: ValueTree> ValueTree for TupleValueTree<(A, B, C, D, E)>
[src]
type Value = (A::Value, B::Value, C::Value, D::Value, E::Value)
fn current(&self) -> Self::Value
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<A: ValueTree, B: ValueTree, C: ValueTree, D: ValueTree, E: ValueTree, F: ValueTree> ValueTree for TupleValueTree<(A, B, C, D, E, F)>
[src]
type Value = (A::Value, B::Value, C::Value, D::Value, E::Value, F::Value)
fn current(&self) -> Self::Value
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<A: ValueTree, B: ValueTree, C: ValueTree, D: ValueTree, E: ValueTree, F: ValueTree, G: ValueTree> ValueTree for TupleValueTree<(A, B, C, D, E, F, G)>
[src]
type Value = (A::Value, B::Value, C::Value, D::Value, E::Value, F::Value, G::Value)
fn current(&self) -> Self::Value
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<A: ValueTree, B: ValueTree, C: ValueTree, D: ValueTree, E: ValueTree, F: ValueTree, G: ValueTree, H: ValueTree> ValueTree for TupleValueTree<(A, B, C, D, E, F, G, H)>
[src]
type Value = (A::Value, B::Value, C::Value, D::Value, E::Value, F::Value, G::Value, H::Value)
fn current(&self) -> Self::Value
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<A: ValueTree, B: ValueTree, C: ValueTree, D: ValueTree, E: ValueTree, F: ValueTree, G: ValueTree, H: ValueTree, I: ValueTree> ValueTree for TupleValueTree<(A, B, C, D, E, F, G, H, I)>
[src]
type Value = (A::Value, B::Value, C::Value, D::Value, E::Value, F::Value, G::Value, H::Value, I::Value)
fn current(&self) -> Self::Value
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<A: ValueTree, B: ValueTree, C: ValueTree, D: ValueTree, E: ValueTree, F: ValueTree, G: ValueTree, H: ValueTree, I: ValueTree, J: ValueTree> ValueTree for TupleValueTree<(A, B, C, D, E, F, G, H, I, J)>
[src]
type Value = (A::Value, B::Value, C::Value, D::Value, E::Value, F::Value, G::Value, H::Value, I::Value, J::Value)
fn current(&self) -> Self::Value
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<A: ValueTree, B: ValueTree, C: ValueTree, D: ValueTree, E: ValueTree, F: ValueTree, G: ValueTree, H: ValueTree, I: ValueTree, J: ValueTree, K: ValueTree> ValueTree for TupleValueTree<(A, B, C, D, E, F, G, H, I, J, K)>
[src]
type Value = (A::Value, B::Value, C::Value, D::Value, E::Value, F::Value, G::Value, H::Value, I::Value, J::Value, K::Value)
fn current(&self) -> Self::Value
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<A: ValueTree, B: ValueTree, C: ValueTree, D: ValueTree, E: ValueTree, F: ValueTree, G: ValueTree, H: ValueTree, I: ValueTree, J: ValueTree, K: ValueTree, L: ValueTree> ValueTree for TupleValueTree<(A, B, C, D, E, F, G, H, I, J, K, L)>
[src]
type Value = (A::Value, B::Value, C::Value, D::Value, E::Value, F::Value, G::Value, H::Value, I::Value, J::Value, K::Value, L::Value)
fn current(&self) -> Self::Value
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<K, V> ValueTree for BTreeMapValueTree<K, V> where
K: ValueTree,
V: ValueTree,
K::Value: Ord,
[src]
K: ValueTree,
V: ValueTree,
K::Value: Ord,
type Value = BTreeMap<K::Value, V::Value>
fn current(&self) -> Self::Value
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<K, V> ValueTree for HashMapValueTree<K, V> where
K: ValueTree,
V: ValueTree,
K::Value: Hash + Eq,
[src]
K: ValueTree,
V: ValueTree,
K::Value: Hash + Eq,
type Value = HashMap<K::Value, V::Value>
fn current(&self) -> Self::Value
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<S: ValueTree> ValueTree for FlattenValueTree<S> where
S::Value: Strategy,
[src]
S::Value: Strategy,
type Value = <S::Value as Strategy>::Value
fn current(&self) -> Self::Value
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<S: ValueTree, F: FilterFn<S::Value>> ValueTree for proptest::strategy::statics::Filter<S, F>
[src]
type Value = S::Value
fn current(&self) -> S::Value
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<S: ValueTree, F: MapFn<S::Value>> ValueTree for proptest::strategy::statics::Map<S, F>
[src]
type Value = F::Output
fn current(&self) -> F::Output
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<S: ValueTree, F: Fn(&S::Value) -> bool> ValueTree for proptest::strategy::Filter<S, F>
[src]
type Value = S::Value
fn current(&self) -> S::Value
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<S: ValueTree, O: Debug> ValueTree for MapInto<S, O> where
S::Value: Into<O>,
[src]
S::Value: Into<O>,
type Value = O
fn current(&self) -> O
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<S: ValueTree, O: Debug, F: Fn(S::Value) -> O> ValueTree for proptest::strategy::Map<S, F>
[src]
type Value = O
fn current(&self) -> O
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<S: ValueTree, O: Debug, F: Fn(S::Value, TestRng) -> O> ValueTree for PerturbValueTree<S, F>
[src]
type Value = O
fn current(&self) -> O
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T> ValueTree for BTreeSetValueTree<T> where
T: ValueTree,
T::Value: Ord,
[src]
T: ValueTree,
T::Value: Ord,
type Value = BTreeSet<T::Value>
fn current(&self) -> Self::Value
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T> ValueTree for BinaryHeapValueTree<T> where
T: ValueTree,
T::Value: Ord,
[src]
T: ValueTree,
T::Value: Ord,
type Value = BinaryHeap<T::Value>
fn current(&self) -> Self::Value
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T> ValueTree for HashSetValueTree<T> where
T: ValueTree,
T::Value: Hash + Eq,
[src]
T: ValueTree,
T::Value: Hash + Eq,
type Value = HashSet<T::Value>
fn current(&self) -> Self::Value
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T> ValueTree for LinkedListValueTree<T> where
T: ValueTree,
[src]
T: ValueTree,
type Value = LinkedList<T::Value>
fn current(&self) -> Self::Value
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T> ValueTree for VecDequeValueTree<T> where
T: ValueTree,
[src]
T: ValueTree,
type Value = VecDeque<T::Value>
fn current(&self) -> Self::Value
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T> ValueTree for OptionValueTree<T> where
T: Strategy,
[src]
T: Strategy,
type Value = Option<T::Value>
fn current(&self) -> Self::Value
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T> ValueTree for SelectValueTree<T> where
T: Clone + Debug + 'static,
[src]
T: Clone + Debug + 'static,
type Value = T
fn current(&self) -> Self::Value
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T> ValueTree for RegexGeneratorValueTree<T> where
T: Debug,
[src]
T: Debug,
type Value = T
fn current(&self) -> Self::Value
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T, E> ValueTree for MaybeErrValueTree<T, E> where
T: Strategy,
E: Strategy,
[src]
T: Strategy,
E: Strategy,
type Value = Result<T::Value, E::Value>
fn current(&self) -> Self::Value
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T, E> ValueTree for MaybeOkValueTree<T, E> where
T: Strategy,
E: Strategy,
[src]
T: Strategy,
E: Strategy,
type Value = Result<T::Value, E::Value>
fn current(&self) -> Self::Value
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T: BitSetLike> ValueTree for BitSetValueTree<T>
[src]
type Value = T
fn current(&self) -> T
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T: Strategy> ValueTree for UnionValueTree<T>
[src]
type Value = T::Value
fn current(&self) -> Self::Value
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T: ValueTree> ValueTree for ArrayValueTree<[T; 1]>
[src]
type Value = [T::Value; 1]
fn current(&self) -> [T::Value; 1]
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T: ValueTree> ValueTree for ArrayValueTree<[T; 2]>
[src]
type Value = [T::Value; 2]
fn current(&self) -> [T::Value; 2]
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T: ValueTree> ValueTree for ArrayValueTree<[T; 3]>
[src]
type Value = [T::Value; 3]
fn current(&self) -> [T::Value; 3]
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T: ValueTree> ValueTree for ArrayValueTree<[T; 4]>
[src]
type Value = [T::Value; 4]
fn current(&self) -> [T::Value; 4]
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T: ValueTree> ValueTree for ArrayValueTree<[T; 5]>
[src]
type Value = [T::Value; 5]
fn current(&self) -> [T::Value; 5]
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T: ValueTree> ValueTree for ArrayValueTree<[T; 6]>
[src]
type Value = [T::Value; 6]
fn current(&self) -> [T::Value; 6]
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T: ValueTree> ValueTree for ArrayValueTree<[T; 7]>
[src]
type Value = [T::Value; 7]
fn current(&self) -> [T::Value; 7]
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T: ValueTree> ValueTree for ArrayValueTree<[T; 8]>
[src]
type Value = [T::Value; 8]
fn current(&self) -> [T::Value; 8]
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T: ValueTree> ValueTree for ArrayValueTree<[T; 9]>
[src]
type Value = [T::Value; 9]
fn current(&self) -> [T::Value; 9]
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T: ValueTree> ValueTree for ArrayValueTree<[T; 10]>
[src]
type Value = [T::Value; 10]
fn current(&self) -> [T::Value; 10]
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T: ValueTree> ValueTree for ArrayValueTree<[T; 11]>
[src]
type Value = [T::Value; 11]
fn current(&self) -> [T::Value; 11]
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T: ValueTree> ValueTree for ArrayValueTree<[T; 12]>
[src]
type Value = [T::Value; 12]
fn current(&self) -> [T::Value; 12]
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T: ValueTree> ValueTree for ArrayValueTree<[T; 13]>
[src]
type Value = [T::Value; 13]
fn current(&self) -> [T::Value; 13]
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T: ValueTree> ValueTree for ArrayValueTree<[T; 14]>
[src]
type Value = [T::Value; 14]
fn current(&self) -> [T::Value; 14]
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T: ValueTree> ValueTree for ArrayValueTree<[T; 15]>
[src]
type Value = [T::Value; 15]
fn current(&self) -> [T::Value; 15]
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T: ValueTree> ValueTree for ArrayValueTree<[T; 16]>
[src]
type Value = [T::Value; 16]
fn current(&self) -> [T::Value; 16]
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T: ValueTree> ValueTree for ArrayValueTree<[T; 17]>
[src]
type Value = [T::Value; 17]
fn current(&self) -> [T::Value; 17]
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T: ValueTree> ValueTree for ArrayValueTree<[T; 18]>
[src]
type Value = [T::Value; 18]
fn current(&self) -> [T::Value; 18]
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T: ValueTree> ValueTree for ArrayValueTree<[T; 19]>
[src]
type Value = [T::Value; 19]
fn current(&self) -> [T::Value; 19]
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T: ValueTree> ValueTree for ArrayValueTree<[T; 20]>
[src]
type Value = [T::Value; 20]
fn current(&self) -> [T::Value; 20]
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T: ValueTree> ValueTree for ArrayValueTree<[T; 21]>
[src]
type Value = [T::Value; 21]
fn current(&self) -> [T::Value; 21]
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T: ValueTree> ValueTree for ArrayValueTree<[T; 22]>
[src]
type Value = [T::Value; 22]
fn current(&self) -> [T::Value; 22]
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T: ValueTree> ValueTree for ArrayValueTree<[T; 23]>
[src]
type Value = [T::Value; 23]
fn current(&self) -> [T::Value; 23]
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T: ValueTree> ValueTree for ArrayValueTree<[T; 24]>
[src]
type Value = [T::Value; 24]
fn current(&self) -> [T::Value; 24]
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T: ValueTree> ValueTree for ArrayValueTree<[T; 25]>
[src]
type Value = [T::Value; 25]
fn current(&self) -> [T::Value; 25]
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T: ValueTree> ValueTree for ArrayValueTree<[T; 26]>
[src]
type Value = [T::Value; 26]
fn current(&self) -> [T::Value; 26]
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T: ValueTree> ValueTree for ArrayValueTree<[T; 27]>
[src]
type Value = [T::Value; 27]
fn current(&self) -> [T::Value; 27]
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T: ValueTree> ValueTree for ArrayValueTree<[T; 28]>
[src]
type Value = [T::Value; 28]
fn current(&self) -> [T::Value; 28]
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T: ValueTree> ValueTree for ArrayValueTree<[T; 29]>
[src]
type Value = [T::Value; 29]
fn current(&self) -> [T::Value; 29]
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T: ValueTree> ValueTree for ArrayValueTree<[T; 30]>
[src]
type Value = [T::Value; 30]
fn current(&self) -> [T::Value; 30]
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T: ValueTree> ValueTree for ArrayValueTree<[T; 31]>
[src]
type Value = [T::Value; 31]
fn current(&self) -> [T::Value; 31]
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T: ValueTree> ValueTree for ArrayValueTree<[T; 32]>
[src]
type Value = [T::Value; 32]
fn current(&self) -> [T::Value; 32]
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T: ValueTree> ValueTree for VecValueTree<T>
[src]
type Value = Vec<T::Value>
fn current(&self) -> Vec<T::Value>ⓘ
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T: ValueTree> ValueTree for Fuse<T>
[src]
type Value = T::Value
fn current(&self) -> T::Value
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T: ValueTree> ValueTree for NoShrink<T>
[src]
type Value = T::Value
fn current(&self) -> T::Value
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T: Clone + Debug> ValueTree for Just<T>
[src]
type Value = T
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
fn current(&self) -> T
[src]
impl<T: Debug + Clone + 'static> ValueTree for SubsequenceValueTree<T>
[src]
type Value = Vec<T>
fn current(&self) -> Self::Value
[src]
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
impl<T: Debug, F: Fn() -> T> ValueTree for LazyJust<T, F>
[src]
type Value = T
fn simplify(&mut self) -> bool
[src]
fn complicate(&mut self) -> bool
[src]
fn current(&self) -> Self::Value
[src]
impl<V: ValueTree> ValueTree for ShuffleValueTree<V> where
V::Value: Shuffleable,
[src]
V::Value: Shuffleable,