@norskvideo/moq-net 0.1.3 → 0.1.4

package/track.js.map

@@ -1 +1 @@
-{"version":3,"file":"track.js","sourceRoot":"","sources":["../src/track.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AACtC,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAEnC,iHAAiH;AACjH,MAAM,OAAO,UAAU;IACtB,MAAM,GAAG,IAAI,MAAM,CAAU,EAAE,CAAC,CAAC;IACjC,MAAM,GAAG,IAAI,MAAM,CAAkB,KAAK,CAAC,CAAC;IAC5C,QAAQ,GAAG,IAAI,MAAM,CAAqB,SAAS,CAAC,CAAC;CACrD;AAED,sEAAsE;AACtE,MAAM,OAAO,KAAK;IACjB,+CAA+C;IACtC,IAAI,CAAS;IAEtB,8BAA8B;IAC9B,KAAK,GAAG,IAAI,UAAU,EAAE,CAAC;IACzB,KAAK,CAAU;IACf,aAAa,GAAG,CAAC,CAAC;IAElB,gEAAgE;IACvD,MAAM,CAA6B;IAE5C,YAAY,IAAY;QACvB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QAEjB,IAAI,CAAC,MAAM,GAAG,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE;YACrC,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,MAAM,EAAE,EAAE;gBACtD,IAAI,CAAC,MAAM;oBAAE,OAAO;gBACpB,OAAO,CAAC,MAAM,YAAY,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;gBACtD,OAAO,EAAE,CAAC;YACX,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC,CAAC;IACJ,CAAC;IAED;;;OAGG;IACH,WAAW;QACV,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE;YAAE,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC;QAEjE,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC;QAEzC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,QAAQ,GAAG,CAAC,CAAC;QAChC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE;YACnC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnB,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;QAChD,CAAC,CAAC,CAAC;QAEH,OAAO,KAAK,CAAC;IACd,CAAC;IAED;;;OAGG;IACH,UAAU,CAAC,KAAY;QACtB,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE;YAAE,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC;QAEjE,8DAA8D;QAC9D,IAAI,KAAK,CAAC,QAAQ,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,EAAE,CAAC;YACzC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,QAAQ,GAAG,CAAC,CAAC;QACjC,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE;YACnC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnB,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;QAChD,CAAC,CAAC,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACH,UAAU,CAAC,KAAiB;QAC3B,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QACjC,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACxB,KAAK,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IAED,mEAAmE;IACnE,WAAW,CAAC,GAAW;QACtB,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QACjC,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QACvB,KAAK,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IAED,uEAAuE;IACvE,SAAS,CAAC,IAAa;QACtB,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QACjC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QACtB,KAAK,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IAED,oEAAoE;IACpE,SAAS,CAAC,IAAa;QACtB,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QACjC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QACtB,KAAK,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,SAAS;QACd,SAAS,CAAC;YACT,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YACxC,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACvB,OAAO,MAAM,CAAC,KAAK,EAAE,CAAC;YACvB,CAAC;YAED,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YACxC,IAAI,MAAM,YAAY,KAAK;gBAAE,MAAM,MAAM,CAAC;YAC1C,IAAI,MAAM;gBAAE,OAAO,SAAS,CAAC;YAE7B,MAAM,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QACzD,CAAC;IACF,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,SAAS;QACd,OAAO,IAAI,CAAC,SAAS,EAAE,CAAC;IACzB,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,gBAAgB;QACrB,SAAS,CAAC;YACT,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,SAAS,EAAE,CAAC;YACrC,IAAI,CAAC,KAAK;gBAAE,OAAO,SAAS,CAAC;YAC7B,IAAI,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;gBACzC,KAAK,CAAC,KAAK,EAAE,CAAC;gBACd,SAAS;YACV,CAAC;YACD,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC,QAAQ,GAAG,CAAC,CAAC;YACxC,OAAO,KAAK,CAAC;QACd,CAAC;IACF,CAAC;IAED,uEAAuE;IACvE,KAAK,CAAC,SAAS;QACd,OAAO,CAAC,MAAM,IAAI,CAAC,iBAAiB,EAAE,CAAC,EAAE,IAAI,CAAC;IAC/C,CAAC;IAED,4EAA4E;IAC5E,KAAK,CAAC,iBAAiB;QACtB,SAAS,CAAC;YACT,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YAExC,sBAAsB;YACtB,OAAO,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1B,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,oBAAoB,EAAE,CAAC;gBAC9C,IAAI,IAAI,EAAE,CAAC;oBACV,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,KAAK,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC;gBAC7E,CAAC;gBAED,sBAAsB;gBACtB,MAAM,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,CAAC;YACzB,CAAC;YAED,4CAA4C;YAC5C,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACzB,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;gBACxC,IAAI,MAAM,YAAY,KAAK;oBAAE,MAAM,MAAM,CAAC;gBAC1C,IAAI,MAAM;oBAAE,OAAO,SAAS,CAAC;gBAE7B,MAAM,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;gBACxD,SAAS;YACV,CAAC;YAED,wCAAwC;YACxC,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACxB,MAAM,IAAI,GAAG,KAAK,CAAC,oBAAoB,EAAE,CAAC;YAC1C,IAAI,IAAI,EAAE,CAAC;gBACV,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,QAAQ,EAAE,KAAK,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC;YACzE,CAAC;YAED,4CAA4C;YAC5C,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YACxC,IAAI,MAAM,YAAY,KAAK;gBAAE,MAAM,MAAM,CAAC;YAC1C,IAAI,MAAM;gBAAE,OAAO,SAAS,CAAC;YAE7B,yFAAyF;YACzF,4FAA4F;YAC5F,4EAA4E;YAC5E,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC;gBAChB,MAAM,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YACzD,CAAC;iBAAM,CAAC;gBACP,MAAM,OAAO,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;YAC3F,CAAC;QACF,CAAC;IACF,CAAC;IAED,6DAA6D;IAC7D,KAAK,CAAC,UAAU;QACf,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,SAAS,EAAE,CAAC;QACpC,IAAI,CAAC,IAAI;YAAE,OAAO,SAAS,CAAC;QAC5B,OAAO,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC;IAED,kDAAkD;IAClD,KAAK,CAAC,QAAQ;QACb,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC;QACrC,IAAI,CAAC,IAAI;YAAE,OAAO,SAAS,CAAC;QAC5B,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACzB,CAAC;IAED,gGAAgG;IAChG,KAAK,CAAC,QAAQ;QACb,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,SAAS,EAAE,CAAC;QACpC,IAAI,CAAC,IAAI;YAAE,OAAO,SAAS,CAAC;QAC5B,IAAI,IAAI,CAAC,UAAU,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,oBAAoB,CAAC,CAAC;QACtG,OAAO,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IACtB,CAAC;IAED;;;OAGG;IACH,cAAc,CAAC,QAAgB;QAC9B,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;IACzC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,KAAa;QAClB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC;QAErC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;YAC9C,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QACpB,CAAC;IACF,CAAC;CACD","sourcesContent":["import { Signal } from \"@moq/signals\";\nimport { Group } from \"./group.ts\";\n\n/** Reactive backing state for a {@link Track}: buffered groups, a closed flag, and the subscription priority. */\nexport class TrackState {\n\tgroups = new Signal<Group[]>([]);\n\tclosed = new Signal<boolean | Error>(false);\n\tpriority = new Signal<number | undefined>(undefined);\n}\n\n/** A live stream of groups within a broadcast, identified by name. */\nexport class Track {\n\t/** Name of this track within its broadcast. */\n\treadonly name: string;\n\n\t/** Reactive backing state. */\n\tstate = new TrackState();\n\t#next?: number;\n\t#nextSequence = 0;\n\n\t/** Resolves with the abort error (or undefined) once closed. */\n\treadonly closed: Promise<Error | undefined>;\n\n\tconstructor(name: string) {\n\t\tthis.name = name;\n\n\t\tthis.closed = new Promise((resolve) => {\n\t\t\tconst dispose = this.state.closed.subscribe((closed) => {\n\t\t\t\tif (!closed) return;\n\t\t\t\tresolve(closed instanceof Error ? closed : undefined);\n\t\t\t\tdispose();\n\t\t\t});\n\t\t});\n\t}\n\n\t/**\n\t * Appends a new group to the track.\n\t * @returns A GroupProducer for the new group\n\t */\n\tappendGroup(): Group {\n\t\tif (this.state.closed.peek()) throw new Error(\"track is closed\");\n\n\t\tconst group = new Group(this.#next ?? 0);\n\n\t\tthis.#next = group.sequence + 1;\n\t\tthis.state.groups.mutate((groups) => {\n\t\t\tgroups.push(group);\n\t\t\tgroups.sort((a, b) => a.sequence - b.sequence);\n\t\t});\n\n\t\treturn group;\n\t}\n\n\t/**\n\t * Inserts an existing group into the track.\n\t * @param group - The group to insert\n\t */\n\twriteGroup(group: Group) {\n\t\tif (this.state.closed.peek()) throw new Error(\"track is closed\");\n\n\t\t// Only advance #next upward (for appendGroup auto-increment).\n\t\tif (group.sequence >= (this.#next ?? 0)) {\n\t\t\tthis.#next = group.sequence + 1;\n\t\t}\n\n\t\tthis.state.groups.mutate((groups) => {\n\t\t\tgroups.push(group);\n\t\t\tgroups.sort((a, b) => a.sequence - b.sequence);\n\t\t});\n\t}\n\n\t/**\n\t * Appends a frame to the track in its own group.\n\t *\n\t * @param frame - The frame to append\n\t */\n\twriteFrame(frame: Uint8Array) {\n\t\tconst group = this.appendGroup();\n\t\tgroup.writeFrame(frame);\n\t\tgroup.close();\n\t}\n\n\t/** Appends a string to the track as its own single-frame group. */\n\twriteString(str: string) {\n\t\tconst group = this.appendGroup();\n\t\tgroup.writeString(str);\n\t\tgroup.close();\n\t}\n\n\t/** Appends a JSON value to the track as its own single-frame group. */\n\twriteJson(json: unknown) {\n\t\tconst group = this.appendGroup();\n\t\tgroup.writeJson(json);\n\t\tgroup.close();\n\t}\n\n\t/** Appends a boolean to the track as its own single-frame group. */\n\twriteBool(bool: boolean) {\n\t\tconst group = this.appendGroup();\n\t\tgroup.writeBool(bool);\n\t\tgroup.close();\n\t}\n\n\t/**\n\t * Receive the next group available on this track, in arrival order.\n\t *\n\t * Groups may arrive out of order or with gaps due to network conditions.\n\t * Use {@link nextGroupOrdered} if you need groups in sequence order,\n\t * skipping those that arrive too late.\n\t */\n\tasync recvGroup(): Promise<Group | undefined> {\n\t\tfor (;;) {\n\t\t\tconst groups = this.state.groups.peek();\n\t\t\tif (groups.length > 0) {\n\t\t\t\treturn groups.shift();\n\t\t\t}\n\n\t\t\tconst closed = this.state.closed.peek();\n\t\t\tif (closed instanceof Error) throw closed;\n\t\t\tif (closed) return undefined;\n\n\t\t\tawait Signal.race(this.state.groups, this.state.closed);\n\t\t}\n\t}\n\n\t/**\n\t * @deprecated Use {@link recvGroup} for arrival order, or {@link nextGroupOrdered} for sequence order.\n\t */\n\tasync nextGroup(): Promise<Group | undefined> {\n\t\treturn this.recvGroup();\n\t}\n\n\t/**\n\t * Return the next group with a strictly-greater sequence number than the last returned.\n\t *\n\t * Late arrivals (with a sequence number at or below the last one returned) are silently skipped.\n\t *\n\t * NOTE: This will be renamed to `nextGroup` in the next major version.\n\t */\n\tasync nextGroupOrdered(): Promise<Group | undefined> {\n\t\tfor (;;) {\n\t\t\tconst group = await this.recvGroup();\n\t\t\tif (!group) return undefined;\n\t\t\tif (group.sequence < this.#nextSequence) {\n\t\t\t\tgroup.close();\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tthis.#nextSequence = group.sequence + 1;\n\t\t\treturn group;\n\t\t}\n\t}\n\n\t/** Reads the next frame across all groups, discarding older groups. */\n\tasync readFrame(): Promise<Uint8Array | undefined> {\n\t\treturn (await this.readFrameSequence())?.data;\n\t}\n\n\t/** Reads the next frame along with its group and frame sequence numbers. */\n\tasync readFrameSequence(): Promise<{ group: number; frame: number; data: Uint8Array } | undefined> {\n\t\tfor (;;) {\n\t\t\tconst groups = this.state.groups.peek();\n\n\t\t\t// Discard old groups.\n\t\t\twhile (groups.length > 1) {\n\t\t\t\tconst next = groups[0].tryReadFrameSequence();\n\t\t\t\tif (next) {\n\t\t\t\t\treturn { group: groups[0].sequence, frame: next.sequence, data: next.data };\n\t\t\t\t}\n\n\t\t\t\t// Skip this old group\n\t\t\t\tgroups.shift()?.close();\n\t\t\t}\n\n\t\t\t// If there's no groups, wait for a new one.\n\t\t\tif (groups.length === 0) {\n\t\t\t\tconst closed = this.state.closed.peek();\n\t\t\t\tif (closed instanceof Error) throw closed;\n\t\t\t\tif (closed) return undefined;\n\n\t\t\t\tawait Signal.race(this.state.groups, this.state.closed);\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\t// If there's a group, wait for a frame.\n\t\t\tconst group = groups[0];\n\t\t\tconst next = group.tryReadFrameSequence();\n\t\t\tif (next) {\n\t\t\t\treturn { group: group.sequence, frame: next.sequence, data: next.data };\n\t\t\t}\n\n\t\t\t// If the track is closed, return undefined.\n\t\t\tconst closed = this.state.closed.peek();\n\t\t\tif (closed instanceof Error) throw closed;\n\t\t\tif (closed) return undefined;\n\n\t\t\t// Wake on a new group or the track closing. Only fold in the current group's readability\n\t\t\t// while it can still deliver frames: a finished group's readable() resolves immediately, so\n\t\t\t// racing it would busy-loop until a newer group arrives instead of waiting.\n\t\t\tif (group.done) {\n\t\t\t\tawait Signal.race(this.state.groups, this.state.closed);\n\t\t\t} else {\n\t\t\t\tawait Promise.race([Signal.race(this.state.groups, this.state.closed), group.readable()]);\n\t\t\t}\n\t\t}\n\t}\n\n\t/** Reads the next frame and decodes it as a UTF-8 string. */\n\tasync readString(): Promise<string | undefined> {\n\t\tconst next = await this.readFrame();\n\t\tif (!next) return undefined;\n\t\treturn new TextDecoder().decode(next);\n\t}\n\n\t/** Reads the next frame and parses it as JSON. */\n\tasync readJson(): Promise<unknown | undefined> {\n\t\tconst next = await this.readString();\n\t\tif (!next) return undefined;\n\t\treturn JSON.parse(next);\n\t}\n\n\t/** Reads the next frame and decodes it as a one-byte boolean, throwing on a malformed frame. */\n\tasync readBool(): Promise<boolean | undefined> {\n\t\tconst next = await this.readFrame();\n\t\tif (!next) return undefined;\n\t\tif (next.byteLength !== 1 || !(next[0] === 0 || next[0] === 1)) throw new Error(\"invalid bool frame\");\n\t\treturn next[0] === 1;\n\t}\n\n\t/**\n\t * Update the subscription priority. Triggers a SUBSCRIBE_UPDATE\n\t * to the publisher when used on a subscribed track.\n\t */\n\tupdatePriority(priority: number) {\n\t\tthis.state.priority.set(priority, true);\n\t}\n\n\t/**\n\t * Closes the publisher and all associated groups.\n\t */\n\tclose(abort?: Error) {\n\t\tthis.state.closed.set(abort ?? true);\n\n\t\tfor (const group of this.state.groups.peek()) {\n\t\t\tgroup.close(abort);\n\t\t}\n\t}\n}\n"]}
+{"version":3,"file":"track.js","sourceRoot":"","sources":["../src/track.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,OAAO,EAAgC,IAAI,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AAE1E,OAAO,EAA8C,QAAQ,IAAI,aAAa,EAAE,MAAM,EAAE,MAAM,YAAY,CAAC;AAC3G,OAAO,EAAE,KAAK,EAAqE,MAAM,eAAe,CAAC;AACzG,OAAO,EAAE,SAAS,EAAkB,MAAM,WAAW,CAAC;AAItD,iGAAiG;AACjG,MAAM,CAAC,MAAM,sBAAsB,GAAG,IAAI,CAAC;AAE3C;;;;;;GAMG;AACH,MAAM,mBAAmB,GAAG,EAAE,CAAC;AAK/B;;;;GAIG;AACH,MAAM,kBAAkB,GAAG,KAAK,CAAC;AAuCjC,iEAAiE;AACjE,MAAM,UAAU,YAAY,CAAC,IAAI,GAAkB,EAAE;IACpD,OAAO;QACN,SAAS,EAAE,IAAI,CAAC,SAAS,IAAI,SAAS,CAAC,KAAK;QAC5C,UAAU,EAAE,IAAI,CAAC,UAAU,IAAI,sBAAsB;QACrD,QAAQ,EAAE,IAAI,CAAC,QAAQ,IAAI,CAAC;QAC5B,OAAO,EAAE,IAAI,CAAC,OAAO,IAAI,KAAK;KAC9B,CAAC;AACH,CAAC;AAmBD,oFAAoF;AACpF,sEAAsE;AACtE,SAAS,oBAAoB,CAAC,YAAY,GAAiB,EAAE;IAC5D,OAAO;QACN,QAAQ,EAAE,YAAY,CAAC,QAAQ,IAAI,CAAC;QACpC,OAAO,EAAE,YAAY,CAAC,OAAO,IAAI,KAAK;QACtC,UAAU,EAAE,YAAY,CAAC,UAAU,IAAI,CAAC;QACxC,UAAU,EAAE,YAAY,CAAC,UAAU;QACnC,QAAQ,EAAE,YAAY,CAAC,QAAQ;KAC/B,CAAC;AACH,CAAC;AAED,mGAAmG;AACnG,SAAS,oBAAoB,CAAC,MAA4B;IACzD,IAAI,QAAkC,CAAC;IACvC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC5B,MAAM,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QACzC,IAAI,CAAC,YAAY;YAAE,SAAS;QAC5B,IAAI,CAAC,QAAQ,EAAE,CAAC;YACf,QAAQ,GAAG,EAAE,GAAG,YAAY,EAAE,CAAC;YAC/B,SAAS;QACV,CAAC;QAED,QAAQ,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,IAAI,CAAC,EAAE,YAAY,CAAC,QAAQ,IAAI,CAAC,CAAC,CAAC;QACjF,QAAQ,CAAC,OAAO,GAAG,CAAC,QAAQ,CAAC,OAAO,IAAI,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,OAAO,IAAI,KAAK,CAAC,CAAC;QAClF,QAAQ,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,UAAU,IAAI,CAAC,EAAE,YAAY,CAAC,UAAU,IAAI,CAAC,CAAC,CAAC;QAEvF,IAAI,YAAY,CAAC,UAAU,KAAK,SAAS,EAAE,CAAC;YAC3C,QAAQ,CAAC,UAAU;gBAClB,QAAQ,CAAC,UAAU,KAAK,SAAS;oBAChC,CAAC,CAAC,YAAY,CAAC,UAAU;oBACzB,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,UAAU,EAAE,YAAY,CAAC,UAAU,CAAC,CAAC;QAC5D,CAAC;QAED,IAAI,QAAQ,CAAC,QAAQ,KAAK,SAAS,IAAI,YAAY,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC5E,QAAQ,CAAC,QAAQ,GAAG,SAAS,CAAC;QAC/B,CAAC;aAAM,CAAC;YACP,QAAQ,CAAC,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,EAAE,YAAY,CAAC,QAAQ,CAAC,CAAC;QACxE,CAAC;IACF,CAAC;IACD,OAAO,QAAQ,CAAC;AACjB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,OAAO,OAAO;IACnB,gCAAgC;IACvB,IAAI,CAAS;IAEtB,SAAS,CAAW;IACpB,UAAU,CAAiB;IAE3B,YAAoB,OAA4B;QAC/C,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC;QACzB,IAAI,CAAC,SAAS,GAAG,OAAO,CAAC,QAAQ,CAAC;QAClC,IAAI,CAAC,UAAU,GAAG,OAAO,CAAC,SAAS,CAAC;IACrC,CAAC;IAED;QACC,KAAK,CAAC,WAAW,GAAG,CAAC,OAAO,EAAE,EAAE,CAAC,IAAI,OAAO,CAAC,OAAO,CAAC,CAAC;IACvD,CAAC;IAED,2DAA2D;IAC3D,IAAI,YAAY;QACf,OAAO,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,IAAI,EAAE,IAAI,oBAAoB,EAAE,CAAC;IACrE,CAAC;IAED,gDAAgD;IAChD,IAAI,QAAQ;QACX,OAAO,IAAI,CAAC,YAAY,CAAC,QAAQ,IAAI,CAAC,CAAC;IACxC,CAAC;IAED,yEAAyE;IACzE,MAAM,CAAC,IAAI,GAAkB,EAAE;QAC9B,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QACzD,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC;IAED,sEAAsE;IACtE,MAAM,CAAC,GAAW;QACjB,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAC3B,CAAC;CACD;AAwBD;;;;GAIG;AACH,MAAM,OAAO,QAAQ;IACpB,sBAAsB;IACb,IAAI,CAAS;IAEtB,UAAU,CAAY;IAEtB,YAAY,IAAY,EAAE,SAAoB;QAC7C,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;IAC7B,CAAC;IAED,6CAA6C;IAC7C,SAAS,CAAC,OAAsB;QAC/B,OAAO,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;IACtD,CAAC;IAED,4EAA4E;IAC5E,IAAI;QACH,OAAO,IAAI,CAAC,UAAU,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACpD,CAAC;IAED,4EAA4E;IAC5E,UAAU,CAAC,QAAgB,EAAE,OAA2B;QACvD,OAAO,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;IACjE,CAAC;CACD;AAED,yEAAyE;AACzE,6EAA6E;AAC7E,MAAM,UAAU;IACf,yFAAyF;IACzF,QAAQ,CAAY;IACpB,MAAM,GAAG,IAAI,MAAM,CAAkB,EAAE,CAAC,CAAC;IACzC,2GAA2G;IAC3G,SAAS,GAAG,IAAI,MAAM,CAAqB,EAAE,CAAC,CAAC;IAC/C,MAAM,CAAU;IAChB,MAAM,GAAG,IAAI,IAAI,EAAgB,CAAC;IAClC,MAAM,CAAmC;IACzC,mEAAmE;IACnE,IAAI,GAAG,IAAI,MAAM,CAAmB,SAAS,CAAC,CAAC;IAE/C,YAAY,YAA2B;QACtC,IAAI,CAAC,MAAM,GAAG,IAAI,MAAM,CAAC,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,oBAAoB,CAAC,YAAY,CAAC,CAAC,CAAC;IACvG,CAAC;CACD;AAED,4FAA4F;AAC5F,gGAAgG;AAChG,gEAAgE;AAChE,SAAS,eAAe,CAAC,KAAiB,EAAE,KAAa;IACxD,IAAI,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC;IACpD,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC;IAChC,OAAO,IAAI,CAAC;AACb,CAAC;AAED,oFAAoF;AACpF,qFAAqF;AACrF,uFAAuF;AACvF,sDAAsD;AACtD,KAAK,UAAU,WAAW,CAAC,KAAiB;IAC3C,SAAS,CAAC;QACT,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QAC/B,IAAI,IAAI;YAAE,OAAO,IAAI,CAAC;QAEtB,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QACnC,IAAI,MAAM,YAAY,KAAK;YAAE,MAAM,MAAM,CAAC;QAC1C,IAAI,MAAM,KAAK,SAAS;YAAE,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;QAEhF,MAAM,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;IAC7C,CAAC;AACF,CAAC;AAMD,SAAS,YAAY,CAAC,IAAY,EAAE,QAAkB,EAAE,SAAyB;IAChF,IAAI,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACjC,IAAI,CAAC,MAAM,EAAE,CAAC;QACb,MAAM,GAAG,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC;QACrB,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAC7B,CAAC;IACD,oBAAoB,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;AACxC,CAAC;AAED,IAAI,oBAA2E,CAAC;AAEhF,4EAA4E;AAC5E,iFAAiF;AACjF,gBAAgB;AAChB,IAAI,cAA+D,CAAC;AAEpE;;;;;;;;;;;GAWG;AACH,MAAM,OAAO,QAAQ;IACpB,sBAAsB;IACb,IAAI,CAAS;IAEtB,6EAA6E;IAC7E,kDAAkD;IAClD,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;IAC1B,SAAS,GAAkB,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC;IAEvC,8EAA8E;IAC9E,mFAAmF;IACnF,mFAAmF;IACnF,yEAAyE;IACzE,MAAM,GAAkB,EAAE,CAAC;IAE3B,wDAAwD;IACxD,MAAM,GAAG,IAAI,GAAG,EAAc,CAAC;IAE/B,2FAA2F;IAC3F,gGAAgG;IAChG,KAAK,GAAG,IAAI,MAAM,CAAU,KAAK,CAAC,CAAC;IAEnC,YAAY,IAAY;QACvB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IAClB,CAAC;IAED;QACC,oBAAoB,GAAG,CAAC,QAAQ,EAAE,QAAQ,EAAE,EAAE;YAC7C,QAAQ,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC/B,CAAC,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,IAAI;QACH,OAAO,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACjC,CAAC;IAED;;;OAGG;IACH,IAAI,MAAM;QACT,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;IAC3B,CAAC;IAED;;;OAGG;IACH,IAAI,YAAY;QACf,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;IAC3B,CAAC;IAED,yFAAyF;IACzF,MAAM,CAAC,IAAI,GAAkB,EAAE;QAC9B,MAAM,QAAQ,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;QACpC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAC/B,uEAAuE;QACvE,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM;YAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACxD,OAAO,IAAI,CAAC;IACb,CAAC;IAED,sFAAsF;IACtF,SAAS,CAAC,OAAO,GAAiB,EAAE;QACnC,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,OAAO,CAAC,CAAC;QACrC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACpB,OAAO,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IACxC,CAAC;IAED;;;;;;OAMG;IACH,IAAI,IAAI;QACP,OAAO,IAAI,CAAC,KAAK,CAAC;IACnB,CAAC;IAED,sGAAsG;IACtG,KAAK,CAAC,MAAM;QACX,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;YACrE,MAAM,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACnD,CAAC;IACF,CAAC;IAED,oFAAoF;IACpF,iFAAiF;IACjF,gEAAgE;IAChE,QAAQ,CAAC,IAAgB;QACxB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACrB,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;QACrC,IAAI,IAAI;YAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAE9B,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QACzC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YAC1B,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACtB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAErB,gFAAgF;YAChF,oEAAoE;YACpE,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,mBAAmB,EAAE,CAAC,CAAC;YACxE,IAAI,CAAC,mBAAmB,EAAE,CAAC;YAE3B,2EAA2E;YAC3E,4EAA4E;YAC5E,6EAA6E;YAC7E,yDAAyD;YACzD,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE;gBAC3C,IAAI,CAAC,KAAK,SAAS;oBAAE,OAAO;gBAC5B,MAAM,KAAK,GAAG,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;gBACjD,OAAO,EAAE,CAAC;gBACV,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBACzB,IAAI,CAAC,mBAAmB,EAAE,CAAC;gBAC3B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;oBACjC,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;oBACvC,IAAI,MAAM,EAAE,CAAC;wBACZ,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;wBACpB,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;oBAC5B,CAAC;gBACF,CAAC;gBACD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE;oBAAE,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;gBAC3D,OAAO,EAAE,CAAC;gBAEV,8EAA8E;gBAC9E,4EAA4E;gBAC5E,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;YACtC,CAAC,CAAC,CAAC;QACJ,CAAC;QAED,IAAI,CAAC,MAAM,EAAE,CAAC;QACd,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM;YAAE,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAE3D,IAAI,MAAM,KAAK,SAAS;YAAE,eAAe,CAAC,IAAI,EAAE,MAAM,YAAY,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IAC/F,CAAC;IAED,wFAAwF;IACxF,iFAAiF;IACjF,mBAAmB;QAClB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,oBAAoB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAC3D,CAAC;IAED,kFAAkF;IAClF,6EAA6E;IAC7E,yEAAyE;IACzE,OAAO,CAAC,KAAkB,EAAE,IAAgB;QAC3C,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;QACjC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAC7B,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAC;QACvD,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE;YAC7B,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACjB,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;QAChD,CAAC,CAAC,CAAC;IACJ,CAAC;IAED,0EAA0E;IAC1E,MAAM,CAAC,KAAkB;QACxB,KAAK,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;YAC5C,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE;gBAC7B,MAAM,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;gBACjC,IAAI,CAAC,IAAI,CAAC;oBAAE,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACjC,CAAC,CAAC,CAAC;YACH,MAAM,CAAC,KAAK,EAAE,CAAC;QAChB,CAAC;QACD,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;IACvB,CAAC;IAED,uEAAuE;IACvE,MAAM;QACL,MAAM,YAAY,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,UAAU,IAAI,sBAAsB,CAAC;QACnF,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,YAAY,CAAC;QAEzC,MAAM,QAAQ,GAAkB,EAAE,CAAC;QACnC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACjC,IAAI,KAAK,CAAC,IAAI,GAAG,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;gBACpE,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACrB,SAAS;YACV,CAAC;YACD,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACpB,CAAC;QACD,IAAI,CAAC,MAAM,GAAG,QAAQ,CAAC;IACxB,CAAC;IAED,2DAA2D;IAC3D,QAAQ,CAAC,KAAoB;QAC5B,MAAM,KAAK,GAAgB,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,OAAO,EAAE,IAAI,GAAG,EAA6B,EAAE,CAAC;QACtG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACxB,IAAI,CAAC,MAAM,EAAE,CAAC;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM;YAAE,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAC3D,CAAC;IAED,wDAAwD;IACxD,WAAW;QACV,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,SAAS;YAAE,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC;QAEhF,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC;QAChC,MAAM,KAAK,GAAG,IAAI,aAAa,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC/C,QAAQ,CAAC,IAAI,GAAG,KAAK,CAAC,QAAQ,GAAG,CAAC,CAAC;QACnC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAErB,OAAO,KAAK,CAAC;IACd,CAAC;IAED;;;;;;;OAOG;IACH,UAAU,CAAC,KAAoB;QAC9B,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,SAAS;YAAE,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC;QAEhF,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,KAAK,KAAK,CAAC,QAAQ,CAAC,CAAC;QAC3F,IAAI,QAAQ,IAAI,CAAC,EAAE,CAAC;YACnB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;YACpC,IAAI,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,YAAY,KAAK,CAAC,EAAE,CAAC;gBACnD,MAAM,IAAI,KAAK,CAAC,6BAA6B,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC;YAChE,CAAC;YACD,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACnB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QACjC,CAAC;QAED,2EAA2E;QAC3E,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC;QAChC,IAAI,KAAK,CAAC,QAAQ,IAAI,QAAQ,CAAC,IAAI,EAAE,CAAC;YACrC,QAAQ,CAAC,IAAI,GAAG,KAAK,CAAC,QAAQ,GAAG,CAAC,CAAC;QACpC,CAAC;QAED,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;IACtB,CAAC;IAED,0FAA0F;IAC1F,sFAAsF;IACtF,gBAAgB,CAAC,QAAkB;QAClC,MAAM,GAAG,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;QAC9B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE;gBAC9B,IAAI,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC;gBACnC,mDAAmD;gBACnD,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,GAAG,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,mBAAmB;oBAAE,IAAI,CAAC,KAAK,EAAE,CAAC;YAClF,CAAC,CAAC,CAAC;QACJ,CAAC;IACF,CAAC;IAED;;;;;;;;;;;OAWG;IACH,cAAc,CAAC,SAAoB,EAAE,OAAmB;QACvD,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,SAAS;YAAE,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC;QAChF,IAAI,OAAO,CAAC,UAAU,GAAG,kBAAkB;YAAE,MAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC,CAAC;QAE3F,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC;QAC/B,MAAM,QAAQ,GAAG,OAAO,CAAC,IAAI,CAAC;QAC9B,OAAO,CAAC,IAAI,GAAG,QAAQ,GAAG,CAAC,CAAC;QAC5B,IAAI,CAAC,gBAAgB,CAAC,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC,CAAC;QACxD,OAAO,QAAQ,CAAC;IACjB,CAAC;IAED;;;;;;OAMG;IACH,aAAa,CAAC,QAAkB;QAC/B,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,SAAS;YAAE,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC;QAChF,IAAI,QAAQ,CAAC,OAAO,CAAC,UAAU,GAAG,kBAAkB;YAAE,MAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC,CAAC;QAEpG,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC;QAChC,IAAI,QAAQ,CAAC,QAAQ,IAAI,QAAQ,CAAC,IAAI,EAAE,CAAC;YACxC,QAAQ,CAAC,IAAI,GAAG,QAAQ,CAAC,QAAQ,GAAG,CAAC,CAAC;QACvC,CAAC;QACD,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;IACjC,CAAC;IAED,6FAA6F;IAC7F,KAAK,CAAC,KAAa;QAClB,eAAe,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACpC,KAAK,MAAM,EAAE,KAAK,EAAE,IAAI,IAAI,CAAC,MAAM;YAAE,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QACxD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE;gBAAE,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YAC3D,eAAe,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAC9B,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;IACrB,CAAC;IAED,oDAAoD;IACpD,UAAU,CAAC,KAAY;QACtB,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QACjC,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACxB,KAAK,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IAED,mEAAmE;IACnE,WAAW,CAAC,GAAW;QACtB,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QACjC,KAAK,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QACvB,KAAK,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IAED,uEAAuE;IACvE,SAAS,CAAC,IAAa;QACtB,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QACjC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QACtB,KAAK,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;IAED,oEAAoE;IACpE,SAAS,CAAC,IAAa;QACtB,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QACjC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QACtB,KAAK,CAAC,KAAK,EAAE,CAAC;IACf,CAAC;CACD;AAED;;;;;;GAMG;AACH,MAAM,OAAO,UAAU;IACtB,sBAAsB;IACb,IAAI,CAAS;IAEtB,MAAM,CAAa;IACnB,aAAa,GAAG,CAAC,CAAC;IAClB,OAAO,GAAG,IAAI,MAAM,CAAkC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;IAEpE,YAAoB,IAAY,EAAE,KAAiB;QAClD,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACrB,CAAC;IAED;QACC,cAAc,GAAG,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,UAAU,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;IAC/D,CAAC;IAED;;;;;;OAMG;IACH,IAAI;QACH,OAAO,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACjC,CAAC;IAED,kEAAkE;IAClE,IAAI,MAAM;QACT,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;IAC3B,CAAC;IAED,yFAAyF;IACzF,IAAI,YAAY;QACf,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;IAC3B,CAAC;IAED,uEAAuE;IACvE,MAAM;QACL,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;IAC3B,CAAC;IAED;;;;;;;OAOG;IACH,OAAO;QACN,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;QAClC,IAAI,MAAM,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QAE3C,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QACzC,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACzC,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,QAAQ,KAAK,MAAM;YAAE,OAAO,SAAS,CAAC;QAE5D,KAAK,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;YACnC,IAAI,KAAK,GAAG,CAAC;gBAAE,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC;QACvE,CAAC;QACD,OAAO,SAAS,CAAC;IAClB,CAAC;IAED;;;;;;;;;;OAUG;IACH,IAAI,CAAC,OAAsB;QAC1B,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC;QACtC,IAAI,CAAC,QAAQ;YAAE,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;QACrE,OAAO,QAAQ,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;IACpC,CAAC;IAED,kGAAkG;IAClG,OAAO,CAAC,QAAgB;QACvB,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;IACnE,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,QAAiB;QACtB,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,MAAM,EAAE,GAAG,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;IACjE,CAAC;IAED,0FAA0F;IAC1F,KAAK,CAAC,KAAa;QAClB,kFAAkF;QAClF,8EAA8E;QAC9E,+EAA+E;QAC/E,2EAA2E;QAC3E,eAAe,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACpC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,EAAE,EAAE;YACpC,KAAK,MAAM,KAAK,IAAI,MAAM;gBAAE,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YAC/C,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QACnB,CAAC,CAAC,CAAC;IACJ,CAAC;IAED;;;;;;;;;;;OAWG;IACH,KAAK,CAAC,SAAS;QACd,SAAS,CAAC;YACT,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;YAClC,IAAI,KAAK;gBAAE,OAAO,KAAK,CAAC;YAExB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YACzC,IAAI,MAAM,YAAY,KAAK;gBAAE,MAAM,MAAM,CAAC;YAC1C,2EAA2E;YAC3E,6DAA6D;YAC7D,IAAI,MAAM,KAAK,SAAS,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;gBAAE,OAAO,SAAS,CAAC;YAE5E,MAAM,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACzE,CAAC;IACF,CAAC;IAED;;;;;;;;OAQG;IACH,YAAY;QACX,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QACzC,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;QAC3C,OAAO,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,KAAK;YAAE,MAAM,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,CAAC;QAEhF,4EAA4E;QAC5E,kEAAkE;QAClE,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,KAAK,IAAI,CAAC,GAAG,KAAK,SAAS,IAAI,KAAK,CAAC,QAAQ,IAAI,GAAG,CAAC,EAAE,CAAC;YAC3D,MAAM,CAAC,KAAK,EAAE,CAAC;YACf,OAAO,KAAK,CAAC;QACd,CAAC;QAED,OAAO,SAAS,CAAC;IAClB,CAAC;IAED;;;;;;;;OAQG;IACH,KAAK,CAAC,YAAY;QACjB,SAAS,CAAC;YACT,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC;YAE/C,mFAAmF;YACnF,uEAAuE;YACvE,MAAM,MAAM,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,mBAAmB,CAAC;YACvD,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,MAAM;gBAAE,SAAS,CAAC,KAAK,EAAE,CAAC;YAE7E,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1B,MAAM,QAAQ,GAAG,SAAS,CAAC,KAAK,EAAE,EAAE,QAAQ,CAAC;gBAC7C,IAAI,QAAQ,EAAE,CAAC;oBACd,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,aAAa,EAAE,QAAQ,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;gBAC1E,CAAC;gBACD,OAAO,QAAQ,CAAC;YACjB,CAAC;YAED,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YACzC,IAAI,MAAM,YAAY,KAAK;gBAAE,MAAM,MAAM,CAAC;YAC1C,IAAI,MAAM,KAAK,SAAS;gBAAE,OAAO,SAAS,CAAC;YAE3C,MAAM,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC9D,CAAC;IACF,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,SAAS;QACd,SAAS,CAAC;YACT,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YACzC,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;YACnC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;YACzD,OAAO,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,KAAK;gBAAE,MAAM,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,CAAC;YAEhF,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACxB,IAAI,KAAK,IAAI,CAAC,MAAM,CAAC,GAAG,KAAK,SAAS,IAAI,KAAK,CAAC,QAAQ,IAAI,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;gBACzE,MAAM,CAAC,KAAK,EAAE,CAAC;gBACf,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC,QAAQ,GAAG,CAAC,CAAC;gBACxC,OAAO,KAAK,CAAC;YACd,CAAC;YAED,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YACzC,IAAI,MAAM,YAAY,KAAK;gBAAE,MAAM,MAAM,CAAC;YAC1C,IAAI,MAAM,KAAK,SAAS,IAAI,CAAC,KAAK;gBAAE,OAAO,SAAS,CAAC;YAErD,MAAM,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACzE,CAAC;IACF,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,SAAS;QACd,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,iBAAiB,EAAE,CAAC;QAC5C,OAAO,IAAI,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;IAChF,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,iBAAiB;QACtB,SAAS,CAAC;YACT,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YACzC,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;YACtC,OAAO,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,KAAK;gBAAE,MAAM,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,CAAC;YAEhF,sDAAsD;YACtD,OAAO,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1B,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;oBACvB,mEAAmE;oBACnE,kEAAkE;oBAClE,MAAM,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,CAAC;oBACxB,MAAM,IAAI,MAAM,EAAE,CAAC;gBACpB,CAAC;gBACD,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,oBAAoB,EAAE,CAAC;gBAC9C,IAAI,IAAI,EAAE,CAAC;oBACV,OAAO;wBACN,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ;wBACzB,KAAK,EAAE,IAAI,CAAC,QAAQ;wBACpB,OAAO,EAAE,IAAI,CAAC,OAAO;wBACrB,SAAS,EAAE,IAAI,CAAC,SAAS;qBACzB,CAAC;gBACH,CAAC;gBACD,MAAM,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,CAAC;YACzB,CAAC;YAED,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;gBACzB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;gBACzC,IAAI,MAAM,YAAY,KAAK;oBAAE,MAAM,MAAM,CAAC;gBAC1C,IAAI,MAAM,KAAK,SAAS;oBAAE,OAAO,SAAS,CAAC;gBAC3C,MAAM,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;gBACxE,SAAS;YACV,CAAC;YAED,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACxB,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;gBACnB,wEAAwE;gBACxE,kDAAkD;gBAClD,MAAM,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,CAAC;gBACxB,MAAM,IAAI,MAAM,EAAE,CAAC;YACpB,CAAC;YACD,MAAM,IAAI,GAAG,KAAK,CAAC,oBAAoB,EAAE,CAAC;YAC1C,IAAI,IAAI;gBACP,OAAO;oBACN,KAAK,EAAE,KAAK,CAAC,QAAQ;oBACrB,KAAK,EAAE,IAAI,CAAC,QAAQ;oBACpB,OAAO,EAAE,IAAI,CAAC,OAAO;oBACrB,SAAS,EAAE,IAAI,CAAC,SAAS;iBACzB,CAAC;YAEH,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YACzC,IAAI,MAAM,YAAY,KAAK;gBAAE,MAAM,MAAM,CAAC;YAC1C,IAAI,MAAM,KAAK,SAAS;gBAAE,OAAO,SAAS,CAAC;YAE3C,sFAAsF;YACtF,uFAAuF;YACvF,2CAA2C;YAC3C,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC;gBAChB,MAAM,CAAC,KAAK,EAAE,EAAE,KAAK,EAAE,CAAC;gBACxB,SAAS;YACV,CAAC;YAED,qFAAqF;YACrF,qBAAqB;YACrB,MAAM,OAAO,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC3G,CAAC;IACF,CAAC;IAED,6DAA6D;IAC7D,KAAK,CAAC,UAAU;QACf,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,SAAS,EAAE,CAAC;QACpC,IAAI,CAAC,IAAI;YAAE,OAAO,SAAS,CAAC;QAC5B,OAAO,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC/C,CAAC;IAED,kDAAkD;IAClD,KAAK,CAAC,QAAQ;QACb,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,UAAU,EAAE,CAAC;QACrC,IAAI,CAAC,IAAI;YAAE,OAAO,SAAS,CAAC;QAC5B,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACzB,CAAC;IAED,gGAAgG;IAChG,KAAK,CAAC,QAAQ;QACb,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,SAAS,EAAE,CAAC;QACpC,IAAI,CAAC,IAAI;YAAE,OAAO,SAAS,CAAC;QAC5B,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAC7B,IAAI,OAAO,CAAC,UAAU,KAAK,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,oBAAoB,CAAC,CAAC;QAC/G,OAAO,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IACzB,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,OAAqB;QAC3B,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,oBAAoB,CAAC,OAAO,CAAC,CAAC,CAAC;IACvD,CAAC;CACD","sourcesContent":["/**\n * Track role handles: a live stream of groups (and best-effort datagrams) within a broadcast.\n *\n * @module\n */\nimport { type GetPromise, type Getter, Once, Signal } from \"@moq/signals\";\nimport type { Datagram } from \"./datagram.ts\";\nimport { type Frame, type Consumer as GroupConsumer, Producer as GroupProducer, Lagged } from \"./group.ts\";\nimport { hooks, type TrackRequestOptions, type TrackSequence, type TrackSequences } from \"./internal.ts\";\nimport { Timescale, type Timestamp } from \"./time.ts\";\n\nexport type { Datagram } from \"./datagram.ts\";\n\n/** Default {@link Info.latencyMax} window (milliseconds) when the publisher does not set one. */\nexport const DEFAULT_LATENCY_MAX_MS = 5000;\n\n/**\n * How long (milliseconds) a datagram stays in the per-subscriber buffer before it is dropped.\n *\n * Datagrams are a best-effort send buffer, not a replay cache (unlike groups): only the last few\n * tens of milliseconds are kept, so a consumer that stalls loses stale datagrams instead of\n * replaying them. Mirrors the Rust `MAX_DATAGRAM_AGE`.\n */\nconst MAX_DATAGRAM_AGE_MS = 50;\n\n/** A datagram buffered with its arrival time, so the send buffer can evict by age. */\ntype BufferedDatagram = { datagram: Datagram; time: number };\n\n/**\n * Sanity cap on a datagram payload: the QUIC DATAGRAM frame ceiling. The real limit is\n * per-hop (the negotiated transport datagram size minus a small header) and oversize\n * datagrams are dropped there; a payload above this cap could never fit anywhere.\n */\nconst MAX_DATAGRAM_BYTES = 65535;\n\n/** A position within a track: a group's sequence and a frame's index inside it. */\nexport interface Location {\n\t/** The group's sequence number within the track. */\n\tgroup: number;\n\t/** The frame's index within that group. */\n\tframe: number;\n}\n\n/**\n * A track's immutable publisher properties, fixed for the lifetime of the track.\n *\n * A producer declares these once (via {@link Request.accept} or\n * {@link Producer.accept}); a consumer awaits them via {@link Subscriber.info}\n * (resolved from the wire TRACK_INFO on lite-05+). They map 1:1 onto TRACK_INFO.\n */\nexport interface Info {\n\t/**\n\t * Units per second for this track's frame timestamps (reported in TRACK_INFO on\n\t * Lite05+). Defaults to milliseconds; set it finer (e.g. {@link Timescale.MICRO})\n\t * for media that needs sub-millisecond timing.\n\t */\n\ttimescale: Timescale;\n\t/**\n\t * Publisher Max Latency: the maximum age (milliseconds) of a non-latest group before\n\t * the publisher evicts it. Reported in TRACK_INFO (Lite05+) so relays re-serve with the\n\t * same bound. The publisher-side half of the budget a subscriber sets for itself.\n\t */\n\tlatencyMax: number;\n\t/** Tie-break priority between subscriptions of equal subscriber priority. */\n\tpriority: number;\n\t/**\n\t * Whether groups are prioritized in sequence order. Groups may always arrive\n\t * out-of-order (or not at all) over the network. Defaults to `false` (newest-first).\n\t */\n\tordered: boolean;\n}\n\n/** Fill in any unset {@link Info} fields with their defaults. */\nexport function infoDefaults(info: Partial<Info> = {}): Info {\n\treturn {\n\t\ttimescale: info.timescale ?? Timescale.MILLI,\n\t\tlatencyMax: info.latencyMax ?? DEFAULT_LATENCY_MAX_MS,\n\t\tpriority: info.priority ?? 0,\n\t\tordered: info.ordered ?? false,\n\t};\n}\n\n/**\n * Per-subscription options, requested when a subscription opens and adjustable later via\n * {@link Subscriber.update}. Mirrors the Rust `Subscription`.\n */\nexport interface Subscription {\n\t/** Delivery priority relative to this session's other subscriptions. Defaults to `0`. */\n\tpriority?: number;\n\t/** Whether groups are prioritized in sequence order. Defaults to `false` (newest-first). */\n\tordered?: boolean;\n\t/** Maximum age (milliseconds) of a non-latest group before it is skipped. Defaults to `0`. */\n\tlatencyMax?: number;\n\t/** First group the publisher should deliver, or omit to start at the latest group. */\n\tstartGroup?: number;\n\t/** Last group the publisher should deliver (inclusive), or omit for no end. */\n\tendGroup?: number;\n}\n\n// Materialize the defaults at the model boundary so every layer observes a complete\n// subscription rather than interpreting an omitted field differently.\nfunction subscriptionDefaults(subscription: Subscription = {}): Subscription {\n\treturn {\n\t\tpriority: subscription.priority ?? 0,\n\t\tordered: subscription.ordered ?? false,\n\t\tlatencyMax: subscription.latencyMax ?? 0,\n\t\tstartGroup: subscription.startGroup,\n\t\tendGroup: subscription.endGroup,\n\t};\n}\n\n// Aggregate the preferences of every live subscriber, matching Rust's Subscription::poll_combined.\nfunction combineSubscriptions(states: Iterable<TrackState>): Subscription | undefined {\n\tlet combined: Subscription | undefined;\n\tfor (const state of states) {\n\t\tconst subscription = state.update.peek();\n\t\tif (!subscription) continue;\n\t\tif (!combined) {\n\t\t\tcombined = { ...subscription };\n\t\t\tcontinue;\n\t\t}\n\n\t\tcombined.priority = Math.max(combined.priority ?? 0, subscription.priority ?? 0);\n\t\tcombined.ordered = (combined.ordered ?? false) && (subscription.ordered ?? false);\n\t\tcombined.latencyMax = Math.max(combined.latencyMax ?? 0, subscription.latencyMax ?? 0);\n\n\t\tif (subscription.startGroup !== undefined) {\n\t\t\tcombined.startGroup =\n\t\t\t\tcombined.startGroup === undefined\n\t\t\t\t\t? subscription.startGroup\n\t\t\t\t\t: Math.min(combined.startGroup, subscription.startGroup);\n\t\t}\n\n\t\tif (combined.endGroup === undefined || subscription.endGroup === undefined) {\n\t\t\tcombined.endGroup = undefined;\n\t\t} else {\n\t\t\tcombined.endGroup = Math.max(combined.endGroup, subscription.endGroup);\n\t\t}\n\t}\n\treturn combined;\n}\n\n/**\n * A request for a track the peer wants, yielded by `Broadcast.Producer.requested`.\n *\n * Created internally by the broadcast when a subscription (or info lookup) needs a track\n * served; answer it with {@link accept} or {@link reject}.\n *\n * @public\n */\nexport class Request {\n\t/** The requested track name. */\n\treadonly name: string;\n\n\t#producer: Producer;\n\t#sequences: TrackSequences;\n\n\tprivate constructor(options: TrackRequestOptions) {\n\t\tthis.name = options.name;\n\t\tthis.#producer = options.producer;\n\t\tthis.#sequences = options.sequences;\n\t}\n\n\tstatic {\n\t\thooks.makeRequest = (options) => new Request(options);\n\t}\n\n\t/** The aggregate subscription requested for this track. */\n\tget subscription(): Readonly<Subscription> {\n\t\treturn this.#producer.subscription.peek() ?? subscriptionDefaults();\n\t}\n\n\t/** The subscriber's priority for this track. */\n\tget priority(): number {\n\t\treturn this.subscription.priority ?? 0;\n\t}\n\n\t/** Accept the request, committing the track's immutable {@link Info}. */\n\taccept(info: Partial<Info> = {}): Producer {\n\t\tbindProducer(this.name, this.#producer, this.#sequences);\n\t\treturn this.#producer.accept(info);\n\t}\n\n\t/** Reject the request, closing the track optionally with an error. */\n\treject(err?: Error): void {\n\t\tthis.#producer.close(err);\n\t}\n}\n\n/** Options for {@link Consumer.fetchGroup}. */\nexport interface FetchGroupOptions {\n\t/** Delivery priority for the fetch stream. Defaults to `0`. */\n\tpriority?: number;\n}\n\n/**\n * The per-track operations a lazy {@link Consumer} delegates to the broadcast it came from.\n *\n * Implemented by `broadcast.Producer` / `broadcast.Consumer` (and the wire-layer subclasses\n * that resolve them over the network), so a track handle holds a reference to its broadcast\n * and calls methods on it rather than capturing a bag of callbacks.\n */\nexport interface Broadcast {\n\t/** Open a live subscription to the named track. */\n\tsubscribe(name: string, options?: Subscription): Subscriber;\n\t/** Resolve the named track's immutable info. */\n\tresolveTrackInfo(name: string): Promise<Info>;\n\t/** Fetch a single group of the named track by sequence. */\n\tfetchGroup(name: string, sequence: number, options?: FetchGroupOptions): Promise<GroupConsumer>;\n}\n\n/**\n * A lazy handle to a track on a consumed broadcast.\n *\n * @public\n */\nexport class Consumer {\n\t/** The track name. */\n\treadonly name: string;\n\n\t#broadcast: Broadcast;\n\n\tconstructor(name: string, broadcast: Broadcast) {\n\t\tthis.name = name;\n\t\tthis.#broadcast = broadcast;\n\t}\n\n\t/** Open a live subscription to the track. */\n\tsubscribe(options?: Subscription): Subscriber {\n\t\treturn this.#broadcast.subscribe(this.name, options);\n\t}\n\n\t/** Fetch the track's immutable publisher properties without subscribing. */\n\tinfo(): Promise<Info> {\n\t\treturn this.#broadcast.resolveTrackInfo(this.name);\n\t}\n\n\t/** Fetch a single group by sequence without holding a live subscription. */\n\tfetchGroup(sequence: number, options?: FetchGroupOptions): Promise<GroupConsumer> {\n\t\treturn this.#broadcast.fetchGroup(this.name, sequence, options);\n\t}\n}\n\n// The shared state behind a Producer / Subscriber pair. Package-internal\n// wiring, unexported so it never appears in the published type declarations.\nclass TrackState {\n\t/** The producer fanning into this sink, so a subscriber can mint a sibling of itself. */\n\tproducer?: Producer;\n\tgroups = new Signal<GroupConsumer[]>([]);\n\t/** Best-effort datagram channel, parallel to {@link groups}; an age-evicted send buffer per subscriber. */\n\tdatagrams = new Signal<BufferedDatagram[]>([]);\n\tlatest?: number;\n\tclosed = new Once<Error | null>();\n\tupdate: Signal<Subscription | undefined>;\n\t/** Resolved once the producer commits the immutable properties. */\n\tinfo = new Signal<Info | undefined>(undefined);\n\n\tconstructor(subscription?: Subscription) {\n\t\tthis.update = new Signal(subscription === undefined ? undefined : subscriptionDefaults(subscription));\n\t}\n}\n\n// Settle a track state's closed Once. Idempotent: Once.set throws on a second settle, and a\n// Producer closing its sinks races the Subscriber closing itself (the sink is only removed from\n// #sinks a microtask later, via the closed subscription below).\nfunction closeTrackState(state: TrackState, abort?: Error): boolean {\n\tif (state.closed.peek() !== undefined) return false;\n\tstate.closed.set(abort ?? null);\n\treturn true;\n}\n\n// Resolve the track's immutable publisher properties, or reject if it closes first.\n// On a producer this resolves once info is committed (at accept time); on a consumer\n// once the wire layer commits the TRACK_INFO it received (lite-05+) or defaults (older\n// drafts), so awaiting it never yields a placeholder.\nasync function resolveInfo(state: TrackState): Promise<Info> {\n\tfor (;;) {\n\t\tconst info = state.info.peek();\n\t\tif (info) return info;\n\n\t\tconst closed = state.closed.peek();\n\t\tif (closed instanceof Error) throw closed;\n\t\tif (closed !== undefined) throw new Error(\"track closed before info was known\");\n\n\t\tawait Signal.race(state.info, state.closed);\n\t}\n}\n\n// A source group retained in the producer cache, with the mirror handed to each sink\n// so eviction can drop them together.\ntype CachedGroup = { group: GroupProducer; time: number; mirrors: Map<TrackState, GroupConsumer> };\n\nfunction bindProducer(name: string, producer: Producer, sequences: TrackSequences): void {\n\tlet shared = sequences.get(name);\n\tif (!shared) {\n\t\tshared = { next: 0 };\n\t\tsequences.set(name, shared);\n\t}\n\tbindProducerSequence(producer, shared);\n}\n\nlet bindProducerSequence: (producer: Producer, sequence: TrackSequence) => void;\n\n// Constructs a Subscriber from within this module without exposing a public\n// constructor that would leak the unexported TrackState. Assigned in the class's\n// static block.\nlet makeSubscriber: (name: string, state: TrackState) => Subscriber;\n\n/**\n * The write side of a track, mirroring the Rust `Producer`.\n *\n * A producer is a fan-out source: every {@link subscribe} (including each wire\n * subscription the publisher serves from it) gets an independent\n * {@link Subscriber} that receives a full copy of the groups, each with its own\n * read cursor. Groups are mirrored into every live subscriber and retained for the\n * track's `latencyMax` window so a late subscriber replays the recent groups.\n *\n * Obtained from {@link Request.accept} (the wire asks the application for a track to\n * serve) or constructed directly for an in-process track.\n */\nexport class Producer {\n\t/** The track name. */\n\treadonly name: string;\n\n\t// The producer's own state is the source of truth (info/closed); subscribers\n\t// read mirrored sinks, never this state directly.\n\t#state = new TrackState();\n\t#sequence: TrackSequence = { next: 0 };\n\n\t// Recently written source groups, retained for replay to late subscribers and\n\t// pruned once closed and older than the cache window. Each entry tracks the mirror\n\t// it handed to every sink so eviction can drop them too: otherwise a slow consumer\n\t// that never reads would pin old groups (and their frame bytes) forever.\n\t#cache: CachedGroup[] = [];\n\n\t// One independent downstream state per live subscriber.\n\t#sinks = new Set<TrackState>();\n\n\t// Whether any subscriber is currently attached. Exposed as {@link used}; the consumer wire\n\t// watches it to tear down an idle upstream, and a publisher can watch it for on-demand capture.\n\t#used = new Signal<boolean>(false);\n\n\tconstructor(name: string) {\n\t\tthis.name = name;\n\t}\n\n\tstatic {\n\t\tbindProducerSequence = (producer, sequence) => {\n\t\t\tproducer.#sequence = sequence;\n\t\t};\n\t}\n\n\t/**\n\t * Resolve this track's immutable publisher properties, committed at accept time.\n\t * Rejects if the track is closed before the properties are known.\n\t */\n\tinfo(): Promise<Info> {\n\t\treturn resolveInfo(this.#state);\n\t}\n\n\t/**\n\t * Settles once the track closes: `null` on a clean close, or the abort {@link Error}.\n\t * Peek it synchronously (`undefined` while open), observe it reactively, or `await` it.\n\t */\n\tget closed(): GetPromise<Error | null> {\n\t\treturn this.#state.closed;\n\t}\n\n\t/**\n\t * The aggregate subscription across live subscribers, or `undefined` when there are none.\n\t * The wire layer watches this to emit SUBSCRIBE_UPDATE.\n\t */\n\tget subscription(): Getter<Subscription | undefined> {\n\t\treturn this.#state.update;\n\t}\n\n\t/** Commit the immutable publisher properties, resolving {@link info}. Returns `this`. */\n\taccept(info: Partial<Info> = {}): this {\n\t\tconst resolved = infoDefaults(info);\n\t\tthis.#state.info.set(resolved);\n\t\t// Propagate to any sink handed out before accept (the on-demand path).\n\t\tfor (const sink of this.#sinks) sink.info.set(resolved);\n\t\treturn this;\n\t}\n\n\t/** An independent {@link Subscriber} receiving a full copy of this track's groups. */\n\tsubscribe(options: Subscription = {}): Subscriber {\n\t\tconst sink = new TrackState(options);\n\t\tthis.#addSink(sink);\n\t\treturn makeSubscriber(this.name, sink);\n\t}\n\n\t/**\n\t * Whether the track currently has any subscribers.\n\t *\n\t * Watch it (`effect.get` / `.peek()`) to drive on-demand work: a publisher can start and stop\n\t * capture with demand, and the consumer wire watches it to tear an idle upstream subscription\n\t * down instead of downloading to nobody. Pairs with {@link unused}. Mirrors the Rust `Demand`.\n\t */\n\tget used(): Getter<boolean> {\n\t\treturn this.#used;\n\t}\n\n\t/** Resolves once the track has no subscribers (or has closed). Await it to react to demand ending. */\n\tasync unused(): Promise<void> {\n\t\twhile (this.#used.peek() && this.#state.closed.peek() === undefined) {\n\t\t\tawait Signal.race(this.#used, this.#state.closed);\n\t\t}\n\t}\n\n\t// Register a downstream sink: seed its info, replay the retained window, and (while\n\t// the track is open) mirror future groups into it. A late subscriber to a closed\n\t// track still drains the buffered groups before seeing the end.\n\t#addSink(sink: TrackState): void {\n\t\tsink.producer = this;\n\t\tconst info = this.#state.info.peek();\n\t\tif (info) sink.info.set(info);\n\n\t\tconst closed = this.#state.closed.peek();\n\t\tif (closed === undefined) {\n\t\t\tthis.#sinks.add(sink);\n\t\t\tthis.#used.set(true);\n\n\t\t\t// Forward subscription updates from the sink's Subscriber to the producer's own\n\t\t\t// state, which the wire layer (or the serving application) watches.\n\t\t\tconst forward = sink.update.subscribe(() => this.#updateSubscription());\n\t\t\tthis.#updateSubscription();\n\n\t\t\t// Drop the sink once its consumer goes away, closing its mirrors so source\n\t\t\t// groups stop teeing into them, so a long-lived producer doesn't leak. This\n\t\t\t// covers mirrors already handed out via recvGroup (no longer in sink.groups)\n\t\t\t// by closing them through the cache's per-sink tracking.\n\t\t\tconst dispose = sink.closed.subscribe((c) => {\n\t\t\t\tif (c === undefined) return;\n\t\t\t\tconst abort = c instanceof Error ? c : undefined;\n\t\t\t\tforward();\n\t\t\t\tthis.#sinks.delete(sink);\n\t\t\t\tthis.#updateSubscription();\n\t\t\t\tfor (const entry of this.#cache) {\n\t\t\t\t\tconst mirror = entry.mirrors.get(sink);\n\t\t\t\t\tif (mirror) {\n\t\t\t\t\t\tmirror.close(abort);\n\t\t\t\t\t\tentry.mirrors.delete(sink);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t\tfor (const group of sink.groups.peek()) group.close(abort);\n\t\t\t\tdispose();\n\n\t\t\t\t// Update demand: once the last subscriber leaves, the consumer wire (watching\n\t\t\t\t// {@link unused}) tears the upstream down instead of downloading to nobody.\n\t\t\t\tthis.#used.set(this.#sinks.size > 0);\n\t\t\t});\n\t\t}\n\n\t\tthis.#prune();\n\t\tfor (const entry of this.#cache) this.#mirror(entry, sink);\n\n\t\tif (closed !== undefined) closeTrackState(sink, closed instanceof Error ? closed : undefined);\n\t}\n\n\t// Recompute from every live sink because an update or close can narrow as well as widen\n\t// the aggregate. The wire layer observes this signal and emits SUBSCRIBE_UPDATE.\n\t#updateSubscription(): void {\n\t\tthis.#state.update.set(combineSubscriptions(this.#sinks));\n\t}\n\n\t// Mirror a cached source group into a sink. The mirror fills synchronously as the\n\t// source is written and keeps its own read cursor; frame bytes are shared by\n\t// reference. Tracked on the entry so eviction can drop it from the sink.\n\t#mirror(entry: CachedGroup, sink: TrackState): void {\n\t\tconst dst = entry.group.mirror();\n\t\tentry.mirrors.set(sink, dst);\n\t\tsink.latest = Math.max(sink.latest ?? 0, dst.sequence);\n\t\tsink.groups.mutate((groups) => {\n\t\t\tgroups.push(dst);\n\t\t\tgroups.sort((a, b) => a.sequence - b.sequence);\n\t\t});\n\t}\n\n\t// Drop a cached group's mirror from every sink so no consumer can pin it.\n\t#evict(entry: CachedGroup): void {\n\t\tfor (const [sink, mirror] of entry.mirrors) {\n\t\t\tsink.groups.mutate((groups) => {\n\t\t\t\tconst i = groups.indexOf(mirror);\n\t\t\t\tif (i >= 0) groups.splice(i, 1);\n\t\t\t});\n\t\t\tmirror.close();\n\t\t}\n\t\tentry.mirrors.clear();\n\t}\n\n\t// Evict cached groups that are closed and older than the cache window.\n\t#prune(): void {\n\t\tconst latencyMaxMs = this.#state.info.peek()?.latencyMax ?? DEFAULT_LATENCY_MAX_MS;\n\t\tconst cutoff = Date.now() - latencyMaxMs;\n\n\t\tconst retained: CachedGroup[] = [];\n\t\tfor (const entry of this.#cache) {\n\t\t\tif (entry.time > cutoff || entry.group.closed.peek() === undefined) {\n\t\t\t\tretained.push(entry);\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tthis.#evict(entry);\n\t\t}\n\t\tthis.#cache = retained;\n\t}\n\n\t// Retain a source group and fan it out to every live sink.\n\t#publish(group: GroupProducer): void {\n\t\tconst entry: CachedGroup = { group, time: Date.now(), mirrors: new Map<TrackState, GroupConsumer>() };\n\t\tthis.#cache.push(entry);\n\t\tthis.#prune();\n\t\tfor (const sink of this.#sinks) this.#mirror(entry, sink);\n\t}\n\n\t/** Append a new group with the next sequence number. */\n\tappendGroup(): GroupProducer {\n\t\tif (this.#state.closed.peek() !== undefined) throw new Error(\"track is closed\");\n\n\t\tconst sequence = this.#sequence;\n\t\tconst group = new GroupProducer(sequence.next);\n\t\tsequence.next = group.sequence + 1;\n\t\tthis.#publish(group);\n\n\t\treturn group;\n\t}\n\n\t/**\n\t * Insert an existing group into the track.\n\t *\n\t * Throws on a sequence that is still cached: a live duplicate would fan out to every\n\t * subscriber twice. An aborted incarnation is evicted so a fresh group can serve the\n\t * sequence again. Best effort (mirrors Rust): nothing remembers a sequence whose cache\n\t * entry is already gone, so a long-evicted sequence is accepted as new.\n\t */\n\twriteGroup(group: GroupProducer) {\n\t\tif (this.#state.closed.peek() !== undefined) throw new Error(\"track is closed\");\n\n\t\tconst existing = this.#cache.findIndex((entry) => entry.group.sequence === group.sequence);\n\t\tif (existing >= 0) {\n\t\t\tconst entry = this.#cache[existing];\n\t\t\tif (!(entry.group.closed.peek() instanceof Error)) {\n\t\t\t\tthrow new Error(`duplicate group: sequence=${group.sequence}`);\n\t\t\t}\n\t\t\tthis.#evict(entry);\n\t\t\tthis.#cache.splice(existing, 1);\n\t\t}\n\n\t\t// Only advance the shared counter upward (for appendGroup auto-increment).\n\t\tconst sequence = this.#sequence;\n\t\tif (group.sequence >= sequence.next) {\n\t\t\tsequence.next = group.sequence + 1;\n\t\t}\n\n\t\tthis.#publish(group);\n\t}\n\n\t// Fan a datagram out to every live subscriber, dropping the oldest once the ring is full.\n\t// Late subscribers do NOT replay old datagrams (best-effort, unlike the group cache).\n\t#publishDatagram(datagram: Datagram): void {\n\t\tconst now = performance.now();\n\t\tfor (const sink of this.#sinks) {\n\t\t\tsink.datagrams.mutate((list) => {\n\t\t\t\tlist.push({ datagram, time: now });\n\t\t\t\t// Drop anything older than the send-buffer window.\n\t\t\t\twhile (list.length > 0 && now - list[0].time > MAX_DATAGRAM_AGE_MS) list.shift();\n\t\t\t});\n\t\t}\n\t}\n\n\t/**\n\t * Append a datagram with the next sequence number, returning the assigned sequence.\n\t *\n\t * A datagram is delivered best-effort over a single QUIC datagram, parallel to the track's\n\t * groups but drawing from the same sequence namespace (interleaving with {@link appendGroup}\n\t * never reuses a number). The payload must fit the negotiated transport datagram size minus\n\t * a small header; an oversize payload is dropped at each hop (there is no group fallback), so\n\t * keep datagram payloads small (e.g. a single audio frame). Datagrams are never delivered\n\t * over IETF moq-transport or stream-only transports (the WebSocket fallback). A payload over\n\t * 65535 bytes (the QUIC datagram frame ceiling) throws. An origin publisher uses this; a\n\t * relay preserving upstream numbering uses {@link writeDatagram}.\n\t */\n\tappendDatagram(timestamp: Timestamp, payload: Uint8Array): number {\n\t\tif (this.#state.closed.peek() !== undefined) throw new Error(\"track is closed\");\n\t\tif (payload.byteLength > MAX_DATAGRAM_BYTES) throw new Error(\"datagram payload too large\");\n\n\t\tconst counter = this.#sequence;\n\t\tconst sequence = counter.next;\n\t\tcounter.next = sequence + 1;\n\t\tthis.#publishDatagram({ sequence, timestamp, payload });\n\t\treturn sequence;\n\t}\n\n\t/**\n\t * Write a datagram with an explicit sequence number.\n\t *\n\t * Preserves the supplied sequence (advancing the shared counter if needed) so a relay can\n\t * forward a datagram without renumbering it. The size limits of {@link appendDatagram}\n\t * apply. Most origin publishers want {@link appendDatagram} instead.\n\t */\n\twriteDatagram(datagram: Datagram) {\n\t\tif (this.#state.closed.peek() !== undefined) throw new Error(\"track is closed\");\n\t\tif (datagram.payload.byteLength > MAX_DATAGRAM_BYTES) throw new Error(\"datagram payload too large\");\n\n\t\tconst sequence = this.#sequence;\n\t\tif (datagram.sequence >= sequence.next) {\n\t\t\tsequence.next = datagram.sequence + 1;\n\t\t}\n\t\tthis.#publishDatagram(datagram);\n\t}\n\n\t/** Close the track and every subscriber, mirroring the abort to their groups. Idempotent. */\n\tclose(abort?: Error) {\n\t\tcloseTrackState(this.#state, abort);\n\t\tfor (const { group } of this.#cache) group.close(abort);\n\t\tfor (const sink of this.#sinks) {\n\t\t\tfor (const group of sink.groups.peek()) group.close(abort);\n\t\t\tcloseTrackState(sink, abort);\n\t\t}\n\t\tthis.#sinks.clear();\n\t}\n\n\t/** Append a frame as its own single-frame group. */\n\twriteFrame(frame: Frame) {\n\t\tconst group = this.appendGroup();\n\t\tgroup.writeFrame(frame);\n\t\tgroup.close();\n\t}\n\n\t/** Appends a string to the track as its own single-frame group. */\n\twriteString(str: string) {\n\t\tconst group = this.appendGroup();\n\t\tgroup.writeString(str);\n\t\tgroup.close();\n\t}\n\n\t/** Appends a JSON value to the track as its own single-frame group. */\n\twriteJson(json: unknown) {\n\t\tconst group = this.appendGroup();\n\t\tgroup.writeJson(json);\n\t\tgroup.close();\n\t}\n\n\t/** Appends a boolean to the track as its own single-frame group. */\n\twriteBool(bool: boolean) {\n\t\tconst group = this.appendGroup();\n\t\tgroup.writeBool(bool);\n\t\tgroup.close();\n\t}\n}\n\n/**\n * The read side of a live track subscription, mirroring the Rust `Subscriber`.\n *\n * Obtained from `Broadcast.Consumer.subscribe` / `Track.Consumer.subscribe`, or from\n * {@link Producer.subscribe} for an in-process track. Reads the groups a\n * {@link Producer} on the same underlying state writes.\n */\nexport class Subscriber {\n\t/** The track name. */\n\treadonly name: string;\n\n\t#state: TrackState;\n\t#nextSequence = 0;\n\t#cursor = new Signal<{ start: number; end?: number }>({ start: 0 });\n\n\tprivate constructor(name: string, state: TrackState) {\n\t\tthis.name = name;\n\t\tthis.#state = state;\n\t}\n\n\tstatic {\n\t\tmakeSubscriber = (name, state) => new Subscriber(name, state);\n\t}\n\n\t/**\n\t * Resolve this track's immutable publisher properties.\n\t *\n\t * Resolves once the wire layer commits the TRACK_INFO it received (lite-05+) or\n\t * defaults (older drafts), so awaiting it never yields a placeholder. Rejects if\n\t * the track is closed before the properties are known (e.g. a rejected subscription).\n\t */\n\tinfo(): Promise<Info> {\n\t\treturn resolveInfo(this.#state);\n\t}\n\n\t/** Settles once the track closes; see {@link Producer.closed}. */\n\tget closed(): GetPromise<Error | null> {\n\t\treturn this.#state.closed;\n\t}\n\n\t/** This subscriber's current options, including defaults and the last {@link update}. */\n\tget subscription(): Getter<Subscription | undefined> {\n\t\treturn this.#state.update;\n\t}\n\n\t/** Return the latest group sequence observed on this track, if any. */\n\tlatest(): number | undefined {\n\t\treturn this.#state.latest;\n\t}\n\n\t/**\n\t * The newest frame this track has produced, or `undefined` while it has none.\n\t *\n\t * Read from the groups buffered for this subscriber, so nothing is consumed. A newest\n\t * group that has no frames yet falls back to the newest older group that does. It\n\t * reads as `undefined` once the newest group has been evicted or received: what is\n\t * left can no longer say where the edge is.\n\t */\n\tlargest(): Location | undefined {\n\t\tconst latest = this.#state.latest;\n\t\tif (latest === undefined) return undefined;\n\n\t\tconst groups = this.#state.groups.peek();\n\t\tconst newest = groups[groups.length - 1];\n\t\tif (!newest || newest.sequence !== latest) return undefined;\n\n\t\tfor (let i = groups.length - 1; i >= 0; i--) {\n\t\t\tconst count = groups[i].frameCount;\n\t\t\tif (count > 0) return { group: groups[i].sequence, frame: count - 1 };\n\t\t}\n\t\treturn undefined;\n\t}\n\n\t/**\n\t * An independent subscriber to the same track, with its own cursor and its own replay of\n\t * the retained window.\n\t *\n\t * Reads here do not consume anything this one would deliver, which is what lets a\n\t * publisher read the cache alongside the cursor it is serving from. Resolving the track\n\t * again through the broadcast would not do: a dynamic serve is one request per peer\n\t * subscription, so that mints a second producer the application has to answer separately.\n\t *\n\t * @internal Wire layers only.\n\t */\n\tfork(options?: Subscription): Subscriber {\n\t\tconst producer = this.#state.producer;\n\t\tif (!producer) throw new Error(\"track has no producer to fork from\");\n\t\treturn producer.subscribe(options);\n\t}\n\n\t/** Start this subscriber's local read cursor at `sequence`, without changing its wire request. */\n\tstartAt(sequence: number): void {\n\t\tthis.#cursor.update((cursor) => ({ ...cursor, start: sequence }));\n\t}\n\n\t/**\n\t * Cap {@link nextGroup} and {@link recvGroup} at `sequence` inclusively, or omit it to\n\t * remove the cap. Groups above the cap remain buffered and become readable if the cap\n\t * is raised. This local cursor does not change the subscription's wire request.\n\t */\n\tendAt(sequence?: number): void {\n\t\tthis.#cursor.update((cursor) => ({ ...cursor, end: sequence }));\n\t}\n\n\t/** Close the track (optionally with an error), closing any pending groups. Idempotent. */\n\tclose(abort?: Error) {\n\t\t// Settle if we're first (the producer may already have); either way drop anything\n\t\t// still buffered. Groups parked at the endAt cap deliberately outlive a clean\n\t\t// producer close, so the subscriber leaving is what must release them: closing\n\t\t// and clearing wakes a pending read to observe the end instead of hanging.\n\t\tcloseTrackState(this.#state, abort);\n\t\tthis.#state.groups.mutate((groups) => {\n\t\t\tfor (const group of groups) group.close(abort);\n\t\t\tgroups.length = 0;\n\t\t});\n\t}\n\n\t/**\n\t * Receive every group on this track exactly once, as it becomes available.\n\t *\n\t * Groups may arrive out of order or with gaps due to network conditions; unlike\n\t * {@link nextGroup}, one that arrives after a newer group was already returned is\n\t * still delivered. When several groups are buffered, the lowest sequence is\n\t * returned first.\n\t *\n\t * Honors the floor set by {@link startAt} and the cap set by {@link endAt}: a group\n\t * beyond the cap stays buffered (not dropped) and is offered once the cap rises, even\n\t * after a clean close, without blocking in-range groups that arrive behind it.\n\t */\n\tasync recvGroup(): Promise<GroupConsumer | undefined> {\n\t\tfor (;;) {\n\t\t\tconst group = this.tryRecvGroup();\n\t\t\tif (group) return group;\n\n\t\t\tconst closed = this.#state.closed.peek();\n\t\t\tif (closed instanceof Error) throw closed;\n\t\t\t// A group beyond the cap outlives a clean close: it becomes deliverable if\n\t\t\t// the cap rises, so the track isn't over while any are held.\n\t\t\tif (closed !== undefined && !this.#state.groups.peek()[0]) return undefined;\n\n\t\t\tawait Signal.race(this.#state.groups, this.#cursor, this.#state.closed);\n\t\t}\n\t}\n\n\t/**\n\t * Take the next buffered group without blocking, honoring the same cursor bounds as\n\t * {@link recvGroup}.\n\t *\n\t * Returns `undefined` when nothing is deliverable right now, which is not by itself the\n\t * end of the track: a group may still arrive, or one may be parked beyond the\n\t * {@link endAt} cap. Use it to drain what the retained window already holds, where\n\t * waiting for a sequence nothing will republish would park forever.\n\t */\n\ttryRecvGroup(): GroupConsumer | undefined {\n\t\tconst groups = this.#state.groups.peek();\n\t\tconst { start, end } = this.#cursor.peek();\n\t\twhile (groups.length > 0 && groups[0].sequence < start) groups.shift()?.close();\n\n\t\t// The buffer is sequence-sorted, so an in-range group that arrives behind a\n\t\t// beyond-cap one sorts in front of it and is never blocked by it.\n\t\tconst group = groups[0];\n\t\tif (group && (end === undefined || group.sequence <= end)) {\n\t\t\tgroups.shift();\n\t\t\treturn group;\n\t\t}\n\n\t\treturn undefined;\n\t}\n\n\t/**\n\t * Receive the next datagram in arrival order.\n\t *\n\t * Datagrams are a separate best-effort channel from groups (see\n\t * {@link Producer.appendDatagram}); they share only the sequence namespace. A consumer\n\t * that falls too far behind silently loses the oldest datagrams. Read this alongside\n\t * {@link recvGroup} (e.g. in a separate loop) to receive both channels concurrently. Returning\n\t * a datagram advances {@link nextGroup} past that sequence.\n\t */\n\tasync recvDatagram(): Promise<Datagram | undefined> {\n\t\tfor (;;) {\n\t\t\tconst datagrams = this.#state.datagrams.peek();\n\n\t\t\t// Evict datagrams older than the send-buffer window (also enforced on write), so a\n\t\t\t// reader that stalled skips stale datagrams instead of replaying them.\n\t\t\tconst cutoff = performance.now() - MAX_DATAGRAM_AGE_MS;\n\t\t\twhile (datagrams.length > 0 && datagrams[0].time < cutoff) datagrams.shift();\n\n\t\t\tif (datagrams.length > 0) {\n\t\t\t\tconst datagram = datagrams.shift()?.datagram;\n\t\t\t\tif (datagram) {\n\t\t\t\t\tthis.#nextSequence = Math.max(this.#nextSequence, datagram.sequence + 1);\n\t\t\t\t}\n\t\t\t\treturn datagram;\n\t\t\t}\n\n\t\t\tconst closed = this.#state.closed.peek();\n\t\t\tif (closed instanceof Error) throw closed;\n\t\t\tif (closed !== undefined) return undefined;\n\n\t\t\tawait Signal.race(this.#state.datagrams, this.#state.closed);\n\t\t}\n\t}\n\n\t/**\n\t * Return the next group with a strictly-greater sequence number than the last returned.\n\t *\n\t * Late arrivals (sequence at or below the last returned) are silently skipped.\n\t * Use {@link recvGroup} to see every group in arrival order instead.\n\t */\n\tasync nextGroup(): Promise<GroupConsumer | undefined> {\n\t\tfor (;;) {\n\t\t\tconst groups = this.#state.groups.peek();\n\t\t\tconst cursor = this.#cursor.peek();\n\t\t\tconst start = Math.max(cursor.start, this.#nextSequence);\n\t\t\twhile (groups.length > 0 && groups[0].sequence < start) groups.shift()?.close();\n\n\t\t\tconst group = groups[0];\n\t\t\tif (group && (cursor.end === undefined || group.sequence <= cursor.end)) {\n\t\t\t\tgroups.shift();\n\t\t\t\tthis.#nextSequence = group.sequence + 1;\n\t\t\t\treturn group;\n\t\t\t}\n\n\t\t\tconst closed = this.#state.closed.peek();\n\t\t\tif (closed instanceof Error) throw closed;\n\t\t\tif (closed !== undefined && !group) return undefined;\n\n\t\t\tawait Signal.race(this.#state.groups, this.#cursor, this.#state.closed);\n\t\t}\n\t}\n\n\t/**\n\t * Reads the next frame across all groups, discarding older groups.\n\t * Treat the returned frame bytes as read-only; they are shared with other consumers.\n\t */\n\tasync readFrame(): Promise<Frame | undefined> {\n\t\tconst next = await this.readFrameSequence();\n\t\treturn next ? { payload: next.payload, timestamp: next.timestamp } : undefined;\n\t}\n\n\t/**\n\t * Reads the next frame along with its group and frame sequence numbers.\n\t * Treat the returned frame bytes as read-only; they are shared with other consumers.\n\t */\n\tasync readFrameSequence(): Promise<({ group: number; frame: number } & Frame) | undefined> {\n\t\tfor (;;) {\n\t\t\tconst groups = this.#state.groups.peek();\n\t\t\tconst { start } = this.#cursor.peek();\n\t\t\twhile (groups.length > 0 && groups[0].sequence < start) groups.shift()?.close();\n\n\t\t\t// Drain older groups first, dropping each once empty.\n\t\t\twhile (groups.length > 1) {\n\t\t\t\tif (groups[0].skipped) {\n\t\t\t\t\t// The reader fell behind this group's eviction window. Drop it and\n\t\t\t\t\t// signal the gap; the next read resyncs from the following group.\n\t\t\t\t\tgroups.shift()?.close();\n\t\t\t\t\tthrow new Lagged();\n\t\t\t\t}\n\t\t\t\tconst next = groups[0].tryReadFrameSequence();\n\t\t\t\tif (next) {\n\t\t\t\t\treturn {\n\t\t\t\t\t\tgroup: groups[0].sequence,\n\t\t\t\t\t\tframe: next.sequence,\n\t\t\t\t\t\tpayload: next.payload,\n\t\t\t\t\t\ttimestamp: next.timestamp,\n\t\t\t\t\t};\n\t\t\t\t}\n\t\t\t\tgroups.shift()?.close();\n\t\t\t}\n\n\t\t\tif (groups.length === 0) {\n\t\t\t\tconst closed = this.#state.closed.peek();\n\t\t\t\tif (closed instanceof Error) throw closed;\n\t\t\t\tif (closed !== undefined) return undefined;\n\t\t\t\tawait Signal.race(this.#state.groups, this.#cursor, this.#state.closed);\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tconst group = groups[0];\n\t\t\tif (group.skipped) {\n\t\t\t\t// Fell behind this group's eviction window. Drop it and signal the gap;\n\t\t\t\t// the next read resyncs from the following group.\n\t\t\t\tgroups.shift()?.close();\n\t\t\t\tthrow new Lagged();\n\t\t\t}\n\t\t\tconst next = group.tryReadFrameSequence();\n\t\t\tif (next)\n\t\t\t\treturn {\n\t\t\t\t\tgroup: group.sequence,\n\t\t\t\t\tframe: next.sequence,\n\t\t\t\t\tpayload: next.payload,\n\t\t\t\t\ttimestamp: next.timestamp,\n\t\t\t\t};\n\n\t\t\tconst closed = this.#state.closed.peek();\n\t\t\tif (closed instanceof Error) throw closed;\n\t\t\tif (closed !== undefined) return undefined;\n\n\t\t\t// A finished (drained + closed) group has nothing left: drop it and loop, rather than\n\t\t\t// busy-waiting on its already-resolved readable() (which would livelock and starve the\n\t\t\t// macrotask that delivers the next group).\n\t\t\tif (group.done) {\n\t\t\t\tgroups.shift()?.close();\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\t// Lone open group with nothing buffered yet: wait for a frame on it, a new group, or\n\t\t\t// the track closing.\n\t\t\tawait Promise.race([Signal.race(this.#state.groups, this.#cursor, this.#state.closed), group.readable()]);\n\t\t}\n\t}\n\n\t/** Reads the next frame and decodes it as a UTF-8 string. */\n\tasync readString(): Promise<string | undefined> {\n\t\tconst next = await this.readFrame();\n\t\tif (!next) return undefined;\n\t\treturn new TextDecoder().decode(next.payload);\n\t}\n\n\t/** Reads the next frame and parses it as JSON. */\n\tasync readJson(): Promise<unknown | undefined> {\n\t\tconst next = await this.readString();\n\t\tif (!next) return undefined;\n\t\treturn JSON.parse(next);\n\t}\n\n\t/** Reads the next frame and decodes it as a one-byte boolean, throwing on a malformed frame. */\n\tasync readBool(): Promise<boolean | undefined> {\n\t\tconst next = await this.readFrame();\n\t\tif (!next) return undefined;\n\t\tconst payload = next.payload;\n\t\tif (payload.byteLength !== 1 || !(payload[0] === 0 || payload[0] === 1)) throw new Error(\"invalid bool frame\");\n\t\treturn payload[0] === 1;\n\t}\n\n\t/**\n\t * Update this subscription's options (e.g. priority), triggering a SUBSCRIBE_UPDATE to the\n\t * publisher. Mirrors the Rust `Subscriber::update`.\n\t */\n\tupdate(options: Subscription) {\n\t\tthis.#state.update.set(subscriptionDefaults(options));\n\t}\n}\n"]}

package/util/timeout.d.ts

@@ -0,0 +1,5 @@
+export declare class TimeoutError extends Error {
+    constructor(message: string);
+}
+export declare function withTimeout<T>(promise: Promise<T>, ms: number, message: string): Promise<T>;
+//# sourceMappingURL=timeout.d.ts.map

package/util/timeout.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"timeout.d.ts","sourceRoot":"","sources":["../../src/util/timeout.ts"],"names":[],"mappings":"AAAA,qBAAa,YAAa,SAAQ,KAAK;IACtC,YAAY,OAAO,EAAE,MAAM,EAG1B;CACD;AAKD,wBAAgB,WAAW,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAM3F"}

package/util/timeout.js

@@ -0,0 +1,18 @@
+/* @ts-self-types="./timeout.d.ts" */
+export class TimeoutError extends Error {
+    constructor(message) {
+        super(message);
+        this.name = "TimeoutError";
+    }
+}
+// Race `promise` against a timeout. There's no cancellation; if `promise`
+// settles after the timeout fires the caller is responsible for cleaning up
+// any side effects (open streams, etc.) it may produce.
+export function withTimeout(promise, ms, message) {
+    let timer;
+    const timeout = new Promise((_, reject) => {
+        timer = setTimeout(() => reject(new TimeoutError(message)), ms);
+    });
+    return Promise.race([promise, timeout]).finally(() => clearTimeout(timer));
+}
+//# sourceMappingURL=timeout.js.map

package/util/timeout.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"timeout.js","sourceRoot":"","sources":["../../src/util/timeout.ts"],"names":[],"mappings":"AAAA,MAAM,OAAO,YAAa,SAAQ,KAAK;IACtC,YAAY,OAAe;QAC1B,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,cAAc,CAAC;IAC5B,CAAC;CACD;AAED,0EAA0E;AAC1E,4EAA4E;AAC5E,wDAAwD;AACxD,MAAM,UAAU,WAAW,CAAI,OAAmB,EAAE,EAAU,EAAE,OAAe;IAC9E,IAAI,KAAoC,CAAC;IACzC,MAAM,OAAO,GAAG,IAAI,OAAO,CAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE;QAChD,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,YAAY,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IACjE,CAAC,CAAC,CAAC;IACH,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC;AAC5E,CAAC","sourcesContent":["export class TimeoutError extends Error {\n\tconstructor(message: string) {\n\t\tsuper(message);\n\t\tthis.name = \"TimeoutError\";\n\t}\n}\n\n// Race `promise` against a timeout. There's no cancellation; if `promise`\n// settles after the timeout fires the caller is responsible for cleaning up\n// any side effects (open streams, etc.) it may produce.\nexport function withTimeout<T>(promise: Promise<T>, ms: number, message: string): Promise<T> {\n\tlet timer: ReturnType<typeof setTimeout>;\n\tconst timeout = new Promise<never>((_, reject) => {\n\t\ttimer = setTimeout(() => reject(new TimeoutError(message)), ms);\n\t});\n\treturn Promise.race([promise, timeout]).finally(() => clearTimeout(timer));\n}\n"]}

package/util/utf8.d.ts

@@ -0,0 +1,3 @@
+/** Decode a protocol string, rejecting bytes that are not valid UTF-8. */
+export declare function decodeUtf8(buffer: Uint8Array): string;
+//# sourceMappingURL=utf8.d.ts.map

package/util/utf8.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"utf8.d.ts","sourceRoot":"","sources":["../../src/util/utf8.ts"],"names":[],"mappings":"AAEA,0EAA0E;AAC1E,wBAAgB,UAAU,CAAC,MAAM,EAAE,UAAU,GAAG,MAAM,CAErD"}

package/util/utf8.js

@@ -0,0 +1,7 @@
+/* @ts-self-types="./utf8.d.ts" */
+const decoder = new TextDecoder("utf-8", { fatal: true });
+/** Decode a protocol string, rejecting bytes that are not valid UTF-8. */
+export function decodeUtf8(buffer) {
+    return decoder.decode(buffer);
+}
+//# sourceMappingURL=utf8.js.map

package/util/utf8.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"utf8.js","sourceRoot":"","sources":["../../src/util/utf8.ts"],"names":[],"mappings":"AAAA,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;AAE1D,0EAA0E;AAC1E,MAAM,UAAU,UAAU,CAAC,MAAkB;IAC5C,OAAO,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;AAC/B,CAAC","sourcesContent":["const decoder = new TextDecoder(\"utf-8\", { fatal: true });\n\n/** Decode a protocol string, rejecting bytes that are not valid UTF-8. */\nexport function decodeUtf8(buffer: Uint8Array): string {\n\treturn decoder.decode(buffer);\n}\n"]}

package/varint.d.ts

@@ -1,3 +1,9 @@
+/**
+ * QUIC variable-length integer encoding and decoding.
+ * https://www.rfc-editor.org/rfc/rfc9000#section-16
+ *
+ * @module
+ */
 /** Largest value that fits in a 1-byte varint (6 bits). */
 export declare const MAX_U6: number;
 /** Largest value that fits in a 2-byte varint (14 bits). */
@@ -24,13 +30,18 @@ export declare function size(v: number): number;
  */
 export declare function encodeTo(dst: ArrayBuffer, v: number | bigint): Uint8Array;
 /**
- * Encodes a number as a QUIC variable-length integer.
+ * Encodes a number or bigint as a QUIC variable-length integer.
  * Returns a new Uint8Array containing the encoded bytes.
  */
-export declare function encode(v: number): Uint8Array;
+export declare function encode(v: number | bigint): Uint8Array;
 /**
- * Decodes a QUIC variable-length integer from a buffer.
+ * Decodes a QUIC variable-length integer exactly from a buffer.
  * Returns a tuple of [value, remaining buffer].
  */
+export declare function decodeBigInt(buf: Uint8Array): [bigint, Uint8Array];
+/**
+ * Decodes a QUIC variable-length integer from a buffer.
+ * Values above 53 bits lose precision; use {@link decodeBigInt} for exact decoding.
+ */
 export declare function decode(buf: Uint8Array): [number, Uint8Array];
 //# sourceMappingURL=varint.d.ts.map

package/varint.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"varint.d.ts","sourceRoot":"","sources":["../src/varint.ts"],"names":[],"mappings":"AAGA,2DAA2D;AAC3D,eAAO,MAAM,MAAM,QAAa,CAAC;AACjC,4DAA4D;AAC5D,eAAO,MAAM,OAAO,QAAc,CAAC;AACnC,4DAA4D;AAC5D,eAAO,MAAM,OAAO,QAAc,CAAC;AACnC,+FAA+F;AAC/F,eAAO,MAAM,OAAO,QAA0B,CAAC;AAgB/C,kFAAkF;AAClF,wBAAgB,eAAe,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM,CAY1D;AAED,6GAA6G;AAC7G,wBAAgB,mBAAmB,CAAC,GAAG,EAAE,WAAW,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,UAAU,CAkDpF;AAED,oFAAoF;AACpF,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,UAAU,CAEhE;AAED,kFAAkF;AAClF,wBAAgB,iBAAiB,CAAC,GAAG,EAAE,UAAU,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAmFvE;AAED;;GAEG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAMtC;AA6BD;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,GAAG,EAAE,WAAW,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,UAAU,CAmBzE;AAED;;;GAGG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,MAAM,GAAG,UAAU,CAE5C;AAED;;;GAGG;AACH,wBAAgB,MAAM,CAAC,GAAG,EAAE,UAAU,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CA8B5D"}
+{"version":3,"file":"varint.d.ts","sourceRoot":"","sources":["../src/varint.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,2DAA2D;AAC3D,eAAO,MAAM,MAAM,QAAa,CAAC;AACjC,4DAA4D;AAC5D,eAAO,MAAM,OAAO,QAAc,CAAC;AACnC,4DAA4D;AAC5D,eAAO,MAAM,OAAO,QAAc,CAAC;AACnC,+FAA+F;AAC/F,eAAO,MAAM,OAAO,QAA0B,CAAC;AAgB/C,kFAAkF;AAClF,wBAAgB,eAAe,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM,CAY1D;AAED,6GAA6G;AAC7G,wBAAgB,mBAAmB,CAAC,GAAG,EAAE,WAAW,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,UAAU,CAkDpF;AAED,oFAAoF;AACpF,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,UAAU,CAEhE;AAED,kFAAkF;AAClF,wBAAgB,iBAAiB,CAAC,GAAG,EAAE,UAAU,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAmFvE;AAED;;GAEG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAMtC;AA6BD;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,GAAG,EAAE,WAAW,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,UAAU,CAmBzE;AAED;;;GAGG;AACH,wBAAgB,MAAM,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,GAAG,UAAU,CAErD;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,GAAG,EAAE,UAAU,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CA6BlE;AAED;;;GAGG;AACH,wBAAgB,MAAM,CAAC,GAAG,EAAE,UAAU,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAG5D"}

package/varint.js

@@ -1,6 +1,10 @@
 /* @ts-self-types="./varint.d.ts" */
-// QUIC variable-length integer encoding/decoding
-// https://www.rfc-editor.org/rfc/rfc9000#section-16
+/**
+ * QUIC variable-length integer encoding and decoding.
+ * https://www.rfc-editor.org/rfc/rfc9000#section-16
+ *
+ * @module
+ */
 /** Largest value that fits in a 1-byte varint (6 bits). */
 export const MAX_U6 = 2 ** 6 - 1;
 /** Largest value that fits in a 2-byte varint (14 bits). */
@@ -246,17 +250,17 @@ export function encodeTo(dst, v) {
     return setUint64(dst, b | 0xc000000000000000n);
 }
 /**
- * Encodes a number as a QUIC variable-length integer.
+ * Encodes a number or bigint as a QUIC variable-length integer.
  * Returns a new Uint8Array containing the encoded bytes.
  */
 export function encode(v) {
     return encodeTo(new ArrayBuffer(8), v);
 }
 /**
- * Decodes a QUIC variable-length integer from a buffer.
+ * Decodes a QUIC variable-length integer exactly from a buffer.
  * Returns a tuple of [value, remaining buffer].
  */
-export function decode(buf) {
+export function decodeBigInt(buf) {
     if (buf.length === 0) {
         throw new Error("buffer is empty");
     }
@@ -266,23 +270,30 @@ export function decode(buf) {
     }
     const view = new DataView(buf.buffer, buf.byteOffset, size);
     const remain = buf.subarray(size);
-    let v;
+    let value;
     if (size === 1) {
-        v = buf[0] & 0x3f;
+        value = BigInt(buf[0] & 0x3f);
     }
     else if (size === 2) {
-        v = view.getUint16(0) & 0x3fff;
+        value = BigInt(view.getUint16(0) & 0x3fff);
     }
     else if (size === 4) {
-        v = view.getUint32(0) & 0x3fffffff;
+        value = BigInt(view.getUint32(0) & 0x3fffffff);
     }
     else if (size === 8) {
-        // NOTE: Precision loss above 2^53, but we're using number type
-        v = Number(view.getBigUint64(0) & 0x3fffffffffffffffn);
+        value = view.getBigUint64(0) & 0x3fffffffffffffffn;
     }
     else {
         throw new Error("impossible");
     }
-    return [v, remain];
+    return [value, remain];
+}
+/**
+ * Decodes a QUIC variable-length integer from a buffer.
+ * Values above 53 bits lose precision; use {@link decodeBigInt} for exact decoding.
+ */
+export function decode(buf) {
+    const [value, remain] = decodeBigInt(buf);
+    return [Number(value), remain];
 }
 //# sourceMappingURL=varint.js.map

package/varint.js.map

@@ -1 +1 @@
-{"version":3,"file":"varint.js","sourceRoot":"","sources":["../src/varint.ts"],"names":[],"mappings":"AAAA,iDAAiD;AACjD,oDAAoD;AAEpD,2DAA2D;AAC3D,MAAM,CAAC,MAAM,MAAM,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACjC,4DAA4D;AAC5D,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;AACnC,4DAA4D;AAC5D,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;AACnC,+FAA+F;AAC/F,MAAM,CAAC,MAAM,OAAO,GAAG,MAAM,CAAC,gBAAgB,CAAC;AAE/C,iEAAiE;AACjE,mBAAmB;AACnB,qCAAqC;AACrC,sCAAsC;AACtC,sCAAsC;AACtC,sCAAsC;AACtC,sCAAsC;AACtC,sCAAsC;AACtC,sFAAsF;AACtF,sCAAsC;AACtC,sCAAsC;AAEtC,MAAM,OAAO,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,GAAG,EAAE,CAAC;AAEjC,kFAAkF;AAClF,MAAM,UAAU,eAAe,CAAC,CAAkB;IACjD,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACpB,IAAI,CAAC,GAAG,EAAE;QAAE,MAAM,IAAI,UAAU,CAAC,sBAAsB,CAAC,EAAE,CAAC,CAAC;IAC5D,IAAI,CAAC,GAAG,OAAO;QAAE,MAAM,IAAI,UAAU,CAAC,0BAA0B,CAAC,EAAE,CAAC,CAAC;IACrE,IAAI,CAAC,GAAG,EAAE,IAAI,EAAE;QAAE,OAAO,CAAC,CAAC;IAC3B,IAAI,CAAC,GAAG,EAAE,IAAI,GAAG;QAAE,OAAO,CAAC,CAAC;IAC5B,IAAI,CAAC,GAAG,EAAE,IAAI,GAAG;QAAE,OAAO,CAAC,CAAC;IAC5B,IAAI,CAAC,GAAG,EAAE,IAAI,GAAG;QAAE,OAAO,CAAC,CAAC;IAC5B,IAAI,CAAC,GAAG,EAAE,IAAI,GAAG;QAAE,OAAO,CAAC,CAAC;IAC5B,IAAI,CAAC,GAAG,EAAE,IAAI,GAAG;QAAE,OAAO,CAAC,CAAC;IAC5B,IAAI,CAAC,GAAG,EAAE,IAAI,GAAG;QAAE,OAAO,CAAC,CAAC;IAC5B,OAAO,CAAC,CAAC;AACV,CAAC;AAED,6GAA6G;AAC7G,MAAM,UAAU,mBAAmB,CAAC,GAAgB,EAAE,CAAkB;IACvE,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACpB,IAAI,CAAC,GAAG,EAAE;QAAE,MAAM,IAAI,UAAU,CAAC,iCAAiC,CAAC,EAAE,CAAC,CAAC;IACvE,IAAI,CAAC,GAAG,OAAO;QAAE,MAAM,IAAI,UAAU,CAAC,0BAA0B,CAAC,EAAE,CAAC,CAAC;IAErE,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC;IAE/B,IAAI,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC;QAClB,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5B,OAAO,IAAI,UAAU,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAClC,CAAC;IACD,IAAI,CAAC,GAAG,EAAE,IAAI,GAAG,EAAE,CAAC;QACnB,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACzC,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QACpC,OAAO,IAAI,UAAU,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAClC,CAAC;IACD,IAAI,CAAC,GAAG,EAAE,IAAI,GAAG,EAAE,CAAC;QACnB,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;QAC1C,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;QACvC,OAAO,IAAI,UAAU,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAClC,CAAC;IACD,IAAI,CAAC,GAAG,EAAE,IAAI,GAAG,EAAE,CAAC;QACnB,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;QAC1C,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QAC7C,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;QACvC,OAAO,IAAI,UAAU,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAClC,CAAC;IACD,IAAI,CAAC,GAAG,EAAE,IAAI,GAAG,EAAE,CAAC;QACnB,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;QAC1C,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;QAC3C,OAAO,IAAI,UAAU,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAClC,CAAC;IACD,IAAI,CAAC,GAAG,EAAE,IAAI,GAAG,EAAE,CAAC;QACnB,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;QAC1C,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QAC7C,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;QAC3C,OAAO,IAAI,UAAU,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAClC,CAAC;IACD,IAAI,CAAC,GAAG,EAAE,IAAI,GAAG,EAAE,CAAC;QACnB,qBAAqB;QACrB,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QACvB,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QAC7C,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;QAChD,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;QAC3C,OAAO,IAAI,UAAU,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAClC,CAAC;IACD,qBAAqB;IACrB,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACvB,IAAI,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACxB,OAAO,IAAI,UAAU,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AAClC,CAAC;AAED,oFAAoF;AACpF,MAAM,UAAU,iBAAiB,CAAC,CAAkB;IACnD,OAAO,mBAAmB,CAAC,IAAI,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACnD,CAAC;AAED,kFAAkF;AAClF,MAAM,UAAU,iBAAiB,CAAC,GAAe;IAChD,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC;IAEzD,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IACjB,uBAAuB;IACvB,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;QACnC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC;YAAE,IAAI,EAAE,CAAC;;YACtB,MAAM;IACZ,CAAC;IAED,kFAAkF;IAClF,2FAA2F;IAE3F,IAAI,SAAiB,CAAC;IACtB,IAAI,IAAI,IAAI,CAAC;QAAE,SAAS,GAAG,IAAI,GAAG,CAAC,CAAC;SAC/B,IAAI,IAAI,KAAK,CAAC;QAAE,SAAS,GAAG,CAAC,CAAC;SAC9B,IAAI,IAAI,KAAK,CAAC;QAAE,SAAS,GAAG,CAAC,CAAC;;QAC9B,SAAS,GAAG,CAAC,CAAC,CAAC,aAAa;IAEjC,IAAI,GAAG,CAAC,MAAM,GAAG,SAAS,EAAE,CAAC;QAC5B,MAAM,IAAI,KAAK,CAAC,0BAA0B,SAAS,gBAAgB,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;IAClF,CAAC;IAED,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;IACjE,MAAM,MAAM,GAAG,GAAG,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;IACvC,IAAI,KAAa,CAAC;IAElB,QAAQ,IAAI,EAAE,CAAC;QACd,KAAK,CAAC;YACL,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAClB,MAAM;QACP,KAAK,CAAC;YACL,KAAK,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAClD,MAAM;QACP,KAAK,CAAC;YACL,KAAK,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9D,MAAM;QACP,KAAK,CAAC;YACL,KAAK,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACtG,MAAM;QACP,KAAK,CAAC;YACL,KAAK,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9D,MAAM;QACP,KAAK,CAAC;YACL,KAAK;gBACJ,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC;oBACzB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;oBACvB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;oBACvB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;oBACvB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;oBACtB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAChB,MAAM;QACP,KAAK,CAAC,EAAE,CAAC;YACR,2CAA2C;YAC3C,KAAK;gBACJ,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC;oBACzB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;oBACvB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;oBACvB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;oBACvB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;oBACvB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;oBACtB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAChB,MAAM;QACP,CAAC;QACD,KAAK,CAAC,EAAE,CAAC;YACR,sCAAsC;YACtC,MAAM,EAAE,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;YAC7B,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACV,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC9B,KAAK,GAAG,IAAI,QAAQ,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAChD,MAAM;QACP,CAAC;QACD,KAAK,CAAC,EAAE,CAAC;YACR,+BAA+B;YAC/B,KAAK,GAAG,IAAI,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACxE,MAAM;QACP,CAAC;QACD;YACC,MAAM,IAAI,KAAK,CAAC,YAAY,CAAC,CAAC;IAChC,CAAC;IAED,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;AACxB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,IAAI,CAAC,CAAS;IAC7B,IAAI,CAAC,IAAI,MAAM;QAAE,OAAO,CAAC,CAAC;IAC1B,IAAI,CAAC,IAAI,OAAO;QAAE,OAAO,CAAC,CAAC;IAC3B,IAAI,CAAC,IAAI,OAAO;QAAE,OAAO,CAAC,CAAC;IAC3B,IAAI,CAAC,IAAI,OAAO;QAAE,OAAO,CAAC,CAAC;IAC3B,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,EAAE,CAAC,CAAC;AAC9D,CAAC;AAED,iDAAiD;AACjD,SAAS,QAAQ,CAAC,GAAgB,EAAE,CAAS;IAC5C,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACzC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACd,OAAO,MAAM,CAAC;AACf,CAAC;AAED,SAAS,SAAS,CAAC,GAAgB,EAAE,CAAS;IAC7C,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACrC,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACrB,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;AACtE,CAAC;AAED,SAAS,SAAS,CAAC,GAAgB,EAAE,CAAS;IAC7C,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACrC,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACrB,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;AACtE,CAAC;AAED,SAAS,SAAS,CAAC,GAAgB,EAAE,CAAS;IAC7C,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACrC,IAAI,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACxB,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;AACtE,CAAC;AAED,MAAM,OAAO,GAAG,EAAE,IAAI,GAAG,GAAG,EAAE,CAAC;AAE/B;;;GAGG;AACH,MAAM,UAAU,QAAQ,CAAC,GAAgB,EAAE,CAAkB;IAC5D,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACpB,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;QACZ,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,EAAE,CAAC,CAAC;IACvD,CAAC;IACD,IAAI,CAAC,GAAG,OAAO,EAAE,CAAC;QACjB,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,EAAE,CAAC,CAAC;IAC9D,CAAC;IACD,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACpB,IAAI,CAAC,IAAI,MAAM,EAAE,CAAC;QACjB,OAAO,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACzB,CAAC;IACD,IAAI,CAAC,IAAI,OAAO,EAAE,CAAC;QAClB,OAAO,SAAS,CAAC,GAAG,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC;IACnC,CAAC;IACD,IAAI,CAAC,IAAI,OAAO,EAAE,CAAC;QAClB,OAAO,SAAS,CAAC,GAAG,EAAE,CAAC,GAAG,UAAU,CAAC,CAAC;IACvC,CAAC;IACD,OAAO,SAAS,CAAC,GAAG,EAAE,CAAC,GAAG,mBAAmB,CAAC,CAAC;AAChD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,MAAM,CAAC,CAAS;IAC/B,OAAO,QAAQ,CAAC,IAAI,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACxC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,MAAM,CAAC,GAAe;IACrC,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACtB,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC;IACpC,CAAC;IAED,MAAM,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAEzC,IAAI,GAAG,CAAC,MAAM,GAAG,IAAI,EAAE,CAAC;QACvB,MAAM,IAAI,KAAK,CAAC,0BAA0B,IAAI,gBAAgB,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;IAC7E,CAAC;IAED,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;IAC5D,MAAM,MAAM,GAAG,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IAElC,IAAI,CAAS,CAAC;IAEd,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;QAChB,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;IACnB,CAAC;SAAM,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;QACvB,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;IAChC,CAAC;SAAM,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;QACvB,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC;IACpC,CAAC;SAAM,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;QACvB,+DAA+D;QAC/D,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,mBAAmB,CAAC,CAAC;IACxD,CAAC;SAAM,CAAC;QACP,MAAM,IAAI,KAAK,CAAC,YAAY,CAAC,CAAC;IAC/B,CAAC;IAED,OAAO,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;AACpB,CAAC","sourcesContent":["// QUIC variable-length integer encoding/decoding\n// https://www.rfc-editor.org/rfc/rfc9000#section-16\n\n/** Largest value that fits in a 1-byte varint (6 bits). */\nexport const MAX_U6 = 2 ** 6 - 1;\n/** Largest value that fits in a 2-byte varint (14 bits). */\nexport const MAX_U14 = 2 ** 14 - 1;\n/** Largest value that fits in a 4-byte varint (30 bits). */\nexport const MAX_U30 = 2 ** 30 - 1;\n/** Largest value representable without precision loss (`Number.MAX_SAFE_INTEGER`, 53 bits). */\nexport const MAX_U53 = Number.MAX_SAFE_INTEGER;\n\n// Leading-ones varint encoding/decoding (draft-17 Section 1.4.1)\n// Encoding scheme:\n// 0xxxxxxx        → 1 byte  (7 bits)\n// 10xxxxxx + 1B   → 2 bytes (14 bits)\n// 110xxxxx + 2B   → 3 bytes (21 bits)\n// 1110xxxx + 3B   → 4 bytes (28 bits)\n// 11110xxx + 4B   → 5 bytes (35 bits)\n// 111110xx + 5B   → 6 bytes (42 bits)\n// 1111110x + 6B   → 7 bytes (49 bits), draft-18+ only (invalid in draft-17 per #1595)\n// 11111110 + 7B   → 8 bytes (56 bits)\n// 11111111 + 8B   → 9 bytes (64 bits)\n\nconst MAX_U64 = (1n << 64n) - 1n;\n\n/** Number of bytes needed to encode a value in the leading-ones varint format. */\nexport function sizeLeadingOnes(v: number | bigint): number {\n\tconst b = BigInt(v);\n\tif (b < 0n) throw new RangeError(`value is negative: ${v}`);\n\tif (b > MAX_U64) throw new RangeError(`value exceeds 64 bits: ${v}`);\n\tif (b < 1n << 7n) return 1;\n\tif (b < 1n << 14n) return 2;\n\tif (b < 1n << 21n) return 3;\n\tif (b < 1n << 28n) return 4;\n\tif (b < 1n << 35n) return 5;\n\tif (b < 1n << 42n) return 6;\n\tif (b < 1n << 56n) return 8;\n\treturn 9;\n}\n\n/** Encode a value in leading-ones varint format into the provided buffer, returning the written subarray. */\nexport function encodeLeadingOnesTo(dst: ArrayBuffer, v: number | bigint): Uint8Array {\n\tconst x = BigInt(v);\n\tif (x < 0n) throw new RangeError(`underflow, value is negative: ${v}`);\n\tif (x > MAX_U64) throw new RangeError(`value exceeds 64 bits: ${v}`);\n\n\tconst view = new DataView(dst);\n\n\tif (x < 1n << 7n) {\n\t\tview.setUint8(0, Number(x));\n\t\treturn new Uint8Array(dst, 0, 1);\n\t}\n\tif (x < 1n << 14n) {\n\t\tview.setUint8(0, 0x80 | Number(x >> 8n));\n\t\tview.setUint8(1, Number(x & 0xffn));\n\t\treturn new Uint8Array(dst, 0, 2);\n\t}\n\tif (x < 1n << 21n) {\n\t\tview.setUint8(0, 0xc0 | Number(x >> 16n));\n\t\tview.setUint16(1, Number(x & 0xffffn));\n\t\treturn new Uint8Array(dst, 0, 3);\n\t}\n\tif (x < 1n << 28n) {\n\t\tview.setUint8(0, 0xe0 | Number(x >> 24n));\n\t\tview.setUint8(1, Number((x >> 16n) & 0xffn));\n\t\tview.setUint16(2, Number(x & 0xffffn));\n\t\treturn new Uint8Array(dst, 0, 4);\n\t}\n\tif (x < 1n << 35n) {\n\t\tview.setUint8(0, 0xf0 | Number(x >> 32n));\n\t\tview.setUint32(1, Number(x & 0xffffffffn));\n\t\treturn new Uint8Array(dst, 0, 5);\n\t}\n\tif (x < 1n << 42n) {\n\t\tview.setUint8(0, 0xf8 | Number(x >> 40n));\n\t\tview.setUint8(1, Number((x >> 32n) & 0xffn));\n\t\tview.setUint32(2, Number(x & 0xffffffffn));\n\t\treturn new Uint8Array(dst, 0, 6);\n\t}\n\tif (x < 1n << 56n) {\n\t\t// 11111110 + 7 bytes\n\t\tview.setUint8(0, 0xfe);\n\t\tview.setUint8(1, Number((x >> 48n) & 0xffn));\n\t\tview.setUint16(2, Number((x >> 32n) & 0xffffn));\n\t\tview.setUint32(4, Number(x & 0xffffffffn));\n\t\treturn new Uint8Array(dst, 0, 8);\n\t}\n\t// 11111111 + 8 bytes\n\tview.setUint8(0, 0xff);\n\tview.setBigUint64(1, x);\n\treturn new Uint8Array(dst, 0, 9);\n}\n\n/** Encode a value in leading-ones varint format into a freshly allocated buffer. */\nexport function encodeLeadingOnes(v: number | bigint): Uint8Array {\n\treturn encodeLeadingOnesTo(new ArrayBuffer(9), v);\n}\n\n/** Decode a leading-ones varint, returning the value and the remaining buffer. */\nexport function decodeLeadingOnes(buf: Uint8Array): [bigint, Uint8Array] {\n\tif (buf.length === 0) throw new Error(\"buffer is empty\");\n\n\tconst b = buf[0];\n\t// Count leading 1-bits\n\tlet ones = 0;\n\tfor (let bit = 7; bit >= 0; bit--) {\n\t\tif (b & (1 << bit)) ones++;\n\t\telse break;\n\t}\n\n\t// 1111110x is a 7-byte form: invalid on draft-17, allowed on draft-18+ per #1595.\n\t// This standalone decoder is permissive (Postel-style) since we lack version context here.\n\n\tlet totalSize: number;\n\tif (ones <= 5) totalSize = ones + 1;\n\telse if (ones === 6) totalSize = 7;\n\telse if (ones === 7) totalSize = 8;\n\telse totalSize = 9; // ones === 8\n\n\tif (buf.length < totalSize) {\n\t\tthrow new Error(`buffer too short: need ${totalSize} bytes, have ${buf.length}`);\n\t}\n\n\tconst view = new DataView(buf.buffer, buf.byteOffset, totalSize);\n\tconst remain = buf.subarray(totalSize);\n\tlet value: bigint;\n\n\tswitch (ones) {\n\t\tcase 0:\n\t\t\tvalue = BigInt(b);\n\t\t\tbreak;\n\t\tcase 1:\n\t\t\tvalue = (BigInt(b & 0x3f) << 8n) | BigInt(buf[1]);\n\t\t\tbreak;\n\t\tcase 2:\n\t\t\tvalue = (BigInt(b & 0x1f) << 16n) | BigInt(view.getUint16(1));\n\t\t\tbreak;\n\t\tcase 3:\n\t\t\tvalue = (BigInt(b & 0x0f) << 24n) | (BigInt(buf[1]) << 16n) | (BigInt(buf[2]) << 8n) | BigInt(buf[3]);\n\t\t\tbreak;\n\t\tcase 4:\n\t\t\tvalue = (BigInt(b & 0x07) << 32n) | BigInt(view.getUint32(1));\n\t\t\tbreak;\n\t\tcase 5:\n\t\t\tvalue =\n\t\t\t\t(BigInt(b & 0x03) << 40n) |\n\t\t\t\t(BigInt(buf[1]) << 32n) |\n\t\t\t\t(BigInt(buf[2]) << 24n) |\n\t\t\t\t(BigInt(buf[3]) << 16n) |\n\t\t\t\t(BigInt(buf[4]) << 8n) |\n\t\t\t\tBigInt(buf[5]);\n\t\t\tbreak;\n\t\tcase 6: {\n\t\t\t// 1111110x + 6 bytes = 49 bits (draft-18+)\n\t\t\tvalue =\n\t\t\t\t(BigInt(b & 0x01) << 48n) |\n\t\t\t\t(BigInt(buf[1]) << 40n) |\n\t\t\t\t(BigInt(buf[2]) << 32n) |\n\t\t\t\t(BigInt(buf[3]) << 24n) |\n\t\t\t\t(BigInt(buf[4]) << 16n) |\n\t\t\t\t(BigInt(buf[5]) << 8n) |\n\t\t\t\tBigInt(buf[6]);\n\t\t\tbreak;\n\t\t}\n\t\tcase 7: {\n\t\t\t// 11111110 + 7 bytes = 56 usable bits\n\t\t\tconst hi = new Uint8Array(8);\n\t\t\thi[0] = 0;\n\t\t\thi.set(buf.subarray(1, 8), 1);\n\t\t\tvalue = new DataView(hi.buffer).getBigUint64(0);\n\t\t\tbreak;\n\t\t}\n\t\tcase 8: {\n\t\t\t// 11111111 + 8 bytes = 64 bits\n\t\t\tvalue = new DataView(buf.buffer, buf.byteOffset + 1, 8).getBigUint64(0);\n\t\t\tbreak;\n\t\t}\n\t\tdefault:\n\t\t\tthrow new Error(\"impossible\");\n\t}\n\n\treturn [value, remain];\n}\n\n/**\n * Returns the number of bytes needed to encode a value as a varint.\n */\nexport function size(v: number): number {\n\tif (v <= MAX_U6) return 1;\n\tif (v <= MAX_U14) return 2;\n\tif (v <= MAX_U30) return 4;\n\tif (v <= MAX_U53) return 8;\n\tthrow new Error(`overflow, value larger than 53-bits: ${v}`);\n}\n\n// Helper functions for writing to an ArrayBuffer\nfunction setUint8(dst: ArrayBuffer, v: number): Uint8Array {\n\tconst buffer = new Uint8Array(dst, 0, 1);\n\tbuffer[0] = v;\n\treturn buffer;\n}\n\nfunction setUint16(dst: ArrayBuffer, v: number): Uint8Array {\n\tconst view = new DataView(dst, 0, 2);\n\tview.setUint16(0, v);\n\treturn new Uint8Array(view.buffer, view.byteOffset, view.byteLength);\n}\n\nfunction setUint32(dst: ArrayBuffer, v: number): Uint8Array {\n\tconst view = new DataView(dst, 0, 4);\n\tview.setUint32(0, v);\n\treturn new Uint8Array(view.buffer, view.byteOffset, view.byteLength);\n}\n\nfunction setUint64(dst: ArrayBuffer, v: bigint): Uint8Array {\n\tconst view = new DataView(dst, 0, 8);\n\tview.setBigUint64(0, v);\n\treturn new Uint8Array(view.buffer, view.byteOffset, view.byteLength);\n}\n\nconst MAX_U62 = 2n ** 62n - 1n;\n\n/**\n * Encodes a number or bigint into a scratch buffer.\n * Used by stream.ts to avoid allocations.\n */\nexport function encodeTo(dst: ArrayBuffer, v: number | bigint): Uint8Array {\n\tconst b = BigInt(v);\n\tif (b < 0n) {\n\t\tthrow new Error(`underflow, value is negative: ${v}`);\n\t}\n\tif (b > MAX_U62) {\n\t\tthrow new Error(`overflow, value larger than 62-bits: ${v}`);\n\t}\n\tconst n = Number(b);\n\tif (n <= MAX_U6) {\n\t\treturn setUint8(dst, n);\n\t}\n\tif (n <= MAX_U14) {\n\t\treturn setUint16(dst, n | 0x4000);\n\t}\n\tif (n <= MAX_U30) {\n\t\treturn setUint32(dst, n | 0x80000000);\n\t}\n\treturn setUint64(dst, b | 0xc000000000000000n);\n}\n\n/**\n * Encodes a number as a QUIC variable-length integer.\n * Returns a new Uint8Array containing the encoded bytes.\n */\nexport function encode(v: number): Uint8Array {\n\treturn encodeTo(new ArrayBuffer(8), v);\n}\n\n/**\n * Decodes a QUIC variable-length integer from a buffer.\n * Returns a tuple of [value, remaining buffer].\n */\nexport function decode(buf: Uint8Array): [number, Uint8Array] {\n\tif (buf.length === 0) {\n\t\tthrow new Error(\"buffer is empty\");\n\t}\n\n\tconst size = 1 << ((buf[0] & 0xc0) >> 6);\n\n\tif (buf.length < size) {\n\t\tthrow new Error(`buffer too short: need ${size} bytes, have ${buf.length}`);\n\t}\n\n\tconst view = new DataView(buf.buffer, buf.byteOffset, size);\n\tconst remain = buf.subarray(size);\n\n\tlet v: number;\n\n\tif (size === 1) {\n\t\tv = buf[0] & 0x3f;\n\t} else if (size === 2) {\n\t\tv = view.getUint16(0) & 0x3fff;\n\t} else if (size === 4) {\n\t\tv = view.getUint32(0) & 0x3fffffff;\n\t} else if (size === 8) {\n\t\t// NOTE: Precision loss above 2^53, but we're using number type\n\t\tv = Number(view.getBigUint64(0) & 0x3fffffffffffffffn);\n\t} else {\n\t\tthrow new Error(\"impossible\");\n\t}\n\n\treturn [v, remain];\n}\n"]}
+{"version":3,"file":"varint.js","sourceRoot":"","sources":["../src/varint.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,2DAA2D;AAC3D,MAAM,CAAC,MAAM,MAAM,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACjC,4DAA4D;AAC5D,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;AACnC,4DAA4D;AAC5D,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;AACnC,+FAA+F;AAC/F,MAAM,CAAC,MAAM,OAAO,GAAG,MAAM,CAAC,gBAAgB,CAAC;AAE/C,iEAAiE;AACjE,mBAAmB;AACnB,qCAAqC;AACrC,sCAAsC;AACtC,sCAAsC;AACtC,sCAAsC;AACtC,sCAAsC;AACtC,sCAAsC;AACtC,sFAAsF;AACtF,sCAAsC;AACtC,sCAAsC;AAEtC,MAAM,OAAO,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,GAAG,EAAE,CAAC;AAEjC,kFAAkF;AAClF,MAAM,UAAU,eAAe,CAAC,CAAkB;IACjD,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACpB,IAAI,CAAC,GAAG,EAAE;QAAE,MAAM,IAAI,UAAU,CAAC,sBAAsB,CAAC,EAAE,CAAC,CAAC;IAC5D,IAAI,CAAC,GAAG,OAAO;QAAE,MAAM,IAAI,UAAU,CAAC,0BAA0B,CAAC,EAAE,CAAC,CAAC;IACrE,IAAI,CAAC,GAAG,EAAE,IAAI,EAAE;QAAE,OAAO,CAAC,CAAC;IAC3B,IAAI,CAAC,GAAG,EAAE,IAAI,GAAG;QAAE,OAAO,CAAC,CAAC;IAC5B,IAAI,CAAC,GAAG,EAAE,IAAI,GAAG;QAAE,OAAO,CAAC,CAAC;IAC5B,IAAI,CAAC,GAAG,EAAE,IAAI,GAAG;QAAE,OAAO,CAAC,CAAC;IAC5B,IAAI,CAAC,GAAG,EAAE,IAAI,GAAG;QAAE,OAAO,CAAC,CAAC;IAC5B,IAAI,CAAC,GAAG,EAAE,IAAI,GAAG;QAAE,OAAO,CAAC,CAAC;IAC5B,IAAI,CAAC,GAAG,EAAE,IAAI,GAAG;QAAE,OAAO,CAAC,CAAC;IAC5B,OAAO,CAAC,CAAC;AACV,CAAC;AAED,6GAA6G;AAC7G,MAAM,UAAU,mBAAmB,CAAC,GAAgB,EAAE,CAAkB;IACvE,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACpB,IAAI,CAAC,GAAG,EAAE;QAAE,MAAM,IAAI,UAAU,CAAC,iCAAiC,CAAC,EAAE,CAAC,CAAC;IACvE,IAAI,CAAC,GAAG,OAAO;QAAE,MAAM,IAAI,UAAU,CAAC,0BAA0B,CAAC,EAAE,CAAC,CAAC;IAErE,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC;IAE/B,IAAI,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC;QAClB,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5B,OAAO,IAAI,UAAU,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAClC,CAAC;IACD,IAAI,CAAC,GAAG,EAAE,IAAI,GAAG,EAAE,CAAC;QACnB,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACzC,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QACpC,OAAO,IAAI,UAAU,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAClC,CAAC;IACD,IAAI,CAAC,GAAG,EAAE,IAAI,GAAG,EAAE,CAAC;QACnB,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;QAC1C,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;QACvC,OAAO,IAAI,UAAU,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAClC,CAAC;IACD,IAAI,CAAC,GAAG,EAAE,IAAI,GAAG,EAAE,CAAC;QACnB,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;QAC1C,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QAC7C,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;QACvC,OAAO,IAAI,UAAU,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAClC,CAAC;IACD,IAAI,CAAC,GAAG,EAAE,IAAI,GAAG,EAAE,CAAC;QACnB,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;QAC1C,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;QAC3C,OAAO,IAAI,UAAU,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAClC,CAAC;IACD,IAAI,CAAC,GAAG,EAAE,IAAI,GAAG,EAAE,CAAC;QACnB,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,GAAG,MAAM,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC;QAC1C,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QAC7C,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;QAC3C,OAAO,IAAI,UAAU,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAClC,CAAC;IACD,IAAI,CAAC,GAAG,EAAE,IAAI,GAAG,EAAE,CAAC;QACnB,qBAAqB;QACrB,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QACvB,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QAC7C,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;QAChD,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;QAC3C,OAAO,IAAI,UAAU,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAClC,CAAC;IACD,qBAAqB;IACrB,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACvB,IAAI,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACxB,OAAO,IAAI,UAAU,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;AAClC,CAAC;AAED,oFAAoF;AACpF,MAAM,UAAU,iBAAiB,CAAC,CAAkB;IACnD,OAAO,mBAAmB,CAAC,IAAI,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACnD,CAAC;AAED,kFAAkF;AAClF,MAAM,UAAU,iBAAiB,CAAC,GAAe;IAChD,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC;IAEzD,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;IACjB,uBAAuB;IACvB,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;QACnC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC;YAAE,IAAI,EAAE,CAAC;;YACtB,MAAM;IACZ,CAAC;IAED,kFAAkF;IAClF,2FAA2F;IAE3F,IAAI,SAAiB,CAAC;IACtB,IAAI,IAAI,IAAI,CAAC;QAAE,SAAS,GAAG,IAAI,GAAG,CAAC,CAAC;SAC/B,IAAI,IAAI,KAAK,CAAC;QAAE,SAAS,GAAG,CAAC,CAAC;SAC9B,IAAI,IAAI,KAAK,CAAC;QAAE,SAAS,GAAG,CAAC,CAAC;;QAC9B,SAAS,GAAG,CAAC,CAAC,CAAC,aAAa;IAEjC,IAAI,GAAG,CAAC,MAAM,GAAG,SAAS,EAAE,CAAC;QAC5B,MAAM,IAAI,KAAK,CAAC,0BAA0B,SAAS,gBAAgB,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;IAClF,CAAC;IAED,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;IACjE,MAAM,MAAM,GAAG,GAAG,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;IACvC,IAAI,KAAa,CAAC;IAElB,QAAQ,IAAI,EAAE,CAAC;QACd,KAAK,CAAC;YACL,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAClB,MAAM;QACP,KAAK,CAAC;YACL,KAAK,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAClD,MAAM;QACP,KAAK,CAAC;YACL,KAAK,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9D,MAAM;QACP,KAAK,CAAC;YACL,KAAK,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACtG,MAAM;QACP,KAAK,CAAC;YACL,KAAK,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9D,MAAM;QACP,KAAK,CAAC;YACL,KAAK;gBACJ,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC;oBACzB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;oBACvB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;oBACvB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;oBACvB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;oBACtB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAChB,MAAM;QACP,KAAK,CAAC,EAAE,CAAC;YACR,2CAA2C;YAC3C,KAAK;gBACJ,CAAC,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC;oBACzB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;oBACvB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;oBACvB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;oBACvB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;oBACvB,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;oBACtB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAChB,MAAM;QACP,CAAC;QACD,KAAK,CAAC,EAAE,CAAC;YACR,sCAAsC;YACtC,MAAM,EAAE,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;YAC7B,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACV,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC9B,KAAK,GAAG,IAAI,QAAQ,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAChD,MAAM;QACP,CAAC;QACD,KAAK,CAAC,EAAE,CAAC;YACR,+BAA+B;YAC/B,KAAK,GAAG,IAAI,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YACxE,MAAM;QACP,CAAC;QACD;YACC,MAAM,IAAI,KAAK,CAAC,YAAY,CAAC,CAAC;IAChC,CAAC;IAED,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;AACxB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,IAAI,CAAC,CAAS;IAC7B,IAAI,CAAC,IAAI,MAAM;QAAE,OAAO,CAAC,CAAC;IAC1B,IAAI,CAAC,IAAI,OAAO;QAAE,OAAO,CAAC,CAAC;IAC3B,IAAI,CAAC,IAAI,OAAO;QAAE,OAAO,CAAC,CAAC;IAC3B,IAAI,CAAC,IAAI,OAAO;QAAE,OAAO,CAAC,CAAC;IAC3B,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,EAAE,CAAC,CAAC;AAC9D,CAAC;AAED,iDAAiD;AACjD,SAAS,QAAQ,CAAC,GAAgB,EAAE,CAAS;IAC5C,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACzC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACd,OAAO,MAAM,CAAC;AACf,CAAC;AAED,SAAS,SAAS,CAAC,GAAgB,EAAE,CAAS;IAC7C,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACrC,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACrB,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;AACtE,CAAC;AAED,SAAS,SAAS,CAAC,GAAgB,EAAE,CAAS;IAC7C,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACrC,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACrB,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;AACtE,CAAC;AAED,SAAS,SAAS,CAAC,GAAgB,EAAE,CAAS;IAC7C,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACrC,IAAI,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACxB,OAAO,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;AACtE,CAAC;AAED,MAAM,OAAO,GAAG,EAAE,IAAI,GAAG,GAAG,EAAE,CAAC;AAE/B;;;GAGG;AACH,MAAM,UAAU,QAAQ,CAAC,GAAgB,EAAE,CAAkB;IAC5D,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACpB,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;QACZ,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,EAAE,CAAC,CAAC;IACvD,CAAC;IACD,IAAI,CAAC,GAAG,OAAO,EAAE,CAAC;QACjB,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,EAAE,CAAC,CAAC;IAC9D,CAAC;IACD,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;IACpB,IAAI,CAAC,IAAI,MAAM,EAAE,CAAC;QACjB,OAAO,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACzB,CAAC;IACD,IAAI,CAAC,IAAI,OAAO,EAAE,CAAC;QAClB,OAAO,SAAS,CAAC,GAAG,EAAE,CAAC,GAAG,MAAM,CAAC,CAAC;IACnC,CAAC;IACD,IAAI,CAAC,IAAI,OAAO,EAAE,CAAC;QAClB,OAAO,SAAS,CAAC,GAAG,EAAE,CAAC,GAAG,UAAU,CAAC,CAAC;IACvC,CAAC;IACD,OAAO,SAAS,CAAC,GAAG,EAAE,CAAC,GAAG,mBAAmB,CAAC,CAAC;AAChD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,MAAM,CAAC,CAAkB;IACxC,OAAO,QAAQ,CAAC,IAAI,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACxC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,GAAe;IAC3C,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACtB,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC;IACpC,CAAC;IAED,MAAM,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAEzC,IAAI,GAAG,CAAC,MAAM,GAAG,IAAI,EAAE,CAAC;QACvB,MAAM,IAAI,KAAK,CAAC,0BAA0B,IAAI,gBAAgB,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;IAC7E,CAAC;IAED,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;IAC5D,MAAM,MAAM,GAAG,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IAElC,IAAI,KAAa,CAAC;IAElB,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;QAChB,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;IAC/B,CAAC;SAAM,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;QACvB,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC;IAC5C,CAAC;SAAM,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;QACvB,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC;IAChD,CAAC;SAAM,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;QACvB,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,mBAAmB,CAAC;IACpD,CAAC;SAAM,CAAC;QACP,MAAM,IAAI,KAAK,CAAC,YAAY,CAAC,CAAC;IAC/B,CAAC;IAED,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;AACxB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,MAAM,CAAC,GAAe;IACrC,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;IAC1C,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,CAAC;AAChC,CAAC","sourcesContent":["/**\n * QUIC variable-length integer encoding and decoding.\n * https://www.rfc-editor.org/rfc/rfc9000#section-16\n *\n * @module\n */\n\n/** Largest value that fits in a 1-byte varint (6 bits). */\nexport const MAX_U6 = 2 ** 6 - 1;\n/** Largest value that fits in a 2-byte varint (14 bits). */\nexport const MAX_U14 = 2 ** 14 - 1;\n/** Largest value that fits in a 4-byte varint (30 bits). */\nexport const MAX_U30 = 2 ** 30 - 1;\n/** Largest value representable without precision loss (`Number.MAX_SAFE_INTEGER`, 53 bits). */\nexport const MAX_U53 = Number.MAX_SAFE_INTEGER;\n\n// Leading-ones varint encoding/decoding (draft-17 Section 1.4.1)\n// Encoding scheme:\n// 0xxxxxxx        → 1 byte  (7 bits)\n// 10xxxxxx + 1B   → 2 bytes (14 bits)\n// 110xxxxx + 2B   → 3 bytes (21 bits)\n// 1110xxxx + 3B   → 4 bytes (28 bits)\n// 11110xxx + 4B   → 5 bytes (35 bits)\n// 111110xx + 5B   → 6 bytes (42 bits)\n// 1111110x + 6B   → 7 bytes (49 bits), draft-18+ only (invalid in draft-17 per #1595)\n// 11111110 + 7B   → 8 bytes (56 bits)\n// 11111111 + 8B   → 9 bytes (64 bits)\n\nconst MAX_U64 = (1n << 64n) - 1n;\n\n/** Number of bytes needed to encode a value in the leading-ones varint format. */\nexport function sizeLeadingOnes(v: number | bigint): number {\n\tconst b = BigInt(v);\n\tif (b < 0n) throw new RangeError(`value is negative: ${v}`);\n\tif (b > MAX_U64) throw new RangeError(`value exceeds 64 bits: ${v}`);\n\tif (b < 1n << 7n) return 1;\n\tif (b < 1n << 14n) return 2;\n\tif (b < 1n << 21n) return 3;\n\tif (b < 1n << 28n) return 4;\n\tif (b < 1n << 35n) return 5;\n\tif (b < 1n << 42n) return 6;\n\tif (b < 1n << 56n) return 8;\n\treturn 9;\n}\n\n/** Encode a value in leading-ones varint format into the provided buffer, returning the written subarray. */\nexport function encodeLeadingOnesTo(dst: ArrayBuffer, v: number | bigint): Uint8Array {\n\tconst x = BigInt(v);\n\tif (x < 0n) throw new RangeError(`underflow, value is negative: ${v}`);\n\tif (x > MAX_U64) throw new RangeError(`value exceeds 64 bits: ${v}`);\n\n\tconst view = new DataView(dst);\n\n\tif (x < 1n << 7n) {\n\t\tview.setUint8(0, Number(x));\n\t\treturn new Uint8Array(dst, 0, 1);\n\t}\n\tif (x < 1n << 14n) {\n\t\tview.setUint8(0, 0x80 | Number(x >> 8n));\n\t\tview.setUint8(1, Number(x & 0xffn));\n\t\treturn new Uint8Array(dst, 0, 2);\n\t}\n\tif (x < 1n << 21n) {\n\t\tview.setUint8(0, 0xc0 | Number(x >> 16n));\n\t\tview.setUint16(1, Number(x & 0xffffn));\n\t\treturn new Uint8Array(dst, 0, 3);\n\t}\n\tif (x < 1n << 28n) {\n\t\tview.setUint8(0, 0xe0 | Number(x >> 24n));\n\t\tview.setUint8(1, Number((x >> 16n) & 0xffn));\n\t\tview.setUint16(2, Number(x & 0xffffn));\n\t\treturn new Uint8Array(dst, 0, 4);\n\t}\n\tif (x < 1n << 35n) {\n\t\tview.setUint8(0, 0xf0 | Number(x >> 32n));\n\t\tview.setUint32(1, Number(x & 0xffffffffn));\n\t\treturn new Uint8Array(dst, 0, 5);\n\t}\n\tif (x < 1n << 42n) {\n\t\tview.setUint8(0, 0xf8 | Number(x >> 40n));\n\t\tview.setUint8(1, Number((x >> 32n) & 0xffn));\n\t\tview.setUint32(2, Number(x & 0xffffffffn));\n\t\treturn new Uint8Array(dst, 0, 6);\n\t}\n\tif (x < 1n << 56n) {\n\t\t// 11111110 + 7 bytes\n\t\tview.setUint8(0, 0xfe);\n\t\tview.setUint8(1, Number((x >> 48n) & 0xffn));\n\t\tview.setUint16(2, Number((x >> 32n) & 0xffffn));\n\t\tview.setUint32(4, Number(x & 0xffffffffn));\n\t\treturn new Uint8Array(dst, 0, 8);\n\t}\n\t// 11111111 + 8 bytes\n\tview.setUint8(0, 0xff);\n\tview.setBigUint64(1, x);\n\treturn new Uint8Array(dst, 0, 9);\n}\n\n/** Encode a value in leading-ones varint format into a freshly allocated buffer. */\nexport function encodeLeadingOnes(v: number | bigint): Uint8Array {\n\treturn encodeLeadingOnesTo(new ArrayBuffer(9), v);\n}\n\n/** Decode a leading-ones varint, returning the value and the remaining buffer. */\nexport function decodeLeadingOnes(buf: Uint8Array): [bigint, Uint8Array] {\n\tif (buf.length === 0) throw new Error(\"buffer is empty\");\n\n\tconst b = buf[0];\n\t// Count leading 1-bits\n\tlet ones = 0;\n\tfor (let bit = 7; bit >= 0; bit--) {\n\t\tif (b & (1 << bit)) ones++;\n\t\telse break;\n\t}\n\n\t// 1111110x is a 7-byte form: invalid on draft-17, allowed on draft-18+ per #1595.\n\t// This standalone decoder is permissive (Postel-style) since we lack version context here.\n\n\tlet totalSize: number;\n\tif (ones <= 5) totalSize = ones + 1;\n\telse if (ones === 6) totalSize = 7;\n\telse if (ones === 7) totalSize = 8;\n\telse totalSize = 9; // ones === 8\n\n\tif (buf.length < totalSize) {\n\t\tthrow new Error(`buffer too short: need ${totalSize} bytes, have ${buf.length}`);\n\t}\n\n\tconst view = new DataView(buf.buffer, buf.byteOffset, totalSize);\n\tconst remain = buf.subarray(totalSize);\n\tlet value: bigint;\n\n\tswitch (ones) {\n\t\tcase 0:\n\t\t\tvalue = BigInt(b);\n\t\t\tbreak;\n\t\tcase 1:\n\t\t\tvalue = (BigInt(b & 0x3f) << 8n) | BigInt(buf[1]);\n\t\t\tbreak;\n\t\tcase 2:\n\t\t\tvalue = (BigInt(b & 0x1f) << 16n) | BigInt(view.getUint16(1));\n\t\t\tbreak;\n\t\tcase 3:\n\t\t\tvalue = (BigInt(b & 0x0f) << 24n) | (BigInt(buf[1]) << 16n) | (BigInt(buf[2]) << 8n) | BigInt(buf[3]);\n\t\t\tbreak;\n\t\tcase 4:\n\t\t\tvalue = (BigInt(b & 0x07) << 32n) | BigInt(view.getUint32(1));\n\t\t\tbreak;\n\t\tcase 5:\n\t\t\tvalue =\n\t\t\t\t(BigInt(b & 0x03) << 40n) |\n\t\t\t\t(BigInt(buf[1]) << 32n) |\n\t\t\t\t(BigInt(buf[2]) << 24n) |\n\t\t\t\t(BigInt(buf[3]) << 16n) |\n\t\t\t\t(BigInt(buf[4]) << 8n) |\n\t\t\t\tBigInt(buf[5]);\n\t\t\tbreak;\n\t\tcase 6: {\n\t\t\t// 1111110x + 6 bytes = 49 bits (draft-18+)\n\t\t\tvalue =\n\t\t\t\t(BigInt(b & 0x01) << 48n) |\n\t\t\t\t(BigInt(buf[1]) << 40n) |\n\t\t\t\t(BigInt(buf[2]) << 32n) |\n\t\t\t\t(BigInt(buf[3]) << 24n) |\n\t\t\t\t(BigInt(buf[4]) << 16n) |\n\t\t\t\t(BigInt(buf[5]) << 8n) |\n\t\t\t\tBigInt(buf[6]);\n\t\t\tbreak;\n\t\t}\n\t\tcase 7: {\n\t\t\t// 11111110 + 7 bytes = 56 usable bits\n\t\t\tconst hi = new Uint8Array(8);\n\t\t\thi[0] = 0;\n\t\t\thi.set(buf.subarray(1, 8), 1);\n\t\t\tvalue = new DataView(hi.buffer).getBigUint64(0);\n\t\t\tbreak;\n\t\t}\n\t\tcase 8: {\n\t\t\t// 11111111 + 8 bytes = 64 bits\n\t\t\tvalue = new DataView(buf.buffer, buf.byteOffset + 1, 8).getBigUint64(0);\n\t\t\tbreak;\n\t\t}\n\t\tdefault:\n\t\t\tthrow new Error(\"impossible\");\n\t}\n\n\treturn [value, remain];\n}\n\n/**\n * Returns the number of bytes needed to encode a value as a varint.\n */\nexport function size(v: number): number {\n\tif (v <= MAX_U6) return 1;\n\tif (v <= MAX_U14) return 2;\n\tif (v <= MAX_U30) return 4;\n\tif (v <= MAX_U53) return 8;\n\tthrow new Error(`overflow, value larger than 53-bits: ${v}`);\n}\n\n// Helper functions for writing to an ArrayBuffer\nfunction setUint8(dst: ArrayBuffer, v: number): Uint8Array {\n\tconst buffer = new Uint8Array(dst, 0, 1);\n\tbuffer[0] = v;\n\treturn buffer;\n}\n\nfunction setUint16(dst: ArrayBuffer, v: number): Uint8Array {\n\tconst view = new DataView(dst, 0, 2);\n\tview.setUint16(0, v);\n\treturn new Uint8Array(view.buffer, view.byteOffset, view.byteLength);\n}\n\nfunction setUint32(dst: ArrayBuffer, v: number): Uint8Array {\n\tconst view = new DataView(dst, 0, 4);\n\tview.setUint32(0, v);\n\treturn new Uint8Array(view.buffer, view.byteOffset, view.byteLength);\n}\n\nfunction setUint64(dst: ArrayBuffer, v: bigint): Uint8Array {\n\tconst view = new DataView(dst, 0, 8);\n\tview.setBigUint64(0, v);\n\treturn new Uint8Array(view.buffer, view.byteOffset, view.byteLength);\n}\n\nconst MAX_U62 = 2n ** 62n - 1n;\n\n/**\n * Encodes a number or bigint into a scratch buffer.\n * Used by stream.ts to avoid allocations.\n */\nexport function encodeTo(dst: ArrayBuffer, v: number | bigint): Uint8Array {\n\tconst b = BigInt(v);\n\tif (b < 0n) {\n\t\tthrow new Error(`underflow, value is negative: ${v}`);\n\t}\n\tif (b > MAX_U62) {\n\t\tthrow new Error(`overflow, value larger than 62-bits: ${v}`);\n\t}\n\tconst n = Number(b);\n\tif (n <= MAX_U6) {\n\t\treturn setUint8(dst, n);\n\t}\n\tif (n <= MAX_U14) {\n\t\treturn setUint16(dst, n | 0x4000);\n\t}\n\tif (n <= MAX_U30) {\n\t\treturn setUint32(dst, n | 0x80000000);\n\t}\n\treturn setUint64(dst, b | 0xc000000000000000n);\n}\n\n/**\n * Encodes a number or bigint as a QUIC variable-length integer.\n * Returns a new Uint8Array containing the encoded bytes.\n */\nexport function encode(v: number | bigint): Uint8Array {\n\treturn encodeTo(new ArrayBuffer(8), v);\n}\n\n/**\n * Decodes a QUIC variable-length integer exactly from a buffer.\n * Returns a tuple of [value, remaining buffer].\n */\nexport function decodeBigInt(buf: Uint8Array): [bigint, Uint8Array] {\n\tif (buf.length === 0) {\n\t\tthrow new Error(\"buffer is empty\");\n\t}\n\n\tconst size = 1 << ((buf[0] & 0xc0) >> 6);\n\n\tif (buf.length < size) {\n\t\tthrow new Error(`buffer too short: need ${size} bytes, have ${buf.length}`);\n\t}\n\n\tconst view = new DataView(buf.buffer, buf.byteOffset, size);\n\tconst remain = buf.subarray(size);\n\n\tlet value: bigint;\n\n\tif (size === 1) {\n\t\tvalue = BigInt(buf[0] & 0x3f);\n\t} else if (size === 2) {\n\t\tvalue = BigInt(view.getUint16(0) & 0x3fff);\n\t} else if (size === 4) {\n\t\tvalue = BigInt(view.getUint32(0) & 0x3fffffff);\n\t} else if (size === 8) {\n\t\tvalue = view.getBigUint64(0) & 0x3fffffffffffffffn;\n\t} else {\n\t\tthrow new Error(\"impossible\");\n\t}\n\n\treturn [value, remain];\n}\n\n/**\n * Decodes a QUIC variable-length integer from a buffer.\n * Values above 53 bits lose precision; use {@link decodeBigInt} for exact decoding.\n */\nexport function decode(buf: Uint8Array): [number, Uint8Array] {\n\tconst [value, remain] = decodeBigInt(buf);\n\treturn [Number(value), remain];\n}\n"]}

package/zod.d.ts

@@ -3,11 +3,11 @@
  *
  * @module
  */
-import type * as z from "zod/mini";
-import type { Group } from "./group";
-import type { Track } from "./track";
+import type * as z from "@zod/mini";
+import type * as group from "./group";
+import type * as track from "./track";
 /** Read the next JSON frame and validate it against the schema. Returns undefined at end of stream. */
-export declare function read<T = unknown>(source: Track | Group, schema: z.ZodMiniType<T>): Promise<T | undefined>;
+export declare function read<T = unknown>(source: track.Subscriber | group.Consumer, schema: z.ZodMiniType<T>): Promise<T | undefined>;
 /** Validate a value against the schema, then write it as a JSON frame. */
-export declare function write<T = unknown>(source: Track | Group, value: T, schema: z.ZodMiniType<T>): void;
+export declare function write<T = unknown>(source: track.Producer | group.Producer, value: T, schema: z.ZodMiniType<T>): void;
 //# sourceMappingURL=zod.d.ts.map

package/zod.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"zod.d.ts","sourceRoot":"","sources":["../src/zod.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,KAAK,CAAC,MAAM,UAAU,CAAC;AACnC,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACxC,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAExC,uGAAuG;AACvG,wBAAsB,IAAI,CAAC,CAAC,GAAG,OAAO,EAAE,MAAM,EAAE,KAAK,GAAG,KAAK,EAAE,MAAM,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,SAAS,CAAC,CAI/G;AAED,0EAA0E;AAC1E,wBAAgB,KAAK,CAAC,CAAC,GAAG,OAAO,EAAE,MAAM,EAAE,KAAK,GAAG,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,QAG3F"}
+{"version":3,"file":"zod.d.ts","sourceRoot":"","sources":["../src/zod.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,KAAK,CAAC,MAAM,WAAW,CAAC;AACpC,OAAO,KAAK,KAAK,KAAK,MAAM,YAAY,CAAC;AACzC,OAAO,KAAK,KAAK,KAAK,MAAM,YAAY,CAAC;AAEzC,uGAAuG;AACvG,wBAAsB,IAAI,CAAC,CAAC,GAAG,OAAO,EACrC,MAAM,EAAE,KAAK,CAAC,UAAU,GAAG,KAAK,CAAC,QAAQ,EACzC,MAAM,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,GACtB,OAAO,CAAC,CAAC,GAAG,SAAS,CAAC,CAIxB;AAED,0EAA0E;AAC1E,wBAAgB,KAAK,CAAC,CAAC,GAAG,OAAO,EAAE,MAAM,EAAE,KAAK,CAAC,QAAQ,GAAG,KAAK,CAAC,QAAQ,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,QAG7G"}

package/zod.js.map

@@ -1 +1 @@
-{"version":3,"file":"zod.js","sourceRoot":"","sources":["../src/zod.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAMH,uGAAuG;AACvG,MAAM,CAAC,KAAK,UAAU,IAAI,CAAc,MAAqB,EAAE,MAAwB;IACtF,MAAM,IAAI,GAAG,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC;IACrC,IAAI,IAAI,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC,CAAC,sDAAsD;IAChG,OAAO,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;AAC3B,CAAC;AAED,0EAA0E;AAC1E,MAAM,UAAU,KAAK,CAAc,MAAqB,EAAE,KAAQ,EAAE,MAAwB;IAC3F,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAClC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;AACzB,CAAC","sourcesContent":["/**\n * Helpers for reading and writing Zod-validated JSON frames on a track or group.\n *\n * @module\n */\n\nimport type * as z from \"zod/mini\";\nimport type { Group } from \"./group.ts\";\nimport type { Track } from \"./track.ts\";\n\n/** Read the next JSON frame and validate it against the schema. Returns undefined at end of stream. */\nexport async function read<T = unknown>(source: Track | Group, schema: z.ZodMiniType<T>): Promise<T | undefined> {\n\tconst next = await source.readJson();\n\tif (next === undefined) return undefined; // only treat undefined as EOF, not other falsy values\n\treturn schema.parse(next);\n}\n\n/** Validate a value against the schema, then write it as a JSON frame. */\nexport function write<T = unknown>(source: Track | Group, value: T, schema: z.ZodMiniType<T>) {\n\tconst valid = schema.parse(value);\n\tsource.writeJson(valid);\n}\n"]}
+{"version":3,"file":"zod.js","sourceRoot":"","sources":["../src/zod.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAMH,uGAAuG;AACvG,MAAM,CAAC,KAAK,UAAU,IAAI,CACzB,MAAyC,EACzC,MAAwB;IAExB,MAAM,IAAI,GAAG,MAAM,MAAM,CAAC,QAAQ,EAAE,CAAC;IACrC,IAAI,IAAI,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC,CAAC,sDAAsD;IAChG,OAAO,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;AAC3B,CAAC;AAED,0EAA0E;AAC1E,MAAM,UAAU,KAAK,CAAc,MAAuC,EAAE,KAAQ,EAAE,MAAwB;IAC7G,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAClC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;AACzB,CAAC","sourcesContent":["/**\n * Helpers for reading and writing Zod-validated JSON frames on a track or group.\n *\n * @module\n */\n\nimport type * as z from \"@zod/mini\";\nimport type * as group from \"./group.ts\";\nimport type * as track from \"./track.ts\";\n\n/** Read the next JSON frame and validate it against the schema. Returns undefined at end of stream. */\nexport async function read<T = unknown>(\n\tsource: track.Subscriber | group.Consumer,\n\tschema: z.ZodMiniType<T>,\n): Promise<T | undefined> {\n\tconst next = await source.readJson();\n\tif (next === undefined) return undefined; // only treat undefined as EOF, not other falsy values\n\treturn schema.parse(next);\n}\n\n/** Validate a value against the schema, then write it as a JSON frame. */\nexport function write<T = unknown>(source: track.Producer | group.Producer, value: T, schema: z.ZodMiniType<T>) {\n\tconst valid = schema.parse(value);\n\tsource.writeJson(valid);\n}\n"]}

package/bandwidth.d.ts

@@ -1,11 +0,0 @@
-import { Signal } from "@norskvideo/moq-signals";
-/**
- * A bandwidth estimate in bits per second, or undefined if unknown.
- *
- * This is a Signal that can be read synchronously via `peek()`,
- * observed reactively via `effect.get()`, or updated via `set()`.
- */
-export type Bandwidth = Signal<number | undefined>;
-/** Create a new bandwidth signal. */
-export declare function createBandwidth(): Bandwidth;
-//# sourceMappingURL=bandwidth.d.ts.map

package/bandwidth.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"bandwidth.d.ts","sourceRoot":"","sources":["../src/bandwidth.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AAEtC;;;;;GAKG;AACH,MAAM,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,GAAG,SAAS,CAAC,CAAC;AAEnD,qCAAqC;AACrC,wBAAgB,eAAe,IAAI,SAAS,CAE3C"}

package/bandwidth.js

@@ -1,7 +0,0 @@
-/* @ts-self-types="./bandwidth.d.ts" */
-import { Signal } from "@norskvideo/moq-signals";
-/** Create a new bandwidth signal. */
-export function createBandwidth() {
-    return new Signal(undefined);
-}
-//# sourceMappingURL=bandwidth.js.map

package/bandwidth.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"bandwidth.js","sourceRoot":"","sources":["../src/bandwidth.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AAUtC,qCAAqC;AACrC,MAAM,UAAU,eAAe;IAC9B,OAAO,IAAI,MAAM,CAAqB,SAAS,CAAC,CAAC;AAClD,CAAC","sourcesContent":["import { Signal } from \"@moq/signals\";\n\n/**\n * A bandwidth estimate in bits per second, or undefined if unknown.\n *\n * This is a Signal that can be read synchronously via `peek()`,\n * observed reactively via `effect.get()`, or updated via `set()`.\n */\nexport type Bandwidth = Signal<number | undefined>;\n\n/** Create a new bandwidth signal. */\nexport function createBandwidth(): Bandwidth {\n\treturn new Signal<number | undefined>(undefined);\n}\n"]}

package/connection/cert.test.d.ts

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

package/connection/cert.test.d.ts.map

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

package/connection/cert.test.js

@@ -1,26 +0,0 @@
-/* @ts-self-types="./cert.test.d.ts" */
-import { expect, test } from "bun:test";
-import * as Hex from "../util/hex.js";
-import { certificateHash } from "./connect.js";
-// SHA-256("abc"), a well-known test vector. We feed "abc" as the cert bytes so
-// the expected digest is independent of our own implementation.
-const ABC = new TextEncoder().encode("abc");
-const ABC_SHA256 = "ba7816bf8f01cfea414140de5dae2223b00361a396177a9cb410ff61f20015ad";
-test("certificateHash hashes raw DER bytes", async () => {
-    const hash = await certificateHash(ABC);
-    expect(Hex.fromBytes(hash)).toBe(ABC_SHA256);
-});
-test("certificateHash decodes PEM armor before hashing", async () => {
-    // base64("abc") === "YWJj"
-    const pem = "-----BEGIN CERTIFICATE-----\nYWJj\n-----END CERTIFICATE-----\n";
-    const hash = await certificateHash(pem);
-    expect(Hex.fromBytes(hash)).toBe(ABC_SHA256);
-});
-test("certificateHash rejects a PEM string without armor", async () => {
-    // Valid base64, but no -----BEGIN CERTIFICATE----- wrapper.
-    await expect(certificateHash("YWJj")).rejects.toThrow(/armor/);
-});
-test("hex round-trips through fromBytes/toBytes", () => {
-    expect(Hex.fromBytes(Hex.toBytes(ABC_SHA256))).toBe(ABC_SHA256);
-});
-//# sourceMappingURL=cert.test.js.map

package/connection/cert.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"cert.test.js","sourceRoot":"","sources":["../../src/connection/cert.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,UAAU,CAAC;AACxC,OAAO,KAAK,GAAG,MAAM,gBAAgB,CAAC;AACtC,OAAO,EAAE,eAAe,EAAE,MAAM,cAAc,CAAC;AAE/C,+EAA+E;AAC/E,gEAAgE;AAChE,MAAM,GAAG,GAAG,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;AAC5C,MAAM,UAAU,GAAG,kEAAkE,CAAC;AAEtF,IAAI,CAAC,sCAAsC,EAAE,KAAK,IAAI,EAAE;IACvD,MAAM,IAAI,GAAG,MAAM,eAAe,CAAC,GAAG,CAAC,CAAC;IACxC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;AAC9C,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,kDAAkD,EAAE,KAAK,IAAI,EAAE;IACnE,2BAA2B;IAC3B,MAAM,GAAG,GAAG,gEAAgE,CAAC;IAC7E,MAAM,IAAI,GAAG,MAAM,eAAe,CAAC,GAAG,CAAC,CAAC;IACxC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;AAC9C,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,oDAAoD,EAAE,KAAK,IAAI,EAAE;IACrE,4DAA4D;IAC5D,MAAM,MAAM,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;AAChE,CAAC,CAAC,CAAC;AAEH,IAAI,CAAC,2CAA2C,EAAE,GAAG,EAAE;IACtD,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;AACjE,CAAC,CAAC,CAAC","sourcesContent":["import { expect, test } from \"bun:test\";\nimport * as Hex from \"../util/hex.ts\";\nimport { certificateHash } from \"./connect.ts\";\n\n// SHA-256(\"abc\"), a well-known test vector. We feed \"abc\" as the cert bytes so\n// the expected digest is independent of our own implementation.\nconst ABC = new TextEncoder().encode(\"abc\");\nconst ABC_SHA256 = \"ba7816bf8f01cfea414140de5dae2223b00361a396177a9cb410ff61f20015ad\";\n\ntest(\"certificateHash hashes raw DER bytes\", async () => {\n\tconst hash = await certificateHash(ABC);\n\texpect(Hex.fromBytes(hash)).toBe(ABC_SHA256);\n});\n\ntest(\"certificateHash decodes PEM armor before hashing\", async () => {\n\t// base64(\"abc\") === \"YWJj\"\n\tconst pem = \"-----BEGIN CERTIFICATE-----\\nYWJj\\n-----END CERTIFICATE-----\\n\";\n\tconst hash = await certificateHash(pem);\n\texpect(Hex.fromBytes(hash)).toBe(ABC_SHA256);\n});\n\ntest(\"certificateHash rejects a PEM string without armor\", async () => {\n\t// Valid base64, but no -----BEGIN CERTIFICATE----- wrapper.\n\tawait expect(certificateHash(\"YWJj\")).rejects.toThrow(/armor/);\n});\n\ntest(\"hex round-trips through fromBytes/toBytes\", () => {\n\texpect(Hex.fromBytes(Hex.toBytes(ABC_SHA256))).toBe(ABC_SHA256);\n});\n"]}

package/connection/reload.test.d.ts

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

package/connection/reload.test.d.ts.map

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