Struct UniformArrayStrategy

pub struct UniformArrayStrategy<S, T> { /* private fields */ }

A Strategy which generates fixed-size arrays containing values drawn from an inner strategy.

T must be an array type of length 1 to 32 whose values are produced by strategy S. Instances of this type are normally created by the various uniformXX functions in this module.

This is mainly useful when the inner strategy is not Copy, precluding expressing the strategy as [myStrategy; 32], for example.

Example

use proptest::prelude::*;

proptest! {
  #[test]
  fn test_something(a in prop::array::uniform32(1u32..)) {
    let unexpected = [0u32;32];
    // `a` is also a [u32;32], so we can compare them directly
    assert_ne!(unexpected, a);
  }
}

Implementations

impl<S, T> UniformArrayStrategy<S, T>

pub fn new(strategy: S) -> Self

Directly create a UniformArrayStrategy.

This is only intended for advanced use, since the only way to specify the array size is with the turbofish operator and explicitly naming the type of the values in the array and the strategy itself.

Prefer the uniformXX functions at module-level unless something precludes their use.

Trait Implementations

impl<S: Clone, T: Clone> Clone for UniformArrayStrategy<S, T>

fn clone(&self) -> UniformArrayStrategy<S, T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<S: Debug, T: Debug> Debug for UniformArrayStrategy<S, T>

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

Formats the value using the given formatter.

impl<S: Strategy, const N: usize> Strategy for UniformArrayStrategy<S, [S::Value; N]>

type Tree = ArrayValueTree<[<S as Strategy>::Tree; N]>

The value tree generated by this Strategy.

type Value = [<S as Strategy>::Value; N]

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: Debug, F: Fn(Self::Value) -> O>(self, fun: F) -> Map<Self, F>

where Self: Sized,

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

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

where Self: Sized, Self::Value: Into<O>,

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

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

where 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: Strategy, F: Fn(Self::Value) -> S>( self, fun: F, ) -> Flatten<Map<Self, F>>

where Self: Sized,

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

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

where 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: Strategy, F: Fn(Self::Value) -> S>( self, fun: F, ) -> IndFlattenMap<Self, F>

where 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: Into<Reason>, F: Fn(&Self::Value) -> bool>( self, whence: R, fun: F, ) -> Filter<Self, F>

where Self: Sized,

Returns a strategy which only produces values accepted by fun.

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

where Self: Sized,

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>

where Self: Sized,

Returns a strategy which picks uniformly from self and other.

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

where Self: Sized + 'static,

Generate a recursive structure with self items as leaves.

fn boxed(self) -> BoxedStrategy<Self::Value>

where Self: Sized + '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<S: Copy, T: Copy> Copy for UniformArrayStrategy<S, T>