chore: fix indentation

Author: wkrozowski

src/Std/Data/DHashMap/Raw.lean

@@ -517,18 +517,18 @@ Compares two hash maps using Boolean equality on keys and values.
 Returns `true` if the maps contain the same key-value pairs, `false` otherwise.
 -/
 def beq [BEq α] [Hashable α] [LawfulBEq α] [∀ k, BEq (β k)] (m₁ m₂ : Raw α β) : Bool :=
-    if h : 0 < m₁.buckets.size ∧ 0 < m₂.buckets.size then
-      Raw₀.beq ⟨m₁, h.1⟩ ⟨m₂, h.2⟩
-    else
-      false
+  if h : 0 < m₁.buckets.size ∧ 0 < m₂.buckets.size then
+    Raw₀.beq ⟨m₁, h.1⟩ ⟨m₂, h.2⟩
+  else
+    false
 
 instance [BEq α] [Hashable α] [LawfulBEq α] [∀ k, BEq (β k)] : BEq (Raw α β) := ⟨beq⟩
 
 @[inherit_doc DHashMap.Raw.beq] def Const.beq {β : Type v} [BEq α] [Hashable α] [BEq β] (m₁ m₂ : Raw α (fun _ => β)) : Bool :=
-   if h : 0 < m₁.buckets.size ∧ 0 < m₂.buckets.size then
-        Raw₀.Const.beq ⟨m₁, h.1⟩ ⟨m₂, h.2⟩
-    else
-      false
+  if h : 0 < m₁.buckets.size ∧ 0 < m₂.buckets.size then
+      Raw₀.Const.beq ⟨m₁, h.1⟩ ⟨m₂, h.2⟩
+  else
+    false
 
 /--
 Computes the difference of the given hash maps.