lean4-htt/src/Lean/PrettyPrinter/Formatter.lean
Markus Himmel e6a07ca6b1
refactor: deprecate String.posOf and variants in favor of unified String.find (#11276)
This PR cleans up the API around `String.find` and moves it uniformly to
the new position types `String.ValidPos` and `String.Slice.Pos`

Overview:

- To search for a character, character predicate, string or slice in a
string or slice `s`, use `s.find?` or `s.find`.
- To do the same, but starting at a position `p` of a string or slice,
use `p.find?` or `p.find`.
- To do the same but between two positions `p` and `q`, construct the
slice from `p` to `q` and then use `find?` or `find` on that.
- To search backwards, all of the above applies, except that the
function is called `revFind?`, there is no non-question-mark version
(use `getD` if there is a sane default return value in your specific
application), and that you can only search for characters and character
predicates, not strings or slices.
2025-11-23 18:39:53 +00:00

667 lines
27 KiB
Text
Raw Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

/-
Copyright (c) 2020 Sebastian Ullrich. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Sebastian Ullrich
-/
module
prelude
public import Lean.Parser.Extension
public import Lean.Parser.StrInterpolation
public import Lean.ParserCompiler.Attribute
public import Lean.PrettyPrinter.Basic
public import Lean.PrettyPrinter.Delaborator.Options
import Lean.ExtraModUses
public section
/-!
The formatter turns a `Syntax` tree into a `Format` object, inserting both mandatory whitespace (to separate adjacent
tokens) as well as "pretty" optional whitespace.
The basic approach works much like the parenthesizer: A right-to-left traversal over the syntax tree, driven by
parser-specific handlers registered via attributes. The traversal is right-to-left so that when emitting a token, we
already know the text following it and can decide whether or not whitespace between the two is necessary.
-/
namespace Lean
namespace PrettyPrinter
namespace Formatter
structure Context where
options : Options
table : Parser.TokenTable
structure State where
stxTrav : Syntax.Traverser
/-- Textual content of `stack` up to the first whitespace (not enclosed in an escaped ident). We assume that the textual
content of `stack` is modified only by `push` and `pushWhitespace`, so `leadWord` is adjusted there accordingly. -/
leadWord : String := ""
/-- When the `leadWord` is nonempty, whether it is an identifier. Identifiers get space inserted between them. -/
leadWordIdent : Bool := false
/-- Whether the generated format begins with the result of an ungrouped category formatter. -/
isUngrouped : Bool := false
/-- Whether the resulting format must be grouped when used in a category formatter.
If the flag is set to false, then categoryParser omits the fill+nest operation. -/
mustBeGrouped : Bool := true
/-- Stack of generated Format objects, analogous to the Syntax stack in the parser.
Note, however, that the stack is reversed because of the right-to-left traversal. -/
stack : Array Format := #[]
end Formatter
abbrev FormatterM := ReaderT Formatter.Context $ StateRefT Formatter.State CoreM
@[inline] def FormatterM.orElse {α} (p₁ : FormatterM α) (p₂ : Unit → FormatterM α) : FormatterM α := do
let s ← get
catchInternalId backtrackExceptionId
p₁
(fun _ => do set s; p₂ ())
instance {α} : OrElse (FormatterM α) := ⟨FormatterM.orElse⟩
abbrev Formatter := FormatterM Unit
/--
Registers a formatter for a parser.
`@[formatter k]` registers a declaration of type `Lean.PrettyPrinter.Formatter` to be used for
formatting syntax of kind `k`.
-/
@[builtin_doc]
unsafe builtin_initialize formatterAttribute : KeyedDeclsAttribute Formatter ←
KeyedDeclsAttribute.init {
builtinName := `builtin_formatter,
name := `formatter,
descr := "Register a formatter for a parser.",
valueTypeName := `Lean.PrettyPrinter.Formatter,
evalKey := fun builtin stx => do
let env ← getEnv
let stx ← Attribute.Builtin.getIdent stx
let id := stx.getId
-- `isValidSyntaxNodeKind` is updated only in the next stage for new `[builtin*Parser]`s, but we try to
-- synthesize a formatter for it immediately, so we just check for a declaration in this case
unless (builtin && (env.find? id).isSome) || Parser.isValidSyntaxNodeKind env id do
throwError "Invalid `[formatter]` argument: Unknown syntax kind `{id}`"
if (← getEnv).contains id then
recordExtraModUseFromDecl (isMeta := false) id
if (← Elab.getInfoState).enabled then
Elab.addConstInfo stx id none
pure id
}
/--
Registers a formatter for a parser combinator.
`@[combinator_formatter c]` registers a declaration of type `Lean.PrettyPrinter.Formatter` for the
`Parser` declaration `c`. Note that, unlike with `@[formatter]`, this is not a node kind since
combinators usually do not introduce their own node kinds. The tagged declaration may optionally
accept parameters corresponding to (a prefix of) those of `c`, where `Parser` is replaced with
`Formatter` in the parameter types.
-/
@[builtin_doc]
unsafe builtin_initialize combinatorFormatterAttribute : ParserCompiler.CombinatorAttribute ←
ParserCompiler.registerCombinatorAttribute
`combinator_formatter
"Register a formatter for a parser combinator"
`Lean.PrettyPrinter.mkCombinatorFormatterAttribute -- TODO (bootstrapping): remove if possible
-- More details on TODO: Removing this would lead to an environment extension with a name that
-- doesn't match what's saved in the oleans, so tests don't pass. Removing it will require a
-- non-CI stage0 update, or careful work to keep the test working across updates.
namespace Formatter
open Lean.Core
open Lean.Parser
def throwBacktrack {α} : FormatterM α :=
throw $ Exception.internal backtrackExceptionId
instance : Syntax.MonadTraverser FormatterM := ⟨{
get := State.stxTrav <$> get,
set := fun t => modify (fun st => { st with stxTrav := t }),
modifyGet := fun f => modifyGet (fun st => let (a, t) := f st.stxTrav; (a, { st with stxTrav := t }))
}⟩
open Syntax.MonadTraverser
def getStack : FormatterM (Array Format) := do
let st ← get
pure st.stack
def getStackSize : FormatterM Nat := do
let stack ← getStack;
pure stack.size
def setStack (stack : Array Format) : FormatterM Unit :=
modify fun st => { st with stack := stack }
def push (f : Format) : FormatterM Unit :=
modify fun st => { st with stack := st.stack.push f, isUngrouped := false }
/--
Resets the state associated with the lead word,
inhibiting any automatic whitespace insertion between tokens.
-/
def resetLeadWord : FormatterM Unit := do
modify fun st => { st with leadWord := "", leadWordIdent := false }
def pushWhitespace (f : Format) : FormatterM Unit := do
push f
modify fun st => { st with leadWord := "", leadWordIdent := false, isUngrouped := false }
def pushLine : FormatterM Unit :=
pushWhitespace Format.line
def pushAlign (force : Bool) : FormatterM Unit :=
pushWhitespace (.align force)
/--
Execute `x` at the right-most child of the current node, if any, then advance to the left.
Runs `x` even if there are no children, in which case the current syntax node will be `.missing`.
-/
def visitArgs (x : FormatterM Unit) : FormatterM Unit := do
let stx ← getCur
goDown (stx.getArgs.size - 1) *> x <* goUp
goLeft
/-- Execute `x`, pass array of generated Format objects to `fn`, and push result. -/
def fold (fn : Array Format → Format) (x : FormatterM Unit) : FormatterM Unit := do
let sp ← getStackSize
x
let stack ← getStack
let f := fn $ stack.extract sp stack.size
setStack $ (stack.shrink sp).push f
/-- Execute `x` and concatenate generated Format objects. -/
def concat (x : FormatterM Unit) : FormatterM Unit := do
fold (Array.foldl (fun acc f => if acc.isNil then f else f ++ acc) Format.nil) x
def indent (x : Formatter) (indent : Option Int := none) : Formatter := do
concat x
let ctx ← read
let indent := indent.getD $ Std.Format.getIndent ctx.options
modify fun st => { st with stack := st.stack.modify (st.stack.size - 1) (Format.nest indent) }
def fill (x : Formatter) : Formatter := do
concat x
modify fun st => { st with
stack := st.stack.modify (st.stack.size - 1) Format.fill
isUngrouped := false
}
def group (x : Formatter) : Formatter := do
concat x
modify fun st => { st with
stack := st.stack.modify (st.stack.size - 1) Format.group
isUngrouped := false
}
/-- If `pos?` has a position, run `x` and tag its results with that position,
if they are not already tagged. Otherwise just run `x`. -/
def withMaybeTag (pos? : Option String.Pos.Raw) (x : FormatterM Unit) : Formatter := do
if let some p := pos? then
concat x
modify fun st => {
st with stack := st.stack.modify (st.stack.size - 1) fun fmt =>
if fmt matches Format.tag .. then fmt
else Format.tag p.byteIdx fmt
}
else
x
@[combinator_formatter orelse, expose] partial def orelse.formatter (p1 p2 : Formatter) : Formatter := do
let stx ← getCur
-- `orelse` may produce `choice` nodes for antiquotations
if stx.getKind == `choice then
visitArgs do
-- format only last choice
-- TODO: We could use elaborator data here to format the chosen child when available
orelse.formatter p1 p2
else
-- HACK: We have no (immediate) information on which side of the orelse could have produced the current node, so try
-- them in turn. Uses the syntax traverser non-linearly!
p1 <|> p2
@[combinator_formatter recover, expose]
def recover.formatter (fmt : PrettyPrinter.Formatter) := fmt
@[combinator_formatter recover', expose]
def recover'.formatter (fmt : PrettyPrinter.Formatter) := fmt
-- `mkAntiquot` is quite complex, so we'd rather have its formatter synthesized below the actual parser definition.
-- Note that there is a mutual recursion
-- `categoryParser -> mkAntiquot -> termParser -> categoryParser`, so we need to introduce an indirection somewhere
-- anyway.
@[extern "lean_mk_antiquot_formatter"]
opaque mkAntiquot.formatter' (name : String) (kind : SyntaxNodeKind) (anonymous := true) (isPseudoKind := false) : Formatter
-- break up big mutual recursion
@[extern "lean_pretty_printer_formatter_interpret_parser_descr"]
opaque interpretParserDescr' : ParserDescr → CoreM Formatter
private def SourceInfo.getExprPos? : SourceInfo → Option String.Pos.Raw
| SourceInfo.synthetic (pos := pos) .. => pos
| _ => none
def getExprPos? : Syntax → Option String.Pos.Raw
| Syntax.node info _ _ => SourceInfo.getExprPos? info
| Syntax.atom info _ => SourceInfo.getExprPos? info
| Syntax.ident info _ _ _ => SourceInfo.getExprPos? info
| Syntax.missing => none
unsafe def formatterForKindUnsafe (k : SyntaxNodeKind) : Formatter := do
if k == `missing then
push "<missing>"
goLeft
else
let stx ← getCur
let f ← runForNodeKind formatterAttribute k interpretParserDescr'
withMaybeTag (getExprPos? stx) f
@[implemented_by formatterForKindUnsafe]
opaque formatterForKind (k : SyntaxNodeKind) : Formatter
@[combinator_formatter withAntiquot, expose]
def withAntiquot.formatter (antiP p : Formatter) : Formatter :=
-- TODO: could be optimized using `isAntiquot` (which would have to be moved), but I'd rather
-- fix the backtracking hack outright.
orelse.formatter antiP p
@[combinator_formatter withAntiquotSuffixSplice, expose]
def withAntiquotSuffixSplice.formatter (_ : SyntaxNodeKind) (p suffix : Formatter) : Formatter := do
if (← getCur).isAntiquotSuffixSplice then
visitArgs <| suffix *> p
else
p
@[combinator_formatter tokenWithAntiquot, expose]
def tokenWithAntiquot.formatter (p : Formatter) : Formatter := do
if (← getCur).isTokenAntiquot then
visitArgs p
else
p
def categoryFormatterCore (cat : Name) : Formatter := do
modify fun st => { st with mustBeGrouped := true, isUngrouped := false }
let stx ← getCur
trace[PrettyPrinter.format] "formatting {indentD (format stx)}"
if stx.getKind == `choice then
visitArgs do
-- format only last choice
-- TODO: We could use elaborator data here to format the chosen child when available
formatterForKind (← getCur).getKind
else if cat == `rawStx then
withAntiquot.formatter (mkAntiquot.formatter' cat.toString cat (isPseudoKind := true)) (push stx.formatStx *> goLeft)
else
withAntiquot.formatter (mkAntiquot.formatter' cat.toString cat (isPseudoKind := true)) (formatterForKind stx.getKind)
modify fun st => { st with mustBeGrouped := true, isUngrouped := !st.mustBeGrouped }
@[combinator_formatter categoryParser, expose]
def categoryParser.formatter (cat : Name) : Formatter := do
concat <| categoryFormatterCore cat
unless (← get).isUngrouped do
let indent := Std.Format.getIndent (← read).options
modify fun st => { st with
stack := st.stack.modify (st.stack.size - 1) fun fmt =>
fmt.nest indent |>.fill
}
def categoryFormatter (cat : Name) : Formatter :=
fill <| indent <| categoryFormatterCore cat
@[combinator_formatter parserOfStack, expose]
def parserOfStack.formatter (offset : Nat) (_prec : Nat := 0) : Formatter := do
let st ← get
let stx := st.stxTrav.parents.back!.getArg (st.stxTrav.idxs.back! - offset)
formatterForKind stx.getKind
@[combinator_formatter error, expose]
def error.formatter (_msg : String) : Formatter := pure ()
@[combinator_formatter errorAtSavedPos, expose]
def errorAtSavedPos.formatter (_msg : String) (_delta : Bool) : Formatter := pure ()
@[combinator_formatter lookahead, expose]
def lookahead.formatter (_ : Formatter) : Formatter := pure ()
@[combinator_formatter notFollowedBy, expose]
def notFollowedBy.formatter (_ : Formatter) : Formatter := pure ()
@[combinator_formatter andthen, expose]
def andthen.formatter (p1 p2 : Formatter) : Formatter := p2 *> p1
def checkKind (k : SyntaxNodeKind) : FormatterM Unit := do
let stx ← getCur
if k != stx.getKind then
trace[PrettyPrinter.format.backtrack] "unexpected node kind '{stx.getKind}', expected '{k}'"
throwBacktrack
@[combinator_formatter node, expose]
def node.formatter (k : SyntaxNodeKind) (p : Formatter) : Formatter := do
checkKind k;
visitArgs p
@[combinator_formatter withFn, expose]
def withFn.formatter (_ : ParserFn → ParserFn) (p : Formatter) : Formatter := p
@[combinator_formatter trailingNode, expose]
def trailingNode.formatter (k : SyntaxNodeKind) (_ _ : Nat) (p : Formatter) : Formatter := do
checkKind k
visitArgs do
p;
-- leading term, not actually produced by `p`
categoryParser.formatter `foo
def parseToken (s : String) : FormatterM ParserState :=
-- include comment tokens, e.g. when formatting `- -0`
let ictx := .mk s "" (fileMap := FileMap.ofString "")
return (Parser.andthenFn Parser.whitespace (Parser.tokenFn [])).run ictx
{
env := ← getEnv,
options := ← getOptions
} ((← read).table) (Parser.mkParserState s)
def pushToken (info : SourceInfo) (tk : String) (ident : Bool) : FormatterM Unit := do
if let SourceInfo.original _ _ ss _ := info then
-- preserve non-whitespace content (comments)
let ss' := ss.trim
unless ss'.isEmpty do
let preNL := Substring.Raw.contains { ss with stopPos := ss'.startPos } '\n'
let postNL := Substring.Raw.contains { ss with startPos := ss'.stopPos } '\n'
if postNL then
pushWhitespace "\n"
else if !(← get).leadWord.isEmpty then
pushLine
push ss'.toString
if preNL then
pushWhitespace "\n"
else
pushLine
let st ← get
-- If there is no space between `tk` and the next word, see if we should insert a discretionary space.
if st.leadWord != "" && tk.trimAsciiEnd == tk.toSlice then
let insertSpace ← do
if ident && st.leadWordIdent then
-- Both idents => need space
pure true
else
-- Check if we would parse more than `tk` as a single token
let tk' := tk.trimAsciiStart.copy
let t ← parseToken $ tk' ++ st.leadWord
if t.pos ≤ tk'.rawEndPos then
-- stopped within `tk` => use it as is
pure false
else
-- stopped after `tk` => add space
pure true
if !insertSpace then
-- extend `leadWord` if not prefixed by whitespace
push tk
modify fun st => { st with leadWord := if tk.trimAsciiStart == tk.toSlice then tk ++ st.leadWord else "", leadWordIdent := ident }
else
pushLine
push tk
modify fun st => { st with leadWord := if tk.trimAsciiStart == tk.toSlice then tk else "", leadWordIdent := ident }
else
-- already separated => use `tk` as is
if st.leadWord == "" then
push tk.trimAsciiEnd.copy
else if tk.endsWith " " then
pushLine
push tk.trimAsciiEnd.copy
else
push tk -- preserve special whitespace for tokens like ":=\n"
modify fun st => { st with leadWord := if tk.trimAsciiStart == tk.toSlice then tk else "", leadWordIdent := ident }
if let SourceInfo.original ss _ _ _ := info then
-- preserve non-whitespace content (comments)
let ss' := ss.trim
unless ss'.isEmpty do
let preNL := Substring.Raw.contains { ss with stopPos := ss'.startPos } '\n'
let postNL := Substring.Raw.contains { ss with startPos := ss'.stopPos } '\n'
-- Indentation is automatically increased when entering a category, but comments should be aligned
-- with the actual token, so dedent
indent (indent := some (-Std.Format.getIndent (← getOptions))) do
if postNL then
pushWhitespace "\n"
else
pushLine
pushWhitespace ss'.toString
if preNL then
pushWhitespace "\n"
else
-- It is conceivable that the start of comment syntax could be misinterpreted as part of a token,
-- so add the beginning of it as the leadWord.
let ctk := ss' |>.takeWhile (!·.isWhitespace) |>.toString
modify fun st => { st with leadWord := ctk }
@[combinator_formatter symbolNoAntiquot, expose]
def symbolNoAntiquot.formatter (sym : String) : Formatter := do
let stx ← getCur
if stx.isToken sym then
let (Syntax.atom info _) := stx | unreachable!
withMaybeTag (getExprPos? stx) <| pushToken info sym false
goLeft
else
trace[PrettyPrinter.format.backtrack] "unexpected syntax '{format stx}', expected symbol '{sym}'"
throwBacktrack
@[combinator_formatter nonReservedSymbolNoAntiquot, expose] def nonReservedSymbolNoAntiquot.formatter := symbolNoAntiquot.formatter
@[combinator_formatter rawCh, expose] def rawCh.formatter (ch : Char) (trailingWs : Bool := false) := do
unless trailingWs do
resetLeadWord
symbolNoAntiquot.formatter ch.toString
@[combinator_formatter unicodeSymbolNoAntiquot, expose]
def unicodeSymbolNoAntiquot.formatter (sym asciiSym : String) (preserveForPP : Bool) : Formatter := do
let stx ← getCur
let usesUnicode := stx.isToken sym
let usesAscii := stx.isToken asciiSym
if usesUnicode || usesAscii then
let (Syntax.atom info _) := stx | unreachable!
-- Use unicode version if pp.unicode is enabled and either preserveForPP is false or the syntax contains the unicode version
if getPPUnicode (← getOptions) && (!preserveForPP || usesUnicode) then
withMaybeTag (getExprPos? stx) <| pushToken info sym false
else
withMaybeTag (getExprPos? stx) <| pushToken info asciiSym false
goLeft
else
trace[PrettyPrinter.format.backtrack] "unexpected syntax '{format stx}', expected symbol '{sym}' or '{asciiSym}'"
throwBacktrack
@[combinator_formatter identNoAntiquot, expose]
def identNoAntiquot.formatter : Formatter := do
checkKind identKind
let stx@(Syntax.ident info _ id _) ← getCur
| throwError m!"not an ident: {← getCur}"
let id := id.simpMacroScopes
let table := (← read).table
let isToken (s : String) : Bool := (table.find? s).isSome
withMaybeTag (getExprPos? stx) (pushToken info (id.toStringWithToken (isToken := isToken)) true)
goLeft
@[combinator_formatter rawIdentNoAntiquot, expose] def rawIdentNoAntiquot.formatter : Formatter := do
checkKind identKind
let stx@(Syntax.ident info _ id _) ← getCur
| throwError m!"not an ident: {← getCur}"
withMaybeTag (getExprPos? stx) (pushToken info id.toString true)
goLeft
@[combinator_formatter identEq, expose] def identEq.formatter (_id : Name) := rawIdentNoAntiquot.formatter
def visitAtom (k : SyntaxNodeKind) : Formatter := do
let stx ← getCur
if k != Name.anonymous then
checkKind k
let Syntax.atom info val ← pure $ stx.ifNode (fun n => n.getArg 0) (fun _ => stx)
| throwError m!"not an atom: {stx}"
pushToken info val false
goLeft
@[combinator_formatter charLitNoAntiquot, expose] def charLitNoAntiquot.formatter := visitAtom charLitKind
@[combinator_formatter strLitNoAntiquot, expose] def strLitNoAntiquot.formatter := visitAtom strLitKind
@[combinator_formatter nameLitNoAntiquot, expose] def nameLitNoAntiquot.formatter := visitAtom nameLitKind
@[combinator_formatter numLitNoAntiquot, expose] def numLitNoAntiquot.formatter := visitAtom numLitKind
@[combinator_formatter scientificLitNoAntiquot, expose] def scientificLitNoAntiquot.formatter := visitAtom scientificLitKind
@[combinator_formatter fieldIdx, expose] def fieldIdx.formatter := visitAtom fieldIdxKind
@[combinator_formatter manyNoAntiquot, expose]
def manyNoAntiquot.formatter (p : Formatter) : Formatter := do
let stx ← getCur
visitArgs $ stx.getArgs.size.forM fun _ _ => p
@[combinator_formatter many1NoAntiquot, expose] def many1NoAntiquot.formatter (p : Formatter) : Formatter := manyNoAntiquot.formatter p
@[combinator_formatter optionalNoAntiquot, expose]
def optionalNoAntiquot.formatter (p : Formatter) : Formatter := do
let stx ← getCur
visitArgs <| unless stx.getArgs.isEmpty do p
@[combinator_formatter many1Unbox, expose]
def many1Unbox.formatter (p : Formatter) : Formatter := do
let stx ← getCur
if stx.getKind == nullKind then do
manyNoAntiquot.formatter p
else
p
@[combinator_formatter sepByNoAntiquot, expose]
def sepByNoAntiquot.formatter (p pSep : Formatter) : Formatter := do
let stx ← getCur
visitArgs <| stx.getArgs.size.forRevM fun i _ => if i % 2 == 0 then p else pSep
@[combinator_formatter sepBy1NoAntiquot, expose] def sepBy1NoAntiquot.formatter := sepByNoAntiquot.formatter
@[combinator_formatter withoutInfo, expose] def withoutInfo.formatter (p : Formatter) : Formatter := p
@[combinator_formatter checkWsBefore, expose] def checkWsBefore.formatter : Formatter := do
let st ← get
if st.leadWord != "" then
pushLine
@[combinator_formatter checkPrec, expose] def checkPrec.formatter : Formatter := pure ()
@[combinator_formatter checkLhsPrec, expose] def checkLhsPrec.formatter : Formatter := pure ()
@[combinator_formatter setLhsPrec, expose] def setLhsPrec.formatter : Formatter := pure ()
@[combinator_formatter checkStackTop, expose] def checkStackTop.formatter : Formatter := pure ()
@[combinator_formatter checkNoWsBefore, expose] def checkNoWsBefore.formatter : Formatter :=
-- prevent automatic whitespace insertion
resetLeadWord
@[combinator_formatter checkLinebreakBefore, expose] def checkLinebreakBefore.formatter : Formatter := pure ()
@[combinator_formatter checkTailWs, expose] def checkTailWs.formatter : Formatter := pure ()
@[combinator_formatter checkColEq, expose] def checkColEq.formatter : Formatter := pure ()
@[combinator_formatter checkColGe, expose] def checkColGe.formatter : Formatter := pure ()
@[combinator_formatter checkColGt, expose] def checkColGt.formatter : Formatter := pure ()
@[combinator_formatter checkLineEq, expose] def checkLineEq.formatter : Formatter := pure ()
@[combinator_formatter eoi, expose] def eoi.formatter : Formatter := pure ()
@[combinator_formatter checkNoImmediateColon, expose] def checkNoImmediateColon.formatter : Formatter := pure ()
@[combinator_formatter skip, expose] def skip.formatter : Formatter := pure ()
@[combinator_formatter pushNone, expose] def pushNone.formatter : Formatter := goLeft
@[combinator_formatter hygieneInfoNoAntiquot, expose] def hygieneInfoNoAntiquot.formatter : Formatter := goLeft
@[combinator_formatter interpolatedStr, expose]
def interpolatedStr.formatter (p : Formatter) : Formatter := do
visitArgs $ (← getCur).getArgs.reverse.forM fun chunk =>
match chunk.isLit? interpolatedStrLitKind with
| some str => push str *> goLeft
| none => p
@[combinator_formatter hexnumNoAntiquot, expose] def hexnum.formatter := visitAtom hexnumKind
@[combinator_formatter _root_.ite, expose, macro_inline] def ite {_ : Type} (c : Prop) [Decidable c] (t e : Formatter) : Formatter :=
if c then t else e
abbrev FormatterAliasValue := AliasValue Formatter
builtin_initialize formatterAliasesRef : IO.Ref (NameMap FormatterAliasValue) ← IO.mkRef {}
def registerAlias (aliasName : Name) (v : FormatterAliasValue) : IO Unit := do
Parser.registerAliasCore formatterAliasesRef aliasName v
instance : Coe Formatter FormatterAliasValue := { coe := AliasValue.const }
instance : Coe (Formatter → Formatter) FormatterAliasValue := { coe := AliasValue.unary }
instance : Coe (Formatter → Formatter → Formatter) FormatterAliasValue := { coe := AliasValue.binary }
end Formatter
open Formatter
register_builtin_option pp.oneline : Bool := {
defValue := false
descr := "(pretty printer) elide all but first line of pretty printer output"
}
namespace OneLine
/-!
The `OneLine.pretty` function takes the first line of a `Format` while preserving tags.
-/
structure State where
line : Format := .nil
column : Nat := 0
tags : List (Nat × Format) := []
/-- We use `EStateM` to be able to abort pretty printing once we get to the end of a line. -/
abbrev M := EStateM Unit State
def continuation : String := " [...]"
instance : Std.Format.MonadPrettyFormat M where
pushOutput s := do
let lineEnd := s.find '\n'
if ¬lineEnd.IsAtEnd then
let s := (s.sliceTo lineEnd).trimAsciiEnd.copy ++ continuation
modify fun st => { st with line := st.line.append s }
throw ()
else
modify fun st => { st with line := st.line.append s, column := st.column + s.length }
pushNewline _ := do
modify fun st => { st with line := st.line.append continuation }
throw ()
currColumn := return (← get).column
startTag tag := modify fun st => { st with line := .nil, tags := (tag, st.line) :: st.tags }
endTags num := do
let tags := (← get).tags
let ended := tags.take num
let acc := ended.foldl (init := (← get).line) fun acc (t, line') => line'.append (acc.tag t)
modify fun st => { st with line := acc, tags := tags.drop num }
/--
Pretty prints `f` and creates a new `Format` of its first line. Preserves tags.
-/
def pretty (f : Format) (width : Nat) : Format :=
let m : M Unit := Std.Format.prettyM f width
match m.run {} with
| .ok _ s | .error _ s =>
s.tags.foldl (init := s.line) fun acc (t, line') => line'.append (acc.tag t)
end OneLine
def format (formatter : Formatter) (stx : Syntax) : CoreM Format := do
trace[PrettyPrinter.format.input] "{Std.format stx}"
let options ← getOptions
let table := Parser.getTokenTable (← getEnv)
catchInternalId backtrackExceptionId
(do
let (_, st) ← (concat formatter { table, options }).run { stxTrav := .fromSyntax stx }
let mut f := st.stack[0]!
if pp.oneline.get options then
f := OneLine.pretty f (Std.Format.format.width.get options)
return .fill f)
(fun _ => throwError "format: uncaught backtrack exception")
def formatCategory (cat : Name) := format <| categoryFormatter cat
def formatTerm := formatCategory `term
def formatTactic := formatCategory `tactic
def formatCommand := formatCategory `command
builtin_initialize
registerTraceClass `PrettyPrinter.format
registerTraceClass `PrettyPrinter.format.backtrack (inherited := true)
registerTraceClass `PrettyPrinter.format.input (inherited := true)
end PrettyPrinter
end Lean