Number.ResidueClass.Check

Documentation

data T a

The best solution seems to let modulus be part of the type. This could happen with a phantom type for modulus and a run function like runST. Then operations with non-matching moduli could be detected at compile time and zero and one could be generated with the correct modulus. An alternative trial can be found in module ResidueClassMaybe.

Constructors

Cons infix 7

Fields

• modulus :: !a
• representative :: !a

Instances

Eq a => Eq (T a)

Defined in Number.ResidueClass.Check

Methods

(==) :: T a -> T a -> Bool

(/=) :: T a -> T a -> Bool

(Read a, C a) => Read (T a)

Defined in Number.ResidueClass.Check

Methods

readsPrec :: Int -> ReadS (T a)

readList :: ReadS [T a]

readPrec :: ReadPrec (T a)

readListPrec :: ReadPrec [T a]

Show a => Show (T a)

Defined in Number.ResidueClass.Check

Methods

showsPrec :: Int -> T a -> ShowS

show :: T a -> String

showList :: [T a] -> ShowS

(Eq a, C a) => C (T a)

Defined in Number.ResidueClass.Check

Methods

zero :: T a

(+) :: T a -> T a -> T a

(-) :: T a -> T a -> T a

negate :: T a -> T a

C a => C (T a)

Defined in Number.ResidueClass.Check

Methods

isZero :: T a -> Bool

(Eq a, C a) => C (T a)

Defined in Number.ResidueClass.Check

Methods

(*) :: T a -> T a -> T a

one :: T a

fromInteger :: Integer -> T a

(^) :: T a -> Integer -> T a

(Eq a, C a) => C (T a)

Defined in Number.ResidueClass.Check

Methods

(/) :: T a -> T a -> T a

recip :: T a -> T a

fromRational' :: Rational -> T a

(^-) :: T a -> Integer -> T a

factorPrec :: Int

(/:) :: C a => a -> a -> T a infix 7

r /: m is the residue class containing r with respect to the modulus m

isCompatible :: Eq a => T a -> T a -> Bool

Check if two residue classes share the same modulus

maybeCompatible :: Eq a => T a -> T a -> Maybe a

fromRepresentative :: C a => a -> a -> T a

lift1 :: Eq a => (a -> a -> a) -> T a -> T a

lift2 :: Eq a => (a -> a -> a -> a) -> T a -> T a -> T a

errIncompat :: a

zero :: C a => a -> T a

one :: C a => a -> T a

fromInteger :: C a => a -> Integer -> T a