@earendil-works/chord 1.5.0 → 1.5.1

package/dist/link/binary.js

@@ -0,0 +1,544 @@
+// The binary codec (2b): a kind byte (its high bit set when an origin follows as a varint, the next one when a trace
+// carrier follows as JSON, slice 9), then the kind's fields as
+// unsigned varints, length-prefixed UTF-8 strings, raw incarnation (16 bytes) and fingerprint (8 bytes), parts as
+// length-prefixed bytes whose prefix also says whether the part is deflated (decoded as views of the message, never
+// parsed or inflated here), and byte segments only beside payloads marked as carrying bytes. No outer length: links
+// deliver whole messages.
+import { CAUSE_KINDS, NO_RETIRED, } from "./message.js";
+import { DeflatedPart } from "./part.js";
+import { parseJson, readUtf8 } from "./values.js";
+const UTF8 = new TextEncoder();
+/** Kinds by their byte. */
+const KINDS = [
+    "hello",
+    "hold",
+    "release",
+    "call",
+    "abort",
+    "bound",
+    "state",
+    "failed",
+    "result",
+    "error",
+    "gone",
+    "retry",
+    "loading",
+    "ack",
+    "closed",
+    "ping",
+    "pong",
+    "revoke",
+];
+const KIND_BYTES = new Map(KINDS.map((kind, byte) => [kind, byte]));
+/** The kind byte's flag for an origin. */
+const ORIGIN = 0x80;
+/** The kind byte's flag for a trace carrier (a `hold`'s or `call`'s; the message schema refuses it elsewhere). */
+const TRACE = 0x40;
+/** The kind byte's flag for a `call` that is old work of a reload (`call.old`); another kind with it is unknown. */
+const OLD = 0x20;
+/** A payload's flags: present, and carrying byte segments. */
+const PRESENT = 1;
+const SEGMENTS = 2;
+/** A hold's optional fields, one bit each. */
+const PRINCIPAL = 1;
+const INCARNATION = 2;
+const CHAIN = 4;
+const LIMIT = 8;
+/** A part's length prefix is its length doubled, plus one when the part is deflated. */
+const DEFLATED = 1;
+/** Messages as bytes; the default codec of every link. */
+export const binaryCodec = {
+    name: "binary",
+    encode(message) {
+        const writer = new Writer();
+        const origin = "origin" in message ? message.origin : undefined;
+        const trace = message.kind === "hold" || message.kind === "call" ? message.trace : undefined;
+        const old = message.kind === "call" && message.old === true ? OLD : 0;
+        writer.byte(KIND_BYTES.get(message.kind) | (origin === undefined ? 0 : ORIGIN) | (trace === undefined ? 0 : TRACE) | old);
+        if (origin !== undefined)
+            writer.varint(origin);
+        if (trace !== undefined)
+            writer.json(trace);
+        encodeFields(message, writer);
+        return writer.finish();
+    },
+    decode(bytes) {
+        const reader = new Reader(bytes);
+        const byte = reader.byte();
+        const kind = KINDS[byte & ~(ORIGIN | TRACE | OLD)];
+        if (kind === undefined || (byte & OLD && kind !== "call"))
+            throw new Error("binary: an unknown kind");
+        const origin = byte & ORIGIN ? reader.varint() : undefined;
+        const trace = byte & TRACE ? reader.json() : undefined;
+        const message = decodeFields(kind, reader);
+        reader.end();
+        // A fresh object; the message schema refuses an origin or a trace on a kind without one, and checks the trace.
+        if (origin !== undefined)
+            message.origin = origin;
+        if (trace !== undefined)
+            message.trace = trace;
+        if (byte & OLD)
+            message.old = true;
+        return message;
+    },
+};
+function encodeFields(message, writer) {
+    switch (message.kind) {
+        case "hello":
+            writer.varint(message.protocol);
+            writer.raw(hex(message.incarnation.replaceAll("-", ""), 16));
+            writer.varint(message.calls);
+            return;
+        case "hold": {
+            writer.varint(message.hold);
+            writer.string(message.type);
+            writer.varint(message.version);
+            writer.raw(hex(message.fingerprint, 8));
+            writer.part(message.params);
+            const { address, principal, incarnation, chain, limit } = message;
+            writer.string(address.kind);
+            writer.json(address.params);
+            writer.byte((principal === undefined ? 0 : PRINCIPAL) |
+                (incarnation === undefined ? 0 : INCARNATION) |
+                (chain === undefined ? 0 : CHAIN) |
+                (limit === undefined ? 0 : LIMIT));
+            if (principal !== undefined)
+                writer.json(principal);
+            if (incarnation !== undefined)
+                writer.raw(hex(incarnation.replaceAll("-", ""), 16));
+            if (chain !== undefined) {
+                writer.varint(chain.length);
+                for (const instance of chain)
+                    writer.raw(hex(instance.replaceAll("-", ""), 16));
+            }
+            if (limit !== undefined)
+                writer.varint(limit);
+            return;
+        }
+        case "release":
+        case "loading":
+            writer.varint(message.hold);
+            return;
+        case "retry":
+            writer.varint(message.hold);
+            writer.varint(message.hops);
+            return;
+        case "call":
+            writer.varint(message.call);
+            writer.varint(message.hold);
+            writer.varint(message.method);
+            writer.payload(message.args, message.segments);
+            return;
+        case "abort":
+            writer.varint(message.call);
+            return;
+        case "bound":
+            writer.varint(message.holds.length);
+            for (const { hold, variant, members, failed } of message.holds) {
+                writer.varint(hold);
+                writer.varint(variant);
+                writer.varint(members.length);
+                for (const { member, value } of members) {
+                    writer.varint(member);
+                    writer.part(value);
+                }
+                writer.failed(failed);
+            }
+            return;
+        case "state":
+            writer.varint(message.holds.length);
+            for (const { hold, members, failed, retired } of message.holds) {
+                writer.varint(hold);
+                writer.varint(members.length);
+                for (const { member, ops } of members) {
+                    writer.varint(member);
+                    writer.part(ops);
+                }
+                writer.failedAndRetired(failed, retired);
+            }
+            return;
+        case "failed":
+            writer.varint(message.hold);
+            writer.byte(CAUSE_KINDS.indexOf(message.cause.kind));
+            writer.json(message.cause.error);
+            // 0 when absent, else one more than the delay.
+            writer.varint(message.retryIn === undefined ? 0 : message.retryIn + 1);
+            return;
+        case "result":
+            writer.varint(message.call);
+            writer.payload(message.value, message.segments);
+            return;
+        case "error":
+            writer.varint(message.call);
+            writer.json(message.error);
+            return;
+        case "gone":
+            writer.varint(message.hold);
+            writer.json(message.error);
+            return;
+        case "revoke":
+            writer.json(message.revocation);
+            return;
+        case "ack":
+        case "closed":
+        case "ping":
+        case "pong":
+            return;
+    }
+}
+/** The kind's fields, read structurally; the envelope's types are checked by the message schema afterwards. */
+function decodeFields(kind, reader) {
+    // The message schema establishes the types of what is read here (JSON fields are checked by it).
+    switch (kind) {
+        case "hello":
+            return { kind, protocol: reader.varint(), incarnation: uuid(reader.raw(16)), calls: reader.varint() };
+        case "hold": {
+            const hold = reader.varint();
+            const type = reader.string();
+            const version = reader.varint();
+            const fingerprint = hexText(reader.raw(8));
+            const params = reader.part();
+            const address = { kind: reader.string(), params: reader.json() };
+            const flags = reader.byte();
+            if (flags > (PRINCIPAL | INCARNATION | CHAIN | LIMIT))
+                throw new Error("binary: unknown hold flags");
+            const principal = flags & PRINCIPAL ? { principal: reader.json() } : {};
+            const incarnation = flags & INCARNATION ? { incarnation: uuid(reader.raw(16)) } : {};
+            const chain = flags & CHAIN ? { chain: reader.list(() => uuid(reader.raw(16))) } : {};
+            const limit = flags & LIMIT ? { limit: reader.varint() } : {};
+            return {
+                kind,
+                hold,
+                type,
+                version,
+                fingerprint,
+                params,
+                address,
+                ...principal,
+                ...incarnation,
+                ...chain,
+                ...limit,
+            };
+        }
+        case "release":
+        case "loading":
+            return { kind, hold: reader.varint() };
+        case "retry":
+            return { kind, hold: reader.varint(), hops: reader.varint() };
+        case "call": {
+            const [call, hold, method] = [reader.varint(), reader.varint(), reader.varint()];
+            return { kind, call, hold, method, ...reader.payload("args") };
+        }
+        case "abort":
+            return { kind, call: reader.varint() };
+        case "bound": {
+            const holds = reader.list(() => {
+                const [hold, variant] = [reader.varint(), reader.varint()];
+                const members = reader.list(() => ({ member: reader.varint(), value: reader.part() }));
+                return { hold, variant, members, failed: reader.failed() };
+            });
+            return { kind, holds };
+        }
+        case "state": {
+            const holds = reader.list(() => {
+                const hold = reader.varint();
+                const members = reader.list(() => ({ member: reader.varint(), ops: reader.part() }));
+                // The failure count times two, plus one when retirements follow.
+                const flags = reader.varint();
+                const failed = reader.failedEntries(Math.floor(flags / 2));
+                const retired = flags % 2 === 0 ? NO_RETIRED : reader.list(() => reader.varint());
+                return { hold, members, failed, retired };
+            });
+            return { kind, holds };
+        }
+        case "failed": {
+            const hold = reader.varint();
+            const cause = CAUSE_KINDS[reader.byte()];
+            if (cause === undefined)
+                throw new Error("binary: an unknown failure kind");
+            // The schema check after decoding establishes the wire error.
+            const error = reader.json();
+            const retryIn = reader.varint();
+            return {
+                kind,
+                hold,
+                cause: { kind: cause, error },
+                ...(retryIn === 0 ? {} : { retryIn: retryIn - 1 }),
+            };
+        }
+        case "result":
+            return { kind, call: reader.varint(), ...reader.payload("value") };
+        case "error":
+            return { kind, call: reader.varint(), error: reader.json() };
+        case "gone":
+            return { kind, hold: reader.varint(), error: reader.json() };
+        case "revoke":
+            return { kind, revocation: reader.json() };
+        case "ack":
+        case "ping":
+        case "pong":
+            return { kind };
+        case "closed":
+            // Its origin is the kind byte's; 0 without one, which the message schema refuses.
+            return { kind, origin: 0 };
+    }
+}
+/** Up to this many UTF-16 units a string takes at most 126 bytes, so its length is one varint byte. */
+const SHORT = 42;
+/** From this many UTF-16 units a string is encoded in place (below it, encoding on its own and copying is cheaper). */
+const LONG = 4096;
+/** The fixed length prefix of a long string: five varint bytes, up to 32 GiB (16 GiB for a part). */
+const LENGTH_SLOT = 5;
+/** The room left after a large chunk for the fields that follow it. */
+const SPARE = 4096;
+/** Writes a message into one growing buffer, right-sized at the end. */
+class Writer {
+    /** Large enough for most small messages (a state change, a call), small enough to zero cheaply. */
+    #buffer = new Uint8Array(256);
+    #length = 0;
+    byte(byte) {
+        this.#reserve(1);
+        this.#buffer[this.#length++] = byte;
+    }
+    /** An unsigned LEB128 varint of a safe integer. */
+    varint(value) {
+        this.#reserve(8);
+        let rest = value;
+        while (rest >= 0x80) {
+            this.#buffer[this.#length++] = (rest % 0x80) | 0x80;
+            rest = Math.floor(rest / 0x80);
+        }
+        this.#buffer[this.#length++] = rest;
+    }
+    raw(bytes) {
+        this.#reserve(bytes.byteLength);
+        this.#buffer.set(bytes, this.#length);
+        this.#length += bytes.byteLength;
+    }
+    /** A length-prefixed UTF-8 string (`#text`). */
+    string(text) {
+        this.#text(text, 1);
+    }
+    json(value) {
+        this.string(JSON.stringify(value) ?? "null");
+    }
+    /**
+     * A part: its text encoded in place, or its bytes (a part received) copied as they are, behind its length doubled,
+     * plus one when deflated.
+     */
+    part(part) {
+        if (typeof part === "string") {
+            this.#text(part, 2);
+            return;
+        }
+        const bytes = part instanceof DeflatedPart ? part.bytes : part;
+        this.varint(bytes.byteLength * 2 + (part instanceof DeflatedPart ? DEFLATED : 0));
+        this.raw(bytes);
+    }
+    /**
+     * Text behind its UTF-8 length times `scale` (2 for a part's prefix), encoded straight into the buffer where the
+     * prefix is known in advance: a short text (its prefix fits one byte: at most 126 bytes, 42 UTF-16 units, divided
+     * by `scale`) and a long one (a snapshot's JSON, behind a fixed five-byte prefix, a padded varint, which readers
+     * accept). Others are encoded on their own and copied in. No text is encoded twice, and the largest value of a
+     * message is never copied.
+     */
+    #text(text, scale) {
+        if (text.length <= SHORT / scale) {
+            this.#reserve(1 + text.length * 3);
+            const { written } = UTF8.encodeInto(text, this.#buffer.subarray(this.#length + 1));
+            this.#buffer[this.#length] = written * scale;
+            this.#length += 1 + written;
+            return;
+        }
+        if (text.length < LONG) {
+            const bytes = UTF8.encode(text);
+            this.varint(bytes.byteLength * scale);
+            this.raw(bytes);
+            return;
+        }
+        const slot = this.#length;
+        // At least one byte per UTF-16 unit; more room is made when the text is not all ASCII.
+        this.#reserve(LENGTH_SLOT + text.length);
+        this.#length += LENGTH_SLOT;
+        let read = 0;
+        while (read < text.length) {
+            const rest = read === 0 ? text : text.slice(read);
+            const done = UTF8.encodeInto(rest, this.#buffer.subarray(this.#length));
+            read += done.read;
+            this.#length += done.written;
+            if (read < text.length)
+                this.#reserve(Math.max((text.length - read) * 2, 4));
+        }
+        let length = (this.#length - slot - LENGTH_SLOT) * scale;
+        for (let index = 0; index < LENGTH_SLOT; index++) {
+            this.#buffer[slot + index] = (length % 0x80) | (index < LENGTH_SLOT - 1 ? 0x80 : 0);
+            length = Math.floor(length / 0x80);
+        }
+    }
+    /** A payload: its flags, then its part and, when marked, its segments (count, lengths, raw bytes). */
+    payload(part, segments) {
+        if (part === undefined) {
+            this.varint(0);
+            return;
+        }
+        this.varint(segments === undefined ? PRESENT : PRESENT | SEGMENTS);
+        this.part(part);
+        if (segments === undefined)
+            return;
+        this.varint(segments.length);
+        for (const segment of segments)
+            this.varint(segment.byteLength);
+        for (const segment of segments)
+            this.raw(segment);
+    }
+    failed(failed) {
+        this.varint(failed.length);
+        this.#failedEntries(failed);
+    }
+    /**
+     * A state entry's failures and retirements: the failure count times two, plus one when retirements follow, so an
+     * entry without retirements costs no byte more than its failures.
+     */
+    failedAndRetired(failed, retired) {
+        this.varint(failed.length * 2 + (retired.length > 0 ? 1 : 0));
+        this.#failedEntries(failed);
+        if (retired.length === 0)
+            return;
+        this.varint(retired.length);
+        for (const member of retired)
+            this.varint(member);
+    }
+    #failedEntries(failed) {
+        for (const { member, error } of failed) {
+            this.varint(member);
+            this.json(error);
+        }
+    }
+    /**
+     * The message: a view of the buffer, or a right-sized copy when the spare room is meaningful (at least 64 bytes and
+     * more than an eighth of the message), so a kept message keeps at most that much beyond itself. A large message
+     * ends within its 4 KiB of room and is not copied.
+     */
+    finish() {
+        const message = this.#buffer.subarray(0, this.#length);
+        const spare = this.#buffer.byteLength - this.#length;
+        return spare >= 64 && spare * 8 > this.#length ? message.slice() : message;
+    }
+    /** Grows the buffer to fit `bytes` more: doubled, or for a large chunk to its end plus room for the small fields after it. */
+    #reserve(bytes) {
+        if (this.#length + bytes <= this.#buffer.byteLength)
+            return;
+        const grown = new Uint8Array(Math.max(this.#buffer.byteLength * 2, this.#length + bytes + SPARE));
+        grown.set(this.#buffer.subarray(0, this.#length));
+        this.#buffer = grown;
+    }
+}
+/** Reads a message's bytes; every read is bounds-checked, segments are views of the message. */
+class Reader {
+    #bytes;
+    #offset = 0;
+    constructor(bytes) {
+        this.#bytes = bytes;
+    }
+    byte() {
+        const byte = this.#bytes[this.#offset];
+        if (byte === undefined)
+            throw new Error("binary: the message ends early");
+        this.#offset++;
+        return byte;
+    }
+    /** An unsigned LEB128 varint of at most 8 bytes, at most a safe integer. */
+    varint() {
+        let value = 0;
+        let scale = 1;
+        for (let read = 1;; read++) {
+            if (read > 8)
+                throw new Error("binary: a varint does not fit");
+            const byte = this.byte();
+            value += (byte & 0x7f) * scale;
+            if (value > Number.MAX_SAFE_INTEGER)
+                throw new Error("binary: a varint does not fit");
+            if (byte < 0x80)
+                return value;
+            scale *= 0x80;
+        }
+    }
+    raw(length) {
+        if (length > this.#bytes.byteLength - this.#offset)
+            throw new Error("binary: the message ends early");
+        const bytes = this.#bytes.subarray(this.#offset, this.#offset + length);
+        this.#offset += length;
+        return bytes;
+    }
+    string() {
+        return readUtf8(this.raw(this.varint()));
+    }
+    json() {
+        return parseJson(this.raw(this.varint()));
+    }
+    /** A part as a view of the message, unparsed and not inflated. */
+    part() {
+        const prefix = this.varint();
+        const bytes = this.raw(Math.floor(prefix / 2));
+        return prefix % 2 === DEFLATED ? new DeflatedPart(bytes) : bytes;
+    }
+    /** A list: its count (each element takes at least a byte, so it cannot pass the message's end), then its elements. */
+    list(read) {
+        const count = this.varint();
+        if (count > this.#bytes.byteLength - this.#offset)
+            throw new Error("binary: a count does not fit");
+        return Array.from({ length: count }, read);
+    }
+    /** A payload part under `key`, absent when not present, with its segments when marked as carrying them. */
+    payload(key) {
+        const flags = this.varint();
+        if (flags === 0)
+            return {};
+        if (flags !== PRESENT && flags !== (PRESENT | SEGMENTS))
+            throw new Error("binary: unknown payload flags");
+        const part = this.part();
+        if (flags === PRESENT)
+            return { [key]: part };
+        const lengths = this.list(() => this.varint());
+        const segments = lengths.map((length) => this.raw(length));
+        return { [key]: part, segments };
+    }
+    failed() {
+        return this.failedEntries(this.varint());
+    }
+    /** `count` failed members, as `Writer.failed` writes them after their count. */
+    failedEntries(count) {
+        if (count > this.#bytes.byteLength - this.#offset)
+            throw new Error("binary: a count does not fit");
+        // The message schema checks each error's shape.
+        return Array.from({ length: count }, () => ({
+            member: this.varint(),
+            error: this.json(),
+        }));
+    }
+    /** The message is consumed exactly. */
+    end() {
+        if (this.#offset !== this.#bytes.byteLength)
+            throw new Error("binary: bytes after the message");
+    }
+}
+/** Lowercase hex of 8 and 16 bytes: a fingerprint, an incarnation without its dashes. */
+const HEX = new Map([
+    [8, /^[0-9a-f]{16}$/],
+    [16, /^[0-9a-f]{32}$/],
+]);
+/** `length` bytes from lowercase hex (an incarnation without dashes, a fingerprint). */
+function hex(text, length) {
+    if (!HEX.get(length).test(text))
+        throw new Error(`binary: not ${length} bytes of hex`);
+    return Uint8Array.from({ length }, (_, index) => Number.parseInt(text.slice(index * 2, index * 2 + 2), 16));
+}
+function hexText(bytes) {
+    return Array.from(bytes, (byte) => byte.toString(16).padStart(2, "0")).join("");
+}
+/** 16 bytes as a UUID's text. */
+function uuid(bytes) {
+    const text = hexText(bytes);
+    return `${text.slice(0, 8)}-${text.slice(8, 12)}-${text.slice(12, 16)}-${text.slice(16, 20)}-${text.slice(20)}`;
+}
+//# sourceMappingURL=binary.js.map

package/dist/link/binary.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"binary.js","sourceRoot":"","sources":["../../src/link/binary.ts"],"names":[],"mappings":"AAAA,qHAAqH;AACrH,+DAA+D;AAC/D,kHAAkH;AAClH,oHAAoH;AACpH,oHAAoH;AACpH,0BAA0B;AAE1B,OAAO,EAEN,WAAW,EAIX,UAAU,GAEV,MAAM,cAAc,CAAC;AACtB,OAAO,EAAE,YAAY,EAAa,MAAM,WAAW,CAAC;AACpD,OAAO,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAElD,MAAM,IAAI,GAAG,IAAI,WAAW,EAAE,CAAC;AAE/B,2BAA2B;AAC3B,MAAM,KAAK,GAAG;IACb,OAAO;IACP,MAAM;IACN,SAAS;IACT,MAAM;IACN,OAAO;IACP,OAAO;IACP,OAAO;IACP,QAAQ;IACR,QAAQ;IACR,OAAO;IACP,MAAM;IACN,OAAO;IACP,SAAS;IACT,KAAK;IACL,QAAQ;IACR,MAAM;IACN,MAAM;IACN,QAAQ;CACC,CAAC;AAEX,MAAM,UAAU,GAAG,IAAI,GAAG,CAAiB,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;AAEpF,0CAA0C;AAC1C,MAAM,MAAM,GAAG,IAAI,CAAC;AAEpB,kHAAkH;AAClH,MAAM,KAAK,GAAG,IAAI,CAAC;AAEnB,oHAAoH;AACpH,MAAM,GAAG,GAAG,IAAI,CAAC;AAEjB,8DAA8D;AAC9D,MAAM,OAAO,GAAG,CAAC,CAAC;AAElB,MAAM,QAAQ,GAAG,CAAC,CAAC;AAEnB,8CAA8C;AAC9C,MAAM,SAAS,GAAG,CAAC,CAAC;AAEpB,MAAM,WAAW,GAAG,CAAC,CAAC;AAEtB,MAAM,KAAK,GAAG,CAAC,CAAC;AAEhB,MAAM,KAAK,GAAG,CAAC,CAAC;AAEhB,wFAAwF;AACxF,MAAM,QAAQ,GAAG,CAAC,CAAC;AAEnB,0DAA0D;AAC1D,MAAM,CAAC,MAAM,WAAW,GAAU;IACjC,IAAI,EAAE,QAAQ;IACd,MAAM,CAAC,OAAO;QACb,MAAM,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;QAC5B,MAAM,MAAM,GAAG,QAAQ,IAAI,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;QAChE,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,KAAK,MAAM,IAAI,OAAO,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;QAC7F,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,KAAK,MAAM,IAAI,OAAO,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACtE,MAAM,CAAC,IAAI,CACV,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAE,GAAG,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,GAAG,CAC7G,CAAC;QACF,IAAI,MAAM,KAAK,SAAS;YAAE,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAChD,IAAI,KAAK,KAAK,SAAS;YAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC5C,YAAY,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;QAC9B,OAAO,MAAM,CAAC,MAAM,EAAE,CAAC;IACxB,CAAC;IACD,MAAM,CAAC,KAAK;QACX,MAAM,MAAM,GAAG,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC;QACjC,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,MAAM,GAAG,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC;QACnD,IAAI,IAAI,KAAK,SAAS,IAAI,CAAC,IAAI,GAAG,GAAG,IAAI,IAAI,KAAK,MAAM,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,yBAAyB,CAAC,CAAC;QACtG,MAAM,MAAM,GAAG,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;QAC3D,MAAM,KAAK,GAAG,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC;QACvD,MAAM,OAAO,GAAG,YAAY,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QAC3C,MAAM,CAAC,GAAG,EAAE,CAAC;QACb,+GAA+G;QAC/G,IAAI,MAAM,KAAK,SAAS;YAAG,OAA+B,CAAC,MAAM,GAAG,MAAM,CAAC;QAC3E,IAAI,KAAK,KAAK,SAAS;YAAG,OAA+B,CAAC,KAAK,GAAG,KAAK,CAAC;QACxE,IAAI,IAAI,GAAG,GAAG;YAAG,OAA0B,CAAC,GAAG,GAAG,IAAI,CAAC;QACvD,OAAO,OAAO,CAAC;IAChB,CAAC;CACD,CAAC;AAEF,SAAS,YAAY,CAAC,OAAgB,EAAE,MAAc;IACrD,QAAQ,OAAO,CAAC,IAAI,EAAE,CAAC;QACtB,KAAK,OAAO;YACX,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;YAChC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,WAAW,CAAC,UAAU,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YAC7D,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAC7B,OAAO;QACR,KAAK,MAAM,EAAE,CAAC;YACb,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAC5B,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAC5B,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;YAC/B,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,CAAC;YACxC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;YAC5B,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,OAAO,CAAC;YAClE,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAC5B,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;YAC5B,MAAM,CAAC,IAAI,CACV,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;gBACxC,CAAC,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC;gBAC7C,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;gBACjC,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAClC,CAAC;YACF,IAAI,SAAS,KAAK,SAAS;gBAAE,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACpD,IAAI,WAAW,KAAK,SAAS;gBAAE,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,UAAU,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YACpF,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACzB,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;gBAC5B,KAAK,MAAM,QAAQ,IAAI,KAAK;oBAAE,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,UAAU,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YACjF,CAAC;YACD,IAAI,KAAK,KAAK,SAAS;gBAAE,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAC9C,OAAO;QACR,CAAC;QACD,KAAK,SAAS,CAAC;QACf,KAAK,SAAS;YACb,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAC5B,OAAO;QACR,KAAK,OAAO;YACX,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAC5B,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAC5B,OAAO;QACR,KAAK,MAAM;YACV,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAC5B,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAC5B,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;YAC9B,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC;YAC/C,OAAO;QACR,KAAK,OAAO;YACX,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAC5B,OAAO;QACR,KAAK,OAAO;YACX,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YACpC,KAAK,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;gBAChE,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBACpB,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;gBACvB,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;gBAC9B,KAAK,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,OAAO,EAAE,CAAC;oBACzC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;oBACtB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACpB,CAAC;gBACD,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YACvB,CAAC;YACD,OAAO;QACR,KAAK,OAAO;YACX,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;YACpC,KAAK,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;gBAChE,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBACpB,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;gBAC9B,KAAK,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,OAAO,EAAE,CAAC;oBACvC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;oBACtB,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBAClB,CAAC;gBACD,MAAM,CAAC,gBAAgB,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;YAC1C,CAAC;YACD,OAAO;QACR,KAAK,QAAQ;YACZ,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAC5B,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;YACrD,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;YACjC,+CAA+C;YAC/C,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC;YACvE,OAAO;QACR,KAAK,QAAQ;YACZ,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAC5B,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAC;YAChD,OAAO;QACR,KAAK,OAAO;YACX,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAC5B,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAC3B,OAAO;QACR,KAAK,MAAM;YACV,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAC5B,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAC3B,OAAO;QACR,KAAK,QAAQ;YACZ,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;YAChC,OAAO;QACR,KAAK,KAAK,CAAC;QACX,KAAK,QAAQ,CAAC;QACd,KAAK,MAAM,CAAC;QACZ,KAAK,MAAM;YACV,OAAO;IACT,CAAC;AACF,CAAC;AAED,+GAA+G;AAC/G,SAAS,YAAY,CAAC,IAA4B,EAAE,MAAc;IACjE,iGAAiG;IACjG,QAAQ,IAAI,EAAE,CAAC;QACd,KAAK,OAAO;YACX,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,EAAE,WAAW,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;QACvG,KAAK,MAAM,EAAE,CAAC;YACb,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;YAC7B,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;YAC7B,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;YAChC,MAAM,WAAW,GAAG,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3C,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC;YAC7B,MAAM,OAAO,GAAG,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;YACjE,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC;YAC5B,IAAI,KAAK,GAAG,CAAC,SAAS,GAAG,WAAW,GAAG,KAAK,GAAG,KAAK,CAAC;gBAAE,MAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC,CAAC;YACrG,MAAM,SAAS,GAAG,KAAK,GAAG,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,MAAM,CAAC,IAAI,EAAsB,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC5F,MAAM,WAAW,GAAG,KAAK,GAAG,WAAW,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACrF,MAAM,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACtF,MAAM,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YAC9D,OAAO;gBACN,IAAI;gBACJ,IAAI;gBACJ,IAAI;gBACJ,OAAO;gBACP,WAAW;gBACX,MAAM;gBACN,OAAO;gBACP,GAAG,SAAS;gBACZ,GAAG,WAAW;gBACd,GAAG,KAAK;gBACR,GAAG,KAAK;aACR,CAAC;QACH,CAAC;QACD,KAAK,SAAS,CAAC;QACf,KAAK,SAAS;YACb,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;QACxC,KAAK,OAAO;YACX,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;QAC/D,KAAK,MAAM,EAAE,CAAC;YACb,MAAM,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,MAAM,CAAC,MAAM,EAAE,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;YACjF,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QAChE,CAAC;QACD,KAAK,OAAO;YACX,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;QACxC,KAAK,OAAO,EAAE,CAAC;YACd,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,GAAe,EAAE;gBAC1C,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;gBAC3D,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,EAAE,KAAK,EAAE,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;gBACvF,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;YAC5D,CAAC,CAAC,CAAC;YACH,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;QACxB,CAAC;QACD,KAAK,OAAO,EAAE,CAAC;YACd,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,GAAe,EAAE;gBAC1C,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;gBAC7B,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,EAAE,GAAG,EAAE,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;gBACrF,iEAAiE;gBACjE,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;gBAC9B,MAAM,MAAM,GAAG,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;gBAC3D,MAAM,OAAO,GAAG,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;gBAClF,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC;YAC3C,CAAC,CAAC,CAAC;YACH,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;QACxB,CAAC;QACD,KAAK,QAAQ,EAAE,CAAC;YACf,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;YAC7B,MAAM,KAAK,GAAG,WAAW,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;YACzC,IAAI,KAAK,KAAK,SAAS;gBAAE,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;YAC5E,8DAA8D;YAC9D,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,EAAkD,CAAC;YAC5E,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;YAChC,OAAO;gBACN,IAAI;gBACJ,IAAI;gBACJ,KAAK,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE;gBAC7B,GAAG,CAAC,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,OAAO,GAAG,CAAC,EAAE,CAAC;aAClD,CAAC;QACH,CAAC;QACD,KAAK,QAAQ;YACZ,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,EAAE,GAAG,MAAM,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;QACpE,KAAK,OAAO;YACX,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,EAAE,KAAK,EAAE,MAAM,CAAC,IAAI,EAAkD,EAAE,CAAC;QAC9G,KAAK,MAAM;YACV,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,EAAE,KAAK,EAAE,MAAM,CAAC,IAAI,EAAkD,EAAE,CAAC;QAC9G,KAAK,QAAQ;YACZ,OAAO,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;QAC5C,KAAK,KAAK,CAAC;QACX,KAAK,MAAM,CAAC;QACZ,KAAK,MAAM;YACV,OAAO,EAAE,IAAI,EAAE,CAAC;QACjB,KAAK,QAAQ;YACZ,kFAAkF;YAClF,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;IAC7B,CAAC;AACF,CAAC;AAED,uGAAuG;AACvG,MAAM,KAAK,GAAG,EAAE,CAAC;AAEjB,uHAAuH;AACvH,MAAM,IAAI,GAAG,IAAI,CAAC;AAElB,qGAAqG;AACrG,MAAM,WAAW,GAAG,CAAC,CAAC;AAEtB,uEAAuE;AACvE,MAAM,KAAK,GAAG,IAAI,CAAC;AAEnB,wEAAwE;AACxE,MAAM,MAAM;IACX,mGAAmG;IACnG,OAAO,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC;IAC9B,OAAO,GAAG,CAAC,CAAC;IAEZ,IAAI,CAAC,IAAY;QAChB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,GAAG,IAAI,CAAC;IACrC,CAAC;IAED,mDAAmD;IACnD,MAAM,CAAC,KAAa;QACnB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACjB,IAAI,IAAI,GAAG,KAAK,CAAC;QACjB,OAAO,IAAI,IAAI,IAAI,EAAE,CAAC;YACrB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC;YACpD,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC;QAChC,CAAC;QACD,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,GAAG,IAAI,CAAC;IACrC,CAAC;IAED,GAAG,CAAC,KAAiB;QACpB,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;QAChC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QACtC,IAAI,CAAC,OAAO,IAAI,KAAK,CAAC,UAAU,CAAC;IAClC,CAAC;IAED,gDAAgD;IAChD,MAAM,CAAC,IAAY;QAClB,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACrB,CAAC;IAED,IAAI,CAAC,KAAc;QAClB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,CAAC;IAC9C,CAAC;IAED;;;OAGG;IACH,IAAI,CAAC,IAAU;QACd,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC9B,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YACpB,OAAO;QACR,CAAC;QACD,MAAM,KAAK,GAAG,IAAI,YAAY,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;QAC/D,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,UAAU,GAAG,CAAC,GAAG,CAAC,IAAI,YAAY,YAAY,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClF,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACjB,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,IAAY,EAAE,KAAY;QAC/B,IAAI,IAAI,CAAC,MAAM,IAAI,KAAK,GAAG,KAAK,EAAE,CAAC;YAClC,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YACnC,MAAM,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC;YACnF,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,OAAO,GAAG,KAAK,CAAC;YAC7C,IAAI,CAAC,OAAO,IAAI,CAAC,GAAG,OAAO,CAAC;YAC5B,OAAO;QACR,CAAC;QACD,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,EAAE,CAAC;YACxB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAChC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,UAAU,GAAG,KAAK,CAAC,CAAC;YACtC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAChB,OAAO;QACR,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC;QAC1B,uFAAuF;QACvF,IAAI,CAAC,QAAQ,CAAC,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;QACzC,IAAI,CAAC,OAAO,IAAI,WAAW,CAAC;QAC5B,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,OAAO,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAClD,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;YACxE,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC;YAClB,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,OAAO,CAAC;YAC7B,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM;gBAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC9E,CAAC;QACD,IAAI,MAAM,GAAG,CAAC,IAAI,CAAC,OAAO,GAAG,IAAI,GAAG,WAAW,CAAC,GAAG,KAAK,CAAC;QACzD,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,WAAW,EAAE,KAAK,EAAE,EAAE,CAAC;YAClD,IAAI,CAAC,OAAO,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,WAAW,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACpF,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,CAAC;QACpC,CAAC;IACF,CAAC;IAED,sGAAsG;IACtG,OAAO,CAAC,IAAsB,EAAE,QAA2C;QAC1E,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACxB,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACf,OAAO;QACR,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,GAAG,QAAQ,CAAC,CAAC;QACnE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChB,IAAI,QAAQ,KAAK,SAAS;YAAE,OAAO;QACnC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QAC7B,KAAK,MAAM,OAAO,IAAI,QAAQ;YAAE,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QAChE,KAAK,MAAM,OAAO,IAAI,QAAQ;YAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IACnD,CAAC;IAED,MAAM,CAAC,MAA+B;QACrC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC3B,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;IAC7B,CAAC;IAED;;;OAGG;IACH,gBAAgB,CAAC,MAA+B,EAAE,OAA0B;QAC3E,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9D,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;QAC5B,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QACjC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAC5B,KAAK,MAAM,MAAM,IAAI,OAAO;YAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACnD,CAAC;IAED,cAAc,CAAC,MAA+B;QAC7C,KAAK,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,MAAM,EAAE,CAAC;YACxC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YACpB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAClB,CAAC;IACF,CAAC;IAED;;;;OAIG;IACH,MAAM;QACL,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QACvD,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC;QACrD,OAAO,KAAK,IAAI,EAAE,IAAI,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC;IAC5E,CAAC;IAED,8HAA8H;IAC9H,QAAQ,CAAC,KAAa;QACrB,IAAI,IAAI,CAAC,OAAO,GAAG,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,UAAU;YAAE,OAAO;QAC5D,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,GAAG,CAAC,EAAE,IAAI,CAAC,OAAO,GAAG,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC;QAClG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;QAClD,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC;IACtB,CAAC;CACD;AAED,gGAAgG;AAChG,MAAM,MAAM;IACF,MAAM,CAAa;IAC5B,OAAO,GAAG,CAAC,CAAC;IAEZ,YAAY,KAAiB;QAC5B,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACrB,CAAC;IAED,IAAI;QACH,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACvC,IAAI,IAAI,KAAK,SAAS;YAAE,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;QAC1E,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,OAAO,IAAI,CAAC;IACb,CAAC;IAED,4EAA4E;IAC5E,MAAM;QACL,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,IAAI,IAAI,GAAG,CAAC,GAAI,IAAI,EAAE,EAAE,CAAC;YAC7B,IAAI,IAAI,GAAG,CAAC;gBAAE,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAC;YAC/D,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;YACzB,KAAK,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,KAAK,CAAC;YAC/B,IAAI,KAAK,GAAG,MAAM,CAAC,gBAAgB;gBAAE,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAC;YACtF,IAAI,IAAI,GAAG,IAAI;gBAAE,OAAO,KAAK,CAAC;YAC9B,KAAK,IAAI,IAAI,CAAC;QACf,CAAC;IACF,CAAC;IAED,GAAG,CAAC,MAAc;QACjB,IAAI,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,GAAG,IAAI,CAAC,OAAO;YAAE,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;QACtG,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC,CAAC;QACxE,IAAI,CAAC,OAAO,IAAI,MAAM,CAAC;QACvB,OAAO,KAAK,CAAC;IACd,CAAC;IAED,MAAM;QACL,OAAO,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAC1C,CAAC;IAED,IAAI;QACH,OAAO,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAC3C,CAAC;IAED,kEAAkE;IAClE,IAAI;QACH,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QAC7B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;QAC/C,OAAO,MAAM,GAAG,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;IAClE,CAAC;IAED,sHAAsH;IACtH,IAAI,CAAI,IAAa;QACpB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QAC5B,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,GAAG,IAAI,CAAC,OAAO;YAAE,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC;QACnG,OAAO,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,IAAI,CAAC,CAAC;IAC5C,CAAC;IAED,2GAA2G;IAC3G,OAAO,CAAmB,GAAM;QAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QAC5B,IAAI,KAAK,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAC3B,IAAI,KAAK,KAAK,OAAO,IAAI,KAAK,KAAK,CAAC,OAAO,GAAG,QAAQ,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAC;QAC1G,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QACzB,IAAI,KAAK,KAAK,OAAO;YAAE,OAAO,EAAE,CAAC,GAAG,CAAC,EAAE,IAAI,EAAyB,CAAC;QACrE,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;QAC/C,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;QAC3D,OAAO,EAAE,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAsD,CAAC;IACtF,CAAC;IAED,MAAM;QACL,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IAC1C,CAAC;IAED,gFAAgF;IAChF,aAAa,CAAC,KAAa;QAC1B,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,GAAG,IAAI,CAAC,OAAO;YAAE,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC;QACnG,gDAAgD;QAChD,OAAO,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;YAC3C,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE;YACrB,KAAK,EAAE,IAAI,CAAC,IAAI,EAAkD;SAClE,CAAC,CAAC,CAAC;IACL,CAAC;IAED,uCAAuC;IACvC,GAAG;QACF,IAAI,IAAI,CAAC,OAAO,KAAK,IAAI,CAAC,MAAM,CAAC,UAAU;YAAE,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;IACjG,CAAC;CACD;AAED,yFAAyF;AACzF,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC;IACnB,CAAC,CAAC,EAAE,gBAAgB,CAAC;IACrB,CAAC,EAAE,EAAE,gBAAgB,CAAC;CACtB,CAAC,CAAC;AAEH,wFAAwF;AACxF,SAAS,GAAG,CAAC,IAAY,EAAE,MAAc;IACxC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,eAAe,MAAM,eAAe,CAAC,CAAC;IACxF,OAAO,UAAU,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;AAC7G,CAAC;AAED,SAAS,OAAO,CAAC,KAAiB;IACjC,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AACjF,CAAC;AAED,iCAAiC;AACjC,SAAS,IAAI,CAAC,KAAiB;IAC9B,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;IAC5B,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;AACjH,CAAC","sourcesContent":["// The binary codec (2b): a kind byte (its high bit set when an origin follows as a varint, the next one when a trace\n// carrier follows as JSON, slice 9), then the kind's fields as\n// unsigned varints, length-prefixed UTF-8 strings, raw incarnation (16 bytes) and fingerprint (8 bytes), parts as\n// length-prefixed bytes whose prefix also says whether the part is deflated (decoded as views of the message, never\n// parsed or inflated here), and byte segments only beside payloads marked as carrying bytes. No outer length: links\n// deliver whole messages.\n\nimport {\n\ttype BoundEntry,\n\tCAUSE_KINDS,\n\ttype Codec,\n\ttype FailedMember,\n\ttype Message,\n\tNO_RETIRED,\n\ttype StateEntry,\n} from \"./message.ts\";\nimport { DeflatedPart, type Part } from \"./part.ts\";\nimport { parseJson, readUtf8 } from \"./values.ts\";\n\nconst UTF8 = new TextEncoder();\n\n/** Kinds by their byte. */\nconst KINDS = [\n\t\"hello\",\n\t\"hold\",\n\t\"release\",\n\t\"call\",\n\t\"abort\",\n\t\"bound\",\n\t\"state\",\n\t\"failed\",\n\t\"result\",\n\t\"error\",\n\t\"gone\",\n\t\"retry\",\n\t\"loading\",\n\t\"ack\",\n\t\"closed\",\n\t\"ping\",\n\t\"pong\",\n\t\"revoke\",\n] as const;\n\nconst KIND_BYTES = new Map<string, number>(KINDS.map((kind, byte) => [kind, byte]));\n\n/** The kind byte's flag for an origin. */\nconst ORIGIN = 0x80;\n\n/** The kind byte's flag for a trace carrier (a `hold`'s or `call`'s; the message schema refuses it elsewhere). */\nconst TRACE = 0x40;\n\n/** The kind byte's flag for a `call` that is old work of a reload (`call.old`); another kind with it is unknown. */\nconst OLD = 0x20;\n\n/** A payload's flags: present, and carrying byte segments. */\nconst PRESENT = 1;\n\nconst SEGMENTS = 2;\n\n/** A hold's optional fields, one bit each. */\nconst PRINCIPAL = 1;\n\nconst INCARNATION = 2;\n\nconst CHAIN = 4;\n\nconst LIMIT = 8;\n\n/** A part's length prefix is its length doubled, plus one when the part is deflated. */\nconst DEFLATED = 1;\n\n/** Messages as bytes; the default codec of every link. */\nexport const binaryCodec: Codec = {\n\tname: \"binary\",\n\tencode(message) {\n\t\tconst writer = new Writer();\n\t\tconst origin = \"origin\" in message ? message.origin : undefined;\n\t\tconst trace = message.kind === \"hold\" || message.kind === \"call\" ? message.trace : undefined;\n\t\tconst old = message.kind === \"call\" && message.old === true ? OLD : 0;\n\t\twriter.byte(\n\t\t\tKIND_BYTES.get(message.kind)! | (origin === undefined ? 0 : ORIGIN) | (trace === undefined ? 0 : TRACE) | old,\n\t\t);\n\t\tif (origin !== undefined) writer.varint(origin);\n\t\tif (trace !== undefined) writer.json(trace);\n\t\tencodeFields(message, writer);\n\t\treturn writer.finish();\n\t},\n\tdecode(bytes) {\n\t\tconst reader = new Reader(bytes);\n\t\tconst byte = reader.byte();\n\t\tconst kind = KINDS[byte & ~(ORIGIN | TRACE | OLD)];\n\t\tif (kind === undefined || (byte & OLD && kind !== \"call\")) throw new Error(\"binary: an unknown kind\");\n\t\tconst origin = byte & ORIGIN ? reader.varint() : undefined;\n\t\tconst trace = byte & TRACE ? reader.json() : undefined;\n\t\tconst message = decodeFields(kind, reader);\n\t\treader.end();\n\t\t// A fresh object; the message schema refuses an origin or a trace on a kind without one, and checks the trace.\n\t\tif (origin !== undefined) (message as { origin?: number }).origin = origin;\n\t\tif (trace !== undefined) (message as { trace?: unknown }).trace = trace;\n\t\tif (byte & OLD) (message as { old?: true }).old = true;\n\t\treturn message;\n\t},\n};\n\nfunction encodeFields(message: Message, writer: Writer): void {\n\tswitch (message.kind) {\n\t\tcase \"hello\":\n\t\t\twriter.varint(message.protocol);\n\t\t\twriter.raw(hex(message.incarnation.replaceAll(\"-\", \"\"), 16));\n\t\t\twriter.varint(message.calls);\n\t\t\treturn;\n\t\tcase \"hold\": {\n\t\t\twriter.varint(message.hold);\n\t\t\twriter.string(message.type);\n\t\t\twriter.varint(message.version);\n\t\t\twriter.raw(hex(message.fingerprint, 8));\n\t\t\twriter.part(message.params);\n\t\t\tconst { address, principal, incarnation, chain, limit } = message;\n\t\t\twriter.string(address.kind);\n\t\t\twriter.json(address.params);\n\t\t\twriter.byte(\n\t\t\t\t(principal === undefined ? 0 : PRINCIPAL) |\n\t\t\t\t\t(incarnation === undefined ? 0 : INCARNATION) |\n\t\t\t\t\t(chain === undefined ? 0 : CHAIN) |\n\t\t\t\t\t(limit === undefined ? 0 : LIMIT),\n\t\t\t);\n\t\t\tif (principal !== undefined) writer.json(principal);\n\t\t\tif (incarnation !== undefined) writer.raw(hex(incarnation.replaceAll(\"-\", \"\"), 16));\n\t\t\tif (chain !== undefined) {\n\t\t\t\twriter.varint(chain.length);\n\t\t\t\tfor (const instance of chain) writer.raw(hex(instance.replaceAll(\"-\", \"\"), 16));\n\t\t\t}\n\t\t\tif (limit !== undefined) writer.varint(limit);\n\t\t\treturn;\n\t\t}\n\t\tcase \"release\":\n\t\tcase \"loading\":\n\t\t\twriter.varint(message.hold);\n\t\t\treturn;\n\t\tcase \"retry\":\n\t\t\twriter.varint(message.hold);\n\t\t\twriter.varint(message.hops);\n\t\t\treturn;\n\t\tcase \"call\":\n\t\t\twriter.varint(message.call);\n\t\t\twriter.varint(message.hold);\n\t\t\twriter.varint(message.method);\n\t\t\twriter.payload(message.args, message.segments);\n\t\t\treturn;\n\t\tcase \"abort\":\n\t\t\twriter.varint(message.call);\n\t\t\treturn;\n\t\tcase \"bound\":\n\t\t\twriter.varint(message.holds.length);\n\t\t\tfor (const { hold, variant, members, failed } of message.holds) {\n\t\t\t\twriter.varint(hold);\n\t\t\t\twriter.varint(variant);\n\t\t\t\twriter.varint(members.length);\n\t\t\t\tfor (const { member, value } of members) {\n\t\t\t\t\twriter.varint(member);\n\t\t\t\t\twriter.part(value);\n\t\t\t\t}\n\t\t\t\twriter.failed(failed);\n\t\t\t}\n\t\t\treturn;\n\t\tcase \"state\":\n\t\t\twriter.varint(message.holds.length);\n\t\t\tfor (const { hold, members, failed, retired } of message.holds) {\n\t\t\t\twriter.varint(hold);\n\t\t\t\twriter.varint(members.length);\n\t\t\t\tfor (const { member, ops } of members) {\n\t\t\t\t\twriter.varint(member);\n\t\t\t\t\twriter.part(ops);\n\t\t\t\t}\n\t\t\t\twriter.failedAndRetired(failed, retired);\n\t\t\t}\n\t\t\treturn;\n\t\tcase \"failed\":\n\t\t\twriter.varint(message.hold);\n\t\t\twriter.byte(CAUSE_KINDS.indexOf(message.cause.kind));\n\t\t\twriter.json(message.cause.error);\n\t\t\t// 0 when absent, else one more than the delay.\n\t\t\twriter.varint(message.retryIn === undefined ? 0 : message.retryIn + 1);\n\t\t\treturn;\n\t\tcase \"result\":\n\t\t\twriter.varint(message.call);\n\t\t\twriter.payload(message.value, message.segments);\n\t\t\treturn;\n\t\tcase \"error\":\n\t\t\twriter.varint(message.call);\n\t\t\twriter.json(message.error);\n\t\t\treturn;\n\t\tcase \"gone\":\n\t\t\twriter.varint(message.hold);\n\t\t\twriter.json(message.error);\n\t\t\treturn;\n\t\tcase \"revoke\":\n\t\t\twriter.json(message.revocation);\n\t\t\treturn;\n\t\tcase \"ack\":\n\t\tcase \"closed\":\n\t\tcase \"ping\":\n\t\tcase \"pong\":\n\t\t\treturn;\n\t}\n}\n\n/** The kind's fields, read structurally; the envelope's types are checked by the message schema afterwards. */\nfunction decodeFields(kind: (typeof KINDS)[number], reader: Reader): Message {\n\t// The message schema establishes the types of what is read here (JSON fields are checked by it).\n\tswitch (kind) {\n\t\tcase \"hello\":\n\t\t\treturn { kind, protocol: reader.varint(), incarnation: uuid(reader.raw(16)), calls: reader.varint() };\n\t\tcase \"hold\": {\n\t\t\tconst hold = reader.varint();\n\t\t\tconst type = reader.string();\n\t\t\tconst version = reader.varint();\n\t\t\tconst fingerprint = hexText(reader.raw(8));\n\t\t\tconst params = reader.part();\n\t\t\tconst address = { kind: reader.string(), params: reader.json() };\n\t\t\tconst flags = reader.byte();\n\t\t\tif (flags > (PRINCIPAL | INCARNATION | CHAIN | LIMIT)) throw new Error(\"binary: unknown hold flags\");\n\t\t\tconst principal = flags & PRINCIPAL ? { principal: reader.json() as { kind: string } } : {};\n\t\t\tconst incarnation = flags & INCARNATION ? { incarnation: uuid(reader.raw(16)) } : {};\n\t\t\tconst chain = flags & CHAIN ? { chain: reader.list(() => uuid(reader.raw(16))) } : {};\n\t\t\tconst limit = flags & LIMIT ? { limit: reader.varint() } : {};\n\t\t\treturn {\n\t\t\t\tkind,\n\t\t\t\thold,\n\t\t\t\ttype,\n\t\t\t\tversion,\n\t\t\t\tfingerprint,\n\t\t\t\tparams,\n\t\t\t\taddress,\n\t\t\t\t...principal,\n\t\t\t\t...incarnation,\n\t\t\t\t...chain,\n\t\t\t\t...limit,\n\t\t\t};\n\t\t}\n\t\tcase \"release\":\n\t\tcase \"loading\":\n\t\t\treturn { kind, hold: reader.varint() };\n\t\tcase \"retry\":\n\t\t\treturn { kind, hold: reader.varint(), hops: reader.varint() };\n\t\tcase \"call\": {\n\t\t\tconst [call, hold, method] = [reader.varint(), reader.varint(), reader.varint()];\n\t\t\treturn { kind, call, hold, method, ...reader.payload(\"args\") };\n\t\t}\n\t\tcase \"abort\":\n\t\t\treturn { kind, call: reader.varint() };\n\t\tcase \"bound\": {\n\t\t\tconst holds = reader.list((): BoundEntry => {\n\t\t\t\tconst [hold, variant] = [reader.varint(), reader.varint()];\n\t\t\t\tconst members = reader.list(() => ({ member: reader.varint(), value: reader.part() }));\n\t\t\t\treturn { hold, variant, members, failed: reader.failed() };\n\t\t\t});\n\t\t\treturn { kind, holds };\n\t\t}\n\t\tcase \"state\": {\n\t\t\tconst holds = reader.list((): StateEntry => {\n\t\t\t\tconst hold = reader.varint();\n\t\t\t\tconst members = reader.list(() => ({ member: reader.varint(), ops: reader.part() }));\n\t\t\t\t// The failure count times two, plus one when retirements follow.\n\t\t\t\tconst flags = reader.varint();\n\t\t\t\tconst failed = reader.failedEntries(Math.floor(flags / 2));\n\t\t\t\tconst retired = flags % 2 === 0 ? NO_RETIRED : reader.list(() => reader.varint());\n\t\t\t\treturn { hold, members, failed, retired };\n\t\t\t});\n\t\t\treturn { kind, holds };\n\t\t}\n\t\tcase \"failed\": {\n\t\t\tconst hold = reader.varint();\n\t\t\tconst cause = CAUSE_KINDS[reader.byte()];\n\t\t\tif (cause === undefined) throw new Error(\"binary: an unknown failure kind\");\n\t\t\t// The schema check after decoding establishes the wire error.\n\t\t\tconst error = reader.json() as Extract<Message, { kind: \"error\" }>[\"error\"];\n\t\t\tconst retryIn = reader.varint();\n\t\t\treturn {\n\t\t\t\tkind,\n\t\t\t\thold,\n\t\t\t\tcause: { kind: cause, error },\n\t\t\t\t...(retryIn === 0 ? {} : { retryIn: retryIn - 1 }),\n\t\t\t};\n\t\t}\n\t\tcase \"result\":\n\t\t\treturn { kind, call: reader.varint(), ...reader.payload(\"value\") };\n\t\tcase \"error\":\n\t\t\treturn { kind, call: reader.varint(), error: reader.json() as Extract<Message, { kind: \"error\" }>[\"error\"] };\n\t\tcase \"gone\":\n\t\t\treturn { kind, hold: reader.varint(), error: reader.json() as Extract<Message, { kind: \"error\" }>[\"error\"] };\n\t\tcase \"revoke\":\n\t\t\treturn { kind, revocation: reader.json() };\n\t\tcase \"ack\":\n\t\tcase \"ping\":\n\t\tcase \"pong\":\n\t\t\treturn { kind };\n\t\tcase \"closed\":\n\t\t\t// Its origin is the kind byte's; 0 without one, which the message schema refuses.\n\t\t\treturn { kind, origin: 0 };\n\t}\n}\n\n/** Up to this many UTF-16 units a string takes at most 126 bytes, so its length is one varint byte. */\nconst SHORT = 42;\n\n/** From this many UTF-16 units a string is encoded in place (below it, encoding on its own and copying is cheaper). */\nconst LONG = 4096;\n\n/** The fixed length prefix of a long string: five varint bytes, up to 32 GiB (16 GiB for a part). */\nconst LENGTH_SLOT = 5;\n\n/** The room left after a large chunk for the fields that follow it. */\nconst SPARE = 4096;\n\n/** Writes a message into one growing buffer, right-sized at the end. */\nclass Writer {\n\t/** Large enough for most small messages (a state change, a call), small enough to zero cheaply. */\n\t#buffer = new Uint8Array(256);\n\t#length = 0;\n\n\tbyte(byte: number): void {\n\t\tthis.#reserve(1);\n\t\tthis.#buffer[this.#length++] = byte;\n\t}\n\n\t/** An unsigned LEB128 varint of a safe integer. */\n\tvarint(value: number): void {\n\t\tthis.#reserve(8);\n\t\tlet rest = value;\n\t\twhile (rest >= 0x80) {\n\t\t\tthis.#buffer[this.#length++] = (rest % 0x80) | 0x80;\n\t\t\trest = Math.floor(rest / 0x80);\n\t\t}\n\t\tthis.#buffer[this.#length++] = rest;\n\t}\n\n\traw(bytes: Uint8Array): void {\n\t\tthis.#reserve(bytes.byteLength);\n\t\tthis.#buffer.set(bytes, this.#length);\n\t\tthis.#length += bytes.byteLength;\n\t}\n\n\t/** A length-prefixed UTF-8 string (`#text`). */\n\tstring(text: string): void {\n\t\tthis.#text(text, 1);\n\t}\n\n\tjson(value: unknown): void {\n\t\tthis.string(JSON.stringify(value) ?? \"null\");\n\t}\n\n\t/**\n\t * A part: its text encoded in place, or its bytes (a part received) copied as they are, behind its length doubled,\n\t * plus one when deflated.\n\t */\n\tpart(part: Part): void {\n\t\tif (typeof part === \"string\") {\n\t\t\tthis.#text(part, 2);\n\t\t\treturn;\n\t\t}\n\t\tconst bytes = part instanceof DeflatedPart ? part.bytes : part;\n\t\tthis.varint(bytes.byteLength * 2 + (part instanceof DeflatedPart ? DEFLATED : 0));\n\t\tthis.raw(bytes);\n\t}\n\n\t/**\n\t * Text behind its UTF-8 length times `scale` (2 for a part's prefix), encoded straight into the buffer where the\n\t * prefix is known in advance: a short text (its prefix fits one byte: at most 126 bytes, 42 UTF-16 units, divided\n\t * by `scale`) and a long one (a snapshot's JSON, behind a fixed five-byte prefix, a padded varint, which readers\n\t * accept). Others are encoded on their own and copied in. No text is encoded twice, and the largest value of a\n\t * message is never copied.\n\t */\n\t#text(text: string, scale: 1 | 2): void {\n\t\tif (text.length <= SHORT / scale) {\n\t\t\tthis.#reserve(1 + text.length * 3);\n\t\t\tconst { written } = UTF8.encodeInto(text, this.#buffer.subarray(this.#length + 1));\n\t\t\tthis.#buffer[this.#length] = written * scale;\n\t\t\tthis.#length += 1 + written;\n\t\t\treturn;\n\t\t}\n\t\tif (text.length < LONG) {\n\t\t\tconst bytes = UTF8.encode(text);\n\t\t\tthis.varint(bytes.byteLength * scale);\n\t\t\tthis.raw(bytes);\n\t\t\treturn;\n\t\t}\n\t\tconst slot = this.#length;\n\t\t// At least one byte per UTF-16 unit; more room is made when the text is not all ASCII.\n\t\tthis.#reserve(LENGTH_SLOT + text.length);\n\t\tthis.#length += LENGTH_SLOT;\n\t\tlet read = 0;\n\t\twhile (read < text.length) {\n\t\t\tconst rest = read === 0 ? text : text.slice(read);\n\t\t\tconst done = UTF8.encodeInto(rest, this.#buffer.subarray(this.#length));\n\t\t\tread += done.read;\n\t\t\tthis.#length += done.written;\n\t\t\tif (read < text.length) this.#reserve(Math.max((text.length - read) * 2, 4));\n\t\t}\n\t\tlet length = (this.#length - slot - LENGTH_SLOT) * scale;\n\t\tfor (let index = 0; index < LENGTH_SLOT; index++) {\n\t\t\tthis.#buffer[slot + index] = (length % 0x80) | (index < LENGTH_SLOT - 1 ? 0x80 : 0);\n\t\t\tlength = Math.floor(length / 0x80);\n\t\t}\n\t}\n\n\t/** A payload: its flags, then its part and, when marked, its segments (count, lengths, raw bytes). */\n\tpayload(part: Part | undefined, segments: readonly Uint8Array[] | undefined): void {\n\t\tif (part === undefined) {\n\t\t\tthis.varint(0);\n\t\t\treturn;\n\t\t}\n\t\tthis.varint(segments === undefined ? PRESENT : PRESENT | SEGMENTS);\n\t\tthis.part(part);\n\t\tif (segments === undefined) return;\n\t\tthis.varint(segments.length);\n\t\tfor (const segment of segments) this.varint(segment.byteLength);\n\t\tfor (const segment of segments) this.raw(segment);\n\t}\n\n\tfailed(failed: readonly FailedMember[]): void {\n\t\tthis.varint(failed.length);\n\t\tthis.#failedEntries(failed);\n\t}\n\n\t/**\n\t * A state entry's failures and retirements: the failure count times two, plus one when retirements follow, so an\n\t * entry without retirements costs no byte more than its failures.\n\t */\n\tfailedAndRetired(failed: readonly FailedMember[], retired: readonly number[]): void {\n\t\tthis.varint(failed.length * 2 + (retired.length > 0 ? 1 : 0));\n\t\tthis.#failedEntries(failed);\n\t\tif (retired.length === 0) return;\n\t\tthis.varint(retired.length);\n\t\tfor (const member of retired) this.varint(member);\n\t}\n\n\t#failedEntries(failed: readonly FailedMember[]): void {\n\t\tfor (const { member, error } of failed) {\n\t\t\tthis.varint(member);\n\t\t\tthis.json(error);\n\t\t}\n\t}\n\n\t/**\n\t * The message: a view of the buffer, or a right-sized copy when the spare room is meaningful (at least 64 bytes and\n\t * more than an eighth of the message), so a kept message keeps at most that much beyond itself. A large message\n\t * ends within its 4 KiB of room and is not copied.\n\t */\n\tfinish(): Uint8Array {\n\t\tconst message = this.#buffer.subarray(0, this.#length);\n\t\tconst spare = this.#buffer.byteLength - this.#length;\n\t\treturn spare >= 64 && spare * 8 > this.#length ? message.slice() : message;\n\t}\n\n\t/** Grows the buffer to fit `bytes` more: doubled, or for a large chunk to its end plus room for the small fields after it. */\n\t#reserve(bytes: number): void {\n\t\tif (this.#length + bytes <= this.#buffer.byteLength) return;\n\t\tconst grown = new Uint8Array(Math.max(this.#buffer.byteLength * 2, this.#length + bytes + SPARE));\n\t\tgrown.set(this.#buffer.subarray(0, this.#length));\n\t\tthis.#buffer = grown;\n\t}\n}\n\n/** Reads a message's bytes; every read is bounds-checked, segments are views of the message. */\nclass Reader {\n\treadonly #bytes: Uint8Array;\n\t#offset = 0;\n\n\tconstructor(bytes: Uint8Array) {\n\t\tthis.#bytes = bytes;\n\t}\n\n\tbyte(): number {\n\t\tconst byte = this.#bytes[this.#offset];\n\t\tif (byte === undefined) throw new Error(\"binary: the message ends early\");\n\t\tthis.#offset++;\n\t\treturn byte;\n\t}\n\n\t/** An unsigned LEB128 varint of at most 8 bytes, at most a safe integer. */\n\tvarint(): number {\n\t\tlet value = 0;\n\t\tlet scale = 1;\n\t\tfor (let read = 1; ; read++) {\n\t\t\tif (read > 8) throw new Error(\"binary: a varint does not fit\");\n\t\t\tconst byte = this.byte();\n\t\t\tvalue += (byte & 0x7f) * scale;\n\t\t\tif (value > Number.MAX_SAFE_INTEGER) throw new Error(\"binary: a varint does not fit\");\n\t\t\tif (byte < 0x80) return value;\n\t\t\tscale *= 0x80;\n\t\t}\n\t}\n\n\traw(length: number): Uint8Array {\n\t\tif (length > this.#bytes.byteLength - this.#offset) throw new Error(\"binary: the message ends early\");\n\t\tconst bytes = this.#bytes.subarray(this.#offset, this.#offset + length);\n\t\tthis.#offset += length;\n\t\treturn bytes;\n\t}\n\n\tstring(): string {\n\t\treturn readUtf8(this.raw(this.varint()));\n\t}\n\n\tjson(): unknown {\n\t\treturn parseJson(this.raw(this.varint()));\n\t}\n\n\t/** A part as a view of the message, unparsed and not inflated. */\n\tpart(): Uint8Array | DeflatedPart {\n\t\tconst prefix = this.varint();\n\t\tconst bytes = this.raw(Math.floor(prefix / 2));\n\t\treturn prefix % 2 === DEFLATED ? new DeflatedPart(bytes) : bytes;\n\t}\n\n\t/** A list: its count (each element takes at least a byte, so it cannot pass the message's end), then its elements. */\n\tlist<T>(read: () => T): T[] {\n\t\tconst count = this.varint();\n\t\tif (count > this.#bytes.byteLength - this.#offset) throw new Error(\"binary: a count does not fit\");\n\t\treturn Array.from({ length: count }, read);\n\t}\n\n\t/** A payload part under `key`, absent when not present, with its segments when marked as carrying them. */\n\tpayload<K extends string>(key: K): { [P in K]?: Part } & { segments?: Uint8Array[] } {\n\t\tconst flags = this.varint();\n\t\tif (flags === 0) return {};\n\t\tif (flags !== PRESENT && flags !== (PRESENT | SEGMENTS)) throw new Error(\"binary: unknown payload flags\");\n\t\tconst part = this.part();\n\t\tif (flags === PRESENT) return { [key]: part } as { [P in K]?: Part };\n\t\tconst lengths = this.list(() => this.varint());\n\t\tconst segments = lengths.map((length) => this.raw(length));\n\t\treturn { [key]: part, segments } as { [P in K]?: Part } & { segments: Uint8Array[] };\n\t}\n\n\tfailed(): FailedMember[] {\n\t\treturn this.failedEntries(this.varint());\n\t}\n\n\t/** `count` failed members, as `Writer.failed` writes them after their count. */\n\tfailedEntries(count: number): FailedMember[] {\n\t\tif (count > this.#bytes.byteLength - this.#offset) throw new Error(\"binary: a count does not fit\");\n\t\t// The message schema checks each error's shape.\n\t\treturn Array.from({ length: count }, () => ({\n\t\t\tmember: this.varint(),\n\t\t\terror: this.json() as Extract<Message, { kind: \"error\" }>[\"error\"],\n\t\t}));\n\t}\n\n\t/** The message is consumed exactly. */\n\tend(): void {\n\t\tif (this.#offset !== this.#bytes.byteLength) throw new Error(\"binary: bytes after the message\");\n\t}\n}\n\n/** Lowercase hex of 8 and 16 bytes: a fingerprint, an incarnation without its dashes. */\nconst HEX = new Map([\n\t[8, /^[0-9a-f]{16}$/],\n\t[16, /^[0-9a-f]{32}$/],\n]);\n\n/** `length` bytes from lowercase hex (an incarnation without dashes, a fingerprint). */\nfunction hex(text: string, length: number): Uint8Array {\n\tif (!HEX.get(length)!.test(text)) throw new Error(`binary: not ${length} bytes of hex`);\n\treturn Uint8Array.from({ length }, (_, index) => Number.parseInt(text.slice(index * 2, index * 2 + 2), 16));\n}\n\nfunction hexText(bytes: Uint8Array): string {\n\treturn Array.from(bytes, (byte) => byte.toString(16).padStart(2, \"0\")).join(\"\");\n}\n\n/** 16 bytes as a UUID's text. */\nfunction uuid(bytes: Uint8Array): string {\n\tconst text = hexText(bytes);\n\treturn `${text.slice(0, 8)}-${text.slice(8, 12)}-${text.slice(12, 16)}-${text.slice(16, 20)}-${text.slice(20)}`;\n}\n"]}