Loogle!

Result

Found 5 declarations mentioning Vector.mapFinIdxM.map.

• Vector.mapFinIdxM.map 📋 Init.Data.Vector.Basic
  {n : ℕ} {α : Type u} {β : Type v} {m : Type v → Type w} [Monad m] (xs : Vector α n) (f : (i : ℕ) → α → i < n → m β) (i j : ℕ) (inv : i + j = n) (ys : Vector β (n - i)) : m (Vector β n)
• Vector.mapFinIdxM.eq_1 📋 Init.Data.Vector.MapIdx
  {n : ℕ} {α : Type u} {β : Type v} {m : Type v → Type w} [Monad m] (xs : Vector α n) (f : (i : ℕ) → α → i < n → m β) : xs.mapFinIdxM f = Vector.mapFinIdxM.map xs f n 0 ⋯ (Vector.cast ⋯ { toArray := #[], size_toArray := ⋯ })
• Vector.mapFinIdxM.map.eq_1 📋 Init.Data.Vector.MapIdx
  {n : ℕ} {α : Type u} {β : Type v} {m : Type v → Type w} [inst : Monad m] (xs : Vector α n) (f : (i : ℕ) → α → i < n → m β) (j : ℕ) (x : 0 + j = n) (ys_2 : Vector β (n - 0)) : Vector.mapFinIdxM.map xs f 0 j x ys_2 = pure ys_2
• Vector.toArray_mapFinIdxM.go 📋 Init.Data.Vector.MapIdx
  {m : Type u_1 → Type u_2} {α : Type u_3} {n : ℕ} {β : Type u_1} [Monad m] [LawfulMonad m] {xs : Vector α n} {f : (i : ℕ) → α → i < n → m β} (i j : ℕ) (inv : i + j = n) (bs : Vector β (n - i)) : Vector.toArray <$> Vector.mapFinIdxM.map xs f i j inv bs = Array.mapFinIdxM.map xs.toArray (fun i x h => f i x ⋯) i j ⋯ bs.toArray
• Vector.mapFinIdxM.map.eq_2 📋 Init.Data.Vector.MapIdx
  {n : ℕ} {α : Type u} {β : Type v} {m : Type v → Type w} [inst : Monad m] (xs : Vector α n) (f : (i : ℕ) → α → i < n → m β) (j i_2 : ℕ) (inv_2 : i_2 + 1 + j = n) (ys_2 : Vector β (n - (i_2 + 1))) : Vector.mapFinIdxM.map xs f i_2.succ j inv_2 ys_2 = do let __do_lift ← f j xs[j] ⋯ Vector.mapFinIdxM.map xs f i_2 (j + 1) ⋯ (Vector.cast ⋯ (ys_2.push __do_lift))

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 19971e9 serving mathlib revision bce1d65