[commit: base] ghc-7.6: Clarify the wording of the 'insert' haddock; fixes #7421 (c4dec49)

[Ian Lynagh]

Repository : ssh://darcs.haskell.org//srv/darcs/packages/base

On branch  : ghc-7.6

http://hackage.haskell.org/trac/ghc/changeset/c4dec4948fc0b1185404e2a6d66aec25aa293b9f

>---------------------------------------------------------------

commit c4dec4948fc0b1185404e2a6d66aec25aa293b9f
Author: Ian Lynagh <ian at well-typed.com>
Date:   Wed Jan 2 21:42:22 2013 +0000

    Clarify the wording of the 'insert' haddock; fixes #7421
    
    Wording suggested by Bart Massey.

>---------------------------------------------------------------

 Data/List.hs |    2 +-
 1 files changed, 1 insertions(+), 1 deletions(-)

diff --git a/Data/List.hs b/Data/List.hs
index 7b06dae..a60e0e3 100644
--- a/Data/List.hs
+++ b/Data/List.hs
@@ -509,7 +509,7 @@ mapAccumR f s (x:xs)    =  (s'', y:ys)
                                  (s', ys) = mapAccumR f s xs
 
 -- | The 'insert' function takes an element and a list and inserts the
--- element into the list at the last position where it is still less
+-- element into the list at the first position where it is less
 -- than or equal to the next element.  In particular, if the list
 -- is sorted before the call, the result will also be sorted.
 -- It is a special case of 'insertBy', which allows the programmer to