combinat-0.2.4.1: Generation of various combinatorial objects.Source codeContentsIndex
Math.Combinat.Combinations
Description
Combinations. This module is depracated; it is equivalent to the module Compositions, but it turns out that "compositions" is the accepted name. I will remove this module in the future.
Synopsis
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'Source
:: [Int]shape
-> Intsum
-> [[Int]]

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.
combinationsSource
:: Intlength
-> Intsum
-> [[Int]]
Combinations of a given length.
countCombinations :: Int -> Int -> IntegerSource
# = \binom { len+d-1 } { len-1 }
combinations1Source
:: Intlength
-> Intsum
-> [[Int]]
Positive combinations of a given length.
countCombinations1 :: Int -> Int -> IntegerSource
Produced by Haddock version 2.6.1