rematch

A simple api for matchers

LTS Haskell 11.22:0.2.0.0
Stackage Nightly 2018-03-12:0.2.0.0
Latest on Hackage:0.2.0.0

See all snapshots rematch appears in

MIT licensed by Tom Crayford
Maintained by [email protected]
This version can be pinned in stack with:rematch-0.2.0.0@sha256:86019f4d6a4347e1291a0a9f85ba6324e1447e2b93d75958e59c24212e9d8178,1245

Module documentation for 0.2.0.0

Depends on 1 package(full list with versions):
base
Used by 1 package in lts-11.22(full list with versions):
distributed-process-tests

Rematch is a simple library of matchers, which express rules that can pass or fail. Matchers also report their failure with human readable output. Custom matchers can be build, and matchers can be combined using several predefined combinators or you can write your own. Matchers are often used in automated tests to provide expressive failure messages. Rematch is very similar to, and very inspired by the hamcrest library for Java