X-Git-Url: http://git.megacz.com/?a=blobdiff_plain;f=GHC%2FNum.lhs;h=9a81c90a335f2f6c5c49ffc9e2746c8886d8d5e8;hb=1f9683c29eb02924ddf1866186c5b3164b67774a;hp=bfc54589cf315bb66e7fd146771bfd12dfd28a0d;hpb=de59ad189974c1a3b984f41d609e38a60f65b06a;p=ghc-base.git diff --git a/GHC/Num.lhs b/GHC/Num.lhs index bfc5458..9a81c90 100644 --- a/GHC/Num.lhs +++ b/GHC/Num.lhs @@ -7,7 +7,7 @@ -- Module : GHC.Num -- Copyright : (c) The University of Glasgow 1994-2002 -- License : see libraries/base/LICENSE --- +-- -- Maintainer : cvs-ghc@haskell.org -- Stability : internal -- Portability : non-portable (GHC Extensions) @@ -41,7 +41,7 @@ import GHC.Integer infixl 7 * infixl 6 +, - -default () -- Double isn't available yet, +default () -- Double isn't available yet, -- and we shouldn't be using defaults anyway \end{code} @@ -62,7 +62,7 @@ class (Eq a, Show a) => Num a where -- | Absolute value. abs :: a -> a -- | Sign of a number. - -- The functions 'abs' and 'signum' should satisfy the law: + -- The functions 'abs' and 'signum' should satisfy the law: -- -- > abs x * signum x == x -- @@ -122,27 +122,6 @@ divModInt x@(I# _) y@(I# _) = (x `divInt` y, x `modInt` y) %********************************************************* %* * -\subsection{The @Integer@ instances for @Eq@, @Ord@} -%* * -%********************************************************* - -\begin{code} -instance Eq Integer where - (==) = eqInteger - (/=) = neqInteger - ------------------------------------------------------------------------- -instance Ord Integer where - (<=) = leInteger - (>) = gtInteger - (<) = ltInteger - (>=) = geInteger - compare = compareInteger -\end{code} - - -%********************************************************* -%* * \subsection{The @Integer@ instances for @Show@} %* * %*********************************************************