wip

Author: erikd

plutus-core/plutus-core.cabal

@@ -403,6 +403,7 @@ test-suite plutus-core-test
     , base16-bytestring                ^>=1.0
     , bytestring
     , containers
+    , cardano-base:{testlib}           >=0.1.5
     , data-default-class
     , extra
     , filepath

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

@@ -10,6 +10,7 @@ import PlutusCore.Generators.QuickCheck.Utils
 
 import Test.Tasty
 import Test.Tasty.QuickCheck
+import qualified Test.Cardano.Base.QuickCheck as BaseQC
 
 {-| Test that both 'multiSplit1' and 'multiSplit0' produce a list such that 'concat'ing it gives
 back the input. -}
@@ -21,14 +22,14 @@ test_multiSplitSound =
       , ("multiSplit0", multiSplit0 0.1)
       ]
     pure . testProperty name $ \(xs :: [Int]) ->
-      withMaxSuccess 10000 . forAll (split xs) $ \aSplit ->
+      BaseQC.withNumTests 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) $
-    withMaxSuccess numRuns . forAll (split $ replicate n ()) $ \aSplit ->
+    BaseQC.withNumTests numRuns . forAll (split $ replicate n ()) $ \aSplit ->
       label (show $ map length aSplit) True
 
 -- | Count the number of 'I' and 'B' nodes in a 'Data' object.
@@ -48,7 +49,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" $
-    withMaxSuccess 1000 . mapSize (* 5) $ \spine ->
+    BaseQC.withNumTests 1000 . mapSize (* 5) $ \spine ->
       forAll (genDataFromSpine spine) $ \dat ->
         countIandBs dat === length spine