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
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306 |
 
 
 
x13
x13
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
x13
x13
x26
x26
x26
x13
 
 
 
 
 
 
 
x13
x13
x13
x13
x26
x26
x26
x26
x26
x26
x26
 
x26
x26
x26
x26
 
x13
x13
x13
 
x58
x58
x58
x58
x58
x58
x58
x58
x58
x58
x524
 
x673
x673
x673
 
x710
x710
x710
x710
x710
x710
 
 
x712
x712
x710
 
x755
 
 
x755
x755
x755
x745
 
 
x774
 
x777
x774
x775
x775
 
x774
x774
 
 
 
 
x775
x774
x777
x777
x770
 
x796
x796
x796
x796
x796
x797
x796
x800
x800
x800
x796
x796
 
x799
x799
x796
x798
x798
x791
 
x807
x3228
x807
x807
x807
x807
x807
 
 
 
 
 
x710
x524
 
x1157
x841
 
 
 
 
 
x842
x842
x524
 
x58
x58
x81
x58
 
 
x98
x98
x58
 
 
 
 
 
 
 
x13
x13
x13
 
x68
x68
x68
x68
x68
x68
x68
x471
 
x519
 
 
 
x519
x519
x519
x519
 
 
x522
x522
x519
 
x585
 
 
x585
x585
x585
x564
 
 
x594
 
x599
x594
x595
x595
 
x594
x594
 
 
 
 
x597
x597
x588
 
x606
x2424
x606
x606
x606
x606
x606
 
 
 
 
 
x471
x826
x826
x471
x68
x123
x98
 
 
x121
x121
x68
 
x13
x26
x26
x26
x28
x26
x46
x37
x39
x39
x26
x13 |
I
I
|
// Copyright 2018-2025 the Deno authors. MIT license.
// This module is browser compatible.
import { concat } from "@std/bytes/concat";
import { createLPS } from "./_common.ts";
/** Disposition of the delimiter for {@linkcode DelimiterStreamOptions}. */
export type DelimiterDisposition =
/** Include delimiter in the found chunk. */
| "suffix"
/** Include delimiter in the subsequent chunk. */
| "prefix"
/** Discard the delimiter. */
| "discard" // delimiter discarded
;
/** Options for {@linkcode DelimiterStream}. */
export interface DelimiterStreamOptions {
/**
* Disposition of the delimiter.
*
* @default {"discard"}
*/
disposition?: DelimiterDisposition;
}
/**
* Divide a stream into chunks delimited by a given byte sequence.
*
* If you are working with a stream of `string`, consider using {@linkcode TextDelimiterStream}.
*
* @example
* Divide a CSV stream by commas, discarding the commas:
* ```ts
* import { DelimiterStream } from "@std/streams/delimiter-stream";
* import { assertEquals } from "@std/assert";
*
* const inputStream = ReadableStream.from(["foo,bar", ",baz"]);
*
* const transformed = inputStream.pipeThrough(new TextEncoderStream())
* .pipeThrough(new DelimiterStream(new TextEncoder().encode(",")))
* .pipeThrough(new TextDecoderStream());
*
* assertEquals(await Array.fromAsync(transformed), ["foo", "bar", "baz"]);
* ```
*
* @example
* Divide a stream after semi-colons, keeping the semicolons in the output:
* ```ts
* import { DelimiterStream } from "@std/streams/delimiter-stream";
* import { assertEquals } from "@std/assert";
*
* const inputStream = ReadableStream.from(["foo;", "bar;baz", ";"]);
*
* const transformed = inputStream.pipeThrough(new TextEncoderStream())
* .pipeThrough(
* new DelimiterStream(new TextEncoder().encode(";"), {
* disposition: "suffix",
* }),
* ).pipeThrough(new TextDecoderStream());
*
* assertEquals(await Array.fromAsync(transformed), ["foo;", "bar;", "baz;"]);
* ```
*/
export class DelimiterStream extends TransformStream<Uint8Array, Uint8Array> {
#bufs: Uint8Array[] = [];
#delimiter: Uint8Array;
#matchIndex = 0;
#delimLPS: Uint8Array | null;
#disp: DelimiterDisposition;
/**
* Constructs a new instance.
*
* @param delimiter A delimiter to split the stream by.
* @param options Options for the delimiter stream.
*/
constructor(
delimiter: Uint8Array,
options: DelimiterStreamOptions = {},
) {
super({
transform: (chunk, controller) =>
delimiter.length === 1
? this.#handleChar(chunk, controller)
: this.#handle(chunk, controller),
flush: (controller) => this.#flush(controller),
});
this.#delimiter = delimiter;
this.#delimLPS = delimiter.length > 1 ? createLPS(delimiter) : null;
this.#disp = options.disposition ?? "discard";
}
#handle(
chunk: Uint8Array,
controller: TransformStreamDefaultController<Uint8Array>,
) {
const bufs = this.#bufs;
const length = chunk.byteLength;
const disposition = this.#disp;
const delimiter = this.#delimiter;
const delimLen = delimiter.length;
const lps = this.#delimLPS as Uint8Array;
let chunkStart = 0;
let matchIndex = this.#matchIndex;
let inspectIndex = 0;
while (inspectIndex < length) {
if (chunk[inspectIndex] === delimiter[matchIndex]) {
// Next byte matched our next delimiter byte
inspectIndex++;
matchIndex++;
if (matchIndex === delimLen) {
// Full match
matchIndex = 0;
const delimiterStartIndex = inspectIndex - delimLen;
const delimitedChunkEnd = disposition === "suffix"
? inspectIndex
: delimiterStartIndex;
if (delimitedChunkEnd <= 0 && bufs.length === 0) {
// Our chunk started with a delimiter and no previous chunks exist:
// Enqueue an empty chunk.
controller.enqueue(new Uint8Array());
chunkStart = disposition === "prefix" ? 0 : inspectIndex;
} else if (delimitedChunkEnd > 0 && bufs.length === 0) {
// No previous chunks, slice from current chunk.
controller.enqueue(chunk.subarray(chunkStart, delimitedChunkEnd));
// Our chunk may have more than one delimiter; we must remember where
// the next delimited chunk begins.
chunkStart = disposition === "prefix"
? delimiterStartIndex
: inspectIndex;
} else if (delimitedChunkEnd === 0 && bufs.length > 0) {
// Our chunk started with a delimiter, previous chunks are passed as
// they are (with concatenation).
if (bufs.length === 1) {
// Concat not needed when a single buffer is passed.
controller.enqueue(bufs[0]!);
} else {
controller.enqueue(concat(bufs));
}
// Drop all previous chunks.
bufs.length = 0;
if (disposition !== "prefix") {
// suffix or discard: The next chunk starts where our inspection finished.
// We should only ever end up here with a discard disposition as
// for a suffix disposition this branch would mean that the previous
// chunk ended with a full match but was not enqueued.
chunkStart = inspectIndex;
} else {
chunkStart = 0;
}
} else if (delimitedChunkEnd < 0 && bufs.length > 0) {
// Our chunk started by finishing a partial delimiter match.
const lastIndex = bufs.length - 1;
const last = bufs[lastIndex]!;
const lastSliceIndex = last.byteLength + delimitedChunkEnd;
const lastSliced = last.subarray(0, lastSliceIndex);
if (lastIndex === 0) {
controller.enqueue(lastSliced);
} else {
bufs[lastIndex] = lastSliced;
controller.enqueue(concat(bufs));
}
bufs.length = 0;
if (disposition === "prefix") {
// Must keep last bytes of last chunk.
bufs.push(last.subarray(lastSliceIndex));
chunkStart = 0;
} else {
chunkStart = inspectIndex;
}
} else if (delimitedChunkEnd > 0 && bufs.length > 0) {
// Previous chunks and current chunk together form a delimited chunk.
const chunkSliced = chunk.subarray(chunkStart, delimitedChunkEnd);
const result = concat([...bufs, chunkSliced]);
bufs.length = 0;
controller.enqueue(result);
chunkStart = disposition === "prefix"
? delimitedChunkEnd
: inspectIndex;
} else {
throw new Error(
"This should be unreachable, please file a bug report against Deno at https://github.com/denoland/std/issues",
);
}
}
} else if (matchIndex === 0) {
// No match ongoing, keep going through the buffer.
inspectIndex++;
} else {
// Ongoing match: Degrade to the previous possible match.
// eg. If we're looking for 'AAB' and had matched 'AA' previously
// but now got a new 'A', then we'll drop down to having matched
// just 'A'. The while loop will turn around again and we'll rematch
// to 'AA' and proceed onwards to try and match on 'B' again.
matchIndex = lps[matchIndex - 1]!;
}
}
// Save match index.
this.#matchIndex = matchIndex;
if (chunkStart === 0) {
bufs.push(chunk);
} else if (chunkStart < length) {
// If we matched partially somewhere in the middle of our chunk
// then the remnants should be pushed into buffers.
bufs.push(chunk.subarray(chunkStart));
}
}
/**
* Optimized handler for a char delimited stream:
*
* For char delimited streams we do not need to keep track of
* the match index, removing the need for a fair bit of work.
*/
#handleChar(
chunk: Uint8Array,
controller: TransformStreamDefaultController<Uint8Array>,
) {
const bufs = this.#bufs;
const length = chunk.byteLength;
const disposition = this.#disp;
const delimiter = this.#delimiter[0];
let chunkStart = 0;
let inspectIndex = 0;
while (inspectIndex < length) {
if (chunk[inspectIndex] === delimiter) {
// Next byte matched our next delimiter
inspectIndex++;
/**
* Always non-negative
*/
const delimitedChunkEnd = disposition === "suffix"
? inspectIndex
: inspectIndex - 1;
if (delimitedChunkEnd === 0 && bufs.length === 0) {
// Our chunk started with a delimiter and no previous chunks exist:
// Enqueue an empty chunk.
controller.enqueue(new Uint8Array());
chunkStart = disposition === "prefix" ? 0 : 1;
} else if (delimitedChunkEnd > 0 && bufs.length === 0) {
// No previous chunks, slice from current chunk.
controller.enqueue(chunk.subarray(chunkStart, delimitedChunkEnd));
// Our chunk may have more than one delimiter; we must remember where
// the next delimited chunk begins.
chunkStart = disposition === "prefix"
? inspectIndex - 1
: inspectIndex;
} else if (delimitedChunkEnd === 0 && bufs.length > 0) {
// Our chunk started with a delimiter, previous chunks are passed as
// they are (with concatenation).
if (bufs.length === 1) {
// Concat not needed when a single buffer is passed.
controller.enqueue(bufs[0]!);
} else {
controller.enqueue(concat(bufs));
}
// Drop all previous chunks.
bufs.length = 0;
if (disposition !== "prefix") {
// suffix or discard: The next chunk starts where our inspection finished.
// We should only ever end up here with a discard disposition as
// for a suffix disposition this branch would mean that the previous
// chunk ended with a full match but was not enqueued.
chunkStart = inspectIndex;
}
} else if (delimitedChunkEnd > 0 && bufs.length > 0) {
// Previous chunks and current chunk together form a delimited chunk.
const chunkSliced = chunk.subarray(chunkStart, delimitedChunkEnd);
const result = concat([...bufs, chunkSliced]);
bufs.length = 0;
chunkStart = disposition === "prefix"
? delimitedChunkEnd
: inspectIndex;
controller.enqueue(result);
} else {
throw new Error(
"This should be unreachable, please file a bug report against Deno at https://github.com/denoland/std/issues",
);
}
} else {
inspectIndex++;
}
}
if (chunkStart === 0) {
bufs.push(chunk);
} else if (chunkStart < length) {
// If we matched partially somewhere in the middle of our chunk
// then the remnants should be pushed into buffers.
bufs.push(chunk.subarray(chunkStart));
}
}
#flush(controller: TransformStreamDefaultController<Uint8Array>) {
const bufs = this.#bufs;
const length = bufs.length;
if (length === 0) {
controller.enqueue(new Uint8Array());
} else if (length === 1) {
controller.enqueue(bufs[0]!);
} else {
controller.enqueue(concat(bufs));
}
}
}
|