Copyright | (c) OleksandrZhabenko 2020-2021 |
---|---|
License | MIT |
Maintainer | olexandr543@yahoo.com |
Stability | Experimental |
Safe Haskell | None |
Language | Haskell2010 |
Permutations and universal set functions for the phonetic-languages series of packages. This module uses no vectors, but instead uses arrays.
Synopsis
- universalSetGL :: (Eq a, Foldable t, InsertLeft t a, Monoid (t a), Monoid (t (t a))) => t a -> t (t a) -> (t a -> [a]) -> (t (t a) -> [[a]]) -> [Array Int Int] -> Array Int [a] -> [[a]]
- genPermutations :: Int -> Array Int [Int]
- genPermutationsArr :: Array Int (Array Int [Int])
- genPermutationsL :: Int -> [Array Int Int]
- genPermutationsArrL :: Array Int [Array Int Int]
Documentation
:: (Eq a, Foldable t, InsertLeft t a, Monoid (t a), Monoid (t (t a))) | |
=> t a | |
-> t (t a) | |
-> (t a -> [a]) | The function that is used internally to convert to the |
-> (t (t a) -> [[a]]) | The function that is used internally to convert to the needed representation so that the function can process further |
-> [Array Int Int] | The list of permutations of |
-> Array Int [a] | |
-> [[a]] |
A key point of the evaluation -- the universal set of the task represented as a [[a]]
.