[commit: ghc] master: Docs: `sortOn = sortBy (comparing f)` [skip ci] (504c2ae)

[git at git.haskell.org]

Repository : ssh://git@git.haskell.org/ghc

On branch  : master
Link       : http://ghc.haskell.org/trac/ghc/changeset/504c2aeb8bf36e031c0751e33b85bab58680542e/ghc

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

commit 504c2aeb8bf36e031c0751e33b85bab58680542e
Author: Thomas Miedema <thomasmiedema at gmail.com>
Date:   Thu Jul 16 10:10:18 2015 +0200

    Docs: `sortOn = sortBy (comparing f)` [skip ci]


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

504c2aeb8bf36e031c0751e33b85bab58680542e
 libraries/base/Data/OldList.hs | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/libraries/base/Data/OldList.hs b/libraries/base/Data/OldList.hs
index 7e79c34..a377b4f 100644
--- a/libraries/base/Data/OldList.hs
+++ b/libraries/base/Data/OldList.hs
@@ -973,7 +973,7 @@ rqpart cmp x (y:ys) rle rgt r =
 #endif /* USE_REPORT_PRELUDE */
 
 -- | Sort a list by comparing the results of a key function applied to each
--- element.  @sortOn f@ is equivalent to @sortBy . comparing f@, but has the
+-- element.  @sortOn f@ is equivalent to @sortBy (comparing f)@, but has the
 -- performance advantage of only evaluating @f@ once for each element in the
 -- input list.  This is called the decorate-sort-undecorate paradigm, or
 -- Schwartzian transform.