inductive Lean.HeadIndex : Type

Datastructure for representing the "head symbol" of an expression. It is the key of KExprMap. Examples:

• The head of f a is .const f
• The head of let x := 1; f x is .const f
• The head of fun x => fun is .lam

HeadIndex is a very simple index, and is used in situations where we want to find definitionally equal terms, but we want to minimize the search by checking only pairs of terms that have the same HeadIndex.

• fvar: Lean.FVarId → Lean.HeadIndex
• mvar: Lean.MVarId → Lean.HeadIndex
• const: Lean.Name → Lean.HeadIndex
• proj: Lean.Name → Nat → Lean.HeadIndex
• lit: Lean.Literal → Lean.HeadIndex
• sort: Lean.HeadIndex
• lam: Lean.HeadIndex
• forallE: Lean.HeadIndex

instance Lean.instInhabitedHeadIndex : Inhabited Lean.HeadIndex

instance Lean.instBEqHeadIndex : BEq Lean.HeadIndex

instance Lean.instReprHeadIndex : Repr Lean.HeadIndex

Equations

• Lean.instReprHeadIndex = { reprPrec := Lean.reprHeadIndex✝ }

def Lean.HeadIndex.hash : Lean.HeadIndex → UInt64

Hash code for a HeadIndex value.

Equations

• (Lean.HeadIndex.fvar a).hash = mixHash 11 (hash a)
• (Lean.HeadIndex.mvar a).hash = mixHash 13 (hash a)
• (Lean.HeadIndex.const a).hash = mixHash 17 (hash a)
• (Lean.HeadIndex.proj a a_1).hash = mixHash 19 (mixHash (hash a) (hash a_1))
• (Lean.HeadIndex.lit a).hash = mixHash 23 (hash a)
• Lean.HeadIndex.sort.hash = 29
• Lean.HeadIndex.lam.hash = 31
• Lean.HeadIndex.forallE.hash = 37

instance Lean.instHashableHeadIndex : Hashable Lean.HeadIndex

def Lean.Expr.headNumArgs (e : Lean.Expr) : Nat

Return the number of arguments in the given expression with respect to its HeadIndex

def Lean.Expr.headNumArgs.go : Lean.Expr → Nat → Nat

def Lean.Expr.toHeadIndex (e : Lean.Expr) : Lean.HeadIndex

Convert the given expression into a HeadIndex.

Equations

• e.toHeadIndex = match Lean.Expr.toHeadIndexQuick?✝ e with | some i => i | none => Lean.Expr.toHeadIndexSlow✝ e