Modulo-0.2.0.1: Modular arithmetic via Numeric-Prelude

Safe HaskellNone

Number.Modulo

Synopsis

Documentation

newtype Mod a Source

Constructors

Mod (a -> a) 

Instances

(C a, C a, C a) => Num (Mod a) 
(Show a, Bounded a) => Show (Mod a) 
(C a, C a, C a, Eq a, C a) => C (Mod a) 
(C a, C a, C a) => C (Mod a) 
(C a, C a, Eq a) => C (Mod a) 
(C a, C a) => C (Mod a) 
(C a, C a) => C (Mod a) 

sq :: C a => a -> a -> aSource

pow :: (Num a1, C a1, C a) => (t -> a -> a) -> (t -> t) -> t -> a1 -> aSource

modulo :: Mod t -> t -> tSource

Calculate x modulo n

(===) :: Eq a => t -> t -> (t -> a) -> BoolSource

n :: Mod IntegerSource

Examples