Various tweaks needed to get the source processed cleanly with Haddock.
22 files changed:
module Control.Arrow where
module Control.Arrow where
import Control.Monad
import Control.Monad.Fix
import Control.Monad
import Control.Monad.Fix
--
-- The Error monad.
--
--
-- The Error monad.
--
--- Rendered by Michael Weber <michael.weber@post.rwth-aachen.de>,
+-- Rendered by Michael Weber <mailto:michael.weber@post.rwth-aachen.de>,
-- inspired by the Haskell Monad Template Library from
-- inspired by the Haskell Monad Template Library from
--- \A[HREF="http://www.cse.ogi.edu/~andy"]{Andy Gill}}
+-- Andy Gill (<http://www.cse.ogi.edu/~andy>)
--
-----------------------------------------------------------------------------
--
-----------------------------------------------------------------------------
--- Inspired by the paper:
--- \em{Functional Programming with Overloading and
--- Higher-Order Polymorphism},
--- \A[HREF="http://www.cse.ogi.edu/~mpj"]{Mark P Jones},
--- Advanced School of Functional Programming, 1995.}
---
+-- Inspired by the paper
+-- /Functional Programming with Overloading and
+-- Higher-Order Polymorphism/,
+-- Mark P Jones (<http://www.cse.ogi.edu/~mpj>)
+-- Advanced School of Functional Programming, 1995.
-----------------------------------------------------------------------------
module Control.Monad.Fix (
-----------------------------------------------------------------------------
module Control.Monad.Fix (
--
-- The Identity monad.
--
--
-- The Identity monad.
--
--- Inspired by the paper:
--- \em{Functional Programming with Overloading and
--- Higher-Order Polymorphism},
--- \A[HREF="http://www.cse.ogi.edu/~mpj"]{Mark P Jones},
--- Advanced School of Functional Programming, 1995.}
+-- Inspired by the paper
+-- /Functional Programming with Overloading and
+-- Higher-Order Polymorphism/,
+-- Mark P Jones (<http://www.cse.ogi.edu/~mpj>)
+-- Advanced School of Functional Programming, 1995.
--
-----------------------------------------------------------------------------
--
-----------------------------------------------------------------------------
-- Declaration of the Monoid class,and instances for list and functions
--
-- Inspired by the paper
-- Declaration of the Monoid class,and instances for list and functions
--
-- Inspired by the paper
--- \em{Functional Programming with Overloading and
--- Higher-Order Polymorphism},
--- \A[HREF="http://www.cse.ogi.edu/~mpj"]{Mark P Jones},
--- Advanced School of Functional Programming, 1995.}
+-- /Functional Programming with Overloading and
+-- Higher-Order Polymorphism/,
+-- Mark P Jones (<http://www.cse.ogi.edu/~mpj>)
+-- Advanced School of Functional Programming, 1995.
-----------------------------------------------------------------------------
module Control.Monad.Monoid (
-----------------------------------------------------------------------------
module Control.Monad.Monoid (
--
-- Maintainer : libraries@haskell.org
-- Stability : experimental
--
-- Maintainer : libraries@haskell.org
-- Stability : experimental
--- Portability : non-portable ( requires mulit-parameter type classes,
--- requires functional dependencies )
+-- Portability : non-portable ( mulit-param classes, functional dependencies )
--
-- Declaration of the MonadRWS class.
--
-- Inspired by the paper
--
-- Declaration of the MonadRWS class.
--
-- Inspired by the paper
--- \em{Functional Programming with Overloading and
--- Higher-Order Polymorphism},
--- \A[HREF="http://www.cse.ogi.edu/~mpj"]{Mark P Jones},
--- Advanced School of Functional Programming, 1995.}
+-- /Functional Programming with Overloading and
+-- Higher-Order Polymorphism/,
+-- Mark P Jones (<http://www.cse.ogi.edu/~mpj>)
+-- Advanced School of Functional Programming, 1995.
-----------------------------------------------------------------------------
module Control.Monad.RWS (
-----------------------------------------------------------------------------
module Control.Monad.RWS (
--
-- Maintainer : libraries@haskell.org
-- Stability : experimental
--
-- Maintainer : libraries@haskell.org
-- Stability : experimental
--- Portability : non-portable ( requires mulit-parameter type classes,
--- requires functional dependencies )
+-- Portability : non-portable ( mulit-param classes, functional dependencies )
--
-- Declaration of the Monoid class,and instances for list and functions
--
-- Inspired by the paper
--
-- Declaration of the Monoid class,and instances for list and functions
--
-- Inspired by the paper
--- \em{Functional Programming with Overloading and
--- Higher-Order Polymorphism},
--- \A[HREF="http://www.cse.ogi.edu/~mpj"]{Mark P Jones},
--- Advanced School of Functional Programming, 1995.}
+-- /Functional Programming with Overloading and
+-- Higher-Order Polymorphism/,
+-- Mark P Jones (<http://www.cse.ogi.edu/~mpj>)
+-- Advanced School of Functional Programming, 1995.
-----------------------------------------------------------------------------
module Control.Monad.Reader (
-----------------------------------------------------------------------------
module Control.Monad.Reader (
--
-- Maintainer : libraries@haskell.org
-- Stability : experimental
--
-- Maintainer : libraries@haskell.org
-- Stability : experimental
--- Portability : non-portable ( requires mulit-parameter type classes,
--- requires functional dependencies )
+-- Portability : non-portable ( mulit-param classes, functional dependencies )
--
-- State monads.
--
-- Inspired by the paper
--
-- State monads.
--
-- Inspired by the paper
--- \em{Functional Programming with Overloading and
--- Higher-Order Polymorphism},
--- \A[HREF="http://www.cse.ogi.edu/~mpj"]{Mark P Jones},
--- Advanced School of Functional Programming, 1995.}
+-- /Functional Programming with Overloading and
+-- Higher-Order Polymorphism/,
+-- Mark P Jones (<http://www.cse.ogi.edu/~mpj>)
+-- Advanced School of Functional Programming, 1995.
-----------------------------------------------------------------------------
module Control.Monad.State (
-----------------------------------------------------------------------------
module Control.Monad.State (
-- The MonadTrans class.
--
-- Inspired by the paper
-- The MonadTrans class.
--
-- Inspired by the paper
--- \em{Functional Programming with Overloading and
--- Higher-Order Polymorphism},
--- \A[HREF="http://www.cse.ogi.edu/~mpj"]{Mark P Jones},
--- Advanced School of Functional Programming, 1995.}
+-- /Functional Programming with Overloading and
+-- Higher-Order Polymorphism/,
+-- Mark P Jones (<http://www.cse.ogi.edu/~mpj>)
+-- Advanced School of Functional Programming, 1995.
-----------------------------------------------------------------------------
module Control.Monad.Trans (
-----------------------------------------------------------------------------
module Control.Monad.Trans (
--
-- Maintainer : libraries@haskell.org
-- Stability : experimental
--
-- Maintainer : libraries@haskell.org
-- Stability : experimental
--- Portability : non-portable ( requires mulit-parameter type classes,
--- requires functional dependencies )
+-- Portability : non-portable ( mulit-param classes, functional dependencies )
--
-- The MonadWriter class.
--
-- Inspired by the paper
--
-- The MonadWriter class.
--
-- Inspired by the paper
--- \em{Functional Programming with Overloading and
--- Higher-Order Polymorphism},
--- \A[HREF="http://www.cse.ogi.edu/~mpj"]{Mark P Jones},
--- Advanced School of Functional Programming, 1995.}
+-- /Functional Programming with Overloading and
+-- Higher-Order Polymorphism/,
+-- Mark P Jones (<http://www.cse.ogi.edu/~mpj>)
+-- Advanced School of Functional Programming, 1995.
-----------------------------------------------------------------------------
module Control.Monad.Writer (
-----------------------------------------------------------------------------
module Control.Monad.Writer (
-- Stability : experimental
-- Portability : non-portable
--
-- Stability : experimental
-- Portability : non-portable
--
--- Mutable boxed/unboxed arrays in the IO monad.
+-- Mutable boxed and unboxed arrays in the IO monad.
--
-----------------------------------------------------------------------------
--
-----------------------------------------------------------------------------
-- Stability : experimental
-- Portability : non-portable
--
-- Stability : experimental
-- Portability : non-portable
--
--- Mutable boxed/unboxed arrays in the ST monad.
+-- Mutable boxed and unboxed arrays in the ST monad.
--
-----------------------------------------------------------------------------
--
-----------------------------------------------------------------------------
bottom = panic "emptyFM"
-}
bottom = panic "emptyFM"
-}
--- #define EmptyFM (Branch _ _ IF_GHC(0#,0) _ _)
+-- #define EmptyFM (Branch _ _ IF_GHC(0#,0) _ _)
unitFM key elt = Branch key elt IF_GHC(1#,1) emptyFM emptyFM
unitFM key elt = Branch key elt IF_GHC(1#,1) emptyFM emptyFM
--
-- The PackedString type, and associated operations.
--
--
-- The PackedString type, and associated operations.
--
--- Original GHC implementation by Bryan O'Sullivan,
+-- Original GHC implementation by Bryan O\'Sullivan,
-- rewritten to use UArray by Simon Marlow.
--
-----------------------------------------------------------------------------
-- rewritten to use UArray by Simon Marlow.
--
-----------------------------------------------------------------------------
import System.Random
import Data.List( group, sort, intersperse )
import Control.Monad( liftM2, liftM3, liftM4 )
import System.Random
import Data.List( group, sort, intersperse )
import Control.Monad( liftM2, liftM3, liftM4 )
, bottom -- :: a {- _|_ -}
) where
, bottom -- :: a {- _|_ -}
) where
import System.Random
import Control.Concurrent
import Control.Exception hiding (catch, evaluate)
import System.Random
import Control.Concurrent
import Control.Exception hiding (catch, evaluate)
import Debug.QuickCheck
import Debug.QuickCheck.Utils
import Debug.QuickCheck
import Debug.QuickCheck.Utils
import Debug.QuickCheck
isAssociativeBy :: (Show a,Testable prop)
import Debug.QuickCheck
isAssociativeBy :: (Show a,Testable prop)
import GHC.Show
import GHC.List
import GHC.Read
import GHC.Show
import GHC.List
import GHC.Read
import {-# SOURCE #-} Data.Dynamic
import {-# SOURCE #-} Data.Dynamic
-- ---------------------------------------------------------------------------
-- The IO Monad
-- ---------------------------------------------------------------------------
-- The IO Monad
-- effects. For output, items are written out from the internal
-- buffer according to the buffer mode:
--
-- effects. For output, items are written out from the internal
-- buffer according to the buffer mode:
--
--- * line-buffering the entire output buffer is written
+-- o line-buffering the entire output buffer is written
-- out whenever a newline is output, the output buffer overflows,
-- a flush is issued, or the handle is closed.
--
-- out whenever a newline is output, the output buffer overflows,
-- a flush is issued, or the handle is closed.
--
--- * block-buffering the entire output buffer is written out whenever
+-- o block-buffering the entire output buffer is written out whenever
-- it overflows, a flush is issued, or the handle
-- is closed.
--
-- it overflows, a flush is issued, or the handle
-- is closed.
--
--- * no-buffering output is written immediately, and never stored
+-- o no-buffering output is written immediately, and never stored
-- in the output buffer.
--
-- The output buffer is emptied as soon as it has been written out.
-- Similarly, input occurs according to the buffer mode for handle {\em hdl}.
-- in the output buffer.
--
-- The output buffer is emptied as soon as it has been written out.
-- Similarly, input occurs according to the buffer mode for handle {\em hdl}.
--- * line-buffering when the input buffer for the handle is not empty,
+-- o line-buffering when the input buffer for the handle is not empty,
-- the next item is obtained from the buffer;
-- otherwise, when the input buffer is empty,
-- characters up to and including the next newline
-- the next item is obtained from the buffer;
-- otherwise, when the input buffer is empty,
-- characters up to and including the next newline
-- are available until the newline character is
-- available.
--
-- are available until the newline character is
-- available.
--
--- * block-buffering when the input buffer for the handle becomes empty,
+-- o block-buffering when the input buffer for the handle becomes empty,
-- the next block of data is read into this buffer.
--
-- the next block of data is read into this buffer.
--
--- * no-buffering the next input item is read and returned.
+-- o no-buffering the next input item is read and returned.
-- For most implementations, physical files will normally be block-buffered
-- and terminals will normally be line-buffered. (the IO interface provides
-- For most implementations, physical files will normally be block-buffered
-- and terminals will normally be line-buffered. (the IO interface provides
-- Stability : experimental
-- Portability : portable
--
-- Stability : experimental
-- Portability : portable
--
--- A Haskell port of GNU's getopt library
+-- A Haskell port of the GNU getopt library
--
-----------------------------------------------------------------------------
--
-----------------------------------------------------------------------------
-- Portability : portable
--
-- Misc information about the characteristics of the host
-- Portability : portable
--
-- Misc information about the characteristics of the host
--- architecture/machine lucky enough to run your program.
+-- architecture\/machine lucky enough to run your program.
--
-----------------------------------------------------------------------------
--
-----------------------------------------------------------------------------
-- Stability : provisional
-- Portability : portable
--
-- Stability : provisional
-- Portability : portable
--
--- John Hughes's and Simon Peyton Jones's Pretty Printer Combinators
+-- John Hughes\'s and Simon Peyton Jones\'s Pretty Printer Combinators
--- Based on "The Design of a Pretty-printing Library"
+-- Based on /The Design of a Pretty-printing Library/
-- in Advanced Functional Programming,
-- Johan Jeuring and Erik Meijer (eds), LNCS 925
-- in Advanced Functional Programming,
-- Johan Jeuring and Erik Meijer (eds), LNCS 925
--- http://www.cs.chalmers.se/~rjmh/Papers/pretty.ps
+-- <http://www.cs.chalmers.se/~rjmh/Papers/pretty.ps>
--
-- Heavily modified by Simon Peyton Jones, Dec 96
--
--
-- Heavily modified by Simon Peyton Jones, Dec 96
--