diff options
| author | Alexandre Esteves <alexandre.fmp.esteves@gmail.com> | 2019-03-15 18:42:50 -0400 |
|---|---|---|
| committer | Marge Bot <ben+marge-bot@smart-cactus.org> | 2019-03-21 17:43:03 -0400 |
| commit | 84c77a675ccc4b6bbd0f271d7859266872eab777 (patch) | |
| tree | bdbebfd3a6689eb39960d3dd243fca73e7ffad1b | |
| parent | 3423664b80ce3c8f5fa3104f3b0a1bcd0e539a02 (diff) | |
| download | haskell-84c77a675ccc4b6bbd0f271d7859266872eab777.tar.gz | |
Fix typo [skip ci]
| -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 82cc9faa3b..73d81dfe03 100644 --- a/libraries/base/Data/OldList.hs +++ b/libraries/base/Data/OldList.hs @@ -1085,7 +1085,7 @@ permutations xs0 = xs0 : perms xs0 [] -- It is a special case of 'sortBy', which allows the programmer to supply -- their own comparison function. -- --- 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. -- -- >>> sort [1,6,4,3,2,5] |