name:                prednote
version:             0.22.0.2
synopsis:            Build and evaluate trees of predicates
description:
  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.

homepage:            http://github.com/massysett/prednote
license:             BSD3
license-file:        LICENSE
author:              Omari Norman
maintainer:          omari@smileystation.com
copyright:           2013-2014 Omari Norman
category:            Data
build-type:          Simple
cabal-version:       >=1.8
extra-source-files:
  README.md, minimum-versions.txt, current-versions.txt,
  sunlight-test.hs, changelog

tested-with: GHC ==7.4.1, GHC ==7.6.3, GHC ==7.8.2

source-repository head
    type: git
    location: git://github.com/massysett/prednote.git

library

  exposed-modules:
      Data.Prednote
    , Data.Prednote.Predbox
    , Data.Prednote.Expressions
    , Data.Prednote.Expressions.Infix
    , Data.Prednote.Expressions.RPN
    , Data.Prednote.Test

  build-depends:
      base >= 4.5.0.0 && < 5
    , contravariant >= 0.2.0.1
    , rainbow >=0.14.0.0 && < 0.15
    , split >=0.2.2
    , text >= 0.11.2.0

  ghc-options: -Wall
  hs-source-dirs: lib

Test-Suite prednote-test
  type: exitcode-stdio-1.0
  main-is: prednote-test.hs
  hs-source-dirs: . lib

  build-depends:
      base >=4.5.0.0 && < 5
    , contravariant >= 0.2.0.1
    , QuickCheck >=2.6
    , rainbow >=0.14.0.0 && < 0.15
    , text >= 0.11.2.0