summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorMatthew Pickering <matthewtpickering@gmail.com>2019-10-21 18:29:32 +0100
committerMatthew Pickering <matthewtpickering@gmail.com>2020-02-11 10:13:47 +0000
commit2e58664d4ca4a3d78db6302761dc702cb4d09de7 (patch)
treedc6389462700dd8bc635bba4bb28a95a641c2432
parent9a93bfea2ade33a9cd74efd9e02546ea43f00567 (diff)
downloadhaskell-wip/short-bytestring-rebased-feb2020.tar.gz
Less unused variables, equal speed; hello bgamari, nice to meet you herewip/short-bytestring-rebased-feb2020
-rw-r--r--compiler/utils/FastString.hs2
1 files changed, 1 insertions, 1 deletions
diff --git a/compiler/utils/FastString.hs b/compiler/utils/FastString.hs
index 775352c25a..cfcbb20aeb 100644
--- a/compiler/utils/FastString.hs
+++ b/compiler/utils/FastString.hs
@@ -232,7 +232,7 @@ instance NFData FastString where
rnf fs = seq fs ()
cmpFS :: FastString -> FastString -> Ordering
-cmpFS f1@(FastString u1 sbs1 _) f2@(FastString u2 sbs2 _) =
+cmpFS (FastString u1 sbs1 _) (FastString u2 sbs2 _) =
if u1 == u2 then EQ else
compare sbs1 sbs2