1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
|
module Spec.Functor (testFunctor) where
import Data.Functor.Compose (Compose(..))
import Data.Functor.Identity (Identity(..))
import Hedgehog
import Hedgehog.Classes
import qualified Hedgehog.Gen as Gen
import qualified Hedgehog.Range as Range
import Prelude hiding (either)
testFunctor :: [(String, [Laws])]
testFunctor =
[ ("[]", lawsList)
, ("Maybe", lawsMaybe)
, ("Either e", lawsEither)
, ("Compose", lawsCompose)
]
lawsList :: [Laws]
lawsList = [functorLaws (Gen.list (Range.linear 0 6))]
lawsMaybe :: [Laws]
lawsMaybe = [functorLaws Gen.maybe]
lawsEither :: [Laws]
lawsEither = [functorLaws eitherInteger]
lawsCompose :: [Laws]
lawsCompose = [functorLaws genCompose]
genCompose :: Gen a -> Gen (Compose Identity Identity a)
genCompose = fmap (Compose . Identity . Identity)
eitherInteger :: MonadGen m => m a -> m (Either Integer a)
eitherInteger = either (Gen.integral (Range.linear 0 20))
either :: MonadGen m => m e -> m a -> m (Either e a)
either genE genA =
Gen.sized $ \n ->
Gen.frequency [
(2, Left <$> genE)
, (1 + fromIntegral n, Right <$> genA)
]
|
