essence-of-live-coding-quickcheck 0.2.3 → 0.2.4
raw patch · 2 files changed
+10/−11 lines, 2 filesdep ~essence-of-live-codingPVP ok
version bump matches the API change (PVP)
Dependency ranges changed: essence-of-live-coding
API changes (from Hackage documentation)
Files
essence-of-live-coding-quickcheck.cabal view
@@ -1,5 +1,5 @@ name: essence-of-live-coding-quickcheck-version: 0.2.3+version: 0.2.4 synopsis: General purpose live coding framework - QuickCheck integration description: essence-of-live-coding is a general purpose and type safe live coding framework.@@ -38,7 +38,7 @@ exposed-modules: LiveCoding.QuickCheck build-depends: base >= 4.11 && < 5- , essence-of-live-coding >= 0.2.3+ , essence-of-live-coding >= 0.2.4 , transformers >= 0.5 , syb >= 0.7 , QuickCheck >= 2.12
src/LiveCoding/QuickCheck.lhs view
@@ -66,22 +66,21 @@ \fxwarning{Test in IO} %Given a faulty cell, it is impossible to predict how often it must be stepped until it returns an invalid value. %The number of successive inputs has to be variable in a test.-%We therefore +%We therefore We begin by running a cell repeatedly against a list of inputs, collecting its outputs:-\fxerror{Shortening candidate} \begin{code} embed :: Monad m => [a] -> Cell m a b -> m [b]-embed [] _ = return []-embed (a : as) cell = do- (b, cell') <- step cell a- bs <- embed as cell'- return $ b : bs \end{code}+\begin{comment}+\begin{code}+embed as cell = fst <$> steps cell as+\end{code}+\end{comment} If the input type \mintinline{haskell}{a} can be generated arbitrarily, then so can a list of \mintinline{haskell}{a}s. After running the cell with all inputs,@@ -216,8 +215,8 @@ -> Debugger quickCheckDebugger testCell = Debugger_ $ \s -> do- let Cell { .. } = - testCell <- + let Cell { .. } =+ testCell <- \end{spec} \end{comment} \fxwarning{Could use quickcheck `counterexamples` on `gshow cellState` somehow}