Loogle!

Result

Found 8 declarations mentioning Std.Iterators.IterM.map.

• Std.Iterators.IterM.map 📋 Init.Data.Iterators.Combinators.Monadic.FilterMap
  {α β γ : Type w} {m : Type w → Type w'} [Std.Iterators.Iterator α m β] [Monad m] (f : β → γ) (it : Std.IterM m β) : Std.IterM m γ
• Std.Iterators.IterM.map.eq_1 📋 Init.Data.Iterators.Lemmas.Combinators.Monadic.FilterMap
  {α β γ : Type w} {m : Type w → Type w'} [Std.Iterators.Iterator α m β] [Monad m] (f : β → γ) (it : Std.IterM m β) : Std.Iterators.IterM.map f it = Std.Iterators.IterM.mapWithPostcondition (fun b => pure (f b)) it
• Std.Iterators.IterM.toListRev_map 📋 Init.Data.Iterators.Lemmas.Combinators.Monadic.FilterMap
  {α β γ : Type w} {m : Type w → Type w'} [Monad m] [LawfulMonad m] [Std.Iterators.Iterator α m β] [Std.Iterators.IteratorCollect α m m] [Std.Iterators.LawfulIteratorCollect α m m] [Std.Iterators.Finite α m] {f : β → γ} (it : Std.IterM m β) : (Std.Iterators.IterM.map f it).toListRev = (fun x => List.map f x) <$> it.toListRev
• Std.Iterators.IterM.toArray_map 📋 Init.Data.Iterators.Lemmas.Combinators.Monadic.FilterMap
  {α β γ : Type w} {m : Type w → Type w'} [Monad m] [LawfulMonad m] [Std.Iterators.Iterator α m β] [Std.Iterators.IteratorCollect α m m] [Std.Iterators.LawfulIteratorCollect α m m] [Std.Iterators.Finite α m] {f : β → γ} (it : Std.IterM m β) : (Std.Iterators.IterM.map f it).toArray = (fun x => Array.map f x) <$> it.toArray
• Std.Iterators.IterM.toList_map 📋 Init.Data.Iterators.Lemmas.Combinators.Monadic.FilterMap
  {α β β' : Type w} {m : Type w → Type w'} [Monad m] [LawfulMonad m] [Std.Iterators.Iterator α m β] [Std.Iterators.IteratorCollect α m m] [Std.Iterators.LawfulIteratorCollect α m m] [Std.Iterators.Finite α m] {f : β → β'} (it : Std.IterM m β) : (Std.Iterators.IterM.map f it).toList = (fun x => List.map f x) <$> it.toList
• Std.Iterators.IterM.step_map 📋 Init.Data.Iterators.Lemmas.Combinators.Monadic.FilterMap
  {α β β' : Type w} {m : Type w → Type w'} [Std.Iterators.Iterator α m β] {it : Std.IterM m β} [Monad m] [LawfulMonad m] {f : β → β'} : (Std.Iterators.IterM.map f it).step = do let __do_lift ← it.step match __do_lift with | ⟨Std.Iterators.IterStep.yield it' out, h⟩ => let out' := f out; pure (Std.Iterators.PlausibleIterStep.yield (Std.Iterators.IterM.map f it') out' ⋯) | ⟨Std.Iterators.IterStep.skip it', h⟩ => pure (Std.Iterators.PlausibleIterStep.skip (Std.Iterators.IterM.map f it') ⋯) | ⟨Std.Iterators.IterStep.done, h⟩ => pure (Std.Iterators.PlausibleIterStep.done ⋯)
• Std.Iterators.Iter.map_eq_toIter_map_toIterM 📋 Init.Data.Iterators.Lemmas.Combinators.FilterMap
  {α β γ : Type w} [Std.Iterators.Iterator α Id β] {it : Std.Iter β} {f : β → γ} : Std.Iterators.Iter.map f it = (Std.Iterators.IterM.map f it.toIterM).toIter
• Std.Iterators.IterM.Equiv.map 📋 Std.Data.Iterators.Lemmas.Combinators.Monadic.FilterMap
  {α₁ α₂ β γ : Type w} {m : Type w → Type w'} [Monad m] [LawfulMonad m] [Std.Iterators.Iterator α₁ m β] [Std.Iterators.Iterator α₂ m β] {f : β → γ} {ita : Std.IterM m β} {itb : Std.IterM m β} (h : ita.Equiv itb) : (Std.Iterators.IterM.map f ita).Equiv (Std.Iterators.IterM.map f itb)

About

Loogle searches Lean and Mathlib definitions and theorems.

You can use Loogle from within the Lean4 VSCode language extension using (by default) Ctrl-K Ctrl-S. You can also try the #loogle command from LeanSearchClient, the CLI version, the Loogle VS Code extension, the lean.nvim integration or the Zulip bot.

Usage

Loogle finds definitions and lemmas in various ways:

1. By constant:
   🔍 Real.sin
   finds all lemmas whose statement somehow mentions the sine function.

2. By lemma name substring:
   🔍 "differ"
   finds all lemmas that have "differ" somewhere in their lemma name.

3. By subexpression:
   🔍 _ * (_ ^ _)
   finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.

   The pattern can also be non-linear, as in
   🔍 Real.sqrt ?a * Real.sqrt ?a

   If the pattern has parameters, they are matched in any order. Both of these will find List.map:
   🔍 (?a -> ?b) -> List ?a -> List ?b
   🔍 List ?a -> (?a -> ?b) -> List ?b

4. By main conclusion:
   🔍 |- tsum _ = _ * tsum _
   finds all lemmas where the conclusion (the subexpression to the right of all → and ∀) has the given shape.

   As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
   🔍 |- _ < _ → tsum _ < tsum _
   will find tsum_lt_tsum even though the hypothesis f i < g i is not the last.

If you pass more than one such search filter, separated by commas Loogle will return lemmas which match all of them. The search
🔍 Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ → _
would find all lemmas which mention the constants Real.sin and tsum, have "two" as a substring of the lemma name, include a product and a power somewhere in the type, and have a hypothesis of the form _ < _ (if there were any such lemmas). Metavariables (?a) are assigned independently in each filter.

The #lucky button will directly send you to the documentation of the first hit.

Source code

You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO.

This is Loogle revision ff04530 serving mathlib revision 8623f65