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

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

Test.Tasty.QuickCheck.Laws.Semigroup

Contents

Semigroup Laws

Description

Synopsis

testSemigroupLaws :: (Semigroup a, Eq a, Show a, Arbitrary a, Typeable a) => Proxy a -> TestTree
testSemigroupLawAssociative :: (Semigroup a, Eq a, Show a, Arbitrary a) => Proxy a -> TestTree

Documentation

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

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

Semigroup Laws

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

(a <> b) <> c === a <> (b <> c)