summaryrefslogtreecommitdiff
path: root/testsuite/tests/array
diff options
context:
space:
mode:
authorBrian Wignall <brianwignall@gmail.com>2019-12-19 09:11:42 -0500
committerMarge Bot <ben+marge-bot@smart-cactus.org>2020-01-04 15:55:06 -0500
commit3c9dc06ba2034e867c9169e60e854539875654fd (patch)
treef06e599ca380ee9ad599918b2ae4c78cd4afce2b /testsuite/tests/array
parentb2e0323f318959c879629ef277f6433b44473c4b (diff)
downloadhaskell-3c9dc06ba2034e867c9169e60e854539875654fd.tar.gz
Fix typos, via a Levenshtein-style corrector
Diffstat (limited to 'testsuite/tests/array')
-rw-r--r--testsuite/tests/array/should_run/arr016.hs2
1 files changed, 1 insertions, 1 deletions
diff --git a/testsuite/tests/array/should_run/arr016.hs b/testsuite/tests/array/should_run/arr016.hs
index 792db470b7..72a29c4f09 100644
--- a/testsuite/tests/array/should_run/arr016.hs
+++ b/testsuite/tests/array/should_run/arr016.hs
@@ -122,7 +122,7 @@ rift n xs = comb (drop n xs) (take n xs)
comb [] [] = []
--- suffle makes n random rifts. Typically after
+-- shuffle makes n random rifts. Typically after
-- log n rifts, the list is in a pretty random order.
-- (where n is the number of elements in the list)