partial def Lean.Elab.Term.Quotation.mkTuple : Array Lean.Syntax → Lean.Elab.TermElabM Lean.Syntax

def Lean.Elab.Term.Quotation.resolveSectionVariable (sectionVars : Lean.NameMap Lean.Name) (id : Lean.Name) : List (Lean.Name × List String)

def Lean.Elab.Term.Quotation.resolveSectionVariable.loop (sectionVars : Lean.NameMap Lean.Name) (extractionResult : Lean.MacroScopesView) : Lean.Name → List String → List (Lean.Name × List String)

def Lean.Elab.Term.Quotation.ArrayStxBuilder : Type

Transform sequence of pushes and appends into acceptable code

def Lean.Elab.Term.Quotation.ArrayStxBuilder.empty : Lean.Elab.Term.Quotation.ArrayStxBuilder

def Lean.Elab.Term.Quotation.ArrayStxBuilder.build : Lean.Elab.Term.Quotation.ArrayStxBuilder → Lean.Term

Equations

• Lean.Elab.Term.Quotation.ArrayStxBuilder.build (Sum.inl elems) = Lean.quote `term elems
• Lean.Elab.Term.Quotation.ArrayStxBuilder.build (Sum.inr arr) = arr

def Lean.Elab.Term.Quotation.ArrayStxBuilder.push (b : Lean.Elab.Term.Quotation.ArrayStxBuilder) (elem : Lean.Syntax) : Lean.Elab.Term.Quotation.ArrayStxBuilder

Equations

• Lean.Elab.Term.Quotation.ArrayStxBuilder.push (Sum.inl elems) elem = Sum.inl (elems.push { raw := elem })
• Lean.Elab.Term.Quotation.ArrayStxBuilder.push (Sum.inr arr) elem = Sum.inr (Lean.Syntax.mkCApp `Array.push #[arr, { raw := elem }])

def Lean.Elab.Term.Quotation.ArrayStxBuilder.append (b : Lean.Elab.Term.Quotation.ArrayStxBuilder) (arr : Lean.Syntax) (appendName : Lean.Name := `Array.append) : Lean.Elab.Term.Quotation.ArrayStxBuilder

Equations

• b.append arr appendName = Sum.inr (Lean.Syntax.mkCApp appendName #[b.build, { raw := arr }])

def Lean.Elab.Term.Quotation.ArrayStxBuilder.mkNode (b : Lean.Elab.Term.Quotation.ArrayStxBuilder) (k : Lean.SyntaxNodeKind) : Lean.Elab.TermElabM Lean.Term

def Lean.Elab.Term.Quotation.tryAddSyntaxNodeKindInfo (stx : Lean.Syntax) (k : Lean.SyntaxNodeKind) : Lean.Elab.TermElabM Unit

Equations

• One or more equations did not get rendered due to their size.

instance Lean.Elab.Term.Quotation.instQuotePreresolvedMkStr1_lean : Lean.Quote Lean.Syntax.Preresolved

def Lean.Elab.Term.Quotation.addNamedQuotInfo (stx : Lean.Syntax) (k : Lean.SyntaxNodeKind) : Lean.Elab.TermElabM Lean.SyntaxNodeKind

Equations

• One or more equations did not get rendered due to their size.

def Lean.Elab.Term.Quotation.getQuotKind (stx : Lean.Syntax) : Lean.Elab.TermElabM Lean.SyntaxNodeKind

Equations

• One or more equations did not get rendered due to their size.

def Lean.Elab.Term.Quotation.mkSyntaxQuotation (stx : Lean.Syntax) (kind : Lean.Name) : Lean.Elab.TermElabM Lean.Syntax

Equations

• One or more equations did not get rendered due to their size.

def Lean.Elab.Term.Quotation.stxQuot.expand (stx : Lean.Syntax) : Lean.Elab.TermElabM Lean.Syntax

def Lean.Elab.Term.Quotation.commandElab_stx_quot_ : Lean.ParserDescr

Equations

• One or more equations did not get rendered due to their size.

match

inductive Lean.Elab.Term.Quotation.HeadCheck : Type

In a single match step, we match the first discriminant against the "head" of the first pattern of the first alternative. This datatype describes what kind of check this involves, which helps other patterns decide if they are covered by the same check and don't have to be checked again (see also MatchResult).

• unconditional: Lean.Elab.Term.Quotation.HeadCheck

  match step that always succeeds: _, x, `($x), ...

• shape: List Lean.SyntaxNodeKind → Option Nat → Lean.Elab.Term.Quotation.HeadCheck

  match step based on kind and, optionally, arity of discriminant If arity is given, that number of new discriminants is introduced. covered patterns should then introduce the same number of new patterns. We actually check the arity at run time only in the case of null nodes since it should otherwise by implied by the node kind. without arity: `($x:k) with arity: any quotation without an antiquotation head pattern

• slice: Nat → Nat → Lean.Elab.Term.Quotation.HeadCheck

  Match step that succeeds on null nodes of arity at least numPrefix + numSuffix, introducing discriminants for the first numPrefix children, one null node for those in between, and for the numSuffix last children. example: ([$x, $xs,*, $y]) is slice 2 2`

• other: Lean.Syntax → Lean.Elab.Term.Quotation.HeadCheck

  other, complicated match step that will probably only cover identical patterns example: antiquotation splices `($[...]*)

inductive Lean.Elab.Term.Quotation.MatchResult : Type

Describe whether a pattern is covered by a head check (induced by the pattern itself or a different pattern).

• covered: (Lean.Elab.Term.Quotation.Alt✝ → Lean.Elab.TermElabM Lean.Elab.Term.Quotation.Alt✝) → Bool → Lean.Elab.Term.Quotation.MatchResult

  Pattern agrees with head check, remove and transform remaining alternative. If exhaustive is false, also include unchanged alternative in the "no" branch.

• uncovered: Lean.Elab.Term.Quotation.MatchResult

  Pattern disagrees with head check, include in "no" branch only

• undecided: Lean.Elab.Term.Quotation.MatchResult

  Pattern is not quite sure yet; include unchanged in both branches

instance Lean.Elab.Term.Quotation.instReprMatchResult : Repr Lean.Elab.Term.Quotation.MatchResult

structure Lean.Elab.Term.Quotation.HeadInfo : Type

All necessary information on a pattern head.

• check : Lean.Elab.Term.Quotation.HeadCheck

  check induced by the pattern

• onMatch : Lean.Elab.Term.Quotation.HeadCheck → Lean.Elab.Term.Quotation.MatchResult

  compute compatibility of pattern with given head check

• doMatch : (List Lean.Term → Lean.Elab.TermElabM Lean.Term) → Lean.Elab.TermElabM Lean.Term → Lean.Elab.TermElabM Lean.Term

  actually run the specified head check, with the discriminant bound to __discr

@[reducible, inline]

abbrev Lean.Elab.Term.Quotation.IdxSet : Type

def Lean.Elab.Term.Quotation.match_syntax.expand (stx : Lean.Syntax) : Lean.Elab.TermElabM Lean.Syntax

Equations

• One or more equations did not get rendered due to their size.

def Lean.Elab.Term.Quotation.elabMatchSyntax : Lean.Elab.Term.TermElab

def Lean.Elab.Term.Quotation.elabNoErrorIfUnused : Lean.Elab.Term.TermElab