Safe Haskell | None |
---|---|

Language | Haskell2010 |

Tuples.

# Documentation

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

"Tuples" fitting into a give shape. The order is lexicographic, that is,

sort ts == ts where ts = tuples' shape

Example:

tuples' [2,3] = [[0,0],[0,1],[0,2],[0,3],[1,0],[1,1],[1,2],[1,3],[2,0],[2,1],[2,2],[2,3]]

countTuples' :: [Int] -> Integer Source

# = \prod_i (m_i + 1)

countTuples1' :: [Int] -> Integer Source

# = \prod_i m_i

countTuples :: Int -> Int -> Integer Source

# = (m+1) ^ len

countTuples1 :: Int -> Int -> Integer Source

# = m ^ len

binaryTuples :: Int -> [[Bool]] Source