explainable-predicates
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.
Ecosystem
hackage.haskell.org
hackage.haskell.org
Latest Release
over 2 years ago
0.1.2.4
over 2 years ago
Versions
7
7
Downloads
1,879 total
1,879 total
Dependent Packages
1
1
Dependent Repos
8
8
HMock 0.5.1.2
HMock is a flexible mock framework for testing effectful code in Haskell. Tests can set up expec...8 versions - Latest release: over 2 years ago - 8 dependent repositories - 2.04 thousand downloads total - 24 stars on GitHub - 1 maintainer
Past Dependents
Include Past Dependents
Check this option to include packages that no longer depend on this package in their latest version but previously did.
Filter
Links
| Registry | hackage.haskell.org |
| Source | Repository |
| JSON API | View JSON |
| CodeMeta | codemeta.json |
Package Details
| PURL |
pkg:hackage/explainable-predicates
spec |
| License | BSD-3-Clause |
| First Release | over 4 years ago |
| Last Synced | 6 days ago |
Repository
| Stars | 8 on GitHub |
| Forks | 2 on GitHub |
| Commits | 35 |
| Committers | 2 |
| Avg per Author | 17.5 |
| DDS | 0.057 |