ghc-9.6.3: The GHC API

Safe Haskell | Safe-Inferred
Language | Haskell2010

GHC.Types.Name.Set

Contents

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

Synopsis

- type NameSet = UniqSet Name
- emptyNameSet :: NameSet
- unitNameSet :: Name -> NameSet
- mkNameSet :: [Name] -> NameSet
- unionNameSet :: NameSet -> NameSet -> NameSet
- unionNameSets :: [NameSet] -> NameSet
- minusNameSet :: NameSet -> NameSet -> NameSet
- elemNameSet :: Name -> NameSet -> Bool
- extendNameSet :: NameSet -> Name -> NameSet
- extendNameSetList :: NameSet -> [Name] -> NameSet
- delFromNameSet :: NameSet -> Name -> NameSet
- delListFromNameSet :: NameSet -> [Name] -> NameSet
- isEmptyNameSet :: NameSet -> Bool
- filterNameSet :: (Name -> Bool) -> NameSet -> NameSet
- intersectsNameSet :: NameSet -> NameSet -> Bool
- disjointNameSet :: NameSet -> NameSet -> Bool
- intersectNameSet :: NameSet -> NameSet -> NameSet
- nameSetAny :: (Name -> Bool) -> NameSet -> Bool
- nameSetAll :: (Name -> Bool) -> NameSet -> Bool
- nameSetElemsStable :: NameSet -> [Name]
- type FreeVars = NameSet
- isEmptyFVs :: NameSet -> Bool
- emptyFVs :: FreeVars
- plusFVs :: [FreeVars] -> FreeVars
- plusFV :: FreeVars -> FreeVars -> FreeVars
- mkFVs :: [Name] -> FreeVars
- addOneFV :: FreeVars -> Name -> FreeVars
- unitFV :: Name -> FreeVars
- delFV :: Name -> FreeVars -> FreeVars
- delFVs :: [Name] -> FreeVars -> FreeVars
- intersectFVs :: FreeVars -> FreeVars -> FreeVars
- type Defs = NameSet
- type Uses = NameSet
- type DefUse = (Maybe Defs, Uses)
- type DefUses = OrdList DefUse
- emptyDUs :: DefUses
- usesOnly :: Uses -> DefUses
- mkDUs :: [(Defs, Uses)] -> DefUses
- plusDU :: DefUses -> DefUses -> DefUses
- findUses :: DefUses -> Uses -> Uses
- duDefs :: DefUses -> Defs
- duUses :: DefUses -> Uses
- allUses :: DefUses -> Uses
- newtype NonCaffySet = NonCaffySet {
  - ncs_nameSet :: NameSet
  }

# Names set type

type NameSet = UniqSet Name Source #

## Manipulating these sets

emptyNameSet :: NameSet Source #

unitNameSet :: Name -> NameSet Source #

mkNameSet :: [Name] -> NameSet Source #

unionNameSet :: NameSet -> NameSet -> NameSet Source #

unionNameSets :: [NameSet] -> NameSet Source #

minusNameSet :: NameSet -> NameSet -> NameSet Source #

elemNameSet :: Name -> NameSet -> Bool Source #

extendNameSet :: NameSet -> Name -> NameSet Source #

extendNameSetList :: NameSet -> [Name] -> NameSet Source #

delFromNameSet :: NameSet -> Name -> NameSet Source #

delListFromNameSet :: NameSet -> [Name] -> NameSet Source #

isEmptyNameSet :: NameSet -> Bool Source #

filterNameSet :: (Name -> Bool) -> NameSet -> NameSet Source #

intersectsNameSet :: NameSet -> NameSet -> Bool Source #

disjointNameSet :: NameSet -> NameSet -> Bool Source #

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

intersectNameSet :: NameSet -> NameSet -> NameSet Source #

nameSetAny :: (Name -> Bool) -> NameSet -> Bool Source #

nameSetAll :: (Name -> Bool) -> NameSet -> Bool Source #

nameSetElemsStable :: 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 variables

type FreeVars = NameSet Source #

## Manipulating sets of free variables

isEmptyFVs :: NameSet -> Bool Source #

emptyFVs :: FreeVars Source #

plusFVs :: [FreeVars] -> FreeVars Source #

plusFV :: FreeVars -> FreeVars -> FreeVars Source #

mkFVs :: [Name] -> FreeVars Source #

addOneFV :: FreeVars -> Name -> FreeVars Source #

unitFV :: Name -> FreeVars Source #

delFV :: Name -> FreeVars -> FreeVars Source #

delFVs :: [Name] -> FreeVars -> FreeVars Source #

intersectFVs :: FreeVars -> FreeVars -> FreeVars Source #

# Defs and uses

type Defs = NameSet Source #

A set of names that are defined somewhere

type Uses = NameSet Source #

A set of names that are used somewhere

type 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

type DefUses = OrdList DefUse Source #

A number of `DefUse`s 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

emptyDUs :: DefUses Source #

usesOnly :: Uses -> DefUses Source #

mkDUs :: [(Defs, Uses)] -> DefUses Source #

plusDU :: DefUses -> DefUses -> DefUses Source #

findUses :: 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)

duDefs :: DefUses -> Defs Source #

duUses :: DefUses -> Uses Source #

Collect all `Uses`, regardless of whether the group is itself used, but remove `Defs` on the way

allUses :: DefUses -> Uses Source #

Just like `duUses`, but `Defs` are not eliminated from the `Uses` returned

# Non-CAFfy names

newtype NonCaffySet Source #

`Id`s which have no CAF references. This is a result of analysis of C--. It is always safe to use an empty `NonCaffySet`. TODO Refer to Note.

Constructors

NonCaffySet |

Fields

- ncs_nameSet :: NameSet

#### Instances

Instances details

Monoid NonCaffySet Source # |
Instance details Defined in GHC.Types.Name.Set Methods mempty :: NonCaffySet Source # mappend :: NonCaffySet -> NonCaffySet -> NonCaffySet Source # mconcat :: [NonCaffySet] -> NonCaffySet Source #
Semigroup NonCaffySet Source # |
Instance details Defined in GHC.Types.Name.Set Methods (<>) :: NonCaffySet -> NonCaffySet -> NonCaffySet Source # sconcat :: NonEmpty NonCaffySet -> NonCaffySet Source # stimes :: Integral b => b -> NonCaffySet -> NonCaffySet Source #