Carries 359 template commits, tag v0.2.0 plus one documentation commit: the generator-built feature index with its app, bounded-context and feature declarations, the src/platform kernel and scale tooling, the 2026-09-24 src review fixes, and the 2026-09-25 maturity review round with its CHANGELOG [보안]/[계약] rows. 691 of the 824 template paths are applied, 85 of them merged with product changes; 127 are not carried. Product identity is unchanged: name, version 0.1.0, routes, design and the TechLog domain. Three decisions worth naming. TechLog stays composed directly, as the last two syncs recorded; its directory carries a NOT_INSTALLED marker that says so, and every installed-* composer takes the template's projection with TechLog added on top. The reference sample is no longer installed: the template now installs a feature only through feature-module.ts and context-routes.ts, which load the screens this product deleted, so its three operations, six schemas and one topic leave the registries, recorded as registry change evidence. And AppRouter mounts the platform and TechLog routes only; the template's bounded-context route gateway waits for a generator-installed feature. Required fixes: readSubject on the BFF session owner (without it every HTTP Studio session would close as integration-failed), zod through the facade in nine TechLog files, noUnusedLocals, and public/config.json written out to match the local profile. Derived baselines were recomputed after reproducing both sides' values: CI contract 101 commands / 106 references / 141 artifacts, gate shape c9adcf85; registry approval 2dc6c3a3; the runtime config schema baseline equals the schema at8210d48. Verified here: types, lint, architecture, adapter inventory, CI contract, i18n, design system, diagnostics, browser security, dev release manifest, TechLog contract and build pass; 220 component, 155 integration, 15 contract, 418 TechLog, 43 reference-feature, 18 recipe and 46 release-coherence tests pass, and 2381 of 2383 unit tests. Reproduced at8210d48first and unchanged: check:registries (byte-identical), test:runtime-schema, verify:documentation. Brought by the template and escalated rather than suppressed: check:request-fanout on TechLog's cursor pagination, check:remediation-ledger (fails upstream too), the shared-chunk hash test, and the registry-dependent sample removal and second-feature tests. Playwright suites were not run. Full record, the five open questions and the follow-ups in docs/operations/template-sync-2026-09-29.md. (cherry picked from commit b2170cf265dea45dc9cc05d3c61e627e97f31cdb)
509 lines
15 KiB
TypeScript
509 lines
15 KiB
TypeScript
import { describe, expect, it } from "vitest";
|
||
|
||
import {
|
||
createIncrementalSseParser,
|
||
type SseParserItem,
|
||
} from "../../../src/adapters/realtime/sse/sse-parser.ts";
|
||
import { createIncrementalSseParser as createReferenceSseParser } from "./sse-parser-reference.ts";
|
||
|
||
const encoder = new TextEncoder();
|
||
|
||
function pushText(
|
||
parser: ReturnType<typeof createIncrementalSseParser>,
|
||
text: string,
|
||
): readonly SseParserItem[] {
|
||
const result = parser.push(encoder.encode(text));
|
||
if (!result.ok) throw new Error(result.error.kind);
|
||
return result.value;
|
||
}
|
||
|
||
describe("incremental SSE parser", () => {
|
||
it("handles BOM, chunk boundaries, CR/LF/CRLF, comments and multi-line data", () => {
|
||
const parser = createIncrementalSseParser();
|
||
const chunks = [
|
||
"\uFEFF: ready\r",
|
||
"\nretry: 2500\revent: resource.updated\n",
|
||
"id: cursor-1\r\ndata: first\rdata:second\n\n",
|
||
];
|
||
const items = chunks.flatMap((chunk) => pushText(parser, chunk));
|
||
|
||
expect(items).toEqual([
|
||
{ kind: "COMMENT" },
|
||
{ kind: "RETRY", retryMs: 2_500 },
|
||
{
|
||
kind: "EVENT",
|
||
eventType: "resource.updated",
|
||
data: "first\nsecond",
|
||
id: "cursor-1",
|
||
hasExplicitId: true,
|
||
},
|
||
]);
|
||
expect(parser.finish()).toEqual({
|
||
ok: true,
|
||
value: {
|
||
items: [],
|
||
incompleteEventDiscarded: false,
|
||
},
|
||
});
|
||
});
|
||
|
||
it("strips exactly one leading BOM", () => {
|
||
const parser = createIncrementalSseParser();
|
||
// The second BOM belongs to the field name, so the line is ignored.
|
||
expect(
|
||
pushText(parser, "\uFEFF\uFEFFdata: x\n\ndata: y\n\n"),
|
||
).toEqual([
|
||
{
|
||
kind: "EVENT",
|
||
eventType: "message",
|
||
data: "y",
|
||
id: null,
|
||
hasExplicitId: false,
|
||
},
|
||
]);
|
||
|
||
// Also when the first BOM is split across reads. Node's streaming
|
||
// TextDecoder (ignoreBOM: false) drops both BOMs then; the parser must not.
|
||
const split = createIncrementalSseParser();
|
||
const bytes = encoder.encode("data: x\n\n");
|
||
expect(split.push(bytes.subarray(0, 1))).toEqual({ ok: true, value: [] });
|
||
expect(split.push(bytes.subarray(1))).toEqual({ ok: true, value: [] });
|
||
});
|
||
|
||
it("preserves standard inherited ID state while marking direct IDs", () => {
|
||
const parser = createIncrementalSseParser();
|
||
const items = pushText(
|
||
parser,
|
||
"id: cursor-a\ndata: one\n\ndata: two\n\ndata:\n\n",
|
||
);
|
||
|
||
expect(items).toEqual([
|
||
{
|
||
kind: "EVENT",
|
||
eventType: "message",
|
||
data: "one",
|
||
id: "cursor-a",
|
||
hasExplicitId: true,
|
||
},
|
||
{
|
||
kind: "EVENT",
|
||
eventType: "message",
|
||
data: "two",
|
||
id: "cursor-a",
|
||
hasExplicitId: false,
|
||
},
|
||
{
|
||
kind: "EVENT",
|
||
eventType: "message",
|
||
data: "",
|
||
id: "cursor-a",
|
||
hasExplicitId: false,
|
||
},
|
||
]);
|
||
});
|
||
|
||
it("ignores invalid ID and retry fields without inventing a cursor", () => {
|
||
const parser = createIncrementalSseParser();
|
||
expect(
|
||
pushText(
|
||
parser,
|
||
"id: invalid\u0000cursor\nretry: 99999\ndata: value\n\n",
|
||
),
|
||
).toEqual([
|
||
{
|
||
kind: "EVENT",
|
||
eventType: "message",
|
||
data: "value",
|
||
id: null,
|
||
hasExplicitId: false,
|
||
},
|
||
]);
|
||
});
|
||
|
||
it("discards an event that was not terminated by a blank line", () => {
|
||
const parser = createIncrementalSseParser();
|
||
expect(pushText(parser, "data: incomplete\n")).toEqual([]);
|
||
expect(parser.finish()).toEqual({
|
||
ok: true,
|
||
value: {
|
||
items: [],
|
||
incompleteEventDiscarded: true,
|
||
},
|
||
});
|
||
expect(parser.push(encoder.encode("data: late\n\n"))).toEqual({
|
||
ok: false,
|
||
error: {
|
||
kind: "CLOSED",
|
||
operation: "DECODE",
|
||
retryable: false,
|
||
},
|
||
});
|
||
});
|
||
|
||
it("fails closed on malformed UTF-8 and parser ceilings", () => {
|
||
const malformed = createIncrementalSseParser();
|
||
expect(
|
||
malformed.push(new Uint8Array([0xc3, 0x28])),
|
||
).toEqual({
|
||
ok: false,
|
||
error: {
|
||
kind: "MALFORMED_EVENT",
|
||
operation: "DECODE",
|
||
retryable: false,
|
||
},
|
||
});
|
||
|
||
const longLine = createIncrementalSseParser({
|
||
maxLineBytes: 4,
|
||
maxEventBytes: 8,
|
||
maxIncompleteBufferBytes: 8,
|
||
maxRetryMs: 100,
|
||
});
|
||
expect(longLine.push(encoder.encode("data:"))).toEqual({
|
||
ok: false,
|
||
error: {
|
||
kind: "EVENT_TOO_LARGE",
|
||
operation: "DECODE",
|
||
retryable: false,
|
||
},
|
||
});
|
||
|
||
const largeEvent = createIncrementalSseParser({
|
||
maxLineBytes: 16,
|
||
maxEventBytes: 8,
|
||
maxIncompleteBufferBytes: 16,
|
||
maxRetryMs: 100,
|
||
});
|
||
expect(largeEvent.push(encoder.encode("data:abc\n"))).toEqual({
|
||
ok: false,
|
||
error: {
|
||
kind: "EVENT_TOO_LARGE",
|
||
operation: "DECODE",
|
||
retryable: false,
|
||
},
|
||
});
|
||
|
||
const oversizedChunk = createIncrementalSseParser({
|
||
maxChunkBytes: 65_536,
|
||
});
|
||
expect(
|
||
oversizedChunk.push(new Uint8Array(65_537)),
|
||
).toEqual({
|
||
ok: false,
|
||
error: {
|
||
kind: "EVENT_TOO_LARGE",
|
||
operation: "DECODE",
|
||
retryable: false,
|
||
},
|
||
});
|
||
});
|
||
|
||
it("hands items past the per-chunk cap to drain() instead of failing", () => {
|
||
const parser = createIncrementalSseParser({ maxItemsPerChunk: 1 });
|
||
const comment = { kind: "COMMENT" };
|
||
expect(pushText(parser, ":\r:\r\n:\ndata: a\r")).toEqual([comment]);
|
||
// The retained text resumes between CR and LF.
|
||
expect(parser.drain()).toEqual({ ok: true, value: [comment] });
|
||
expect(parser.drain()).toEqual({ ok: true, value: [comment] });
|
||
expect(parser.drain()).toEqual({ ok: true, value: [] });
|
||
expect(parser.drain()).toEqual({ ok: true, value: [] });
|
||
expect(pushText(parser, "\n\n")).toEqual([
|
||
{
|
||
kind: "EVENT",
|
||
eventType: "message",
|
||
data: "a",
|
||
id: null,
|
||
hasExplicitId: false,
|
||
},
|
||
]);
|
||
|
||
// A lone CR followed by another complete line still honours the cap.
|
||
const loneCarriageReturn = createIncrementalSseParser({
|
||
maxItemsPerChunk: 1,
|
||
});
|
||
expect(pushText(loneCarriageReturn, ":\r:\n")).toEqual([comment]);
|
||
expect(loneCarriageReturn.drain()).toEqual({
|
||
ok: true,
|
||
value: [comment],
|
||
});
|
||
|
||
// Undrained items are a caller bug: fail closed instead of buffering.
|
||
const undrained = createIncrementalSseParser({ maxItemsPerChunk: 1 });
|
||
expect(pushText(undrained, ":\n:\n")).toEqual([comment]);
|
||
const overflow = {
|
||
ok: false,
|
||
error: {
|
||
kind: "QUEUE_OVERFLOW",
|
||
operation: "DECODE",
|
||
retryable: false,
|
||
},
|
||
};
|
||
expect(undrained.push(encoder.encode(":\n"))).toEqual(overflow);
|
||
const unfinished = createIncrementalSseParser({ maxItemsPerChunk: 1 });
|
||
expect(pushText(unfinished, ":\n:\n")).toEqual([comment]);
|
||
expect(unfinished.finish()).toEqual(overflow);
|
||
});
|
||
|
||
it("parses the same items whether bytes arrive at once or one by one", () => {
|
||
const stream = encoder.encode(
|
||
"event: a\r\ndata: 한글\rdata: 😀 é\r\n\r\n" +
|
||
": note\rid: c-1\ndata: xy\r\rretry: 10\n" +
|
||
"data: last\n\n",
|
||
);
|
||
const whole = createIncrementalSseParser();
|
||
const wholeResult = whole.push(stream);
|
||
if (!wholeResult.ok) throw new Error(wholeResult.error.kind);
|
||
|
||
const split = createIncrementalSseParser();
|
||
const splitItems: SseParserItem[] = [];
|
||
for (let index = 0; index < stream.length; index += 1) {
|
||
const pushed = split.push(stream.subarray(index, index + 1));
|
||
if (!pushed.ok) throw new Error(pushed.error.kind);
|
||
splitItems.push(...pushed.value);
|
||
}
|
||
|
||
const expected: SseParserItem[] = [
|
||
{
|
||
kind: "EVENT",
|
||
eventType: "a",
|
||
data: "한글\n😀 é",
|
||
id: null,
|
||
hasExplicitId: false,
|
||
},
|
||
{ kind: "COMMENT" },
|
||
{
|
||
kind: "EVENT",
|
||
eventType: "message",
|
||
data: "xy",
|
||
id: "c-1",
|
||
hasExplicitId: true,
|
||
},
|
||
{ kind: "RETRY", retryMs: 10 },
|
||
{
|
||
kind: "EVENT",
|
||
eventType: "message",
|
||
data: "last",
|
||
id: "c-1",
|
||
hasExplicitId: false,
|
||
},
|
||
];
|
||
expect(wholeResult.value).toEqual(expected);
|
||
expect(splitItems).toEqual(expected);
|
||
});
|
||
|
||
it("dispatches a trailing CR-terminated blank line only at finish", () => {
|
||
const parser = createIncrementalSseParser();
|
||
expect(pushText(parser, "data: a\rdata: b\r\r")).toEqual([]);
|
||
expect(parser.finish()).toEqual({
|
||
ok: true,
|
||
value: {
|
||
items: [
|
||
{
|
||
kind: "EVENT",
|
||
eventType: "message",
|
||
data: "a\nb",
|
||
id: null,
|
||
hasExplicitId: false,
|
||
},
|
||
],
|
||
incompleteEventDiscarded: false,
|
||
},
|
||
});
|
||
});
|
||
|
||
it("counts UTF-8 bytes, not UTF-16 units, against line and event limits", () => {
|
||
const limits = {
|
||
maxLineBytes: 9,
|
||
maxEventBytes: 11,
|
||
maxIncompleteBufferBytes: 11,
|
||
};
|
||
const tooLarge = {
|
||
ok: false,
|
||
error: {
|
||
kind: "EVENT_TOO_LARGE",
|
||
operation: "DECODE",
|
||
retryable: false,
|
||
},
|
||
};
|
||
|
||
// "data:😀" is 7 UTF-16 units but 9 bytes; the CRLF makes the event 11.
|
||
expect(
|
||
createIncrementalSseParser(limits).push(
|
||
encoder.encode("data:😀\r\n\r\n"),
|
||
),
|
||
).toMatchObject({ ok: true, value: [{ data: "😀" }] });
|
||
expect(
|
||
createIncrementalSseParser(limits).push(
|
||
encoder.encode("data:😀a"),
|
||
),
|
||
).toEqual(tooLarge);
|
||
expect(
|
||
createIncrementalSseParser(limits).push(
|
||
encoder.encode("data:한\r\ndata:\r\n"),
|
||
),
|
||
).toEqual(tooLarge);
|
||
|
||
// The same limit holds when the multibyte character is split across reads.
|
||
const split = createIncrementalSseParser(limits);
|
||
const bytes = encoder.encode("data:한한");
|
||
expect(split.push(bytes.subarray(0, 6))).toEqual({
|
||
ok: true,
|
||
value: [],
|
||
});
|
||
expect(split.push(bytes.subarray(6))).toEqual(tooLarge);
|
||
});
|
||
|
||
it("accepts a maximum-size line across many reads and rejects one byte more", () => {
|
||
const maxLineBytes = 32 * 1_024;
|
||
const payload = "é".repeat((maxLineBytes - 6) / 2);
|
||
const exact = encoder.encode(`data: ${payload}\n\n`);
|
||
// 1,000-byte reads split some two-byte "é" characters.
|
||
const parser = createIncrementalSseParser({ maxLineBytes });
|
||
const items: SseParserItem[] = [];
|
||
for (let index = 0; index < exact.length; index += 1_000) {
|
||
const pushed = parser.push(exact.subarray(index, index + 1_000));
|
||
if (!pushed.ok) throw new Error(pushed.error.kind);
|
||
items.push(...pushed.value);
|
||
}
|
||
expect(items).toEqual([
|
||
{
|
||
kind: "EVENT",
|
||
eventType: "message",
|
||
data: payload,
|
||
id: null,
|
||
hasExplicitId: false,
|
||
},
|
||
]);
|
||
|
||
const over = createIncrementalSseParser({ maxLineBytes });
|
||
const overBytes = encoder.encode(`data: ${payload}a`);
|
||
expect(over.push(overBytes.subarray(0, 20_000))).toEqual({
|
||
ok: true,
|
||
value: [],
|
||
});
|
||
expect(over.push(overBytes.subarray(20_000))).toEqual({
|
||
ok: false,
|
||
error: {
|
||
kind: "EVENT_TOO_LARGE",
|
||
operation: "DECODE",
|
||
retryable: false,
|
||
},
|
||
});
|
||
});
|
||
|
||
it("parses a full-size chunk of many events", () => {
|
||
const events = Array.from({ length: 200 }, (_, index) =>
|
||
JSON.stringify({ index, value: "v".repeat(1_200) }),
|
||
);
|
||
const chunk = encoder.encode(
|
||
events
|
||
.map((data, index) => `id: c-${index}\r\ndata: ${data}\r\n\r\n`)
|
||
.join(""),
|
||
);
|
||
expect(chunk.byteLength).toBeGreaterThan(240 * 1_024);
|
||
expect(chunk.byteLength).toBeLessThanOrEqual(256 * 1_024);
|
||
|
||
const pushed = createIncrementalSseParser().push(chunk);
|
||
if (!pushed.ok) throw new Error(pushed.error.kind);
|
||
expect(pushed.value).toHaveLength(200);
|
||
expect(pushed.value[199]).toEqual({
|
||
kind: "EVENT",
|
||
eventType: "message",
|
||
data: events[199],
|
||
id: "c-199",
|
||
hasExplicitId: true,
|
||
});
|
||
});
|
||
});
|
||
|
||
describe("byte-level SSE parser against the round-2 text parser", () => {
|
||
const asciiPieces = [
|
||
"data", "data:", "data: ", "event: ", "id: ", "id:", "retry: ",
|
||
":", "x", " ", "abc", "12", "\0", "\r", "\n", "\r\n", "\n\n", "\r\r",
|
||
];
|
||
const multibytePieces = [...asciiPieces, "é", "한글", "😀", ""];
|
||
|
||
type Create = typeof createIncrementalSseParser;
|
||
|
||
// mulberry32: a small seeded PRNG, so a failing seed can be replayed.
|
||
function randomSource(seed: number): () => number {
|
||
let state = seed;
|
||
return () => {
|
||
state = (state + 0x6d2b79f5) | 0;
|
||
let value = Math.imul(state ^ (state >>> 15), 1 | state);
|
||
value ^= value + Math.imul(value ^ (value >>> 7), 61 | value);
|
||
return ((value ^ (value >>> 14)) >>> 0) / 4_294_967_296;
|
||
};
|
||
}
|
||
|
||
function run(
|
||
create: Create,
|
||
limits: Parameters<Create>[0],
|
||
chunks: readonly Uint8Array[],
|
||
skipDrain: readonly boolean[],
|
||
): unknown[] {
|
||
const parser = create(limits);
|
||
const log: unknown[] = [];
|
||
for (const [index, chunk] of chunks.entries()) {
|
||
let result = parser.push(chunk);
|
||
log.push(result);
|
||
while (!skipDrain[index] && result.ok && result.value.length > 0) {
|
||
result = parser.drain();
|
||
log.push(result);
|
||
}
|
||
if (!result.ok) return log;
|
||
}
|
||
log.push(parser.finish());
|
||
return log;
|
||
}
|
||
|
||
it.each([
|
||
["ASCII", asciiPieces],
|
||
["multibyte", multibytePieces],
|
||
])("matches on random %s streams and read splits", (_, pieces) => {
|
||
for (let seed = 1; seed <= 1_500; seed += 1) {
|
||
const next = randomSource(seed);
|
||
const pick = (max: number) => Math.floor(next() * max);
|
||
let text = next() < 0.3 ? "" : "";
|
||
for (let count = 1 + pick(40); count > 0; count -= 1) {
|
||
text += pieces[pick(pieces.length)];
|
||
}
|
||
// Node's streaming TextDecoder, which the reference relies on, drops a
|
||
// U+FEFF right after the first character when that character is split
|
||
// across reads (see the BOM test above). Keep that input out.
|
||
const first = String.fromCodePoint(text.codePointAt(0) ?? 0x20);
|
||
while (text.startsWith("", first.length)) {
|
||
text = first + text.slice(first.length + 1);
|
||
}
|
||
let bytes = encoder.encode(text);
|
||
// Cutting the stream can end it inside a character.
|
||
if (next() < 0.2) bytes = bytes.subarray(0, pick(bytes.length + 1));
|
||
|
||
const chunks: Uint8Array[] = [];
|
||
const maxRead = 1 + pick(next() < 0.5 ? 6 : bytes.length + 1);
|
||
for (let index = 0; index < bytes.length; ) {
|
||
const size = 1 + pick(maxRead);
|
||
chunks.push(bytes.subarray(index, index + size));
|
||
index += size;
|
||
}
|
||
const skipDrain = chunks.map(() => next() < 0.05);
|
||
|
||
const maxEventBytes = 4 + pick(60);
|
||
const limits =
|
||
next() < 0.3
|
||
? {}
|
||
: {
|
||
maxLineBytes: 4 + pick(40),
|
||
maxEventBytes,
|
||
maxIncompleteBufferBytes: maxEventBytes + pick(20),
|
||
maxItemsPerChunk: 1 + pick(4),
|
||
};
|
||
|
||
expect(
|
||
run(createIncrementalSseParser, limits, chunks, skipDrain),
|
||
`seed ${seed}`,
|
||
).toEqual(run(createReferenceSseParser, limits, chunks, skipDrain));
|
||
}
|
||
});
|
||
});
|