QC

Author: erikd

plutus-core/plutus-core/test/Generators/QuickCheck/Utils.hs

@@ -1,4 +1,3 @@
-{-# LANGUAGE CPP #-}
 {-# LANGUAGE TypeApplications #-}
 
 module Generators.QuickCheck.Utils where
@@ -9,8 +8,6 @@ import PlutusCore.Data
 import PlutusCore.Generators.QuickCheck.Builtin
 import PlutusCore.Generators.QuickCheck.Utils
 
-import qualified Test.QuickCheck as QC
-
 import Test.Tasty
 import Test.Tasty.QuickCheck
 
@@ -24,14 +21,14 @@ test_multiSplitSound =
       , ("multiSplit0", multiSplit0 0.1)
       ]
     pure . testProperty name $ \(xs :: [Int]) ->
-      withNumTests 10000 . forAll (split xs) $ \aSplit ->
+      withMaxSuccess 10000 . forAll (split xs) $ \aSplit ->
         xs === concat aSplit
 
 -- | Show the distribution of lists generated by a split function for a list of the given length.
 test_listDistribution :: Int -> ([()] -> Gen [[()]]) -> Int -> TestTree
 test_listDistribution numRuns split n =
   testProperty ("for a list of length " ++ show n) $
-    withNumTests numRuns . forAll (split $ replicate n ()) $ \aSplit ->
+    withMaxSuccess numRuns . forAll (split $ replicate n ()) $ \aSplit ->
       label (show $ map length aSplit) True
 
 -- | Count the number of 'I' and 'B' nodes in a 'Data' object.
@@ -51,7 +48,7 @@ length of the spine. Ensures that the 'Data' generator is not exponential in 'B'
 test_arbitraryDataExpectedLeafs :: TestTree
 test_arbitraryDataExpectedLeafs =
   testProperty "'arbitrary @Data' has the expected number of 'B' and 'I' leaves" $
-    withNumTests 1000 . mapSize (* 5) $ \spine ->
+    withMaxSuccess 1000 . mapSize (* 5) $ \spine ->
       forAll (genDataFromSpine spine) $ \dat ->
         countIandBs dat === length spine
 
@@ -83,10 +80,3 @@ test_utils =
     , test_multiSplitSound
     , test_multiSplitDistribution
     ]
-
-withNumTests :: QC.Testable prop => Int -> prop -> QC.Property
-#if MIN_VERSION_QuickCheck(2, 18, 0)
-withNumTests = QC.withNumTests
-#else
-withNumTests = QC.withMaxSuccess
-#endif