Language.Haskell.Tools.Refactor.RefactorBase

Documentation

data RefactorCtx a

The information a refactoring can use

Constructors

RefactorCtx

Fields

• refModuleName :: Module
• refCtxImports :: [Ann ImportDecl a]

Instances

Monad m => MonadReader (RefactorCtx ann) (RefactorT ann m)

Methods

ask :: RefactorT ann m (RefactorCtx ann)

local :: (RefactorCtx ann -> RefactorCtx ann) -> RefactorT ann m a -> RefactorT ann m a

reader :: (RefactorCtx ann -> a) -> RefactorT ann m a

runRefactor :: (a ~ STWithNames n, TemplateAnnot a) => Ann Module a -> (Ann Module a -> Refactor n (Ann Module a)) -> Ghc (Either String (Ann Module a))

Performs the given refactoring, transforming it into a Ghc action

addGeneratedImports :: (TemplateAnnot a, Monad m) => ReaderT (RefactorCtx a) m (Ann Module a, [Name]) -> ReaderT (RefactorCtx a) m (Ann Module a)

Adds the imports that bring names into scope that are needed by the refactoring

newtype RefactorT ann m ast

Input and output information for the refactoring

Constructors

RefactorT

Fields

• fromRefactorT :: WriterT [Name] (ReaderT (RefactorCtx ann) m) ast

Instances

MonadTrans (RefactorT ann)

Methods

lift :: Monad m => m a -> RefactorT ann m a

Monad m => MonadReader (RefactorCtx ann) (RefactorT ann m)

Methods

ask :: RefactorT ann m (RefactorCtx ann)

local :: (RefactorCtx ann -> RefactorCtx ann) -> RefactorT ann m a -> RefactorT ann m a

reader :: (RefactorCtx ann -> a) -> RefactorT ann m a

Monad m => MonadWriter [Name] (RefactorT ann m)

Methods

writer :: (a, [Name]) -> RefactorT ann m a

tell :: [Name] -> RefactorT ann m ()

listen :: RefactorT ann m a -> RefactorT ann m (a, [Name])

pass :: RefactorT ann m (a, [Name] -> [Name]) -> RefactorT ann m a

Monad m => Monad (RefactorT ann m)

Methods

(>>=) :: RefactorT ann m a -> (a -> RefactorT ann m b) -> RefactorT ann m b

(>>) :: RefactorT ann m a -> RefactorT ann m b -> RefactorT ann m b

return :: a -> RefactorT ann m a

fail :: String -> RefactorT ann m a

Functor m => Functor (RefactorT ann m)

Methods

fmap :: (a -> b) -> RefactorT ann m a -> RefactorT ann m b

(<$) :: a -> RefactorT ann m b -> RefactorT ann m a

Applicative m => Applicative (RefactorT ann m)

Methods

pure :: a -> RefactorT ann m a

(<*>) :: RefactorT ann m (a -> b) -> RefactorT ann m a -> RefactorT ann m b

(*>) :: RefactorT ann m a -> RefactorT ann m b -> RefactorT ann m b

(<*) :: RefactorT ann m a -> RefactorT ann m b -> RefactorT ann m a

MonadIO m => MonadIO (RefactorT ann m)

Methods

liftIO :: IO a -> RefactorT ann m a

GhcMonad m => GhcMonad (RefactorT ann m)

Methods

getSession :: RefactorT ann m HscEnv

setSession :: HscEnv -> RefactorT ann m ()

(Monad m, HasDynFlags m) => HasDynFlags (RefactorT ann m)

Methods

getDynFlags :: RefactorT ann m DynFlags

ExceptionMonad m => ExceptionMonad (RefactorT ann m)

Methods

gcatch :: Exception e => RefactorT ann m a -> (e -> RefactorT ann m a) -> RefactorT ann m a

gmask :: ((RefactorT ann m a -> RefactorT ann m a) -> RefactorT ann m b) -> RefactorT ann m b

gbracket :: RefactorT ann m a -> (a -> RefactorT ann m b) -> (a -> RefactorT ann m c) -> RefactorT ann m c

gfinally :: RefactorT ann m a -> RefactorT ann m b -> RefactorT ann m a

refactError :: String -> Refactor n a

type Refactor n = RefactorT (STWithNames n) (ExceptT String Ghc)

The refactoring monad

type STWithNames n = NodeInfo (SemanticInfo n) SourceTemplate

type RefactoredModule n = Refactor n (Ann Module (STWithNames n))

registeredNamesFromPrelude :: [Name]

otherNamesFromPrelude :: [String]

qualifiedName :: Name -> String

referenceName :: (Eq n, NamedThing n) => n -> Refactor n (Ann Name (STWithNames n))

referenceOperator :: (Eq n, NamedThing n) => n -> Refactor n (Ann Operator (STWithNames n))

referenceName' :: (Eq n, NamedThing n) => ([String] -> Name -> Ann nt (STWithNames n)) -> n -> Refactor n (Ann nt (STWithNames n))

Create a name that references the definition. Generates an import if the definition is not yet imported.

referenceBy :: TemplateAnnot a => ([String] -> Name -> Ann nt a) -> Name -> [Ann ImportDecl a] -> Ann nt a

Reference the name by the shortest suitable import

data NameClass

Different classes of definitions that have different kind of names.

Constructors

Variable

Normal value definitions: functions, variables

Ctor

Data constructors

ValueOperator

Functions with operator-like names

DataCtorOperator

Constructors with operator-like names

SynonymOperator

Type definitions with operator-like names

classifyName :: Name -> Refactor n NameClass

Get which category does a given name belong to

nameValid :: NameClass -> String -> Bool

Check if a given name is valid for a given kind of definition

isIdStartChar :: Char -> Bool

isOperatorChar :: Char -> Bool

Orphan instances

GhcMonad m => GhcMonad (ExceptT s m)

Methods

getSession :: ExceptT s m HscEnv

setSession :: HscEnv -> ExceptT s m ()

(GhcMonad m, Monoid s) => GhcMonad (WriterT s m)

Methods

getSession :: WriterT s m HscEnv

setSession :: HscEnv -> WriterT s m ()

ExceptionMonad m => ExceptionMonad (ExceptT s m)

Methods

gcatch :: Exception e => ExceptT s m a -> (e -> ExceptT s m a) -> ExceptT s m a

gmask :: ((ExceptT s m a -> ExceptT s m a) -> ExceptT s m b) -> ExceptT s m b

gbracket :: ExceptT s m a -> (a -> ExceptT s m b) -> (a -> ExceptT s m c) -> ExceptT s m c

gfinally :: ExceptT s m a -> ExceptT s m b -> ExceptT s m a

(ExceptionMonad m, Monoid s) => ExceptionMonad (WriterT s m)

Methods

gcatch :: Exception e => WriterT s m a -> (e -> WriterT s m a) -> WriterT s m a

gmask :: ((WriterT s m a -> WriterT s m a) -> WriterT s m b) -> WriterT s m b

gbracket :: WriterT s m a -> (a -> WriterT s m b) -> (a -> WriterT s m c) -> WriterT s m c

gfinally :: WriterT s m a -> WriterT s m b -> WriterT s m a

GhcMonad m => GhcMonad (ReaderT * s m)

Methods

getSession :: ReaderT * s m HscEnv

setSession :: HscEnv -> ReaderT * s m ()

ExceptionMonad m => ExceptionMonad (ReaderT * s m)

Methods

gcatch :: Exception e => ReaderT * s m a -> (e -> ReaderT * s m a) -> ReaderT * s m a

gmask :: ((ReaderT * s m a -> ReaderT * s m a) -> ReaderT * s m b) -> ReaderT * s m b

gbracket :: ReaderT * s m a -> (a -> ReaderT * s m b) -> (a -> ReaderT * s m c) -> ReaderT * s m c

gfinally :: ReaderT * s m a -> ReaderT * s m b -> ReaderT * s m a