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.

1 files changed, 2 insertions, 3 deletions

diff --git a/libraries/base/Data/Traversable.hs b/libraries/base/Data/Traversable.hs
index 1c8b605f09..b78aa291a6 100644
--- a/libraries/base/Data/Traversable.hs
+++ b/libraries/base/Data/Traversable.hs
@@ -61,8 +61,6 @@ import qualified GHC.List as List ( foldr )
 -- | Functors representing data structures that can be traversed from
 -- left to right.
 --
--- Minimal complete definition: 'traverse' or 'sequenceA'.
---
 -- A definition of 'traverse' must satisfy the following laws:
 --
 -- [/naturality/]
@@ -144,6 +142,8 @@ import qualified GHC.List as List ( foldr )
 --    ('foldMapDefault').
 --
 class (Functor t, Foldable t) => Traversable t where
+    {-# MINIMAL traverse | sequenceA #-}
+
     -- | Map each element of a structure to an action, evaluate
     -- these actions from left to right, and collect the results.
     traverse :: Applicative f => (a -> f b) -> t a -> f (t b)
@@ -163,7 +163,6 @@ class (Functor t, Foldable t) => Traversable t where
     -- and collect the results.
     sequence :: Monad m => t (m a) -> m (t a)
     sequence = sequenceA
-    {-# MINIMAL traverse | sequenceA #-}
 
 -- instances for Prelude types