barbies-2.0.3.0: test/Spec.hs
import Test.Tasty (defaultMain, testGroup)
import Test.Tasty.HUnit (testCase, (@?=))
import qualified Spec.Bare as Bare
import qualified Spec.Constraints as Constraints
import qualified Spec.Functor as Functor
import qualified Spec.Applicative as Applicative
import qualified Spec.Traversable as Traversable
import qualified Spec.Distributive as Distributive
import qualified Spec.Wrapper as Wrapper
import TestBarbies
import TestBarbiesW
import qualified TestBiBarbies as Bi
import Barbies(Flip)
import Barbies.Bare(Covered)
import Control.Applicative ( liftA2 )
import Data.Functor.Barbie(bfoldMap, bmapC, btraverseC, bpureC, bfoldMapC, bzipWithC, bzipWith3C, bzipWith4C)
import Data.Functor.Const (Const (..))
import Data.Functor.Identity (Identity (..))
import Data.Monoid (Sum (..))
import Data.Typeable ( Typeable, typeOf )
main :: IO ()
main
= defaultMain $
testGroup "Tests"
[ testGroup "Functor Laws"
[ Functor.laws @Record0
, Functor.laws @Record1
, Functor.laws @Record3
, Functor.laws @Record1S
, Functor.laws @Record3S
, Functor.laws @(Record1W Covered)
, Functor.laws @(Record3W Covered)
, Functor.laws @(Record1WS Covered)
, Functor.laws @(Record3WS Covered)
, Functor.laws @Ignore1
, Functor.laws @Sum3
, Functor.laws @SumRec
, Functor.laws @(Sum3W Covered)
, Functor.laws @(SumRecW Covered)
, Functor.laws @CompositeRecord
, Functor.laws @NestedF
, Functor.laws @Nested2F
, Functor.laws @(CompositeRecordW Covered)
, Functor.laws @(NestedFW Covered)
, Functor.laws @(Nested2FW Covered)
, Functor.laws @(ParF Maybe)
, Functor.laws @(Flip Bi.Record0 ())
, Functor.laws @(Flip Bi.Record1 ())
, Functor.laws @(Flip Bi.Record3 ())
, Functor.laws @(Flip Bi.Record1S ())
, Functor.laws @(Flip Bi.Record3S ())
, Functor.laws @(Flip Bi.Ignore1 ())
, Functor.laws @(Flip Bi.Sum3 ())
, Functor.laws @(Flip Bi.CompositeRecord ())
, Functor.laws @(Flip Bi.SumRec ())
, Functor.laws @(Flip Bi.NestedF ())
, Functor.laws @(Flip Bi.Nested2F ())
, Functor.laws @(Flip Bi.NestedB Maybe)
, Functor.laws @(Bi.MixedBT Maybe)
, Functor.laws @(Flip Bi.MixedBT Maybe)
]
, testGroup "Distributive Laws"
[ Distributive.laws @Record0
, Distributive.laws @Record1
, Distributive.laws @Record1S
, Distributive.laws @Record3S
, Distributive.laws @(Record1W Covered)
, Distributive.laws @(Record3W Covered)
, Distributive.laws @CompositeRecord
, Distributive.laws @(Record1WS Covered)
, Distributive.laws @(Record3WS Covered)
, Distributive.laws @(CompositeRecordW Covered)
, Distributive.laws @(Flip Bi.Record0 ())
, Distributive.laws @(Flip Bi.Record1 ())
, Distributive.laws @(Flip Bi.Record1S ())
, Distributive.laws @(Flip Bi.Record3S ())
]
, testGroup "Traversable Laws"
[ Traversable.laws @Record0
, Traversable.laws @Record1
, Traversable.laws @Record3
, Traversable.laws @Record1S
, Traversable.laws @Record3S
, Traversable.laws @(Record1W Covered)
, Traversable.laws @(Record3W Covered)
, Traversable.laws @(Record1WS Covered)
, Traversable.laws @(Record3WS Covered)
, Traversable.laws @Ignore1
, Traversable.laws @Sum3
, Traversable.laws @SumRec
, Traversable.laws @(Sum3W Covered)
, Traversable.laws @(SumRecW Covered)
, Traversable.laws @CompositeRecord
, Traversable.laws @NestedF
, Traversable.laws @Nested2F
, Traversable.laws @(CompositeRecordW Covered)
, Traversable.laws @(NestedFW Covered)
, Traversable.laws @(Nested2FW Covered)
, Traversable.laws @(ParF Maybe)
, Traversable.laws @(Flip Bi.Record0 ())
, Traversable.laws @(Flip Bi.Record1 ())
, Traversable.laws @(Flip Bi.Record3 ())
, Traversable.laws @(Flip Bi.Record1S ())
, Traversable.laws @(Flip Bi.Record3S ())
, Traversable.laws @(Flip Bi.Ignore1 ())
, Traversable.laws @(Flip Bi.Sum3 ())
, Traversable.laws @(Flip Bi.CompositeRecord ())
, Traversable.laws @(Flip Bi.SumRec ())
, Traversable.laws @(Flip Bi.NestedF ())
, Traversable.laws @(Flip Bi.Nested2F ())
, Traversable.laws @(Flip Bi.NestedB Maybe)
, Traversable.laws @(Bi.MixedBT Maybe)
, Traversable.laws @(Flip Bi.MixedBT Maybe)
]
, testGroup "Applicative laws"
[ Applicative.laws @Record0
, Applicative.laws @Record1
, Applicative.laws @Record3
, Applicative.laws @CompositeRecord
, Applicative.laws @NestedF
, Applicative.laws @Nested2F
, Applicative.laws @Record1S
, Applicative.laws @Record3S
, Applicative.laws @(Record1W Covered)
, Applicative.laws @(Record3W Covered)
, Applicative.laws @(CompositeRecordW Covered)
, Applicative.laws @(NestedFW Covered)
, Applicative.laws @(Nested2FW Covered)
, Applicative.laws @(Record1WS Covered)
, Applicative.laws @(Record3WS Covered)
, Applicative.laws @(ParX (Maybe ()))
, Applicative.laws @(ParF Sum)
, Applicative.laws @(Flip Bi.Record0 ())
, Applicative.laws @(Flip Bi.Record1 ())
, Applicative.laws @(Flip Bi.Record3 ())
, Applicative.laws @(Flip Bi.Record1S ())
, Applicative.laws @(Flip Bi.Record3S ())
, Applicative.laws @(Flip Bi.CompositeRecord ())
, Applicative.laws @(Flip Bi.NestedF ())
, Applicative.laws @(Flip Bi.Nested2F ())
, Applicative.laws @(Flip (Bi.ParX (Maybe ())) ())
, Applicative.laws @(Bi.MixedBT [])
]
, testGroup "addDict projection"
[ Constraints.lawAddDictPrj @Record0
, Constraints.lawAddDictPrj @Record1
, Constraints.lawAddDictPrj @Record3
, Constraints.lawAddDictPrj @Record1S
, Constraints.lawAddDictPrj @Record3S
, Constraints.lawAddDictPrj @(Record1W Covered)
, Constraints.lawAddDictPrj @(Record3W Covered)
, Constraints.lawAddDictPrj @(Record1WS Covered)
, Constraints.lawAddDictPrj @(Record3WS Covered)
, Constraints.lawAddDictPrj @Ignore1
, Constraints.lawAddDictPrj @Sum3
, Constraints.lawAddDictPrj @SumRec
, Constraints.lawAddDictPrj @(Sum3W Covered)
, Constraints.lawAddDictPrj @(SumRecW Covered)
, Constraints.lawAddDictPrj @CompositeRecord
, Constraints.lawAddDictPrj @(CompositeRecordW Covered)
, Constraints.lawAddDictPrj @(Bi.MixedBT Maybe)
]
, testGroup "Bare laws"
[ Bare.laws @Record1W
, Bare.laws @Record3W
, Bare.laws @Record1WS
, Bare.laws @Record3WS
, Bare.laws @Sum3W
, Bare.laws @SumRecW
, Bare.laws @NestedFW
]
, testGroup "Generic wrapper"
[ Wrapper.lawsMonoid @Record1
, Wrapper.lawsMonoid @(Record1W Covered)
, Wrapper.lawsMonoid @Record1S
, Wrapper.lawsMonoid @(Record1WS Covered)
, Wrapper.lawsMonoid @Record3
, Wrapper.lawsMonoid @(Record3W Covered)
, Wrapper.lawsMonoid @Record3S
, Wrapper.lawsMonoid @(Record3WS Covered)
]
, testGroup "bfoldMap"
[ testCase "Record3" $ do
let b = Record3 (Const "tic") (Const "tac") (Const "toe") Nothing
bfoldMap getConst b @?= "tictactoe"
]
, testGroup
"bmapC"
[ testCase "Record1" $
bmapC @Num (fmap (+1)) (Record1 (Identity 0))
@?= Record1 (Identity 1)
]
, testGroup
"btraverseC"
[ testCase "Record1" $
btraverseC @Num (\inner -> (Sum @Int 1, fmap (+ 1) inner)) (Record1 (Identity 0))
@?= (Sum 1, Record1 (Identity 1))
]
, testGroup
"bpureC"
[ testCase "Record1" $
bpureC @Num (Identity (fromIntegral (42 :: Int)))
@?= Record1 (Identity 42)
]
, testGroup "bfoldMapC"
[ testCase "Record3S" $ do
let
b = Record3S (Just 22) Nothing (Just 'x')
go :: forall a. Typeable a => Maybe a -> Maybe String
go = fmap (show . typeOf)
bfoldMapC @Typeable go b @?= Just "IntChar"
]
, testGroup "bzipWithC"
[ testCase "Record1S" $ do
let
a = Record1S (Just 44)
b = Record1S (Just 22)
bzipWithC @Num (liftA2 (+)) a b @?= Record1S (Just 66)
]
, testGroup "bzipWith3C"
[ testCase "Record1S" $ do
let
a = Record1S (Just 44)
b = Record1S (Just 22)
c = Record1S (Just 88)
go :: forall a. Num a => Maybe a -> Maybe a -> Maybe a -> Maybe a
go x y z = liftA2 (+) x $ liftA2 (+) y z
bzipWith3C @Num go a b c @?= Record1S (Just 154)
]
, testGroup "bzipWith4C"
[ testCase "Record1S" $ do
let
a = Record1S (Just 44)
b = Record1S (Just 22)
c = Record1S (Just 88)
d = Record1S (Just 11)
go :: forall a. Num a => Maybe a -> Maybe a -> Maybe a -> Maybe a -> Maybe a
go w x y z = liftA2 (+) (liftA2 (+) w x) (liftA2 (+) y z)
bzipWith4C @Num go a b c d @?= Record1S (Just 165)
]
]