summaryrefslogtreecommitdiff
path: root/libraries/base/Data/OldList.hs
diff options
context:
space:
mode:
Diffstat (limited to 'libraries/base/Data/OldList.hs')
-rw-r--r--libraries/base/Data/OldList.hs2
1 files changed, 1 insertions, 1 deletions
diff --git a/libraries/base/Data/OldList.hs b/libraries/base/Data/OldList.hs
index 132ee14673..82cc9faa3b 100644
--- a/libraries/base/Data/OldList.hs
+++ b/libraries/base/Data/OldList.hs
@@ -1112,7 +1112,7 @@ and possibly to bear similarities to a 1982 paper by Richard O'Keefe:
"A smooth applicative merge sort".
Benchmarks show it to be often 2x the speed of the previous implementation.
-Fixes ticket http://ghc.haskell.org/trac/ghc/ticket/2143
+Fixes ticket https://gitlab.haskell.org/ghc/ghc/issues/2143
-}
sort = sortBy compare