Loogle!

Result

Found 29 declarations mentioning Std.DHashMap.map.

• Std.DHashMap.map 📋 Std.Data.DHashMap.AdditionalOperations
  {α : Type u} {β : α → Type v} {δ : α → Type w} [BEq α] [Hashable α] (f : (a : α) → β a → δ a) (m : Std.DHashMap α β) : Std.DHashMap α δ
• Std.DHashMap.map_id_equiv 📋 Std.Data.DHashMap.Lemmas
  {α : Type u} {β : α → Type v} {x✝ : BEq α} {x✝¹ : Hashable α} {m : Std.DHashMap α β} : (Std.DHashMap.map (fun x v => v) m).Equiv m
• Std.DHashMap.keys_map 📋 Std.Data.DHashMap.Lemmas
  {α : Type u} {β : α → Type v} {x✝ : BEq α} {x✝¹ : Hashable α} {m : Std.DHashMap α β} {γ : α → Type w} {f : (a : α) → β a → γ a} : (Std.DHashMap.map f m).keys.Perm m.keys
• Std.DHashMap.isEmpty_map 📋 Std.Data.DHashMap.Lemmas
  {α : Type u} {β : α → Type v} {x✝ : BEq α} {x✝¹ : Hashable α} {m : Std.DHashMap α β} {γ : α → Type w} [EquivBEq α] [LawfulHashable α] {f : (a : α) → β a → γ a} : (Std.DHashMap.map f m).isEmpty = m.isEmpty
• Std.DHashMap.size_map 📋 Std.Data.DHashMap.Lemmas
  {α : Type u} {β : α → Type v} {x✝ : BEq α} {x✝¹ : Hashable α} {m : Std.DHashMap α β} {γ : α → Type w} [EquivBEq α] [LawfulHashable α] {f : (a : α) → β a → γ a} : (Std.DHashMap.map f m).size = m.size
• Std.DHashMap.contains_map 📋 Std.Data.DHashMap.Lemmas
  {α : Type u} {β : α → Type v} {x✝ : BEq α} {x✝¹ : Hashable α} {m : Std.DHashMap α β} {γ : α → Type w} [EquivBEq α] [LawfulHashable α] {f : (a : α) → β a → γ a} {k : α} : (Std.DHashMap.map f m).contains k = m.contains k
• Std.DHashMap.getKey?_map 📋 Std.Data.DHashMap.Lemmas
  {α : Type u} {β : α → Type v} {x✝ : BEq α} {x✝¹ : Hashable α} {m : Std.DHashMap α β} {γ : α → Type w} [EquivBEq α] [LawfulHashable α] {f : (a : α) → β a → γ a} {k : α} : (Std.DHashMap.map f m).getKey? k = m.getKey? k
• Std.DHashMap.Equiv.map 📋 Std.Data.DHashMap.Lemmas
  {α : Type u} {β : α → Type v} {γ : α → Type w} {x✝ : BEq α} {x✝¹ : Hashable α} {m₁ m₂ : Std.DHashMap α β} (f : (a : α) → β a → γ a) (h : m₁.Equiv m₂) : (Std.DHashMap.map f m₁).Equiv (Std.DHashMap.map f m₂)
• Std.DHashMap.getKeyD_map 📋 Std.Data.DHashMap.Lemmas
  {α : Type u} {β : α → Type v} {x✝ : BEq α} {x✝¹ : Hashable α} {m : Std.DHashMap α β} {γ : α → Type w} [EquivBEq α] [LawfulHashable α] {f : (a : α) → β a → γ a} {k fallback : α} : (Std.DHashMap.map f m).getKeyD k fallback = m.getKeyD k fallback
• Std.DHashMap.contains_of_contains_map 📋 Std.Data.DHashMap.Lemmas
  {α : Type u} {β : α → Type v} {x✝ : BEq α} {x✝¹ : Hashable α} {m : Std.DHashMap α β} {γ : α → Type w} [EquivBEq α] [LawfulHashable α] {f : (a : α) → β a → γ a} {k : α} : (Std.DHashMap.map f m).contains k = true → m.contains k = true
• Std.DHashMap.getKey!_map 📋 Std.Data.DHashMap.Lemmas
  {α : Type u} {β : α → Type v} {x✝ : BEq α} {x✝¹ : Hashable α} {m : Std.DHashMap α β} {γ : α → Type w} [EquivBEq α] [LawfulHashable α] [Inhabited α] {f : (a : α) → β a → γ a} {k : α} : (Std.DHashMap.map f m).getKey! k = m.getKey! k
• Std.DHashMap.filterMap_equiv_map 📋 Std.Data.DHashMap.Lemmas
  {α : Type u} {β : α → Type v} {x✝ : BEq α} {x✝¹ : Hashable α} {m : Std.DHashMap α β} {γ : α → Type w} [EquivBEq α] [LawfulHashable α] {f : (a : α) → β a → γ a} : (Std.DHashMap.filterMap (fun k v => some (f k v)) m).Equiv (Std.DHashMap.map f m)
• Std.DHashMap.get?_map 📋 Std.Data.DHashMap.Lemmas
  {α : Type u} {β : α → Type v} {x✝ : BEq α} {x✝¹ : Hashable α} {m : Std.DHashMap α β} {γ : α → Type w} [LawfulBEq α] {f : (a : α) → β a → γ a} {k : α} : (Std.DHashMap.map f m).get? k = Option.map (f k) (m.get? k)
• Std.DHashMap.map_map_equiv 📋 Std.Data.DHashMap.Lemmas
  {α : Type u} {β : α → Type v} {x✝ : BEq α} {x✝¹ : Hashable α} {m : Std.DHashMap α β} {γ : α → Type w} {δ : α → Type w'} {f : (a : α) → β a → γ a} {g : (a : α) → γ a → δ a} : (Std.DHashMap.map g (Std.DHashMap.map f m)).Equiv (Std.DHashMap.map (fun k v => g k (f k v)) m)
• Std.DHashMap.mem_of_mem_map 📋 Std.Data.DHashMap.Lemmas
  {α : Type u} {β : α → Type v} {x✝ : BEq α} {x✝¹ : Hashable α} {m : Std.DHashMap α β} {γ : α → Type w} [EquivBEq α] [LawfulHashable α] {f : (a : α) → β a → γ a} {k : α} : k ∈ Std.DHashMap.map f m → k ∈ m
• Std.DHashMap.getD_map 📋 Std.Data.DHashMap.Lemmas
  {α : Type u} {β : α → Type v} {x✝ : BEq α} {x✝¹ : Hashable α} {m : Std.DHashMap α β} {γ : α → Type w} [LawfulBEq α] {f : (a : α) → β a → γ a} {k : α} {fallback : γ k} : (Std.DHashMap.map f m).getD k fallback = (Option.map (f k) (m.get? k)).getD fallback
• Std.DHashMap.mem_map 📋 Std.Data.DHashMap.Lemmas
  {α : Type u} {β : α → Type v} {x✝ : BEq α} {x✝¹ : Hashable α} {m : Std.DHashMap α β} {γ : α → Type w} [EquivBEq α] [LawfulHashable α] {f : (a : α) → β a → γ a} {k : α} : k ∈ Std.DHashMap.map f m ↔ k ∈ m
• Std.DHashMap.get!_map 📋 Std.Data.DHashMap.Lemmas
  {α : Type u} {β : α → Type v} {x✝ : BEq α} {x✝¹ : Hashable α} {m : Std.DHashMap α β} {γ : α → Type w} [LawfulBEq α] {f : (a : α) → β a → γ a} {k : α} [Inhabited (γ k)] : (Std.DHashMap.map f m).get! k = (Option.map (f k) (m.get? k)).get!
• Std.DHashMap.Const.get?_map_of_getKey?_eq_some 📋 Std.Data.DHashMap.Lemmas
  {α : Type u} {x✝ : BEq α} {x✝¹ : Hashable α} {β : Type v} {γ : Type w} {m : Std.DHashMap α fun x => β} [EquivBEq α] [LawfulHashable α] {f : α → β → γ} {k k' : α} (h : m.getKey? k = some k') : Std.DHashMap.Const.get? (Std.DHashMap.map f m) k = Option.map (f k') (Std.DHashMap.Const.get? m k)
• Std.DHashMap.Const.get!_map_of_getKey?_eq_some 📋 Std.Data.DHashMap.Lemmas
  {α : Type u} {x✝ : BEq α} {x✝¹ : Hashable α} {β : Type v} {γ : Type w} {m : Std.DHashMap α fun x => β} [EquivBEq α] [LawfulHashable α] [Inhabited γ] {f : α → β → γ} {k k' : α} (h : m.getKey? k = some k') : Std.DHashMap.Const.get! (Std.DHashMap.map f m) k = (Option.map (f k') (Std.DHashMap.Const.get? m k)).get!
• Std.DHashMap.Const.getD_map_of_getKey?_eq_some 📋 Std.Data.DHashMap.Lemmas
  {α : Type u} {x✝ : BEq α} {x✝¹ : Hashable α} {β : Type v} {γ : Type w} {m : Std.DHashMap α fun x => β} [EquivBEq α] [LawfulHashable α] [Inhabited γ] {f : α → β → γ} {k k' : α} {fallback : γ} (h : m.getKey? k = some k') : Std.DHashMap.Const.getD (Std.DHashMap.map f m) k fallback = (Option.map (f k') (Std.DHashMap.Const.get? m k)).getD fallback
• Std.DHashMap.getKey_map 📋 Std.Data.DHashMap.Lemmas
  {α : Type u} {β : α → Type v} {x✝ : BEq α} {x✝¹ : Hashable α} {m : Std.DHashMap α β} {γ : α → Type w} [EquivBEq α] [LawfulHashable α] {f : (a : α) → β a → γ a} {k : α} {h' : k ∈ Std.DHashMap.map f m} : (Std.DHashMap.map f m).getKey k h' = m.getKey k ⋯
• Std.DHashMap.toList_map 📋 Std.Data.DHashMap.Lemmas
  {α : Type u} {β : α → Type v} {x✝ : BEq α} {x✝¹ : Hashable α} {m : Std.DHashMap α β} {γ : α → Type w} {f : (a : α) → β a → γ a} : (Std.DHashMap.map f m).toList.Perm (List.map (fun p => ⟨p.fst, f p.fst p.snd⟩) m.toList)
• Std.DHashMap.get_map 📋 Std.Data.DHashMap.Lemmas
  {α : Type u} {β : α → Type v} {x✝ : BEq α} {x✝¹ : Hashable α} {m : Std.DHashMap α β} {γ : α → Type w} [LawfulBEq α] {f : (a : α) → β a → γ a} {k : α} {h' : k ∈ Std.DHashMap.map f m} : (Std.DHashMap.map f m).get k h' = f k (m.get k ⋯)
• Std.DHashMap.Const.toList_map 📋 Std.Data.DHashMap.Lemmas
  {α : Type u} {x✝ : BEq α} {x✝¹ : Hashable α} {β : Type v} {γ : Type w} {m : Std.DHashMap α fun x => β} {f : α → β → γ} : (Std.DHashMap.Raw.Const.toList ↑(Std.DHashMap.map f m)).Perm (List.map (fun p => (p.1, f p.1 p.2)) (Std.DHashMap.Raw.Const.toList ↑m))
• Std.DHashMap.Const.get_map 📋 Std.Data.DHashMap.Lemmas
  {α : Type u} {x✝ : BEq α} {x✝¹ : Hashable α} {β : Type v} {γ : Type w} {m : Std.DHashMap α fun x => β} [EquivBEq α] [LawfulHashable α] {f : α → β → γ} {k : α} {h' : k ∈ Std.DHashMap.map f m} : Std.DHashMap.Const.get (Std.DHashMap.map f m) k h' = f (m.getKey k ⋯) (Std.DHashMap.Const.get m k ⋯)
• Std.DHashMap.Const.get?_map 📋 Std.Data.DHashMap.Lemmas
  {α : Type u} {x✝ : BEq α} {x✝¹ : Hashable α} {β : Type v} {γ : Type w} {m : Std.DHashMap α fun x => β} [EquivBEq α] [LawfulHashable α] {f : α → β → γ} {k : α} : Std.DHashMap.Const.get? (Std.DHashMap.map f m) k = Option.pmap (fun v h' => f (m.getKey k h') v) (Std.DHashMap.Const.get? m k) ⋯
• Std.DHashMap.Const.getD_map 📋 Std.Data.DHashMap.Lemmas
  {α : Type u} {x✝ : BEq α} {x✝¹ : Hashable α} {β : Type v} {γ : Type w} {m : Std.DHashMap α fun x => β} [EquivBEq α] [LawfulHashable α] {f : α → β → γ} {k : α} {fallback : γ} : Std.DHashMap.Const.getD (Std.DHashMap.map f m) k fallback = (Option.pmap (fun v h => f (m.getKey k h) v) (Std.DHashMap.Const.get? m k) ⋯).getD fallback
• Std.DHashMap.Const.get!_map 📋 Std.Data.DHashMap.Lemmas
  {α : Type u} {x✝ : BEq α} {x✝¹ : Hashable α} {β : Type v} {γ : Type w} {m : Std.DHashMap α fun x => β} [EquivBEq α] [LawfulHashable α] [Inhabited γ] {f : α → β → γ} {k : α} : Std.DHashMap.Const.get! (Std.DHashMap.map f m) k = (Option.pmap (fun v h => f (m.getKey k h) v) (Std.DHashMap.Const.get? m k) ⋯).get!

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