module Data.Flag (Flag(Enable, Disable)) where

import           Data.Kind    (Type)
import           GHC.Generics (Generic)

type Flag :: Type -> Type
data Flag a = Disable a | Enable a
  deriving stock (Flag a -> Flag a -> Bool
forall a. Eq a => Flag a -> Flag a -> Bool
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
/= :: Flag a -> Flag a -> Bool
$c/= :: forall a. Eq a => Flag a -> Flag a -> Bool
== :: Flag a -> Flag a -> Bool
$c== :: forall a. Eq a => Flag a -> Flag a -> Bool
Eq, forall a. Eq a => a -> Flag a -> Bool
forall a. Num a => Flag a -> a
forall a. Ord a => Flag a -> a
forall m. Monoid m => Flag m -> m
forall a. Flag a -> Bool
forall a. Flag a -> Int
forall a. Flag a -> [a]
forall a. (a -> a -> a) -> Flag a -> a
forall m a. Monoid m => (a -> m) -> Flag a -> m
forall b a. (b -> a -> b) -> b -> Flag a -> b
forall a b. (a -> b -> b) -> b -> Flag a -> b
forall (t :: * -> *).
(forall m. Monoid m => t m -> m)
-> (forall m a. Monoid m => (a -> m) -> t a -> m)
-> (forall m a. Monoid m => (a -> m) -> t a -> m)
-> (forall a b. (a -> b -> b) -> b -> t a -> b)
-> (forall a b. (a -> b -> b) -> b -> t a -> b)
-> (forall b a. (b -> a -> b) -> b -> t a -> b)
-> (forall b a. (b -> a -> b) -> b -> t a -> b)
-> (forall a. (a -> a -> a) -> t a -> a)
-> (forall a. (a -> a -> a) -> t a -> a)
-> (forall a. t a -> [a])
-> (forall a. t a -> Bool)
-> (forall a. t a -> Int)
-> (forall a. Eq a => a -> t a -> Bool)
-> (forall a. Ord a => t a -> a)
-> (forall a. Ord a => t a -> a)
-> (forall a. Num a => t a -> a)
-> (forall a. Num a => t a -> a)
-> Foldable t
product :: forall a. Num a => Flag a -> a
$cproduct :: forall a. Num a => Flag a -> a
sum :: forall a. Num a => Flag a -> a
$csum :: forall a. Num a => Flag a -> a
minimum :: forall a. Ord a => Flag a -> a
$cminimum :: forall a. Ord a => Flag a -> a
maximum :: forall a. Ord a => Flag a -> a
$cmaximum :: forall a. Ord a => Flag a -> a
elem :: forall a. Eq a => a -> Flag a -> Bool
$celem :: forall a. Eq a => a -> Flag a -> Bool
length :: forall a. Flag a -> Int
$clength :: forall a. Flag a -> Int
null :: forall a. Flag a -> Bool
$cnull :: forall a. Flag a -> Bool
toList :: forall a. Flag a -> [a]
$ctoList :: forall a. Flag a -> [a]
foldl1 :: forall a. (a -> a -> a) -> Flag a -> a
$cfoldl1 :: forall a. (a -> a -> a) -> Flag a -> a
foldr1 :: forall a. (a -> a -> a) -> Flag a -> a
$cfoldr1 :: forall a. (a -> a -> a) -> Flag a -> a
foldl' :: forall b a. (b -> a -> b) -> b -> Flag a -> b
$cfoldl' :: forall b a. (b -> a -> b) -> b -> Flag a -> b
foldl :: forall b a. (b -> a -> b) -> b -> Flag a -> b
$cfoldl :: forall b a. (b -> a -> b) -> b -> Flag a -> b
foldr' :: forall a b. (a -> b -> b) -> b -> Flag a -> b
$cfoldr' :: forall a b. (a -> b -> b) -> b -> Flag a -> b
foldr :: forall a b. (a -> b -> b) -> b -> Flag a -> b
$cfoldr :: forall a b. (a -> b -> b) -> b -> Flag a -> b
foldMap' :: forall m a. Monoid m => (a -> m) -> Flag a -> m
$cfoldMap' :: forall m a. Monoid m => (a -> m) -> Flag a -> m
foldMap :: forall m a. Monoid m => (a -> m) -> Flag a -> m
$cfoldMap :: forall m a. Monoid m => (a -> m) -> Flag a -> m
fold :: forall m. Monoid m => Flag m -> m
$cfold :: forall m. Monoid m => Flag m -> m
Foldable, forall a b. a -> Flag b -> Flag a
forall a b. (a -> b) -> Flag a -> Flag b
forall (f :: * -> *).
(forall a b. (a -> b) -> f a -> f b)
-> (forall a b. a -> f b -> f a) -> Functor f
<$ :: forall a b. a -> Flag b -> Flag a
$c<$ :: forall a b. a -> Flag b -> Flag a
fmap :: forall a b. (a -> b) -> Flag a -> Flag b
$cfmap :: forall a b. (a -> b) -> Flag a -> Flag b
Functor, forall a.
(forall x. a -> Rep a x) -> (forall x. Rep a x -> a) -> Generic a
forall a x. Rep (Flag a) x -> Flag a
forall a x. Flag a -> Rep (Flag a) x
$cto :: forall a x. Rep (Flag a) x -> Flag a
$cfrom :: forall a x. Flag a -> Rep (Flag a) x
Generic, Flag a -> Flag a -> Bool
Flag a -> Flag a -> Ordering
forall a.
Eq a
-> (a -> a -> Ordering)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> Bool)
-> (a -> a -> a)
-> (a -> a -> a)
-> Ord a
forall {a}. Ord a => Eq (Flag a)
forall a. Ord a => Flag a -> Flag a -> Bool
forall a. Ord a => Flag a -> Flag a -> Ordering
forall a. Ord a => Flag a -> Flag a -> Flag a
min :: Flag a -> Flag a -> Flag a
$cmin :: forall a. Ord a => Flag a -> Flag a -> Flag a
max :: Flag a -> Flag a -> Flag a
$cmax :: forall a. Ord a => Flag a -> Flag a -> Flag a
>= :: Flag a -> Flag a -> Bool
$c>= :: forall a. Ord a => Flag a -> Flag a -> Bool
> :: Flag a -> Flag a -> Bool
$c> :: forall a. Ord a => Flag a -> Flag a -> Bool
<= :: Flag a -> Flag a -> Bool
$c<= :: forall a. Ord a => Flag a -> Flag a -> Bool
< :: Flag a -> Flag a -> Bool
$c< :: forall a. Ord a => Flag a -> Flag a -> Bool
compare :: Flag a -> Flag a -> Ordering
$ccompare :: forall a. Ord a => Flag a -> Flag a -> Ordering
Ord, Int -> Flag a -> ShowS
forall a. Show a => Int -> Flag a -> ShowS
forall a. Show a => [Flag a] -> ShowS
forall a. Show a => Flag a -> String
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
showList :: [Flag a] -> ShowS
$cshowList :: forall a. Show a => [Flag a] -> ShowS
show :: Flag a -> String
$cshow :: forall a. Show a => Flag a -> String
showsPrec :: Int -> Flag a -> ShowS
$cshowsPrec :: forall a. Show a => Int -> Flag a -> ShowS
Show, Functor Flag
Foldable Flag
forall (t :: * -> *).
Functor t
-> Foldable t
-> (forall (f :: * -> *) a b.
    Applicative f =>
    (a -> f b) -> t a -> f (t b))
-> (forall (f :: * -> *) a. Applicative f => t (f a) -> f (t a))
-> (forall (m :: * -> *) a b.
    Monad m =>
    (a -> m b) -> t a -> m (t b))
-> (forall (m :: * -> *) a. Monad m => t (m a) -> m (t a))
-> Traversable t
forall (m :: * -> *) a. Monad m => Flag (m a) -> m (Flag a)
forall (f :: * -> *) a. Applicative f => Flag (f a) -> f (Flag a)
forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> Flag a -> m (Flag b)
forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> Flag a -> f (Flag b)
sequence :: forall (m :: * -> *) a. Monad m => Flag (m a) -> m (Flag a)
$csequence :: forall (m :: * -> *) a. Monad m => Flag (m a) -> m (Flag a)
mapM :: forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> Flag a -> m (Flag b)
$cmapM :: forall (m :: * -> *) a b.
Monad m =>
(a -> m b) -> Flag a -> m (Flag b)
sequenceA :: forall (f :: * -> *) a. Applicative f => Flag (f a) -> f (Flag a)
$csequenceA :: forall (f :: * -> *) a. Applicative f => Flag (f a) -> f (Flag a)
traverse :: forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> Flag a -> f (Flag b)
$ctraverse :: forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> Flag a -> f (Flag b)
Traversable)