From: panne
Date: Tue, 8 Jul 2003 15:46:42 +0000 (+0000)
Subject: [project @ 2003-07-08 15:46:40 by panne]
X-Git-Tag: nhc98-1-18-release~595
X-Git-Url: http://git.haskell.org/packages/base.git/commitdiff_plain/f0d03cbf416d6c3beb984b313f0c7196ec32a929
[project @ 2003-07-08 15:46:40 by panne]
Fixed some Haddock links.
---
diff --git a/Control/Monad/State.hs b/Control/Monad/State.hs
index f118849..3fec375 100644
--- a/Control/Monad/State.hs
+++ b/Control/Monad/State.hs
@@ -278,8 +278,8 @@ instance (Monoid w, MonadState s m) => MonadState s (WriterT w m) where
-- > plus n x = execState (sequence $ replicate n tick) x
--
-- An example from /The Craft of Functional Programming/, Simon
--- Thompson (),
--- Addison-wesley 1999: \"Given an arbitrary tree, transform it to a
+-- Thompson (),
+-- Addison-Wesley 1999: \"Given an arbitrary tree, transform it to a
-- tree of integers in which the original elements are replaced by
-- natural numbers, starting from 0. The same element has to be
-- replaced by the same number at every occurrence, and when we meet
diff --git a/Data/Generics.hs b/Data/Generics.hs
index 4132aa2..c14d965 100644
--- a/Data/Generics.hs
+++ b/Data/Generics.hs
@@ -9,7 +9,7 @@
-- Portability : non-portable
--
-- Generic programming in Haskell;
--- see .
+-- see .
--
-----------------------------------------------------------------------------
@@ -107,7 +107,7 @@ import Control.Monad
type GenericT = forall a. Data a => a -> a
--- | Generic queries of type "r",
+-- | Generic queries of type \"r\",
-- i.e., take any \"a\" and return an \"r\"
--
type GenericQ r = forall a. Data a => a -> r
@@ -174,7 +174,7 @@ use a point-free style whenever possible.
-- | Make a generic monadic transformation for MonadPlus;
--- use "const mzero" (i.e., failure) instead of return as default.
+-- use \"const mzero\" (i.e., failure) instead of return as default.
--
mkF :: (Typeable a, Typeable b, Typeable (m a), Typeable (m b), MonadPlus m)
=> (b -> m b) -> a -> m a
@@ -643,7 +643,7 @@ gtypecount :: Typeable a => (a -> ()) -> GenericQ Int
gtypecount f = gcount (False `mkQ` (const True . f))
--- | Generic show: an alternative to "deriving Show"
+-- | Generic show: an alternative to \"deriving Show\"
gshow :: Data a => a -> String
-- This is a prefix-show using surrounding "(" and ")",
@@ -657,7 +657,7 @@ gshow = ( \t ->
) `extQ` (show :: String -> String)
--- | Generic equality: an alternative to "deriving Eq"
+-- | Generic equality: an alternative to \"deriving Eq\"
geq :: Data a => a -> a -> Bool
{-
@@ -702,7 +702,7 @@ newtype GRead i a = GRead (i -> Maybe (a, i))
unGRead (GRead x) = x
--- | Generic read: an alternative to "deriving Read"
+-- | Generic read: an alternative to \"deriving Read\"
gread :: GenericB Maybe String
{-
diff --git a/Data/List.hs b/Data/List.hs
index da58031..3e2bead 100644
--- a/Data/List.hs
+++ b/Data/List.hs
@@ -520,7 +520,7 @@ deleteFirstsBy eq = foldl (flip (deleteBy eq))
-- | The 'group' function takes a list and returns a list of lists such
-- that the concatenation of the result is equal to the argument. Moreover,
-- each sublist in the result contains only equal elements. For example,
--- when applied to the string `Mississippi', the result is @["M","i","ss","i","ss","i","pp","i"]@.
+-- when applied to the string \"Mississippi\", the result is @[\"M\",\"i\",\"ss\",\"i\",\"ss\",\"i\",\"pp\",\"i\"]@.
group :: (Eq a) => [a] -> [[a]]
group = groupBy (==)