| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Language.Haskell.Exts.Util
- class FreeVars a where
- data Vars = Vars {}
- class AllVars a where
- class Brackets a where
- paren :: (Data l, Default l) => Exp l -> Exp l
- transformBracket :: (Data l, Default l) => (Exp l -> Maybe (Exp l)) -> Exp l -> Exp l
- rebracket1 :: (Data l, Default l) => Exp l -> Exp l
- appsBracket :: (Data l, Default l) => [Exp l] -> Exp l
Free variables of ASTs
Minimal complete definition
Methods
freeVars :: a -> Set (Name ()) #
Return the variables, erring on the side of more free variables
Instances
| (Data s, Ord s) => FreeVars [IPBind s] # | |
| (Data s, Ord s) => FreeVars [Exp s] # | |
| (Data s, Ord s) => FreeVars [Alt s] # | |
| (Data s, Ord s) => FreeVars (Set (Name s)) # | |
| (Data s, Ord s) => FreeVars (IPBind s) # | |
| (Data s, Ord s) => FreeVars (Rhs s) # | |
| (Data s, Ord s) => FreeVars (GuardedRhs s) # | |
| (Data s, Ord s) => FreeVars (Exp s) # | |
| (Data s, Ord s) => FreeVars (Alt s) # | |
Minimal complete definition
Instances
| AllVars Vars # | |
| (Data s, Ord s) => AllVars [Decl s] # | |
| (Data s, Ord s) => AllVars [Match s] # | |
| (Data s, Ord s) => AllVars [Pat s] # | |
| (Data s, Ord s) => AllVars [Stmt s] # | |
| (Data s, Ord s) => AllVars [QualStmt s] # | |
| (Data s, Ord s) => AllVars (Maybe (Binds s)) # | |
| (Data s, Ord s) => AllVars (Decl s) # | |
| (Data s, Ord s) => AllVars (Binds s) # | |
| (Data s, Ord s) => AllVars (Match s) # | |
| (Data s, Ord s) => AllVars (Pat s) # | |
| (Data s, Ord s) => AllVars (Stmt s) # | |
| (Data s, Ord s) => AllVars (QualStmt s) # | |
Rebracketing of ASTs
Minimal complete definition
Methods
Is this item lexically requiring no bracketing ever i.e. is totally atomic
needBracket :: Int -> a -> a -> Bool #
Is the child safe free from brackets in the parent position. Err on the side of caution, True = don't know
rebracket1 :: (Data l, Default l) => Exp l -> Exp l #
Add/remove brackets as suggested needBracket at 1-level of depth