Struct rand_functors::UniqueEnumerator

pub struct UniqueEnumerator<S: BuildHasher + Default = RandomState> { /* private fields */ }

Produces all possible outputs of the random process, without repetition, stored in a HashSet.

UniqueEnumerator is optimal in scenarios where certain operations will map many inputs to the same output and the user does not care about the relative frequencies of possible outputs.

Trait Implementations

impl<S: Clone + BuildHasher + Default> Clone for UniqueEnumerator<S>

fn clone(&self) -> UniqueEnumerator<S>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<S: Debug + BuildHasher + Default> Debug for UniqueEnumerator<S>

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

Formats the value using the given formatter.

impl<S: Default + BuildHasher + Default> Default for UniqueEnumerator<S>

fn default() -> UniqueEnumerator<S>

Returns the “default value” for a type.

impl<S: BuildHasher + Default> FlattenableRandomStrategy for UniqueEnumerator<S>

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<S: Hash + BuildHasher + Default> Hash for UniqueEnumerator<S>

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<S: PartialEq + BuildHasher + Default> PartialEq for UniqueEnumerator<S>

fn eq(&self, other: &UniqueEnumerator<S>) -> bool

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

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

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<S: BuildHasher + Default> RandomStrategy for UniqueEnumerator<S>

type Functor<I: Inner> = HashSet<I, S>

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 Standard: 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 Standard: 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<S: Copy + BuildHasher + Default> Copy for UniqueEnumerator<S>

impl<S: Eq + BuildHasher + Default> Eq for UniqueEnumerator<S>

impl<S: BuildHasher + Default> StructuralPartialEq for UniqueEnumerator<S>