{-# LANGUAGE DeriveDataTypeable #-}

module Burrito.Internal.Type.Case
  ( Case (..),
  )
where

import qualified Data.Data as Data

data Case
  = Lower
  | Upper
  deriving (Typeable Case
Typeable Case =>
(forall (c :: * -> *).
 (forall d b. Data d => c (d -> b) -> d -> c b)
 -> (forall g. g -> c g) -> Case -> c Case)
-> (forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c Case)
-> (Case -> Constr)
-> (Case -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c Case))
-> (forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Case))
-> ((forall b. Data b => b -> b) -> Case -> Case)
-> (forall r r'.
    (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Case -> r)
-> (forall r r'.
    (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Case -> r)
-> (forall u. (forall d. Data d => d -> u) -> Case -> [u])
-> (forall u. Int -> (forall d. Data d => d -> u) -> Case -> u)
-> (forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> Case -> m Case)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> Case -> m Case)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> Case -> m Case)
-> Data Case
Case -> Constr
Case -> DataType
(forall b. Data b => b -> b) -> Case -> Case
forall a.
Typeable a =>
(forall (c :: * -> *).
 (forall d b. Data d => c (d -> b) -> d -> c b)
 -> (forall g. g -> c g) -> a -> c a)
-> (forall (c :: * -> *).
    (forall b r. Data b => c (b -> r) -> c r)
    -> (forall r. r -> c r) -> Constr -> c a)
-> (a -> Constr)
-> (a -> DataType)
-> (forall (t :: * -> *) (c :: * -> *).
    Typeable t =>
    (forall d. Data d => c (t d)) -> Maybe (c a))
-> (forall (t :: * -> * -> *) (c :: * -> *).
    Typeable t =>
    (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c a))
-> ((forall b. Data b => b -> b) -> a -> a)
-> (forall r r'.
    (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall r r'.
    (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> a -> r)
-> (forall u. (forall d. Data d => d -> u) -> a -> [u])
-> (forall u. Int -> (forall d. Data d => d -> u) -> a -> u)
-> (forall (m :: * -> *).
    Monad m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> (forall (m :: * -> *).
    MonadPlus m =>
    (forall d. Data d => d -> m d) -> a -> m a)
-> Data a
forall u. Int -> (forall d. Data d => d -> u) -> Case -> u
forall u. (forall d. Data d => d -> u) -> Case -> [u]
forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Case -> r
forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Case -> r
forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Case -> m Case
forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Case -> m Case
forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Case
forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Case -> c Case
forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Case)
forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Case)
$cgfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Case -> c Case
gfoldl :: forall (c :: * -> *).
(forall d b. Data d => c (d -> b) -> d -> c b)
-> (forall g. g -> c g) -> Case -> c Case
$cgunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Case
gunfold :: forall (c :: * -> *).
(forall b r. Data b => c (b -> r) -> c r)
-> (forall r. r -> c r) -> Constr -> c Case
$ctoConstr :: Case -> Constr
toConstr :: Case -> Constr
$cdataTypeOf :: Case -> DataType
dataTypeOf :: Case -> DataType
$cdataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Case)
dataCast1 :: forall (t :: * -> *) (c :: * -> *).
Typeable t =>
(forall d. Data d => c (t d)) -> Maybe (c Case)
$cdataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Case)
dataCast2 :: forall (t :: * -> * -> *) (c :: * -> *).
Typeable t =>
(forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Case)
$cgmapT :: (forall b. Data b => b -> b) -> Case -> Case
gmapT :: (forall b. Data b => b -> b) -> Case -> Case
$cgmapQl :: forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Case -> r
gmapQl :: forall r r'.
(r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Case -> r
$cgmapQr :: forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Case -> r
gmapQr :: forall r r'.
(r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Case -> r
$cgmapQ :: forall u. (forall d. Data d => d -> u) -> Case -> [u]
gmapQ :: forall u. (forall d. Data d => d -> u) -> Case -> [u]
$cgmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> Case -> u
gmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> Case -> u
$cgmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Case -> m Case
gmapM :: forall (m :: * -> *).
Monad m =>
(forall d. Data d => d -> m d) -> Case -> m Case
$cgmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Case -> m Case
gmapMp :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Case -> m Case
$cgmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Case -> m Case
gmapMo :: forall (m :: * -> *).
MonadPlus m =>
(forall d. Data d => d -> m d) -> Case -> m Case
Data.Data, Case -> Case -> Bool
(Case -> Case -> Bool) -> (Case -> Case -> Bool) -> Eq Case
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
$c== :: Case -> Case -> Bool
== :: Case -> Case -> Bool
$c/= :: Case -> Case -> Bool
/= :: Case -> Case -> Bool
Eq, Eq Case
Eq Case =>
(Case -> Case -> Ordering)
-> (Case -> Case -> Bool)
-> (Case -> Case -> Bool)
-> (Case -> Case -> Bool)
-> (Case -> Case -> Bool)
-> (Case -> Case -> Case)
-> (Case -> Case -> Case)
-> Ord Case
Case -> Case -> Bool
Case -> Case -> Ordering
Case -> Case -> Case
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
$ccompare :: Case -> Case -> Ordering
compare :: Case -> Case -> Ordering
$c< :: Case -> Case -> Bool
< :: Case -> Case -> Bool
$c<= :: Case -> Case -> Bool
<= :: Case -> Case -> Bool
$c> :: Case -> Case -> Bool
> :: Case -> Case -> Bool
$c>= :: Case -> Case -> Bool
>= :: Case -> Case -> Bool
$cmax :: Case -> Case -> Case
max :: Case -> Case -> Case
$cmin :: Case -> Case -> Case
min :: Case -> Case -> Case
Ord, Int -> Case -> ShowS
[Case] -> ShowS
Case -> String
(Int -> Case -> ShowS)
-> (Case -> String) -> ([Case] -> ShowS) -> Show Case
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
$cshowsPrec :: Int -> Case -> ShowS
showsPrec :: Int -> Case -> ShowS
$cshow :: Case -> String
show :: Case -> String
$cshowList :: [Case] -> ShowS
showList :: [Case] -> ShowS
Show)