Test.Tasty.Laws.Monoid

This module is intended to be imported qualified:

import qualified Test.Tasty.Laws.Monoid as Monoid

Documentation

test :: (Eq a, Show a, Monoid a) => Series IO a -> TestTree

tasty TestTree for Monoid laws. Sum of series for associativity law.

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

testExhaustive :: (Eq a, Show a, Monoid a) => Series IO a -> TestTree

tasty TestTree for Monoid laws. Product of series for associativity law. Be aware of combinatorial explosion.

(a <> a) <> a == a <> (a <> a)
(a <> a) <> b == a <> (a <> b)
(a <> b) <> b == a <> (b <> b)
...

testMConcat :: (Eq a, Show a, Monoid a) => Series IO a -> TestTree

Use this test when implementing the mconcat method.

module Test.SmallCheck.Laws.Monoid