@norskvideo/moq-json 0.1.2 → 0.1.4

package/window/encoder.js

@@ -0,0 +1,183 @@
+/* @ts-self-types="./encoder.d.ts" */
+import { DEFAULT_MAX_FRAME_SIZE, Encoder as Flate } from "@norskvideo/moq-flate";
+import { Group } from "@norskvideo/moq-net";
+/** Frames (header included) in one group before a new group is forced, matching the Snapshot cap. */
+const MAX_GROUP_FRAMES = 256;
+/** Op ratio used when {@link ProducerConfig.opRatio} is left unset. */
+export const DEFAULT_OP_RATIO = 8;
+/**
+ * Encodes window edits into frame payloads, deciding where the group boundaries fall.
+ *
+ * The track-free core of {@link Producer}. It owns the retained window, so it can restate it
+ * whenever a group rolls; that restatement is the whole point of the mode, and is what an
+ * append-only log cannot do.
+ *
+ * @public
+ */
+export class Encoder {
+    #opRatio;
+    #compress;
+    // The retained window. Records are stored as encoded JSON text so a header restates exactly the
+    // bytes a push would have carried, and so re-encoding never re-visits the caller's value.
+    #window = [];
+    // Absolute index of #window[0]. Only a group header puts this on the wire.
+    #offset = 0;
+    #flate;
+    // Bytes of pushes and pops in this group, excluding its header frame.
+    #opBytes = 0;
+    // Reference size the op budget is measured against: this group's header frame.
+    #headerLen = 0;
+    #groupFrames = 0;
+    // Whether the next frame must be a header after a lost frame.
+    #resync = true;
+    // Whether the frame from the last push/pop is still unacknowledged.
+    #pending = false;
+    // Bumped per frame handed out, so a commit arriving after the encoder moved on cannot clear the
+    // flag belonging to a newer frame.
+    #generation = 0;
+    constructor(config = {}) {
+        this.#opRatio = config.opRatio ?? DEFAULT_OP_RATIO;
+        if (!Number.isSafeInteger(this.#opRatio) || this.#opRatio < 0 || this.#opRatio > 0xffffffff) {
+            throw new Error("opRatio must be an unsigned 32-bit integer");
+        }
+        this.#compress = config.compression ?? false;
+    }
+    /** The retained window, oldest first. */
+    get window() {
+        return this.#window.map((text) => JSON.parse(text));
+    }
+    /** Absolute index of the oldest retained record. */
+    get offset() {
+        return this.#offset;
+    }
+    /** Absolute index the next pushed record will take. */
+    get end() {
+        return this.#offset + this.#window.length;
+    }
+    /** Discard group-local state after an encoded frame did not reach the wire. */
+    #resyncGroup() {
+        this.#flate = undefined;
+        this.#opBytes = 0;
+        this.#headerLen = 0;
+        this.#groupFrames = 0;
+        this.#resync = true;
+        this.#pending = false;
+        this.#generation += 1;
+    }
+    /** Append one record to the back of the window. */
+    push(value) {
+        if (this.#pending)
+            this.#resyncGroup();
+        if (this.end >= Number.MAX_SAFE_INTEGER)
+            throw new Error("window index exceeds the safe integer range");
+        // Encode before touching the window, so a value that can't be serialized leaves the encoder
+        // exactly as it was.
+        const text = JSON.stringify(value);
+        if (text === undefined) {
+            throw new Error("record is not representable as JSON");
+        }
+        const edit = { push: text };
+        if (this.#resync || !this.#opAllowed()) {
+            return this.#emitHeader(this.#offset, [...this.#window, text], edit);
+        }
+        const payload = this.#emitOp(`{"push":${text}}`);
+        if (payload)
+            return this.#pendingFrame(payload, false, edit);
+        return this.#emitHeader(this.#offset, [...this.#window, text], edit);
+    }
+    /**
+     * Drop `count` records from the front of the window.
+     *
+     * Returns `undefined` when there is nothing to drop, so a caller can trim unconditionally.
+     * Clamped to what the window holds.
+     */
+    pop(count) {
+        if (!Number.isSafeInteger(count) || count < 0) {
+            throw new Error("pop count must be a nonnegative safe integer");
+        }
+        if (this.#pending)
+            this.#resyncGroup();
+        const dropped = Math.min(count, this.#window.length);
+        if (dropped <= 0)
+            return undefined;
+        const offset = this.#offset + dropped;
+        const edit = { pop: dropped };
+        if (this.#resync || !this.#opAllowed()) {
+            return this.#emitHeader(offset, this.#window.slice(dropped), edit);
+        }
+        const payload = this.#emitOp(`{"pop":${dropped}}`);
+        if (payload)
+            return this.#pendingFrame(payload, false, edit);
+        return this.#emitHeader(offset, this.#window.slice(dropped), edit);
+    }
+    /** Whether the pending edit may ride as an op in the open group. */
+    #opAllowed() {
+        return (this.#opRatio !== 0 &&
+            this.#groupFrames > 0 &&
+            this.#groupFrames < MAX_GROUP_FRAMES &&
+            this.#opBytes <= this.#opRatio * this.#headerLen);
+    }
+    /** Compress an already-serialized op into the open group, if its header remains cached. */
+    #emitOp(text) {
+        const bytes = new TextEncoder().encode(text);
+        if (bytes.length > DEFAULT_MAX_FRAME_SIZE) {
+            throw new Error("window frame exceeds the decoder's decompressed size limit");
+        }
+        const payload = this.#flate ? this.#flate.frame(bytes) : bytes;
+        this.#opBytes += payload.length;
+        this.#groupFrames += 1;
+        if (this.#headerLen + this.#opBytes > Group.MAX_GROUP_CACHE_BYTES) {
+            this.#resyncGroup();
+            return undefined;
+        }
+        return payload;
+    }
+    /** Emit the header restating the whole window and opening a new group. */
+    #emitHeader(offset, window, edit) {
+        // The records are already JSON text, so splice them in rather than re-encoding each one; the
+        // bytes a reader sees are then identical to what the matching push carried.
+        const text = `{"offset":${offset},"records":[${window.join(",")}]}`;
+        const bytes = new TextEncoder().encode(text);
+        if (bytes.length > DEFAULT_MAX_FRAME_SIZE) {
+            throw new Error("window header exceeds the decoder's decompressed size limit");
+        }
+        // A fresh per-group encoder (cold window), with the header as frame 0.
+        const flate = this.#compress ? new Flate() : undefined;
+        const payload = flate ? flate.frame(bytes) : bytes;
+        if (payload.length > Group.MAX_GROUP_CACHE_BYTES) {
+            throw new Error("window header exceeds the group cache limit");
+        }
+        this.#flate = flate;
+        this.#headerLen = payload.length;
+        this.#opBytes = 0;
+        this.#groupFrames = 1;
+        this.#resync = false;
+        return this.#pendingFrame(payload, true, edit);
+    }
+    #pendingFrame(payload, keyframe, edit) {
+        this.#pending = true;
+        const generation = ++this.#generation;
+        const encoder = this;
+        return {
+            payload,
+            keyframe,
+            commit() {
+                if (encoder.#generation !== generation || !encoder.#pending)
+                    return;
+                encoder.#commit(edit);
+                encoder.#pending = false;
+            },
+        };
+    }
+    /** Apply an edit after its encoded frame reached the wire. */
+    #commit(edit) {
+        if ("push" in edit) {
+            this.#window.push(edit.push);
+        }
+        else {
+            this.#window.splice(0, edit.pop);
+            this.#offset += edit.pop;
+        }
+    }
+}
+//# sourceMappingURL=encoder.js.map

package/window/encoder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"encoder.js","sourceRoot":"","sources":["../../src/window/encoder.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,sBAAsB,EAAE,OAAO,IAAI,KAAK,EAAE,MAAM,YAAY,CAAC;AACtE,OAAO,EAAE,KAAK,EAAE,MAAM,UAAU,CAAC;AAEjC,qGAAqG;AACrG,MAAM,gBAAgB,GAAG,GAAG,CAAC;AAE7B,uEAAuE;AACvE,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,CAAC;AAkDlC;;;;;;;;GAQG;AACH,MAAM,OAAO,OAAO;IACnB,QAAQ,CAAS;IACjB,SAAS,CAAU;IAEnB,gGAAgG;IAChG,0FAA0F;IAC1F,OAAO,GAAa,EAAE,CAAC;IACvB,2EAA2E;IAC3E,OAAO,GAAG,CAAC,CAAC;IAEZ,MAAM,CAAS;IACf,sEAAsE;IACtE,QAAQ,GAAG,CAAC,CAAC;IACb,+EAA+E;IAC/E,UAAU,GAAG,CAAC,CAAC;IACf,YAAY,GAAG,CAAC,CAAC;IACjB,8DAA8D;IAC9D,OAAO,GAAG,IAAI,CAAC;IACf,oEAAoE;IACpE,QAAQ,GAAG,KAAK,CAAC;IACjB,gGAAgG;IAChG,mCAAmC;IACnC,WAAW,GAAG,CAAC,CAAC;IAEhB,YAAY,MAAM,GAAmB,EAAE;QACtC,IAAI,CAAC,QAAQ,GAAG,MAAM,CAAC,OAAO,IAAI,gBAAgB,CAAC;QACnD,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC,QAAQ,GAAG,CAAC,IAAI,IAAI,CAAC,QAAQ,GAAG,UAAU,EAAE,CAAC;YAC7F,MAAM,IAAI,KAAK,CAAC,4CAA4C,CAAC,CAAC;QAC/D,CAAC;QACD,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,WAAW,IAAI,KAAK,CAAC;IAC9C,CAAC;IAED,yCAAyC;IACzC,IAAI,MAAM;QACT,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAM,CAAC,CAAC;IAC1D,CAAC;IAED,oDAAoD;IACpD,IAAI,MAAM;QACT,OAAO,IAAI,CAAC,OAAO,CAAC;IACrB,CAAC;IAED,uDAAuD;IACvD,IAAI,GAAG;QACN,OAAO,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;IAC3C,CAAC;IAED,+EAA+E;IAC/E,YAAY;QACX,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;QACxB,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;QAClB,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC;QACpB,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;QACpB,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;QACtB,IAAI,CAAC,WAAW,IAAI,CAAC,CAAC;IACvB,CAAC;IAED,mDAAmD;IACnD,IAAI,CAAC,KAAQ;QACZ,IAAI,IAAI,CAAC,QAAQ;YAAE,IAAI,CAAC,YAAY,EAAE,CAAC;QACvC,IAAI,IAAI,CAAC,GAAG,IAAI,MAAM,CAAC,gBAAgB;YAAE,MAAM,IAAI,KAAK,CAAC,6CAA6C,CAAC,CAAC;QAExG,4FAA4F;QAC5F,qBAAqB;QACrB,MAAM,IAAI,GAAuB,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QACvD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACxB,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAC;QACxD,CAAC;QAED,MAAM,IAAI,GAAS,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;QAClC,IAAI,IAAI,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,EAAE,CAAC;YACxC,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;QACtE,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,IAAI,GAAG,CAAC,CAAC;QACjD,IAAI,OAAO;YAAE,OAAO,IAAI,CAAC,aAAa,CAAC,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;QAC7D,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;IACtE,CAAC;IAED;;;;;OAKG;IACH,GAAG,CAAC,KAAa;QAChB,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YAC/C,MAAM,IAAI,KAAK,CAAC,8CAA8C,CAAC,CAAC;QACjE,CAAC;QACD,IAAI,IAAI,CAAC,QAAQ;YAAE,IAAI,CAAC,YAAY,EAAE,CAAC;QAEvC,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QACrD,IAAI,OAAO,IAAI,CAAC;YAAE,OAAO,SAAS,CAAC;QAEnC,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACtC,MAAM,IAAI,GAAS,EAAE,GAAG,EAAE,OAAO,EAAE,CAAC;QACpC,IAAI,IAAI,CAAC,OAAO,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,EAAE,CAAC;YACxC,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,IAAI,CAAC,CAAC;QACpE,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,OAAO,GAAG,CAAC,CAAC;QACnD,IAAI,OAAO;YAAE,OAAO,IAAI,CAAC,aAAa,CAAC,OAAO,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;QAC7D,OAAO,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,IAAI,CAAC,CAAC;IACpE,CAAC;IAED,oEAAoE;IACpE,UAAU;QACT,OAAO,CACN,IAAI,CAAC,QAAQ,KAAK,CAAC;YACnB,IAAI,CAAC,YAAY,GAAG,CAAC;YACrB,IAAI,CAAC,YAAY,GAAG,gBAAgB;YACpC,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,UAAU,CAChD,CAAC;IACH,CAAC;IAED,2FAA2F;IAC3F,OAAO,CAAC,IAAY;QACnB,MAAM,KAAK,GAAG,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC7C,IAAI,KAAK,CAAC,MAAM,GAAG,sBAAsB,EAAE,CAAC;YAC3C,MAAM,IAAI,KAAK,CAAC,4DAA4D,CAAC,CAAC;QAC/E,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QAE/D,IAAI,CAAC,QAAQ,IAAI,OAAO,CAAC,MAAM,CAAC;QAChC,IAAI,CAAC,YAAY,IAAI,CAAC,CAAC;QACvB,IAAI,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,qBAAqB,EAAE,CAAC;YACnE,IAAI,CAAC,YAAY,EAAE,CAAC;YACpB,OAAO,SAAS,CAAC;QAClB,CAAC;QAED,OAAO,OAAO,CAAC;IAChB,CAAC;IAED,0EAA0E;IAC1E,WAAW,CAAC,MAAc,EAAE,MAAgB,EAAE,IAAU;QACvD,6FAA6F;QAC7F,4EAA4E;QAC5E,MAAM,IAAI,GAAG,aAAa,MAAM,eAAe,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;QACpE,MAAM,KAAK,GAAG,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC7C,IAAI,KAAK,CAAC,MAAM,GAAG,sBAAsB,EAAE,CAAC;YAC3C,MAAM,IAAI,KAAK,CAAC,6DAA6D,CAAC,CAAC;QAChF,CAAC;QAED,uEAAuE;QACvE,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;QACvD,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QACnD,IAAI,OAAO,CAAC,MAAM,GAAG,KAAK,CAAC,qBAAqB,EAAE,CAAC;YAClD,MAAM,IAAI,KAAK,CAAC,6CAA6C,CAAC,CAAC;QAChE,CAAC;QAED,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,UAAU,GAAG,OAAO,CAAC,MAAM,CAAC;QACjC,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;QAClB,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC;QAErB,OAAO,IAAI,CAAC,aAAa,CAAC,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;IAChD,CAAC;IAED,aAAa,CAAC,OAAmB,EAAE,QAAiB,EAAE,IAAU;QAC/D,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACrB,MAAM,UAAU,GAAG,EAAE,IAAI,CAAC,WAAW,CAAC;QACtC,MAAM,OAAO,GAAG,IAAI,CAAC;QAErB,OAAO;YACN,OAAO;YACP,QAAQ;YACR,MAAM;gBACL,IAAI,OAAO,CAAC,WAAW,KAAK,UAAU,IAAI,CAAC,OAAO,CAAC,QAAQ;oBAAE,OAAO;gBACpE,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBACtB,OAAO,CAAC,QAAQ,GAAG,KAAK,CAAC;YAC1B,CAAC;SACD,CAAC;IACH,CAAC;IAED,8DAA8D;IAC9D,OAAO,CAAC,IAAU;QACjB,IAAI,MAAM,IAAI,IAAI,EAAE,CAAC;YACpB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,CAAC;aAAM,CAAC;YACP,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;YACjC,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,GAAG,CAAC;QAC1B,CAAC;IACF,CAAC;CACD","sourcesContent":["import { DEFAULT_MAX_FRAME_SIZE, Encoder as Flate } from \"@moq/flate\";\nimport { Group } from \"@moq/net\";\n\n/** Frames (header included) in one group before a new group is forced, matching the Snapshot cap. */\nconst MAX_GROUP_FRAMES = 256;\n\n/** Op ratio used when {@link ProducerConfig.opRatio} is left unset. */\nexport const DEFAULT_OP_RATIO = 8;\n\ntype Edit = { push: string } | { pop: number };\n\n/** Options shared by an {@link Encoder} and the {@link Producer} that wraps one. */\nexport interface ProducerConfig {\n\t/**\n\t * How much the ops in a group may cost before a fresh group is emitted.\n\t *\n\t * A new group opens once the pushes and pops *already written* exceed `opRatio` times the size of\n\t * the group's header frame. The pending op is excluded, so the one that tips the group over budget\n\t * still lands. `0` disables ops entirely, so every edit is its own single-frame group.\n\t *\n\t * The window's counterpart to Snapshot's `deltaRatio`. Defaults to `8`.\n\t */\n\topRatio?: number;\n\n\t/**\n\t * Compress each group as one sync-flushed `deflate-raw` stream, so every op reuses the header and\n\t * the ops before it as context. A {@link Decoder} reading the frames must set the same flag.\n\t * Defaults to `false`.\n\t */\n\tcompression?: boolean;\n}\n\n/** One encoded frame, and the group boundary it implies. */\nexport interface Encoded {\n\t/** The frame payload. */\n\tpayload: Uint8Array;\n\n\t/**\n\t * Whether this frame is a group header, which must open a new group.\n\t *\n\t * The encoder decides this, never the caller: the op budget and the frame cap force a new group\n\t * independently of which edit was requested.\n\t */\n\tkeyframe: boolean;\n}\n\n/**\n * An encoded frame the caller has not yet acknowledged writing.\n *\n * Write the frame, then {@link commit}. The edit is staged until commit, so leaving the frame\n * uncommitted keeps the window unchanged and makes the next frame open a new group.\n */\nexport interface Pending extends Encoded {\n\t/** Acknowledge that the frame reached the wire, applying its edit to the retained window. */\n\tcommit(): void;\n}\n\n/**\n * Encodes window edits into frame payloads, deciding where the group boundaries fall.\n *\n * The track-free core of {@link Producer}. It owns the retained window, so it can restate it\n * whenever a group rolls; that restatement is the whole point of the mode, and is what an\n * append-only log cannot do.\n *\n * @public\n */\nexport class Encoder<T> {\n\t#opRatio: number;\n\t#compress: boolean;\n\n\t// The retained window. Records are stored as encoded JSON text so a header restates exactly the\n\t// bytes a push would have carried, and so re-encoding never re-visits the caller's value.\n\t#window: string[] = [];\n\t// Absolute index of #window[0]. Only a group header puts this on the wire.\n\t#offset = 0;\n\n\t#flate?: Flate;\n\t// Bytes of pushes and pops in this group, excluding its header frame.\n\t#opBytes = 0;\n\t// Reference size the op budget is measured against: this group's header frame.\n\t#headerLen = 0;\n\t#groupFrames = 0;\n\t// Whether the next frame must be a header after a lost frame.\n\t#resync = true;\n\t// Whether the frame from the last push/pop is still unacknowledged.\n\t#pending = false;\n\t// Bumped per frame handed out, so a commit arriving after the encoder moved on cannot clear the\n\t// flag belonging to a newer frame.\n\t#generation = 0;\n\n\tconstructor(config: ProducerConfig = {}) {\n\t\tthis.#opRatio = config.opRatio ?? DEFAULT_OP_RATIO;\n\t\tif (!Number.isSafeInteger(this.#opRatio) || this.#opRatio < 0 || this.#opRatio > 0xffffffff) {\n\t\t\tthrow new Error(\"opRatio must be an unsigned 32-bit integer\");\n\t\t}\n\t\tthis.#compress = config.compression ?? false;\n\t}\n\n\t/** The retained window, oldest first. */\n\tget window(): T[] {\n\t\treturn this.#window.map((text) => JSON.parse(text) as T);\n\t}\n\n\t/** Absolute index of the oldest retained record. */\n\tget offset(): number {\n\t\treturn this.#offset;\n\t}\n\n\t/** Absolute index the next pushed record will take. */\n\tget end(): number {\n\t\treturn this.#offset + this.#window.length;\n\t}\n\n\t/** Discard group-local state after an encoded frame did not reach the wire. */\n\t#resyncGroup(): void {\n\t\tthis.#flate = undefined;\n\t\tthis.#opBytes = 0;\n\t\tthis.#headerLen = 0;\n\t\tthis.#groupFrames = 0;\n\t\tthis.#resync = true;\n\t\tthis.#pending = false;\n\t\tthis.#generation += 1;\n\t}\n\n\t/** Append one record to the back of the window. */\n\tpush(value: T): Pending {\n\t\tif (this.#pending) this.#resyncGroup();\n\t\tif (this.end >= Number.MAX_SAFE_INTEGER) throw new Error(\"window index exceeds the safe integer range\");\n\n\t\t// Encode before touching the window, so a value that can't be serialized leaves the encoder\n\t\t// exactly as it was.\n\t\tconst text: string | undefined = JSON.stringify(value);\n\t\tif (text === undefined) {\n\t\t\tthrow new Error(\"record is not representable as JSON\");\n\t\t}\n\n\t\tconst edit: Edit = { push: text };\n\t\tif (this.#resync || !this.#opAllowed()) {\n\t\t\treturn this.#emitHeader(this.#offset, [...this.#window, text], edit);\n\t\t}\n\n\t\tconst payload = this.#emitOp(`{\"push\":${text}}`);\n\t\tif (payload) return this.#pendingFrame(payload, false, edit);\n\t\treturn this.#emitHeader(this.#offset, [...this.#window, text], edit);\n\t}\n\n\t/**\n\t * Drop `count` records from the front of the window.\n\t *\n\t * Returns `undefined` when there is nothing to drop, so a caller can trim unconditionally.\n\t * Clamped to what the window holds.\n\t */\n\tpop(count: number): Pending | undefined {\n\t\tif (!Number.isSafeInteger(count) || count < 0) {\n\t\t\tthrow new Error(\"pop count must be a nonnegative safe integer\");\n\t\t}\n\t\tif (this.#pending) this.#resyncGroup();\n\n\t\tconst dropped = Math.min(count, this.#window.length);\n\t\tif (dropped <= 0) return undefined;\n\n\t\tconst offset = this.#offset + dropped;\n\t\tconst edit: Edit = { pop: dropped };\n\t\tif (this.#resync || !this.#opAllowed()) {\n\t\t\treturn this.#emitHeader(offset, this.#window.slice(dropped), edit);\n\t\t}\n\n\t\tconst payload = this.#emitOp(`{\"pop\":${dropped}}`);\n\t\tif (payload) return this.#pendingFrame(payload, false, edit);\n\t\treturn this.#emitHeader(offset, this.#window.slice(dropped), edit);\n\t}\n\n\t/** Whether the pending edit may ride as an op in the open group. */\n\t#opAllowed(): boolean {\n\t\treturn (\n\t\t\tthis.#opRatio !== 0 &&\n\t\t\tthis.#groupFrames > 0 &&\n\t\t\tthis.#groupFrames < MAX_GROUP_FRAMES &&\n\t\t\tthis.#opBytes <= this.#opRatio * this.#headerLen\n\t\t);\n\t}\n\n\t/** Compress an already-serialized op into the open group, if its header remains cached. */\n\t#emitOp(text: string): Uint8Array | undefined {\n\t\tconst bytes = new TextEncoder().encode(text);\n\t\tif (bytes.length > DEFAULT_MAX_FRAME_SIZE) {\n\t\t\tthrow new Error(\"window frame exceeds the decoder's decompressed size limit\");\n\t\t}\n\t\tconst payload = this.#flate ? this.#flate.frame(bytes) : bytes;\n\n\t\tthis.#opBytes += payload.length;\n\t\tthis.#groupFrames += 1;\n\t\tif (this.#headerLen + this.#opBytes > Group.MAX_GROUP_CACHE_BYTES) {\n\t\t\tthis.#resyncGroup();\n\t\t\treturn undefined;\n\t\t}\n\n\t\treturn payload;\n\t}\n\n\t/** Emit the header restating the whole window and opening a new group. */\n\t#emitHeader(offset: number, window: string[], edit: Edit): Pending {\n\t\t// The records are already JSON text, so splice them in rather than re-encoding each one; the\n\t\t// bytes a reader sees are then identical to what the matching push carried.\n\t\tconst text = `{\"offset\":${offset},\"records\":[${window.join(\",\")}]}`;\n\t\tconst bytes = new TextEncoder().encode(text);\n\t\tif (bytes.length > DEFAULT_MAX_FRAME_SIZE) {\n\t\t\tthrow new Error(\"window header exceeds the decoder's decompressed size limit\");\n\t\t}\n\n\t\t// A fresh per-group encoder (cold window), with the header as frame 0.\n\t\tconst flate = this.#compress ? new Flate() : undefined;\n\t\tconst payload = flate ? flate.frame(bytes) : bytes;\n\t\tif (payload.length > Group.MAX_GROUP_CACHE_BYTES) {\n\t\t\tthrow new Error(\"window header exceeds the group cache limit\");\n\t\t}\n\n\t\tthis.#flate = flate;\n\t\tthis.#headerLen = payload.length;\n\t\tthis.#opBytes = 0;\n\t\tthis.#groupFrames = 1;\n\t\tthis.#resync = false;\n\n\t\treturn this.#pendingFrame(payload, true, edit);\n\t}\n\n\t#pendingFrame(payload: Uint8Array, keyframe: boolean, edit: Edit): Pending {\n\t\tthis.#pending = true;\n\t\tconst generation = ++this.#generation;\n\t\tconst encoder = this;\n\n\t\treturn {\n\t\t\tpayload,\n\t\t\tkeyframe,\n\t\t\tcommit() {\n\t\t\t\tif (encoder.#generation !== generation || !encoder.#pending) return;\n\t\t\t\tencoder.#commit(edit);\n\t\t\t\tencoder.#pending = false;\n\t\t\t},\n\t\t};\n\t}\n\n\t/** Apply an edit after its encoded frame reached the wire. */\n\t#commit(edit: Edit): void {\n\t\tif (\"push\" in edit) {\n\t\t\tthis.#window.push(edit.push);\n\t\t} else {\n\t\t\tthis.#window.splice(0, edit.pop);\n\t\t\tthis.#offset += edit.pop;\n\t\t}\n\t}\n}\n"]}

package/window/index.d.ts

@@ -0,0 +1,39 @@
+/**
+ * Sliding-window JSON publishing over MoQ tracks.
+ *
+ * A window is an ordered run of records the publisher appends to the back of and drops from the
+ * front of. Unlike the `Stream` module, which preserves a log forever in one group, and `Snapshot`,
+ * which keeps only the latest value, a window keeps a bounded stretch of records and lets a reader
+ * join it at any point. Interoperable on the wire with the Rust `moq_json::window`.
+ *
+ * The obvious alternative is an append-only log that rolls its group and re-seeds the new one with
+ * the records it still holds. That breaks the reader: re-seeded records are indistinguishable from
+ * new ones, so a reader that was keeping up receives them twice. This mode exists to make the
+ * restatement explicit, so a reader can tell "you already have these" from "here is another one".
+ *
+ * The first frame of every group names the retained `records` and the absolute `offset` of the
+ * first. Later frames are tagged `push` and `pop` ops. A push takes the next index and a pop drops
+ * from the front, both positional against the group header.
+ * Indices stop at `Number.MAX_SAFE_INTEGER`, matching the Rust implementation's wire domain.
+ * Trimming is therefore an op, not a group boundary, so dropping a record costs one small frame
+ * inside the shared compression window instead of a roll that would throw that window away.
+ *
+ * The publisher rolls a group when the ops in it outgrow {@link ProducerConfig.opRatio} times the
+ * header that opened it. That is purely a compression decision: there is no caller-driven cut and no
+ * age bound, and a {@link Consumer} never surfaces it.
+ *
+ * A reader gets a `push` event when a record arrives, `pop` when a contiguous span leaves, and
+ * `skip` when a span was dropped before this reader saw it. A reader that keeps up sees pushes and
+ * pops; one that falls a group behind learns from the header's offset which records it will never
+ * get rather than silently missing them.
+ *
+ * {@link Producer} and {@link Consumer} own a track. {@link Encoder} and {@link Decoder} are the
+ * same logic without it, for when something else is already in charge of the track.
+ *
+ * @module
+ */
+export { Consumer } from "./consumer";
+export { type ConsumerConfig, Decoder, type Event, type Group, type Span } from "./decoder";
+export { type Encoded, Encoder, type Pending, type ProducerConfig } from "./encoder";
+export { Producer } from "./producer";
+//# sourceMappingURL=index.d.ts.map

package/window/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/window/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiCG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AACzC,OAAO,EAAE,KAAK,cAAc,EAAE,OAAO,EAAE,KAAK,KAAK,EAAE,KAAK,KAAK,EAAE,KAAK,IAAI,EAAE,MAAM,cAAc,CAAC;AAC/F,OAAO,EAAE,KAAK,OAAO,EAAE,OAAO,EAAE,KAAK,OAAO,EAAE,KAAK,cAAc,EAAE,MAAM,cAAc,CAAC;AACxF,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC"}

package/window/index.js

@@ -0,0 +1,40 @@
+/* @ts-self-types="./index.d.ts" */
+/**
+ * Sliding-window JSON publishing over MoQ tracks.
+ *
+ * A window is an ordered run of records the publisher appends to the back of and drops from the
+ * front of. Unlike the `Stream` module, which preserves a log forever in one group, and `Snapshot`,
+ * which keeps only the latest value, a window keeps a bounded stretch of records and lets a reader
+ * join it at any point. Interoperable on the wire with the Rust `moq_json::window`.
+ *
+ * The obvious alternative is an append-only log that rolls its group and re-seeds the new one with
+ * the records it still holds. That breaks the reader: re-seeded records are indistinguishable from
+ * new ones, so a reader that was keeping up receives them twice. This mode exists to make the
+ * restatement explicit, so a reader can tell "you already have these" from "here is another one".
+ *
+ * The first frame of every group names the retained `records` and the absolute `offset` of the
+ * first. Later frames are tagged `push` and `pop` ops. A push takes the next index and a pop drops
+ * from the front, both positional against the group header.
+ * Indices stop at `Number.MAX_SAFE_INTEGER`, matching the Rust implementation's wire domain.
+ * Trimming is therefore an op, not a group boundary, so dropping a record costs one small frame
+ * inside the shared compression window instead of a roll that would throw that window away.
+ *
+ * The publisher rolls a group when the ops in it outgrow {@link ProducerConfig.opRatio} times the
+ * header that opened it. That is purely a compression decision: there is no caller-driven cut and no
+ * age bound, and a {@link Consumer} never surfaces it.
+ *
+ * A reader gets a `push` event when a record arrives, `pop` when a contiguous span leaves, and
+ * `skip` when a span was dropped before this reader saw it. A reader that keeps up sees pushes and
+ * pops; one that falls a group behind learns from the header's offset which records it will never
+ * get rather than silently missing them.
+ *
+ * {@link Producer} and {@link Consumer} own a track. {@link Encoder} and {@link Decoder} are the
+ * same logic without it, for when something else is already in charge of the track.
+ *
+ * @module
+ */
+export { Consumer } from "./consumer.js";
+export { Decoder } from "./decoder.js";
+export { Encoder } from "./encoder.js";
+export { Producer } from "./producer.js";
+//# sourceMappingURL=index.js.map

package/window/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/window/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiCG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AACzC,OAAO,EAAuB,OAAO,EAAqC,MAAM,cAAc,CAAC;AAC/F,OAAO,EAAgB,OAAO,EAAqC,MAAM,cAAc,CAAC;AACxF,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC","sourcesContent":["/**\n * Sliding-window JSON publishing over MoQ tracks.\n *\n * A window is an ordered run of records the publisher appends to the back of and drops from the\n * front of. Unlike the `Stream` module, which preserves a log forever in one group, and `Snapshot`,\n * which keeps only the latest value, a window keeps a bounded stretch of records and lets a reader\n * join it at any point. Interoperable on the wire with the Rust `moq_json::window`.\n *\n * The obvious alternative is an append-only log that rolls its group and re-seeds the new one with\n * the records it still holds. That breaks the reader: re-seeded records are indistinguishable from\n * new ones, so a reader that was keeping up receives them twice. This mode exists to make the\n * restatement explicit, so a reader can tell \"you already have these\" from \"here is another one\".\n *\n * The first frame of every group names the retained `records` and the absolute `offset` of the\n * first. Later frames are tagged `push` and `pop` ops. A push takes the next index and a pop drops\n * from the front, both positional against the group header.\n * Indices stop at `Number.MAX_SAFE_INTEGER`, matching the Rust implementation's wire domain.\n * Trimming is therefore an op, not a group boundary, so dropping a record costs one small frame\n * inside the shared compression window instead of a roll that would throw that window away.\n *\n * The publisher rolls a group when the ops in it outgrow {@link ProducerConfig.opRatio} times the\n * header that opened it. That is purely a compression decision: there is no caller-driven cut and no\n * age bound, and a {@link Consumer} never surfaces it.\n *\n * A reader gets a `push` event when a record arrives, `pop` when a contiguous span leaves, and\n * `skip` when a span was dropped before this reader saw it. A reader that keeps up sees pushes and\n * pops; one that falls a group behind learns from the header's offset which records it will never\n * get rather than silently missing them.\n *\n * {@link Producer} and {@link Consumer} own a track. {@link Encoder} and {@link Decoder} are the\n * same logic without it, for when something else is already in charge of the track.\n *\n * @module\n */\n\nexport { Consumer } from \"./consumer.ts\";\nexport { type ConsumerConfig, Decoder, type Event, type Group, type Span } from \"./decoder.ts\";\nexport { type Encoded, Encoder, type Pending, type ProducerConfig } from \"./encoder.ts\";\nexport { Producer } from \"./producer.ts\";\n"]}

package/window/producer.d.ts

@@ -0,0 +1,32 @@
+import type * as Moq from "@norskvideo/moq-net";
+import { type ProducerConfig } from "./encoder";
+/**
+ * Publishes a sliding window of JSON records to a track.
+ *
+ * An {@link Encoder} that owns its track: it writes each encoded frame and rolls a group whenever
+ * the encoder emits a header. When something else already owns the track, use the {@link Encoder}
+ * directly.
+ *
+ * @public
+ */
+export declare class Producer<T> {
+    #private;
+    /** Wrap a track to publish a window into it. */
+    constructor(track: Moq.Track.Producer, config?: ProducerConfig);
+    /** The retained window, oldest first. */
+    get window(): T[];
+    /** Absolute index of the oldest retained record. */
+    get offset(): number;
+    /** Append one record to the back of the window. */
+    push(value: T): void;
+    /**
+     * Drop `count` records from the front of the window.
+     *
+     * A no-op when the window is already empty, and clamped to what it holds, so a caller can trim
+     * unconditionally.
+     */
+    pop(count: number): void;
+    /** Finish the track, closing any open group. */
+    finish(): void;
+}
+//# sourceMappingURL=producer.d.ts.map

package/window/producer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"producer.d.ts","sourceRoot":"","sources":["../../src/window/producer.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,KAAK,GAAG,MAAM,UAAU,CAAC;AAGrC,OAAO,EAAyB,KAAK,cAAc,EAAE,MAAM,cAAc,CAAC;AAE1E;;;;;;;;GAQG;AACH,qBAAa,QAAQ,CAAC,CAAC;;IAQtB,gDAAgD;IAChD,YAAY,KAAK,EAAE,GAAG,CAAC,KAAK,CAAC,QAAQ,EAAE,MAAM,GAAE,cAAmB,EAGjE;IAED,yCAAyC;IACzC,IAAI,MAAM,IAAI,CAAC,EAAE,CAEhB;IAED,oDAAoD;IACpD,IAAI,MAAM,IAAI,MAAM,CAEnB;IAED,mDAAmD;IACnD,IAAI,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,CAGnB;IAED;;;;;OAKG;IACH,GAAG,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,CAIvB;IAmCD,gDAAgD;IAChD,MAAM,IAAI,IAAI,CAQb;CACD"}

package/window/producer.js

@@ -0,0 +1,90 @@
+/* @ts-self-types="./producer.d.ts" */
+import { Time } from "@norskvideo/moq-net";
+import { Encoder } from "./encoder.js";
+/**
+ * Publishes a sliding window of JSON records to a track.
+ *
+ * An {@link Encoder} that owns its track: it writes each encoded frame and rolls a group whenever
+ * the encoder emits a header. When something else already owns the track, use the {@link Encoder}
+ * directly.
+ *
+ * @public
+ */
+export class Producer {
+    #track;
+    #encoder;
+    #finished = false;
+    // The group an op would be appended to, open after a header.
+    #group;
+    /** Wrap a track to publish a window into it. */
+    constructor(track, config = {}) {
+        this.#track = track;
+        this.#encoder = new Encoder(config);
+    }
+    /** The retained window, oldest first. */
+    get window() {
+        return this.#encoder.window;
+    }
+    /** Absolute index of the oldest retained record. */
+    get offset() {
+        return this.#encoder.offset;
+    }
+    /** Append one record to the back of the window. */
+    push(value) {
+        this.#assertOpen();
+        this.#write(this.#encoder.push(value));
+    }
+    /**
+     * Drop `count` records from the front of the window.
+     *
+     * A no-op when the window is already empty, and clamped to what it holds, so a caller can trim
+     * unconditionally.
+     */
+    pop(count) {
+        this.#assertOpen();
+        const frame = this.#encoder.pop(count);
+        if (frame)
+            this.#write(frame);
+    }
+    #assertOpen() {
+        if (this.#finished)
+            throw new Error("track is closed");
+    }
+    #write(encoded) {
+        // A throw leaves the edit uncommitted and the retained window unchanged. The next edit opens a
+        // new group because the attempted frame advanced the group-local compression state.
+        if (encoded.keyframe) {
+            // The previous group is complete; no more frames will be appended to it. Drop the handle
+            // before opening the next one, so a failure below doesn't leave a closed group behind.
+            this.#group?.close();
+            this.#group = undefined;
+            const group = this.#track.appendGroup();
+            try {
+                group.writeFrame({ payload: encoded.payload, timestamp: Time.Timestamp.now() });
+            }
+            catch (err) {
+                // The group carries no frames, so close it rather than leaving it open on the track. A
+                // consumer that already advanced into it would otherwise block with nothing to read.
+                group.close();
+                throw err;
+            }
+            this.#group = group;
+            encoded.commit();
+            return;
+        }
+        if (!this.#group)
+            throw new Error("op with no open group");
+        this.#group.writeFrame({ payload: encoded.payload, timestamp: Time.Timestamp.now() });
+        encoded.commit();
+    }
+    /** Finish the track, closing any open group. */
+    finish() {
+        if (this.#finished)
+            return;
+        this.#finished = true;
+        this.#group?.close();
+        this.#group = undefined;
+        this.#track.close();
+    }
+}
+//# sourceMappingURL=producer.js.map

package/window/producer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"producer.js","sourceRoot":"","sources":["../../src/window/producer.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,MAAM,UAAU,CAAC;AAEhC,OAAO,EAAgB,OAAO,EAAuB,MAAM,cAAc,CAAC;AAE1E;;;;;;;;GAQG;AACH,MAAM,OAAO,QAAQ;IACpB,MAAM,CAAqB;IAC3B,QAAQ,CAAa;IACrB,SAAS,GAAG,KAAK,CAAC;IAElB,6DAA6D;IAC7D,MAAM,CAAsB;IAE5B,gDAAgD;IAChD,YAAY,KAAyB,EAAE,MAAM,GAAmB,EAAE;QACjE,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,QAAQ,GAAG,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC;IACrC,CAAC;IAED,yCAAyC;IACzC,IAAI,MAAM;QACT,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;IAC7B,CAAC;IAED,oDAAoD;IACpD,IAAI,MAAM;QACT,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;IAC7B,CAAC;IAED,mDAAmD;IACnD,IAAI,CAAC,KAAQ;QACZ,IAAI,CAAC,WAAW,EAAE,CAAC;QACnB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IACxC,CAAC;IAED;;;;;OAKG;IACH,GAAG,CAAC,KAAa;QAChB,IAAI,CAAC,WAAW,EAAE,CAAC;QACnB,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACvC,IAAI,KAAK;YAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC/B,CAAC;IAED,WAAW;QACV,IAAI,IAAI,CAAC,SAAS;YAAE,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC;IACxD,CAAC;IAED,MAAM,CAAC,OAAqC;QAC3C,+FAA+F;QAC/F,oFAAoF;QACpF,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;YACtB,yFAAyF;YACzF,uFAAuF;YACvF,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC;YACrB,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;YAExB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC;YACxC,IAAI,CAAC;gBACJ,KAAK,CAAC,UAAU,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,OAAO,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;YACjF,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACd,uFAAuF;gBACvF,qFAAqF;gBACrF,KAAK,CAAC,KAAK,EAAE,CAAC;gBACd,MAAM,GAAG,CAAC;YACX,CAAC;YAED,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;YACpB,OAAO,CAAC,MAAM,EAAE,CAAC;YACjB,OAAO;QACR,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,MAAM;YAAE,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAC;QAC3D,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,OAAO,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QACtF,OAAO,CAAC,MAAM,EAAE,CAAC;IAClB,CAAC;IAED,gDAAgD;IAChD,MAAM;QACL,IAAI,IAAI,CAAC,SAAS;YAAE,OAAO;QAC3B,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;QAEtB,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC;QACrB,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;QAExB,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;IACrB,CAAC;CACD","sourcesContent":["import type * as Moq from \"@moq/net\";\nimport { Time } from \"@moq/net\";\n\nimport { type Encoded, Encoder, type ProducerConfig } from \"./encoder.ts\";\n\n/**\n * Publishes a sliding window of JSON records to a track.\n *\n * An {@link Encoder} that owns its track: it writes each encoded frame and rolls a group whenever\n * the encoder emits a header. When something else already owns the track, use the {@link Encoder}\n * directly.\n *\n * @public\n */\nexport class Producer<T> {\n\t#track: Moq.Track.Producer;\n\t#encoder: Encoder<T>;\n\t#finished = false;\n\n\t// The group an op would be appended to, open after a header.\n\t#group?: Moq.Group.Producer;\n\n\t/** Wrap a track to publish a window into it. */\n\tconstructor(track: Moq.Track.Producer, config: ProducerConfig = {}) {\n\t\tthis.#track = track;\n\t\tthis.#encoder = new Encoder(config);\n\t}\n\n\t/** The retained window, oldest first. */\n\tget window(): T[] {\n\t\treturn this.#encoder.window;\n\t}\n\n\t/** Absolute index of the oldest retained record. */\n\tget offset(): number {\n\t\treturn this.#encoder.offset;\n\t}\n\n\t/** Append one record to the back of the window. */\n\tpush(value: T): void {\n\t\tthis.#assertOpen();\n\t\tthis.#write(this.#encoder.push(value));\n\t}\n\n\t/**\n\t * Drop `count` records from the front of the window.\n\t *\n\t * A no-op when the window is already empty, and clamped to what it holds, so a caller can trim\n\t * unconditionally.\n\t */\n\tpop(count: number): void {\n\t\tthis.#assertOpen();\n\t\tconst frame = this.#encoder.pop(count);\n\t\tif (frame) this.#write(frame);\n\t}\n\n\t#assertOpen(): void {\n\t\tif (this.#finished) throw new Error(\"track is closed\");\n\t}\n\n\t#write(encoded: Encoded & { commit(): void }): void {\n\t\t// A throw leaves the edit uncommitted and the retained window unchanged. The next edit opens a\n\t\t// new group because the attempted frame advanced the group-local compression state.\n\t\tif (encoded.keyframe) {\n\t\t\t// The previous group is complete; no more frames will be appended to it. Drop the handle\n\t\t\t// before opening the next one, so a failure below doesn't leave a closed group behind.\n\t\t\tthis.#group?.close();\n\t\t\tthis.#group = undefined;\n\n\t\t\tconst group = this.#track.appendGroup();\n\t\t\ttry {\n\t\t\t\tgroup.writeFrame({ payload: encoded.payload, timestamp: Time.Timestamp.now() });\n\t\t\t} catch (err) {\n\t\t\t\t// The group carries no frames, so close it rather than leaving it open on the track. A\n\t\t\t\t// consumer that already advanced into it would otherwise block with nothing to read.\n\t\t\t\tgroup.close();\n\t\t\t\tthrow err;\n\t\t\t}\n\n\t\t\tthis.#group = group;\n\t\t\tencoded.commit();\n\t\t\treturn;\n\t\t}\n\n\t\tif (!this.#group) throw new Error(\"op with no open group\");\n\t\tthis.#group.writeFrame({ payload: encoded.payload, timestamp: Time.Timestamp.now() });\n\t\tencoded.commit();\n\t}\n\n\t/** Finish the track, closing any open group. */\n\tfinish(): void {\n\t\tif (this.#finished) return;\n\t\tthis.#finished = true;\n\n\t\tthis.#group?.close();\n\t\tthis.#group = undefined;\n\n\t\tthis.#track.close();\n\t}\n}\n"]}

package/diff.test.d.ts

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=diff.test.d.ts.map

package/diff.test.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"diff.test.d.ts","sourceRoot":"","sources":["../src/diff.test.ts"],"names":[],"mappings":""}

package/diff.test.js

@@ -1,60 +0,0 @@
-/* @ts-self-types="./diff.test.d.ts" */
-import { expect, test } from "bun:test";
-import { deepEqual, diff, merge } from "./diff.js";
-// Applying the patch to old should reproduce new (RFC 7396 semantics).
-function assertRoundtrip(oldVal, newVal) {
-    const result = diff(oldVal, newVal);
-    expect(result.forcedSnapshot).toBe(false);
-    expect(merge(oldVal, result.patch)).toEqual(newVal);
-}
-test("changed scalar", () => {
-    assertRoundtrip({ a: 1, b: 2 }, { a: 1, b: 3 });
-});
-test("added key", () => {
-    const result = diff({ a: 1 }, { a: 1, b: 2 });
-    expect(result.forcedSnapshot).toBe(false);
-    expect(result.patch).toEqual({ b: 2 });
-});
-test("removed key is null", () => {
-    const result = diff({ a: 1, b: 2 }, { a: 1 });
-    expect(result.forcedSnapshot).toBe(false);
-    expect(result.patch).toEqual({ b: null });
-    assertRoundtrip({ a: 1, b: 2 }, { a: 1 });
-});
-test("nested object only includes changed keys", () => {
-    const result = diff({ o: { x: 1, y: 2 } }, { o: { x: 1, y: 9 } });
-    expect(result.forcedSnapshot).toBe(false);
-    expect(result.patch).toEqual({ o: { y: 9 } });
-});
-test("changed array is a wholesale delta", () => {
-    const result = diff({ a: [1, 2] }, { a: [1, 2, 3] });
-    expect(result.forcedSnapshot).toBe(false);
-    expect(result.patch).toEqual({ a: [1, 2, 3] });
-    assertRoundtrip({ a: [1, 2] }, { a: [1, 2, 3] });
-});
-test("added array is a delta", () => {
-    const result = diff({ a: 1 }, { a: 1, b: [1] });
-    expect(result.forcedSnapshot).toBe(false);
-    expect(result.patch).toEqual({ b: [1] });
-});
-test("nested array is a delta", () => {
-    const result = diff({ o: { x: 1 } }, { o: { x: 1, list: [1] } });
-    expect(result.forcedSnapshot).toBe(false);
-    expect(result.patch).toEqual({ o: { list: [1] } });
-    assertRoundtrip({ o: { x: 1 } }, { o: { x: 1, list: [1] } });
-});
-test("set to null forces snapshot", () => {
-    expect(diff({ a: 1 }, { a: null }).forcedSnapshot).toBe(true);
-});
-test("replacing object with scalar", () => {
-    assertRoundtrip({ a: { x: 1 } }, { a: 5 });
-});
-test("non-object root forces snapshot", () => {
-    expect(diff(1, 2).forcedSnapshot).toBe(true);
-});
-test("deepEqual", () => {
-    expect(deepEqual({ a: [1, { b: 2 }] }, { a: [1, { b: 2 }] })).toBe(true);
-    expect(deepEqual({ a: 1 }, { a: 1, b: 2 })).toBe(false);
-    expect(deepEqual([1, 2], [1, 2, 3])).toBe(false);
-});
-//# sourceMappingURL=diff.test.js.map

package/diff.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"diff.test.js","sourceRoot":"","sources":["../src/diff.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,UAAU,CAAC;AACxC,OAAO,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,WAAW,CAAC;AAEnD,uEAAuE;AACvE,SAAS,eAAe,CAAC,MAAe,EAAE,MAAe;IACxD,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACpC,MAAM,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1C,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,MAAgB,CAAC,CAAC;AAC/D,CAAC;AAED,IAAI,CAAC,gBAAgB,EAAE,GAAG,EAAE;IAC3B,eAAe,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;AACjD,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,WAAW,EAAE,GAAG,EAAE;IACtB,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IAC9C,MAAM,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1C,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;AACxC,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,qBAAqB,EAAE,GAAG,EAAE;IAChC,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IAC9C,MAAM,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1C,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC;IAC1C,eAAe,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;AAC3C,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,0CAA0C,EAAE,GAAG,EAAE;IACrD,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;IAClE,MAAM,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1C,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;AAC/C,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,oCAAoC,EAAE,GAAG,EAAE;IAC/C,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;IACrD,MAAM,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1C,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;IAC/C,eAAe,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;AAClD,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,wBAAwB,EAAE,GAAG,EAAE;IACnC,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAChD,MAAM,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1C,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AAC1C,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,yBAAyB,EAAE,GAAG,EAAE;IACpC,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IACjE,MAAM,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1C,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IACnD,eAAe,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;AAC9D,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,6BAA6B,EAAE,GAAG,EAAE;IACxC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC/D,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,8BAA8B,EAAE,GAAG,EAAE;IACzC,eAAe,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;AAC5C,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,iCAAiC,EAAE,GAAG,EAAE;IAC5C,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC9C,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,WAAW,EAAE,GAAG,EAAE;IACtB,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzE,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACxD,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AAClD,CAAC,CAAC,CAAC","sourcesContent":["import { expect, test } from \"bun:test\";\nimport { deepEqual, diff, merge } from \"./diff.ts\";\n\n// Applying the patch to old should reproduce new (RFC 7396 semantics).\nfunction assertRoundtrip(oldVal: unknown, newVal: unknown) {\n\tconst result = diff(oldVal, newVal);\n\texpect(result.forcedSnapshot).toBe(false);\n\texpect(merge(oldVal, result.patch)).toEqual(newVal as object);\n}\n\ntest(\"changed scalar\", () => {\n\tassertRoundtrip({ a: 1, b: 2 }, { a: 1, b: 3 });\n});\n\ntest(\"added key\", () => {\n\tconst result = diff({ a: 1 }, { a: 1, b: 2 });\n\texpect(result.forcedSnapshot).toBe(false);\n\texpect(result.patch).toEqual({ b: 2 });\n});\n\ntest(\"removed key is null\", () => {\n\tconst result = diff({ a: 1, b: 2 }, { a: 1 });\n\texpect(result.forcedSnapshot).toBe(false);\n\texpect(result.patch).toEqual({ b: null });\n\tassertRoundtrip({ a: 1, b: 2 }, { a: 1 });\n});\n\ntest(\"nested object only includes changed keys\", () => {\n\tconst result = diff({ o: { x: 1, y: 2 } }, { o: { x: 1, y: 9 } });\n\texpect(result.forcedSnapshot).toBe(false);\n\texpect(result.patch).toEqual({ o: { y: 9 } });\n});\n\ntest(\"changed array is a wholesale delta\", () => {\n\tconst result = diff({ a: [1, 2] }, { a: [1, 2, 3] });\n\texpect(result.forcedSnapshot).toBe(false);\n\texpect(result.patch).toEqual({ a: [1, 2, 3] });\n\tassertRoundtrip({ a: [1, 2] }, { a: [1, 2, 3] });\n});\n\ntest(\"added array is a delta\", () => {\n\tconst result = diff({ a: 1 }, { a: 1, b: [1] });\n\texpect(result.forcedSnapshot).toBe(false);\n\texpect(result.patch).toEqual({ b: [1] });\n});\n\ntest(\"nested array is a delta\", () => {\n\tconst result = diff({ o: { x: 1 } }, { o: { x: 1, list: [1] } });\n\texpect(result.forcedSnapshot).toBe(false);\n\texpect(result.patch).toEqual({ o: { list: [1] } });\n\tassertRoundtrip({ o: { x: 1 } }, { o: { x: 1, list: [1] } });\n});\n\ntest(\"set to null forces snapshot\", () => {\n\texpect(diff({ a: 1 }, { a: null }).forcedSnapshot).toBe(true);\n});\n\ntest(\"replacing object with scalar\", () => {\n\tassertRoundtrip({ a: { x: 1 } }, { a: 5 });\n});\n\ntest(\"non-object root forces snapshot\", () => {\n\texpect(diff(1, 2).forcedSnapshot).toBe(true);\n});\n\ntest(\"deepEqual\", () => {\n\texpect(deepEqual({ a: [1, { b: 2 }] }, { a: [1, { b: 2 }] })).toBe(true);\n\texpect(deepEqual({ a: 1 }, { a: 1, b: 2 })).toBe(false);\n\texpect(deepEqual([1, 2], [1, 2, 3])).toBe(false);\n});\n"]}

package/snapshot/compression.test.d.ts

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=compression.test.d.ts.map

package/snapshot/compression.test.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"compression.test.d.ts","sourceRoot":"","sources":["../../src/snapshot/compression.test.ts"],"names":[],"mappings":""}