Safe Haskell	Safe-Inferred
Language	Haskell2010

Language.Dickinson.Name

Synopsis

type TyName a = Name a
data Name a = Name {
- name :: NonEmpty Text
- unique :: !Unique
- loc :: a
}
type NameEnv a = IntMap (Name a)
isMain :: Name a -> Bool

Documentation

type TyName a = Name a Source #

data Name a Source #

A (possibly qualified) name.

Constructors

Name
Fields name :: NonEmpty Text unique :: !Unique loc :: a

Instances

Instances details

Functor Name Source #
Instance details Defined in Language.Dickinson.Name Methods fmap :: (a -> b) -> Name a -> Name b # (<$) :: a -> Name b -> Name a #
Data a => Data (Name a) Source #
Instance details Defined in Language.Dickinson.Name Methods gfoldl :: (forall d b. Data d => c (d -> b) -> d -> c b) -> (forall g. g -> c g) -> Name a -> c (Name a) # gunfold :: (forall b r. Data b => c (b -> r) -> c r) -> (forall r. r -> c r) -> Constr -> c (Name a) # toConstr :: Name a -> Constr # dataTypeOf :: Name a -> DataType # dataCast1 :: Typeable t => (forall d. Data d => c (t d)) -> Maybe (c (Name a)) # dataCast2 :: Typeable t => (forall d e. (Data d, Data e) => c (t d e)) -> Maybe (c (Name a)) # gmapT :: (forall b. Data b => b -> b) -> Name a -> Name a # gmapQl :: (r -> r' -> r) -> r -> (forall d. Data d => d -> r') -> Name a -> r # gmapQr :: forall r r'. (r' -> r -> r) -> r -> (forall d. Data d => d -> r') -> Name a -> r # gmapQ :: (forall d. Data d => d -> u) -> Name a -> [u] # gmapQi :: Int -> (forall d. Data d => d -> u) -> Name a -> u # gmapM :: Monad m => (forall d. Data d => d -> m d) -> Name a -> m (Name a) # gmapMp :: MonadPlus m => (forall d. Data d => d -> m d) -> Name a -> m (Name a) # gmapMo :: MonadPlus m => (forall d. Data d => d -> m d) -> Name a -> m (Name a) #
Generic (Name a) Source #
Instance details Defined in Language.Dickinson.Name Associated Types type Rep (Name a) :: Type -> Type # Methods from :: Name a -> Rep (Name a) x # to :: Rep (Name a) x -> Name a #
Show a => Show (Name a) Source #
Instance details Defined in Language.Dickinson.Name Methods showsPrec :: Int -> Name a -> ShowS # show :: Name a -> String # showList :: [Name a] -> ShowS #
Binary a => Binary (Name a) Source #
Instance details Defined in Language.Dickinson.Name Methods put :: Name a -> Put # get :: Get (Name a) # putList :: [Name a] -> Put #
NFData a => NFData (Name a) Source #
Instance details Defined in Language.Dickinson.Name Methods rnf :: Name a -> () #
Eq (Name a) Source #
Instance details Defined in Language.Dickinson.Name Methods (==) :: Name a -> Name a -> Bool # (/=) :: Name a -> Name a -> Bool #
Ord (Name a) Source #
Instance details Defined in Language.Dickinson.Name Methods compare :: Name a -> Name a -> Ordering # (<) :: Name a -> Name a -> Bool # (<=) :: Name a -> Name a -> Bool # (>) :: Name a -> Name a -> Bool # (>=) :: Name a -> Name a -> Bool # max :: Name a -> Name a -> Name a # min :: Name a -> Name a -> Name a #
Debug (Name a) Source #
Instance details Defined in Language.Dickinson.Name Methods debug :: Name a -> Doc b Source #
Pretty (Name a) Source #
Instance details Defined in Language.Dickinson.Name Methods pretty :: Name a -> Doc ann # prettyList :: [Name a] -> Doc ann #
type Rep (Name a) Source #
Instance details Defined in Language.Dickinson.Name type Rep (Name a) = D1 ('MetaData "Name" "Language.Dickinson.Name" "language-dickinson-1.4.3.0-u4JKvBug5L7Xak6MfKGcR-dickinson" 'False) (C1 ('MetaCons "Name" 'PrefixI 'True) (S1 ('MetaSel ('Just "name") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (NonEmpty Text)) :: (S1 ('MetaSel ('Just "unique") 'NoSourceUnpackedness 'SourceStrict 'DecidedStrict) (Rec0 Unique) :: S1 ('MetaSel ('Just "loc") 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 a))))

type NameEnv a = IntMap (Name a) Source #

isMain :: Name a -> Bool Source #