Function btree_map

pub fn btree_map<K, V>(
    key: K,
    value: V,
    size: impl Into<SizeRange>,
) -> BTreeMapStrategy<K, V>
where
    K: Strategy,
    V: Strategy,
    <K as Strategy>::Value: Ord,

Create a strategy to generate BTreeMaps containing keys and values drawn from key and value respectively, and with a size within the given range.

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