Struct proptest_arbitrary::Generator
[−]
[src]
pub struct Generator<V, F: Fn() -> V> { /* fields omitted */ }
Strategy for generating V
s from an Fn() -> V
.
It's not a very interesting Strategy, but required sometimes
when the only means of creating an object of some type is
via a function while type type is also not Clone.
Methods
impl<V, F: Fn() -> V> Generator<V, F>
[src]
Trait Implementations
impl<V: Clone, F: Clone + Fn() -> V> Clone for Generator<V, F>
[src]
fn clone(&self) -> Generator<V, F>
[src]
Returns a copy of the value. Read more
fn clone_from(&mut self, source: &Self)
1.0.0[src]
Performs copy-assignment from source
. Read more
impl<V: Copy, F: Copy + Fn() -> V> Copy for Generator<V, F>
[src]
impl<V: Debug, F: Clone + Fn() -> V> Strategy for Generator<V, F>
[src]
type Value = Self
The value tree generated by this Strategy
. Read more
fn new_value(&self, _: &mut TestRunner) -> Result<Self::Value, String>
[src]
Generate a new value tree from the given runner. Read more
fn prop_map<O, F>(self, fun: F) -> Map<Self, F> where
F: Fn(<Self::Value as ValueTree>::Value) -> O,
O: Debug,
[src]
F: Fn(<Self::Value as ValueTree>::Value) -> O,
O: Debug,
Returns a strategy which produces values transformed by the function fun
. Read more
fn prop_perturb<O, F>(self, fun: F) -> Perturb<Self, F> where
F: Fn(<Self::Value as ValueTree>::Value, XorShiftRng) -> O,
O: Debug,
[src]
F: Fn(<Self::Value as ValueTree>::Value, XorShiftRng) -> O,
O: Debug,
Returns a strategy which produces values transformed by the function fun
, which is additionally given a random number generator. Read more
fn prop_flat_map<S, F>(self, fun: F) -> Flatten<Map<Self, F>> where
F: Fn(<Self::Value as ValueTree>::Value) -> S,
S: Strategy,
[src]
F: Fn(<Self::Value as ValueTree>::Value) -> S,
S: Strategy,
Maps values produced by this strategy into new strategies and picks values from those strategies. Read more
fn prop_ind_flat_map<S, F>(self, fun: F) -> IndFlatten<Map<Self, F>> where
F: Fn(<Self::Value as ValueTree>::Value) -> S,
S: Strategy,
[src]
F: Fn(<Self::Value as ValueTree>::Value) -> S,
S: Strategy,
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, F>(self, fun: F) -> IndFlattenMap<Self, F> where
F: Fn(<Self::Value as ValueTree>::Value) -> S,
S: Strategy,
[src]
F: Fn(<Self::Value as ValueTree>::Value) -> S,
S: Strategy,
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>(self, whence: String, fun: F) -> Filter<Self, F> where
F: Fn(&<Self::Value as ValueTree>::Value) -> bool,
[src]
F: Fn(&<Self::Value as ValueTree>::Value) -> bool,
Returns a strategy which only produces values accepted by fun
. Read more
fn prop_union(self, other: Self) -> Union<Self>
[src]
Returns a strategy which picks uniformly from self
and other
. Read more
fn prop_recursive<F>(
self,
depth: u32,
desired_size: u32,
expected_branch_size: u32,
recurse: F
) -> Recursive<Box<Strategy<Value = Box<ValueTree<Value = <Self::Value as ValueTree>::Value> + 'static>> + 'static>, F> where
F: Fn(Arc<Box<Strategy<Value = Box<ValueTree<Value = <Self::Value as ValueTree>::Value> + 'static>> + 'static>>) -> Box<Strategy<Value = Box<ValueTree<Value = <Self::Value as ValueTree>::Value> + 'static>> + 'static>,
Self: 'static,
[src]
self,
depth: u32,
desired_size: u32,
expected_branch_size: u32,
recurse: F
) -> Recursive<Box<Strategy<Value = Box<ValueTree<Value = <Self::Value as ValueTree>::Value> + 'static>> + 'static>, F> where
F: Fn(Arc<Box<Strategy<Value = Box<ValueTree<Value = <Self::Value as ValueTree>::Value> + 'static>> + 'static>>) -> Box<Strategy<Value = Box<ValueTree<Value = <Self::Value as ValueTree>::Value> + 'static>> + 'static>,
Self: 'static,
Generate a recursive structure with self
items as leaves. Read more
fn prop_shuffle(self) -> Shuffle<Self> where
<Self::Value as ValueTree>::Value: Shuffleable,
[src]
<Self::Value as ValueTree>::Value: Shuffleable,
Shuffle the contents of the values produced by this strategy. Read more
fn boxed(
self
) -> Box<Strategy<Value = Box<ValueTree<Value = <Self::Value as ValueTree>::Value> + 'static>> + 'static> where
Self: 'static,
[src]
self
) -> Box<Strategy<Value = Box<ValueTree<Value = <Self::Value as ValueTree>::Value> + 'static>> + 'static> where
Self: 'static,
Erases the type of this Strategy
so it can be passed around as a simple trait object. Read more
fn sboxed(
self
) -> Box<Strategy<Value = Box<ValueTree<Value = <Self::Value as ValueTree>::Value> + 'static>> + 'static + Send + Sync> where
Self: Send + Sync + 'static,
[src]
self
) -> Box<Strategy<Value = Box<ValueTree<Value = <Self::Value as ValueTree>::Value> + 'static>> + 'static + Send + Sync> where
Self: Send + Sync + '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>
[src]
Wraps this strategy to prevent values from being subject to shrinking. Read more
impl<V: Debug, F: Fn() -> V> ValueTree for Generator<V, F>
[src]
type Value = V
The type of the value produced by this ValueTree
.
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. Read more
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. Read more