explainable-predicates

Predicates that can explain themselves.

https://github.com/cdsmith/explainable-predicates

Version on this page:0.1.2.0
LTS Haskell 23.28:0.1.2.4
Stackage Nightly 2024-12-09:0.1.2.4
Latest on Hackage:0.1.2.4

See all snapshots explainable-predicates appears in

BSD-3-Clause licensed and maintained by Chris Smith
This version can be pinned in stack with:explainable-predicates-0.1.2.0@sha256:f50494313c1a303271fff01c3e858b7ac364521abb879898b36a10e3b7b678ab,3749

Module documentation for 0.1.2.0

Used by 1 package in nightly-2021-11-12(full list with versions):
HMock

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.

Changes

Revision history for explainable-predicates

0.1.2.0 – 2021-09-25

  • HUnit and Hspec integration is now available in Test.Predicates.HUnit.

0.1.1.0 – 2021-09-25

  • Predicate now has a Contravariant instance.
  • ==~ is an infix synonym for accept.
  • Cabal regex and containers flags (default true) enable regex and container predicates, respectively.
  • Cabal dev flag (default false) turns GHC warnings into errors.
  • The inBranch and qADT combinators are now available for more convenient matching of algebraic data types and fields.
  • QuickCheck integration is now available in Test.Predicates.QuickCheck.

0.1.0.0 – 2021-09-18

  • First version. Released on an unsuspecting world.