| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
FV
Synopsis
- type FV = InterestingVarFun -> VarSet -> ([Var], VarSet) -> ([Var], VarSet)
- type InterestingVarFun = Var -> Bool
- fvVarListVarSet :: FV -> ([Var], VarSet)
- fvVarList :: FV -> [Var]
- fvVarSet :: FV -> VarSet
- fvDVarSet :: FV -> DVarSet
- unitFV :: Id -> FV
- emptyFV :: FV
- mkFVs :: [Var] -> FV
- unionFV :: FV -> FV -> FV
- unionsFV :: [FV] -> FV
- delFV :: Var -> FV -> FV
- delFVs :: VarSet -> FV -> FV
- filterFV :: InterestingVarFun -> FV -> FV
- mapUnionFV :: (a -> FV) -> [a] -> FV
Deterministic free vars computations
type InterestingVarFun = Var -> Bool Source #
Predicate on possible free variables: returns True iff the variable is
interesting
Running the computations
fvVarListVarSet :: FV -> ([Var], VarSet) Source #
Run a free variable computation, returning a list of distinct free variables in deterministic order and a non-deterministic set containing those variables.
fvVarList :: FV -> [Var] Source #
Run a free variable computation, returning a list of distinct free variables in deterministic order.
fvVarSet :: FV -> VarSet Source #
Run a free variable computation, returning a non-deterministic set of free variables. Don't use if the set will be later converted to a list and the order of that list will impact the generated code.
fvDVarSet :: FV -> DVarSet Source #
Run a free variable computation, returning a deterministic set of free
variables. Note that this is just a wrapper around the version that
returns a deterministic list. If you need a list you should use
fvVarList.
Manipulating those computations
Add a variable - when free, to the returned free variables. Ignores duplicates and respects the filtering function.
Add multiple variables - when free, to the returned free variables. Ignores duplicates and respects the filtering function.
mapUnionFV :: (a -> FV) -> [a] -> FV Source #
Map a free variable computation over a list and union the results.