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

Copyright	2018 Automattic Inc.
License	BSD3
Maintainer	Nathan Bloomfield (nbloomf@gmail.com)
Stability	experimental
Portability	POSIX
Safe Haskell	None
Language	Haskell2010

Test.Tasty.QuickCheck.Laws.Eq

Contents

Eq Laws

Description

Synopsis

testEqLaws :: (Eq a, Show a, Arbitrary a, Typeable a) => Proxy a -> TestTree
testEqLawReflexive :: (Eq a, Show a, Arbitrary a) => Proxy a -> TestTree
testEqLawSymmetric :: (Eq a, Show a, Arbitrary a) => Proxy a -> TestTree
testEqLawTransitive :: (Eq a, Show a, Arbitrary a) => Proxy a -> TestTree

Documentation

testEqLaws :: (Eq a, Show a, Arbitrary a, Typeable a) => Proxy a -> TestTree Source #

Constructs a TestTree checking that the Eq class laws hold for a.

Eq Laws

testEqLawReflexive :: (Eq a, Show a, Arbitrary a) => Proxy a -> TestTree Source #

a == a

testEqLawSymmetric :: (Eq a, Show a, Arbitrary a) => Proxy a -> TestTree Source #

(a == b) == (b == a)

testEqLawTransitive :: (Eq a, Show a, Arbitrary a) => Proxy a -> TestTree Source #

if (a == b) && (b == c) then (a == c)