data.buffer.basic | Mathlib porting status

Changes since the initial port

The following section lists changes to this file in mathlib3 and mathlib4 that occured after the initial port. Most recent changes are shown first. Hovering over a commit will show all commits associated with the same mathlib3 commit.

Changes in mathlib3

f0c8bf92

(last sync)

chore(*): removed unneeded imports (#18926)

This is another run of https://github.com/leanprover-community/mathlib/pull/17568, scrubbing unnecessary imports.

Like last time we only remove genuinely unneeded imports, and leave merely transitively redundant imports alone.

(I still disagree with the objectors to removing transitively redundant imports

Co-authored-by: Scott Morrison <scott.morrison@gmail.com> Co-authored-by: Eric Wieser <wieser.eric@gmail.com>

Diff

@@ -7,6 +7,7 @@ General utility functions for buffers.
 -/
 import data.array.lemmas
 import control.traversable.instances
+import control.traversable.equiv
 
 namespace buffer

70fd9563

refactor(*): scrub imports (#17568)

For each file, we read each declaration and find the files containing each referenced declaration. This is the "needed" set. We then replace the imports with

imports which are needed
other needed files which would not otherwise be transitively imported

Thus we don't remove any imports merely because they are transitively redundant. Instead we remove imports only if they are genuinely unnecessary. We also have to add back in imports (because they have been removed from higher up the import hierarchy).

I've committed the Lean script (thanks Mario!) that generates the underlying data, but not the Mathematica notebook that does that import calculations and text replacement (because it's a mess, and I want this merged quickly before it rots).

We try not to reorder imports unnecessarily.
But we don't sort: anything new that needs to be added just comes after the existing imports.
This drops a few comments on import lines.
It replaces a few import X with import X.default. (I think this is not bad: we probably want to remove all the .default files anyway at some point.)

Co-authored-by: Scott Morrison <scott.morrison@gmail.com>

Diff

@@ -5,7 +5,6 @@ Authors: Simon Hudon
 
 General utility functions for buffers.
 -/
-import data.buffer
 import data.array.lemmas
 import control.traversable.instances

acbe099c

feat(*): bump to lean 3.48.0 (#16292)

fin n is a structure now.

Diff

@@ -189,7 +189,7 @@ lemma nth_le_to_list (b : buffer α) {i : ℕ} (h) :
 nth_le_to_list' _ _ _
 
 lemma read_eq_nth_le_to_list (b : buffer α) (i) :
-  b.read i = b.to_list.nth_le i (by simpa using i.is_lt) :=
+  b.read i = b.to_list.nth_le i (by simp) :=
 by simp [nth_le_to_list]
 
 lemma read_singleton (c : α) : [c].to_buffer.read ⟨0, by simp⟩ = c :=

2220b0cb

(first ported)

Changes in mathlib3port

mathlib3

mathlib3port

f0c8bf92

bump to nightly-2024-03-17-08

mathlib commit https://github.com/leanprover-community/mathlib/commit/65a1391a0106c9204fe45bc73a039f056558cb83

22f01ce4

Diff

@@ -23,7 +23,7 @@ instance : Inhabited (Buffer α) :=
 @[ext]
 theorem ext : ∀ {b₁ b₂ : Buffer α}, toList b₁ = toList b₂ → b₁ = b₂
   | ⟨n₁, a₁⟩, ⟨n₂, a₂⟩, h => by
-    simp [to_list, to_array] at h 
+    simp [to_list, to_array] at h
     have e : n₁ = n₂ := by rw [← Array'.toList_length a₁, ← Array'.toList_length a₂, h]
     subst e
     have h : HEq a₁ a₂.to_list.to_array := h ▸ a₁.to_list_to_array.symm
@@ -175,7 +175,7 @@ theorem read_appendList_right (b : Buffer α) (l : List α) {i : ℕ} (h : i < l
   · convert_to ((b.push_back hd).appendList tl).read _ = _
     cases i
     · convert read_append_list_left _ _ _ <;> simp
-    · rw [List.length, Nat.succ_lt_succ_iff] at h 
+    · rw [List.length, Nat.succ_lt_succ_iff] at h
       have : b.size + i.succ = (b.push_back hd).size + i := by
         simp [add_comm, add_left_comm, Nat.succ_eq_add_one]
       convert hl (b.push_back hd) h using 1

f0c8bf92

bump to nightly-2023-09-24-06

mathlib commit https://github.com/leanprover-community/mathlib/commit/ce64cd319bb6b3e82f31c2d38e79080d377be451

5655435f

Diff

@@ -5,9 +5,9 @@ Authors: Simon Hudon
 
 General utility functions for buffers.
 -/
-import Mathbin.Data.Array.Lemmas
-import Mathbin.Control.Traversable.Instances
-import Mathbin.Control.Traversable.Equiv
+import Data.Array.Lemmas
+import Control.Traversable.Instances
+import Control.Traversable.Equiv
 
 #align_import data.buffer.basic from "leanprover-community/mathlib"@"f0c8bf9245297a541f468be517f1bde6195105e9"

f0c8bf92

bump to nightly-2023-07-20-09

mathlib commit https://github.com/leanprover-community/mathlib/commit/8ea5598db6caeddde6cb734aa179cc2408dbd345

9c56d0dd

Diff

@@ -4,16 +4,13 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Simon Hudon
 
 General utility functions for buffers.
-
-! This file was ported from Lean 3 source module data.buffer.basic
-! leanprover-community/mathlib commit f0c8bf9245297a541f468be517f1bde6195105e9
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
 -/
 import Mathbin.Data.Array.Lemmas
 import Mathbin.Control.Traversable.Instances
 import Mathbin.Control.Traversable.Equiv
 
+#align_import data.buffer.basic from "leanprover-community/mathlib"@"f0c8bf9245297a541f468be517f1bde6195105e9"
+
 namespace Buffer
 
 open Function

f0c8bf92

bump to nightly-2023-07-06-21

mathlib commit https://github.com/leanprover-community/mathlib/commit/5dc6092d09e5e489106865241986f7f2ad28d4c8

8b3166c8

Diff

@@ -237,7 +237,7 @@ def listEquivBuffer (α : Type _) : List α ≃ Buffer α := by
 instance : Traversable Buffer :=
   Equiv.traversable listEquivBuffer
 
-instance : IsLawfulTraversable Buffer :=
+instance : LawfulTraversable Buffer :=
   Equiv.isLawfulTraversable listEquivBuffer
 
 /-- A convenience wrapper around `read` that just fails if the index is out of bounds.

f0c8bf92

bump to nightly-2023-06-04-18

mathlib commit https://github.com/leanprover-community/mathlib/commit/5f25c089cb34db4db112556f23c50d12da81b297

3fb4268b

Diff

@@ -175,7 +175,7 @@ theorem read_appendList_right (b : Buffer α) (l : List α) {i : ℕ} (h : i < l
   by
   induction' l with hd tl hl generalizing b i
   · exact absurd i.zero_le (not_le_of_lt h)
-  · convert_to((b.push_back hd).appendList tl).read _ = _
+  · convert_to ((b.push_back hd).appendList tl).read _ = _
     cases i
     · convert read_append_list_left _ _ _ <;> simp
     · rw [List.length, Nat.succ_lt_succ_iff] at h 
@@ -191,7 +191,7 @@ theorem read_to_buffer' (l : List α) {i : ℕ} (h : i < l.toBuffer.size) (h' :
   cases' l with hd tl
   · simpa using h'
   · have hi : i < ([hd].toBuffer.appendList tl).size := by simpa [add_comm] using h
-    convert_to([hd].toBuffer.appendList tl).read ⟨i, hi⟩ = _
+    convert_to ([hd].toBuffer.appendList tl).read ⟨i, hi⟩ = _
     cases i
     · convert read_append_list_left _ _ _
       simp

f0c8bf92

bump to nightly-2023-06-01-16

mathlib commit https://github.com/leanprover-community/mathlib/commit/cca40788df1b8755d5baf17ab2f27dacc2e17acb

b9c87c70

Diff

@@ -26,7 +26,7 @@ instance : Inhabited (Buffer α) :=
 @[ext]
 theorem ext : ∀ {b₁ b₂ : Buffer α}, toList b₁ = toList b₂ → b₁ = b₂
   | ⟨n₁, a₁⟩, ⟨n₂, a₂⟩, h => by
-    simp [to_list, to_array] at h
+    simp [to_list, to_array] at h 
     have e : n₁ = n₂ := by rw [← Array'.toList_length a₁, ← Array'.toList_length a₂, h]
     subst e
     have h : HEq a₁ a₂.to_list.to_array := h ▸ a₁.to_list_to_array.symm
@@ -68,8 +68,8 @@ theorem toList_appendList {b : Buffer α} : toList (appendList b xs) = toList b
 
 @[simp]
 theorem appendList_mkBuffer : appendList mkBuffer xs = Array'.toBuffer (List.toArray xs) := by
-  ext x : 1 <;> simp [Array'.toBuffer, to_list, to_list_append_list] <;> induction xs <;>
-        [rfl;skip] <;>
+  ext x : 1 <;> simp [Array'.toBuffer, to_list, to_list_append_list] <;> induction xs <;> [rfl;
+        skip] <;>
       simp [to_array] <;>
     rfl
 #align buffer.append_list_mk_buffer Buffer.appendList_mkBuffer
@@ -178,7 +178,7 @@ theorem read_appendList_right (b : Buffer α) (l : List α) {i : ℕ} (h : i < l
   · convert_to((b.push_back hd).appendList tl).read _ = _
     cases i
     · convert read_append_list_left _ _ _ <;> simp
-    · rw [List.length, Nat.succ_lt_succ_iff] at h
+    · rw [List.length, Nat.succ_lt_succ_iff] at h 
       have : b.size + i.succ = (b.push_back hd).size + i := by
         simp [add_comm, add_left_comm, Nat.succ_eq_add_one]
       convert hl (b.push_back hd) h using 1
@@ -230,7 +230,7 @@ theorem read_singleton (c : α) : [c].toBuffer.read ⟨0, by simp⟩ = c := by s
 def listEquivBuffer (α : Type _) : List α ≃ Buffer α := by
   refine'
       { toFun := List.toBuffer
-        invFun := Buffer.toList.. } <;>
+        invFun := Buffer.toList .. } <;>
     simp [left_inverse, Function.RightInverse]
 #align buffer.list_equiv_buffer Buffer.listEquivBuffer

f0c8bf92

bump to nightly-2023-06-01-04

mathlib commit https://github.com/leanprover-community/mathlib/commit/cca40788df1b8755d5baf17ab2f27dacc2e17acb

4d9eaa85

Diff

@@ -67,7 +67,7 @@ theorem toList_appendList {b : Buffer α} : toList (appendList b xs) = toList b
 #align buffer.to_list_append_list Buffer.toList_appendList
 
 @[simp]
-theorem appendList_mkBuffer : appendList mkBuffer xs = Array'.toBuffer ([anonymous] xs) := by
+theorem appendList_mkBuffer : appendList mkBuffer xs = Array'.toBuffer (List.toArray xs) := by
   ext x : 1 <;> simp [Array'.toBuffer, to_list, to_list_append_list] <;> induction xs <;>
         [rfl;skip] <;>
       simp [to_array] <;>
@@ -81,7 +81,7 @@ theorem toBuffer_toList (b : Buffer α) : b.toList.toBuffer = b :=
   rw [to_list, to_array, List.toBuffer, append_list_mk_buffer]
   congr
   · simpa
-  · apply Array'.toList_to_array'
+  · apply Array'.toList_toArray
 #align buffer.to_buffer_to_list Buffer.toBuffer_toList
 
 @[simp]
@@ -94,7 +94,7 @@ theorem toList_toBuffer (l : List α) : l.toBuffer.toList = l :=
 #align buffer.to_list_to_buffer Buffer.toList_toBuffer
 
 @[simp]
-theorem toList_toArray (b : Buffer α) : b.to_array.toList = b.toList := by cases b; simp [to_list]
+theorem toList_toArray (b : Buffer α) : b.toArray.toList = b.toList := by cases b; simp [to_list]
 #align buffer.to_list_to_array Buffer.toList_toArray
 
 @[simp]

f0c8bf92

bump to nightly-2023-05-28-04

mathlib commit https://github.com/leanprover-community/mathlib/commit/917c3c072e487b3cccdbfeff17e75b40e45f66cb

6797a637

Diff

@@ -94,10 +94,7 @@ theorem toList_toBuffer (l : List α) : l.toBuffer.toList = l :=
 #align buffer.to_list_to_buffer Buffer.toList_toBuffer
 
 @[simp]
-theorem toList_toArray (b : Buffer α) : b.to_array.toList = b.toList :=
-  by
-  cases b
-  simp [to_list]
+theorem toList_toArray (b : Buffer α) : b.to_array.toList = b.toList := by cases b; simp [to_list]
 #align buffer.to_list_to_array Buffer.toList_toArray
 
 @[simp]
@@ -114,9 +111,7 @@ theorem toBuffer_cons (c : α) (l : List α) : (c :: l).toBuffer = [c].toBuffer.
 #align buffer.to_buffer_cons Buffer.toBuffer_cons
 
 @[simp]
-theorem size_pushBack (b : Buffer α) (a : α) : (b.pushBack a).size = b.size + 1 :=
-  by
-  cases b
+theorem size_pushBack (b : Buffer α) (a : α) : (b.pushBack a).size = b.size + 1 := by cases b;
   simp [size, push_back]
 #align buffer.size_push_back Buffer.size_pushBack
 
@@ -148,22 +143,13 @@ theorem size_singleton (a : α) : [a].toBuffer.size = 1 :=
 #align buffer.size_singleton Buffer.size_singleton
 
 theorem read_pushBack_left (b : Buffer α) (a : α) {i : ℕ} (h : i < b.size) :
-    (b.pushBack a).read
-        ⟨i, by
-          convert Nat.lt_succ_of_lt h
-          simp⟩ =
-      b.read ⟨i, h⟩ :=
-  by
-  cases b
-  convert Array'.read_pushBack_left _
-  simp
+    (b.pushBack a).read ⟨i, by convert Nat.lt_succ_of_lt h; simp⟩ = b.read ⟨i, h⟩ := by cases b;
+  convert Array'.read_pushBack_left _; simp
 #align buffer.read_push_back_left Buffer.read_pushBack_left
 
 @[simp]
-theorem read_pushBack_right (b : Buffer α) (a : α) : (b.pushBack a).read ⟨b.size, by simp⟩ = a :=
-  by
-  cases b
-  convert Array'.read_pushBack_right
+theorem read_pushBack_right (b : Buffer α) (a : α) : (b.pushBack a).read ⟨b.size, by simp⟩ = a := by
+  cases b; convert Array'.read_pushBack_right
 #align buffer.read_push_back_right Buffer.read_pushBack_right
 
 theorem read_appendList_left' (b : Buffer α) (l : List α) {i : ℕ} (h : i < (b.appendList l).size)
@@ -172,10 +158,7 @@ theorem read_appendList_left' (b : Buffer α) (l : List α) {i : ℕ} (h : i < (
   induction' l with hd tl hl generalizing b
   · rfl
   · have hb : i < ((b.push_back hd).appendList tl).size := by convert h using 1
-    have hb' : i < (b.push_back hd).size :=
-      by
-      convert Nat.lt_succ_of_lt h'
-      simp
+    have hb' : i < (b.push_back hd).size := by convert Nat.lt_succ_of_lt h'; simp
     have : (append_list b (hd :: tl)).read ⟨i, h⟩ = read ((push_back b hd).appendList tl) ⟨i, hb⟩ :=
       rfl
     simp [this, hl _ hb hb', read_push_back_left _ _ h']
@@ -219,15 +202,8 @@ theorem read_to_buffer' (l : List α) {i : ℕ} (h : i < l.toBuffer.size) (h' :
 
 @[simp]
 theorem read_toBuffer (l : List α) (i) :
-    l.toBuffer.read i =
-      l.nthLe i
-        (by
-          convert i.property
-          simp) :=
-  by
-  convert read_to_buffer' _ _ _
-  · simp
-  · simpa using i.property
+    l.toBuffer.read i = l.nthLe i (by convert i.property; simp) := by convert read_to_buffer' _ _ _;
+  · simp; · simpa using i.property
 #align buffer.read_to_buffer Buffer.read_toBuffer
 
 theorem nthLe_to_list' (b : Buffer α) {i : ℕ} (h h') : b.toList.nthLe i h = b.read ⟨i, h'⟩ :=

f0c8bf92

bump to nightly-2023-05-24-06

mathlib commit https://github.com/leanprover-community/mathlib/commit/8d33f09cd7089ecf074b4791907588245aec5d1b

fbc7b476

Diff

@@ -68,8 +68,8 @@ theorem toList_appendList {b : Buffer α} : toList (appendList b xs) = toList b
 
 @[simp]
 theorem appendList_mkBuffer : appendList mkBuffer xs = Array'.toBuffer ([anonymous] xs) := by
-  ext x : 1 <;> simp [Array'.toBuffer, to_list, to_list_append_list] <;> induction xs <;> [rfl,
-        skip] <;>
+  ext x : 1 <;> simp [Array'.toBuffer, to_list, to_list_append_list] <;> induction xs <;>
+        [rfl;skip] <;>
       simp [to_array] <;>
     rfl
 #align buffer.append_list_mk_buffer Buffer.appendList_mkBuffer

f0c8bf92

bump to nightly-2023-05-05-03

mathlib commit https://github.com/leanprover-community/mathlib/commit/738054fa93d43512da144ec45ce799d18fd44248

c17f6f14

Diff

@@ -6,12 +6,13 @@ Authors: Simon Hudon
 General utility functions for buffers.
 
 ! This file was ported from Lean 3 source module data.buffer.basic
-! leanprover-community/mathlib commit 70fd9563a21e7b963887c9360bd29b2393e6225a
+! leanprover-community/mathlib commit f0c8bf9245297a541f468be517f1bde6195105e9
 ! Please do not edit these lines, except to modify the commit id
 ! if you have ported upstream changes.
 -/
 import Mathbin.Data.Array.Lemmas
 import Mathbin.Control.Traversable.Instances
+import Mathbin.Control.Traversable.Equiv
 
 namespace Buffer

70fd9563

bump to nightly-2023-04-10-20

mathlib commit https://github.com/leanprover-community/mathlib/commit/e05ead7993520a432bec94ac504842d90707ad63

af46b02d

Diff

@@ -66,7 +66,7 @@ theorem toList_appendList {b : Buffer α} : toList (appendList b xs) = toList b
 #align buffer.to_list_append_list Buffer.toList_appendList
 
 @[simp]
-theorem appendList_mkBuffer : appendList mkBuffer xs = Array'.toBuffer (List.toArray xs) := by
+theorem appendList_mkBuffer : appendList mkBuffer xs = Array'.toBuffer ([anonymous] xs) := by
   ext x : 1 <;> simp [Array'.toBuffer, to_list, to_list_append_list] <;> induction xs <;> [rfl,
         skip] <;>
       simp [to_array] <;>
@@ -80,7 +80,7 @@ theorem toBuffer_toList (b : Buffer α) : b.toList.toBuffer = b :=
   rw [to_list, to_array, List.toBuffer, append_list_mk_buffer]
   congr
   · simpa
-  · apply Array'.toList_toArray
+  · apply Array'.toList_to_array'
 #align buffer.to_buffer_to_list Buffer.toBuffer_toList
 
 @[simp]
@@ -93,7 +93,7 @@ theorem toList_toBuffer (l : List α) : l.toBuffer.toList = l :=
 #align buffer.to_list_to_buffer Buffer.toList_toBuffer
 
 @[simp]
-theorem toList_toArray (b : Buffer α) : b.toArray.toList = b.toList :=
+theorem toList_toArray (b : Buffer α) : b.to_array.toList = b.toList :=
   by
   cases b
   simp [to_list]

70fd9563

bump to nightly-2023-03-17-00

mathlib commit https://github.com/leanprover-community/mathlib/commit/ce7e9d53d4bbc38065db3b595cd5bd73c323bc1d

c85864d4

Diff

@@ -191,7 +191,7 @@ theorem read_appendList_right (b : Buffer α) (l : List α) {i : ℕ} (h : i < l
   by
   induction' l with hd tl hl generalizing b i
   · exact absurd i.zero_le (not_le_of_lt h)
-  · convert_to ((b.push_back hd).appendList tl).read _ = _
+  · convert_to((b.push_back hd).appendList tl).read _ = _
     cases i
     · convert read_append_list_left _ _ _ <;> simp
     · rw [List.length, Nat.succ_lt_succ_iff] at h
@@ -207,7 +207,7 @@ theorem read_to_buffer' (l : List α) {i : ℕ} (h : i < l.toBuffer.size) (h' :
   cases' l with hd tl
   · simpa using h'
   · have hi : i < ([hd].toBuffer.appendList tl).size := by simpa [add_comm] using h
-    convert_to ([hd].toBuffer.appendList tl).read ⟨i, hi⟩ = _
+    convert_to([hd].toBuffer.appendList tl).read ⟨i, hi⟩ = _
     cases i
     · convert read_append_list_left _ _ _
       simp

70fd9563

bump to nightly-2023-03-01-20

mathlib commit https://github.com/leanprover-community/mathlib/commit/4c586d291f189eecb9d00581aeb3dd998ac34442

20cadee0

Diff

@@ -55,7 +55,7 @@ theorem toList_nil : toList (@nil α) = [] :=
   rfl
 #align buffer.to_list_nil Buffer.toList_nil
 
-/- ./././Mathport/Syntax/Translate/Tactic/Builtin.lean:72:18: unsupported non-interactive tactic tactic.mk_dec_eq_instance -/
+/- ./././Mathport/Syntax/Translate/Tactic/Builtin.lean:69:18: unsupported non-interactive tactic tactic.mk_dec_eq_instance -/
 instance (α) [DecidableEq α] : DecidableEq (Buffer α) := by
   run_tac
     tactic.mk_dec_eq_instance

70fd9563

bump to nightly-2023-02-21-16

mathlib commit https://github.com/leanprover-community/mathlib/commit/bd9851ca476957ea4549eb19b40e7b5ade9428cc

1107b979

Changes in mathlib4

mathlib3

mathlib4

f0c8bf92

chore: script to replace headers with #align_import statements (#5979)

depends on: #5966

Co-authored-by: Eric Wieser <wieser.eric@gmail.com> Co-authored-by: Scott Morrison <scott.morrison@gmail.com>

89aa3a3b

Diff

@@ -3,11 +3,6 @@ Copyright (c) 2020 Yakov Pechersky. All rights reserved.
 Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yakov Pechersky
 
-! This file was ported from Lean 3 source module data.buffer.basic
-! leanprover-community/mathlib commit f0c8bf9245297a541f468be517f1bde6195105e9
-! Please do not edit these lines, except to modify the commit id
-! if you have ported upstream changes.
-
 Porting note:
 As the parsing framework has completely changed in Lean 4
 there is no point porting these files directly.
@@ -16,6 +11,8 @@ They can be rewritten from scratch as needed, just as for tactics.
 
 import Mathlib.Init.Align
 
+#align_import data.buffer.basic from "leanprover-community/mathlib"@"f0c8bf9245297a541f468be517f1bde6195105e9"
+
 /-! # Empty placeholder for Mathlib3's `buffer` -/
 
 #noalign buffer.ext

f0c8bf92

chore: fix SHA in Data.Buffer.Basic (#5894)

Also adds noaligns

e06c1bd2

Diff

@@ -4,7 +4,7 @@ Released under Apache 2.0 license as described in the file LICENSE.
 Authors: Yakov Pechersky
 
 ! This file was ported from Lean 3 source module data.buffer.basic
-! leanprover-community/mathlib commit 2220b0cbab795e73674b8191170b0cc68c6b54a8
+! leanprover-community/mathlib commit f0c8bf9245297a541f468be517f1bde6195105e9
 ! Please do not edit these lines, except to modify the commit id
 ! if you have ported upstream changes.
 
@@ -13,3 +13,38 @@ As the parsing framework has completely changed in Lean 4
 there is no point porting these files directly.
 They can be rewritten from scratch as needed, just as for tactics.
 -/
+
+import Mathlib.Init.Align
+
+/-! # Empty placeholder for Mathlib3's `buffer` -/
+
+#noalign buffer.ext
+#noalign buffer.ext_iff
+#noalign buffer.size_eq_zero_iff
+#noalign buffer.size_nil
+#noalign buffer.to_list_nil
+#noalign buffer.to_list_append_list
+#noalign buffer.append_list_mk_buffer
+#noalign buffer.to_buffer_to_list
+#noalign buffer.to_list_to_buffer
+#noalign buffer.to_list_to_array
+#noalign buffer.append_list_nil
+#noalign buffer.to_buffer_cons
+#noalign buffer.size_push_back
+#noalign buffer.size_append_list
+#noalign buffer.size_to_buffer
+#noalign buffer.length_to_list
+#noalign buffer.size_singleton
+#noalign buffer.read_push_back_left
+#noalign buffer.read_push_back_right
+#noalign buffer.read_append_list_left'
+#noalign buffer.read_append_list_left
+#noalign buffer.read_append_list_right
+#noalign buffer.read_to_buffer'
+#noalign buffer.read_to_buffer
+#noalign buffer.nth_le_to_list'
+#noalign buffer.nth_le_to_list
+#noalign buffer.read_eq_nth_le_to_list
+#noalign buffer.read_singleton
+#noalign buffer.list_equiv_buffer
+#noalign buffer.read_t

2220b0cb

chore: empty ports of the Data/Buffer/Parser files (#5848)

Co-authored-by: Scott Morrison <scott.morrison@gmail.com>

b41e763b

`data.buffer.basic` ⟷ `Mathlib.Data.Buffer.Basic`

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 1 + 118

data.buffer.basic ⟷ Mathlib.Data.Buffer.Basic

Changes since the initial port

Changes in mathlib3

Changes in mathlib3port

Changes in mathlib4

Dependencies 1 + 118

`data.buffer.basic` ⟷ `Mathlib.Data.Buffer.Basic`