From b6ef4d7236a944f4ffed7aaa0fa8fcfe18cb77b9 Mon Sep 17 00:00:00 2001 From: panne Date: Sat, 10 Jan 2004 12:53:43 +0000 Subject: [PATCH] [project @ 2004-01-10 12:53:42 by panne] Haddock fixes --- Control/Parallel/Strategies.hs | 5 +++++ Data/Generics/Aliases.hs | 6 +++--- Data/Generics/Basics.hs | 5 +++-- Data/Generics/Reify.hs | 16 ++++++++-------- Data/Generics/Schemes.hs | 4 +++- Data/Generics/Text.hs | 5 +++-- Data/Generics/Twins.hs | 5 +++-- 7 files changed, 28 insertions(+), 18 deletions(-) diff --git a/Control/Parallel/Strategies.hs b/Control/Parallel/Strategies.hs index 9ef4968..294239b 100644 --- a/Control/Parallel/Strategies.hs +++ b/Control/Parallel/Strategies.hs @@ -18,6 +18,11 @@ module Control.Parallel.Strategies where -- -- Phil Trinder, Hans-Wolfgang Loidl, Kevin Hammond et al. -- + +#ifdef __HADDOCK__ +import Prelude +#endif + import Control.Parallel as Parallel import Data.Ix import Data.Array diff --git a/Data/Generics/Aliases.hs b/Data/Generics/Aliases.hs index c3badad..5ab0859 100644 --- a/Data/Generics/Aliases.hs +++ b/Data/Generics/Aliases.hs @@ -45,12 +45,12 @@ module Data.Generics.Aliases ( ) where - +#ifdef __HADDOCK__ +import Prelude +#endif import Control.Monad import Data.Generics.Basics - - ------------------------------------------------------------------------------ -- -- Combinators to "make" generic functions diff --git a/Data/Generics/Basics.hs b/Data/Generics/Basics.hs index 7e7cf7c..c03dff1 100644 --- a/Data/Generics/Basics.hs +++ b/Data/Generics/Basics.hs @@ -61,12 +61,13 @@ module Data.Generics.Basics ( ------------------------------------------------------------------------------ - +#ifdef __HADDOCK__ +import Prelude +#endif import Data.Typeable import Data.Maybe import Control.Monad - ------------------------------------------------------------------------------ -- -- The Data class diff --git a/Data/Generics/Reify.hs b/Data/Generics/Reify.hs index 867a552..a5f5244 100644 --- a/Data/Generics/Reify.hs +++ b/Data/Generics/Reify.hs @@ -55,13 +55,13 @@ module Data.Generics.Reify ( ------------------------------------------------------------------------------ - +#ifdef __HADDOCK__ +import Prelude +#endif import Data.Generics.Basics import Data.Generics.Aliases import Data.Generics.Schemes - - ------------------------------------------------------------- -- -- Types as values @@ -276,7 +276,7 @@ unGTypeFun' (GTypeFun' f) = f -- | Query all immediate subterm types. --- There is an extra argument to "constant out" the type at hand. +-- There is an extra argument to \"constant out\" the type at hand. -- This can be used to avoid cycles. gmapSubtermTypesConst :: (Data a, Typeable r) @@ -318,7 +318,7 @@ _gmapSubtermTypes o (r::r) f -- | Reachability relation on types, i.e., --- test if nodes of type "a" are reachable from nodes of type "b". +-- test if nodes of type @a@ are reachable from nodes of type @b@. -- The relation is defined to be reflexive. reachableType :: (Data a, Data b) => TypeVal a -> TypeVal b -> Bool @@ -330,8 +330,8 @@ reachableType (a::TypeVal a) (b::TypeVal b) -- | Depth of a datatype as the constructor with the minimum depth. --- The outermost "Nothing" denotes a type without constructors. --- The innermost "Nothing" denotes potentially infinite. +-- The outermost 'Nothing' denotes a type without constructors. +-- The innermost 'Nothing' denotes potentially infinite. depthOfType :: GTypeFun Bool -> GTypeFun (Maybe (Constr, Maybe Int)) depthOfType p (t::TypeVal a) @@ -360,7 +360,7 @@ depthOfType p (t::TypeVal a) -- | Depth of a constructor. -- Depth is viewed as the maximum depth of all subterm types + 1. --- "Nothing" denotes potentially infinite. +-- 'Nothing' denotes potentially infinite. depthOfConstr :: GTypeFun Bool -> GTypeFun (Constr -> Maybe Int) depthOfConstr p (t::TypeVal a) c diff --git a/Data/Generics/Schemes.hs b/Data/Generics/Schemes.hs index f88445c..5ee9b3a 100644 --- a/Data/Generics/Schemes.hs +++ b/Data/Generics/Schemes.hs @@ -30,12 +30,14 @@ module Data.Generics.Schemes ( ------------------------------------------------------------------------------ +#ifdef __HADDOCK__ +import Prelude +#endif import Data.Generics.Basics import Data.Generics.Aliases import Control.Monad - -- | Apply a transformation everywhere in bottom-up manner everywhere :: (forall a. Data a => a -> a) -> (forall a. Data a => a -> a) diff --git a/Data/Generics/Text.hs b/Data/Generics/Text.hs index 87b0828..ccef471 100644 --- a/Data/Generics/Text.hs +++ b/Data/Generics/Text.hs @@ -23,7 +23,9 @@ module Data.Generics.Text ( ------------------------------------------------------------------------------ - +#ifdef __HADDOCK__ +import Prelude +#endif import Control.Monad import Data.Maybe import Data.Typeable @@ -31,7 +33,6 @@ import Data.Generics.Basics import Data.Generics.Aliases import Text.ParserCombinators.ReadP - ------------------------------------------------------------------------------ diff --git a/Data/Generics/Twins.hs b/Data/Generics/Twins.hs index 2ab33ae..08a1b03 100644 --- a/Data/Generics/Twins.hs +++ b/Data/Generics/Twins.hs @@ -34,11 +34,12 @@ module Data.Generics.Twins ( ------------------------------------------------------------------------------ - +#ifdef __HADDOCK__ +import Prelude +#endif import Data.Generics.Basics import Data.Generics.Aliases - ------------------------------------------------------------------------------ -- 1.7.10.4