Package maintainers and Hackage trustees are allowed to edit certain bits
of package metadata after a release, without uploading a new tarball.
Note that the tarball itself is never changed, just the metadata that is
stored separately. For more information about metadata revisions, please
refer to the
Hackage Metadata Revisions FAQ.
No. |
Time |
User |
SHA256 |
-r3 (QuickCheck-safe-0.1.0.1-r3) |
2015-05-08T13:39:28Z |
BertramFelgenhauer |
4e791ac9fa2f2e73029ab92d17e3ab93571ec5b1d5acda0ea1f340c5ee1346f6
|
|
Changed description
from QuickCheck-safe reimplements the quickCheck functionality with a pure
interface and a very small trusted base (see Test.QuickCheck.Safe.Trusted).
* uses the existing Arbitrary instances
* implemented features: testing, result minimization (i.e., shrinking)
* missing features: expected failures, label frequencies, coverage
The package is targeted at users who want to leverage SafeHaskell for
sandboxing.
> > putStr $ quickCheck (inventQCGen ()) (\x -> length (x :: [()]) < 10)
> *** Failed! Falsifiable (after 18 tests and 3 shrinks):
> [(),(),(),(),(),(),(),(),(),(),(),(),(),(),()]
to QuickCheck-safe reimplements the quickCheck functionality with a pure
interface and a very small trusted base (see Test.QuickCheck.Safe.Trusted).
* uses the existing Arbitrary instances
* implemented features: testing, result minimization (i.e., shrinking)
* missing features: expected failures, label frequencies, coverage
The package is targeted at users who want to leverage SafeHaskell for
sandboxing.
> > putStr $ quickCheck (inventQCGen ()) (\x -> length (x :: [()]) < 10)
> *** Failed! Falsifiable (after 18 tests and 3 shrinks):
> [(),(),(),(),(),(),(),(),(),(),(),(),(),(),()]
|
-r2 (QuickCheck-safe-0.1.0.1-r2) |
2015-05-08T13:38:43Z |
BertramFelgenhauer |
028595c73d87fab375e208ba6e0ffff299e6441d282687f468518e193bb2991b
|
|
Changed description
from QuickCheck-safe reimplements the quickCheck functionality with a pure
interface and a very small trusted base (see Test.QuickCheck.Safe.Trusted).
* uses the existing Arbitrary instances
* implemented features: testing, result minimization (i.e., shrinking)
* missing features: expected failures, label frequencies, coverage
The package is targeted at users who want to leverage SafeHaskell for
sandboxing.
>>> putStr $ quickCheck (inventQCGen ()) (\x -> length (x :: [()]) < 10)
*** Failed! Falsifiable (after 18 tests and 3 shrinks):
[(),(),(),(),(),(),(),(),(),(),(),(),(),(),()]
to QuickCheck-safe reimplements the quickCheck functionality with a pure
interface and a very small trusted base (see Test.QuickCheck.Safe.Trusted).
* uses the existing Arbitrary instances
* implemented features: testing, result minimization (i.e., shrinking)
* missing features: expected failures, label frequencies, coverage
The package is targeted at users who want to leverage SafeHaskell for
sandboxing.
> > putStr $ quickCheck (inventQCGen ()) (\x -> length (x :: [()]) < 10)
> *** Failed! Falsifiable (after 18 tests and 3 shrinks):
> [(),(),(),(),(),(),(),(),(),(),(),(),(),(),()]
|
-r1 (QuickCheck-safe-0.1.0.1-r1) |
2015-05-03T15:52:56Z |
BertramFelgenhauer |
7609c326853799a0cd519bd258c03f89664ee37795ff3099aa3d5004d1f2dee8
|
|
|
-r0 (QuickCheck-safe-0.1.0.1-r0) |
2015-05-03T15:35:41Z |
BertramFelgenhauer |
02b5df0813a75990800212a11332790e8d127e7cf7414ca28d9f7346c1ea5b26
|
|
|