really fix the binopInfoTree test

Author: datokrat

tests/lean/binopInfoTree.lean.expected.out

@@ -1,21 +1,21 @@
-[Elab.info]
+[Elab.info] 
   • [Command] @ ⟨3, 0⟩-⟨3, 31⟩ @ Lean.Elab.Command.elabSetOption
     • [Completion] (Command.set_option "set_option" `trace.Elab.info []) @ ⟨3, 0⟩-⟨3, 26⟩
     • [Option] trace.Elab.info @ ⟨3, 11⟩-⟨3, 26⟩
 1 + 2 + 3 : Nat
-[Elab.info]
+[Elab.info] 
   • [Command] @ ⟨5, 0⟩-⟨5, 16⟩ @ Lean.Elab.Command.elabCheck
     • [Term] 1 + 2 + 3 : Nat @ ⟨5, 7⟩-⟨5, 16⟩ @ «_aux_Init_Notation___macroRules_term_+__2»
       • [MacroExpansion]
         1 + 2 +
           3
             -- should propagate through multiple macro expansions
-
+            
         ===>
         binop% HAdd.hAdd✝ (1 + 2)
           3
             -- should propagate through multiple macro expansions
-
+            
         • [Term] 1 + 2 + 3 : Nat @ ⟨5, 7⟩†-⟨5, 16⟩† @ Lean.Elab.Term.Op.elabBinOp
           • [Term] 1 + 2 + 3 : Nat @ ⟨5, 7⟩†-⟨5, 16⟩†
             • [Term] 1 + 2 : Nat @ ⟨5, 7⟩-⟨5, 12⟩ @ «_aux_Init_Notation___macroRules_term_+__2»
@@ -30,24 +30,24 @@
                   • [Term] 2 : Nat @ ⟨5, 11⟩-⟨5, 12⟩ @ Lean.Elab.Term.elabNumLit
             • [Term] 3 : Nat @ ⟨5, 15⟩-⟨5, 16⟩ @ Lean.Elab.Term.elabNumLit
 fun n m l => ↑n + (↑m + ↑l) : Nat → Nat → Nat → Int
-[Elab.info]
+[Elab.info] 
   • [Command] @ ⟨7, 0⟩-⟨7, 48⟩ @ Lean.Elab.Command.elabCheck
     • [Term] fun n m l => ↑n + (↑m + ↑l) : Nat → Nat → Nat → Int @ ⟨7, 7⟩-⟨7, 48⟩ @ Lean.Elab.Term.elabFun
       • [Term] Nat : Type @ ⟨7, 20⟩-⟨7, 23⟩ @ Lean.Elab.Term.elabIdent
-        • [Completion-Id] Nat : some Sort.{?_uniq} @ ⟨7, 20⟩-⟨7, 23⟩
+        • [Completion-Id] Nat : some Sort.{?_uniq.815} @ ⟨7, 20⟩-⟨7, 23⟩
         • [Term] Nat : Type @ ⟨7, 20⟩-⟨7, 23⟩
       • [Term] n (isBinder := true) : Nat @ ⟨7, 12⟩-⟨7, 13⟩
       • [Term] Nat : Type @ ⟨7, 20⟩-⟨7, 23⟩ @ Lean.Elab.Term.elabIdent
-        • [Completion-Id] Nat : some Sort.{?_uniq} @ ⟨7, 20⟩-⟨7, 23⟩
+        • [Completion-Id] Nat : some Sort.{?_uniq.817} @ ⟨7, 20⟩-⟨7, 23⟩
         • [Term] Nat : Type @ ⟨7, 20⟩-⟨7, 23⟩
       • [Term] m (isBinder := true) : Nat @ ⟨7, 14⟩-⟨7, 15⟩
       • [Term] Nat : Type @ ⟨7, 20⟩-⟨7, 23⟩ @ Lean.Elab.Term.elabIdent
-        • [Completion-Id] Nat : some Sort.{?_uniq} @ ⟨7, 20⟩-⟨7, 23⟩
+        • [Completion-Id] Nat : some Sort.{?_uniq.819} @ ⟨7, 20⟩-⟨7, 23⟩
         • [Term] Nat : Type @ ⟨7, 20⟩-⟨7, 23⟩
       • [Term] l (isBinder := true) : Nat @ ⟨7, 16⟩-⟨7, 17⟩
       • [Term] ↑n + (↑m + ↑l) : Int @ ⟨7, 28⟩-⟨7, 48⟩ @ Lean.Elab.Term.elabTypeAscription
         • [Term] Int : Type @ ⟨7, 44⟩-⟨7, 47⟩ @ Lean.Elab.Term.elabIdent
-          • [Completion-Id] Int : some Sort.{?_uniq} @ ⟨7, 44⟩-⟨7, 47⟩
+          • [Completion-Id] Int : some Sort.{?_uniq.821} @ ⟨7, 44⟩-⟨7, 47⟩
           • [Term] Int : Type @ ⟨7, 44⟩-⟨7, 47⟩
         • [Term] ↑n + (↑m + ↑l) : Int @ ⟨7, 29⟩-⟨7, 41⟩ @ «_aux_Init_Notation___macroRules_term_+__2»
           • [MacroExpansion]
@@ -63,7 +63,7 @@ fun n m l => ↑n + (↑m + ↑l) : Nat → Nat → Nat → Int
                 • [Term] n : Nat @ ⟨7, 29⟩-⟨7, 30⟩ @ Lean.Elab.Term.elabIdent
                   • [Completion-Id] n : none @ ⟨7, 29⟩-⟨7, 30⟩
                   • [Term] n : Nat @ ⟨7, 29⟩-⟨7, 30⟩
-                • [Term] ↑m + ↑l : Int @ ⟨7, 34⟩-⟨7, 40⟩ @ «_aux_lean_binopInfoTree___macroRules_term_+'__1»
+                • [Term] ↑m + ↑l : Int @ ⟨7, 34⟩-⟨7, 40⟩ @ «_aux_binopInfoTree___macroRules_term_+'__1»
                   • [MacroExpansion]
                     m +' l
                     ===>
@@ -81,5 +81,5 @@ fun n m l => ↑n + (↑m + ↑l) : Nat → Nat → Nat → Int
                           • [Term] l : Nat @ ⟨7, 39⟩-⟨7, 40⟩ @ Lean.Elab.Term.elabIdent
                             • [Completion-Id] l : none @ ⟨7, 39⟩-⟨7, 40⟩
                             • [Term] l : Nat @ ⟨7, 39⟩-⟨7, 40⟩
-[Elab.info]
+[Elab.info] 
   • [Command] @ ⟨8, 0⟩-⟨8, 0⟩ @ Lean.Elab.Command.elabEoi