summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
-rw-r--r--libraries/base/Control/Category.hs3
-rw-r--r--libraries/base/Data/Monoid.hs14
-rw-r--r--libraries/base/GHC/Desugar.hs2
-rw-r--r--libraries/base/GHC/Err.lhs2
-rw-r--r--libraries/base/GHC/Read.lhs2
-rw-r--r--libraries/base/Text/ParserCombinators/ReadP.hs2
-rw-r--r--libraries/base/Text/Read/Lex.hs2
7 files changed, 0 insertions, 27 deletions
diff --git a/libraries/base/Control/Category.hs b/libraries/base/Control/Category.hs
index b06155fe6a..e7eeb1d969 100644
--- a/libraries/base/Control/Category.hs
+++ b/libraries/base/Control/Category.hs
@@ -40,10 +40,7 @@ class Category cat where
instance Category (->) where
id = Prelude.id
-#ifndef __HADDOCK__
--- Haddock 1.x cannot parse this:
(.) = (Prelude..)
-#endif
-- | Right-to-left composition
(<<<) :: Category cat => cat b c -> cat a b -> cat a c
diff --git a/libraries/base/Data/Monoid.hs b/libraries/base/Data/Monoid.hs
index bb3c4ecb1c..90bd437b10 100644
--- a/libraries/base/Data/Monoid.hs
+++ b/libraries/base/Data/Monoid.hs
@@ -235,14 +235,7 @@ instance Monoid a => Monoid (Maybe a) where
-- | Maybe monoid returning the leftmost non-Nothing value.
newtype First a = First { getFirst :: Maybe a }
-#ifndef __HADDOCK__
deriving (Eq, Ord, Read, Show)
-#else /* __HADDOCK__ */
-instance Eq a => Eq (First a)
-instance Ord a => Ord (First a)
-instance Read a => Read (First a)
-instance Show a => Show (First a)
-#endif
instance Monoid (First a) where
mempty = First Nothing
@@ -251,14 +244,7 @@ instance Monoid (First a) where
-- | Maybe monoid returning the rightmost non-Nothing value.
newtype Last a = Last { getLast :: Maybe a }
-#ifndef __HADDOCK__
deriving (Eq, Ord, Read, Show)
-#else /* __HADDOCK__ */
-instance Eq a => Eq (Last a)
-instance Ord a => Ord (Last a)
-instance Read a => Read (Last a)
-instance Show a => Show (Last a)
-#endif
instance Monoid (Last a) where
mempty = Last Nothing
diff --git a/libraries/base/GHC/Desugar.hs b/libraries/base/GHC/Desugar.hs
index 6a5562f7fe..d4da1c86c8 100644
--- a/libraries/base/GHC/Desugar.hs
+++ b/libraries/base/GHC/Desugar.hs
@@ -27,9 +27,7 @@ import Control.Category ((.))
import Data.Data (Data)
-- A version of Control.Category.>>> overloaded on Arrow
-#ifndef __HADDOCK__
(>>>) :: forall arr. Arrow arr => forall a b c. arr a b -> arr b c -> arr a c
-#endif
-- NB: the type of this function is the "shape" that GHC expects
-- in tcInstClassOp. So don't put all the foralls at the front!
-- Yes, this is a bit grotesque, but heck it works and the whole
diff --git a/libraries/base/GHC/Err.lhs b/libraries/base/GHC/Err.lhs
index 348f17c7d3..5352a06983 100644
--- a/libraries/base/GHC/Err.lhs
+++ b/libraries/base/GHC/Err.lhs
@@ -34,10 +34,8 @@ module GHC.Err
, undefined -- :: a
) where
-#ifndef __HADDOCK__
import GHC.Types
import GHC.Exception
-#endif
\end{code}
%*********************************************************
diff --git a/libraries/base/GHC/Read.lhs b/libraries/base/GHC/Read.lhs
index fcbdb8e8b9..cea761b0b8 100644
--- a/libraries/base/GHC/Read.lhs
+++ b/libraries/base/GHC/Read.lhs
@@ -64,9 +64,7 @@ import Text.ParserCombinators.ReadPrec
import Data.Maybe
-#ifndef __HADDOCK__
import {-# SOURCE #-} GHC.Unicode ( isDigit )
-#endif
import GHC.Num
import GHC.Real
import GHC.Float ()
diff --git a/libraries/base/Text/ParserCombinators/ReadP.hs b/libraries/base/Text/ParserCombinators/ReadP.hs
index 34247120f1..cfcb3bda07 100644
--- a/libraries/base/Text/ParserCombinators/ReadP.hs
+++ b/libraries/base/Text/ParserCombinators/ReadP.hs
@@ -82,9 +82,7 @@ module Text.ParserCombinators.ReadP
import Control.Monad( MonadPlus(..), sequence, liftM2 )
#ifdef __GLASGOW_HASKELL__
-#ifndef __HADDOCK__
import {-# SOURCE #-} GHC.Unicode ( isSpace )
-#endif
import GHC.List ( replicate, null )
import GHC.Base
#else
diff --git a/libraries/base/Text/Read/Lex.hs b/libraries/base/Text/Read/Lex.hs
index e4563b6e98..e0573bf1ad 100644
--- a/libraries/base/Text/Read/Lex.hs
+++ b/libraries/base/Text/Read/Lex.hs
@@ -37,9 +37,7 @@ import Text.ParserCombinators.ReadP
import GHC.Base
import GHC.Num( Num(..), Integer )
import GHC.Show( Show(..) )
-#ifndef __HADDOCK__
import {-# SOURCE #-} GHC.Unicode ( isSpace, isAlpha, isAlphaNum )
-#endif
import GHC.Real( Integral, Rational, (%), fromIntegral,
toInteger, (^), infinity, notANumber )
import GHC.List