Language.Haskell.Refact.API

This module should provide all that is required to write further refactorings. NOTE: it is currently unstable, and may change without notice on minor version number bumps

from Monad

type ParseResult = TypecheckedModule

Result of parsing a Haskell source file. It is simply the TypeCheckedModule produced by GHC.

data VerboseLevel

Constructors

Debug

Normal

Off

Instances

Eq VerboseLevel

Methods

(==) :: VerboseLevel -> VerboseLevel -> Bool

(/=) :: VerboseLevel -> VerboseLevel -> Bool

Show VerboseLevel

Methods

showsPrec :: Int -> VerboseLevel -> ShowS

show :: VerboseLevel -> String

showList :: [VerboseLevel] -> ShowS

data RefactSettings

Constructors

RefSet

Fields

• rsetVerboseLevel :: !VerboseLevel
• rsetEnabledTargets :: (Bool, Bool, Bool, Bool)

Instances

Show RefactSettings

Methods

showsPrec :: Int -> RefactSettings -> ShowS

show :: RefactSettings -> String

showList :: [RefactSettings] -> ShowS

type TargetModule = ModulePath

data RefactFlags

Constructors

RefFlags

Fields

• rsDone :: !Bool

  Current traversal has already made a change

Instances

Show RefactFlags

Methods

showsPrec :: Int -> RefactFlags -> ShowS

show :: RefactFlags -> String

showList :: [RefactFlags] -> ShowS

data StateStorage

Provide some temporary storage while the refactoring is taking place

Constructors

StorageNone

StorageBind (LHsBind Name)

StorageSig (LSig Name)

StorageBindRdr (LHsBind RdrName)

StorageDeclRdr (LHsDecl RdrName)

StorageSigRdr (LSig RdrName)

Instances

Show StateStorage

Methods

showsPrec :: Int -> StateStorage -> ShowS

show :: StateStorage -> String

showList :: [StateStorage] -> ShowS

The GHC Monad

data RefactGhc a

Instances

Monad RefactGhc

Methods

(>>=) :: RefactGhc a -> (a -> RefactGhc b) -> RefactGhc b

(>>) :: RefactGhc a -> RefactGhc b -> RefactGhc b

return :: a -> RefactGhc a

fail :: String -> RefactGhc a

Functor RefactGhc

Methods

fmap :: (a -> b) -> RefactGhc a -> RefactGhc b

(<$) :: a -> RefactGhc b -> RefactGhc a

Applicative RefactGhc

Methods

pure :: a -> RefactGhc a

(<*>) :: RefactGhc (a -> b) -> RefactGhc a -> RefactGhc b

(*>) :: RefactGhc a -> RefactGhc b -> RefactGhc b

(<*) :: RefactGhc a -> RefactGhc b -> RefactGhc a

MonadIO RefactGhc

Methods

liftIO :: IO a -> RefactGhc a

MonadPlus RefactGhc

Methods

mzero :: RefactGhc a

mplus :: RefactGhc a -> RefactGhc a -> RefactGhc a

Alternative RefactGhc

Methods

empty :: RefactGhc a

(<|>) :: RefactGhc a -> RefactGhc a -> RefactGhc a

some :: RefactGhc a -> RefactGhc [a]

many :: RefactGhc a -> RefactGhc [a]

GhcMonad RefactGhc

Methods

getSession :: RefactGhc HscEnv

setSession :: HscEnv -> RefactGhc ()

HasDynFlags RefactGhc

Methods

getDynFlags :: RefactGhc DynFlags

ExceptionMonad RefactGhc

Methods

gcatch :: Exception e => RefactGhc a -> (e -> RefactGhc a) -> RefactGhc a

gmask :: ((RefactGhc a -> RefactGhc a) -> RefactGhc b) -> RefactGhc b

gbracket :: RefactGhc a -> (a -> RefactGhc b) -> (a -> RefactGhc c) -> RefactGhc c

gfinally :: RefactGhc a -> RefactGhc b -> RefactGhc a

GmOut RefactGhc

Methods

gmoAsk :: RefactGhc GhcModOut

GmEnv RefactGhc

Methods

gmeAsk :: RefactGhc GhcModEnv

gmeReader :: (GhcModEnv -> a) -> RefactGhc a

gmeLocal :: (GhcModEnv -> GhcModEnv) -> RefactGhc a -> RefactGhc a

MonadIO RefactGhc

Methods

liftIO :: IO a -> RefactGhc a

MonadState RefactState RefactGhc

Methods

get :: RefactGhc RefactState

put :: RefactState -> RefactGhc ()

state :: (RefactState -> (a, RefactState)) -> RefactGhc a

runRefactGhc :: RefactGhc a -> RefactState -> Options -> IO (a, RefactState)

getRefacSettings :: RefactGhc RefactSettings

defaultSettings :: RefactSettings

logSettings :: RefactSettings

logm :: String -> RefactGhc ()

logDataWithAnns :: Data a => String -> a -> RefactGhc ()

logExactprint :: Annotate a => String -> Located a -> RefactGhc ()

logParsedSource :: String -> RefactGhc ()

from Utils

Managing the GHC / project environment

parseSourceFileGhc :: FilePath -> RefactGhc ()

Parse a single source file into a GHC session

getTargetGhc :: TargetModule -> RefactGhc ()

The bits that do the work

runRefacSession

Arguments

:: RefactSettings

-> Options

ghc-mod options

-> RefactGhc [ApplyRefacResult]

The computation doing the refactoring. Normally created via applyRefac

-> IO [FilePath]

Manage a whole refactor session. Initialise the monad, load the whole project if required, and then apply the individual refactorings, and write out the resulting files.

It is intended that this forms the umbrella function, in which applyRefac is called

applyRefac

Arguments

:: RefactGhc a

The refactoring

-> RefacSource

where to get the module and toks

-> RefactGhc (ApplyRefacResult, a)

Apply a refactoring (or part of a refactoring) to a single module

refactDone :: [ApplyRefacResult] -> Bool

Returns True if any of the results has its modified flag set

type ApplyRefacResult = ((FilePath, RefacResult), (Anns, ParsedSource))

The result of a refactoring is the file, a flag as to whether it was modified, and the updated AST

data RefacSource

Constructors

RSFile FilePath

RSTarget TargetModule

RSMod ModSummary

RSAlreadyLoaded

nameSybQuery :: (Typeable a, Typeable t) => (Located a -> Maybe r) -> t -> Maybe r

fileNameFromModSummary :: ModSummary -> FilePath

getModuleName :: ParsedSource -> Maybe (ModuleName, String)

Extract the module name from the parsed source, if there is one

clientModsAndFiles :: ModulePath -> RefactGhc [TargetModule]

Return the client modules and file names. The client modules of module, say m, are those modules which directly or indirectly import module m.

serverModsAndFiles :: GhcMonad m => ModuleName -> m [ModSummary]

Return the server module and file names. The server modules of module, say m, are those modules which are directly or indirectly imported by module m. This can only be called in a live GHC session TODO: make sure this works with multiple targets. Is that needed? No?

stripCallStack :: String -> String

In GHC 8 an error has an attached callstack. This is not always what we want, so this function strips it

from MonadFunctions

Conveniences for state access

getTypecheckedModule :: RefactGhc TypecheckedModule

data RefacResult

Constructors

RefacModified

RefacUnmodifed

Instances

Eq RefacResult

Methods

(==) :: RefacResult -> RefacResult -> Bool

(/=) :: RefacResult -> RefacResult -> Bool

Ord RefacResult

Methods

compare :: RefacResult -> RefacResult -> Ordering

(<) :: RefacResult -> RefacResult -> Bool

(<=) :: RefacResult -> RefacResult -> Bool

(>) :: RefacResult -> RefacResult -> Bool

(>=) :: RefacResult -> RefacResult -> Bool

max :: RefacResult -> RefacResult -> RefacResult

min :: RefacResult -> RefacResult -> RefacResult

Show RefacResult

Methods

showsPrec :: Int -> RefacResult -> ShowS

show :: RefacResult -> String

showList :: [RefacResult] -> ShowS

getRefactStreamModified :: RefactGhc RefacResult

setRefactStreamModified :: RefacResult -> RefactGhc ()

For testing

getRefactInscopes :: RefactGhc InScopes

getRefactRenamed :: RefactGhc RenamedSource

putRefactRenamed :: RenamedSource -> RefactGhc ()

getRefactParsed :: RefactGhc ParsedSource

putRefactParsed :: ParsedSource -> Anns -> RefactGhc ()

putParsedModule :: [Comment] -> TypecheckedModule -> RefactGhc ()

clearParsedModule :: RefactGhc ()

getRefactFileName :: RefactGhc (Maybe FilePath)

getRefactTargetModule :: RefactGhc TargetModule

getRefactNameMap :: RefactGhc NameMap

getRefactModule :: RefactGhc Module

getRefactModuleName :: RefactGhc ModuleName

New ghc-exactprint interfacing

liftT :: HasTransform m => forall a. Transform a -> m a

State flags for managing generic traversals

getRefactDone :: RefactGhc Bool

setRefactDone :: RefactGhc ()

clearRefactDone :: RefactGhc ()

setStateStorage :: StateStorage -> RefactGhc ()

getStateStorage :: RefactGhc StateStorage

Parsing source

parseDeclWithAnns :: String -> RefactGhc (LHsDecl RdrName)

from LocUtils

type SimpPos = (Int, Int)

getGhcLoc :: SrcSpan -> (Int, Int)

gets the (row,col) of the start of the GHC.SrcSpan, or (-1,-1) if there is an GHC.UnhelpfulSpan

getGhcLocEnd :: SrcSpan -> (Int, Int)

gets the (row,col) of the end of the GHC.SrcSpan, or (-1,-1) if there is an GHC.UnhelpfulSpan

getLocatedStart :: GenLocated SrcSpan t -> (Int, Int)

getLocatedEnd :: GenLocated SrcSpan t -> (Int, Int)

getStartEndLoc :: Data t => t -> (SimpPos, SimpPos)

startEndLocGhc :: Located b -> (SimpPos, SimpPos)

emptyList :: [t] -> Bool

Get around lack of instance Eq when simply testing for empty list TODO: get rid of this in favour of null built in fn

nonEmptyList :: [t] -> Bool

from TypeSyn

type InScopes = [Name]

ghead :: String -> [a] -> a

glast :: String -> [a] -> a

gtail :: String -> [a] -> [a]

gfromJust :: String -> Maybe a -> a

from TypeUtils

Program Analysis

Imports and exports

inScopeInfo

Arguments

:: InScopes

The inscope relation .

-> [(String, NameSpace, ModuleName, Maybe ModuleName)]

The result

Process the inscope relation returned from the parsing and module analysis pass, and return a list of four-element tuples. Each tuple contains an identifier name, the identifier's namespace info, the identifier's defining module name and its qualifier name.

The same identifier may have multiple entries in the result because it may have different qualifiers. This makes it easier to decide whether the identifier can be used unqualifiedly by just checking whether there is an entry for it with the qualifier field being Nothing.

isInScopeAndUnqualified

Arguments

:: String

The identifier name.

-> InScopes

The inscope relation

-> Bool

The result.

Return True if the identifier is inscope and can be used without a qualifier.

isInScopeAndUnqualifiedGhc

Arguments

:: String

The identifier name.

-> Maybe Name

Existing name, to be excluded from test, if known

-> RefactGhc Bool

The result.

Return True if the identifier is inscope and can be used without a qualifier. The identifier name string may have a qualifier already NOTE: may require qualification based on name clash with an existing identifier.

inScopeNames

Arguments

:: String

The identifier name.

-> RefactGhc [Name]

The result.

Return all Names that correspond to the given string, in the current module.

isExported :: Name -> RefactGhc Bool

Return True if an identifier is exported by the module currently being refactored.

isExplicitlyExported

Arguments

:: NameMap

-> Name

The identifier

-> ParsedSource

The AST of the module

-> Bool

The result

Return True if an identifier is explicitly exported by the module.

modIsExported

Arguments

:: ModuleName

The module name

-> RenamedSource

The AST of the module

-> Bool

The result

Return True if the current module is exported either by default or by specifying the module name in the export.

equivalentNameInNewMod :: Name -> RefactGhc [Name]

Given a Name defined in one module, find the equivalent one in the currently loaded module. This is required otherwise name equality checking based on nameUnique will fail.

hsQualifier

Arguments

:: Name

The identifier.

-> RefactGhc [ModuleName]

The result.

Return all the possible qualifiers for the identifier. The identifier is not inscope if the result is an empty list. NOTE: This is intended to be used when processing a client module, so the Name parameter is actually from a different module.

Variable analysis

isFieldName :: Name -> Bool

True if the name is a field name

isClassName :: Name -> Bool

True if the name is a field name

isInstanceName :: Name -> Bool

True if the name is a class instance

hsTypeVbls :: Data t => t -> ([RdrName], [RdrName])

Collect those type variables that are declared in a given syntax phrase t. In the returned result, the first list is always be empty.

hsNamessRdr :: Data t => t -> [Located RdrName]

Get all the names in the given syntax element

isDeclaredInRdr :: NameMap -> Name -> [LHsDecl RdrName] -> Bool

data FreeNames

For free variables

Constructors

FN

Fields

• fn :: [Name]

Instances

Show FreeNames

Methods

showsPrec :: Int -> FreeNames -> ShowS

show :: FreeNames -> String

showList :: [FreeNames] -> ShowS

Monoid FreeNames

Methods

mempty :: FreeNames

mappend :: FreeNames -> FreeNames -> FreeNames

mconcat :: [FreeNames] -> FreeNames

data DeclaredNames

For declared variables

Constructors

DN

Fields

• dn :: [Name]

Instances

Show DeclaredNames

Methods

showsPrec :: Int -> DeclaredNames -> ShowS

show :: DeclaredNames -> String

showList :: [DeclaredNames] -> ShowS

Monoid DeclaredNames

Methods

mempty :: DeclaredNames

mappend :: DeclaredNames -> DeclaredNames -> DeclaredNames

mconcat :: [DeclaredNames] -> DeclaredNames

hsFreeAndDeclaredNameStrings :: Data t => t -> RefactGhc ([String], [String])

The same as hsFreeAndDeclaredPNs except that the returned variables are in the String format.

hsFreeAndDeclaredRdr :: Data t => NameMap -> t -> (FreeNames, DeclaredNames)

Collect the free and declared variables (in the GHC.Name format) in a given syntax phrase t. In the result, the first list contains the free variables, and the second list contains the declared variables. Expects RenamedSource

hsFreeAndDeclaredPNs :: Data t => t -> RefactGhc ([Name], [Name])

Return the free and declared Names in the given syntax fragment. The syntax fragment MUST be parameterised by RdrName, else the empty list will be returned.

getDeclaredVarsRdr :: NameMap -> [LHsDecl RdrName] -> [Name]

hsVisibleNamesRdr :: Data t2 => Name -> t2 -> RefactGhc [String]

Same as hsVisiblePNsRdr except that the returned identifiers are in String format.

hsFDsFromInsideRdr :: Data t => NameMap -> t -> (FreeNames, DeclaredNames)

hsFDsFromInsideRdr is different from hsFreeAndDeclaredPNs in that: given an syntax phrase t, hsFDsFromInsideRdr returns not only the declared variables that are visible from outside of t, but also those declared variables that are visible to the main expression inside t. NOTE: Expects to be given ParsedSource

hsFDNamesFromInsideRdr :: Data t => t -> RefactGhc ([String], [String])

The same as hsFDsFromInside except that the returned variables are in the String format

hsFDNamesFromInsideRdrPure :: Data t => NameMap -> t -> ([String], [String])

The same as hsFDsFromInside except that the returned variables are in the String format

hsVisibleDsRdr :: Data t => NameMap -> Name -> t -> RefactGhc DeclaredNames

Given a Name n and a syntax phrase t, if n occurs in t, then return those variables which are declared in t and accessible to n, otherwise return [].

rdrName2Name :: Located RdrName -> RefactGhc Name

rdrName2NamePure :: NameMap -> Located RdrName -> Name

Property checking

isVarId :: String -> Bool

Return True if a string is a lexically valid variable name.

isConId :: String -> Bool

Return True if a string is a lexically valid constructor name.

isOperator :: String -> Bool

Return True if a string is a lexically valid operator name.

isTopLevelPN :: Name -> RefactGhc Bool

Return True if a PName is a toplevel PName.

isLocalPN :: Name -> Bool

Return True if a PName is a local PName.

isNonLibraryName :: Name -> Bool

Return True if the name has a GHC.SrcSpan, i.e. is declared in source we care about

isQualifiedPN :: Name -> RefactGhc Bool

Return True if a PName is a qualified PName. AZ:NOTE: this tests the use instance, the underlying name may be qualified. e.g. used name is zip, GHC.List.zip NOTE2: not sure if this gives a meaningful result for a GHC.Name

isFunOrPatName :: Data t => NameMap -> Name -> t -> Bool

Return True if a PName is a function/pattern name defined in t.

isTypeSig :: LSig a -> Bool

Return True if a declaration is a type signature declaration.

isFunBindP :: LHsDecl RdrName -> Bool

Return True if a declaration is a function definition.

isFunBindR :: LHsBind t -> Bool

isPatBindP :: LHsDecl RdrName -> Bool

Returns True if a declaration is a pattern binding.

isPatBindR :: LHsBind t -> Bool

isSimplePatBind :: DataId t => LHsBind t -> Bool

Return True if a declaration is a pattern binding which only defines a variable value.

isSimplePatDecl :: LHsDecl RdrName -> Bool

Return True if a declaration is a pattern binding which only defines a variable value.

isComplexPatBind :: LHsBind name -> Bool

Return True if a LHsBin is a pattern binding but not a simple one.

isComplexPatDecl :: LHsDecl name -> Bool

Return True if a declaration is a pattern binding but not a simple one.

isFunOrPatBindP :: HsDeclP -> Bool

Return True if a declaration is a function/pattern definition.

isFunOrPatBindR :: LHsBind t -> Bool

Return True if a declaration is a function/pattern definition.

usedWithoutQualR :: Data t => Name -> t -> Bool

Return True if the identifier is unqualifiedly used in the given syntax phrase. Check in a way that the test can be done in a client module, i.e. not using the nameUnique usedWithoutQualR :: GHC.Name -> GHC.ParsedSource -> Bool

findNameInRdr :: Data t => NameMap -> Name -> t -> Bool

Return True if the specified Name ocuurs in the given syntax phrase.

findNamesRdr :: Data t => NameMap -> [Name] -> t -> Bool

Return True if any of the specified PNames ocuur in the given syntax phrase.

findEntity :: (FindEntity a, Data b) => a -> b -> Bool

Returns True is a syntax phrase, say a, is part of another syntax phrase, say b. NOTE: very important: only do a shallow check

findEntity' :: (Data a, Data b) => a -> b -> Maybe (SimpPos, SimpPos)

Returns True is a syntax phrase, say a, is part of another syntax phrase, say b. Expects to be at least Parser output

sameOccurrence :: Located t -> Located t -> Bool

Return True if syntax phrases t1 and t2 refer to the same one.

findIdForName :: Name -> RefactGhc (Maybe Id)

Return the type checked Id corresponding to the given Name

getTypeForName :: Name -> RefactGhc (Maybe Type)

definesTypeSigRdr :: NameMap -> Name -> Sig RdrName -> Bool

Return True if the declaration defines the type signature of the specified identifier.

definesSigDRdr :: NameMap -> Name -> LHsDecl RdrName -> Bool

Unwraps a LHsDecl and calls definesRdr on the result if a Sig

sameBindRdr :: NameMap -> LHsDecl RdrName -> LHsDecl RdrName -> Bool

class Data t => UsedByRhs t where

Minimal complete definition

usedByRhsRdr

Methods

usedByRhsRdr :: NameMap -> t -> [Name] -> Bool

Return True if any of the GHC.Name's appear in the given syntax element

Instances

UsedByRhs DocDecl

Methods

usedByRhsRdr :: NameMap -> DocDecl -> [Name] -> Bool

UsedByRhs [LHsDecl RdrName]

Methods

usedByRhsRdr :: NameMap -> [LHsDecl RdrName] -> [Name] -> Bool

UsedByRhs [LIE RdrName]

Methods

usedByRhsRdr :: NameMap -> [LIE RdrName] -> [Name] -> Bool

UsedByRhs a => UsedByRhs (Maybe a)

Methods

usedByRhsRdr :: NameMap -> Maybe a -> [Name] -> Bool

UsedByRhs (HsModule RdrName)

Methods

usedByRhsRdr :: NameMap -> HsModule RdrName -> [Name] -> Bool

UsedByRhs (HsDecl RdrName)

Methods

usedByRhsRdr :: NameMap -> HsDecl RdrName -> [Name] -> Bool

UsedByRhs (SpliceDecl RdrName)

Methods

usedByRhsRdr :: NameMap -> SpliceDecl RdrName -> [Name] -> Bool

UsedByRhs (TyClDecl RdrName)

Methods

usedByRhsRdr :: NameMap -> TyClDecl RdrName -> [Name] -> Bool

UsedByRhs (InstDecl RdrName)

Methods

usedByRhsRdr :: NameMap -> InstDecl RdrName -> [Name] -> Bool

UsedByRhs (DerivDecl RdrName)

Methods

usedByRhsRdr :: NameMap -> DerivDecl RdrName -> [Name] -> Bool

UsedByRhs (DefaultDecl RdrName)

Methods

usedByRhsRdr :: NameMap -> DefaultDecl RdrName -> [Name] -> Bool

UsedByRhs (ForeignDecl RdrName)

Methods

usedByRhsRdr :: NameMap -> ForeignDecl RdrName -> [Name] -> Bool

UsedByRhs (RuleDecls RdrName)

Methods

usedByRhsRdr :: NameMap -> RuleDecls RdrName -> [Name] -> Bool

UsedByRhs (VectDecl RdrName)

Methods

usedByRhsRdr :: NameMap -> VectDecl RdrName -> [Name] -> Bool

UsedByRhs (WarnDecls RdrName)

Methods

usedByRhsRdr :: NameMap -> WarnDecls RdrName -> [Name] -> Bool

UsedByRhs (AnnDecl RdrName)

Methods

usedByRhsRdr :: NameMap -> AnnDecl RdrName -> [Name] -> Bool

UsedByRhs (RoleAnnotDecl RdrName)

Methods

usedByRhsRdr :: NameMap -> RoleAnnotDecl RdrName -> [Name] -> Bool

UsedByRhs (HsBind RdrName)

Methods

usedByRhsRdr :: NameMap -> HsBind RdrName -> [Name] -> Bool

UsedByRhs (Sig RdrName)

Methods

usedByRhsRdr :: NameMap -> Sig RdrName -> [Name] -> Bool

UsedByRhs (HsExpr RdrName)

Methods

usedByRhsRdr :: NameMap -> HsExpr RdrName -> [Name] -> Bool

UsedByRhs (IE RdrName)

Methods

usedByRhsRdr :: NameMap -> IE RdrName -> [Name] -> Bool

UsedByRhs a => UsedByRhs (Located a)

Methods

usedByRhsRdr :: NameMap -> Located a -> [Name] -> Bool

UsedByRhs (Match RdrName (LHsExpr RdrName))

Methods

usedByRhsRdr :: NameMap -> Match RdrName (LHsExpr RdrName) -> [Name] -> Bool

UsedByRhs (Stmt RdrName (LHsExpr RdrName))

Methods

usedByRhsRdr :: NameMap -> Stmt RdrName (LHsExpr RdrName) -> [Name] -> Bool

Modules and files

isMainModule :: Module -> Bool

getModule :: RefactGhc Module

Locations

defineLoc :: Located Name -> SrcLoc

Return the identifier's defining location. defineLoc::PNT->SrcLoc

useLoc :: Located Name -> SrcLoc

Return the identifier's source location. useLoc::PNT->SrcLoc

locToExp

Arguments

:: (Data t, Typeable n)

=> SimpPos

The start position.

-> SimpPos

The end position.

-> t

The syntax phrase.

-> Maybe (LHsExpr n)

The result.

Given the syntax phrase, find the largest-leftmost expression contained in the region specified by the start and end position, if found.

findLRdrName :: Data t => NameMap -> Name -> t -> Bool

Does the given Name appear as a Located RdrName anywhere in t?

locToNameRdrPure

Arguments

:: Data t

=> NameMap

-> SimpPos

The row and column number

-> t

The syntax phrase, parameterised by RdrName

-> Maybe Name

The result

Find the identifier(in GHC.Name format) whose start position is (row,col) in the file specified by the fileName, and returns Nothing if such an identifier does not exist.

locToRdrName

Arguments

:: Data t

=> SimpPos

The row and column number

-> t

The syntax phrase

-> Maybe (Located RdrName)

The result

Find the identifier(in GHC.RdrName format) whose start position is (row,col) in the file specified by the fileName, and returns Nothing if such an identifier does not exist.

getName

Arguments

:: Data t

=> String

The name to find

-> t

The syntax phrase

-> Maybe Name

The result

Find the identifier with the given name. This looks through the given syntax phrase for the first GHC.Name which matches. Because it is Renamed source, the GHC.Name will include its defining location. Returns Nothing if the name is not found.

Program transformation

Adding

addDecl

Arguments

:: (Data t, Typeable t)

=> t

The AST to be updated

-> Maybe Name

If this is Just, then the declaration will be added right after this identifier's definition.

-> ([LHsDecl RdrName], Maybe Anns)

The declaration with optional signatures to be added, together with optional Annotations.

-> RefactGhc t

Adding a declaration to the declaration list of the given syntax phrase. If the second argument is Nothing, then the declaration will be added to the beginning of the declaration list, but after the data type declarations is there is any.

addItemsToImport

Arguments

:: ModuleName

The imported module name

-> Maybe Name

The condition identifier.

-> Either [RdrName] [LIE RdrName]

The items to be added

-> ParsedSource

The current module

-> RefactGhc ParsedSource

The result

Add identifiers (given by the third argument) to the explicit entity list in the declaration importing the specified module name. This function does nothing if the import declaration does not have an explicit entity list.

addItemsToExport

Arguments

:: ParsedSource

The module AST.

-> Maybe Name

The condtion identifier.

-> Bool

Create an explicit list or not

-> Either [RdrName] [LIE RdrName]

The identifiers to add in either String or HsExportEntP format.

-> RefactGhc ParsedSource

The result.

Add identifiers to the export list of a module. If the second argument is like: Just p, then do the adding only if p occurs in the export list, and the new identifiers are added right after p in the export list. Otherwise the new identifiers are add to the beginning of the export list. In the case that the export list is empty, then if the third argument is True, then create an explict export list to contain only the new identifiers, otherwise do nothing. TODO:AZ: re-arrange params to line up with addItemsToExport

addHiding

Arguments

:: ModuleName

The imported module name

-> ParsedSource

The current module

-> [RdrName]

The items to be added

-> RefactGhc ParsedSource

The result

add items to the hiding list of an import declaration which imports the specified module.

addParamsToDecls

Arguments

:: [LHsDecl RdrName]

A declaration list where the function is defined and/or used.

-> Name

The function name.

-> [RdrName]

The parameters to be added.

-> RefactGhc [LHsDecl RdrName]

The result.

addParamsToSigs :: [Name] -> LSig RdrName -> RefactGhc (LSig RdrName)

addActualParamsToRhs :: Data t => Name -> [RdrName] -> t -> RefactGhc t

addImportDecl

Arguments

:: ParsedSource

-> ModuleName

-> Maybe StringLiteral

qualifier

-> Bool

-> Bool

-> Bool

-> Maybe String

alias

-> Bool

-> [RdrName]

-> RefactGhc ParsedSource

Add identifiers to the export list of a module. If the second argument is like: Just p, then do the adding only if p occurs in the export list, and the new identifiers are added right after p in the export list. Otherwise the new identifiers are add to the beginning of the export list. In the case that the export list is emport, then if the third argument is True, then create an explict export list to contain only the new identifiers, otherwise do nothing.

duplicateDecl

Arguments

:: [LHsDecl RdrName]

decls to be updated, containing the original decl (and sig)

-> Name

The identifier whose definition is to be duplicated

-> Name

The new name (possibly qualified)

-> RefactGhc [LHsDecl RdrName]

The result

Duplicate a function/pattern binding declaration under a new name right after the original one.

Removing

rmDecl

Arguments

:: Data t

=> Name

The identifier whose definition is to be removed.

-> Bool

True means including the type signature.

-> t

The AST fragment containting the declarations, originating from the ParsedSource

-> RefactGhc (t, LHsDecl RdrName, Maybe (LSig RdrName))

The result and the removed declaration and the possibly removed siganture

Remove the declaration (and the type signature is the second parameter is True) that defines the given identifier from the declaration list.

rmTypeSig

Arguments

:: Data t

=> Name

The identifier whose type signature is to be removed.

-> t

The declarations

-> RefactGhc (t, Maybe (LSig RdrName))

The result and removed signature, if there was one

Remove the type signature that defines the given identifier's type from the declaration list.

rmTypeSigs

Arguments

:: Data t

=> [Name]

The identifiers whose type signatures are to be removed.

-> t

The declarations

-> RefactGhc (t, [LSig RdrName])

The result and removed signatures, if there were any

Remove multiple type signatures

Updating

rmQualifier

Arguments

:: Data t

=> [Name]

The identifiers.

-> t

The syntax phrase.

-> RefactGhc t

The result.

Remove the qualifier from the given identifiers in the given syntax phrase.

qualifyToplevelName :: Name -> RefactGhc ()

Replace all occurences of a top level GHC.Name with a qualified version.

renamePN

Arguments

:: Data t

=> Name

The identifier to be renamed.

-> Name

The new name, including possible qualifier

-> HowToQual

-> t

The syntax phrase

-> RefactGhc t

Rename each occurrences of the identifier in the given syntax phrase with the new name.

data HowToQual

Constructors

Qualify

NoQualify

PreserveQualify

Instances

Eq HowToQual

Methods

(==) :: HowToQual -> HowToQual -> Bool

(/=) :: HowToQual -> HowToQual -> Bool

Show HowToQual

Methods

showsPrec :: Int -> HowToQual -> ShowS

show :: HowToQual -> String

showList :: [HowToQual] -> ShowS

Outputable HowToQual

Methods

ppr :: HowToQual -> SDoc

pprPrec :: Rational -> HowToQual -> SDoc

autoRenameLocalVar

Arguments

:: Data t

=> Name

The identifier.

-> t

The syntax phrase.

-> RefactGhc t

The result.

Check whether the specified identifier is declared in the given syntax phrase t, if so, rename the identifier by creating a new name automatically.

Identifiers, expressions, patterns and declarations

expToNameRdr :: NameMap -> LHsExpr RdrName -> Maybe Name

If an expression consists of only one identifier then return this identifier in the GHC.Name format, otherwise return the default Name

patToNameRdr :: NameMap -> LPat RdrName -> Maybe Name

If a pattern consists of only one identifier then return this identifier, otherwise return Nothing

nameToString :: Name -> String

pNtoPat :: name -> Pat name

Deprecated: Can't use Renamed in GHC 8

Compose a pattern from a pName.

definedPNsRdr :: LHsDecl RdrName -> [Located RdrName]

definedNamesRdr :: NameMap -> LHsDecl RdrName -> [Name]

definingDeclsRdrNames

Arguments

:: NameMap

-> [Name]

The specified identifiers.

-> [LHsDecl RdrName]

A collection of declarations.

-> Bool

True means to include the type signature.

-> Bool

True means to look at the local declarations as well.

-> [LHsDecl RdrName]

The result.

Find those declarations(function/pattern binding) which define the specified GHC.Names. incTypeSig indicates whether the corresponding type signature will be included.

definingDeclsRdrNames'

Arguments

:: Data t

=> NameMap

-> [Name]

The specified identifiers.

-> t

A collection of declarations.

-> [LHsDecl RdrName]

The result.

Find those declarations(function/pattern binding) which define the specified GHC.Names. incTypeSig indicates whether the corresponding type signature will be included.

definingSigsRdrNames

Arguments

:: Data t

=> NameMap

-> [Name]

The specified identifiers.

-> t

A collection of declarations.

-> [LSig RdrName]

The result.

Find those type signatures for the specified GHC.Names.

definingTyClDeclsNames

Arguments

:: Data t

=> NameMap

-> [Name]

The specified identifiers.

-> t

A collection of declarations.

-> [LTyClDecl RdrName]

The result.

Find those declarations which define the specified GHC.Names.

Others

divideDecls :: Data t => [t] -> Located Name -> RefactGhc ([t], [t], [t])

Divide a declaration list into three parts (before, parent, after) according to the PNT, where parent is the first decl containing the PNT, before are those decls before parent and after are those decls after parent.

mkRdrName :: String -> RdrName

Make a simple unqualified RdrName

mkQualifiedRdrName :: ModuleName -> String -> RdrName

Make a qualified RdrName

mkNewGhcName :: Maybe Module -> String -> RefactGhc Name

Make a new GHC.Name, using the Unique Int sequence stored in the RefactState.

mkNewName

Arguments

:: String

The old name

-> [String]

The set of names which the new name cannot take

-> Int

The posfix value

-> String

The result

Create a new name base on the old name. Suppose the old name is f, then the new name would be like f_i where i is an integer.

mkNewToplevelName :: Module -> String -> SrcSpan -> RefactGhc Name

registerRdrName :: Located RdrName -> RefactGhc ()

Register a Located RdrName in the NameMap so it can be looked up if needed. This will create a brand new Name, so no guarantees are given as to matches later. Perhaps this is a bad idea.

causeNameClashInExports

Arguments

:: NameMap

-> Name

The original name

-> Name

The new name

-> ModuleName

The identity of the module

-> ParsedSource

The AST of the module

-> Bool

The result

Check if the proposed new name will conflict with an existing export

declsSybTransform :: Typeable a => (forall b. HasDecls b => b -> RefactGhc b) -> a -> RefactGhc a

Typed AST traversals (added by CMB)

Miscellous

from GhcUtils

SYB versions

everywhereMStaged' :: Monad m => Stage -> GenericM m -> GenericM m

Monadic variation on everywhere'

everywhereStaged :: Stage -> (forall a. Data a => a -> a) -> forall a. Data a => a -> a

Bottom-up transformation

everywhereStaged' :: Stage -> (forall a. Data a => a -> a) -> forall a. Data a => a -> a

Top-down version of everywhereStaged

listifyStaged :: (Data a, Typeable a1) => Stage -> (a1 -> Bool) -> a -> [a1]

Staged variation of SYB.listify The stage must be provided to avoid trying to modify elements which may not be present at all stages of AST processing.

Scrap Your Zipper versions

zeverywhereStaged :: Typeable a => Stage -> GenericT -> Zipper a -> Zipper a

Apply a generic transformation everywhere in a bottom-up manner.

zopenStaged :: Typeable a => Stage -> GenericQ Bool -> Zipper a -> [Zipper a]

Open a zipper to the point where the Geneneric query passes. returns the original zipper if the query does not pass (check this)

zsomewhereStaged :: MonadPlus m => Stage -> GenericM m -> Zipper a -> m (Zipper a)

Apply a generic monadic transformation once at the topmost leftmost successful location, avoiding holes in the GHC structures

transZ :: Stage -> GenericQ Bool -> (Stage -> Zipper a -> Zipper a) -> Zipper a -> Zipper a

Transform a zipper opened with a given generic query

transZM :: Monad m => Stage -> GenericQ Bool -> (Stage -> Zipper a -> m (Zipper a)) -> Zipper a -> m (Zipper a)

Monadic transform of a zipper opened with a given generic query

zopenStaged' :: Typeable a => Stage -> GenericQ (Maybe b) -> Zipper a -> [(Zipper a, b)]

Open a zipper to the point where the Generic query passes, returning the zipper and a value from the specific part of the GenericQ that matched. This allows the components of the query to return a specific transformation routine, to apply to the returned zipper

ztransformStagedM :: (Typeable a, Monad m) => Stage -> GenericQ (Maybe (Stage -> Zipper a -> m (Zipper a))) -> Zipper a -> m (Zipper a)

Open a zipper to the point where the Generic query passes, and apply the transformation returned from the specific part of the GenericQ that matched.

SYZ utilities

upUntil :: GenericQ Bool -> Zipper a -> Maybe (Zipper a)

Climb the tree until a predicate holds

findAbove :: Data a => (a -> Bool) -> Zipper a -> Maybe a

Up the zipper until a predicate holds, and then return the zipper hole

from GhcVersionSpecific

showGhc :: Outputable a => a -> String

Show a GHC.Outputable structure

showGhcQual :: Outputable a => a -> String

prettyprint :: Outputable a => a -> String

prettyprint2 :: Outputable a => a -> String

ppType :: Type -> String

setGhcContext :: GhcMonad m => ModSummary -> m ()

from TokenUtils

type NameMap = Map SrcSpan Name

from ExactPrint'

replace :: AnnKey -> AnnKey -> Anns -> Maybe Anns

Replaces an old expression with a new expression

setRefactAnns :: Anns -> RefactGhc ()

Internal low level interface to access the current annotations from the RefactGhc state.

setAnnKeywordDP :: Data a => Located a -> KeywordId -> DeltaPos -> Transform ()

Change the DeltaPos for a given KeywordId if it appears in the annotation for the given item.

copyAnn :: (Data old, Data new) => Located old -> Located new -> Anns -> Anns

clearPriorComments :: Data a => Located a -> Transform ()

Remove any preceding comments from the given item

balanceAllComments :: Data a => Located a -> Transform (Located a)