numeric-prelude-0.4.3: An experimental alternative hierarchy of numeric type classes

Copyright(c) Mikael Johansson 2006
Maintainermik@math.uni-jena.de
Stabilityprovisional
Portabilityrequires multi-parameter type classes
Safe HaskellNone
LanguageHaskell98

MathObj.Permutation.CycleList

Description

Permutation of Integers represented by cycles.

Synopsis

Documentation

type Cycle i = [i] Source #

type T i = [Cycle i] Source #

fromFunction :: Ix i => (i, i) -> (i -> i) -> T i Source #

cycleRightAction :: Eq i => i -> Cycle i -> i Source #

cycleLeftAction :: Eq i => Cycle i -> i -> i Source #

cycleAction :: Eq i => [i] -> i -> i Source #

cycleOrbit :: Ord i => Cycle i -> i -> [i] Source #

(*>) :: Eq i => T i -> i -> i Source #

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

cyclesOrbit :: Ord i => T i -> i -> [i] Source #

orbit :: Ord i => (i -> i) -> i -> [i] Source #

takeUntilRepetition :: Ord a => [a] -> [a] Source #

candidates for Utility ?

takeUntilRepetitionSlow :: Eq a => [a] -> [a] Source #

choose :: Set a -> Maybe a Source #

inverse :: T i -> T i Source #