Function malachite_base::sets::exhaustive::shortlex_hash_sets_length_inclusive_range

source · 
pub fn shortlex_hash_sets_length_inclusive_range<I: Clone + Iterator>(
    a: u64,
    b: u64,
    xs: I,
) -> ShortlexOrderedUniqueCollections<I, HashSet<I::Item>> ⓘ
where
    I::Item: Clone + Eq + Hash,
Expand description

Generates HashSets, with lengths in a range $[a, b]$, with elements from a single iterator.

The HashSets are generated in order of increasing length, and within each length they are ordered lexicographically with respect to the order of the element iterator.

The source iterator should not repeat any elements, but this is not enforced.

The iterator should be finite; if it is infinite, HashSets of length \max(2, a + 1) and above will never be generated.

If $a < b$, the output is empty.

If $a = b = 0$, the output consists of a single empty HashSet.

If the input iterator is infinite and $0 < a \leq b$, the output length is also infinite.

If the input iterator length is $n$, the output length is $$ \sum_{i=a}^b \binom{n}{i}. $$

§Examples

use itertools::Itertools;
use malachite_base::sets::exhaustive::shortlex_hash_sets_length_inclusive_range;
use maplit::hashset;

let xss = shortlex_hash_sets_length_inclusive_range(2, 3, 1..=4).collect_vec();
assert_eq!(
    xss,
    &[
        hashset! {1, 2},
        hashset! {1, 3},
        hashset! {1, 4},
        hashset! {2, 3},
        hashset! {2, 4},
        hashset! {3, 4},
        hashset! {1, 2, 3},
        hashset! {1, 2, 4},
        hashset! {1, 3, 4},
        hashset! {2, 3, 4},
    ]
);