exhaustive

Compile time checks that a computation considers producing data through all possible constructors

http://github.com/ocharles/exhaustive

Version on this page:1.1.6
LTS Haskell 11.22:1.1.6
Stackage Nightly 2018-03-12:1.1.5
Latest on Hackage:1.1.9

See all snapshots exhaustive appears in

BSD-3-Clause licensed by Oliver Charles
Maintained by [email protected]
This version can be pinned in stack with:exhaustive-1.1.6@sha256:a276408226a764ecb87e8e1684e586a0a86b09278fa6c9dd98dadf7c1e6507a6,1253

Module documentation for 1.1.6

For a brief tutorial to exhaustive, check out the documentation for Control.Exhaustive, which contains a small example.

Changes

1.1.6

Other Changes

  • Increased upper-bound of base to < 4.12.

1.1.5

Other Changes

  • Increased upper-bound of base.

1.1.4

Other Changes

  • Increased upper-bound of generics-sop to < 0.4.

1.1.3

  • Compile with base-4.9.

1.1.2

  • Compile with generics-sop 0.2. Thanks to @kosmikus for this change.

1.1.1

  • Increased the upper-bound of base to allow < 4.9 and transforms < 0.5. Now builds on GHC 7.10.1.

1.1.0

  • New API new using Template Haskell to provide named constructors. Users should check the latest documentation for ‘Control.Exhaustive’ to see how the new API is used.

1.0.0

  • Initial release