|
MathObj.Permutation.CycleList | Portability | requires multi-parameter type classes | Stability | provisional | Maintainer | mik@math.uni-jena.de |
|
|
|
Description |
Permutation of Integers represented by cycles.
|
|
Synopsis |
|
|
|
Documentation |
|
|
|
|
|
fromFunction :: Ix i => (i, i) -> (i -> i) -> T i | Source |
|
|
|
|
|
|
cycleAction :: Eq i => [i] -> i -> i | Source |
|
|
|
|
|
Right (left?) group action on the Integers.
Close to, but not the same as the module action in Algebra.Module.
|
|
|
|
|
|
takeUntilRepetition :: Ord a => [a] -> [a] | Source |
|
candidates for Utility ?
|
|
takeUntilRepetitionSlow :: Eq a => [a] -> [a] | Source |
|
|
|
|
|
|
|
|
|
|
Produced by Haddock version 2.4.2 |