Struct Enumerator

pub struct Enumerator;

Produces all possible outputs of the random process, with repetition, as a Vec.

Enumerator can be preferable to Counter in applications where the functions passed to fmap_rand do not typically produce the same value for different random inputs. In these cases, using Counter, which is backed by a HashMap functor, will often not result in the expected space savings, as hash tables will over-allocate to maintain an acceptable load factor.

Trait Implementations

impl Clone for Enumerator

fn clone(&self) -> Enumerator

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Enumerator

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

Formats the value using the given formatter.

impl Default for Enumerator

fn default() -> Enumerator

Returns the “default value” for a type.

impl FlattenableRandomStrategy for Enumerator

fn fmap_flat<A: Inner, B: Inner, F: FnMut(A) -> Self::Functor<B>>( f: Self::Functor<A>, func: F, ) -> Self::Functor<B>

Applies the given function to the functor’s inner, flattening one layer of nested structure.

impl Hash for Enumerator

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 PartialEq for Enumerator

fn eq(&self, other: &Enumerator) -> 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 RandomStrategy for Enumerator

type Functor<I: Inner> = Vec<I>

The functor that this strategy operates on.

fn fmap<A: Inner, B: Inner, F: Fn(A) -> B>( f: Self::Functor<A>, func: F, ) -> Self::Functor<B>

Applies the given function to the functor’s inner.

fn fmap_rand<A: Inner, B: Inner, R: RandomVariable, F: Fn(A, R) -> B>( f: Self::Functor<A>, _: &mut impl Rng, func: F, ) -> Self::Functor<B>

where StandardUniform: Distribution<R>,

Using the strategy specified by the implementor, applies the given binary function to the given functor and an element of the sample space of a RandomVariable.

fn fmap_rand_range<A: Inner, B: Inner, R: RandomVariable + SampleUniform, F: Fn(A, R) -> B>( f: Self::Functor<A>, range: impl RandomVariableRange<R>, _: &mut impl Rng, func: F, ) -> Self::Functor<B>

where StandardUniform: Distribution<R>,

Using the strategy specified by the implementor, applies the given binary function to the given functor and an element of the sample space of a RandomVariableRange.

impl Copy for Enumerator

impl Eq for Enumerator

impl StructuralPartialEq for Enumerator