Struct rand_functors::Counter

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

Produces all possible outputs of the random process, with repetition, stored in a HashMap.

Counter is optimal in scenarios where certain operations will map many inputs to the same output. Examples include conditionally zeroing out a field of a struct or the use of functions like saturating_add or saturating_mul.

Trait Implementations

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

fn clone(&self) -> Counter<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 Counter<S>

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

Formats the value using the given formatter.

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

fn default() -> Counter<S>

Returns the “default value” for a type.

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

fn eq(&self, other: &Counter<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 Counter<S>

type Functor<I: Inner> = HashMap<I, usize, 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_flat<A: Inner, B: Inner, F: FnMut(A) -> Self::Functor<B>>( f: Self::Functor<A>, _: &mut impl Rng, func: F ) -> Self::Functor<B>

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

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 Counter<S>

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

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