Modulenumeric-prelude-0.4.4Haskell98

MathObj.Permutation.CycleList

Permutation of Integers represented by cycles.

Synopsis

typetype Cycle i = [i]

typetype T i = [Cycle i]

valuefromFunction :: Ix i => (i, i) -> (i -> i) -> T i

valuecycleRightAction :: Eq i => i -> Cycle i -> i

valuecycleLeftAction :: Eq i => Cycle i -> i -> i

valuecycleAction :: Eq i => [i] -> i -> i

valuecycleOrbit :: Ord i => Cycle i -> i -> [i]

value(*>) :: Eq i => T i -> i -> i

Right (left?) group action on the Integers. Close to, but not the same as the module action in Algebra.Module.

valuecyclesOrbit :: Ord i => T i -> i -> [i]

valueorbit :: Ord i => (i -> i) -> i -> [i]

valuetakeUntilRepetition :: Ord a => [a] -> [a]

candidates for Utility ?

valuetakeUntilRepetitionSlow :: Eq a => [a] -> [a]

valuechoose :: Set a -> Maybe a

valuekeepEssentials :: T i -> T i

valueisEssential :: Cycle i -> Bool

valueinverse :: T i -> T i