Struct proptest_arbitrary_interop::ArbStrategy

pub struct ArbStrategy<A: ArbInterop> { /* private fields */ }

Implementations

impl<A: ArbInterop> ArbStrategy<A>

pub fn new(size: usize) -> Self

Trait Implementations

impl<A: Clone + ArbInterop> Clone for ArbStrategy<A>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<A: Debug + ArbInterop> Debug for ArbStrategy<A>

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

Formats the value using the given formatter.

impl<A: Hash + ArbInterop> Hash for ArbStrategy<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, 

Feeds a slice of this type into the given Hasher.

impl<A: Ord + ArbInterop> Ord for ArbStrategy<A>

fn cmp(&self, other: &ArbStrategy<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.

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

Restrict a value to a certain interval.

impl<A: PartialEq + ArbInterop> PartialEq<ArbStrategy<A>> for ArbStrategy<A>

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

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

fn ne(&self, other: &ArbStrategy<A>) -> bool

This method tests for !=.

impl<A: PartialOrd + ArbInterop> PartialOrd<ArbStrategy<A>> for ArbStrategy<A>

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

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

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

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

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

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

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

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

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

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

impl<A: ArbInterop> Strategy for ArbStrategy<A>

type Tree = ArbValueTree<A>

The value tree generated by this Strategy.

type Value = A

The type of value used by functions under test generated by this Strategy.

fn new_tree(&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) -> O, 

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

fn prop_map_into<O>(self) -> MapInto<Self, O> where
    O: Debug,
    Self::Value: Into<O>, 

Returns a strategy which produces values of type O by transforming Self with Into<O>.

fn prop_perturb<O, F>(self, fun: F) -> Perturb<Self, F> where
    O: Debug,
    F: Fn(Self::Value, TestRng) -> O, 

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) -> S, 

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) -> S, 

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) -> S, 

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) -> bool, 

Returns a strategy which only produces values accepted by fun.

fn prop_filter_map<F, O>(
    self,
    whence: impl Into<Reason>,
    fun: F
) -> FilterMap<Self, F> where
    F: Fn(Self::Value) -> Option<O>,
    O: Debug, 

Returns a strategy which only produces transformed values where fun returns Some(value) and rejects those where fun returns None.

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

Returns a strategy which picks uniformly from self and other.

fn prop_recursive<R, F>(
    self,
    depth: u32,
    desired_size: u32,
    expected_branch_size: u32,
    recurse: F
) -> Recursive<Self::Value, F> where
    R: 'static + Strategy<Value = Self::Value>,
    F: Fn(BoxedStrategy<Self::Value>) -> R,
    Self: 'static, 

Generate a recursive structure with self items as leaves.

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

Shuffle the contents of the values produced by this strategy.

fn boxed(self) -> BoxedStrategy<Self::Value> where
    Self: 'static, 

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

fn sboxed(self) -> SBoxedStrategy<Self::Value> where
    Self: 'static + Send + Sync, 

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.

impl<A: Copy + ArbInterop> Copy for ArbStrategy<A>

impl<A: Eq + ArbInterop> Eq for ArbStrategy<A>

impl<A: ArbInterop> StructuralEq for ArbStrategy<A>

impl<A: ArbInterop> StructuralPartialEq for ArbStrategy<A>