
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 



Documentation 


:: [Int]  shape
 > Int  sum
 > [[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






All combinations fitting into a given shape.



:: Int  length
 > Int  sum
 > [[Int]]   Combinations of a given length.




# = \binom { len+d1 } { len1 }



:: Int  length
 > Int  sum
 > [[Int]]   Positive combinations of a given length.





Produced by Haddock version 2.6.1 