diff options
| author | Ian Lynagh <ian@well-typed.com> | 2013-01-02 21:42:22 +0000 |
|---|---|---|
| committer | Ian Lynagh <ian@well-typed.com> | 2013-01-02 21:42:22 +0000 |
| commit | f6ee55a831c654ab2a6ca6fe7ac73797e1489381 (patch) | |
| tree | fce3a8e4b831b88fb286897314b07af237f33fbc /libraries/base/Data/List.hs | |
| parent | 5e3aec6968af95ac55e24366c70f607eb9a85d6d (diff) | |
| download | haskell-f6ee55a831c654ab2a6ca6fe7ac73797e1489381.tar.gz | |
Clarify the wording of the 'insert' haddock; fixes #7421
Wording suggested by Bart Massey.
Diffstat (limited to 'libraries/base/Data/List.hs')
| -rw-r--r-- | libraries/base/Data/List.hs | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/libraries/base/Data/List.hs b/libraries/base/Data/List.hs index efd0fd105e..0049237aac 100644 --- a/libraries/base/Data/List.hs +++ b/libraries/base/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 |