Modulenumeric-prelude-0.4.4Haskell98

MathObj.Permutation.Table

Permutation represented by an array of the images.

Synopsis

type T
value fromFunction
value toFunction
value fromPermutation
value fromCycles
value identity
value cycle
value inverse
value compose
value choose
value closure
value closureSlow

Packagenumeric-prelude-0.4.4
Exports12
LanguageHaskell98
LicenceBSD-3-Clause
SourceTable.hs

typetype T i = Array i i

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

valuetoFunction :: Ix i => T i -> i -> i

valuefromPermutation :: (Ix i, C p) => p i -> T i

valuefromCycles :: Ix i => (i, i) -> [[i]] -> T i

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

valuecycle :: Ix i => [i] -> T i -> T i

valueinverse :: Ix i => T i -> T i

valuecompose :: Ix i => T i -> T i -> T i

valuechoose :: 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.

valueclosure :: Ix i => [T i] -> [T i]

valueclosureSlow :: Ix i => [T i] -> [T i]