Safe Haskell | Safe-Inferred |
---|---|
Language | Haskell2010 |
Synopsis
- data Names
- namesToList :: Names -> [Name]
- anyOne :: Names -> Name
- namesFromSet :: Set Name -> Names
- unionManyNames :: [Names] -> Maybe Names
- mapNames :: (Name -> Name) -> Names -> Names
- filterNames :: (Name -> Bool) -> Names -> Maybe Names
- travNames :: Applicative f => (Name -> f Name) -> Names -> f Names
- diffNames :: Names -> Names -> Maybe Names
Documentation
A non-empty collection of names used by the renamer.
Instances
Semigroup Names Source # | |
Generic Names Source # | |
Show Names Source # | |
NFData Names Source # | |
Defined in Cryptol.ModuleSystem.Names | |
type Rep Names Source # | |
Defined in Cryptol.ModuleSystem.Names type Rep Names = D1 ('MetaData "Names" "Cryptol.ModuleSystem.Names" "cryptol-3.2.0-35bDsq0QUVdvBXha47jji" 'False) (C1 ('MetaCons "One" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 Name)) :+: C1 ('MetaCons "Ambig" 'PrefixI 'False) (S1 ('MetaSel ('Nothing :: Maybe Symbol) 'NoSourceUnpackedness 'NoSourceStrictness 'DecidedLazy) (Rec0 (Set Name)))) |
namesToList :: Names -> [Name] Source #
The returned list of names will be non-empty.