Struct proptest_quickcheck_interop::QCStrategy

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

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.

Methods

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

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

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

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

Returns a copy of the value.

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

Performs copy-assignment from source.

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

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

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, __arg_0: &QCStrategy<A>) -> bool

This method tests for !=.

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

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

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

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

fn lt(&self, __arg_0: &QCStrategy<A>) -> bool

This method tests less than (for self and other) and is used by the < operator.

fn le(&self, __arg_0: &QCStrategy<A>) -> bool

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

fn gt(&self, __arg_0: &QCStrategy<A>) -> bool

This method tests greater than (for self and other) and is used by the > operator.

fn ge(&self, __arg_0: &QCStrategy<A>) -> bool

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

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

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

This method returns an Ordering between self and other.

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

Compares and returns the maximum of two values.

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

Compares and returns the minimum of two values.

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

fn hash<__HA: Hasher>(&self, __arg_0: &mut __HA)

Feeds this value into the given [Hasher].

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

Feeds a slice of this type into the given [Hasher].

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

fn fmt(&self, __arg_0: &mut Formatter) -> Result

Formats the value using the given formatter.

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
    F: Fn(<Self::Value as ValueTree>::Value) -> O,
    O: Debug, 

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

fn prop_perturb<O, F>(self, fun: F) -> Perturb<Self, F> where
    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.

fn prop_flat_map<S, F>(self, fun: F) -> Flatten<Map<Self, F>> where
    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.

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, 

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
    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.

fn prop_filter<R, F>(self, whence: R, fun: F) -> Filter<Self, F> where
    F: Fn(&<Self::Value as ValueTree>::Value) -> bool,
    R: Into<Reason>, 

Returns a strategy which only produces values accepted by fun.

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

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<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.

fn prop_shuffle(self) -> Shuffle<Self> where
    <Self::Value as ValueTree>::Value: Shuffleable, 

Shuffle the contents of the values produced by this strategy.

fn boxed(
    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.

fn sboxed(
    self
) -> Box<Strategy<Value = Box<ValueTree<Value = <Self::Value as ValueTree>::Value> + 'static>> + 'static + Sync + Send> where
    Self: 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>

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