1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
// Copyright 2018-2022 the Deno authors. All rights reserved. MIT license.// Copyright Joyent and Node contributors. All rights reserved. MIT license.// deno-lint-ignore-file
import { Buffer } from "../../buffer.ts";import { inspect } from "../util/inspect.mjs";
class BufferList {  constructor() {    this.head = null;    this.tail = null;    this.length = 0;  }
  push(v) {    const entry = { data: v, next: null };    if (this.length > 0) {      this.tail.next = entry;    } else {      this.head = entry;    }    this.tail = entry;    ++this.length;  }
  unshift(v) {    const entry = { data: v, next: this.head };    if (this.length === 0) {      this.tail = entry;    }    this.head = entry;    ++this.length;  }
  shift() {    if (this.length === 0) {      return;    }    const ret = this.head.data;    if (this.length === 1) {      this.head = this.tail = null;    } else {      this.head = this.head.next;    }    --this.length;    return ret;  }
  clear() {    this.head = this.tail = null;    this.length = 0;  }
  join(s) {    if (this.length === 0) {      return "";    }    let p = this.head;    let ret = "" + p.data;    while (p = p.next) {      ret += s + p.data;    }    return ret;  }
  concat(n) {    if (this.length === 0) {      return Buffer.alloc(0);    }    const ret = Buffer.allocUnsafe(n >>> 0);    let p = this.head;    let i = 0;    while (p) {      ret.set(p.data, i);      i += p.data.length;      p = p.next;    }    return ret;  }
  // Consumes a specified amount of bytes or characters from the buffered data.  consume(n, hasStrings) {    const data = this.head.data;    if (n < data.length) {      // `slice` is the same for buffers and strings.      const slice = data.slice(0, n);      this.head.data = data.slice(n);      return slice;    }    if (n === data.length) {      // First chunk is a perfect match.      return this.shift();    }    // Result spans more than one buffer.    return hasStrings ? this._getString(n) : this._getBuffer(n);  }
  first() {    return this.head.data;  }
  *[Symbol.iterator]() {    for (let p = this.head; p; p = p.next) {      yield p.data;    }  }
  // Consumes a specified amount of characters from the buffered data.  _getString(n) {    let ret = "";    let p = this.head;    let c = 0;    do {      const str = p.data;      if (n > str.length) {        ret += str;        n -= str.length;      } else {        if (n === str.length) {          ret += str;          ++c;          if (p.next) {            this.head = p.next;          } else {            this.head = this.tail = null;          }        } else {          ret += str.slice(0, n);          this.head = p;          p.data = str.slice(n);        }        break;      }      ++c;    } while (p = p.next);    this.length -= c;    return ret;  }
  // Consumes a specified amount of bytes from the buffered data.  _getBuffer(n) {    const ret = Buffer.allocUnsafe(n);    const retLen = n;    let p = this.head;    let c = 0;    do {      const buf = p.data;      if (n > buf.length) {        ret.set(buf, retLen - n);        n -= buf.length;      } else {        if (n === buf.length) {          ret.set(buf, retLen - n);          ++c;          if (p.next) {            this.head = p.next;          } else {            this.head = this.tail = null;          }        } else {          ret.set(            new Uint8Array(buf.buffer, buf.byteOffset, n),            retLen - n,          );          this.head = p;          p.data = buf.slice(n);        }        break;      }      ++c;    } while (p = p.next);    this.length -= c;    return ret;  }
  // Make sure the linked list only shows the minimal necessary information.  [inspect.custom](_, options) {    return inspect(this, {      ...options,      // Only inspect one level.      depth: 0,      // It should not recurse.      customInspect: false,    });  }}
export default BufferList;