diff options
| author | Herbert Valerio Riedel <hvr@gnu.org> | 2014-11-04 11:43:29 +0100 |
|---|---|---|
| committer | Herbert Valerio Riedel <hvr@gnu.org> | 2014-11-04 11:53:58 +0100 |
| commit | 1408c8dcd4ccf3c4f418ca8dd13516efb604922f (patch) | |
| tree | 4864fe79ef54328f3d6ef3992af71d0482e427dc /libraries/base/Control | |
| parent | fe178b2729bb044b401b3fe670d12bcd3d14ad71 (diff) | |
| download | haskell-1408c8dcd4ccf3c4f418ca8dd13516efb604922f.tar.gz | |
Remove redundant "Minimal complete definition"-comments
Those manual descriptions in Haddock strings have become redundant since
Haddock gained the ability to print the minimal complete definition as
specified via `{-# MINIMAL #-}` annotation (or otherwise inferred by
GHC).
Moreover, this commit moves all `{-# MINIMAL #-}` annotations in `base`
to the start of the respective `class` definitions, as this is more
readable and matches more closely the way Haddock renders that
information.
Diffstat (limited to 'libraries/base/Control')
| -rw-r--r-- | libraries/base/Control/Arrow.hs | 4 | ||||
| -rw-r--r-- | libraries/base/Control/Monad/Zip.hs | 2 |
2 files changed, 3 insertions, 3 deletions
diff --git a/libraries/base/Control/Arrow.hs b/libraries/base/Control/Arrow.hs index d5ea9f82be..9c55d0f674 100644 --- a/libraries/base/Control/Arrow.hs +++ b/libraries/base/Control/Arrow.hs @@ -58,7 +58,7 @@ infixr 1 ^<<, <<^ -- | The basic arrow class. -- --- Minimal complete definition: 'arr' and 'first', satisfying the laws +-- Instances should satisfy the following laws: -- -- * @'arr' id = 'id'@ -- @@ -192,7 +192,7 @@ instance MonadPlus m => ArrowPlus (Kleisli m) where -- | Choice, for arrows that support it. This class underlies the -- @if@ and @case@ constructs in arrow notation. -- --- Minimal complete definition: 'left', satisfying the laws +-- Instances should satisfy the following laws: -- -- * @'left' ('arr' f) = 'arr' ('left' f)@ -- diff --git a/libraries/base/Control/Monad/Zip.hs b/libraries/base/Control/Monad/Zip.hs index 197951e6e9..df096b1e81 100644 --- a/libraries/base/Control/Monad/Zip.hs +++ b/libraries/base/Control/Monad/Zip.hs @@ -34,6 +34,7 @@ import Control.Monad (liftM) -- > munzip (mzip ma mb) = (ma, mb) -- class Monad m => MonadZip m where + {-# MINIMAL mzip | mzipWith #-} mzip :: m a -> m b -> m (a,b) mzip = mzipWith (,) @@ -46,7 +47,6 @@ class Monad m => MonadZip m where -- munzip is a member of the class because sometimes -- you can implement it more efficiently than the -- above default code. See Trac #4370 comment by giorgidze - {-# MINIMAL mzip | mzipWith #-} instance MonadZip [] where mzip = zip |