Documentation

sort then nub.

set [3,3,3,2,2,1] == [1,2,3]

Size of powerset of set of cardinality n, ie. 2 ^ n.

map n_powerset [6..9] == [64,128,256,512]

Powerset, ie. set of all subsets.

sort (powerset [1,2]) == [[],[1],[1,2],[2]]
map length (map (\n -> powerset [1..n]) [6..9]) == [64,128,256,512]

Variant where result is sorted and the empty set is not given.

powerset_sorted [1,2,3] == [[1],[2],[3],[1,2],[1,3],[2,3],[1,2,3]]

Two element subsets.

pairs [1,2,3] == [(1,2),(1,3),(2,3)]

Three element subsets.

triples [1..4] == [(1,2,3),(1,2,4),(1,3,4),(2,3,4)]

import Music.Theory.Combinations
let f n = genericLength (triples [1..n]) == nk_combinations n 3
all f [1..15]

Set expansion (ie. to multiset of degree n).

expand_set 4 [1,2,3] == [[1,1,2,3],[1,2,2,3],[1,2,3,3]]

All distinct multiset partitions, see partitions.

partitions "aab" == [["aab"],["a","ab"],["b","aa"],["b","a","a"]]
partitions "abc" == [["abc"],["bc","a"],["b","ac"],["c","ab"],["c","b","a"]]

Cartesian product of two sets.

cartesian_product "abc" [1,2] == [('a',1),('a',2),('b',1),('b',2),('c',1),('c',2)]
cartesian_product "abc" "" == []

List form of n-fold cartesian product.

length (nfold_cartesian_product [[1..13],[1..4]]) == 52
length (nfold_cartesian_product ["abc","de","fgh"]) == 3 * 2 * 3

Generate all distinct cycles, aka necklaces, with elements taken from a multiset.

concatMap multiset_cycles [replicate i 0 ++ replicate (6 - i) 1 | i <- [0 .. 6]]