Struct proptest::strategy::Recursive
[−]
[src]
pub struct Recursive<B, F> { /* fields omitted */ }
Return type from Strategy::prop_recursive()
.
Trait Implementations
impl<B: Debug, F> Debug for Recursive<B, F>
[src]
impl<B, F> Clone for Recursive<B, F>
[src]
fn clone(&self) -> Self
Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)
1.0.0
Performs copy-assignment from source
. Read more
impl<T: Debug + 'static, F: Fn(Arc<BoxedStrategy<T>>) -> BoxedStrategy<T>> Strategy for Recursive<BoxedStrategy<T>, F>
[src]
type Value = Box<ValueTree<Value = T>>
The value tree generated by this Strategy
. Read more
fn new_value(&self, runner: &mut TestRunner) -> Result<Self::Value, String>
Generate a new value tree from the given runner. Read more
fn prop_map<O: Debug, F: Fn(<Self::Value as ValueTree>::Value) -> O>(
self,
fun: F
) -> Map<Self, F> where
Self: Sized,
self,
fun: F
) -> Map<Self, F> where
Self: Sized,
Returns a strategy which produces values transformed by the function fun
. Read more
fn prop_flat_map<S: Strategy, F: Fn(<Self::Value as ValueTree>::Value) -> S>(
self,
fun: F
) -> Flatten<Map<Self, F>> where
Self: Sized,
self,
fun: F
) -> Flatten<Map<Self, F>> where
Self: Sized,
Maps values produced by this strategy into new strategies and picks values from those strategies. Read more
fn prop_ind_flat_map<S: Strategy, F: Fn(<Self::Value as ValueTree>::Value) -> S>(
self,
fun: F
) -> IndFlatten<Map<Self, F>> where
Self: Sized,
self,
fun: F
) -> IndFlatten<Map<Self, F>> where
Self: Sized,
Maps values produced by this strategy into new strategies and picks values from those strategies while considering the new strategies to be independent. Read more
fn prop_ind_flat_map2<S: Strategy, F: Fn(<Self::Value as ValueTree>::Value) -> S>(
self,
fun: F
) -> IndFlattenMap<Self, F> where
Self: Sized,
self,
fun: F
) -> IndFlattenMap<Self, F> where
Self: Sized,
Similar to prop_ind_flat_map()
, but produces 2-tuples with the input generated from self
in slot 0 and the derived strategy in slot 1. Read more
fn prop_filter<F: Fn(&<Self::Value as ValueTree>::Value) -> bool>(
self,
whence: String,
fun: F
) -> Filter<Self, F> where
Self: Sized,
self,
whence: String,
fun: F
) -> Filter<Self, F> where
Self: Sized,
Returns a strategy which only produces values accepted by fun
. Read more
fn prop_union(self, other: Self) -> Union<Self> where
Self: Sized,
Self: Sized,
Returns a strategy which picks uniformly from self
and other
. Read more
fn prop_recursive<F: Fn(Arc<BoxedStrategy<<Self::Value as ValueTree>::Value>>) -> BoxedStrategy<<Self::Value as ValueTree>::Value>>(
self,
depth: u32,
desired_size: u32,
expected_branch_size: u32,
recurse: F
) -> Recursive<BoxedStrategy<<Self::Value as ValueTree>::Value>, F> where
Self: Sized + 'static,
self,
depth: u32,
desired_size: u32,
expected_branch_size: u32,
recurse: F
) -> Recursive<BoxedStrategy<<Self::Value as ValueTree>::Value>, F> where
Self: Sized + 'static,
Generate a recursive structure with self
items as leaves. Read more
fn boxed(self) -> BoxedStrategy<<Self::Value as ValueTree>::Value> where
Self: Sized + 'static,
Self: Sized + 'static,
Erases the type of this Strategy
so it can be passed around as a simple trait object. Read more
fn no_shrink(self) -> NoShrink<Self> where
Self: Sized,
Self: Sized,
Wraps this strategy to prevent values from being subject to shrinking. Read more