Add Data.Ord and Data.Eq. Data.Ord also exports the new function
'comparing', as discussed on the libraries list a while back.
--- /dev/null
+{-# OPTIONS_GHC -fno-implicit-prelude #-}
+-----------------------------------------------------------------------------
+-- |
+-- Module : Data.Eq
+-- Copyright : (c) The University of Glasgow 2005
+-- License : BSD-style (see the file libraries/base/LICENSE)
+--
+-- Maintainer : libraries@haskell.org
+-- Stability : stable
+-- Portability : portable
+--
+-- Equality
+--
+-----------------------------------------------------------------------------
+
+module Data.Eq (
+ Eq(..),
+ ) where
+
+#if __GLASGOW_HASKELL__
+import GHC.Base
+#endif
--- /dev/null
+{-# OPTIONS_GHC -fno-implicit-prelude #-}
+-----------------------------------------------------------------------------
+-- |
+-- Module : Data.Ord
+-- Copyright : (c) The University of Glasgow 2005
+-- License : BSD-style (see the file libraries/base/LICENSE)
+--
+-- Maintainer : libraries@haskell.org
+-- Stability : stable
+-- Portability : portable
+--
+-- Orderings
+--
+-----------------------------------------------------------------------------
+
+module Data.Ord (
+ Ord(..),
+ Ordering,
+ comparing,
+ ) where
+
+#if __GLASGOW_HASKELL__
+import GHC.Base
+#endif
+
+comparing :: (Ord a) => (b -> a) -> b -> b -> Ordering
+comparing p x y = compare (p x) (p y)
import Hugs.Prelude
#endif
+import Data.Eq
+import Data.Ord
+
#ifndef __HUGS__
infixr 0 $!
-
-- -----------------------------------------------------------------------------
-- Miscellaneous functions
Data.Complex,
Data.Dynamic,
Data.Either,
+ Data.Eq,
Data.FiniteMap,
Data.FunctorM,
-- Data.Generics,
Data.Maybe,
Data.Map,
Data.Monoid,
+ Data.Ord,
Data.PackedString,
Data.Queue,
Data.Ratio,
Data.Complex,
Data.Dynamic,
Data.Either,
+ Data.Eq,
Data.FiniteMap,
Data.FunctorM,
Data.Generics,
Data.Maybe,
Data.Map,
Data.Monoid,
+ Data.Ord,
Data.PackedString,
Data.Queue,
Data.Ratio,