tasty-quickcheck-laws-0.0.3: Pre-built tasty trees for checking lawful class properties using QuickCheck

Copyright2018 Automattic Inc.
LicenseBSD3
MaintainerNathan Bloomfield (nbloomf@gmail.com)
Stabilityexperimental
PortabilityPOSIX
Safe HaskellSafe
LanguageHaskell2010

Test.Tasty.QuickCheck.Laws.Class

Description

Convenience typeclass for type signatures.

Synopsis

Documentation

class (Eq a, Show a, Arbitrary a, CoArbitrary a, Typeable a) => Checkable a Source #

Alias for convenience.

Instances
Checkable Bool Source # 
Instance details

Defined in Test.Tasty.QuickCheck.Laws.Class

Checkable Char Source # 
Instance details

Defined in Test.Tasty.QuickCheck.Laws.Class

Checkable Double Source # 
Instance details

Defined in Test.Tasty.QuickCheck.Laws.Class

Checkable Int Source # 
Instance details

Defined in Test.Tasty.QuickCheck.Laws.Class

Checkable Integer Source # 
Instance details

Defined in Test.Tasty.QuickCheck.Laws.Class

Checkable () Source # 
Instance details

Defined in Test.Tasty.QuickCheck.Laws.Class

Checkable a => Checkable [a] Source # 
Instance details

Defined in Test.Tasty.QuickCheck.Laws.Class

Checkable a => Checkable (Maybe a) Source # 
Instance details

Defined in Test.Tasty.QuickCheck.Laws.Class

(Checkable a, Checkable b) => Checkable (Either a b) Source # 
Instance details

Defined in Test.Tasty.QuickCheck.Laws.Class

(Checkable a, Checkable b) => Checkable (a, b) Source # 
Instance details

Defined in Test.Tasty.QuickCheck.Laws.Class

(Checkable a, Checkable b, Checkable c) => Checkable (a, b, c) Source # 
Instance details

Defined in Test.Tasty.QuickCheck.Laws.Class