prednote: Evaluate and display trees of predicates
Build and evaluate trees of predicates. For example, you might build a predicate of the type Int -> Bool. You do this by assembling several predicates into a tree. You can then verbosely evaluate this tree, showing why a particular result is reached.
prednote also provides modules to test several subjects against a given predicate, and to parse infix or RPN expressions into a tree of predicates.
[Skip to Readme]
Modules
[Index]
Flags
Manual Flags
| Name | Description | Default |
|---|---|---|
| visual-tests | Build the prednote-visual-tests executable | Disabled |
Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info
Downloads
- prednote-0.34.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
- No Candidates
| Versions [RSS] | 0.2.0.0, 0.4.0.0, 0.6.0.0, 0.8.0.0, 0.10.0.0, 0.12.0.0, 0.14.0.0, 0.16.0.0, 0.18.0.0, 0.18.0.4, 0.20.0.0, 0.22.0.0, 0.22.0.2, 0.24.0.0, 0.24.2.0, 0.26.0.0, 0.26.0.2, 0.26.0.4, 0.28.0.0, 0.28.0.2, 0.30.0.0, 0.32.0.0, 0.32.0.4, 0.32.0.6, 0.34.0.0, 0.36.0.0, 0.36.0.2, 0.36.0.4 |
|---|---|
| Change log | changelog |
| Dependencies | base (>=4.7 && <4.9), bytestring (>=0.10 && <0.11), containers (>=0.4.2.1 && <0.6), contravariant (>=1.2 && <1.4), rainbow (>=0.24 && <0.25), split (>=0.2.2 && <0.3), text (>=0.11.2.0 && <1.3), transformers (>=0.3.0.0 && <0.5) [details] |
| Tested with | ghc ==7.8.3, ghc ==7.10.1 |
| License | BSD-3-Clause |
| Copyright | Copyright 2013-2015 Omari Norman |
| Author | Omari Norman |
| Maintainer | omari@smileystation.com |
| Category | Data |
| Home page | http://www.github.com/massysett/prednote |
| Bug tracker | http://www.github.com/massysett/prednote/issues |
| Source repo | head: git clone https://github.com/massysett/prednote.git |
| Uploaded | by OmariNorman at 2015-04-25T21:06:53Z |
| Distributions | |
| Reverse Dependencies | 5 direct, 0 indirect [details] |
| Downloads | 20833 total (76 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2015-04-25 [all 1 reports] |
Readme for prednote-0.34.0.0
[back to package description]prednote
prednote helps you build a tree of predicates that you can apply to a list of items. It was written for Penny:
http://www.github.com/massysett/penny
but I also find it useful for dapi:
http://www.github.com/massysett/dapi
and so you might find it useful too.
prednote is on Github:
http://www.github.com/massysett/prednote
and Hackage:
http://hackage.haskell.org/package/prednote
Test results
You can view the results of building and testing on Travis by clicking the button below:
If you have trouble building prednote due to dependency issues, try looking at the previous test results, as they will show you package versions that were used to build prednote successfully.
Something similar
See also rematch:
http://hackage.haskell.org/package/rematch
which is apparently based on a Java library called hamcrest.
License
prednote is licensed under the BSD license; see the LICENSE file.