GHC.Types.Name.Set · ghc-9.10.3

Get the elements of a NameSet with some stable ordering. This only works for Names that originate in the source code or have been tidied. See Note [Deterministic UniqFM] to learn about nondeterminism

Free variables

1 declaration

typetype FreeVars = NameSet

#

Manipulating sets of free variables

valueisEmptyFVs :: NameSet -> Bool

#

valueemptyFVs :: FreeVars

#

valueplusFVs :: [FreeVars] -> FreeVars

#

valueplusFV :: FreeVars -> FreeVars -> FreeVars

#

valuemkFVs :: [Name] -> FreeVars

#

valueaddOneFV :: FreeVars -> Name -> FreeVars

#

valueunitFV :: Name -> FreeVars

#

valuedelFV :: Name -> FreeVars -> FreeVars

#

valuedelFVs :: [Name] -> FreeVars -> FreeVars

#

valueintersectFVs :: FreeVars -> FreeVars -> FreeVars

#

valueintersectsFVs :: FreeVars -> FreeVars -> Bool

#

Defs and uses

4 declarations

typetype Defs = NameSet

#

A set of names that are defined somewhere

typetype Uses = NameSet

#

A set of names that are used somewhere

typetype DefUse = (Maybe Defs, Uses)

#

(Just ds, us) => The use of any member of the ds implies that all the us are used too. Also, us may mention ds.

Nothing => Nothing is defined in this group, but nevertheless all the uses are essential. Used for instance declarations, for example

typetype DefUses = OrdList DefUse

#

A number of DefUses in dependency order: earlier Defs scope over later Uses In a single (def, use) pair, the defs also scope over the uses

Manipulating defs and uses

valueemptyDUs :: DefUses

#

valueusesOnly :: Uses -> DefUses

#

valuemkDUs :: [(Defs, Uses)] -> DefUses

#

valueplusDU :: DefUses -> DefUses -> DefUses

#

valuefindUses :: DefUses -> Uses -> Uses

#

Given some DefUses and some Uses, find all the uses, transitively. The result is a superset of the input Uses; and includes things defined in the input DefUses (but only if they are used)