[][src]Struct proptest::bits::SampledBitSetStrategy

#[must_use = "strategies do nothing unless used"]
pub struct SampledBitSetStrategy<T: BitSetLike> { /* fields omitted */ }

Generates bit sets with a particular number of bits set.

Specifically, this strategy is given both a size range and a bit range. To produce a new value, it selects a size, then uniformly selects that many bits from within the bit range.

Shrinking happens as with BitSetStrategy.

Methods

impl<T: BitSetLike> SampledBitSetStrategy<T>[src]

pub fn new(
    size: impl Into<SizeRange>,
    bits: impl Into<SizeRange>
) -> Self
[src]

Create a strategy which generates values where bits within the bounds given by bits may be set. The number of bits that are set is chosen to be in the range given by size.

Due to the generics, the functions in the typed submodules are usually preferable to calling this directly.

Panics

Panics if size includes a value that is greater than the number of bits in bits.

Trait Implementations

impl<T: BitSetLike> Strategy for SampledBitSetStrategy<T>[src]

type Tree = BitSetValueTree<T>

The value tree generated by this Strategy.

type Value = T

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

fn prop_map<O: Debug, F: Fn(Self::Value) -> O>(self, fun: F) -> Map<Self, F> where
    Self: Sized
[src]

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

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

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

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

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

fn prop_flat_map<S: Strategy, F: Fn(Self::Value) -> S>(
    self,
    fun: F
) -> Flatten<Map<Self, F>> where
    Self: Sized
[src]

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

fn prop_ind_flat_map<S: Strategy, F: Fn(Self::Value) -> S>(
    self,
    fun: F
) -> IndFlatten<Map<Self, F>> where
    Self: Sized
[src]

Maps values produced by this strategy into new strategies and picks values from those strategies while considering the new strategies to be independent. Read more

fn prop_ind_flat_map2<S: Strategy, F: Fn(Self::Value) -> S>(
    self,
    fun: F
) -> IndFlattenMap<Self, F> where
    Self: Sized
[src]

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

fn prop_filter<R: Into<Reason>, F: Fn(&Self::Value) -> bool>(
    self,
    whence: R,
    fun: F
) -> Filter<Self, F> where
    Self: Sized
[src]

Returns a strategy which only produces values accepted by fun. Read more

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
[src]

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

fn prop_union(self, other: Self) -> Union<Self> where
    Self: Sized
[src]

Returns a strategy which picks uniformly from self and other. Read more

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, 
[src]

Generate a recursive structure with self items as leaves. Read more

fn prop_shuffle(self) -> Shuffle<Self> where
    Self: Sized,
    Self::Value: Shuffleable
[src]

Shuffle the contents of the values produced by this strategy. Read more

fn boxed(self) -> BoxedStrategy<Self::Value> where
    Self: Sized + 'static, 
[src]

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

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

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

fn no_shrink(self) -> NoShrink<Self> where
    Self: Sized
[src]

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

impl<T: Clone + BitSetLike> Clone for SampledBitSetStrategy<T>[src]

fn clone_from(&mut self, source: &Self)
1.0.0
[src]

Performs copy-assignment from source. Read more

impl<T: Debug + BitSetLike> Debug for SampledBitSetStrategy<T>[src]

Auto Trait Implementations

impl<T> Send for SampledBitSetStrategy<T> where
    T: Send

impl<T> Sync for SampledBitSetStrategy<T> where
    T: Sync

Blanket Implementations

impl<T> From for T[src]

impl<T, U> TryFrom for T where
    U: Into<T>, 
[src]

type Error = !

🔬 This is a nightly-only experimental API. (try_from)

The type returned in the event of a conversion error.

impl<T, U> TryInto for T where
    U: TryFrom<T>, 
[src]

type Error = <U as TryFrom<T>>::Error

🔬 This is a nightly-only experimental API. (try_from)

The type returned in the event of a conversion error.

impl<T, U> Into for T where
    U: From<T>, 
[src]

impl<T> Borrow for T where
    T: ?Sized
[src]

impl<T> BorrowMut for T where
    T: ?Sized
[src]

impl<T> Any for T where
    T: 'static + ?Sized
[src]

impl<T> ToOwned for T where
    T: Clone
[src]

type Owned = T