Log message:
*: Bump PKGREVISION for ghc-9.0.1

Log message:
Update to QuickCheck-2.14.2

QuickCheck 2.14.2 (released 2020-11-14)
* Add Arbitrary instances for Tree (thanks to Oleg Grenrus)
* GHC 9.0 compatibility (thanks to Vilem-Benjamin Liepelt)

QuickCheck 2.14.1 (released 2020-07-05)
* Compatibility with random >= 1.2.

QuickCheck 2.14 (released 2020-03-28)
* QuickCheck is now much faster at generating test data!

  As a result, many properties can now be tested a lot faster; the
  examples distributed with QuickCheck run about twice as fast as
  before, for example. Of course, your mileage may vary.

  The reason for this is that there are now specialised versions of
  the 'choose' combinator for various types. These are: chooseInt,
  chooseInteger, chooseBoundedIntegral, and chooseEnum.  These
  combinators are identical to 'choose' but much faster.  All
  QuickCheck combinators, with the exception of 'choose' itself, use
  the new combinators behind the scenes.

  You should see a speedup without doing anything, but to get a
  further speedup, consider replacing any uses of 'choose' in your own
  generators with the new combinators.

  We are hoping that future releases of the 'random' library may speed
  up 'choose', in which case these combinators may no longer be
  needed.

  Thanks to Oleg Grenrus for suggesting to bypass 'choose' for random
  number generation, and providing the appropriate primitive in his
  'splitmix' random number library.

* Smaller changes and bugfixes:
  - RecursivelyShrink and GSubterms are exported from
    Test.QuickCheck.Test (thanks to Tom Mortiboy).
  - Don't generate invalid unicode characters (thanks to Boris
    Stepanov).
  - When a call to 'within' fails, include the duration of the timeout
    in the failure report (thanks to William Rusnack).
  - In Gen, avoid splitting the seed in the implementation of >>, *>
    and <* (thanks to David Feuer).
  - Fix a couple of bugs with shrinking of floating-point numbers.
  - Export functionMapWith, functionEitherWith and functionPairWith
    from Test.QuickCheck.Function (thanks to Oleg Grenrus).
  - Remove redundant RealFloat constraint from Arbitrary/CoArbitrary
    instances for Complex (thanks to Bodigrim).

Log message:
hs-*: add PLIST files

These PLIST files have been autogenerated by mk/haskell.mk using
HS_UPDATE_PLIST=yes during a bulk build.  They will help to track changes
to the packages.  The Haskell packages didn't have PLIST files because
their paths contained package hashes.  These hashes are now determined by
mk/haskell.mk, which makes it easy to generate easy to read PLIST files.

Log message:
Update to QuickCheck-2.13.2

Changes:
http://hackage.haskell.org/package/QuickCheck-2.13.2/changelog

Log message:
Bump PKGREVISION for
hs-primitive-0.6.1.0 || hs-vector-0.11.0.0 || hs-mwc-random-0.13.3.2 || \ 
hs-vector-algorithms-0.7.0.1

Log message:
Add SHA512 digests for distfiles for devel category

Issues found with existing distfiles:
	distfiles/eclipse-sourceBuild-srcIncluded-3.0.1.zip
	distfiles/fortran-utils-1.1.tar.gz
	distfiles/ivykis-0.39.tar.gz
	distfiles/enum-1.11.tar.gz
	distfiles/pvs-3.2-libraries.tgz
	distfiles/pvs-3.2-linux.tgz
	distfiles/pvs-3.2-solaris.tgz
	distfiles/pvs-3.2-system.tgz
No changes made to these distinfo files.

Otherwise, existing SHA1 digests verified and found to be the same on
the machine holding the existing distfiles (morden).  All existing
SHA1 digests retained for now as an audit trail.

Log message:
Because this error:
  ERROR: hs-primitive>=0.5.4 is not installed; can't buildlink files.
Bump PKGREVISION for hs-primitive-0.5.4.0

Log message:
Forgot to add a dependency on devel/hs-transformers. Bump revision

I badly want buildlink for Haskell packages, though it's not very easy
to implement...

Log message:
Import QuickCheck-2.7.6 from wip/hs-QuickCheck

QuickCheck is a library for random testing of program properties.

The programmer provides a specification of the program, in the form of
properties which functions should satisfy, and QuickCheck then tests
that the properties hold in a large number of randomly generated
cases.

Specifications are expressed in Haskell, using combinators defined in
the QuickCheck library. QuickCheck provides combinators to define
properties, observe the distribution of test data, and define test
data generators.