numeric-prelude-0.4.3.3: An experimental alternative hierarchy of numeric type classes
Copyright(c) Henning Thielemann 2006
Maintainernumericprelude@henning-thielemann.de
Stabilityprovisional
Portability
Safe HaskellSafe-Inferred
LanguageHaskell98

MathObj.Permutation.Table

Description

Permutation represented by an array of the images.

Synopsis

Documentation

type T i = Array i i Source #

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

toFunction :: Ix i => T i -> i -> i Source #

fromPermutation :: (Ix i, C p) => p i -> T i Source #

fromCycles :: Ix i => (i, i) -> [[i]] -> T i Source #

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

cycle :: Ix i => [i] -> T i -> T i Source #

inverse :: Ix i => T i -> T i Source #

compose :: Ix i => T i -> T i -> T i Source #

choose :: Set a -> Maybe (a, Set a) Source #

Extremely naïve algorithm to generate a list of all elements in a group. Should be replaced by a Schreier-Sims system if this code is ever used for anything bigger than .. say .. groups of order 512 or so.

closure :: Ix i => [T i] -> [T i] Source #

closureSlow :: Ix i => [T i] -> [T i] Source #