@earendil-works/chord 1.1.0 → 1.3.0

package/dist/output.js

@@ -0,0 +1,350 @@
+/**
+ * Bounded output streams and adaptive progress commits: `OutputBuffer` keeps a head or tail window of a stream at a cost
+ * proportional to each chunk, and `Progress` paces commits of a changing value by their size.
+ */
+const NEWLINE = 0x0a;
+const INVALID_OUTPUT = /[\x00-\x08\x0b-\x1f\ufff9-\ufffb]/g;
+const encoder = new TextEncoder();
+/** Slices decode exactly: a U+FEFF at a slice's start is text, not a byte-order mark. */
+const decoder = new TextDecoder("utf-8", { ignoreBOM: true });
+/** Remove control characters that break display and transcripts; tabs and newlines stay. */
+export function sanitizeOutput(text) {
+    return text.replace(INVALID_OUTPUT, "");
+}
+/**
+ * Bound `text` to whole lines within the limits: the first lines for `head`, the last lines for `tail`. The result is an
+ * exact slice, trailing newline included. A single line longer than `maxBytes` is cut at the byte limit on a character
+ * boundary.
+ */
+export function boundOutput(text, limits) {
+    const bytes = encoder.encode(text);
+    const [from, to] = limits.retain === "head" ? headRange(bytes, limits) : tailRange(bytes, limits);
+    const kept = bytes.subarray(from, to);
+    return {
+        text: kept.length === bytes.length ? text : decoder.decode(kept),
+        bytes: kept.length,
+        droppedBytes: bytes.length - kept.length,
+        droppedLines: lineCount(bytes) - lineCount(kept),
+    };
+}
+function headRange(bytes, limits) {
+    if (limits.maxLines === 0 || limits.maxBytes === 0)
+        return [0, 0];
+    let end = bytes.length;
+    let lines = 0;
+    for (let index = bytes.indexOf(NEWLINE); index !== -1; index = bytes.indexOf(NEWLINE, index + 1)) {
+        if (++lines === limits.maxLines) {
+            end = index + 1;
+            break;
+        }
+    }
+    if (end > limits.maxBytes) {
+        const newline = bytes.lastIndexOf(NEWLINE, limits.maxBytes - 1);
+        end = newline === -1 ? characterEnd(bytes, limits.maxBytes) : newline + 1;
+    }
+    return [0, end];
+}
+function tailRange(bytes, limits) {
+    if (limits.maxLines === 0 || limits.maxBytes === 0)
+        return [bytes.length, bytes.length];
+    // A trailing newline ends the last line rather than starting another.
+    const last = bytes[bytes.length - 1] === NEWLINE ? bytes.length - 2 : bytes.length - 1;
+    let start = 0;
+    let lines = 1;
+    for (let index = last < 0 ? -1 : bytes.lastIndexOf(NEWLINE, last); index !== -1;) {
+        if (lines === limits.maxLines) {
+            start = index + 1;
+            break;
+        }
+        lines++;
+        index = index === 0 ? -1 : bytes.lastIndexOf(NEWLINE, index - 1);
+    }
+    if (bytes.length - start > limits.maxBytes) {
+        const from = bytes.length - limits.maxBytes;
+        const newline = bytes.indexOf(NEWLINE, from - 1);
+        // The first line starting inside the byte window, or a cut of the last line when it alone is too long.
+        start = newline !== -1 && newline + 1 < bytes.length ? newline + 1 : characterStart(bytes, from);
+    }
+    return [start, bytes.length];
+}
+/** The last character boundary at or before `index`. */
+export function characterEnd(bytes, index) {
+    let end = index;
+    while (end > 0 && ((bytes[end] ?? 0) & 0xc0) === 0x80)
+        end--;
+    return end;
+}
+/** The first character boundary at or after `index`. */
+function characterStart(bytes, index) {
+    let start = index;
+    while (start < bytes.length && ((bytes[start] ?? 0) & 0xc0) === 0x80)
+        start++;
+    return start;
+}
+function lineCount(bytes) {
+    if (bytes.length === 0)
+        return 0;
+    let newlines = 0;
+    for (let index = bytes.indexOf(NEWLINE); index !== -1; index = bytes.indexOf(NEWLINE, index + 1))
+        newlines++;
+    return newlines + (bytes[bytes.length - 1] === NEWLINE ? 0 : 1);
+}
+/**
+ * Bounded running output of one stream, such as a tool call's or a process's. Accepting a chunk costs time proportional to the chunk: head retention stops
+ * storing once the window is full, and tail retention drops stored text the window no longer needs when it snapshots.
+ * Counts of the whole stream are kept so the dropped totals stay exact.
+ */
+export class OutputBuffer {
+    #limits;
+    /**
+     * Decoder of byte chunks. A string chunk or a skip ends an incomplete character of earlier bytes (it becomes U+FFFD);
+     * the next byte chunk then starts a new character. As in `StreamDecoder`, only a byte-order mark at the very start of
+     * the output is dropped, never a U+FEFF later in it.
+     */
+    #decoder = new TextDecoder("utf-8", { ignoreBOM: true });
+    #started = false;
+    /** Stored chunks: for head the start of the stream, for tail a suffix that still contains the next window. */
+    #chunks = [];
+    #storedBytes = 0;
+    #storedNewlines = 0;
+    #full = false;
+    #totalBytes = 0;
+    #totalNewlines = 0;
+    #endsWithNewline = true;
+    constructor(limits) {
+        this.#limits = limits;
+    }
+    /** Bytes currently held; bounded by the limits plus one chunk. */
+    get storedBytes() {
+        return this.#storedBytes;
+    }
+    /**
+     * Accept a chunk; returns whether anything was accepted. `skipped` is output omitted right before the chunk, which
+     * must be more than the tail window by at least one byte or line; only tail retention accepts it.
+     */
+    push(chunk, skipped) {
+        // Bytes of an incomplete character from an earlier byte chunk come first.
+        const pending = typeof chunk === "string" || skipped !== undefined ? this.#decoder.decode() : "";
+        let text = typeof chunk === "string" ? chunk : this.#decoder.decode(chunk, { stream: true });
+        const first = !this.#started && pending === "" && skipped === undefined;
+        if (pending !== "" || text !== "" || skipped !== undefined)
+            this.#started = true;
+        if (first && typeof chunk !== "string" && text.startsWith("\ufeff"))
+            text = text.slice(1);
+        if (skipped === undefined)
+            return this.#accept(pending + text);
+        if (this.#limits.retain !== "tail")
+            throw new Error("Skipped output requires tail retention");
+        this.#accept(pending);
+        this.#skip(skipped);
+        this.#accept(text);
+        return true;
+    }
+    /** Count omitted output; nothing stored before it can be in the window once the text after it arrives. */
+    #skip(skipped) {
+        if (skipped.bytes === 0)
+            return;
+        this.#totalBytes += skipped.bytes;
+        this.#totalNewlines += skipped.newlines;
+        this.#endsWithNewline = skipped.endsWithNewline;
+        this.#chunks = [];
+        this.#storedBytes = 0;
+        this.#storedNewlines = 0;
+    }
+    /** Flush an incomplete trailing character as a replacement character; call when the stream ends. */
+    end() {
+        this.#accept(this.#decoder.decode());
+    }
+    #accept(text) {
+        if (text.length === 0)
+            return false;
+        const bytes = utf8ByteLength(text);
+        const newlines = countNewlines(text);
+        this.#totalBytes += bytes;
+        this.#totalNewlines += newlines;
+        this.#endsWithNewline = text.endsWith("\n");
+        if (this.#full)
+            return true;
+        this.#chunks.push({ text, bytes, newlines });
+        this.#storedBytes += bytes;
+        this.#storedNewlines += newlines;
+        if (this.#limits.retain === "head") {
+            // Nothing past a full window is ever needed.
+            this.#full = this.#storedBytes > this.#limits.maxBytes || this.#storedNewlines >= this.#limits.maxLines;
+            return true;
+        }
+        // Drop leading chunks while the rest still holds more than a window: more than `maxBytes` bytes or `maxLines`
+        // newlines, plus one, so the window's line start can still be found. Each chunk is dropped once.
+        while (this.#chunks.length > 1) {
+            const first = this.#chunks[0];
+            const bytesAfter = this.#storedBytes - first.bytes;
+            const newlinesAfter = this.#storedNewlines - first.newlines;
+            if (bytesAfter <= this.#limits.maxBytes + 1 && newlinesAfter <= this.#limits.maxLines + 1)
+                break;
+            this.#chunks.shift();
+            this.#storedBytes = bytesAfter;
+            this.#storedNewlines = newlinesAfter;
+        }
+        return true;
+    }
+    /** Retained, sanitized output and what the limits dropped from the whole stream. */
+    snapshot() {
+        const stored = this.#chunks.length === 1 ? this.#chunks[0].text : this.#chunks.map((chunk) => chunk.text).join("");
+        const kept = boundOutput(stored, this.#limits);
+        const storedLines = lines(this.#storedNewlines, stored === "" || stored.endsWith("\n"));
+        const keptLines = storedLines - kept.droppedLines;
+        // Tail windows never reach back before this one, but finding a later window's first line needs what precedes it:
+        // keep the shortest suffix longer than the window by a byte or a line, as `#accept` does.
+        if (this.#limits.retain === "tail" || this.#chunks.length > 1) {
+            const text = this.#limits.retain === "tail" ? tailMargin(stored, this.#limits) : stored;
+            const bytes = this.#limits.retain === "tail" ? utf8ByteLength(text) : this.#storedBytes;
+            this.#chunks = text === "" ? [] : [{ text, bytes, newlines: countNewlines(text) }];
+            this.#storedBytes = bytes;
+            this.#storedNewlines = this.#chunks[0]?.newlines ?? 0;
+        }
+        return {
+            text: sanitizeOutput(kept.text),
+            droppedBytes: this.#totalBytes - kept.bytes,
+            droppedLines: lines(this.#totalNewlines, this.#endsWithNewline) - keptLines,
+        };
+    }
+}
+/**
+ * The shortest suffix of `text` with more than `maxBytes` bytes or more than `maxLines` newlines, or all of it. The
+ * tail window of any text that ends with this suffix, followed by anything, is the same as of `text` followed by it.
+ */
+function tailMargin(text, limits) {
+    const bytes = encoder.encode(text);
+    const byteStart = bytes.length > limits.maxBytes ? characterEnd(bytes, bytes.length - limits.maxBytes - 1) : 0;
+    let lineStart = 0;
+    let newlines = 0;
+    for (let index = bytes.lastIndexOf(NEWLINE); index !== -1; index = bytes.lastIndexOf(NEWLINE, index - 1)) {
+        if (++newlines > limits.maxLines) {
+            lineStart = index;
+            break;
+        }
+        if (index === 0)
+            break;
+    }
+    const start = Math.max(byteStart, lineStart);
+    return start === 0 ? text : decoder.decode(bytes.subarray(start));
+}
+/** Lines of text with `newlines` newlines; a final unterminated line counts. */
+function lines(newlines, terminated) {
+    return newlines + (terminated ? 0 : 1);
+}
+const runtimeBuffer = globalThis.Buffer;
+const nonAsciiPattern = /[^\x00-\x7f]/;
+/** UTF-8 byte length of `content`; a lone surrogate counts as U+FFFD, three bytes. */
+export function utf8ByteLength(content) {
+    if (runtimeBuffer)
+        return runtimeBuffer.byteLength(content, "utf8");
+    const firstNonAscii = content.search(nonAsciiPattern);
+    if (firstNonAscii === -1)
+        return content.length;
+    let bytes = firstNonAscii;
+    for (let i = firstNonAscii; i < content.length; i++) {
+        const code = content.charCodeAt(i);
+        if (code <= 0x7f)
+            bytes += 1;
+        else if (code <= 0x7ff)
+            bytes += 2;
+        else if (code >= 0xd800 && code <= 0xdbff && i + 1 < content.length) {
+            const next = content.charCodeAt(i + 1);
+            if (next >= 0xdc00 && next <= 0xdfff) {
+                bytes += 4;
+                i++;
+            }
+            else
+                bytes += 3;
+        }
+        else
+            bytes += 3;
+    }
+    return bytes;
+}
+function countNewlines(text) {
+    let count = 0;
+    for (let index = text.indexOf("\n"); index !== -1; index = text.indexOf("\n", index + 1))
+        count++;
+    return count;
+}
+/** Each progress commit also buys a pause proportional to what it wrote. */
+export const PROGRESS_BYTES_PER_SECOND = 100 * 1024;
+/**
+ * Adaptive progress commits: the first change after an idle period commits at once; each commit then delays the next
+ * by at least `minIntervalMs` and by its written size at 100 KiB/s. At most one commit is in flight; changes made
+ * meanwhile coalesce into the next one.
+ */
+export class Progress {
+    #write;
+    #onError;
+    #minIntervalMs;
+    #waiters = [];
+    #timer;
+    #inFlight;
+    #nextAt = 0;
+    #dirty = false;
+    #stopped = false;
+    constructor(write, onError, minIntervalMs) {
+        this.#write = write;
+        this.#onError = onError;
+        this.#minIntervalMs = minIntervalMs;
+    }
+    /** Schedule a commit. */
+    mark() {
+        this.#dirty = true;
+        this.#schedule();
+    }
+    /** Schedule a commit; the promise settles with the commit that includes this change. */
+    markAndWait() {
+        const waiter = Promise.withResolvers();
+        this.#waiters.push(waiter);
+        this.mark();
+        return waiter.promise;
+    }
+    /** Stop committing and wait for the commit in flight; returns the waiters the final commit must settle. */
+    async stop() {
+        this.#stopped = true;
+        clearTimeout(this.#timer);
+        this.#timer = undefined;
+        await this.#inFlight;
+        return this.#waiters.splice(0);
+    }
+    #schedule() {
+        if (this.#stopped || this.#timer !== undefined || this.#inFlight !== undefined)
+            return;
+        const wait = this.#nextAt - Date.now();
+        if (wait <= 0)
+            this.#flush();
+        else
+            this.#timer = setTimeout(() => {
+                this.#timer = undefined;
+                this.#flush();
+            }, wait);
+    }
+    #flush() {
+        if (this.#stopped || !this.#dirty)
+            return;
+        this.#dirty = false;
+        const waiters = this.#waiters.splice(0);
+        const started = Date.now();
+        this.#inFlight = this.#write()
+            .then((bytes) => {
+            this.#nextAt = started + Math.max(this.#minIntervalMs, (bytes * 1000) / PROGRESS_BYTES_PER_SECOND);
+            for (const waiter of waiters)
+                waiter.resolve();
+        }, (error) => {
+            this.#nextAt = started + this.#minIntervalMs;
+            for (const waiter of waiters)
+                waiter.reject(error);
+            this.#onError(error);
+        })
+            .finally(() => {
+            this.#inFlight = undefined;
+            if (this.#dirty)
+                this.#schedule();
+        });
+    }
+}
+//# sourceMappingURL=output.js.map

package/dist/output.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"output.js","sourceRoot":"","sources":["../src/output.ts"],"names":[],"mappings":"AAAA;;;GAGG;AA6BH,MAAM,OAAO,GAAG,IAAI,CAAC;AACrB,MAAM,cAAc,GAAG,oCAAoC,CAAC;AAC5D,MAAM,OAAO,GAAG,IAAI,WAAW,EAAE,CAAC;AAClC,yFAAyF;AACzF,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,OAAO,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;AAE9D,4FAA4F;AAC5F,MAAM,UAAU,cAAc,CAAC,IAAY;IAC1C,OAAO,IAAI,CAAC,OAAO,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC;AACzC,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,WAAW,CAAC,IAAY,EAAE,MAAoB;IAC7D,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACnC,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAClG,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IACtC,OAAO;QACN,IAAI,EAAE,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC;QAChE,KAAK,EAAE,IAAI,CAAC,MAAM;QAClB,YAAY,EAAE,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM;QACxC,YAAY,EAAE,SAAS,CAAC,KAAK,CAAC,GAAG,SAAS,CAAC,IAAI,CAAC;KAChD,CAAC;AACH,CAAC;AAED,SAAS,SAAS,CAAC,KAAiB,EAAE,MAAoB;IACzD,IAAI,MAAM,CAAC,QAAQ,KAAK,CAAC,IAAI,MAAM,CAAC,QAAQ,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClE,IAAI,GAAG,GAAG,KAAK,CAAC,MAAM,CAAC;IACvB,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,KAAK,KAAK,CAAC,CAAC,EAAE,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC;QAClG,IAAI,EAAE,KAAK,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC;YACjC,GAAG,GAAG,KAAK,GAAG,CAAC,CAAC;YAChB,MAAM;QACP,CAAC;IACF,CAAC;IACD,IAAI,GAAG,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC3B,MAAM,OAAO,GAAG,KAAK,CAAC,WAAW,CAAC,OAAO,EAAE,MAAM,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;QAChE,GAAG,GAAG,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,KAAK,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC;IAC3E,CAAC;IACD,OAAO,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;AACjB,CAAC;AAED,SAAS,SAAS,CAAC,KAAiB,EAAE,MAAoB;IACzD,IAAI,MAAM,CAAC,QAAQ,KAAK,CAAC,IAAI,MAAM,CAAC,QAAQ,KAAK,CAAC;QAAE,OAAO,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;IACxF,sEAAsE;IACtE,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;IACvF,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,WAAW,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,KAAK,KAAK,CAAC,CAAC,GAAI,CAAC;QACnF,IAAI,KAAK,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC;YAC/B,KAAK,GAAG,KAAK,GAAG,CAAC,CAAC;YAClB,MAAM;QACP,CAAC;QACD,KAAK,EAAE,CAAC;QACR,KAAK,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,WAAW,CAAC,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;IAClE,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,GAAG,KAAK,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC;QAC5C,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC;QAC5C,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC;QACjD,uGAAuG;QACvG,KAAK,GAAG,OAAO,KAAK,CAAC,CAAC,IAAI,OAAO,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAClG,CAAC;IACD,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;AAC9B,CAAC;AAED,wDAAwD;AACxD,MAAM,UAAU,YAAY,CAAC,KAAiB,EAAE,KAAa;IAC5D,IAAI,GAAG,GAAG,KAAK,CAAC;IAChB,OAAO,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,IAAI;QAAE,GAAG,EAAE,CAAC;IAC7D,OAAO,GAAG,CAAC;AACZ,CAAC;AAED,wDAAwD;AACxD,SAAS,cAAc,CAAC,KAAiB,EAAE,KAAa;IACvD,IAAI,KAAK,GAAG,KAAK,CAAC;IAClB,OAAO,KAAK,GAAG,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,IAAI;QAAE,KAAK,EAAE,CAAC;IAC9E,OAAO,KAAK,CAAC;AACd,CAAC;AAED,SAAS,SAAS,CAAC,KAAiB;IACnC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACjC,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,KAAK,IAAI,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,KAAK,KAAK,CAAC,CAAC,EAAE,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC;QAAE,QAAQ,EAAE,CAAC;IAC7G,OAAO,QAAQ,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACjE,CAAC;AAED;;;;GAIG;AACH,MAAM,OAAO,YAAY;IACf,OAAO,CAAe;IAC/B;;;;OAIG;IACM,QAAQ,GAAG,IAAI,WAAW,CAAC,OAAO,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IAClE,QAAQ,GAAG,KAAK,CAAC;IACjB,8GAA8G;IAC9G,OAAO,GAAmF,EAAE,CAAC;IAC7F,YAAY,GAAG,CAAC,CAAC;IACjB,eAAe,GAAG,CAAC,CAAC;IACpB,KAAK,GAAG,KAAK,CAAC;IACd,WAAW,GAAG,CAAC,CAAC;IAChB,cAAc,GAAG,CAAC,CAAC;IACnB,gBAAgB,GAAG,IAAI,CAAC;IAExB,YAAY,MAAoB;QAC/B,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;IACvB,CAAC;IAED,kEAAkE;IAClE,IAAI,WAAW;QACd,OAAO,IAAI,CAAC,YAAY,CAAC;IAC1B,CAAC;IAED;;;OAGG;IACH,IAAI,CAAC,KAA0B,EAAE,OAAoB;QACpD,0EAA0E;QAC1E,MAAM,OAAO,GAAG,OAAO,KAAK,KAAK,QAAQ,IAAI,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QACjG,IAAI,IAAI,GAAG,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;QAC7F,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,QAAQ,IAAI,OAAO,KAAK,EAAE,IAAI,OAAO,KAAK,SAAS,CAAC;QACxE,IAAI,OAAO,KAAK,EAAE,IAAI,IAAI,KAAK,EAAE,IAAI,OAAO,KAAK,SAAS;YAAE,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACjF,IAAI,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC;YAAE,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC1F,IAAI,OAAO,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO,GAAG,IAAI,CAAC,CAAC;QAC/D,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,MAAM;YAAE,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;QAC9F,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QACtB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QACpB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACnB,OAAO,IAAI,CAAC;IACb,CAAC;IAED,0GAA0G;IAC1G,KAAK,CAAC,OAAmB;QACxB,IAAI,OAAO,CAAC,KAAK,KAAK,CAAC;YAAE,OAAO;QAChC,IAAI,CAAC,WAAW,IAAI,OAAO,CAAC,KAAK,CAAC;QAClC,IAAI,CAAC,cAAc,IAAI,OAAO,CAAC,QAAQ,CAAC;QACxC,IAAI,CAAC,gBAAgB,GAAG,OAAO,CAAC,eAAe,CAAC;QAChD,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAClB,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,eAAe,GAAG,CAAC,CAAC;IAC1B,CAAC;IAED,oGAAoG;IACpG,GAAG;QACF,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;IACtC,CAAC;IAED,OAAO,CAAC,IAAY;QACnB,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;QACpC,MAAM,KAAK,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC;QACnC,MAAM,QAAQ,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;QACrC,IAAI,CAAC,WAAW,IAAI,KAAK,CAAC;QAC1B,IAAI,CAAC,cAAc,IAAI,QAAQ,CAAC;QAChC,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC5C,IAAI,IAAI,CAAC,KAAK;YAAE,OAAO,IAAI,CAAC;QAC5B,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC;QAC7C,IAAI,CAAC,YAAY,IAAI,KAAK,CAAC;QAC3B,IAAI,CAAC,eAAe,IAAI,QAAQ,CAAC;QACjC,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,MAAM,EAAE,CAAC;YACpC,6CAA6C;YAC7C,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,IAAI,IAAI,CAAC,eAAe,IAAI,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;YACxG,OAAO,IAAI,CAAC;QACb,CAAC;QACD,8GAA8G;QAC9G,iGAAiG;QACjG,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAChC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC;YAC/B,MAAM,UAAU,GAAG,IAAI,CAAC,YAAY,GAAG,KAAK,CAAC,KAAK,CAAC;YACnD,MAAM,aAAa,GAAG,IAAI,CAAC,eAAe,GAAG,KAAK,CAAC,QAAQ,CAAC;YAC5D,IAAI,UAAU,IAAI,IAAI,CAAC,OAAO,CAAC,QAAQ,GAAG,CAAC,IAAI,aAAa,IAAI,IAAI,CAAC,OAAO,CAAC,QAAQ,GAAG,CAAC;gBAAE,MAAM;YACjG,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;YACrB,IAAI,CAAC,YAAY,GAAG,UAAU,CAAC;YAC/B,IAAI,CAAC,eAAe,GAAG,aAAa,CAAC;QACtC,CAAC;QACD,OAAO,IAAI,CAAC;IACb,CAAC;IAED,oFAAoF;IACpF,QAAQ;QACP,MAAM,MAAM,GACX,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACtG,MAAM,IAAI,GAAG,WAAW,CAAC,MAAM,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QAC/C,MAAM,WAAW,GAAG,KAAK,CAAC,IAAI,CAAC,eAAe,EAAE,MAAM,KAAK,EAAE,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;QACxF,MAAM,SAAS,GAAG,WAAW,GAAG,IAAI,CAAC,YAAY,CAAC;QAClD,iHAAiH;QACjH,0FAA0F;QAC1F,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,MAAM,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC/D,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;YACxF,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC;YACxF,IAAI,CAAC,OAAO,GAAG,IAAI,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACnF,IAAI,CAAC,YAAY,GAAG,KAAK,CAAC;YAC1B,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,QAAQ,IAAI,CAAC,CAAC;QACvD,CAAC;QACD,OAAO;YACN,IAAI,EAAE,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC;YAC/B,YAAY,EAAE,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,KAAK;YAC3C,YAAY,EAAE,KAAK,CAAC,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,gBAAgB,CAAC,GAAG,SAAS;SAC3E,CAAC;IACH,CAAC;CACD;AAED;;;GAGG;AACH,SAAS,UAAU,CAAC,IAAY,EAAE,MAAoB;IACrD,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACnC,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,YAAY,CAAC,KAAK,EAAE,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/G,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,KAAK,IAAI,KAAK,GAAG,KAAK,CAAC,WAAW,CAAC,OAAO,CAAC,EAAE,KAAK,KAAK,CAAC,CAAC,EAAE,KAAK,GAAG,KAAK,CAAC,WAAW,CAAC,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC,EAAE,CAAC;QAC1G,IAAI,EAAE,QAAQ,GAAG,MAAM,CAAC,QAAQ,EAAE,CAAC;YAClC,SAAS,GAAG,KAAK,CAAC;YAClB,MAAM;QACP,CAAC;QACD,IAAI,KAAK,KAAK,CAAC;YAAE,MAAM;IACxB,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;IAC7C,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;AACnE,CAAC;AAED,gFAAgF;AAChF,SAAS,KAAK,CAAC,QAAgB,EAAE,UAAmB;IACnD,OAAO,QAAQ,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACxC,CAAC;AAMD,MAAM,aAAa,GAAI,UAAyC,CAAC,MAAM,CAAC;AACxE,MAAM,eAAe,GAAG,cAAc,CAAC;AAEvC,sFAAsF;AACtF,MAAM,UAAU,cAAc,CAAC,OAAe;IAC7C,IAAI,aAAa;QAAE,OAAO,aAAa,CAAC,UAAU,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;IACpE,MAAM,aAAa,GAAG,OAAO,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC;IACtD,IAAI,aAAa,KAAK,CAAC,CAAC;QAAE,OAAO,OAAO,CAAC,MAAM,CAAC;IAChD,IAAI,KAAK,GAAG,aAAa,CAAC;IAC1B,KAAK,IAAI,CAAC,GAAG,aAAa,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrD,MAAM,IAAI,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACnC,IAAI,IAAI,IAAI,IAAI;YAAE,KAAK,IAAI,CAAC,CAAC;aACxB,IAAI,IAAI,IAAI,KAAK;YAAE,KAAK,IAAI,CAAC,CAAC;aAC9B,IAAI,IAAI,IAAI,MAAM,IAAI,IAAI,IAAI,MAAM,IAAI,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;YACrE,MAAM,IAAI,GAAG,OAAO,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACvC,IAAI,IAAI,IAAI,MAAM,IAAI,IAAI,IAAI,MAAM,EAAE,CAAC;gBACtC,KAAK,IAAI,CAAC,CAAC;gBACX,CAAC,EAAE,CAAC;YACL,CAAC;;gBAAM,KAAK,IAAI,CAAC,CAAC;QACnB,CAAC;;YAAM,KAAK,IAAI,CAAC,CAAC;IACnB,CAAC;IACD,OAAO,KAAK,CAAC;AACd,CAAC;AAED,SAAS,aAAa,CAAC,IAAY;IAClC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,KAAK,KAAK,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,GAAG,CAAC,CAAC;QAAE,KAAK,EAAE,CAAC;IAClG,OAAO,KAAK,CAAC;AACd,CAAC;AAED,4EAA4E;AAC5E,MAAM,CAAC,MAAM,yBAAyB,GAAG,GAAG,GAAG,IAAI,CAAC;AAEpD;;;;GAIG;AACH,MAAM,OAAO,QAAQ;IACX,MAAM,CAAwB;IAC9B,QAAQ,CAA2B;IACnC,cAAc,CAAS;IAChC,QAAQ,GAAiC,EAAE,CAAC;IAC5C,MAAM,CAA4C;IAClD,SAAS,CAA4B;IACrC,OAAO,GAAG,CAAC,CAAC;IACZ,MAAM,GAAG,KAAK,CAAC;IACf,QAAQ,GAAG,KAAK,CAAC;IAEjB,YAAY,KAA4B,EAAE,OAAiC,EAAE,aAAqB;QACjG,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,cAAc,GAAG,aAAa,CAAC;IACrC,CAAC;IAED,yBAAyB;IACzB,IAAI;QACH,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;QACnB,IAAI,CAAC,SAAS,EAAE,CAAC;IAClB,CAAC;IAED,wFAAwF;IACxF,WAAW;QACV,MAAM,MAAM,GAAG,OAAO,CAAC,aAAa,EAAQ,CAAC;QAC7C,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC3B,IAAI,CAAC,IAAI,EAAE,CAAC;QACZ,OAAO,MAAM,CAAC,OAAO,CAAC;IACvB,CAAC;IAED,2GAA2G;IAC3G,KAAK,CAAC,IAAI;QACT,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACrB,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC1B,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;QACxB,MAAM,IAAI,CAAC,SAAS,CAAC;QACrB,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAChC,CAAC;IAED,SAAS;QACR,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,IAAI,IAAI,CAAC,SAAS,KAAK,SAAS;YAAE,OAAO;QACvF,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvC,IAAI,IAAI,IAAI,CAAC;YAAE,IAAI,CAAC,MAAM,EAAE,CAAC;;YAE5B,IAAI,CAAC,MAAM,GAAG,UAAU,CAAC,GAAG,EAAE;gBAC7B,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;gBACxB,IAAI,CAAC,MAAM,EAAE,CAAC;YACf,CAAC,EAAE,IAAI,CAAC,CAAC;IACX,CAAC;IAED,MAAM;QACL,IAAI,IAAI,CAAC,QAAQ,IAAI,CAAC,IAAI,CAAC,MAAM;YAAE,OAAO;QAC1C,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACxC,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAC3B,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,MAAM,EAAE;aAC5B,IAAI,CACJ,CAAC,KAAK,EAAE,EAAE;YACT,IAAI,CAAC,OAAO,GAAG,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,yBAAyB,CAAC,CAAC;YACnG,KAAK,MAAM,MAAM,IAAI,OAAO;gBAAE,MAAM,CAAC,OAAO,EAAE,CAAC;QAChD,CAAC,EACD,CAAC,KAAc,EAAE,EAAE;YAClB,IAAI,CAAC,OAAO,GAAG,OAAO,GAAG,IAAI,CAAC,cAAc,CAAC;YAC7C,KAAK,MAAM,MAAM,IAAI,OAAO;gBAAE,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACnD,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACtB,CAAC,CACD;aACA,OAAO,CAAC,GAAG,EAAE;YACb,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;YAC3B,IAAI,IAAI,CAAC,MAAM;gBAAE,IAAI,CAAC,SAAS,EAAE,CAAC;QACnC,CAAC,CAAC,CAAC;IACL,CAAC;CACD","sourcesContent":["/**\n * Bounded output streams and adaptive progress commits: `OutputBuffer` keeps a head or tail window of a stream at a cost\n * proportional to each chunk, and `Progress` paces commits of a changing value by their size.\n */\n\n/** Retention limits of one output stream. */\nexport type OutputLimits = { readonly maxBytes: number; readonly maxLines: number; readonly retain: \"head\" | \"tail\" };\n\n/** Retained output and what the limits dropped. */\nexport type BoundedOutput = { readonly text: string; readonly droppedBytes: number; readonly droppedLines: number };\n\n/** An exact slice of the input within the limits, and what it left out. */\nexport type OutputSlice = {\n\treadonly text: string;\n\treadonly bytes: number;\n\treadonly droppedBytes: number;\n\treadonly droppedLines: number;\n};\n\n/**\n * Output a producer omitted before a chunk, measured on the decoded text: every U+FFFD counts as three bytes, and no\n * sanitizing is applied.\n */\nexport interface OutputSkip {\n\t/** UTF-8 byte length of the omitted text. */\n\treadonly bytes: number;\n\t/** Newlines (U+000A) in the omitted text. */\n\treadonly newlines: number;\n\t/** Whether the omitted text ends with a newline. */\n\treadonly endsWithNewline: boolean;\n}\n\nconst NEWLINE = 0x0a;\nconst INVALID_OUTPUT = /[\\x00-\\x08\\x0b-\\x1f\\ufff9-\\ufffb]/g;\nconst encoder = new TextEncoder();\n/** Slices decode exactly: a U+FEFF at a slice's start is text, not a byte-order mark. */\nconst decoder = new TextDecoder(\"utf-8\", { ignoreBOM: true });\n\n/** Remove control characters that break display and transcripts; tabs and newlines stay. */\nexport function sanitizeOutput(text: string): string {\n\treturn text.replace(INVALID_OUTPUT, \"\");\n}\n\n/**\n * Bound `text` to whole lines within the limits: the first lines for `head`, the last lines for `tail`. The result is an\n * exact slice, trailing newline included. A single line longer than `maxBytes` is cut at the byte limit on a character\n * boundary.\n */\nexport function boundOutput(text: string, limits: OutputLimits): OutputSlice {\n\tconst bytes = encoder.encode(text);\n\tconst [from, to] = limits.retain === \"head\" ? headRange(bytes, limits) : tailRange(bytes, limits);\n\tconst kept = bytes.subarray(from, to);\n\treturn {\n\t\ttext: kept.length === bytes.length ? text : decoder.decode(kept),\n\t\tbytes: kept.length,\n\t\tdroppedBytes: bytes.length - kept.length,\n\t\tdroppedLines: lineCount(bytes) - lineCount(kept),\n\t};\n}\n\nfunction headRange(bytes: Uint8Array, limits: OutputLimits): [number, number] {\n\tif (limits.maxLines === 0 || limits.maxBytes === 0) return [0, 0];\n\tlet end = bytes.length;\n\tlet lines = 0;\n\tfor (let index = bytes.indexOf(NEWLINE); index !== -1; index = bytes.indexOf(NEWLINE, index + 1)) {\n\t\tif (++lines === limits.maxLines) {\n\t\t\tend = index + 1;\n\t\t\tbreak;\n\t\t}\n\t}\n\tif (end > limits.maxBytes) {\n\t\tconst newline = bytes.lastIndexOf(NEWLINE, limits.maxBytes - 1);\n\t\tend = newline === -1 ? characterEnd(bytes, limits.maxBytes) : newline + 1;\n\t}\n\treturn [0, end];\n}\n\nfunction tailRange(bytes: Uint8Array, limits: OutputLimits): [number, number] {\n\tif (limits.maxLines === 0 || limits.maxBytes === 0) return [bytes.length, bytes.length];\n\t// A trailing newline ends the last line rather than starting another.\n\tconst last = bytes[bytes.length - 1] === NEWLINE ? bytes.length - 2 : bytes.length - 1;\n\tlet start = 0;\n\tlet lines = 1;\n\tfor (let index = last < 0 ? -1 : bytes.lastIndexOf(NEWLINE, last); index !== -1; ) {\n\t\tif (lines === limits.maxLines) {\n\t\t\tstart = index + 1;\n\t\t\tbreak;\n\t\t}\n\t\tlines++;\n\t\tindex = index === 0 ? -1 : bytes.lastIndexOf(NEWLINE, index - 1);\n\t}\n\tif (bytes.length - start > limits.maxBytes) {\n\t\tconst from = bytes.length - limits.maxBytes;\n\t\tconst newline = bytes.indexOf(NEWLINE, from - 1);\n\t\t// The first line starting inside the byte window, or a cut of the last line when it alone is too long.\n\t\tstart = newline !== -1 && newline + 1 < bytes.length ? newline + 1 : characterStart(bytes, from);\n\t}\n\treturn [start, bytes.length];\n}\n\n/** The last character boundary at or before `index`. */\nexport function characterEnd(bytes: Uint8Array, index: number): number {\n\tlet end = index;\n\twhile (end > 0 && ((bytes[end] ?? 0) & 0xc0) === 0x80) end--;\n\treturn end;\n}\n\n/** The first character boundary at or after `index`. */\nfunction characterStart(bytes: Uint8Array, index: number): number {\n\tlet start = index;\n\twhile (start < bytes.length && ((bytes[start] ?? 0) & 0xc0) === 0x80) start++;\n\treturn start;\n}\n\nfunction lineCount(bytes: Uint8Array): number {\n\tif (bytes.length === 0) return 0;\n\tlet newlines = 0;\n\tfor (let index = bytes.indexOf(NEWLINE); index !== -1; index = bytes.indexOf(NEWLINE, index + 1)) newlines++;\n\treturn newlines + (bytes[bytes.length - 1] === NEWLINE ? 0 : 1);\n}\n\n/**\n * Bounded running output of one stream, such as a tool call's or a process's. Accepting a chunk costs time proportional to the chunk: head retention stops\n * storing once the window is full, and tail retention drops stored text the window no longer needs when it snapshots.\n * Counts of the whole stream are kept so the dropped totals stay exact.\n */\nexport class OutputBuffer {\n\treadonly #limits: OutputLimits;\n\t/**\n\t * Decoder of byte chunks. A string chunk or a skip ends an incomplete character of earlier bytes (it becomes U+FFFD);\n\t * the next byte chunk then starts a new character. As in `StreamDecoder`, only a byte-order mark at the very start of\n\t * the output is dropped, never a U+FEFF later in it.\n\t */\n\treadonly #decoder = new TextDecoder(\"utf-8\", { ignoreBOM: true });\n\t#started = false;\n\t/** Stored chunks: for head the start of the stream, for tail a suffix that still contains the next window. */\n\t#chunks: { readonly text: string; readonly bytes: number; readonly newlines: number }[] = [];\n\t#storedBytes = 0;\n\t#storedNewlines = 0;\n\t#full = false;\n\t#totalBytes = 0;\n\t#totalNewlines = 0;\n\t#endsWithNewline = true;\n\n\tconstructor(limits: OutputLimits) {\n\t\tthis.#limits = limits;\n\t}\n\n\t/** Bytes currently held; bounded by the limits plus one chunk. */\n\tget storedBytes(): number {\n\t\treturn this.#storedBytes;\n\t}\n\n\t/**\n\t * Accept a chunk; returns whether anything was accepted. `skipped` is output omitted right before the chunk, which\n\t * must be more than the tail window by at least one byte or line; only tail retention accepts it.\n\t */\n\tpush(chunk: string | Uint8Array, skipped?: OutputSkip): boolean {\n\t\t// Bytes of an incomplete character from an earlier byte chunk come first.\n\t\tconst pending = typeof chunk === \"string\" || skipped !== undefined ? this.#decoder.decode() : \"\";\n\t\tlet text = typeof chunk === \"string\" ? chunk : this.#decoder.decode(chunk, { stream: true });\n\t\tconst first = !this.#started && pending === \"\" && skipped === undefined;\n\t\tif (pending !== \"\" || text !== \"\" || skipped !== undefined) this.#started = true;\n\t\tif (first && typeof chunk !== \"string\" && text.startsWith(\"\\ufeff\")) text = text.slice(1);\n\t\tif (skipped === undefined) return this.#accept(pending + text);\n\t\tif (this.#limits.retain !== \"tail\") throw new Error(\"Skipped output requires tail retention\");\n\t\tthis.#accept(pending);\n\t\tthis.#skip(skipped);\n\t\tthis.#accept(text);\n\t\treturn true;\n\t}\n\n\t/** Count omitted output; nothing stored before it can be in the window once the text after it arrives. */\n\t#skip(skipped: OutputSkip): void {\n\t\tif (skipped.bytes === 0) return;\n\t\tthis.#totalBytes += skipped.bytes;\n\t\tthis.#totalNewlines += skipped.newlines;\n\t\tthis.#endsWithNewline = skipped.endsWithNewline;\n\t\tthis.#chunks = [];\n\t\tthis.#storedBytes = 0;\n\t\tthis.#storedNewlines = 0;\n\t}\n\n\t/** Flush an incomplete trailing character as a replacement character; call when the stream ends. */\n\tend(): void {\n\t\tthis.#accept(this.#decoder.decode());\n\t}\n\n\t#accept(text: string): boolean {\n\t\tif (text.length === 0) return false;\n\t\tconst bytes = utf8ByteLength(text);\n\t\tconst newlines = countNewlines(text);\n\t\tthis.#totalBytes += bytes;\n\t\tthis.#totalNewlines += newlines;\n\t\tthis.#endsWithNewline = text.endsWith(\"\\n\");\n\t\tif (this.#full) return true;\n\t\tthis.#chunks.push({ text, bytes, newlines });\n\t\tthis.#storedBytes += bytes;\n\t\tthis.#storedNewlines += newlines;\n\t\tif (this.#limits.retain === \"head\") {\n\t\t\t// Nothing past a full window is ever needed.\n\t\t\tthis.#full = this.#storedBytes > this.#limits.maxBytes || this.#storedNewlines >= this.#limits.maxLines;\n\t\t\treturn true;\n\t\t}\n\t\t// Drop leading chunks while the rest still holds more than a window: more than `maxBytes` bytes or `maxLines`\n\t\t// newlines, plus one, so the window's line start can still be found. Each chunk is dropped once.\n\t\twhile (this.#chunks.length > 1) {\n\t\t\tconst first = this.#chunks[0]!;\n\t\t\tconst bytesAfter = this.#storedBytes - first.bytes;\n\t\t\tconst newlinesAfter = this.#storedNewlines - first.newlines;\n\t\t\tif (bytesAfter <= this.#limits.maxBytes + 1 && newlinesAfter <= this.#limits.maxLines + 1) break;\n\t\t\tthis.#chunks.shift();\n\t\t\tthis.#storedBytes = bytesAfter;\n\t\t\tthis.#storedNewlines = newlinesAfter;\n\t\t}\n\t\treturn true;\n\t}\n\n\t/** Retained, sanitized output and what the limits dropped from the whole stream. */\n\tsnapshot(): BoundedOutput {\n\t\tconst stored =\n\t\t\tthis.#chunks.length === 1 ? this.#chunks[0]!.text : this.#chunks.map((chunk) => chunk.text).join(\"\");\n\t\tconst kept = boundOutput(stored, this.#limits);\n\t\tconst storedLines = lines(this.#storedNewlines, stored === \"\" || stored.endsWith(\"\\n\"));\n\t\tconst keptLines = storedLines - kept.droppedLines;\n\t\t// Tail windows never reach back before this one, but finding a later window's first line needs what precedes it:\n\t\t// keep the shortest suffix longer than the window by a byte or a line, as `#accept` does.\n\t\tif (this.#limits.retain === \"tail\" || this.#chunks.length > 1) {\n\t\t\tconst text = this.#limits.retain === \"tail\" ? tailMargin(stored, this.#limits) : stored;\n\t\t\tconst bytes = this.#limits.retain === \"tail\" ? utf8ByteLength(text) : this.#storedBytes;\n\t\t\tthis.#chunks = text === \"\" ? [] : [{ text, bytes, newlines: countNewlines(text) }];\n\t\t\tthis.#storedBytes = bytes;\n\t\t\tthis.#storedNewlines = this.#chunks[0]?.newlines ?? 0;\n\t\t}\n\t\treturn {\n\t\t\ttext: sanitizeOutput(kept.text),\n\t\t\tdroppedBytes: this.#totalBytes - kept.bytes,\n\t\t\tdroppedLines: lines(this.#totalNewlines, this.#endsWithNewline) - keptLines,\n\t\t};\n\t}\n}\n\n/**\n * The shortest suffix of `text` with more than `maxBytes` bytes or more than `maxLines` newlines, or all of it. The\n * tail window of any text that ends with this suffix, followed by anything, is the same as of `text` followed by it.\n */\nfunction tailMargin(text: string, limits: OutputLimits): string {\n\tconst bytes = encoder.encode(text);\n\tconst byteStart = bytes.length > limits.maxBytes ? characterEnd(bytes, bytes.length - limits.maxBytes - 1) : 0;\n\tlet lineStart = 0;\n\tlet newlines = 0;\n\tfor (let index = bytes.lastIndexOf(NEWLINE); index !== -1; index = bytes.lastIndexOf(NEWLINE, index - 1)) {\n\t\tif (++newlines > limits.maxLines) {\n\t\t\tlineStart = index;\n\t\t\tbreak;\n\t\t}\n\t\tif (index === 0) break;\n\t}\n\tconst start = Math.max(byteStart, lineStart);\n\treturn start === 0 ? text : decoder.decode(bytes.subarray(start));\n}\n\n/** Lines of text with `newlines` newlines; a final unterminated line counts. */\nfunction lines(newlines: number, terminated: boolean): number {\n\treturn newlines + (terminated ? 0 : 1);\n}\n\ninterface RuntimeBuffer {\n\tbyteLength(content: string, encoding: \"utf8\"): number;\n}\n\nconst runtimeBuffer = (globalThis as { Buffer?: RuntimeBuffer }).Buffer;\nconst nonAsciiPattern = /[^\\x00-\\x7f]/;\n\n/** UTF-8 byte length of `content`; a lone surrogate counts as U+FFFD, three bytes. */\nexport function utf8ByteLength(content: string): number {\n\tif (runtimeBuffer) return runtimeBuffer.byteLength(content, \"utf8\");\n\tconst firstNonAscii = content.search(nonAsciiPattern);\n\tif (firstNonAscii === -1) return content.length;\n\tlet bytes = firstNonAscii;\n\tfor (let i = firstNonAscii; i < content.length; i++) {\n\t\tconst code = content.charCodeAt(i);\n\t\tif (code <= 0x7f) bytes += 1;\n\t\telse if (code <= 0x7ff) bytes += 2;\n\t\telse if (code >= 0xd800 && code <= 0xdbff && i + 1 < content.length) {\n\t\t\tconst next = content.charCodeAt(i + 1);\n\t\t\tif (next >= 0xdc00 && next <= 0xdfff) {\n\t\t\t\tbytes += 4;\n\t\t\t\ti++;\n\t\t\t} else bytes += 3;\n\t\t} else bytes += 3;\n\t}\n\treturn bytes;\n}\n\nfunction countNewlines(text: string): number {\n\tlet count = 0;\n\tfor (let index = text.indexOf(\"\\n\"); index !== -1; index = text.indexOf(\"\\n\", index + 1)) count++;\n\treturn count;\n}\n\n/** Each progress commit also buys a pause proportional to what it wrote. */\nexport const PROGRESS_BYTES_PER_SECOND = 100 * 1024;\n\n/**\n * Adaptive progress commits: the first change after an idle period commits at once; each commit then delays the next\n * by at least `minIntervalMs` and by its written size at 100 KiB/s. At most one commit is in flight; changes made\n * meanwhile coalesce into the next one.\n */\nexport class Progress {\n\treadonly #write: () => Promise<number>;\n\treadonly #onError: (error: unknown) => void;\n\treadonly #minIntervalMs: number;\n\t#waiters: PromiseWithResolvers<void>[] = [];\n\t#timer: ReturnType<typeof setTimeout> | undefined;\n\t#inFlight: Promise<void> | undefined;\n\t#nextAt = 0;\n\t#dirty = false;\n\t#stopped = false;\n\n\tconstructor(write: () => Promise<number>, onError: (error: unknown) => void, minIntervalMs: number) {\n\t\tthis.#write = write;\n\t\tthis.#onError = onError;\n\t\tthis.#minIntervalMs = minIntervalMs;\n\t}\n\n\t/** Schedule a commit. */\n\tmark(): void {\n\t\tthis.#dirty = true;\n\t\tthis.#schedule();\n\t}\n\n\t/** Schedule a commit; the promise settles with the commit that includes this change. */\n\tmarkAndWait(): Promise<void> {\n\t\tconst waiter = Promise.withResolvers<void>();\n\t\tthis.#waiters.push(waiter);\n\t\tthis.mark();\n\t\treturn waiter.promise;\n\t}\n\n\t/** Stop committing and wait for the commit in flight; returns the waiters the final commit must settle. */\n\tasync stop(): Promise<PromiseWithResolvers<void>[]> {\n\t\tthis.#stopped = true;\n\t\tclearTimeout(this.#timer);\n\t\tthis.#timer = undefined;\n\t\tawait this.#inFlight;\n\t\treturn this.#waiters.splice(0);\n\t}\n\n\t#schedule(): void {\n\t\tif (this.#stopped || this.#timer !== undefined || this.#inFlight !== undefined) return;\n\t\tconst wait = this.#nextAt - Date.now();\n\t\tif (wait <= 0) this.#flush();\n\t\telse\n\t\t\tthis.#timer = setTimeout(() => {\n\t\t\t\tthis.#timer = undefined;\n\t\t\t\tthis.#flush();\n\t\t\t}, wait);\n\t}\n\n\t#flush(): void {\n\t\tif (this.#stopped || !this.#dirty) return;\n\t\tthis.#dirty = false;\n\t\tconst waiters = this.#waiters.splice(0);\n\t\tconst started = Date.now();\n\t\tthis.#inFlight = this.#write()\n\t\t\t.then(\n\t\t\t\t(bytes) => {\n\t\t\t\t\tthis.#nextAt = started + Math.max(this.#minIntervalMs, (bytes * 1000) / PROGRESS_BYTES_PER_SECOND);\n\t\t\t\t\tfor (const waiter of waiters) waiter.resolve();\n\t\t\t\t},\n\t\t\t\t(error: unknown) => {\n\t\t\t\t\tthis.#nextAt = started + this.#minIntervalMs;\n\t\t\t\t\tfor (const waiter of waiters) waiter.reject(error);\n\t\t\t\t\tthis.#onError(error);\n\t\t\t\t},\n\t\t\t)\n\t\t\t.finally(() => {\n\t\t\t\tthis.#inFlight = undefined;\n\t\t\t\tif (this.#dirty) this.#schedule();\n\t\t\t});\n\t}\n}\n"]}

package/dist/publish.d.ts

@@ -0,0 +1,5 @@
+/** Runs `task` after everything enqueued before it. Tasks must not throw (report instead). */
+export declare function enqueue(task: () => void): void;
+/** Delivers nothing until `fn` returns, then everything it enqueued, in order. */
+export declare function holdPublications<T>(fn: () => T): T;
+//# sourceMappingURL=publish.d.ts.map

package/dist/publish.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"publish.d.ts","sourceRoot":"","sources":["../src/publish.ts"],"names":[],"mappings":"AAaA,8FAA8F;AAC9F,wBAAgB,OAAO,CAAC,IAAI,EAAE,MAAM,IAAI,GAAG,IAAI,CAG9C;AAED,kFAAkF;AAClF,wBAAgB,gBAAgB,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC,CAQlD"}

package/dist/publish.js

@@ -0,0 +1,40 @@
+// One FIFO queue for every observer notification (state events, shape pushes, registry tables, listener
+// invocations).
+//
+// Problem: notifying observers synchronously from inside a write lets a re-entrant write overtake the write being
+// published. Example: subscriber A reacts to n = 1 by writing n = 2; subscriber B then sees 2 before 1.
+// Solution: a publication first adopts every revision it makes (cells and derivations), then enqueues its
+// notifications. Notifications run in enqueue order, so every observer sees revisions in adoption order.
+// `holdPublications` defers delivery until a multi-step change (a reload commit) is complete.
+const queue = [];
+let held = 0;
+let draining = false;
+/** Runs `task` after everything enqueued before it. Tasks must not throw (report instead). */
+export function enqueue(task) {
+    queue.push(task);
+    drain();
+}
+/** Delivers nothing until `fn` returns, then everything it enqueued, in order. */
+export function holdPublications(fn) {
+    held++;
+    try {
+        return fn();
+    }
+    finally {
+        held--;
+        drain();
+    }
+}
+function drain() {
+    if (draining || held > 0)
+        return;
+    draining = true;
+    try {
+        for (let task = queue.shift(); task !== undefined; task = queue.shift())
+            task();
+    }
+    finally {
+        draining = false;
+    }
+}
+//# sourceMappingURL=publish.js.map

package/dist/publish.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"publish.js","sourceRoot":"","sources":["../src/publish.ts"],"names":[],"mappings":"AAAA,wGAAwG;AACxG,gBAAgB;AAChB,EAAE;AACF,kHAAkH;AAClH,wGAAwG;AACxG,0GAA0G;AAC1G,yGAAyG;AACzG,8FAA8F;AAE9F,MAAM,KAAK,GAAmB,EAAE,CAAC;AACjC,IAAI,IAAI,GAAG,CAAC,CAAC;AACb,IAAI,QAAQ,GAAG,KAAK,CAAC;AAErB,8FAA8F;AAC9F,MAAM,UAAU,OAAO,CAAC,IAAgB;IACvC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjB,KAAK,EAAE,CAAC;AACT,CAAC;AAED,kFAAkF;AAClF,MAAM,UAAU,gBAAgB,CAAI,EAAW;IAC9C,IAAI,EAAE,CAAC;IACP,IAAI,CAAC;QACJ,OAAO,EAAE,EAAE,CAAC;IACb,CAAC;YAAS,CAAC;QACV,IAAI,EAAE,CAAC;QACP,KAAK,EAAE,CAAC;IACT,CAAC;AACF,CAAC;AAED,SAAS,KAAK;IACb,IAAI,QAAQ,IAAI,IAAI,GAAG,CAAC;QAAE,OAAO;IACjC,QAAQ,GAAG,IAAI,CAAC;IAChB,IAAI,CAAC;QACJ,KAAK,IAAI,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,EAAE,IAAI,KAAK,SAAS,EAAE,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE;YAAE,IAAI,EAAE,CAAC;IACjF,CAAC;YAAS,CAAC;QACV,QAAQ,GAAG,KAAK,CAAC;IAClB,CAAC;AACF,CAAC","sourcesContent":["// One FIFO queue for every observer notification (state events, shape pushes, registry tables, listener\n// invocations).\n//\n// Problem: notifying observers synchronously from inside a write lets a re-entrant write overtake the write being\n// published. Example: subscriber A reacts to n = 1 by writing n = 2; subscriber B then sees 2 before 1.\n// Solution: a publication first adopts every revision it makes (cells and derivations), then enqueues its\n// notifications. Notifications run in enqueue order, so every observer sees revisions in adoption order.\n// `holdPublications` defers delivery until a multi-step change (a reload commit) is complete.\n\nconst queue: (() => void)[] = [];\nlet held = 0;\nlet draining = false;\n\n/** Runs `task` after everything enqueued before it. Tasks must not throw (report instead). */\nexport function enqueue(task: () => void): void {\n\tqueue.push(task);\n\tdrain();\n}\n\n/** Delivers nothing until `fn` returns, then everything it enqueued, in order. */\nexport function holdPublications<T>(fn: () => T): T {\n\theld++;\n\ttry {\n\t\treturn fn();\n\t} finally {\n\t\theld--;\n\t\tdrain();\n\t}\n}\n\nfunction drain(): void {\n\tif (draining || held > 0) return;\n\tdraining = true;\n\ttry {\n\t\tfor (let task = queue.shift(); task !== undefined; task = queue.shift()) task();\n\t} finally {\n\t\tdraining = false;\n\t}\n}\n"]}

package/dist/registry.d.ts

@@ -0,0 +1,25 @@
+import type { Ctx } from "./types.ts";
+export interface Registry<V> {
+    readonly name: string;
+    readonly conflict: "error" | "last";
+    /** Type carrier only; never set. */
+    readonly value?: V;
+}
+/** `conflict: "error"` rejects two objects registering one key; `"last"` keeps the later registration. */
+export declare const defineRegistry: <V>(name: string, options?: {
+    conflict?: "error" | "last";
+}) => Registry<V>;
+export type RegistryTable<V> = ReadonlyMap<string, V>;
+export interface RegistryView<V> {
+    /** Table of `ctx.codeVersion`, or of the current code version without ctx. */
+    table(ctx?: Ctx): RegistryTable<V>;
+    get(key: string, ctx?: Ctx): V | undefined;
+    /** Called with the current table immediately and whenever a new table is installed. */
+    subscribe(listener: (table: RegistryTable<V>, codeVersion: number) => void): () => void;
+}
+export interface Registration {
+    readonly registry: Registry<unknown>;
+    readonly key: string;
+    readonly value: unknown;
+}
+//# sourceMappingURL=registry.d.ts.map

package/dist/registry.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"registry.d.ts","sourceRoot":"","sources":["../src/registry.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,GAAG,EAAE,MAAM,YAAY,CAAC;AAEtC,MAAM,WAAW,QAAQ,CAAC,CAAC;IAC1B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,QAAQ,EAAE,OAAO,GAAG,MAAM,CAAC;IACpC,oCAAoC;IACpC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;CACnB;AAED,0GAA0G;AAC1G,eAAO,MAAM,cAAc,GAAI,CAAC,QAAQ,MAAM,YAAW;IAAE,QAAQ,CAAC,EAAE,OAAO,GAAG,MAAM,CAAA;CAAE,KAAQ,QAAQ,CAAC,CAAC,CAGxG,CAAC;AAEH,MAAM,MAAM,aAAa,CAAC,CAAC,IAAI,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;AAEtD,MAAM,WAAW,YAAY,CAAC,CAAC;IAC9B,8EAA8E;IAC9E,KAAK,CAAC,GAAG,CAAC,EAAE,GAAG,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;IACnC,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,GAAG,SAAS,CAAC;IAC3C,uFAAuF;IACvF,SAAS,CAAC,QAAQ,EAAE,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,MAAM,KAAK,IAAI,GAAG,MAAM,IAAI,CAAC;CACxF;AAED,MAAM,WAAW,YAAY;IAC5B,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,OAAO,CAAC,CAAC;IACrC,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC;IACrB,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC;CACxB"}

package/dist/registry.js

@@ -0,0 +1,6 @@
+/** `conflict: "error"` rejects two objects registering one key; `"last"` keeps the later registration. */
+export const defineRegistry = (name, options = {}) => ({
+    name,
+    conflict: options.conflict ?? "error",
+});
+//# sourceMappingURL=registry.js.map

package/dist/registry.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"registry.js","sourceRoot":"","sources":["../src/registry.ts"],"names":[],"mappings":"AASA,0GAA0G;AAC1G,MAAM,CAAC,MAAM,cAAc,GAAG,CAAI,IAAY,EAAE,OAAO,GAAoC,EAAE,EAAe,EAAE,CAAC,CAAC;IAC/G,IAAI;IACJ,QAAQ,EAAE,OAAO,CAAC,QAAQ,IAAI,OAAO;CACrC,CAAC,CAAC","sourcesContent":["import type { Ctx } from \"./types.ts\";\n\nexport interface Registry<V> {\n\treadonly name: string;\n\treadonly conflict: \"error\" | \"last\";\n\t/** Type carrier only; never set. */\n\treadonly value?: V;\n}\n\n/** `conflict: \"error\"` rejects two objects registering one key; `\"last\"` keeps the later registration. */\nexport const defineRegistry = <V>(name: string, options: { conflict?: \"error\" | \"last\" } = {}): Registry<V> => ({\n\tname,\n\tconflict: options.conflict ?? \"error\",\n});\n\nexport type RegistryTable<V> = ReadonlyMap<string, V>;\n\nexport interface RegistryView<V> {\n\t/** Table of `ctx.codeVersion`, or of the current code version without ctx. */\n\ttable(ctx?: Ctx): RegistryTable<V>;\n\tget(key: string, ctx?: Ctx): V | undefined;\n\t/** Called with the current table immediately and whenever a new table is installed. */\n\tsubscribe(listener: (table: RegistryTable<V>, codeVersion: number) => void): () => void;\n}\n\nexport interface Registration {\n\treadonly registry: Registry<unknown>;\n\treadonly key: string;\n\treadonly value: unknown;\n}\n"]}

package/dist/reload.d.ts

@@ -0,0 +1,126 @@
+import type { Cell } from "./cell.ts";
+import { ChordError } from "./errors.ts";
+import type { Facet, HostImpl, PluginRef } from "./host.ts";
+import { type ObjectImpl, type ResourceImpl, type Run, type Service, type StagedListeners } from "./object.ts";
+import type { RegistryTable } from "./registry.ts";
+export interface ReloadOptions {
+    /** Facet names to remove. */
+    readonly remove?: readonly string[];
+    /** Milliseconds the gate waits for grandfathered roots (default 5000). Missed: the reload aborts. */
+    readonly gateDeadline?: number;
+    /** Milliseconds to wait for the previous code version to retire first (default 5000). Missed: it is retired anyway. */
+    readonly retireDeadline?: number;
+    /** Server: facet modules for child hosts by host-name prefix (longest wins). Every connected host participates. */
+    readonly remote?: Readonly<Record<string, readonly string[]>>;
+    /** Server: facet names to remove on child hosts, by the same host-name prefix rules. */
+    readonly remoteRemove?: Readonly<Record<string, readonly string[]>>;
+    /** Server: milliseconds to wait for every child's vote (default: gate + retire deadlines + 5000). */
+    readonly voteDeadline?: number;
+}
+export interface ReloadReport {
+    readonly codeVersion: number;
+    readonly previous: number;
+    readonly changed: readonly string[];
+    readonly removed: readonly string[];
+    /** Addresses of objects whose new factory was installed. */
+    readonly prepared: readonly string[];
+    /** Addresses of objects that went through the gate. */
+    readonly gated: readonly string[];
+    /**
+     * Cluster reloads: what each participating child host prepared, by host name (its vote; the child commits it after
+     * the server). Absent for local reloads.
+     */
+    readonly children?: Readonly<Record<string, ReloadReport>>;
+}
+interface Candidate {
+    readonly object: ObjectImpl;
+    readonly service: Service;
+    readonly run: Run;
+    /** Why the object needs the gate (empty: compatible). */
+    readonly reasons: string[];
+    /** New exclusive resources and their new dependents, opened at the gate. */
+    readonly atGate: ResourceImpl[];
+    /** Old exclusive resources closed at the gate. */
+    readonly replaced: ResourceImpl[];
+    readonly migrated: Map<Cell<unknown>, unknown>;
+    /** Values of the run's derivations over the candidate (migrated) values, validated. */
+    derived: Map<unknown, unknown>;
+    /** Listener subscriptions made at the end of prepare, activated by the commit. */
+    staged: StagedListeners | undefined;
+}
+/** A reload error keeps the underlying code (`contract_mismatch`, `invalid`, ...) and says it aborted the reload. */
+export declare function reloadError(error: unknown): ChordError;
+/** Serialized: a second reload while one runs is rejected. */
+export declare function runReload(host: HostImpl, plugins: readonly PluginRef[], options: ReloadOptions): Promise<ReloadReport>;
+/** Takes the host's reload slot and loads the plugin modules. Pair with `endReload`. */
+export declare function beginReload(host: HostImpl, plugins: readonly PluginRef[], options: ReloadOptions, codeVersion?: number): Promise<Reload>;
+export declare function endReload(host: HostImpl): void;
+/** One reload on one host: `prepare` (load, prepare, gate), then `commit` or `rollback`. */
+export declare class Reload {
+    #private;
+    readonly host: HostImpl;
+    readonly facets: readonly Facet[];
+    readonly options: ReloadOptions;
+    /** Code version id to commit (issued by the coordinating server); a local reload allocates one. */
+    readonly codeVersion: number | undefined;
+    readonly candidates: Map<ObjectImpl, Candidate>;
+    readonly abort: AbortController;
+    readonly closed: [ObjectImpl, ResourceImpl][];
+    services: Map<string, Service>;
+    changed: Set<string>;
+    removed: Set<string>;
+    tables: Map<string, RegistryTable<unknown>>;
+    gated: Candidate[];
+    rolledBack: boolean;
+    /** Objects of types this reload adds, with their staged listeners: their runtime starts at commit. */
+    readonly deferred: Map<ObjectImpl, StagedListeners>;
+    /** This reload's run of each facet it loads (`FacetApi.signal`): installed at commit, aborted at rollback. */
+    readonly facetRuns: Map<string, AbortController>;
+    constructor(host: HostImpl, facets: readonly Facet[], options: ReloadOptions, codeVersion?: number);
+    /** Everything up to the commit. On failure the host is rolled back and the underlying error is thrown. */
+    prepare(): Promise<void>;
+    /** What a successful prepare will commit (a child sends it with its vote). */
+    summary(): ReloadReport;
+    /**
+     * Retires the previous code version before loading the next one (a host keeps two). Waits until its roots ended and,
+     * on a child host, its parent retired it too (`retire` frame), at most `retireDeadline`. Past the deadline it is
+     * retired anyway: its remaining roots are aborted first and get a short grace to stop, so they see cancellation
+     * before the resources only that code version used are closed; their next call is `superseded`.
+     */
+    waitForRetirement(): Promise<void>;
+    /** Builds the candidate service table: unchanged services plus everything the given facets serve. */
+    load(): void;
+    withDeadline<T>(promise: Promise<T>, what: string): Promise<T>;
+    /** Same contract version must cover the old description (forgotten bump); facets' `uses` must bind. */
+    checkProviders(): void;
+    /**
+     * Prepares every live object of a changed type, including objects that activate meanwhile, to a fixpoint. Objects
+     * already running the new code (types this reload adds) are skipped.
+     */
+    prepareAll(): Promise<void>;
+    /** Runs the new factory in recording mode and opens what can be opened without the gate. */
+    prepareObject(object: ObjectImpl): Promise<void>;
+    /**
+     * Every reference that survives into the new code version must bind to the new provider. Browser references don't block a
+     * reload: after the commit they get `upgrade_required` instead.
+     */
+    checkRefs(): void;
+    entries(): [ObjectImpl, Run["decls"]][];
+    /**
+     * Admission cut, wait for grandfathered roots (deadline), replace exclusive resources, migrate into private
+     * copies. Old tasks of gated objects are stopped at the cut; listener events are queued until commit or abort.
+     */
+    gate(): Promise<void>;
+    migrate(candidate: Candidate): void;
+    rollback(): Promise<void>;
+    /**
+     * Publishes the new code version in one synchronous step. Everything fallible ran in prepare (factories, opens,
+     * migration and derivation checks against the prospective schemas, listener subscriptions), so this only installs.
+     * Observers (state, shapes, registries, listener roots) are notified after the whole step. If an install still
+     * throws, the code version is half-published: the host fails terminally and admits no more work.
+     */
+    commit(beforeStart?: () => void): ReloadReport;
+    install(candidate: Candidate, codeVersion: number): void;
+}
+export {};
+//# sourceMappingURL=reload.d.ts.map

package/dist/reload.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"reload.d.ts","sourceRoot":"","sources":["../src/reload.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAEtC,OAAO,EAAgB,UAAU,EAAyB,MAAM,aAAa,CAAC;AAC9E,OAAO,KAAK,EAAoB,KAAK,EAAE,QAAQ,EAAE,SAAS,EAAS,MAAM,WAAW,CAAC;AACrF,OAAO,EAKN,KAAK,UAAU,EAEf,KAAK,YAAY,EACjB,KAAK,GAAG,EAER,KAAK,OAAO,EACZ,KAAK,eAAe,EACpB,MAAM,aAAa,CAAC;AAErB,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,eAAe,CAAC;AAInD,MAAM,WAAW,aAAa;IAC7B,6BAA6B;IAC7B,QAAQ,CAAC,MAAM,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC,qGAAqG;IACrG,QAAQ,CAAC,YAAY,CAAC,EAAE,MAAM,CAAC;IAC/B,uHAAuH;IACvH,QAAQ,CAAC,cAAc,CAAC,EAAE,MAAM,CAAC;IACjC,mHAAmH;IACnH,QAAQ,CAAC,MAAM,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,CAAC,CAAC;IAC9D,wFAAwF;IACxF,QAAQ,CAAC,YAAY,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,CAAC,CAAC;IACpE,qGAAqG;IACrG,QAAQ,CAAC,YAAY,CAAC,EAAE,MAAM,CAAC;CAC/B;AAED,MAAM,WAAW,YAAY;IAC5B,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;IAC1B,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC,4DAA4D;IAC5D,QAAQ,CAAC,QAAQ,EAAE,SAAS,MAAM,EAAE,CAAC;IACrC,uDAAuD;IACvD,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IAClC;;;OAGG;IACH,QAAQ,CAAC,QAAQ,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,YAAY,CAAC,CAAC,CAAC;CAC3D;AAED,UAAU,SAAS;IAClB,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAC;IAC5B,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAC1B,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAC;IAClB,yDAAyD;IACzD,QAAQ,CAAC,OAAO,EAAE,MAAM,EAAE,CAAC;IAC3B,4EAA4E;IAC5E,QAAQ,CAAC,MAAM,EAAE,YAAY,EAAE,CAAC;IAChC,kDAAkD;IAClD,QAAQ,CAAC,QAAQ,EAAE,YAAY,EAAE,CAAC;IAClC,QAAQ,CAAC,QAAQ,EAAE,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC;IAC/C,uFAAuF;IACvF,OAAO,EAAE,GAAG,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IAC/B,kFAAkF;IAClF,MAAM,EAAE,eAAe,GAAG,SAAS,CAAC;CACpC;AAsCD,qHAAqH;AACrH,wBAAgB,WAAW,CAAC,KAAK,EAAE,OAAO,GAAG,UAAU,CAQtD;AAED,8DAA8D;AAC9D,wBAAsB,SAAS,CAC9B,IAAI,EAAE,QAAQ,EACd,OAAO,EAAE,SAAS,SAAS,EAAE,EAC7B,OAAO,EAAE,aAAa,GACpB,OAAO,CAAC,YAAY,CAAC,CAQvB;AAED,wFAAwF;AACxF,wBAAsB,WAAW,CAChC,IAAI,EAAE,QAAQ,EACd,OAAO,EAAE,SAAS,SAAS,EAAE,EAC7B,OAAO,EAAE,aAAa,EACtB,WAAW,CAAC,EAAE,MAAM,GAClB,OAAO,CAAC,MAAM,CAAC,CAWjB;AAED,wBAAgB,SAAS,CAAC,IAAI,EAAE,QAAQ,GAAG,IAAI,CAE9C;AAsBD,4FAA4F;AAC5F,qBAAa,MAAM;;IAClB,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC;IACxB,QAAQ,CAAC,MAAM,EAAE,SAAS,KAAK,EAAE,CAAC;IAClC,QAAQ,CAAC,OAAO,EAAE,aAAa,CAAC;IAChC,mGAAmG;IACnG,QAAQ,CAAC,WAAW,EAAE,MAAM,GAAG,SAAS,CAAC;IACzC,QAAQ,CAAC,UAAU,6BAAoC;IACvD,QAAQ,CAAC,KAAK,kBAAyB;IACvC,QAAQ,CAAC,MAAM,EAAE,CAAC,UAAU,EAAE,YAAY,CAAC,EAAE,CAAM;IACnD,QAAQ,uBAA8B;IACtC,OAAO,cAAqB;IAC5B,OAAO,cAAqB;IAC5B,MAAM,sCAA6C;IACnD,KAAK,EAAE,SAAS,EAAE,CAAM;IACxB,UAAU,UAAS;IACnB,sGAAsG;IACtG,QAAQ,CAAC,QAAQ,mCAA0C;IAC3D,8GAA8G;IAC9G,QAAQ,CAAC,SAAS,+BAAsC;IAExD,YAAY,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,SAAS,KAAK,EAAE,EAAE,OAAO,EAAE,aAAa,EAAE,WAAW,CAAC,EAAE,MAAM,EAKjG;IAED,0GAA0G;IACpG,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC,CAmB7B;IAED,8EAA8E;IAC9E,OAAO,IAAI,YAAY,CAUtB;IAsBD;;;;;OAKG;IACG,iBAAiB,IAAI,OAAO,CAAC,IAAI,CAAC,CAWvC;IAED,qGAAqG;IACrG,IAAI,IAAI,IAAI,CAwBX;IAEK,YAAY,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAcnE;IAED,uGAAuG;IACvG,cAAc,IAAI,IAAI,CAuBrB;IAED;;;OAGG;IACG,UAAU,IAAI,OAAO,CAAC,IAAI,CAAC,CAmBhC;IAED,4FAA4F;IACtF,aAAa,CAAC,MAAM,EAAE,UAAU,GAAG,OAAO,CAAC,IAAI,CAAC,CAiDrD;IAED;;;OAGG;IACH,SAAS,IAAI,IAAI,CAgBhB;IAED,OAAO,IAAI,CAAC,UAAU,EAAE,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,CAKtC;IAED;;;OAGG;IACG,IAAI,IAAI,OAAO,CAAC,IAAI,CAAC,CA8C1B;IAED,OAAO,CAAC,SAAS,EAAE,SAAS,GAAG,IAAI,CAgBlC;IAEK,QAAQ,IAAI,OAAO,CAAC,IAAI,CAAC,CAoC9B;IAED;;;;;OAKG;IACH,MAAM,CAAC,WAAW,CAAC,EAAE,MAAM,IAAI,GAAG,YAAY,CAe7C;IA4ED,OAAO,CAAC,SAAS,EAAE,SAAS,EAAE,WAAW,EAAE,MAAM,GAAG,IAAI,CAgEvD;CACD"}