Combinations

- combinations' :: [Int] -> Int -> [[Int]]
- countCombinations' :: [Int] -> Int -> Integer
- allCombinations' :: [Int] -> [[[Int]]]
- combinations :: Int -> Int -> [[Int]]
- countCombinations :: Int -> Int -> Integer
- combinations1 :: Int -> Int -> [[Int]]
- countCombinations1 :: Int -> Int -> Integer

# Documentation

Combinations fitting into a given shape and having a given degree. The order is lexicographic, that is,

sort cs == cs where cs = combinations' shape k

countCombinations' :: [Int] -> Int -> IntegerSource

allCombinations' :: [Int] -> [[[Int]]]Source

All combinations fitting into a given shape.

countCombinations :: Int -> Int -> IntegerSource

# = \binom { len+d-1 } { len-1 }

countCombinations1 :: Int -> Int -> IntegerSource