Struct QCStrategy 

pub struct QCStrategy<A: Arbitrary + Debug> { /* private fields */ }

QCStrategy is a Strategy that provides interoperability with quickcheck’s Arbitrary trait. If you have any type implementing Arbitrary and Debug, which a temporary requirement, then you may get back the equivalent Strategy in proptest.

Implementations

impl<A: Arbitrary + Debug> QCStrategy<A>

pub fn new(size: usize) -> Self

Constructs a new QCStrategy given a size parameter that:

controls the size of random values generated. For example, it specifies the maximum length of a randomly generated vector and also will specify the maximum magnitude of a randomly generated number.

as defined by quickcheck

Trait Implementations

impl<A: Clone + Arbitrary + Debug> Clone for QCStrategy<A>

fn clone(&self) -> QCStrategy<A>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<A: Copy + Arbitrary + Debug> Copy for QCStrategy<A>

impl<A: Debug + Arbitrary + Debug> Debug for QCStrategy<A>

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

Formats the value using the given formatter.

impl<A: Eq + Arbitrary + Debug> Eq for QCStrategy<A>

impl<A: Hash + Arbitrary + Debug> Hash for QCStrategy<A>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<A: Ord + Arbitrary + Debug> Ord for QCStrategy<A>

fn cmp(&self, other: &QCStrategy<A>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<A: PartialEq + Arbitrary + Debug> PartialEq for QCStrategy<A>

fn eq(&self, other: &QCStrategy<A>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<A: PartialOrd + Arbitrary + Debug> PartialOrd for QCStrategy<A>

fn partial_cmp(&self, other: &QCStrategy<A>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<A: Arbitrary + Debug> Strategy for QCStrategy<A>

type Value = QCValueTree<A>

The value tree generated by this Strategy.

fn new_value(&self, runner: &mut TestRunner) -> NewTree<Self>

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<R, F>(self, whence: R, fun: F) -> Filter<Self, F>

where R: Into<Reason>, 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>>> + Sync + Send>

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<A: PartialEq + Arbitrary + Debug> StructuralPartialEq for QCStrategy<A>