The rematch package

[Tags:library, mit]

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

Properties

Versions 0.1.0.0, 0.1.0.1, 0.1.0.2, 0.1.1.0, 0.1.2.0, 0.1.2.1, 0.2.0.0
Dependencies base (>=4.5.0 && <5), HUnit (>=1.0) [details]
License MIT
Copyright Tom Crayford 2013
Author Tom Crayford
Maintainer tcrayford@googlemail.com
Stability Unknown
Category Control
Uploaded Sun Jan 13 23:53:45 UTC 2013 by TomCrayford
Distributions LTSHaskell:0.2.0.0, NixOS:0.2.0.0
Downloads 2038 total (26 in the last 30 days)
Votes
0 []
Status Docs not available [build log]
All reported builds failed as of 2015-11-24 [all 5 reports]

Modules

  • Control
    • Control.Rematch
      • Control.Rematch.Formatting

Downloads

Maintainer's Corner

For package maintainers and hackage trustees