ghc-8.2.2: The GHC API

Safe HaskellNone
LanguageHaskell2010

Unique

Contents

Synopsis

Main data types

data Unique #

Unique identifier.

The type of unique identifiers that are used in many places in GHC for fast ordering and equality tests. You should generate these with the functions from the UniqSupply module

These are sometimes also referred to as "keys" in comments in GHC.

class Uniquable a where #

Class of things that we can obtain a Unique from

Minimal complete definition

getUnique

Methods

getUnique :: a -> Unique #

Instances

Uniquable Int # 

Methods

getUnique :: Int -> Unique #

Uniquable Name # 

Methods

getUnique :: Name -> Unique #

Uniquable OccName # 

Methods

getUnique :: OccName -> Unique #

Uniquable TyCon # 

Methods

getUnique :: TyCon -> Unique #

Uniquable FastString # 
Uniquable ComponentId # 
Uniquable InstalledUnitId # 
Uniquable UnitId # 

Methods

getUnique :: UnitId -> Unique #

Uniquable ModuleName # 
Uniquable Module # 

Methods

getUnique :: Module -> Unique #

Uniquable Unique # 

Methods

getUnique :: Unique -> Unique #

Uniquable RegClass # 

Methods

getUnique :: RegClass -> Unique #

Uniquable Reg #

so we can put regs in UniqSets

Methods

getUnique :: Reg -> Unique #

Uniquable Reg # 

Methods

getUnique :: Reg -> Unique #

Uniquable RealReg # 

Methods

getUnique :: RealReg -> Unique #

Uniquable VirtualReg # 
Uniquable PackageName # 
Uniquable SourcePackageId # 
Uniquable Var # 

Methods

getUnique :: Var -> Unique #

Uniquable PatSyn # 

Methods

getUnique :: PatSyn -> Unique #

Uniquable DataCon # 

Methods

getUnique :: DataCon -> Unique #

Uniquable ConLike # 

Methods

getUnique :: ConLike -> Unique #

Uniquable CoAxiomRule # 
Uniquable Class # 

Methods

getUnique :: Class -> Unique #

Uniquable LocalReg # 

Methods

getUnique :: LocalReg -> Unique #

Uniquable EvBindsVar # 
Uniquable name => Uniquable (AnnTarget name) # 

Methods

getUnique :: AnnTarget name -> Unique #

Uniquable (CoAxiom br) # 

Methods

getUnique :: CoAxiom br -> Unique #

Constructors, destructors and operations on Uniques

hasKey :: Uniquable a => a -> Unique -> Bool #

isValidKnownKeyUnique :: Unique -> Bool #

The interface file symbol-table encoding assumes that known-key uniques fit in 30-bits; verify this.

See Note [Symbol table representation of names] in BinIface for details.

Making built-in uniques

Deriving uniques

From TyCon name uniques

From DataCon name uniques