diff options
| author | Jan Hrček <honza.hrk@gmail.com> | 2020-06-24 15:55:39 +0200 |
|---|---|---|
| committer | Marge Bot <ben+marge-bot@smart-cactus.org> | 2020-06-28 09:20:22 -0400 |
| commit | 68530b1cd45629e5a353a37df80195ac54d26ade (patch) | |
| tree | a6aa929d32d9c1caff4ca57c5ffde238d7c9717a /libraries/base/Data/OldList.hs | |
| parent | 42f797b0ad034a92389e7081aa50ef4ab3434d01 (diff) | |
| download | haskell-68530b1cd45629e5a353a37df80195ac54d26ade.tar.gz | |
Fix duplicated words and typos in comments and user guide
Diffstat (limited to 'libraries/base/Data/OldList.hs')
| -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 6110a4de31..0252ae0fd8 100644 --- a/libraries/base/Data/OldList.hs +++ b/libraries/base/Data/OldList.hs @@ -1259,7 +1259,7 @@ rqpart cmp x (y:ys) rle rgt r = -- input list. This is called the decorate-sort-undecorate paradigm, or -- Schwartzian transform. -- --- Elements are arranged from from lowest to highest, keeping duplicates in +-- Elements are arranged from lowest to highest, keeping duplicates in -- the order they appeared in the input. -- -- >>> sortOn fst [(2, "world"), (4, "!"), (1, "Hello")] |