explainable-predicates: Predicates that can explain themselves.
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.
Downloads
- explainable-predicates-0.1.0.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
| Versions [RSS] | 0.1.0.0, 0.1.1.0, 0.1.2.0, 0.1.2.1, 0.1.2.2, 0.1.2.3, 0.1.2.4 |
|---|---|
| Change log | CHANGELOG.md |
| Dependencies | array (>=0.5.2 && <0.6), base (>=4.11.0 && <4.16), mono-traversable (>=1.0.15 && <1.1), regex-tdfa (>=1.3.1 && <1.4), syb (>=0.7.2 && <0.8), template-haskell (>=2.13.0 && <2.18) [details] |
| License | BSD-3-Clause |
| Author | Chris Smith <cdsmith@gmail.com> |
| Maintainer | Chris Smith <cdsmith@gmail.com> |
| Category | Testing |
| Home page | https://github.com/cdsmith/explainable-predicates |
| Bug tracker | https://github.com/cdsmith/explainable-predicates/issues |
| Source repo | head: git clone git://github.com/cdsmith/explainable-predicates.git |
| Uploaded | by ChrisSmith at 2021-09-18T22:35:49Z |
| Distributions | LTSHaskell:0.1.2.4, NixOS:0.1.2.4, Stackage:0.1.2.4 |
| Reverse Dependencies | 1 direct, 0 indirect [details] |
| Downloads | 1339 total (38 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2021-09-19 [all 1 reports] |