structure Lean.Elab.InfoWithCtx : Type

• ctx : Lean.Elab.ContextInfo
• info : Lean.Elab.Info
• children : Lean.PersistentArray Lean.Elab.InfoTree

Elaborator information with elaborator context.

It can be thought of as a "thunked" elaboration computation that allows us to retroactively extract type information, symbol locations, etc. through arbitrary invocations of runMetaM (where the necessary context and state can be reconstructed from ctx and info.lctx).

W.r.t. widgets, this is used to tag different parts of expressions in ppExprTagged. This is the input to the RPC call Lean.Widget.InteractiveDiagnostics.infoToInteractive. It carries over information about delaborated Info nodes in a CodeWithInfos, and the associated pretty-printing functionality is purpose-specific to showing the contents of infoview popups.

For use in standard LSP go-to-definition (see Lean.Server.FileWorker.locationLinksOfInfo), all the elaborator information we need for similar tasks is already fully recoverable via the InfoTree structure (see Lean.Elab.InfoTree.visitM). There we use this as a convienience wrapper for queried nodes (e.g. the return value of Lean.Elab.InfoTree.hoverableInfoAt?). It also includes the children info nodes as additional context (this is unused in the RPC case, as delaboration has no notion of child nodes).

NOTE: This type is for internal use in the infoview/LSP. It should not be used in user widgets.

def Lean.Elab.InfoTree.visitM {m : Type → Type u_1} {α : Type} [Monad m] (preNode : optParam (Lean.Elab.ContextInfo → Lean.Elab.Info → Lean.PersistentArray Lean.Elab.InfoTree → m Unit) fun x x x => pure ()) (postNode : Lean.Elab.ContextInfo → Lean.Elab.Info → Lean.PersistentArray Lean.Elab.InfoTree → List (Option α) → m α) : Lean.Elab.InfoTree → m (Option α)

Visit nodes, passing in a surrounding context (the innermost one) and accumulating results on the way back up.

partial def Lean.Elab.InfoTree.visitM.go {m : Type → Type u_1} {α : Type} [Monad m] (preNode : optParam (Lean.Elab.ContextInfo → Lean.Elab.Info → Lean.PersistentArray Lean.Elab.InfoTree → m Unit) fun x x x => pure ()) (postNode : Lean.Elab.ContextInfo → Lean.Elab.Info → Lean.PersistentArray Lean.Elab.InfoTree → List (Option α) → m α) : Option Lean.Elab.ContextInfo → Lean.Elab.InfoTree → m (Option α)

def Lean.Elab.InfoTree.visitM' {m : Type → Type u_1} [Monad m] (preNode : optParam (Lean.Elab.ContextInfo → Lean.Elab.Info → Lean.PersistentArray Lean.Elab.InfoTree → m Unit) fun x x x => pure ()) (postNode : optParam (Lean.Elab.ContextInfo → Lean.Elab.Info → Lean.PersistentArray Lean.Elab.InfoTree → m Unit) fun x x x => pure ()) (t : Lean.Elab.InfoTree) : m Unit

InfoTree.visitM specialized to Unit return type

def Lean.Elab.InfoTree.collectNodesBottomUp {α : Type} (p : Lean.Elab.ContextInfo → Lean.Elab.Info → Lean.PersistentArray Lean.Elab.InfoTree → List α → List α) (i : Lean.Elab.InfoTree) : List α

Visit nodes bottom-up, passing in a surrounding context (the innermost one) and the union of nested results (empty at leaves).

def Lean.Elab.InfoTree.deepestNodes {α : Type} (p : Lean.Elab.ContextInfo → Lean.Elab.Info → Lean.PersistentArray Lean.Elab.InfoTree → Option α) (infoTree : Lean.Elab.InfoTree) : List α

For every branch of the InfoTree, find the deepest node in that branch for which p returns some _ and return the union of all such nodes. The visitor p is given a node together with its innermost surrounding ContextInfo.

def Lean.Elab.InfoTree.foldInfo {α : Type u_1} (f : Lean.Elab.ContextInfo → Lean.Elab.Info → α → α) (init : α) : Lean.Elab.InfoTree → α

partial def Lean.Elab.InfoTree.foldInfo.go {α : Type u_1} (f : Lean.Elab.ContextInfo → Lean.Elab.Info → α → α) (ctx? : Option Lean.Elab.ContextInfo) (a : α) : Lean.Elab.InfoTree → α

def Lean.Elab.Info.isTerm : Lean.Elab.Info → Bool

def Lean.Elab.Info.isCompletion : Lean.Elab.Info → Bool

def Lean.Elab.InfoTree.getCompletionInfos (infoTree : Lean.Elab.InfoTree) : Array (Lean.Elab.ContextInfo × Lean.Elab.CompletionInfo)

def Lean.Elab.Info.stx : Lean.Elab.Info → Lean.Syntax

def Lean.Elab.Info.lctx : Lean.Elab.Info → Lean.LocalContext

def Lean.Elab.Info.pos? (i : Lean.Elab.Info) : Option String.Pos

def Lean.Elab.Info.tailPos? (i : Lean.Elab.Info) : Option String.Pos

def Lean.Elab.Info.range? (i : Lean.Elab.Info) : Option String.Range

def Lean.Elab.Info.contains (i : Lean.Elab.Info) (pos : String.Pos) (includeStop : optParam Bool false) : Bool

def Lean.Elab.Info.size? (i : Lean.Elab.Info) : Option String.Pos

def Lean.Elab.Info.isSmaller (i₁ : Lean.Elab.Info) (i₂ : Lean.Elab.Info) : Bool

def Lean.Elab.Info.occursBefore? (i : Lean.Elab.Info) (hoverPos : String.Pos) : Option String.Pos

def Lean.Elab.Info.occursInside? (i : Lean.Elab.Info) (hoverPos : String.Pos) : Option String.Pos

def Lean.Elab.InfoTree.smallestInfo? (p : Lean.Elab.Info → Bool) (t : Lean.Elab.InfoTree) : Option (Lean.Elab.ContextInfo × Lean.Elab.Info)

def Lean.Elab.InfoTree.hoverableInfoAt? (t : Lean.Elab.InfoTree) (hoverPos : String.Pos) (includeStop : optParam Bool false) (omitAppFns : optParam Bool false) (omitIdentApps : optParam Bool false) : Option Lean.Elab.InfoWithCtx

Find an info node, if any, which should be shown on hover/cursor at position hoverPos.

def Lean.Elab.Info.type? (i : Lean.Elab.Info) : Lean.MetaM (Option Lean.Expr)

def Lean.Elab.Info.docString? (i : Lean.Elab.Info) : Lean.MetaM (Option String)

def Lean.Elab.Info.fmtHover? (ci : Lean.Elab.ContextInfo) (i : Lean.Elab.Info) : IO (Option Lean.FormatWithInfos)

Construct a hover popup, if any, from an info node in a context.

def Lean.Elab.Info.fmtHover?.fmtModule? (decl : Lake.Name) : Lean.MetaM (Option Lean.Format)

def Lean.Elab.Info.fmtHover?.fmtTermAndModule? (i : Lean.Elab.Info) : Lean.MetaM (Option Lean.FormatWithInfos × Option Lean.Format)

def Lean.Elab.Info.fmtHover?.isAtomicFormat : Lean.Format → Bool

Equations

• Lean.Elab.Info.fmtHover?.isAtomicFormat (Std.Format.text a) = true
• Lean.Elab.Info.fmtHover?.isAtomicFormat (Lean.Format.group f behavior) = Lean.Elab.Info.fmtHover?.isAtomicFormat f
• Lean.Elab.Info.fmtHover?.isAtomicFormat (Lean.Format.nest indent f) = Lean.Elab.Info.fmtHover?.isAtomicFormat f
• Lean.Elab.Info.fmtHover?.isAtomicFormat (Lean.Format.tag a f) = Lean.Elab.Info.fmtHover?.isAtomicFormat f
• Lean.Elab.Info.fmtHover?.isAtomicFormat x = false

structure Lean.Elab.GoalsAtResult : Type

• ctxInfo : Lean.Elab.ContextInfo
• tacticInfo : Lean.Elab.TacticInfo
• useAfter : Bool
• indented : Bool

  Whether the tactic info is further indented than the hover position.

• priority : Nat

def Lean.Elab.InfoTree.goalsAt? (text : Lean.FileMap) (t : Lean.Elab.InfoTree) (hoverPos : String.Pos) : List Lean.Elab.GoalsAtResult

Try to retrieve TacticInfo for hoverPos. We retrieve all TacticInfo nodes s.t. hoverPos is inside the node's range plus trailing whitespace. We usually prefer the innermost such nodes so that for composite tactics such as induction, we show the nested proofs' states. However, if hoverPos is after the tactic, we prefer nodes that are not indented relative to it, meaning that e.g. at | in

have := by
  exact foo
|

we show the (final, see below) state of have, not exact.

Moreover, we instruct the LSP server to use the state after tactic execution if

• the hover position is after the info's start position and
• there is no nested tactic info after the hover position (tactic combinators should decide for themselves where to show intermediate states by calling withTacticInfoContext)

partial def Lean.Elab.InfoTree.goalsAt?.hasNestedTactic (hoverPos : String.Pos) (pos : String.Pos) (tailPos : String.Pos) : Lean.Elab.InfoTree → Bool

def Lean.Elab.InfoTree.goalsAt?.isEmptyBy (stx : Lean.Syntax) : Bool

def Lean.Elab.InfoTree.termGoalAt? (t : Lean.Elab.InfoTree) (hoverPos : String.Pos) : Option Lean.Elab.InfoWithCtx

def Lean.Elab.InfoTree.hasSorry : Lean.Elab.InfoTree → IO Bool

partial def Lean.Elab.InfoTree.hasSorry.go (ci? : Option Lean.Elab.ContextInfo) : Lean.Elab.InfoTree → IO Bool