Struct Generator 

pub struct Generator<V, F: Fn() -> V> { /* private fields */ }

Strategy for generating Vs 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.

Implementations

impl<V, F: Fn() -> V> Generator<V, F>

pub fn new(generator: F) -> Self

Constructs a Generator strategy.

Trait Implementations

impl<V: Clone, F: Clone + Fn() -> V> Clone for Generator<V, F>

fn clone(&self) -> Generator<V, F>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<V, F: Fn() -> V> Debug for Generator<V, F>

fn fmt(&self, fmt: &mut Formatter<'_>) -> FResult

Formats the value using the given formatter.

impl<V: Debug, F: Clone + Fn() -> V> Strategy for Generator<V, F>

type Value = Generator<V, F>

The value tree generated by this Strategy.

fn new_value(&self, _: &mut TestRunner) -> Result<Self::Value, String>

Generate a new value tree from the given runner.

fn prop_map<O, F>(self, fun: F) -> Map<Self, F>

where O: Debug, F: Fn(<Self::Value as ValueTree>::Value) -> O, Self: Sized,

Returns a strategy which produces values transformed by the function fun.

fn prop_perturb<O, F>(self, fun: F) -> Perturb<Self, F>

where O: Debug, F: Fn(<Self::Value as ValueTree>::Value, XorShiftRng) -> O, Self: Sized,

Returns a strategy which produces values transformed by the function fun, which is additionally given a random number generator.

fn prop_flat_map<S, F>(self, fun: F) -> Flatten<Map<Self, F>>

where S: Strategy, F: Fn(<Self::Value as ValueTree>::Value) -> S, Self: Sized,

Maps values produced by this strategy into new strategies and picks values from those strategies.

fn prop_ind_flat_map<S, F>(self, fun: F) -> IndFlatten<Map<Self, F>>

where S: Strategy, F: Fn(<Self::Value as ValueTree>::Value) -> S, 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.

fn prop_ind_flat_map2<S, F>(self, fun: F) -> IndFlattenMap<Self, F>

where S: Strategy, F: Fn(<Self::Value as ValueTree>::Value) -> S, 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.

fn prop_filter<F>(self, whence: String, fun: F) -> Filter<Self, F>

where F: Fn(&<Self::Value as ValueTree>::Value) -> bool, Self: Sized,

Returns a strategy which only produces values accepted by fun.

fn prop_union(self, other: Self) -> Union<Self>

where Self: Sized,

Returns a strategy which picks uniformly from self and other.

fn prop_recursive<F>( self, depth: u32, desired_size: u32, expected_branch_size: u32, recurse: F, ) -> Recursive<Box<dyn Strategy<Value = Box<dyn ValueTree<Value = <Self::Value as ValueTree>::Value>>>>, F>

where F: Fn(Arc<Box<dyn Strategy<Value = Box<dyn ValueTree<Value = <Self::Value as ValueTree>::Value>>>>>) -> Box<dyn Strategy<Value = Box<dyn ValueTree<Value = <Self::Value as ValueTree>::Value>>>>, Self: Sized + 'static,

Generate a recursive structure with self items as leaves.

fn prop_shuffle(self) -> Shuffle<Self>

where Self: Sized, <Self::Value as ValueTree>::Value: Shuffleable,

Shuffle the contents of the values produced by this strategy.

fn boxed( self, ) -> Box<dyn Strategy<Value = Box<dyn ValueTree<Value = <Self::Value as ValueTree>::Value>>>>

where Self: Sized + 'static,

Erases the type of this Strategy so it can be passed around as a simple trait object.

fn sboxed( self, ) -> Box<dyn Strategy<Value = Box<dyn ValueTree<Value = <Self::Value as ValueTree>::Value>>> + Send + Sync>

where Self: Sized + Send + Sync + 'static,

Erases the type of this Strategy so it can be passed around as a simple trait object.

fn no_shrink(self) -> NoShrink<Self>

where Self: Sized,

Wraps this strategy to prevent values from being subject to shrinking.

impl<V: Debug, F: Fn() -> V> ValueTree for Generator<V, F>

type Value = V

The type of the value produced by this ValueTree.

fn current(&self) -> Self::Value

Returns the current value.

fn simplify(&mut self) -> bool

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.

fn complicate(&mut self) -> bool

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.

impl<V: Copy, F: Copy + Fn() -> V> Copy for Generator<V, F>