forEachWhere p f e is similar to forEach f e, but only applies f to subterms that satisfy the (pure) predicate p. It also uses the caching trick used at FindExpr and ReplaceExpr. This can be very effective if the number of subterms satisfying p is a small subset of the set of subterms. If p holds for most subterms, then it is more efficient to use forEach f e.

@[inline]

abbrev Lean.ForEachExprWhere.cacheSize : USize

Equations

• Lean.ForEachExprWhere.cacheSize = 8192 - 1

structure Lean.ForEachExprWhere.State : Type

• Implements caching trick similar to the one used at FindExpr and ReplaceExpr.

  visited : Array Lean.Expr

• Set of visited subterms that satisfy the predicate p. We have to use this set to make sure f is applied at most once of each subterm that satisfies p.

  checked : Lean.HashSet Lean.Expr

unsafe def Lean.ForEachExprWhere.initCache : Lean.ForEachExprWhere.State

Equations

• Lean.ForEachExprWhere.initCache = { visited := mkArray (USize.toNat Lean.ForEachExprWhere.cacheSize) (cast Lean.ForEachExprWhere.initCache.proof_1 ()), checked := ∅ }

@[inline]

abbrev Lean.ForEachExprWhere.ForEachM {ω : Type} (m : Type → Type) [inst : STWorld ω m] [inst : MonadLiftT (ST ω) m] [inst : Monad m] (α : Type) : Type

Equations

• Lean.ForEachExprWhere.ForEachM m = StateRefT' ω Lean.ForEachExprWhere.State m

unsafe def Lean.ForEachExprWhere.visited {ω : Type} {m : Type → Type} [inst : STWorld ω m] [inst : MonadLiftT (ST ω) m] [inst : Monad m] (e : Lean.Expr) : Lean.ForEachExprWhere.ForEachM m Bool

Equations

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

def Lean.ForEachExprWhere.checked {ω : Type} {m : Type → Type} [inst : STWorld ω m] [inst : MonadLiftT (ST ω) m] [inst : Monad m] (e : Lean.Expr) : Lean.ForEachExprWhere.ForEachM m Bool

Equations

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

unsafe def Lean.ForEachExprWhere.visit {ω : Type} {m : Type → Type} [inst : STWorld ω m] [inst : MonadLiftT (ST ω) m] [inst : Monad m] (p : Lean.Expr → Bool) (f : Lean.Expr → m Unit) (e : Lean.Expr) : m Unit

Expr.forEachWhere (unsafe) implementation

Equations

• Lean.ForEachExprWhere.visit p f e = StateRefT'.run' (Lean.ForEachExprWhere.visit.go p f e) Lean.ForEachExprWhere.initCache

unsafe def Lean.ForEachExprWhere.visit.go {ω : Type} {m : Type → Type} [inst : STWorld ω m] [inst : MonadLiftT (ST ω) m] [inst : Monad m] (p : Lean.Expr → Bool) (f : Lean.Expr → m Unit) (e : Lean.Expr) : StateRefT' ω Lean.ForEachExprWhere.State m Unit

Equations

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

@[implemented_by Lean.ForEachExprWhere.visit]

opaque Lean.Expr.forEachWhere {ω : Type} {m : Type → Type} [inst : STWorld ω m] [inst : MonadLiftT (ST ω) m] [inst : Monad m] (p : Lean.Expr → Bool) (f : Lean.Expr → m Unit) (e : Lean.Expr) : m Unit

e.forEachWhere p f applies f to each subterm that satisfies p.