homepage: ''
changelog-type: ''
hash: 2c9e1071b3fbabf6f9ac3eab846a8314bbb9f73901436a2882de249e6121724e
test-bench-deps: {}
maintainer: jonas.duregard@chalmers.se
synopsis: Finds values satisfying a lazy predicate
changelog: ''
basic-deps:
  base: ! '>=4.7 && <5'
  size-based: ! '>=0.1 && <0.2'
all-versions:
- 0.1.0.0
- 0.1.1.0
- 0.1.2.0
author: Jonas Duregard
latest: 0.1.2.0
description-type: haddock
description: |-
  This library can be used as a property based testing driver, and more
  generally to find values satisfying a predicate (@a -> Bool@). This
  is done by a size bounded search, and it uses the laziness of the
  predicate to speed up the search by avoiding isomorphic values.

  This is similar to "LazySmallCheck" but uses size instead of depth
  and a faster algorithm.
license-name: BSD-3-Clause

homepage: ''
changelog-type: ''
hash: c942a01e4a64881f89c72eaef5e3a78eba8750759cd66996c6746a2a7cabe703
test-bench-deps: {}
maintainer: jonas.duregard@chalmers.se
synopsis: Finds values satisfying a lazy predicate
changelog: ''
basic-deps:
  base: ! '>=4.7 && <5'
  size-based: ! '>=0.1 && <0.2'
all-versions:
- 0.1.0.0
- 0.1.1.0
- 0.1.2.0
- 0.1.2.1
author: Jonas Duregard
latest: 0.1.2.1
description-type: haddock
description: |-
  This library can be used as a property based testing driver, and more
  generally to find values satisfying a predicate (@a -> Bool@). This
  is done by a size bounded search, and it uses the laziness of the
  predicate to speed up the search by avoiding isomorphic values.

  This is similar to "LazySmallCheck" but uses size instead of depth
  and a faster algorithm.
license-name: BSD-3-Clause

Update from Hackage at 2019-10-15T15:25:31Z
Update from Hackage at 2019-10-15T15:25:31Z
