Struct HashMapGenerator 

pub struct HashMapGenerator<K, V, KT, VT> { /* private fields */ }

Generator for HashMap<K, V>. Created by hashmaps().

Implementations

impl<K, V, KT, VT> HashMapGenerator<K, V, KT, VT>

pub fn min_size(self, min_size: usize) -> Self

Set the minimum number of entries.

pub fn max_size(self, max_size: usize) -> Self

Set the maximum number of entries.

Trait Implementations

impl<K, V, KT, VT> Generator<HashMap<KT, VT>> for HashMapGenerator<K, V, KT, VT>

where K: Generator<KT>, V: Generator<VT>, KT: Eq + Hash,

fn map<U, F>(self, f: F) -> Mapped<T, U, F, Self>

where Self: Sized, F: Fn(T) -> U + Send + Sync,

Transform generated values using a function.

fn flat_map<U, G, F>(self, f: F) -> FlatMapped<T, U, G, F, Self>

where Self: Sized, G: Generator<U>, F: Fn(T) -> G + Send + Sync,

Generate a value, then use it to choose or configure another generator.

fn filter<F>(self, predicate: F) -> Filtered<T, F, Self>

where Self: Sized, F: Fn(&T) -> bool + Send + Sync,

Only keep generated values that satisfy the predicate.

fn boxed<'a>(self) -> BoxedGenerator<'a, T>

where Self: Sized + Send + Sync + 'a,

Convert this generator into a type-erased boxed generator.