Repository : ssh://darcs.haskell.org//srv/darcs/packages/base On branch : master
http://hackage.haskell.org/trac/ghc/changeset/08f3e69e34a889c8b85513b243935665a000bfac >--------------------------------------------------------------- commit 08f3e69e34a889c8b85513b243935665a000bfac Author: Ian Lynagh <[email protected]> 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 efd0fd1..0049237 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 _______________________________________________ Cvs-libraries mailing list [email protected] http://www.haskell.org/mailman/listinfo/cvs-libraries
