Text.Reprinter

Documentation

reprintSort :: (Monad m, Data ast) => Reprinting m -> ast -> Source -> m Source

The reprint algorithm takes a refactoring (parameteric in | some monad m) and turns an arbitrary pretty-printable type ast | into a monadic Source transformer.

reprint :: (Monad m, Data ast) => Reprinting m -> ast -> Source -> m Source

The reprint algorithm takes a refactoring (parameteric in | some monad m) and turns an arbitrary pretty-printable type ast | into a monadic Source transformer.

type Source = Text

Text from source file

type Position = (Line, Col)

A position in a text (imagine a cursor)

initPosition :: Position

The initial position

initLine :: Line

Lines start at 1

initCol :: Col

Columns start at 1

mkLine :: Int -> Either String Line

Smart constructor for a Line, checks that line >= 1

mkCol :: Int -> Either String Col

Smart constructor for a Col, checks that column >= 1

advanceLine :: Position -> Position

Given a position, go down a line, going back to the initial column

advanceCol :: Position -> Position

Given a position, advance by one column

type Span = (Position, Position)

Two positions give the lower and upper bounds of a source span

type Reprinting m = forall node. Typeable node => node -> m (Maybe (RefactorType, Source, Span))

Type of a reprinting function

catchAll :: Monad m => a -> m (Maybe b)

Catch all generic query

genReprinting :: (Monad m, Refactorable t, Typeable t) => (t -> m Source) -> t -> m (Maybe (RefactorType, Source, Span))

Essentially wraps the refactorable interface

class Refactorable t where

Infrastructure for building the reprinter "plugins"

Minimal complete definition

isRefactored, getSpan

Methods

isRefactored :: t -> Maybe RefactorType

getSpan :: t -> Span

data RefactorType

Specify a refactoring type

Constructors

Before

After

Replace

Instances

Show RefactorType

Methods

showsPrec :: Int -> RefactorType -> ShowS

show :: RefactorType -> String

showList :: [RefactorType] -> ShowS