Safe Haskell	None
Language	Haskell2010

Language.Haskell.Exts.Util

Contents

Synopsis

Free variables of ASTs

class FreeVars a where Source #

Minimal complete definition

Methods

Return the variables, erring on the side of more free variables

Instances

(Data s, Ord s) => FreeVars [IPBind s] Source #
Methods freeVars :: [IPBind s] -> Set (Name ()) Source #
(Data s, Ord s) => FreeVars [Exp s] Source #
Methods freeVars :: [Exp s] -> Set (Name ()) Source #
(Data s, Ord s) => FreeVars [Alt s] Source #
Methods freeVars :: [Alt s] -> Set (Name ()) Source #
(Data s, Ord s) => FreeVars (Set (Name s)) Source #
Methods freeVars :: Set (Name s) -> Set (Name ()) Source #
(Data s, Ord s) => FreeVars (IPBind s) Source #
Methods freeVars :: IPBind s -> Set (Name ()) Source #
(Data s, Ord s) => FreeVars (Rhs s) Source #
Methods freeVars :: Rhs s -> Set (Name ()) Source #
(Data s, Ord s) => FreeVars (GuardedRhs s) Source #
Methods freeVars :: GuardedRhs s -> Set (Name ()) Source #
(Data s, Ord s) => FreeVars (Exp s) Source #
Methods freeVars :: Exp s -> Set (Name ()) Source #
(Data s, Ord s) => FreeVars (Alt s) Source #
Methods freeVars :: Alt s -> Set (Name ()) Source #

Constructors

Vars
Fields bound :: Set (Name ()) free :: Set (Name ())

Instances

Semigroup Vars Source #
Methods (<>) :: Vars -> Vars -> Vars # sconcat :: NonEmpty Vars -> Vars # stimes :: Integral b => b -> Vars -> Vars #
Monoid Vars Source #
Methods mempty :: Vars # mappend :: Vars -> Vars -> Vars # mconcat :: [Vars] -> Vars #
AllVars Vars Source #
Methods allVars :: Vars -> Vars Source #

class AllVars a where Source #

Minimal complete definition

Methods

Return the variables, erring on the side of more free variables

Instances

AllVars Vars Source #
Methods allVars :: Vars -> Vars Source #
(Data s, Ord s) => AllVars [Decl s] Source #
Methods allVars :: [Decl s] -> Vars Source #
(Data s, Ord s) => AllVars [Match s] Source #
Methods allVars :: [Match s] -> Vars Source #
(Data s, Ord s) => AllVars [Pat s] Source #
Methods allVars :: [Pat s] -> Vars Source #
(Data s, Ord s) => AllVars [Stmt s] Source #
Methods allVars :: [Stmt s] -> Vars Source #
(Data s, Ord s) => AllVars [QualStmt s] Source #
Methods allVars :: [QualStmt s] -> Vars Source #
(Data s, Ord s) => AllVars (Maybe (Binds s)) Source #
Methods allVars :: Maybe (Binds s) -> Vars Source #
(Data s, Ord s) => AllVars (Decl s) Source #
Methods allVars :: Decl s -> Vars Source #
(Data s, Ord s) => AllVars (Binds s) Source #
Methods allVars :: Binds s -> Vars Source #
(Data s, Ord s) => AllVars (Match s) Source #
Methods allVars :: Match s -> Vars Source #
(Data s, Ord s) => AllVars (Pat s) Source #
Methods allVars :: Pat s -> Vars Source #
(Data s, Ord s) => AllVars (Stmt s) Source #
Methods allVars :: Stmt s -> Vars Source #
(Data s, Ord s) => AllVars (QualStmt s) Source #
Methods allVars :: QualStmt s -> Vars Source #

Rebracketing of ASTs

class Brackets a where Source #

Minimal complete definition

Methods

Is this item lexically requiring no bracketing ever i.e. is totally atomic

Is the child safe free from brackets in the parent position. Err on the side of caution, True = don't know

Instances

Default l => Brackets (Type l) Source #
Methods remParen :: Type l -> Maybe (Type l) Source # addParen :: Type l -> Type l Source # isAtom :: Type l -> Bool Source # needBracket :: Int -> Type l -> Type l -> Bool Source #
(Data l, Default l) => Brackets (Exp l) Source #
Methods remParen :: Exp l -> Maybe (Exp l) Source # addParen :: Exp l -> Exp l Source # isAtom :: Exp l -> Bool Source # needBracket :: Int -> Exp l -> Exp l -> Bool Source #
Default l => Brackets (Pat l) Source #
Methods remParen :: Pat l -> Maybe (Pat l) Source # addParen :: Pat l -> Pat l Source # isAtom :: Pat l -> Bool Source # needBracket :: Int -> Pat l -> Pat l -> Bool Source #

Add a Paren around something if it is not atomic

Add/remove brackets as suggested needBracket at 1-level of depth