@cyanheads/mcp-ts-core 0.13.11 → 0.13.13

package/dist/utils/internal/logValue.d.ts

@@ -0,0 +1,33 @@
+/**
+ * The JSON-safe form a log record writes for `value`, as the walk pino runs on
+ * every record produces it. With `includeStack: false`, every `Error` in it is
+ * written without its `stack`: a stack-free record passes its fields through
+ * this first, since the walk pino runs keeps stacks. A key of `value` itself
+ * for which `exemptRootKey` returns true is never redacted; the same key deeper
+ * down is.
+ *
+ * @internal Exported for the logger, stack-free log records, `ctx.log` data a spread cannot
+ * read, and unit testing. Not part of the public API.
+ */
+export declare function toLogValue(value: unknown, options?: {
+    exemptRootKey?: ((key: string) => boolean) | undefined;
+    includeStack?: boolean;
+}): unknown;
+/**
+ * The copy of a `ctx.log` call's data the client mirror sends: what
+ * `JSON.stringify` reads from it (an object's `toJSON()` result, else its own
+ * enumerable fields), with every sensitive field masked as `'[REDACTED]'` and
+ * every `Error` written as `{ type, message }` — no stack, cause, or own
+ * property such as a request URL. The process log's bounds and markers apply:
+ * `'[Circular]'`, `'[MaxDepth]'` (the data's own fields sit at depth 1, as they
+ * do in the log record), `'[Truncated]'` where the ceiling on reads, the ceiling
+ * on characters written, or the bound on repeated content stops it — a `toJSON()`
+ * result reached again from another object included — and `'[Unreadable]'`,
+ * with data that has no readable keys at all as `{ data: '[Unreadable]' }`, as
+ * the process log writes it. Nothing passes through `structuredClone`, which
+ * rejects a `URL` or a function, and the input is never modified.
+ *
+ * @internal Masks the `ctx.log` mirror to the client. Not part of the public API.
+ */
+export declare function toMirrorValue(fields: Record<string, unknown>): Record<string, unknown>;
+//# sourceMappingURL=logValue.d.ts.map

package/dist/utils/internal/logValue.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"logValue.d.ts","sourceRoot":"","sources":["../../../src/utils/internal/logValue.ts"],"names":[],"mappings":"AAyiBA;;;;;;;;;;GAUG;AACH,wBAAgB,UAAU,CACxB,KAAK,EAAE,OAAO,EACd,OAAO,GAAE;IAAE,aAAa,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,MAAM,KAAK,OAAO,CAAC,GAAG,SAAS,CAAC;IAAC,YAAY,CAAC,EAAE,OAAO,CAAA;CAAO,GAC/F,OAAO,CAOT;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,aAAa,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAWtF"}

package/dist/utils/internal/logValue.js

@@ -0,0 +1,539 @@
+/**
+ * @fileoverview The walk every log sink runs over log data before writing it:
+ * pino's `formatters.log` for the process log and `interactions.log`, the OTLP
+ * export's attributes, and the `ctx.log` client mirror. One walk, so every sink
+ * shares one depth bound, one ceiling on reads, one ceiling on the characters
+ * written, one bound on repeated content, one cycle rule, one key matcher, and
+ * one answer for a value whose read throws.
+ * A leaf module, so the logger and the mirror use it without importing each other.
+ * @module src/utils/internal/logValue
+ */
+import { McpError } from '../../types-global/errors.js';
+import { isSensitiveKey } from '../security/sensitiveFields.js';
+/**
+ * Depth bound, counted from the record root: objects through depth 15 are
+ * written, and an object at depth 16 is written as `'[MaxDepth]'`. Above the
+ * deepest framework record — a union argument rejection's
+ * `errorData.issues[i].errors[j][k].path`, at 7 — with margin, and far below
+ * the depth at which a recursive copy overflows the stack (10,000 levels on
+ * Node), which is why the walk keeps a bound at all.
+ */
+const MAX_DEPTH = 16;
+/**
+ * Reads one walk makes: one for each object it reaches, fresh or repeated, and
+ * for each field and array element that is not an object, a redacted field
+ * included; {@link DEPTH_BOUND_READS} for an object at {@link MAX_DEPTH}. The
+ * read past the last is written as `'[Truncated]'` and the walk stops there. A
+ * getter, a Proxy, or a mirror's `toJSON()` can build new data on every read,
+ * which neither the cycle check nor the bound on repeated content ever sees
+ * twice: an object whose three getters each build another like it is 43
+ * million objects down to the depth bound, a 308 MB line written in 3–35 s.
+ * Bounded, it writes 0.8 MB in 14–38 ms on Bun and Node, and 3.7 MB in
+ * 75–115 ms when each built object also carries 200 numeric fields. Distinct
+ * data takes a read for each object and each field: a record of 100,000
+ * distinct one-field objects takes half the reads and is written whole.
+ */
+const MAX_READS = 400_000;
+/**
+ * Reads an object at {@link MAX_DEPTH} counts. Data built on every read nests
+ * as deep as the walk goes, so most of what it reaches sits at the depth bound;
+ * held data rarely reaches it more than a few times.
+ */
+const DEPTH_BOUND_READS = 10;
+/**
+ * Characters of repeated content one walk writes. Content is repeated when the
+ * walk already wrote it: an object reached again on another path, and everything
+ * beneath it, and a string or field name of {@link LONG_TEXT} characters or more
+ * written before. Each repeated value is charged about the characters it writes,
+ * quotes, braces, and separators included, so 20,000 rows sharing one `tags: []`
+ * are written whole. Bounds what sharing multiplies: a 100 KB string shared
+ * 6,000 times writes 600 MB uncharged and 1.1 MB charged, as does one held by
+ * 2,000 distinct objects. Content written once is bounded only by
+ * {@link MAX_WRITTEN_CHARS}.
+ */
+const MAX_REPEATED_CHARS = 1_000_000;
+/**
+ * Characters one walk writes: every string, field name, and primitive, repeated
+ * or not, charged about the characters it writes — a string with its quotes, a
+ * field name with its quotes, colon, and comma. The value past it is written as
+ * `'[Truncated]'`, a field name past it as `'[Truncated]': '[Truncated]'`, and
+ * the walk stops there. Bounds what neither the read ceiling nor the bound on
+ * repeated content sees: data a getter builds on every read, each object it
+ * builds carrying 50 fields of one 1,000-character string, wrote 284 MB within
+ * {@link MAX_READS}. A 10 MB string is written whole; a 20 MB one is cut.
+ */
+const MAX_WRITTEN_CHARS = 16 * 1024 * 1024;
+/**
+ * Length from which the walk remembers a string or field name by its value, so
+ * that writing it again from another object is repeated content. Shorter text is
+ * written on every reference: remembering it would cost every record.
+ */
+const LONG_TEXT = 1_024;
+/**
+ * Longest text the walk remembers under its own value. V8 hashes a longer
+ * string by its length alone, so a set of same-length long strings compares
+ * each lookup with every one of them up to the first character that differs:
+ * 2,000 distinct strings of 20,000 characters took 1.3 s on Node, 4,000 took
+ * 5.4 s. Longer text is remembered under {@link longKey}'s sample.
+ */
+const HASHED_TEXT = 16_383;
+/**
+ * Distinct texts sharing one {@link longKey} sample that a lookup compares one
+ * by one. Past this many, they are kept by {@link contentHash}, so text that
+ * matches at every sampled window stays linear: 2,000 texts of 20,000
+ * characters differing 3,000 characters in take 60–160 ms on Bun and Node,
+ * where comparing them one by one took 210–330 ms, growing with the square.
+ */
+const SAMPLE_BUCKET = 8;
+/** What {@link read} returns for a property whose read threw; written as `'[Unreadable]'`. */
+const UNREADABLE = Symbol('unreadable');
+/** What {@link walkValue} returns for a value a bound stopped; written as `'[Truncated]'`. */
+const CUT = Symbol('cut');
+/** `object[key]`, or {@link UNREADABLE} when the read throws: a getter, a Proxy trap, a revoked Proxy. */
+function read(object, key) {
+    try {
+        return object[key];
+    }
+    catch {
+        return UNREADABLE;
+    }
+}
+/**
+ * Copies a value into the JSON-safe form a sink writes, or returns `undefined`
+ * to drop it. Keeps primitives and drops functions; every key {@link isSensitiveKey}
+ * matches is written as `'[REDACTED]'`. A reference back to an object the walk is
+ * inside is written as `'[Circular]'`, an object at {@link MAX_DEPTH} as
+ * `'[MaxDepth]'`, and a value whose read throws as `'[Unreadable]'`. Returns
+ * {@link CUT} — written as `'[Truncated]'` — for the read past {@link MAX_READS}
+ * and the value past {@link MAX_WRITTEN_CHARS}, after which the walk stops, and
+ * for repeated content that does not fit in what is left of
+ * {@link MAX_REPEATED_CHARS}, after which the repeated array or object it sits in
+ * ends; a later repeat that still fits is written.
+ *
+ * Log mode writes a `Date` as its ISO string (`null` when invalid, as
+ * `JSON.stringify` does), a `URL` as its string, and an `Error` through
+ * {@link walkError}; copies arrays and plain objects; and drops any other object
+ * without reading it — `AbortSignal`, `Map`, `Set`, `Promise`, storage handles —
+ * since their prototype getters enforce receiver checks and throw (#32).
+ */
+function walkValue(value, depth, walk) {
+    if (value === UNREADABLE)
+        return marker('[Unreadable]', walk);
+    const t = typeof value;
+    if (t === 'string') {
+        const text = value;
+        const repeated = walk.repeating || (text.length >= LONG_TEXT && seenLong(text, walk));
+        return write(text, text.length + 2, repeated, walk);
+    }
+    if (t === 'undefined' || t === 'function')
+        return;
+    if (value === null || t !== 'object') {
+        return write(value, primitiveChars(value), walk.repeating, walk);
+    }
+    if (--walk.reads < 0)
+        return stop(walk);
+    // The object a reference names: what the cycle check and the repeat check track, even when
+    // mirror mode writes its `toJSON()` result, which can be a fresh object on every call.
+    const original = value;
+    let object = original;
+    let shape;
+    let keys;
+    let length = 0;
+    try {
+        if (Array.isArray(object)) {
+            shape = 'array';
+        }
+        else if (walk.mode === 'log') {
+            // A plain object, the common case, is settled before any `instanceof` walk of its prototype chain.
+            const proto = Object.getPrototypeOf(object);
+            if (proto === Object.prototype || proto === null) {
+                shape = 'record';
+            }
+            else if (object instanceof Error) {
+                shape = errorShape(object);
+            }
+            else if (object instanceof Date) {
+                return walkValue(Number.isNaN(object.getTime()) ? null : object.toISOString(), depth, walk);
+            }
+            else if (object instanceof URL) {
+                return walkValue(object.toString(), depth, walk);
+            }
+            else {
+                return;
+            }
+        }
+        else if (object instanceof Error) {
+            shape = errorShape(object);
+        }
+        else {
+            const { toJSON } = object;
+            if (typeof toJSON === 'function') {
+                const json = toJSON.call(object);
+                if (json === null || typeof json !== 'object')
+                    return walkValue(json, depth, walk);
+                object = json;
+            }
+            shape = Array.isArray(object) ? 'array' : 'record';
+        }
+        if (walk.ancestors.includes(original) ||
+            (object !== original && walk.ancestors.includes(object))) {
+            return marker('[Circular]', walk);
+        }
+        if (depth >= MAX_DEPTH) {
+            walk.reads -= DEPTH_BOUND_READS - 1;
+            return walk.reads < 0 ? stop(walk) : marker('[MaxDepth]', walk);
+        }
+        // Enumerated only now, so an object past the depth bound is never enumerated.
+        if (shape === 'record')
+            keys = Object.keys(object);
+        else if (shape === 'array')
+            length = object.length;
+    }
+    catch {
+        return marker('[Unreadable]', walk);
+    }
+    const repeated = walk.repeating || walk.seen.has(original) || (object !== original && walk.seen.has(object));
+    if (repeated) {
+        if (!charge(keys ? 2 + nameChars(keys) : 2 + length, walk))
+            return CUT;
+    }
+    else {
+        walk.seen.add(original);
+        if (object !== original)
+            walk.seen.add(object);
+        if (keys && walk.long && !chargeLongNames(keys, walk.long, walk))
+            return CUT;
+    }
+    const outside = walk.repeating;
+    walk.repeating = repeated;
+    // No `finally`: every read below is guarded, so nothing throws between the push and the pop.
+    walk.ancestors.push(original);
+    const out = shape === 'array'
+        ? walkArray(object, length, depth, walk)
+        : shape === 'record'
+            ? walkRecord(object, keys, depth, walk)
+            : walkError(object, shape, depth, walk);
+    walk.ancestors.pop();
+    walk.repeating = outside;
+    return out;
+}
+/**
+ * Walks one field or array element one level down: an object pays its read in
+ * {@link walkValue}, any other value pays one here.
+ */
+function walkField(value, depth, walk) {
+    return (value === null || typeof value !== 'object') && --walk.reads < 0
+        ? stop(walk)
+        : walkValue(value, depth, walk);
+}
+/** Ends the walk: the read past {@link MAX_READS}, or the value past {@link MAX_WRITTEN_CHARS}. */
+function stop(walk) {
+    walk.stopped = true;
+    return CUT;
+}
+/**
+ * `value`, which writes `cost` characters: {@link CUT} when it is repeated
+ * content that does not fit in the bound on repeats, and the end of the walk when
+ * it does not fit in what is left of {@link MAX_WRITTEN_CHARS}.
+ */
+function write(value, cost, repeated, walk) {
+    if (repeated && !charge(cost, walk))
+        return CUT;
+    walk.room -= cost;
+    return walk.room < 0 ? stop(walk) : value;
+}
+/**
+ * The characters a primitive other than a string writes. A safe integer's
+ * digits are counted rather than converted: converting each number of a record
+ * of 100,000 one-field objects made its walk a third slower on Bun.
+ */
+function primitiveChars(value) {
+    if (!Number.isSafeInteger(value))
+        return String(value).length;
+    const n = value;
+    const abs = n < 0 ? -n : n;
+    let chars = n < 0 ? 2 : 1;
+    for (let power = 10; abs >= power; power *= 10)
+        chars++;
+    return chars;
+}
+/** A marker the walk writes in place of a value, charged like any string. */
+function marker(text, walk) {
+    return write(text, text.length + 2, walk.repeating, walk);
+}
+/** Charges `cost` characters of repeated content: false, and nothing charged, when fewer are left. */
+function charge(cost, walk) {
+    if (cost > walk.chars)
+        return false;
+    walk.chars -= cost;
+    return true;
+}
+/** Whether the walk wrote this long string or field name before; remembers it when not. */
+function seenLong(text, walk) {
+    walk.long ??= new Map();
+    return holdsLong(walk.long, text, true);
+}
+/** Remembers a long string or field name the walk writes. */
+function rememberLong(text, walk) {
+    seenLong(text, walk);
+}
+/**
+ * Whether `long` holds `text`, adding it when it does not and `add` is set.
+ * Every match is confirmed by `===`, so distinct text is never taken for text
+ * written before.
+ */
+function holdsLong(long, text, add) {
+    const key = longKey(text);
+    const bucket = long.get(key);
+    if (bucket === undefined) {
+        if (add)
+            long.set(key, [text]);
+        return false;
+    }
+    if (Array.isArray(bucket)) {
+        if (bucket.includes(text))
+            return true;
+        if (add && bucket.push(text) > SAMPLE_BUCKET) {
+            const byHash = new Map();
+            for (const held of bucket)
+                pushByHash(byHash, contentHash(held), held);
+            long.set(key, byHash);
+        }
+        return false;
+    }
+    const hash = contentHash(text);
+    if (bucket.get(hash)?.includes(text))
+        return true;
+    if (add)
+        pushByHash(bucket, hash, text);
+    return false;
+}
+/**
+ * The key a long text is remembered under: the text itself up to
+ * {@link HASHED_TEXT} characters, else its length and its first, middle, and
+ * last 128 characters — shorter than {@link LONG_TEXT}, so never another text.
+ */
+function longKey(text) {
+    if (text.length <= HASHED_TEXT)
+        return text;
+    const middle = text.length >> 1;
+    return `${text.length}:${text.slice(0, 128)}${text.slice(middle - 64, middle + 64)}${text.slice(-128)}`;
+}
+/** A 32-bit FNV-1a hash of every character of `text`. */
+function contentHash(text) {
+    let hash = 0x811c9dc5;
+    for (let i = 0; i < text.length; i++)
+        hash = Math.imul(hash ^ text.charCodeAt(i), 0x01000193);
+    return hash;
+}
+/** Adds `text` to the texts `byHash` keeps under `hash`. */
+function pushByHash(byHash, hash, text) {
+    const texts = byHash.get(hash);
+    if (texts)
+        texts.push(text);
+    else
+        byHash.set(hash, [text]);
+}
+/** The characters a repeated object's field names write, each with its quotes, colon, and comma. */
+function nameChars(keys) {
+    let chars = 0;
+    for (let i = 0; i < keys.length; i++)
+        chars += keys[i].length + 4;
+    return chars;
+}
+/**
+ * Charges an object reached for the first time for each of its long field names
+ * the walk wrote before; {@link walkRecord} remembers them as it writes them. False
+ * when they do not fit: the object is then written as `'[Truncated]'`.
+ */
+function chargeLongNames(keys, long, walk) {
+    let cost = 0;
+    for (let i = 0; i < keys.length; i++) {
+        const key = keys[i];
+        if (key.length >= LONG_TEXT && holdsLong(long, key, false))
+            cost += key.length + 4;
+    }
+    return cost === 0 || charge(cost, walk);
+}
+/** Which kind of `Error` `err` is, for {@link walkError}. */
+function errorShape(err) {
+    if (err instanceof McpError)
+        return 'mcpError';
+    return err instanceof AggregateError ? 'aggregateError' : 'error';
+}
+/**
+ * Copies `length` elements of an array, each through {@link walkField}. Ends
+ * where the walk stops, and a repeated array after the value that did not fit.
+ */
+function walkArray(array, length, depth, walk) {
+    const out = [];
+    for (let i = 0; i < length; i++) {
+        const value = walkField(read(array, i), depth + 1, walk);
+        out.push(value === CUT ? '[Truncated]' : value);
+        if (walk.stopped || (value === CUT && walk.repeating))
+            break;
+    }
+    return out;
+}
+/**
+ * Copies the fields named by `keys`, each through {@link walkField}, redacting
+ * each sensitive one — except, on the root object, a key the walk exempts —
+ * for a read, though its value is never read, and dropping each that walks to
+ * `undefined`. Each name is charged against {@link MAX_WRITTEN_CHARS} before its
+ * value is read, a dropped field's included; a name that does not fit is written
+ * as `'[Truncated]'`, and so is its value. Ends where the walk stops, and a
+ * repeated object after the field that did not fit.
+ */
+function walkRecord(object, keys, depth, walk) {
+    const out = {};
+    for (let i = 0; i < keys.length; i++) {
+        const key = keys[i];
+        walk.room -= key.length + 4;
+        if (walk.room < 0) {
+            stop(walk);
+            out['[Truncated]'] = '[Truncated]';
+            break;
+        }
+        if (key.length >= LONG_TEXT)
+            rememberLong(key, walk);
+        const field = isSensitiveKey(key) && !(depth === 0 && walk.exemptRootKey?.(key))
+            ? --walk.reads < 0
+                ? stop(walk)
+                : marker('[REDACTED]', walk)
+            : walkField(read(object, key), depth + 1, walk);
+        if (field === undefined)
+            continue;
+        const value = field === CUT ? '[Truncated]' : field;
+        // An own `__proto__` key (from `JSON.parse`) would hit the prototype setter.
+        if (key === '__proto__') {
+            Object.defineProperty(out, key, {
+                configurable: true,
+                enumerable: true,
+                value,
+                writable: true,
+            });
+        }
+        else {
+            out[key] = value;
+        }
+        if (walk.stopped || (field === CUT && walk.repeating))
+            break;
+    }
+    return out;
+}
+/**
+ * Sets one field of a written `Error` unless it walked to `undefined`. False
+ * once the error must end there: the walk stopped, or a repeated error's field
+ * did not fit.
+ */
+function put(out, key, field, walk) {
+    if (field !== undefined)
+        out[key] = field === CUT ? '[Truncated]' : field;
+    return !(walk.stopped || (field === CUT && walk.repeating));
+}
+/**
+ * Writes one `Error`. Mirror mode: `{ type, message }`. Log mode: `type` (its
+ * `name`), `message`, `stack` unless the walk is stack-free, a string `code` —
+ * or an `McpError`'s numeric `code` and its `data` — and `cause` and an
+ * `AggregateError`'s `errors`, each walked like any other value, so a nested
+ * `Error` takes this same shape. No other own property is copied: runtimes put
+ * request URLs (`path`, `input`) and server file paths (`sourceURL`) on them.
+ * A stack equal to the parent error's — the error whose `cause` or `errors`
+ * this one is — is left out, so a chain sharing one stack writes it once. An
+ * unreadable `code` is left out; any other unreadable field is `'[Unreadable]'`.
+ */
+function walkError(err, shape, depth, walk) {
+    const { parentStack } = walk;
+    walk.parentStack = undefined;
+    const out = {};
+    if (put(out, 'type', walkValue(read(err, 'name'), depth + 1, walk), walk) &&
+        put(out, 'message', walkValue(read(err, 'message'), depth + 1, walk), walk) &&
+        walk.mode === 'log') {
+        const stack = walk.includeStack ? read(err, 'stack') : undefined;
+        let more = stack === undefined ||
+            stack === parentStack ||
+            put(out, 'stack', walkValue(stack, depth + 1, walk), walk);
+        if (more) {
+            const code = read(err, 'code');
+            if (shape === 'mcpError') {
+                if (code !== UNREADABLE)
+                    out.code = code;
+                more = put(out, 'data', walkValue(read(err, 'data'), depth + 1, walk), walk);
+            }
+            else if (typeof code === 'string') {
+                out.code = code;
+            }
+        }
+        if (more) {
+            walk.parentStack = stack === UNREADABLE ? undefined : stack;
+            more = put(out, 'cause', walkValue(read(err, 'cause'), depth + 1, walk), walk);
+            if (more && shape === 'aggregateError') {
+                put(out, 'errors', walkValue(read(err, 'errors'), depth + 1, walk), walk);
+            }
+        }
+    }
+    walk.parentStack = parentStack;
+    return out;
+}
+/** A fresh walk: nothing entered yet, every read left, and the full bound on repeated content. */
+function newWalk(mode, includeStack, exemptRootKey) {
+    return {
+        ancestors: [],
+        chars: MAX_REPEATED_CHARS,
+        exemptRootKey,
+        includeStack,
+        long: undefined,
+        mode,
+        parentStack: undefined,
+        reads: MAX_READS,
+        repeating: false,
+        room: MAX_WRITTEN_CHARS,
+        seen: new Set(),
+        stopped: false,
+    };
+}
+/**
+ * The JSON-safe form a log record writes for `value`, as the walk pino runs on
+ * every record produces it. With `includeStack: false`, every `Error` in it is
+ * written without its `stack`: a stack-free record passes its fields through
+ * this first, since the walk pino runs keeps stacks. A key of `value` itself
+ * for which `exemptRootKey` returns true is never redacted; the same key deeper
+ * down is.
+ *
+ * @internal Exported for the logger, stack-free log records, `ctx.log` data a spread cannot
+ * read, and unit testing. Not part of the public API.
+ */
+export function toLogValue(value, options = {}) {
+    const out = walkValue(value, 0, newWalk('log', options.includeStack ?? true, options.exemptRootKey));
+    return out === CUT ? '[Truncated]' : out;
+}
+/**
+ * The copy of a `ctx.log` call's data the client mirror sends: what
+ * `JSON.stringify` reads from it (an object's `toJSON()` result, else its own
+ * enumerable fields), with every sensitive field masked as `'[REDACTED]'` and
+ * every `Error` written as `{ type, message }` — no stack, cause, or own
+ * property such as a request URL. The process log's bounds and markers apply:
+ * `'[Circular]'`, `'[MaxDepth]'` (the data's own fields sit at depth 1, as they
+ * do in the log record), `'[Truncated]'` where the ceiling on reads, the ceiling
+ * on characters written, or the bound on repeated content stops it — a `toJSON()`
+ * result reached again from another object included — and `'[Unreadable]'`,
+ * with data that has no readable keys at all as `{ data: '[Unreadable]' }`, as
+ * the process log writes it. Nothing passes through `structuredClone`, which
+ * rejects a `URL` or a function, and the input is never modified.
+ *
+ * @internal Masks the `ctx.log` mirror to the client. Not part of the public API.
+ */
+export function toMirrorValue(fields) {
+    const walk = newWalk('mirror', false);
+    let keys;
+    try {
+        keys = Object.keys(fields);
+    }
+    catch {
+        return { data: '[Unreadable]' };
+    }
+    // On the ancestor stack for the whole walk, so a reference back to it is `'[Circular]'`.
+    walk.ancestors.push(fields);
+    return walkRecord(fields, keys, 0, walk);
+}
+//# sourceMappingURL=logValue.js.map

package/dist/utils/internal/logValue.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"logValue.js","sourceRoot":"","sources":["../../../src/utils/internal/logValue.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,OAAO,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AACpD,OAAO,EAAE,cAAc,EAAE,MAAM,qCAAqC,CAAC;AAErE;;;;;;;GAOG;AACH,MAAM,SAAS,GAAG,EAAE,CAAC;AAErB;;;;;;;;;;;;;GAaG;AACH,MAAM,SAAS,GAAG,OAAO,CAAC;AAE1B;;;;GAIG;AACH,MAAM,iBAAiB,GAAG,EAAE,CAAC;AAE7B;;;;;;;;;;GAUG;AACH,MAAM,kBAAkB,GAAG,SAAS,CAAC;AAErC;;;;;;;;;GASG;AACH,MAAM,iBAAiB,GAAG,EAAE,GAAG,IAAI,GAAG,IAAI,CAAC;AAE3C;;;;GAIG;AACH,MAAM,SAAS,GAAG,KAAK,CAAC;AAExB;;;;;;GAMG;AACH,MAAM,WAAW,GAAG,MAAM,CAAC;AAE3B;;;;;;GAMG;AACH,MAAM,aAAa,GAAG,CAAC,CAAC;AAQxB,8FAA8F;AAC9F,MAAM,UAAU,GAAG,MAAM,CAAC,YAAY,CAAC,CAAC;AAExC,8FAA8F;AAC9F,MAAM,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;AA0C1B,0GAA0G;AAC1G,SAAS,IAAI,CAAC,MAAc,EAAE,GAAgB;IAC5C,IAAI,CAAC;QACH,OAAQ,MAAuC,CAAC,GAAG,CAAC,CAAC;IACvD,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,UAAU,CAAC;IACpB,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,SAAS,SAAS,CAAC,KAAc,EAAE,KAAa,EAAE,IAAU;IAC1D,IAAI,KAAK,KAAK,UAAU;QAAE,OAAO,MAAM,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;IAC9D,MAAM,CAAC,GAAG,OAAO,KAAK,CAAC;IACvB,IAAI,CAAC,KAAK,QAAQ,EAAE,CAAC;QACnB,MAAM,IAAI,GAAG,KAAe,CAAC;QAC7B,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,SAAS,IAAI,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;QACtF,OAAO,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC;IACtD,CAAC;IACD,IAAI,CAAC,KAAK,WAAW,IAAI,CAAC,KAAK,UAAU;QAAE,OAAO;IAClD,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,KAAK,QAAQ,EAAE,CAAC;QACrC,OAAO,KAAK,CAAC,KAAK,EAAE,cAAc,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;IACnE,CAAC;IACD,IAAI,EAAE,IAAI,CAAC,KAAK,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC;IAExC,2FAA2F;IAC3F,uFAAuF;IACvF,MAAM,QAAQ,GAAG,KAAe,CAAC;IACjC,IAAI,MAAM,GAAG,QAAQ,CAAC;IACtB,IAAI,KAAY,CAAC;IACjB,IAAI,IAA0B,CAAC;IAC/B,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,CAAC;QACH,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YAC1B,KAAK,GAAG,OAAO,CAAC;QAClB,CAAC;aAAM,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;YAC/B,mGAAmG;YACnG,MAAM,KAAK,GAAG,MAAM,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;YAC5C,IAAI,KAAK,KAAK,MAAM,CAAC,SAAS,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;gBACjD,KAAK,GAAG,QAAQ,CAAC;YACnB,CAAC;iBAAM,IAAI,MAAM,YAAY,KAAK,EAAE,CAAC;gBACnC,KAAK,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC;YAC7B,CAAC;iBAAM,IAAI,MAAM,YAAY,IAAI,EAAE,CAAC;gBAClC,OAAO,SAAS,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,WAAW,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;YAC9F,CAAC;iBAAM,IAAI,MAAM,YAAY,GAAG,EAAE,CAAC;gBACjC,OAAO,SAAS,CAAC,MAAM,CAAC,QAAQ,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;YACnD,CAAC;iBAAM,CAAC;gBACN,OAAO;YACT,CAAC;QACH,CAAC;aAAM,IAAI,MAAM,YAAY,KAAK,EAAE,CAAC;YACnC,KAAK,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC;QAC7B,CAAC;aAAM,CAAC;YACN,MAAM,EAAE,MAAM,EAAE,GAAG,MAA8B,CAAC;YAClD,IAAI,OAAO,MAAM,KAAK,UAAU,EAAE,CAAC;gBACjC,MAAM,IAAI,GAAY,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBAC1C,IAAI,IAAI,KAAK,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ;oBAAE,OAAO,SAAS,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;gBACnF,MAAM,GAAG,IAAI,CAAC;YAChB,CAAC;YACD,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC;QACrD,CAAC;QACD,IACE,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,QAAQ,CAAC;YACjC,CAAC,MAAM,KAAK,QAAQ,IAAI,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,EACxD,CAAC;YACD,OAAO,MAAM,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;QACpC,CAAC;QACD,IAAI,KAAK,IAAI,SAAS,EAAE,CAAC;YACvB,IAAI,CAAC,KAAK,IAAI,iBAAiB,GAAG,CAAC,CAAC;YACpC,OAAO,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;QAClE,CAAC;QACD,8EAA8E;QAC9E,IAAI,KAAK,KAAK,QAAQ;YAAE,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;aAC9C,IAAI,KAAK,KAAK,OAAO;YAAE,MAAM,GAAI,MAAoB,CAAC,MAAM,CAAC;IACpE,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,MAAM,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;IACtC,CAAC;IAED,MAAM,QAAQ,GACZ,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,KAAK,QAAQ,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC;IAC9F,IAAI,QAAQ,EAAE,CAAC;QACb,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,MAAM,EAAE,IAAI,CAAC;YAAE,OAAO,GAAG,CAAC;IACzE,CAAC;SAAM,CAAC;QACN,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACxB,IAAI,MAAM,KAAK,QAAQ;YAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC/C,IAAI,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC;YAAE,OAAO,GAAG,CAAC;IAC/E,CAAC;IACD,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC;IAC/B,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;IAC1B,6FAA6F;IAC7F,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC9B,MAAM,GAAG,GACP,KAAK,KAAK,OAAO;QACf,CAAC,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC;QACxC,CAAC,CAAC,KAAK,KAAK,QAAQ;YAClB,CAAC,CAAC,UAAU,CAAC,MAAM,EAAE,IAAgB,EAAE,KAAK,EAAE,IAAI,CAAC;YACnD,CAAC,CAAC,SAAS,CAAC,MAAe,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;IACvD,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC;IACrB,IAAI,CAAC,SAAS,GAAG,OAAO,CAAC;IACzB,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;GAGG;AACH,SAAS,SAAS,CAAC,KAAc,EAAE,KAAa,EAAE,IAAU;IAC1D,OAAO,CAAC,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,GAAG,CAAC;QACtE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;QACZ,CAAC,CAAC,SAAS,CAAC,KAAK,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;AACpC,CAAC;AAED,mGAAmG;AACnG,SAAS,IAAI,CAAC,IAAU;IACtB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;IACpB,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;GAIG;AACH,SAAS,KAAK,CAAC,KAAc,EAAE,IAAY,EAAE,QAAiB,EAAE,IAAU;IACxE,IAAI,QAAQ,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC;QAAE,OAAO,GAAG,CAAC;IAChD,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC;IAClB,OAAO,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;AAC5C,CAAC;AAED;;;;GAIG;AACH,SAAS,cAAc,CAAC,KAAc;IACpC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC;QAAE,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC;IAC9D,MAAM,CAAC,GAAG,KAAe,CAAC;IAC1B,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3B,IAAI,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1B,KAAK,IAAI,KAAK,GAAG,EAAE,EAAE,GAAG,IAAI,KAAK,EAAE,KAAK,IAAI,EAAE;QAAE,KAAK,EAAE,CAAC;IACxD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,6EAA6E;AAC7E,SAAS,MAAM,CAAC,IAAY,EAAE,IAAU;IACtC,OAAO,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;AAC5D,CAAC;AAED,sGAAsG;AACtG,SAAS,MAAM,CAAC,IAAY,EAAE,IAAU;IACtC,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK;QAAE,OAAO,KAAK,CAAC;IACpC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC;IACnB,OAAO,IAAI,CAAC;AACd,CAAC;AAED,2FAA2F;AAC3F,SAAS,QAAQ,CAAC,IAAY,EAAE,IAAU;IACxC,IAAI,CAAC,IAAI,KAAK,IAAI,GAAG,EAAE,CAAC;IACxB,OAAO,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;AAC1C,CAAC;AAED,6DAA6D;AAC7D,SAAS,YAAY,CAAC,IAAY,EAAE,IAAU;IAC5C,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;AACvB,CAAC;AAED;;;;GAIG;AACH,SAAS,SAAS,CAAC,IAA6B,EAAE,IAAY,EAAE,GAAY;IAC1E,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAC1B,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC7B,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACzB,IAAI,GAAG;YAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;QAC/B,OAAO,KAAK,CAAC;IACf,CAAC;IACD,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QAC1B,IAAI,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC;QACvC,IAAI,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,aAAa,EAAE,CAAC;YAC7C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;YAC3C,KAAK,MAAM,IAAI,IAAI,MAAM;gBAAE,UAAU,CAAC,MAAM,EAAE,WAAW,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;YACvE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QACxB,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,MAAM,IAAI,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;IAC/B,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,QAAQ,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IAClD,IAAI,GAAG;QAAE,UAAU,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;IACxC,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;GAIG;AACH,SAAS,OAAO,CAAC,IAAY;IAC3B,IAAI,IAAI,CAAC,MAAM,IAAI,WAAW;QAAE,OAAO,IAAI,CAAC;IAC5C,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;IAChC,OAAO,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,EAAE,EAAE,MAAM,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;AAC1G,CAAC;AAED,yDAAyD;AACzD,SAAS,WAAW,CAAC,IAAY;IAC/B,IAAI,IAAI,GAAG,UAAU,CAAC;IACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;IAC9F,OAAO,IAAI,CAAC;AACd,CAAC;AAED,4DAA4D;AAC5D,SAAS,UAAU,CAAC,MAA6B,EAAE,IAAY,EAAE,IAAY;IAC3E,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC/B,IAAI,KAAK;QAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;QACvB,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;AAChC,CAAC;AAED,oGAAoG;AACpG,SAAS,SAAS,CAAC,IAAuB;IACxC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,KAAK,IAAK,IAAI,CAAC,CAAC,CAAY,CAAC,MAAM,GAAG,CAAC,CAAC;IAC9E,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;GAIG;AACH,SAAS,eAAe,CACtB,IAAuB,EACvB,IAA6B,EAC7B,IAAU;IAEV,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAW,CAAC;QAC9B,IAAI,GAAG,CAAC,MAAM,IAAI,SAAS,IAAI,SAAS,CAAC,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC;YAAE,IAAI,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC;IACrF,CAAC;IACD,OAAO,IAAI,KAAK,CAAC,IAAI,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;AAC1C,CAAC;AAED,6DAA6D;AAC7D,SAAS,UAAU,CAAC,GAAU;IAC5B,IAAI,GAAG,YAAY,QAAQ;QAAE,OAAO,UAAU,CAAC;IAC/C,OAAO,GAAG,YAAY,cAAc,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,OAAO,CAAC;AACpE,CAAC;AAED;;;GAGG;AACH,SAAS,SAAS,CAAC,KAAa,EAAE,MAAc,EAAE,KAAa,EAAE,IAAU;IACzE,MAAM,GAAG,GAAc,EAAE,CAAC;IAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;QACzD,GAAG,CAAC,IAAI,CAAC,KAAK,KAAK,GAAG,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QAChD,IAAI,IAAI,CAAC,OAAO,IAAI,CAAC,KAAK,KAAK,GAAG,IAAI,IAAI,CAAC,SAAS,CAAC;YAAE,MAAM;IAC/D,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,UAAU,CACjB,MAAc,EACd,IAAuB,EACvB,KAAa,EACb,IAAU;IAEV,MAAM,GAAG,GAA4B,EAAE,CAAC;IACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAW,CAAC;QAC9B,IAAI,CAAC,IAAI,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC;QAC5B,IAAI,IAAI,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YAClB,IAAI,CAAC,IAAI,CAAC,CAAC;YACX,GAAG,CAAC,aAAa,CAAC,GAAG,aAAa,CAAC;YACnC,MAAM;QACR,CAAC;QACD,IAAI,GAAG,CAAC,MAAM,IAAI,SAAS;YAAE,YAAY,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACrD,MAAM,KAAK,GACT,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC,GAAG,CAAC,CAAC;YAChE,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,GAAG,CAAC;gBAChB,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;gBACZ,CAAC,CAAC,MAAM,CAAC,YAAY,EAAE,IAAI,CAAC;YAC9B,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;QACpD,IAAI,KAAK,KAAK,SAAS;YAAE,SAAS;QAClC,MAAM,KAAK,GAAG,KAAK,KAAK,GAAG,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC;QACpD,6EAA6E;QAC7E,IAAI,GAAG,KAAK,WAAW,EAAE,CAAC;YACxB,MAAM,CAAC,cAAc,CAAC,GAAG,EAAE,GAAG,EAAE;gBAC9B,YAAY,EAAE,IAAI;gBAClB,UAAU,EAAE,IAAI;gBAChB,KAAK;gBACL,QAAQ,EAAE,IAAI;aACf,CAAC,CAAC;QACL,CAAC;aAAM,CAAC;YACN,GAAG,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;QACnB,CAAC;QACD,IAAI,IAAI,CAAC,OAAO,IAAI,CAAC,KAAK,KAAK,GAAG,IAAI,IAAI,CAAC,SAAS,CAAC;YAAE,MAAM;IAC/D,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;GAIG;AACH,SAAS,GAAG,CAAC,GAA4B,EAAE,GAAW,EAAE,KAAc,EAAE,IAAU;IAChF,IAAI,KAAK,KAAK,SAAS;QAAE,GAAG,CAAC,GAAG,CAAC,GAAG,KAAK,KAAK,GAAG,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC;IAC1E,OAAO,CAAC,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,KAAK,KAAK,GAAG,IAAI,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;AAC9D,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAS,SAAS,CAAC,GAAU,EAAE,KAAY,EAAE,KAAa,EAAE,IAAU;IACpE,MAAM,EAAE,WAAW,EAAE,GAAG,IAAI,CAAC;IAC7B,IAAI,CAAC,WAAW,GAAG,SAAS,CAAC;IAC7B,MAAM,GAAG,GAA4B,EAAE,CAAC;IACxC,IACE,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,SAAS,CAAC,IAAI,CAAC,GAAG,EAAE,MAAM,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC;QACrE,GAAG,CAAC,GAAG,EAAE,SAAS,EAAE,SAAS,CAAC,IAAI,CAAC,GAAG,EAAE,SAAS,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC;QAC3E,IAAI,CAAC,IAAI,KAAK,KAAK,EACnB,CAAC;QACD,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QACjE,IAAI,IAAI,GACN,KAAK,KAAK,SAAS;YACnB,KAAK,KAAK,WAAW;YACrB,GAAG,CAAC,GAAG,EAAE,OAAO,EAAE,SAAS,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;QAC7D,IAAI,IAAI,EAAE,CAAC;YACT,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;YAC/B,IAAI,KAAK,KAAK,UAAU,EAAE,CAAC;gBACzB,IAAI,IAAI,KAAK,UAAU;oBAAE,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC;gBACzC,IAAI,GAAG,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,SAAS,CAAC,IAAI,CAAC,GAAG,EAAE,MAAM,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;YAC/E,CAAC;iBAAM,IAAI,OAAO,IAAI,KAAK,QAAQ,EAAE,CAAC;gBACpC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC;YAClB,CAAC;QACH,CAAC;QACD,IAAI,IAAI,EAAE,CAAC;YACT,IAAI,CAAC,WAAW,GAAG,KAAK,KAAK,UAAU,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC;YAC5D,IAAI,GAAG,GAAG,CAAC,GAAG,EAAE,OAAO,EAAE,SAAS,CAAC,IAAI,CAAC,GAAG,EAAE,OAAO,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;YAC/E,IAAI,IAAI,IAAI,KAAK,KAAK,gBAAgB,EAAE,CAAC;gBACvC,GAAG,CAAC,GAAG,EAAE,QAAQ,EAAE,SAAS,CAAC,IAAI,CAAC,GAAG,EAAE,QAAQ,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;YAC5E,CAAC;QACH,CAAC;IACH,CAAC;IACD,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;IAC/B,OAAO,GAAG,CAAC;AACb,CAAC;AAED,kGAAkG;AAClG,SAAS,OAAO,CACd,IAAkB,EAClB,YAAqB,EACrB,aAAwC;IAExC,OAAO;QACL,SAAS,EAAE,EAAE;QACb,KAAK,EAAE,kBAAkB;QACzB,aAAa;QACb,YAAY;QACZ,IAAI,EAAE,SAAS;QACf,IAAI;QACJ,WAAW,EAAE,SAAS;QACtB,KAAK,EAAE,SAAS;QAChB,SAAS,EAAE,KAAK;QAChB,IAAI,EAAE,iBAAiB;QACvB,IAAI,EAAE,IAAI,GAAG,EAAE;QACf,OAAO,EAAE,KAAK;KACf,CAAC;AACJ,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,UAAU,CACxB,KAAc,EACd,OAAO,GAAuF,EAAE;IAEhG,MAAM,GAAG,GAAG,SAAS,CACnB,KAAK,EACL,CAAC,EACD,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,YAAY,IAAI,IAAI,EAAE,OAAO,CAAC,aAAa,CAAC,CACpE,CAAC;IACF,OAAO,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,GAAG,CAAC;AAC3C,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,aAAa,CAAC,MAA+B;IAC3D,MAAM,IAAI,GAAG,OAAO,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IACtC,IAAI,IAAc,CAAC;IACnB,IAAI,CAAC;QACH,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC7B,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,CAAC;IAClC,CAAC;IACD,yFAAyF;IACzF,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC5B,OAAO,UAAU,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;AAC3C,CAAC"}