pub fn hash_set<T: Strategy>(
element: T,
size: impl Into<SizeRange>,
) -> HashSetStrategy<T>Expand description
Create a strategy to generate HashSets containing elements drawn from
element and with a size range given by size.
This strategy will implicitly do local rejects to ensure that the HashSet
has at least the minimum number of elements, in case element should
produce duplicate values.