Modulenumeric-prelude-0.4.4Haskell98

MathObj.Permutation.CycleList.Check

2 types
8 values

Packagenumeric-prelude-0.4.4
Exports10
LanguageHaskell98
LicenceBSD-3-Clause
SourceCheck.hs

newtypenewtype Cycle i

We shall make a little bit of a hack here, enabling us to use additive or multiplicative syntax for groups as we wish by simply instantiating Num with both operations corresponding to the group operation of the permutation group we're studying

There are quite a few way we could represent elements of permutation groups: the images in a row, a list of the cycles, et.c. All of these differ highly in how complex various operations end up being.

Constructors

Cycle
- cycle :: [i]

Instances3Eq, Read, Show

Eq i => Eq (Cycle i)Defined in numeric-prelude-0.4.4 · MathObj.Permutation.CycleList.Check
Read i => Read (Cycle i)Defined in numeric-prelude-0.4.4 · MathObj.Permutation.CycleList.Check
Show i => Show (Cycle i)Defined in numeric-prelude-0.4.4 · MathObj.Permutation.CycleList.Check

datadata T i

Constructors

Cons
- range :: (i, i)
- cycles :: [Cycle i]

Instances5Eq, Ord, Show, C

C TDefined in numeric-prelude-0.4.4 · MathObj.Permutation.CycleList.Check
Ix i => Eq (T i)Defined in numeric-prelude-0.4.4 · MathObj.Permutation.CycleList.Check
These instances may need more work They involve converting a permutation to a table.
Ix i => Ord (T i)Defined in numeric-prelude-0.4.4 · MathObj.Permutation.CycleList.Check
Show i => Show (T i)Defined in numeric-prelude-0.4.4 · MathObj.Permutation.CycleList.Check
Ix i => C (T i)Defined in numeric-prelude-0.4.4 · MathObj.Permutation.CycleList.Check

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

Does not check whether the input values are in range.

valuetoCycles :: T i -> [[i]]

valuetoTable :: Ix i => T i -> T i

valuefromTable :: Ix i => T i -> T i

valueerrIncompat :: a

valueliftCmpTable2 :: Ix i => (T i -> T i -> a) -> T i -> T i -> a

valueliftTable2 :: Ix i => (T i -> T i -> T i) -> T i -> T i -> T i

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