From 88a3d6c3e1d940035e32f8d19364cf74caeead50 Mon Sep 17 00:00:00 2001 From: Kian-Meng Ang Date: Mon, 25 May 2026 04:01:04 +0800 Subject: [PATCH] Fix typos Found via `codespell -L mapp,typ,vart,tupe,numer,caf,nd,wit,typess` --- changelog.md | 2 +- src/Test/QuickCheck/State.hs | 2 +- src/Test/QuickCheck/Test.hs | 2 +- tests/Generators.hs | 2 +- 4 files changed, 4 insertions(+), 4 deletions(-) diff --git a/changelog.md b/changelog.md index 564b6f15..49ee0f5f 100644 --- a/changelog.md +++ b/changelog.md @@ -48,7 +48,7 @@ assertDeepExceptionIO (thanks to Alexey Kuleshevich) * Fix withMaxSuccess not working when checkCoverage is turned on * Fix a bug whereby an unfortunately timed discard could unduly fail a property running with checkCoverage -* Fix Arbitrary intance for Map breaking invariants from +* Fix Arbitrary instance for Map breaking invariants from Data.Map.Strict (thanks to Neil Mayhew) * Fix non-covered classes not showing up in output as 0% covered * Fix Negative's Arbitrary instance discarding an unnecessary number diff --git a/src/Test/QuickCheck/State.hs b/src/Test/QuickCheck/State.hs index 4b351d75..2e7c0aa2 100644 --- a/src/Test/QuickCheck/State.hs +++ b/src/Test/QuickCheck/State.hs @@ -100,7 +100,7 @@ data Confidence = data TestProgress = TestProgress { currentPassed :: Int -- ^ Number of tests passed so far - , currentDiscarded :: Int -- ^ Number of discared tests so far + , currentDiscarded :: Int -- ^ Number of discarded tests so far , maxTests :: Int -- ^ Number of tests to execute , currentShrinks :: Int -- ^ Number of successful shrinking steps , currentFailedShrinks :: Int -- ^ Number of failed shrinking steps since last successful one diff --git a/src/Test/QuickCheck/Test.hs b/src/Test/QuickCheck/Test.hs index 3230b1ef..b1c333fd 100644 --- a/src/Test/QuickCheck/Test.hs +++ b/src/Test/QuickCheck/Test.hs @@ -585,7 +585,7 @@ showTable k mtable m = (map format . -- Descending order of occurrences reverse . sortBy (comparing snd) . - -- If #occurences the same, sort in increasing order of key + -- If #occurrences the same, sort in increasing order of key -- (note: works because sortBy is stable) reverse . sortBy (comparing fst) $ Map.toList m) where diff --git a/tests/Generators.hs b/tests/Generators.hs index 95f645b3..42e09ee6 100644 --- a/tests/Generators.hs +++ b/tests/Generators.hs @@ -206,7 +206,7 @@ prop_B1 (B1 n) = expectFailure $ n === n + 1 -- Double properties: --- We occasionaly generate duplicates. +-- We occasionally generate duplicates. prop_double_duplicate_list :: [Double] -> Property prop_double_duplicate_list xs = expectFailure $ nub xs === xs where sorted = sort xs