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