1
0
Files

36 lines
1.5 KiB
Haskell

import Lib
import Data.Monoid
import Test.QuickCheck
import Test.QuickCheck.Checkers
import Test.QuickCheck.Classes
import SkiFree
import Tree
main :: IO ()
main = do
sample' (arbitrary :: Gen (S [] Int))
quickBatch $ traversable $ (Identity (['a'], ['b'], ['c']))
quickBatch $ applicative $ (undefined :: Constant (String, String, String) (String, String, String))
quickBatch $ traversable $ (undefined :: Constant (String, String, String) (String, String, String))
quickBatch $ traversable $ (undefined :: Optional (String, String, String))
quickBatch $ traversable $ (undefined :: List (String, String, String))
quickBatch $ traversable $ (undefined :: Three (String, String, String)
(String, String, String)
(String, String, String))
quickBatch $ traversable $ (undefined :: Pair (String, String, String)
(String, String, String))
quickBatch $ traversable $ (undefined :: Big (String, String, String)
(String, String, String))
quickBatch $ traversable $ (undefined :: Bigger (String, String, String)
(String, String, String))
quickBatch $ functor $ S [("a", "q", "y")] ("a", "b", "c")
quickBatch $ traversable $ S [("a", "q", "y")] ("a", "b", "c")
quickBatch $ traversable $ Leaf ("a", "q", "y")