prednote: Evaluate and display trees of predicates

[ bsd3, data, library ] [ Propose Tags ]

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]

Flags

Manual Flags

NameDescriptionDefault
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

Maintainer's Corner

Package maintainers

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 && <5), bytestring (>=0.10), containers (>=0.4.2.1), contravariant (>=1.2), rainbow (>=0.26), split (>=0.2.2), text (>=0.11.2.0), transformers (>=0.3.0.0) [details]
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-09-10T01:59:03Z
Distributions
Reverse Dependencies 5 direct, 0 indirect [details]
Downloads 20800 total (74 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-09-10 [all 1 reports]

Readme for prednote-0.36.0.4

[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:

Build Status

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.