dissent 0.0.0-stage → 0.1.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/LICENSE +202 -0
- package/README.md +282 -2
- package/dist/index.d.ts +493 -0
- package/dist/index.js +3793 -0
- package/dist/index.js.map +1 -0
- package/package.json +73 -4
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"index.js","names":["defaultCompareFields"],"sources":["../src/errors.ts","../src/paths.ts","../src/canonical/canonical-json.ts","../src/canonical/sha256.ts","../src/canonical/hash-input.ts","../src/compare/util.ts","../src/compare/tolerance.ts","../src/compare/compare-fields.ts","../src/compare/coverage.ts","../src/compare/walk-schema.ts","../src/compare/derive-plan.ts","../src/findings.ts","../src/sanitize.ts","../src/witness/redact.ts","../src/witness/classify-error.ts","../src/witness/normalize-witnesses.ts","../src/witness/independence.ts","../src/corroborate.ts","../src/receipt.ts","../src/adjudicate.ts","../src/render/escape.ts","../src/render/format-ascii.ts","../src/render/format-markdown.ts","../src/render/format-ledger.ts"],"sourcesContent":["const ROOT_MARKER = Symbol.for('dissent.error.DissentError');\nconst ARGUMENT_MARKER = Symbol.for('dissent.error.DissentArgumentError');\nconst NON_JSON_MARKER = Symbol.for('dissent.error.NonJsonValueError');\n\nfunction hasMarker(error: unknown, marker: symbol): boolean {\n return (\n typeof error === 'object' &&\n error !== null &&\n (error as Record<symbol, unknown>)[marker] === true\n );\n}\n\nexport class DissentError extends Error {\n readonly [ROOT_MARKER] = true;\n\n constructor(message: string, options?: { cause?: unknown }) {\n super(message, options);\n this.name = 'DissentError';\n }\n\n static isInstance(error: unknown): error is DissentError {\n return hasMarker(error, ROOT_MARKER);\n }\n}\n\nexport type DissentArgumentCode =\n | 'too-few-witnesses'\n | 'too-many-witnesses'\n | 'invalid-label'\n | 'reserved-label'\n | 'invalid-witness-entry'\n | 'prompt-and-messages'\n | 'no-input'\n | 'schema-root-not-object'\n | 'unknown-compare-path'\n | 'incompatible-override'\n | 'invalid-tolerance'\n | 'invalid-key'\n | 'invalid-author-model'\n | 'exclude-without-authors'\n | 'too-few-witnesses-after-exclusion'\n | 'invalid-option'\n | 'invalid-evidence';\n\nexport class DissentArgumentError extends DissentError {\n readonly [ARGUMENT_MARKER] = true;\n declare readonly name: 'DissentArgumentError';\n readonly code: DissentArgumentCode;\n /** The option or path at fault, e.g. 'witnesses.__proto__' or 'compare./risk'. */\n readonly argument: string;\n\n constructor(code: DissentArgumentCode, argument: string, message?: string) {\n super(message ?? `Invalid argument \"${argument}\": ${code}`);\n this.name = 'DissentArgumentError';\n this.code = code;\n this.argument = argument;\n }\n\n static override isInstance(error: unknown): error is DissentArgumentError {\n return hasMarker(error, ARGUMENT_MARKER);\n }\n}\n\n/** Thrown by the internal canonicalizer; caught in Layer A and recorded as invalid-output. */\nexport class NonJsonValueError extends DissentError {\n readonly [NON_JSON_MARKER] = true;\n declare readonly name: 'NonJsonValueError';\n /** JSON Pointer of the offending value. */\n readonly path: string;\n /** e.g. 'Date', 'Map', 'NaN', 'Infinity', 'bigint', 'function', 'symbol', 'undefined-in-array', 'cycle', 'depth'. */\n readonly found: string;\n\n constructor(path: string, found: string) {\n super(\n `Value at \"${path === '' ? '(root)' : path}\" is not JSON-compatible: ${found}`,\n );\n this.name = 'NonJsonValueError';\n this.path = path;\n this.found = found;\n }\n\n static override isInstance(error: unknown): error is NonJsonValueError {\n return hasMarker(error, NON_JSON_MARKER);\n }\n}\n","/** RFC 6901 JSON Pointer helpers (§5.1). Pure, no imports. */\n\nexport function escapePointerToken(token: string): string {\n return token.replaceAll('~', '~0').replaceAll('/', '~1');\n}\n\n/** Throws `SyntaxError` for a `~` not followed by `0` or `1`. */\nexport function unescapePointerToken(token: string): string {\n if (/~(?![01])/.test(token)) {\n throw new SyntaxError(`Invalid JSON Pointer token: ${token}`);\n }\n return token.replaceAll('~1', '/').replaceAll('~0', '~');\n}\n\n/** Appends one escaped token to a pointer. `appendPointer('', 'a/b')` is `/a~1b`. */\nexport function appendPointer(pointer: string, token: string): string {\n return `${pointer}/${escapePointerToken(token)}`;\n}\n\n/** Splits a pointer into unescaped tokens. `''` is the root (no tokens). */\nexport function parsePointer(pointer: string): string[] {\n if (pointer === '') return [];\n if (!pointer.startsWith('/')) {\n throw new SyntaxError(\n `JSON Pointer must be empty or start with \"/\": ${pointer}`,\n );\n }\n return pointer.slice(1).split('/').map(unescapePointerToken);\n}\n\n/**\n * Normalizes a `compare` key or `claim.path`: a string starting with `/` is already a\n * pointer; any other string is a top-level property name (§5.1).\n */\nexport function normalizePath(pathOrName: string): string {\n return pathOrName.startsWith('/')\n ? pathOrName\n : `/${escapePointerToken(pathOrName)}`;\n}\n","import { NonJsonValueError } from '../errors.js';\nimport { appendPointer } from '../paths.js';\n\nexport const MAX_VALUE_DEPTH = 64;\n\n/**\n * RFC 8785 (JCS) serializer with a JSON-value guard (§4.1, §4.4).\n *\n * Keys sort by UTF-16 code units. `toJSON` is never called. Object properties whose value\n * is `undefined` are omitted. Anything that is not plain JSON throws `NonJsonValueError`.\n */\nexport function canonicalJson(value: unknown): string {\n return serialize(value, '', 0, new WeakSet<object>());\n}\n\nfunction serialize(\n value: unknown,\n path: string,\n depth: number,\n stack: WeakSet<object>,\n): string {\n switch (typeof value) {\n case 'string':\n return JSON.stringify(value);\n case 'boolean':\n return value ? 'true' : 'false';\n case 'number':\n if (Number.isNaN(value)) throw new NonJsonValueError(path, 'NaN');\n if (!Number.isFinite(value))\n throw new NonJsonValueError(path, 'Infinity');\n return JSON.stringify(value); // -0 → \"0\", 1.0 → \"1\", ES number formatting is JCS\n case 'bigint':\n throw new NonJsonValueError(path, 'bigint');\n case 'function':\n throw new NonJsonValueError(path, 'function');\n case 'symbol':\n throw new NonJsonValueError(path, 'symbol');\n case 'undefined':\n throw new NonJsonValueError(path, 'undefined');\n default:\n break;\n }\n if (value === null) return 'null';\n\n const object = value as object;\n if (depth >= MAX_VALUE_DEPTH) throw new NonJsonValueError(path, 'depth');\n if (stack.has(object)) throw new NonJsonValueError(path, 'cycle');\n\n const isArray = Array.isArray(object);\n if (!isArray) {\n const proto = Object.getPrototypeOf(object) as unknown;\n if (proto !== Object.prototype && proto !== null) {\n throw new NonJsonValueError(path, describe(object));\n }\n }\n\n stack.add(object);\n try {\n if (isArray) {\n const items: string[] = [];\n for (let i = 0; i < object.length; i++) {\n const itemPath = `${path}/${i}`;\n if (!Object.hasOwn(object, i) || object[i] === undefined) {\n throw new NonJsonValueError(itemPath, 'undefined-in-array');\n }\n items.push(serialize(object[i], itemPath, depth + 1, stack));\n }\n return `[${items.join(',')}]`;\n }\n\n const record = object as Record<string, unknown>;\n const keys = Object.keys(record)\n // oxlint-disable-next-line unicorn/no-array-sort -- Object.keys returns a fresh array; toSorted needs ES2023 lib.\n .sort(compareUtf16);\n const members: string[] = [];\n for (const key of keys) {\n // Own-property read; `__proto__` own keys are plain data here.\n const descriptor = Object.getOwnPropertyDescriptor(record, key);\n if (descriptor !== undefined && !('value' in descriptor)) {\n throw new NonJsonValueError(appendPointer(path, key), 'accessor');\n }\n const member = descriptor?.value as unknown;\n if (member === undefined) continue;\n members.push(\n `${JSON.stringify(key)}:${serialize(member, appendPointer(path, key), depth + 1, stack)}`,\n );\n }\n return `{${members.join(',')}}`;\n } finally {\n stack.delete(object);\n }\n}\n\n/** UTF-16 code-unit order (RFC 8785 §3.2.3). Never `localeCompare`. */\nexport function compareUtf16(a: string, b: string): number {\n return a < b ? -1 : a > b ? 1 : 0;\n}\n\nfunction describe(object: object): string {\n if (object instanceof Date) return 'Date';\n if (object instanceof Map) return 'Map';\n if (object instanceof Set) return 'Set';\n if (object instanceof RegExp) return 'RegExp';\n const name = (object as { constructor?: { name?: unknown } }).constructor\n ?.name;\n return typeof name === 'string' && name !== ''\n ? `class-instance:${name}`\n : 'class-instance';\n}\n","/** SHA-256 of UTF-8 text as lowercase hex, via Web Crypto only. */\nexport async function sha256Hex(text: string): Promise<string> {\n return bytesToHex(await digest(new TextEncoder().encode(text)));\n}\n\n/** SHA-256 of raw bytes as lowercase hex. */\nexport async function sha256HexBytes(bytes: Uint8Array): Promise<string> {\n return bytesToHex(await digest(bytes));\n}\n\nasync function digest(bytes: Uint8Array): Promise<Uint8Array> {\n return new Uint8Array(\n await globalThis.crypto.subtle.digest(\n 'SHA-256',\n bytes as Uint8Array<ArrayBuffer>,\n ),\n );\n}\n\nfunction bytesToHex(bytes: Uint8Array): string {\n let out = '';\n for (const byte of bytes) out += byte.toString(16).padStart(2, '0');\n return out;\n}\n","import { DissentArgumentError } from '../errors.js';\nimport { MAX_VALUE_DEPTH } from './canonical-json.js';\nimport { sha256HexBytes } from './sha256.js';\n\nimport type { JSONValue } from '../types.js';\n\nexport type HashFormArgument = 'prompt' | 'messages' | 'instructions';\n\n/**\n * Maps the caller's `instructions`, `prompt` or `messages` to a JSON value (§4.2).\n * Strings get CRLF/CR → LF when `normalize` is true; bytes become `{ $bytes }`;\n * `URL` becomes `{ $url }`. Anything else that is not plain JSON throws\n * `DissentArgumentError('invalid-option', argument)`.\n */\nexport async function hashForm(\n value: unknown,\n normalize: boolean,\n argument: HashFormArgument,\n): Promise<JSONValue> {\n return map(value, normalize, argument, 0, new WeakSet<object>());\n}\n\nasync function map(\n value: unknown,\n normalize: boolean,\n argument: HashFormArgument,\n depth: number,\n stack: WeakSet<object>,\n): Promise<JSONValue> {\n if (typeof value === 'string') {\n return normalize\n ? value.replaceAll('\\r\\n', '\\n').replaceAll('\\r', '\\n')\n : value;\n }\n if (value === null || typeof value === 'boolean') return value;\n if (typeof value === 'number') {\n if (Number.isFinite(value)) return value;\n throw invalid(argument, 'non-finite number');\n }\n if (typeof value !== 'object') throw invalid(argument, typeof value);\n\n if (value instanceof ArrayBuffer) {\n return bytesForm(new Uint8Array(value));\n }\n if (ArrayBuffer.isView(value)) {\n return bytesForm(\n new Uint8Array(value.buffer, value.byteOffset, value.byteLength),\n );\n }\n if (value instanceof URL) return { $url: value.href };\n\n if (depth >= MAX_VALUE_DEPTH) throw invalid(argument, 'nesting too deep');\n if (stack.has(value)) throw invalid(argument, 'cycle');\n\n stack.add(value);\n try {\n if (Array.isArray(value)) {\n const out: JSONValue[] = [];\n for (const item of value as unknown[]) {\n out.push(await map(item, normalize, argument, depth + 1, stack));\n }\n return out;\n }\n const proto = Object.getPrototypeOf(value) as unknown;\n if (proto !== Object.prototype && proto !== null) {\n throw invalid(argument, 'non-plain object');\n }\n const out: Record<string, JSONValue> = {};\n for (const key of Object.keys(value)) {\n const member = (value as Record<string, unknown>)[key];\n if (member === undefined) continue;\n // defineProperty keeps an own `__proto__` key as data (§12.2).\n Object.defineProperty(out, key, {\n value: await map(member, normalize, argument, depth + 1, stack),\n enumerable: true,\n writable: true,\n configurable: true,\n });\n }\n return out;\n } finally {\n stack.delete(value);\n }\n}\n\nasync function bytesForm(bytes: Uint8Array): Promise<JSONValue> {\n return {\n $bytes: { sha256: await sha256HexBytes(bytes), length: bytes.byteLength },\n };\n}\n\nfunction invalid(\n argument: HashFormArgument,\n what: string,\n): DissentArgumentError {\n return new DissentArgumentError(\n 'invalid-option',\n argument,\n `\"${argument}\" contains a value that cannot be hashed (${what}).`,\n );\n}\n","import { compareUtf16 } from '../canonical/canonical-json.js';\n\nimport type { JSONValue } from '../types.js';\n\nexport function normalizeJsonZeros(value: JSONValue): JSONValue {\n if (typeof value === 'number') {\n return value === 0 ? 0 : value;\n }\n if (Array.isArray(value)) {\n let changed = false;\n const copy: JSONValue[] = [];\n for (const orig of value) {\n const norm = normalizeJsonZeros(orig as JSONValue);\n if (!Object.is(orig, norm)) changed = true;\n copy.push(norm);\n }\n return changed ? copy : value;\n }\n if (isPlainObject(value)) {\n const keys = Object.keys(value);\n const out = Object.create(null) as Record<string, JSONValue>;\n let changed = false;\n for (const k of keys) {\n const orig = ownValue<JSONValue>(value, k) as JSONValue;\n if (orig === undefined) {\n changed = true;\n continue;\n }\n const norm = normalizeJsonZeros(orig);\n if (!Object.is(orig, norm)) changed = true;\n Object.defineProperty(out, k, {\n value: norm,\n enumerable: true,\n writable: true,\n configurable: true,\n });\n }\n return changed ? out : value;\n }\n return value;\n}\n\nexport function isPlainObject(\n value: unknown,\n): value is Record<string, unknown> {\n if (typeof value !== 'object' || value === null || Array.isArray(value)) {\n return false;\n }\n const proto = Object.getPrototypeOf(value) as unknown;\n return proto === Object.prototype || proto === null;\n}\n\nexport function sortWith<T>(\n items: readonly T[],\n cmp: (a: T, b: T) => number,\n): T[] {\n // oxlint-disable-next-line unicorn/no-array-sort -- fresh array copy.\n return items.slice().sort(cmp);\n}\n\nexport function sortLabels<W extends string>(labels: readonly W[]): W[] {\n return sortWith(labels, compareUtf16);\n}\n\nexport function ownValue<V = unknown>(obj: object, key: string): V | undefined {\n return Object.getOwnPropertyDescriptor(obj, key)?.value as V | undefined;\n}\n\nexport function toSortedNullProtoRecord<V>(\n entries: ReadonlyArray<[string, V]>,\n): Record<string, V> {\n const sorted = sortWith(entries, (a, b) => compareUtf16(a[0], b[0]));\n const out = Object.create(null) as Record<string, V>;\n for (const [key, value] of sorted) {\n Object.defineProperty(out, key, {\n value,\n enumerable: true,\n writable: true,\n configurable: true,\n });\n }\n return out;\n}\n","import type {\n FieldStatus,\n JSONValue,\n ToleranceResult,\n ToleranceSpec,\n ValueGroup,\n} from '../types.js';\n\nimport { sortLabels, sortWith } from './util.js';\n\n/**\n * Checks whether two finite numbers lie within the combined tolerance bound:\n * `|a - b| <= (absolute ?? 0) + (relative ?? 0) * max(|a|, |b|)`.\n */\nexport function withinTolerance(\n a: number,\n b: number,\n tolerance: ToleranceSpec,\n): boolean {\n const abs = tolerance.absolute ?? 0;\n const rel = tolerance.relative ?? 0;\n return Math.abs(a - b) <= abs + rel * Math.max(Math.abs(a), Math.abs(b));\n}\n\nfunction normalizeNumber(n: number): number {\n return n === 0 ? 0 : n;\n}\n\n/**\n * Evaluates a `tolerance` field comparison over already-extracted presenters.\n */\nexport function compareTolerance<W extends string>(params: {\n answered: number;\n presented: W[];\n missing: W[];\n nulls: W[];\n presentValues: Array<{ witness: W; value: JSONValue }>;\n tolerance: ToleranceSpec;\n}): ToleranceResult<W> {\n const { answered, presented, missing, nulls, presentValues, tolerance } =\n params;\n\n const byNumber = new Map<number, W[]>();\n const nullWitnesses: W[] = [];\n\n for (const entry of presentValues) {\n if (entry.value === null) {\n nullWitnesses.push(entry.witness);\n } else if (\n typeof entry.value === 'number' &&\n Number.isFinite(entry.value)\n ) {\n const val = normalizeNumber(entry.value);\n const list = byNumber.get(val);\n if (list === undefined) {\n byNumber.set(val, [entry.witness]);\n } else {\n list.push(entry.witness);\n }\n }\n }\n\n const distinctNumbers = sortWith(\n Array.from(byNumber.keys()),\n (a, b) => a - b,\n );\n\n // Single-linkage grouping in ascending numeric order\n const groups: ToleranceResult<W>['groups'] = [];\n if (distinctNumbers.length > 0) {\n let currentValues: ValueGroup<W>[] = [];\n let currentMin = distinctNumbers[0]!;\n let currentMax = distinctNumbers[0]!;\n let currentSupport = 0;\n\n for (let i = 0; i < distinctNumbers.length; i++) {\n const val = distinctNumbers[i]!;\n const witnesses = sortLabels(byNumber.get(val)!);\n const valueGroup: ValueGroup<W> = {\n value: val,\n witnesses,\n support: witnesses.length,\n };\n\n if (i === 0) {\n currentValues = [valueGroup];\n currentMin = val;\n currentMax = val;\n currentSupport = witnesses.length;\n } else if (withinTolerance(distinctNumbers[i - 1]!, val, tolerance)) {\n currentValues.push(valueGroup);\n currentMax = val;\n currentSupport += witnesses.length;\n } else {\n groups.push({\n min: currentMin,\n max: currentMax,\n values: currentValues,\n support: currentSupport,\n });\n currentValues = [valueGroup];\n currentMin = val;\n currentMax = val;\n currentSupport = witnesses.length;\n }\n }\n\n groups.push({\n min: currentMin,\n max: currentMax,\n values: currentValues,\n support: currentSupport,\n });\n }\n\n // Pairwise withinTolerance check across all distinct numeric values\n let allPairsWithin = true;\n for (let i = 0; i < distinctNumbers.length && allPairsWithin; i++) {\n for (let j = i + 1; j < distinctNumbers.length; j++) {\n if (\n !withinTolerance(distinctNumbers[i]!, distinctNumbers[j]!, tolerance)\n ) {\n allPairsWithin = false;\n break;\n }\n }\n }\n\n let status: FieldStatus;\n if (presented.length < 2) {\n status = 'insufficient';\n } else if (nullWitnesses.length === 0) {\n status = allPairsWithin ? 'agree' : 'split';\n } else if (distinctNumbers.length === 0) {\n status = 'agree';\n } else {\n status = 'split';\n }\n\n const out: ToleranceResult<W> = {\n comparator: 'tolerance',\n status,\n answered,\n presented,\n missing,\n nulls,\n tolerance,\n groups,\n };\n\n if (distinctNumbers.length > 0) {\n const min = distinctNumbers[0]!;\n const max = distinctNumbers[distinctNumbers.length - 1]!;\n out.min = min;\n out.max = max;\n out.spread = normalizeNumber(max - min);\n }\n\n if (nullWitnesses.length > 0) {\n const sortedNullWitnesses = sortLabels(nullWitnesses);\n out.nullGroup = {\n witnesses: sortedNullWitnesses,\n support: sortedNullWitnesses.length,\n };\n }\n\n return out;\n}\n","import { canonicalJson, compareUtf16 } from '../canonical/canonical-json.js';\nimport { parsePointer } from '../paths.js';\n\nimport type {\n ExactResult,\n FieldPlan,\n FieldResult,\n FieldStatus,\n JSONValue,\n KeyedSetResult,\n LeafPlan,\n LeafResult,\n NotComparedResult,\n SetResult,\n UnionResult,\n ValueGroup,\n} from '../types.js';\n\nimport { compareTolerance } from './tolerance.js';\nimport {\n isPlainObject,\n normalizeJsonZeros,\n ownValue,\n sortLabels,\n sortWith,\n toSortedNullProtoRecord,\n} from './util.js';\n\nexport type AnsweredOutput<W extends string = string> = {\n witness: W;\n output: JSONValue;\n};\n\n/**\n * Reads a value at an RFC 6901 JSON Pointer using `Object.hasOwn` at every\n * step. Intermediate non-objects (including `null` or arrays) make descendants\n * missing rather than throwing or reading prototype keys.\n */\nexport function readByPointer(\n root: JSONValue,\n pointer: string,\n): { present: true; value: JSONValue } | { present: false } {\n if (pointer === '') {\n return { present: true, value: root };\n }\n let cur: unknown = root;\n for (const seg of parsePointer(pointer)) {\n if (!isPlainObject(cur) || !Object.hasOwn(cur, seg)) {\n return { present: false };\n }\n const next = ownValue(cur, seg);\n if (next === undefined) {\n return { present: false };\n }\n cur = next;\n }\n return { present: true, value: cur as JSONValue };\n}\n\ntype ExtractedPresence<W extends string> = {\n presented: W[];\n missing: W[];\n nulls: W[];\n presentValues: Array<{ witness: W; value: JSONValue }>;\n};\n\nfunction extractPresence<W extends string>(\n outputs: ReadonlyArray<AnsweredOutput<W>>,\n pointer: string,\n): ExtractedPresence<W> {\n const presented: W[] = [];\n const missing: W[] = [];\n const nulls: W[] = [];\n const presentValues: Array<{ witness: W; value: JSONValue }> = [];\n\n for (const entry of outputs) {\n const read = readByPointer(entry.output, pointer);\n if (!read.present) {\n missing.push(entry.witness);\n continue;\n }\n const value = normalizeJsonZeros(read.value);\n presented.push(entry.witness);\n if (value === null) {\n nulls.push(entry.witness);\n }\n presentValues.push({ witness: entry.witness, value });\n }\n\n return {\n presented: sortLabels(presented),\n missing: sortLabels(missing),\n nulls: sortLabels(nulls),\n presentValues: sortWith(presentValues, (a, b) =>\n compareUtf16(a.witness, b.witness),\n ),\n };\n}\n\nfunction buildExactGroups<W extends string>(\n presentValues: ReadonlyArray<{ witness: W; value: JSONValue }>,\n): ValueGroup<W>[] {\n const byCanon = new Map<string, { value: JSONValue; witnesses: W[] }>();\n for (const entry of presentValues) {\n const key = canonicalJson(entry.value);\n const existing = byCanon.get(key);\n if (existing === undefined) {\n byCanon.set(key, { value: entry.value, witnesses: [entry.witness] });\n } else {\n existing.witnesses.push(entry.witness);\n }\n }\n\n return sortLabels(Array.from(byCanon.keys())).map(k => {\n const entry = byCanon.get(k)!;\n const witnesses = sortLabels(entry.witnesses);\n return { value: entry.value, witnesses, support: witnesses.length };\n });\n}\n\nfunction compareExact<W extends string>(\n answered: number,\n presence: ExtractedPresence<W>,\n): ExactResult<W> {\n const groups = buildExactGroups(presence.presentValues);\n const status: FieldStatus =\n presence.presented.length < 2\n ? 'insufficient'\n : groups.length === 1\n ? 'agree'\n : 'split';\n\n return {\n comparator: 'exact',\n status,\n answered,\n presented: presence.presented,\n missing: presence.missing,\n nulls: presence.nulls,\n groups,\n };\n}\n\ntype SetCore<W extends string> = {\n union: JSONValue[];\n intersection: JSONValue[];\n items: Array<{ item: JSONValue; witnesses: W[]; support: number }>;\n jaccard?: number;\n duplicates: W[];\n};\n\nfunction computeSetCore<W extends string>(\n nonNullArrays: ReadonlyArray<{ witness: W; values: JSONValue[] }>,\n nonArrayCount = 0,\n): SetCore<W> {\n const itemMap = new Map<string, { item: JSONValue; witnesses: W[] }>();\n const duplicates: W[] = [];\n\n for (const entry of nonNullArrays) {\n const seen = new Set<string>();\n let hadDup = false;\n for (const rawItem of entry.values) {\n const item = normalizeJsonZeros(rawItem);\n const key = canonicalJson(item);\n if (seen.has(key)) {\n hadDup = true;\n continue;\n }\n seen.add(key);\n const existing = itemMap.get(key);\n if (existing === undefined) {\n itemMap.set(key, { item, witnesses: [entry.witness] });\n } else {\n existing.witnesses.push(entry.witness);\n }\n }\n if (hadDup) duplicates.push(entry.witness);\n }\n\n const nonNullCount = nonNullArrays.length + nonArrayCount;\n const sortedKeys = sortLabels(Array.from(itemMap.keys()));\n const union: JSONValue[] = [];\n const intersection: JSONValue[] = [];\n const items: Array<{ item: JSONValue; witnesses: W[]; support: number }> = [];\n\n for (const key of sortedKeys) {\n const entry = itemMap.get(key)!;\n const witnesses = sortLabels(entry.witnesses);\n union.push(entry.item);\n if (nonNullCount > 0 && witnesses.length === nonNullCount) {\n intersection.push(entry.item);\n }\n items.push({ item: entry.item, witnesses, support: witnesses.length });\n }\n\n const out: SetCore<W> = {\n union,\n intersection,\n items,\n duplicates: sortLabels(duplicates),\n };\n\n if (nonNullCount >= 2) {\n out.jaccard =\n nonArrayCount > 0\n ? 0\n : union.length === 0\n ? 1\n : intersection.length / union.length;\n }\n\n return out;\n}\n\nfunction compareSet<W extends string>(\n answered: number,\n presence: ExtractedPresence<W>,\n): SetResult<W> {\n const nonNullArrays: Array<{ witness: W; values: JSONValue[] }> = [];\n let nonArrayCount = 0;\n\n for (const entry of presence.presentValues) {\n if (entry.value === null) continue;\n if (Array.isArray(entry.value)) {\n nonNullArrays.push({ witness: entry.witness, values: entry.value });\n } else {\n nonArrayCount += 1;\n }\n }\n\n const core = computeSetCore(nonNullArrays, nonArrayCount);\n const nullCount = presence.nulls.length;\n\n let status: FieldStatus;\n if (presence.presented.length < 2) {\n status = 'insufficient';\n } else if (nonArrayCount > 0) {\n status = 'split';\n } else if (nullCount === presence.presented.length) {\n status = 'agree';\n } else if (nullCount > 0) {\n status = 'split';\n } else if (core.intersection.length === core.union.length) {\n status = 'agree';\n } else {\n status = 'split';\n }\n\n const out: SetResult<W> = {\n comparator: 'set',\n status,\n answered,\n presented: presence.presented,\n missing: presence.missing,\n nulls: presence.nulls,\n union: core.union,\n intersection: core.intersection,\n items: core.items,\n duplicates: core.duplicates,\n };\n if (core.jaccard !== undefined) {\n out.jaccard = core.jaccard;\n }\n return out;\n}\n\nfunction compareNotCompared<W extends string>(\n plan: LeafPlan & { comparator: 'none' },\n answered: number,\n presence: ExtractedPresence<W>,\n): NotComparedResult<W> {\n return {\n comparator: 'none',\n status: 'not-compared',\n reason: plan.reason,\n detail: plan.detail,\n answered,\n presented: presence.presented,\n missing: presence.missing,\n nulls: presence.nulls,\n values: presence.presentValues.map(entry => ({\n witness: entry.witness,\n value: entry.value,\n })),\n };\n}\n\nfunction compareLeaf<W extends string>(\n plan: LeafPlan,\n pointer: string,\n outputs: ReadonlyArray<AnsweredOutput<W>>,\n): LeafResult<W> {\n const answered = outputs.length;\n const presence = extractPresence(outputs, pointer);\n\n switch (plan.comparator) {\n case 'exact':\n return compareExact(answered, presence);\n case 'tolerance':\n return compareTolerance({\n answered,\n presented: presence.presented,\n missing: presence.missing,\n nulls: presence.nulls,\n presentValues: presence.presentValues,\n tolerance: plan.tolerance,\n });\n case 'set':\n return compareSet(answered, presence);\n case 'none':\n return compareNotCompared(plan, answered, presence);\n }\n}\n\nfunction compareKeyedSet<W extends string>(\n plan: FieldPlan & { comparator: 'keyed-set' },\n pointer: string,\n outputs: ReadonlyArray<AnsweredOutput<W>>,\n): KeyedSetResult<W> | NotComparedResult<W> {\n const answered = outputs.length;\n const presence = extractPresence(outputs, pointer);\n\n const duplicateKeyWitnesses: W[] = [];\n let nonArrayCount = 0;\n const witnessMaps = new Map<\n W,\n Map<string, { keyValue: JSONValue; item: JSONValue }>\n >();\n const keyRegistry = new Map<\n string,\n { keyValue: JSONValue; entries: Array<{ witness: W; output: JSONValue }> }\n >();\n const keySetArrays: Array<{ witness: W; values: JSONValue[] }> = [];\n\n for (const entry of presence.presentValues) {\n if (entry.value === null) continue;\n if (!Array.isArray(entry.value)) {\n nonArrayCount += 1;\n continue;\n }\n\n const wMap = new Map<string, { keyValue: JSONValue; item: JSONValue }>();\n const wKeys: JSONValue[] = [];\n let failed = false;\n\n for (const rawItem of entry.value) {\n if (!isPlainObject(rawItem) || !Object.hasOwn(rawItem, plan.key)) {\n failed = true;\n break;\n }\n const rawKeyVal = ownValue(rawItem, plan.key);\n if (rawKeyVal === undefined) {\n failed = true;\n break;\n }\n const keyVal = normalizeJsonZeros(rawKeyVal as JSONValue);\n const canonKey = canonicalJson(keyVal);\n if (wMap.has(canonKey)) {\n failed = true;\n break;\n }\n const normItem = normalizeJsonZeros(rawItem as JSONValue);\n wMap.set(canonKey, { keyValue: keyVal, item: normItem });\n wKeys.push(keyVal);\n }\n\n if (failed) {\n duplicateKeyWitnesses.push(entry.witness);\n } else {\n witnessMaps.set(entry.witness, wMap);\n keySetArrays.push({ witness: entry.witness, values: wKeys });\n }\n }\n\n if (duplicateKeyWitnesses.length > 0) {\n return {\n comparator: 'none',\n status: 'not-compared',\n reason: 'duplicate-key',\n detail: 'duplicate-key',\n answered,\n presented: presence.presented,\n missing: presence.missing,\n nulls: presence.nulls,\n values: presence.presentValues.map(entry => ({\n witness: entry.witness,\n value: entry.value,\n })),\n duplicateKeyWitnesses: sortLabels(duplicateKeyWitnesses),\n };\n }\n\n for (const [witness, wMap] of witnessMaps) {\n for (const [canonKey, info] of wMap) {\n const existing = keyRegistry.get(canonKey);\n if (existing === undefined) {\n keyRegistry.set(canonKey, {\n keyValue: info.keyValue,\n entries: [{ witness, output: info.item }],\n });\n } else {\n existing.entries.push({ witness, output: info.item });\n }\n }\n }\n\n const keysCore = computeSetCore(keySetArrays, nonArrayCount);\n const keysResult: KeyedSetResult<W>['keys'] = {\n union: keysCore.union,\n intersection: keysCore.intersection,\n items: keysCore.items,\n };\n if (keysCore.jaccard !== undefined) {\n keysResult.jaccard = keysCore.jaccard;\n }\n\n const sortedItemFieldKeys = sortLabels(Object.keys(plan.itemFields));\n const sortedKeyCanon = sortLabels(Array.from(keyRegistry.keys()));\n\n let anyItemFieldSplit = false;\n const items: KeyedSetResult<W>['items'] = [];\n\n for (const canonKey of sortedKeyCanon) {\n const reg = keyRegistry.get(canonKey)!;\n const sortedEntries = sortWith(reg.entries, (a, b) =>\n compareUtf16(a.witness, b.witness),\n );\n const witnesses = sortedEntries.map(e => e.witness);\n\n const fieldEntries: Array<[string, LeafResult<W>]> = [];\n for (const subpath of sortedItemFieldKeys) {\n const subplan = ownValue<LeafPlan>(plan.itemFields, subpath)!;\n const leafRes = compareLeaf(subplan, subpath, sortedEntries);\n if (leafRes.status === 'split') anyItemFieldSplit = true;\n fieldEntries.push([subpath, leafRes]);\n }\n\n items.push({\n key: reg.keyValue,\n witnesses,\n fields: toSortedNullProtoRecord(fieldEntries),\n });\n }\n\n let status: FieldStatus;\n if (presence.presented.length < 2) {\n status = 'insufficient';\n } else if (nonArrayCount > 0) {\n status = 'split';\n } else if (presence.nulls.length === presence.presented.length) {\n status = 'agree';\n } else if (presence.nulls.length > 0) {\n status = 'split';\n } else if (\n keysCore.intersection.length === keysCore.union.length &&\n !anyItemFieldSplit\n ) {\n status = 'agree';\n } else {\n status = 'split';\n }\n\n return {\n comparator: 'keyed-set',\n status,\n answered,\n presented: presence.presented,\n missing: presence.missing,\n nulls: presence.nulls,\n key: plan.key,\n keys: keysResult,\n items,\n };\n}\n\nfunction compareDiscriminatedUnion<W extends string>(\n plan: FieldPlan & { comparator: 'discriminated-union' },\n pointer: string,\n outputs: ReadonlyArray<AnsweredOutput<W>>,\n): UnionResult<W> {\n const answered = outputs.length;\n const presence = extractPresence(outputs, pointer);\n\n const choicePresented: W[] = [];\n const choiceMissing: W[] = [];\n const choiceNulls: W[] = [];\n const choicePresentValues: Array<{ witness: W; value: JSONValue }> = [];\n\n const branchBuckets = new Map<\n string,\n { discValue: JSONValue; entries: Array<{ witness: W; output: JSONValue }> }\n >();\n\n for (const entry of presence.presentValues) {\n if (entry.value === null) {\n choicePresented.push(entry.witness);\n choiceNulls.push(entry.witness);\n choicePresentValues.push({ witness: entry.witness, value: null });\n continue;\n }\n\n if (\n !isPlainObject(entry.value) ||\n !Object.hasOwn(entry.value, plan.discriminator)\n ) {\n choiceMissing.push(entry.witness);\n continue;\n }\n\n const rawDisc = ownValue(entry.value, plan.discriminator);\n if (rawDisc === undefined) {\n choiceMissing.push(entry.witness);\n continue;\n }\n\n const discVal = normalizeJsonZeros(rawDisc as JSONValue);\n choicePresented.push(entry.witness);\n if (discVal === null) choiceNulls.push(entry.witness);\n choicePresentValues.push({ witness: entry.witness, value: discVal });\n\n const canonDisc = canonicalJson(discVal);\n if (Object.hasOwn(plan.branches, canonDisc)) {\n const bucket = branchBuckets.get(canonDisc);\n if (bucket === undefined) {\n branchBuckets.set(canonDisc, {\n discValue: discVal,\n entries: [{ witness: entry.witness, output: entry.value }],\n });\n } else {\n bucket.entries.push({ witness: entry.witness, output: entry.value });\n }\n }\n }\n\n const choice = compareExact(presence.presented.length, {\n presented: sortLabels(choicePresented),\n missing: sortLabels(choiceMissing),\n nulls: sortLabels(choiceNulls),\n presentValues: sortWith(choicePresentValues, (a, b) =>\n compareUtf16(a.witness, b.witness),\n ),\n });\n\n const branches: UnionResult<W>['branches'] = [];\n let anyBranchFieldSplit = false;\n\n for (const canonKey of sortLabels(Array.from(branchBuckets.keys()))) {\n const bucket = branchBuckets.get(canonKey)!;\n const sortedEntries = sortWith(bucket.entries, (a, b) =>\n compareUtf16(a.witness, b.witness),\n );\n const branchPlan = ownValue<Record<string, LeafPlan>>(\n plan.branches,\n canonKey,\n )!;\n const fieldEntries: Array<[string, LeafResult<W>]> = [];\n\n for (const subpath of sortLabels(Object.keys(branchPlan))) {\n const leafRes = compareLeaf(\n ownValue<LeafPlan>(branchPlan, subpath)!,\n subpath,\n sortedEntries,\n );\n if (leafRes.status === 'split') anyBranchFieldSplit = true;\n fieldEntries.push([subpath, leafRes]);\n }\n\n branches.push({\n value: bucket.discValue,\n witnesses: sortedEntries.map(e => e.witness),\n fields: toSortedNullProtoRecord(fieldEntries),\n });\n }\n\n let status: FieldStatus;\n if (presence.presented.length < 2 || choice.status === 'insufficient') {\n status = 'insufficient';\n } else if (choice.status === 'agree' && !anyBranchFieldSplit) {\n status = 'agree';\n } else {\n status = 'split';\n }\n\n return {\n comparator: 'discriminated-union',\n status,\n answered,\n presented: presence.presented,\n missing: presence.missing,\n nulls: presence.nulls,\n discriminator: plan.discriminator,\n choice,\n branches,\n };\n}\n\nfunction normalizeOutputs<W extends string>(\n answeredOutputs: ReadonlyArray<AnsweredOutput<W>> | Record<W, JSONValue>,\n): AnsweredOutput<W>[] {\n const list: AnsweredOutput<W>[] = Array.isArray(answeredOutputs)\n ? [...answeredOutputs]\n : Object.keys(answeredOutputs as Record<string, JSONValue>).map(\n witness => ({\n witness: witness as W,\n output: ownValue<JSONValue>(\n answeredOutputs as Record<string, JSONValue>,\n witness,\n )!,\n }),\n );\n return sortWith(list, (a, b) => compareUtf16(a.witness, b.witness));\n}\n\n/**\n * Pure Layer B field comparison over answered witness outputs.\n * Every answering witness participates (I2) and insertion order never affects output (I3).\n */\nexport function compareFields<W extends string>(\n planFields: Record<string, FieldPlan>,\n answeredOutputs: ReadonlyArray<AnsweredOutput<W>> | Record<W, JSONValue>,\n): Record<string, FieldResult<W>> {\n const outputs = normalizeOutputs(answeredOutputs);\n const resultEntries: Array<[string, FieldResult<W>]> = [];\n\n for (const path of sortLabels(Object.keys(planFields))) {\n const plan = ownValue<FieldPlan>(planFields, path)!;\n let res: FieldResult<W>;\n switch (plan.comparator) {\n case 'exact':\n case 'tolerance':\n case 'set':\n case 'none':\n res = compareLeaf(plan, path, outputs);\n break;\n case 'keyed-set':\n res = compareKeyedSet(plan, path, outputs);\n break;\n case 'discriminated-union':\n res = compareDiscriminatedUnion(plan, path, outputs);\n break;\n }\n resultEntries.push([path, res]);\n }\n\n return toSortedNullProtoRecord(resultEntries);\n}\n","import type { Coverage, FieldPlan, FieldResult, LeafPlan } from '../types.js';\n\nimport { ownValue, toSortedNullProtoRecord } from './util.js';\n\nfunction bumpReason(counts: Map<string, number>, key: string): void {\n counts.set(key, (counts.get(key) ?? 0) + 1);\n}\n\n/**\n * Computes schema coverage over every plan entry at all depths (§9.3).\n */\nexport function computeCoverage<W extends string>(\n planFields: Record<string, FieldPlan>,\n fieldResults: Record<string, FieldResult<W>>,\n): Coverage {\n let compared = 0;\n let notComparedByPolicy = 0;\n let unsupported = 0;\n let failedAtRuntime = 0;\n const reasonCounts = new Map<string, number>();\n\n function countLeaf(plan: LeafPlan, underFailedKeyedSet = false): void {\n if (plan.comparator === 'none') {\n if (plan.reason === 'policy') {\n notComparedByPolicy += 1;\n } else {\n unsupported += 1;\n }\n bumpReason(reasonCounts, plan.detail);\n } else if (underFailedKeyedSet) {\n failedAtRuntime += 1;\n bumpReason(reasonCounts, 'duplicate-key');\n } else {\n compared += 1;\n }\n }\n\n for (const path of Object.keys(planFields)) {\n const plan = ownValue<FieldPlan>(planFields, path)!;\n\n if (plan.comparator === 'keyed-set') {\n const result = ownValue<FieldResult<W>>(fieldResults, path);\n const isDupKey =\n result !== undefined &&\n result.comparator === 'none' &&\n result.reason === 'duplicate-key';\n\n if (isDupKey) {\n failedAtRuntime += 1;\n bumpReason(reasonCounts, 'duplicate-key');\n } else {\n compared += 1;\n }\n\n for (const subpath of Object.keys(plan.itemFields)) {\n countLeaf(ownValue<LeafPlan>(plan.itemFields, subpath)!, isDupKey);\n }\n } else if (plan.comparator === 'discriminated-union') {\n // Discriminator itself counts as one compared entry.\n compared += 1;\n for (const branchKey of Object.keys(plan.branches)) {\n const branchLeaves = ownValue<Record<string, LeafPlan>>(\n plan.branches,\n branchKey,\n )!;\n for (const subpath of Object.keys(branchLeaves)) {\n countLeaf(ownValue<LeafPlan>(branchLeaves, subpath)!, false);\n }\n }\n } else {\n countLeaf(plan, false);\n }\n }\n\n const fields = compared + notComparedByPolicy + unsupported + failedAtRuntime;\n const denom = fields - notComparedByPolicy;\n const ratio = denom === 0 ? 1 : compared / denom;\n\n return {\n fields,\n compared,\n notComparedByPolicy,\n unsupported,\n failedAtRuntime,\n ratio,\n byReason: toSortedNullProtoRecord(Array.from(reasonCounts.entries())),\n };\n}\n","import { canonicalJson, compareUtf16 } from '../canonical/canonical-json.js';\nimport { DissentArgumentError } from '../errors.js';\nimport { appendPointer, parsePointer } from '../paths.js';\n\nimport type {\n JSONValue,\n LeafPlan,\n NotComparedDetail,\n PlanReason,\n Severity,\n} from '../types.js';\n\nimport { isPlainObject, ownValue, sortLabels, sortWith } from './util.js';\n\nexport const MAX_SCHEMA_DEPTH = 16;\n\nexport type WalkedBranch = {\n value: JSONValue;\n object: WalkedObject;\n};\n\nexport type WalkedObject = {\n kind: 'object';\n reasons: PlanReason[];\n nullable: boolean;\n properties: Map<string, WalkedNode>;\n required: Set<string>;\n additionalProperties: boolean;\n};\n\nexport type WalkedArray = {\n kind: 'array';\n reasons: PlanReason[];\n nullable: boolean;\n items: WalkedNode | null;\n tuple: boolean;\n};\n\nexport type WalkedUnion = {\n kind: 'discriminated-union';\n reasons: PlanReason[];\n nullable: boolean;\n discriminator: string;\n branches: Map<string, WalkedBranch>;\n};\n\nexport type WalkedLeaf = {\n kind: 'leaf';\n plan: LeafPlan;\n primitiveType: 'boolean' | 'integer' | 'number' | 'string' | 'null' | 'other';\n isBooleanEnumConst: boolean;\n resolvedSchema?: Record<string, unknown>;\n};\n\nexport type WalkedNode = WalkedLeaf | WalkedObject | WalkedArray | WalkedUnion;\n\ntype RawSchema = Record<string, unknown>;\n\ntype WalkCtx = {\n root: unknown;\n depth: number;\n refStack: Set<string>;\n reasons: PlanReason[];\n nullable: boolean;\n};\n\nconst IGNORED_KEYWORDS = new Set([\n 'title',\n 'description',\n 'default',\n 'examples',\n 'format',\n 'pattern',\n 'minLength',\n 'maxLength',\n 'minimum',\n 'maximum',\n 'exclusiveMinimum',\n 'exclusiveMaximum',\n 'multipleOf',\n 'minItems',\n 'maxItems',\n 'uniqueItems',\n '$schema',\n '$id',\n '$comment',\n 'readOnly',\n 'writeOnly',\n 'deprecated',\n 'propertyNames',\n 'additionalProperties',\n]);\n\nfunction addReason(reasons: PlanReason[], reason: PlanReason): PlanReason[] {\n return reasons.includes(reason) ? reasons : [...reasons, reason];\n}\n\nfunction withReason(ctx: WalkCtx, reason: PlanReason): WalkCtx {\n return { ...ctx, reasons: addReason(ctx.reasons, reason) };\n}\n\nfunction withNullable(ctx: WalkCtx): WalkCtx {\n return {\n ...ctx,\n reasons: addReason(ctx.reasons, 'nullable-unwrap'),\n nullable: true,\n };\n}\n\nfunction buildLeaf(\n plan: LeafPlan,\n primitiveType: WalkedLeaf['primitiveType'],\n isBooleanEnumConst: boolean,\n resolvedSchema?: RawSchema,\n): WalkedLeaf {\n const leaf: WalkedLeaf = {\n kind: 'leaf',\n plan,\n primitiveType,\n isBooleanEnumConst,\n };\n if (resolvedSchema !== undefined) leaf.resolvedSchema = resolvedSchema;\n return leaf;\n}\n\nfunction makeUnsupported(\n ctx: Pick<WalkCtx, 'reasons' | 'nullable'>,\n detail: NotComparedDetail,\n resolvedSchema?: RawSchema,\n): WalkedLeaf {\n return buildLeaf(\n {\n comparator: 'none',\n reason: 'unsupported',\n detail,\n reasons: addReason(ctx.reasons, 'unsupported'),\n nullable: ctx.nullable,\n },\n 'other',\n false,\n resolvedSchema,\n );\n}\n\nfunction makePolicy(\n ctx: Pick<WalkCtx, 'reasons' | 'nullable'>,\n detail: NotComparedDetail,\n primitiveType: WalkedLeaf['primitiveType'],\n resolvedSchema?: RawSchema,\n): WalkedLeaf {\n return buildLeaf(\n {\n comparator: 'none',\n reason: 'policy',\n detail,\n reasons: addReason(ctx.reasons, 'policy'),\n nullable: ctx.nullable,\n },\n primitiveType,\n false,\n resolvedSchema,\n );\n}\n\nfunction makeExact(\n ctx: Pick<WalkCtx, 'reasons' | 'nullable'>,\n opts: {\n onSplit: Severity;\n primitiveType: WalkedLeaf['primitiveType'];\n isBooleanEnumConst?: boolean;\n resolvedSchema?: RawSchema;\n },\n): WalkedLeaf {\n return buildLeaf(\n {\n comparator: 'exact',\n onSplit: opts.onSplit,\n reasons: addReason(ctx.reasons, 'default-by-type'),\n nullable: ctx.nullable,\n },\n opts.primitiveType,\n opts.isBooleanEnumConst ?? false,\n opts.resolvedSchema,\n );\n}\n\nfunction resolvePointerInRoot(\n root: unknown,\n ref: string,\n):\n | { ok: true; target: unknown }\n | { ok: false; detail: 'external-ref' | 'invalid-ref' } {\n if (!ref.startsWith('#')) return { ok: false, detail: 'external-ref' };\n if (ref === '#') return { ok: true, target: root };\n if (!ref.startsWith('#/')) return { ok: false, detail: 'invalid-ref' };\n\n let tokens: string[];\n try {\n tokens = parsePointer(ref.slice(1));\n } catch {\n return { ok: false, detail: 'invalid-ref' };\n }\n\n let curr: unknown = root;\n for (const token of tokens) {\n if (curr === null || typeof curr !== 'object') {\n return { ok: false, detail: 'invalid-ref' };\n }\n if (Array.isArray(curr)) {\n const idx = Number(token);\n if (\n !Number.isInteger(idx) ||\n idx < 0 ||\n idx >= curr.length ||\n !Object.hasOwn(curr, idx)\n ) {\n return { ok: false, detail: 'invalid-ref' };\n }\n curr = curr[idx];\n } else {\n if (!Object.hasOwn(curr, token)) {\n return { ok: false, detail: 'invalid-ref' };\n }\n curr = ownValue(curr, token);\n }\n }\n if (typeof curr !== 'boolean' && !isPlainObject(curr)) {\n return { ok: false, detail: 'invalid-ref' };\n }\n return { ok: true, target: curr };\n}\n\nfunction resolveSimpleRef(\n node: unknown,\n ctx: Pick<WalkCtx, 'root' | 'depth' | 'refStack'>,\n):\n | { ok: true; schema: unknown; depth: number; refStack: Set<string> }\n | { ok: false; detail: NotComparedDetail } {\n let curr = node;\n let depth = ctx.depth;\n const refStack = new Set(ctx.refStack);\n while (isPlainObject(curr) && typeof curr.$ref === 'string') {\n if (refStack.has(curr.$ref)) {\n return { ok: false, detail: 'ref-cycle' };\n }\n const res = resolvePointerInRoot(ctx.root, curr.$ref);\n if (!res.ok) return res;\n depth++;\n if (depth > MAX_SCHEMA_DEPTH) {\n return { ok: false, detail: 'depth-exceeded' };\n }\n refStack.add(curr.$ref);\n curr = res.target;\n }\n return { ok: true, schema: curr, depth, refStack };\n}\n\nfunction isNullSchema(\n node: unknown,\n ctx: Pick<WalkCtx, 'root' | 'depth' | 'refStack'>,\n): boolean {\n const res = resolveSimpleRef(node, ctx);\n if (!res.ok || !isPlainObject(res.schema)) return false;\n const s = res.schema;\n if (s.type !== 'null') return false;\n for (const key of [\n 'properties',\n 'items',\n 'prefixItems',\n 'anyOf',\n 'oneOf',\n 'allOf',\n 'not',\n 'if',\n 'enum',\n 'const',\n ]) {\n if (Object.hasOwn(s, key)) return false;\n }\n return true;\n}\n\nfunction extractLiteral(\n propSchema: unknown,\n ctx: Pick<WalkCtx, 'root' | 'depth' | 'refStack'>,\n): { ok: true; value: JSONValue } | { ok: false } {\n const resolved = resolveSimpleRef(propSchema, ctx);\n if (!resolved.ok || !isPlainObject(resolved.schema)) return { ok: false };\n const s = resolved.schema;\n\n // Reject combinators / complex constraints on the discriminator property itself.\n for (const key of Object.keys(s)) {\n if (\n key === 'type' ||\n key === 'const' ||\n key === 'enum' ||\n IGNORED_KEYWORDS.has(key)\n ) {\n continue;\n }\n return { ok: false };\n }\n\n let candidate: unknown;\n if (Object.hasOwn(s, 'const') && s.const !== undefined) {\n if (Array.isArray(s.enum)) {\n if (s.enum.length !== 1) return { ok: false };\n try {\n if (canonicalJson(s.enum[0]) !== canonicalJson(s.const)) {\n return { ok: false };\n }\n } catch {\n return { ok: false };\n }\n }\n candidate = s.const;\n } else if (Array.isArray(s.enum) && s.enum.length === 1) {\n candidate = s.enum[0];\n } else {\n return { ok: false };\n }\n\n try {\n canonicalJson(candidate);\n return { ok: true, value: candidate as JSONValue };\n } catch {\n return { ok: false };\n }\n}\n\nexport function walkSchema(rootSchema: unknown): WalkedObject {\n let rootNode: unknown = rootSchema;\n let depth = 0;\n const refStack = new Set<string>();\n let reasons: PlanReason[] = [];\n\n while (isPlainObject(rootNode) && typeof rootNode.$ref === 'string') {\n if (refStack.has(rootNode.$ref)) {\n throw new DissentArgumentError('schema-root-not-object', 'schema');\n }\n const res = resolvePointerInRoot(rootSchema, rootNode.$ref);\n if (!res.ok || ++depth > MAX_SCHEMA_DEPTH) {\n throw new DissentArgumentError('schema-root-not-object', 'schema');\n }\n refStack.add(rootNode.$ref);\n reasons = addReason(reasons, 'ref-resolved');\n rootNode = res.target;\n }\n\n if (\n !isPlainObject(rootNode) ||\n rootNode.type !== 'object' ||\n !isPlainObject(rootNode.properties)\n ) {\n throw new DissentArgumentError('schema-root-not-object', 'schema');\n }\n\n return walkObject(rootNode, {\n root: rootSchema,\n depth,\n refStack,\n reasons,\n nullable: false,\n });\n}\n\nfunction walkUnionNode(\n unionBranchesRaw: unknown[],\n node: RawSchema,\n ctx: WalkCtx,\n): WalkedNode {\n const nonNullBranches = unionBranchesRaw.filter(b => !isNullSchema(b, ctx));\n const hadNullBranch = nonNullBranches.length < unionBranchesRaw.length;\n const nextCtx = hadNullBranch ? withNullable(ctx) : ctx;\n\n if (nonNullBranches.length === 0) {\n return makeExact(\n { ...nextCtx, nullable: true },\n { onSplit: 'warn', primitiveType: 'null', resolvedSchema: node },\n );\n }\n if (nonNullBranches.length === 1) {\n return walkNode(nonNullBranches[0], nextCtx);\n }\n return walkUnion(nonNullBranches, node, nextCtx);\n}\n\nfunction walkNode(node: unknown, ctx: WalkCtx): WalkedNode {\n // Rule 1: Local $ref\n if (isPlainObject(node) && typeof node.$ref === 'string') {\n const ref = node.$ref;\n if (ctx.refStack.has(ref)) {\n return makeUnsupported(ctx, 'ref-cycle', node);\n }\n const resolved = resolvePointerInRoot(ctx.root, ref);\n if (!resolved.ok) {\n return makeUnsupported(ctx, resolved.detail, node);\n }\n const nextDepth = ctx.depth + 1;\n if (nextDepth > MAX_SCHEMA_DEPTH) {\n return makeUnsupported(ctx, 'depth-exceeded', node);\n }\n const nextRefs = new Set(ctx.refStack);\n nextRefs.add(ref);\n return walkNode(resolved.target, {\n ...withReason(ctx, 'ref-resolved'),\n depth: nextDepth,\n refStack: nextRefs,\n });\n }\n\n // Rule 2: Depth check\n if (ctx.depth > MAX_SCHEMA_DEPTH) {\n return makeUnsupported(\n ctx,\n 'depth-exceeded',\n isPlainObject(node) ? node : undefined,\n );\n }\n\n if (typeof node === 'boolean' || !isPlainObject(node)) {\n return makeUnsupported(ctx, 'untyped');\n }\n\n // Rule 3: Nullable unwrap\n if (Array.isArray(node.type)) {\n const types = node.type;\n if (types.includes('null')) {\n const nonNull = types.filter(t => t !== 'null');\n const unwrappedCtx = withNullable(ctx);\n if (nonNull.length === 0) {\n return walkNode({ ...node, type: 'null' }, unwrappedCtx);\n }\n if (nonNull.length === 1) {\n return walkNode({ ...node, type: nonNull[0] }, unwrappedCtx);\n }\n return makeUnsupported(unwrappedCtx, 'multi-type', node);\n }\n if (types.length === 1) {\n return walkNode({ ...node, type: types[0] }, ctx);\n }\n return makeUnsupported(\n ctx,\n types.length > 1 ? 'multi-type' : 'untyped',\n node,\n );\n }\n\n const hasAnyOf = Array.isArray(node.anyOf);\n const hasOneOf = Array.isArray(node.oneOf);\n if (hasAnyOf && hasOneOf) {\n return makeUnsupported(ctx, 'union', node);\n }\n const unionBranchesRaw = hasAnyOf\n ? (node.anyOf as unknown[])\n : hasOneOf\n ? (node.oneOf as unknown[])\n : null;\n\n if (unionBranchesRaw !== null) {\n return walkUnionNode(unionBranchesRaw, node, ctx);\n }\n\n // Rule 5: Combinators\n if (Array.isArray(node.allOf)) {\n return makeUnsupported(ctx, 'all-of', node);\n }\n if (\n Object.hasOwn(node, 'if') ||\n Object.hasOwn(node, 'then') ||\n Object.hasOwn(node, 'else')\n ) {\n return makeUnsupported(ctx, 'conditional', node);\n }\n if (Object.hasOwn(node, 'not')) {\n return makeUnsupported(ctx, 'not', node);\n }\n\n // Rule 6: enum or const\n if (\n (Object.hasOwn(node, 'const') && node.const !== undefined) ||\n Array.isArray(node.enum)\n ) {\n const primType =\n node.type === 'integer' ||\n node.type === 'number' ||\n node.type === 'string' ||\n node.type === 'boolean' ||\n node.type === 'null'\n ? node.type\n : 'other';\n return makeExact(ctx, {\n onSplit: 'critical',\n primitiveType: primType,\n isBooleanEnumConst: true,\n resolvedSchema: node,\n });\n }\n\n // Rule 7: type\n if (typeof node.type === 'string') {\n switch (node.type) {\n case 'boolean':\n return makeExact(ctx, {\n onSplit: 'critical',\n primitiveType: 'boolean',\n isBooleanEnumConst: true,\n resolvedSchema: node,\n });\n case 'integer':\n return makeExact(ctx, {\n onSplit: 'warn',\n primitiveType: 'integer',\n resolvedSchema: node,\n });\n case 'null':\n return makeExact(ctx, {\n onSplit: 'warn',\n primitiveType: 'null',\n resolvedSchema: node,\n });\n case 'number':\n return makePolicy(ctx, 'number-without-tolerance', 'number', node);\n case 'string':\n return makePolicy(ctx, 'free-text', 'string', node);\n case 'object':\n return walkObjectOrRecord(node, ctx);\n case 'array':\n return walkArray(node, ctx);\n default:\n return makeUnsupported(ctx, 'untyped', node);\n }\n }\n\n // Rule 8: Untyped\n return makeUnsupported(ctx, 'untyped', node);\n}\n\nfunction walkUnion(\n nonNullBranches: unknown[],\n rawUnion: RawSchema,\n ctx: WalkCtx,\n): WalkedNode {\n const branchEntries: Array<{\n schema: RawSchema;\n ctx: Pick<WalkCtx, 'root' | 'depth' | 'refStack'>;\n }> = [];\n\n for (const branch of nonNullBranches) {\n const res = resolveSimpleRef(branch, {\n root: ctx.root,\n depth: ctx.depth + 1,\n refStack: ctx.refStack,\n });\n if (!res.ok) {\n return makeUnsupported(\n ctx,\n res.detail === 'depth-exceeded' ? 'depth-exceeded' : 'union',\n rawUnion,\n );\n }\n if (\n !isPlainObject(res.schema) ||\n res.schema.type !== 'object' ||\n !isPlainObject(res.schema.properties)\n ) {\n return makeUnsupported(ctx, 'union', rawUnion);\n }\n if (\n Array.isArray(res.schema.allOf) ||\n Array.isArray(res.schema.anyOf) ||\n Array.isArray(res.schema.oneOf) ||\n Object.hasOwn(res.schema, 'if') ||\n Object.hasOwn(res.schema, 'not')\n ) {\n return makeUnsupported(ctx, 'union', rawUnion);\n }\n branchEntries.push({\n schema: res.schema,\n ctx: { root: ctx.root, depth: res.depth, refStack: res.refStack },\n });\n }\n\n const firstBranch = branchEntries[0]!.schema;\n const firstProps = firstBranch.properties as RawSchema;\n const firstRequired = Array.isArray(firstBranch.required)\n ? new Set(\n firstBranch.required.filter((x): x is string => typeof x === 'string'),\n )\n : new Set<string>();\n\n const candidates = sortLabels(\n Object.keys(firstProps).filter(name => firstRequired.has(name)),\n );\n\n let chosenDiscriminator: string | null = null;\n let chosenValues: Array<{ key: string; value: JSONValue }> = [];\n\n for (const propName of candidates) {\n const seenKeys = new Set<string>();\n const values: Array<{ key: string; value: JSONValue }> = [];\n let valid = true;\n\n for (const branch of branchEntries) {\n const bProps = branch.schema.properties as RawSchema;\n const bReq = Array.isArray(branch.schema.required)\n ? branch.schema.required\n : [];\n if (!Object.hasOwn(bProps, propName) || !bReq.includes(propName)) {\n valid = false;\n break;\n }\n const lit = extractLiteral(bProps[propName], branch.ctx);\n if (!lit.ok) {\n valid = false;\n break;\n }\n const canonical = canonicalJson(lit.value);\n if (seenKeys.has(canonical)) {\n valid = false;\n break;\n }\n seenKeys.add(canonical);\n values.push({ key: canonical, value: lit.value });\n }\n\n if (valid) {\n chosenDiscriminator = propName;\n chosenValues = values;\n break;\n }\n }\n\n if (chosenDiscriminator === null) {\n return makeUnsupported(ctx, 'union', rawUnion);\n }\n\n const indexed = sortWith(\n chosenValues.map((cv, idx) => ({ ...cv, idx })),\n (a, b) => compareUtf16(a.key, b.key),\n );\n\n const branches = new Map<string, WalkedBranch>();\n for (const entry of indexed) {\n const branch = branchEntries[entry.idx]!;\n const walkedObj = walkObject(\n branch.schema,\n { ...branch.ctx, reasons: [], nullable: false },\n chosenDiscriminator,\n );\n branches.set(entry.key, { value: entry.value, object: walkedObj });\n }\n\n return {\n kind: 'discriminated-union',\n reasons: addReason(ctx.reasons, 'discriminated-union'),\n nullable: ctx.nullable,\n discriminator: chosenDiscriminator,\n branches,\n };\n}\n\nfunction walkObjectOrRecord(node: RawSchema, ctx: WalkCtx): WalkedNode {\n if (\n !isPlainObject(node.properties) ||\n Object.keys(node.properties).length === 0\n ) {\n return makeUnsupported(ctx, 'record', node);\n }\n return walkObject(node, ctx);\n}\n\nfunction walkObject(\n node: RawSchema,\n ctx: WalkCtx,\n excludeProperty?: string,\n): WalkedObject {\n const propsObj = node.properties as RawSchema;\n const propNames = sortLabels(\n Object.keys(propsObj).filter(name => name !== excludeProperty),\n );\n\n // Carry ancestor ref-resolved into flattened properties so $ref-wrapped objects record it.\n const childReasons: PlanReason[] = ctx.reasons.includes('ref-resolved')\n ? ['ref-resolved']\n : [];\n const childCtx: WalkCtx = {\n root: ctx.root,\n depth: ctx.depth + 1,\n refStack: ctx.refStack,\n reasons: childReasons,\n nullable: false,\n };\n\n const properties = new Map<string, WalkedNode>();\n for (const propName of propNames) {\n properties.set(propName, walkNode(ownValue(propsObj, propName), childCtx));\n }\n\n const required = new Set<string>();\n if (Array.isArray(node.required)) {\n for (const r of node.required) {\n if (typeof r === 'string') required.add(r);\n }\n }\n\n const hasExtraProps =\n Object.hasOwn(node, 'additionalProperties') &&\n node.additionalProperties !== undefined &&\n node.additionalProperties !== false;\n\n return {\n kind: 'object',\n reasons: ctx.reasons,\n nullable: ctx.nullable,\n properties,\n required,\n additionalProperties: hasExtraProps,\n };\n}\n\nfunction walkArray(node: RawSchema, ctx: WalkCtx): WalkedNode {\n if (Array.isArray(node.prefixItems) || Array.isArray(node.items)) {\n return {\n kind: 'array',\n reasons: ctx.reasons,\n nullable: ctx.nullable,\n items: null,\n tuple: true,\n };\n }\n\n if (!Object.hasOwn(node, 'items') || node.items === undefined) {\n return {\n kind: 'array',\n reasons: ctx.reasons,\n nullable: ctx.nullable,\n items: makeUnsupported({ reasons: [], nullable: false }, 'untyped'),\n tuple: false,\n };\n }\n\n const walkedItem = walkNode(node.items, {\n root: ctx.root,\n depth: ctx.depth + 1,\n refStack: ctx.refStack,\n reasons: [],\n nullable: false,\n });\n return {\n kind: 'array',\n reasons: ctx.reasons,\n nullable: ctx.nullable,\n items: walkedItem,\n tuple: false,\n };\n}\n\n/** Resolves a walkable node's raw schema for `{ key }` primitive validation in `derivePlan`. */\nexport function isValidKeySchema(node: WalkedNode): boolean {\n if (node.kind !== 'leaf') return false;\n if (node.plan.nullable) return false;\n if (node.primitiveType === 'string' || node.primitiveType === 'integer') {\n return true;\n }\n if (node.resolvedSchema !== undefined) {\n return (\n Array.isArray(node.resolvedSchema.enum) ||\n (Object.hasOwn(node.resolvedSchema, 'const') &&\n node.resolvedSchema.const !== undefined)\n );\n }\n return false;\n}\n\n/** Collects flattened pointer paths under an object (used for validation and debugging). */\nexport function collectWalkedPaths(\n obj: WalkedObject,\n prefix = '',\n out: Map<string, WalkedNode> = new Map(),\n): Map<string, WalkedNode> {\n for (const [name, child] of obj.properties) {\n const path = appendPointer(prefix, name);\n out.set(path, child);\n if (child.kind === 'object') {\n collectWalkedPaths(child, path, out);\n }\n }\n return out;\n}\n","import { canonicalJson } from '../canonical/canonical-json.js';\nimport { sha256Hex } from '../canonical/sha256.js';\nimport { DissentArgumentError } from '../errors.js';\nimport { appendPointer, normalizePath } from '../paths.js';\n\nimport type {\n ComparatorOverride,\n CompareOverrides,\n FieldPlan,\n LeafPlan,\n NotComparedDetail,\n PlanReason,\n Severity,\n ToleranceSpec,\n} from '../types.js';\n\nimport { isPlainObject, ownValue, toSortedNullProtoRecord } from './util.js';\nimport {\n collectWalkedPaths,\n isValidKeySchema,\n walkSchema,\n type WalkedArray,\n type WalkedLeaf,\n type WalkedNode,\n type WalkedObject,\n type WalkedUnion,\n} from './walk-schema.js';\n\nexport type DerivedPlan = {\n fingerprint: string;\n fields: Record<string, FieldPlan>;\n};\n\nconst VALID_SEVERITIES = new Set<string>(['info', 'warn', 'critical']);\n\nfunction mergeReasons(base: PlanReason[], extra: PlanReason[]): PlanReason[] {\n const result: PlanReason[] = [];\n for (const r of base) {\n if (!result.includes(r)) result.push(r);\n }\n for (const r of extra) {\n if (!result.includes(r)) result.push(r);\n }\n return result;\n}\n\nfunction contextReasons(reasons: PlanReason[]): PlanReason[] {\n return reasons.filter(r => r === 'nullable-unwrap' || r === 'ref-resolved');\n}\n\nfunction nonePlan(opts: {\n reason: 'policy' | 'unsupported';\n detail: NotComparedDetail;\n reasons: PlanReason[];\n nullable: boolean;\n}): LeafPlan {\n return {\n comparator: 'none',\n reason: opts.reason,\n detail: opts.detail,\n reasons: mergeReasons(opts.reasons, [opts.reason]),\n nullable: opts.nullable,\n };\n}\n\nfunction callerNonePlan(\n baseReasons: PlanReason[],\n nullable: boolean,\n): LeafPlan {\n return {\n comparator: 'none',\n reason: 'policy',\n detail: 'caller-none',\n reasons: mergeReasons(baseReasons, ['caller-override', 'policy']),\n nullable,\n };\n}\n\nfunction validateSeverity(value: unknown, path: string): Severity {\n if (typeof value !== 'string' || !VALID_SEVERITIES.has(value)) {\n throw new DissentArgumentError(\n 'invalid-option',\n `compare.${path}`,\n `Invalid severity in override for \"${path}\"`,\n );\n }\n return value as Severity;\n}\n\nfunction checkToleranceBound(\n spec: Record<string, unknown>,\n field: 'absolute' | 'relative',\n path: string,\n): number | undefined {\n if (!Object.hasOwn(spec, field) || spec[field] === undefined) {\n return undefined;\n }\n const val = ownValue(spec, field);\n if (typeof val !== 'number' || !Number.isFinite(val) || val < 0) {\n throw new DissentArgumentError(\n 'invalid-tolerance',\n path,\n `Tolerance ${field} at \"${path}\" must be a finite number >= 0`,\n );\n }\n return val === 0 ? 0 : val;\n}\n\nfunction validateTolerance(spec: unknown, path: string): ToleranceSpec {\n if (!isPlainObject(spec)) {\n throw new DissentArgumentError(\n 'invalid-tolerance',\n path,\n `Tolerance for \"${path}\" must be a plain object`,\n );\n }\n for (const k of Object.keys(spec)) {\n if (k !== 'absolute' && k !== 'relative') {\n throw new DissentArgumentError(\n 'invalid-tolerance',\n path,\n `Unknown tolerance key \"${k}\" at \"${path}\"`,\n );\n }\n }\n\n const abs = checkToleranceBound(spec, 'absolute', path);\n const rel = checkToleranceBound(spec, 'relative', path);\n if (abs === undefined && rel === undefined) {\n throw new DissentArgumentError(\n 'invalid-tolerance',\n path,\n `Tolerance at \"${path}\" requires at least one of absolute or relative`,\n );\n }\n\n const out: ToleranceSpec = {};\n if (abs !== undefined) out.absolute = abs;\n if (rel !== undefined) out.relative = rel;\n return out;\n}\n\ntype NormalizedOverride =\n | { kind: 'exact'; onSplit?: Severity }\n | { kind: 'set'; onSplit?: Severity }\n | { kind: 'none' }\n | { kind: 'onSplit-only'; onSplit: Severity }\n | { kind: 'tolerance'; tolerance: unknown; onSplit?: Severity }\n | { kind: 'keyed-set'; key: unknown; onSplit?: Severity };\n\nfunction assertAllowedKeys(\n keys: readonly string[],\n allowed: ReadonlySet<string>,\n label: string,\n path: string,\n): void {\n for (const k of keys) {\n if (!allowed.has(k)) {\n throw new DissentArgumentError(\n 'incompatible-override',\n path,\n `Unexpected key \"${k}\" in ${label} override at \"${path}\"`,\n );\n }\n }\n}\n\nfunction optionalOnSplit(\n raw: Record<string, unknown>,\n path: string,\n): Severity | undefined {\n if (!Object.hasOwn(raw, 'onSplit') || raw.onSplit === undefined) {\n return undefined;\n }\n return validateSeverity(ownValue(raw, 'onSplit'), path);\n}\n\nfunction parseOverride(raw: unknown, path: string): NormalizedOverride {\n if (raw === 'exact' || raw === 'set' || raw === 'none') {\n return { kind: raw };\n }\n if (!isPlainObject(raw)) {\n throw new DissentArgumentError(\n 'invalid-option',\n `compare.${path}`,\n `Invalid override value at \"${path}\"`,\n );\n }\n\n const keys = Object.keys(raw);\n if (Object.hasOwn(raw, 'comparator')) {\n assertAllowedKeys(\n keys,\n new Set(['comparator', 'onSplit']),\n 'comparator',\n path,\n );\n const comp = ownValue(raw, 'comparator');\n if (comp === 'none') {\n if (Object.hasOwn(raw, 'onSplit') && raw.onSplit !== undefined) {\n throw new DissentArgumentError(\n 'incompatible-override',\n path,\n `Override \"none\" at \"${path}\" cannot specify onSplit`,\n );\n }\n return { kind: 'none' };\n }\n if (comp === 'exact' || comp === 'set') {\n const onSplit = optionalOnSplit(raw, path);\n return onSplit !== undefined ? { kind: comp, onSplit } : { kind: comp };\n }\n throw new DissentArgumentError(\n 'incompatible-override',\n path,\n `Unsupported comparator override \"${String(comp)}\" at \"${path}\"`,\n );\n }\n\n if (Object.hasOwn(raw, 'tolerance')) {\n assertAllowedKeys(\n keys,\n new Set(['tolerance', 'onSplit']),\n 'tolerance',\n path,\n );\n const onSplit = optionalOnSplit(raw, path);\n const tolerance = ownValue(raw, 'tolerance');\n return onSplit !== undefined\n ? { kind: 'tolerance', tolerance, onSplit }\n : { kind: 'tolerance', tolerance };\n }\n\n if (Object.hasOwn(raw, 'key')) {\n assertAllowedKeys(keys, new Set(['key', 'onSplit']), 'keyed-set', path);\n const onSplit = optionalOnSplit(raw, path);\n const key = ownValue(raw, 'key');\n return onSplit !== undefined\n ? { kind: 'keyed-set', key, onSplit }\n : { kind: 'keyed-set', key };\n }\n\n if (Object.hasOwn(raw, 'onSplit') && keys.length === 1) {\n return {\n kind: 'onSplit-only',\n onSplit: validateSeverity(ownValue(raw, 'onSplit'), path),\n };\n }\n\n throw new DissentArgumentError(\n 'invalid-option',\n `compare.${path}`,\n `Unrecognized override shape at \"${path}\"`,\n );\n}\n\nfunction getArrayPolicyOrUnsupportedDetail(\n items: WalkedNode | null,\n): { reason: 'policy' | 'unsupported'; detail: NotComparedDetail } | null {\n if (items === null) return { reason: 'unsupported', detail: 'tuple' };\n if (items.kind === 'array') {\n return { reason: 'unsupported', detail: 'nested-array' };\n }\n if (items.kind === 'object') {\n return { reason: 'unsupported', detail: 'object-array-requires-key' };\n }\n if (items.kind === 'discriminated-union') {\n return { reason: 'unsupported', detail: 'union' };\n }\n if (items.primitiveType === 'number') {\n return { reason: 'policy', detail: 'number-array' };\n }\n if (\n items.primitiveType === 'integer' ||\n items.primitiveType === 'boolean' ||\n items.primitiveType === 'string' ||\n items.isBooleanEnumConst\n ) {\n return null;\n }\n if (items.plan.comparator === 'none' && items.plan.reason === 'unsupported') {\n return { reason: 'unsupported', detail: items.plan.detail };\n }\n return { reason: 'unsupported', detail: 'untyped' };\n}\n\nfunction planDefaultArray(node: WalkedArray): LeafPlan {\n if (node.tuple) {\n return nonePlan({\n reason: 'unsupported',\n detail: 'tuple',\n reasons: node.reasons,\n nullable: node.nullable,\n });\n }\n\n const itemReasons =\n node.items?.kind === 'leaf'\n ? contextReasons(node.items.plan.reasons)\n : node.items !== null\n ? contextReasons(node.items.reasons)\n : [];\n const baseReasons = mergeReasons(node.reasons, itemReasons);\n\n const nonSet = getArrayPolicyOrUnsupportedDetail(node.items);\n if (nonSet !== null) {\n return nonePlan({\n reason: nonSet.reason,\n detail: nonSet.detail,\n reasons: baseReasons,\n nullable: node.nullable,\n });\n }\n\n return {\n comparator: 'set',\n onSplit: 'warn',\n reasons: mergeReasons(baseReasons, ['default-by-type']),\n nullable: node.nullable,\n };\n}\n\nfunction planNestedObjectLeaves(\n obj: WalkedObject,\n prefix: string,\n out: Array<[string, LeafPlan]>,\n excludeTopKey?: string,\n): void {\n if (obj.additionalProperties) {\n out.push([\n prefix,\n nonePlan({\n reason: 'unsupported',\n detail: 'additional-properties',\n reasons: obj.reasons,\n nullable: obj.nullable,\n }),\n ]);\n }\n\n for (const [propName, child] of obj.properties) {\n if (prefix === '' && propName === excludeTopKey) continue;\n const childPath = appendPointer(prefix, propName);\n if (child.kind === 'leaf') {\n out.push([childPath, child.plan]);\n } else if (child.kind === 'object') {\n planNestedObjectLeaves(child, childPath, out);\n } else if (child.kind === 'array') {\n out.push([childPath, planDefaultArray(child)]);\n } else {\n // D9: nested discriminated union inside keyed-set item or union branch\n out.push([\n childPath,\n nonePlan({\n reason: 'unsupported',\n detail: 'nested-composite',\n reasons: contextReasons(child.reasons),\n nullable: child.nullable,\n }),\n ]);\n }\n }\n}\n\nfunction planLeafWithOverride(\n leaf: WalkedLeaf,\n override: NormalizedOverride | undefined,\n path: string,\n): LeafPlan {\n if (override === undefined) return leaf.plan;\n const baseCtx = contextReasons(leaf.plan.reasons);\n\n switch (override.kind) {\n case 'exact':\n return {\n comparator: 'exact',\n onSplit:\n override.onSplit ?? (leaf.isBooleanEnumConst ? 'critical' : 'warn'),\n reasons: mergeReasons(baseCtx, ['caller-override']),\n nullable: leaf.plan.nullable,\n };\n case 'none':\n return callerNonePlan(baseCtx, leaf.plan.nullable);\n case 'tolerance': {\n if (leaf.primitiveType !== 'number' && leaf.primitiveType !== 'integer') {\n throw new DissentArgumentError(\n 'incompatible-override',\n path,\n `Tolerance override at \"${path}\" requires a number or integer schema`,\n );\n }\n return {\n comparator: 'tolerance',\n tolerance: validateTolerance(override.tolerance, path),\n onSplit: override.onSplit ?? 'warn',\n reasons: mergeReasons(baseCtx, ['caller-override']),\n nullable: leaf.plan.nullable,\n };\n }\n case 'onSplit-only': {\n if (leaf.plan.comparator === 'none') {\n throw new DissentArgumentError(\n 'incompatible-override',\n path,\n `Override { onSplit } at \"${path}\" requires a non-none default comparator`,\n );\n }\n return {\n ...leaf.plan,\n onSplit: override.onSplit,\n reasons: mergeReasons(leaf.plan.reasons, ['caller-override']),\n };\n }\n case 'set':\n case 'keyed-set':\n throw new DissentArgumentError(\n 'incompatible-override',\n path,\n `Override \"${override.kind}\" at \"${path}\" requires an array schema`,\n );\n }\n}\n\nfunction planArrayWithOverride(\n arr: WalkedArray,\n override: NormalizedOverride | undefined,\n path: string,\n): FieldPlan {\n if (override === undefined) return planDefaultArray(arr);\n const baseCtx = contextReasons(arr.reasons);\n\n switch (override.kind) {\n case 'exact':\n case 'set':\n return {\n comparator: override.kind,\n onSplit: override.onSplit ?? 'warn',\n reasons: mergeReasons(baseCtx, ['caller-override']),\n nullable: arr.nullable,\n };\n case 'none':\n return callerNonePlan(baseCtx, arr.nullable);\n case 'onSplit-only': {\n const def = planDefaultArray(arr);\n if (def.comparator === 'none') {\n throw new DissentArgumentError(\n 'incompatible-override',\n path,\n `Override { onSplit } at \"${path}\" requires a non-none default comparator`,\n );\n }\n return {\n ...def,\n onSplit: override.onSplit,\n reasons: mergeReasons(def.reasons, ['caller-override']),\n };\n }\n case 'keyed-set': {\n if (arr.tuple || arr.items === null || arr.items.kind !== 'object') {\n throw new DissentArgumentError(\n 'incompatible-override',\n path,\n `Keyed-set override at \"${path}\" requires an array of objects`,\n );\n }\n const key = override.key;\n if (typeof key !== 'string' || key.length === 0) {\n throw new DissentArgumentError(\n 'invalid-key',\n path,\n `Keyed-set override at \"${path}\" requires a non-empty string key`,\n );\n }\n const keyNode = arr.items.properties.get(key);\n if (\n keyNode === undefined ||\n !arr.items.required.has(key) ||\n !isValidKeySchema(keyNode)\n ) {\n throw new DissentArgumentError(\n 'invalid-key',\n path,\n `Key \"${key}\" at \"${path}\" must be a required non-nullable string, integer, enum, or const property`,\n );\n }\n const itemEntries: Array<[string, LeafPlan]> = [];\n planNestedObjectLeaves(arr.items, '', itemEntries, key);\n return {\n comparator: 'keyed-set',\n key,\n onSplit: override.onSplit ?? 'warn',\n itemFields: toSortedNullProtoRecord(itemEntries),\n reasons: mergeReasons(\n mergeReasons(baseCtx, contextReasons(arr.items.reasons)),\n ['caller-override'],\n ),\n nullable: arr.nullable,\n };\n }\n case 'tolerance':\n throw new DissentArgumentError(\n 'incompatible-override',\n path,\n `Tolerance override at \"${path}\" requires a number or integer schema`,\n );\n }\n}\n\nfunction planUnionWithOverride(\n union: WalkedUnion,\n override: NormalizedOverride | undefined,\n path: string,\n): FieldPlan {\n const baseCtx = contextReasons(union.reasons);\n\n if (override !== undefined) {\n if (override.kind === 'exact') {\n return {\n comparator: 'exact',\n onSplit: override.onSplit ?? 'warn',\n reasons: mergeReasons(baseCtx, ['caller-override']),\n nullable: union.nullable,\n };\n }\n if (override.kind === 'none') {\n return callerNonePlan(baseCtx, union.nullable);\n }\n if (override.kind !== 'onSplit-only') {\n throw new DissentArgumentError(\n 'incompatible-override',\n path,\n `Override \"${override.kind}\" is incompatible with discriminated union at \"${path}\"`,\n );\n }\n }\n\n const branchEntries: Array<[string, Record<string, LeafPlan>]> = [];\n for (const [canonKey, branch] of union.branches) {\n const leafEntries: Array<[string, LeafPlan]> = [];\n planNestedObjectLeaves(branch.object, '', leafEntries);\n branchEntries.push([canonKey, toSortedNullProtoRecord(leafEntries)]);\n }\n\n return {\n comparator: 'discriminated-union',\n discriminator: union.discriminator,\n onSplit: override?.kind === 'onSplit-only' ? override.onSplit : 'critical',\n branches: toSortedNullProtoRecord(branchEntries),\n reasons:\n override?.kind === 'onSplit-only'\n ? mergeReasons(union.reasons, ['caller-override'])\n : [...union.reasons],\n nullable: union.nullable,\n };\n}\n\nfunction assertNoNestedOverridesUnder(\n prefix: string,\n overrides: Map<string, NormalizedOverride>,\n): void {\n const slashPrefix = prefix === '' ? '/' : `${prefix}/`;\n for (const candidatePath of overrides.keys()) {\n if (candidatePath.startsWith(slashPrefix)) {\n throw new DissentArgumentError(\n 'incompatible-override',\n candidatePath,\n `Override at \"${candidatePath}\" conflicts with parent override at \"${prefix}\"`,\n );\n }\n }\n}\n\ntype PlanCtx = {\n overrides: Map<string, NormalizedOverride>;\n out: Array<[string, FieldPlan]>;\n};\n\nfunction walkPlanEntries(\n obj: WalkedObject,\n prefix: string,\n ctx: PlanCtx,\n): void {\n if (obj.additionalProperties) {\n ctx.out.push([\n prefix,\n nonePlan({\n reason: 'unsupported',\n detail: 'additional-properties',\n reasons: obj.reasons,\n nullable: obj.nullable,\n }),\n ]);\n }\n\n for (const [propName, child] of obj.properties) {\n const childPath = appendPointer(prefix, propName);\n const override = ctx.overrides.get(childPath);\n\n if (child.kind === 'leaf') {\n ctx.out.push([\n childPath,\n planLeafWithOverride(child, override, childPath),\n ]);\n } else if (child.kind === 'array') {\n ctx.out.push([\n childPath,\n planArrayWithOverride(child, override, childPath),\n ]);\n } else if (child.kind === 'discriminated-union') {\n ctx.out.push([\n childPath,\n planUnionWithOverride(child, override, childPath),\n ]);\n } else if (override === undefined) {\n walkPlanEntries(child, childPath, ctx);\n } else {\n const baseCtx = contextReasons(child.reasons);\n if (override.kind === 'exact') {\n assertNoNestedOverridesUnder(childPath, ctx.overrides);\n ctx.out.push([\n childPath,\n {\n comparator: 'exact',\n onSplit: override.onSplit ?? 'warn',\n reasons: mergeReasons(baseCtx, ['caller-override']),\n nullable: child.nullable,\n },\n ]);\n } else if (override.kind === 'none') {\n assertNoNestedOverridesUnder(childPath, ctx.overrides);\n ctx.out.push([childPath, callerNonePlan(baseCtx, child.nullable)]);\n } else {\n throw new DissentArgumentError(\n 'incompatible-override',\n childPath,\n `Override \"${override.kind}\" cannot apply to plain object at \"${childPath}\"`,\n );\n }\n }\n }\n}\n\n/**\n * Synchronous pure plan derivation returning sorted, null-prototype `fields`\n * keyed by RFC 6901 JSON Pointer.\n */\nexport function buildPlanFields<T = Record<string, unknown>>(\n rootSchema: unknown,\n compare?: CompareOverrides<T>,\n): Record<string, FieldPlan> {\n const root = walkSchema(rootSchema);\n const walkedPaths = collectWalkedPaths(root);\n const overrides = new Map<string, NormalizedOverride>();\n\n if (compare !== undefined) {\n if (!isPlainObject(compare)) {\n throw new DissentArgumentError(\n 'invalid-option',\n 'compare',\n 'compare must be a plain object',\n );\n }\n for (const rawKey of Object.keys(compare)) {\n const pointer = normalizePath(rawKey);\n if (overrides.has(pointer)) {\n throw new DissentArgumentError(\n 'invalid-option',\n `compare.${rawKey}`,\n `Duplicate compare path \"${pointer}\" from key \"${rawKey}\"`,\n );\n }\n if (!walkedPaths.has(pointer)) {\n throw new DissentArgumentError(\n 'unknown-compare-path',\n pointer,\n `Compare path \"${rawKey}\" (normalized \"${pointer}\") does not exist in schema`,\n );\n }\n const rawOverride = ownValue<ComparatorOverride>(compare, rawKey);\n if (rawOverride !== undefined) {\n overrides.set(pointer, parseOverride(rawOverride, pointer));\n }\n }\n }\n\n const out: Array<[string, FieldPlan]> = [];\n walkPlanEntries(root, '', { overrides, out });\n return toSortedNullProtoRecord(out);\n}\n\n/**\n * Derives the deterministic comparison plan and its `dissent-plan/1` fingerprint\n * from a resolved JSON Schema and optional caller comparator overrides.\n */\nexport async function derivePlan<T = Record<string, unknown>>(\n rootSchema: unknown,\n compare?: CompareOverrides<T>,\n): Promise<DerivedPlan> {\n const fields = buildPlanFields(rootSchema, compare);\n const fingerprint = await sha256Hex(\n canonicalJson({ protocol: 'dissent-plan/1', fields }),\n );\n return { fingerprint, fields };\n}\n","import { canonicalJson, compareUtf16 } from './canonical/canonical-json.js';\nimport { ownValue, sortWith } from './compare/util.js';\n\nimport type {\n Advisory,\n Coverage,\n FieldPlan,\n FieldResult,\n Finding,\n JSONValue,\n LeafPlan,\n Severity,\n} from './types.js';\n\nconst SEVERITY_RANK: Record<Severity, number> = {\n critical: 0,\n warn: 1,\n info: 2,\n};\n\nfunction compareOptionalString(\n a: string | undefined,\n b: string | undefined,\n): number {\n if (a === undefined && b === undefined) return 0;\n if (a === undefined) return -1;\n if (b === undefined) return 1;\n return compareUtf16(a, b);\n}\n\n/**\n * Compares two findings according to §9.1 canonical order:\n * severity (critical < warn < info), code, path (absent first),\n * canonicalJson(within ?? null), subpath (absent first), witnesses[0] (absent first).\n */\nexport function compareFindings<W extends string>(\n a: Finding<W>,\n b: Finding<W>,\n): number {\n const sevDiff = SEVERITY_RANK[a.severity] - SEVERITY_RANK[b.severity];\n if (sevDiff !== 0) return sevDiff;\n\n const codeDiff = compareUtf16(a.code, b.code);\n if (codeDiff !== 0) return codeDiff;\n\n const pathDiff = compareOptionalString(a.path, b.path);\n if (pathDiff !== 0) return pathDiff;\n\n const withinDiff = compareUtf16(\n canonicalJson(a.within ?? null),\n canonicalJson(b.within ?? null),\n );\n if (withinDiff !== 0) return withinDiff;\n\n const subpathDiff = compareOptionalString(a.subpath, b.subpath);\n if (subpathDiff !== 0) return subpathDiff;\n\n return compareOptionalString(a.witnesses?.[0], b.witnesses?.[0]);\n}\n\n/**\n * Returns a fresh array of findings sorted in canonical order (§9.1).\n */\nexport function sortFindings<W extends string>(\n findings: ReadonlyArray<Finding<W>>,\n): Finding<W>[] {\n return sortWith(findings, compareFindings);\n}\n\n/**\n * Derives the three-state advisory rollup from findings (§9.2).\n */\nexport function computeAdvisory<W extends string>(\n findings: ReadonlyArray<Finding<W>>,\n): Advisory {\n let hasWarn = false;\n for (const f of findings) {\n if (f.severity === 'critical') return 'review-required';\n if (f.severity === 'warn') hasWarn = true;\n }\n return hasWarn ? 'warnings' : 'clear';\n}\n\nexport type CollectComparisonFindingsParams<W extends string> = {\n answered: number;\n planFields: Record<string, FieldPlan>;\n fieldResults: Record<string, FieldResult<W>>;\n coverage: Coverage;\n strictCoverage?: boolean;\n};\n\nfunction pushNestedLeafFindings<W extends string>(\n findings: Finding<W>[],\n opts: {\n path: string;\n within: { key: JSONValue } | { branch: JSONValue };\n planMap: Record<string, LeafPlan>;\n fieldMap: Record<string, FieldResult<W>>;\n },\n): boolean {\n let anySplit = false;\n for (const subpath of Object.keys(opts.planMap)) {\n const subplan = ownValue<LeafPlan>(opts.planMap, subpath)!;\n const subres = ownValue<FieldResult<W>>(opts.fieldMap, subpath);\n if (subres === undefined) continue;\n\n if (subres.missing.length > 0 && subres.presented.length >= 1) {\n findings.push({\n code: 'field-partial',\n severity: 'warn',\n path: opts.path,\n within: opts.within,\n subpath,\n witnesses: [...subres.missing],\n });\n }\n if (subres.status === 'split' && subplan.comparator !== 'none') {\n anySplit = true;\n findings.push({\n code: 'field-split',\n severity: subplan.onSplit,\n path: opts.path,\n within: opts.within,\n subpath,\n witnesses: [...subres.presented],\n });\n }\n }\n return anySplit;\n}\n\n/**\n * Collects pure Layer B, schema, and coverage findings from comparison outputs.\n * When `answered < 2`, `insufficient-quorum` is emitted and field-level findings\n * (`field-split`, `field-partial`, `duplicate-key`) are suppressed while\n * `unsupported-schema` and `coverage-low` continue to be emitted (§9.1).\n */\nexport function collectComparisonFindings<W extends string>(\n params: CollectComparisonFindingsParams<W>,\n): Finding<W>[] {\n const {\n answered,\n planFields,\n fieldResults,\n coverage,\n strictCoverage = false,\n } = params;\n\n const findings: Finding<W>[] = [];\n\n if (answered < 2) {\n findings.push({\n code: 'insufficient-quorum',\n severity: 'critical',\n data: { answered },\n });\n }\n\n for (const path of Object.keys(planFields)) {\n const plan = ownValue<FieldPlan>(planFields, path)!;\n const res = ownValue<FieldResult<W>>(fieldResults, path);\n\n // Schema findings (unsupported-schema) are emitted regardless of quorum.\n if (plan.comparator === 'none' && plan.reason === 'unsupported') {\n findings.push({\n code: 'unsupported-schema',\n severity: 'warn',\n path,\n data: { detail: plan.detail },\n });\n } else if (plan.comparator === 'keyed-set') {\n for (const subpath of Object.keys(plan.itemFields)) {\n const subplan = ownValue<LeafPlan>(plan.itemFields, subpath)!;\n if (subplan.comparator === 'none' && subplan.reason === 'unsupported') {\n findings.push({\n code: 'unsupported-schema',\n severity: 'warn',\n path,\n subpath,\n data: { detail: subplan.detail },\n });\n }\n }\n } else if (plan.comparator === 'discriminated-union') {\n for (const branchKey of Object.keys(plan.branches)) {\n const branchValue = JSON.parse(branchKey) as JSONValue;\n const branchLeaves = ownValue<Record<string, LeafPlan>>(\n plan.branches,\n branchKey,\n )!;\n for (const subpath of Object.keys(branchLeaves)) {\n const subplan = ownValue<LeafPlan>(branchLeaves, subpath)!;\n if (\n subplan.comparator === 'none' &&\n subplan.reason === 'unsupported'\n ) {\n findings.push({\n code: 'unsupported-schema',\n severity: 'warn',\n path,\n within: { branch: branchValue },\n subpath,\n data: { detail: subplan.detail },\n });\n }\n }\n }\n }\n\n // Field-level findings are suppressed when quorum.answered < 2.\n if (answered < 2 || res === undefined) continue;\n\n if (res.missing.length > 0 && res.presented.length >= 1) {\n findings.push({\n code: 'field-partial',\n severity: 'warn',\n path,\n witnesses: [...res.missing],\n });\n }\n\n if (\n plan.comparator === 'keyed-set' &&\n res.comparator === 'none' &&\n res.reason === 'duplicate-key'\n ) {\n findings.push({\n code: 'duplicate-key',\n severity: 'warn',\n path,\n witnesses: [...(res.duplicateKeyWitnesses ?? [])],\n });\n continue;\n }\n\n if (plan.comparator === 'keyed-set' && res.comparator === 'keyed-set') {\n let anyItemSplit = false;\n for (const item of res.items) {\n if (\n pushNestedLeafFindings(findings, {\n path,\n within: { key: item.key },\n planMap: plan.itemFields,\n fieldMap: item.fields,\n })\n ) {\n anyItemSplit = true;\n }\n }\n const hasNullVsArraySplit =\n res.nulls.length > 0 && res.nulls.length < res.presented.length;\n const hasKeySetDiff =\n res.keys.intersection.length !== res.keys.union.length;\n if (\n res.presented.length >= 2 &&\n res.status === 'split' &&\n (hasNullVsArraySplit || hasKeySetDiff || !anyItemSplit)\n ) {\n findings.push({\n code: 'field-split',\n severity: plan.onSplit,\n path,\n witnesses: [...res.presented],\n });\n }\n continue;\n }\n\n if (\n plan.comparator === 'discriminated-union' &&\n res.comparator === 'discriminated-union'\n ) {\n if (res.choice.status === 'split') {\n findings.push({\n code: 'field-split',\n severity: plan.onSplit,\n path,\n witnesses: [...res.choice.presented],\n });\n }\n for (const branch of res.branches) {\n const branchPlan = ownValue<Record<string, LeafPlan>>(\n plan.branches,\n canonicalJson(branch.value),\n );\n if (branchPlan === undefined) continue;\n pushNestedLeafFindings(findings, {\n path,\n within: { branch: branch.value },\n planMap: branchPlan,\n fieldMap: branch.fields,\n });\n }\n continue;\n }\n\n if (res.status === 'split' && plan.comparator !== 'none') {\n findings.push({\n code: 'field-split',\n severity: plan.onSplit,\n path,\n witnesses: [...res.presented],\n });\n }\n }\n\n if (coverage.unsupported + coverage.failedAtRuntime > 0) {\n findings.push({\n code: 'coverage-low',\n severity: strictCoverage ? 'critical' : 'warn',\n data: {\n compared: coverage.compared,\n fields: coverage.fields,\n ratio: coverage.ratio,\n },\n });\n }\n\n return sortFindings(findings);\n}\n","// oxlint-disable-next-line no-control-regex -- ANSI CSI sanitization (§11.3 step 1)\nconst ANSI_CSI_RE = /\\u001b\\[[0-?]*[ -/]*[@-~]/g;\n// oxlint-disable-next-line no-control-regex -- ANSI OSC sanitization (§11.3 step 1)\nconst ANSI_OSC_RE = /\\u001b\\][^\\u0007\\u001b]*(?:\\u0007|\\u001b\\\\)/g;\n// oxlint-disable-next-line no-control-regex -- ANSI two-byte ESC sanitization (§11.3 step 1)\nconst ANSI_OTHER_RE = /\\u001b[\\s\\S]?/g;\n// Removes C0 controls except \\t (0x09) and \\n (0x0a), DEL (0x7f), C1 (0x80-0x9f),\n// BiDi controls, and zero-width / format characters (§11.3 step 1).\nconst UNSAFE_CONTROLS_RE =\n // oxlint-disable-next-line no-control-regex -- intentional control/BiDi character strip (§11.3 step 1)\n /[\\u0000-\\u0008\\u000b-\\u001f\\u007f-\\u009f\\u061c\\u200b-\\u200f\\u202a-\\u202e\\u2060\\u2066-\\u2069\\ufeff]/g;\n\nconst REDACT_BEARER_RE = /Bearer\\s+[A-Za-z0-9._~+/=-]+/gi;\nconst REDACT_PREFIX_KEY_RE = /\\b(?:sk|pk|rk|sess)-[A-Za-z0-9_-]{16,}/gi;\nconst REDACT_GOOGLE_KEY_RE = /\\bAIza[0-9A-Za-z_-]{35}\\b/gi;\nconst REDACT_KV_RE =\n /\\b(api[_-]?key|x-api-key|authorization|token|secret|password)\\b([\"']?\\s*[:=]\\s*[\"']?)[^\\s\"',;&]+/gi;\nconst REDACT_QUERY_RE =\n /([?&](?:key|api_key|apikey|token|access_token)=)[^&\\s\"']+/gi;\n\n/** Strips ANSI CSI/OSC/ESC sequences and unsafe control/BiDi characters (§11.3 step 1). */\nexport function sanitizeControlChars(text: string): string {\n return text\n .replace(ANSI_CSI_RE, '')\n .replace(ANSI_OSC_RE, '')\n .replace(ANSI_OTHER_RE, '')\n .replace(UNSAFE_CONTROLS_RE, '');\n}\n\n/** Strips unsafe controls and collapses newlines/tabs into single spaces for inline slots (§11.3 steps 1–2). */\nexport function sanitizeInline(text: string): string {\n return sanitizeControlChars(text).replaceAll(/\\r?\\n|\\r|\\t/g, ' ');\n}\n\n/** Applies the §12.3 best-effort secret redaction patterns in order. */\nexport function redactSecrets(text: string): string {\n return text\n .replace(REDACT_BEARER_RE, 'Bearer [REDACTED]')\n .replace(REDACT_PREFIX_KEY_RE, '[REDACTED]')\n .replace(REDACT_GOOGLE_KEY_RE, '[REDACTED]')\n .replace(\n REDACT_KV_RE,\n (_m, k: string, sep: string) => `${k}${sep}[REDACTED]`,\n )\n .replace(REDACT_QUERY_RE, (_m, prefix: string) => `${prefix}[REDACTED]`);\n}\n","import { canonicalJson, compareUtf16 } from '../canonical/canonical-json.js';\nimport { isPlainObject, ownValue } from '../compare/util.js';\nimport { redactSecrets, sanitizeControlChars } from '../sanitize.js';\n\nimport type { JSONValue } from '../types.js';\n\nexport { redactSecrets, sanitizeControlChars };\n\nconst encoder = new TextEncoder();\n\nconst MAX_WARNINGS_PER_WITNESS = 16;\n\n/** Returns UTF-8 byte length of a string. */\nexport function utf8ByteLength(text: string): number {\n return encoder.encode(text).byteLength;\n}\n\n/**\n * Truncates `text` to at most `maxBytes` UTF-8 bytes without splitting code points\n * and without appending an ellipsis (§12.4).\n */\nexport function truncateUtf8Bytes(\n text: string,\n maxBytes: number,\n): { text: string; truncated: boolean } {\n if (utf8ByteLength(text) <= maxBytes) {\n return { text, truncated: false };\n }\n let used = 0;\n let end = 0;\n for (const cp of text) {\n const len = encoder.encode(cp).byteLength;\n if (used + len > maxBytes) break;\n used += len;\n end += cp.length;\n }\n return { text: text.slice(0, end), truncated: true };\n}\n\n/** Sanitizes, redacts, and caps error text (`message` or `rawText`) per §12.3–§12.4. */\nexport function sanitizeErrorText(\n text: string,\n maxBytes: number,\n): { text: string; truncated: boolean } {\n return truncateUtf8Bytes(redactSecrets(sanitizeControlChars(text)), maxBytes);\n}\n\nfunction toSanitizedJson(\n value: unknown,\n depth: number,\n stack: WeakSet<object>,\n): JSONValue {\n if (value === null || typeof value === 'boolean') return value;\n if (typeof value === 'string') {\n return redactSecrets(sanitizeControlChars(value));\n }\n if (typeof value === 'number') {\n return Number.isFinite(value) ? value : String(value);\n }\n if (typeof value !== 'object') {\n return redactSecrets(sanitizeControlChars(String(value)));\n }\n if (depth >= 16 || stack.has(value)) {\n return '[truncated]';\n }\n stack.add(value);\n try {\n if (Array.isArray(value)) {\n const arr: JSONValue[] = [];\n for (const item of value) {\n arr.push(toSanitizedJson(item, depth + 1, stack));\n }\n return arr;\n }\n if (!isPlainObject(value)) {\n return redactSecrets(sanitizeControlChars(String(value)));\n }\n const keys = Object.keys(value).slice();\n // oxlint-disable-next-line unicorn/no-array-sort -- fresh keys copy; compareUtf16 keeps deterministic order.\n keys.sort(compareUtf16);\n const out = Object.create(null) as Record<string, JSONValue>;\n for (const key of keys) {\n const member = ownValue(value, key);\n if (member === undefined) continue;\n const cleanKey = redactSecrets(sanitizeControlChars(key));\n Object.defineProperty(out, cleanKey, {\n value: toSanitizedJson(member, depth + 1, stack),\n enumerable: true,\n writable: true,\n configurable: true,\n });\n }\n return out;\n } finally {\n stack.delete(value);\n }\n}\n\n/**\n * Normalizes SDK warnings to at most 16 canonical-JSON-safe, sanitized entries,\n * each capped at `maxErrorTextBytes` when serialized (§2.4, §12.4).\n */\nexport function sanitizeWarnings(\n warnings: unknown,\n maxErrorTextBytes: number,\n): JSONValue[] {\n if (!Array.isArray(warnings) || warnings.length === 0) return [];\n const capped = warnings.slice(0, MAX_WARNINGS_PER_WITNESS);\n const out: JSONValue[] = [];\n for (const entry of capped) {\n const clean = toSanitizedJson(entry, 0, new WeakSet<object>());\n const serialized = canonicalJson(clean);\n if (utf8ByteLength(serialized) <= maxErrorTextBytes) {\n out.push(clean);\n continue;\n }\n const wrapperOverhead = utf8ByteLength('{\"truncated\":\"\"}');\n const budget = Math.max(0, maxErrorTextBytes - wrapperOverhead);\n // Account for JSON escaping inflation conservatively if quotes/backslashes exist.\n let { text } = truncateUtf8Bytes(serialized, budget);\n while (\n utf8ByteLength(canonicalJson({ truncated: text })) > maxErrorTextBytes &&\n text.length > 0\n ) {\n text = text.slice(0, Math.floor(text.length * 0.8));\n }\n out.push({ truncated: text });\n }\n return out;\n}\n","import {\n AISDKError,\n APICallError,\n LoadAPIKeyError,\n NoObjectGeneratedError,\n NoOutputGeneratedError,\n RetryError,\n} from 'ai';\n\nimport { NonJsonValueError } from '../errors.js';\nimport { sanitizeControlChars, sanitizeErrorText } from './redact.js';\n\nimport type { FinishReason, LanguageModelUsage } from 'ai';\n\nimport type { WitnessError, WitnessUsage } from '../types.js';\n\nconst TIMEOUT_NAMES = new Set(['TimeoutError']);\nconst ABORT_NAMES = new Set(['AbortError', 'ResponseAborted']);\nconst GATEWAY_ERROR_MARKER = Symbol.for('vercel.ai.gateway.error');\nconst MAX_CAUSE_DEPTH = 4;\n\ntype ApiLikeError = {\n statusCode?: unknown;\n isRetryable?: unknown;\n};\n\nfunction isGatewayError(error: unknown): error is ApiLikeError {\n return (\n typeof error === 'object' &&\n error !== null &&\n (error as Record<symbol, unknown>)[GATEWAY_ERROR_MARKER] === true\n );\n}\n\nfunction isWrappedGatewayAuthError(error: unknown): boolean {\n if (typeof error !== 'object' || error === null) return false;\n if (GATEWAY_ERROR_MARKER in error) return false;\n if (AISDKError.isInstance(error) && error.name === 'GatewayError') {\n return true;\n }\n return error instanceof Error && error.name === 'GatewayAuthenticationError';\n}\n\nfunction asApiLikeError(error: unknown): ApiLikeError | undefined {\n if (APICallError.isInstance(error) || isGatewayError(error)) {\n return error;\n }\n return undefined;\n}\n\n/** Internal guard error when canonical witness output exceeds `maxOutputBytes`. */\nexport class OutputTooLargeError extends Error {\n readonly bytes: number;\n readonly maxBytes: number;\n\n constructor(bytes: number, maxBytes: number) {\n super(\n `Witness output is ${bytes} UTF-8 bytes, exceeding maxOutputBytes (${maxBytes})`,\n );\n this.name = 'OutputTooLarge';\n this.bytes = bytes;\n this.maxBytes = maxBytes;\n }\n}\n\nexport type PartialResultContext = {\n finishReason?: FinishReason;\n usage?: LanguageModelUsage;\n};\n\nfunction readErrorName(error: unknown): string | undefined {\n if (typeof error !== 'object' || error === null) return undefined;\n const candidate = (error as { name?: unknown }).name;\n return typeof candidate === 'string' && candidate.length > 0\n ? candidate\n : undefined;\n}\n\nfunction readErrorMessage(error: unknown): string {\n if (typeof error === 'string') return error;\n if (typeof error === 'object' && error !== null) {\n const candidate = (error as { message?: unknown }).message;\n if (typeof candidate === 'string') return candidate;\n }\n try {\n return String(error);\n } catch {\n return 'Unprintable error';\n }\n}\n\nfunction matchesCauseChain(\n start: unknown,\n names: ReadonlySet<string>,\n visited: WeakSet<object>,\n): boolean {\n let current: unknown = start;\n for (let depth = 0; depth <= MAX_CAUSE_DEPTH; depth++) {\n if (typeof current !== 'object' || current === null) return false;\n if (visited.has(current)) return false;\n visited.add(current);\n const errName = readErrorName(current);\n if (errName !== undefined && names.has(errName)) return true;\n current = (current as { cause?: unknown }).cause;\n }\n return false;\n}\n\nfunction matchesErrorNames(\n error: unknown,\n names: ReadonlySet<string>,\n): boolean {\n const visited = new WeakSet<object>();\n if (matchesCauseChain(error, names, visited)) return true;\n if (RetryError.isInstance(error) && error.lastError !== undefined) {\n return matchesCauseChain(error.lastError, names, visited);\n }\n return false;\n}\n\nfunction formatName(error: unknown, maxBytes: number): string {\n const raw = readErrorName(error) ?? typeof error;\n return sanitizeErrorText(raw, maxBytes).text || typeof error;\n}\n\nfunction numOrNull(value: unknown): number | null {\n return typeof value === 'number' && Number.isFinite(value) ? value : null;\n}\n\n/** Maps AI SDK `LanguageModelUsage` into JSON-safe `WitnessUsage`. */\nexport function mapUsage(\n usage: LanguageModelUsage | undefined | null,\n): WitnessUsage | null {\n if (usage === undefined || usage === null) return null;\n return {\n inputTokens: numOrNull(usage.inputTokens),\n outputTokens: numOrNull(usage.outputTokens),\n totalTokens: numOrNull(usage.totalTokens),\n cacheReadTokens: numOrNull(usage.inputTokenDetails?.cacheReadTokens),\n cacheWriteTokens: numOrNull(usage.inputTokenDetails?.cacheWriteTokens),\n reasoningTokens: numOrNull(usage.outputTokenDetails?.reasoningTokens),\n };\n}\n\n/**\n * Classifies a thrown witness error per §7 rows 1–9 (row 0 caller abort is handled before calling).\n */\nexport function classifyWitnessError(\n error: unknown,\n context: PartialResultContext | undefined,\n maxErrorTextBytes: number,\n): WitnessError {\n const msg = sanitizeErrorText(readErrorMessage(error), maxErrorTextBytes);\n\n // Row 1: timeout\n if (matchesErrorNames(error, TIMEOUT_NAMES)) {\n return {\n kind: 'timeout',\n name: formatName(error, maxErrorTextBytes),\n message: msg.text,\n messageTruncated: msg.truncated,\n };\n }\n\n // Row 2: non-caller abort\n if (matchesErrorNames(error, ABORT_NAMES)) {\n return {\n kind: 'aborted',\n name: formatName(error, maxErrorTextBytes),\n message: msg.text,\n messageTruncated: msg.truncated,\n };\n }\n\n // Rows 3–5: NoObjectGeneratedError / NoOutputGeneratedError\n if (\n NoObjectGeneratedError.isInstance(error) ||\n NoOutputGeneratedError.isInstance(error)\n ) {\n const fr = NoObjectGeneratedError.isInstance(error)\n ? (error.finishReason ?? context?.finishReason)\n : context?.finishReason;\n\n const kind =\n fr === 'length'\n ? 'truncated'\n : fr === 'content-filter'\n ? 'refused'\n : 'invalid-output';\n\n const out: WitnessError = {\n kind,\n name: formatName(error, maxErrorTextBytes),\n message: msg.text,\n messageTruncated: msg.truncated,\n };\n if (fr !== undefined) {\n out.finishReason = fr;\n }\n if (\n NoObjectGeneratedError.isInstance(error) &&\n typeof error.text === 'string' &&\n error.text.length > 0\n ) {\n const raw = sanitizeErrorText(error.text, maxErrorTextBytes);\n out.rawText = raw.text;\n out.rawTextTruncated = raw.truncated;\n }\n return out;\n }\n\n // Row 6: NonJsonValueError\n if (NonJsonValueError.isInstance(error)) {\n return {\n kind: 'invalid-output',\n name: 'NonJsonValue',\n message: msg.text,\n messageTruncated: msg.truncated,\n path: sanitizeControlChars(error.path),\n };\n }\n\n // Row 7: OutputTooLargeError\n if (error instanceof OutputTooLargeError) {\n return {\n kind: 'invalid-output',\n name: 'OutputTooLarge',\n message: msg.text,\n messageTruncated: msg.truncated,\n };\n }\n\n // Row 8: APICallError / LoadAPIKeyError / RetryError / GatewayError / wrapped Gateway auth\n if (\n APICallError.isInstance(error) ||\n LoadAPIKeyError.isInstance(error) ||\n RetryError.isInstance(error) ||\n isGatewayError(error) ||\n isWrappedGatewayAuthError(error)\n ) {\n const apiErr =\n asApiLikeError(error) ??\n (RetryError.isInstance(error)\n ? asApiLikeError(error.lastError)\n : undefined);\n\n const out: WitnessError = {\n kind: 'api-error',\n name: formatName(error, maxErrorTextBytes),\n message: msg.text,\n messageTruncated: msg.truncated,\n };\n if (apiErr !== undefined) {\n if (\n typeof apiErr.statusCode === 'number' &&\n Number.isFinite(apiErr.statusCode)\n ) {\n out.statusCode = apiErr.statusCode;\n }\n out.isRetryable = Boolean(apiErr.isRetryable);\n }\n return out;\n }\n\n // Row 9: unknown\n return {\n kind: 'unknown',\n name: formatName(error, maxErrorTextBytes),\n message: msg.text,\n messageTruncated: msg.truncated,\n };\n}\n","import {\n isPlainObject,\n ownValue,\n sortLabels,\n sortWith,\n} from '../compare/util.js';\nimport { compareUtf16 } from '../canonical/canonical-json.js';\nimport { DissentArgumentError } from '../errors.js';\n\nimport type { LanguageModel } from 'ai';\n\nimport type {\n CorroborateOptions,\n ModelIdentity,\n WitnessEntry,\n WitnessSettings,\n} from '../types.js';\n\nconst LABEL_RE = /^[A-Za-z0-9][A-Za-z0-9._-]{0,63}$/;\nconst RESERVED_LABELS = new Set([\n '__proto__',\n 'constructor',\n 'prototype',\n 'hasownproperty',\n 'tostring',\n 'valueof',\n]);\n\nexport const DEFAULT_MAX_CONCURRENCY = 8;\nexport const DEFAULT_MAX_OUTPUT_BYTES = 1_048_576;\nexport const DEFAULT_MAX_ERROR_TEXT_BYTES = 2048;\n\nexport type NormalizedWitness<W extends string> = {\n label: W;\n model: LanguageModel;\n settings: WitnessSettings | undefined;\n requested: ModelIdentity;\n};\n\nexport type NormalizedOptions<W extends string> = {\n witnesses: NormalizedWitness<W>[];\n authorModels: string[];\n excludeAuthor: boolean;\n lineEndings: 'normalize-for-hash' | 'preserve';\n includeInput: 'hash' | 'full';\n strictCoverage: boolean;\n maxConcurrency: number;\n maxOutputBytes: number;\n maxErrorTextBytes: number;\n};\n\nfunction isWitnessWrapper(\n entry: unknown,\n): entry is { model: LanguageModel; settings?: WitnessSettings } {\n return (\n typeof entry === 'object' &&\n entry !== null &&\n !Array.isArray(entry) &&\n Object.hasOwn(entry, 'model') &&\n !Object.hasOwn(entry, 'specificationVersion')\n );\n}\n\nfunction isValidLanguageModel(model: unknown): model is LanguageModel {\n if (typeof model === 'string') {\n return model.trim().length > 0;\n }\n if (typeof model !== 'object' || model === null || Array.isArray(model)) {\n return false;\n }\n const m = model as Record<string, unknown>;\n return (\n typeof m.specificationVersion === 'string' &&\n typeof m.provider === 'string' &&\n typeof m.modelId === 'string' &&\n m.modelId.length > 0\n );\n}\n\nfunction isGatewayProvider(provider: string): boolean {\n return (\n provider === 'gateway' ||\n provider === 'gateway-string' ||\n provider.startsWith('gateway.')\n );\n}\n\nexport function hasNonEmptySlashParts(id: string): boolean {\n const slash = id.indexOf('/');\n return slash > 0 && slash < id.length - 1;\n}\n\n/**\n * Computes the requested `ModelIdentity` for a model string or instance (§8.1–§8.2).\n */\nexport function toRequestedIdentity(model: LanguageModel): ModelIdentity {\n const provider =\n typeof model === 'string' ? 'gateway-string' : model.provider;\n const modelId = typeof model === 'string' ? model : model.modelId;\n\n if (isGatewayProvider(provider) && hasNonEmptySlashParts(modelId)) {\n const canonicalId = modelId.toLowerCase();\n const slash = canonicalId.indexOf('/');\n return {\n provider,\n modelId,\n canonicalId,\n providerKey: canonicalId.slice(0, slash),\n };\n }\n if (provider === 'gateway-string') {\n return {\n provider,\n modelId,\n canonicalId: modelId.toLowerCase(),\n providerKey: '(default)',\n };\n }\n const providerPrefix = provider.split('.')[0] || '(default)';\n const canonicalId = `${providerPrefix}/${modelId}`.toLowerCase();\n const slash = canonicalId.indexOf('/');\n return {\n provider,\n modelId,\n canonicalId,\n providerKey: canonicalId.slice(0, slash),\n };\n}\n\n/**\n * Computes the served `ModelIdentity` from `finalStep.response.modelId` (§8.2).\n */\nexport function toServedIdentity(\n requested: ModelIdentity,\n servedModelId: string | undefined | null,\n): ModelIdentity | null {\n if (typeof servedModelId !== 'string' || servedModelId.length === 0) {\n return null;\n }\n if (\n isGatewayProvider(requested.provider) &&\n hasNonEmptySlashParts(servedModelId)\n ) {\n const canonicalId = servedModelId.toLowerCase();\n const providerKey = canonicalId.slice(0, canonicalId.indexOf('/'));\n return {\n provider: providerKey,\n modelId: servedModelId,\n canonicalId,\n providerKey,\n };\n }\n const canonicalId = `${requested.providerKey}/${servedModelId}`.toLowerCase();\n return {\n provider: requested.providerKey,\n modelId: servedModelId,\n canonicalId,\n providerKey: requested.providerKey,\n };\n}\n\nfunction normalizeAuthorModels(raw: readonly string[]): string[] {\n const normalized: string[] = [];\n for (let i = 0; i < raw.length; i++) {\n const entry = raw[i];\n if (typeof entry !== 'string') {\n throw new DissentArgumentError(\n 'invalid-author-model',\n `provenance.authorModels[${i}]`,\n );\n }\n const trimmed = entry.trim().toLowerCase();\n const parts = trimmed.split('/');\n if (\n parts.length !== 2 ||\n parts[0]!.length === 0 ||\n parts[1]!.length === 0\n ) {\n throw new DissentArgumentError(\n 'invalid-author-model',\n `provenance.authorModels[${i}]`,\n `Invalid authorModel \"${entry}\": expected \"provider/modelId\".`,\n );\n }\n normalized.push(trimmed);\n }\n return sortWith(normalized, compareUtf16);\n}\n\nfunction isAbortSignalLike(signal: unknown): signal is AbortSignal {\n if (typeof signal !== 'object' || signal === null) return false;\n const s = signal as Record<string, unknown>;\n return (\n typeof s.aborted === 'boolean' &&\n typeof s.addEventListener === 'function' &&\n typeof s.removeEventListener === 'function'\n );\n}\n\nfunction validateIntegerRange(\n value: number | undefined,\n defaultValue: number,\n min: number,\n max: number,\n argument: string,\n): number {\n if (value === undefined) return defaultValue;\n if (!Number.isInteger(value) || value < min || value > max) {\n throw new DissentArgumentError(\n 'invalid-option',\n argument,\n `${argument} must be an integer between ${min} and ${max}.`,\n );\n }\n return value;\n}\n\n/**\n * Validates and normalizes `corroborate` options synchronously before any model call (§2.2.1 step 1).\n */\nexport function normalizeAndValidateOptions<T, W extends string>(\n options: CorroborateOptions<T, W>,\n): NormalizedOptions<W> {\n if (\n typeof options !== 'object' ||\n options === null ||\n Array.isArray(options)\n ) {\n throw new DissentArgumentError('invalid-option', 'options');\n }\n\n const rawWitnesses = options.witnesses as unknown;\n if (\n typeof rawWitnesses !== 'object' ||\n rawWitnesses === null ||\n Array.isArray(rawWitnesses)\n ) {\n throw new DissentArgumentError('invalid-option', 'witnesses');\n }\n\n const rawKeys = Object.keys(rawWitnesses) as W[];\n for (const label of rawKeys) {\n if (RESERVED_LABELS.has(label.toLowerCase())) {\n throw new DissentArgumentError('reserved-label', `witnesses.${label}`);\n }\n if (!LABEL_RE.test(label)) {\n throw new DissentArgumentError('invalid-label', `witnesses.${label}`);\n }\n }\n if (rawKeys.length < 2) {\n throw new DissentArgumentError('too-few-witnesses', 'witnesses');\n }\n if (rawKeys.length > 16) {\n throw new DissentArgumentError('too-many-witnesses', 'witnesses');\n }\n\n const sortedLabels = sortLabels(rawKeys);\n const witnesses: NormalizedWitness<W>[] = [];\n for (const label of sortedLabels) {\n const entry = ownValue<WitnessEntry>(rawWitnesses, label);\n let model: unknown;\n let settings: WitnessSettings | undefined;\n if (isWitnessWrapper(entry)) {\n model = entry.model;\n const rawSettings = ownValue<unknown>(entry, 'settings');\n if (rawSettings !== undefined) {\n if (!isPlainObject(rawSettings)) {\n throw new DissentArgumentError(\n 'invalid-witness-entry',\n `witnesses.${label}.settings`,\n );\n }\n settings = rawSettings as WitnessSettings;\n }\n } else {\n model = entry;\n }\n\n if (!isValidLanguageModel(model)) {\n throw new DissentArgumentError(\n 'invalid-witness-entry',\n `witnesses.${label}`,\n );\n }\n witnesses.push({\n label,\n model,\n settings,\n requested: toRequestedIdentity(model),\n });\n }\n\n const hasPrompt = options.prompt !== undefined;\n const hasMessages = options.messages !== undefined;\n if (hasPrompt && hasMessages) {\n throw new DissentArgumentError('prompt-and-messages', 'prompt');\n }\n if (!hasPrompt && !hasMessages) {\n throw new DissentArgumentError('no-input', 'prompt');\n }\n\n const rawSchema = options.schema as unknown;\n if (\n rawSchema === null ||\n rawSchema === undefined ||\n (typeof rawSchema !== 'object' && typeof rawSchema !== 'function')\n ) {\n throw new DissentArgumentError('invalid-option', 'schema');\n }\n\n let authorModels: string[] = [];\n let excludeAuthor = false;\n if (options.provenance !== undefined) {\n const prov = options.provenance as unknown;\n if (!isPlainObject(prov) || !Array.isArray(prov.authorModels)) {\n throw new DissentArgumentError('invalid-option', 'provenance');\n }\n authorModels = normalizeAuthorModels(\n prov.authorModels as readonly string[],\n );\n if (\n prov.excludeAuthor !== undefined &&\n typeof prov.excludeAuthor !== 'boolean'\n ) {\n throw new DissentArgumentError(\n 'invalid-option',\n 'provenance.excludeAuthor',\n );\n }\n excludeAuthor = prov.excludeAuthor === true;\n if (excludeAuthor && authorModels.length === 0) {\n throw new DissentArgumentError(\n 'exclude-without-authors',\n 'provenance.excludeAuthor',\n );\n }\n }\n\n const lineEndings = options.lineEndings ?? 'normalize-for-hash';\n if (lineEndings !== 'normalize-for-hash' && lineEndings !== 'preserve') {\n throw new DissentArgumentError('invalid-option', 'lineEndings');\n }\n\n const includeInput = options.includeInput ?? 'hash';\n if (includeInput !== 'hash' && includeInput !== 'full') {\n throw new DissentArgumentError('invalid-option', 'includeInput');\n }\n\n if (\n options.strictCoverage !== undefined &&\n typeof options.strictCoverage !== 'boolean'\n ) {\n throw new DissentArgumentError('invalid-option', 'strictCoverage');\n }\n\n if (\n options.onWitness !== undefined &&\n typeof options.onWitness !== 'function'\n ) {\n throw new DissentArgumentError('invalid-option', 'onWitness');\n }\n\n if (\n options.abortSignal !== undefined &&\n !isAbortSignalLike(options.abortSignal)\n ) {\n throw new DissentArgumentError('invalid-option', 'abortSignal');\n }\n\n const maxConcurrency = validateIntegerRange(\n options.maxConcurrency,\n DEFAULT_MAX_CONCURRENCY,\n 1,\n 16,\n 'maxConcurrency',\n );\n const maxOutputBytes = validateIntegerRange(\n options.maxOutputBytes,\n DEFAULT_MAX_OUTPUT_BYTES,\n 1024,\n 67_108_864,\n 'maxOutputBytes',\n );\n const maxErrorTextBytes = validateIntegerRange(\n options.maxErrorTextBytes,\n DEFAULT_MAX_ERROR_TEXT_BYTES,\n 256,\n 65_536,\n 'maxErrorTextBytes',\n );\n\n return {\n witnesses,\n authorModels,\n excludeAuthor,\n lineEndings,\n includeInput,\n strictCoverage: options.strictCoverage === true,\n maxConcurrency,\n maxOutputBytes,\n maxErrorTextBytes,\n };\n}\n","import { compareUtf16 } from '../canonical/canonical-json.js';\nimport { sortWith } from '../compare/util.js';\nimport { hasNonEmptySlashParts } from './normalize-witnesses.js';\n\nimport type {\n Finding,\n Independence,\n ModelIdentity,\n WitnessRecord,\n} from '../types.js';\n\nexport type AuthorMatch = {\n authorModel: string;\n on: 'requested' | 'served';\n};\n\nfunction identityMatchesAuthor(\n identity: ModelIdentity,\n authorModel: string,\n): boolean {\n if (identity.canonicalId === authorModel) {\n return true;\n }\n return (\n hasNonEmptySlashParts(identity.modelId) &&\n identity.modelId.toLowerCase() === authorModel\n );\n}\n\n/**\n * Matches a witness against sorted normalized `authorModels` (§8.2).\n * `requested` takes priority over `served`; earliest UTF-16 author model wins ties.\n */\nexport function matchAuthorModel(\n requested: ModelIdentity,\n served: ModelIdentity | null,\n sortedAuthorModels: readonly string[],\n): AuthorMatch | null {\n for (const authorModel of sortedAuthorModels) {\n if (identityMatchesAuthor(requested, authorModel)) {\n return { authorModel, on: 'requested' };\n }\n }\n if (served !== null) {\n for (const authorModel of sortedAuthorModels) {\n if (identityMatchesAuthor(served, authorModel)) {\n return { authorModel, on: 'served' };\n }\n }\n }\n return null;\n}\n\n/**\n * Computes the §8.4 `Independence` block and the Layer A witness/independence findings (§9.1).\n * Expects `entries` ordered by UTF-16 sorted label.\n */\nexport function analyzeIndependence<T, W extends string>(\n entries: ReadonlyArray<{ label: W; record: WitnessRecord<T> }>,\n sortedAuthorModels: readonly string[],\n): {\n independence: Independence<W>;\n witnessFindings: Finding<W>[];\n} {\n const providerGroups = new Map<string, W[]>();\n const servedGroups = new Map<string, W[]>();\n const selfGradingWitnesses: Independence<W>['selfGradingWitnesses'] = [];\n const excludedWitnesses: Independence<W>['excludedWitnesses'] = [];\n const witnessFindings: Finding<W>[] = [];\n\n let asked = 0;\n\n for (const { label, record } of entries) {\n const excludedBefore =\n record.status === 'excluded' && record.stage === 'before-dispatch';\n\n if (!excludedBefore) {\n asked++;\n const pk = record.requested.providerKey;\n const group = providerGroups.get(pk);\n if (group === undefined) {\n providerGroups.set(pk, [label]);\n } else {\n group.push(label);\n }\n }\n\n if (record.status === 'answered' && record.served !== null) {\n const cid = record.served.canonicalId;\n const group = servedGroups.get(cid);\n if (group === undefined) {\n servedGroups.set(cid, [label]);\n } else {\n group.push(label);\n }\n }\n\n const servedForMatch =\n record.status === 'excluded' && record.stage === 'before-dispatch'\n ? null\n : record.served;\n const match = matchAuthorModel(\n record.requested,\n servedForMatch,\n sortedAuthorModels,\n );\n if (match !== null) {\n selfGradingWitnesses.push({\n witness: label,\n authorModel: match.authorModel,\n on: match.on,\n });\n if (record.status === 'answered') {\n witnessFindings.push({\n code: 'self-grading',\n severity: 'warn',\n witnesses: [label],\n data: { authorModel: match.authorModel, on: match.on },\n });\n }\n }\n\n if (record.status === 'excluded') {\n excludedWitnesses.push({\n witness: label,\n stage: record.stage,\n authorModel: record.match.authorModel,\n on: record.match.on,\n });\n witnessFindings.push({\n code: 'witness-excluded',\n severity: 'info',\n witnesses: [label],\n data: {\n stage: record.stage,\n authorModel: record.match.authorModel,\n on: record.match.on,\n },\n });\n } else if (record.status === 'failed') {\n witnessFindings.push({\n code: 'witness-failed',\n severity: 'warn',\n witnesses: [label],\n data: { kind: record.error.kind },\n });\n } else if (record.finishReason === 'length') {\n witnessFindings.push({\n code: 'truncated-output',\n severity: 'info',\n witnesses: [label],\n });\n }\n }\n\n const duplicateServedModels = sortWith(\n Array.from(servedGroups.entries())\n .filter(([, labels]) => labels.length >= 2)\n .map(([canonicalId, witnesses]) => ({ canonicalId, witnesses })),\n (a, b) => compareUtf16(a.canonicalId, b.canonicalId),\n );\n\n for (const group of duplicateServedModels) {\n witnessFindings.push({\n code: 'duplicate-served-model',\n severity: 'warn',\n witnesses: [...group.witnesses],\n data: { canonicalId: group.canonicalId },\n });\n }\n\n const sameProviderGroups = sortWith(\n Array.from(providerGroups.entries())\n .filter(([, labels]) => labels.length >= 2)\n .map(([providerKey, witnesses]) => ({ providerKey, witnesses })),\n (a, b) => compareUtf16(a.providerKey, b.providerKey),\n );\n\n const uniqueRequestedProviders = providerGroups.size;\n if (asked >= 2 && uniqueRequestedProviders === 1) {\n const onlyProviderKey = providerGroups.keys().next().value;\n if (onlyProviderKey !== undefined && onlyProviderKey !== '(default)') {\n witnessFindings.push({\n code: 'single-provider',\n severity: 'warn',\n data: { providerKey: onlyProviderKey },\n });\n }\n }\n\n return {\n independence: {\n uniqueRequestedProviders,\n duplicateServedModels,\n sameProviderGroups,\n selfGradingWitnesses,\n excludedWitnesses,\n },\n witnessFindings,\n };\n}\n","import { NoObjectGeneratedError, Output, asSchema, generateText } from 'ai';\n\nimport { canonicalJson } from './canonical/canonical-json.js';\nimport { hashForm } from './canonical/hash-input.js';\nimport { sha256Hex } from './canonical/sha256.js';\nimport {\n compareFields as defaultCompareFields,\n type AnsweredOutput,\n} from './compare/compare-fields.js';\nimport { computeCoverage } from './compare/coverage.js';\nimport { derivePlan } from './compare/derive-plan.js';\nimport { isPlainObject, toSortedNullProtoRecord } from './compare/util.js';\nimport { DissentArgumentError } from './errors.js';\nimport {\n collectComparisonFindings,\n computeAdvisory,\n sortFindings,\n} from './findings.js';\nimport {\n OutputTooLargeError,\n classifyWitnessError,\n mapUsage,\n} from './witness/classify-error.js';\nimport {\n analyzeIndependence,\n matchAuthorModel,\n} from './witness/independence.js';\nimport {\n normalizeAndValidateOptions,\n toServedIdentity,\n type NormalizedOptions,\n type NormalizedWitness,\n} from './witness/normalize-witnesses.js';\nimport { sanitizeWarnings, utf8ByteLength } from './witness/redact.js';\n\nimport type {\n FinishReason,\n JSONSchema7,\n LanguageModelUsage,\n CallWarning,\n} from 'ai';\n\nimport type {\n CorroborateOptions,\n JSONValue,\n Ledger,\n QuestionRecord,\n Quorum,\n WitnessError,\n WitnessRecord,\n WitnessUsage,\n} from './types.js';\n\nconst USAGE_KEYS = [\n 'inputTokens',\n 'outputTokens',\n 'totalTokens',\n 'cacheReadTokens',\n 'cacheWriteTokens',\n 'reasoningTokens',\n] as const;\n\nexport type CorroborateInternalHooks = {\n compareFields?: typeof defaultCompareFields;\n onGenerateTextParams?: (params: Parameters<typeof generateText>[0]) => void;\n};\n\ntype QuestionResult = {\n question: QuestionRecord;\n};\n\nasync function buildQuestion<T, W extends string>(\n options: CorroborateOptions<T, W>,\n normalized: NormalizedOptions<W>,\n resolvedSchema: JSONSchema7,\n): Promise<QuestionResult> {\n const normalize = normalized.lineEndings === 'normalize-for-hash';\n const lineEndingsRecord = normalize ? 'normalized-for-hash' : 'preserved';\n const inputKind = options.prompt !== undefined ? 'prompt' : 'messages';\n const rawInput = inputKind === 'prompt' ? options.prompt : options.messages;\n\n const hashedInput = await hashForm(rawInput, normalize, inputKind);\n const inputCanon = canonicalJson(hashedInput);\n const inputBytes = utf8ByteLength(inputCanon);\n const inputHash = await sha256Hex(inputCanon);\n\n const instructionsHash =\n options.instructions !== undefined\n ? await sha256Hex(\n canonicalJson(\n await hashForm(options.instructions, normalize, 'instructions'),\n ),\n )\n : null;\n\n const schemaObj: Record<string, JSONValue> = {\n jsonSchema: resolvedSchema as unknown as JSONValue,\n };\n if (options.schemaName !== undefined) {\n schemaObj.name = options.schemaName;\n }\n if (options.schemaDescription !== undefined) {\n schemaObj.description = options.schemaDescription;\n }\n const schemaHash = await sha256Hex(canonicalJson(schemaObj));\n\n const fingerprint = await sha256Hex(\n canonicalJson({\n protocol: 'dissent-question/1',\n inputKind,\n inputHash,\n instructionsHash,\n schemaHash,\n lineEndings: lineEndingsRecord,\n }),\n );\n\n const question: QuestionRecord = {\n fingerprint,\n inputKind,\n inputHash,\n instructionsHash,\n schemaHash,\n inputBytes,\n lineEndings: lineEndingsRecord,\n };\n\n if (normalized.includeInput === 'full') {\n const raw: NonNullable<QuestionRecord['raw']> = {};\n if (options.instructions !== undefined) {\n raw.instructions = await hashForm(\n options.instructions,\n false,\n 'instructions',\n );\n }\n const rawPreserved = normalize\n ? await hashForm(rawInput, false, inputKind)\n : hashedInput;\n if (inputKind === 'prompt') {\n raw.prompt = rawPreserved;\n } else {\n raw.messages = rawPreserved;\n }\n question.raw = raw;\n }\n\n return { question };\n}\n\nfunction buildGenerateTextParams<T, W extends string>(\n witness: NormalizedWitness<W>,\n options: CorroborateOptions<T, W>,\n outputSpec: ReturnType<typeof Output.object<T>>,\n abortSignal: AbortSignal,\n): Parameters<typeof generateText>[0] {\n const params: Record<string, unknown> = {};\n const settings = witness.settings;\n if (settings !== undefined) {\n for (const key of Object.keys(settings)) {\n if (\n key === 'timeout' ||\n key === 'maxRetries' ||\n key === 'headers' ||\n key === 'providerOptions' ||\n key === 'abortSignal' ||\n key === 'model' ||\n key === 'prompt' ||\n key === 'messages' ||\n key === 'instructions' ||\n key === 'output' ||\n key === 'telemetry'\n ) {\n continue;\n }\n const val = (settings as Record<string, unknown>)[key];\n if (val !== undefined) {\n params[key] = val;\n }\n }\n }\n\n const timeout = settings?.timeout ?? options.timeout;\n if (timeout !== undefined) params.timeout = timeout;\n\n const maxRetries = settings?.maxRetries ?? options.maxRetries;\n if (maxRetries !== undefined) params.maxRetries = maxRetries;\n\n const headers = settings?.headers ?? options.headers;\n if (headers !== undefined) params.headers = headers;\n\n const providerOptions = settings?.providerOptions ?? options.providerOptions;\n if (providerOptions !== undefined) params.providerOptions = providerOptions;\n\n if (options.telemetry !== undefined) {\n params.telemetry = options.telemetry;\n }\n if (options.instructions !== undefined) {\n params.instructions = options.instructions;\n }\n if (options.prompt !== undefined) {\n params.prompt = options.prompt;\n } else if (options.messages !== undefined) {\n params.messages = options.messages;\n }\n\n params.model = witness.model;\n params.output = outputSpec;\n params.abortSignal = abortSignal;\n\n return params as Parameters<typeof generateText>[0];\n}\n\nfunction sumUsage<W extends string>(\n labels: readonly W[],\n records: ReadonlyMap<W, WitnessRecord<unknown>>,\n): WitnessUsage {\n const total: WitnessUsage = {\n inputTokens: null,\n outputTokens: null,\n totalTokens: null,\n cacheReadTokens: null,\n cacheWriteTokens: null,\n reasoningTokens: null,\n };\n for (const key of USAGE_KEYS) {\n let sum = 0;\n let count = 0;\n for (const label of labels) {\n const rec = records.get(label);\n const val = rec?.usage?.[key];\n if (typeof val === 'number') {\n sum += val;\n count++;\n }\n }\n if (count > 0) {\n total[key] = sum;\n }\n }\n return total;\n}\n\nfunction witnessFingerprintPart<T>(record: WitnessRecord<T>): JSONValue {\n if (record.status === 'answered') {\n return {\n status: 'answered',\n requested: record.requested.canonicalId,\n served: record.served?.canonicalId ?? null,\n output: record.output as JSONValue,\n };\n }\n if (record.status === 'failed') {\n return {\n status: 'failed',\n requested: record.requested.canonicalId,\n served: record.served?.canonicalId ?? null,\n kind: record.error.kind,\n };\n }\n return {\n status: 'excluded',\n requested: record.requested.canonicalId,\n stage: record.stage,\n };\n}\n\n/**\n * Runs one multi-model corroboration session over AI SDK v7 models (§2.2).\n */\nexport async function corroborate<T, W extends string>(\n options: CorroborateOptions<T, W>,\n): Promise<Ledger<T, W>> {\n return corroborateWithHooks(options);\n}\n\n/**\n * Internal entry point supporting comparator injection for fingerprint-scope tests (I3c).\n * Never exported from the package root.\n */\nexport async function corroborateWithHooks<T, W extends string>(\n options: CorroborateOptions<T, W>,\n hooks?: CorroborateInternalHooks,\n): Promise<Ledger<T, W>> {\n // Step 1: validate options before any model call.\n const normalized = normalizeAndValidateOptions(options);\n\n // Step 2: check caller abort before doing async work.\n if (options.abortSignal?.aborted) {\n throw options.abortSignal.reason;\n }\n\n // Step 3: resolve JSON Schema and derive plan.\n let resolvedSchema: JSONSchema7;\n try {\n resolvedSchema = (await asSchema(options.schema).jsonSchema) as JSONSchema7;\n } catch (err) {\n if (options.abortSignal?.aborted) {\n throw options.abortSignal.reason;\n }\n throw new DissentArgumentError(\n 'invalid-option',\n 'schema',\n err instanceof Error ? err.message : undefined,\n );\n }\n if (options.abortSignal?.aborted) {\n throw options.abortSignal.reason;\n }\n const plan = await derivePlan(resolvedSchema, options.compare);\n if (options.abortSignal?.aborted) {\n throw options.abortSignal.reason;\n }\n\n // Step 4: hash the question.\n const { question } = await buildQuestion(options, normalized, resolvedSchema);\n if (options.abortSignal?.aborted) {\n throw options.abortSignal.reason;\n }\n\n // Step 5–6: normalize witnesses & pre-dispatch author exclusion.\n const recordMap = new Map<W, WitnessRecord<T>>();\n const askedWitnesses: NormalizedWitness<W>[] = [];\n const preExcludedWitnesses: Array<{ label: W; record: WitnessRecord<T> }> =\n [];\n\n for (const witness of normalized.witnesses) {\n if (normalized.excludeAuthor) {\n const match = matchAuthorModel(\n witness.requested,\n null,\n normalized.authorModels,\n );\n if (match !== null) {\n const record: WitnessRecord<T> = {\n status: 'excluded',\n stage: 'before-dispatch',\n match,\n requested: witness.requested,\n served: null,\n durationMs: 0,\n usage: null,\n };\n recordMap.set(witness.label, record);\n preExcludedWitnesses.push({ label: witness.label, record });\n continue;\n }\n }\n askedWitnesses.push(witness);\n }\n\n if (askedWitnesses.length < 2) {\n throw new DissentArgumentError(\n 'too-few-witnesses-after-exclusion',\n 'witnesses',\n `Only ${askedWitnesses.length} witness(es) remain after author exclusion; at least 2 are required.`,\n );\n }\n\n const outputSpec = Output.object<T>({\n schema: options.schema,\n ...(options.schemaName !== undefined ? { name: options.schemaName } : {}),\n ...(options.schemaDescription !== undefined\n ? { description: options.schemaDescription }\n : {}),\n });\n\n // Step 7–11: semaphore fan-out, prompt abort handling, result reading & guards.\n const internalController = new AbortController();\n const callerSignal = options.abortSignal;\n const callSignal =\n callerSignal !== undefined\n ? AbortSignal.any([callerSignal, internalController.signal])\n : internalController.signal;\n\n let terminated = false;\n let rejectControl!: (reason: unknown) => void;\n const controlPromise = new Promise<never>((_resolve, reject) => {\n rejectControl = reject;\n });\n // Attach noop handler so early rejections before Promise.race never go unhandled.\n controlPromise.catch(() => {});\n\n const onCallerAbort = (): void => {\n if (terminated) return;\n terminated = true;\n const reason: unknown = callerSignal?.reason;\n internalController.abort(reason);\n rejectControl(reason);\n };\n\n if (callerSignal !== undefined) {\n if (callerSignal.aborted) {\n throw callerSignal.reason;\n }\n callerSignal.addEventListener('abort', onCallerAbort, { once: true });\n }\n\n const notifyWitness = (label: W, record: WitnessRecord<T>): void => {\n if (\n terminated ||\n callerSignal?.aborted ||\n options.onWitness === undefined\n ) {\n return;\n }\n try {\n options.onWitness(label, record);\n } catch (callbackErr) {\n if (!terminated) {\n terminated = true;\n internalController.abort(callbackErr);\n rejectControl(callbackErr);\n }\n }\n };\n\n for (const pre of preExcludedWitnesses) {\n if (terminated) break;\n notifyWitness(pre.label, pre.record);\n }\n\n type WitnessCallResult = {\n output: T;\n finishReason: FinishReason;\n usage: LanguageModelUsage;\n warnings: CallWarning[] | undefined;\n finalStep: { response: { modelId?: string } };\n };\n\n const runWitness = async (witness: NormalizedWitness<W>): Promise<void> => {\n if (terminated || callerSignal?.aborted) return;\n\n const startMs = performance.now();\n let result: WitnessCallResult | undefined;\n\n let record: WitnessRecord<T>;\n try {\n const params = buildGenerateTextParams(\n witness,\n options,\n outputSpec,\n callSignal,\n );\n hooks?.onGenerateTextParams?.(params);\n result = (await generateText(params)) as unknown as WitnessCallResult;\n const obtained = result!;\n const rawOutput = obtained.output;\n const finishReason = obtained.finishReason;\n const usage = mapUsage(obtained.usage) ?? {\n inputTokens: null,\n outputTokens: null,\n totalTokens: null,\n cacheReadTokens: null,\n cacheWriteTokens: null,\n reasoningTokens: null,\n };\n const warnings = sanitizeWarnings(\n obtained.warnings,\n normalized.maxErrorTextBytes,\n );\n const served = toServedIdentity(\n witness.requested,\n obtained.finalStep?.response?.modelId,\n );\n\n // Guard output (JSON-only + byte cap + object shape)\n const canon = canonicalJson(rawOutput);\n const byteLen = utf8ByteLength(canon);\n if (byteLen > normalized.maxOutputBytes) {\n throw new OutputTooLargeError(byteLen, normalized.maxOutputBytes);\n }\n const cleanOutput = JSON.parse(canon) as T;\n if (!isPlainObject(cleanOutput)) {\n throw new NoObjectGeneratedError({\n message: 'Generated output must be a JSON object.',\n text: canon,\n response: {\n id: '',\n timestamp: new Date(0),\n modelId:\n obtained.finalStep?.response?.modelId ??\n witness.requested.modelId,\n },\n usage: obtained.usage,\n finishReason,\n });\n }\n const durationMs = Math.max(0, Math.round(performance.now() - startMs));\n\n if (normalized.excludeAuthor && served !== null) {\n const postMatch = matchAuthorModel(\n witness.requested,\n served,\n normalized.authorModels,\n );\n if (postMatch !== null) {\n record = {\n status: 'excluded',\n stage: 'after-response',\n match: postMatch,\n requested: witness.requested,\n served,\n durationMs,\n output: cleanOutput,\n usage,\n };\n recordMap.set(witness.label, record);\n notifyWitness(witness.label, record);\n return;\n }\n }\n\n record = {\n status: 'answered',\n requested: witness.requested,\n served,\n durationMs,\n output: cleanOutput,\n finishReason,\n usage,\n warnings,\n };\n } catch (caught) {\n if (terminated || callerSignal?.aborted) {\n return;\n }\n const durationMs = Math.max(0, Math.round(performance.now() - startMs));\n const partialResult = result;\n const errorObj: WitnessError = classifyWitnessError(\n caught,\n partialResult !== undefined\n ? {\n finishReason: partialResult.finishReason,\n usage: partialResult.usage,\n }\n : undefined,\n normalized.maxErrorTextBytes,\n );\n\n const served =\n partialResult !== undefined\n ? toServedIdentity(\n witness.requested,\n partialResult.finalStep?.response?.modelId,\n )\n : null;\n\n let usage: WitnessUsage | null = null;\n if (partialResult !== undefined) {\n usage = mapUsage(partialResult.usage);\n } else if (\n typeof caught === 'object' &&\n caught !== null &&\n 'usage' in caught\n ) {\n usage = mapUsage(\n (caught as { usage?: Parameters<typeof mapUsage>[0] }).usage,\n );\n }\n\n record = {\n status: 'failed',\n requested: witness.requested,\n served,\n durationMs,\n error: errorObj,\n usage,\n };\n }\n\n if (terminated || callerSignal?.aborted) {\n return;\n }\n recordMap.set(witness.label, record);\n notifyWitness(witness.label, record);\n };\n\n let nextIdx = 0;\n const workerCount = Math.min(\n normalized.maxConcurrency,\n askedWitnesses.length,\n );\n const workers = Array.from({ length: workerCount }, async () => {\n while (nextIdx < askedWitnesses.length) {\n if (terminated || callerSignal?.aborted) return;\n const idx = nextIdx;\n nextIdx++;\n await runWitness(askedWitnesses[idx]!);\n }\n });\n const allWorkers = Promise.all(workers);\n allWorkers.catch(() => {});\n\n try {\n await Promise.race([allWorkers, controlPromise]);\n } finally {\n if (callerSignal !== undefined) {\n callerSignal.removeEventListener('abort', onCallerAbort);\n }\n }\n\n if (callerSignal?.aborted) {\n throw callerSignal.reason;\n }\n\n // Step 12: assemble ledger cleanly in sorted label order.\n const sortedLabels = normalized.witnesses.map(w => w.label);\n const witnessEntries: Array<[W, WitnessRecord<T>]> = [];\n const witnessList: Array<{ label: W; record: WitnessRecord<T> }> = [];\n const answeredOutputs: AnsweredOutput<W>[] = [];\n const usageEntries: Array<[W, WitnessUsage | null]> = [];\n const witnessFpEntries: Array<[W, JSONValue]> = [];\n\n let answered = 0;\n let failed = 0;\n let excluded = 0;\n\n for (const label of sortedLabels) {\n const rec = recordMap.get(label)!;\n witnessEntries.push([label, rec]);\n witnessList.push({ label, record: rec });\n usageEntries.push([label, rec.usage]);\n witnessFpEntries.push([label, witnessFingerprintPart(rec)]);\n\n if (rec.status === 'answered') {\n answered++;\n answeredOutputs.push({\n witness: label,\n output: rec.output as JSONValue,\n });\n } else if (rec.status === 'failed') {\n failed++;\n } else {\n excluded++;\n }\n }\n\n const quorum: Quorum = {\n listed: sortedLabels.length,\n asked: askedWitnesses.length,\n answered,\n failed,\n excluded,\n };\n\n const compareFn = hooks?.compareFields ?? defaultCompareFields;\n const fields = compareFn<W>(plan.fields, answeredOutputs);\n const coverage = computeCoverage(plan.fields, fields);\n const { independence, witnessFindings } = analyzeIndependence(\n witnessList,\n normalized.authorModels,\n );\n const comparisonFindings = collectComparisonFindings({\n answered: quorum.answered,\n planFields: plan.fields,\n fieldResults: fields,\n coverage,\n strictCoverage: normalized.strictCoverage,\n });\n const findings = sortFindings([...witnessFindings, ...comparisonFindings]);\n const advisory = computeAdvisory(findings);\n\n const ledgerFingerprint = await sha256Hex(\n canonicalJson({\n protocol: 'dissent-ledger/1',\n question: question.fingerprint,\n plan: plan.fingerprint,\n witnesses: toSortedNullProtoRecord(witnessFpEntries),\n }),\n );\n\n return {\n protocol: 'dissent-ledger/1',\n fingerprint: ledgerFingerprint,\n question,\n plan,\n witnesses: toSortedNullProtoRecord(witnessEntries),\n quorum,\n independence,\n fields,\n coverage,\n findings,\n advisory,\n usage: {\n perWitness: toSortedNullProtoRecord(usageEntries),\n total: sumUsage(sortedLabels, recordMap),\n },\n createdAt: new Date().toISOString(),\n };\n}\n","import { isPlainObject, ownValue } from './compare/util.js';\nimport { sanitizeInline } from './sanitize.js';\n\nimport type { ReceiptCheck } from './types.js';\n\nconst REQUIRED_STRING_FIELDS = [\n 'provider',\n 'profile',\n 'runtimeImageDigest',\n 'networkPolicySha256',\n 'receiptId',\n 'region',\n] as const;\n\n/**\n * Validates an experimental offline execution environment receipt (§10.5).\n * Pure, never throws.\n *\n * @experimental Can change in a minor release until the v0.3 sandbox producer exists.\n */\nexport function validateOfflineReceipt(\n receipt: unknown,\n expected?: { networkPolicySha256?: string; runtimeImageDigest?: string },\n): ReceiptCheck {\n if (!isPlainObject(receipt)) {\n return { valid: false, reason: 'malformed' };\n }\n\n for (const field of REQUIRED_STRING_FIELDS) {\n if (!Object.hasOwn(receipt, field)) {\n return { valid: false, reason: 'malformed' };\n }\n const val = ownValue(receipt, field);\n if (typeof val !== 'string' || val === '') {\n return { valid: false, reason: 'malformed' };\n }\n }\n\n if (!Object.hasOwn(receipt, 'networkPolicyEnforced')) {\n return { valid: false, reason: 'malformed' };\n }\n const networkPolicyEnforced = ownValue(receipt, 'networkPolicyEnforced');\n if (typeof networkPolicyEnforced !== 'boolean') {\n return { valid: false, reason: 'malformed' };\n }\n\n const profile = ownValue<string>(receipt, 'profile')!;\n if (profile !== 'offline-verification-v1') {\n return { valid: false, reason: 'wrong-profile' };\n }\n\n if (networkPolicyEnforced !== true) {\n return { valid: false, reason: 'network-not-enforced' };\n }\n\n if (isPlainObject(expected)) {\n const expectedPolicy = ownValue(expected, 'networkPolicySha256');\n if (\n typeof expectedPolicy === 'string' &&\n ownValue<string>(receipt, 'networkPolicySha256') !== expectedPolicy\n ) {\n return { valid: false, reason: 'policy-mismatch' };\n }\n\n const expectedImage = ownValue(expected, 'runtimeImageDigest');\n if (\n typeof expectedImage === 'string' &&\n ownValue<string>(receipt, 'runtimeImageDigest') !== expectedImage\n ) {\n return { valid: false, reason: 'image-mismatch' };\n }\n }\n\n return { valid: true };\n}\n\n/** Extracts a sanitized receipt ID string or null from an unchecked receipt candidate. */\nexport function readReceiptId(receipt: unknown): string | null {\n if (!isPlainObject(receipt) || !Object.hasOwn(receipt, 'receiptId')) {\n return null;\n }\n const raw = ownValue(receipt, 'receiptId');\n if (typeof raw !== 'string') return null;\n const clean = sanitizeInline(raw);\n return clean === '' ? null : clean;\n}\n","import { canonicalJson, compareUtf16 } from './canonical/canonical-json.js';\nimport { sha256Hex } from './canonical/sha256.js';\nimport { readByPointer } from './compare/compare-fields.js';\nimport { withinTolerance } from './compare/tolerance.js';\nimport {\n isPlainObject,\n normalizeJsonZeros,\n ownValue,\n sortLabels,\n sortWith,\n} from './compare/util.js';\nimport { DissentArgumentError } from './errors.js';\nimport { normalizePath, parsePointer } from './paths.js';\nimport { readReceiptId, validateOfflineReceipt } from './receipt.js';\nimport { redactSecrets, sanitizeInline } from './sanitize.js';\n\nimport type {\n AdjudicateOptions,\n Adjudication,\n Evidence,\n EvidenceOutcome,\n FieldPlan,\n JSONValue,\n Ledger,\n Settlement,\n Verdict,\n VerdictReason,\n WitnessRecord,\n} from './types.js';\n\nconst OUTCOMES = new Set<EvidenceOutcome>(['pass', 'fail', 'error', 'unknown']);\nconst MAX_SOURCE_CHARS = 128;\n\ntype ReceiptExpected = {\n networkPolicySha256?: string;\n runtimeImageDigest?: string;\n};\n\ntype ValidatedItem = {\n source: string;\n outcome: EvidenceOutcome;\n normalizedForHash: Record<string, JSONValue>;\n claim?: { scope: 'artifact' } | { path: string; value: JSONValue };\n receipt?: unknown;\n};\n\nfunction assertJsonValue(value: unknown, argumentPath: string): JSONValue {\n try {\n canonicalJson(value);\n } catch {\n throw new DissentArgumentError('invalid-evidence', argumentPath);\n }\n return normalizeJsonZeros(value as JSONValue);\n}\n\nconst ALLOWED_ADJUDICATE_OPTIONS = new Set([\n 'escalateOnReview',\n 'requireOfflineReceipt',\n]);\nconst ALLOWED_RECEIPT_EXPECTED_KEYS = new Set([\n 'networkPolicySha256',\n 'runtimeImageDigest',\n]);\n\nfunction validateAdjudicateOptions(options: unknown): {\n escalateOnReview: boolean;\n requireOfflineReceipt: false | true | ReceiptExpected;\n} {\n if (options === undefined) {\n return { escalateOnReview: false, requireOfflineReceipt: false };\n }\n if (!isPlainObject(options)) {\n throw new DissentArgumentError('invalid-option', 'options');\n }\n\n for (const key of Object.keys(options)) {\n if (!ALLOWED_ADJUDICATE_OPTIONS.has(key)) {\n throw new DissentArgumentError('invalid-option', `options.${key}`);\n }\n }\n\n const escalate = ownValue(options, 'escalateOnReview');\n if (escalate !== undefined && typeof escalate !== 'boolean') {\n throw new DissentArgumentError('invalid-option', 'escalateOnReview');\n }\n\n const rawReq = ownValue(options, 'requireOfflineReceipt');\n let requireOfflineReceipt: false | true | ReceiptExpected = false;\n\n if (rawReq === true || rawReq === false || rawReq === undefined) {\n requireOfflineReceipt = rawReq === true;\n } else if (isPlainObject(rawReq)) {\n for (const key of Object.keys(rawReq)) {\n if (!ALLOWED_RECEIPT_EXPECTED_KEYS.has(key)) {\n throw new DissentArgumentError(\n 'invalid-option',\n `requireOfflineReceipt.${key}`,\n );\n }\n }\n const normalized: ReceiptExpected = {};\n const sha = ownValue(rawReq, 'networkPolicySha256');\n if (sha !== undefined) {\n if (typeof sha !== 'string') {\n throw new DissentArgumentError(\n 'invalid-option',\n 'requireOfflineReceipt.networkPolicySha256',\n );\n }\n normalized.networkPolicySha256 = sha;\n }\n const digest = ownValue(rawReq, 'runtimeImageDigest');\n if (digest !== undefined) {\n if (typeof digest !== 'string') {\n throw new DissentArgumentError(\n 'invalid-option',\n 'requireOfflineReceipt.runtimeImageDigest',\n );\n }\n normalized.runtimeImageDigest = digest;\n }\n requireOfflineReceipt =\n Object.keys(normalized).length === 0 ? true : normalized;\n } else {\n throw new DissentArgumentError('invalid-option', 'requireOfflineReceipt');\n }\n\n return {\n escalateOnReview: escalate === true,\n requireOfflineReceipt,\n };\n}\n\nfunction validateEvidenceItem(raw: unknown, index: number): ValidatedItem {\n if (!isPlainObject(raw)) {\n throw new DissentArgumentError('invalid-evidence', `evidence[${index}]`);\n }\n\n const rawSource = ownValue(raw, 'source');\n if (typeof rawSource !== 'string') {\n throw new DissentArgumentError(\n 'invalid-evidence',\n `evidence[${index}].source`,\n );\n }\n const source = redactSecrets(sanitizeInline(rawSource));\n if (source.trim().length === 0 || source.length > MAX_SOURCE_CHARS) {\n throw new DissentArgumentError(\n 'invalid-evidence',\n `evidence[${index}].source`,\n );\n }\n\n const rawOutcome = ownValue(raw, 'outcome');\n if (\n typeof rawOutcome !== 'string' ||\n !OUTCOMES.has(rawOutcome as EvidenceOutcome)\n ) {\n throw new DissentArgumentError(\n 'invalid-evidence',\n `evidence[${index}].outcome`,\n );\n }\n const outcome = rawOutcome as EvidenceOutcome;\n\n const forHash: Record<string, JSONValue> = {\n source,\n outcome,\n };\n\n let claim: ValidatedItem['claim'];\n const rawClaim = ownValue(raw, 'claim');\n if (rawClaim !== undefined) {\n if (!isPlainObject(rawClaim)) {\n throw new DissentArgumentError(\n 'invalid-evidence',\n `evidence[${index}].claim`,\n );\n }\n const hasScope = Object.hasOwn(rawClaim, 'scope');\n const hasPath = Object.hasOwn(rawClaim, 'path');\n if (hasScope && !hasPath) {\n if (ownValue(rawClaim, 'scope') !== 'artifact') {\n throw new DissentArgumentError(\n 'invalid-evidence',\n `evidence[${index}].claim.scope`,\n );\n }\n claim = { scope: 'artifact' };\n forHash.claim = { scope: 'artifact' };\n } else if (hasPath && !hasScope) {\n const rawPath = ownValue(rawClaim, 'path');\n if (typeof rawPath !== 'string') {\n throw new DissentArgumentError(\n 'invalid-evidence',\n `evidence[${index}].claim.path`,\n );\n }\n let normalizedPath: string;\n try {\n normalizedPath = normalizePath(rawPath);\n parsePointer(normalizedPath);\n } catch {\n throw new DissentArgumentError(\n 'invalid-evidence',\n `evidence[${index}].claim.path`,\n );\n }\n if (\n !Object.hasOwn(rawClaim, 'value') ||\n ownValue(rawClaim, 'value') === undefined\n ) {\n throw new DissentArgumentError(\n 'invalid-evidence',\n `evidence[${index}].claim.value`,\n );\n }\n const value = assertJsonValue(\n ownValue(rawClaim, 'value'),\n `evidence[${index}].claim.value`,\n );\n claim = { path: normalizedPath, value };\n forHash.claim = { path: normalizedPath, value };\n } else {\n throw new DissentArgumentError(\n 'invalid-evidence',\n `evidence[${index}].claim`,\n );\n }\n }\n\n const details = ownValue(raw, 'details');\n if (details !== undefined) {\n if (!isPlainObject(details)) {\n throw new DissentArgumentError(\n 'invalid-evidence',\n `evidence[${index}].details`,\n );\n }\n forHash.details = assertJsonValue(details, `evidence[${index}].details`);\n }\n\n const claims = ownValue(raw, 'claims');\n if (claims !== undefined) {\n if (!isPlainObject(claims)) {\n throw new DissentArgumentError(\n 'invalid-evidence',\n `evidence[${index}].claims`,\n );\n }\n forHash.claims = assertJsonValue(claims, `evidence[${index}].claims`);\n }\n\n const receipt = ownValue(raw, 'receipt');\n if (receipt !== undefined) {\n forHash.receipt = assertJsonValue(receipt, `evidence[${index}].receipt`);\n }\n\n const out: ValidatedItem = { source, outcome, normalizedForHash: forHash };\n if (claim !== undefined) out.claim = claim;\n if (receipt !== undefined) out.receipt = receipt;\n return out;\n}\n\nfunction toCanonicalSet(values: readonly JSONValue[]): Set<string> {\n const out = new Set<string>();\n for (const v of values) {\n out.add(canonicalJson(v));\n }\n return out;\n}\n\nfunction buildKeyedMap(\n values: unknown,\n keyName: string,\n): Map<string, string> | null {\n if (!Array.isArray(values)) return null;\n const map = new Map<string, string>();\n for (const item of values) {\n if (!isPlainObject(item) || !Object.hasOwn(item, keyName)) return null;\n const keyVal = ownValue(item, keyName);\n if (keyVal === undefined) return null;\n const canonKey = canonicalJson(keyVal);\n if (map.has(canonKey)) return null;\n map.set(canonKey, canonicalJson(item));\n }\n return map;\n}\n\nfunction valuesMatchByPlan(\n plan: FieldPlan,\n a: JSONValue,\n b: JSONValue,\n): boolean {\n switch (plan.comparator) {\n case 'none':\n return false;\n case 'exact':\n case 'discriminated-union':\n return canonicalJson(a) === canonicalJson(b);\n case 'tolerance':\n if (a === null && b === null) return true;\n if (\n typeof a === 'number' &&\n Number.isFinite(a) &&\n typeof b === 'number' &&\n Number.isFinite(b)\n ) {\n return withinTolerance(a, b, plan.tolerance);\n }\n return false;\n case 'set': {\n if (a === null && b === null) return true;\n if (!Array.isArray(a) || !Array.isArray(b)) return false;\n const setA = toCanonicalSet(a as JSONValue[]);\n const setB = toCanonicalSet(b as JSONValue[]);\n if (setA.size !== setB.size) return false;\n for (const k of setA) {\n if (!setB.has(k)) return false;\n }\n return true;\n }\n case 'keyed-set': {\n if (a === null && b === null) return true;\n const mapA = buildKeyedMap(a, plan.key);\n const mapB = buildKeyedMap(b, plan.key);\n if (mapA === null || mapB === null || mapA.size !== mapB.size) {\n return false;\n }\n for (const [k, v] of mapA) {\n if (mapB.get(k) !== v) return false;\n }\n return true;\n }\n }\n}\n\nfunction computeVerdict(\n counts: { pass: number; fail: number; error: number; unknown: number },\n totalArtifact: number,\n escalateOnReview: boolean,\n advisory: Ledger<unknown, string>['advisory'],\n): { verdict: Verdict; verdictReason: VerdictReason } {\n if (totalArtifact === 0) {\n return { verdict: 'uncertain', verdictReason: 'no-artifact-evidence' };\n }\n if (counts.fail > 0) {\n return { verdict: 'rejected', verdictReason: 'artifact-evidence-failed' };\n }\n if (counts.error > 0 || counts.unknown > 0) {\n return {\n verdict: 'uncertain',\n verdictReason: 'artifact-evidence-inconclusive',\n };\n }\n if (escalateOnReview && advisory === 'review-required') {\n return { verdict: 'uncertain', verdictReason: 'escalated-on-review' };\n }\n return { verdict: 'confirmed', verdictReason: 'artifact-evidence-passed' };\n}\n\n/**\n * Pure Layer C adjudication: binds caller evidence to ledger fields (settlements, conflicts)\n * and computes the artifact verdict without calling any model (§10).\n */\nexport async function adjudicate<W extends string>(\n ledger: Ledger<unknown, W>,\n evidence: readonly Evidence[],\n options?: AdjudicateOptions,\n): Promise<Adjudication<W>> {\n if (\n !isPlainObject(ledger) ||\n typeof ledger.fingerprint !== 'string' ||\n !isPlainObject(ledger.plan) ||\n !isPlainObject(ledger.plan.fields) ||\n !isPlainObject(ledger.witnesses)\n ) {\n throw new DissentArgumentError('invalid-option', 'ledger');\n }\n if (!Array.isArray(evidence)) {\n throw new DissentArgumentError('invalid-evidence', 'evidence');\n }\n\n const resolvedOpts = validateAdjudicateOptions(options);\n const validated = evidence.map((item, i) => validateEvidenceItem(item, i));\n\n const allWitnesses = sortLabels(Object.keys(ledger.witnesses) as W[]);\n const answeredPresenters = new Map<W, JSONValue>();\n for (const w of allWitnesses) {\n const rec = ownValue<WitnessRecord<unknown>>(ledger.witnesses, w);\n if (rec?.status === 'answered') {\n answeredPresenters.set(w, rec.output as JSONValue);\n }\n }\n\n const settlements: Settlement<W>[] = [];\n const boundByPath = new Map<\n string,\n {\n plan: FieldPlan;\n entries: Array<{\n source: string;\n outcome: EvidenceOutcome;\n value: JSONValue;\n }>;\n }\n >();\n const unbound: Adjudication<W>['unbound'] = [];\n const receiptChecks: Adjudication<W>['receiptChecks'] = [];\n const artifactCounts = { pass: 0, fail: 0, error: 0, unknown: 0 };\n let totalArtifact = 0;\n\n for (const item of validated) {\n if (item.claim === undefined) {\n unbound.push({\n source: item.source,\n outcome: item.outcome,\n reason: 'no-claim',\n });\n continue;\n }\n\n if ('scope' in item.claim) {\n totalArtifact += 1;\n let effectiveOutcome = item.outcome;\n if (resolvedOpts.requireOfflineReceipt !== false) {\n const expected =\n resolvedOpts.requireOfflineReceipt === true\n ? undefined\n : resolvedOpts.requireOfflineReceipt;\n const check = validateOfflineReceipt(item.receipt, expected);\n receiptChecks.push({\n source: item.source,\n receiptId: readReceiptId(item.receipt),\n check,\n });\n if (!check.valid) {\n effectiveOutcome = 'unknown';\n }\n }\n artifactCounts[effectiveOutcome] += 1;\n continue;\n }\n\n const { path, value } = item.claim;\n if (!Object.hasOwn(ledger.plan.fields, path)) {\n unbound.push({\n source: item.source,\n outcome: item.outcome,\n reason: 'unknown-path',\n });\n continue;\n }\n const plan = ownValue<FieldPlan>(ledger.plan.fields, path)!;\n\n let pathBucket = boundByPath.get(path);\n if (pathBucket === undefined) {\n pathBucket = { plan, entries: [] };\n boundByPath.set(path, pathBucket);\n }\n pathBucket.entries.push({\n source: item.source,\n outcome: item.outcome,\n value,\n });\n\n if (plan.comparator === 'none') {\n settlements.push({\n path,\n value,\n source: item.source,\n outcome: item.outcome,\n comparator: 'not-comparable',\n witnessesAgreeing: [],\n witnessesDissenting: [],\n witnessesSilent: [...allWitnesses],\n });\n continue;\n }\n\n const witnessesAgreeing: W[] = [];\n const witnessesDissenting: W[] = [];\n const witnessesSilent: W[] = [];\n\n for (const w of allWitnesses) {\n const output = answeredPresenters.get(w);\n if (output === undefined) {\n witnessesSilent.push(w);\n continue;\n }\n const read = readByPointer(output, path);\n if (!read.present) {\n witnessesSilent.push(w);\n continue;\n }\n const witnessValue = normalizeJsonZeros(read.value);\n if (valuesMatchByPlan(plan, witnessValue, value)) {\n witnessesAgreeing.push(w);\n } else {\n witnessesDissenting.push(w);\n }\n }\n\n settlements.push({\n path,\n value,\n source: item.source,\n outcome: item.outcome,\n comparator: plan.comparator,\n witnessesAgreeing,\n witnessesDissenting,\n witnessesSilent,\n });\n }\n\n const conflicts: Adjudication<W>['conflicts'] = [];\n for (const path of sortLabels(Array.from(boundByPath.keys()))) {\n const { plan, entries } = boundByPath.get(path)!;\n if (plan.comparator === 'none') continue;\n const involved = new Set<string>();\n for (let i = 0; i < entries.length; i++) {\n const a = entries[i]!;\n for (let j = i + 1; j < entries.length; j++) {\n const b = entries[j]!;\n const bothPass = a.outcome === 'pass' && b.outcome === 'pass';\n const passFail =\n (a.outcome === 'pass' && b.outcome === 'fail') ||\n (a.outcome === 'fail' && b.outcome === 'pass');\n if (!bothPass && !passFail) continue;\n const match = valuesMatchByPlan(plan, a.value, b.value);\n if ((bothPass && !match) || (passFail && match)) {\n involved.add(a.source);\n involved.add(b.source);\n }\n }\n }\n if (involved.size > 0) {\n conflicts.push({ path, sources: sortLabels(Array.from(involved)) });\n }\n }\n\n const sortedSettlements = sortWith(settlements, (a, b) => {\n const pathCmp = compareUtf16(a.path, b.path);\n if (pathCmp !== 0) return pathCmp;\n const valCmp = compareUtf16(canonicalJson(a.value), canonicalJson(b.value));\n if (valCmp !== 0) return valCmp;\n const srcCmp = compareUtf16(a.source, b.source);\n if (srcCmp !== 0) return srcCmp;\n return compareUtf16(a.outcome, b.outcome);\n });\n\n const sortedUnbound = sortWith(unbound, (a, b) => {\n const srcCmp = compareUtf16(a.source, b.source);\n if (srcCmp !== 0) return srcCmp;\n const outCmp = compareUtf16(a.outcome, b.outcome);\n if (outCmp !== 0) return outCmp;\n return compareUtf16(a.reason, b.reason);\n });\n\n const sortedReceiptChecks = sortWith(receiptChecks, (a, b) => {\n const srcCmp = compareUtf16(a.source, b.source);\n if (srcCmp !== 0) return srcCmp;\n const idCmp = compareUtf16(a.receiptId ?? '', b.receiptId ?? '');\n if (idCmp !== 0) return idCmp;\n return compareUtf16(canonicalJson(a.check), canonicalJson(b.check));\n });\n\n const sortedEvidenceForHash = sortWith(\n validated.map(v => ({\n canon: canonicalJson(v.normalizedForHash),\n item: v.normalizedForHash,\n })),\n (a, b) => compareUtf16(a.canon, b.canon),\n ).map(e => e.item);\n\n const fingerprint = await sha256Hex(\n canonicalJson({\n protocol: 'dissent-adjudication/1',\n ledgerFingerprint: ledger.fingerprint,\n evidence: sortedEvidenceForHash,\n options: resolvedOpts,\n }),\n );\n\n const { verdict, verdictReason } = computeVerdict(\n artifactCounts,\n totalArtifact,\n resolvedOpts.escalateOnReview,\n ledger.advisory,\n );\n\n return {\n protocol: 'dissent-adjudication/1',\n ledgerFingerprint: ledger.fingerprint,\n fingerprint,\n settlements: sortedSettlements,\n conflicts,\n verdict,\n verdictReason,\n artifactEvidence: artifactCounts,\n receiptChecks: sortedReceiptChecks,\n unbound: sortedUnbound,\n };\n}\n","import { canonicalJson } from '../canonical/canonical-json.js';\nimport { readByPointer } from '../compare/compare-fields.js';\nimport { ownValue, sortLabels } from '../compare/util.js';\nimport { sanitizeControlChars, sanitizeInline } from '../sanitize.js';\n\nimport type {\n ExactResult,\n FieldResult,\n Finding,\n JSONValue,\n KeyedSetResult,\n LeafResult,\n Ledger,\n SetResult,\n ToleranceResult,\n UnionResult,\n WitnessRecord,\n} from '../types.js';\n\nconst MARKDOWN_INLINE_SPECIAL_RE = /[\\\\`*_[\\](){}#+\\-.!|<>~]/g;\n\n/** Counts the longest consecutive run of backticks in `text`. */\nexport function longestBacktickRun(text: string): number {\n let max = 0;\n for (const match of text.matchAll(/`+/g)) {\n if (match[0].length > max) max = match[0].length;\n }\n return max;\n}\n\nfunction collapseInline(text: string, maxInlineChars: number): string {\n const clean = sanitizeInline(text);\n const cps = Array.from(clean);\n if (cps.length <= maxInlineChars) return clean;\n if (maxInlineChars <= 1) return maxInlineChars === 1 ? '…' : '';\n return `${cps.slice(0, maxInlineChars - 1).join('')}…`;\n}\n\n/**\n * Escapes untrusted text for Markdown inline contexts (§11.3 steps 1–3, Q2):\n * sanitize → inline collapse/truncate → if `@` is present, wrap in an inline\n * code span (since GitHub GFM links `@user` as `@mentions`); otherwise\n * backslash-escape Markdown punctuation and replace `&` with `&`.\n */\nexport function escapeMarkdownInline(\n text: string,\n maxInlineChars: number,\n): string {\n const collapsed = collapseInline(text, maxInlineChars);\n if (collapsed.includes('@')) {\n return wrapMarkdownCodeSpan(collapsed);\n }\n return collapsed\n .replace(MARKDOWN_INLINE_SPECIAL_RE, '\\\\$&')\n .replaceAll('&', '&');\n}\n\n/** Sanitizes and truncates untrusted text for ASCII inline lines (§11.3 steps 1–2). */\nexport function escapeAsciiInline(\n text: string,\n maxInlineChars: number,\n): string {\n return collapseInline(text, maxInlineChars);\n}\n\nfunction wrapMarkdownCodeSpan(body: string): string {\n const fence = '`'.repeat(longestBacktickRun(body) + 1);\n const padded =\n body.startsWith('`') || body.endsWith('`') ? ` ${body} ` : body;\n return `${fence}${padded.replaceAll('|', '\\\\|')}${fence}`;\n}\n\n/** Renders a JSON value as an inline Markdown code span safe inside GFM tables (§11.3 step 4). */\nexport function formatMarkdownValue(\n value: JSONValue,\n maxInlineChars: number,\n): string {\n return wrapMarkdownCodeSpan(\n collapseInline(canonicalJson(value), maxInlineChars),\n );\n}\n\n/** Renders a JSON value for inline ASCII lines (§11.3 step 6). */\nexport function formatAsciiValue(\n value: JSONValue,\n maxInlineChars: number,\n): string {\n return collapseInline(canonicalJson(value), maxInlineChars);\n}\n\nfunction truncateBlock(text: string, maxBlockChars: number): string {\n const clean = sanitizeControlChars(text);\n const cps = Array.from(clean);\n if (cps.length <= maxBlockChars) return clean;\n const remaining = cps.length - maxBlockChars;\n return `${cps.slice(0, maxBlockChars).join('')}\\n… (truncated, ${remaining} more characters)`;\n}\n\n/** Renders an untrusted block inside a safe Markdown code fence with no info string (§11.3 step 5). */\nexport function formatMarkdownBlock(\n text: string,\n maxBlockChars: number,\n): string {\n const body = truncateBlock(text, maxBlockChars);\n const fence = '`'.repeat(Math.max(3, longestBacktickRun(body) + 1));\n return `${fence}\\n${body}\\n${fence}`;\n}\n\n/** Renders an untrusted block indented by four spaces per line for ASCII (§11.3 step 6). */\nexport function formatAsciiBlock(text: string, maxBlockChars: number): string {\n const body = truncateBlock(text, maxBlockChars);\n return body\n .split('\\n')\n .map(line => ` ${line}`)\n .join('\\n');\n}\n\nexport type InlineRenderers = {\n inline: (text: string) => string;\n value: (val: JSONValue) => string;\n};\n\n/** Formats the mandatory summary line (§11.1 item 2). */\nexport function formatSummaryLine(ledger: Ledger<unknown, string>): string {\n const { quorum: q, coverage: c } = ledger;\n const pct = Math.round(c.ratio * 100);\n return (\n `Advisory: ${sanitizeInline(ledger.advisory)} · ` +\n `Quorum: ${q.answered}/${q.listed} answered (${q.failed} failed, ${q.excluded} excluded) · ` +\n `Coverage: compared ${c.compared} of ${c.fields} fields (${pct}%)`\n );\n}\n\n/** Formats the detail/error/stage column for a witness record (§11.1 item 3). */\nexport function formatWitnessDetail(\n rec: WitnessRecord<unknown>,\n escInline: (text: string) => string,\n): string {\n if (rec.status === 'failed') {\n return `${sanitizeInline(rec.error.kind)}: ${escInline(rec.error.message)}`;\n }\n if (rec.status === 'excluded') {\n return `${sanitizeInline(rec.stage)} (${sanitizeInline(rec.match.on)}=${escInline(rec.match.authorModel)})`;\n }\n return rec.finishReason === 'length' ? 'finish: length' : '—';\n}\n\n/**\n * Recovers raw non-array, non-null present values from answering witnesses when a `set`\n * or `keyed-set` field splits due to a scalar/object value (Handoff §0 P3-6).\n */\nexport function findNonArrayRawValues<W extends string>(\n ledger: Ledger<unknown, W>,\n path: string,\n res: SetResult<W> | KeyedSetResult<W>,\n): Array<{ witness: W; value: JSONValue }> {\n const nullSet = new Set<W>(res.nulls);\n const extras: Array<{ witness: W; value: JSONValue }> = [];\n for (const w of res.presented) {\n if (nullSet.has(w)) continue;\n const rec = ownValue<WitnessRecord<unknown>>(ledger.witnesses, w);\n if (rec?.status !== 'answered') continue;\n const read = readByPointer(rec.output as JSONValue, path);\n if (read.present && !Array.isArray(read.value) && read.value !== null) {\n extras.push({ witness: w, value: read.value });\n }\n }\n return extras;\n}\n\nfunction summarizeExact<W extends string>(\n res: ExactResult<W>,\n r: InlineRenderers,\n): string {\n const parts = res.groups.map(\n g => `${r.value(g.value)} (${g.support}/${res.answered})`,\n );\n const body = parts.length > 0 ? parts.join(', ') : '—';\n if (res.missing.length > 0) {\n return `${body} · missing: ${res.missing.map(r.inline).join(', ')}`;\n }\n return body;\n}\n\nfunction summarizeTolerance<W extends string>(\n res: ToleranceResult<W>,\n r: InlineRenderers,\n): string {\n const parts: string[] = [];\n if (\n res.min !== undefined &&\n res.max !== undefined &&\n res.spread !== undefined\n ) {\n const cleanSpread = Number(res.spread.toPrecision(12));\n parts.push(`${res.min}–${res.max} (spread ${cleanSpread})`);\n }\n const groupText = res.groups.map(g => {\n const label = g.min === g.max ? String(g.min) : `${g.min}–${g.max}`;\n return `${label} (${g.support}/${res.answered})`;\n });\n if (res.nullGroup !== undefined) {\n groupText.push(`null (${res.nullGroup.support}/${res.answered})`);\n }\n if (groupText.length > 0) {\n parts.push(groupText.join(', '));\n }\n if (res.missing.length > 0) {\n parts.push(`missing: ${res.missing.map(r.inline).join(', ')}`);\n }\n return parts.length > 0 ? parts.join(' · ') : '—';\n}\n\nfunction summarizeSet<W extends string>(\n ledger: Ledger<unknown, W>,\n path: string | null,\n res: SetResult<W>,\n r: InlineRenderers,\n): string {\n const head = [\n `∩ ${res.intersection.length}`,\n `∪ ${res.union.length}`,\n ...(res.jaccard !== undefined ? [`J=${res.jaccard.toFixed(2)}`] : []),\n ].join(' · ');\n\n const interKeys = new Set(res.intersection.map(v => canonicalJson(v)));\n const nonInter = res.items\n .filter(item => !interKeys.has(canonicalJson(item.item)))\n .map(item => `${r.value(item.item)} (${item.support}/${res.answered})`);\n\n let text = nonInter.length > 0 ? `${head}: ${nonInter.join(', ')}` : head;\n if (res.nulls.length > 0) {\n text += ` · nulls: ${res.nulls.map(r.inline).join(', ')}`;\n }\n const nonArrays =\n path !== null ? findNonArrayRawValues(ledger, path, res) : [];\n if (nonArrays.length > 0) {\n text += ` · non-array: ${nonArrays.map(e => `${r.inline(e.witness)}=${r.value(e.value)}`).join(', ')}`;\n }\n if (res.missing.length > 0) {\n text += ` · missing: ${res.missing.map(r.inline).join(', ')}`;\n }\n return text;\n}\n\n/** Formats a leaf field result concisely (§11.1 item 4). */\nexport function summarizeLeafResult<W extends string>(\n ledger: Ledger<unknown, W>,\n path: string | null,\n res: LeafResult<W>,\n r: InlineRenderers,\n): string {\n switch (res.comparator) {\n case 'exact':\n return summarizeExact(res, r);\n case 'tolerance':\n return summarizeTolerance(res, r);\n case 'set':\n return summarizeSet(ledger, path, res, r);\n case 'none': {\n let text = `${r.inline(res.reason)}/${r.inline(res.detail)}`;\n if (\n res.duplicateKeyWitnesses !== undefined &&\n res.duplicateKeyWitnesses.length > 0\n ) {\n text += ` (${res.duplicateKeyWitnesses.map(r.inline).join(', ')})`;\n } else if (\n !(res.reason === 'policy' && res.detail === 'free-text') &&\n res.values.length > 0\n ) {\n text += `: ${res.values.map(v => `${r.inline(v.witness)}=${r.value(v.value)}`).join(', ')}`;\n }\n return text;\n }\n }\n}\n\n/** Formats any top-level `FieldResult` summary line (§11.1 item 4). */\nexport function summarizeFieldResult<W extends string>(\n ledger: Ledger<unknown, W>,\n path: string,\n res: FieldResult<W>,\n r: InlineRenderers,\n): string {\n if (res.comparator === 'keyed-set') {\n const head = [\n `key=${r.inline(res.key)}`,\n `∩ ${res.keys.intersection.length}`,\n `∪ ${res.keys.union.length}`,\n ...(res.keys.jaccard !== undefined\n ? [`J=${res.keys.jaccard.toFixed(2)}`]\n : []),\n ].join(' · ');\n const nonArrays = findNonArrayRawValues(ledger, path, res);\n if (nonArrays.length > 0) {\n return `${head} · non-array: ${nonArrays.map(e => `${r.inline(e.witness)}=${r.value(e.value)}`).join(', ')}`;\n }\n return head;\n }\n if (res.comparator === 'discriminated-union') {\n return `by ${r.inline(res.discriminator)}: ${summarizeExact(res.choice, r)}`;\n }\n return summarizeLeafResult(ledger, path, res, r);\n}\n\n/** Builds structured sub-rows for `keyed-set` and `discriminated-union` fields (§11.1 item 4). */\nexport function buildCompositeSubRows<W extends string>(\n ledger: Ledger<unknown, W>,\n path: string,\n res: KeyedSetResult<W> | UnionResult<W>,\n r: InlineRenderers,\n): Array<{\n heading: string;\n leaves: Array<{ subpath: string; summary: string }>;\n}> {\n const entries =\n res.comparator === 'keyed-set'\n ? res.items.map(item => ({\n heading: `key=${r.value(item.key)} (${item.witnesses.map(r.inline).join(', ')})`,\n fields: item.fields,\n }))\n : res.branches.map(branch => ({\n heading: `branch=${r.value(branch.value)} (${branch.witnesses.map(r.inline).join(', ')})`,\n fields: branch.fields,\n }));\n\n return entries.map(entry => ({\n heading: entry.heading,\n leaves: sortLabels(Object.keys(entry.fields)).map(subpath => ({\n subpath: r.inline(subpath),\n summary: summarizeLeafResult(\n ledger,\n res.comparator === 'discriminated-union' ? `${path}${subpath}` : null,\n ownValue<LeafResult<W>>(entry.fields, subpath)!,\n r,\n ),\n })),\n }));\n}\n\n/** Extracts non-empty Independence display rows (§11.1 item 6). */\nexport function buildIndependenceEntries<W extends string>(\n ind: Ledger<unknown, W>['independence'],\n escInline: (text: string) => string,\n): Array<{ label: string; value: string }> {\n const entries: Array<{ label: string; value: string }> = [];\n if (ind.uniqueRequestedProviders > 0) {\n entries.push({\n label: 'Unique requested providers',\n value: String(ind.uniqueRequestedProviders),\n });\n }\n if (ind.duplicateServedModels.length > 0) {\n entries.push({\n label: 'Duplicate served models',\n value: ind.duplicateServedModels\n .map(\n d =>\n `${escInline(d.canonicalId)} (${d.witnesses.map(escInline).join(', ')})`,\n )\n .join('; '),\n });\n }\n if (ind.sameProviderGroups.length > 0) {\n entries.push({\n label: 'Same-provider groups',\n value: ind.sameProviderGroups\n .map(\n g =>\n `${escInline(g.providerKey)} (${g.witnesses.map(escInline).join(', ')})`,\n )\n .join('; '),\n });\n }\n if (ind.selfGradingWitnesses.length > 0) {\n entries.push({\n label: 'Self-grading witnesses',\n value: ind.selfGradingWitnesses\n .map(\n s =>\n `${escInline(s.witness)} (${sanitizeInline(s.on)}=${escInline(s.authorModel)})`,\n )\n .join('; '),\n });\n }\n if (ind.excludedWitnesses.length > 0) {\n entries.push({\n label: 'Excluded witnesses',\n value: ind.excludedWitnesses\n .map(\n e =>\n `${escInline(e.witness)} (${sanitizeInline(e.stage)}, ${sanitizeInline(e.on)}=${escInline(e.authorModel)})`,\n )\n .join('; '),\n });\n }\n return entries;\n}\n\n/** Formats a finding's target (`path` / `within` / `subpath`) safely (§11.1 item 5). */\nexport function formatFindingTarget<W extends string>(\n finding: Finding<W>,\n r: InlineRenderers,\n): string {\n if (finding.path === undefined) return '—';\n let target = r.inline(finding.path);\n if (finding.within !== undefined) {\n target +=\n 'key' in finding.within\n ? ` [key=${r.value(finding.within.key)}]`\n : ` [branch=${r.value(finding.within.branch)}]`;\n }\n if (finding.subpath !== undefined) {\n target += ` ${r.inline(finding.subpath)}`;\n }\n return target;\n}\n","import { canonicalJson } from '../canonical/canonical-json.js';\nimport { ownValue, sortLabels } from '../compare/util.js';\nimport { sanitizeInline } from '../sanitize.js';\n\nimport type {\n FieldResult,\n Ledger,\n NotComparedResult,\n WitnessRecord,\n} from '../types.js';\n\nimport {\n buildCompositeSubRows,\n buildIndependenceEntries,\n escapeAsciiInline,\n formatAsciiBlock,\n formatAsciiValue,\n formatFindingTarget,\n formatSummaryLine,\n formatWitnessDetail,\n summarizeFieldResult,\n type InlineRenderers,\n} from './escape.js';\nimport type { ResolvedRenderOptions } from './format-markdown.js';\n\nconst RULE_MAJOR = '='.repeat(78);\nconst RULE_MINOR = '-'.repeat(78);\n\n/** Renders a Ledger (and optional Adjudication) as an ASCII cockpit report (§11.1–§11.3). */\nexport function formatAscii(\n ledger: Ledger<unknown, string>,\n options: ResolvedRenderOptions,\n): string {\n const { maxInlineChars, maxBlockChars, adjudication, showOutputs } = options;\n const esc = (text: string): string => escapeAsciiInline(text, maxInlineChars);\n const fmtVal = (val: Parameters<typeof formatAsciiValue>[0]): string =>\n formatAsciiValue(val, maxInlineChars);\n const renderers: InlineRenderers = { inline: esc, value: fmtVal };\n\n const cleanFp = sanitizeInline(ledger.fingerprint);\n const shortFp = cleanFp.length > 12 ? `${cleanFp.slice(0, 12)}…` : cleanFp;\n\n const lines: string[] = [];\n\n // 1. Header\n lines.push(RULE_MAJOR);\n lines.push('Dissent Ledger');\n lines.push(RULE_MAJOR);\n lines.push(`Protocol : ${sanitizeInline(ledger.protocol)}`);\n lines.push(`Fingerprint : ${shortFp}`);\n lines.push(`Created : ${sanitizeInline(ledger.createdAt)}`);\n lines.push('');\n\n // 2. Summary line\n lines.push(formatSummaryLine(ledger), '');\n\n // 3. Witnesses\n lines.push('Witnesses', RULE_MINOR);\n const witnessLabels = sortLabels(Object.keys(ledger.witnesses));\n for (const label of witnessLabels) {\n const rec = ownValue<WitnessRecord<unknown>>(ledger.witnesses, label)!;\n const req = esc(rec.requested.canonicalId);\n const served = rec.served !== null ? esc(rec.served.canonicalId) : '—';\n const detail = formatWitnessDetail(rec, esc);\n const tokens =\n rec.usage?.totalTokens !== null && rec.usage?.totalTokens !== undefined\n ? String(rec.usage.totalTokens)\n : '—';\n lines.push(\n `${esc(label)} : status=${sanitizeInline(rec.status)}, req=${req}, served=${served}, detail=${detail}, duration=${rec.durationMs}ms, tokens=${tokens}`,\n );\n }\n lines.push('');\n\n // 4. Fields\n lines.push('Fields', RULE_MINOR);\n const fieldPaths = sortLabels(Object.keys(ledger.fields));\n const freeTextFields: Array<{\n path: string;\n result: NotComparedResult<string>;\n }> = [];\n\n if (fieldPaths.length === 0) {\n lines.push('No fields.');\n } else {\n for (const path of fieldPaths) {\n const res = ownValue<FieldResult<string>>(ledger.fields, path)!;\n const summary = summarizeFieldResult(ledger, path, res, renderers);\n lines.push(\n `${esc(path)} : ${sanitizeInline(res.comparator)} [${sanitizeInline(res.status)}] -- ${summary}`,\n );\n if (\n res.comparator === 'keyed-set' ||\n res.comparator === 'discriminated-union'\n ) {\n for (const sub of buildCompositeSubRows(ledger, path, res, renderers)) {\n lines.push(` ${sub.heading}`);\n for (const leaf of sub.leaves) {\n lines.push(` ${leaf.subpath} : ${leaf.summary}`);\n }\n }\n } else if (\n res.comparator === 'none' &&\n res.reason === 'policy' &&\n res.detail === 'free-text' &&\n res.values.length > 0\n ) {\n freeTextFields.push({ path, result: res });\n }\n }\n }\n lines.push('');\n\n if (freeTextFields.length > 0) {\n lines.push('Read side by side', RULE_MINOR);\n for (const entry of freeTextFields) {\n for (const item of entry.result.values) {\n lines.push(`${esc(entry.path)} (${esc(item.witness)}) :`);\n const text =\n typeof item.value === 'string'\n ? item.value\n : canonicalJson(item.value);\n lines.push(formatAsciiBlock(text, maxBlockChars));\n }\n }\n lines.push('');\n }\n\n // 5. Findings\n lines.push('Findings', RULE_MINOR);\n if (ledger.findings.length === 0) {\n lines.push('None.');\n } else {\n for (const finding of ledger.findings) {\n const target = formatFindingTarget(finding, renderers);\n const witnesses =\n finding.witnesses !== undefined && finding.witnesses.length > 0\n ? finding.witnesses.map(esc).join(', ')\n : '—';\n lines.push(\n `${sanitizeInline(finding.severity)} : ${sanitizeInline(finding.code)}, target=${target}, witnesses=${witnesses}`,\n );\n }\n }\n lines.push('');\n\n // 6. Independence (only non-empty parts)\n const indEntries = buildIndependenceEntries(ledger.independence, esc);\n if (indEntries.length > 0) {\n lines.push('Independence', RULE_MINOR);\n for (const entry of indEntries) {\n lines.push(`${entry.label} : ${entry.value}`);\n }\n lines.push('');\n }\n\n // 7. Adjudication (if given)\n if (adjudication !== undefined) {\n const ae = adjudication.artifactEvidence;\n lines.push('Adjudication', RULE_MINOR);\n lines.push(\n `Verdict : ${sanitizeInline(adjudication.verdict)} (${sanitizeInline(adjudication.verdictReason)})`,\n );\n lines.push(\n `Artifact evidence : pass=${ae.pass}, fail=${ae.fail}, error=${ae.error}, unknown=${ae.unknown}`,\n );\n lines.push(`Unbound : ${adjudication.unbound.length}`);\n lines.push(`Conflicts : ${adjudication.conflicts.length}`);\n\n for (const s of adjudication.settlements) {\n const agree =\n s.witnessesAgreeing.length > 0\n ? s.witnessesAgreeing.map(esc).join(', ')\n : '—';\n const dissent =\n s.witnessesDissenting.length > 0\n ? s.witnessesDissenting.map(esc).join(', ')\n : '—';\n const silent =\n s.witnessesSilent.length > 0\n ? s.witnessesSilent.map(esc).join(', ')\n : '—';\n lines.push(\n ` ${esc(s.path)} : value=${fmtVal(s.value)}, source=${esc(s.source)}, outcome=${sanitizeInline(s.outcome)}, agree=[${agree}], dissent=[${dissent}], silent=[${silent}]`,\n );\n }\n\n for (const c of adjudication.conflicts) {\n lines.push(\n ` conflict ${esc(c.path)} : ${c.sources.map(esc).join(', ')}`,\n );\n }\n\n for (const rc of adjudication.receiptChecks) {\n const status = rc.check.valid\n ? 'valid'\n : `invalid (${sanitizeInline(rc.check.reason)})`;\n const rid = rc.receiptId !== null ? esc(rc.receiptId) : '—';\n lines.push(` receipt ${esc(rc.source)} : id=${rid}, ${status}`);\n }\n lines.push('');\n }\n\n // 8. Outputs (only with showOutputs)\n if (showOutputs) {\n lines.push('Outputs', RULE_MINOR);\n for (const label of witnessLabels) {\n const rec = ownValue<WitnessRecord<unknown>>(ledger.witnesses, label)!;\n if (rec.status !== 'answered') continue;\n lines.push(`${esc(label)} :`);\n const jsonText = JSON.stringify(rec.output, null, 2) ?? 'null';\n lines.push(formatAsciiBlock(jsonText, maxBlockChars));\n }\n lines.push('');\n }\n\n return `${lines.join('\\n').replace(/\\n+$/, '')}\\n`;\n}\n","import { canonicalJson } from '../canonical/canonical-json.js';\nimport { ownValue, sortLabels } from '../compare/util.js';\nimport { sanitizeInline } from '../sanitize.js';\n\nimport type {\n Adjudication,\n FieldResult,\n Ledger,\n NotComparedResult,\n WitnessRecord,\n} from '../types.js';\n\nimport {\n buildCompositeSubRows,\n buildIndependenceEntries,\n escapeMarkdownInline,\n formatFindingTarget,\n formatMarkdownBlock,\n formatMarkdownValue,\n formatSummaryLine,\n formatWitnessDetail,\n summarizeFieldResult,\n type InlineRenderers,\n} from './escape.js';\n\nexport type ResolvedRenderOptions = {\n adjudication?: Adjudication;\n maxInlineChars: number;\n maxBlockChars: number;\n showOutputs: boolean;\n};\n\n/** Renders a Ledger (and optional Adjudication) as GitHub-Flavored Markdown (§11.1–§11.3). */\nexport function formatMarkdown(\n ledger: Ledger<unknown, string>,\n options: ResolvedRenderOptions,\n): string {\n const { maxInlineChars, maxBlockChars, adjudication, showOutputs } = options;\n const esc = (text: string): string =>\n escapeMarkdownInline(text, maxInlineChars);\n const fmtVal = (val: Parameters<typeof formatMarkdownValue>[0]): string =>\n formatMarkdownValue(val, maxInlineChars);\n const renderers: InlineRenderers = { inline: esc, value: fmtVal };\n\n const lines: string[] = [];\n\n // 1. Header\n lines.push('## Dissent Ledger', '');\n lines.push(`- **Protocol:** ${sanitizeInline(ledger.protocol)}`);\n lines.push(`- **Fingerprint:** ${sanitizeInline(ledger.fingerprint)}`);\n lines.push(`- **Created:** ${sanitizeInline(ledger.createdAt)}`);\n lines.push('');\n\n // 2. Summary line\n lines.push(formatSummaryLine(ledger), '');\n\n // 3. Witnesses\n lines.push('### Witnesses', '');\n lines.push(\n '| Label | Requested | Served | Status | Detail | Duration | Tokens |',\n );\n lines.push('|---|---|---|---|---|---:|---:|');\n const witnessLabels = sortLabels(Object.keys(ledger.witnesses));\n for (const label of witnessLabels) {\n const rec = ownValue<WitnessRecord<unknown>>(ledger.witnesses, label)!;\n const req = esc(rec.requested.canonicalId);\n const served = rec.served !== null ? esc(rec.served.canonicalId) : '—';\n const detail = formatWitnessDetail(rec, esc);\n const tokens =\n rec.usage?.totalTokens !== null && rec.usage?.totalTokens !== undefined\n ? String(rec.usage.totalTokens)\n : '—';\n lines.push(\n `| ${esc(label)} | ${req} | ${served} | ${sanitizeInline(rec.status)} | ${detail} | ${rec.durationMs}ms | ${tokens} |`,\n );\n }\n lines.push('');\n\n // 4. Fields\n lines.push('### Fields', '');\n const fieldPaths = sortLabels(Object.keys(ledger.fields));\n const compositeDetails: Array<{\n path: string;\n subRows: ReturnType<typeof buildCompositeSubRows>;\n }> = [];\n const freeTextFields: Array<{\n path: string;\n result: NotComparedResult<string>;\n }> = [];\n\n if (fieldPaths.length === 0) {\n lines.push('No fields.', '');\n } else {\n lines.push('| Path | Comparator | Status | Summary |');\n lines.push('|---|---|---|---|');\n for (const path of fieldPaths) {\n const res = ownValue<FieldResult<string>>(ledger.fields, path)!;\n const summary = summarizeFieldResult(ledger, path, res, renderers);\n lines.push(\n `| ${esc(path)} | ${sanitizeInline(res.comparator)} | ${sanitizeInline(res.status)} | ${summary} |`,\n );\n if (\n res.comparator === 'keyed-set' ||\n res.comparator === 'discriminated-union'\n ) {\n compositeDetails.push({\n path,\n subRows: buildCompositeSubRows(ledger, path, res, renderers),\n });\n } else if (\n res.comparator === 'none' &&\n res.reason === 'policy' &&\n res.detail === 'free-text' &&\n res.values.length > 0\n ) {\n freeTextFields.push({ path, result: res });\n }\n }\n lines.push('');\n }\n\n for (const detail of compositeDetails) {\n if (detail.subRows.length === 0) continue;\n lines.push(`#### ${esc(detail.path)}`, '');\n for (const sub of detail.subRows) {\n lines.push(`- ${sub.heading}`);\n for (const leaf of sub.leaves) {\n lines.push(` - ${leaf.subpath}: ${leaf.summary}`);\n }\n }\n lines.push('');\n }\n\n if (freeTextFields.length > 0) {\n lines.push('### Read side by side', '');\n for (const entry of freeTextFields) {\n for (const item of entry.result.values) {\n lines.push(`- **${esc(entry.path)} — ${esc(item.witness)}:**`, '');\n const text =\n typeof item.value === 'string'\n ? item.value\n : canonicalJson(item.value);\n lines.push(formatMarkdownBlock(text, maxBlockChars), '');\n }\n }\n }\n\n // 5. Findings\n lines.push('### Findings', '');\n if (ledger.findings.length === 0) {\n lines.push('None.', '');\n } else {\n lines.push('| Severity | Code | Target | Witnesses |');\n lines.push('|---|---|---|---|');\n for (const finding of ledger.findings) {\n const target = formatFindingTarget(finding, renderers);\n const witnesses =\n finding.witnesses !== undefined && finding.witnesses.length > 0\n ? finding.witnesses.map(esc).join(', ')\n : '—';\n lines.push(\n `| ${sanitizeInline(finding.severity)} | ${sanitizeInline(finding.code)} | ${target} | ${witnesses} |`,\n );\n }\n lines.push('');\n }\n\n // 6. Independence (only non-empty parts)\n const indEntries = buildIndependenceEntries(ledger.independence, esc);\n if (indEntries.length > 0) {\n lines.push('### Independence', '');\n for (const entry of indEntries) {\n lines.push(`- **${entry.label}:** ${entry.value}`);\n }\n lines.push('');\n }\n\n // 7. Adjudication (if given)\n if (adjudication !== undefined) {\n const ae = adjudication.artifactEvidence;\n lines.push('### Adjudication', '');\n lines.push(\n `- **Verdict:** ${sanitizeInline(adjudication.verdict)} (${sanitizeInline(adjudication.verdictReason)})`,\n );\n lines.push(\n `- **Artifact evidence:** pass=${ae.pass}, fail=${ae.fail}, error=${ae.error}, unknown=${ae.unknown}`,\n );\n lines.push(`- **Unbound:** ${adjudication.unbound.length}`);\n lines.push(`- **Conflicts:** ${adjudication.conflicts.length}`);\n lines.push('');\n\n if (adjudication.settlements.length > 0) {\n lines.push(\n '| Path | Value | Source | Outcome | Agreeing | Dissenting | Silent |',\n );\n lines.push('|---|---|---|---|---|---|---|');\n for (const s of adjudication.settlements) {\n const agree =\n s.witnessesAgreeing.length > 0\n ? s.witnessesAgreeing.map(esc).join(', ')\n : '—';\n const dissent =\n s.witnessesDissenting.length > 0\n ? s.witnessesDissenting.map(esc).join(', ')\n : '—';\n const silent =\n s.witnessesSilent.length > 0\n ? s.witnessesSilent.map(esc).join(', ')\n : '—';\n lines.push(\n `| ${esc(s.path)} | ${fmtVal(s.value)} | ${esc(s.source)} | ${sanitizeInline(s.outcome)} | ${agree} | ${dissent} | ${silent} |`,\n );\n }\n lines.push('');\n }\n\n if (adjudication.conflicts.length > 0) {\n for (const c of adjudication.conflicts) {\n lines.push(\n `- **Conflict** ${esc(c.path)}: ${c.sources.map(esc).join(', ')}`,\n );\n }\n lines.push('');\n }\n\n if (adjudication.receiptChecks.length > 0) {\n lines.push('| Source | Receipt ID | Check |');\n lines.push('|---|---|---|');\n for (const rc of adjudication.receiptChecks) {\n const status = rc.check.valid\n ? 'valid'\n : `invalid (${sanitizeInline(rc.check.reason)})`;\n const rid = rc.receiptId !== null ? esc(rc.receiptId) : '—';\n lines.push(`| ${esc(rc.source)} | ${rid} | ${status} |`);\n }\n lines.push('');\n }\n }\n\n // 8. Outputs (only with showOutputs)\n if (showOutputs) {\n lines.push('### Outputs', '');\n for (const label of witnessLabels) {\n const rec = ownValue<WitnessRecord<unknown>>(ledger.witnesses, label)!;\n if (rec.status !== 'answered') continue;\n lines.push(`- **${esc(label)}:**`, '');\n const jsonText = JSON.stringify(rec.output, null, 2) ?? 'null';\n lines.push(formatMarkdownBlock(jsonText, maxBlockChars), '');\n }\n }\n\n return `${lines.join('\\n').replace(/\\n+$/, '')}\\n`;\n}\n","import { isPlainObject } from '../compare/util.js';\nimport { DissentArgumentError } from '../errors.js';\n\nimport type { FormatLedgerOptions, Ledger } from '../types.js';\n\nimport { formatAscii } from './format-ascii.js';\nimport {\n formatMarkdown,\n type ResolvedRenderOptions,\n} from './format-markdown.js';\n\nconst DEFAULT_MAX_INLINE_CHARS = 120;\nconst DEFAULT_MAX_BLOCK_CHARS = 4000;\n\nfunction readPositiveIntOption(\n value: number | undefined,\n fallback: number,\n name: string,\n): number {\n if (value === undefined) return fallback;\n if (typeof value !== 'number' || !Number.isInteger(value) || value < 1) {\n throw new DissentArgumentError('invalid-option', name);\n }\n return value;\n}\n\n/**\n * Renders a `Ledger` as Markdown or ASCII without reading the clock, environment, or network (§11).\n */\nexport function formatLedger(\n ledger: Ledger<unknown, string>,\n options?: FormatLedgerOptions,\n): string {\n if (options !== undefined && !isPlainObject(options)) {\n throw new DissentArgumentError('invalid-option', 'options');\n }\n\n const format = options?.format ?? 'markdown';\n if (format !== 'markdown' && format !== 'ascii') {\n throw new DissentArgumentError('invalid-option', 'format');\n }\n\n if (\n options?.showOutputs !== undefined &&\n typeof options.showOutputs !== 'boolean'\n ) {\n throw new DissentArgumentError('invalid-option', 'showOutputs');\n }\n\n const resolved: ResolvedRenderOptions = {\n maxInlineChars: readPositiveIntOption(\n options?.maxInlineChars,\n DEFAULT_MAX_INLINE_CHARS,\n 'maxInlineChars',\n ),\n maxBlockChars: readPositiveIntOption(\n options?.maxBlockChars,\n DEFAULT_MAX_BLOCK_CHARS,\n 'maxBlockChars',\n ),\n showOutputs: options?.showOutputs === true,\n };\n if (options?.adjudication !== undefined) {\n resolved.adjudication = options.adjudication;\n }\n\n return format === 'markdown'\n ? formatMarkdown(ledger, resolved)\n : formatAscii(ledger, resolved);\n}\n"],"mappings":";;AAAA,MAAM,cAAc,OAAO,IAAI,4BAA4B;AAC3D,MAAM,kBAAkB,OAAO,IAAI,oCAAoC;AACvE,MAAM,kBAAkB,OAAO,IAAI,iCAAiC;AAEpE,SAAS,UAAU,OAAgB,QAAyB;CAC1D,OACE,OAAO,UAAU,YACjB,UAAU,QACT,MAAkC,YAAY;AAEnD;AAEA,IAAa,eAAb,cAAkC,MAAM;CACtC,CAAU,eAAe;CAEzB,YAAY,SAAiB,SAA+B;EAC1D,MAAM,SAAS,OAAO;EACtB,KAAK,OAAO;CACd;CAEA,OAAO,WAAW,OAAuC;EACvD,OAAO,UAAU,OAAO,WAAW;CACrC;AACF;AAqBA,IAAa,uBAAb,cAA0C,aAAa;CACrD,CAAU,mBAAmB;CAEpB;;CAEA;CAET,YAAY,MAA2B,UAAkB,SAAkB;EACzE,MAAM,WAAW,qBAAqB,SAAS,KAAK,MAAM;EAC1D,KAAK,OAAO;EACZ,KAAK,OAAO;EACZ,KAAK,WAAW;CAClB;CAEA,OAAgB,WAAW,OAA+C;EACxE,OAAO,UAAU,OAAO,eAAe;CACzC;AACF;;AAGA,IAAa,oBAAb,cAAuC,aAAa;CAClD,CAAU,mBAAmB;;CAGpB;;CAEA;CAET,YAAY,MAAc,OAAe;EACvC,MACE,aAAa,SAAS,KAAK,WAAW,KAAK,4BAA4B,OACzE;EACA,KAAK,OAAO;EACZ,KAAK,OAAO;EACZ,KAAK,QAAQ;CACf;CAEA,OAAgB,WAAW,OAA4C;EACrE,OAAO,UAAU,OAAO,eAAe;CACzC;AACF;;;AClFA,SAAgB,mBAAmB,OAAuB;CACxD,OAAO,MAAM,WAAW,KAAK,IAAI,CAAC,CAAC,WAAW,KAAK,IAAI;AACzD;;AAGA,SAAgB,qBAAqB,OAAuB;CAC1D,IAAI,YAAY,KAAK,KAAK,GACxB,MAAM,IAAI,YAAY,+BAA+B,OAAO;CAE9D,OAAO,MAAM,WAAW,MAAM,GAAG,CAAC,CAAC,WAAW,MAAM,GAAG;AACzD;;AAGA,SAAgB,cAAc,SAAiB,OAAuB;CACpE,OAAO,GAAG,QAAQ,GAAG,mBAAmB,KAAK;AAC/C;;AAGA,SAAgB,aAAa,SAA2B;CACtD,IAAI,YAAY,IAAI,OAAO,CAAC;CAC5B,IAAI,CAAC,QAAQ,WAAW,GAAG,GACzB,MAAM,IAAI,YACR,iDAAiD,SACnD;CAEF,OAAO,QAAQ,MAAM,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,oBAAoB;AAC7D;;;;;AAMA,SAAgB,cAAc,YAA4B;CACxD,OAAO,WAAW,WAAW,GAAG,IAC5B,aACA,IAAI,mBAAmB,UAAU;AACvC;;;;;;;AC3BA,SAAgB,cAAc,OAAwB;CACpD,OAAO,UAAU,OAAO,IAAI,mBAAG,IAAI,QAAgB,CAAC;AACtD;AAEA,SAAS,UACP,OACA,MACA,OACA,OACQ;CACR,QAAQ,OAAO,OAAf;EACE,KAAK,UACH,OAAO,KAAK,UAAU,KAAK;EAC7B,KAAK,WACH,OAAO,QAAQ,SAAS;EAC1B,KAAK;GACH,IAAI,OAAO,MAAM,KAAK,GAAG,MAAM,IAAI,kBAAkB,MAAM,KAAK;GAChE,IAAI,CAAC,OAAO,SAAS,KAAK,GACxB,MAAM,IAAI,kBAAkB,MAAM,UAAU;GAC9C,OAAO,KAAK,UAAU,KAAK;EAC7B,KAAK,UACH,MAAM,IAAI,kBAAkB,MAAM,QAAQ;EAC5C,KAAK,YACH,MAAM,IAAI,kBAAkB,MAAM,UAAU;EAC9C,KAAK,UACH,MAAM,IAAI,kBAAkB,MAAM,QAAQ;EAC5C,KAAK,aACH,MAAM,IAAI,kBAAkB,MAAM,WAAW;CAGjD;CACA,IAAI,UAAU,MAAM,OAAO;CAE3B,MAAM,SAAS;CACf,IAAI,SAAA,IAA0B,MAAM,IAAI,kBAAkB,MAAM,OAAO;CACvE,IAAI,MAAM,IAAI,MAAM,GAAG,MAAM,IAAI,kBAAkB,MAAM,OAAO;CAEhE,MAAM,UAAU,MAAM,QAAQ,MAAM;CACpC,IAAI,CAAC,SAAS;EACZ,MAAM,QAAQ,OAAO,eAAe,MAAM;EAC1C,IAAI,UAAU,OAAO,aAAa,UAAU,MAC1C,MAAM,IAAI,kBAAkB,MAAM,SAAS,MAAM,CAAC;CAEtD;CAEA,MAAM,IAAI,MAAM;CAChB,IAAI;EACF,IAAI,SAAS;GACX,MAAM,QAAkB,CAAC;GACzB,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,KAAK;IACtC,MAAM,WAAW,GAAG,KAAK,GAAG;IAC5B,IAAI,CAAC,OAAO,OAAO,QAAQ,CAAC,KAAK,OAAO,OAAO,KAAA,GAC7C,MAAM,IAAI,kBAAkB,UAAU,oBAAoB;IAE5D,MAAM,KAAK,UAAU,OAAO,IAAI,UAAU,QAAQ,GAAG,KAAK,CAAC;GAC7D;GACA,OAAO,IAAI,MAAM,KAAK,GAAG,EAAE;EAC7B;EAEA,MAAM,SAAS;EACf,MAAM,OAAO,OAAO,KAAK,MAAM,CAAC,CAE7B,KAAK,YAAY;EACpB,MAAM,UAAoB,CAAC;EAC3B,KAAK,MAAM,OAAO,MAAM;GAEtB,MAAM,aAAa,OAAO,yBAAyB,QAAQ,GAAG;GAC9D,IAAI,eAAe,KAAA,KAAa,EAAE,WAAW,aAC3C,MAAM,IAAI,kBAAkB,cAAc,MAAM,GAAG,GAAG,UAAU;GAElE,MAAM,SAAS,YAAY;GAC3B,IAAI,WAAW,KAAA,GAAW;GAC1B,QAAQ,KACN,GAAG,KAAK,UAAU,GAAG,EAAE,GAAG,UAAU,QAAQ,cAAc,MAAM,GAAG,GAAG,QAAQ,GAAG,KAAK,GACxF;EACF;EACA,OAAO,IAAI,QAAQ,KAAK,GAAG,EAAE;CAC/B,UAAU;EACR,MAAM,OAAO,MAAM;CACrB;AACF;;AAGA,SAAgB,aAAa,GAAW,GAAmB;CACzD,OAAO,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI;AAClC;AAEA,SAAS,SAAS,QAAwB;CACxC,IAAI,kBAAkB,MAAM,OAAO;CACnC,IAAI,kBAAkB,KAAK,OAAO;CAClC,IAAI,kBAAkB,KAAK,OAAO;CAClC,IAAI,kBAAkB,QAAQ,OAAO;CACrC,MAAM,OAAQ,OAAgD,aAC1D;CACJ,OAAO,OAAO,SAAS,YAAY,SAAS,KACxC,kBAAkB,SAClB;AACN;;;AC3GA,eAAsB,UAAU,MAA+B;CAC7D,OAAO,WAAW,MAAM,OAAO,IAAI,YAAY,CAAC,CAAC,OAAO,IAAI,CAAC,CAAC;AAChE;;AAGA,eAAsB,eAAe,OAAoC;CACvE,OAAO,WAAW,MAAM,OAAO,KAAK,CAAC;AACvC;AAEA,eAAe,OAAO,OAAwC;CAC5D,OAAO,IAAI,WACT,MAAM,WAAW,OAAO,OAAO,OAC7B,WACA,KACF,CACF;AACF;AAEA,SAAS,WAAW,OAA2B;CAC7C,IAAI,MAAM;CACV,KAAK,MAAM,QAAQ,OAAO,OAAO,KAAK,SAAS,EAAE,CAAC,CAAC,SAAS,GAAG,GAAG;CAClE,OAAO;AACT;;;;;;;;ACTA,eAAsB,SACpB,OACA,WACA,UACoB;CACpB,OAAO,IAAI,OAAO,WAAW,UAAU,mBAAG,IAAI,QAAgB,CAAC;AACjE;AAEA,eAAe,IACb,OACA,WACA,UACA,OACA,OACoB;CACpB,IAAI,OAAO,UAAU,UACnB,OAAO,YACH,MAAM,WAAW,QAAQ,IAAI,CAAC,CAAC,WAAW,MAAM,IAAI,IACpD;CAEN,IAAI,UAAU,QAAQ,OAAO,UAAU,WAAW,OAAO;CACzD,IAAI,OAAO,UAAU,UAAU;EAC7B,IAAI,OAAO,SAAS,KAAK,GAAG,OAAO;EACnC,MAAM,QAAQ,UAAU,mBAAmB;CAC7C;CACA,IAAI,OAAO,UAAU,UAAU,MAAM,QAAQ,UAAU,OAAO,KAAK;CAEnE,IAAI,iBAAiB,aACnB,OAAO,UAAU,IAAI,WAAW,KAAK,CAAC;CAExC,IAAI,YAAY,OAAO,KAAK,GAC1B,OAAO,UACL,IAAI,WAAW,MAAM,QAAQ,MAAM,YAAY,MAAM,UAAU,CACjE;CAEF,IAAI,iBAAiB,KAAK,OAAO,EAAE,MAAM,MAAM,KAAK;CAEpD,IAAI,SAAA,IAA0B,MAAM,QAAQ,UAAU,kBAAkB;CACxE,IAAI,MAAM,IAAI,KAAK,GAAG,MAAM,QAAQ,UAAU,OAAO;CAErD,MAAM,IAAI,KAAK;CACf,IAAI;EACF,IAAI,MAAM,QAAQ,KAAK,GAAG;GACxB,MAAM,MAAmB,CAAC;GAC1B,KAAK,MAAM,QAAQ,OACjB,IAAI,KAAK,MAAM,IAAI,MAAM,WAAW,UAAU,QAAQ,GAAG,KAAK,CAAC;GAEjE,OAAO;EACT;EACA,MAAM,QAAQ,OAAO,eAAe,KAAK;EACzC,IAAI,UAAU,OAAO,aAAa,UAAU,MAC1C,MAAM,QAAQ,UAAU,kBAAkB;EAE5C,MAAM,MAAiC,CAAC;EACxC,KAAK,MAAM,OAAO,OAAO,KAAK,KAAK,GAAG;GACpC,MAAM,SAAU,MAAkC;GAClD,IAAI,WAAW,KAAA,GAAW;GAE1B,OAAO,eAAe,KAAK,KAAK;IAC9B,OAAO,MAAM,IAAI,QAAQ,WAAW,UAAU,QAAQ,GAAG,KAAK;IAC9D,YAAY;IACZ,UAAU;IACV,cAAc;GAChB,CAAC;EACH;EACA,OAAO;CACT,UAAU;EACR,MAAM,OAAO,KAAK;CACpB;AACF;AAEA,eAAe,UAAU,OAAuC;CAC9D,OAAO,EACL,QAAQ;EAAE,QAAQ,MAAM,eAAe,KAAK;EAAG,QAAQ,MAAM;CAAW,EAC1E;AACF;AAEA,SAAS,QACP,UACA,MACsB;CACtB,OAAO,IAAI,qBACT,kBACA,UACA,IAAI,SAAS,4CAA4C,KAAK,GAChE;AACF;;AChGA,SAAgB,mBAAmB,OAA6B;CAC9D,IAAI,OAAO,UAAU,UACnB,OAAO,UAAU,IAAI,IAAI;CAE3B,IAAI,MAAM,QAAQ,KAAK,GAAG;EACxB,IAAI,UAAU;EACd,MAAM,OAAoB,CAAC;EAC3B,KAAK,MAAM,QAAQ,OAAO;GACxB,MAAM,OAAO,mBAAmB,IAAiB;GACjD,IAAI,CAAC,OAAO,GAAG,MAAM,IAAI,GAAG,UAAU;GACtC,KAAK,KAAK,IAAI;EAChB;EACA,OAAO,UAAU,OAAO;CAC1B;CACA,IAAI,cAAc,KAAK,GAAG;EACxB,MAAM,OAAO,OAAO,KAAK,KAAK;EAC9B,MAAM,MAAM,OAAO,OAAO,IAAI;EAC9B,IAAI,UAAU;EACd,KAAK,MAAM,KAAK,MAAM;GACpB,MAAM,OAAO,SAAoB,OAAO,CAAC;GACzC,IAAI,SAAS,KAAA,GAAW;IACtB,UAAU;IACV;GACF;GACA,MAAM,OAAO,mBAAmB,IAAI;GACpC,IAAI,CAAC,OAAO,GAAG,MAAM,IAAI,GAAG,UAAU;GACtC,OAAO,eAAe,KAAK,GAAG;IAC5B,OAAO;IACP,YAAY;IACZ,UAAU;IACV,cAAc;GAChB,CAAC;EACH;EACA,OAAO,UAAU,MAAM;CACzB;CACA,OAAO;AACT;AAEA,SAAgB,cACd,OACkC;CAClC,IAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,MAAM,QAAQ,KAAK,GACpE,OAAO;CAET,MAAM,QAAQ,OAAO,eAAe,KAAK;CACzC,OAAO,UAAU,OAAO,aAAa,UAAU;AACjD;AAEA,SAAgB,SACd,OACA,KACK;CAEL,OAAO,MAAM,MAAM,CAAC,CAAC,KAAK,GAAG;AAC/B;AAEA,SAAgB,WAA6B,QAA2B;CACtE,OAAO,SAAS,QAAQ,YAAY;AACtC;AAEA,SAAgB,SAAsB,KAAa,KAA4B;CAC7E,OAAO,OAAO,yBAAyB,KAAK,GAAG,CAAC,EAAE;AACpD;AAEA,SAAgB,wBACd,SACmB;CACnB,MAAM,SAAS,SAAS,UAAU,GAAG,MAAM,aAAa,EAAE,IAAI,EAAE,EAAE,CAAC;CACnE,MAAM,MAAM,OAAO,OAAO,IAAI;CAC9B,KAAK,MAAM,CAAC,KAAK,UAAU,QACzB,OAAO,eAAe,KAAK,KAAK;EAC9B;EACA,YAAY;EACZ,UAAU;EACV,cAAc;CAChB,CAAC;CAEH,OAAO;AACT;;;;;;ACpEA,SAAgB,gBACd,GACA,GACA,WACS;CACT,MAAM,MAAM,UAAU,YAAY;CAClC,MAAM,MAAM,UAAU,YAAY;CAClC,OAAO,KAAK,IAAI,IAAI,CAAC,KAAK,MAAM,MAAM,KAAK,IAAI,KAAK,IAAI,CAAC,GAAG,KAAK,IAAI,CAAC,CAAC;AACzE;AAEA,SAAS,gBAAgB,GAAmB;CAC1C,OAAO,MAAM,IAAI,IAAI;AACvB;;;;AAKA,SAAgB,iBAAmC,QAO5B;CACrB,MAAM,EAAE,UAAU,WAAW,SAAS,OAAO,eAAe,cAC1D;CAEF,MAAM,2BAAW,IAAI,IAAiB;CACtC,MAAM,gBAAqB,CAAC;CAE5B,KAAK,MAAM,SAAS,eAClB,IAAI,MAAM,UAAU,MAClB,cAAc,KAAK,MAAM,OAAO;MAC3B,IACL,OAAO,MAAM,UAAU,YACvB,OAAO,SAAS,MAAM,KAAK,GAC3B;EACA,MAAM,MAAM,gBAAgB,MAAM,KAAK;EACvC,MAAM,OAAO,SAAS,IAAI,GAAG;EAC7B,IAAI,SAAS,KAAA,GACX,SAAS,IAAI,KAAK,CAAC,MAAM,OAAO,CAAC;OAEjC,KAAK,KAAK,MAAM,OAAO;CAE3B;CAGF,MAAM,kBAAkB,SACtB,MAAM,KAAK,SAAS,KAAK,CAAC,IACzB,GAAG,MAAM,IAAI,CAChB;CAGA,MAAM,SAAuC,CAAC;CAC9C,IAAI,gBAAgB,SAAS,GAAG;EAC9B,IAAI,gBAAiC,CAAC;EACtC,IAAI,aAAa,gBAAgB;EACjC,IAAI,aAAa,gBAAgB;EACjC,IAAI,iBAAiB;EAErB,KAAK,IAAI,IAAI,GAAG,IAAI,gBAAgB,QAAQ,KAAK;GAC/C,MAAM,MAAM,gBAAgB;GAC5B,MAAM,YAAY,WAAW,SAAS,IAAI,GAAG,CAAE;GAC/C,MAAM,aAA4B;IAChC,OAAO;IACP;IACA,SAAS,UAAU;GACrB;GAEA,IAAI,MAAM,GAAG;IACX,gBAAgB,CAAC,UAAU;IAC3B,aAAa;IACb,aAAa;IACb,iBAAiB,UAAU;GAC7B,OAAO,IAAI,gBAAgB,gBAAgB,IAAI,IAAK,KAAK,SAAS,GAAG;IACnE,cAAc,KAAK,UAAU;IAC7B,aAAa;IACb,kBAAkB,UAAU;GAC9B,OAAO;IACL,OAAO,KAAK;KACV,KAAK;KACL,KAAK;KACL,QAAQ;KACR,SAAS;IACX,CAAC;IACD,gBAAgB,CAAC,UAAU;IAC3B,aAAa;IACb,aAAa;IACb,iBAAiB,UAAU;GAC7B;EACF;EAEA,OAAO,KAAK;GACV,KAAK;GACL,KAAK;GACL,QAAQ;GACR,SAAS;EACX,CAAC;CACH;CAGA,IAAI,iBAAiB;CACrB,KAAK,IAAI,IAAI,GAAG,IAAI,gBAAgB,UAAU,gBAAgB,KAC5D,KAAK,IAAI,IAAI,IAAI,GAAG,IAAI,gBAAgB,QAAQ,KAC9C,IACE,CAAC,gBAAgB,gBAAgB,IAAK,gBAAgB,IAAK,SAAS,GACpE;EACA,iBAAiB;EACjB;CACF;CAIJ,IAAI;CACJ,IAAI,UAAU,SAAS,GACrB,SAAS;MACJ,IAAI,cAAc,WAAW,GAClC,SAAS,iBAAiB,UAAU;MAC/B,IAAI,gBAAgB,WAAW,GACpC,SAAS;MAET,SAAS;CAGX,MAAM,MAA0B;EAC9B,YAAY;EACZ;EACA;EACA;EACA;EACA;EACA;EACA;CACF;CAEA,IAAI,gBAAgB,SAAS,GAAG;EAC9B,MAAM,MAAM,gBAAgB;EAC5B,MAAM,MAAM,gBAAgB,gBAAgB,SAAS;EACrD,IAAI,MAAM;EACV,IAAI,MAAM;EACV,IAAI,SAAS,gBAAgB,MAAM,GAAG;CACxC;CAEA,IAAI,cAAc,SAAS,GAAG;EAC5B,MAAM,sBAAsB,WAAW,aAAa;EACpD,IAAI,YAAY;GACd,WAAW;GACX,SAAS,oBAAoB;EAC/B;CACF;CAEA,OAAO;AACT;;;;;;;ACjIA,SAAgB,cACd,MACA,SAC0D;CAC1D,IAAI,YAAY,IACd,OAAO;EAAE,SAAS;EAAM,OAAO;CAAK;CAEtC,IAAI,MAAe;CACnB,KAAK,MAAM,OAAO,aAAa,OAAO,GAAG;EACvC,IAAI,CAAC,cAAc,GAAG,KAAK,CAAC,OAAO,OAAO,KAAK,GAAG,GAChD,OAAO,EAAE,SAAS,MAAM;EAE1B,MAAM,OAAO,SAAS,KAAK,GAAG;EAC9B,IAAI,SAAS,KAAA,GACX,OAAO,EAAE,SAAS,MAAM;EAE1B,MAAM;CACR;CACA,OAAO;EAAE,SAAS;EAAM,OAAO;CAAiB;AAClD;AASA,SAAS,gBACP,SACA,SACsB;CACtB,MAAM,YAAiB,CAAC;CACxB,MAAM,UAAe,CAAC;CACtB,MAAM,QAAa,CAAC;CACpB,MAAM,gBAAyD,CAAC;CAEhE,KAAK,MAAM,SAAS,SAAS;EAC3B,MAAM,OAAO,cAAc,MAAM,QAAQ,OAAO;EAChD,IAAI,CAAC,KAAK,SAAS;GACjB,QAAQ,KAAK,MAAM,OAAO;GAC1B;EACF;EACA,MAAM,QAAQ,mBAAmB,KAAK,KAAK;EAC3C,UAAU,KAAK,MAAM,OAAO;EAC5B,IAAI,UAAU,MACZ,MAAM,KAAK,MAAM,OAAO;EAE1B,cAAc,KAAK;GAAE,SAAS,MAAM;GAAS;EAAM,CAAC;CACtD;CAEA,OAAO;EACL,WAAW,WAAW,SAAS;EAC/B,SAAS,WAAW,OAAO;EAC3B,OAAO,WAAW,KAAK;EACvB,eAAe,SAAS,gBAAgB,GAAG,MACzC,aAAa,EAAE,SAAS,EAAE,OAAO,CACnC;CACF;AACF;AAEA,SAAS,iBACP,eACiB;CACjB,MAAM,0BAAU,IAAI,IAAkD;CACtE,KAAK,MAAM,SAAS,eAAe;EACjC,MAAM,MAAM,cAAc,MAAM,KAAK;EACrC,MAAM,WAAW,QAAQ,IAAI,GAAG;EAChC,IAAI,aAAa,KAAA,GACf,QAAQ,IAAI,KAAK;GAAE,OAAO,MAAM;GAAO,WAAW,CAAC,MAAM,OAAO;EAAE,CAAC;OAEnE,SAAS,UAAU,KAAK,MAAM,OAAO;CAEzC;CAEA,OAAO,WAAW,MAAM,KAAK,QAAQ,KAAK,CAAC,CAAC,CAAC,CAAC,KAAI,MAAK;EACrD,MAAM,QAAQ,QAAQ,IAAI,CAAC;EAC3B,MAAM,YAAY,WAAW,MAAM,SAAS;EAC5C,OAAO;GAAE,OAAO,MAAM;GAAO;GAAW,SAAS,UAAU;EAAO;CACpE,CAAC;AACH;AAEA,SAAS,aACP,UACA,UACgB;CAChB,MAAM,SAAS,iBAAiB,SAAS,aAAa;CAQtD,OAAO;EACL,YAAY;EACZ,QARA,SAAS,UAAU,SAAS,IACxB,iBACA,OAAO,WAAW,IAChB,UACA;EAKN;EACA,WAAW,SAAS;EACpB,SAAS,SAAS;EAClB,OAAO,SAAS;EAChB;CACF;AACF;AAUA,SAAS,eACP,eACA,gBAAgB,GACJ;CACZ,MAAM,0BAAU,IAAI,IAAiD;CACrE,MAAM,aAAkB,CAAC;CAEzB,KAAK,MAAM,SAAS,eAAe;EACjC,MAAM,uBAAO,IAAI,IAAY;EAC7B,IAAI,SAAS;EACb,KAAK,MAAM,WAAW,MAAM,QAAQ;GAClC,MAAM,OAAO,mBAAmB,OAAO;GACvC,MAAM,MAAM,cAAc,IAAI;GAC9B,IAAI,KAAK,IAAI,GAAG,GAAG;IACjB,SAAS;IACT;GACF;GACA,KAAK,IAAI,GAAG;GACZ,MAAM,WAAW,QAAQ,IAAI,GAAG;GAChC,IAAI,aAAa,KAAA,GACf,QAAQ,IAAI,KAAK;IAAE;IAAM,WAAW,CAAC,MAAM,OAAO;GAAE,CAAC;QAErD,SAAS,UAAU,KAAK,MAAM,OAAO;EAEzC;EACA,IAAI,QAAQ,WAAW,KAAK,MAAM,OAAO;CAC3C;CAEA,MAAM,eAAe,cAAc,SAAS;CAC5C,MAAM,aAAa,WAAW,MAAM,KAAK,QAAQ,KAAK,CAAC,CAAC;CACxD,MAAM,QAAqB,CAAC;CAC5B,MAAM,eAA4B,CAAC;CACnC,MAAM,QAAqE,CAAC;CAE5E,KAAK,MAAM,OAAO,YAAY;EAC5B,MAAM,QAAQ,QAAQ,IAAI,GAAG;EAC7B,MAAM,YAAY,WAAW,MAAM,SAAS;EAC5C,MAAM,KAAK,MAAM,IAAI;EACrB,IAAI,eAAe,KAAK,UAAU,WAAW,cAC3C,aAAa,KAAK,MAAM,IAAI;EAE9B,MAAM,KAAK;GAAE,MAAM,MAAM;GAAM;GAAW,SAAS,UAAU;EAAO,CAAC;CACvE;CAEA,MAAM,MAAkB;EACtB;EACA;EACA;EACA,YAAY,WAAW,UAAU;CACnC;CAEA,IAAI,gBAAgB,GAClB,IAAI,UACF,gBAAgB,IACZ,IACA,MAAM,WAAW,IACf,IACA,aAAa,SAAS,MAAM;CAGtC,OAAO;AACT;AAEA,SAAS,WACP,UACA,UACc;CACd,MAAM,gBAA4D,CAAC;CACnE,IAAI,gBAAgB;CAEpB,KAAK,MAAM,SAAS,SAAS,eAAe;EAC1C,IAAI,MAAM,UAAU,MAAM;EAC1B,IAAI,MAAM,QAAQ,MAAM,KAAK,GAC3B,cAAc,KAAK;GAAE,SAAS,MAAM;GAAS,QAAQ,MAAM;EAAM,CAAC;OAElE,iBAAiB;CAErB;CAEA,MAAM,OAAO,eAAe,eAAe,aAAa;CACxD,MAAM,YAAY,SAAS,MAAM;CAEjC,IAAI;CACJ,IAAI,SAAS,UAAU,SAAS,GAC9B,SAAS;MACJ,IAAI,gBAAgB,GACzB,SAAS;MACJ,IAAI,cAAc,SAAS,UAAU,QAC1C,SAAS;MACJ,IAAI,YAAY,GACrB,SAAS;MACJ,IAAI,KAAK,aAAa,WAAW,KAAK,MAAM,QACjD,SAAS;MAET,SAAS;CAGX,MAAM,MAAoB;EACxB,YAAY;EACZ;EACA;EACA,WAAW,SAAS;EACpB,SAAS,SAAS;EAClB,OAAO,SAAS;EAChB,OAAO,KAAK;EACZ,cAAc,KAAK;EACnB,OAAO,KAAK;EACZ,YAAY,KAAK;CACnB;CACA,IAAI,KAAK,YAAY,KAAA,GACnB,IAAI,UAAU,KAAK;CAErB,OAAO;AACT;AAEA,SAAS,mBACP,MACA,UACA,UACsB;CACtB,OAAO;EACL,YAAY;EACZ,QAAQ;EACR,QAAQ,KAAK;EACb,QAAQ,KAAK;EACb;EACA,WAAW,SAAS;EACpB,SAAS,SAAS;EAClB,OAAO,SAAS;EAChB,QAAQ,SAAS,cAAc,KAAI,WAAU;GAC3C,SAAS,MAAM;GACf,OAAO,MAAM;EACf,EAAE;CACJ;AACF;AAEA,SAAS,YACP,MACA,SACA,SACe;CACf,MAAM,WAAW,QAAQ;CACzB,MAAM,WAAW,gBAAgB,SAAS,OAAO;CAEjD,QAAQ,KAAK,YAAb;EACE,KAAK,SACH,OAAO,aAAa,UAAU,QAAQ;EACxC,KAAK,aACH,OAAO,iBAAiB;GACtB;GACA,WAAW,SAAS;GACpB,SAAS,SAAS;GAClB,OAAO,SAAS;GAChB,eAAe,SAAS;GACxB,WAAW,KAAK;EAClB,CAAC;EACH,KAAK,OACH,OAAO,WAAW,UAAU,QAAQ;EACtC,KAAK,QACH,OAAO,mBAAmB,MAAM,UAAU,QAAQ;CACtD;AACF;AAEA,SAAS,gBACP,MACA,SACA,SAC0C;CAC1C,MAAM,WAAW,QAAQ;CACzB,MAAM,WAAW,gBAAgB,SAAS,OAAO;CAEjD,MAAM,wBAA6B,CAAC;CACpC,IAAI,gBAAgB;CACpB,MAAM,8BAAc,IAAI,IAGtB;CACF,MAAM,8BAAc,IAAI,IAGtB;CACF,MAAM,eAA2D,CAAC;CAElE,KAAK,MAAM,SAAS,SAAS,eAAe;EAC1C,IAAI,MAAM,UAAU,MAAM;EAC1B,IAAI,CAAC,MAAM,QAAQ,MAAM,KAAK,GAAG;GAC/B,iBAAiB;GACjB;EACF;EAEA,MAAM,uBAAO,IAAI,IAAsD;EACvE,MAAM,QAAqB,CAAC;EAC5B,IAAI,SAAS;EAEb,KAAK,MAAM,WAAW,MAAM,OAAO;GACjC,IAAI,CAAC,cAAc,OAAO,KAAK,CAAC,OAAO,OAAO,SAAS,KAAK,GAAG,GAAG;IAChE,SAAS;IACT;GACF;GACA,MAAM,YAAY,SAAS,SAAS,KAAK,GAAG;GAC5C,IAAI,cAAc,KAAA,GAAW;IAC3B,SAAS;IACT;GACF;GACA,MAAM,SAAS,mBAAmB,SAAsB;GACxD,MAAM,WAAW,cAAc,MAAM;GACrC,IAAI,KAAK,IAAI,QAAQ,GAAG;IACtB,SAAS;IACT;GACF;GACA,MAAM,WAAW,mBAAmB,OAAoB;GACxD,KAAK,IAAI,UAAU;IAAE,UAAU;IAAQ,MAAM;GAAS,CAAC;GACvD,MAAM,KAAK,MAAM;EACnB;EAEA,IAAI,QACF,sBAAsB,KAAK,MAAM,OAAO;OACnC;GACL,YAAY,IAAI,MAAM,SAAS,IAAI;GACnC,aAAa,KAAK;IAAE,SAAS,MAAM;IAAS,QAAQ;GAAM,CAAC;EAC7D;CACF;CAEA,IAAI,sBAAsB,SAAS,GACjC,OAAO;EACL,YAAY;EACZ,QAAQ;EACR,QAAQ;EACR,QAAQ;EACR;EACA,WAAW,SAAS;EACpB,SAAS,SAAS;EAClB,OAAO,SAAS;EAChB,QAAQ,SAAS,cAAc,KAAI,WAAU;GAC3C,SAAS,MAAM;GACf,OAAO,MAAM;EACf,EAAE;EACF,uBAAuB,WAAW,qBAAqB;CACzD;CAGF,KAAK,MAAM,CAAC,SAAS,SAAS,aAC5B,KAAK,MAAM,CAAC,UAAU,SAAS,MAAM;EACnC,MAAM,WAAW,YAAY,IAAI,QAAQ;EACzC,IAAI,aAAa,KAAA,GACf,YAAY,IAAI,UAAU;GACxB,UAAU,KAAK;GACf,SAAS,CAAC;IAAE;IAAS,QAAQ,KAAK;GAAK,CAAC;EAC1C,CAAC;OAED,SAAS,QAAQ,KAAK;GAAE;GAAS,QAAQ,KAAK;EAAK,CAAC;CAExD;CAGF,MAAM,WAAW,eAAe,cAAc,aAAa;CAC3D,MAAM,aAAwC;EAC5C,OAAO,SAAS;EAChB,cAAc,SAAS;EACvB,OAAO,SAAS;CAClB;CACA,IAAI,SAAS,YAAY,KAAA,GACvB,WAAW,UAAU,SAAS;CAGhC,MAAM,sBAAsB,WAAW,OAAO,KAAK,KAAK,UAAU,CAAC;CACnE,MAAM,iBAAiB,WAAW,MAAM,KAAK,YAAY,KAAK,CAAC,CAAC;CAEhE,IAAI,oBAAoB;CACxB,MAAM,QAAoC,CAAC;CAE3C,KAAK,MAAM,YAAY,gBAAgB;EACrC,MAAM,MAAM,YAAY,IAAI,QAAQ;EACpC,MAAM,gBAAgB,SAAS,IAAI,UAAU,GAAG,MAC9C,aAAa,EAAE,SAAS,EAAE,OAAO,CACnC;EACA,MAAM,YAAY,cAAc,KAAI,MAAK,EAAE,OAAO;EAElD,MAAM,eAA+C,CAAC;EACtD,KAAK,MAAM,WAAW,qBAAqB;GAEzC,MAAM,UAAU,YADA,SAAmB,KAAK,YAAY,OAClB,GAAG,SAAS,aAAa;GAC3D,IAAI,QAAQ,WAAW,SAAS,oBAAoB;GACpD,aAAa,KAAK,CAAC,SAAS,OAAO,CAAC;EACtC;EAEA,MAAM,KAAK;GACT,KAAK,IAAI;GACT;GACA,QAAQ,wBAAwB,YAAY;EAC9C,CAAC;CACH;CAEA,IAAI;CACJ,IAAI,SAAS,UAAU,SAAS,GAC9B,SAAS;MACJ,IAAI,gBAAgB,GACzB,SAAS;MACJ,IAAI,SAAS,MAAM,WAAW,SAAS,UAAU,QACtD,SAAS;MACJ,IAAI,SAAS,MAAM,SAAS,GACjC,SAAS;MACJ,IACL,SAAS,aAAa,WAAW,SAAS,MAAM,UAChD,CAAC,mBAED,SAAS;MAET,SAAS;CAGX,OAAO;EACL,YAAY;EACZ;EACA;EACA,WAAW,SAAS;EACpB,SAAS,SAAS;EAClB,OAAO,SAAS;EAChB,KAAK,KAAK;EACV,MAAM;EACN;CACF;AACF;AAEA,SAAS,0BACP,MACA,SACA,SACgB;CAChB,MAAM,WAAW,QAAQ;CACzB,MAAM,WAAW,gBAAgB,SAAS,OAAO;CAEjD,MAAM,kBAAuB,CAAC;CAC9B,MAAM,gBAAqB,CAAC;CAC5B,MAAM,cAAmB,CAAC;CAC1B,MAAM,sBAA+D,CAAC;CAEtE,MAAM,gCAAgB,IAAI,IAGxB;CAEF,KAAK,MAAM,SAAS,SAAS,eAAe;EAC1C,IAAI,MAAM,UAAU,MAAM;GACxB,gBAAgB,KAAK,MAAM,OAAO;GAClC,YAAY,KAAK,MAAM,OAAO;GAC9B,oBAAoB,KAAK;IAAE,SAAS,MAAM;IAAS,OAAO;GAAK,CAAC;GAChE;EACF;EAEA,IACE,CAAC,cAAc,MAAM,KAAK,KAC1B,CAAC,OAAO,OAAO,MAAM,OAAO,KAAK,aAAa,GAC9C;GACA,cAAc,KAAK,MAAM,OAAO;GAChC;EACF;EAEA,MAAM,UAAU,SAAS,MAAM,OAAO,KAAK,aAAa;EACxD,IAAI,YAAY,KAAA,GAAW;GACzB,cAAc,KAAK,MAAM,OAAO;GAChC;EACF;EAEA,MAAM,UAAU,mBAAmB,OAAoB;EACvD,gBAAgB,KAAK,MAAM,OAAO;EAClC,IAAI,YAAY,MAAM,YAAY,KAAK,MAAM,OAAO;EACpD,oBAAoB,KAAK;GAAE,SAAS,MAAM;GAAS,OAAO;EAAQ,CAAC;EAEnE,MAAM,YAAY,cAAc,OAAO;EACvC,IAAI,OAAO,OAAO,KAAK,UAAU,SAAS,GAAG;GAC3C,MAAM,SAAS,cAAc,IAAI,SAAS;GAC1C,IAAI,WAAW,KAAA,GACb,cAAc,IAAI,WAAW;IAC3B,WAAW;IACX,SAAS,CAAC;KAAE,SAAS,MAAM;KAAS,QAAQ,MAAM;IAAM,CAAC;GAC3D,CAAC;QAED,OAAO,QAAQ,KAAK;IAAE,SAAS,MAAM;IAAS,QAAQ,MAAM;GAAM,CAAC;EAEvE;CACF;CAEA,MAAM,SAAS,aAAa,SAAS,UAAU,QAAQ;EACrD,WAAW,WAAW,eAAe;EACrC,SAAS,WAAW,aAAa;EACjC,OAAO,WAAW,WAAW;EAC7B,eAAe,SAAS,sBAAsB,GAAG,MAC/C,aAAa,EAAE,SAAS,EAAE,OAAO,CACnC;CACF,CAAC;CAED,MAAM,WAAuC,CAAC;CAC9C,IAAI,sBAAsB;CAE1B,KAAK,MAAM,YAAY,WAAW,MAAM,KAAK,cAAc,KAAK,CAAC,CAAC,GAAG;EACnE,MAAM,SAAS,cAAc,IAAI,QAAQ;EACzC,MAAM,gBAAgB,SAAS,OAAO,UAAU,GAAG,MACjD,aAAa,EAAE,SAAS,EAAE,OAAO,CACnC;EACA,MAAM,aAAa,SACjB,KAAK,UACL,QACF;EACA,MAAM,eAA+C,CAAC;EAEtD,KAAK,MAAM,WAAW,WAAW,OAAO,KAAK,UAAU,CAAC,GAAG;GACzD,MAAM,UAAU,YACd,SAAmB,YAAY,OAAO,GACtC,SACA,aACF;GACA,IAAI,QAAQ,WAAW,SAAS,sBAAsB;GACtD,aAAa,KAAK,CAAC,SAAS,OAAO,CAAC;EACtC;EAEA,SAAS,KAAK;GACZ,OAAO,OAAO;GACd,WAAW,cAAc,KAAI,MAAK,EAAE,OAAO;GAC3C,QAAQ,wBAAwB,YAAY;EAC9C,CAAC;CACH;CAEA,IAAI;CACJ,IAAI,SAAS,UAAU,SAAS,KAAK,OAAO,WAAW,gBACrD,SAAS;MACJ,IAAI,OAAO,WAAW,WAAW,CAAC,qBACvC,SAAS;MAET,SAAS;CAGX,OAAO;EACL,YAAY;EACZ;EACA;EACA,WAAW,SAAS;EACpB,SAAS,SAAS;EAClB,OAAO,SAAS;EAChB,eAAe,KAAK;EACpB;EACA;CACF;AACF;AAEA,SAAS,iBACP,iBACqB;CAYrB,OAAO,SAX2B,MAAM,QAAQ,eAAe,IAC3D,CAAC,GAAG,eAAe,IACnB,OAAO,KAAK,eAA4C,CAAC,CAAC,KACxD,aAAY;EACD;EACT,QAAQ,SACN,iBACA,OACF;CACF,EACF,IACmB,GAAG,MAAM,aAAa,EAAE,SAAS,EAAE,OAAO,CAAC;AACpE;;;;;AAMA,SAAgB,cACd,YACA,iBACgC;CAChC,MAAM,UAAU,iBAAiB,eAAe;CAChD,MAAM,gBAAiD,CAAC;CAExD,KAAK,MAAM,QAAQ,WAAW,OAAO,KAAK,UAAU,CAAC,GAAG;EACtD,MAAM,OAAO,SAAoB,YAAY,IAAI;EACjD,IAAI;EACJ,QAAQ,KAAK,YAAb;GACE,KAAK;GACL,KAAK;GACL,KAAK;GACL,KAAK;IACH,MAAM,YAAY,MAAM,MAAM,OAAO;IACrC;GACF,KAAK;IACH,MAAM,gBAAgB,MAAM,MAAM,OAAO;IACzC;GACF,KAAK,uBACH,MAAM,0BAA0B,MAAM,MAAM,OAAO;EAEvD;EACA,cAAc,KAAK,CAAC,MAAM,GAAG,CAAC;CAChC;CAEA,OAAO,wBAAwB,aAAa;AAC9C;;ACjoBA,SAAS,WAAW,QAA6B,KAAmB;CAClE,OAAO,IAAI,MAAM,OAAO,IAAI,GAAG,KAAK,KAAK,CAAC;AAC5C;;;;AAKA,SAAgB,gBACd,YACA,cACU;CACV,IAAI,WAAW;CACf,IAAI,sBAAsB;CAC1B,IAAI,cAAc;CAClB,IAAI,kBAAkB;CACtB,MAAM,+BAAe,IAAI,IAAoB;CAE7C,SAAS,UAAU,MAAgB,sBAAsB,OAAa;EACpE,IAAI,KAAK,eAAe,QAAQ;GAC9B,IAAI,KAAK,WAAW,UAClB,uBAAuB;QAEvB,eAAe;GAEjB,WAAW,cAAc,KAAK,MAAM;EACtC,OAAO,IAAI,qBAAqB;GAC9B,mBAAmB;GACnB,WAAW,cAAc,eAAe;EAC1C,OACE,YAAY;CAEhB;CAEA,KAAK,MAAM,QAAQ,OAAO,KAAK,UAAU,GAAG;EAC1C,MAAM,OAAO,SAAoB,YAAY,IAAI;EAEjD,IAAI,KAAK,eAAe,aAAa;GACnC,MAAM,SAAS,SAAyB,cAAc,IAAI;GAC1D,MAAM,WACJ,WAAW,KAAA,KACX,OAAO,eAAe,UACtB,OAAO,WAAW;GAEpB,IAAI,UAAU;IACZ,mBAAmB;IACnB,WAAW,cAAc,eAAe;GAC1C,OACE,YAAY;GAGd,KAAK,MAAM,WAAW,OAAO,KAAK,KAAK,UAAU,GAC/C,UAAU,SAAmB,KAAK,YAAY,OAAO,GAAI,QAAQ;EAErE,OAAO,IAAI,KAAK,eAAe,uBAAuB;GAEpD,YAAY;GACZ,KAAK,MAAM,aAAa,OAAO,KAAK,KAAK,QAAQ,GAAG;IAClD,MAAM,eAAe,SACnB,KAAK,UACL,SACF;IACA,KAAK,MAAM,WAAW,OAAO,KAAK,YAAY,GAC5C,UAAU,SAAmB,cAAc,OAAO,GAAI,KAAK;GAE/D;EACF,OACE,UAAU,MAAM,KAAK;CAEzB;CAEA,MAAM,SAAS,WAAW,sBAAsB,cAAc;CAC9D,MAAM,QAAQ,SAAS;CACvB,MAAM,QAAQ,UAAU,IAAI,IAAI,WAAW;CAE3C,OAAO;EACL;EACA;EACA;EACA;EACA;EACA;EACA,UAAU,wBAAwB,MAAM,KAAK,aAAa,QAAQ,CAAC,CAAC;CACtE;AACF;ACrBA,MAAM,mCAAmB,IAAI,IAAI;CAC/B;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;AACF,CAAC;AAED,SAAS,UAAU,SAAuB,QAAkC;CAC1E,OAAO,QAAQ,SAAS,MAAM,IAAI,UAAU,CAAC,GAAG,SAAS,MAAM;AACjE;AAEA,SAAS,WAAW,KAAc,QAA6B;CAC7D,OAAO;EAAE,GAAG;EAAK,SAAS,UAAU,IAAI,SAAS,MAAM;CAAE;AAC3D;AAEA,SAAS,aAAa,KAAuB;CAC3C,OAAO;EACL,GAAG;EACH,SAAS,UAAU,IAAI,SAAS,iBAAiB;EACjD,UAAU;CACZ;AACF;AAEA,SAAS,UACP,MACA,eACA,oBACA,gBACY;CACZ,MAAM,OAAmB;EACvB,MAAM;EACN;EACA;EACA;CACF;CACA,IAAI,mBAAmB,KAAA,GAAW,KAAK,iBAAiB;CACxD,OAAO;AACT;AAEA,SAAS,gBACP,KACA,QACA,gBACY;CACZ,OAAO,UACL;EACE,YAAY;EACZ,QAAQ;EACR;EACA,SAAS,UAAU,IAAI,SAAS,aAAa;EAC7C,UAAU,IAAI;CAChB,GACA,SACA,OACA,cACF;AACF;AAEA,SAAS,WACP,KACA,QACA,eACA,gBACY;CACZ,OAAO,UACL;EACE,YAAY;EACZ,QAAQ;EACR;EACA,SAAS,UAAU,IAAI,SAAS,QAAQ;EACxC,UAAU,IAAI;CAChB,GACA,eACA,OACA,cACF;AACF;AAEA,SAAS,UACP,KACA,MAMY;CACZ,OAAO,UACL;EACE,YAAY;EACZ,SAAS,KAAK;EACd,SAAS,UAAU,IAAI,SAAS,iBAAiB;EACjD,UAAU,IAAI;CAChB,GACA,KAAK,eACL,KAAK,sBAAsB,OAC3B,KAAK,cACP;AACF;AAEA,SAAS,qBACP,MACA,KAGwD;CACxD,IAAI,CAAC,IAAI,WAAW,GAAG,GAAG,OAAO;EAAE,IAAI;EAAO,QAAQ;CAAe;CACrE,IAAI,QAAQ,KAAK,OAAO;EAAE,IAAI;EAAM,QAAQ;CAAK;CACjD,IAAI,CAAC,IAAI,WAAW,IAAI,GAAG,OAAO;EAAE,IAAI;EAAO,QAAQ;CAAc;CAErE,IAAI;CACJ,IAAI;EACF,SAAS,aAAa,IAAI,MAAM,CAAC,CAAC;CACpC,QAAQ;EACN,OAAO;GAAE,IAAI;GAAO,QAAQ;EAAc;CAC5C;CAEA,IAAI,OAAgB;CACpB,KAAK,MAAM,SAAS,QAAQ;EAC1B,IAAI,SAAS,QAAQ,OAAO,SAAS,UACnC,OAAO;GAAE,IAAI;GAAO,QAAQ;EAAc;EAE5C,IAAI,MAAM,QAAQ,IAAI,GAAG;GACvB,MAAM,MAAM,OAAO,KAAK;GACxB,IACE,CAAC,OAAO,UAAU,GAAG,KACrB,MAAM,KACN,OAAO,KAAK,UACZ,CAAC,OAAO,OAAO,MAAM,GAAG,GAExB,OAAO;IAAE,IAAI;IAAO,QAAQ;GAAc;GAE5C,OAAO,KAAK;EACd,OAAO;GACL,IAAI,CAAC,OAAO,OAAO,MAAM,KAAK,GAC5B,OAAO;IAAE,IAAI;IAAO,QAAQ;GAAc;GAE5C,OAAO,SAAS,MAAM,KAAK;EAC7B;CACF;CACA,IAAI,OAAO,SAAS,aAAa,CAAC,cAAc,IAAI,GAClD,OAAO;EAAE,IAAI;EAAO,QAAQ;CAAc;CAE5C,OAAO;EAAE,IAAI;EAAM,QAAQ;CAAK;AAClC;AAEA,SAAS,iBACP,MACA,KAG2C;CAC3C,IAAI,OAAO;CACX,IAAI,QAAQ,IAAI;CAChB,MAAM,WAAW,IAAI,IAAI,IAAI,QAAQ;CACrC,OAAO,cAAc,IAAI,KAAK,OAAO,KAAK,SAAS,UAAU;EAC3D,IAAI,SAAS,IAAI,KAAK,IAAI,GACxB,OAAO;GAAE,IAAI;GAAO,QAAQ;EAAY;EAE1C,MAAM,MAAM,qBAAqB,IAAI,MAAM,KAAK,IAAI;EACpD,IAAI,CAAC,IAAI,IAAI,OAAO;EACpB;EACA,IAAI,QAAA,IACF,OAAO;GAAE,IAAI;GAAO,QAAQ;EAAiB;EAE/C,SAAS,IAAI,KAAK,IAAI;EACtB,OAAO,IAAI;CACb;CACA,OAAO;EAAE,IAAI;EAAM,QAAQ;EAAM;EAAO;CAAS;AACnD;AAEA,SAAS,aACP,MACA,KACS;CACT,MAAM,MAAM,iBAAiB,MAAM,GAAG;CACtC,IAAI,CAAC,IAAI,MAAM,CAAC,cAAc,IAAI,MAAM,GAAG,OAAO;CAClD,MAAM,IAAI,IAAI;CACd,IAAI,EAAE,SAAS,QAAQ,OAAO;CAC9B,KAAK,MAAM,OAAO;EAChB;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACF,GACE,IAAI,OAAO,OAAO,GAAG,GAAG,GAAG,OAAO;CAEpC,OAAO;AACT;AAEA,SAAS,eACP,YACA,KACgD;CAChD,MAAM,WAAW,iBAAiB,YAAY,GAAG;CACjD,IAAI,CAAC,SAAS,MAAM,CAAC,cAAc,SAAS,MAAM,GAAG,OAAO,EAAE,IAAI,MAAM;CACxE,MAAM,IAAI,SAAS;CAGnB,KAAK,MAAM,OAAO,OAAO,KAAK,CAAC,GAAG;EAChC,IACE,QAAQ,UACR,QAAQ,WACR,QAAQ,UACR,iBAAiB,IAAI,GAAG,GAExB;EAEF,OAAO,EAAE,IAAI,MAAM;CACrB;CAEA,IAAI;CACJ,IAAI,OAAO,OAAO,GAAG,OAAO,KAAK,EAAE,UAAU,KAAA,GAAW;EACtD,IAAI,MAAM,QAAQ,EAAE,IAAI,GAAG;GACzB,IAAI,EAAE,KAAK,WAAW,GAAG,OAAO,EAAE,IAAI,MAAM;GAC5C,IAAI;IACF,IAAI,cAAc,EAAE,KAAK,EAAE,MAAM,cAAc,EAAE,KAAK,GACpD,OAAO,EAAE,IAAI,MAAM;GAEvB,QAAQ;IACN,OAAO,EAAE,IAAI,MAAM;GACrB;EACF;EACA,YAAY,EAAE;CAChB,OAAO,IAAI,MAAM,QAAQ,EAAE,IAAI,KAAK,EAAE,KAAK,WAAW,GACpD,YAAY,EAAE,KAAK;MAEnB,OAAO,EAAE,IAAI,MAAM;CAGrB,IAAI;EACF,cAAc,SAAS;EACvB,OAAO;GAAE,IAAI;GAAM,OAAO;EAAuB;CACnD,QAAQ;EACN,OAAO,EAAE,IAAI,MAAM;CACrB;AACF;AAEA,SAAgB,WAAW,YAAmC;CAC5D,IAAI,WAAoB;CACxB,IAAI,QAAQ;CACZ,MAAM,2BAAW,IAAI,IAAY;CACjC,IAAI,UAAwB,CAAC;CAE7B,OAAO,cAAc,QAAQ,KAAK,OAAO,SAAS,SAAS,UAAU;EACnE,IAAI,SAAS,IAAI,SAAS,IAAI,GAC5B,MAAM,IAAI,qBAAqB,0BAA0B,QAAQ;EAEnE,MAAM,MAAM,qBAAqB,YAAY,SAAS,IAAI;EAC1D,IAAI,CAAC,IAAI,MAAM,EAAE,QAAA,IACf,MAAM,IAAI,qBAAqB,0BAA0B,QAAQ;EAEnE,SAAS,IAAI,SAAS,IAAI;EAC1B,UAAU,UAAU,SAAS,cAAc;EAC3C,WAAW,IAAI;CACjB;CAEA,IACE,CAAC,cAAc,QAAQ,KACvB,SAAS,SAAS,YAClB,CAAC,cAAc,SAAS,UAAU,GAElC,MAAM,IAAI,qBAAqB,0BAA0B,QAAQ;CAGnE,OAAO,WAAW,UAAU;EAC1B,MAAM;EACN;EACA;EACA;EACA,UAAU;CACZ,CAAC;AACH;AAEA,SAAS,cACP,kBACA,MACA,KACY;CACZ,MAAM,kBAAkB,iBAAiB,QAAO,MAAK,CAAC,aAAa,GAAG,GAAG,CAAC;CAE1E,MAAM,UADgB,gBAAgB,SAAS,iBAAiB,SAChC,aAAa,GAAG,IAAI;CAEpD,IAAI,gBAAgB,WAAW,GAC7B,OAAO,UACL;EAAE,GAAG;EAAS,UAAU;CAAK,GAC7B;EAAE,SAAS;EAAQ,eAAe;EAAQ,gBAAgB;CAAK,CACjE;CAEF,IAAI,gBAAgB,WAAW,GAC7B,OAAO,SAAS,gBAAgB,IAAI,OAAO;CAE7C,OAAO,UAAU,iBAAiB,MAAM,OAAO;AACjD;AAEA,SAAS,SAAS,MAAe,KAA0B;CAEzD,IAAI,cAAc,IAAI,KAAK,OAAO,KAAK,SAAS,UAAU;EACxD,MAAM,MAAM,KAAK;EACjB,IAAI,IAAI,SAAS,IAAI,GAAG,GACtB,OAAO,gBAAgB,KAAK,aAAa,IAAI;EAE/C,MAAM,WAAW,qBAAqB,IAAI,MAAM,GAAG;EACnD,IAAI,CAAC,SAAS,IACZ,OAAO,gBAAgB,KAAK,SAAS,QAAQ,IAAI;EAEnD,MAAM,YAAY,IAAI,QAAQ;EAC9B,IAAI,YAAA,IACF,OAAO,gBAAgB,KAAK,kBAAkB,IAAI;EAEpD,MAAM,WAAW,IAAI,IAAI,IAAI,QAAQ;EACrC,SAAS,IAAI,GAAG;EAChB,OAAO,SAAS,SAAS,QAAQ;GAC/B,GAAG,WAAW,KAAK,cAAc;GACjC,OAAO;GACP,UAAU;EACZ,CAAC;CACH;CAGA,IAAI,IAAI,QAAA,IACN,OAAO,gBACL,KACA,kBACA,cAAc,IAAI,IAAI,OAAO,KAAA,CAC/B;CAGF,IAAI,OAAO,SAAS,aAAa,CAAC,cAAc,IAAI,GAClD,OAAO,gBAAgB,KAAK,SAAS;CAIvC,IAAI,MAAM,QAAQ,KAAK,IAAI,GAAG;EAC5B,MAAM,QAAQ,KAAK;EACnB,IAAI,MAAM,SAAS,MAAM,GAAG;GAC1B,MAAM,UAAU,MAAM,QAAO,MAAK,MAAM,MAAM;GAC9C,MAAM,eAAe,aAAa,GAAG;GACrC,IAAI,QAAQ,WAAW,GACrB,OAAO,SAAS;IAAE,GAAG;IAAM,MAAM;GAAO,GAAG,YAAY;GAEzD,IAAI,QAAQ,WAAW,GACrB,OAAO,SAAS;IAAE,GAAG;IAAM,MAAM,QAAQ;GAAG,GAAG,YAAY;GAE7D,OAAO,gBAAgB,cAAc,cAAc,IAAI;EACzD;EACA,IAAI,MAAM,WAAW,GACnB,OAAO,SAAS;GAAE,GAAG;GAAM,MAAM,MAAM;EAAG,GAAG,GAAG;EAElD,OAAO,gBACL,KACA,MAAM,SAAS,IAAI,eAAe,WAClC,IACF;CACF;CAEA,MAAM,WAAW,MAAM,QAAQ,KAAK,KAAK;CACzC,MAAM,WAAW,MAAM,QAAQ,KAAK,KAAK;CACzC,IAAI,YAAY,UACd,OAAO,gBAAgB,KAAK,SAAS,IAAI;CAE3C,MAAM,mBAAmB,WACpB,KAAK,QACN,WACG,KAAK,QACN;CAEN,IAAI,qBAAqB,MACvB,OAAO,cAAc,kBAAkB,MAAM,GAAG;CAIlD,IAAI,MAAM,QAAQ,KAAK,KAAK,GAC1B,OAAO,gBAAgB,KAAK,UAAU,IAAI;CAE5C,IACE,OAAO,OAAO,MAAM,IAAI,KACxB,OAAO,OAAO,MAAM,MAAM,KAC1B,OAAO,OAAO,MAAM,MAAM,GAE1B,OAAO,gBAAgB,KAAK,eAAe,IAAI;CAEjD,IAAI,OAAO,OAAO,MAAM,KAAK,GAC3B,OAAO,gBAAgB,KAAK,OAAO,IAAI;CAIzC,IACG,OAAO,OAAO,MAAM,OAAO,KAAK,KAAK,UAAU,KAAA,KAChD,MAAM,QAAQ,KAAK,IAAI,GAUvB,OAAO,UAAU,KAAK;EACpB,SAAS;EACT,eATA,KAAK,SAAS,aACd,KAAK,SAAS,YACd,KAAK,SAAS,YACd,KAAK,SAAS,aACd,KAAK,SAAS,SACV,KAAK,OACL;EAIJ,oBAAoB;EACpB,gBAAgB;CAClB,CAAC;CAIH,IAAI,OAAO,KAAK,SAAS,UACvB,QAAQ,KAAK,MAAb;EACE,KAAK,WACH,OAAO,UAAU,KAAK;GACpB,SAAS;GACT,eAAe;GACf,oBAAoB;GACpB,gBAAgB;EAClB,CAAC;EACH,KAAK,WACH,OAAO,UAAU,KAAK;GACpB,SAAS;GACT,eAAe;GACf,gBAAgB;EAClB,CAAC;EACH,KAAK,QACH,OAAO,UAAU,KAAK;GACpB,SAAS;GACT,eAAe;GACf,gBAAgB;EAClB,CAAC;EACH,KAAK,UACH,OAAO,WAAW,KAAK,4BAA4B,UAAU,IAAI;EACnE,KAAK,UACH,OAAO,WAAW,KAAK,aAAa,UAAU,IAAI;EACpD,KAAK,UACH,OAAO,mBAAmB,MAAM,GAAG;EACrC,KAAK,SACH,OAAO,UAAU,MAAM,GAAG;EAC5B,SACE,OAAO,gBAAgB,KAAK,WAAW,IAAI;CAC/C;CAIF,OAAO,gBAAgB,KAAK,WAAW,IAAI;AAC7C;AAEA,SAAS,UACP,iBACA,UACA,KACY;CACZ,MAAM,gBAGD,CAAC;CAEN,KAAK,MAAM,UAAU,iBAAiB;EACpC,MAAM,MAAM,iBAAiB,QAAQ;GACnC,MAAM,IAAI;GACV,OAAO,IAAI,QAAQ;GACnB,UAAU,IAAI;EAChB,CAAC;EACD,IAAI,CAAC,IAAI,IACP,OAAO,gBACL,KACA,IAAI,WAAW,mBAAmB,mBAAmB,SACrD,QACF;EAEF,IACE,CAAC,cAAc,IAAI,MAAM,KACzB,IAAI,OAAO,SAAS,YACpB,CAAC,cAAc,IAAI,OAAO,UAAU,GAEpC,OAAO,gBAAgB,KAAK,SAAS,QAAQ;EAE/C,IACE,MAAM,QAAQ,IAAI,OAAO,KAAK,KAC9B,MAAM,QAAQ,IAAI,OAAO,KAAK,KAC9B,MAAM,QAAQ,IAAI,OAAO,KAAK,KAC9B,OAAO,OAAO,IAAI,QAAQ,IAAI,KAC9B,OAAO,OAAO,IAAI,QAAQ,KAAK,GAE/B,OAAO,gBAAgB,KAAK,SAAS,QAAQ;EAE/C,cAAc,KAAK;GACjB,QAAQ,IAAI;GACZ,KAAK;IAAE,MAAM,IAAI;IAAM,OAAO,IAAI;IAAO,UAAU,IAAI;GAAS;EAClE,CAAC;CACH;CAEA,MAAM,cAAc,cAAc,EAAE,CAAE;CACtC,MAAM,aAAa,YAAY;CAC/B,MAAM,gBAAgB,MAAM,QAAQ,YAAY,QAAQ,IACpD,IAAI,IACF,YAAY,SAAS,QAAQ,MAAmB,OAAO,MAAM,QAAQ,CACvE,oBACA,IAAI,IAAY;CAEpB,MAAM,aAAa,WACjB,OAAO,KAAK,UAAU,CAAC,CAAC,QAAO,SAAQ,cAAc,IAAI,IAAI,CAAC,CAChE;CAEA,IAAI,sBAAqC;CACzC,IAAI,eAAyD,CAAC;CAE9D,KAAK,MAAM,YAAY,YAAY;EACjC,MAAM,2BAAW,IAAI,IAAY;EACjC,MAAM,SAAmD,CAAC;EAC1D,IAAI,QAAQ;EAEZ,KAAK,MAAM,UAAU,eAAe;GAClC,MAAM,SAAS,OAAO,OAAO;GAC7B,MAAM,OAAO,MAAM,QAAQ,OAAO,OAAO,QAAQ,IAC7C,OAAO,OAAO,WACd,CAAC;GACL,IAAI,CAAC,OAAO,OAAO,QAAQ,QAAQ,KAAK,CAAC,KAAK,SAAS,QAAQ,GAAG;IAChE,QAAQ;IACR;GACF;GACA,MAAM,MAAM,eAAe,OAAO,WAAW,OAAO,GAAG;GACvD,IAAI,CAAC,IAAI,IAAI;IACX,QAAQ;IACR;GACF;GACA,MAAM,YAAY,cAAc,IAAI,KAAK;GACzC,IAAI,SAAS,IAAI,SAAS,GAAG;IAC3B,QAAQ;IACR;GACF;GACA,SAAS,IAAI,SAAS;GACtB,OAAO,KAAK;IAAE,KAAK;IAAW,OAAO,IAAI;GAAM,CAAC;EAClD;EAEA,IAAI,OAAO;GACT,sBAAsB;GACtB,eAAe;GACf;EACF;CACF;CAEA,IAAI,wBAAwB,MAC1B,OAAO,gBAAgB,KAAK,SAAS,QAAQ;CAG/C,MAAM,UAAU,SACd,aAAa,KAAK,IAAI,SAAS;EAAE,GAAG;EAAI;CAAI,EAAE,IAC7C,GAAG,MAAM,aAAa,EAAE,KAAK,EAAE,GAAG,CACrC;CAEA,MAAM,2BAAW,IAAI,IAA0B;CAC/C,KAAK,MAAM,SAAS,SAAS;EAC3B,MAAM,SAAS,cAAc,MAAM;EACnC,MAAM,YAAY,WAChB,OAAO,QACP;GAAE,GAAG,OAAO;GAAK,SAAS,CAAC;GAAG,UAAU;EAAM,GAC9C,mBACF;EACA,SAAS,IAAI,MAAM,KAAK;GAAE,OAAO,MAAM;GAAO,QAAQ;EAAU,CAAC;CACnE;CAEA,OAAO;EACL,MAAM;EACN,SAAS,UAAU,IAAI,SAAS,qBAAqB;EACrD,UAAU,IAAI;EACd,eAAe;EACf;CACF;AACF;AAEA,SAAS,mBAAmB,MAAiB,KAA0B;CACrE,IACE,CAAC,cAAc,KAAK,UAAU,KAC9B,OAAO,KAAK,KAAK,UAAU,CAAC,CAAC,WAAW,GAExC,OAAO,gBAAgB,KAAK,UAAU,IAAI;CAE5C,OAAO,WAAW,MAAM,GAAG;AAC7B;AAEA,SAAS,WACP,MACA,KACA,iBACc;CACd,MAAM,WAAW,KAAK;CACtB,MAAM,YAAY,WAChB,OAAO,KAAK,QAAQ,CAAC,CAAC,QAAO,SAAQ,SAAS,eAAe,CAC/D;CAGA,MAAM,eAA6B,IAAI,QAAQ,SAAS,cAAc,IAClE,CAAC,cAAc,IACf,CAAC;CACL,MAAM,WAAoB;EACxB,MAAM,IAAI;EACV,OAAO,IAAI,QAAQ;EACnB,UAAU,IAAI;EACd,SAAS;EACT,UAAU;CACZ;CAEA,MAAM,6BAAa,IAAI,IAAwB;CAC/C,KAAK,MAAM,YAAY,WACrB,WAAW,IAAI,UAAU,SAAS,SAAS,UAAU,QAAQ,GAAG,QAAQ,CAAC;CAG3E,MAAM,2BAAW,IAAI,IAAY;CACjC,IAAI,MAAM,QAAQ,KAAK,QAAQ,GACxB;OAAA,MAAM,KAAK,KAAK,UACnB,IAAI,OAAO,MAAM,UAAU,SAAS,IAAI,CAAC;CAAA;CAI7C,MAAM,gBACJ,OAAO,OAAO,MAAM,sBAAsB,KAC1C,KAAK,yBAAyB,KAAA,KAC9B,KAAK,yBAAyB;CAEhC,OAAO;EACL,MAAM;EACN,SAAS,IAAI;EACb,UAAU,IAAI;EACd;EACA;EACA,sBAAsB;CACxB;AACF;AAEA,SAAS,UAAU,MAAiB,KAA0B;CAC5D,IAAI,MAAM,QAAQ,KAAK,WAAW,KAAK,MAAM,QAAQ,KAAK,KAAK,GAC7D,OAAO;EACL,MAAM;EACN,SAAS,IAAI;EACb,UAAU,IAAI;EACd,OAAO;EACP,OAAO;CACT;CAGF,IAAI,CAAC,OAAO,OAAO,MAAM,OAAO,KAAK,KAAK,UAAU,KAAA,GAClD,OAAO;EACL,MAAM;EACN,SAAS,IAAI;EACb,UAAU,IAAI;EACd,OAAO,gBAAgB;GAAE,SAAS,CAAC;GAAG,UAAU;EAAM,GAAG,SAAS;EAClE,OAAO;CACT;CAGF,MAAM,aAAa,SAAS,KAAK,OAAO;EACtC,MAAM,IAAI;EACV,OAAO,IAAI,QAAQ;EACnB,UAAU,IAAI;EACd,SAAS,CAAC;EACV,UAAU;CACZ,CAAC;CACD,OAAO;EACL,MAAM;EACN,SAAS,IAAI;EACb,UAAU,IAAI;EACd,OAAO;EACP,OAAO;CACT;AACF;;AAGA,SAAgB,iBAAiB,MAA2B;CAC1D,IAAI,KAAK,SAAS,QAAQ,OAAO;CACjC,IAAI,KAAK,KAAK,UAAU,OAAO;CAC/B,IAAI,KAAK,kBAAkB,YAAY,KAAK,kBAAkB,WAC5D,OAAO;CAET,IAAI,KAAK,mBAAmB,KAAA,GAC1B,OACE,MAAM,QAAQ,KAAK,eAAe,IAAI,KACrC,OAAO,OAAO,KAAK,gBAAgB,OAAO,KACzC,KAAK,eAAe,UAAU,KAAA;CAGpC,OAAO;AACT;;AAGA,SAAgB,mBACd,KACA,SAAS,IACT,sBAA+B,IAAI,IAAI,GACd;CACzB,KAAK,MAAM,CAAC,MAAM,UAAU,IAAI,YAAY;EAC1C,MAAM,OAAO,cAAc,QAAQ,IAAI;EACvC,IAAI,IAAI,MAAM,KAAK;EACnB,IAAI,MAAM,SAAS,UACjB,mBAAmB,OAAO,MAAM,GAAG;CAEvC;CACA,OAAO;AACT;;ACpvBA,MAAM,mCAAmB,IAAI,IAAY;CAAC;CAAQ;CAAQ;AAAU,CAAC;AAErE,SAAS,aAAa,MAAoB,OAAmC;CAC3E,MAAM,SAAuB,CAAC;CAC9B,KAAK,MAAM,KAAK,MACd,IAAI,CAAC,OAAO,SAAS,CAAC,GAAG,OAAO,KAAK,CAAC;CAExC,KAAK,MAAM,KAAK,OACd,IAAI,CAAC,OAAO,SAAS,CAAC,GAAG,OAAO,KAAK,CAAC;CAExC,OAAO;AACT;AAEA,SAAS,eAAe,SAAqC;CAC3D,OAAO,QAAQ,QAAO,MAAK,MAAM,qBAAqB,MAAM,cAAc;AAC5E;AAEA,SAAS,SAAS,MAKL;CACX,OAAO;EACL,YAAY;EACZ,QAAQ,KAAK;EACb,QAAQ,KAAK;EACb,SAAS,aAAa,KAAK,SAAS,CAAC,KAAK,MAAM,CAAC;EACjD,UAAU,KAAK;CACjB;AACF;AAEA,SAAS,eACP,aACA,UACU;CACV,OAAO;EACL,YAAY;EACZ,QAAQ;EACR,QAAQ;EACR,SAAS,aAAa,aAAa,CAAC,mBAAmB,QAAQ,CAAC;EAChE;CACF;AACF;AAEA,SAAS,iBAAiB,OAAgB,MAAwB;CAChE,IAAI,OAAO,UAAU,YAAY,CAAC,iBAAiB,IAAI,KAAK,GAC1D,MAAM,IAAI,qBACR,kBACA,WAAW,QACX,qCAAqC,KAAK,EAC5C;CAEF,OAAO;AACT;AAEA,SAAS,oBACP,MACA,OACA,MACoB;CACpB,IAAI,CAAC,OAAO,OAAO,MAAM,KAAK,KAAK,KAAK,WAAW,KAAA,GACjD;CAEF,MAAM,MAAM,SAAS,MAAM,KAAK;CAChC,IAAI,OAAO,QAAQ,YAAY,CAAC,OAAO,SAAS,GAAG,KAAK,MAAM,GAC5D,MAAM,IAAI,qBACR,qBACA,MACA,aAAa,MAAM,OAAO,KAAK,+BACjC;CAEF,OAAO,QAAQ,IAAI,IAAI;AACzB;AAEA,SAAS,kBAAkB,MAAe,MAA6B;CACrE,IAAI,CAAC,cAAc,IAAI,GACrB,MAAM,IAAI,qBACR,qBACA,MACA,kBAAkB,KAAK,yBACzB;CAEF,KAAK,MAAM,KAAK,OAAO,KAAK,IAAI,GAC9B,IAAI,MAAM,cAAc,MAAM,YAC5B,MAAM,IAAI,qBACR,qBACA,MACA,0BAA0B,EAAE,QAAQ,KAAK,EAC3C;CAIJ,MAAM,MAAM,oBAAoB,MAAM,YAAY,IAAI;CACtD,MAAM,MAAM,oBAAoB,MAAM,YAAY,IAAI;CACtD,IAAI,QAAQ,KAAA,KAAa,QAAQ,KAAA,GAC/B,MAAM,IAAI,qBACR,qBACA,MACA,iBAAiB,KAAK,gDACxB;CAGF,MAAM,MAAqB,CAAC;CAC5B,IAAI,QAAQ,KAAA,GAAW,IAAI,WAAW;CACtC,IAAI,QAAQ,KAAA,GAAW,IAAI,WAAW;CACtC,OAAO;AACT;AAUA,SAAS,kBACP,MACA,SACA,OACA,MACM;CACN,KAAK,MAAM,KAAK,MACd,IAAI,CAAC,QAAQ,IAAI,CAAC,GAChB,MAAM,IAAI,qBACR,yBACA,MACA,mBAAmB,EAAE,OAAO,MAAM,gBAAgB,KAAK,EACzD;AAGN;AAEA,SAAS,gBACP,KACA,MACsB;CACtB,IAAI,CAAC,OAAO,OAAO,KAAK,SAAS,KAAK,IAAI,YAAY,KAAA,GACpD;CAEF,OAAO,iBAAiB,SAAS,KAAK,SAAS,GAAG,IAAI;AACxD;AAEA,SAAS,cAAc,KAAc,MAAkC;CACrE,IAAI,QAAQ,WAAW,QAAQ,SAAS,QAAQ,QAC9C,OAAO,EAAE,MAAM,IAAI;CAErB,IAAI,CAAC,cAAc,GAAG,GACpB,MAAM,IAAI,qBACR,kBACA,WAAW,QACX,8BAA8B,KAAK,EACrC;CAGF,MAAM,OAAO,OAAO,KAAK,GAAG;CAC5B,IAAI,OAAO,OAAO,KAAK,YAAY,GAAG;EACpC,kBACE,sBACA,IAAI,IAAI,CAAC,cAAc,SAAS,CAAC,GACjC,cACA,IACF;EACA,MAAM,OAAO,SAAS,KAAK,YAAY;EACvC,IAAI,SAAS,QAAQ;GACnB,IAAI,OAAO,OAAO,KAAK,SAAS,KAAK,IAAI,YAAY,KAAA,GACnD,MAAM,IAAI,qBACR,yBACA,MACA,uBAAuB,KAAK,yBAC9B;GAEF,OAAO,EAAE,MAAM,OAAO;EACxB;EACA,IAAI,SAAS,WAAW,SAAS,OAAO;GACtC,MAAM,UAAU,gBAAgB,KAAK,IAAI;GACzC,OAAO,YAAY,KAAA,IAAY;IAAE,MAAM;IAAM;GAAQ,IAAI,EAAE,MAAM,KAAK;EACxE;EACA,MAAM,IAAI,qBACR,yBACA,MACA,oCAAoC,OAAO,IAAI,EAAE,QAAQ,KAAK,EAChE;CACF;CAEA,IAAI,OAAO,OAAO,KAAK,WAAW,GAAG;EACnC,kBACE,sBACA,IAAI,IAAI,CAAC,aAAa,SAAS,CAAC,GAChC,aACA,IACF;EACA,MAAM,UAAU,gBAAgB,KAAK,IAAI;EACzC,MAAM,YAAY,SAAS,KAAK,WAAW;EAC3C,OAAO,YAAY,KAAA,IACf;GAAE,MAAM;GAAa;GAAW;EAAQ,IACxC;GAAE,MAAM;GAAa;EAAU;CACrC;CAEA,IAAI,OAAO,OAAO,KAAK,KAAK,GAAG;EAC7B,kBAAkB,sBAAM,IAAI,IAAI,CAAC,OAAO,SAAS,CAAC,GAAG,aAAa,IAAI;EACtE,MAAM,UAAU,gBAAgB,KAAK,IAAI;EACzC,MAAM,MAAM,SAAS,KAAK,KAAK;EAC/B,OAAO,YAAY,KAAA,IACf;GAAE,MAAM;GAAa;GAAK;EAAQ,IAClC;GAAE,MAAM;GAAa;EAAI;CAC/B;CAEA,IAAI,OAAO,OAAO,KAAK,SAAS,KAAK,KAAK,WAAW,GACnD,OAAO;EACL,MAAM;EACN,SAAS,iBAAiB,SAAS,KAAK,SAAS,GAAG,IAAI;CAC1D;CAGF,MAAM,IAAI,qBACR,kBACA,WAAW,QACX,mCAAmC,KAAK,EAC1C;AACF;AAEA,SAAS,kCACP,OACwE;CACxE,IAAI,UAAU,MAAM,OAAO;EAAE,QAAQ;EAAe,QAAQ;CAAQ;CACpE,IAAI,MAAM,SAAS,SACjB,OAAO;EAAE,QAAQ;EAAe,QAAQ;CAAe;CAEzD,IAAI,MAAM,SAAS,UACjB,OAAO;EAAE,QAAQ;EAAe,QAAQ;CAA4B;CAEtE,IAAI,MAAM,SAAS,uBACjB,OAAO;EAAE,QAAQ;EAAe,QAAQ;CAAQ;CAElD,IAAI,MAAM,kBAAkB,UAC1B,OAAO;EAAE,QAAQ;EAAU,QAAQ;CAAe;CAEpD,IACE,MAAM,kBAAkB,aACxB,MAAM,kBAAkB,aACxB,MAAM,kBAAkB,YACxB,MAAM,oBAEN,OAAO;CAET,IAAI,MAAM,KAAK,eAAe,UAAU,MAAM,KAAK,WAAW,eAC5D,OAAO;EAAE,QAAQ;EAAe,QAAQ,MAAM,KAAK;CAAO;CAE5D,OAAO;EAAE,QAAQ;EAAe,QAAQ;CAAU;AACpD;AAEA,SAAS,iBAAiB,MAA6B;CACrD,IAAI,KAAK,OACP,OAAO,SAAS;EACd,QAAQ;EACR,QAAQ;EACR,SAAS,KAAK;EACd,UAAU,KAAK;CACjB,CAAC;CAGH,MAAM,cACJ,KAAK,OAAO,SAAS,SACjB,eAAe,KAAK,MAAM,KAAK,OAAO,IACtC,KAAK,UAAU,OACb,eAAe,KAAK,MAAM,OAAO,IACjC,CAAC;CACT,MAAM,cAAc,aAAa,KAAK,SAAS,WAAW;CAE1D,MAAM,SAAS,kCAAkC,KAAK,KAAK;CAC3D,IAAI,WAAW,MACb,OAAO,SAAS;EACd,QAAQ,OAAO;EACf,QAAQ,OAAO;EACf,SAAS;EACT,UAAU,KAAK;CACjB,CAAC;CAGH,OAAO;EACL,YAAY;EACZ,SAAS;EACT,SAAS,aAAa,aAAa,CAAC,iBAAiB,CAAC;EACtD,UAAU,KAAK;CACjB;AACF;AAEA,SAAS,uBACP,KACA,QACA,KACA,eACM;CACN,IAAI,IAAI,sBACN,IAAI,KAAK,CACP,QACA,SAAS;EACP,QAAQ;EACR,QAAQ;EACR,SAAS,IAAI;EACb,UAAU,IAAI;CAChB,CAAC,CACH,CAAC;CAGH,KAAK,MAAM,CAAC,UAAU,UAAU,IAAI,YAAY;EAC9C,IAAI,WAAW,MAAM,aAAa,eAAe;EACjD,MAAM,YAAY,cAAc,QAAQ,QAAQ;EAChD,IAAI,MAAM,SAAS,QACjB,IAAI,KAAK,CAAC,WAAW,MAAM,IAAI,CAAC;OAC3B,IAAI,MAAM,SAAS,UACxB,uBAAuB,OAAO,WAAW,GAAG;OACvC,IAAI,MAAM,SAAS,SACxB,IAAI,KAAK,CAAC,WAAW,iBAAiB,KAAK,CAAC,CAAC;OAG7C,IAAI,KAAK,CACP,WACA,SAAS;GACP,QAAQ;GACR,QAAQ;GACR,SAAS,eAAe,MAAM,OAAO;GACrC,UAAU,MAAM;EAClB,CAAC,CACH,CAAC;CAEL;AACF;AAEA,SAAS,qBACP,MACA,UACA,MACU;CACV,IAAI,aAAa,KAAA,GAAW,OAAO,KAAK;CACxC,MAAM,UAAU,eAAe,KAAK,KAAK,OAAO;CAEhD,QAAQ,SAAS,MAAjB;EACE,KAAK,SACH,OAAO;GACL,YAAY;GACZ,SACE,SAAS,YAAY,KAAK,qBAAqB,aAAa;GAC9D,SAAS,aAAa,SAAS,CAAC,iBAAiB,CAAC;GAClD,UAAU,KAAK,KAAK;EACtB;EACF,KAAK,QACH,OAAO,eAAe,SAAS,KAAK,KAAK,QAAQ;EACnD,KAAK;GACH,IAAI,KAAK,kBAAkB,YAAY,KAAK,kBAAkB,WAC5D,MAAM,IAAI,qBACR,yBACA,MACA,0BAA0B,KAAK,sCACjC;GAEF,OAAO;IACL,YAAY;IACZ,WAAW,kBAAkB,SAAS,WAAW,IAAI;IACrD,SAAS,SAAS,WAAW;IAC7B,SAAS,aAAa,SAAS,CAAC,iBAAiB,CAAC;IAClD,UAAU,KAAK,KAAK;GACtB;EAEF,KAAK;GACH,IAAI,KAAK,KAAK,eAAe,QAC3B,MAAM,IAAI,qBACR,yBACA,MACA,4BAA4B,KAAK,yCACnC;GAEF,OAAO;IACL,GAAG,KAAK;IACR,SAAS,SAAS;IAClB,SAAS,aAAa,KAAK,KAAK,SAAS,CAAC,iBAAiB,CAAC;GAC9D;EAEF,KAAK;EACL,KAAK,aACH,MAAM,IAAI,qBACR,yBACA,MACA,aAAa,SAAS,KAAK,QAAQ,KAAK,2BAC1C;CACJ;AACF;AAEA,SAAS,sBACP,KACA,UACA,MACW;CACX,IAAI,aAAa,KAAA,GAAW,OAAO,iBAAiB,GAAG;CACvD,MAAM,UAAU,eAAe,IAAI,OAAO;CAE1C,QAAQ,SAAS,MAAjB;EACE,KAAK;EACL,KAAK,OACH,OAAO;GACL,YAAY,SAAS;GACrB,SAAS,SAAS,WAAW;GAC7B,SAAS,aAAa,SAAS,CAAC,iBAAiB,CAAC;GAClD,UAAU,IAAI;EAChB;EACF,KAAK,QACH,OAAO,eAAe,SAAS,IAAI,QAAQ;EAC7C,KAAK,gBAAgB;GACnB,MAAM,MAAM,iBAAiB,GAAG;GAChC,IAAI,IAAI,eAAe,QACrB,MAAM,IAAI,qBACR,yBACA,MACA,4BAA4B,KAAK,yCACnC;GAEF,OAAO;IACL,GAAG;IACH,SAAS,SAAS;IAClB,SAAS,aAAa,IAAI,SAAS,CAAC,iBAAiB,CAAC;GACxD;EACF;EACA,KAAK,aAAa;GAChB,IAAI,IAAI,SAAS,IAAI,UAAU,QAAQ,IAAI,MAAM,SAAS,UACxD,MAAM,IAAI,qBACR,yBACA,MACA,0BAA0B,KAAK,+BACjC;GAEF,MAAM,MAAM,SAAS;GACrB,IAAI,OAAO,QAAQ,YAAY,IAAI,WAAW,GAC5C,MAAM,IAAI,qBACR,eACA,MACA,0BAA0B,KAAK,kCACjC;GAEF,MAAM,UAAU,IAAI,MAAM,WAAW,IAAI,GAAG;GAC5C,IACE,YAAY,KAAA,KACZ,CAAC,IAAI,MAAM,SAAS,IAAI,GAAG,KAC3B,CAAC,iBAAiB,OAAO,GAEzB,MAAM,IAAI,qBACR,eACA,MACA,QAAQ,IAAI,QAAQ,KAAK,2EAC3B;GAEF,MAAM,cAAyC,CAAC;GAChD,uBAAuB,IAAI,OAAO,IAAI,aAAa,GAAG;GACtD,OAAO;IACL,YAAY;IACZ;IACA,SAAS,SAAS,WAAW;IAC7B,YAAY,wBAAwB,WAAW;IAC/C,SAAS,aACP,aAAa,SAAS,eAAe,IAAI,MAAM,OAAO,CAAC,GACvD,CAAC,iBAAiB,CACpB;IACA,UAAU,IAAI;GAChB;EACF;EACA,KAAK,aACH,MAAM,IAAI,qBACR,yBACA,MACA,0BAA0B,KAAK,sCACjC;CACJ;AACF;AAEA,SAAS,sBACP,OACA,UACA,MACW;CACX,MAAM,UAAU,eAAe,MAAM,OAAO;CAE5C,IAAI,aAAa,KAAA,GAAW;EAC1B,IAAI,SAAS,SAAS,SACpB,OAAO;GACL,YAAY;GACZ,SAAS,SAAS,WAAW;GAC7B,SAAS,aAAa,SAAS,CAAC,iBAAiB,CAAC;GAClD,UAAU,MAAM;EAClB;EAEF,IAAI,SAAS,SAAS,QACpB,OAAO,eAAe,SAAS,MAAM,QAAQ;EAE/C,IAAI,SAAS,SAAS,gBACpB,MAAM,IAAI,qBACR,yBACA,MACA,aAAa,SAAS,KAAK,iDAAiD,KAAK,EACnF;CAEJ;CAEA,MAAM,gBAA2D,CAAC;CAClE,KAAK,MAAM,CAAC,UAAU,WAAW,MAAM,UAAU;EAC/C,MAAM,cAAyC,CAAC;EAChD,uBAAuB,OAAO,QAAQ,IAAI,WAAW;EACrD,cAAc,KAAK,CAAC,UAAU,wBAAwB,WAAW,CAAC,CAAC;CACrE;CAEA,OAAO;EACL,YAAY;EACZ,eAAe,MAAM;EACrB,SAAS,UAAU,SAAS,iBAAiB,SAAS,UAAU;EAChE,UAAU,wBAAwB,aAAa;EAC/C,SACE,UAAU,SAAS,iBACf,aAAa,MAAM,SAAS,CAAC,iBAAiB,CAAC,IAC/C,CAAC,GAAG,MAAM,OAAO;EACvB,UAAU,MAAM;CAClB;AACF;AAEA,SAAS,6BACP,QACA,WACM;CACN,MAAM,cAAc,WAAW,KAAK,MAAM,GAAG,OAAO;CACpD,KAAK,MAAM,iBAAiB,UAAU,KAAK,GACzC,IAAI,cAAc,WAAW,WAAW,GACtC,MAAM,IAAI,qBACR,yBACA,eACA,gBAAgB,cAAc,uCAAuC,OAAO,EAC9E;AAGN;AAOA,SAAS,gBACP,KACA,QACA,KACM;CACN,IAAI,IAAI,sBACN,IAAI,IAAI,KAAK,CACX,QACA,SAAS;EACP,QAAQ;EACR,QAAQ;EACR,SAAS,IAAI;EACb,UAAU,IAAI;CAChB,CAAC,CACH,CAAC;CAGH,KAAK,MAAM,CAAC,UAAU,UAAU,IAAI,YAAY;EAC9C,MAAM,YAAY,cAAc,QAAQ,QAAQ;EAChD,MAAM,WAAW,IAAI,UAAU,IAAI,SAAS;EAE5C,IAAI,MAAM,SAAS,QACjB,IAAI,IAAI,KAAK,CACX,WACA,qBAAqB,OAAO,UAAU,SAAS,CACjD,CAAC;OACI,IAAI,MAAM,SAAS,SACxB,IAAI,IAAI,KAAK,CACX,WACA,sBAAsB,OAAO,UAAU,SAAS,CAClD,CAAC;OACI,IAAI,MAAM,SAAS,uBACxB,IAAI,IAAI,KAAK,CACX,WACA,sBAAsB,OAAO,UAAU,SAAS,CAClD,CAAC;OACI,IAAI,aAAa,KAAA,GACtB,gBAAgB,OAAO,WAAW,GAAG;OAChC;GACL,MAAM,UAAU,eAAe,MAAM,OAAO;GAC5C,IAAI,SAAS,SAAS,SAAS;IAC7B,6BAA6B,WAAW,IAAI,SAAS;IACrD,IAAI,IAAI,KAAK,CACX,WACA;KACE,YAAY;KACZ,SAAS,SAAS,WAAW;KAC7B,SAAS,aAAa,SAAS,CAAC,iBAAiB,CAAC;KAClD,UAAU,MAAM;IAClB,CACF,CAAC;GACH,OAAO,IAAI,SAAS,SAAS,QAAQ;IACnC,6BAA6B,WAAW,IAAI,SAAS;IACrD,IAAI,IAAI,KAAK,CAAC,WAAW,eAAe,SAAS,MAAM,QAAQ,CAAC,CAAC;GACnE,OACE,MAAM,IAAI,qBACR,yBACA,WACA,aAAa,SAAS,KAAK,qCAAqC,UAAU,EAC5E;EAEJ;CACF;AACF;;;;;AAMA,SAAgB,gBACd,YACA,SAC2B;CAC3B,MAAM,OAAO,WAAW,UAAU;CAClC,MAAM,cAAc,mBAAmB,IAAI;CAC3C,MAAM,4BAAY,IAAI,IAAgC;CAEtD,IAAI,YAAY,KAAA,GAAW;EACzB,IAAI,CAAC,cAAc,OAAO,GACxB,MAAM,IAAI,qBACR,kBACA,WACA,gCACF;EAEF,KAAK,MAAM,UAAU,OAAO,KAAK,OAAO,GAAG;GACzC,MAAM,UAAU,cAAc,MAAM;GACpC,IAAI,UAAU,IAAI,OAAO,GACvB,MAAM,IAAI,qBACR,kBACA,WAAW,UACX,2BAA2B,QAAQ,cAAc,OAAO,EAC1D;GAEF,IAAI,CAAC,YAAY,IAAI,OAAO,GAC1B,MAAM,IAAI,qBACR,wBACA,SACA,iBAAiB,OAAO,iBAAiB,QAAQ,4BACnD;GAEF,MAAM,cAAc,SAA6B,SAAS,MAAM;GAChE,IAAI,gBAAgB,KAAA,GAClB,UAAU,IAAI,SAAS,cAAc,aAAa,OAAO,CAAC;EAE9D;CACF;CAEA,MAAM,MAAkC,CAAC;CACzC,gBAAgB,MAAM,IAAI;EAAE;EAAW;CAAI,CAAC;CAC5C,OAAO,wBAAwB,GAAG;AACpC;;;;;AAMA,eAAsB,WACpB,YACA,SACsB;CACtB,MAAM,SAAS,gBAAgB,YAAY,OAAO;CAIlD,OAAO;EAAE,aAAA,MAHiB,UACxB,cAAc;GAAE,UAAU;GAAkB;EAAO,CAAC,CACtD;EACsB;CAAO;AAC/B;;ACjrBA,MAAM,gBAA0C;CAC9C,UAAU;CACV,MAAM;CACN,MAAM;AACR;AAEA,SAAS,sBACP,GACA,GACQ;CACR,IAAI,MAAM,KAAA,KAAa,MAAM,KAAA,GAAW,OAAO;CAC/C,IAAI,MAAM,KAAA,GAAW,OAAO;CAC5B,IAAI,MAAM,KAAA,GAAW,OAAO;CAC5B,OAAO,aAAa,GAAG,CAAC;AAC1B;;;;;;AAOA,SAAgB,gBACd,GACA,GACQ;CACR,MAAM,UAAU,cAAc,EAAE,YAAY,cAAc,EAAE;CAC5D,IAAI,YAAY,GAAG,OAAO;CAE1B,MAAM,WAAW,aAAa,EAAE,MAAM,EAAE,IAAI;CAC5C,IAAI,aAAa,GAAG,OAAO;CAE3B,MAAM,WAAW,sBAAsB,EAAE,MAAM,EAAE,IAAI;CACrD,IAAI,aAAa,GAAG,OAAO;CAE3B,MAAM,aAAa,aACjB,cAAc,EAAE,UAAU,IAAI,GAC9B,cAAc,EAAE,UAAU,IAAI,CAChC;CACA,IAAI,eAAe,GAAG,OAAO;CAE7B,MAAM,cAAc,sBAAsB,EAAE,SAAS,EAAE,OAAO;CAC9D,IAAI,gBAAgB,GAAG,OAAO;CAE9B,OAAO,sBAAsB,EAAE,YAAY,IAAI,EAAE,YAAY,EAAE;AACjE;;;;AAKA,SAAgB,aACd,UACc;CACd,OAAO,SAAS,UAAU,eAAe;AAC3C;;;;AAKA,SAAgB,gBACd,UACU;CACV,IAAI,UAAU;CACd,KAAK,MAAM,KAAK,UAAU;EACxB,IAAI,EAAE,aAAa,YAAY,OAAO;EACtC,IAAI,EAAE,aAAa,QAAQ,UAAU;CACvC;CACA,OAAO,UAAU,aAAa;AAChC;AAUA,SAAS,uBACP,UACA,MAMS;CACT,IAAI,WAAW;CACf,KAAK,MAAM,WAAW,OAAO,KAAK,KAAK,OAAO,GAAG;EAC/C,MAAM,UAAU,SAAmB,KAAK,SAAS,OAAO;EACxD,MAAM,SAAS,SAAyB,KAAK,UAAU,OAAO;EAC9D,IAAI,WAAW,KAAA,GAAW;EAE1B,IAAI,OAAO,QAAQ,SAAS,KAAK,OAAO,UAAU,UAAU,GAC1D,SAAS,KAAK;GACZ,MAAM;GACN,UAAU;GACV,MAAM,KAAK;GACX,QAAQ,KAAK;GACb;GACA,WAAW,CAAC,GAAG,OAAO,OAAO;EAC/B,CAAC;EAEH,IAAI,OAAO,WAAW,WAAW,QAAQ,eAAe,QAAQ;GAC9D,WAAW;GACX,SAAS,KAAK;IACZ,MAAM;IACN,UAAU,QAAQ;IAClB,MAAM,KAAK;IACX,QAAQ,KAAK;IACb;IACA,WAAW,CAAC,GAAG,OAAO,SAAS;GACjC,CAAC;EACH;CACF;CACA,OAAO;AACT;;;;;;;AAQA,SAAgB,0BACd,QACc;CACd,MAAM,EACJ,UACA,YACA,cACA,UACA,iBAAiB,UACf;CAEJ,MAAM,WAAyB,CAAC;CAEhC,IAAI,WAAW,GACb,SAAS,KAAK;EACZ,MAAM;EACN,UAAU;EACV,MAAM,EAAE,SAAS;CACnB,CAAC;CAGH,KAAK,MAAM,QAAQ,OAAO,KAAK,UAAU,GAAG;EAC1C,MAAM,OAAO,SAAoB,YAAY,IAAI;EACjD,MAAM,MAAM,SAAyB,cAAc,IAAI;EAGvD,IAAI,KAAK,eAAe,UAAU,KAAK,WAAW,eAChD,SAAS,KAAK;GACZ,MAAM;GACN,UAAU;GACV;GACA,MAAM,EAAE,QAAQ,KAAK,OAAO;EAC9B,CAAC;OACI,IAAI,KAAK,eAAe,aAC7B,KAAK,MAAM,WAAW,OAAO,KAAK,KAAK,UAAU,GAAG;GAClD,MAAM,UAAU,SAAmB,KAAK,YAAY,OAAO;GAC3D,IAAI,QAAQ,eAAe,UAAU,QAAQ,WAAW,eACtD,SAAS,KAAK;IACZ,MAAM;IACN,UAAU;IACV;IACA;IACA,MAAM,EAAE,QAAQ,QAAQ,OAAO;GACjC,CAAC;EAEL;OACK,IAAI,KAAK,eAAe,uBAC7B,KAAK,MAAM,aAAa,OAAO,KAAK,KAAK,QAAQ,GAAG;GAClD,MAAM,cAAc,KAAK,MAAM,SAAS;GACxC,MAAM,eAAe,SACnB,KAAK,UACL,SACF;GACA,KAAK,MAAM,WAAW,OAAO,KAAK,YAAY,GAAG;IAC/C,MAAM,UAAU,SAAmB,cAAc,OAAO;IACxD,IACE,QAAQ,eAAe,UACvB,QAAQ,WAAW,eAEnB,SAAS,KAAK;KACZ,MAAM;KACN,UAAU;KACV;KACA,QAAQ,EAAE,QAAQ,YAAY;KAC9B;KACA,MAAM,EAAE,QAAQ,QAAQ,OAAO;IACjC,CAAC;GAEL;EACF;EAIF,IAAI,WAAW,KAAK,QAAQ,KAAA,GAAW;EAEvC,IAAI,IAAI,QAAQ,SAAS,KAAK,IAAI,UAAU,UAAU,GACpD,SAAS,KAAK;GACZ,MAAM;GACN,UAAU;GACV;GACA,WAAW,CAAC,GAAG,IAAI,OAAO;EAC5B,CAAC;EAGH,IACE,KAAK,eAAe,eACpB,IAAI,eAAe,UACnB,IAAI,WAAW,iBACf;GACA,SAAS,KAAK;IACZ,MAAM;IACN,UAAU;IACV;IACA,WAAW,CAAC,GAAI,IAAI,yBAAyB,CAAC,CAAE;GAClD,CAAC;GACD;EACF;EAEA,IAAI,KAAK,eAAe,eAAe,IAAI,eAAe,aAAa;GACrE,IAAI,eAAe;GACnB,KAAK,MAAM,QAAQ,IAAI,OACrB,IACE,uBAAuB,UAAU;IAC/B;IACA,QAAQ,EAAE,KAAK,KAAK,IAAI;IACxB,SAAS,KAAK;IACd,UAAU,KAAK;GACjB,CAAC,GAED,eAAe;GAGnB,MAAM,sBACJ,IAAI,MAAM,SAAS,KAAK,IAAI,MAAM,SAAS,IAAI,UAAU;GAC3D,MAAM,gBACJ,IAAI,KAAK,aAAa,WAAW,IAAI,KAAK,MAAM;GAClD,IACE,IAAI,UAAU,UAAU,KACxB,IAAI,WAAW,YACd,uBAAuB,iBAAiB,CAAC,eAE1C,SAAS,KAAK;IACZ,MAAM;IACN,UAAU,KAAK;IACf;IACA,WAAW,CAAC,GAAG,IAAI,SAAS;GAC9B,CAAC;GAEH;EACF;EAEA,IACE,KAAK,eAAe,yBACpB,IAAI,eAAe,uBACnB;GACA,IAAI,IAAI,OAAO,WAAW,SACxB,SAAS,KAAK;IACZ,MAAM;IACN,UAAU,KAAK;IACf;IACA,WAAW,CAAC,GAAG,IAAI,OAAO,SAAS;GACrC,CAAC;GAEH,KAAK,MAAM,UAAU,IAAI,UAAU;IACjC,MAAM,aAAa,SACjB,KAAK,UACL,cAAc,OAAO,KAAK,CAC5B;IACA,IAAI,eAAe,KAAA,GAAW;IAC9B,uBAAuB,UAAU;KAC/B;KACA,QAAQ,EAAE,QAAQ,OAAO,MAAM;KAC/B,SAAS;KACT,UAAU,OAAO;IACnB,CAAC;GACH;GACA;EACF;EAEA,IAAI,IAAI,WAAW,WAAW,KAAK,eAAe,QAChD,SAAS,KAAK;GACZ,MAAM;GACN,UAAU,KAAK;GACf;GACA,WAAW,CAAC,GAAG,IAAI,SAAS;EAC9B,CAAC;CAEL;CAEA,IAAI,SAAS,cAAc,SAAS,kBAAkB,GACpD,SAAS,KAAK;EACZ,MAAM;EACN,UAAU,iBAAiB,aAAa;EACxC,MAAM;GACJ,UAAU,SAAS;GACnB,QAAQ,SAAS;GACjB,OAAO,SAAS;EAClB;CACF,CAAC;CAGH,OAAO,aAAa,QAAQ;AAC9B;;AC9TA,MAAM,cAAc;AAEpB,MAAM,cAAc;AAEpB,MAAM,gBAAgB;AAGtB,MAAM,qBAEJ;AAEF,MAAM,mBAAmB;AACzB,MAAM,uBAAuB;AAC7B,MAAM,uBAAuB;AAC7B,MAAM,eACJ;AACF,MAAM,kBACJ;;AAGF,SAAgB,qBAAqB,MAAsB;CACzD,OAAO,KACJ,QAAQ,aAAa,EAAE,CAAC,CACxB,QAAQ,aAAa,EAAE,CAAC,CACxB,QAAQ,eAAe,EAAE,CAAC,CAC1B,QAAQ,oBAAoB,EAAE;AACnC;;AAGA,SAAgB,eAAe,MAAsB;CACnD,OAAO,qBAAqB,IAAI,CAAC,CAAC,WAAW,gBAAgB,GAAG;AAClE;;AAGA,SAAgB,cAAc,MAAsB;CAClD,OAAO,KACJ,QAAQ,kBAAkB,mBAAmB,CAAC,CAC9C,QAAQ,sBAAsB,YAAY,CAAC,CAC3C,QAAQ,sBAAsB,YAAY,CAAC,CAC3C,QACC,eACC,IAAI,GAAW,QAAgB,GAAG,IAAI,IAAI,WAC7C,CAAC,CACA,QAAQ,kBAAkB,IAAI,WAAmB,GAAG,OAAO,WAAW;AAC3E;;ACrCA,MAAM,UAAU,IAAI,YAAY;AAEhC,MAAM,2BAA2B;;AAGjC,SAAgB,eAAe,MAAsB;CACnD,OAAO,QAAQ,OAAO,IAAI,CAAC,CAAC;AAC9B;;;;;AAMA,SAAgB,kBACd,MACA,UACsC;CACtC,IAAI,eAAe,IAAI,KAAK,UAC1B,OAAO;EAAE;EAAM,WAAW;CAAM;CAElC,IAAI,OAAO;CACX,IAAI,MAAM;CACV,KAAK,MAAM,MAAM,MAAM;EACrB,MAAM,MAAM,QAAQ,OAAO,EAAE,CAAC,CAAC;EAC/B,IAAI,OAAO,MAAM,UAAU;EAC3B,QAAQ;EACR,OAAO,GAAG;CACZ;CACA,OAAO;EAAE,MAAM,KAAK,MAAM,GAAG,GAAG;EAAG,WAAW;CAAK;AACrD;;AAGA,SAAgB,kBACd,MACA,UACsC;CACtC,OAAO,kBAAkB,cAAc,qBAAqB,IAAI,CAAC,GAAG,QAAQ;AAC9E;AAEA,SAAS,gBACP,OACA,OACA,OACW;CACX,IAAI,UAAU,QAAQ,OAAO,UAAU,WAAW,OAAO;CACzD,IAAI,OAAO,UAAU,UACnB,OAAO,cAAc,qBAAqB,KAAK,CAAC;CAElD,IAAI,OAAO,UAAU,UACnB,OAAO,OAAO,SAAS,KAAK,IAAI,QAAQ,OAAO,KAAK;CAEtD,IAAI,OAAO,UAAU,UACnB,OAAO,cAAc,qBAAqB,OAAO,KAAK,CAAC,CAAC;CAE1D,IAAI,SAAS,MAAM,MAAM,IAAI,KAAK,GAChC,OAAO;CAET,MAAM,IAAI,KAAK;CACf,IAAI;EACF,IAAI,MAAM,QAAQ,KAAK,GAAG;GACxB,MAAM,MAAmB,CAAC;GAC1B,KAAK,MAAM,QAAQ,OACjB,IAAI,KAAK,gBAAgB,MAAM,QAAQ,GAAG,KAAK,CAAC;GAElD,OAAO;EACT;EACA,IAAI,CAAC,cAAc,KAAK,GACtB,OAAO,cAAc,qBAAqB,OAAO,KAAK,CAAC,CAAC;EAE1D,MAAM,OAAO,OAAO,KAAK,KAAK,CAAC,CAAC,MAAM;EAEtC,KAAK,KAAK,YAAY;EACtB,MAAM,MAAM,OAAO,OAAO,IAAI;EAC9B,KAAK,MAAM,OAAO,MAAM;GACtB,MAAM,SAAS,SAAS,OAAO,GAAG;GAClC,IAAI,WAAW,KAAA,GAAW;GAC1B,MAAM,WAAW,cAAc,qBAAqB,GAAG,CAAC;GACxD,OAAO,eAAe,KAAK,UAAU;IACnC,OAAO,gBAAgB,QAAQ,QAAQ,GAAG,KAAK;IAC/C,YAAY;IACZ,UAAU;IACV,cAAc;GAChB,CAAC;EACH;EACA,OAAO;CACT,UAAU;EACR,MAAM,OAAO,KAAK;CACpB;AACF;;;;;AAMA,SAAgB,iBACd,UACA,mBACa;CACb,IAAI,CAAC,MAAM,QAAQ,QAAQ,KAAK,SAAS,WAAW,GAAG,OAAO,CAAC;CAC/D,MAAM,SAAS,SAAS,MAAM,GAAG,wBAAwB;CACzD,MAAM,MAAmB,CAAC;CAC1B,KAAK,MAAM,SAAS,QAAQ;EAC1B,MAAM,QAAQ,gBAAgB,OAAO,mBAAG,IAAI,QAAgB,CAAC;EAC7D,MAAM,aAAa,cAAc,KAAK;EACtC,IAAI,eAAe,UAAU,KAAK,mBAAmB;GACnD,IAAI,KAAK,KAAK;GACd;EACF;EACA,MAAM,kBAAkB,eAAe,sBAAkB;EAGzD,IAAI,EAAE,SAAS,kBAAkB,YAFlB,KAAK,IAAI,GAAG,oBAAoB,eAEG,CAAC;EACnD,OACE,eAAe,cAAc,EAAE,WAAW,KAAK,CAAC,CAAC,IAAI,qBACrD,KAAK,SAAS,GAEd,OAAO,KAAK,MAAM,GAAG,KAAK,MAAM,KAAK,SAAS,EAAG,CAAC;EAEpD,IAAI,KAAK,EAAE,WAAW,KAAK,CAAC;CAC9B;CACA,OAAO;AACT;;ACjHA,MAAM,gCAAgB,IAAI,IAAI,CAAC,cAAc,CAAC;AAC9C,MAAM,8BAAc,IAAI,IAAI,CAAC,cAAc,iBAAiB,CAAC;AAC7D,MAAM,uBAAuB,OAAO,IAAI,yBAAyB;AACjE,MAAM,kBAAkB;AAOxB,SAAS,eAAe,OAAuC;CAC7D,OACE,OAAO,UAAU,YACjB,UAAU,QACT,MAAkC,0BAA0B;AAEjE;AAEA,SAAS,0BAA0B,OAAyB;CAC1D,IAAI,OAAO,UAAU,YAAY,UAAU,MAAM,OAAO;CACxD,IAAI,wBAAwB,OAAO,OAAO;CAC1C,IAAI,WAAW,WAAW,KAAK,KAAK,MAAM,SAAS,gBACjD,OAAO;CAET,OAAO,iBAAiB,SAAS,MAAM,SAAS;AAClD;AAEA,SAAS,eAAe,OAA0C;CAChE,IAAI,aAAa,WAAW,KAAK,KAAK,eAAe,KAAK,GACxD,OAAO;AAGX;;AAGA,IAAa,sBAAb,cAAyC,MAAM;CACpC;CACA;CAET,YAAY,OAAe,UAAkB;EAC3C,MACE,qBAAqB,MAAM,0CAA0C,SAAS,EAChF;EACA,KAAK,OAAO;EACZ,KAAK,QAAQ;EACb,KAAK,WAAW;CAClB;AACF;AAOA,SAAS,cAAc,OAAoC;CACzD,IAAI,OAAO,UAAU,YAAY,UAAU,MAAM,OAAO,KAAA;CACxD,MAAM,YAAa,MAA6B;CAChD,OAAO,OAAO,cAAc,YAAY,UAAU,SAAS,IACvD,YACA,KAAA;AACN;AAEA,SAAS,iBAAiB,OAAwB;CAChD,IAAI,OAAO,UAAU,UAAU,OAAO;CACtC,IAAI,OAAO,UAAU,YAAY,UAAU,MAAM;EAC/C,MAAM,YAAa,MAAgC;EACnD,IAAI,OAAO,cAAc,UAAU,OAAO;CAC5C;CACA,IAAI;EACF,OAAO,OAAO,KAAK;CACrB,QAAQ;EACN,OAAO;CACT;AACF;AAEA,SAAS,kBACP,OACA,OACA,SACS;CACT,IAAI,UAAmB;CACvB,KAAK,IAAI,QAAQ,GAAG,SAAS,iBAAiB,SAAS;EACrD,IAAI,OAAO,YAAY,YAAY,YAAY,MAAM,OAAO;EAC5D,IAAI,QAAQ,IAAI,OAAO,GAAG,OAAO;EACjC,QAAQ,IAAI,OAAO;EACnB,MAAM,UAAU,cAAc,OAAO;EACrC,IAAI,YAAY,KAAA,KAAa,MAAM,IAAI,OAAO,GAAG,OAAO;EACxD,UAAW,QAAgC;CAC7C;CACA,OAAO;AACT;AAEA,SAAS,kBACP,OACA,OACS;CACT,MAAM,0BAAU,IAAI,QAAgB;CACpC,IAAI,kBAAkB,OAAO,OAAO,OAAO,GAAG,OAAO;CACrD,IAAI,WAAW,WAAW,KAAK,KAAK,MAAM,cAAc,KAAA,GACtD,OAAO,kBAAkB,MAAM,WAAW,OAAO,OAAO;CAE1D,OAAO;AACT;AAEA,SAAS,WAAW,OAAgB,UAA0B;CAE5D,OAAO,kBADK,cAAc,KAAK,KAAK,OAAO,OACb,QAAQ,CAAC,CAAC,QAAQ,OAAO;AACzD;AAEA,SAAS,UAAU,OAA+B;CAChD,OAAO,OAAO,UAAU,YAAY,OAAO,SAAS,KAAK,IAAI,QAAQ;AACvE;;AAGA,SAAgB,SACd,OACqB;CACrB,IAAI,UAAU,KAAA,KAAa,UAAU,MAAM,OAAO;CAClD,OAAO;EACL,aAAa,UAAU,MAAM,WAAW;EACxC,cAAc,UAAU,MAAM,YAAY;EAC1C,aAAa,UAAU,MAAM,WAAW;EACxC,iBAAiB,UAAU,MAAM,mBAAmB,eAAe;EACnE,kBAAkB,UAAU,MAAM,mBAAmB,gBAAgB;EACrE,iBAAiB,UAAU,MAAM,oBAAoB,eAAe;CACtE;AACF;;;;AAKA,SAAgB,qBACd,OACA,SACA,mBACc;CACd,MAAM,MAAM,kBAAkB,iBAAiB,KAAK,GAAG,iBAAiB;CAGxE,IAAI,kBAAkB,OAAO,aAAa,GACxC,OAAO;EACL,MAAM;EACN,MAAM,WAAW,OAAO,iBAAiB;EACzC,SAAS,IAAI;EACb,kBAAkB,IAAI;CACxB;CAIF,IAAI,kBAAkB,OAAO,WAAW,GACtC,OAAO;EACL,MAAM;EACN,MAAM,WAAW,OAAO,iBAAiB;EACzC,SAAS,IAAI;EACb,kBAAkB,IAAI;CACxB;CAIF,IACE,uBAAuB,WAAW,KAAK,KACvC,uBAAuB,WAAW,KAAK,GACvC;EACA,MAAM,KAAK,uBAAuB,WAAW,KAAK,IAC7C,MAAM,gBAAgB,SAAS,eAChC,SAAS;EASb,MAAM,MAAoB;GACxB,MAPA,OAAO,WACH,cACA,OAAO,mBACL,YACA;GAIN,MAAM,WAAW,OAAO,iBAAiB;GACzC,SAAS,IAAI;GACb,kBAAkB,IAAI;EACxB;EACA,IAAI,OAAO,KAAA,GACT,IAAI,eAAe;EAErB,IACE,uBAAuB,WAAW,KAAK,KACvC,OAAO,MAAM,SAAS,YACtB,MAAM,KAAK,SAAS,GACpB;GACA,MAAM,MAAM,kBAAkB,MAAM,MAAM,iBAAiB;GAC3D,IAAI,UAAU,IAAI;GAClB,IAAI,mBAAmB,IAAI;EAC7B;EACA,OAAO;CACT;CAGA,IAAI,kBAAkB,WAAW,KAAK,GACpC,OAAO;EACL,MAAM;EACN,MAAM;EACN,SAAS,IAAI;EACb,kBAAkB,IAAI;EACtB,MAAM,qBAAqB,MAAM,IAAI;CACvC;CAIF,IAAI,iBAAiB,qBACnB,OAAO;EACL,MAAM;EACN,MAAM;EACN,SAAS,IAAI;EACb,kBAAkB,IAAI;CACxB;CAIF,IACE,aAAa,WAAW,KAAK,KAC7B,gBAAgB,WAAW,KAAK,KAChC,WAAW,WAAW,KAAK,KAC3B,eAAe,KAAK,KACpB,0BAA0B,KAAK,GAC/B;EACA,MAAM,SACJ,eAAe,KAAK,MACnB,WAAW,WAAW,KAAK,IACxB,eAAe,MAAM,SAAS,IAC9B,KAAA;EAEN,MAAM,MAAoB;GACxB,MAAM;GACN,MAAM,WAAW,OAAO,iBAAiB;GACzC,SAAS,IAAI;GACb,kBAAkB,IAAI;EACxB;EACA,IAAI,WAAW,KAAA,GAAW;GACxB,IACE,OAAO,OAAO,eAAe,YAC7B,OAAO,SAAS,OAAO,UAAU,GAEjC,IAAI,aAAa,OAAO;GAE1B,IAAI,cAAc,QAAQ,OAAO,WAAW;EAC9C;EACA,OAAO;CACT;CAGA,OAAO;EACL,MAAM;EACN,MAAM,WAAW,OAAO,iBAAiB;EACzC,SAAS,IAAI;EACb,kBAAkB,IAAI;CACxB;AACF;;AC7PA,MAAM,WAAW;AACjB,MAAM,kCAAkB,IAAI,IAAI;CAC9B;CACA;CACA;CACA;CACA;CACA;AACF,CAAC;AAGD,MAAa,2BAA2B;AACxC,MAAa,+BAA+B;AAqB5C,SAAS,iBACP,OAC+D;CAC/D,OACE,OAAO,UAAU,YACjB,UAAU,QACV,CAAC,MAAM,QAAQ,KAAK,KACpB,OAAO,OAAO,OAAO,OAAO,KAC5B,CAAC,OAAO,OAAO,OAAO,sBAAsB;AAEhD;AAEA,SAAS,qBAAqB,OAAwC;CACpE,IAAI,OAAO,UAAU,UACnB,OAAO,MAAM,KAAK,CAAC,CAAC,SAAS;CAE/B,IAAI,OAAO,UAAU,YAAY,UAAU,QAAQ,MAAM,QAAQ,KAAK,GACpE,OAAO;CAET,MAAM,IAAI;CACV,OACE,OAAO,EAAE,yBAAyB,YAClC,OAAO,EAAE,aAAa,YACtB,OAAO,EAAE,YAAY,YACrB,EAAE,QAAQ,SAAS;AAEvB;AAEA,SAAS,kBAAkB,UAA2B;CACpD,OACE,aAAa,aACb,aAAa,oBACb,SAAS,WAAW,UAAU;AAElC;AAEA,SAAgB,sBAAsB,IAAqB;CACzD,MAAM,QAAQ,GAAG,QAAQ,GAAG;CAC5B,OAAO,QAAQ,KAAK,QAAQ,GAAG,SAAS;AAC1C;;;;AAKA,SAAgB,oBAAoB,OAAqC;CACvE,MAAM,WACJ,OAAO,UAAU,WAAW,mBAAmB,MAAM;CACvD,MAAM,UAAU,OAAO,UAAU,WAAW,QAAQ,MAAM;CAE1D,IAAI,kBAAkB,QAAQ,KAAK,sBAAsB,OAAO,GAAG;EACjE,MAAM,cAAc,QAAQ,YAAY;EACxC,MAAM,QAAQ,YAAY,QAAQ,GAAG;EACrC,OAAO;GACL;GACA;GACA;GACA,aAAa,YAAY,MAAM,GAAG,KAAK;EACzC;CACF;CACA,IAAI,aAAa,kBACf,OAAO;EACL;EACA;EACA,aAAa,QAAQ,YAAY;EACjC,aAAa;CACf;CAGF,MAAM,cAAc,GADG,SAAS,MAAM,GAAG,CAAC,CAAC,MAAM,YACX,GAAG,UAAU,YAAY;CAC/D,MAAM,QAAQ,YAAY,QAAQ,GAAG;CACrC,OAAO;EACL;EACA;EACA;EACA,aAAa,YAAY,MAAM,GAAG,KAAK;CACzC;AACF;;;;AAKA,SAAgB,iBACd,WACA,eACsB;CACtB,IAAI,OAAO,kBAAkB,YAAY,cAAc,WAAW,GAChE,OAAO;CAET,IACE,kBAAkB,UAAU,QAAQ,KACpC,sBAAsB,aAAa,GACnC;EACA,MAAM,cAAc,cAAc,YAAY;EAC9C,MAAM,cAAc,YAAY,MAAM,GAAG,YAAY,QAAQ,GAAG,CAAC;EACjE,OAAO;GACL,UAAU;GACV,SAAS;GACT;GACA;EACF;CACF;CACA,MAAM,cAAc,GAAG,UAAU,YAAY,GAAG,gBAAgB,YAAY;CAC5E,OAAO;EACL,UAAU,UAAU;EACpB,SAAS;EACT;EACA,aAAa,UAAU;CACzB;AACF;AAEA,SAAS,sBAAsB,KAAkC;CAC/D,MAAM,aAAuB,CAAC;CAC9B,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;EACnC,MAAM,QAAQ,IAAI;EAClB,IAAI,OAAO,UAAU,UACnB,MAAM,IAAI,qBACR,wBACA,2BAA2B,EAAE,EAC/B;EAEF,MAAM,UAAU,MAAM,KAAK,CAAC,CAAC,YAAY;EACzC,MAAM,QAAQ,QAAQ,MAAM,GAAG;EAC/B,IACE,MAAM,WAAW,KACjB,MAAM,EAAE,CAAE,WAAW,KACrB,MAAM,EAAE,CAAE,WAAW,GAErB,MAAM,IAAI,qBACR,wBACA,2BAA2B,EAAE,IAC7B,wBAAwB,MAAM,gCAChC;EAEF,WAAW,KAAK,OAAO;CACzB;CACA,OAAO,SAAS,YAAY,YAAY;AAC1C;AAEA,SAAS,kBAAkB,QAAwC;CACjE,IAAI,OAAO,WAAW,YAAY,WAAW,MAAM,OAAO;CAC1D,MAAM,IAAI;CACV,OACE,OAAO,EAAE,YAAY,aACrB,OAAO,EAAE,qBAAqB,cAC9B,OAAO,EAAE,wBAAwB;AAErC;AAEA,SAAS,qBACP,OACA,cACA,KACA,KACA,UACQ;CACR,IAAI,UAAU,KAAA,GAAW,OAAO;CAChC,IAAI,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ,OAAO,QAAQ,KACrD,MAAM,IAAI,qBACR,kBACA,UACA,GAAG,SAAS,8BAA8B,IAAI,OAAO,IAAI,EAC3D;CAEF,OAAO;AACT;;;;AAKA,SAAgB,4BACd,SACsB;CACtB,IACE,OAAO,YAAY,YACnB,YAAY,QACZ,MAAM,QAAQ,OAAO,GAErB,MAAM,IAAI,qBAAqB,kBAAkB,SAAS;CAG5D,MAAM,eAAe,QAAQ;CAC7B,IACE,OAAO,iBAAiB,YACxB,iBAAiB,QACjB,MAAM,QAAQ,YAAY,GAE1B,MAAM,IAAI,qBAAqB,kBAAkB,WAAW;CAG9D,MAAM,UAAU,OAAO,KAAK,YAAY;CACxC,KAAK,MAAM,SAAS,SAAS;EAC3B,IAAI,gBAAgB,IAAI,MAAM,YAAY,CAAC,GACzC,MAAM,IAAI,qBAAqB,kBAAkB,aAAa,OAAO;EAEvE,IAAI,CAAC,SAAS,KAAK,KAAK,GACtB,MAAM,IAAI,qBAAqB,iBAAiB,aAAa,OAAO;CAExE;CACA,IAAI,QAAQ,SAAS,GACnB,MAAM,IAAI,qBAAqB,qBAAqB,WAAW;CAEjE,IAAI,QAAQ,SAAS,IACnB,MAAM,IAAI,qBAAqB,sBAAsB,WAAW;CAGlE,MAAM,eAAe,WAAW,OAAO;CACvC,MAAM,YAAoC,CAAC;CAC3C,KAAK,MAAM,SAAS,cAAc;EAChC,MAAM,QAAQ,SAAuB,cAAc,KAAK;EACxD,IAAI;EACJ,IAAI;EACJ,IAAI,iBAAiB,KAAK,GAAG;GAC3B,QAAQ,MAAM;GACd,MAAM,cAAc,SAAkB,OAAO,UAAU;GACvD,IAAI,gBAAgB,KAAA,GAAW;IAC7B,IAAI,CAAC,cAAc,WAAW,GAC5B,MAAM,IAAI,qBACR,yBACA,aAAa,MAAM,UACrB;IAEF,WAAW;GACb;EACF,OACE,QAAQ;EAGV,IAAI,CAAC,qBAAqB,KAAK,GAC7B,MAAM,IAAI,qBACR,yBACA,aAAa,OACf;EAEF,UAAU,KAAK;GACb;GACA;GACA;GACA,WAAW,oBAAoB,KAAK;EACtC,CAAC;CACH;CAEA,MAAM,YAAY,QAAQ,WAAW,KAAA;CACrC,MAAM,cAAc,QAAQ,aAAa,KAAA;CACzC,IAAI,aAAa,aACf,MAAM,IAAI,qBAAqB,uBAAuB,QAAQ;CAEhE,IAAI,CAAC,aAAa,CAAC,aACjB,MAAM,IAAI,qBAAqB,YAAY,QAAQ;CAGrD,MAAM,YAAY,QAAQ;CAC1B,IACE,cAAc,QACd,cAAc,KAAA,KACb,OAAO,cAAc,YAAY,OAAO,cAAc,YAEvD,MAAM,IAAI,qBAAqB,kBAAkB,QAAQ;CAG3D,IAAI,eAAyB,CAAC;CAC9B,IAAI,gBAAgB;CACpB,IAAI,QAAQ,eAAe,KAAA,GAAW;EACpC,MAAM,OAAO,QAAQ;EACrB,IAAI,CAAC,cAAc,IAAI,KAAK,CAAC,MAAM,QAAQ,KAAK,YAAY,GAC1D,MAAM,IAAI,qBAAqB,kBAAkB,YAAY;EAE/D,eAAe,sBACb,KAAK,YACP;EACA,IACE,KAAK,kBAAkB,KAAA,KACvB,OAAO,KAAK,kBAAkB,WAE9B,MAAM,IAAI,qBACR,kBACA,0BACF;EAEF,gBAAgB,KAAK,kBAAkB;EACvC,IAAI,iBAAiB,aAAa,WAAW,GAC3C,MAAM,IAAI,qBACR,2BACA,0BACF;CAEJ;CAEA,MAAM,cAAc,QAAQ,eAAe;CAC3C,IAAI,gBAAgB,wBAAwB,gBAAgB,YAC1D,MAAM,IAAI,qBAAqB,kBAAkB,aAAa;CAGhE,MAAM,eAAe,QAAQ,gBAAgB;CAC7C,IAAI,iBAAiB,UAAU,iBAAiB,QAC9C,MAAM,IAAI,qBAAqB,kBAAkB,cAAc;CAGjE,IACE,QAAQ,mBAAmB,KAAA,KAC3B,OAAO,QAAQ,mBAAmB,WAElC,MAAM,IAAI,qBAAqB,kBAAkB,gBAAgB;CAGnE,IACE,QAAQ,cAAc,KAAA,KACtB,OAAO,QAAQ,cAAc,YAE7B,MAAM,IAAI,qBAAqB,kBAAkB,WAAW;CAG9D,IACE,QAAQ,gBAAgB,KAAA,KACxB,CAAC,kBAAkB,QAAQ,WAAW,GAEtC,MAAM,IAAI,qBAAqB,kBAAkB,aAAa;CAGhE,MAAM,iBAAiB,qBACrB,QAAQ,gBAAA,GAER,GACA,IACA,gBACF;CACA,MAAM,iBAAiB,qBACrB,QAAQ,gBACR,0BACA,MACA,UACA,gBACF;CACA,MAAM,oBAAoB,qBACxB,QAAQ,mBACR,8BACA,KACA,OACA,mBACF;CAEA,OAAO;EACL;EACA;EACA;EACA;EACA;EACA,gBAAgB,QAAQ,mBAAmB;EAC3C;EACA;EACA;CACF;AACF;;AClYA,SAAS,sBACP,UACA,aACS;CACT,IAAI,SAAS,gBAAgB,aAC3B,OAAO;CAET,OACE,sBAAsB,SAAS,OAAO,KACtC,SAAS,QAAQ,YAAY,MAAM;AAEvC;;;;;AAMA,SAAgB,iBACd,WACA,QACA,oBACoB;CACpB,KAAK,MAAM,eAAe,oBACxB,IAAI,sBAAsB,WAAW,WAAW,GAC9C,OAAO;EAAE;EAAa,IAAI;CAAY;CAG1C,IAAI,WAAW,MACR;OAAA,MAAM,eAAe,oBACxB,IAAI,sBAAsB,QAAQ,WAAW,GAC3C,OAAO;GAAE;GAAa,IAAI;EAAS;CAAA;CAIzC,OAAO;AACT;;;;;AAMA,SAAgB,oBACd,SACA,oBAIA;CACA,MAAM,iCAAiB,IAAI,IAAiB;CAC5C,MAAM,+BAAe,IAAI,IAAiB;CAC1C,MAAM,uBAAgE,CAAC;CACvE,MAAM,oBAA0D,CAAC;CACjE,MAAM,kBAAgC,CAAC;CAEvC,IAAI,QAAQ;CAEZ,KAAK,MAAM,EAAE,OAAO,YAAY,SAAS;EAIvC,IAAI,EAFF,OAAO,WAAW,cAAc,OAAO,UAAU,oBAE9B;GACnB;GACA,MAAM,KAAK,OAAO,UAAU;GAC5B,MAAM,QAAQ,eAAe,IAAI,EAAE;GACnC,IAAI,UAAU,KAAA,GACZ,eAAe,IAAI,IAAI,CAAC,KAAK,CAAC;QAE9B,MAAM,KAAK,KAAK;EAEpB;EAEA,IAAI,OAAO,WAAW,cAAc,OAAO,WAAW,MAAM;GAC1D,MAAM,MAAM,OAAO,OAAO;GAC1B,MAAM,QAAQ,aAAa,IAAI,GAAG;GAClC,IAAI,UAAU,KAAA,GACZ,aAAa,IAAI,KAAK,CAAC,KAAK,CAAC;QAE7B,MAAM,KAAK,KAAK;EAEpB;EAEA,MAAM,iBACJ,OAAO,WAAW,cAAc,OAAO,UAAU,oBAC7C,OACA,OAAO;EACb,MAAM,QAAQ,iBACZ,OAAO,WACP,gBACA,kBACF;EACA,IAAI,UAAU,MAAM;GAClB,qBAAqB,KAAK;IACxB,SAAS;IACT,aAAa,MAAM;IACnB,IAAI,MAAM;GACZ,CAAC;GACD,IAAI,OAAO,WAAW,YACpB,gBAAgB,KAAK;IACnB,MAAM;IACN,UAAU;IACV,WAAW,CAAC,KAAK;IACjB,MAAM;KAAE,aAAa,MAAM;KAAa,IAAI,MAAM;IAAG;GACvD,CAAC;EAEL;EAEA,IAAI,OAAO,WAAW,YAAY;GAChC,kBAAkB,KAAK;IACrB,SAAS;IACT,OAAO,OAAO;IACd,aAAa,OAAO,MAAM;IAC1B,IAAI,OAAO,MAAM;GACnB,CAAC;GACD,gBAAgB,KAAK;IACnB,MAAM;IACN,UAAU;IACV,WAAW,CAAC,KAAK;IACjB,MAAM;KACJ,OAAO,OAAO;KACd,aAAa,OAAO,MAAM;KAC1B,IAAI,OAAO,MAAM;IACnB;GACF,CAAC;EACH,OAAO,IAAI,OAAO,WAAW,UAC3B,gBAAgB,KAAK;GACnB,MAAM;GACN,UAAU;GACV,WAAW,CAAC,KAAK;GACjB,MAAM,EAAE,MAAM,OAAO,MAAM,KAAK;EAClC,CAAC;OACI,IAAI,OAAO,iBAAiB,UACjC,gBAAgB,KAAK;GACnB,MAAM;GACN,UAAU;GACV,WAAW,CAAC,KAAK;EACnB,CAAC;CAEL;CAEA,MAAM,wBAAwB,SAC5B,MAAM,KAAK,aAAa,QAAQ,CAAC,CAAC,CAC/B,QAAQ,GAAG,YAAY,OAAO,UAAU,CAAC,CAAC,CAC1C,KAAK,CAAC,aAAa,gBAAgB;EAAE;EAAa;CAAU,EAAE,IAChE,GAAG,MAAM,aAAa,EAAE,aAAa,EAAE,WAAW,CACrD;CAEA,KAAK,MAAM,SAAS,uBAClB,gBAAgB,KAAK;EACnB,MAAM;EACN,UAAU;EACV,WAAW,CAAC,GAAG,MAAM,SAAS;EAC9B,MAAM,EAAE,aAAa,MAAM,YAAY;CACzC,CAAC;CAGH,MAAM,qBAAqB,SACzB,MAAM,KAAK,eAAe,QAAQ,CAAC,CAAC,CACjC,QAAQ,GAAG,YAAY,OAAO,UAAU,CAAC,CAAC,CAC1C,KAAK,CAAC,aAAa,gBAAgB;EAAE;EAAa;CAAU,EAAE,IAChE,GAAG,MAAM,aAAa,EAAE,aAAa,EAAE,WAAW,CACrD;CAEA,MAAM,2BAA2B,eAAe;CAChD,IAAI,SAAS,KAAK,6BAA6B,GAAG;EAChD,MAAM,kBAAkB,eAAe,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC;EACrD,IAAI,oBAAoB,KAAA,KAAa,oBAAoB,aACvD,gBAAgB,KAAK;GACnB,MAAM;GACN,UAAU;GACV,MAAM,EAAE,aAAa,gBAAgB;EACvC,CAAC;CAEL;CAEA,OAAO;EACL,cAAc;GACZ;GACA;GACA;GACA;GACA;EACF;EACA;CACF;AACF;;ACnJA,MAAM,aAAa;CACjB;CACA;CACA;CACA;CACA;CACA;AACF;AAWA,eAAe,cACb,SACA,YACA,gBACyB;CACzB,MAAM,YAAY,WAAW,gBAAgB;CAC7C,MAAM,oBAAoB,YAAY,wBAAwB;CAC9D,MAAM,YAAY,QAAQ,WAAW,KAAA,IAAY,WAAW;CAC5D,MAAM,WAAW,cAAc,WAAW,QAAQ,SAAS,QAAQ;CAEnE,MAAM,cAAc,MAAM,SAAS,UAAU,WAAW,SAAS;CACjE,MAAM,aAAa,cAAc,WAAW;CAC5C,MAAM,aAAa,eAAe,UAAU;CAC5C,MAAM,YAAY,MAAM,UAAU,UAAU;CAE5C,MAAM,mBACJ,QAAQ,iBAAiB,KAAA,IACrB,MAAM,UACJ,cACE,MAAM,SAAS,QAAQ,cAAc,WAAW,cAAc,CAChE,CACF,IACA;CAEN,MAAM,YAAuC,EAC3C,YAAY,eACd;CACA,IAAI,QAAQ,eAAe,KAAA,GACzB,UAAU,OAAO,QAAQ;CAE3B,IAAI,QAAQ,sBAAsB,KAAA,GAChC,UAAU,cAAc,QAAQ;CAElC,MAAM,aAAa,MAAM,UAAU,cAAc,SAAS,CAAC;CAa3D,MAAM,WAA2B;EAC/B,aAAA,MAZwB,UACxB,cAAc;GACZ,UAAU;GACV;GACA;GACA;GACA;GACA,aAAa;EACf,CAAC,CACH;EAIE;EACA;EACA;EACA;EACA;EACA,aAAa;CACf;CAEA,IAAI,WAAW,iBAAiB,QAAQ;EACtC,MAAM,MAA0C,CAAC;EACjD,IAAI,QAAQ,iBAAiB,KAAA,GAC3B,IAAI,eAAe,MAAM,SACvB,QAAQ,cACR,OACA,cACF;EAEF,MAAM,eAAe,YACjB,MAAM,SAAS,UAAU,OAAO,SAAS,IACzC;EACJ,IAAI,cAAc,UAChB,IAAI,SAAS;OAEb,IAAI,WAAW;EAEjB,SAAS,MAAM;CACjB;CAEA,OAAO,EAAE,SAAS;AACpB;AAEA,SAAS,wBACP,SACA,SACA,YACA,aACoC;CACpC,MAAM,SAAkC,CAAC;CACzC,MAAM,WAAW,QAAQ;CACzB,IAAI,aAAa,KAAA,GACf,KAAK,MAAM,OAAO,OAAO,KAAK,QAAQ,GAAG;EACvC,IACE,QAAQ,aACR,QAAQ,gBACR,QAAQ,aACR,QAAQ,qBACR,QAAQ,iBACR,QAAQ,WACR,QAAQ,YACR,QAAQ,cACR,QAAQ,kBACR,QAAQ,YACR,QAAQ,aAER;EAEF,MAAM,MAAO,SAAqC;EAClD,IAAI,QAAQ,KAAA,GACV,OAAO,OAAO;CAElB;CAGF,MAAM,UAAU,UAAU,WAAW,QAAQ;CAC7C,IAAI,YAAY,KAAA,GAAW,OAAO,UAAU;CAE5C,MAAM,aAAa,UAAU,cAAc,QAAQ;CACnD,IAAI,eAAe,KAAA,GAAW,OAAO,aAAa;CAElD,MAAM,UAAU,UAAU,WAAW,QAAQ;CAC7C,IAAI,YAAY,KAAA,GAAW,OAAO,UAAU;CAE5C,MAAM,kBAAkB,UAAU,mBAAmB,QAAQ;CAC7D,IAAI,oBAAoB,KAAA,GAAW,OAAO,kBAAkB;CAE5D,IAAI,QAAQ,cAAc,KAAA,GACxB,OAAO,YAAY,QAAQ;CAE7B,IAAI,QAAQ,iBAAiB,KAAA,GAC3B,OAAO,eAAe,QAAQ;CAEhC,IAAI,QAAQ,WAAW,KAAA,GACrB,OAAO,SAAS,QAAQ;MACnB,IAAI,QAAQ,aAAa,KAAA,GAC9B,OAAO,WAAW,QAAQ;CAG5B,OAAO,QAAQ,QAAQ;CACvB,OAAO,SAAS;CAChB,OAAO,cAAc;CAErB,OAAO;AACT;AAEA,SAAS,SACP,QACA,SACc;CACd,MAAM,QAAsB;EAC1B,aAAa;EACb,cAAc;EACd,aAAa;EACb,iBAAiB;EACjB,kBAAkB;EAClB,iBAAiB;CACnB;CACA,KAAK,MAAM,OAAO,YAAY;EAC5B,IAAI,MAAM;EACV,IAAI,QAAQ;EACZ,KAAK,MAAM,SAAS,QAAQ;GAE1B,MAAM,MADM,QAAQ,IAAI,KACV,CAAC,EAAE,QAAQ;GACzB,IAAI,OAAO,QAAQ,UAAU;IAC3B,OAAO;IACP;GACF;EACF;EACA,IAAI,QAAQ,GACV,MAAM,OAAO;CAEjB;CACA,OAAO;AACT;AAEA,SAAS,uBAA0B,QAAqC;CACtE,IAAI,OAAO,WAAW,YACpB,OAAO;EACL,QAAQ;EACR,WAAW,OAAO,UAAU;EAC5B,QAAQ,OAAO,QAAQ,eAAe;EACtC,QAAQ,OAAO;CACjB;CAEF,IAAI,OAAO,WAAW,UACpB,OAAO;EACL,QAAQ;EACR,WAAW,OAAO,UAAU;EAC5B,QAAQ,OAAO,QAAQ,eAAe;EACtC,MAAM,OAAO,MAAM;CACrB;CAEF,OAAO;EACL,QAAQ;EACR,WAAW,OAAO,UAAU;EAC5B,OAAO,OAAO;CAChB;AACF;;;;AAKA,eAAsB,YACpB,SACuB;CACvB,OAAO,qBAAqB,OAAO;AACrC;;;;;AAMA,eAAsB,qBACpB,SACA,OACuB;CAEvB,MAAM,aAAa,4BAA4B,OAAO;CAGtD,IAAI,QAAQ,aAAa,SACvB,MAAM,QAAQ,YAAY;CAI5B,IAAI;CACJ,IAAI;EACF,iBAAkB,MAAM,SAAS,QAAQ,MAAM,CAAC,CAAC;CACnD,SAAS,KAAK;EACZ,IAAI,QAAQ,aAAa,SACvB,MAAM,QAAQ,YAAY;EAE5B,MAAM,IAAI,qBACR,kBACA,UACA,eAAe,QAAQ,IAAI,UAAU,KAAA,CACvC;CACF;CACA,IAAI,QAAQ,aAAa,SACvB,MAAM,QAAQ,YAAY;CAE5B,MAAM,OAAO,MAAM,WAAW,gBAAgB,QAAQ,OAAO;CAC7D,IAAI,QAAQ,aAAa,SACvB,MAAM,QAAQ,YAAY;CAI5B,MAAM,EAAE,aAAa,MAAM,cAAc,SAAS,YAAY,cAAc;CAC5E,IAAI,QAAQ,aAAa,SACvB,MAAM,QAAQ,YAAY;CAI5B,MAAM,4BAAY,IAAI,IAAyB;CAC/C,MAAM,iBAAyC,CAAC;CAChD,MAAM,uBACJ,CAAC;CAEH,KAAK,MAAM,WAAW,WAAW,WAAW;EAC1C,IAAI,WAAW,eAAe;GAC5B,MAAM,QAAQ,iBACZ,QAAQ,WACR,MACA,WAAW,YACb;GACA,IAAI,UAAU,MAAM;IAClB,MAAM,SAA2B;KAC/B,QAAQ;KACR,OAAO;KACP;KACA,WAAW,QAAQ;KACnB,QAAQ;KACR,YAAY;KACZ,OAAO;IACT;IACA,UAAU,IAAI,QAAQ,OAAO,MAAM;IACnC,qBAAqB,KAAK;KAAE,OAAO,QAAQ;KAAO;IAAO,CAAC;IAC1D;GACF;EACF;EACA,eAAe,KAAK,OAAO;CAC7B;CAEA,IAAI,eAAe,SAAS,GAC1B,MAAM,IAAI,qBACR,qCACA,aACA,QAAQ,eAAe,OAAO,qEAChC;CAGF,MAAM,aAAa,OAAO,OAAU;EAClC,QAAQ,QAAQ;EAChB,GAAI,QAAQ,eAAe,KAAA,IAAY,EAAE,MAAM,QAAQ,WAAW,IAAI,CAAC;EACvE,GAAI,QAAQ,sBAAsB,KAAA,IAC9B,EAAE,aAAa,QAAQ,kBAAkB,IACzC,CAAC;CACP,CAAC;CAGD,MAAM,qBAAqB,IAAI,gBAAgB;CAC/C,MAAM,eAAe,QAAQ;CAC7B,MAAM,aACJ,iBAAiB,KAAA,IACb,YAAY,IAAI,CAAC,cAAc,mBAAmB,MAAM,CAAC,IACzD,mBAAmB;CAEzB,IAAI,aAAa;CACjB,IAAI;CACJ,MAAM,iBAAiB,IAAI,SAAgB,UAAU,WAAW;EAC9D,gBAAgB;CAClB,CAAC;CAED,eAAe,YAAY,CAAC,CAAC;CAE7B,MAAM,sBAA4B;EAChC,IAAI,YAAY;EAChB,aAAa;EACb,MAAM,SAAkB,cAAc;EACtC,mBAAmB,MAAM,MAAM;EAC/B,cAAc,MAAM;CACtB;CAEA,IAAI,iBAAiB,KAAA,GAAW;EAC9B,IAAI,aAAa,SACf,MAAM,aAAa;EAErB,aAAa,iBAAiB,SAAS,eAAe,EAAE,MAAM,KAAK,CAAC;CACtE;CAEA,MAAM,iBAAiB,OAAU,WAAmC;EAClE,IACE,cACA,cAAc,WACd,QAAQ,cAAc,KAAA,GAEtB;EAEF,IAAI;GACF,QAAQ,UAAU,OAAO,MAAM;EACjC,SAAS,aAAa;GACpB,IAAI,CAAC,YAAY;IACf,aAAa;IACb,mBAAmB,MAAM,WAAW;IACpC,cAAc,WAAW;GAC3B;EACF;CACF;CAEA,KAAK,MAAM,OAAO,sBAAsB;EACtC,IAAI,YAAY;EAChB,cAAc,IAAI,OAAO,IAAI,MAAM;CACrC;CAUA,MAAM,aAAa,OAAO,YAAiD;EACzE,IAAI,cAAc,cAAc,SAAS;EAEzC,MAAM,UAAU,YAAY,IAAI;EAChC,IAAI;EAEJ,IAAI;EACJ,IAAI;GACF,MAAM,SAAS,wBACb,SACA,SACA,YACA,UACF;GACA,OAAO,uBAAuB,MAAM;GACpC,SAAU,MAAM,aAAa,MAAM;GACnC,MAAM,WAAW;GACjB,MAAM,YAAY,SAAS;GAC3B,MAAM,eAAe,SAAS;GAC9B,MAAM,QAAQ,SAAS,SAAS,KAAK,KAAK;IACxC,aAAa;IACb,cAAc;IACd,aAAa;IACb,iBAAiB;IACjB,kBAAkB;IAClB,iBAAiB;GACnB;GACA,MAAM,WAAW,iBACf,SAAS,UACT,WAAW,iBACb;GACA,MAAM,SAAS,iBACb,QAAQ,WACR,SAAS,WAAW,UAAU,OAChC;GAGA,MAAM,QAAQ,cAAc,SAAS;GACrC,MAAM,UAAU,eAAe,KAAK;GACpC,IAAI,UAAU,WAAW,gBACvB,MAAM,IAAI,oBAAoB,SAAS,WAAW,cAAc;GAElE,MAAM,cAAc,KAAK,MAAM,KAAK;GACpC,IAAI,CAAC,cAAc,WAAW,GAC5B,MAAM,IAAI,uBAAuB;IAC/B,SAAS;IACT,MAAM;IACN,UAAU;KACR,IAAI;KACJ,2BAAW,IAAI,KAAK,CAAC;KACrB,SACE,SAAS,WAAW,UAAU,WAC9B,QAAQ,UAAU;IACtB;IACA,OAAO,SAAS;IAChB;GACF,CAAC;GAEH,MAAM,aAAa,KAAK,IAAI,GAAG,KAAK,MAAM,YAAY,IAAI,IAAI,OAAO,CAAC;GAEtE,IAAI,WAAW,iBAAiB,WAAW,MAAM;IAC/C,MAAM,YAAY,iBAChB,QAAQ,WACR,QACA,WAAW,YACb;IACA,IAAI,cAAc,MAAM;KACtB,SAAS;MACP,QAAQ;MACR,OAAO;MACP,OAAO;MACP,WAAW,QAAQ;MACnB;MACA;MACA,QAAQ;MACR;KACF;KACA,UAAU,IAAI,QAAQ,OAAO,MAAM;KACnC,cAAc,QAAQ,OAAO,MAAM;KACnC;IACF;GACF;GAEA,SAAS;IACP,QAAQ;IACR,WAAW,QAAQ;IACnB;IACA;IACA,QAAQ;IACR;IACA;IACA;GACF;EACF,SAAS,QAAQ;GACf,IAAI,cAAc,cAAc,SAC9B;GAEF,MAAM,aAAa,KAAK,IAAI,GAAG,KAAK,MAAM,YAAY,IAAI,IAAI,OAAO,CAAC;GACtE,MAAM,gBAAgB;GACtB,MAAM,WAAyB,qBAC7B,QACA,kBAAkB,KAAA,IACd;IACE,cAAc,cAAc;IAC5B,OAAO,cAAc;GACvB,IACA,KAAA,GACJ,WAAW,iBACb;GAEA,MAAM,SACJ,kBAAkB,KAAA,IACd,iBACE,QAAQ,WACR,cAAc,WAAW,UAAU,OACrC,IACA;GAEN,IAAI,QAA6B;GACjC,IAAI,kBAAkB,KAAA,GACpB,QAAQ,SAAS,cAAc,KAAK;QAC/B,IACL,OAAO,WAAW,YAClB,WAAW,QACX,WAAW,QAEX,QAAQ,SACL,OAAsD,KACzD;GAGF,SAAS;IACP,QAAQ;IACR,WAAW,QAAQ;IACnB;IACA;IACA,OAAO;IACP;GACF;EACF;EAEA,IAAI,cAAc,cAAc,SAC9B;EAEF,UAAU,IAAI,QAAQ,OAAO,MAAM;EACnC,cAAc,QAAQ,OAAO,MAAM;CACrC;CAEA,IAAI,UAAU;CACd,MAAM,cAAc,KAAK,IACvB,WAAW,gBACX,eAAe,MACjB;CACA,MAAM,UAAU,MAAM,KAAK,EAAE,QAAQ,YAAY,GAAG,YAAY;EAC9D,OAAO,UAAU,eAAe,QAAQ;GACtC,IAAI,cAAc,cAAc,SAAS;GACzC,MAAM,MAAM;GACZ;GACA,MAAM,WAAW,eAAe,IAAK;EACvC;CACF,CAAC;CACD,MAAM,aAAa,QAAQ,IAAI,OAAO;CACtC,WAAW,YAAY,CAAC,CAAC;CAEzB,IAAI;EACF,MAAM,QAAQ,KAAK,CAAC,YAAY,cAAc,CAAC;CACjD,UAAU;EACR,IAAI,iBAAiB,KAAA,GACnB,aAAa,oBAAoB,SAAS,aAAa;CAE3D;CAEA,IAAI,cAAc,SAChB,MAAM,aAAa;CAIrB,MAAM,eAAe,WAAW,UAAU,KAAI,MAAK,EAAE,KAAK;CAC1D,MAAM,iBAA+C,CAAC;CACtD,MAAM,cAA6D,CAAC;CACpE,MAAM,kBAAuC,CAAC;CAC9C,MAAM,eAAgD,CAAC;CACvD,MAAM,mBAA0C,CAAC;CAEjD,IAAI,WAAW;CACf,IAAI,SAAS;CACb,IAAI,WAAW;CAEf,KAAK,MAAM,SAAS,cAAc;EAChC,MAAM,MAAM,UAAU,IAAI,KAAK;EAC/B,eAAe,KAAK,CAAC,OAAO,GAAG,CAAC;EAChC,YAAY,KAAK;GAAE;GAAO,QAAQ;EAAI,CAAC;EACvC,aAAa,KAAK,CAAC,OAAO,IAAI,KAAK,CAAC;EACpC,iBAAiB,KAAK,CAAC,OAAO,uBAAuB,GAAG,CAAC,CAAC;EAE1D,IAAI,IAAI,WAAW,YAAY;GAC7B;GACA,gBAAgB,KAAK;IACnB,SAAS;IACT,QAAQ,IAAI;GACd,CAAC;EACH,OAAO,IAAI,IAAI,WAAW,UACxB;OAEA;CAEJ;CAEA,MAAM,SAAiB;EACrB,QAAQ,aAAa;EACrB,OAAO,eAAe;EACtB;EACA;EACA;CACF;CAGA,MAAM,UADY,OAAO,iBAAiBA,cAAAA,CACd,KAAK,QAAQ,eAAe;CACxD,MAAM,WAAW,gBAAgB,KAAK,QAAQ,MAAM;CACpD,MAAM,EAAE,cAAc,oBAAoB,oBACxC,aACA,WAAW,YACb;CACA,MAAM,qBAAqB,0BAA0B;EACnD,UAAU,OAAO;EACjB,YAAY,KAAK;EACjB,cAAc;EACd;EACA,gBAAgB,WAAW;CAC7B,CAAC;CACD,MAAM,WAAW,aAAa,CAAC,GAAG,iBAAiB,GAAG,kBAAkB,CAAC;CACzE,MAAM,WAAW,gBAAgB,QAAQ;CAWzC,OAAO;EACL,UAAU;EACV,aAAa,MAXiB,UAC9B,cAAc;GACZ,UAAU;GACV,UAAU,SAAS;GACnB,MAAM,KAAK;GACX,WAAW,wBAAwB,gBAAgB;EACrD,CAAC,CACH;EAKE;EACA;EACA,WAAW,wBAAwB,cAAc;EACjD;EACA;EACA;EACA;EACA;EACA;EACA,OAAO;GACL,YAAY,wBAAwB,YAAY;GAChD,OAAO,SAAS,cAAc,SAAS;EACzC;EACA,4BAAW,IAAI,KAAK,EAAA,CAAE,YAAY;CACpC;AACF;;AC7qBA,MAAM,yBAAyB;CAC7B;CACA;CACA;CACA;CACA;CACA;AACF;;;;;;;AAQA,SAAgB,uBACd,SACA,UACc;CACd,IAAI,CAAC,cAAc,OAAO,GACxB,OAAO;EAAE,OAAO;EAAO,QAAQ;CAAY;CAG7C,KAAK,MAAM,SAAS,wBAAwB;EAC1C,IAAI,CAAC,OAAO,OAAO,SAAS,KAAK,GAC/B,OAAO;GAAE,OAAO;GAAO,QAAQ;EAAY;EAE7C,MAAM,MAAM,SAAS,SAAS,KAAK;EACnC,IAAI,OAAO,QAAQ,YAAY,QAAQ,IACrC,OAAO;GAAE,OAAO;GAAO,QAAQ;EAAY;CAE/C;CAEA,IAAI,CAAC,OAAO,OAAO,SAAS,uBAAuB,GACjD,OAAO;EAAE,OAAO;EAAO,QAAQ;CAAY;CAE7C,MAAM,wBAAwB,SAAS,SAAS,uBAAuB;CACvE,IAAI,OAAO,0BAA0B,WACnC,OAAO;EAAE,OAAO;EAAO,QAAQ;CAAY;CAI7C,IADgB,SAAiB,SAAS,SAChC,MAAM,2BACd,OAAO;EAAE,OAAO;EAAO,QAAQ;CAAgB;CAGjD,IAAI,0BAA0B,MAC5B,OAAO;EAAE,OAAO;EAAO,QAAQ;CAAuB;CAGxD,IAAI,cAAc,QAAQ,GAAG;EAC3B,MAAM,iBAAiB,SAAS,UAAU,qBAAqB;EAC/D,IACE,OAAO,mBAAmB,YAC1B,SAAiB,SAAS,qBAAqB,MAAM,gBAErD,OAAO;GAAE,OAAO;GAAO,QAAQ;EAAkB;EAGnD,MAAM,gBAAgB,SAAS,UAAU,oBAAoB;EAC7D,IACE,OAAO,kBAAkB,YACzB,SAAiB,SAAS,oBAAoB,MAAM,eAEpD,OAAO;GAAE,OAAO;GAAO,QAAQ;EAAiB;CAEpD;CAEA,OAAO,EAAE,OAAO,KAAK;AACvB;;AAGA,SAAgB,cAAc,SAAiC;CAC7D,IAAI,CAAC,cAAc,OAAO,KAAK,CAAC,OAAO,OAAO,SAAS,WAAW,GAChE,OAAO;CAET,MAAM,MAAM,SAAS,SAAS,WAAW;CACzC,IAAI,OAAO,QAAQ,UAAU,OAAO;CACpC,MAAM,QAAQ,eAAe,GAAG;CAChC,OAAO,UAAU,KAAK,OAAO;AAC/B;;ACvDA,MAAM,2BAAW,IAAI,IAAqB;CAAC;CAAQ;CAAQ;CAAS;AAAS,CAAC;AAC9E,MAAM,mBAAmB;AAezB,SAAS,gBAAgB,OAAgB,cAAiC;CACxE,IAAI;EACF,cAAc,KAAK;CACrB,QAAQ;EACN,MAAM,IAAI,qBAAqB,oBAAoB,YAAY;CACjE;CACA,OAAO,mBAAmB,KAAkB;AAC9C;AAEA,MAAM,6CAA6B,IAAI,IAAI,CACzC,oBACA,uBACF,CAAC;AACD,MAAM,gDAAgC,IAAI,IAAI,CAC5C,uBACA,oBACF,CAAC;AAED,SAAS,0BAA0B,SAGjC;CACA,IAAI,YAAY,KAAA,GACd,OAAO;EAAE,kBAAkB;EAAO,uBAAuB;CAAM;CAEjE,IAAI,CAAC,cAAc,OAAO,GACxB,MAAM,IAAI,qBAAqB,kBAAkB,SAAS;CAG5D,KAAK,MAAM,OAAO,OAAO,KAAK,OAAO,GACnC,IAAI,CAAC,2BAA2B,IAAI,GAAG,GACrC,MAAM,IAAI,qBAAqB,kBAAkB,WAAW,KAAK;CAIrE,MAAM,WAAW,SAAS,SAAS,kBAAkB;CACrD,IAAI,aAAa,KAAA,KAAa,OAAO,aAAa,WAChD,MAAM,IAAI,qBAAqB,kBAAkB,kBAAkB;CAGrE,MAAM,SAAS,SAAS,SAAS,uBAAuB;CACxD,IAAI,wBAAwD;CAE5D,IAAI,WAAW,QAAQ,WAAW,SAAS,WAAW,KAAA,GACpD,wBAAwB,WAAW;MAC9B,IAAI,cAAc,MAAM,GAAG;EAChC,KAAK,MAAM,OAAO,OAAO,KAAK,MAAM,GAClC,IAAI,CAAC,8BAA8B,IAAI,GAAG,GACxC,MAAM,IAAI,qBACR,kBACA,yBAAyB,KAC3B;EAGJ,MAAM,aAA8B,CAAC;EACrC,MAAM,MAAM,SAAS,QAAQ,qBAAqB;EAClD,IAAI,QAAQ,KAAA,GAAW;GACrB,IAAI,OAAO,QAAQ,UACjB,MAAM,IAAI,qBACR,kBACA,2CACF;GAEF,WAAW,sBAAsB;EACnC;EACA,MAAM,SAAS,SAAS,QAAQ,oBAAoB;EACpD,IAAI,WAAW,KAAA,GAAW;GACxB,IAAI,OAAO,WAAW,UACpB,MAAM,IAAI,qBACR,kBACA,0CACF;GAEF,WAAW,qBAAqB;EAClC;EACA,wBACE,OAAO,KAAK,UAAU,CAAC,CAAC,WAAW,IAAI,OAAO;CAClD,OACE,MAAM,IAAI,qBAAqB,kBAAkB,uBAAuB;CAG1E,OAAO;EACL,kBAAkB,aAAa;EAC/B;CACF;AACF;AAEA,SAAS,qBAAqB,KAAc,OAA8B;CACxE,IAAI,CAAC,cAAc,GAAG,GACpB,MAAM,IAAI,qBAAqB,oBAAoB,YAAY,MAAM,EAAE;CAGzE,MAAM,YAAY,SAAS,KAAK,QAAQ;CACxC,IAAI,OAAO,cAAc,UACvB,MAAM,IAAI,qBACR,oBACA,YAAY,MAAM,SACpB;CAEF,MAAM,SAAS,cAAc,eAAe,SAAS,CAAC;CACtD,IAAI,OAAO,KAAK,CAAC,CAAC,WAAW,KAAK,OAAO,SAAS,kBAChD,MAAM,IAAI,qBACR,oBACA,YAAY,MAAM,SACpB;CAGF,MAAM,aAAa,SAAS,KAAK,SAAS;CAC1C,IACE,OAAO,eAAe,YACtB,CAAC,SAAS,IAAI,UAA6B,GAE3C,MAAM,IAAI,qBACR,oBACA,YAAY,MAAM,UACpB;CAEF,MAAM,UAAU;CAEhB,MAAM,UAAqC;EACzC;EACA;CACF;CAEA,IAAI;CACJ,MAAM,WAAW,SAAS,KAAK,OAAO;CACtC,IAAI,aAAa,KAAA,GAAW;EAC1B,IAAI,CAAC,cAAc,QAAQ,GACzB,MAAM,IAAI,qBACR,oBACA,YAAY,MAAM,QACpB;EAEF,MAAM,WAAW,OAAO,OAAO,UAAU,OAAO;EAChD,MAAM,UAAU,OAAO,OAAO,UAAU,MAAM;EAC9C,IAAI,YAAY,CAAC,SAAS;GACxB,IAAI,SAAS,UAAU,OAAO,MAAM,YAClC,MAAM,IAAI,qBACR,oBACA,YAAY,MAAM,cACpB;GAEF,QAAQ,EAAE,OAAO,WAAW;GAC5B,QAAQ,QAAQ,EAAE,OAAO,WAAW;EACtC,OAAO,IAAI,WAAW,CAAC,UAAU;GAC/B,MAAM,UAAU,SAAS,UAAU,MAAM;GACzC,IAAI,OAAO,YAAY,UACrB,MAAM,IAAI,qBACR,oBACA,YAAY,MAAM,aACpB;GAEF,IAAI;GACJ,IAAI;IACF,iBAAiB,cAAc,OAAO;IACtC,aAAa,cAAc;GAC7B,QAAQ;IACN,MAAM,IAAI,qBACR,oBACA,YAAY,MAAM,aACpB;GACF;GACA,IACE,CAAC,OAAO,OAAO,UAAU,OAAO,KAChC,SAAS,UAAU,OAAO,MAAM,KAAA,GAEhC,MAAM,IAAI,qBACR,oBACA,YAAY,MAAM,cACpB;GAEF,MAAM,QAAQ,gBACZ,SAAS,UAAU,OAAO,GAC1B,YAAY,MAAM,cACpB;GACA,QAAQ;IAAE,MAAM;IAAgB;GAAM;GACtC,QAAQ,QAAQ;IAAE,MAAM;IAAgB;GAAM;EAChD,OACE,MAAM,IAAI,qBACR,oBACA,YAAY,MAAM,QACpB;CAEJ;CAEA,MAAM,UAAU,SAAS,KAAK,SAAS;CACvC,IAAI,YAAY,KAAA,GAAW;EACzB,IAAI,CAAC,cAAc,OAAO,GACxB,MAAM,IAAI,qBACR,oBACA,YAAY,MAAM,UACpB;EAEF,QAAQ,UAAU,gBAAgB,SAAS,YAAY,MAAM,UAAU;CACzE;CAEA,MAAM,SAAS,SAAS,KAAK,QAAQ;CACrC,IAAI,WAAW,KAAA,GAAW;EACxB,IAAI,CAAC,cAAc,MAAM,GACvB,MAAM,IAAI,qBACR,oBACA,YAAY,MAAM,SACpB;EAEF,QAAQ,SAAS,gBAAgB,QAAQ,YAAY,MAAM,SAAS;CACtE;CAEA,MAAM,UAAU,SAAS,KAAK,SAAS;CACvC,IAAI,YAAY,KAAA,GACd,QAAQ,UAAU,gBAAgB,SAAS,YAAY,MAAM,UAAU;CAGzE,MAAM,MAAqB;EAAE;EAAQ;EAAS,mBAAmB;CAAQ;CACzE,IAAI,UAAU,KAAA,GAAW,IAAI,QAAQ;CACrC,IAAI,YAAY,KAAA,GAAW,IAAI,UAAU;CACzC,OAAO;AACT;AAEA,SAAS,eAAe,QAA2C;CACjE,MAAM,sBAAM,IAAI,IAAY;CAC5B,KAAK,MAAM,KAAK,QACd,IAAI,IAAI,cAAc,CAAC,CAAC;CAE1B,OAAO;AACT;AAEA,SAAS,cACP,QACA,SAC4B;CAC5B,IAAI,CAAC,MAAM,QAAQ,MAAM,GAAG,OAAO;CACnC,MAAM,sBAAM,IAAI,IAAoB;CACpC,KAAK,MAAM,QAAQ,QAAQ;EACzB,IAAI,CAAC,cAAc,IAAI,KAAK,CAAC,OAAO,OAAO,MAAM,OAAO,GAAG,OAAO;EAClE,MAAM,SAAS,SAAS,MAAM,OAAO;EACrC,IAAI,WAAW,KAAA,GAAW,OAAO;EACjC,MAAM,WAAW,cAAc,MAAM;EACrC,IAAI,IAAI,IAAI,QAAQ,GAAG,OAAO;EAC9B,IAAI,IAAI,UAAU,cAAc,IAAI,CAAC;CACvC;CACA,OAAO;AACT;AAEA,SAAS,kBACP,MACA,GACA,GACS;CACT,QAAQ,KAAK,YAAb;EACE,KAAK,QACH,OAAO;EACT,KAAK;EACL,KAAK,uBACH,OAAO,cAAc,CAAC,MAAM,cAAc,CAAC;EAC7C,KAAK;GACH,IAAI,MAAM,QAAQ,MAAM,MAAM,OAAO;GACrC,IACE,OAAO,MAAM,YACb,OAAO,SAAS,CAAC,KACjB,OAAO,MAAM,YACb,OAAO,SAAS,CAAC,GAEjB,OAAO,gBAAgB,GAAG,GAAG,KAAK,SAAS;GAE7C,OAAO;EACT,KAAK,OAAO;GACV,IAAI,MAAM,QAAQ,MAAM,MAAM,OAAO;GACrC,IAAI,CAAC,MAAM,QAAQ,CAAC,KAAK,CAAC,MAAM,QAAQ,CAAC,GAAG,OAAO;GACnD,MAAM,OAAO,eAAe,CAAgB;GAC5C,MAAM,OAAO,eAAe,CAAgB;GAC5C,IAAI,KAAK,SAAS,KAAK,MAAM,OAAO;GACpC,KAAK,MAAM,KAAK,MACd,IAAI,CAAC,KAAK,IAAI,CAAC,GAAG,OAAO;GAE3B,OAAO;EACT;EACA,KAAK,aAAa;GAChB,IAAI,MAAM,QAAQ,MAAM,MAAM,OAAO;GACrC,MAAM,OAAO,cAAc,GAAG,KAAK,GAAG;GACtC,MAAM,OAAO,cAAc,GAAG,KAAK,GAAG;GACtC,IAAI,SAAS,QAAQ,SAAS,QAAQ,KAAK,SAAS,KAAK,MACvD,OAAO;GAET,KAAK,MAAM,CAAC,GAAG,MAAM,MACnB,IAAI,KAAK,IAAI,CAAC,MAAM,GAAG,OAAO;GAEhC,OAAO;EACT;CACF;AACF;AAEA,SAAS,eACP,QACA,eACA,kBACA,UACoD;CACpD,IAAI,kBAAkB,GACpB,OAAO;EAAE,SAAS;EAAa,eAAe;CAAuB;CAEvE,IAAI,OAAO,OAAO,GAChB,OAAO;EAAE,SAAS;EAAY,eAAe;CAA2B;CAE1E,IAAI,OAAO,QAAQ,KAAK,OAAO,UAAU,GACvC,OAAO;EACL,SAAS;EACT,eAAe;CACjB;CAEF,IAAI,oBAAoB,aAAa,mBACnC,OAAO;EAAE,SAAS;EAAa,eAAe;CAAsB;CAEtE,OAAO;EAAE,SAAS;EAAa,eAAe;CAA2B;AAC3E;;;;;AAMA,eAAsB,WACpB,QACA,UACA,SAC0B;CAC1B,IACE,CAAC,cAAc,MAAM,KACrB,OAAO,OAAO,gBAAgB,YAC9B,CAAC,cAAc,OAAO,IAAI,KAC1B,CAAC,cAAc,OAAO,KAAK,MAAM,KACjC,CAAC,cAAc,OAAO,SAAS,GAE/B,MAAM,IAAI,qBAAqB,kBAAkB,QAAQ;CAE3D,IAAI,CAAC,MAAM,QAAQ,QAAQ,GACzB,MAAM,IAAI,qBAAqB,oBAAoB,UAAU;CAG/D,MAAM,eAAe,0BAA0B,OAAO;CACtD,MAAM,YAAY,SAAS,KAAK,MAAM,MAAM,qBAAqB,MAAM,CAAC,CAAC;CAEzE,MAAM,eAAe,WAAW,OAAO,KAAK,OAAO,SAAS,CAAQ;CACpE,MAAM,qCAAqB,IAAI,IAAkB;CACjD,KAAK,MAAM,KAAK,cAAc;EAC5B,MAAM,MAAM,SAAiC,OAAO,WAAW,CAAC;EAChE,IAAI,KAAK,WAAW,YAClB,mBAAmB,IAAI,GAAG,IAAI,MAAmB;CAErD;CAEA,MAAM,cAA+B,CAAC;CACtC,MAAM,8BAAc,IAAI,IAUtB;CACF,MAAM,UAAsC,CAAC;CAC7C,MAAM,gBAAkD,CAAC;CACzD,MAAM,iBAAiB;EAAE,MAAM;EAAG,MAAM;EAAG,OAAO;EAAG,SAAS;CAAE;CAChE,IAAI,gBAAgB;CAEpB,KAAK,MAAM,QAAQ,WAAW;EAC5B,IAAI,KAAK,UAAU,KAAA,GAAW;GAC5B,QAAQ,KAAK;IACX,QAAQ,KAAK;IACb,SAAS,KAAK;IACd,QAAQ;GACV,CAAC;GACD;EACF;EAEA,IAAI,WAAW,KAAK,OAAO;GACzB,iBAAiB;GACjB,IAAI,mBAAmB,KAAK;GAC5B,IAAI,aAAa,0BAA0B,OAAO;IAChD,MAAM,WACJ,aAAa,0BAA0B,OACnC,KAAA,IACA,aAAa;IACnB,MAAM,QAAQ,uBAAuB,KAAK,SAAS,QAAQ;IAC3D,cAAc,KAAK;KACjB,QAAQ,KAAK;KACb,WAAW,cAAc,KAAK,OAAO;KACrC;IACF,CAAC;IACD,IAAI,CAAC,MAAM,OACT,mBAAmB;GAEvB;GACA,eAAe,qBAAqB;GACpC;EACF;EAEA,MAAM,EAAE,MAAM,UAAU,KAAK;EAC7B,IAAI,CAAC,OAAO,OAAO,OAAO,KAAK,QAAQ,IAAI,GAAG;GAC5C,QAAQ,KAAK;IACX,QAAQ,KAAK;IACb,SAAS,KAAK;IACd,QAAQ;GACV,CAAC;GACD;EACF;EACA,MAAM,OAAO,SAAoB,OAAO,KAAK,QAAQ,IAAI;EAEzD,IAAI,aAAa,YAAY,IAAI,IAAI;EACrC,IAAI,eAAe,KAAA,GAAW;GAC5B,aAAa;IAAE;IAAM,SAAS,CAAC;GAAE;GACjC,YAAY,IAAI,MAAM,UAAU;EAClC;EACA,WAAW,QAAQ,KAAK;GACtB,QAAQ,KAAK;GACb,SAAS,KAAK;GACd;EACF,CAAC;EAED,IAAI,KAAK,eAAe,QAAQ;GAC9B,YAAY,KAAK;IACf;IACA;IACA,QAAQ,KAAK;IACb,SAAS,KAAK;IACd,YAAY;IACZ,mBAAmB,CAAC;IACpB,qBAAqB,CAAC;IACtB,iBAAiB,CAAC,GAAG,YAAY;GACnC,CAAC;GACD;EACF;EAEA,MAAM,oBAAyB,CAAC;EAChC,MAAM,sBAA2B,CAAC;EAClC,MAAM,kBAAuB,CAAC;EAE9B,KAAK,MAAM,KAAK,cAAc;GAC5B,MAAM,SAAS,mBAAmB,IAAI,CAAC;GACvC,IAAI,WAAW,KAAA,GAAW;IACxB,gBAAgB,KAAK,CAAC;IACtB;GACF;GACA,MAAM,OAAO,cAAc,QAAQ,IAAI;GACvC,IAAI,CAAC,KAAK,SAAS;IACjB,gBAAgB,KAAK,CAAC;IACtB;GACF;GAEA,IAAI,kBAAkB,MADD,mBAAmB,KAAK,KACN,GAAG,KAAK,GAC7C,kBAAkB,KAAK,CAAC;QAExB,oBAAoB,KAAK,CAAC;EAE9B;EAEA,YAAY,KAAK;GACf;GACA;GACA,QAAQ,KAAK;GACb,SAAS,KAAK;GACd,YAAY,KAAK;GACjB;GACA;GACA;EACF,CAAC;CACH;CAEA,MAAM,YAA0C,CAAC;CACjD,KAAK,MAAM,QAAQ,WAAW,MAAM,KAAK,YAAY,KAAK,CAAC,CAAC,GAAG;EAC7D,MAAM,EAAE,MAAM,YAAY,YAAY,IAAI,IAAI;EAC9C,IAAI,KAAK,eAAe,QAAQ;EAChC,MAAM,2BAAW,IAAI,IAAY;EACjC,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;GACvC,MAAM,IAAI,QAAQ;GAClB,KAAK,IAAI,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;IAC3C,MAAM,IAAI,QAAQ;IAClB,MAAM,WAAW,EAAE,YAAY,UAAU,EAAE,YAAY;IACvD,MAAM,WACH,EAAE,YAAY,UAAU,EAAE,YAAY,UACtC,EAAE,YAAY,UAAU,EAAE,YAAY;IACzC,IAAI,CAAC,YAAY,CAAC,UAAU;IAC5B,MAAM,QAAQ,kBAAkB,MAAM,EAAE,OAAO,EAAE,KAAK;IACtD,IAAK,YAAY,CAAC,SAAW,YAAY,OAAQ;KAC/C,SAAS,IAAI,EAAE,MAAM;KACrB,SAAS,IAAI,EAAE,MAAM;IACvB;GACF;EACF;EACA,IAAI,SAAS,OAAO,GAClB,UAAU,KAAK;GAAE;GAAM,SAAS,WAAW,MAAM,KAAK,QAAQ,CAAC;EAAE,CAAC;CAEtE;CAEA,MAAM,oBAAoB,SAAS,cAAc,GAAG,MAAM;EACxD,MAAM,UAAU,aAAa,EAAE,MAAM,EAAE,IAAI;EAC3C,IAAI,YAAY,GAAG,OAAO;EAC1B,MAAM,SAAS,aAAa,cAAc,EAAE,KAAK,GAAG,cAAc,EAAE,KAAK,CAAC;EAC1E,IAAI,WAAW,GAAG,OAAO;EACzB,MAAM,SAAS,aAAa,EAAE,QAAQ,EAAE,MAAM;EAC9C,IAAI,WAAW,GAAG,OAAO;EACzB,OAAO,aAAa,EAAE,SAAS,EAAE,OAAO;CAC1C,CAAC;CAED,MAAM,gBAAgB,SAAS,UAAU,GAAG,MAAM;EAChD,MAAM,SAAS,aAAa,EAAE,QAAQ,EAAE,MAAM;EAC9C,IAAI,WAAW,GAAG,OAAO;EACzB,MAAM,SAAS,aAAa,EAAE,SAAS,EAAE,OAAO;EAChD,IAAI,WAAW,GAAG,OAAO;EACzB,OAAO,aAAa,EAAE,QAAQ,EAAE,MAAM;CACxC,CAAC;CAED,MAAM,sBAAsB,SAAS,gBAAgB,GAAG,MAAM;EAC5D,MAAM,SAAS,aAAa,EAAE,QAAQ,EAAE,MAAM;EAC9C,IAAI,WAAW,GAAG,OAAO;EACzB,MAAM,QAAQ,aAAa,EAAE,aAAa,IAAI,EAAE,aAAa,EAAE;EAC/D,IAAI,UAAU,GAAG,OAAO;EACxB,OAAO,aAAa,cAAc,EAAE,KAAK,GAAG,cAAc,EAAE,KAAK,CAAC;CACpE,CAAC;CAED,MAAM,wBAAwB,SAC5B,UAAU,KAAI,OAAM;EAClB,OAAO,cAAc,EAAE,iBAAiB;EACxC,MAAM,EAAE;CACV,EAAE,IACD,GAAG,MAAM,aAAa,EAAE,OAAO,EAAE,KAAK,CACzC,CAAC,CAAC,KAAI,MAAK,EAAE,IAAI;CAEjB,MAAM,cAAc,MAAM,UACxB,cAAc;EACZ,UAAU;EACV,mBAAmB,OAAO;EAC1B,UAAU;EACV,SAAS;CACX,CAAC,CACH;CAEA,MAAM,EAAE,SAAS,kBAAkB,eACjC,gBACA,eACA,aAAa,kBACb,OAAO,QACT;CAEA,OAAO;EACL,UAAU;EACV,mBAAmB,OAAO;EAC1B;EACA,aAAa;EACb;EACA;EACA;EACA,kBAAkB;EAClB,eAAe;EACf,SAAS;CACX;AACF;;ACxkBA,MAAM,6BAA6B;;AAGnC,SAAgB,mBAAmB,MAAsB;CACvD,IAAI,MAAM;CACV,KAAK,MAAM,SAAS,KAAK,SAAS,KAAK,GACrC,IAAI,MAAM,EAAE,CAAC,SAAS,KAAK,MAAM,MAAM,EAAE,CAAC;CAE5C,OAAO;AACT;AAEA,SAAS,eAAe,MAAc,gBAAgC;CACpE,MAAM,QAAQ,eAAe,IAAI;CACjC,MAAM,MAAM,MAAM,KAAK,KAAK;CAC5B,IAAI,IAAI,UAAU,gBAAgB,OAAO;CACzC,IAAI,kBAAkB,GAAG,OAAO,mBAAmB,IAAI,MAAM;CAC7D,OAAO,GAAG,IAAI,MAAM,GAAG,iBAAiB,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE;AACtD;;;;;;;AAQA,SAAgB,qBACd,MACA,gBACQ;CACR,MAAM,YAAY,eAAe,MAAM,cAAc;CACrD,IAAI,UAAU,SAAS,GAAG,GACxB,OAAO,qBAAqB,SAAS;CAEvC,OAAO,UACJ,QAAQ,4BAA4B,MAAM,CAAC,CAC3C,WAAW,KAAK,OAAO;AAC5B;;AAGA,SAAgB,kBACd,MACA,gBACQ;CACR,OAAO,eAAe,MAAM,cAAc;AAC5C;AAEA,SAAS,qBAAqB,MAAsB;CAClD,MAAM,QAAQ,IAAI,OAAO,mBAAmB,IAAI,IAAI,CAAC;CAGrD,OAAO,GAAG,SADR,KAAK,WAAW,GAAG,KAAK,KAAK,SAAS,GAAG,IAAI,IAAI,KAAK,KAAK,KAAA,CACpC,WAAW,KAAK,KAAK,IAAI;AACpD;;AAGA,SAAgB,oBACd,OACA,gBACQ;CACR,OAAO,qBACL,eAAe,cAAc,KAAK,GAAG,cAAc,CACrD;AACF;;AAGA,SAAgB,iBACd,OACA,gBACQ;CACR,OAAO,eAAe,cAAc,KAAK,GAAG,cAAc;AAC5D;AAEA,SAAS,cAAc,MAAc,eAA+B;CAClE,MAAM,QAAQ,qBAAqB,IAAI;CACvC,MAAM,MAAM,MAAM,KAAK,KAAK;CAC5B,IAAI,IAAI,UAAU,eAAe,OAAO;CACxC,MAAM,YAAY,IAAI,SAAS;CAC/B,OAAO,GAAG,IAAI,MAAM,GAAG,aAAa,CAAC,CAAC,KAAK,EAAE,EAAE,kBAAkB,UAAU;AAC7E;;AAGA,SAAgB,oBACd,MACA,eACQ;CACR,MAAM,OAAO,cAAc,MAAM,aAAa;CAC9C,MAAM,QAAQ,IAAI,OAAO,KAAK,IAAI,GAAG,mBAAmB,IAAI,IAAI,CAAC,CAAC;CAClE,OAAO,GAAG,MAAM,IAAI,KAAK,IAAI;AAC/B;;AAGA,SAAgB,iBAAiB,MAAc,eAA+B;CAE5E,OADa,cAAc,MAAM,aACvB,CAAC,CACR,MAAM,IAAI,CAAC,CACX,KAAI,SAAQ,OAAO,MAAM,CAAC,CAC1B,KAAK,IAAI;AACd;;AAQA,SAAgB,kBAAkB,QAAyC;CACzE,MAAM,EAAE,QAAQ,GAAG,UAAU,MAAM;CACnC,MAAM,MAAM,KAAK,MAAM,EAAE,QAAQ,GAAG;CACpC,OACE,aAAa,eAAe,OAAO,QAAQ,EAAE,aAClC,EAAE,SAAS,GAAG,EAAE,OAAO,aAAa,EAAE,OAAO,WAAW,EAAE,SAAS,kCACxD,EAAE,SAAS,MAAM,EAAE,OAAO,WAAW,IAAI;AAEnE;;AAGA,SAAgB,oBACd,KACA,WACQ;CACR,IAAI,IAAI,WAAW,UACjB,OAAO,GAAG,eAAe,IAAI,MAAM,IAAI,EAAE,IAAI,UAAU,IAAI,MAAM,OAAO;CAE1E,IAAI,IAAI,WAAW,YACjB,OAAO,GAAG,eAAe,IAAI,KAAK,EAAE,IAAI,eAAe,IAAI,MAAM,EAAE,EAAE,GAAG,UAAU,IAAI,MAAM,WAAW,EAAE;CAE3G,OAAO,IAAI,iBAAiB,WAAW,mBAAmB;AAC5D;;;;;AAMA,SAAgB,sBACd,QACA,MACA,KACyC;CACzC,MAAM,UAAU,IAAI,IAAO,IAAI,KAAK;CACpC,MAAM,SAAkD,CAAC;CACzD,KAAK,MAAM,KAAK,IAAI,WAAW;EAC7B,IAAI,QAAQ,IAAI,CAAC,GAAG;EACpB,MAAM,MAAM,SAAiC,OAAO,WAAW,CAAC;EAChE,IAAI,KAAK,WAAW,YAAY;EAChC,MAAM,OAAO,cAAc,IAAI,QAAqB,IAAI;EACxD,IAAI,KAAK,WAAW,CAAC,MAAM,QAAQ,KAAK,KAAK,KAAK,KAAK,UAAU,MAC/D,OAAO,KAAK;GAAE,SAAS;GAAG,OAAO,KAAK;EAAM,CAAC;CAEjD;CACA,OAAO;AACT;AAEA,SAAS,eACP,KACA,GACQ;CACR,MAAM,QAAQ,IAAI,OAAO,KACvB,MAAK,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,QAAQ,GAAG,IAAI,SAAS,EACzD;CACA,MAAM,OAAO,MAAM,SAAS,IAAI,MAAM,KAAK,IAAI,IAAI;CACnD,IAAI,IAAI,QAAQ,SAAS,GACvB,OAAO,GAAG,KAAK,cAAc,IAAI,QAAQ,IAAI,EAAE,MAAM,CAAC,CAAC,KAAK,IAAI;CAElE,OAAO;AACT;AAEA,SAAS,mBACP,KACA,GACQ;CACR,MAAM,QAAkB,CAAC;CACzB,IACE,IAAI,QAAQ,KAAA,KACZ,IAAI,QAAQ,KAAA,KACZ,IAAI,WAAW,KAAA,GACf;EACA,MAAM,cAAc,OAAO,IAAI,OAAO,YAAY,EAAE,CAAC;EACrD,MAAM,KAAK,GAAG,IAAI,IAAI,GAAG,IAAI,IAAI,WAAW,YAAY,EAAE;CAC5D;CACA,MAAM,YAAY,IAAI,OAAO,KAAI,MAAK;EAEpC,OAAO,GADO,EAAE,QAAQ,EAAE,MAAM,OAAO,EAAE,GAAG,IAAI,GAAG,EAAE,IAAI,GAAG,EAAE,MAC9C,IAAI,EAAE,QAAQ,GAAG,IAAI,SAAS;CAChD,CAAC;CACD,IAAI,IAAI,cAAc,KAAA,GACpB,UAAU,KAAK,SAAS,IAAI,UAAU,QAAQ,GAAG,IAAI,SAAS,EAAE;CAElE,IAAI,UAAU,SAAS,GACrB,MAAM,KAAK,UAAU,KAAK,IAAI,CAAC;CAEjC,IAAI,IAAI,QAAQ,SAAS,GACvB,MAAM,KAAK,YAAY,IAAI,QAAQ,IAAI,EAAE,MAAM,CAAC,CAAC,KAAK,IAAI,GAAG;CAE/D,OAAO,MAAM,SAAS,IAAI,MAAM,KAAK,KAAK,IAAI;AAChD;AAEA,SAAS,aACP,QACA,MACA,KACA,GACQ;CACR,MAAM,OAAO;EACX,KAAK,IAAI,aAAa;EACtB,KAAK,IAAI,MAAM;EACf,GAAI,IAAI,YAAY,KAAA,IAAY,CAAC,KAAK,IAAI,QAAQ,QAAQ,CAAC,GAAG,IAAI,CAAC;CACrE,CAAC,CAAC,KAAK,KAAK;CAEZ,MAAM,YAAY,IAAI,IAAI,IAAI,aAAa,KAAI,MAAK,cAAc,CAAC,CAAC,CAAC;CACrE,MAAM,WAAW,IAAI,MAClB,QAAO,SAAQ,CAAC,UAAU,IAAI,cAAc,KAAK,IAAI,CAAC,CAAC,CAAC,CACxD,KAAI,SAAQ,GAAG,EAAE,MAAM,KAAK,IAAI,EAAE,IAAI,KAAK,QAAQ,GAAG,IAAI,SAAS,EAAE;CAExE,IAAI,OAAO,SAAS,SAAS,IAAI,GAAG,KAAK,IAAI,SAAS,KAAK,IAAI,MAAM;CACrE,IAAI,IAAI,MAAM,SAAS,GACrB,QAAQ,aAAa,IAAI,MAAM,IAAI,EAAE,MAAM,CAAC,CAAC,KAAK,IAAI;CAExD,MAAM,YACJ,SAAS,OAAO,sBAAsB,QAAQ,MAAM,GAAG,IAAI,CAAC;CAC9D,IAAI,UAAU,SAAS,GACrB,QAAQ,iBAAiB,UAAU,KAAI,MAAK,GAAG,EAAE,OAAO,EAAE,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI;CAErG,IAAI,IAAI,QAAQ,SAAS,GACvB,QAAQ,eAAe,IAAI,QAAQ,IAAI,EAAE,MAAM,CAAC,CAAC,KAAK,IAAI;CAE5D,OAAO;AACT;;AAGA,SAAgB,oBACd,QACA,MACA,KACA,GACQ;CACR,QAAQ,IAAI,YAAZ;EACE,KAAK,SACH,OAAO,eAAe,KAAK,CAAC;EAC9B,KAAK,aACH,OAAO,mBAAmB,KAAK,CAAC;EAClC,KAAK,OACH,OAAO,aAAa,QAAQ,MAAM,KAAK,CAAC;EAC1C,KAAK,QAAQ;GACX,IAAI,OAAO,GAAG,EAAE,OAAO,IAAI,MAAM,EAAE,GAAG,EAAE,OAAO,IAAI,MAAM;GACzD,IACE,IAAI,0BAA0B,KAAA,KAC9B,IAAI,sBAAsB,SAAS,GAEnC,QAAQ,KAAK,IAAI,sBAAsB,IAAI,EAAE,MAAM,CAAC,CAAC,KAAK,IAAI,EAAE;QAC3D,IACL,EAAE,IAAI,WAAW,YAAY,IAAI,WAAW,gBAC5C,IAAI,OAAO,SAAS,GAEpB,QAAQ,KAAK,IAAI,OAAO,KAAI,MAAK,GAAG,EAAE,OAAO,EAAE,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI;GAE1F,OAAO;EACT;CACF;AACF;;AAGA,SAAgB,qBACd,QACA,MACA,KACA,GACQ;CACR,IAAI,IAAI,eAAe,aAAa;EAClC,MAAM,OAAO;GACX,OAAO,EAAE,OAAO,IAAI,GAAG;GACvB,KAAK,IAAI,KAAK,aAAa;GAC3B,KAAK,IAAI,KAAK,MAAM;GACpB,GAAI,IAAI,KAAK,YAAY,KAAA,IACrB,CAAC,KAAK,IAAI,KAAK,QAAQ,QAAQ,CAAC,GAAG,IACnC,CAAC;EACP,CAAC,CAAC,KAAK,KAAK;EACZ,MAAM,YAAY,sBAAsB,QAAQ,MAAM,GAAG;EACzD,IAAI,UAAU,SAAS,GACrB,OAAO,GAAG,KAAK,gBAAgB,UAAU,KAAI,MAAK,GAAG,EAAE,OAAO,EAAE,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI;EAE3G,OAAO;CACT;CACA,IAAI,IAAI,eAAe,uBACrB,OAAO,MAAM,EAAE,OAAO,IAAI,aAAa,EAAE,IAAI,eAAe,IAAI,QAAQ,CAAC;CAE3E,OAAO,oBAAoB,QAAQ,MAAM,KAAK,CAAC;AACjD;;AAGA,SAAgB,sBACd,QACA,MACA,KACA,GAIC;CAYD,QAVE,IAAI,eAAe,cACf,IAAI,MAAM,KAAI,UAAS;EACrB,SAAS,OAAO,EAAE,MAAM,KAAK,GAAG,EAAE,IAAI,KAAK,UAAU,IAAI,EAAE,MAAM,CAAC,CAAC,KAAK,IAAI,EAAE;EAC9E,QAAQ,KAAK;CACf,EAAE,IACF,IAAI,SAAS,KAAI,YAAW;EAC1B,SAAS,UAAU,EAAE,MAAM,OAAO,KAAK,EAAE,IAAI,OAAO,UAAU,IAAI,EAAE,MAAM,CAAC,CAAC,KAAK,IAAI,EAAE;EACvF,QAAQ,OAAO;CACjB,EAAE,EAAA,CAEO,KAAI,WAAU;EAC3B,SAAS,MAAM;EACf,QAAQ,WAAW,OAAO,KAAK,MAAM,MAAM,CAAC,CAAC,CAAC,KAAI,aAAY;GAC5D,SAAS,EAAE,OAAO,OAAO;GACzB,SAAS,oBACP,QACA,IAAI,eAAe,wBAAwB,GAAG,OAAO,YAAY,MACjE,SAAwB,MAAM,QAAQ,OAAO,GAC7C,CACF;EACF,EAAE;CACJ,EAAE;AACJ;;AAGA,SAAgB,yBACd,KACA,WACyC;CACzC,MAAM,UAAmD,CAAC;CAC1D,IAAI,IAAI,2BAA2B,GACjC,QAAQ,KAAK;EACX,OAAO;EACP,OAAO,OAAO,IAAI,wBAAwB;CAC5C,CAAC;CAEH,IAAI,IAAI,sBAAsB,SAAS,GACrC,QAAQ,KAAK;EACX,OAAO;EACP,OAAO,IAAI,sBACR,KACC,MACE,GAAG,UAAU,EAAE,WAAW,EAAE,IAAI,EAAE,UAAU,IAAI,SAAS,CAAC,CAAC,KAAK,IAAI,EAAE,EAC1E,CAAC,CACA,KAAK,IAAI;CACd,CAAC;CAEH,IAAI,IAAI,mBAAmB,SAAS,GAClC,QAAQ,KAAK;EACX,OAAO;EACP,OAAO,IAAI,mBACR,KACC,MACE,GAAG,UAAU,EAAE,WAAW,EAAE,IAAI,EAAE,UAAU,IAAI,SAAS,CAAC,CAAC,KAAK,IAAI,EAAE,EAC1E,CAAC,CACA,KAAK,IAAI;CACd,CAAC;CAEH,IAAI,IAAI,qBAAqB,SAAS,GACpC,QAAQ,KAAK;EACX,OAAO;EACP,OAAO,IAAI,qBACR,KACC,MACE,GAAG,UAAU,EAAE,OAAO,EAAE,IAAI,eAAe,EAAE,EAAE,EAAE,GAAG,UAAU,EAAE,WAAW,EAAE,EACjF,CAAC,CACA,KAAK,IAAI;CACd,CAAC;CAEH,IAAI,IAAI,kBAAkB,SAAS,GACjC,QAAQ,KAAK;EACX,OAAO;EACP,OAAO,IAAI,kBACR,KACC,MACE,GAAG,UAAU,EAAE,OAAO,EAAE,IAAI,eAAe,EAAE,KAAK,EAAE,IAAI,eAAe,EAAE,EAAE,EAAE,GAAG,UAAU,EAAE,WAAW,EAAE,EAC7G,CAAC,CACA,KAAK,IAAI;CACd,CAAC;CAEH,OAAO;AACT;;AAGA,SAAgB,oBACd,SACA,GACQ;CACR,IAAI,QAAQ,SAAS,KAAA,GAAW,OAAO;CACvC,IAAI,SAAS,EAAE,OAAO,QAAQ,IAAI;CAClC,IAAI,QAAQ,WAAW,KAAA,GACrB,UACE,SAAS,QAAQ,SACb,SAAS,EAAE,MAAM,QAAQ,OAAO,GAAG,EAAE,KACrC,YAAY,EAAE,MAAM,QAAQ,OAAO,MAAM,EAAE;CAEnD,IAAI,QAAQ,YAAY,KAAA,GACtB,UAAU,IAAI,EAAE,OAAO,QAAQ,OAAO;CAExC,OAAO;AACT;;ACvYA,MAAM,aAAa,IAAI,OAAO,EAAE;AAChC,MAAM,aAAa,IAAI,OAAO,EAAE;;AAGhC,SAAgB,YACd,QACA,SACQ;CACR,MAAM,EAAE,gBAAgB,eAAe,cAAc,gBAAgB;CACrE,MAAM,OAAO,SAAyB,kBAAkB,MAAM,cAAc;CAC5E,MAAM,UAAU,QACd,iBAAiB,KAAK,cAAc;CACtC,MAAM,YAA6B;EAAE,QAAQ;EAAK,OAAO;CAAO;CAEhE,MAAM,UAAU,eAAe,OAAO,WAAW;CACjD,MAAM,UAAU,QAAQ,SAAS,KAAK,GAAG,QAAQ,MAAM,GAAG,EAAE,EAAE,KAAK;CAEnE,MAAM,QAAkB,CAAC;CAGzB,MAAM,KAAK,UAAU;CACrB,MAAM,KAAK,gBAAgB;CAC3B,MAAM,KAAK,UAAU;CACrB,MAAM,KAAK,iBAAiB,eAAe,OAAO,QAAQ,GAAG;CAC7D,MAAM,KAAK,iBAAiB,SAAS;CACrC,MAAM,KAAK,iBAAiB,eAAe,OAAO,SAAS,GAAG;CAC9D,MAAM,KAAK,EAAE;CAGb,MAAM,KAAK,kBAAkB,MAAM,GAAG,EAAE;CAGxC,MAAM,KAAK,aAAa,UAAU;CAClC,MAAM,gBAAgB,WAAW,OAAO,KAAK,OAAO,SAAS,CAAC;CAC9D,KAAK,MAAM,SAAS,eAAe;EACjC,MAAM,MAAM,SAAiC,OAAO,WAAW,KAAK;EACpE,MAAM,MAAM,IAAI,IAAI,UAAU,WAAW;EACzC,MAAM,SAAS,IAAI,WAAW,OAAO,IAAI,IAAI,OAAO,WAAW,IAAI;EACnE,MAAM,SAAS,oBAAoB,KAAK,GAAG;EAC3C,MAAM,SACJ,IAAI,OAAO,gBAAgB,QAAQ,IAAI,OAAO,gBAAgB,KAAA,IAC1D,OAAO,IAAI,MAAM,WAAW,IAC5B;EACN,MAAM,KACJ,GAAG,IAAI,KAAK,EAAE,YAAY,eAAe,IAAI,MAAM,EAAE,QAAQ,IAAI,WAAW,OAAO,WAAW,OAAO,aAAa,IAAI,WAAW,aAAa,QAChJ;CACF;CACA,MAAM,KAAK,EAAE;CAGb,MAAM,KAAK,UAAU,UAAU;CAC/B,MAAM,aAAa,WAAW,OAAO,KAAK,OAAO,MAAM,CAAC;CACxD,MAAM,iBAGD,CAAC;CAEN,IAAI,WAAW,WAAW,GACxB,MAAM,KAAK,YAAY;MAEvB,KAAK,MAAM,QAAQ,YAAY;EAC7B,MAAM,MAAM,SAA8B,OAAO,QAAQ,IAAI;EAC7D,MAAM,UAAU,qBAAqB,QAAQ,MAAM,KAAK,SAAS;EACjE,MAAM,KACJ,GAAG,IAAI,IAAI,EAAE,KAAK,eAAe,IAAI,UAAU,EAAE,IAAI,eAAe,IAAI,MAAM,EAAE,OAAO,SACzF;EACA,IACE,IAAI,eAAe,eACnB,IAAI,eAAe,uBAEnB,KAAK,MAAM,OAAO,sBAAsB,QAAQ,MAAM,KAAK,SAAS,GAAG;GACrE,MAAM,KAAK,KAAK,IAAI,SAAS;GAC7B,KAAK,MAAM,QAAQ,IAAI,QACrB,MAAM,KAAK,OAAO,KAAK,QAAQ,KAAK,KAAK,SAAS;EAEtD;OACK,IACL,IAAI,eAAe,UACnB,IAAI,WAAW,YACf,IAAI,WAAW,eACf,IAAI,OAAO,SAAS,GAEpB,eAAe,KAAK;GAAE;GAAM,QAAQ;EAAI,CAAC;CAE7C;CAEF,MAAM,KAAK,EAAE;CAEb,IAAI,eAAe,SAAS,GAAG;EAC7B,MAAM,KAAK,qBAAqB,UAAU;EAC1C,KAAK,MAAM,SAAS,gBAClB,KAAK,MAAM,QAAQ,MAAM,OAAO,QAAQ;GACtC,MAAM,KAAK,GAAG,IAAI,MAAM,IAAI,EAAE,IAAI,IAAI,KAAK,OAAO,EAAE,IAAI;GACxD,MAAM,OACJ,OAAO,KAAK,UAAU,WAClB,KAAK,QACL,cAAc,KAAK,KAAK;GAC9B,MAAM,KAAK,iBAAiB,MAAM,aAAa,CAAC;EAClD;EAEF,MAAM,KAAK,EAAE;CACf;CAGA,MAAM,KAAK,YAAY,UAAU;CACjC,IAAI,OAAO,SAAS,WAAW,GAC7B,MAAM,KAAK,OAAO;MAElB,KAAK,MAAM,WAAW,OAAO,UAAU;EACrC,MAAM,SAAS,oBAAoB,SAAS,SAAS;EACrD,MAAM,YACJ,QAAQ,cAAc,KAAA,KAAa,QAAQ,UAAU,SAAS,IAC1D,QAAQ,UAAU,IAAI,GAAG,CAAC,CAAC,KAAK,IAAI,IACpC;EACN,MAAM,KACJ,GAAG,eAAe,QAAQ,QAAQ,EAAE,KAAK,eAAe,QAAQ,IAAI,EAAE,WAAW,OAAO,cAAc,WACxG;CACF;CAEF,MAAM,KAAK,EAAE;CAGb,MAAM,aAAa,yBAAyB,OAAO,cAAc,GAAG;CACpE,IAAI,WAAW,SAAS,GAAG;EACzB,MAAM,KAAK,gBAAgB,UAAU;EACrC,KAAK,MAAM,SAAS,YAClB,MAAM,KAAK,GAAG,MAAM,MAAM,KAAK,MAAM,OAAO;EAE9C,MAAM,KAAK,EAAE;CACf;CAGA,IAAI,iBAAiB,KAAA,GAAW;EAC9B,MAAM,KAAK,aAAa;EACxB,MAAM,KAAK,gBAAgB,UAAU;EACrC,MAAM,KACJ,uBAAuB,eAAe,aAAa,OAAO,EAAE,IAAI,eAAe,aAAa,aAAa,EAAE,EAC7G;EACA,MAAM,KACJ,4BAA4B,GAAG,KAAK,SAAS,GAAG,KAAK,UAAU,GAAG,MAAM,YAAY,GAAG,SACzF;EACA,MAAM,KAAK,uBAAuB,aAAa,QAAQ,QAAQ;EAC/D,MAAM,KAAK,uBAAuB,aAAa,UAAU,QAAQ;EAEjE,KAAK,MAAM,KAAK,aAAa,aAAa;GACxC,MAAM,QACJ,EAAE,kBAAkB,SAAS,IACzB,EAAE,kBAAkB,IAAI,GAAG,CAAC,CAAC,KAAK,IAAI,IACtC;GACN,MAAM,UACJ,EAAE,oBAAoB,SAAS,IAC3B,EAAE,oBAAoB,IAAI,GAAG,CAAC,CAAC,KAAK,IAAI,IACxC;GACN,MAAM,SACJ,EAAE,gBAAgB,SAAS,IACvB,EAAE,gBAAgB,IAAI,GAAG,CAAC,CAAC,KAAK,IAAI,IACpC;GACN,MAAM,KACJ,KAAK,IAAI,EAAE,IAAI,EAAE,WAAW,OAAO,EAAE,KAAK,EAAE,WAAW,IAAI,EAAE,MAAM,EAAE,YAAY,eAAe,EAAE,OAAO,EAAE,WAAW,MAAM,cAAc,QAAQ,aAAa,OAAO,EACxK;EACF;EAEA,KAAK,MAAM,KAAK,aAAa,WAC3B,MAAM,KACJ,cAAc,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,IAAI,GAAG,CAAC,CAAC,KAAK,IAAI,GAC7D;EAGF,KAAK,MAAM,MAAM,aAAa,eAAe;GAC3C,MAAM,SAAS,GAAG,MAAM,QACpB,UACA,YAAY,eAAe,GAAG,MAAM,MAAM,EAAE;GAChD,MAAM,MAAM,GAAG,cAAc,OAAO,IAAI,GAAG,SAAS,IAAI;GACxD,MAAM,KAAK,aAAa,IAAI,GAAG,MAAM,EAAE,QAAQ,IAAI,IAAI,QAAQ;EACjE;EACA,MAAM,KAAK,EAAE;CACf;CAGA,IAAI,aAAa;EACf,MAAM,KAAK,WAAW,UAAU;EAChC,KAAK,MAAM,SAAS,eAAe;GACjC,MAAM,MAAM,SAAiC,OAAO,WAAW,KAAK;GACpE,IAAI,IAAI,WAAW,YAAY;GAC/B,MAAM,KAAK,GAAG,IAAI,KAAK,EAAE,GAAG;GAC5B,MAAM,WAAW,KAAK,UAAU,IAAI,QAAQ,MAAM,CAAC,KAAK;GACxD,MAAM,KAAK,iBAAiB,UAAU,aAAa,CAAC;EACtD;EACA,MAAM,KAAK,EAAE;CACf;CAEA,OAAO,GAAG,MAAM,KAAK,IAAI,CAAC,CAAC,QAAQ,QAAQ,EAAE,EAAE;AACjD;;;ACxLA,SAAgB,eACd,QACA,SACQ;CACR,MAAM,EAAE,gBAAgB,eAAe,cAAc,gBAAgB;CACrE,MAAM,OAAO,SACX,qBAAqB,MAAM,cAAc;CAC3C,MAAM,UAAU,QACd,oBAAoB,KAAK,cAAc;CACzC,MAAM,YAA6B;EAAE,QAAQ;EAAK,OAAO;CAAO;CAEhE,MAAM,QAAkB,CAAC;CAGzB,MAAM,KAAK,qBAAqB,EAAE;CAClC,MAAM,KAAK,mBAAmB,eAAe,OAAO,QAAQ,GAAG;CAC/D,MAAM,KAAK,sBAAsB,eAAe,OAAO,WAAW,GAAG;CACrE,MAAM,KAAK,kBAAkB,eAAe,OAAO,SAAS,GAAG;CAC/D,MAAM,KAAK,EAAE;CAGb,MAAM,KAAK,kBAAkB,MAAM,GAAG,EAAE;CAGxC,MAAM,KAAK,iBAAiB,EAAE;CAC9B,MAAM,KACJ,sEACF;CACA,MAAM,KAAK,iCAAiC;CAC5C,MAAM,gBAAgB,WAAW,OAAO,KAAK,OAAO,SAAS,CAAC;CAC9D,KAAK,MAAM,SAAS,eAAe;EACjC,MAAM,MAAM,SAAiC,OAAO,WAAW,KAAK;EACpE,MAAM,MAAM,IAAI,IAAI,UAAU,WAAW;EACzC,MAAM,SAAS,IAAI,WAAW,OAAO,IAAI,IAAI,OAAO,WAAW,IAAI;EACnE,MAAM,SAAS,oBAAoB,KAAK,GAAG;EAC3C,MAAM,SACJ,IAAI,OAAO,gBAAgB,QAAQ,IAAI,OAAO,gBAAgB,KAAA,IAC1D,OAAO,IAAI,MAAM,WAAW,IAC5B;EACN,MAAM,KACJ,KAAK,IAAI,KAAK,EAAE,KAAK,IAAI,KAAK,OAAO,KAAK,eAAe,IAAI,MAAM,EAAE,KAAK,OAAO,KAAK,IAAI,WAAW,OAAO,OAAO,GACrH;CACF;CACA,MAAM,KAAK,EAAE;CAGb,MAAM,KAAK,cAAc,EAAE;CAC3B,MAAM,aAAa,WAAW,OAAO,KAAK,OAAO,MAAM,CAAC;CACxD,MAAM,mBAGD,CAAC;CACN,MAAM,iBAGD,CAAC;CAEN,IAAI,WAAW,WAAW,GACxB,MAAM,KAAK,cAAc,EAAE;MACtB;EACL,MAAM,KAAK,0CAA0C;EACrD,MAAM,KAAK,mBAAmB;EAC9B,KAAK,MAAM,QAAQ,YAAY;GAC7B,MAAM,MAAM,SAA8B,OAAO,QAAQ,IAAI;GAC7D,MAAM,UAAU,qBAAqB,QAAQ,MAAM,KAAK,SAAS;GACjE,MAAM,KACJ,KAAK,IAAI,IAAI,EAAE,KAAK,eAAe,IAAI,UAAU,EAAE,KAAK,eAAe,IAAI,MAAM,EAAE,KAAK,QAAQ,GAClG;GACA,IACE,IAAI,eAAe,eACnB,IAAI,eAAe,uBAEnB,iBAAiB,KAAK;IACpB;IACA,SAAS,sBAAsB,QAAQ,MAAM,KAAK,SAAS;GAC7D,CAAC;QACI,IACL,IAAI,eAAe,UACnB,IAAI,WAAW,YACf,IAAI,WAAW,eACf,IAAI,OAAO,SAAS,GAEpB,eAAe,KAAK;IAAE;IAAM,QAAQ;GAAI,CAAC;EAE7C;EACA,MAAM,KAAK,EAAE;CACf;CAEA,KAAK,MAAM,UAAU,kBAAkB;EACrC,IAAI,OAAO,QAAQ,WAAW,GAAG;EACjC,MAAM,KAAK,QAAQ,IAAI,OAAO,IAAI,KAAK,EAAE;EACzC,KAAK,MAAM,OAAO,OAAO,SAAS;GAChC,MAAM,KAAK,KAAK,IAAI,SAAS;GAC7B,KAAK,MAAM,QAAQ,IAAI,QACrB,MAAM,KAAK,OAAO,KAAK,QAAQ,IAAI,KAAK,SAAS;EAErD;EACA,MAAM,KAAK,EAAE;CACf;CAEA,IAAI,eAAe,SAAS,GAAG;EAC7B,MAAM,KAAK,yBAAyB,EAAE;EACtC,KAAK,MAAM,SAAS,gBAClB,KAAK,MAAM,QAAQ,MAAM,OAAO,QAAQ;GACtC,MAAM,KAAK,OAAO,IAAI,MAAM,IAAI,EAAE,KAAK,IAAI,KAAK,OAAO,EAAE,MAAM,EAAE;GACjE,MAAM,OACJ,OAAO,KAAK,UAAU,WAClB,KAAK,QACL,cAAc,KAAK,KAAK;GAC9B,MAAM,KAAK,oBAAoB,MAAM,aAAa,GAAG,EAAE;EACzD;CAEJ;CAGA,MAAM,KAAK,gBAAgB,EAAE;CAC7B,IAAI,OAAO,SAAS,WAAW,GAC7B,MAAM,KAAK,SAAS,EAAE;MACjB;EACL,MAAM,KAAK,0CAA0C;EACrD,MAAM,KAAK,mBAAmB;EAC9B,KAAK,MAAM,WAAW,OAAO,UAAU;GACrC,MAAM,SAAS,oBAAoB,SAAS,SAAS;GACrD,MAAM,YACJ,QAAQ,cAAc,KAAA,KAAa,QAAQ,UAAU,SAAS,IAC1D,QAAQ,UAAU,IAAI,GAAG,CAAC,CAAC,KAAK,IAAI,IACpC;GACN,MAAM,KACJ,KAAK,eAAe,QAAQ,QAAQ,EAAE,KAAK,eAAe,QAAQ,IAAI,EAAE,KAAK,OAAO,KAAK,UAAU,GACrG;EACF;EACA,MAAM,KAAK,EAAE;CACf;CAGA,MAAM,aAAa,yBAAyB,OAAO,cAAc,GAAG;CACpE,IAAI,WAAW,SAAS,GAAG;EACzB,MAAM,KAAK,oBAAoB,EAAE;EACjC,KAAK,MAAM,SAAS,YAClB,MAAM,KAAK,OAAO,MAAM,MAAM,MAAM,MAAM,OAAO;EAEnD,MAAM,KAAK,EAAE;CACf;CAGA,IAAI,iBAAiB,KAAA,GAAW;EAC9B,MAAM,KAAK,aAAa;EACxB,MAAM,KAAK,oBAAoB,EAAE;EACjC,MAAM,KACJ,kBAAkB,eAAe,aAAa,OAAO,EAAE,IAAI,eAAe,aAAa,aAAa,EAAE,EACxG;EACA,MAAM,KACJ,iCAAiC,GAAG,KAAK,SAAS,GAAG,KAAK,UAAU,GAAG,MAAM,YAAY,GAAG,SAC9F;EACA,MAAM,KAAK,kBAAkB,aAAa,QAAQ,QAAQ;EAC1D,MAAM,KAAK,oBAAoB,aAAa,UAAU,QAAQ;EAC9D,MAAM,KAAK,EAAE;EAEb,IAAI,aAAa,YAAY,SAAS,GAAG;GACvC,MAAM,KACJ,sEACF;GACA,MAAM,KAAK,+BAA+B;GAC1C,KAAK,MAAM,KAAK,aAAa,aAAa;IACxC,MAAM,QACJ,EAAE,kBAAkB,SAAS,IACzB,EAAE,kBAAkB,IAAI,GAAG,CAAC,CAAC,KAAK,IAAI,IACtC;IACN,MAAM,UACJ,EAAE,oBAAoB,SAAS,IAC3B,EAAE,oBAAoB,IAAI,GAAG,CAAC,CAAC,KAAK,IAAI,IACxC;IACN,MAAM,SACJ,EAAE,gBAAgB,SAAS,IACvB,EAAE,gBAAgB,IAAI,GAAG,CAAC,CAAC,KAAK,IAAI,IACpC;IACN,MAAM,KACJ,KAAK,IAAI,EAAE,IAAI,EAAE,KAAK,OAAO,EAAE,KAAK,EAAE,KAAK,IAAI,EAAE,MAAM,EAAE,KAAK,eAAe,EAAE,OAAO,EAAE,KAAK,MAAM,KAAK,QAAQ,KAAK,OAAO,GAC9H;GACF;GACA,MAAM,KAAK,EAAE;EACf;EAEA,IAAI,aAAa,UAAU,SAAS,GAAG;GACrC,KAAK,MAAM,KAAK,aAAa,WAC3B,MAAM,KACJ,kBAAkB,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,IAAI,GAAG,CAAC,CAAC,KAAK,IAAI,GAChE;GAEF,MAAM,KAAK,EAAE;EACf;EAEA,IAAI,aAAa,cAAc,SAAS,GAAG;GACzC,MAAM,KAAK,iCAAiC;GAC5C,MAAM,KAAK,eAAe;GAC1B,KAAK,MAAM,MAAM,aAAa,eAAe;IAC3C,MAAM,SAAS,GAAG,MAAM,QACpB,UACA,YAAY,eAAe,GAAG,MAAM,MAAM,EAAE;IAChD,MAAM,MAAM,GAAG,cAAc,OAAO,IAAI,GAAG,SAAS,IAAI;IACxD,MAAM,KAAK,KAAK,IAAI,GAAG,MAAM,EAAE,KAAK,IAAI,KAAK,OAAO,GAAG;GACzD;GACA,MAAM,KAAK,EAAE;EACf;CACF;CAGA,IAAI,aAAa;EACf,MAAM,KAAK,eAAe,EAAE;EAC5B,KAAK,MAAM,SAAS,eAAe;GACjC,MAAM,MAAM,SAAiC,OAAO,WAAW,KAAK;GACpE,IAAI,IAAI,WAAW,YAAY;GAC/B,MAAM,KAAK,OAAO,IAAI,KAAK,EAAE,MAAM,EAAE;GACrC,MAAM,WAAW,KAAK,UAAU,IAAI,QAAQ,MAAM,CAAC,KAAK;GACxD,MAAM,KAAK,oBAAoB,UAAU,aAAa,GAAG,EAAE;EAC7D;CACF;CAEA,OAAO,GAAG,MAAM,KAAK,IAAI,CAAC,CAAC,QAAQ,QAAQ,EAAE,EAAE;AACjD;;ACjPA,MAAM,2BAA2B;AACjC,MAAM,0BAA0B;AAEhC,SAAS,sBACP,OACA,UACA,MACQ;CACR,IAAI,UAAU,KAAA,GAAW,OAAO;CAChC,IAAI,OAAO,UAAU,YAAY,CAAC,OAAO,UAAU,KAAK,KAAK,QAAQ,GACnE,MAAM,IAAI,qBAAqB,kBAAkB,IAAI;CAEvD,OAAO;AACT;;;;AAKA,SAAgB,aACd,QACA,SACQ;CACR,IAAI,YAAY,KAAA,KAAa,CAAC,cAAc,OAAO,GACjD,MAAM,IAAI,qBAAqB,kBAAkB,SAAS;CAG5D,MAAM,SAAS,SAAS,UAAU;CAClC,IAAI,WAAW,cAAc,WAAW,SACtC,MAAM,IAAI,qBAAqB,kBAAkB,QAAQ;CAG3D,IACE,SAAS,gBAAgB,KAAA,KACzB,OAAO,QAAQ,gBAAgB,WAE/B,MAAM,IAAI,qBAAqB,kBAAkB,aAAa;CAGhE,MAAM,WAAkC;EACtC,gBAAgB,sBACd,SAAS,gBACT,0BACA,gBACF;EACA,eAAe,sBACb,SAAS,eACT,yBACA,eACF;EACA,aAAa,SAAS,gBAAgB;CACxC;CACA,IAAI,SAAS,iBAAiB,KAAA,GAC5B,SAAS,eAAe,QAAQ;CAGlC,OAAO,WAAW,aACd,eAAe,QAAQ,QAAQ,IAC/B,YAAY,QAAQ,QAAQ;AAClC"}
|