homepage: https://github.com/cdsmith/explainable-predicates
changelog-type: markdown
hash: f15cff6d6cb711072cc103c7001d28715f7a1371aa6e61cd658e4488b1c974d1
test-bench-deps:
  base: -any
  hspec: -any
  doctest-exitcode-stdio: -any
  doctest-lib: -any
  explainable-predicates: -any
maintainer: Chris Smith <cdsmith@gmail.com>
synopsis: Predicates that can explain themselves.
changelog: |
  # Revision history for explainable-predicates

  ## 0.1.0.0 -- 2021-09-18

  * First version. Released on an unsuspecting world.
basic-deps:
  base: '>=4.11.0 && <4.16'
  syb: '>=0.7.2 && <0.8'
  array: '>=0.5.2 && <0.6'
  regex-tdfa: '>=1.3.1 && <1.4'
  template-haskell: '>=2.13.0 && <2.18'
  mono-traversable: '>=1.0.15 && <1.1'
all-versions:
- 0.1.0.0
author: Chris Smith <cdsmith@gmail.com>
latest: 0.1.0.0
description-type: haddock
description: |-
  Explainable predicates are essentially functions from types
  to 'Bool' which can additionally describe themselves and
  explain why an argument does or doesn't match.  They are
  intended to be used during unit tests to provide better
  error messages when tests fail.  For example, if a
  collection is missing an element, an explainable predicate
  can tell you which element is missing.
license-name: BSD-3-Clause

Update from Hackage at 2021-09-18T22:45:50Z
Update from Hackage at 2021-09-18T22:45:50Z
