@norskvideo/moq-net 0.1.7 → 0.2.0

package/lite/group.js

@@ -1,46 +1,88 @@
 /* @ts-self-types="./group.d.ts" */
+import { race } from "@norskvideo/moq-signals";
+import * as Time from "../time.js";
 import * as Message from "./message.js";
+import { hasFrameBounds } from "./version.js";
 export class Group {
     subscribe;
     sequence;
-    constructor(subscribe, sequence) {
+    /**
+     * The index of the first frame on this stream within the group.
+     *
+     * 0 (the common case) means the stream carries the group from its beginning. A
+     * higher value means the leading frames are not here, either because the
+     * subscription started partway into the group or because the publisher only holds
+     * the tail. Lite-06+; older versions always start at 0.
+     */
+    frameStart;
+    constructor({ subscribe, sequence, frameStart = 0, }) {
         this.subscribe = subscribe;
         this.sequence = sequence;
+        this.frameStart = frameStart;
     }
-    async #encode(w) {
+    async #encode(w, version) {
         await w.u62(this.subscribe);
         await w.u53(this.sequence);
+        if (hasFrameBounds(version)) {
+            await w.u53(this.frameStart);
+        }
+        else if (this.frameStart !== 0) {
+            // The peer would number the frames from 0 and silently misalign the group.
+            throw new Error("frame offsets not supported for this version");
+        }
     }
-    static async #decode(r) {
-        return new Group(await r.u62(), await r.u53());
+    static async #decode(r, version) {
+        const subscribe = await r.u62();
+        const sequence = await r.u53();
+        const frameStart = hasFrameBounds(version) ? await r.u53() : 0;
+        return new Group({ subscribe, sequence, frameStart });
     }
-    async encode(w) {
-        return Message.encode(w, this.#encode.bind(this));
+    async encode(w, version) {
+        return Message.encode(w, (w) => this.#encode(w, version));
     }
-    static async decode(r) {
-        return Message.decode(r, Group.#decode);
+    static async decode(r, version) {
+        return Message.decode(r, (r) => Group.#decode(r, version));
     }
-    static async decodeMaybe(r) {
-        return Message.decodeMaybe(r, Group.#decode);
+    static async decodeMaybe(r, version) {
+        return Message.decodeMaybe(r, (r) => Group.#decode(r, version));
     }
 }
-export class Frame {
-    payload;
-    constructor(payload) {
-        this.payload = payload;
-    }
-    async #encode(w) {
-        await w.write(this.payload);
-    }
-    static async #decode(r) {
-        const payload = await r.readAll();
-        return new Frame(payload);
-    }
-    async encode(w) {
-        return Message.encode(w, this.#encode.bind(this));
+/** Decode an unsigned zigzag varint back to a signed delta (mirrors Rust `VarInt::to_zigzag`). */
+function unzigzag(v) {
+    return (v >> 1n) ^ -(v & 1n);
+}
+/**
+ * A synchronous decode for one frame of a group or FETCH response stream.
+ *
+ * A non-zero `scale` means every frame is prefixed with a zigzag-delta timestamp (the lite-05
+ * FRAME format), decoded into a Timestamp at that scale. Scale 0 (pre-lite-05) carries no
+ * timestamp, so frames are wall-clock stamped on arrival.
+ */
+export function frameDecoder(scale) {
+    if (scale === 0) {
+        return (c) => ({ payload: c.read(c.u53()), timestamp: Time.Timestamp.now() });
     }
-    static async decode(r) {
-        return Message.decode(r, Frame.#decode);
+    const timescale = Time.Timescale(scale);
+    let prevTs = 0n;
+    return (c) => {
+        const delta = unzigzag(c.u62());
+        const payload = c.read(c.u53());
+        // After the last read, so a decode that ran short and gets retried adds the delta once.
+        prevTs += delta;
+        return { payload, timestamp: new Time.Timestamp(Number(prevTs), timescale) };
+    };
+}
+/** Write a group stream's frames into `producer` until the stream ends or the producer closes. */
+export async function readFrames(stream, producer, scale) {
+    const decode = frameDecoder(scale);
+    for (;;) {
+        // Every frame already buffered is written without an await, so the reader wakes once
+        // per batch rather than once per frame. Only the group's own stream ends it: a track
+        // that closes first has already closed (or aborted) this group through its cache.
+        const frame = stream.tryDecode(decode) ?? (await race([stream.decodeMaybe(decode), producer.closed]));
+        if (!frame || frame instanceof Error)
+            return;
+        producer.writeFrame(frame);
     }
 }
 //# sourceMappingURL=group.js.map

package/lite/group.js.map

@@ -1 +1 @@
-{"version":3,"file":"group.js","sourceRoot":"","sources":["../../src/lite/group.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,OAAO,MAAM,cAAc,CAAC;AAExC,MAAM,OAAO,KAAK;IACjB,SAAS,CAAS;IAClB,QAAQ,CAAS;IAEjB,YAAY,SAAiB,EAAE,QAAgB;QAC9C,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;IAC1B,CAAC;IAED,KAAK,CAAC,OAAO,CAAC,CAAS;QACtB,MAAM,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC5B,MAAM,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC5B,CAAC;IAED,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAS;QAC7B,OAAO,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IAChD,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,CAAS;QACrB,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IACnD,CAAC;IAED,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAS;QAC5B,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;IACzC,CAAC;IAED,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,CAAS;QACjC,OAAO,OAAO,CAAC,WAAW,CAAC,CAAC,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;IAC9C,CAAC;CACD;AAED,MAAM,OAAO,KAAK;IACjB,OAAO,CAAa;IAEpB,YAAY,OAAmB;QAC9B,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;IACxB,CAAC;IAED,KAAK,CAAC,OAAO,CAAC,CAAS;QACtB,MAAM,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC7B,CAAC;IAED,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAS;QAC7B,MAAM,OAAO,GAAG,MAAM,CAAC,CAAC,OAAO,EAAE,CAAC;QAClC,OAAO,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC;IAC3B,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,CAAS;QACrB,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IACnD,CAAC;IAED,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAS;QAC5B,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC;IACzC,CAAC;CACD","sourcesContent":["import type { Reader, Writer } from \"../stream.ts\";\nimport * as Message from \"./message.ts\";\n\nexport class Group {\n\tsubscribe: bigint;\n\tsequence: number;\n\n\tconstructor(subscribe: bigint, sequence: number) {\n\t\tthis.subscribe = subscribe;\n\t\tthis.sequence = sequence;\n\t}\n\n\tasync #encode(w: Writer) {\n\t\tawait w.u62(this.subscribe);\n\t\tawait w.u53(this.sequence);\n\t}\n\n\tstatic async #decode(r: Reader): Promise<Group> {\n\t\treturn new Group(await r.u62(), await r.u53());\n\t}\n\n\tasync encode(w: Writer): Promise<void> {\n\t\treturn Message.encode(w, this.#encode.bind(this));\n\t}\n\n\tstatic async decode(r: Reader): Promise<Group> {\n\t\treturn Message.decode(r, Group.#decode);\n\t}\n\n\tstatic async decodeMaybe(r: Reader): Promise<Group | undefined> {\n\t\treturn Message.decodeMaybe(r, Group.#decode);\n\t}\n}\n\nexport class Frame {\n\tpayload: Uint8Array;\n\n\tconstructor(payload: Uint8Array) {\n\t\tthis.payload = payload;\n\t}\n\n\tasync #encode(w: Writer) {\n\t\tawait w.write(this.payload);\n\t}\n\n\tstatic async #decode(r: Reader): Promise<Frame> {\n\t\tconst payload = await r.readAll();\n\t\treturn new Frame(payload);\n\t}\n\n\tasync encode(w: Writer): Promise<void> {\n\t\treturn Message.encode(w, this.#encode.bind(this));\n\t}\n\n\tstatic async decode(r: Reader): Promise<Frame> {\n\t\treturn Message.decode(r, Frame.#decode);\n\t}\n}\n"]}
+{"version":3,"file":"group.js","sourceRoot":"","sources":["../../src/lite/group.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,cAAc,CAAC;AAGpC,OAAO,KAAK,IAAI,MAAM,YAAY,CAAC;AACnC,OAAO,KAAK,OAAO,MAAM,cAAc,CAAC;AACxC,OAAO,EAAE,cAAc,EAAgB,MAAM,cAAc,CAAC;AAE5D,MAAM,OAAO,KAAK;IACjB,SAAS,CAAS;IAClB,QAAQ,CAAS;IAEjB;;;;;;;OAOG;IACH,UAAU,CAAS;IAEnB,YAAY,EACX,SAAS,EACT,QAAQ,EACR,UAAU,GAAG,CAAC,GAKd;QACA,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;IAC9B,CAAC;IAED,KAAK,CAAC,OAAO,CAAC,CAAS,EAAE,OAAgB;QACxC,MAAM,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC5B,MAAM,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC3B,IAAI,cAAc,CAAC,OAAO,CAAC,EAAE,CAAC;YAC7B,MAAM,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC9B,CAAC;aAAM,IAAI,IAAI,CAAC,UAAU,KAAK,CAAC,EAAE,CAAC;YAClC,2EAA2E;YAC3E,MAAM,IAAI,KAAK,CAAC,8CAA8C,CAAC,CAAC;QACjE,CAAC;IACF,CAAC;IAED,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAS,EAAE,OAAgB;QAC/C,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC;QAChC,MAAM,QAAQ,GAAG,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC;QAC/B,MAAM,UAAU,GAAG,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/D,OAAO,IAAI,KAAK,CAAC,EAAE,SAAS,EAAE,QAAQ,EAAE,UAAU,EAAE,CAAC,CAAC;IACvD,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,CAAS,EAAE,OAAgB;QACvC,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;IAC3D,CAAC;IAED,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAS,EAAE,OAAgB;QAC9C,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;IAC5D,CAAC;IAED,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,CAAS,EAAE,OAAgB;QACnD,OAAO,OAAO,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;IACjE,CAAC;CACD;AAED,kGAAkG;AAClG,SAAS,QAAQ,CAAC,CAAS;IAC1B,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;AAC9B,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,YAAY,CAAC,KAAa;IACzC,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;QACjB,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;IAC/E,CAAC;IAED,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IACxC,IAAI,MAAM,GAAG,EAAE,CAAC;IAChB,OAAO,CAAC,CAAC,EAAE,EAAE;QACZ,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QAChC,MAAM,OAAO,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QAChC,wFAAwF;QACxF,MAAM,IAAI,KAAK,CAAC;QAChB,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,SAAS,CAAC,EAAE,CAAC;IAC9E,CAAC,CAAC;AACH,CAAC;AAED,kGAAkG;AAClG,MAAM,CAAC,KAAK,UAAU,UAAU,CAAC,MAAc,EAAE,QAA2B,EAAE,KAAa;IAC1F,MAAM,MAAM,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;IAEnC,SAAS,CAAC;QACT,qFAAqF;QACrF,qFAAqF;QACrF,kFAAkF;QAClF,MAAM,KAAK,GAAG,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACtG,IAAI,CAAC,KAAK,IAAI,KAAK,YAAY,KAAK;YAAE,OAAO;QAC7C,QAAQ,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC;AACF,CAAC","sourcesContent":["import { race } from \"@moq/signals\";\nimport type * as netGroup from \"../group.ts\";\nimport type { Cursor, Reader, Writer } from \"../stream.ts\";\nimport * as Time from \"../time.ts\";\nimport * as Message from \"./message.ts\";\nimport { hasFrameBounds, type Version } from \"./version.ts\";\n\nexport class Group {\n\tsubscribe: bigint;\n\tsequence: number;\n\n\t/**\n\t * The index of the first frame on this stream within the group.\n\t *\n\t * 0 (the common case) means the stream carries the group from its beginning. A\n\t * higher value means the leading frames are not here, either because the\n\t * subscription started partway into the group or because the publisher only holds\n\t * the tail. Lite-06+; older versions always start at 0.\n\t */\n\tframeStart: number;\n\n\tconstructor({\n\t\tsubscribe,\n\t\tsequence,\n\t\tframeStart = 0,\n\t}: {\n\t\tsubscribe: bigint;\n\t\tsequence: number;\n\t\tframeStart?: number;\n\t}) {\n\t\tthis.subscribe = subscribe;\n\t\tthis.sequence = sequence;\n\t\tthis.frameStart = frameStart;\n\t}\n\n\tasync #encode(w: Writer, version: Version) {\n\t\tawait w.u62(this.subscribe);\n\t\tawait w.u53(this.sequence);\n\t\tif (hasFrameBounds(version)) {\n\t\t\tawait w.u53(this.frameStart);\n\t\t} else if (this.frameStart !== 0) {\n\t\t\t// The peer would number the frames from 0 and silently misalign the group.\n\t\t\tthrow new Error(\"frame offsets not supported for this version\");\n\t\t}\n\t}\n\n\tstatic async #decode(r: Reader, version: Version): Promise<Group> {\n\t\tconst subscribe = await r.u62();\n\t\tconst sequence = await r.u53();\n\t\tconst frameStart = hasFrameBounds(version) ? await r.u53() : 0;\n\t\treturn new Group({ subscribe, sequence, frameStart });\n\t}\n\n\tasync encode(w: Writer, version: Version): Promise<void> {\n\t\treturn Message.encode(w, (w) => this.#encode(w, version));\n\t}\n\n\tstatic async decode(r: Reader, version: Version): Promise<Group> {\n\t\treturn Message.decode(r, (r) => Group.#decode(r, version));\n\t}\n\n\tstatic async decodeMaybe(r: Reader, version: Version): Promise<Group | undefined> {\n\t\treturn Message.decodeMaybe(r, (r) => Group.#decode(r, version));\n\t}\n}\n\n/** Decode an unsigned zigzag varint back to a signed delta (mirrors Rust `VarInt::to_zigzag`). */\nfunction unzigzag(v: bigint): bigint {\n\treturn (v >> 1n) ^ -(v & 1n);\n}\n\n/**\n * A synchronous decode for one frame of a group or FETCH response stream.\n *\n * A non-zero `scale` means every frame is prefixed with a zigzag-delta timestamp (the lite-05\n * FRAME format), decoded into a Timestamp at that scale. Scale 0 (pre-lite-05) carries no\n * timestamp, so frames are wall-clock stamped on arrival.\n */\nexport function frameDecoder(scale: number): (c: Cursor) => netGroup.Frame {\n\tif (scale === 0) {\n\t\treturn (c) => ({ payload: c.read(c.u53()), timestamp: Time.Timestamp.now() });\n\t}\n\n\tconst timescale = Time.Timescale(scale);\n\tlet prevTs = 0n;\n\treturn (c) => {\n\t\tconst delta = unzigzag(c.u62());\n\t\tconst payload = c.read(c.u53());\n\t\t// After the last read, so a decode that ran short and gets retried adds the delta once.\n\t\tprevTs += delta;\n\t\treturn { payload, timestamp: new Time.Timestamp(Number(prevTs), timescale) };\n\t};\n}\n\n/** Write a group stream's frames into `producer` until the stream ends or the producer closes. */\nexport async function readFrames(stream: Reader, producer: netGroup.Producer, scale: number): Promise<void> {\n\tconst decode = frameDecoder(scale);\n\n\tfor (;;) {\n\t\t// Every frame already buffered is written without an await, so the reader wakes once\n\t\t// per batch rather than once per frame. Only the group's own stream ends it: a track\n\t\t// that closes first has already closed (or aborted) this group through its cache.\n\t\tconst frame = stream.tryDecode(decode) ?? (await race([stream.decodeMaybe(decode), producer.closed]));\n\t\tif (!frame || frame instanceof Error) return;\n\t\tproducer.writeFrame(frame);\n\t}\n}\n"]}

package/lite/message.d.ts

@@ -1,5 +1,5 @@
 import { Reader, Writer } from "../stream";
-export declare function encode(writer: Writer, f: (w: Writer) => Promise<void>): Promise<void>;
-export declare function decode<T>(reader: Reader, f: (r: Reader) => Promise<T>): Promise<T>;
+export declare function encode(writer: Writer, f: (w: Writer) => Promise<void>, max?: number): Promise<void>;
+export declare function decode<T>(reader: Reader, f: (r: Reader) => Promise<T>, max?: number): Promise<T>;
 export declare function decodeMaybe<T>(reader: Reader, f: (r: Reader) => Promise<T>): Promise<T | undefined>;
 //# sourceMappingURL=message.d.ts.map

package/lite/message.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"message.d.ts","sourceRoot":"","sources":["../../src/lite/message.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AAE9C,wBAAsB,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,OAAO,CAAC,IAAI,CAAC,iBAqC3E;AAGD,wBAAsB,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAaxF;AAED,wBAAsB,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,SAAS,CAAC,CAGzG"}
+{"version":3,"file":"message.d.ts","sourceRoot":"","sources":["../../src/lite/message.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AAM9C,wBAAsB,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,OAAO,CAAC,IAAI,CAAC,EAAE,GAAG,SAAW,iBA0C3F;AAGD,wBAAsB,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC,EAAE,GAAG,SAAW,GAAG,OAAO,CAAC,CAAC,CAAC,CAgBxG;AAED,wBAAsB,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,SAAS,CAAC,CAGzG"}

package/lite/message.js

@@ -1,6 +1,9 @@
 /* @ts-self-types="./message.d.ts" */
 import { Reader, Writer } from "../stream.js";
-export async function encode(writer, f) {
+/** The largest message body either side accepts, matching the Rust implementation. */
+const MAX_SIZE = 64 * 1024 * 1024;
+// Encodes a message with a varint size prefix, refusing a body the peer would reject.
+export async function encode(writer, f, max = MAX_SIZE) {
     let scratch = new Uint8Array();
     const temp = new Writer(new WritableStream({
         write(chunk) {
@@ -22,20 +25,26 @@ export async function encode(writer, f) {
                 scratch.set(chunk, needed - chunk.byteLength);
             }
         },
-    }));
+    }), writer.version);
     await f(temp);
     temp.close();
     await temp.closed;
+    if (scratch.byteLength > max) {
+        throw new Error(`message too large: ${scratch.byteLength} bytes (max ${max})`);
+    }
     await writer.u53(scratch.byteLength);
     if (scratch.byteLength > 0) {
         await writer.write(scratch);
     }
 }
-// Reads a message with a varint size prefix.
-export async function decode(reader, f) {
+// Reads a message with a varint size prefix, refusing an oversized body before reading it.
+export async function decode(reader, f, max = MAX_SIZE) {
     const size = await reader.u53();
+    if (size > max) {
+        throw new Error(`message too large: ${size} bytes (max ${max})`);
+    }
     const data = await reader.read(size);
-    const limit = new Reader(undefined, data);
+    const limit = new Reader(undefined, data, reader.version);
     const msg = await f(limit);
     // Check that we consumed exactly the right number of bytes
     if (!(await limit.done())) {

package/lite/message.js.map

@@ -1 +1 @@
-{"version":3,"file":"message.js","sourceRoot":"","sources":["../../src/lite/message.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AAE9C,MAAM,CAAC,KAAK,UAAU,MAAM,CAAC,MAAc,EAAE,CAA+B;IAC3E,IAAI,OAAO,GAAG,IAAI,UAAU,EAAE,CAAC;IAE/B,MAAM,IAAI,GAAG,IAAI,MAAM,CACtB,IAAI,cAAc,CAAC;QAClB,KAAK,CAAC,KAAiB;YACtB,MAAM,MAAM,GAAG,OAAO,CAAC,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC;YACrD,IAAI,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC;gBACxC,wCAAwC;gBACxC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,MAAM,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC;gBACjE,MAAM,SAAS,GAAG,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC;gBAC5C,MAAM,UAAU,GAAG,IAAI,UAAU,CAAC,SAAS,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;gBAExD,yCAAyC;gBACzC,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBAExB,0CAA0C;gBAC1C,UAAU,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,UAAU,CAAC,CAAC;gBAE1C,OAAO,GAAG,UAAU,CAAC;YACtB,CAAC;iBAAM,CAAC;gBACP,8BAA8B;gBAC9B,OAAO,GAAG,IAAI,UAAU,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;gBACpD,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC;YAC/C,CAAC;QACF,CAAC;KACD,CAAC,CACF,CAAC;IAEF,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC;IACd,IAAI,CAAC,KAAK,EAAE,CAAC;IACb,MAAM,IAAI,CAAC,MAAM,CAAC;IAElB,MAAM,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;IACrC,IAAI,OAAO,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC;QAC5B,MAAM,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAC7B,CAAC;AACF,CAAC;AAED,6CAA6C;AAC7C,MAAM,CAAC,KAAK,UAAU,MAAM,CAAI,MAAc,EAAE,CAA4B;IAC3E,MAAM,IAAI,GAAG,MAAM,MAAM,CAAC,GAAG,EAAE,CAAC;IAChC,MAAM,IAAI,GAAG,MAAM,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAErC,MAAM,KAAK,GAAG,IAAI,MAAM,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;IAC1C,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC;IAE3B,2DAA2D;IAC3D,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC;QAC3B,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAC;IAC5D,CAAC;IAED,OAAO,GAAG,CAAC;AACZ,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,WAAW,CAAI,MAAc,EAAE,CAA4B;IAChF,IAAI,MAAM,MAAM,CAAC,IAAI,EAAE;QAAE,OAAO;IAChC,OAAO,MAAM,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;AAChC,CAAC","sourcesContent":["import { Reader, Writer } from \"../stream.ts\";\n\nexport async function encode(writer: Writer, f: (w: Writer) => Promise<void>) {\n\tlet scratch = new Uint8Array();\n\n\tconst temp = new Writer(\n\t\tnew WritableStream({\n\t\t\twrite(chunk: Uint8Array) {\n\t\t\t\tconst needed = scratch.byteLength + chunk.byteLength;\n\t\t\t\tif (needed > scratch.buffer.byteLength) {\n\t\t\t\t\t// Resize the buffer to the needed size.\n\t\t\t\t\tconst capacity = Math.max(needed, scratch.buffer.byteLength * 2);\n\t\t\t\t\tconst newBuffer = new ArrayBuffer(capacity);\n\t\t\t\t\tconst newScratch = new Uint8Array(newBuffer, 0, needed);\n\n\t\t\t\t\t// Copy the old data into the new buffer.\n\t\t\t\t\tnewScratch.set(scratch);\n\n\t\t\t\t\t// Copy the new chunk into the new buffer.\n\t\t\t\t\tnewScratch.set(chunk, scratch.byteLength);\n\n\t\t\t\t\tscratch = newScratch;\n\t\t\t\t} else {\n\t\t\t\t\t// Copy chunk data into buffer\n\t\t\t\t\tscratch = new Uint8Array(scratch.buffer, 0, needed);\n\t\t\t\t\tscratch.set(chunk, needed - chunk.byteLength);\n\t\t\t\t}\n\t\t\t},\n\t\t}),\n\t);\n\n\tawait f(temp);\n\ttemp.close();\n\tawait temp.closed;\n\n\tawait writer.u53(scratch.byteLength);\n\tif (scratch.byteLength > 0) {\n\t\tawait writer.write(scratch);\n\t}\n}\n\n// Reads a message with a varint size prefix.\nexport async function decode<T>(reader: Reader, f: (r: Reader) => Promise<T>): Promise<T> {\n\tconst size = await reader.u53();\n\tconst data = await reader.read(size);\n\n\tconst limit = new Reader(undefined, data);\n\tconst msg = await f(limit);\n\n\t// Check that we consumed exactly the right number of bytes\n\tif (!(await limit.done())) {\n\t\tthrow new Error(\"Message decoding consumed too few bytes\");\n\t}\n\n\treturn msg;\n}\n\nexport async function decodeMaybe<T>(reader: Reader, f: (r: Reader) => Promise<T>): Promise<T | undefined> {\n\tif (await reader.done()) return;\n\treturn await decode(reader, f);\n}\n"]}
+{"version":3,"file":"message.js","sourceRoot":"","sources":["../../src/lite/message.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AAE9C,sFAAsF;AACtF,MAAM,QAAQ,GAAG,EAAE,GAAG,IAAI,GAAG,IAAI,CAAC;AAElC,sFAAsF;AACtF,MAAM,CAAC,KAAK,UAAU,MAAM,CAAC,MAAc,EAAE,CAA+B,EAAE,GAAG,GAAG,QAAQ;IAC3F,IAAI,OAAO,GAAG,IAAI,UAAU,EAAE,CAAC;IAE/B,MAAM,IAAI,GAAG,IAAI,MAAM,CACtB,IAAI,cAAc,CAAC;QAClB,KAAK,CAAC,KAAiB;YACtB,MAAM,MAAM,GAAG,OAAO,CAAC,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC;YACrD,IAAI,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC;gBACxC,wCAAwC;gBACxC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,MAAM,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC;gBACjE,MAAM,SAAS,GAAG,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC;gBAC5C,MAAM,UAAU,GAAG,IAAI,UAAU,CAAC,SAAS,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;gBAExD,yCAAyC;gBACzC,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBAExB,0CAA0C;gBAC1C,UAAU,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,UAAU,CAAC,CAAC;gBAE1C,OAAO,GAAG,UAAU,CAAC;YACtB,CAAC;iBAAM,CAAC;gBACP,8BAA8B;gBAC9B,OAAO,GAAG,IAAI,UAAU,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;gBACpD,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC;YAC/C,CAAC;QACF,CAAC;KACD,CAAC,EACF,MAAM,CAAC,OAAO,CACd,CAAC;IAEF,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC;IACd,IAAI,CAAC,KAAK,EAAE,CAAC;IACb,MAAM,IAAI,CAAC,MAAM,CAAC;IAElB,IAAI,OAAO,CAAC,UAAU,GAAG,GAAG,EAAE,CAAC;QAC9B,MAAM,IAAI,KAAK,CAAC,sBAAsB,OAAO,CAAC,UAAU,eAAe,GAAG,GAAG,CAAC,CAAC;IAChF,CAAC;IAED,MAAM,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;IACrC,IAAI,OAAO,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC;QAC5B,MAAM,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAC7B,CAAC;AACF,CAAC;AAED,2FAA2F;AAC3F,MAAM,CAAC,KAAK,UAAU,MAAM,CAAI,MAAc,EAAE,CAA4B,EAAE,GAAG,GAAG,QAAQ;IAC3F,MAAM,IAAI,GAAG,MAAM,MAAM,CAAC,GAAG,EAAE,CAAC;IAChC,IAAI,IAAI,GAAG,GAAG,EAAE,CAAC;QAChB,MAAM,IAAI,KAAK,CAAC,sBAAsB,IAAI,eAAe,GAAG,GAAG,CAAC,CAAC;IAClE,CAAC;IACD,MAAM,IAAI,GAAG,MAAM,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAErC,MAAM,KAAK,GAAG,IAAI,MAAM,CAAC,SAAS,EAAE,IAAI,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC;IAC1D,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC;IAE3B,2DAA2D;IAC3D,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC;QAC3B,MAAM,IAAI,KAAK,CAAC,yCAAyC,CAAC,CAAC;IAC5D,CAAC;IAED,OAAO,GAAG,CAAC;AACZ,CAAC;AAED,MAAM,CAAC,KAAK,UAAU,WAAW,CAAI,MAAc,EAAE,CAA4B;IAChF,IAAI,MAAM,MAAM,CAAC,IAAI,EAAE;QAAE,OAAO;IAChC,OAAO,MAAM,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;AAChC,CAAC","sourcesContent":["import { Reader, Writer } from \"../stream.ts\";\n\n/** The largest message body either side accepts, matching the Rust implementation. */\nconst MAX_SIZE = 64 * 1024 * 1024;\n\n// Encodes a message with a varint size prefix, refusing a body the peer would reject.\nexport async function encode(writer: Writer, f: (w: Writer) => Promise<void>, max = MAX_SIZE) {\n\tlet scratch = new Uint8Array();\n\n\tconst temp = new Writer(\n\t\tnew WritableStream({\n\t\t\twrite(chunk: Uint8Array) {\n\t\t\t\tconst needed = scratch.byteLength + chunk.byteLength;\n\t\t\t\tif (needed > scratch.buffer.byteLength) {\n\t\t\t\t\t// Resize the buffer to the needed size.\n\t\t\t\t\tconst capacity = Math.max(needed, scratch.buffer.byteLength * 2);\n\t\t\t\t\tconst newBuffer = new ArrayBuffer(capacity);\n\t\t\t\t\tconst newScratch = new Uint8Array(newBuffer, 0, needed);\n\n\t\t\t\t\t// Copy the old data into the new buffer.\n\t\t\t\t\tnewScratch.set(scratch);\n\n\t\t\t\t\t// Copy the new chunk into the new buffer.\n\t\t\t\t\tnewScratch.set(chunk, scratch.byteLength);\n\n\t\t\t\t\tscratch = newScratch;\n\t\t\t\t} else {\n\t\t\t\t\t// Copy chunk data into buffer\n\t\t\t\t\tscratch = new Uint8Array(scratch.buffer, 0, needed);\n\t\t\t\t\tscratch.set(chunk, needed - chunk.byteLength);\n\t\t\t\t}\n\t\t\t},\n\t\t}),\n\t\twriter.version,\n\t);\n\n\tawait f(temp);\n\ttemp.close();\n\tawait temp.closed;\n\n\tif (scratch.byteLength > max) {\n\t\tthrow new Error(`message too large: ${scratch.byteLength} bytes (max ${max})`);\n\t}\n\n\tawait writer.u53(scratch.byteLength);\n\tif (scratch.byteLength > 0) {\n\t\tawait writer.write(scratch);\n\t}\n}\n\n// Reads a message with a varint size prefix, refusing an oversized body before reading it.\nexport async function decode<T>(reader: Reader, f: (r: Reader) => Promise<T>, max = MAX_SIZE): Promise<T> {\n\tconst size = await reader.u53();\n\tif (size > max) {\n\t\tthrow new Error(`message too large: ${size} bytes (max ${max})`);\n\t}\n\tconst data = await reader.read(size);\n\n\tconst limit = new Reader(undefined, data, reader.version);\n\tconst msg = await f(limit);\n\n\t// Check that we consumed exactly the right number of bytes\n\tif (!(await limit.done())) {\n\t\tthrow new Error(\"Message decoding consumed too few bytes\");\n\t}\n\n\treturn msg;\n}\n\nexport async function decodeMaybe<T>(reader: Reader, f: (r: Reader) => Promise<T>): Promise<T | undefined> {\n\tif (await reader.done()) return;\n\treturn await decode(reader, f);\n}\n"]}

package/lite/priority.d.ts

@@ -3,65 +3,5 @@
  *
  * @module
  */
-import type { Writer } from "../stream";
-import type * as track from "../track";
-/**
- * What to rank a group stream by.
- *
- * @internal
- */
-export interface Rank {
-    /** The subscriber's track priority, which outweighs everything below it. */
-    priority: number;
-    /**
-     * Where the group sits in the queue its own subscription wants sent, 0 being the one to
-     * send next. Defaults to 0, which is right for a stream that is the only one of its kind.
-     */
-    position?: number;
-}
-/**
- * The transport send order for a group, where HIGHER values are transmitted first.
- *
- * A higher `priority` always wins. Below it, a group is ranked by its `position` in its own
- * subscription rather than by its sequence, so two tracks at the same priority interleave:
- * each one's next group ties with the other's, whatever their group numbering. Comparing
- * sequences instead would let a track that had been running longer, or that numbered its
- * groups from a clock, starve one that started later.
- *
- * @internal
- */
-export declare function sendOrder({ priority, position }: Rank): number;
-/**
- * Ranks one subscription's group streams against each other, and re-ranks them whenever the
- * set changes or the subscription is updated.
- *
- * A group's rank is its position among the groups in flight, so which group goes first is
- * decided here rather than by arithmetic on sequence numbers. Newest-first by default, since
- * that is what live playback wants; an `ordered` subscription is playing through in sequence,
- * so it gets the oldest group first instead.
- *
- * One listener covers the whole subscription. A listener per group would instead pile up on
- * it, and a track that stalls with many groups open would trip the signals leak guard.
- *
- * @internal
- */
-export declare class Priority {
-    #private;
-    /** Follow `track`'s subscription until {@link close}. */
-    constructor(track: track.Subscriber);
-    /** The send order for a group at `sequence`, whether or not it has a stream yet. */
-    rank(sequence: number): number;
-    /** Rank a group's stream now, and again whenever the ranking changes, until {@link remove}. */
-    add(stream: Writer, sequence: number): void;
-    /** Stop ranking a finished group's stream, promoting whatever was queued behind it. */
-    remove(stream: Writer): void;
-    /**
-     * Stop taking new groups, and release the subscription listener once the last one leaves.
-     *
-     * The track can finish while several groups are still draining, and those are the ones the
-     * subscriber is still waiting on. They keep being promoted as the groups ahead of them
-     * finish, rather than being stranded at whatever position they held when the track ended.
-     */
-    close(): void;
-}
+export {};
 //# sourceMappingURL=priority.d.ts.map

package/lite/priority.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"priority.d.ts","sourceRoot":"","sources":["../../src/lite/priority.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAGH,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AAC3C,OAAO,KAAK,KAAK,KAAK,MAAM,aAAa,CAAC;AAY1C;;;;GAIG;AACH,MAAM,WAAW,IAAI;IACpB,4EAA4E;IAC5E,QAAQ,EAAE,MAAM,CAAC;IAEjB;;;OAGG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAC;CAClB;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,SAAS,CAAC,EAAE,QAAQ,EAAE,QAAY,EAAE,EAAE,IAAI,GAAG,MAAM,CAElE;AAQD;;;;;;;;;;;;;GAaG;AACH,qBAAa,QAAQ;;IAMpB,yDAAyD;IACzD,YAAY,KAAK,EAAE,KAAK,CAAC,UAAU,EAGlC;IAED,oFAAoF;IACpF,IAAI,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,CAK7B;IAED,+FAA+F;IAC/F,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,QAMnC;IAED,uFAAuF;IACvF,MAAM,CAAC,MAAM,EAAE,MAAM,QAQpB;IAED;;;;;;OAMG;IACH,KAAK,SAGJ;CAqBD"}
+{"version":3,"file":"priority.d.ts","sourceRoot":"","sources":["../../src/lite/priority.ts"],"names":[],"mappings":"AAAA;;;;GAIG"}

package/lite/priority.js

@@ -36,9 +36,9 @@ function clamp(value, max) {
  * set changes or the subscription is updated.
  *
  * A group's rank is its position among the groups in flight, so which group goes first is
- * decided here rather than by arithmetic on sequence numbers. Newest-first by default, since
- * that is what live playback wants; an `ordered` subscription is playing through in sequence,
- * so it gets the oldest group first instead.
+ * decided here rather than by arithmetic on sequence numbers. Newest first, always: under
+ * congestion that sheds the backlog rather than the live edge, and a subscriber wanting
+ * sequence order reorders locally rather than asking the wire for it.
  *
  * One listener covers the whole subscription. A listener per group would instead pile up on
  * it, and a track that stalls with many groups open would trip the signals leak guard.
@@ -96,10 +96,9 @@ export class Priority {
     // Sequences are unique within a subscription, so a group already registered never counts
     // itself.
     #position(sequence) {
-        const ordered = this.#track.subscription.peek()?.ordered ?? false;
         let ahead = 0;
         for (const other of this.#streams.values()) {
-            if (ordered ? other < sequence : other > sequence)
+            if (other > sequence)
                 ahead++;
         }
         return ahead;

package/lite/priority.js.map

@@ -1 +1 @@
-{"version":3,"file":"priority.js","sourceRoot":"","sources":["../../src/lite/priority.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAMH,0FAA0F;AAC1F,0FAA0F;AAC1F,8FAA8F;AAC9F,+FAA+F;AAC/F,kCAAkC;AAClC,MAAM,UAAU,GAAG,CAAC,IAAI,EAAE,CAAC;AAE3B,0DAA0D;AAC1D,MAAM,YAAY,GAAG,IAAI,CAAC;AAkB1B;;;;;;;;;;GAUG;AACH,MAAM,UAAU,SAAS,CAAC,EAAE,QAAQ,EAAE,QAAQ,GAAG,CAAC,EAAQ;IACzD,OAAO,CAAC,CAAC,CAAC,YAAY,GAAG,KAAK,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC,GAAG,UAAU,GAAG,KAAK,CAAC,QAAQ,EAAE,UAAU,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AAC7G,CAAC;AAED,8FAA8F;AAC9F,6EAA6E;AAC7E,SAAS,KAAK,CAAC,KAAa,EAAE,GAAW;IACxC,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;AACtD,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,OAAO,QAAQ;IACpB,MAAM,CAAmB;IACzB,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IACrC,QAAQ,CAAU;IAClB,OAAO,GAAG,KAAK,CAAC;IAEhB,yDAAyD;IACzD,YAAY,KAAuB;QAClC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,YAAY,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;IACpE,CAAC;IAED,oFAAoF;IACpF,IAAI,CAAC,QAAgB;QACpB,OAAO,SAAS,CAAC;YAChB,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,IAAI,EAAE,EAAE,QAAQ,IAAI,CAAC;YACxD,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC;SAClC,CAAC,CAAC;IACJ,CAAC;IAED,+FAA+F;IAC/F,GAAG,CAAC,MAAc,EAAE,QAAgB;QACnC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QAEpC,oFAAoF;QACpF,8DAA8D;QAC9D,IAAI,CAAC,OAAO,EAAE,CAAC;IAChB,CAAC;IAED,uFAAuF;IACvF,MAAM,CAAC,MAAc;QACpB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC;YAAE,OAAO;QAE1C,IAAI,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAC9C,IAAI,CAAC,QAAQ,EAAE,CAAC;QACjB,CAAC;aAAM,CAAC;YACP,IAAI,CAAC,OAAO,EAAE,CAAC;QAChB,CAAC;IACF,CAAC;IAED;;;;;;OAMG;IACH,KAAK;QACJ,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;QACpB,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC;YAAE,IAAI,CAAC,QAAQ,EAAE,CAAC;IAC/C,CAAC;IAED,qFAAqF;IACrF,yFAAyF;IACzF,UAAU;IACV,SAAS,CAAC,QAAgB;QACzB,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,IAAI,EAAE,EAAE,OAAO,IAAI,KAAK,CAAC;QAElE,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YAC5C,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,KAAK,GAAG,QAAQ;gBAAE,KAAK,EAAE,CAAC;QAC5D,CAAC;QACD,OAAO,KAAK,CAAC;IACd,CAAC;IAED,OAAO;QACN,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,IAAI,EAAE,EAAE,QAAQ,IAAI,CAAC,CAAC;QAChE,KAAK,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAChD,MAAM,CAAC,WAAW,CAAC,SAAS,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;QACjF,CAAC;IACF,CAAC;CACD","sourcesContent":["/**\n * Stream prioritization for moq-lite, mirroring the Rust `lite::priority` queue.\n *\n * @module\n */\n\nimport type { Dispose } from \"@moq/signals\";\nimport type { Writer } from \"../stream.ts\";\nimport type * as track from \"../track.ts\";\n\n// The transport compares send orders as a single number, so the two ranks are packed into\n// disjoint ranges: the track priority takes the high bits so it always dominates, and the\n// position below it. Group data stays negative so protocol streams at the transport's default\n// order of 0 always make progress. A u8 priority and 44-bit position fill the negative half of\n// the safe integer range exactly.\nconst GROUP_SPAN = 2 ** 44;\n\n/** The highest track priority the wire carries (a u8). */\nconst MAX_PRIORITY = 0xff;\n\n/**\n * What to rank a group stream by.\n *\n * @internal\n */\nexport interface Rank {\n\t/** The subscriber's track priority, which outweighs everything below it. */\n\tpriority: number;\n\n\t/**\n\t * Where the group sits in the queue its own subscription wants sent, 0 being the one to\n\t * send next. Defaults to 0, which is right for a stream that is the only one of its kind.\n\t */\n\tposition?: number;\n}\n\n/**\n * The transport send order for a group, where HIGHER values are transmitted first.\n *\n * A higher `priority` always wins. Below it, a group is ranked by its `position` in its own\n * subscription rather than by its sequence, so two tracks at the same priority interleave:\n * each one's next group ties with the other's, whatever their group numbering. Comparing\n * sequences instead would let a track that had been running longer, or that numbered its\n * groups from a clock, starve one that started later.\n *\n * @internal\n */\nexport function sendOrder({ priority, position = 0 }: Rank): number {\n\treturn -((MAX_PRIORITY - clamp(priority, MAX_PRIORITY)) * GROUP_SPAN + clamp(position, GROUP_SPAN - 1) + 1);\n}\n\n// Both ranks are bounded: the priority by its wire type, the position by the space left below\n// it. Anything outside is a caller bug rather than a value worth preserving.\nfunction clamp(value: number, max: number): number {\n\treturn Math.min(Math.max(Math.trunc(value), 0), max);\n}\n\n/**\n * Ranks one subscription's group streams against each other, and re-ranks them whenever the\n * set changes or the subscription is updated.\n *\n * A group's rank is its position among the groups in flight, so which group goes first is\n * decided here rather than by arithmetic on sequence numbers. Newest-first by default, since\n * that is what live playback wants; an `ordered` subscription is playing through in sequence,\n * so it gets the oldest group first instead.\n *\n * One listener covers the whole subscription. A listener per group would instead pile up on\n * it, and a track that stalls with many groups open would trip the signals leak guard.\n *\n * @internal\n */\nexport class Priority {\n\t#track: track.Subscriber;\n\t#streams = new Map<Writer, number>();\n\t#dispose: Dispose;\n\t#closed = false;\n\n\t/** Follow `track`'s subscription until {@link close}. */\n\tconstructor(track: track.Subscriber) {\n\t\tthis.#track = track;\n\t\tthis.#dispose = track.subscription.subscribe(() => this.#rerank());\n\t}\n\n\t/** The send order for a group at `sequence`, whether or not it has a stream yet. */\n\trank(sequence: number): number {\n\t\treturn sendOrder({\n\t\t\tpriority: this.#track.subscription.peek()?.priority ?? 0,\n\t\t\tposition: this.#position(sequence),\n\t\t});\n\t}\n\n\t/** Rank a group's stream now, and again whenever the ranking changes, until {@link remove}. */\n\tadd(stream: Writer, sequence: number) {\n\t\tthis.#streams.set(stream, sequence);\n\n\t\t// Also covers the stream itself: opening one can block on transport capacity, so an\n\t\t// update that landed while it did predates this registration.\n\t\tthis.#rerank();\n\t}\n\n\t/** Stop ranking a finished group's stream, promoting whatever was queued behind it. */\n\tremove(stream: Writer) {\n\t\tif (!this.#streams.delete(stream)) return;\n\n\t\tif (this.#closed && this.#streams.size === 0) {\n\t\t\tthis.#dispose();\n\t\t} else {\n\t\t\tthis.#rerank();\n\t\t}\n\t}\n\n\t/**\n\t * Stop taking new groups, and release the subscription listener once the last one leaves.\n\t *\n\t * The track can finish while several groups are still draining, and those are the ones the\n\t * subscriber is still waiting on. They keep being promoted as the groups ahead of them\n\t * finish, rather than being stranded at whatever position they held when the track ended.\n\t */\n\tclose() {\n\t\tthis.#closed = true;\n\t\tif (this.#streams.size === 0) this.#dispose();\n\t}\n\n\t// How many of this subscription's groups in flight should be sent before `sequence`.\n\t// Sequences are unique within a subscription, so a group already registered never counts\n\t// itself.\n\t#position(sequence: number): number {\n\t\tconst ordered = this.#track.subscription.peek()?.ordered ?? false;\n\n\t\tlet ahead = 0;\n\t\tfor (const other of this.#streams.values()) {\n\t\t\tif (ordered ? other < sequence : other > sequence) ahead++;\n\t\t}\n\t\treturn ahead;\n\t}\n\n\t#rerank() {\n\t\tconst priority = this.#track.subscription.peek()?.priority ?? 0;\n\t\tfor (const [stream, sequence] of this.#streams) {\n\t\t\tstream.setPriority(sendOrder({ priority, position: this.#position(sequence) }));\n\t\t}\n\t}\n}\n"]}
+{"version":3,"file":"priority.js","sourceRoot":"","sources":["../../src/lite/priority.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAMH,0FAA0F;AAC1F,0FAA0F;AAC1F,8FAA8F;AAC9F,+FAA+F;AAC/F,kCAAkC;AAClC,MAAM,UAAU,GAAG,CAAC,IAAI,EAAE,CAAC;AAE3B,0DAA0D;AAC1D,MAAM,YAAY,GAAG,IAAI,CAAC;AAkB1B;;;;;;;;;;GAUG;AACH,MAAM,UAAU,SAAS,CAAC,EAAE,QAAQ,EAAE,QAAQ,GAAG,CAAC,EAAQ;IACzD,OAAO,CAAC,CAAC,CAAC,YAAY,GAAG,KAAK,CAAC,QAAQ,EAAE,YAAY,CAAC,CAAC,GAAG,UAAU,GAAG,KAAK,CAAC,QAAQ,EAAE,UAAU,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AAC7G,CAAC;AAED,8FAA8F;AAC9F,6EAA6E;AAC7E,SAAS,KAAK,CAAC,KAAa,EAAE,GAAW;IACxC,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;AACtD,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,MAAM,OAAO,QAAQ;IACpB,MAAM,CAAmB;IACzB,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IACrC,QAAQ,CAAU;IAClB,OAAO,GAAG,KAAK,CAAC;IAEhB,yDAAyD;IACzD,YAAY,KAAuB;QAClC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,YAAY,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;IACpE,CAAC;IAED,oFAAoF;IACpF,IAAI,CAAC,QAAgB;QACpB,OAAO,SAAS,CAAC;YAChB,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,IAAI,EAAE,EAAE,QAAQ,IAAI,CAAC;YACxD,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC;SAClC,CAAC,CAAC;IACJ,CAAC;IAED,+FAA+F;IAC/F,GAAG,CAAC,MAAc,EAAE,QAAgB;QACnC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QAEpC,oFAAoF;QACpF,8DAA8D;QAC9D,IAAI,CAAC,OAAO,EAAE,CAAC;IAChB,CAAC;IAED,uFAAuF;IACvF,MAAM,CAAC,MAAc;QACpB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC;YAAE,OAAO;QAE1C,IAAI,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAC9C,IAAI,CAAC,QAAQ,EAAE,CAAC;QACjB,CAAC;aAAM,CAAC;YACP,IAAI,CAAC,OAAO,EAAE,CAAC;QAChB,CAAC;IACF,CAAC;IAED;;;;;;OAMG;IACH,KAAK;QACJ,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;QACpB,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC;YAAE,IAAI,CAAC,QAAQ,EAAE,CAAC;IAC/C,CAAC;IAED,qFAAqF;IACrF,yFAAyF;IACzF,UAAU;IACV,SAAS,CAAC,QAAgB;QACzB,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YAC5C,IAAI,KAAK,GAAG,QAAQ;gBAAE,KAAK,EAAE,CAAC;QAC/B,CAAC;QACD,OAAO,KAAK,CAAC;IACd,CAAC;IAED,OAAO;QACN,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,IAAI,EAAE,EAAE,QAAQ,IAAI,CAAC,CAAC;QAChE,KAAK,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAChD,MAAM,CAAC,WAAW,CAAC,SAAS,CAAC,EAAE,QAAQ,EAAE,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;QACjF,CAAC;IACF,CAAC;CACD","sourcesContent":["/**\n * Stream prioritization for moq-lite, mirroring the Rust `lite::priority` queue.\n *\n * @module\n */\n\nimport type { Dispose } from \"@moq/signals\";\nimport type { Writer } from \"../stream.ts\";\nimport type * as track from \"../track.ts\";\n\n// The transport compares send orders as a single number, so the two ranks are packed into\n// disjoint ranges: the track priority takes the high bits so it always dominates, and the\n// position below it. Group data stays negative so protocol streams at the transport's default\n// order of 0 always make progress. A u8 priority and 44-bit position fill the negative half of\n// the safe integer range exactly.\nconst GROUP_SPAN = 2 ** 44;\n\n/** The highest track priority the wire carries (a u8). */\nconst MAX_PRIORITY = 0xff;\n\n/**\n * What to rank a group stream by.\n *\n * @internal\n */\nexport interface Rank {\n\t/** The subscriber's track priority, which outweighs everything below it. */\n\tpriority: number;\n\n\t/**\n\t * Where the group sits in the queue its own subscription wants sent, 0 being the one to\n\t * send next. Defaults to 0, which is right for a stream that is the only one of its kind.\n\t */\n\tposition?: number;\n}\n\n/**\n * The transport send order for a group, where HIGHER values are transmitted first.\n *\n * A higher `priority` always wins. Below it, a group is ranked by its `position` in its own\n * subscription rather than by its sequence, so two tracks at the same priority interleave:\n * each one's next group ties with the other's, whatever their group numbering. Comparing\n * sequences instead would let a track that had been running longer, or that numbered its\n * groups from a clock, starve one that started later.\n *\n * @internal\n */\nexport function sendOrder({ priority, position = 0 }: Rank): number {\n\treturn -((MAX_PRIORITY - clamp(priority, MAX_PRIORITY)) * GROUP_SPAN + clamp(position, GROUP_SPAN - 1) + 1);\n}\n\n// Both ranks are bounded: the priority by its wire type, the position by the space left below\n// it. Anything outside is a caller bug rather than a value worth preserving.\nfunction clamp(value: number, max: number): number {\n\treturn Math.min(Math.max(Math.trunc(value), 0), max);\n}\n\n/**\n * Ranks one subscription's group streams against each other, and re-ranks them whenever the\n * set changes or the subscription is updated.\n *\n * A group's rank is its position among the groups in flight, so which group goes first is\n * decided here rather than by arithmetic on sequence numbers. Newest first, always: under\n * congestion that sheds the backlog rather than the live edge, and a subscriber wanting\n * sequence order reorders locally rather than asking the wire for it.\n *\n * One listener covers the whole subscription. A listener per group would instead pile up on\n * it, and a track that stalls with many groups open would trip the signals leak guard.\n *\n * @internal\n */\nexport class Priority {\n\t#track: track.Subscriber;\n\t#streams = new Map<Writer, number>();\n\t#dispose: Dispose;\n\t#closed = false;\n\n\t/** Follow `track`'s subscription until {@link close}. */\n\tconstructor(track: track.Subscriber) {\n\t\tthis.#track = track;\n\t\tthis.#dispose = track.subscription.subscribe(() => this.#rerank());\n\t}\n\n\t/** The send order for a group at `sequence`, whether or not it has a stream yet. */\n\trank(sequence: number): number {\n\t\treturn sendOrder({\n\t\t\tpriority: this.#track.subscription.peek()?.priority ?? 0,\n\t\t\tposition: this.#position(sequence),\n\t\t});\n\t}\n\n\t/** Rank a group's stream now, and again whenever the ranking changes, until {@link remove}. */\n\tadd(stream: Writer, sequence: number) {\n\t\tthis.#streams.set(stream, sequence);\n\n\t\t// Also covers the stream itself: opening one can block on transport capacity, so an\n\t\t// update that landed while it did predates this registration.\n\t\tthis.#rerank();\n\t}\n\n\t/** Stop ranking a finished group's stream, promoting whatever was queued behind it. */\n\tremove(stream: Writer) {\n\t\tif (!this.#streams.delete(stream)) return;\n\n\t\tif (this.#closed && this.#streams.size === 0) {\n\t\t\tthis.#dispose();\n\t\t} else {\n\t\t\tthis.#rerank();\n\t\t}\n\t}\n\n\t/**\n\t * Stop taking new groups, and release the subscription listener once the last one leaves.\n\t *\n\t * The track can finish while several groups are still draining, and those are the ones the\n\t * subscriber is still waiting on. They keep being promoted as the groups ahead of them\n\t * finish, rather than being stranded at whatever position they held when the track ended.\n\t */\n\tclose() {\n\t\tthis.#closed = true;\n\t\tif (this.#streams.size === 0) this.#dispose();\n\t}\n\n\t// How many of this subscription's groups in flight should be sent before `sequence`.\n\t// Sequences are unique within a subscription, so a group already registered never counts\n\t// itself.\n\t#position(sequence: number): number {\n\t\tlet ahead = 0;\n\t\tfor (const other of this.#streams.values()) {\n\t\t\tif (other > sequence) ahead++;\n\t\t}\n\t\treturn ahead;\n\t}\n\n\t#rerank() {\n\t\tconst priority = this.#track.subscription.peek()?.priority ?? 0;\n\t\tfor (const [stream, sequence] of this.#streams) {\n\t\t\tstream.setPriority(sendOrder({ priority, position: this.#position(sequence) }));\n\t\t}\n\t}\n}\n"]}

package/lite/publisher.d.ts

@@ -1,70 +1,2 @@
-import type * as broadcast from "../broadcast";
-import type { Origin } from "../origin";
-import * as Path from "../path";
-import { type Stream } from "../stream";
-import { type AnnounceRequest } from "./announce";
-import type { Fetch } from "./fetch";
-import { type Subscribe } from "./subscribe";
-import { type Track as TrackMessage } from "./track";
-import { Version } from "./version";
-/**
- * Handles publishing broadcasts and managing their lifecycle.
- *
- * @internal
- */
-export declare class Publisher {
-    #private;
-    readonly version: Version;
-    readonly origin: Origin;
-    /**
-     * Creates a new Publisher instance.
-     * @param quic - The WebTransport session to use
-     * @param version - Negotiated protocol version
-     * @param origin - Origin id shared with the Subscriber
-     *
-     * @internal
-     */
-    constructor(quic: WebTransport, version: Version, origin: Origin);
-    /**
-     * Publishes a broadcast with any associated tracks.
-     * @param name - The broadcast to publish
-     */
-    publish(path: Path.Valid, broadcast: broadcast.Producer): void;
-    /**
-     * Handles an announce interest message.
-     * @param msg - The announce interest message
-     * @param stream - The stream to write announcements to
-     *
-     * @internal
-     */
-    runAnnounce(msg: AnnounceRequest, stream: Stream): Promise<void>;
-    /**
-     * Handles a subscribe message.
-     * @param msg - The subscribe message
-     * @param stream - The stream to write track data to
-     *
-     * @internal
-     */
-    runSubscribe(msg: Subscribe, stream: Stream): Promise<void>;
-    /**
-     * Handles a FETCH stream by serving one group as bare frame records (lite-05+).
-     *
-     * @internal
-     */
-    runFetch(msg: Fetch, stream: Stream): Promise<void>;
-    /**
-     * Answers a TRACK stream (0x6) with a single TRACK_INFO, then FINs.
-     *
-     * @internal
-     */
-    runTrackInfo(msg: TrackMessage, stream: Stream): Promise<void>;
-    /**
-     * Handles a probe stream by periodically reporting estimated bitrate.
-     * @param stream - The probe bidi stream
-     *
-     * @internal
-     */
-    runProbe(stream: Stream): Promise<void>;
-    close(): void;
-}
+export {};
 //# sourceMappingURL=publisher.d.ts.map

package/lite/publisher.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"publisher.d.ts","sourceRoot":"","sources":["../../src/lite/publisher.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,KAAK,SAAS,MAAM,iBAAiB,CAAC;AAGlD,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AAC3C,OAAO,KAAK,IAAI,MAAM,YAAY,CAAC;AACnC,OAAO,EAAE,KAAK,MAAM,EAAU,MAAM,cAAc,CAAC;AAGnD,OAAO,EAA4B,KAAK,eAAe,EAA2B,MAAM,eAAe,CAAC;AAGxG,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAIxC,OAAO,EAEN,KAAK,SAAS,EAKd,MAAM,gBAAgB,CAAC;AACxB,OAAO,EAAiC,KAAK,KAAK,IAAI,YAAY,EAAE,MAAM,YAAY,CAAC;AACvF,OAAO,EAA2D,OAAO,EAAE,MAAM,cAAc,CAAC;AA4ChG;;;;GAIG;AACH,qBAAa,SAAS;;IAErB,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;IAM1B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IAoBxB;;;;;;;OAOG;IACH,YAAY,IAAI,EAAE,YAAY,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAU/D;IAED;;;OAGG;IACH,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,SAAS,EAAE,SAAS,CAAC,QAAQ,QActD;IAED;;;;;;OAMG;IACG,WAAW,CAAC,GAAG,EAAE,eAAe,EAAE,MAAM,EAAE,MAAM,iBA2GrD;IAED;;;;;;OAMG;IACG,YAAY,CAAC,GAAG,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,iBA6FhD;IAED;;;;OAIG;IACG,QAAQ,CAAC,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,iBAkCxC;IAsFD;;;;OAIG;IACG,YAAY,CAAC,GAAG,EAAE,YAAY,EAAE,MAAM,EAAE,MAAM,iBAUnD;IAgKD;;;;;OAKG;IACG,QAAQ,CAAC,MAAM,EAAE,MAAM,iBAiF5B;IAED,KAAK,SAWJ;CACD"}
+{"version":3,"file":"publisher.d.ts","sourceRoot":"","sources":["../../src/lite/publisher.ts"],"names":[],"mappings":""}