diff options
| author | Thomas Miedema <thomasmiedema@gmail.com> | 2015-07-16 10:10:18 +0200 |
|---|---|---|
| committer | Thomas Miedema <thomasmiedema@gmail.com> | 2015-07-16 10:10:46 +0200 |
| commit | 504c2aeb8bf36e031c0751e33b85bab58680542e (patch) | |
| tree | 845756238c97df392a37cc40f60bf6e51083c58c /libraries/base/Data | |
| parent | 74a00bc8f96069f7205f091a02f3c571362f9522 (diff) | |
| download | haskell-504c2aeb8bf36e031c0751e33b85bab58680542e.tar.gz | |
Docs: `sortOn = sortBy (comparing f)` [skip ci]
Diffstat (limited to 'libraries/base/Data')
| -rw-r--r-- | libraries/base/Data/OldList.hs | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/libraries/base/Data/OldList.hs b/libraries/base/Data/OldList.hs index 7e79c347d4..a377b4f518 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. |