module SelfTest () where

import qualified Data.Map
import qualified Data.Set
import qualified Data.IntMap
import qualified Data.Sequence
import qualified Data.Tree

import Data.Map.Functor.Classes ()
import Data.Set.Functor.Classes ()
import Data.IntMap.Functor.Classes ()
import Data.Sequence.Functor.Classes ()
import Data.Tree.Functor.Classes ()

import Data.Functor.Classes (eq1)

_test1 :: Bool
_test1 :: Bool
_test1 = Map Char Char -> Map Char Char -> Bool
forall (f :: * -> *) a. (Eq1 f, Eq a) => f a -> f a -> Bool
eq1 (Char -> Char -> Map Char Char
forall k a. k -> a -> Map k a
Data.Map.singleton Char
'x' Char
'y') (Char -> Char -> Map Char Char
forall k a. k -> a -> Map k a
Data.Map.singleton Char
'x' Char
'y')

_test2 :: Bool
_test2 :: Bool
_test2 = Set Char -> Set Char -> Bool
forall (f :: * -> *) a. (Eq1 f, Eq a) => f a -> f a -> Bool
eq1 (Char -> Set Char
forall a. a -> Set a
Data.Set.singleton Char
'x') (Char -> Set Char
forall a. a -> Set a
Data.Set.singleton Char
'x')

_test3 :: Bool
_test3 :: Bool
_test3 = IntMap Char -> IntMap Char -> Bool
forall (f :: * -> *) a. (Eq1 f, Eq a) => f a -> f a -> Bool
eq1 (Key -> Char -> IntMap Char
forall a. Key -> a -> IntMap a
Data.IntMap.singleton Key
1 Char
'y') (Key -> Char -> IntMap Char
forall a. Key -> a -> IntMap a
Data.IntMap.singleton Key
1 Char
'y')

_test4 :: Bool
_test4 :: Bool
_test4 = Seq Char -> Seq Char -> Bool
forall (f :: * -> *) a. (Eq1 f, Eq a) => f a -> f a -> Bool
eq1 (Char -> Seq Char
forall a. a -> Seq a
Data.Sequence.singleton Char
'x') (Char -> Seq Char
forall a. a -> Seq a
Data.Sequence.singleton Char
'x')

_test5 :: Bool
_test5 :: Bool
_test5 = Tree Char -> Tree Char -> Bool
forall (f :: * -> *) a. (Eq1 f, Eq a) => f a -> f a -> Bool
eq1 (Char -> Forest Char -> Tree Char
forall a. a -> Forest a -> Tree a
Data.Tree.Node Char
'x' []) (Char -> Forest Char -> Tree Char
forall a. a -> Forest a -> Tree a
Data.Tree.Node Char
'x' [])