Moduleghc-10.0.0.20260917GHC2024

GHC.Types.Name.Set

Contents

Names set type
Manipulating these sets
Free names
Defs and uses
Manipulating defs and uses
Non-CAFfy names

Synopsis

type NameSet
value emptyNameSet
value unitNameSet
value mkNameSet
value unionNameSet
value unionNameSets
value minusNameSet
value elemNameSet
value extendNameSet
value extendNameSetList
value delFromNameSet
value delListFromNameSet
value isEmptyNameSet
value filterNameSet
value intersectsNameSet
value disjointNameSet
value intersectNameSet
value nameSetAny
value nameSetAll
value nameSetElemsStable
type FreeNames
value isEmptyFNs
value emptyFNs
value plusFNs
value plusFN
value mkFNs
value addOneFN
value unitFN
value delFN
value delFNs
value intersectFNs
value intersectsFNs
type Defs
type Uses
type DefUse
type DefUses
value emptyDUs
value usesOnly
value mkDUs
value plusDU
value findUses
value duDefs
value duUses
value allUses
newtype NonCaffySet

Packageghc-10.0.0.20260917
Exports45
LanguageGHC2024
LicenceBSD-3-Clause
SourceSet.hs

Names set type

typetype NameSet = UniqSet Name

Manipulating these sets

valueemptyNameSet :: NameSet

valueunitNameSet :: Name -> NameSet

valuemkNameSet :: [Name] -> NameSet

valueunionNameSet :: NameSet -> NameSet -> NameSet

valueunionNameSets :: [NameSet] -> NameSet

valueminusNameSet :: NameSet -> NameSet -> NameSet

valueelemNameSet :: Name -> NameSet -> Bool

valueextendNameSet :: NameSet -> Name -> NameSet

valueextendNameSetList :: NameSet -> [Name] -> NameSet

valuedelFromNameSet :: NameSet -> Name -> NameSet

valuedelListFromNameSet :: NameSet -> [Name] -> NameSet

valueisEmptyNameSet :: NameSet -> Bool

valuefilterNameSet :: (Name -> Bool) -> NameSet -> NameSet

valueintersectsNameSet :: NameSet -> NameSet -> Bool

valuedisjointNameSet :: NameSet -> NameSet -> Bool

Source#

True if there is a non-empty intersection. s1 intersectsNameSet s2 doesn't compute s2 if s1 is empty

valueintersectNameSet :: NameSet -> NameSet -> NameSet

valuenameSetAny :: (Name -> Bool) -> NameSet -> Bool

valuenameSetAll :: (Name -> Bool) -> NameSet -> Bool

valuenameSetElemsStable :: NameSet -> [Name]

Source#

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 names

typetype FreeNames = NameSet

valueisEmptyFNs :: FreeNames -> Bool

valueemptyFNs :: FreeNames

valueplusFNs :: [FreeNames] -> FreeNames

valueplusFN :: FreeNames -> FreeNames -> FreeNames

valuemkFNs :: [Name] -> FreeNames

valueaddOneFN :: FreeNames -> Name -> FreeNames

valueunitFN :: Name -> FreeNames

valuedelFN :: Name -> FreeNames -> FreeNames

valuedelFNs :: [Name] -> FreeNames -> FreeNames

valueintersectFNs :: FreeNames -> FreeNames -> FreeNames

valueintersectsFNs :: FreeNames -> FreeNames -> Bool

Defs and uses

typetype Defs = NameSet

Source#

A set of names that are defined somewhere

typetype Uses = NameSet

Source#

A set of names that are used somewhere

typetype DefUse = (Maybe Defs, Uses)

Source#

(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

Source#

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

Source#

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)