{-# LANGUAGE DeriveDataTypeable #-} module Burrito.Internal.Type.Case (Case(..)) where import qualified Data.Data as Data data Case = Lower | Upper deriving (Typeable Case DataType Constr 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 -> DataType Case -> Constr (forall b. Data b => b -> b) -> Case -> Case (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Case -> c Case (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c 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) $cUpper :: Constr $cLower :: Constr $tCase :: DataType gmapMo :: (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 gmapMp :: (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 gmapM :: (forall d. Data d => d -> m d) -> Case -> m Case $cgmapM :: forall (m :: * -> *). Monad m => (forall d. Data d => d -> m d) -> Case -> m Case gmapQi :: Int -> (forall d. Data d => d -> u) -> Case -> u $cgmapQi :: forall u. Int -> (forall d. Data d => d -> u) -> Case -> u gmapQ :: (forall d. Data d => d -> u) -> Case -> [u] $cgmapQ :: forall u. (forall d. Data d => d -> u) -> Case -> [u] gmapQr :: (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 gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Case -> r $cgmapQl :: forall r r'. (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Case -> r gmapT :: (forall b. Data b => b -> b) -> Case -> Case $cgmapT :: (forall b. Data b => b -> b) -> Case -> Case dataCast2 :: (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Case) $cdataCast2 :: forall (t :: * -> * -> *) (c :: * -> *). Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c Case) dataCast1 :: (forall d. Data d => c (t d)) -> Maybe (c Case) $cdataCast1 :: forall (t :: * -> *) (c :: * -> *). Typeable t => (forall d. Data d => c (t d)) -> Maybe (c Case) dataTypeOf :: Case -> DataType $cdataTypeOf :: Case -> DataType toConstr :: Case -> Constr $ctoConstr :: Case -> Constr gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Case $cgunfold :: forall (c :: * -> *). (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c Case gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Case -> c Case $cgfoldl :: forall (c :: * -> *). (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Case -> c Case $cp1Data :: Typeable Case Data.Data, Case -> Case -> Bool (Case -> Case -> Bool) -> (Case -> Case -> Bool) -> Eq Case forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a /= :: Case -> Case -> Bool $c/= :: Case -> Case -> Bool == :: Case -> Case -> Bool $c== :: 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 min :: Case -> Case -> Case $cmin :: Case -> Case -> Case max :: Case -> Case -> Case $cmax :: Case -> Case -> Case >= :: Case -> Case -> Bool $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 compare :: Case -> Case -> Ordering $ccompare :: Case -> Case -> Ordering $cp1Ord :: Eq 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 showList :: [Case] -> ShowS $cshowList :: [Case] -> ShowS show :: Case -> String $cshow :: Case -> String showsPrec :: Int -> Case -> ShowS $cshowsPrec :: Int -> Case -> ShowS Show)