Function malachite_base::sets::exhaustive::lex_hash_sets
source · [−]pub fn lex_hash_sets<I: Clone + Iterator>(
xs: I
) -> LexOrderedUniqueCollections<I, HashSet<I::Item>>ⓘNotable traits for LexOrderedUniqueCollections<I, C>impl<I: Iterator, C: FromIterator<I::Item>> Iterator for LexOrderedUniqueCollections<I, C> where
I::Item: Clone, type Item = C;
where
I::Item: Clone + Eq + Hash,
Expand description
Generates HashSet
s with elements from a single iterator.
The HashSet
s 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, only prefixes of the iterator will be generated.
If the input iterator is infinite, the output length is also infinite.
If the input iterator length is $n$, the output length is $2^n$.
If xs
is empty, the output consists of a single empty HashSet
.
Examples
extern crate itertools;
#[macro_use]
extern crate maplit;
use itertools::Itertools;
use malachite_base::sets::exhaustive::lex_hash_sets;
fn main() {
let xss = lex_hash_sets(1..=4).collect_vec();
assert_eq!(
xss,
&[
hashset!{},
hashset!{1},
hashset!{1, 2},
hashset!{1, 2, 3},
hashset!{1, 2, 3, 4},
hashset!{1, 2, 4},
hashset!{1, 3},
hashset!{1, 3, 4},
hashset!{1, 4},
hashset!{2},
hashset!{2, 3},
hashset!{2, 3, 4},
hashset!{2, 4},
hashset!{3},
hashset!{3, 4},
hashset!{4}
]
);
}