Function `btree_set`

fn btree_set<T: Strategy, impl Into<SizeRange>: Into<SizeRange>>(element: T, size: impl Into<SizeRange>) -> BTreeSetStrategy<T>
where
    <T as >::Value: Ord

Create a strategy to generate BTreeSets containing elements drawn from element and with a size range given by size.

This strategy will implicitly do local rejects to ensure that the BTreeSet has at least the minimum number of elements, in case element should produce duplicate values.