GHC.Types.Var.Set

Var, Id and TyVar set types

A non-deterministic Variable Set

A non-deterministic set of variables. See Note [Deterministic UniqFM] in GHC.Types.Unique.DFM for explanation why it's not deterministic and why it matters. Use DVarSet if the set eventually gets converted into a list or folded over in a way where the order changes the generated code, for example when abstracting variables.

type IdSet = UniqSet Id Source #

Identifier Set

type TyVarSet = UniqSet TyVar Source #

Type Variable Set

type CoVarSet = UniqSet CoVar Source #

Coercion Variable Set

type TyCoVarSet = UniqSet TyCoVar Source #

Type or Coercion Variable Set

Manipulating these sets

emptyVarSet :: VarSet Source #

unitVarSet :: Var -> VarSet Source #

mkVarSet :: [Var] -> VarSet Source #

extendVarSet :: VarSet -> Var -> VarSet Source #

extendVarSetList :: VarSet -> [Var] -> VarSet Source #

elemVarSet :: Var -> VarSet -> Bool Source #

subVarSet :: VarSet -> VarSet -> Bool Source #

unionVarSet :: VarSet -> VarSet -> VarSet Source #

unionVarSets :: [VarSet] -> VarSet Source #

mapUnionVarSet :: (a -> VarSet) -> [a] -> VarSet Source #

map the function over the list, and union the results

intersectVarSet :: VarSet -> VarSet -> VarSet Source #

intersectsVarSet :: VarSet -> VarSet -> Bool Source #

disjointVarSet :: VarSet -> VarSet -> Bool Source #

isEmptyVarSet :: VarSet -> Bool Source #

delVarSet :: VarSet -> Var -> VarSet Source #

delVarSetList :: VarSet -> [Var] -> VarSet Source #

delVarSetByKey :: VarSet -> Unique -> VarSet Source #

minusVarSet :: VarSet -> VarSet -> VarSet Source #

filterVarSet :: (Var -> Bool) -> VarSet -> VarSet Source #

mapVarSet :: Uniquable b => (a -> b) -> UniqSet a -> UniqSet b Source #

anyVarSet :: (Var -> Bool) -> VarSet -> Bool Source #

allVarSet :: (Var -> Bool) -> VarSet -> Bool Source #

transCloVarSet :: (VarSet -> VarSet) -> VarSet -> VarSet Source #

fixVarSet :: (VarSet -> VarSet) -> VarSet -> VarSet Source #

lookupVarSet_Directly :: VarSet -> Unique -> Maybe Var Source #

lookupVarSet :: VarSet -> Var -> Maybe Var Source #

lookupVarSetByName :: VarSet -> Name -> Maybe Var Source #

sizeVarSet :: VarSet -> Int Source #

seqVarSet :: VarSet -> () Source #

elemVarSetByKey :: Unique -> VarSet -> Bool Source #

partitionVarSet :: (Var -> Bool) -> VarSet -> (VarSet, VarSet) Source #

pluralVarSet :: VarSet -> SDoc Source #

Determines the pluralisation suffix appropriate for the length of a set in the same way that plural from Outputable does for lists.

pprVarSet Source #

Arguments

:: VarSet	The things to be pretty printed
-> ([Var] -> SDoc)	The pretty printing function to use on the elements
-> SDoc	`SDoc` where the things have been pretty printed

Pretty-print a non-deterministic set. The order of variables is non-deterministic and for pretty-printing that shouldn't be a problem. Having this function helps contain the non-determinism created with nonDetEltsUFM. Passing a list to the pretty-printing function allows the caller to decide on the order of Vars (eg. toposort them) without them having to use nonDetEltsUFM at the call site. This prevents from let-binding non-deterministically ordered lists and reusing them where determinism matters.

nonDetStrictFoldVarSet :: (Var -> a -> a) -> a -> VarSet -> a Source #