Additions to Lean.Meta.DiscrTree

def Lean.Meta.DiscrTree.insertIfSpecific {α : Type} {s : Bool} [BEq α] (d : Lean.Meta.DiscrTree α s) (keys : Array (Lean.Meta.DiscrTree.Key s)) (v : α) : Lean.Meta.DiscrTree α s

Inserts a new key into a discrimination tree, but only if it is not of the form #[*] or #[=, *, *, *].

Equations

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

partial def Lean.Meta.DiscrTree.getSubexpressionMatches {α : Type} {s : Bool} (d : Lean.Meta.DiscrTree α s) (e : Lean.Expr) : Lean.MetaM (Array α)

Find keys which match the expression, or some subexpression.

Note that repeated subexpressions will be visited each time they appear, making this operation potentially very expensive. It would be good to solve this problem!

Implementation: we reverse the results from getMatch, so that we return lemmas matching larger subexpressions first, and amongst those we return more specific lemmas first.

def Lean.Meta.DiscrTree.Trie.mapArrays {α : Type} {s : Bool} {β : Type} (t : Lean.Meta.DiscrTree.Trie α s) (f : Array α → Array β) : Lean.Meta.DiscrTree.Trie β s

Apply a function to the array of values at each node in a DiscrTree.

Equations

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

partial def Lean.Meta.DiscrTree.Trie.mapArrays.go {α : Type} {s : Bool} {β : Type} (f : Array α → Array β) (cs : Array (Lean.Meta.DiscrTree.Key s × Lean.Meta.DiscrTree.Trie β s)) (vs : Array β) (todo : Array (Lean.Meta.DiscrTree.Key s × Lean.Meta.DiscrTree.Trie α s)) (ps : Lean.Meta.DiscrTree.Ctxt) : Lean.Meta.DiscrTree.Trie β s

This implementation as a single tail-recursive function is chosen to not blow the interpreter stack when the Trie is very deep

def Lean.Meta.DiscrTree.mapArrays {α : Type} {s : Bool} {β : Type} (d : Lean.Meta.DiscrTree α s) (f : Array α → Array β) : Lean.Meta.DiscrTree β s

Apply a function to the array of values at each node in a DiscrTree.

Equations

• Lean.Meta.DiscrTree.mapArrays d f = { root := Lean.PersistentHashMap.map d.root fun t => Lean.Meta.DiscrTree.Trie.mapArrays t f }