Copyright | (c) OleksandrZhabenko 2020-2024 |
---|---|
License | MIT |
Maintainer | oleksandr.zhabenko@yahoo.com |
Stability | Experimental |
Safe Haskell | Safe-Inferred |
Language | Haskell2010 |
Permutations and universal set functions for the phonetic-languages series and phladiprelio of packages (AFTOVolio-related). 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 :: (Ord a, Enum a, Num a) => Int -> Array Int [a]
- genPermutationsArr :: (Ord a, Enum a, Num a) => Array Int (Array Int [a])
- genPermutationsL :: (Ord a, Enum a, Num a) => Int -> [Array Int a]
- genPermutationsArrL :: (Ord a, Enum a, Num a) => Array Int [Array Int a]
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]]
.