@sorbetai/schema 0.1.0-alpha.17 → 0.1.0-alpha.19
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/dist/compiler.js +862 -693
- package/dist/compiler.js.map +1 -1
- package/package.json +2 -2
package/dist/compiler.js.map
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
{"version":3,"file":"compiler.js","names":["compiler","item","entries","x","y","number","compile","entries","compiler","unevaluatedProperties","unevaluatedItems"],"sources":["../../../node_modules/.pnpm/@earendil-works+pi-schema@1.5.0_patch_hash=3a50e14587df64dfdea0adbae45b34d11585bb58009be0694fa2cf4a7986fbdf/node_modules/@earendil-works/pi-schema/dist/resolver.js","../../../node_modules/.pnpm/@earendil-works+pi-schema@1.5.0_patch_hash=3a50e14587df64dfdea0adbae45b34d11585bb58009be0694fa2cf4a7986fbdf/node_modules/@earendil-works/pi-schema/dist/shared.js","../../../node_modules/.pnpm/@earendil-works+pi-schema@1.5.0_patch_hash=3a50e14587df64dfdea0adbae45b34d11585bb58009be0694fa2cf4a7986fbdf/node_modules/@earendil-works/pi-schema/dist/coerce.js","../../../node_modules/.pnpm/@earendil-works+pi-schema@1.5.0_patch_hash=3a50e14587df64dfdea0adbae45b34d11585bb58009be0694fa2cf4a7986fbdf/node_modules/@earendil-works/pi-schema/dist/checks.js","../../../node_modules/.pnpm/@earendil-works+pi-schema@1.5.0_patch_hash=3a50e14587df64dfdea0adbae45b34d11585bb58009be0694fa2cf4a7986fbdf/node_modules/@earendil-works/pi-schema/dist/annotations.js","../../../node_modules/.pnpm/@earendil-works+pi-schema@1.5.0_patch_hash=3a50e14587df64dfdea0adbae45b34d11585bb58009be0694fa2cf4a7986fbdf/node_modules/@earendil-works/pi-schema/dist/compiler.js","../../../node_modules/.pnpm/@earendil-works+pi-schema@1.5.0_patch_hash=3a50e14587df64dfdea0adbae45b34d11585bb58009be0694fa2cf4a7986fbdf/node_modules/@earendil-works/pi-schema/dist/explain.js","../../../node_modules/.pnpm/@earendil-works+pi-schema@1.5.0_patch_hash=3a50e14587df64dfdea0adbae45b34d11585bb58009be0694fa2cf4a7986fbdf/node_modules/@earendil-works/pi-schema/dist/validator.js"],"sourcesContent":["// Reference resolution of one compile: schema resources, anchors and JSON Pointers over the root schema and the\n// registered documents. A Resolver lives only while a schema compiles (or while its errors are explained).\n/** The base URI of a root schema without `$id`; relative references resolve against it. */\nexport const DEFAULT_BASE = \"https://json-schema.invalid/root.json\";\n/**\n * Resolves references in the root schema and the registered documents. The schema is indexed on the first\n * reference, so a schema without references is never walked for identifiers.\n */\nexport class Resolver {\n draft;\n rootBase;\n /** Schema object to the base URI it was indexed under. */\n baseOf = new Map();\n /** URI (with a `#name` fragment) of every `$dynamicAnchor`, to its schema. */\n dynamicAnchors = new Map();\n root;\n options;\n registry = new Map();\n rejectUnresolved;\n /** The references that named nothing and resolved to `false` (with `unresolvedRefs: \"reject\"`). */\n unresolved = new Set();\n resources = new Map();\n anchors = new Map();\n indexed = false;\n constructor(root, options) {\n this.draft = options.draft === \"7\" ? \"7\" : \"2020-12\";\n this.root = root;\n this.options = options;\n this.rejectUnresolved = options.unresolvedRefs === \"reject\";\n this.rootBase = isSchemaObject(root) ? this.baseFor(root, DEFAULT_BASE) : DEFAULT_BASE;\n }\n /**\n * The base URI of `node`, whose parent has `base`: its `$id` changes it, unless draft 7 makes the `$id` inert. Once\n * the schema is indexed, the indexed base (a resolved reference target already has its own).\n */\n baseFor(node, base) {\n const indexed = this.baseOf.get(node);\n if (indexed !== undefined)\n return indexed;\n const id = node.$id;\n if (typeof id !== \"string\")\n return base;\n if (this.draft === \"7\" && (typeof node.$ref === \"string\" || id.startsWith(\"#\")))\n return base;\n return documentOf(resolveUri(id, base));\n }\n /** Indexes the root schema and the registered documents' URIs (once). */\n ensureIndexed() {\n if (this.indexed)\n return;\n this.indexed = true;\n for (const [uri, schema] of Object.entries(this.options.schemas ?? {})) {\n this.registry.set(documentOf(resolveUri(uri, DEFAULT_BASE)), schema);\n }\n this.resources.set(DEFAULT_BASE, this.root);\n this.index(this.root, DEFAULT_BASE);\n }\n /**\n * The schema a reference names, with the base URI it compiles under. Throws if it names nothing, or, with\n * `unresolvedRefs: \"reject\"`, resolves to `false`, the schema no value passes.\n */\n resolve(ref, base) {\n this.ensureIndexed();\n if (!this.rejectUnresolved)\n return this.find(ref, base);\n try {\n return this.find(ref, base);\n }\n catch {\n this.unresolved.add(resolveUri(ref, base));\n return { node: false, base };\n }\n }\n /** Whether `ref`, from `base`, named nothing and resolved to `false`. */\n isUnresolved(ref, base) {\n return this.unresolved.has(resolveUri(ref, base));\n }\n find(ref, base) {\n const uri = resolveUri(ref, base);\n const doc = documentOf(uri);\n const fragment = uri.length > doc.length ? decodeURIComponent(uri.slice(doc.length + 1)) : \"\";\n const root = this.resources.has(doc) ? this.resources.get(doc) : this.load(doc);\n if (root === undefined)\n throw new Error(`Unresolved $ref ${ref} (no schema registered for ${doc})`);\n if (fragment === \"\")\n return { node: root, base: doc };\n if (fragment.startsWith(\"/\"))\n return this.pointer(root, doc, fragment);\n const target = this.anchors.get(`${doc}#${fragment}`);\n if (target === undefined)\n throw new Error(`Unresolved $ref ${ref} (no anchor ${fragment} in ${doc})`);\n return { node: target, base: this.baseOf.get(target) ?? doc };\n }\n /** Whether `node` is the root of the schema resource at `base`. */\n isResource(node, base) {\n this.ensureIndexed();\n return this.resources.get(base) === node;\n }\n // Walks only keywords that hold subschemas: an `$id` inside `enum`, `const` or an unknown keyword names nothing.\n index(node, base) {\n if (!isSchemaObject(node) || this.baseOf.has(node))\n return;\n let b = base;\n // In draft 7 a `$ref` makes every sibling keyword, `$id` included, inert.\n const refOnly = this.draft === \"7\" && typeof node.$ref === \"string\";\n if (!refOnly && typeof node.$id === \"string\") {\n if (this.draft === \"7\" && node.$id.startsWith(\"#\"))\n this.anchors.set(documentOf(b) + node.$id, node);\n else {\n const uri = resolveUri(node.$id, b);\n b = documentOf(uri);\n this.resources.set(b, node);\n if (uri.length > b.length + 1)\n this.anchors.set(uri, node);\n }\n }\n this.baseOf.set(node, b);\n if (refOnly)\n return;\n if (this.draft !== \"7\") {\n if (typeof node.$anchor === \"string\")\n this.anchors.set(`${b}#${node.$anchor}`, node);\n if (typeof node.$dynamicAnchor === \"string\") {\n this.anchors.set(`${b}#${node.$dynamicAnchor}`, node);\n this.dynamicAnchors.set(`${b}#${node.$dynamicAnchor}`, node);\n }\n }\n for (const key of SCHEMA_KEYWORDS)\n this.index(node[key], b);\n for (const key of MAP_KEYWORDS) {\n const map = node[key];\n if (isSchemaObject(map))\n for (const k of Object.keys(map))\n this.index(map[k], b);\n }\n for (const key of ARRAY_KEYWORDS) {\n const list = node[key];\n if (Array.isArray(list))\n for (const s of list)\n this.index(s, b);\n }\n }\n load(doc) {\n const schema = this.registry.get(doc);\n if (schema === undefined)\n return undefined;\n this.resources.set(doc, schema);\n this.index(schema, doc);\n return schema;\n }\n pointer(root, base, fragment) {\n let node = root;\n let b = base;\n for (const raw of fragment.split(\"/\").slice(1)) {\n const key = raw.replace(/~1/g, \"/\").replace(/~0/g, \"~\");\n node =\n typeof node === \"object\" && node !== null && Object.hasOwn(node, key)\n ? node[key]\n : undefined;\n if (node === undefined)\n throw new Error(`Unresolved $ref #${fragment} in ${base}`);\n if (typeof node === \"object\" && node !== null)\n b = this.baseOf.get(node) ?? b;\n }\n return { node, base: b };\n }\n}\nconst SCHEMA_KEYWORDS = [\n \"additionalProperties\",\n \"propertyNames\",\n \"contains\",\n \"not\",\n \"if\",\n \"then\",\n \"else\",\n \"unevaluatedProperties\",\n \"unevaluatedItems\",\n \"additionalItems\",\n \"contentSchema\",\n \"items\",\n];\nconst MAP_KEYWORDS = [\"properties\", \"patternProperties\", \"$defs\", \"definitions\", \"dependentSchemas\", \"dependencies\"];\nconst ARRAY_KEYWORDS = [\"allOf\", \"anyOf\", \"oneOf\", \"prefixItems\", \"items\"];\n/** Whether `value` is a schema object (not `true`/`false`, an array or a primitive). */\nexport function isSchemaObject(value) {\n return typeof value === \"object\" && value !== null && !Array.isArray(value);\n}\n/** `ref` resolved against `base`. URNs and other bases a URL parser rejects take fragment-only references. */\nexport function resolveUri(ref, base) {\n try {\n return new URL(ref, base).href;\n }\n catch {\n return ref.startsWith(\"#\") ? documentOf(base) + ref : ref;\n }\n}\n/** `uri` without its fragment. */\nexport function documentOf(uri) {\n const hash = uri.indexOf(\"#\");\n return hash < 0 ? uri : uri.slice(0, hash);\n}\n//# sourceMappingURL=resolver.js.map","// Regular expressions shared across all compiled schemas while one still uses them: tool schemas repeat a few\n// patterns many times, and a RegExp is large once it has run. The cache holds its values weakly and drops an entry\n// once its RegExp is collected, so it keeps nothing alive.\n/**\n * The regular expression of a `pattern` source, shared by source. Patterns are ECMAScript regular expressions with\n * the `u` flag; a source that is invalid with it (some older schemas escape characters `u` rejects) compiles\n * without it.\n */\nexport function sharedRegex(source) {\n const hit = regexes.get(source)?.deref();\n if (hit !== undefined)\n return hit;\n let re;\n try {\n re = new RegExp(source, \"u\");\n }\n catch {\n re = new RegExp(source);\n }\n regexes.set(source, new WeakRef(re));\n regexCleanup.register(re, source);\n return re;\n}\nconst regexes = new Map();\nconst regexCleanup = new FinalizationRegistry((source) => {\n if (regexes.get(source)?.deref() === undefined)\n regexes.delete(source);\n});\n/** The number of cached regular expressions (for tests). */\nexport function sharedRegexCount() {\n return regexes.size;\n}\n//# sourceMappingURL=shared.js.map","// Coercion: turns a loosely typed value (a model's tool call arguments, form input, query strings) into the value a\n// schema most likely meant, before it is checked. Only validators compiled with `{ coerce: true }` have it, and they\n// build it on their first coerce() or parse(); the check path never runs it.\n//\n// Three passes, in this order:\n// 1. Optional nulls: a `null` in an optional property whose schema rejects null is dropped, as if omitted.\n// 2. Conversion rules ported from TypeBox 1.3.27's Value.Convert (MIT), keyed on JSON Schema structure (`$ref`, `const`,\n// `enum`, `anyOf`/`oneOf`, `allOf`, `type`, `items`/`prefixItems`, `properties`/`patternProperties`) instead of\n// TypeBox's kind marks: `null` becomes \"null\" for a string, `\"3.5\"` becomes 3 for an integer, a single value becomes\n// a one-item array, and a union takes the first branch whose conversion passes.\n// 3. Primitive coercion by `type` (also type arrays), as in Ajv's `coerceTypes`: what pass 2 left, for example a type\n// array `[\"integer\", \"null\"]`, or `\"\"` for `null`.\n// A value that cannot be coerced is left as it is; the check then reports it.\n//\n// Every pass is copy-on-write: an object or array is copied only when one of its members changes, so an unchanged\n// value comes back as the same reference and the input is never modified. All passes walk the same keywords for\n// members: `properties`, then `patternProperties`, then `additionalProperties` for keys neither names; tuple items by\n// `prefixItems` (or a draft-7 `items` array), the rest by `items`. Draft 7's `additionalItems` is not coerced.\nimport { isSchemaObject } from \"./resolver.js\";\nimport { sharedRegex } from \"./shared.js\";\n/** Coerces values for one compiled schema. */\nexport class Coercer {\n c;\n schema;\n /**\n * The (schema node, value) pairs pass 2 is converting through a re-entry point, as a stack. Conversion can enter\n * a node again with the same value only through a `$ref` or by wrapping a single value into an array (also for\n * schemas that cycle through shared JS objects): a recursive schema that meets a value no branch accepts would\n * convert it without end. A pair already on the stack (primitives by value, objects by reference) leaves the value\n * unchanged. Only those two points push, so schemas without references or wraps pay nothing.\n */\n entered = [];\n /** How often a re-entry was cut short in this coerce() call; results computed across one are not memoized. */\n cuts = 0;\n /**\n * Results of `$ref` targets by (node, value) within one coerce() call: a recursive union whose branches all\n * convert the same children (and all fail) would convert them once per branch, exponentially in the depth.\n */\n memo = undefined;\n constructor(compiler, schema) {\n this.c = compiler;\n this.schema = schema;\n }\n /** `value` coerced: a copy along the changed paths only, or `value` itself when nothing changes. */\n coerce(value) {\n const base = this.c.r.rootBase;\n const withoutNulls = this.dropOptionalNulls(value, this.schema, base);\n return this.coerceTypes(this.convertOnly(withoutNulls), this.schema, base);\n }\n /** Pass 2 alone, as TypeBox's `Value.Convert` (the TypeBox conformance tests run it). */\n convertOnly(value) {\n try {\n return this.convert(this.schema, this.c.r.rootBase, value);\n }\n finally {\n this.memo = undefined;\n this.cuts = 0;\n }\n }\n /** `node` converted for `value` at a re-entry point: unchanged when that pair is already being converted. */\n reenter(node, base, value, memoize) {\n const entered = this.entered;\n for (let i = 0; i < entered.length; i += 2) {\n if (entered[i] === node && Object.is(entered[i + 1], value)) {\n this.cuts++;\n return value;\n }\n }\n const memo = memoize ? this.memo?.get(node) : undefined;\n if (memo?.has(value))\n return memo.get(value);\n const cuts = this.cuts;\n entered.push(node, value);\n let result;\n try {\n result = this.convert(node, base, value);\n }\n finally {\n entered.length -= 2;\n }\n if (memoize && this.cuts === cuts) {\n this.memo ??= new Map();\n let values = this.memo.get(node);\n if (values === undefined) {\n values = new Map();\n this.memo.set(node, values);\n }\n values.set(value, result);\n }\n return result;\n }\n /** Whether `value` passes the schema `node`; undefined when `node` cannot be compiled. */\n passes(node, base, value) {\n try {\n return this.c.check(node, this.baseOf(node, base))(value);\n }\n catch {\n return undefined;\n }\n }\n baseOf(node, base) {\n return isSchemaObject(node) ? (this.c.r.baseOf.get(node) ?? base) : base;\n }\n // ---------------------------------------------------------------------------------------------------------------\n // Pass 1: optional nulls\n // ---------------------------------------------------------------------------------------------------------------\n dropOptionalNulls(value, schema, base) {\n if (!isSchemaObject(schema))\n return value;\n const b = this.baseOf(schema, base);\n if (Array.isArray(value)) {\n return mapItems(value, (item, i) => {\n const itemSchema = itemSchemaAt(schema, i);\n return itemSchema === undefined ? item : this.dropOptionalNulls(item, itemSchema, b);\n });\n }\n if (!isPlainObject(value))\n return value;\n const properties = isSchemaObject(schema.properties) ? schema.properties : {};\n const patterns = isSchemaObject(schema.patternProperties)\n ? Object.entries(schema.patternProperties).map(([pattern, item]) => [sharedRegex(pattern), item])\n : [];\n const additional = isSchemaObject(schema.additionalProperties) ? schema.additionalProperties : undefined;\n if (patterns.length === 0 && additional === undefined && !isSchemaObject(schema.properties))\n return value;\n const required = new Set(Array.isArray(schema.required) ? schema.required : []);\n let out;\n const set = (key, next) => {\n if (next === (out ?? value)[key])\n return;\n out ??= { ...value };\n out[key] = next;\n };\n for (const [key, property] of Object.entries(properties)) {\n if (!Object.hasOwn(value, key))\n continue;\n const isRef = isSchemaObject(property) && typeof property.$ref === \"string\";\n if (value[key] === null && !required.has(key) && !isRef && this.passes(property, b, null) === false) {\n out ??= { ...value };\n delete out[key];\n continue;\n }\n set(key, this.dropOptionalNulls(value[key], property, b));\n }\n // Values of pattern and additional properties are walked for their own optional nulls; the keys themselves\n // are not optional properties, so they stay.\n if (patterns.length > 0 || additional !== undefined) {\n for (const key of Object.keys(value)) {\n let matched = Object.hasOwn(properties, key);\n for (const [pattern, item] of patterns) {\n if (!pattern.test(key))\n continue;\n matched = true;\n set(key, this.dropOptionalNulls((out ?? value)[key], item, b));\n }\n if (!matched && additional !== undefined)\n set(key, this.dropOptionalNulls(value[key], additional, b));\n }\n }\n return out ?? value;\n }\n // ---------------------------------------------------------------------------------------------------------------\n // Pass 2: TypeBox's conversion rules\n // ---------------------------------------------------------------------------------------------------------------\n convert(node, base, value) {\n if (!isSchemaObject(node))\n return value;\n const b = this.baseOf(node, base);\n if (typeof node.$ref === \"string\") {\n let target;\n try {\n target = this.c.r.resolve(node.$ref, b);\n }\n catch {\n return value;\n }\n return isSchemaObject(target.node) ? this.reenter(target.node, target.base, value, true) : value;\n }\n return this.convertNode(node, b, value);\n }\n /** One schema node's conversion: its first keyword among `const`, `enum`, the unions, `allOf` and `type`. */\n convertNode(node, b, value) {\n if (Object.hasOwn(node, \"const\"))\n return convertLiteral(node.const, value);\n if (Array.isArray(node.enum))\n return this.convertEnum(node, node.enum, b, value);\n // A union or intersection node may also declare members (plain JSON Schema; TypeBox's never do): they convert\n // after the branches.\n if (Array.isArray(node.anyOf))\n return this.convertUnion(node, node.anyOf, b, value);\n if (Array.isArray(node.oneOf))\n return this.convertUnion(node, node.oneOf, b, value);\n if (Array.isArray(node.allOf)) {\n let next = value;\n for (const member of node.allOf)\n next = this.convert(member, b, next);\n return this.convertMembers(node, b, next);\n }\n switch (node.type) {\n case \"string\":\n return orValue(tryString(value), value);\n case \"number\":\n return orValue(tryNumber(value), value);\n case \"integer\": {\n const result = tryNumber(value);\n return result === undefined ? value : Math.trunc(result.value);\n }\n case \"boolean\":\n return orValue(tryBoolean(value), value);\n case \"null\":\n return orValue(tryNull(value), value);\n case \"array\":\n return this.convertArray(node, b, value);\n case \"object\":\n return this.convertObject(node, b, value);\n case undefined:\n if (node.properties !== undefined || node.patternProperties !== undefined) {\n return this.convertObject(node, b, value);\n }\n if (node.items !== undefined || node.prefixItems !== undefined)\n return this.convertArray(node, b, value);\n return value;\n default:\n return value;\n }\n }\n /** An enum is a union of its values: a member stays, else the first value the input converts to. */\n convertEnum(node, values, base, value) {\n if (values.some((member) => member === value))\n return value;\n for (const member of values) {\n const candidate = convertLiteral(member, value);\n if (candidate !== value && this.passes(node, base, candidate) === true)\n return candidate;\n }\n return value;\n }\n /**\n * A value one branch accepts stays; else the first branch's conversion that the whole union accepts. Branches are\n * converted in order and only until one is accepted, so a later recursive branch is not entered needlessly. A node\n * that also declares members (plain JSON Schema; TypeBox's never do) converts them into each candidate before it is\n * checked, so a branch is not discarded for a sibling property that is converted after it.\n */\n convertUnion(node, branches, base, value) {\n if (branches.some((branch) => this.passes(branch, base, value) === true))\n return this.convertMembers(node, base, value);\n for (const branch of branches) {\n const candidate = this.convertMembers(node, base, this.convert(branch, base, value));\n if (this.passes(node, base, candidate) === true)\n return candidate;\n }\n return this.convertMembers(node, base, value);\n }\n /** The object members of a union or intersection node, when it declares any. */\n convertMembers(node, base, value) {\n const declares = node.properties !== undefined ||\n node.patternProperties !== undefined ||\n node.additionalProperties !== undefined;\n return declares ? this.convertObject(node, base, value) : value;\n }\n convertArray(node, base, value) {\n const prefix = Array.isArray(node.items)\n ? node.items\n : Array.isArray(node.prefixItems)\n ? node.prefixItems\n : undefined;\n if (prefix !== undefined) {\n // A tuple converts its items and never wraps a single value.\n if (!Array.isArray(value))\n return value;\n const rest = Array.isArray(node.items) ? undefined : node.items;\n return mapItems(value, (item, i) => {\n const schema = i < prefix.length ? prefix[i] : rest;\n return schema === undefined ? item : this.convert(schema, base, item);\n });\n }\n if (Array.isArray(value)) {\n return node.items === undefined ? value : mapItems(value, (item) => this.convert(node.items, base, item));\n }\n // The wrapped single value is converted by the item schema with the same value: a re-entry point.\n const item = node.items;\n return [isSchemaObject(item) ? this.reenter(item, base, value, false) : value];\n }\n convertObject(node, base, value) {\n if (!isPlainObject(value))\n return value;\n const properties = isSchemaObject(node.properties) ? node.properties : {};\n const patterns = isSchemaObject(node.patternProperties)\n ? Object.entries(node.patternProperties).map(([pattern, schema]) => [sharedRegex(pattern), schema])\n : [];\n const additional = isSchemaObject(node.additionalProperties) ? node.additionalProperties : undefined;\n let out;\n for (const key of Object.keys(value)) {\n // An undefined property counts as absent.\n if (value[key] === undefined)\n continue;\n let next = value[key];\n let matched = Object.hasOwn(properties, key);\n if (matched)\n next = this.convert(properties[key], base, next);\n for (const [pattern, schema] of patterns) {\n if (!pattern.test(key))\n continue;\n matched = true;\n next = this.convert(schema, base, next);\n }\n if (!matched && additional !== undefined)\n next = this.convert(additional, base, next);\n if (next !== value[key]) {\n out ??= { ...value };\n out[key] = next;\n }\n }\n return out ?? value;\n }\n // ---------------------------------------------------------------------------------------------------------------\n // Pass 3: primitive coercion by type\n // ---------------------------------------------------------------------------------------------------------------\n coerceTypes(value, schema, base) {\n if (!isSchemaObject(schema))\n return value;\n const b = this.baseOf(schema, base);\n let next = value;\n if (Array.isArray(schema.allOf))\n for (const member of schema.allOf)\n next = this.coerceTypes(next, member, b);\n if (Array.isArray(schema.anyOf))\n next = this.coerceUnion(next, schema.anyOf, b);\n if (Array.isArray(schema.oneOf))\n next = this.coerceUnion(next, schema.oneOf, b);\n const types = typesOf(schema);\n const matchesUnionMember = types.length > 1 && types.some((type) => matchesType(next, type));\n if (types.length > 0 && !matchesUnionMember) {\n for (const type of types) {\n const candidate = coercePrimitive(next, type);\n if (candidate !== next) {\n next = candidate;\n break;\n }\n }\n }\n if (types.includes(\"object\") && isPlainObject(next))\n next = this.coerceProperties(next, schema, b);\n if (types.includes(\"array\") && Array.isArray(next))\n next = this.coerceItems(next, schema, b);\n return next;\n }\n coerceUnion(value, branches, base) {\n for (const branch of branches)\n if (this.passes(branch, base, value) === true)\n return value;\n for (const branch of branches) {\n const coerced = this.coerceTypes(value, branch, base);\n if (this.passes(branch, base, coerced) === true)\n return coerced;\n }\n return value;\n }\n coerceProperties(value, schema, base) {\n const properties = isSchemaObject(schema.properties) ? schema.properties : {};\n const patterns = isSchemaObject(schema.patternProperties)\n ? Object.entries(schema.patternProperties).map(([pattern, item]) => [sharedRegex(pattern), item])\n : [];\n const additional = isSchemaObject(schema.additionalProperties) ? schema.additionalProperties : undefined;\n let out;\n const set = (key, next) => {\n if (next === (out ?? value)[key])\n return;\n out ??= { ...value };\n out[key] = next;\n };\n for (const [key, property] of Object.entries(properties)) {\n if (key in value)\n set(key, this.coerceTypes(value[key], property, base));\n }\n for (const key of Object.keys(value)) {\n let matched = Object.hasOwn(properties, key);\n for (const [pattern, item] of patterns) {\n if (!pattern.test(key))\n continue;\n matched = true;\n set(key, this.coerceTypes((out ?? value)[key], item, base));\n }\n if (!matched && additional !== undefined)\n set(key, this.coerceTypes(value[key], additional, base));\n }\n return out ?? value;\n }\n coerceItems(value, schema, base) {\n return mapItems(value, (item, i) => {\n const itemSchema = itemSchemaAt(schema, i);\n return isSchemaObject(itemSchema) ? this.coerceTypes(item, itemSchema, base) : item;\n });\n }\n}\n/**\n * The schema of an array's item at `index`: a tuple's (`prefixItems`, or a draft-7 `items` array) for its prefix,\n * `items` after `prefixItems`, or `items` for every item. Undefined when nothing applies.\n */\nfunction itemSchemaAt(schema, index) {\n if (Array.isArray(schema.items))\n return schema.items[index];\n if (Array.isArray(schema.prefixItems) && index < schema.prefixItems.length)\n return schema.prefixItems[index];\n return schema.items;\n}\n/** `items` mapped by `map`; the same array when every item maps to itself. */\nfunction mapItems(items, map) {\n let out;\n for (let i = 0; i < items.length; i++) {\n const next = map(items[i], i);\n if (next === items[i])\n continue;\n out ??= items.slice();\n out[i] = next;\n }\n return out ?? items;\n}\nfunction orValue(result, value) {\n return result === undefined ? value : result.value;\n}\n/** A literal (`const`, an enum value) taken from a value of another type that converts to exactly it. */\nfunction convertLiteral(literal, value) {\n if (literal === value)\n return value;\n const result = typeof literal === \"string\"\n ? tryString(value)\n : typeof literal === \"number\"\n ? tryNumber(value)\n : typeof literal === \"boolean\"\n ? tryBoolean(value)\n : undefined;\n return result !== undefined && result.value === literal ? result.value : value;\n}\nfunction tryString(value) {\n if (typeof value === \"bigint\" || typeof value === \"boolean\" || isFiniteNumber(value))\n return { value: String(value) };\n if (value === null)\n return { value: \"null\" };\n if (typeof value === \"string\")\n return { value };\n if (value === undefined)\n return { value: \"\" };\n return undefined;\n}\nconst MAX_BIGINT = BigInt(Number.MAX_SAFE_INTEGER);\nconst MIN_BIGINT = BigInt(Number.MIN_SAFE_INTEGER);\nfunction tryNumber(value) {\n if (typeof value === \"bigint\")\n return value <= MAX_BIGINT && value >= MIN_BIGINT ? { value: Number(value) } : undefined;\n if (typeof value === \"boolean\")\n return { value: value ? 1 : 0 };\n if (isFiniteNumber(value))\n return { value };\n if (value === null || value === undefined)\n return { value: 0 };\n if (typeof value !== \"string\")\n return undefined;\n const coerced = +value;\n if (Number.isFinite(coerced))\n return { value: coerced };\n const lowercase = value.toLowerCase();\n if (lowercase === \"false\")\n return { value: 0 };\n if (lowercase === \"true\")\n return { value: 1 };\n const big = bigIntOfString(value);\n return big !== undefined && big <= MAX_BIGINT && big >= MIN_BIGINT ? { value: Number(big) } : undefined;\n}\n/** TypeBox's TryBigInt of a string: `12n`, `12.5` (truncated) or `12`; true and false are not reached from tryNumber. */\nfunction bigIntOfString(value) {\n if (/^-?(0|[1-9]\\d*)n$/.test(value))\n return BigInt(value.slice(0, -1));\n if (/^-?(0|[1-9]\\d*)\\.\\d+$/.test(value))\n return BigInt(value.split(\".\")[0]);\n if (/^-?(0|[1-9]\\d*)$/.test(value))\n return BigInt(value);\n return undefined;\n}\nfunction tryBoolean(value) {\n if (typeof value === \"bigint\")\n return value === 0n ? { value: false } : value === 1n ? { value: true } : undefined;\n if (typeof value === \"boolean\")\n return { value };\n if (isFiniteNumber(value))\n return value === 0 ? { value: false } : value === 1 ? { value: true } : undefined;\n if (value === null || value === undefined)\n return { value: false };\n if (typeof value !== \"string\")\n return undefined;\n const lowercase = value.toLowerCase();\n if (lowercase === \"false\" || value === \"0\")\n return { value: false };\n if (lowercase === \"true\" || value === \"1\")\n return { value: true };\n return undefined;\n}\nfunction tryNull(value) {\n if (typeof value === \"bigint\")\n return value === 0n ? { value: null } : undefined;\n if (typeof value === \"boolean\")\n return value === false ? { value: null } : undefined;\n if (isFiniteNumber(value))\n return value === 0 ? { value: null } : undefined;\n if (value === null || value === undefined)\n return { value: null };\n if (typeof value !== \"string\")\n return undefined;\n const lowercase = value.toLowerCase();\n return lowercase === \"undefined\" || lowercase === \"null\" || value === \"\" || value === \"0\"\n ? { value: null }\n : undefined;\n}\nfunction isFiniteNumber(value) {\n return typeof value === \"number\" && Number.isFinite(value);\n}\n// -------------------------------------------------------------------------------------------------------------------\n// Primitive coercion by type (pass 3)\n// -------------------------------------------------------------------------------------------------------------------\nfunction typesOf(schema) {\n if (typeof schema.type === \"string\")\n return [schema.type];\n if (Array.isArray(schema.type))\n return schema.type.filter((type) => typeof type === \"string\");\n return [];\n}\nfunction matchesType(value, type) {\n switch (type) {\n case \"number\":\n return typeof value === \"number\";\n case \"integer\":\n return typeof value === \"number\" && Number.isInteger(value);\n case \"boolean\":\n return typeof value === \"boolean\";\n case \"string\":\n return typeof value === \"string\";\n case \"null\":\n return value === null;\n case \"array\":\n return Array.isArray(value);\n case \"object\":\n return isPlainObject(value);\n default:\n return false;\n }\n}\nfunction coercePrimitive(value, type) {\n switch (type) {\n case \"number\":\n case \"integer\": {\n if (value === null)\n return 0;\n if (typeof value === \"string\" && value.trim() !== \"\") {\n const parsed = Number(value);\n if (type === \"number\" ? Number.isFinite(parsed) : Number.isInteger(parsed))\n return parsed;\n }\n if (typeof value === \"boolean\")\n return value ? 1 : 0;\n return value;\n }\n case \"boolean\":\n if (value === null)\n return false;\n if (value === \"true\" || value === 1)\n return true;\n if (value === \"false\" || value === 0)\n return false;\n return value;\n case \"string\":\n if (value === null)\n return \"\";\n if (typeof value === \"number\" || typeof value === \"boolean\")\n return String(value);\n return value;\n case \"null\":\n return value === \"\" || value === 0 || value === false ? null : value;\n default:\n return value;\n }\n}\nfunction isPlainObject(value) {\n return typeof value === \"object\" && value !== null && !Array.isArray(value);\n}\n//# sourceMappingURL=coerce.js.map","// Check factories: each returns a closure that captures only its arguments, never the compiler, so a compiled\n// schema keeps no compile-time state alive. Leaf checks are module constants that object and array loops inline.\nexport const ALWAYS = () => true;\nexport const NEVER = () => false;\nconst IS_STRING = (v) => typeof v === \"string\";\nconst IS_NUMBER = (v) => Number.isFinite(v);\nconst IS_INTEGER = (v) => Number.isInteger(v);\nconst IS_BOOLEAN = (v) => typeof v === \"boolean\";\nconst IS_NULL = (v) => v === null;\nexport const IS_ARRAY = (v) => Array.isArray(v);\nconst IS_BYTES = (v) => v instanceof Uint8Array;\nexport const IS_OBJECT = (v) => isObject(v);\n/** Whether `v` is a JSON object: not null, an array or bytes. */\nexport function isObject(v) {\n return typeof v === \"object\" && v !== null && !Array.isArray(v) && !(v instanceof Uint8Array);\n}\n/** The check of a `type` name; `bytes` (a Uint8Array) extends JSON Schema for values that never pass through JSON. */\nexport const TYPE_CHECKS = new Map([\n [\"string\", IS_STRING],\n [\"number\", IS_NUMBER],\n [\"integer\", IS_INTEGER],\n [\"boolean\", IS_BOOLEAN],\n [\"null\", IS_NULL],\n [\"array\", IS_ARRAY],\n [\"object\", IS_OBJECT],\n [\"bytes\", IS_BYTES],\n]);\n/** Leaf checks that object and array loops run inline by code instead of calling them. */\nexport const LEAF_CODES = new Map([\n [IS_STRING, 1],\n [IS_NUMBER, 2],\n [IS_INTEGER, 3],\n [IS_BOOLEAN, 4],\n [IS_NULL, 5],\n [ALWAYS, 6],\n]);\nfunction leafOk(code, x) {\n switch (code) {\n case 1:\n return typeof x === \"string\";\n case 2:\n return Number.isFinite(x);\n case 3:\n return Number.isInteger(x);\n case 4:\n return typeof x === \"boolean\";\n case 5:\n return x === null;\n default:\n return true;\n }\n}\n/** Whether a combined object or array check also checks the type: not at all, strictly, or passing other types. */\nexport const GUARD_NONE = 0;\nexport const GUARD_STRICT = 1;\nexport const GUARD_LOOSE = 2;\n/** Flags of a declared property in an object check's entries: its leaf code and two bits. */\nexport const CODE = 7;\nexport const REQUIRED = 8;\nexport const INHERITED = 16;\n/** All of `parts`; two and three parts get closures without a loop. */\nexport function and(parts) {\n switch (parts.length) {\n case 0:\n return ALWAYS;\n case 1:\n return parts[0];\n case 2: {\n const [a, b] = parts;\n return (v) => a(v) && b(v);\n }\n case 3: {\n const [a, b, c] = parts;\n return (v) => a(v) && b(v) && c(v);\n }\n default:\n return (v) => {\n for (let i = 0; i < parts.length; i++)\n if (!parts[i](v))\n return false;\n return true;\n };\n }\n}\n/** A check whose implementation is set later: the indirection a recursive reference goes through. */\nexport function indirect(slot) {\n return (v) => slot.check(v);\n}\n/** `check` with `uri` pushed onto the dynamic scope while it runs (only for schemas with `$dynamicRef`). */\nexport function scopedCheck(scope, uri, check) {\n return (v) => {\n scope.push(uri);\n const ok = check(v);\n scope.pop();\n return ok;\n };\n}\n/** Any of the named types. */\nexport function typeCheck(types) {\n const checks = types.map((t) => (typeof t === \"string\" ? TYPE_CHECKS.get(t) : undefined) ?? NEVER);\n if (checks.length === 1)\n return checks[0];\n return (v) => {\n for (let i = 0; i < checks.length; i++)\n if (checks[i](v))\n return true;\n return false;\n };\n}\n/** A Uint8Array within the length bounds. */\nexport function bytesCheck(min, max) {\n return (v) => v instanceof Uint8Array && v.length >= min && v.length <= max;\n}\n/** The number of Unicode code points of `s`: JSON Schema string lengths count code points, not UTF-16 units. */\nexport function codePoints(s) {\n let n = 0;\n for (let i = 0; i < s.length; i++, n++) {\n const c = s.charCodeAt(i);\n // A high surrogate starts a pair only when a low surrogate follows; an unpaired one is a code point of its own.\n if (c >= 0xd800 && c <= 0xdbff && i + 1 < s.length) {\n const next = s.charCodeAt(i + 1);\n if (next >= 0xdc00 && next <= 0xdfff)\n i++;\n }\n }\n return n;\n}\n// UTF-16 units bound code points from both sides (units / 2 <= points <= units), so most strings need no count.\nfunction lengthOk(s, min, max) {\n const units = s.length;\n if (units < min)\n return false;\n if (units < 2 * min && codePoints(s) < min)\n return false;\n return units <= max || codePoints(s) <= max;\n}\n/** The string keywords: length bounds, pattern and format. */\nexport function stringCheck(strict, min, max, re, format) {\n if (re !== undefined && min === 0 && max === Number.POSITIVE_INFINITY && format === undefined) {\n return strict ? (v) => typeof v === \"string\" && re.test(v) : (v) => typeof v !== \"string\" || re.test(v);\n }\n if (re === undefined && format === undefined) {\n return strict\n ? (v) => typeof v === \"string\" && lengthOk(v, min, max)\n : (v) => typeof v !== \"string\" || lengthOk(v, min, max);\n }\n return (v) => {\n if (typeof v !== \"string\")\n return !strict;\n return lengthOk(v, min, max) && (re === undefined || re.test(v)) && (format === undefined || format(v));\n };\n}\n/** The number keywords. `mode`: 0 passes other types, 1 requires a number, 2 an integer. */\nexport function numberCheck(mode, min, max, xmin, xmax, multipleOf) {\n return (v) => {\n if (typeof v !== \"number\")\n return mode === 0;\n if (mode === 2 && !Number.isInteger(v))\n return false;\n return v >= min && v <= max && v > xmin && v < xmax && (multipleOf === undefined || isMultiple(v, multipleOf));\n };\n}\n/** Whether `v` is a multiple of `d`, exactly for decimals: 0.0075 / 0.0001 is 74.99999999999999 in floating point. */\nexport function isMultiple(v, d) {\n const q = v / d;\n if (Number.isInteger(q))\n return true;\n if (!Number.isFinite(q))\n return v % d === 0;\n const [vc, ve] = decimal(v);\n const [dc, de] = decimal(d);\n return ve >= de ? (vc * 10n ** BigInt(ve - de)) % dc === 0n : vc % (dc * 10n ** BigInt(de - ve)) === 0n;\n}\nfunction decimal(x) {\n const [mantissa, exponent = \"0\"] = Math.abs(x).toString().split(\"e\");\n const point = mantissa.indexOf(\".\");\n const fraction = point < 0 ? 0 : mantissa.length - point - 1;\n return [BigInt(mantissa.replace(\".\", \"\")), Number(exponent) - fraction];\n}\n/** `inner` for objects; other values pass unless `strict`. */\nexport function guardObject(inner, strict) {\n return strict ? (v) => isObject(v) && inner(v) : (v) => !isObject(v) || inner(v);\n}\n/** `inner` for arrays; other values pass unless `strict`. */\nexport function guardArray(inner, strict) {\n return strict ? (v) => Array.isArray(v) && inner(v) : (v) => !Array.isArray(v) || inner(v);\n}\n/**\n * An object with declared properties: `entries` is `[key, check, flags]` per property. The value's own keys are\n * walked with for...in (whose `o[k]` V8 reads from the enum cache, unlike a load by a name from a list), each found\n * among the declared names; `closed` rejects any other key. A property whose value is `undefined` counts as absent.\n */\nexport function declaredObject(entries, requiredCount, closed, guard) {\n const n = entries.length;\n return (v) => {\n if (guard !== GUARD_NONE && !isObject(v))\n return guard === GUARD_LOOSE;\n // Guarded: by the check above, or by the caller for GUARD_NONE.\n const o = v;\n let required = 0;\n for (const k in o) {\n let i = 0;\n while (i < n && entries[i] !== k)\n i += 3;\n if (i === n) {\n if (closed)\n return false;\n continue;\n }\n const x = o[k];\n if (x === undefined)\n continue;\n const f = entries[i + 2];\n const c = f & CODE;\n if (c !== 0 ? !leafOk(c, x) : !entries[i + 1](x))\n return false;\n if (f & REQUIRED)\n required++;\n }\n return required === requiredCount;\n };\n}\n/** An object with declared properties, required keys not declared, pattern properties and additional properties. */\nexport function openObject(entries, keys, extraRequired, patterns, additional, guard) {\n const known = patterns.length > 0 || additional !== undefined ? new Set(keys) : undefined;\n return (v) => {\n if (guard !== GUARD_NONE && !isObject(v))\n return guard === GUARD_LOOSE;\n const o = v;\n for (let i = 0; i < entries.length; i += 3) {\n const k = entries[i];\n const x = o[k];\n const f = entries[i + 2];\n if (x === undefined || (f & INHERITED && !Object.hasOwn(o, k))) {\n if (f & REQUIRED)\n return false;\n continue;\n }\n const c = f & CODE;\n if (c !== 0 ? !leafOk(c, x) : !entries[i + 1](x))\n return false;\n }\n for (let i = 0; i < extraRequired.length; i++)\n if (!Object.hasOwn(o, extraRequired[i]))\n return false;\n if (known === undefined)\n return true;\n for (const k of Object.keys(o)) {\n let matched = known.has(k);\n for (let i = 0; i < patterns.length; i++) {\n if (patterns[i][0].test(k)) {\n matched = true;\n if (!patterns[i][1](o[k]))\n return false;\n }\n }\n if (!matched && additional !== undefined && !additional(o[k]))\n return false;\n }\n return true;\n };\n}\n/** Every property name passes `check` (`v` is an object). */\nexport function propertyNamesCheck(check) {\n return (v) => {\n for (const k in v)\n if (!check(k))\n return false;\n return true;\n };\n}\n/** `minProperties` and `maxProperties` (`v` is an object). */\nexport function propertyCountCheck(min, max) {\n return (v) => {\n let n = 0;\n for (const _ in v)\n n++;\n return n >= min && n <= max;\n };\n}\n/** `dependentRequired` (`v` is an object). */\nexport function dependentRequiredCheck(entries) {\n return (v) => {\n const o = v;\n for (const [k, list] of entries)\n if (Object.hasOwn(o, k))\n for (const r of list)\n if (!Object.hasOwn(o, r))\n return false;\n return true;\n };\n}\n/** `dependentSchemas` (`v` is an object). */\nexport function dependentSchemasCheck(entries) {\n return (v) => {\n for (const [k, check] of entries)\n if (Object.hasOwn(v, k) && !check(v))\n return false;\n return true;\n };\n}\n/** The common array: guard, length bounds, prefix items and the items after them, in one closure. */\nexport function listCheck(guard, min, max, prefix, rest) {\n const n = prefix.length;\n const code = rest === undefined ? 0 : (LEAF_CODES.get(rest) ?? 0);\n return (v) => {\n if (!Array.isArray(v))\n return guard === GUARD_LOOSE;\n const length = v.length;\n if (length < min || length > max)\n return false;\n const m = length < n ? length : n;\n for (let i = 0; i < m; i++)\n if (!prefix[i](v[i]))\n return false;\n if (rest === undefined)\n return true;\n if (code !== 0) {\n for (let i = n; i < length; i++)\n if (!leafOk(code, v[i]))\n return false;\n return true;\n }\n for (let i = n; i < length; i++)\n if (!rest(v[i]))\n return false;\n return true;\n };\n}\n/** Prefix items and the items after them (`v` is an array). */\nexport function itemsCheck(prefix, rest) {\n return listCheck(GUARD_NONE, 0, Number.POSITIVE_INFINITY, prefix, rest);\n}\n/** `minItems` and `maxItems` (`v` is an array). */\nexport function lengthCheck(min, max) {\n return (v) => v.length >= min && v.length <= max;\n}\n/** `contains` with its bounds (`v` is an array). */\nexport function containsCheck(check, min, max) {\n return (v) => {\n const list = v;\n let n = 0;\n for (let i = 0; i < list.length; i++)\n if (check(list[i]) && ++n > max)\n return false;\n return n >= min;\n };\n}\n/** `uniqueItems` (`v` is an array). */\nexport function uniqueCheck(v) {\n const list = v;\n for (let i = 1; i < list.length; i++)\n for (let j = 0; j < i; j++)\n if (deepEqual(list[i], list[j]))\n return false;\n return true;\n}\n/** `enum`: up to 8 primitives by a scan, more by a Set, objects and arrays by deep equality. */\nexport function enumCheck(values) {\n const primitives = values.filter((x) => typeof x !== \"object\" || x === null);\n if (primitives.length === values.length && primitives.length <= 8) {\n return (v) => {\n for (let i = 0; i < primitives.length; i++)\n if (primitives[i] === v)\n return true;\n return false;\n };\n }\n const set = new Set(primitives);\n const objects = values.filter((x) => typeof x === \"object\" && x !== null);\n return (v) => set.has(v) || (typeof v === \"object\" && objects.some((o) => deepEqual(v, o)));\n}\n/** `const`. */\nexport function constCheck(value) {\n if (typeof value !== \"object\" || value === null)\n return (v) => v === value;\n return (v) => deepEqual(v, value);\n}\n/** `anyOf`. */\nexport function anyCheck(checks) {\n return (v) => {\n for (let i = 0; i < checks.length; i++)\n if (checks[i](v))\n return true;\n return false;\n };\n}\n/** `oneOf`. */\nexport function oneCheck(checks) {\n return (v) => {\n let n = 0;\n for (let i = 0; i < checks.length; i++)\n if (checks[i](v) && ++n > 1)\n return false;\n return n === 1;\n };\n}\n/** `not`. */\nexport function notCheck(check) {\n return (v) => !check(v);\n}\n/** `if`, `then` and `else`. */\nexport function ifCheck(cond, then, otherwise) {\n return (v) => (cond(v) ? then(v) : otherwise(v));\n}\n/** A union of objects tagged by a const on `key`: the tag selects the one branch that can match. */\nexport function taggedCheck(key, tags, checks) {\n return (v) => {\n if (!isObject(v))\n return false;\n const tag = v[key];\n for (let i = 0; i < tags.length; i++)\n if (tags[i] === tag)\n return checks[i](v);\n return false;\n };\n}\n/** JSON equality: same primitives, arrays with equal items in order, objects with the same keys and equal values. */\nexport function deepEqual(a, b) {\n if (a === b)\n return true;\n if (typeof a !== \"object\" || typeof b !== \"object\" || a === null || b === null)\n return false;\n const array = Array.isArray(a);\n if (array !== Array.isArray(b))\n return false;\n if (array) {\n const x = a;\n const y = b;\n if (x.length !== y.length)\n return false;\n for (let i = 0; i < x.length; i++)\n if (!deepEqual(x[i], y[i]))\n return false;\n return true;\n }\n const x = a;\n const y = b;\n const keys = Object.keys(x);\n if (keys.length !== Object.keys(y).length)\n return false;\n for (const k of keys)\n if (!Object.hasOwn(y, k) || !deepEqual(x[k], y[k]))\n return false;\n return true;\n}\n//# sourceMappingURL=checks.js.map","// Annotation tracking for `unevaluatedProperties` and `unevaluatedItems`: annotating checks record which\n// properties and items a schema evaluated. Only schemas that use those keywords compile into these closures.\nimport { isObject } from \"./checks.js\";\n/** Empty annotations. */\nexport function newAnnotations() {\n return { props: null, allProps: false, items: 0, allItems: false, indexes: null };\n}\nfunction merge(a, b) {\n if (b.props !== null)\n for (const k of b.props)\n addProp(a, k);\n a.allProps ||= b.allProps;\n if (b.items > a.items)\n a.items = b.items;\n a.allItems ||= b.allItems;\n if (b.indexes !== null)\n for (const i of b.indexes)\n addIndex(a, i);\n}\nfunction addProp(a, key) {\n if (a.props === null)\n a.props = new Set();\n a.props.add(key);\n}\nfunction addIndex(a, index) {\n if (a.indexes === null)\n a.indexes = new Set();\n a.indexes.add(index);\n}\nexport const ANNOTATING_TRUE = () => true;\nexport const ANNOTATING_FALSE = () => false;\n/** The indirection a recursive reference goes through. */\nexport function indirectAnnotating(slot) {\n return (v, a) => slot.check(v, a);\n}\n/** A plain check in annotating position: it evaluates nothing that unevaluated* sees. */\nexport function ignoreAnnotations(check) {\n return (v) => check(v);\n}\n/** An annotating check run as a plain check, with fresh annotations. */\nexport function withFreshAnnotations(check) {\n return (v) => check(v, newAnnotations());\n}\n/** `check` with `uri` pushed onto the dynamic scope while it runs. */\nexport function scopedAnnotating(scope, uri, check) {\n return (v, a) => {\n scope.push(uri);\n const ok = check(v, a);\n scope.pop();\n return ok;\n };\n}\n/** unevaluated* sees only the annotations of its own schema, never those of its siblings in the parent. */\nexport function isolateAnnotations(check) {\n return (v, a) => {\n const b = newAnnotations();\n if (!check(v, b))\n return false;\n merge(a, b);\n return true;\n };\n}\n/** The non-annotating keywords, then each annotating part in order. */\nexport function annotateAll(plain, parts) {\n return (v, a) => {\n if (!plain(v))\n return false;\n for (let i = 0; i < parts.length; i++)\n if (!parts[i](v, a))\n return false;\n return true;\n };\n}\n/** `properties`, `patternProperties` and `additionalProperties`. */\nexport function annotateObject(props, patterns, additional) {\n const declared = new Set(props.map(([k]) => k));\n return (v, a) => {\n if (!isObject(v))\n return true;\n const seen = [];\n for (const [k, check] of props) {\n if (!Object.hasOwn(v, k))\n continue;\n if (!check(v[k]))\n return false;\n seen.push(k);\n }\n for (const k of Object.keys(v)) {\n let matched = declared.has(k);\n for (const [re, check] of patterns) {\n if (re.test(k)) {\n if (!check(v[k]))\n return false;\n matched = true;\n seen.push(k);\n }\n }\n if (!matched && additional !== undefined) {\n if (!additional(v[k]))\n return false;\n seen.push(k);\n }\n }\n for (const k of seen)\n addProp(a, k);\n return true;\n };\n}\n/** `prefixItems`/`items`/`additionalItems` and `contains` with its bounds. */\nexport function annotateArray(prefix, rest, contains, minContains, maxContains) {\n return (v, a) => {\n if (!Array.isArray(v))\n return true;\n const m = Math.min(v.length, prefix.length);\n for (let i = 0; i < m; i++)\n if (!prefix[i](v[i]))\n return false;\n if (rest !== undefined) {\n for (let i = prefix.length; i < v.length; i++)\n if (!rest(v[i]))\n return false;\n a.allItems = true;\n }\n if (m > a.items)\n a.items = m;\n if (contains !== undefined) {\n let n = 0;\n for (let i = 0; i < v.length; i++) {\n if (contains(v[i])) {\n n++;\n addIndex(a, i);\n }\n }\n if (n < minContains || n > maxContains)\n return false;\n }\n return true;\n };\n}\n/** `anyOf` (or `oneOf` when `exactlyOne`): every passing branch contributes its annotations. */\nexport function annotateAny(branches, exactlyOne) {\n return (v, a) => {\n let n = 0;\n for (const branch of branches) {\n const b = newAnnotations();\n if (branch(v, b)) {\n n++;\n merge(a, b);\n }\n }\n return exactlyOne ? n === 1 : n > 0;\n };\n}\n/** `if`, `then` and `else`: a passing `if` contributes its annotations even without `then`. */\nexport function annotateIf(cond, then, otherwise) {\n return (v, a) => {\n const b = newAnnotations();\n if (cond(v, b)) {\n merge(a, b);\n return then === undefined || then(v, a);\n }\n return otherwise === undefined || otherwise(v, a);\n };\n}\n/** One `dependentSchemas` entry. */\nexport function annotateDependent(key, check) {\n return (v, a) => !isObject(v) || !Object.hasOwn(v, key) || check(v, a);\n}\n/** `unevaluatedProperties`: every property no other keyword evaluated passes `check`. */\nexport function unevaluatedProperties(check) {\n return (v, a) => {\n if (!isObject(v) || a.allProps)\n return true;\n for (const k of Object.keys(v))\n if (!(a.props?.has(k) ?? false) && !check(v[k]))\n return false;\n a.allProps = true;\n return true;\n };\n}\n/** `unevaluatedItems`: every item no other keyword evaluated passes `check`. */\nexport function unevaluatedItems(check) {\n return (v, a) => {\n if (!Array.isArray(v) || a.allItems)\n return true;\n for (let i = a.items; i < v.length; i++)\n if (!(a.indexes?.has(i) ?? false) && !check(v[i]))\n return false;\n a.allItems = true;\n return true;\n };\n}\n//# sourceMappingURL=annotations.js.map","// The compiler: a schema to one check closure, built once. Keywords group by the type they constrain, so a value\n// is classified once per schema, and the common shapes (closed objects, arrays of one item schema, tagged unions,\n// leaf schemas) get one specialized closure each.\nimport { ANNOTATING_FALSE, ANNOTATING_TRUE, annotateAll, annotateAny, annotateArray, annotateDependent, annotateIf, annotateObject, ignoreAnnotations, indirectAnnotating, isolateAnnotations, scopedAnnotating, unevaluatedItems, unevaluatedProperties, withFreshAnnotations, } from \"./annotations.js\";\nimport { ALWAYS, and, anyCheck, bytesCheck, constCheck, containsCheck, declaredObject, dependentRequiredCheck, dependentSchemasCheck, enumCheck, GUARD_LOOSE, GUARD_NONE, GUARD_STRICT, guardArray, guardObject, INHERITED, IS_ARRAY, IS_OBJECT, ifCheck, indirect, itemsCheck, LEAF_CODES, lengthCheck, listCheck, NEVER, notCheck, numberCheck, oneCheck, openObject, propertyCountCheck, propertyNamesCheck, REQUIRED, scopedCheck, stringCheck, TYPE_CHECKS, taggedCheck, typeCheck, uniqueCheck, } from \"./checks.js\";\nimport { documentOf, isSchemaObject, Resolver, resolveUri } from \"./resolver.js\";\nimport { sharedRegex } from \"./shared.js\";\n/** Thrown when a compile without dynamic scope tracking meets a bookended `$dynamicRef`: compile again with it. */\nexport const RESTART = Symbol(\"restart\");\n/** One compile of a schema. Its caches and indexes are garbage once the root check is built. */\nexport class Compiler {\n r;\n draft;\n formats;\n /** Whether checks track the dynamic scope (the schema has a bookended `$dynamicRef`). */\n dynamic;\n schema;\n scope;\n cache = new Map();\n annotatingCache = new Map();\n constructor(schema, options, dynamic) {\n this.schema = schema;\n this.r = new Resolver(schema, options);\n this.draft = this.r.draft;\n this.formats = options.formats;\n this.dynamic = dynamic;\n this.scope = [];\n }\n /** The check of the root schema. */\n root() {\n return this.check(this.schema, this.r.rootBase);\n }\n /** The check of a schema (cached by schema object; a recursive reference goes through an indirection). */\n check(node, base) {\n if (node === true)\n return ALWAYS;\n if (node === false)\n return NEVER;\n if (!isSchemaObject(node))\n throw new Error(`A schema must be an object or a boolean, got ${JSON.stringify(node)}`);\n const cached = this.cache.get(node);\n if (cached !== undefined)\n return cached;\n const bare = this.bareType(node);\n if (bare !== undefined)\n return bare;\n const slot = { check: undefined };\n this.cache.set(node, indirect(slot));\n const check = this.build(node, this.r.baseFor(node, base));\n slot.check = check;\n this.cache.set(node, check);\n return check;\n }\n build(node, base) {\n if (this.draft === \"7\" && typeof node.$ref === \"string\")\n return this.ref(node.$ref, base);\n if (this.draft !== \"7\" && (node.unevaluatedProperties !== undefined || node.unevaluatedItems !== undefined)) {\n return withFreshAnnotations(this.annotating(node, base));\n }\n const check = this.plain(node, base);\n return this.dynamic && this.r.isResource(node, base) ? scopedCheck(this.scope, base, check) : check;\n }\n /**\n * The module-level check of a schema that is only a `type` (with annotations), `ALWAYS` for one with no assertion\n * at all; undefined for every other schema. These are the most common subschemas and cost nothing to share.\n */\n bareType(node) {\n let type;\n for (const k in node) {\n if (k === \"type\")\n type = node.type;\n else if (!NEUTRAL_KEYWORDS.has(k))\n return undefined;\n }\n if (type === undefined)\n return ALWAYS;\n return typeof type === \"string\" ? TYPE_CHECKS.get(type) : undefined;\n }\n /** Every keyword of `node`, not tracking annotations. */\n plain(node, base) {\n const parts = [];\n const types = node.type === undefined ? undefined : Array.isArray(node.type) ? node.type : [node.type];\n const single = types?.length === 1 ? types[0] : undefined;\n let typeInGroup = false;\n if (single === \"bytes\") {\n parts.push(bytesCheck(number(node.minLength) ?? 0, number(node.maxLength) ?? Number.POSITIVE_INFINITY));\n typeInGroup = true;\n }\n else {\n const string = this.stringGroup(node, single === \"string\");\n if (string !== undefined)\n parts.push(string);\n const numeric = single === \"number\" || single === \"integer\";\n const number = this.numberGroup(node, single === \"number\" ? 1 : single === \"integer\" ? 2 : 0);\n if (number !== undefined)\n parts.push(number);\n const object = this.objectGroup(node, base, single === \"object\");\n if (object !== undefined)\n parts.push(object);\n const array = this.arrayGroup(node, base, single === \"array\");\n if (array !== undefined)\n parts.push(array);\n typeInGroup =\n (single === \"string\" && string !== undefined) ||\n (numeric && number !== undefined) ||\n (single === \"object\" && object !== undefined) ||\n (single === \"array\" && array !== undefined);\n }\n if (types !== undefined && !typeInGroup)\n parts.unshift(typeCheck(types));\n this.inPlace(node, base, parts);\n return and(parts);\n }\n // The keywords that apply to the value itself, whatever its type.\n inPlace(node, base, parts) {\n if (Array.isArray(node.enum))\n parts.push(enumCheck(node.enum));\n if (Object.hasOwn(node, \"const\"))\n parts.push(constCheck(node.const));\n if (Array.isArray(node.allOf))\n parts.push(and(node.allOf.map((s) => this.check(s, base))));\n if (Array.isArray(node.anyOf))\n parts.push(this.union(node.anyOf, base, false));\n if (Array.isArray(node.oneOf))\n parts.push(this.union(node.oneOf, base, true));\n if (node.not !== undefined)\n parts.push(notCheck(this.check(node.not, base)));\n if (node.if !== undefined && (node.then !== undefined || node.else !== undefined)) {\n const then = node.then === undefined ? ALWAYS : this.check(node.then, base);\n const otherwise = node.else === undefined ? ALWAYS : this.check(node.else, base);\n parts.push(ifCheck(this.check(node.if, base), then, otherwise));\n }\n if (typeof node.$ref === \"string\")\n parts.push(this.ref(node.$ref, base));\n if (this.draft !== \"7\" && typeof node.$dynamicRef === \"string\") {\n parts.push(this.dynamicRef(node.$dynamicRef, base));\n }\n }\n union(branches, base, exactlyOne) {\n const checks = () => branches.map((s) => this.check(s, base));\n return (constUnion(branches, exactlyOne) ??\n this.tagged(branches, base) ??\n (exactlyOne ? oneCheck(checks()) : anyCheck(checks())));\n }\n ref(ref, base) {\n const target = this.r.resolve(ref, base);\n const check = this.check(target.node, target.base);\n return this.dynamic && target.base !== base ? scopedCheck(this.scope, target.base, check) : check;\n }\n dynamicRef(ref, base) {\n const resolved = this.bookended(ref, base);\n if (resolved === undefined)\n return this.ref(ref, base);\n const { initial, name } = resolved;\n const fallback = this.check(initial.node, initial.base);\n const lookup = this.dynamicLookup(name, (node, b) => this.check(node, b));\n const scope = this.scope;\n return (v) => {\n for (let i = 0; i < scope.length; i++) {\n const check = lookup(scope[i]);\n if (check !== null)\n return check(v);\n }\n return fallback(v);\n };\n }\n /** The initial target and anchor name of a `$dynamicRef` that resolves dynamically, or undefined for a plain ref. */\n bookended(ref, base) {\n const initial = this.r.resolve(ref, base);\n const uri = resolveUri(ref, base);\n const name = uri.slice(documentOf(uri).length + 1);\n const anchored = isSchemaObject(initial.node) && initial.node.$dynamicAnchor === name;\n if (name === \"\" || name.startsWith(\"/\") || !anchored)\n return undefined;\n if (!this.dynamic)\n throw RESTART;\n return { initial, name };\n }\n // Resolved at run time against the dynamic scope, so a schema with a bookended $dynamicRef keeps its compiler.\n dynamicLookup(name, compile) {\n const found = new Map();\n return (uri) => {\n const key = `${uri}#${name}`;\n let check = found.get(key);\n if (check === undefined) {\n const target = this.r.dynamicAnchors.get(key);\n check = target === undefined ? null : compile(target, this.r.baseOf.get(target) ?? uri);\n found.set(key, check);\n }\n return check;\n };\n }\n /** anyOf/oneOf whose branches are all objects with a distinct required const on one key: the tag picks the branch. */\n tagged(branches, base) {\n if (branches.length < 2)\n return undefined;\n const resolved = [];\n for (const branch of branches) {\n if (!isSchemaObject(branch))\n return undefined;\n const ref = typeof branch.$ref === \"string\" && Object.keys(branch).length === 1 ? branch.$ref : undefined;\n const node = ref === undefined ? branch : this.r.resolve(ref, this.r.baseFor(branch, base)).node;\n if (!isSchemaObject(node))\n return undefined;\n resolved.push(node);\n }\n const first = resolved[0].properties;\n if (!isSchemaObject(first))\n return undefined;\n for (const key of Object.keys(first)) {\n const tags = resolved.map((s) => tagOf(s, key));\n if (tags.some((t) => t === undefined) || new Set(tags).size !== tags.length)\n continue;\n return taggedCheck(key, tags, branches.map((s) => this.check(s, base)));\n }\n return undefined;\n }\n stringGroup(node, strict) {\n const min = number(node.minLength) ?? 0;\n const max = number(node.maxLength) ?? Number.POSITIVE_INFINITY;\n const re = typeof node.pattern === \"string\" ? sharedRegex(node.pattern) : undefined;\n const format = this.formats !== undefined && typeof node.format === \"string\" && Object.hasOwn(this.formats, node.format)\n ? this.formats[node.format]\n : undefined;\n if (min === 0 && max === Number.POSITIVE_INFINITY && re === undefined && format === undefined)\n return undefined;\n return stringCheck(strict, min, max, re, format);\n }\n numberGroup(node, mode) {\n const min = number(node.minimum);\n const max = number(node.maximum);\n const xmin = number(node.exclusiveMinimum);\n const xmax = number(node.exclusiveMaximum);\n const multipleOf = number(node.multipleOf);\n if ([min, max, xmin, xmax, multipleOf].every((x) => x === undefined))\n return undefined;\n const inf = Number.POSITIVE_INFINITY;\n return numberCheck(mode, min ?? -inf, max ?? inf, xmin ?? -inf, xmax ?? inf, multipleOf);\n }\n objectGroup(node, base, strict) {\n const onlyCore = OBJECT_EXTRAS.every((k) => node[k] === undefined);\n // A schema with only the core object keywords gets one closure that also does the type guard.\n const core = this.objectCore(node, base, onlyCore ? (strict ? GUARD_STRICT : GUARD_LOOSE) : GUARD_NONE);\n if (core !== undefined && onlyCore)\n return core;\n const parts = core === undefined ? [] : [core];\n if (node.propertyNames !== undefined)\n parts.push(propertyNamesCheck(this.check(node.propertyNames, base)));\n const minProperties = number(node.minProperties);\n const maxProperties = number(node.maxProperties);\n if (minProperties !== undefined || maxProperties !== undefined) {\n parts.push(propertyCountCheck(minProperties ?? 0, maxProperties ?? Number.POSITIVE_INFINITY));\n }\n const dependentRequired = [];\n const dependentSchemas = [];\n if (this.draft !== \"7\") {\n for (const [k, list] of entries(node.dependentRequired))\n if (Array.isArray(list))\n dependentRequired.push([k, list]);\n for (const [k, s] of entries(node.dependentSchemas))\n dependentSchemas.push([k, this.check(s, base)]);\n }\n for (const [k, d] of entries(node.dependencies)) {\n if (Array.isArray(d))\n dependentRequired.push([k, d]);\n else\n dependentSchemas.push([k, this.check(d, base)]);\n }\n if (dependentRequired.length > 0)\n parts.push(dependentRequiredCheck(dependentRequired));\n if (dependentSchemas.length > 0)\n parts.push(dependentSchemasCheck(dependentSchemas));\n if (parts.length === 0)\n return strict ? IS_OBJECT : undefined;\n return guardObject(and(parts), strict);\n }\n objectCore(node, base, guard) {\n const properties = isSchemaObject(node.properties) ? node.properties : {};\n const required = Array.isArray(node.required) ? node.required.filter((k) => typeof k === \"string\") : [];\n const patterns = isSchemaObject(node.patternProperties) ? node.patternProperties : {};\n const additional = node.additionalProperties;\n const keys = Object.keys(properties);\n const patternKeys = Object.keys(patterns);\n if (keys.length + required.length + patternKeys.length === 0 &&\n (additional === undefined || additional === true)) {\n return undefined;\n }\n // One array per object: key, check, flags (leaf code, required, key also names an Object.prototype member).\n const entries = [];\n for (const k of keys) {\n const check = this.check(properties[k], base);\n const flags = (LEAF_CODES.get(check) ?? 0) |\n (required.includes(k) ? REQUIRED : 0) |\n (k in Object.prototype ? INHERITED : 0);\n entries.push(k, check, flags);\n }\n const extraRequired = required.filter((k) => !Object.hasOwn(properties, k));\n const pats = patternKeys.map((p) => [sharedRegex(p), this.check(patterns[p], base)]);\n const extra = additional === undefined || additional === true ? undefined : this.check(additional, base);\n if (pats.length === 0 && extraRequired.length === 0 && (extra === undefined || additional === false)) {\n const requiredCount = keys.filter((k) => required.includes(k)).length;\n return declaredObject(entries, requiredCount, additional === false, guard);\n }\n return openObject(entries, keys, extraRequired, pats, extra, guard);\n }\n arrayGroup(node, base, strict) {\n let prefix = [];\n let rest;\n if (Array.isArray(node.items)) {\n prefix = node.items;\n rest = node.additionalItems;\n }\n else {\n if (this.draft !== \"7\" && Array.isArray(node.prefixItems))\n prefix = node.prefixItems;\n rest = node.items;\n }\n const prefixChecks = prefix.map((s) => this.check(s, base));\n const restCheck = rest === undefined || rest === true ? undefined : this.check(rest, base);\n const minItems = number(node.minItems);\n const maxItems = number(node.maxItems);\n if (node.contains === undefined &&\n node.uniqueItems !== true &&\n (prefixChecks.length > 0 || restCheck !== undefined)) {\n // The common array: one closure for the guard, the length bounds and the items.\n const guard = strict ? GUARD_STRICT : GUARD_LOOSE;\n return listCheck(guard, minItems ?? 0, maxItems ?? Number.POSITIVE_INFINITY, prefixChecks, restCheck);\n }\n const parts = [];\n if (prefixChecks.length > 0 || restCheck !== undefined)\n parts.push(itemsCheck(prefixChecks, restCheck));\n if (minItems !== undefined || maxItems !== undefined) {\n parts.push(lengthCheck(minItems ?? 0, maxItems ?? Number.POSITIVE_INFINITY));\n }\n if (node.contains !== undefined) {\n const min = this.draft === \"7\" ? 1 : (number(node.minContains) ?? 1);\n const max = this.draft === \"7\" ? Number.POSITIVE_INFINITY : (number(node.maxContains) ?? Number.POSITIVE_INFINITY);\n parts.push(containsCheck(this.check(node.contains, base), min, max));\n }\n if (node.uniqueItems === true)\n parts.push(uniqueCheck);\n if (parts.length === 0)\n return strict ? IS_ARRAY : undefined;\n return guardArray(and(parts), strict);\n }\n /** The annotating check of a schema evaluated in place (only below `unevaluatedProperties`/`unevaluatedItems`). */\n annotating(node, base) {\n if (node === true)\n return ANNOTATING_TRUE;\n if (node === false)\n return ANNOTATING_FALSE;\n if (!isSchemaObject(node))\n throw new Error(`A schema must be an object or a boolean, got ${JSON.stringify(node)}`);\n const cached = this.annotatingCache.get(node);\n if (cached !== undefined)\n return cached;\n const slot = { check: undefined };\n this.annotatingCache.set(node, indirectAnnotating(slot));\n const check = this.buildAnnotating(node, this.r.baseFor(node, base));\n slot.check = check;\n this.annotatingCache.set(node, check);\n return check;\n }\n buildAnnotating(node, base) {\n const rest = {};\n let annotates = false;\n for (const k of Object.keys(node)) {\n if (ANNOTATING.has(k))\n annotates = true;\n else\n rest[k] = node[k];\n }\n const plain = this.plain(rest, base);\n const parts = [];\n if (annotates)\n this.annotatingParts(node, base, parts);\n const all = parts.length === 0 ? ignoreAnnotations(plain) : annotateAll(plain, parts);\n const own = node.unevaluatedProperties !== undefined || node.unevaluatedItems !== undefined\n ? isolateAnnotations(all)\n : all;\n return this.dynamic && this.r.isResource(node, base) ? scopedAnnotating(this.scope, base, own) : own;\n }\n annotatingParts(node, base, parts) {\n if (node.properties !== undefined ||\n node.patternProperties !== undefined ||\n node.additionalProperties !== undefined) {\n const props = entries(node.properties).map(([k, s]) => [k, this.check(s, base)]);\n const pats = entries(node.patternProperties).map(([p, s]) => [sharedRegex(p), this.check(s, base)]);\n const extra = node.additionalProperties === undefined ? undefined : this.check(node.additionalProperties, base);\n parts.push(annotateObject(props, pats, extra));\n }\n if (node.prefixItems !== undefined || node.items !== undefined || node.contains !== undefined) {\n const prefix = Array.isArray(node.prefixItems)\n ? node.prefixItems\n : Array.isArray(node.items)\n ? node.items\n : [];\n const rest = Array.isArray(node.items) ? node.additionalItems : node.items;\n parts.push(annotateArray(prefix.map((s) => this.check(s, base)), rest === undefined ? undefined : this.check(rest, base), node.contains === undefined ? undefined : this.check(node.contains, base), number(node.minContains) ?? 1, number(node.maxContains) ?? Number.POSITIVE_INFINITY));\n }\n if (Array.isArray(node.allOf))\n for (const s of node.allOf)\n parts.push(this.annotating(s, base));\n if (Array.isArray(node.anyOf))\n parts.push(annotateAny(node.anyOf.map((s) => this.annotating(s, base)), false));\n if (Array.isArray(node.oneOf))\n parts.push(annotateAny(node.oneOf.map((s) => this.annotating(s, base)), true));\n if (node.if !== undefined) {\n const then = node.then === undefined ? undefined : this.annotating(node.then, base);\n const otherwise = node.else === undefined ? undefined : this.annotating(node.else, base);\n parts.push(annotateIf(this.annotating(node.if, base), then, otherwise));\n }\n if (typeof node.$ref === \"string\")\n parts.push(this.annotatingRef(node.$ref, base));\n if (typeof node.$dynamicRef === \"string\")\n parts.push(this.annotatingDynamicRef(node.$dynamicRef, base));\n for (const [k, s] of entries(node.dependentSchemas))\n parts.push(annotateDependent(k, this.annotating(s, base)));\n if (node.unevaluatedProperties !== undefined) {\n parts.push(unevaluatedProperties(this.check(node.unevaluatedProperties, base)));\n }\n if (node.unevaluatedItems !== undefined)\n parts.push(unevaluatedItems(this.check(node.unevaluatedItems, base)));\n }\n annotatingRef(ref, base) {\n const target = this.r.resolve(ref, base);\n const check = this.annotating(target.node, target.base);\n return this.dynamic && target.base !== base ? scopedAnnotating(this.scope, target.base, check) : check;\n }\n annotatingDynamicRef(ref, base) {\n const resolved = this.bookended(ref, base);\n if (resolved === undefined)\n return this.annotatingRef(ref, base);\n const { initial, name } = resolved;\n const fallback = this.annotating(initial.node, initial.base);\n const lookup = this.dynamicLookup(name, (node, b) => this.annotating(node, b));\n const scope = this.scope;\n return (v, a) => {\n for (let i = 0; i < scope.length; i++) {\n const check = lookup(scope[i]);\n if (check !== null)\n return check(v, a);\n }\n return fallback(v, a);\n };\n }\n}\n/** Keywords that never affect a check. */\nexport const NEUTRAL_KEYWORDS = new Set([\n \"$schema\",\n \"$comment\",\n \"title\",\n \"description\",\n \"default\",\n \"examples\",\n \"deprecated\",\n \"readOnly\",\n \"writeOnly\",\n \"$defs\",\n \"definitions\",\n \"contentEncoding\",\n \"contentMediaType\",\n \"minContains\",\n \"maxContains\",\n \"$vocabulary\",\n]);\n// The object keywords besides the core (properties, required, patternProperties, additionalProperties).\nconst OBJECT_EXTRAS = [\n \"propertyNames\",\n \"minProperties\",\n \"maxProperties\",\n \"dependentRequired\",\n \"dependentSchemas\",\n \"dependencies\",\n];\n// The keywords an annotating check handles itself; every other keyword compiles into its plain part.\nconst ANNOTATING = new Set([\n \"properties\",\n \"patternProperties\",\n \"additionalProperties\",\n \"prefixItems\",\n \"items\",\n \"additionalItems\",\n \"contains\",\n \"minContains\",\n \"maxContains\",\n \"allOf\",\n \"anyOf\",\n \"oneOf\",\n \"if\",\n \"then\",\n \"else\",\n \"$ref\",\n \"$dynamicRef\",\n \"dependentSchemas\",\n \"unevaluatedProperties\",\n \"unevaluatedItems\",\n]);\n/** anyOf/oneOf whose branches are all `{ const: primitive }`: an enum (distinct values make oneOf the same). */\nfunction constUnion(branches, exactlyOne) {\n const values = [];\n for (const branch of branches) {\n if (!isSchemaObject(branch) || !Object.hasOwn(branch, \"const\"))\n return undefined;\n for (const k of Object.keys(branch))\n if (k !== \"const\" && !NEUTRAL_KEYWORDS.has(k))\n return undefined;\n if (typeof branch.const === \"object\" && branch.const !== null)\n return undefined;\n if (exactlyOne && values.includes(branch.const))\n return undefined;\n values.push(branch.const);\n }\n return enumCheck(values);\n}\n// The tag of a tagged-union branch: a primitive const on a required property of an object schema.\nfunction tagOf(branch, key) {\n const properties = branch.properties;\n if (branch.type !== \"object\" || !Array.isArray(branch.required) || !branch.required.includes(key))\n return undefined;\n const tag = isSchemaObject(properties) ? properties[key] : undefined;\n if (!isSchemaObject(tag) || !Object.hasOwn(tag, \"const\"))\n return undefined;\n return typeof tag.const === \"object\" && tag.const !== null ? undefined : tag.const;\n}\nfunction number(value) {\n return typeof value === \"number\" ? value : undefined;\n}\nfunction entries(value) {\n return isSchemaObject(value) ? Object.entries(value) : [];\n}\n//# sourceMappingURL=compiler.js.map","// Errors of a failed value: a walk over the schema that reports each failing keyword at the value it failed on.\n// It runs only for values that failed the check, using the compiler's checks for subschemas.\nimport { newAnnotations } from \"./annotations.js\";\nimport { codePoints, constCheck, containsCheck, enumCheck, isMultiple, isObject, NEVER, TYPE_CHECKS, uniqueCheck, } from \"./checks.js\";\nimport { isSchemaObject } from \"./resolver.js\";\nimport { sharedRegex } from \"./shared.js\";\n/** Explains failures of one compiled schema. */\nexport class Explainer {\n c;\n schema;\n /**\n * The errors of `$ref` targets for object values, within one errors() call: a recursive union explains each branch\n * to pick the one to blame, and every branch would explain the same children again, exponentially in the depth.\n */\n memo = undefined;\n constructor(compiler, schema) {\n this.c = compiler;\n this.schema = schema;\n compiler.root();\n }\n /** The errors of `value`, at least one (`value` failed the check). */\n errors(value) {\n const out = [];\n try {\n this.walk(this.schema, this.c.r.rootBase, value, \"\", out);\n }\n finally {\n this.memo = undefined;\n }\n if (out.length === 0)\n out.push({ path: \"\", keyword: \"schema\", message: \"invalid\" });\n return out;\n }\n ok(node, base, v) {\n return this.c.check(node, base)(v);\n }\n // For $dynamicRef schemas this check runs outside the original dynamic scope, so their errors are approximate.\n walk(node, base, v, path, out) {\n if (node === true)\n return;\n if (node === false) {\n out.push({ path, keyword: \"false\", message: \"no value is allowed here\" });\n return;\n }\n if (!isSchemaObject(node))\n return;\n const b = this.c.r.baseFor(node, base);\n if (this.ok(node, b, v))\n return;\n const start = out.length;\n const push = (keyword, message, at = path) => {\n out.push({ path: at, keyword, message });\n };\n if (this.c.draft === \"7\" && typeof node.$ref === \"string\") {\n this.walkRef(node.$ref, b, v, path, out);\n return;\n }\n if (node.type !== undefined) {\n const types = Array.isArray(node.type) ? node.type : [node.type];\n const checks = types.map((t) => (typeof t === \"string\" ? TYPE_CHECKS.get(t) : undefined) ?? NEVER);\n if (!checks.some((check) => check(v))) {\n push(\"type\", `expected ${types.join(\" or \")}, got ${typeName(v)}`);\n return;\n }\n }\n if (Array.isArray(node.enum) && !enumCheck(node.enum)(v))\n push(\"enum\", `expected one of ${listValues(node.enum)}`);\n if (Object.hasOwn(node, \"const\") && !constCheck(node.const)(v))\n push(\"const\", `expected ${JSON.stringify(node.const)}`);\n if (typeof v === \"string\" && node.type !== \"bytes\")\n this.walkString(node, v, push);\n if (v instanceof Uint8Array && node.type === \"bytes\")\n this.walkBytes(node, v, push);\n if (typeof v === \"number\")\n this.walkNumber(node, v, push);\n if (isObject(v))\n this.walkObject(node, b, v, path, out, push);\n if (Array.isArray(v))\n this.walkArray(node, b, v, path, out, push);\n if (Array.isArray(node.allOf))\n for (const s of node.allOf)\n this.walk(s, b, v, path, out);\n if (Array.isArray(node.anyOf))\n this.walkUnion(node.anyOf, b, v, path, out, false);\n if (Array.isArray(node.oneOf))\n this.walkUnion(node.oneOf, b, v, path, out, true);\n if (node.not !== undefined && this.ok(node.not, b, v))\n push(\"not\", \"must not match the schema in not\");\n if (node.if !== undefined) {\n const branch = this.ok(node.if, b, v) ? node.then : node.else;\n if (branch !== undefined)\n this.walk(branch, b, v, path, out);\n }\n if (typeof node.$ref === \"string\")\n this.walkRef(node.$ref, b, v, path, out);\n if (out.length === start && (node.unevaluatedProperties !== undefined || node.unevaluatedItems !== undefined)) {\n this.walkUnevaluated(node, b, v, path, out);\n }\n if (out.length === start && typeof node.$dynamicRef === \"string\") {\n push(\"$dynamicRef\", \"does not match the dynamically referenced schema\");\n }\n }\n walkRef(ref, base, v, path, out) {\n const target = this.c.r.resolve(ref, base);\n if (target.node === false && this.c.r.isUnresolved(ref, base)) {\n out.push({ path, keyword: \"$ref\", message: `unresolved reference ${ref}` });\n return;\n }\n if (!isSchemaObject(target.node) || typeof v !== \"object\" || v === null) {\n this.walk(target.node, target.base, v, path, out);\n return;\n }\n this.memo ??= new Map();\n let values = this.memo.get(target.node);\n const known = values?.get(v);\n if (known !== undefined && known.path === path) {\n out.push(...known.errors);\n return;\n }\n const errors = [];\n this.walk(target.node, target.base, v, path, errors);\n if (values === undefined) {\n values = new Map();\n this.memo.set(target.node, values);\n }\n values.set(v, { path, errors });\n out.push(...errors);\n }\n walkString(node, v, push) {\n const n = codePoints(v);\n if (typeof node.minLength === \"number\" && n < node.minLength) {\n push(\"minLength\", `expected at least ${node.minLength} characters`);\n }\n if (typeof node.maxLength === \"number\" && n > node.maxLength) {\n push(\"maxLength\", `expected at most ${node.maxLength} characters`);\n }\n if (typeof node.pattern === \"string\" && !sharedRegex(node.pattern).test(v)) {\n push(\"pattern\", `expected to match ${node.pattern}`);\n }\n const formats = this.c.formats;\n const format = formats !== undefined && typeof node.format === \"string\" && Object.hasOwn(formats, node.format)\n ? formats[node.format]\n : undefined;\n if (format !== undefined && !format(v))\n push(\"format\", `expected format ${node.format}`);\n }\n walkBytes(node, v, push) {\n if (typeof node.minLength === \"number\" && v.length < node.minLength) {\n push(\"minLength\", `expected at least ${node.minLength} bytes`);\n }\n if (typeof node.maxLength === \"number\" && v.length > node.maxLength) {\n push(\"maxLength\", `expected at most ${node.maxLength} bytes`);\n }\n }\n walkNumber(node, v, push) {\n if (typeof node.minimum === \"number\" && v < node.minimum)\n push(\"minimum\", `expected >= ${node.minimum}`);\n if (typeof node.maximum === \"number\" && v > node.maximum)\n push(\"maximum\", `expected <= ${node.maximum}`);\n if (typeof node.exclusiveMinimum === \"number\" && v <= node.exclusiveMinimum) {\n push(\"exclusiveMinimum\", `expected > ${node.exclusiveMinimum}`);\n }\n if (typeof node.exclusiveMaximum === \"number\" && v >= node.exclusiveMaximum) {\n push(\"exclusiveMaximum\", `expected < ${node.exclusiveMaximum}`);\n }\n if (typeof node.multipleOf === \"number\" && !isMultiple(v, node.multipleOf)) {\n push(\"multipleOf\", `expected a multiple of ${node.multipleOf}`);\n }\n }\n walkObject(node, b, v, path, out, push) {\n const properties = isSchemaObject(node.properties) ? node.properties : {};\n const required = Array.isArray(node.required) ? node.required : [];\n for (const k of required) {\n if (typeof k === \"string\" && (!Object.hasOwn(v, k) || v[k] === undefined))\n push(\"required\", \"missing\", pointer(path, k));\n }\n for (const k of Object.keys(properties)) {\n if (Object.hasOwn(v, k) && v[k] !== undefined)\n this.walk(properties[k], b, v[k], pointer(path, k), out);\n }\n const patterns = isSchemaObject(node.patternProperties) ? Object.entries(node.patternProperties) : [];\n for (const k of Object.keys(v)) {\n let matched = Object.hasOwn(properties, k);\n for (const [p, s] of patterns) {\n if (sharedRegex(p).test(k)) {\n matched = true;\n this.walk(s, b, v[k], pointer(path, k), out);\n }\n }\n if (!matched && node.additionalProperties !== undefined) {\n if (node.additionalProperties === false)\n push(\"additionalProperties\", \"unknown field\", pointer(path, k));\n else\n this.walk(node.additionalProperties, b, v[k], pointer(path, k), out);\n }\n if (node.propertyNames !== undefined && !this.ok(node.propertyNames, b, k)) {\n push(\"propertyNames\", \"invalid property name\", pointer(path, k));\n }\n }\n const count = Object.keys(v).length;\n if (typeof node.minProperties === \"number\" && count < node.minProperties) {\n push(\"minProperties\", `expected at least ${node.minProperties} properties`);\n }\n if (typeof node.maxProperties === \"number\" && count > node.maxProperties) {\n push(\"maxProperties\", `expected at most ${node.maxProperties} properties`);\n }\n const dependencies = {\n ...(this.c.draft === \"7\" || !isSchemaObject(node.dependentRequired) ? {} : node.dependentRequired),\n ...(isSchemaObject(node.dependencies) ? node.dependencies : {}),\n };\n for (const [k, d] of Object.entries(dependencies)) {\n if (!Object.hasOwn(v, k))\n continue;\n if (!Array.isArray(d))\n this.walk(d, b, v, path, out);\n else\n for (const r of d)\n if (!Object.hasOwn(v, r))\n push(\"dependentRequired\", `required when ${k} is present`, pointer(path, r));\n }\n if (this.c.draft !== \"7\" && isSchemaObject(node.dependentSchemas)) {\n for (const [k, s] of Object.entries(node.dependentSchemas))\n if (Object.hasOwn(v, k))\n this.walk(s, b, v, path, out);\n }\n }\n walkArray(node, b, v, path, out, push) {\n let prefix = [];\n let rest;\n if (Array.isArray(node.items)) {\n prefix = node.items;\n rest = node.additionalItems;\n }\n else {\n if (this.c.draft !== \"7\" && Array.isArray(node.prefixItems))\n prefix = node.prefixItems;\n rest = node.items;\n }\n for (let i = 0; i < v.length; i++) {\n const s = i < prefix.length ? prefix[i] : rest;\n if (s !== undefined)\n this.walk(s, b, v[i], `${path}/${i}`, out);\n }\n if (typeof node.minItems === \"number\" && v.length < node.minItems) {\n push(\"minItems\", `expected at least ${node.minItems} items`);\n }\n if (typeof node.maxItems === \"number\" && v.length > node.maxItems) {\n push(\"maxItems\", `expected at most ${node.maxItems} items`);\n }\n if (node.uniqueItems === true && !uniqueCheck(v))\n push(\"uniqueItems\", \"expected unique items\");\n if (node.contains !== undefined) {\n const draft7 = this.c.draft === \"7\";\n const min = draft7 || typeof node.minContains !== \"number\" ? 1 : node.minContains;\n const max = draft7 || typeof node.maxContains !== \"number\" ? Number.POSITIVE_INFINITY : node.maxContains;\n if (!containsCheck(this.c.check(node.contains, b), min, max)(v)) {\n push(\"contains\", containsMessage(min, max));\n }\n }\n }\n walkUnion(branches, b, v, path, out, exactlyOne) {\n const matches = branches.filter((s) => this.ok(s, b, v)).length;\n if (matches === 1 || (!exactlyOne && matches > 0))\n return;\n const keyword = exactlyOne ? \"oneOf\" : \"anyOf\";\n if (matches > 1) {\n out.push({ path, keyword, message: \"matches more than one alternative\" });\n return;\n }\n // A tagged union reports the branch its tag selects; otherwise the branch whose first error is deepest.\n const tag = this.tagOf(branches, b);\n if (tag !== undefined && isObject(v)) {\n const i = tag.values.indexOf(v[tag.key]);\n if (i < 0)\n out.push({\n path: pointer(path, tag.key),\n keyword,\n message: `expected one of ${listValues(tag.values)}`,\n });\n else\n this.walk(branches[i], b, v, path, out);\n return;\n }\n // An object is blamed on the branch that declares most of its properties (the one it was most likely meant for),\n // then on the branch whose first error is deepest.\n let best;\n for (const s of branches) {\n const errors = [];\n this.walk(s, b, v, path, errors);\n if (errors.length === 0)\n continue;\n const declared = isObject(v) ? this.declaredKeys(s, b, v) : 0;\n const better = best === undefined ||\n declared > best.declared ||\n (declared === best.declared && errors[0].path.length > best.errors[0].path.length);\n if (better)\n best = { errors, declared };\n }\n out.push(...(best?.errors ?? [{ path, keyword, message: \"matches no alternative\" }]));\n }\n /** How many of the keys of `v` the branch `s` (through a `$ref`) declares in `properties`. */\n declaredKeys(s, b, v) {\n const node = isSchemaObject(s) && typeof s.$ref === \"string\" ? this.c.r.resolve(s.$ref, b).node : s;\n const properties = isSchemaObject(node) && isSchemaObject(node.properties) ? node.properties : {};\n return Object.keys(v).filter((k) => Object.hasOwn(properties, k)).length;\n }\n tagOf(branches, b) {\n const resolved = branches.map((s) => isSchemaObject(s) && typeof s.$ref === \"string\" ? this.c.r.resolve(s.$ref, b).node : s);\n const first = resolved[0];\n if (!isSchemaObject(first) || !isSchemaObject(first.properties))\n return undefined;\n for (const key of Object.keys(first.properties)) {\n const values = resolved.map((s) => {\n const tag = isSchemaObject(s) && isSchemaObject(s.properties) ? s.properties[key] : undefined;\n return isSchemaObject(tag) ? tag.const : undefined;\n });\n const primitive = values.every((x) => x !== undefined && (typeof x !== \"object\" || x === null));\n if (primitive && new Set(values).size === values.length)\n return { key, values };\n }\n return undefined;\n }\n walkUnevaluated(node, b, v, path, out) {\n const { unevaluatedProperties, unevaluatedItems, ...rest } = node;\n const a = newAnnotations();\n this.c.annotating(rest, b)(v, a);\n if (isObject(v) && unevaluatedProperties !== undefined && !a.allProps) {\n for (const k of Object.keys(v)) {\n if (a.props?.has(k))\n continue;\n if (unevaluatedProperties === false) {\n out.push({ path: pointer(path, k), keyword: \"unevaluatedProperties\", message: \"unknown field\" });\n }\n else\n this.walk(unevaluatedProperties, b, v[k], pointer(path, k), out);\n }\n }\n if (Array.isArray(v) && unevaluatedItems !== undefined && !a.allItems) {\n for (let i = a.items; i < v.length; i++) {\n if (a.indexes?.has(i))\n continue;\n if (unevaluatedItems === false) {\n out.push({ path: `${path}/${i}`, keyword: \"unevaluatedItems\", message: \"unexpected item\" });\n }\n else\n this.walk(unevaluatedItems, b, v[i], `${path}/${i}`, out);\n }\n }\n }\n}\n// Enum errors name the allowed values; a long list (an enum of thousands) is cut, so the message stays readable.\nconst LISTED_VALUES = 20;\n/** `values` as JSON, at most LISTED_VALUES of them, then how many more there are. */\nfunction listValues(values) {\n if (values.length <= LISTED_VALUES)\n return JSON.stringify(values);\n const listed = JSON.stringify(values.slice(0, LISTED_VALUES));\n return `${listed.slice(0, -1)}, ... and ${values.length - LISTED_VALUES} more]`;\n}\nfunction containsMessage(min, max) {\n if (max === Number.POSITIVE_INFINITY)\n return `expected at least ${min} matching ${min === 1 ? \"item\" : \"items\"}`;\n if (min === 0)\n return `expected at most ${max} matching ${max === 1 ? \"item\" : \"items\"}`;\n return `expected between ${min} and ${max} matching items`;\n}\nfunction pointer(path, key) {\n return `${path}/${String(key).replace(/~/g, \"~0\").replace(/\\//g, \"~1\")}`;\n}\nfunction typeName(v) {\n if (v === null)\n return \"null\";\n if (Array.isArray(v))\n return \"array\";\n if (v instanceof Uint8Array)\n return \"bytes\";\n if (typeof v === \"number\" && Number.isInteger(v))\n return \"integer\";\n return typeof v;\n}\n//# sourceMappingURL=explain.js.map","// compile(): a schema to a Validator, whose `check` is the fast boolean path and whose `errors` explains failures.\nimport { Coercer } from \"./coerce.js\";\nimport { Compiler, RESTART } from \"./compiler.js\";\nimport { Explainer } from \"./explain.js\";\nexport function compile(schema, options = NO_OPTIONS) {\n const check = compileCheck(schema, options);\n return options.coerce === true\n ? new CoercingValidator(schema, options, check)\n : new Validator(schema, options, check);\n}\nconst NO_OPTIONS = Object.freeze({});\n/** A compiled schema whose valid values have type `T` (`unknown` unless the schema was built with the builders). */\nexport class Validator {\n /** Whether `value` is valid. A plain function: it may be passed around without its validator. */\n check;\n schema;\n options;\n explainer = undefined;\n constructor(schema, options, check) {\n // A compiled check is exactly the test that a value has the schema's static type.\n this.check = check;\n this.schema = schema;\n this.options = options;\n }\n /**\n * Why `value` is invalid: one error per failing keyword, `[]` when it is valid. Built on the first failure and\n * kept, so a validator whose values always pass never pays for it.\n */\n errors(value) {\n if (this.check(value))\n return [];\n this.explainer ??= new Explainer(compiler(this.schema, this.options), this.schema);\n return this.explainer.errors(value);\n }\n}\n/** A validator compiled with `coerce: true`: it also coerces loosely typed input towards the schema. */\nexport class CoercingValidator extends Validator {\n coercer = undefined;\n /**\n * `value` coerced towards the schema: numeric strings to numbers, `\"true\"` to `true`, a single value to a one-item\n * array, an optional `null` dropped, the first union branch the value converts to (the README lists every rule).\n * Only the changed paths are copied; `value` comes back itself when nothing changes, and is never modified. Values\n * that cannot be coerced stay as they are. The rules are built on the first call.\n */\n coerce(value) {\n this.coercer ??= new Coercer(compiler(this.schema, this.options), this.schema);\n return this.coercer.coerce(value);\n }\n /** Coerces `value`, then checks it: the coerced value when it is valid, else its errors. */\n parse(value) {\n const coerced = this.coerce(value);\n return this.check(coerced) ? { ok: true, value: coerced } : { ok: false, errors: this.errors(coerced) };\n }\n}\nfunction compileCheck(schema, options) {\n return compiler(schema, options).root();\n}\n// Most schemas compile without tracking the dynamic scope; one with a bookended $dynamicRef compiles again with it.\nfunction compiler(schema, options) {\n const plain = new Compiler(schema, options, false);\n try {\n plain.root();\n return plain;\n }\n catch (error) {\n if (error !== RESTART)\n throw error;\n return new Compiler(schema, options, true);\n }\n}\n//# sourceMappingURL=validator.js.map"],"x_google_ignoreList":[0,1,2,3,4,5,6,7],"mappings":";;AAGA,MAAa,eAAe;;;;;AAK5B,IAAa,WAAb,MAAsB;CAClB;CACA;;CAEA,yBAAS,IAAI,KAAK;;CAElB,iCAAiB,IAAI,KAAK;CAC1B;CACA;CACA,2BAAW,IAAI,KAAK;CACpB;;CAEA,6BAAa,IAAI,KAAK;CACtB,4BAAY,IAAI,KAAK;CACrB,0BAAU,IAAI,KAAK;CACnB,UAAU;CACV,YAAY,MAAM,SAAS;AACvB,OAAK,QAAQ,QAAQ,UAAU,MAAM,MAAM;AAC3C,OAAK,OAAO;AACZ,OAAK,UAAU;AACf,OAAK,mBAAmB,QAAQ,mBAAmB;AACnD,OAAK,WAAW,eAAe,KAAK,GAAG,KAAK,QAAQ,MAAM,aAAa,GAAG;;;;;;CAM9E,QAAQ,MAAM,MAAM;EAChB,MAAM,UAAU,KAAK,OAAO,IAAI,KAAK;AACrC,MAAI,YAAY,OACZ,QAAO;EACX,MAAM,KAAK,KAAK;AAChB,MAAI,OAAO,OAAO,SACd,QAAO;AACX,MAAI,KAAK,UAAU,QAAQ,OAAO,KAAK,SAAS,YAAY,GAAG,WAAW,IAAI,EAC1E,QAAO;AACX,SAAO,WAAW,WAAW,IAAI,KAAK,CAAC;;;CAG3C,gBAAgB;AACZ,MAAI,KAAK,QACL;AACJ,OAAK,UAAU;AACf,OAAK,MAAM,CAAC,KAAK,WAAW,OAAO,QAAQ,KAAK,QAAQ,WAAW,EAAE,CAAC,CAClE,MAAK,SAAS,IAAI,WAAW,WAAW,KAAK,aAAa,CAAC,EAAE,OAAO;AAExE,OAAK,UAAU,IAAI,cAAc,KAAK,KAAK;AAC3C,OAAK,MAAM,KAAK,MAAM,aAAa;;;;;;CAMvC,QAAQ,KAAK,MAAM;AACf,OAAK,eAAe;AACpB,MAAI,CAAC,KAAK,iBACN,QAAO,KAAK,KAAK,KAAK,KAAK;AAC/B,MAAI;AACA,UAAO,KAAK,KAAK,KAAK,KAAK;UAEzB;AACF,QAAK,WAAW,IAAI,WAAW,KAAK,KAAK,CAAC;AAC1C,UAAO;IAAE,MAAM;IAAO;IAAM;;;;CAIpC,aAAa,KAAK,MAAM;AACpB,SAAO,KAAK,WAAW,IAAI,WAAW,KAAK,KAAK,CAAC;;CAErD,KAAK,KAAK,MAAM;EACZ,MAAM,MAAM,WAAW,KAAK,KAAK;EACjC,MAAM,MAAM,WAAW,IAAI;EAC3B,MAAM,WAAW,IAAI,SAAS,IAAI,SAAS,mBAAmB,IAAI,MAAM,IAAI,SAAS,EAAE,CAAC,GAAG;EAC3F,MAAM,OAAO,KAAK,UAAU,IAAI,IAAI,GAAG,KAAK,UAAU,IAAI,IAAI,GAAG,KAAK,KAAK,IAAI;AAC/E,MAAI,SAAS,OACT,OAAM,IAAI,MAAM,mBAAmB,IAAI,6BAA6B,IAAI,GAAG;AAC/E,MAAI,aAAa,GACb,QAAO;GAAE,MAAM;GAAM,MAAM;GAAK;AACpC,MAAI,SAAS,WAAW,IAAI,CACxB,QAAO,KAAK,QAAQ,MAAM,KAAK,SAAS;EAC5C,MAAM,SAAS,KAAK,QAAQ,IAAI,GAAG,IAAI,GAAG,WAAW;AACrD,MAAI,WAAW,OACX,OAAM,IAAI,MAAM,mBAAmB,IAAI,cAAc,SAAS,MAAM,IAAI,GAAG;AAC/E,SAAO;GAAE,MAAM;GAAQ,MAAM,KAAK,OAAO,IAAI,OAAO,IAAI;GAAK;;;CAGjE,WAAW,MAAM,MAAM;AACnB,OAAK,eAAe;AACpB,SAAO,KAAK,UAAU,IAAI,KAAK,KAAK;;CAGxC,MAAM,MAAM,MAAM;AACd,MAAI,CAAC,eAAe,KAAK,IAAI,KAAK,OAAO,IAAI,KAAK,CAC9C;EACJ,IAAI,IAAI;EAER,MAAM,UAAU,KAAK,UAAU,OAAO,OAAO,KAAK,SAAS;AAC3D,MAAI,CAAC,WAAW,OAAO,KAAK,QAAQ,SAChC,KAAI,KAAK,UAAU,OAAO,KAAK,IAAI,WAAW,IAAI,CAC9C,MAAK,QAAQ,IAAI,WAAW,EAAE,GAAG,KAAK,KAAK,KAAK;OAC/C;GACD,MAAM,MAAM,WAAW,KAAK,KAAK,EAAE;AACnC,OAAI,WAAW,IAAI;AACnB,QAAK,UAAU,IAAI,GAAG,KAAK;AAC3B,OAAI,IAAI,SAAS,EAAE,SAAS,EACxB,MAAK,QAAQ,IAAI,KAAK,KAAK;;AAGvC,OAAK,OAAO,IAAI,MAAM,EAAE;AACxB,MAAI,QACA;AACJ,MAAI,KAAK,UAAU,KAAK;AACpB,OAAI,OAAO,KAAK,YAAY,SACxB,MAAK,QAAQ,IAAI,GAAG,EAAE,GAAG,KAAK,WAAW,KAAK;AAClD,OAAI,OAAO,KAAK,mBAAmB,UAAU;AACzC,SAAK,QAAQ,IAAI,GAAG,EAAE,GAAG,KAAK,kBAAkB,KAAK;AACrD,SAAK,eAAe,IAAI,GAAG,EAAE,GAAG,KAAK,kBAAkB,KAAK;;;AAGpE,OAAK,MAAM,OAAO,gBACd,MAAK,MAAM,KAAK,MAAM,EAAE;AAC5B,OAAK,MAAM,OAAO,cAAc;GAC5B,MAAM,MAAM,KAAK;AACjB,OAAI,eAAe,IAAI,CACnB,MAAK,MAAM,KAAK,OAAO,KAAK,IAAI,CAC5B,MAAK,MAAM,IAAI,IAAI,EAAE;;AAEjC,OAAK,MAAM,OAAO,gBAAgB;GAC9B,MAAM,OAAO,KAAK;AAClB,OAAI,MAAM,QAAQ,KAAK,CACnB,MAAK,MAAM,KAAK,KACZ,MAAK,MAAM,GAAG,EAAE;;;CAGhC,KAAK,KAAK;EACN,MAAM,SAAS,KAAK,SAAS,IAAI,IAAI;AACrC,MAAI,WAAW,OACX,QAAO;AACX,OAAK,UAAU,IAAI,KAAK,OAAO;AAC/B,OAAK,MAAM,QAAQ,IAAI;AACvB,SAAO;;CAEX,QAAQ,MAAM,MAAM,UAAU;EAC1B,IAAI,OAAO;EACX,IAAI,IAAI;AACR,OAAK,MAAM,OAAO,SAAS,MAAM,IAAI,CAAC,MAAM,EAAE,EAAE;GAC5C,MAAM,MAAM,IAAI,QAAQ,OAAO,IAAI,CAAC,QAAQ,OAAO,IAAI;AACvD,UACI,OAAO,SAAS,YAAY,SAAS,QAAQ,OAAO,OAAO,MAAM,IAAI,GAC/D,KAAK,OACL;AACV,OAAI,SAAS,OACT,OAAM,IAAI,MAAM,oBAAoB,SAAS,MAAM,OAAO;AAC9D,OAAI,OAAO,SAAS,YAAY,SAAS,KACrC,KAAI,KAAK,OAAO,IAAI,KAAK,IAAI;;AAErC,SAAO;GAAE;GAAM,MAAM;GAAG;;;AAGhC,MAAM,kBAAkB;CACpB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACH;AACD,MAAM,eAAe;CAAC;CAAc;CAAqB;CAAS;CAAe;CAAoB;CAAe;AACpH,MAAM,iBAAiB;CAAC;CAAS;CAAS;CAAS;CAAe;CAAQ;;AAE1E,SAAgB,eAAe,OAAO;AAClC,QAAO,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,MAAM;;;AAG/E,SAAgB,WAAW,KAAK,MAAM;AAClC,KAAI;AACA,SAAO,IAAI,IAAI,KAAK,KAAK,CAAC;SAExB;AACF,SAAO,IAAI,WAAW,IAAI,GAAG,WAAW,KAAK,GAAG,MAAM;;;;AAI9D,SAAgB,WAAW,KAAK;CAC5B,MAAM,OAAO,IAAI,QAAQ,IAAI;AAC7B,QAAO,OAAO,IAAI,MAAM,IAAI,MAAM,GAAG,KAAK;;;;;;;;;;AC/L9C,SAAgB,YAAY,QAAQ;CAChC,MAAM,MAAM,QAAQ,IAAI,OAAO,EAAE,OAAO;AACxC,KAAI,QAAQ,OACR,QAAO;CACX,IAAI;AACJ,KAAI;AACA,OAAK,IAAI,OAAO,QAAQ,IAAI;SAE1B;AACF,OAAK,IAAI,OAAO,OAAO;;AAE3B,SAAQ,IAAI,QAAQ,IAAI,QAAQ,GAAG,CAAC;AACpC,cAAa,SAAS,IAAI,OAAO;AACjC,QAAO;;AAEX,MAAM,0BAAU,IAAI,KAAK;AACzB,MAAM,eAAe,IAAI,sBAAsB,WAAW;AACtD,KAAI,QAAQ,IAAI,OAAO,EAAE,OAAO,KAAK,OACjC,SAAQ,OAAO,OAAO;EAC5B;;;;;ACNF,IAAa,UAAb,MAAqB;CACjB;CACA;;;;;;;;CAQA,UAAU,EAAE;;CAEZ,OAAO;;;;;CAKP,OAAO;CACP,YAAY,YAAU,QAAQ;AAC1B,OAAK,IAAIA;AACT,OAAK,SAAS;;;CAGlB,OAAO,OAAO;EACV,MAAM,OAAO,KAAK,EAAE,EAAE;EACtB,MAAM,eAAe,KAAK,kBAAkB,OAAO,KAAK,QAAQ,KAAK;AACrE,SAAO,KAAK,YAAY,KAAK,YAAY,aAAa,EAAE,KAAK,QAAQ,KAAK;;;CAG9E,YAAY,OAAO;AACf,MAAI;AACA,UAAO,KAAK,QAAQ,KAAK,QAAQ,KAAK,EAAE,EAAE,UAAU,MAAM;YAEtD;AACJ,QAAK,OAAO;AACZ,QAAK,OAAO;;;;CAIpB,QAAQ,MAAM,MAAM,OAAO,SAAS;EAChC,MAAM,UAAU,KAAK;AACrB,OAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK,EACrC,KAAI,QAAQ,OAAO,QAAQ,OAAO,GAAG,QAAQ,IAAI,IAAI,MAAM,EAAE;AACzD,QAAK;AACL,UAAO;;EAGf,MAAM,OAAO,UAAU,KAAK,MAAM,IAAI,KAAK,GAAG;AAC9C,MAAI,MAAM,IAAI,MAAM,CAChB,QAAO,KAAK,IAAI,MAAM;EAC1B,MAAM,OAAO,KAAK;AAClB,UAAQ,KAAK,MAAM,MAAM;EACzB,IAAI;AACJ,MAAI;AACA,YAAS,KAAK,QAAQ,MAAM,MAAM,MAAM;YAEpC;AACJ,WAAQ,UAAU;;AAEtB,MAAI,WAAW,KAAK,SAAS,MAAM;AAC/B,QAAK,yBAAS,IAAI,KAAK;GACvB,IAAI,SAAS,KAAK,KAAK,IAAI,KAAK;AAChC,OAAI,WAAW,QAAW;AACtB,6BAAS,IAAI,KAAK;AAClB,SAAK,KAAK,IAAI,MAAM,OAAO;;AAE/B,UAAO,IAAI,OAAO,OAAO;;AAE7B,SAAO;;;CAGX,OAAO,MAAM,MAAM,OAAO;AACtB,MAAI;AACA,UAAO,KAAK,EAAE,MAAM,MAAM,KAAK,OAAO,MAAM,KAAK,CAAC,CAAC,MAAM;UAEvD;AACF;;;CAGR,OAAO,MAAM,MAAM;AACf,SAAO,eAAe,KAAK,GAAI,KAAK,EAAE,EAAE,OAAO,IAAI,KAAK,IAAI,OAAQ;;CAKxE,kBAAkB,OAAO,QAAQ,MAAM;AACnC,MAAI,CAAC,eAAe,OAAO,CACvB,QAAO;EACX,MAAM,IAAI,KAAK,OAAO,QAAQ,KAAK;AACnC,MAAI,MAAM,QAAQ,MAAM,CACpB,QAAO,SAAS,QAAQ,MAAM,MAAM;GAChC,MAAM,aAAa,aAAa,QAAQ,EAAE;AAC1C,UAAO,eAAe,SAAY,OAAO,KAAK,kBAAkB,MAAM,YAAY,EAAE;IACtF;AAEN,MAAI,CAAC,cAAc,MAAM,CACrB,QAAO;EACX,MAAM,aAAa,eAAe,OAAO,WAAW,GAAG,OAAO,aAAa,EAAE;EAC7E,MAAM,WAAW,eAAe,OAAO,kBAAkB,GACnD,OAAO,QAAQ,OAAO,kBAAkB,CAAC,KAAK,CAAC,SAAS,UAAU,CAAC,YAAY,QAAQ,EAAE,KAAK,CAAC,GAC/F,EAAE;EACR,MAAM,aAAa,eAAe,OAAO,qBAAqB,GAAG,OAAO,uBAAuB;AAC/F,MAAI,SAAS,WAAW,KAAK,eAAe,UAAa,CAAC,eAAe,OAAO,WAAW,CACvF,QAAO;EACX,MAAM,WAAW,IAAI,IAAI,MAAM,QAAQ,OAAO,SAAS,GAAG,OAAO,WAAW,EAAE,CAAC;EAC/E,IAAI;EACJ,MAAM,OAAO,KAAK,SAAS;AACvB,OAAI,UAAU,OAAO,OAAO,KACxB;AACJ,WAAQ,EAAE,GAAG,OAAO;AACpB,OAAI,OAAO;;AAEf,OAAK,MAAM,CAAC,KAAK,aAAa,OAAO,QAAQ,WAAW,EAAE;AACtD,OAAI,CAAC,OAAO,OAAO,OAAO,IAAI,CAC1B;GACJ,MAAM,QAAQ,eAAe,SAAS,IAAI,OAAO,SAAS,SAAS;AACnE,OAAI,MAAM,SAAS,QAAQ,CAAC,SAAS,IAAI,IAAI,IAAI,CAAC,SAAS,KAAK,OAAO,UAAU,GAAG,KAAK,KAAK,OAAO;AACjG,YAAQ,EAAE,GAAG,OAAO;AACpB,WAAO,IAAI;AACX;;AAEJ,OAAI,KAAK,KAAK,kBAAkB,MAAM,MAAM,UAAU,EAAE,CAAC;;AAI7D,MAAI,SAAS,SAAS,KAAK,eAAe,OACtC,MAAK,MAAM,OAAO,OAAO,KAAK,MAAM,EAAE;GAClC,IAAI,UAAU,OAAO,OAAO,YAAY,IAAI;AAC5C,QAAK,MAAM,CAAC,SAAS,SAAS,UAAU;AACpC,QAAI,CAAC,QAAQ,KAAK,IAAI,CAClB;AACJ,cAAU;AACV,QAAI,KAAK,KAAK,mBAAmB,OAAO,OAAO,MAAM,MAAM,EAAE,CAAC;;AAElE,OAAI,CAAC,WAAW,eAAe,OAC3B,KAAI,KAAK,KAAK,kBAAkB,MAAM,MAAM,YAAY,EAAE,CAAC;;AAGvE,SAAO,OAAO;;CAKlB,QAAQ,MAAM,MAAM,OAAO;AACvB,MAAI,CAAC,eAAe,KAAK,CACrB,QAAO;EACX,MAAM,IAAI,KAAK,OAAO,MAAM,KAAK;AACjC,MAAI,OAAO,KAAK,SAAS,UAAU;GAC/B,IAAI;AACJ,OAAI;AACA,aAAS,KAAK,EAAE,EAAE,QAAQ,KAAK,MAAM,EAAE;WAErC;AACF,WAAO;;AAEX,UAAO,eAAe,OAAO,KAAK,GAAG,KAAK,QAAQ,OAAO,MAAM,OAAO,MAAM,OAAO,KAAK,GAAG;;AAE/F,SAAO,KAAK,YAAY,MAAM,GAAG,MAAM;;;CAG3C,YAAY,MAAM,GAAG,OAAO;AACxB,MAAI,OAAO,OAAO,MAAM,QAAQ,CAC5B,QAAO,eAAe,KAAK,OAAO,MAAM;AAC5C,MAAI,MAAM,QAAQ,KAAK,KAAK,CACxB,QAAO,KAAK,YAAY,MAAM,KAAK,MAAM,GAAG,MAAM;AAGtD,MAAI,MAAM,QAAQ,KAAK,MAAM,CACzB,QAAO,KAAK,aAAa,MAAM,KAAK,OAAO,GAAG,MAAM;AACxD,MAAI,MAAM,QAAQ,KAAK,MAAM,CACzB,QAAO,KAAK,aAAa,MAAM,KAAK,OAAO,GAAG,MAAM;AACxD,MAAI,MAAM,QAAQ,KAAK,MAAM,EAAE;GAC3B,IAAI,OAAO;AACX,QAAK,MAAM,UAAU,KAAK,MACtB,QAAO,KAAK,QAAQ,QAAQ,GAAG,KAAK;AACxC,UAAO,KAAK,eAAe,MAAM,GAAG,KAAK;;AAE7C,UAAQ,KAAK,MAAb;GACI,KAAK,SACD,QAAO,QAAQ,UAAU,MAAM,EAAE,MAAM;GAC3C,KAAK,SACD,QAAO,QAAQ,UAAU,MAAM,EAAE,MAAM;GAC3C,KAAK,WAAW;IACZ,MAAM,SAAS,UAAU,MAAM;AAC/B,WAAO,WAAW,SAAY,QAAQ,KAAK,MAAM,OAAO,MAAM;;GAElE,KAAK,UACD,QAAO,QAAQ,WAAW,MAAM,EAAE,MAAM;GAC5C,KAAK,OACD,QAAO,QAAQ,QAAQ,MAAM,EAAE,MAAM;GACzC,KAAK,QACD,QAAO,KAAK,aAAa,MAAM,GAAG,MAAM;GAC5C,KAAK,SACD,QAAO,KAAK,cAAc,MAAM,GAAG,MAAM;GAC7C,KAAK;AACD,QAAI,KAAK,eAAe,UAAa,KAAK,sBAAsB,OAC5D,QAAO,KAAK,cAAc,MAAM,GAAG,MAAM;AAE7C,QAAI,KAAK,UAAU,UAAa,KAAK,gBAAgB,OACjD,QAAO,KAAK,aAAa,MAAM,GAAG,MAAM;AAC5C,WAAO;GACX,QACI,QAAO;;;;CAInB,YAAY,MAAM,QAAQ,MAAM,OAAO;AACnC,MAAI,OAAO,MAAM,WAAW,WAAW,MAAM,CACzC,QAAO;AACX,OAAK,MAAM,UAAU,QAAQ;GACzB,MAAM,YAAY,eAAe,QAAQ,MAAM;AAC/C,OAAI,cAAc,SAAS,KAAK,OAAO,MAAM,MAAM,UAAU,KAAK,KAC9D,QAAO;;AAEf,SAAO;;;;;;;;CAQX,aAAa,MAAM,UAAU,MAAM,OAAO;AACtC,MAAI,SAAS,MAAM,WAAW,KAAK,OAAO,QAAQ,MAAM,MAAM,KAAK,KAAK,CACpE,QAAO,KAAK,eAAe,MAAM,MAAM,MAAM;AACjD,OAAK,MAAM,UAAU,UAAU;GAC3B,MAAM,YAAY,KAAK,eAAe,MAAM,MAAM,KAAK,QAAQ,QAAQ,MAAM,MAAM,CAAC;AACpF,OAAI,KAAK,OAAO,MAAM,MAAM,UAAU,KAAK,KACvC,QAAO;;AAEf,SAAO,KAAK,eAAe,MAAM,MAAM,MAAM;;;CAGjD,eAAe,MAAM,MAAM,OAAO;AAI9B,SAHiB,KAAK,eAAe,UACjC,KAAK,sBAAsB,UAC3B,KAAK,yBAAyB,SAChB,KAAK,cAAc,MAAM,MAAM,MAAM,GAAG;;CAE9D,aAAa,MAAM,MAAM,OAAO;EAC5B,MAAM,SAAS,MAAM,QAAQ,KAAK,MAAM,GAClC,KAAK,QACL,MAAM,QAAQ,KAAK,YAAY,GAC3B,KAAK,cACL;AACV,MAAI,WAAW,QAAW;AAEtB,OAAI,CAAC,MAAM,QAAQ,MAAM,CACrB,QAAO;GACX,MAAM,OAAO,MAAM,QAAQ,KAAK,MAAM,GAAG,SAAY,KAAK;AAC1D,UAAO,SAAS,QAAQ,QAAM,MAAM;IAChC,MAAM,SAAS,IAAI,OAAO,SAAS,OAAO,KAAK;AAC/C,WAAO,WAAW,SAAYC,SAAO,KAAK,QAAQ,QAAQ,MAAMA,OAAK;KACvE;;AAEN,MAAI,MAAM,QAAQ,MAAM,CACpB,QAAO,KAAK,UAAU,SAAY,QAAQ,SAAS,QAAQ,WAAS,KAAK,QAAQ,KAAK,OAAO,MAAMA,OAAK,CAAC;EAG7G,MAAM,OAAO,KAAK;AAClB,SAAO,CAAC,eAAe,KAAK,GAAG,KAAK,QAAQ,MAAM,MAAM,OAAO,MAAM,GAAG,MAAM;;CAElF,cAAc,MAAM,MAAM,OAAO;AAC7B,MAAI,CAAC,cAAc,MAAM,CACrB,QAAO;EACX,MAAM,aAAa,eAAe,KAAK,WAAW,GAAG,KAAK,aAAa,EAAE;EACzE,MAAM,WAAW,eAAe,KAAK,kBAAkB,GACjD,OAAO,QAAQ,KAAK,kBAAkB,CAAC,KAAK,CAAC,SAAS,YAAY,CAAC,YAAY,QAAQ,EAAE,OAAO,CAAC,GACjG,EAAE;EACR,MAAM,aAAa,eAAe,KAAK,qBAAqB,GAAG,KAAK,uBAAuB;EAC3F,IAAI;AACJ,OAAK,MAAM,OAAO,OAAO,KAAK,MAAM,EAAE;AAElC,OAAI,MAAM,SAAS,OACf;GACJ,IAAI,OAAO,MAAM;GACjB,IAAI,UAAU,OAAO,OAAO,YAAY,IAAI;AAC5C,OAAI,QACA,QAAO,KAAK,QAAQ,WAAW,MAAM,MAAM,KAAK;AACpD,QAAK,MAAM,CAAC,SAAS,WAAW,UAAU;AACtC,QAAI,CAAC,QAAQ,KAAK,IAAI,CAClB;AACJ,cAAU;AACV,WAAO,KAAK,QAAQ,QAAQ,MAAM,KAAK;;AAE3C,OAAI,CAAC,WAAW,eAAe,OAC3B,QAAO,KAAK,QAAQ,YAAY,MAAM,KAAK;AAC/C,OAAI,SAAS,MAAM,MAAM;AACrB,YAAQ,EAAE,GAAG,OAAO;AACpB,QAAI,OAAO;;;AAGnB,SAAO,OAAO;;CAKlB,YAAY,OAAO,QAAQ,MAAM;AAC7B,MAAI,CAAC,eAAe,OAAO,CACvB,QAAO;EACX,MAAM,IAAI,KAAK,OAAO,QAAQ,KAAK;EACnC,IAAI,OAAO;AACX,MAAI,MAAM,QAAQ,OAAO,MAAM,CAC3B,MAAK,MAAM,UAAU,OAAO,MACxB,QAAO,KAAK,YAAY,MAAM,QAAQ,EAAE;AAChD,MAAI,MAAM,QAAQ,OAAO,MAAM,CAC3B,QAAO,KAAK,YAAY,MAAM,OAAO,OAAO,EAAE;AAClD,MAAI,MAAM,QAAQ,OAAO,MAAM,CAC3B,QAAO,KAAK,YAAY,MAAM,OAAO,OAAO,EAAE;EAClD,MAAM,QAAQ,QAAQ,OAAO;EAC7B,MAAM,qBAAqB,MAAM,SAAS,KAAK,MAAM,MAAM,SAAS,YAAY,MAAM,KAAK,CAAC;AAC5F,MAAI,MAAM,SAAS,KAAK,CAAC,mBACrB,MAAK,MAAM,QAAQ,OAAO;GACtB,MAAM,YAAY,gBAAgB,MAAM,KAAK;AAC7C,OAAI,cAAc,MAAM;AACpB,WAAO;AACP;;;AAIZ,MAAI,MAAM,SAAS,SAAS,IAAI,cAAc,KAAK,CAC/C,QAAO,KAAK,iBAAiB,MAAM,QAAQ,EAAE;AACjD,MAAI,MAAM,SAAS,QAAQ,IAAI,MAAM,QAAQ,KAAK,CAC9C,QAAO,KAAK,YAAY,MAAM,QAAQ,EAAE;AAC5C,SAAO;;CAEX,YAAY,OAAO,UAAU,MAAM;AAC/B,OAAK,MAAM,UAAU,SACjB,KAAI,KAAK,OAAO,QAAQ,MAAM,MAAM,KAAK,KACrC,QAAO;AACf,OAAK,MAAM,UAAU,UAAU;GAC3B,MAAM,UAAU,KAAK,YAAY,OAAO,QAAQ,KAAK;AACrD,OAAI,KAAK,OAAO,QAAQ,MAAM,QAAQ,KAAK,KACvC,QAAO;;AAEf,SAAO;;CAEX,iBAAiB,OAAO,QAAQ,MAAM;EAClC,MAAM,aAAa,eAAe,OAAO,WAAW,GAAG,OAAO,aAAa,EAAE;EAC7E,MAAM,WAAW,eAAe,OAAO,kBAAkB,GACnD,OAAO,QAAQ,OAAO,kBAAkB,CAAC,KAAK,CAAC,SAAS,UAAU,CAAC,YAAY,QAAQ,EAAE,KAAK,CAAC,GAC/F,EAAE;EACR,MAAM,aAAa,eAAe,OAAO,qBAAqB,GAAG,OAAO,uBAAuB;EAC/F,IAAI;EACJ,MAAM,OAAO,KAAK,SAAS;AACvB,OAAI,UAAU,OAAO,OAAO,KACxB;AACJ,WAAQ,EAAE,GAAG,OAAO;AACpB,OAAI,OAAO;;AAEf,OAAK,MAAM,CAAC,KAAK,aAAa,OAAO,QAAQ,WAAW,CACpD,KAAI,OAAO,MACP,KAAI,KAAK,KAAK,YAAY,MAAM,MAAM,UAAU,KAAK,CAAC;AAE9D,OAAK,MAAM,OAAO,OAAO,KAAK,MAAM,EAAE;GAClC,IAAI,UAAU,OAAO,OAAO,YAAY,IAAI;AAC5C,QAAK,MAAM,CAAC,SAAS,SAAS,UAAU;AACpC,QAAI,CAAC,QAAQ,KAAK,IAAI,CAClB;AACJ,cAAU;AACV,QAAI,KAAK,KAAK,aAAa,OAAO,OAAO,MAAM,MAAM,KAAK,CAAC;;AAE/D,OAAI,CAAC,WAAW,eAAe,OAC3B,KAAI,KAAK,KAAK,YAAY,MAAM,MAAM,YAAY,KAAK,CAAC;;AAEhE,SAAO,OAAO;;CAElB,YAAY,OAAO,QAAQ,MAAM;AAC7B,SAAO,SAAS,QAAQ,MAAM,MAAM;GAChC,MAAM,aAAa,aAAa,QAAQ,EAAE;AAC1C,UAAO,eAAe,WAAW,GAAG,KAAK,YAAY,MAAM,YAAY,KAAK,GAAG;IACjF;;;;;;;AAOV,SAAS,aAAa,QAAQ,OAAO;AACjC,KAAI,MAAM,QAAQ,OAAO,MAAM,CAC3B,QAAO,OAAO,MAAM;AACxB,KAAI,MAAM,QAAQ,OAAO,YAAY,IAAI,QAAQ,OAAO,YAAY,OAChE,QAAO,OAAO,YAAY;AAC9B,QAAO,OAAO;;;AAGlB,SAAS,SAAS,OAAO,KAAK;CAC1B,IAAI;AACJ,MAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;EACnC,MAAM,OAAO,IAAI,MAAM,IAAI,EAAE;AAC7B,MAAI,SAAS,MAAM,GACf;AACJ,UAAQ,MAAM,OAAO;AACrB,MAAI,KAAK;;AAEb,QAAO,OAAO;;AAElB,SAAS,QAAQ,QAAQ,OAAO;AAC5B,QAAO,WAAW,SAAY,QAAQ,OAAO;;;AAGjD,SAAS,eAAe,SAAS,OAAO;AACpC,KAAI,YAAY,MACZ,QAAO;CACX,MAAM,SAAS,OAAO,YAAY,WAC5B,UAAU,MAAM,GAChB,OAAO,YAAY,WACf,UAAU,MAAM,GAChB,OAAO,YAAY,YACf,WAAW,MAAM,GACjB;AACd,QAAO,WAAW,UAAa,OAAO,UAAU,UAAU,OAAO,QAAQ;;AAE7E,SAAS,UAAU,OAAO;AACtB,KAAI,OAAO,UAAU,YAAY,OAAO,UAAU,aAAa,eAAe,MAAM,CAChF,QAAO,EAAE,OAAO,OAAO,MAAM,EAAE;AACnC,KAAI,UAAU,KACV,QAAO,EAAE,OAAO,QAAQ;AAC5B,KAAI,OAAO,UAAU,SACjB,QAAO,EAAE,OAAO;AACpB,KAAI,UAAU,OACV,QAAO,EAAE,OAAO,IAAI;;AAG5B,MAAM,aAAa,OAAO,OAAO,iBAAiB;AAClD,MAAM,aAAa,OAAO,OAAO,iBAAiB;AAClD,SAAS,UAAU,OAAO;AACtB,KAAI,OAAO,UAAU,SACjB,QAAO,SAAS,cAAc,SAAS,aAAa,EAAE,OAAO,OAAO,MAAM,EAAE,GAAG;AACnF,KAAI,OAAO,UAAU,UACjB,QAAO,EAAE,OAAO,QAAQ,IAAI,GAAG;AACnC,KAAI,eAAe,MAAM,CACrB,QAAO,EAAE,OAAO;AACpB,KAAI,UAAU,QAAQ,UAAU,OAC5B,QAAO,EAAE,OAAO,GAAG;AACvB,KAAI,OAAO,UAAU,SACjB,QAAO;CACX,MAAM,UAAU,CAAC;AACjB,KAAI,OAAO,SAAS,QAAQ,CACxB,QAAO,EAAE,OAAO,SAAS;CAC7B,MAAM,YAAY,MAAM,aAAa;AACrC,KAAI,cAAc,QACd,QAAO,EAAE,OAAO,GAAG;AACvB,KAAI,cAAc,OACd,QAAO,EAAE,OAAO,GAAG;CACvB,MAAM,MAAM,eAAe,MAAM;AACjC,QAAO,QAAQ,UAAa,OAAO,cAAc,OAAO,aAAa,EAAE,OAAO,OAAO,IAAI,EAAE,GAAG;;;AAGlG,SAAS,eAAe,OAAO;AAC3B,KAAI,oBAAoB,KAAK,MAAM,CAC/B,QAAO,OAAO,MAAM,MAAM,GAAG,GAAG,CAAC;AACrC,KAAI,wBAAwB,KAAK,MAAM,CACnC,QAAO,OAAO,MAAM,MAAM,IAAI,CAAC,GAAG;AACtC,KAAI,mBAAmB,KAAK,MAAM,CAC9B,QAAO,OAAO,MAAM;;AAG5B,SAAS,WAAW,OAAO;AACvB,KAAI,OAAO,UAAU,SACjB,QAAO,UAAU,KAAK,EAAE,OAAO,OAAO,GAAG,UAAU,KAAK,EAAE,OAAO,MAAM,GAAG;AAC9E,KAAI,OAAO,UAAU,UACjB,QAAO,EAAE,OAAO;AACpB,KAAI,eAAe,MAAM,CACrB,QAAO,UAAU,IAAI,EAAE,OAAO,OAAO,GAAG,UAAU,IAAI,EAAE,OAAO,MAAM,GAAG;AAC5E,KAAI,UAAU,QAAQ,UAAU,OAC5B,QAAO,EAAE,OAAO,OAAO;AAC3B,KAAI,OAAO,UAAU,SACjB,QAAO;CACX,MAAM,YAAY,MAAM,aAAa;AACrC,KAAI,cAAc,WAAW,UAAU,IACnC,QAAO,EAAE,OAAO,OAAO;AAC3B,KAAI,cAAc,UAAU,UAAU,IAClC,QAAO,EAAE,OAAO,MAAM;;AAG9B,SAAS,QAAQ,OAAO;AACpB,KAAI,OAAO,UAAU,SACjB,QAAO,UAAU,KAAK,EAAE,OAAO,MAAM,GAAG;AAC5C,KAAI,OAAO,UAAU,UACjB,QAAO,UAAU,QAAQ,EAAE,OAAO,MAAM,GAAG;AAC/C,KAAI,eAAe,MAAM,CACrB,QAAO,UAAU,IAAI,EAAE,OAAO,MAAM,GAAG;AAC3C,KAAI,UAAU,QAAQ,UAAU,OAC5B,QAAO,EAAE,OAAO,MAAM;AAC1B,KAAI,OAAO,UAAU,SACjB,QAAO;CACX,MAAM,YAAY,MAAM,aAAa;AACrC,QAAO,cAAc,eAAe,cAAc,UAAU,UAAU,MAAM,UAAU,MAChF,EAAE,OAAO,MAAM,GACf;;AAEV,SAAS,eAAe,OAAO;AAC3B,QAAO,OAAO,UAAU,YAAY,OAAO,SAAS,MAAM;;AAK9D,SAAS,QAAQ,QAAQ;AACrB,KAAI,OAAO,OAAO,SAAS,SACvB,QAAO,CAAC,OAAO,KAAK;AACxB,KAAI,MAAM,QAAQ,OAAO,KAAK,CAC1B,QAAO,OAAO,KAAK,QAAQ,SAAS,OAAO,SAAS,SAAS;AACjE,QAAO,EAAE;;AAEb,SAAS,YAAY,OAAO,MAAM;AAC9B,SAAQ,MAAR;EACI,KAAK,SACD,QAAO,OAAO,UAAU;EAC5B,KAAK,UACD,QAAO,OAAO,UAAU,YAAY,OAAO,UAAU,MAAM;EAC/D,KAAK,UACD,QAAO,OAAO,UAAU;EAC5B,KAAK,SACD,QAAO,OAAO,UAAU;EAC5B,KAAK,OACD,QAAO,UAAU;EACrB,KAAK,QACD,QAAO,MAAM,QAAQ,MAAM;EAC/B,KAAK,SACD,QAAO,cAAc,MAAM;EAC/B,QACI,QAAO;;;AAGnB,SAAS,gBAAgB,OAAO,MAAM;AAClC,SAAQ,MAAR;EACI,KAAK;EACL,KAAK;AACD,OAAI,UAAU,KACV,QAAO;AACX,OAAI,OAAO,UAAU,YAAY,MAAM,MAAM,KAAK,IAAI;IAClD,MAAM,SAAS,OAAO,MAAM;AAC5B,QAAI,SAAS,WAAW,OAAO,SAAS,OAAO,GAAG,OAAO,UAAU,OAAO,CACtE,QAAO;;AAEf,OAAI,OAAO,UAAU,UACjB,QAAO,QAAQ,IAAI;AACvB,UAAO;EAEX,KAAK;AACD,OAAI,UAAU,KACV,QAAO;AACX,OAAI,UAAU,UAAU,UAAU,EAC9B,QAAO;AACX,OAAI,UAAU,WAAW,UAAU,EAC/B,QAAO;AACX,UAAO;EACX,KAAK;AACD,OAAI,UAAU,KACV,QAAO;AACX,OAAI,OAAO,UAAU,YAAY,OAAO,UAAU,UAC9C,QAAO,OAAO,MAAM;AACxB,UAAO;EACX,KAAK,OACD,QAAO,UAAU,MAAM,UAAU,KAAK,UAAU,QAAQ,OAAO;EACnE,QACI,QAAO;;;AAGnB,SAAS,cAAc,OAAO;AAC1B,QAAO,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,MAAM;;;;;ACpkB/E,MAAa,eAAe;AAC5B,MAAa,cAAc;AAC3B,MAAM,aAAa,MAAM,OAAO,MAAM;AACtC,MAAM,aAAa,MAAM,OAAO,SAAS,EAAE;AAC3C,MAAM,cAAc,MAAM,OAAO,UAAU,EAAE;AAC7C,MAAM,cAAc,MAAM,OAAO,MAAM;AACvC,MAAM,WAAW,MAAM,MAAM;AAC7B,MAAa,YAAY,MAAM,MAAM,QAAQ,EAAE;AAC/C,MAAM,YAAY,MAAM,aAAa;AACrC,MAAa,aAAa,MAAM,SAAS,EAAE;;AAE3C,SAAgB,SAAS,GAAG;AACxB,QAAO,OAAO,MAAM,YAAY,MAAM,QAAQ,CAAC,MAAM,QAAQ,EAAE,IAAI,EAAE,aAAa;;;AAGtF,MAAa,cAAc,IAAI,IAAI;CAC/B,CAAC,UAAU,UAAU;CACrB,CAAC,UAAU,UAAU;CACrB,CAAC,WAAW,WAAW;CACvB,CAAC,WAAW,WAAW;CACvB,CAAC,QAAQ,QAAQ;CACjB,CAAC,SAAS,SAAS;CACnB,CAAC,UAAU,UAAU;CACrB,CAAC,SAAS,SAAS;CACtB,CAAC;;AAEF,MAAa,aAAa,IAAI,IAAI;CAC9B,CAAC,WAAW,EAAE;CACd,CAAC,WAAW,EAAE;CACd,CAAC,YAAY,EAAE;CACf,CAAC,YAAY,EAAE;CACf,CAAC,SAAS,EAAE;CACZ,CAAC,QAAQ,EAAE;CACd,CAAC;AACF,SAAS,OAAO,MAAM,GAAG;AACrB,SAAQ,MAAR;EACI,KAAK,EACD,QAAO,OAAO,MAAM;EACxB,KAAK,EACD,QAAO,OAAO,SAAS,EAAE;EAC7B,KAAK,EACD,QAAO,OAAO,UAAU,EAAE;EAC9B,KAAK,EACD,QAAO,OAAO,MAAM;EACxB,KAAK,EACD,QAAO,MAAM;EACjB,QACI,QAAO;;;;AAInB,MAAa,aAAa;AAC1B,MAAa,eAAe;AAC5B,MAAa,cAAc;;AAE3B,MAAa,OAAO;AACpB,MAAa,WAAW;AACxB,MAAa,YAAY;;AAEzB,SAAgB,IAAI,OAAO;AACvB,SAAQ,MAAM,QAAd;EACI,KAAK,EACD,QAAO;EACX,KAAK,EACD,QAAO,MAAM;EACjB,KAAK,GAAG;GACJ,MAAM,CAAC,GAAG,KAAK;AACf,WAAQ,MAAM,EAAE,EAAE,IAAI,EAAE,EAAE;;EAE9B,KAAK,GAAG;GACJ,MAAM,CAAC,GAAG,GAAG,KAAK;AAClB,WAAQ,MAAM,EAAE,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,EAAE;;EAEtC,QACI,SAAQ,MAAM;AACV,QAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,IAC9B,KAAI,CAAC,MAAM,GAAG,EAAE,CACZ,QAAO;AACf,UAAO;;;;;AAKvB,SAAgB,SAAS,MAAM;AAC3B,SAAQ,MAAM,KAAK,MAAM,EAAE;;;AAG/B,SAAgB,YAAY,OAAO,KAAK,OAAO;AAC3C,SAAQ,MAAM;AACV,QAAM,KAAK,IAAI;EACf,MAAM,KAAK,MAAM,EAAE;AACnB,QAAM,KAAK;AACX,SAAO;;;;AAIf,SAAgB,UAAU,OAAO;CAC7B,MAAM,SAAS,MAAM,KAAK,OAAO,OAAO,MAAM,WAAW,YAAY,IAAI,EAAE,GAAG,WAAc,MAAM;AAClG,KAAI,OAAO,WAAW,EAClB,QAAO,OAAO;AAClB,SAAQ,MAAM;AACV,OAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,IAC/B,KAAI,OAAO,GAAG,EAAE,CACZ,QAAO;AACf,SAAO;;;;AAIf,SAAgB,WAAW,KAAK,KAAK;AACjC,SAAQ,MAAM,aAAa,cAAc,EAAE,UAAU,OAAO,EAAE,UAAU;;;AAG5E,SAAgB,WAAW,GAAG;CAC1B,IAAI,IAAI;AACR,MAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK,KAAK;EACpC,MAAM,IAAI,EAAE,WAAW,EAAE;AAEzB,MAAI,KAAK,SAAU,KAAK,SAAU,IAAI,IAAI,EAAE,QAAQ;GAChD,MAAM,OAAO,EAAE,WAAW,IAAI,EAAE;AAChC,OAAI,QAAQ,SAAU,QAAQ,MAC1B;;;AAGZ,QAAO;;AAGX,SAAS,SAAS,GAAG,KAAK,KAAK;CAC3B,MAAM,QAAQ,EAAE;AAChB,KAAI,QAAQ,IACR,QAAO;AACX,KAAI,QAAQ,IAAI,OAAO,WAAW,EAAE,GAAG,IACnC,QAAO;AACX,QAAO,SAAS,OAAO,WAAW,EAAE,IAAI;;;AAG5C,SAAgB,YAAY,QAAQ,KAAK,KAAK,IAAI,QAAQ;AACtD,KAAI,OAAO,UAAa,QAAQ,KAAK,QAAQ,OAAO,qBAAqB,WAAW,OAChF,QAAO,UAAU,MAAM,OAAO,MAAM,YAAY,GAAG,KAAK,EAAE,IAAI,MAAM,OAAO,MAAM,YAAY,GAAG,KAAK,EAAE;AAE3G,KAAI,OAAO,UAAa,WAAW,OAC/B,QAAO,UACA,MAAM,OAAO,MAAM,YAAY,SAAS,GAAG,KAAK,IAAI,IACpD,MAAM,OAAO,MAAM,YAAY,SAAS,GAAG,KAAK,IAAI;AAE/D,SAAQ,MAAM;AACV,MAAI,OAAO,MAAM,SACb,QAAO,CAAC;AACZ,SAAO,SAAS,GAAG,KAAK,IAAI,KAAK,OAAO,UAAa,GAAG,KAAK,EAAE,MAAM,WAAW,UAAa,OAAO,EAAE;;;;AAI9G,SAAgB,YAAY,MAAM,KAAK,KAAK,MAAM,MAAM,YAAY;AAChE,SAAQ,MAAM;AACV,MAAI,OAAO,MAAM,SACb,QAAO,SAAS;AACpB,MAAI,SAAS,KAAK,CAAC,OAAO,UAAU,EAAE,CAClC,QAAO;AACX,SAAO,KAAK,OAAO,KAAK,OAAO,IAAI,QAAQ,IAAI,SAAS,eAAe,UAAa,WAAW,GAAG,WAAW;;;;AAIrH,SAAgB,WAAW,GAAG,GAAG;CAC7B,MAAM,IAAI,IAAI;AACd,KAAI,OAAO,UAAU,EAAE,CACnB,QAAO;AACX,KAAI,CAAC,OAAO,SAAS,EAAE,CACnB,QAAO,IAAI,MAAM;CACrB,MAAM,CAAC,IAAI,MAAM,QAAQ,EAAE;CAC3B,MAAM,CAAC,IAAI,MAAM,QAAQ,EAAE;AAC3B,QAAO,MAAM,KAAM,KAAK,OAAO,OAAO,KAAK,GAAG,GAAI,OAAO,KAAK,MAAM,KAAK,OAAO,OAAO,KAAK,GAAG,MAAM;;AAEzG,SAAS,QAAQ,GAAG;CAChB,MAAM,CAAC,UAAU,WAAW,OAAO,KAAK,IAAI,EAAE,CAAC,UAAU,CAAC,MAAM,IAAI;CACpE,MAAM,QAAQ,SAAS,QAAQ,IAAI;CACnC,MAAM,WAAW,QAAQ,IAAI,IAAI,SAAS,SAAS,QAAQ;AAC3D,QAAO,CAAC,OAAO,SAAS,QAAQ,KAAK,GAAG,CAAC,EAAE,OAAO,SAAS,GAAG,SAAS;;;AAG3E,SAAgB,YAAY,OAAO,QAAQ;AACvC,QAAO,UAAU,MAAM,SAAS,EAAE,IAAI,MAAM,EAAE,IAAI,MAAM,CAAC,SAAS,EAAE,IAAI,MAAM,EAAE;;;AAGpF,SAAgB,WAAW,OAAO,QAAQ;AACtC,QAAO,UAAU,MAAM,MAAM,QAAQ,EAAE,IAAI,MAAM,EAAE,IAAI,MAAM,CAAC,MAAM,QAAQ,EAAE,IAAI,MAAM,EAAE;;;;;;;AAO9F,SAAgB,eAAe,WAAS,eAAe,QAAQ,OAAO;CAClE,MAAM,IAAIC,UAAQ;AAClB,SAAQ,MAAM;AACV,MAAI,UAAU,cAAc,CAAC,SAAS,EAAE,CACpC,QAAO,UAAU;EAErB,MAAM,IAAI;EACV,IAAI,WAAW;AACf,OAAK,MAAM,KAAK,GAAG;GACf,IAAI,IAAI;AACR,UAAO,IAAI,KAAKA,UAAQ,OAAO,EAC3B,MAAK;AACT,OAAI,MAAM,GAAG;AACT,QAAI,OACA,QAAO;AACX;;GAEJ,MAAM,IAAI,EAAE;AACZ,OAAI,MAAM,OACN;GACJ,MAAM,IAAIA,UAAQ,IAAI;GACtB,MAAM,IAAI,IAAI;AACd,OAAI,MAAM,IAAI,CAAC,OAAO,GAAG,EAAE,GAAG,CAACA,UAAQ,IAAI,GAAG,EAAE,CAC5C,QAAO;AACX,OAAI,IAAI,SACJ;;AAER,SAAO,aAAa;;;;AAI5B,SAAgB,WAAW,WAAS,MAAM,eAAe,UAAU,YAAY,OAAO;CAClF,MAAM,QAAQ,SAAS,SAAS,KAAK,eAAe,SAAY,IAAI,IAAI,KAAK,GAAG;AAChF,SAAQ,MAAM;AACV,MAAI,UAAU,cAAc,CAAC,SAAS,EAAE,CACpC,QAAO,UAAU;EACrB,MAAM,IAAI;AACV,OAAK,IAAI,IAAI,GAAG,IAAIA,UAAQ,QAAQ,KAAK,GAAG;GACxC,MAAM,IAAIA,UAAQ;GAClB,MAAM,IAAI,EAAE;GACZ,MAAM,IAAIA,UAAQ,IAAI;AACtB,OAAI,MAAM,UAAc,IAAI,aAAa,CAAC,OAAO,OAAO,GAAG,EAAE,EAAG;AAC5D,QAAI,IAAI,SACJ,QAAO;AACX;;GAEJ,MAAM,IAAI,IAAI;AACd,OAAI,MAAM,IAAI,CAAC,OAAO,GAAG,EAAE,GAAG,CAACA,UAAQ,IAAI,GAAG,EAAE,CAC5C,QAAO;;AAEf,OAAK,IAAI,IAAI,GAAG,IAAI,cAAc,QAAQ,IACtC,KAAI,CAAC,OAAO,OAAO,GAAG,cAAc,GAAG,CACnC,QAAO;AACf,MAAI,UAAU,OACV,QAAO;AACX,OAAK,MAAM,KAAK,OAAO,KAAK,EAAE,EAAE;GAC5B,IAAI,UAAU,MAAM,IAAI,EAAE;AAC1B,QAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,IACjC,KAAI,SAAS,GAAG,GAAG,KAAK,EAAE,EAAE;AACxB,cAAU;AACV,QAAI,CAAC,SAAS,GAAG,GAAG,EAAE,GAAG,CACrB,QAAO;;AAGnB,OAAI,CAAC,WAAW,eAAe,UAAa,CAAC,WAAW,EAAE,GAAG,CACzD,QAAO;;AAEf,SAAO;;;;AAIf,SAAgB,mBAAmB,OAAO;AACtC,SAAQ,MAAM;AACV,OAAK,MAAM,KAAK,EACZ,KAAI,CAAC,MAAM,EAAE,CACT,QAAO;AACf,SAAO;;;;AAIf,SAAgB,mBAAmB,KAAK,KAAK;AACzC,SAAQ,MAAM;EACV,IAAI,IAAI;AACR,OAAK,MAAM,KAAK,EACZ;AACJ,SAAO,KAAK,OAAO,KAAK;;;;AAIhC,SAAgB,uBAAuB,WAAS;AAC5C,SAAQ,MAAM;EACV,MAAM,IAAI;AACV,OAAK,MAAM,CAAC,GAAG,SAASA,UACpB,KAAI,OAAO,OAAO,GAAG,EAAE,EACnB;QAAK,MAAM,KAAK,KACZ,KAAI,CAAC,OAAO,OAAO,GAAG,EAAE,CACpB,QAAO;;AACvB,SAAO;;;;AAIf,SAAgB,sBAAsB,WAAS;AAC3C,SAAQ,MAAM;AACV,OAAK,MAAM,CAAC,GAAG,UAAUA,UACrB,KAAI,OAAO,OAAO,GAAG,EAAE,IAAI,CAAC,MAAM,EAAE,CAChC,QAAO;AACf,SAAO;;;;AAIf,SAAgB,UAAU,OAAO,KAAK,KAAK,QAAQ,MAAM;CACrD,MAAM,IAAI,OAAO;CACjB,MAAM,OAAO,SAAS,SAAY,IAAK,WAAW,IAAI,KAAK,IAAI;AAC/D,SAAQ,MAAM;AACV,MAAI,CAAC,MAAM,QAAQ,EAAE,CACjB,QAAO,UAAU;EACrB,MAAM,SAAS,EAAE;AACjB,MAAI,SAAS,OAAO,SAAS,IACzB,QAAO;EACX,MAAM,IAAI,SAAS,IAAI,SAAS;AAChC,OAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IACnB,KAAI,CAAC,OAAO,GAAG,EAAE,GAAG,CAChB,QAAO;AACf,MAAI,SAAS,OACT,QAAO;AACX,MAAI,SAAS,GAAG;AACZ,QAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,IACxB,KAAI,CAAC,OAAO,MAAM,EAAE,GAAG,CACnB,QAAO;AACf,UAAO;;AAEX,OAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,IACxB,KAAI,CAAC,KAAK,EAAE,GAAG,CACX,QAAO;AACf,SAAO;;;;AAIf,SAAgB,WAAW,QAAQ,MAAM;AACrC,QAAO,UAAU,YAAY,GAAG,OAAO,mBAAmB,QAAQ,KAAK;;;AAG3E,SAAgB,YAAY,KAAK,KAAK;AAClC,SAAQ,MAAM,EAAE,UAAU,OAAO,EAAE,UAAU;;;AAGjD,SAAgB,cAAc,OAAO,KAAK,KAAK;AAC3C,SAAQ,MAAM;EACV,MAAM,OAAO;EACb,IAAI,IAAI;AACR,OAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,IAC7B,KAAI,MAAM,KAAK,GAAG,IAAI,EAAE,IAAI,IACxB,QAAO;AACf,SAAO,KAAK;;;;AAIpB,SAAgB,YAAY,GAAG;CAC3B,MAAM,OAAO;AACb,MAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,IAC7B,MAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IACnB,KAAI,UAAU,KAAK,IAAI,KAAK,GAAG,CAC3B,QAAO;AACnB,QAAO;;;AAGX,SAAgB,UAAU,QAAQ;CAC9B,MAAM,aAAa,OAAO,QAAQ,MAAM,OAAO,MAAM,YAAY,MAAM,KAAK;AAC5E,KAAI,WAAW,WAAW,OAAO,UAAU,WAAW,UAAU,EAC5D,SAAQ,MAAM;AACV,OAAK,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,IACnC,KAAI,WAAW,OAAO,EAClB,QAAO;AACf,SAAO;;CAGf,MAAM,MAAM,IAAI,IAAI,WAAW;CAC/B,MAAM,UAAU,OAAO,QAAQ,MAAM,OAAO,MAAM,YAAY,MAAM,KAAK;AACzE,SAAQ,MAAM,IAAI,IAAI,EAAE,IAAK,OAAO,MAAM,YAAY,QAAQ,MAAM,MAAM,UAAU,GAAG,EAAE,CAAC;;;AAG9F,SAAgB,WAAW,OAAO;AAC9B,KAAI,OAAO,UAAU,YAAY,UAAU,KACvC,SAAQ,MAAM,MAAM;AACxB,SAAQ,MAAM,UAAU,GAAG,MAAM;;;AAGrC,SAAgB,SAAS,QAAQ;AAC7B,SAAQ,MAAM;AACV,OAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,IAC/B,KAAI,OAAO,GAAG,EAAE,CACZ,QAAO;AACf,SAAO;;;;AAIf,SAAgB,SAAS,QAAQ;AAC7B,SAAQ,MAAM;EACV,IAAI,IAAI;AACR,OAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,IAC/B,KAAI,OAAO,GAAG,EAAE,IAAI,EAAE,IAAI,EACtB,QAAO;AACf,SAAO,MAAM;;;;AAIrB,SAAgB,SAAS,OAAO;AAC5B,SAAQ,MAAM,CAAC,MAAM,EAAE;;;AAG3B,SAAgB,QAAQ,MAAM,MAAM,WAAW;AAC3C,SAAQ,MAAO,KAAK,EAAE,GAAG,KAAK,EAAE,GAAG,UAAU,EAAE;;;AAGnD,SAAgB,YAAY,KAAK,MAAM,QAAQ;AAC3C,SAAQ,MAAM;AACV,MAAI,CAAC,SAAS,EAAE,CACZ,QAAO;EACX,MAAM,MAAM,EAAE;AACd,OAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,IAC7B,KAAI,KAAK,OAAO,IACZ,QAAO,OAAO,GAAG,EAAE;AAC3B,SAAO;;;;AAIf,SAAgB,UAAU,GAAG,GAAG;AAC5B,KAAI,MAAM,EACN,QAAO;AACX,KAAI,OAAO,MAAM,YAAY,OAAO,MAAM,YAAY,MAAM,QAAQ,MAAM,KACtE,QAAO;CACX,MAAM,QAAQ,MAAM,QAAQ,EAAE;AAC9B,KAAI,UAAU,MAAM,QAAQ,EAAE,CAC1B,QAAO;AACX,KAAI,OAAO;EACP,MAAMC,MAAI;EACV,MAAMC,MAAI;AACV,MAAID,IAAE,WAAWC,IAAE,OACf,QAAO;AACX,OAAK,IAAI,IAAI,GAAG,IAAID,IAAE,QAAQ,IAC1B,KAAI,CAAC,UAAUA,IAAE,IAAIC,IAAE,GAAG,CACtB,QAAO;AACf,SAAO;;CAEX,MAAM,IAAI;CACV,MAAM,IAAI;CACV,MAAM,OAAO,OAAO,KAAK,EAAE;AAC3B,KAAI,KAAK,WAAW,OAAO,KAAK,EAAE,CAAC,OAC/B,QAAO;AACX,MAAK,MAAM,KAAK,KACZ,KAAI,CAAC,OAAO,OAAO,GAAG,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,EAAE,GAAG,CAC9C,QAAO;AACf,QAAO;;;;;;ACxbX,SAAgB,iBAAiB;AAC7B,QAAO;EAAE,OAAO;EAAM,UAAU;EAAO,OAAO;EAAG,UAAU;EAAO,SAAS;EAAM;;AAErF,SAAS,MAAM,GAAG,GAAG;AACjB,KAAI,EAAE,UAAU,KACZ,MAAK,MAAM,KAAK,EAAE,MACd,SAAQ,GAAG,EAAE;AACrB,GAAE,aAAa,EAAE;AACjB,KAAI,EAAE,QAAQ,EAAE,MACZ,GAAE,QAAQ,EAAE;AAChB,GAAE,aAAa,EAAE;AACjB,KAAI,EAAE,YAAY,KACd,MAAK,MAAM,KAAK,EAAE,QACd,UAAS,GAAG,EAAE;;AAE1B,SAAS,QAAQ,GAAG,KAAK;AACrB,KAAI,EAAE,UAAU,KACZ,GAAE,wBAAQ,IAAI,KAAK;AACvB,GAAE,MAAM,IAAI,IAAI;;AAEpB,SAAS,SAAS,GAAG,OAAO;AACxB,KAAI,EAAE,YAAY,KACd,GAAE,0BAAU,IAAI,KAAK;AACzB,GAAE,QAAQ,IAAI,MAAM;;AAExB,MAAa,wBAAwB;AACrC,MAAa,yBAAyB;;AAEtC,SAAgB,mBAAmB,MAAM;AACrC,SAAQ,GAAG,MAAM,KAAK,MAAM,GAAG,EAAE;;;AAGrC,SAAgB,kBAAkB,OAAO;AACrC,SAAQ,MAAM,MAAM,EAAE;;;AAG1B,SAAgB,qBAAqB,OAAO;AACxC,SAAQ,MAAM,MAAM,GAAG,gBAAgB,CAAC;;;AAG5C,SAAgB,iBAAiB,OAAO,KAAK,OAAO;AAChD,SAAQ,GAAG,MAAM;AACb,QAAM,KAAK,IAAI;EACf,MAAM,KAAK,MAAM,GAAG,EAAE;AACtB,QAAM,KAAK;AACX,SAAO;;;;AAIf,SAAgB,mBAAmB,OAAO;AACtC,SAAQ,GAAG,MAAM;EACb,MAAM,IAAI,gBAAgB;AAC1B,MAAI,CAAC,MAAM,GAAG,EAAE,CACZ,QAAO;AACX,QAAM,GAAG,EAAE;AACX,SAAO;;;;AAIf,SAAgB,YAAY,OAAO,OAAO;AACtC,SAAQ,GAAG,MAAM;AACb,MAAI,CAAC,MAAM,EAAE,CACT,QAAO;AACX,OAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,IAC9B,KAAI,CAAC,MAAM,GAAG,GAAG,EAAE,CACf,QAAO;AACf,SAAO;;;;AAIf,SAAgB,eAAe,OAAO,UAAU,YAAY;CACxD,MAAM,WAAW,IAAI,IAAI,MAAM,KAAK,CAAC,OAAO,EAAE,CAAC;AAC/C,SAAQ,GAAG,MAAM;AACb,MAAI,CAAC,SAAS,EAAE,CACZ,QAAO;EACX,MAAM,OAAO,EAAE;AACf,OAAK,MAAM,CAAC,GAAG,UAAU,OAAO;AAC5B,OAAI,CAAC,OAAO,OAAO,GAAG,EAAE,CACpB;AACJ,OAAI,CAAC,MAAM,EAAE,GAAG,CACZ,QAAO;AACX,QAAK,KAAK,EAAE;;AAEhB,OAAK,MAAM,KAAK,OAAO,KAAK,EAAE,EAAE;GAC5B,IAAI,UAAU,SAAS,IAAI,EAAE;AAC7B,QAAK,MAAM,CAAC,IAAI,UAAU,SACtB,KAAI,GAAG,KAAK,EAAE,EAAE;AACZ,QAAI,CAAC,MAAM,EAAE,GAAG,CACZ,QAAO;AACX,cAAU;AACV,SAAK,KAAK,EAAE;;AAGpB,OAAI,CAAC,WAAW,eAAe,QAAW;AACtC,QAAI,CAAC,WAAW,EAAE,GAAG,CACjB,QAAO;AACX,SAAK,KAAK,EAAE;;;AAGpB,OAAK,MAAM,KAAK,KACZ,SAAQ,GAAG,EAAE;AACjB,SAAO;;;;AAIf,SAAgB,cAAc,QAAQ,MAAM,UAAU,aAAa,aAAa;AAC5E,SAAQ,GAAG,MAAM;AACb,MAAI,CAAC,MAAM,QAAQ,EAAE,CACjB,QAAO;EACX,MAAM,IAAI,KAAK,IAAI,EAAE,QAAQ,OAAO,OAAO;AAC3C,OAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IACnB,KAAI,CAAC,OAAO,GAAG,EAAE,GAAG,CAChB,QAAO;AACf,MAAI,SAAS,QAAW;AACpB,QAAK,IAAI,IAAI,OAAO,QAAQ,IAAI,EAAE,QAAQ,IACtC,KAAI,CAAC,KAAK,EAAE,GAAG,CACX,QAAO;AACf,KAAE,WAAW;;AAEjB,MAAI,IAAI,EAAE,MACN,GAAE,QAAQ;AACd,MAAI,aAAa,QAAW;GACxB,IAAI,IAAI;AACR,QAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,IAC1B,KAAI,SAAS,EAAE,GAAG,EAAE;AAChB;AACA,aAAS,GAAG,EAAE;;AAGtB,OAAI,IAAI,eAAe,IAAI,YACvB,QAAO;;AAEf,SAAO;;;;AAIf,SAAgB,YAAY,UAAU,YAAY;AAC9C,SAAQ,GAAG,MAAM;EACb,IAAI,IAAI;AACR,OAAK,MAAM,UAAU,UAAU;GAC3B,MAAM,IAAI,gBAAgB;AAC1B,OAAI,OAAO,GAAG,EAAE,EAAE;AACd;AACA,UAAM,GAAG,EAAE;;;AAGnB,SAAO,aAAa,MAAM,IAAI,IAAI;;;;AAI1C,SAAgB,WAAW,MAAM,MAAM,WAAW;AAC9C,SAAQ,GAAG,MAAM;EACb,MAAM,IAAI,gBAAgB;AAC1B,MAAI,KAAK,GAAG,EAAE,EAAE;AACZ,SAAM,GAAG,EAAE;AACX,UAAO,SAAS,UAAa,KAAK,GAAG,EAAE;;AAE3C,SAAO,cAAc,UAAa,UAAU,GAAG,EAAE;;;;AAIzD,SAAgB,kBAAkB,KAAK,OAAO;AAC1C,SAAQ,GAAG,MAAM,CAAC,SAAS,EAAE,IAAI,CAAC,OAAO,OAAO,GAAG,IAAI,IAAI,MAAM,GAAG,EAAE;;;AAG1E,SAAgB,sBAAsB,OAAO;AACzC,SAAQ,GAAG,MAAM;AACb,MAAI,CAAC,SAAS,EAAE,IAAI,EAAE,SAClB,QAAO;AACX,OAAK,MAAM,KAAK,OAAO,KAAK,EAAE,CAC1B,KAAI,EAAE,EAAE,OAAO,IAAI,EAAE,IAAI,UAAU,CAAC,MAAM,EAAE,GAAG,CAC3C,QAAO;AACf,IAAE,WAAW;AACb,SAAO;;;;AAIf,SAAgB,iBAAiB,OAAO;AACpC,SAAQ,GAAG,MAAM;AACb,MAAI,CAAC,MAAM,QAAQ,EAAE,IAAI,EAAE,SACvB,QAAO;AACX,OAAK,IAAI,IAAI,EAAE,OAAO,IAAI,EAAE,QAAQ,IAChC,KAAI,EAAE,EAAE,SAAS,IAAI,EAAE,IAAI,UAAU,CAAC,MAAM,EAAE,GAAG,CAC7C,QAAO;AACf,IAAE,WAAW;AACb,SAAO;;;;;;;ACrLf,MAAa,UAAU,OAAO,UAAU;;AAExC,IAAa,WAAb,MAAsB;CAClB;CACA;CACA;;CAEA;CACA;CACA;CACA,wBAAQ,IAAI,KAAK;CACjB,kCAAkB,IAAI,KAAK;CAC3B,YAAY,QAAQ,SAAS,SAAS;AAClC,OAAK,SAAS;AACd,OAAK,IAAI,IAAI,SAAS,QAAQ,QAAQ;AACtC,OAAK,QAAQ,KAAK,EAAE;AACpB,OAAK,UAAU,QAAQ;AACvB,OAAK,UAAU;AACf,OAAK,QAAQ,EAAE;;;CAGnB,OAAO;AACH,SAAO,KAAK,MAAM,KAAK,QAAQ,KAAK,EAAE,SAAS;;;CAGnD,MAAM,MAAM,MAAM;AACd,MAAI,SAAS,KACT,QAAO;AACX,MAAI,SAAS,MACT,QAAO;AACX,MAAI,CAAC,eAAe,KAAK,CACrB,OAAM,IAAI,MAAM,gDAAgD,KAAK,UAAU,KAAK,GAAG;EAC3F,MAAM,SAAS,KAAK,MAAM,IAAI,KAAK;AACnC,MAAI,WAAW,OACX,QAAO;EACX,MAAM,OAAO,KAAK,SAAS,KAAK;AAChC,MAAI,SAAS,OACT,QAAO;EACX,MAAM,OAAO,EAAE,OAAO,QAAW;AACjC,OAAK,MAAM,IAAI,MAAM,SAAS,KAAK,CAAC;EACpC,MAAM,QAAQ,KAAK,MAAM,MAAM,KAAK,EAAE,QAAQ,MAAM,KAAK,CAAC;AAC1D,OAAK,QAAQ;AACb,OAAK,MAAM,IAAI,MAAM,MAAM;AAC3B,SAAO;;CAEX,MAAM,MAAM,MAAM;AACd,MAAI,KAAK,UAAU,OAAO,OAAO,KAAK,SAAS,SAC3C,QAAO,KAAK,IAAI,KAAK,MAAM,KAAK;AACpC,MAAI,KAAK,UAAU,QAAQ,KAAK,0BAA0B,UAAa,KAAK,qBAAqB,QAC7F,QAAO,qBAAqB,KAAK,WAAW,MAAM,KAAK,CAAC;EAE5D,MAAM,QAAQ,KAAK,MAAM,MAAM,KAAK;AACpC,SAAO,KAAK,WAAW,KAAK,EAAE,WAAW,MAAM,KAAK,GAAG,YAAY,KAAK,OAAO,MAAM,MAAM,GAAG;;;;;;CAMlG,SAAS,MAAM;EACX,IAAI;AACJ,OAAK,MAAM,KAAK,KACZ,KAAI,MAAM,OACN,QAAO,KAAK;WACP,CAAC,iBAAiB,IAAI,EAAE,CAC7B,QAAO;AAEf,MAAI,SAAS,OACT,QAAO;AACX,SAAO,OAAO,SAAS,WAAW,YAAY,IAAI,KAAK,GAAG;;;CAG9D,MAAM,MAAM,MAAM;EACd,MAAM,QAAQ,EAAE;EAChB,MAAM,QAAQ,KAAK,SAAS,SAAY,SAAY,MAAM,QAAQ,KAAK,KAAK,GAAG,KAAK,OAAO,CAAC,KAAK,KAAK;EACtG,MAAM,SAAS,OAAO,WAAW,IAAI,MAAM,KAAK;EAChD,IAAI,cAAc;AAClB,MAAI,WAAW,SAAS;AACpB,SAAM,KAAK,WAAW,OAAO,KAAK,UAAU,IAAI,GAAG,OAAO,KAAK,UAAU,IAAI,OAAO,kBAAkB,CAAC;AACvG,iBAAc;SAEb;GACD,MAAM,SAAS,KAAK,YAAY,MAAM,WAAW,SAAS;AAC1D,OAAI,WAAW,OACX,OAAM,KAAK,OAAO;GACtB,MAAM,UAAU,WAAW,YAAY,WAAW;GAClD,MAAMC,WAAS,KAAK,YAAY,MAAM,WAAW,WAAW,IAAI,WAAW,YAAY,IAAI,EAAE;AAC7F,OAAIA,aAAW,OACX,OAAM,KAAKA,SAAO;GACtB,MAAM,SAAS,KAAK,YAAY,MAAM,MAAM,WAAW,SAAS;AAChE,OAAI,WAAW,OACX,OAAM,KAAK,OAAO;GACtB,MAAM,QAAQ,KAAK,WAAW,MAAM,MAAM,WAAW,QAAQ;AAC7D,OAAI,UAAU,OACV,OAAM,KAAK,MAAM;AACrB,iBACK,WAAW,YAAY,WAAW,UAC9B,WAAWA,aAAW,UACtB,WAAW,YAAY,WAAW,UAClC,WAAW,WAAW,UAAU;;AAE7C,MAAI,UAAU,UAAa,CAAC,YACxB,OAAM,QAAQ,UAAU,MAAM,CAAC;AACnC,OAAK,QAAQ,MAAM,MAAM,MAAM;AAC/B,SAAO,IAAI,MAAM;;CAGrB,QAAQ,MAAM,MAAM,OAAO;AACvB,MAAI,MAAM,QAAQ,KAAK,KAAK,CACxB,OAAM,KAAK,UAAU,KAAK,KAAK,CAAC;AACpC,MAAI,OAAO,OAAO,MAAM,QAAQ,CAC5B,OAAM,KAAK,WAAW,KAAK,MAAM,CAAC;AACtC,MAAI,MAAM,QAAQ,KAAK,MAAM,CACzB,OAAM,KAAK,IAAI,KAAK,MAAM,KAAK,MAAM,KAAK,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC;AAC/D,MAAI,MAAM,QAAQ,KAAK,MAAM,CACzB,OAAM,KAAK,KAAK,MAAM,KAAK,OAAO,MAAM,MAAM,CAAC;AACnD,MAAI,MAAM,QAAQ,KAAK,MAAM,CACzB,OAAM,KAAK,KAAK,MAAM,KAAK,OAAO,MAAM,KAAK,CAAC;AAClD,MAAI,KAAK,QAAQ,OACb,OAAM,KAAK,SAAS,KAAK,MAAM,KAAK,KAAK,KAAK,CAAC,CAAC;AACpD,MAAI,KAAK,OAAO,WAAc,KAAK,SAAS,UAAa,KAAK,SAAS,SAAY;GAC/E,MAAM,OAAO,KAAK,SAAS,SAAY,SAAS,KAAK,MAAM,KAAK,MAAM,KAAK;GAC3E,MAAM,YAAY,KAAK,SAAS,SAAY,SAAS,KAAK,MAAM,KAAK,MAAM,KAAK;AAChF,SAAM,KAAK,QAAQ,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,MAAM,UAAU,CAAC;;AAEnE,MAAI,OAAO,KAAK,SAAS,SACrB,OAAM,KAAK,KAAK,IAAI,KAAK,MAAM,KAAK,CAAC;AACzC,MAAI,KAAK,UAAU,OAAO,OAAO,KAAK,gBAAgB,SAClD,OAAM,KAAK,KAAK,WAAW,KAAK,aAAa,KAAK,CAAC;;CAG3D,MAAM,UAAU,MAAM,YAAY;EAC9B,MAAM,eAAe,SAAS,KAAK,MAAM,KAAK,MAAM,GAAG,KAAK,CAAC;AAC7D,SAAQ,WAAW,UAAU,WAAW,IACpC,KAAK,OAAO,UAAU,KAAK,KAC1B,aAAa,SAAS,QAAQ,CAAC,GAAG,SAAS,QAAQ,CAAC;;CAE7D,IAAI,KAAK,MAAM;EACX,MAAM,SAAS,KAAK,EAAE,QAAQ,KAAK,KAAK;EACxC,MAAM,QAAQ,KAAK,MAAM,OAAO,MAAM,OAAO,KAAK;AAClD,SAAO,KAAK,WAAW,OAAO,SAAS,OAAO,YAAY,KAAK,OAAO,OAAO,MAAM,MAAM,GAAG;;CAEhG,WAAW,KAAK,MAAM;EAClB,MAAM,WAAW,KAAK,UAAU,KAAK,KAAK;AAC1C,MAAI,aAAa,OACb,QAAO,KAAK,IAAI,KAAK,KAAK;EAC9B,MAAM,EAAE,SAAS,SAAS;EAC1B,MAAM,WAAW,KAAK,MAAM,QAAQ,MAAM,QAAQ,KAAK;EACvD,MAAM,SAAS,KAAK,cAAc,OAAO,MAAM,MAAM,KAAK,MAAM,MAAM,EAAE,CAAC;EACzE,MAAM,QAAQ,KAAK;AACnB,UAAQ,MAAM;AACV,QAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;IACnC,MAAM,QAAQ,OAAO,MAAM,GAAG;AAC9B,QAAI,UAAU,KACV,QAAO,MAAM,EAAE;;AAEvB,UAAO,SAAS,EAAE;;;;CAI1B,UAAU,KAAK,MAAM;EACjB,MAAM,UAAU,KAAK,EAAE,QAAQ,KAAK,KAAK;EACzC,MAAM,MAAM,WAAW,KAAK,KAAK;EACjC,MAAM,OAAO,IAAI,MAAM,WAAW,IAAI,CAAC,SAAS,EAAE;EAClD,MAAM,WAAW,eAAe,QAAQ,KAAK,IAAI,QAAQ,KAAK,mBAAmB;AACjF,MAAI,SAAS,MAAM,KAAK,WAAW,IAAI,IAAI,CAAC,SACxC,QAAO;AACX,MAAI,CAAC,KAAK,QACN,OAAM;AACV,SAAO;GAAE;GAAS;GAAM;;CAG5B,cAAc,MAAM,WAAS;EACzB,MAAM,wBAAQ,IAAI,KAAK;AACvB,UAAQ,QAAQ;GACZ,MAAM,MAAM,GAAG,IAAI,GAAG;GACtB,IAAI,QAAQ,MAAM,IAAI,IAAI;AAC1B,OAAI,UAAU,QAAW;IACrB,MAAM,SAAS,KAAK,EAAE,eAAe,IAAI,IAAI;AAC7C,YAAQ,WAAW,SAAY,OAAOC,UAAQ,QAAQ,KAAK,EAAE,OAAO,IAAI,OAAO,IAAI,IAAI;AACvF,UAAM,IAAI,KAAK,MAAM;;AAEzB,UAAO;;;;CAIf,OAAO,UAAU,MAAM;AACnB,MAAI,SAAS,SAAS,EAClB,QAAO;EACX,MAAM,WAAW,EAAE;AACnB,OAAK,MAAM,UAAU,UAAU;AAC3B,OAAI,CAAC,eAAe,OAAO,CACvB,QAAO;GACX,MAAM,MAAM,OAAO,OAAO,SAAS,YAAY,OAAO,KAAK,OAAO,CAAC,WAAW,IAAI,OAAO,OAAO;GAChG,MAAM,OAAO,QAAQ,SAAY,SAAS,KAAK,EAAE,QAAQ,KAAK,KAAK,EAAE,QAAQ,QAAQ,KAAK,CAAC,CAAC;AAC5F,OAAI,CAAC,eAAe,KAAK,CACrB,QAAO;AACX,YAAS,KAAK,KAAK;;EAEvB,MAAM,QAAQ,SAAS,GAAG;AAC1B,MAAI,CAAC,eAAe,MAAM,CACtB,QAAO;AACX,OAAK,MAAM,OAAO,OAAO,KAAK,MAAM,EAAE;GAClC,MAAM,OAAO,SAAS,KAAK,MAAM,MAAM,GAAG,IAAI,CAAC;AAC/C,OAAI,KAAK,MAAM,MAAM,MAAM,OAAU,IAAI,IAAI,IAAI,KAAK,CAAC,SAAS,KAAK,OACjE;AACJ,UAAO,YAAY,KAAK,MAAM,SAAS,KAAK,MAAM,KAAK,MAAM,GAAG,KAAK,CAAC,CAAC;;;CAI/E,YAAY,MAAM,QAAQ;EACtB,MAAM,MAAM,OAAO,KAAK,UAAU,IAAI;EACtC,MAAM,MAAM,OAAO,KAAK,UAAU,IAAI,OAAO;EAC7C,MAAM,KAAK,OAAO,KAAK,YAAY,WAAW,YAAY,KAAK,QAAQ,GAAG;EAC1E,MAAM,SAAS,KAAK,YAAY,UAAa,OAAO,KAAK,WAAW,YAAY,OAAO,OAAO,KAAK,SAAS,KAAK,OAAO,GAClH,KAAK,QAAQ,KAAK,UAClB;AACN,MAAI,QAAQ,KAAK,QAAQ,OAAO,qBAAqB,OAAO,UAAa,WAAW,OAChF,QAAO;AACX,SAAO,YAAY,QAAQ,KAAK,KAAK,IAAI,OAAO;;CAEpD,YAAY,MAAM,MAAM;EACpB,MAAM,MAAM,OAAO,KAAK,QAAQ;EAChC,MAAM,MAAM,OAAO,KAAK,QAAQ;EAChC,MAAM,OAAO,OAAO,KAAK,iBAAiB;EAC1C,MAAM,OAAO,OAAO,KAAK,iBAAiB;EAC1C,MAAM,aAAa,OAAO,KAAK,WAAW;AAC1C,MAAI;GAAC;GAAK;GAAK;GAAM;GAAM;GAAW,CAAC,OAAO,MAAM,MAAM,OAAU,CAChE,QAAO;EACX,MAAM,MAAM,OAAO;AACnB,SAAO,YAAY,MAAM,OAAO,CAAC,KAAK,OAAO,KAAK,QAAQ,CAAC,KAAK,QAAQ,KAAK,WAAW;;CAE5F,YAAY,MAAM,MAAM,QAAQ;EAC5B,MAAM,WAAW,cAAc,OAAO,MAAM,KAAK,OAAO,OAAU;EAElE,MAAM,OAAO,KAAK,WAAW,MAAM,MAAM,WAAY,SAAS,eAAe,cAAe,WAAW;AACvG,MAAI,SAAS,UAAa,SACtB,QAAO;EACX,MAAM,QAAQ,SAAS,SAAY,EAAE,GAAG,CAAC,KAAK;AAC9C,MAAI,KAAK,kBAAkB,OACvB,OAAM,KAAK,mBAAmB,KAAK,MAAM,KAAK,eAAe,KAAK,CAAC,CAAC;EACxE,MAAM,gBAAgB,OAAO,KAAK,cAAc;EAChD,MAAM,gBAAgB,OAAO,KAAK,cAAc;AAChD,MAAI,kBAAkB,UAAa,kBAAkB,OACjD,OAAM,KAAK,mBAAmB,iBAAiB,GAAG,iBAAiB,OAAO,kBAAkB,CAAC;EAEjG,MAAM,oBAAoB,EAAE;EAC5B,MAAM,mBAAmB,EAAE;AAC3B,MAAI,KAAK,UAAU,KAAK;AACpB,QAAK,MAAM,CAAC,GAAG,SAAS,QAAQ,KAAK,kBAAkB,CACnD,KAAI,MAAM,QAAQ,KAAK,CACnB,mBAAkB,KAAK,CAAC,GAAG,KAAK,CAAC;AACzC,QAAK,MAAM,CAAC,GAAG,MAAM,QAAQ,KAAK,iBAAiB,CAC/C,kBAAiB,KAAK,CAAC,GAAG,KAAK,MAAM,GAAG,KAAK,CAAC,CAAC;;AAEvD,OAAK,MAAM,CAAC,GAAG,MAAM,QAAQ,KAAK,aAAa,CAC3C,KAAI,MAAM,QAAQ,EAAE,CAChB,mBAAkB,KAAK,CAAC,GAAG,EAAE,CAAC;MAE9B,kBAAiB,KAAK,CAAC,GAAG,KAAK,MAAM,GAAG,KAAK,CAAC,CAAC;AAEvD,MAAI,kBAAkB,SAAS,EAC3B,OAAM,KAAK,uBAAuB,kBAAkB,CAAC;AACzD,MAAI,iBAAiB,SAAS,EAC1B,OAAM,KAAK,sBAAsB,iBAAiB,CAAC;AACvD,MAAI,MAAM,WAAW,EACjB,QAAO,SAAS,YAAY;AAChC,SAAO,YAAY,IAAI,MAAM,EAAE,OAAO;;CAE1C,WAAW,MAAM,MAAM,OAAO;EAC1B,MAAM,aAAa,eAAe,KAAK,WAAW,GAAG,KAAK,aAAa,EAAE;EACzE,MAAM,WAAW,MAAM,QAAQ,KAAK,SAAS,GAAG,KAAK,SAAS,QAAQ,MAAM,OAAO,MAAM,SAAS,GAAG,EAAE;EACvG,MAAM,WAAW,eAAe,KAAK,kBAAkB,GAAG,KAAK,oBAAoB,EAAE;EACrF,MAAM,aAAa,KAAK;EACxB,MAAM,OAAO,OAAO,KAAK,WAAW;EACpC,MAAM,cAAc,OAAO,KAAK,SAAS;AACzC,MAAI,KAAK,SAAS,SAAS,SAAS,YAAY,WAAW,MACtD,eAAe,UAAa,eAAe,MAC5C;EAGJ,MAAMC,YAAU,EAAE;AAClB,OAAK,MAAM,KAAK,MAAM;GAClB,MAAM,QAAQ,KAAK,MAAM,WAAW,IAAI,KAAK;GAC7C,MAAM,SAAS,WAAW,IAAI,MAAM,IAAI,MACnC,SAAS,SAAS,EAAE,GAAG,WAAW,MAClC,KAAK,OAAO,YAAY,YAAY;AACzC,aAAQ,KAAK,GAAG,OAAO,MAAM;;EAEjC,MAAM,gBAAgB,SAAS,QAAQ,MAAM,CAAC,OAAO,OAAO,YAAY,EAAE,CAAC;EAC3E,MAAM,OAAO,YAAY,KAAK,MAAM,CAAC,YAAY,EAAE,EAAE,KAAK,MAAM,SAAS,IAAI,KAAK,CAAC,CAAC;EACpF,MAAM,QAAQ,eAAe,UAAa,eAAe,OAAO,SAAY,KAAK,MAAM,YAAY,KAAK;AACxG,MAAI,KAAK,WAAW,KAAK,cAAc,WAAW,MAAM,UAAU,UAAa,eAAe,QAAQ;GAClG,MAAM,gBAAgB,KAAK,QAAQ,MAAM,SAAS,SAAS,EAAE,CAAC,CAAC;AAC/D,UAAO,eAAeA,WAAS,eAAe,eAAe,OAAO,MAAM;;AAE9E,SAAO,WAAWA,WAAS,MAAM,eAAe,MAAM,OAAO,MAAM;;CAEvE,WAAW,MAAM,MAAM,QAAQ;EAC3B,IAAI,SAAS,EAAE;EACf,IAAI;AACJ,MAAI,MAAM,QAAQ,KAAK,MAAM,EAAE;AAC3B,YAAS,KAAK;AACd,UAAO,KAAK;SAEX;AACD,OAAI,KAAK,UAAU,OAAO,MAAM,QAAQ,KAAK,YAAY,CACrD,UAAS,KAAK;AAClB,UAAO,KAAK;;EAEhB,MAAM,eAAe,OAAO,KAAK,MAAM,KAAK,MAAM,GAAG,KAAK,CAAC;EAC3D,MAAM,YAAY,SAAS,UAAa,SAAS,OAAO,SAAY,KAAK,MAAM,MAAM,KAAK;EAC1F,MAAM,WAAW,OAAO,KAAK,SAAS;EACtC,MAAM,WAAW,OAAO,KAAK,SAAS;AACtC,MAAI,KAAK,aAAa,UAClB,KAAK,gBAAgB,SACpB,aAAa,SAAS,KAAK,cAAc,QAG1C,QAAO,UADO,SAAS,eAAe,aACd,YAAY,GAAG,YAAY,OAAO,mBAAmB,cAAc,UAAU;EAEzG,MAAM,QAAQ,EAAE;AAChB,MAAI,aAAa,SAAS,KAAK,cAAc,OACzC,OAAM,KAAK,WAAW,cAAc,UAAU,CAAC;AACnD,MAAI,aAAa,UAAa,aAAa,OACvC,OAAM,KAAK,YAAY,YAAY,GAAG,YAAY,OAAO,kBAAkB,CAAC;AAEhF,MAAI,KAAK,aAAa,QAAW;GAC7B,MAAM,MAAM,KAAK,UAAU,MAAM,IAAK,OAAO,KAAK,YAAY,IAAI;GAClE,MAAM,MAAM,KAAK,UAAU,MAAM,OAAO,oBAAqB,OAAO,KAAK,YAAY,IAAI,OAAO;AAChG,SAAM,KAAK,cAAc,KAAK,MAAM,KAAK,UAAU,KAAK,EAAE,KAAK,IAAI,CAAC;;AAExE,MAAI,KAAK,gBAAgB,KACrB,OAAM,KAAK,YAAY;AAC3B,MAAI,MAAM,WAAW,EACjB,QAAO,SAAS,WAAW;AAC/B,SAAO,WAAW,IAAI,MAAM,EAAE,OAAO;;;CAGzC,WAAW,MAAM,MAAM;AACnB,MAAI,SAAS,KACT,QAAO;AACX,MAAI,SAAS,MACT,QAAO;AACX,MAAI,CAAC,eAAe,KAAK,CACrB,OAAM,IAAI,MAAM,gDAAgD,KAAK,UAAU,KAAK,GAAG;EAC3F,MAAM,SAAS,KAAK,gBAAgB,IAAI,KAAK;AAC7C,MAAI,WAAW,OACX,QAAO;EACX,MAAM,OAAO,EAAE,OAAO,QAAW;AACjC,OAAK,gBAAgB,IAAI,MAAM,mBAAmB,KAAK,CAAC;EACxD,MAAM,QAAQ,KAAK,gBAAgB,MAAM,KAAK,EAAE,QAAQ,MAAM,KAAK,CAAC;AACpE,OAAK,QAAQ;AACb,OAAK,gBAAgB,IAAI,MAAM,MAAM;AACrC,SAAO;;CAEX,gBAAgB,MAAM,MAAM;EACxB,MAAM,OAAO,EAAE;EACf,IAAI,YAAY;AAChB,OAAK,MAAM,KAAK,OAAO,KAAK,KAAK,CAC7B,KAAI,WAAW,IAAI,EAAE,CACjB,aAAY;MAEZ,MAAK,KAAK,KAAK;EAEvB,MAAM,QAAQ,KAAK,MAAM,MAAM,KAAK;EACpC,MAAM,QAAQ,EAAE;AAChB,MAAI,UACA,MAAK,gBAAgB,MAAM,MAAM,MAAM;EAC3C,MAAM,MAAM,MAAM,WAAW,IAAI,kBAAkB,MAAM,GAAG,YAAY,OAAO,MAAM;EACrF,MAAM,MAAM,KAAK,0BAA0B,UAAa,KAAK,qBAAqB,SAC5E,mBAAmB,IAAI,GACvB;AACN,SAAO,KAAK,WAAW,KAAK,EAAE,WAAW,MAAM,KAAK,GAAG,iBAAiB,KAAK,OAAO,MAAM,IAAI,GAAG;;CAErG,gBAAgB,MAAM,MAAM,OAAO;AAC/B,MAAI,KAAK,eAAe,UACpB,KAAK,sBAAsB,UAC3B,KAAK,yBAAyB,QAAW;GACzC,MAAM,QAAQ,QAAQ,KAAK,WAAW,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC,GAAG,KAAK,MAAM,GAAG,KAAK,CAAC,CAAC;GAChF,MAAM,OAAO,QAAQ,KAAK,kBAAkB,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC,YAAY,EAAE,EAAE,KAAK,MAAM,GAAG,KAAK,CAAC,CAAC;GACnG,MAAM,QAAQ,KAAK,yBAAyB,SAAY,SAAY,KAAK,MAAM,KAAK,sBAAsB,KAAK;AAC/G,SAAM,KAAK,eAAe,OAAO,MAAM,MAAM,CAAC;;AAElD,MAAI,KAAK,gBAAgB,UAAa,KAAK,UAAU,UAAa,KAAK,aAAa,QAAW;GAC3F,MAAM,SAAS,MAAM,QAAQ,KAAK,YAAY,GACxC,KAAK,cACL,MAAM,QAAQ,KAAK,MAAM,GACrB,KAAK,QACL,EAAE;GACZ,MAAM,OAAO,MAAM,QAAQ,KAAK,MAAM,GAAG,KAAK,kBAAkB,KAAK;AACrE,SAAM,KAAK,cAAc,OAAO,KAAK,MAAM,KAAK,MAAM,GAAG,KAAK,CAAC,EAAE,SAAS,SAAY,SAAY,KAAK,MAAM,MAAM,KAAK,EAAE,KAAK,aAAa,SAAY,SAAY,KAAK,MAAM,KAAK,UAAU,KAAK,EAAE,OAAO,KAAK,YAAY,IAAI,GAAG,OAAO,KAAK,YAAY,IAAI,OAAO,kBAAkB,CAAC;;AAE9R,MAAI,MAAM,QAAQ,KAAK,MAAM,CACzB,MAAK,MAAM,KAAK,KAAK,MACjB,OAAM,KAAK,KAAK,WAAW,GAAG,KAAK,CAAC;AAC5C,MAAI,MAAM,QAAQ,KAAK,MAAM,CACzB,OAAM,KAAK,YAAY,KAAK,MAAM,KAAK,MAAM,KAAK,WAAW,GAAG,KAAK,CAAC,EAAE,MAAM,CAAC;AACnF,MAAI,MAAM,QAAQ,KAAK,MAAM,CACzB,OAAM,KAAK,YAAY,KAAK,MAAM,KAAK,MAAM,KAAK,WAAW,GAAG,KAAK,CAAC,EAAE,KAAK,CAAC;AAClF,MAAI,KAAK,OAAO,QAAW;GACvB,MAAM,OAAO,KAAK,SAAS,SAAY,SAAY,KAAK,WAAW,KAAK,MAAM,KAAK;GACnF,MAAM,YAAY,KAAK,SAAS,SAAY,SAAY,KAAK,WAAW,KAAK,MAAM,KAAK;AACxF,SAAM,KAAK,WAAW,KAAK,WAAW,KAAK,IAAI,KAAK,EAAE,MAAM,UAAU,CAAC;;AAE3E,MAAI,OAAO,KAAK,SAAS,SACrB,OAAM,KAAK,KAAK,cAAc,KAAK,MAAM,KAAK,CAAC;AACnD,MAAI,OAAO,KAAK,gBAAgB,SAC5B,OAAM,KAAK,KAAK,qBAAqB,KAAK,aAAa,KAAK,CAAC;AACjE,OAAK,MAAM,CAAC,GAAG,MAAM,QAAQ,KAAK,iBAAiB,CAC/C,OAAM,KAAK,kBAAkB,GAAG,KAAK,WAAW,GAAG,KAAK,CAAC,CAAC;AAC9D,MAAI,KAAK,0BAA0B,OAC/B,OAAM,KAAK,sBAAsB,KAAK,MAAM,KAAK,uBAAuB,KAAK,CAAC,CAAC;AAEnF,MAAI,KAAK,qBAAqB,OAC1B,OAAM,KAAK,iBAAiB,KAAK,MAAM,KAAK,kBAAkB,KAAK,CAAC,CAAC;;CAE7E,cAAc,KAAK,MAAM;EACrB,MAAM,SAAS,KAAK,EAAE,QAAQ,KAAK,KAAK;EACxC,MAAM,QAAQ,KAAK,WAAW,OAAO,MAAM,OAAO,KAAK;AACvD,SAAO,KAAK,WAAW,OAAO,SAAS,OAAO,iBAAiB,KAAK,OAAO,OAAO,MAAM,MAAM,GAAG;;CAErG,qBAAqB,KAAK,MAAM;EAC5B,MAAM,WAAW,KAAK,UAAU,KAAK,KAAK;AAC1C,MAAI,aAAa,OACb,QAAO,KAAK,cAAc,KAAK,KAAK;EACxC,MAAM,EAAE,SAAS,SAAS;EAC1B,MAAM,WAAW,KAAK,WAAW,QAAQ,MAAM,QAAQ,KAAK;EAC5D,MAAM,SAAS,KAAK,cAAc,OAAO,MAAM,MAAM,KAAK,WAAW,MAAM,EAAE,CAAC;EAC9E,MAAM,QAAQ,KAAK;AACnB,UAAQ,GAAG,MAAM;AACb,QAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;IACnC,MAAM,QAAQ,OAAO,MAAM,GAAG;AAC9B,QAAI,UAAU,KACV,QAAO,MAAM,GAAG,EAAE;;AAE1B,UAAO,SAAS,GAAG,EAAE;;;;;AAKjC,MAAa,mBAAmB,IAAI,IAAI;CACpC;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACH,CAAC;AAEF,MAAM,gBAAgB;CAClB;CACA;CACA;CACA;CACA;CACA;CACH;AAED,MAAM,aAAa,IAAI,IAAI;CACvB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACH,CAAC;;AAEF,SAAS,WAAW,UAAU,YAAY;CACtC,MAAM,SAAS,EAAE;AACjB,MAAK,MAAM,UAAU,UAAU;AAC3B,MAAI,CAAC,eAAe,OAAO,IAAI,CAAC,OAAO,OAAO,QAAQ,QAAQ,CAC1D,QAAO;AACX,OAAK,MAAM,KAAK,OAAO,KAAK,OAAO,CAC/B,KAAI,MAAM,WAAW,CAAC,iBAAiB,IAAI,EAAE,CACzC,QAAO;AACf,MAAI,OAAO,OAAO,UAAU,YAAY,OAAO,UAAU,KACrD,QAAO;AACX,MAAI,cAAc,OAAO,SAAS,OAAO,MAAM,CAC3C,QAAO;AACX,SAAO,KAAK,OAAO,MAAM;;AAE7B,QAAO,UAAU,OAAO;;AAG5B,SAAS,MAAM,QAAQ,KAAK;CACxB,MAAM,aAAa,OAAO;AAC1B,KAAI,OAAO,SAAS,YAAY,CAAC,MAAM,QAAQ,OAAO,SAAS,IAAI,CAAC,OAAO,SAAS,SAAS,IAAI,CAC7F,QAAO;CACX,MAAM,MAAM,eAAe,WAAW,GAAG,WAAW,OAAO;AAC3D,KAAI,CAAC,eAAe,IAAI,IAAI,CAAC,OAAO,OAAO,KAAK,QAAQ,CACpD,QAAO;AACX,QAAO,OAAO,IAAI,UAAU,YAAY,IAAI,UAAU,OAAO,SAAY,IAAI;;AAEjF,SAAS,OAAO,OAAO;AACnB,QAAO,OAAO,UAAU,WAAW,QAAQ;;AAE/C,SAAS,QAAQ,OAAO;AACpB,QAAO,eAAe,MAAM,GAAG,OAAO,QAAQ,MAAM,GAAG,EAAE;;;;;;AC1gB7D,IAAa,YAAb,MAAuB;CACnB;CACA;;;;;CAKA,OAAO;CACP,YAAY,YAAU,QAAQ;AAC1B,OAAK,IAAIC;AACT,OAAK,SAAS;AACd,aAAS,MAAM;;;CAGnB,OAAO,OAAO;EACV,MAAM,MAAM,EAAE;AACd,MAAI;AACA,QAAK,KAAK,KAAK,QAAQ,KAAK,EAAE,EAAE,UAAU,OAAO,IAAI,IAAI;YAErD;AACJ,QAAK,OAAO;;AAEhB,MAAI,IAAI,WAAW,EACf,KAAI,KAAK;GAAE,MAAM;GAAI,SAAS;GAAU,SAAS;GAAW,CAAC;AACjE,SAAO;;CAEX,GAAG,MAAM,MAAM,GAAG;AACd,SAAO,KAAK,EAAE,MAAM,MAAM,KAAK,CAAC,EAAE;;CAGtC,KAAK,MAAM,MAAM,GAAG,MAAM,KAAK;AAC3B,MAAI,SAAS,KACT;AACJ,MAAI,SAAS,OAAO;AAChB,OAAI,KAAK;IAAE;IAAM,SAAS;IAAS,SAAS;IAA4B,CAAC;AACzE;;AAEJ,MAAI,CAAC,eAAe,KAAK,CACrB;EACJ,MAAM,IAAI,KAAK,EAAE,EAAE,QAAQ,MAAM,KAAK;AACtC,MAAI,KAAK,GAAG,MAAM,GAAG,EAAE,CACnB;EACJ,MAAM,QAAQ,IAAI;EAClB,MAAM,QAAQ,SAAS,SAAS,KAAK,SAAS;AAC1C,OAAI,KAAK;IAAE,MAAM;IAAI;IAAS;IAAS,CAAC;;AAE5C,MAAI,KAAK,EAAE,UAAU,OAAO,OAAO,KAAK,SAAS,UAAU;AACvD,QAAK,QAAQ,KAAK,MAAM,GAAG,GAAG,MAAM,IAAI;AACxC;;AAEJ,MAAI,KAAK,SAAS,QAAW;GACzB,MAAM,QAAQ,MAAM,QAAQ,KAAK,KAAK,GAAG,KAAK,OAAO,CAAC,KAAK,KAAK;AAEhE,OAAI,CADW,MAAM,KAAK,OAAO,OAAO,MAAM,WAAW,YAAY,IAAI,EAAE,GAAG,WAAc,MAAM,CACtF,MAAM,UAAU,MAAM,EAAE,CAAC,EAAE;AACnC,SAAK,QAAQ,YAAY,MAAM,KAAK,OAAO,CAAC,QAAQ,SAAS,EAAE,GAAG;AAClE;;;AAGR,MAAI,MAAM,QAAQ,KAAK,KAAK,IAAI,CAAC,UAAU,KAAK,KAAK,CAAC,EAAE,CACpD,MAAK,QAAQ,mBAAmB,WAAW,KAAK,KAAK,GAAG;AAC5D,MAAI,OAAO,OAAO,MAAM,QAAQ,IAAI,CAAC,WAAW,KAAK,MAAM,CAAC,EAAE,CAC1D,MAAK,SAAS,YAAY,KAAK,UAAU,KAAK,MAAM,GAAG;AAC3D,MAAI,OAAO,MAAM,YAAY,KAAK,SAAS,QACvC,MAAK,WAAW,MAAM,GAAG,KAAK;AAClC,MAAI,aAAa,cAAc,KAAK,SAAS,QACzC,MAAK,UAAU,MAAM,GAAG,KAAK;AACjC,MAAI,OAAO,MAAM,SACb,MAAK,WAAW,MAAM,GAAG,KAAK;AAClC,MAAI,SAAS,EAAE,CACX,MAAK,WAAW,MAAM,GAAG,GAAG,MAAM,KAAK,KAAK;AAChD,MAAI,MAAM,QAAQ,EAAE,CAChB,MAAK,UAAU,MAAM,GAAG,GAAG,MAAM,KAAK,KAAK;AAC/C,MAAI,MAAM,QAAQ,KAAK,MAAM,CACzB,MAAK,MAAM,KAAK,KAAK,MACjB,MAAK,KAAK,GAAG,GAAG,GAAG,MAAM,IAAI;AACrC,MAAI,MAAM,QAAQ,KAAK,MAAM,CACzB,MAAK,UAAU,KAAK,OAAO,GAAG,GAAG,MAAM,KAAK,MAAM;AACtD,MAAI,MAAM,QAAQ,KAAK,MAAM,CACzB,MAAK,UAAU,KAAK,OAAO,GAAG,GAAG,MAAM,KAAK,KAAK;AACrD,MAAI,KAAK,QAAQ,UAAa,KAAK,GAAG,KAAK,KAAK,GAAG,EAAE,CACjD,MAAK,OAAO,mCAAmC;AACnD,MAAI,KAAK,OAAO,QAAW;GACvB,MAAM,SAAS,KAAK,GAAG,KAAK,IAAI,GAAG,EAAE,GAAG,KAAK,OAAO,KAAK;AACzD,OAAI,WAAW,OACX,MAAK,KAAK,QAAQ,GAAG,GAAG,MAAM,IAAI;;AAE1C,MAAI,OAAO,KAAK,SAAS,SACrB,MAAK,QAAQ,KAAK,MAAM,GAAG,GAAG,MAAM,IAAI;AAC5C,MAAI,IAAI,WAAW,UAAU,KAAK,0BAA0B,UAAa,KAAK,qBAAqB,QAC/F,MAAK,gBAAgB,MAAM,GAAG,GAAG,MAAM,IAAI;AAE/C,MAAI,IAAI,WAAW,SAAS,OAAO,KAAK,gBAAgB,SACpD,MAAK,eAAe,mDAAmD;;CAG/E,QAAQ,KAAK,MAAM,GAAG,MAAM,KAAK;EAC7B,MAAM,SAAS,KAAK,EAAE,EAAE,QAAQ,KAAK,KAAK;AAC1C,MAAI,OAAO,SAAS,SAAS,KAAK,EAAE,EAAE,aAAa,KAAK,KAAK,EAAE;AAC3D,OAAI,KAAK;IAAE;IAAM,SAAS;IAAQ,SAAS,wBAAwB;IAAO,CAAC;AAC3E;;AAEJ,MAAI,CAAC,eAAe,OAAO,KAAK,IAAI,OAAO,MAAM,YAAY,MAAM,MAAM;AACrE,QAAK,KAAK,OAAO,MAAM,OAAO,MAAM,GAAG,MAAM,IAAI;AACjD;;AAEJ,OAAK,yBAAS,IAAI,KAAK;EACvB,IAAI,SAAS,KAAK,KAAK,IAAI,OAAO,KAAK;EACvC,MAAM,QAAQ,QAAQ,IAAI,EAAE;AAC5B,MAAI,UAAU,UAAa,MAAM,SAAS,MAAM;AAC5C,OAAI,KAAK,GAAG,MAAM,OAAO;AACzB;;EAEJ,MAAM,SAAS,EAAE;AACjB,OAAK,KAAK,OAAO,MAAM,OAAO,MAAM,GAAG,MAAM,OAAO;AACpD,MAAI,WAAW,QAAW;AACtB,4BAAS,IAAI,KAAK;AAClB,QAAK,KAAK,IAAI,OAAO,MAAM,OAAO;;AAEtC,SAAO,IAAI,GAAG;GAAE;GAAM;GAAQ,CAAC;AAC/B,MAAI,KAAK,GAAG,OAAO;;CAEvB,WAAW,MAAM,GAAG,MAAM;EACtB,MAAM,IAAI,WAAW,EAAE;AACvB,MAAI,OAAO,KAAK,cAAc,YAAY,IAAI,KAAK,UAC/C,MAAK,aAAa,qBAAqB,KAAK,UAAU,aAAa;AAEvE,MAAI,OAAO,KAAK,cAAc,YAAY,IAAI,KAAK,UAC/C,MAAK,aAAa,oBAAoB,KAAK,UAAU,aAAa;AAEtE,MAAI,OAAO,KAAK,YAAY,YAAY,CAAC,YAAY,KAAK,QAAQ,CAAC,KAAK,EAAE,CACtE,MAAK,WAAW,qBAAqB,KAAK,UAAU;EAExD,MAAM,UAAU,KAAK,EAAE;EACvB,MAAM,SAAS,YAAY,UAAa,OAAO,KAAK,WAAW,YAAY,OAAO,OAAO,SAAS,KAAK,OAAO,GACxG,QAAQ,KAAK,UACb;AACN,MAAI,WAAW,UAAa,CAAC,OAAO,EAAE,CAClC,MAAK,UAAU,mBAAmB,KAAK,SAAS;;CAExD,UAAU,MAAM,GAAG,MAAM;AACrB,MAAI,OAAO,KAAK,cAAc,YAAY,EAAE,SAAS,KAAK,UACtD,MAAK,aAAa,qBAAqB,KAAK,UAAU,QAAQ;AAElE,MAAI,OAAO,KAAK,cAAc,YAAY,EAAE,SAAS,KAAK,UACtD,MAAK,aAAa,oBAAoB,KAAK,UAAU,QAAQ;;CAGrE,WAAW,MAAM,GAAG,MAAM;AACtB,MAAI,OAAO,KAAK,YAAY,YAAY,IAAI,KAAK,QAC7C,MAAK,WAAW,eAAe,KAAK,UAAU;AAClD,MAAI,OAAO,KAAK,YAAY,YAAY,IAAI,KAAK,QAC7C,MAAK,WAAW,eAAe,KAAK,UAAU;AAClD,MAAI,OAAO,KAAK,qBAAqB,YAAY,KAAK,KAAK,iBACvD,MAAK,oBAAoB,cAAc,KAAK,mBAAmB;AAEnE,MAAI,OAAO,KAAK,qBAAqB,YAAY,KAAK,KAAK,iBACvD,MAAK,oBAAoB,cAAc,KAAK,mBAAmB;AAEnE,MAAI,OAAO,KAAK,eAAe,YAAY,CAAC,WAAW,GAAG,KAAK,WAAW,CACtE,MAAK,cAAc,0BAA0B,KAAK,aAAa;;CAGvE,WAAW,MAAM,GAAG,GAAG,MAAM,KAAK,MAAM;EACpC,MAAM,aAAa,eAAe,KAAK,WAAW,GAAG,KAAK,aAAa,EAAE;EACzE,MAAM,WAAW,MAAM,QAAQ,KAAK,SAAS,GAAG,KAAK,WAAW,EAAE;AAClE,OAAK,MAAM,KAAK,SACZ,KAAI,OAAO,MAAM,aAAa,CAAC,OAAO,OAAO,GAAG,EAAE,IAAI,EAAE,OAAO,QAC3D,MAAK,YAAY,WAAW,QAAQ,MAAM,EAAE,CAAC;AAErD,OAAK,MAAM,KAAK,OAAO,KAAK,WAAW,CACnC,KAAI,OAAO,OAAO,GAAG,EAAE,IAAI,EAAE,OAAO,OAChC,MAAK,KAAK,WAAW,IAAI,GAAG,EAAE,IAAI,QAAQ,MAAM,EAAE,EAAE,IAAI;EAEhE,MAAM,WAAW,eAAe,KAAK,kBAAkB,GAAG,OAAO,QAAQ,KAAK,kBAAkB,GAAG,EAAE;AACrG,OAAK,MAAM,KAAK,OAAO,KAAK,EAAE,EAAE;GAC5B,IAAI,UAAU,OAAO,OAAO,YAAY,EAAE;AAC1C,QAAK,MAAM,CAAC,GAAG,MAAM,SACjB,KAAI,YAAY,EAAE,CAAC,KAAK,EAAE,EAAE;AACxB,cAAU;AACV,SAAK,KAAK,GAAG,GAAG,EAAE,IAAI,QAAQ,MAAM,EAAE,EAAE,IAAI;;AAGpD,OAAI,CAAC,WAAW,KAAK,yBAAyB,OAC1C,KAAI,KAAK,yBAAyB,MAC9B,MAAK,wBAAwB,iBAAiB,QAAQ,MAAM,EAAE,CAAC;OAE/D,MAAK,KAAK,KAAK,sBAAsB,GAAG,EAAE,IAAI,QAAQ,MAAM,EAAE,EAAE,IAAI;AAE5E,OAAI,KAAK,kBAAkB,UAAa,CAAC,KAAK,GAAG,KAAK,eAAe,GAAG,EAAE,CACtE,MAAK,iBAAiB,yBAAyB,QAAQ,MAAM,EAAE,CAAC;;EAGxE,MAAM,QAAQ,OAAO,KAAK,EAAE,CAAC;AAC7B,MAAI,OAAO,KAAK,kBAAkB,YAAY,QAAQ,KAAK,cACvD,MAAK,iBAAiB,qBAAqB,KAAK,cAAc,aAAa;AAE/E,MAAI,OAAO,KAAK,kBAAkB,YAAY,QAAQ,KAAK,cACvD,MAAK,iBAAiB,oBAAoB,KAAK,cAAc,aAAa;EAE9E,MAAM,eAAe;GACjB,GAAI,KAAK,EAAE,UAAU,OAAO,CAAC,eAAe,KAAK,kBAAkB,GAAG,EAAE,GAAG,KAAK;GAChF,GAAI,eAAe,KAAK,aAAa,GAAG,KAAK,eAAe,EAAE;GACjE;AACD,OAAK,MAAM,CAAC,GAAG,MAAM,OAAO,QAAQ,aAAa,EAAE;AAC/C,OAAI,CAAC,OAAO,OAAO,GAAG,EAAE,CACpB;AACJ,OAAI,CAAC,MAAM,QAAQ,EAAE,CACjB,MAAK,KAAK,GAAG,GAAG,GAAG,MAAM,IAAI;OAE7B,MAAK,MAAM,KAAK,EACZ,KAAI,CAAC,OAAO,OAAO,GAAG,EAAE,CACpB,MAAK,qBAAqB,iBAAiB,EAAE,cAAc,QAAQ,MAAM,EAAE,CAAC;;AAE5F,MAAI,KAAK,EAAE,UAAU,OAAO,eAAe,KAAK,iBAAiB,EAC7D;QAAK,MAAM,CAAC,GAAG,MAAM,OAAO,QAAQ,KAAK,iBAAiB,CACtD,KAAI,OAAO,OAAO,GAAG,EAAE,CACnB,MAAK,KAAK,GAAG,GAAG,GAAG,MAAM,IAAI;;;CAG7C,UAAU,MAAM,GAAG,GAAG,MAAM,KAAK,MAAM;EACnC,IAAI,SAAS,EAAE;EACf,IAAI;AACJ,MAAI,MAAM,QAAQ,KAAK,MAAM,EAAE;AAC3B,YAAS,KAAK;AACd,UAAO,KAAK;SAEX;AACD,OAAI,KAAK,EAAE,UAAU,OAAO,MAAM,QAAQ,KAAK,YAAY,CACvD,UAAS,KAAK;AAClB,UAAO,KAAK;;AAEhB,OAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;GAC/B,MAAM,IAAI,IAAI,OAAO,SAAS,OAAO,KAAK;AAC1C,OAAI,MAAM,OACN,MAAK,KAAK,GAAG,GAAG,EAAE,IAAI,GAAG,KAAK,GAAG,KAAK,IAAI;;AAElD,MAAI,OAAO,KAAK,aAAa,YAAY,EAAE,SAAS,KAAK,SACrD,MAAK,YAAY,qBAAqB,KAAK,SAAS,QAAQ;AAEhE,MAAI,OAAO,KAAK,aAAa,YAAY,EAAE,SAAS,KAAK,SACrD,MAAK,YAAY,oBAAoB,KAAK,SAAS,QAAQ;AAE/D,MAAI,KAAK,gBAAgB,QAAQ,CAAC,YAAY,EAAE,CAC5C,MAAK,eAAe,wBAAwB;AAChD,MAAI,KAAK,aAAa,QAAW;GAC7B,MAAM,SAAS,KAAK,EAAE,UAAU;GAChC,MAAM,MAAM,UAAU,OAAO,KAAK,gBAAgB,WAAW,IAAI,KAAK;GACtE,MAAM,MAAM,UAAU,OAAO,KAAK,gBAAgB,WAAW,OAAO,oBAAoB,KAAK;AAC7F,OAAI,CAAC,cAAc,KAAK,EAAE,MAAM,KAAK,UAAU,EAAE,EAAE,KAAK,IAAI,CAAC,EAAE,CAC3D,MAAK,YAAY,gBAAgB,KAAK,IAAI,CAAC;;;CAIvD,UAAU,UAAU,GAAG,GAAG,MAAM,KAAK,YAAY;EAC7C,MAAM,UAAU,SAAS,QAAQ,MAAM,KAAK,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC;AACzD,MAAI,YAAY,KAAM,CAAC,cAAc,UAAU,EAC3C;EACJ,MAAM,UAAU,aAAa,UAAU;AACvC,MAAI,UAAU,GAAG;AACb,OAAI,KAAK;IAAE;IAAM;IAAS,SAAS;IAAqC,CAAC;AACzE;;EAGJ,MAAM,MAAM,KAAK,MAAM,UAAU,EAAE;AACnC,MAAI,QAAQ,UAAa,SAAS,EAAE,EAAE;GAClC,MAAM,IAAI,IAAI,OAAO,QAAQ,EAAE,IAAI,KAAK;AACxC,OAAI,IAAI,EACJ,KAAI,KAAK;IACL,MAAM,QAAQ,MAAM,IAAI,IAAI;IAC5B;IACA,SAAS,mBAAmB,WAAW,IAAI,OAAO;IACrD,CAAC;OAEF,MAAK,KAAK,SAAS,IAAI,GAAG,GAAG,MAAM,IAAI;AAC3C;;EAIJ,IAAI;AACJ,OAAK,MAAM,KAAK,UAAU;GACtB,MAAM,SAAS,EAAE;AACjB,QAAK,KAAK,GAAG,GAAG,GAAG,MAAM,OAAO;AAChC,OAAI,OAAO,WAAW,EAClB;GACJ,MAAM,WAAW,SAAS,EAAE,GAAG,KAAK,aAAa,GAAG,GAAG,EAAE,GAAG;AAI5D,OAHe,SAAS,UACpB,WAAW,KAAK,YACf,aAAa,KAAK,YAAY,OAAO,GAAG,KAAK,SAAS,KAAK,OAAO,GAAG,KAAK,OAE3E,QAAO;IAAE;IAAQ;IAAU;;AAEnC,MAAI,KAAK,GAAI,MAAM,UAAU,CAAC;GAAE;GAAM;GAAS,SAAS;GAA0B,CAAC,CAAE;;;CAGzF,aAAa,GAAG,GAAG,GAAG;EAClB,MAAM,OAAO,eAAe,EAAE,IAAI,OAAO,EAAE,SAAS,WAAW,KAAK,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,OAAO;EAClG,MAAM,aAAa,eAAe,KAAK,IAAI,eAAe,KAAK,WAAW,GAAG,KAAK,aAAa,EAAE;AACjG,SAAO,OAAO,KAAK,EAAE,CAAC,QAAQ,MAAM,OAAO,OAAO,YAAY,EAAE,CAAC,CAAC;;CAEtE,MAAM,UAAU,GAAG;EACf,MAAM,WAAW,SAAS,KAAK,MAAM,eAAe,EAAE,IAAI,OAAO,EAAE,SAAS,WAAW,KAAK,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,OAAO,EAAE;EAC5H,MAAM,QAAQ,SAAS;AACvB,MAAI,CAAC,eAAe,MAAM,IAAI,CAAC,eAAe,MAAM,WAAW,CAC3D,QAAO;AACX,OAAK,MAAM,OAAO,OAAO,KAAK,MAAM,WAAW,EAAE;GAC7C,MAAM,SAAS,SAAS,KAAK,MAAM;IAC/B,MAAM,MAAM,eAAe,EAAE,IAAI,eAAe,EAAE,WAAW,GAAG,EAAE,WAAW,OAAO;AACpF,WAAO,eAAe,IAAI,GAAG,IAAI,QAAQ;KAC3C;AAEF,OADkB,OAAO,OAAO,MAAM,MAAM,WAAc,OAAO,MAAM,YAAY,MAAM,MAAM,IAC9E,IAAI,IAAI,OAAO,CAAC,SAAS,OAAO,OAC7C,QAAO;IAAE;IAAK;IAAQ;;;CAIlC,gBAAgB,MAAM,GAAG,GAAG,MAAM,KAAK;EACnC,MAAM,EAAE,gDAAuB,qCAAkB,GAAG,SAAS;EAC7D,MAAM,IAAI,gBAAgB;AAC1B,OAAK,EAAE,WAAW,MAAM,EAAE,CAAC,GAAG,EAAE;AAChC,MAAI,SAAS,EAAE,IAAIC,4BAA0B,UAAa,CAAC,EAAE,SACzD,MAAK,MAAM,KAAK,OAAO,KAAK,EAAE,EAAE;AAC5B,OAAI,EAAE,OAAO,IAAI,EAAE,CACf;AACJ,OAAIA,4BAA0B,MAC1B,KAAI,KAAK;IAAE,MAAM,QAAQ,MAAM,EAAE;IAAE,SAAS;IAAyB,SAAS;IAAiB,CAAC;OAGhG,MAAK,KAAKA,yBAAuB,GAAG,EAAE,IAAI,QAAQ,MAAM,EAAE,EAAE,IAAI;;AAG5E,MAAI,MAAM,QAAQ,EAAE,IAAIC,uBAAqB,UAAa,CAAC,EAAE,SACzD,MAAK,IAAI,IAAI,EAAE,OAAO,IAAI,EAAE,QAAQ,KAAK;AACrC,OAAI,EAAE,SAAS,IAAI,EAAE,CACjB;AACJ,OAAIA,uBAAqB,MACrB,KAAI,KAAK;IAAE,MAAM,GAAG,KAAK,GAAG;IAAK,SAAS;IAAoB,SAAS;IAAmB,CAAC;OAG3F,MAAK,KAAKA,oBAAkB,GAAG,EAAE,IAAI,GAAG,KAAK,GAAG,KAAK,IAAI;;;;AAM7E,MAAM,gBAAgB;;AAEtB,SAAS,WAAW,QAAQ;AACxB,KAAI,OAAO,UAAU,cACjB,QAAO,KAAK,UAAU,OAAO;AAEjC,QAAO,GADQ,KAAK,UAAU,OAAO,MAAM,GAAG,cAAc,CAAC,CAC5C,MAAM,GAAG,GAAG,CAAC,YAAY,OAAO,SAAS,cAAc;;AAE5E,SAAS,gBAAgB,KAAK,KAAK;AAC/B,KAAI,QAAQ,OAAO,kBACf,QAAO,qBAAqB,IAAI,YAAY,QAAQ,IAAI,SAAS;AACrE,KAAI,QAAQ,EACR,QAAO,oBAAoB,IAAI,YAAY,QAAQ,IAAI,SAAS;AACpE,QAAO,oBAAoB,IAAI,OAAO,IAAI;;AAE9C,SAAS,QAAQ,MAAM,KAAK;AACxB,QAAO,GAAG,KAAK,GAAG,OAAO,IAAI,CAAC,QAAQ,MAAM,KAAK,CAAC,QAAQ,OAAO,KAAK;;AAE1E,SAAS,SAAS,GAAG;AACjB,KAAI,MAAM,KACN,QAAO;AACX,KAAI,MAAM,QAAQ,EAAE,CAChB,QAAO;AACX,KAAI,aAAa,WACb,QAAO;AACX,KAAI,OAAO,MAAM,YAAY,OAAO,UAAU,EAAE,CAC5C,QAAO;AACX,QAAO,OAAO;;;;;ACtXlB,SAAgB,QAAQ,QAAQ,UAAU,YAAY;CAClD,MAAM,QAAQ,aAAa,QAAQ,QAAQ;AAC3C,QAAO,QAAQ,WAAW,OACpB,IAAI,kBAAkB,QAAQ,SAAS,MAAM,GAC7C,IAAI,UAAU,QAAQ,SAAS,MAAM;;AAE/C,MAAM,aAAa,OAAO,OAAO,EAAE,CAAC;;AAEpC,IAAa,YAAb,MAAuB;;CAEnB;CACA;CACA;CACA,YAAY;CACZ,YAAY,QAAQ,SAAS,OAAO;AAEhC,OAAK,QAAQ;AACb,OAAK,SAAS;AACd,OAAK,UAAU;;;;;;CAMnB,OAAO,OAAO;AACV,MAAI,KAAK,MAAM,MAAM,CACjB,QAAO,EAAE;AACb,OAAK,cAAc,IAAI,UAAU,SAAS,KAAK,QAAQ,KAAK,QAAQ,EAAE,KAAK,OAAO;AAClF,SAAO,KAAK,UAAU,OAAO,MAAM;;;;AAI3C,IAAa,oBAAb,cAAuC,UAAU;CAC7C,UAAU;;;;;;;CAOV,OAAO,OAAO;AACV,OAAK,YAAY,IAAI,QAAQ,SAAS,KAAK,QAAQ,KAAK,QAAQ,EAAE,KAAK,OAAO;AAC9E,SAAO,KAAK,QAAQ,OAAO,MAAM;;;CAGrC,MAAM,OAAO;EACT,MAAM,UAAU,KAAK,OAAO,MAAM;AAClC,SAAO,KAAK,MAAM,QAAQ,GAAG;GAAE,IAAI;GAAM,OAAO;GAAS,GAAG;GAAE,IAAI;GAAO,QAAQ,KAAK,OAAO,QAAQ;GAAE;;;AAG/G,SAAS,aAAa,QAAQ,SAAS;AACnC,QAAO,SAAS,QAAQ,QAAQ,CAAC,MAAM;;AAG3C,SAAS,SAAS,QAAQ,SAAS;CAC/B,MAAM,QAAQ,IAAI,SAAS,QAAQ,SAAS,MAAM;AAClD,KAAI;AACA,QAAM,MAAM;AACZ,SAAO;UAEJ,OAAO;AACV,MAAI,UAAU,QACV,OAAM;AACV,SAAO,IAAI,SAAS,QAAQ,SAAS,KAAK"}
|
|
1
|
+
{"version":3,"file":"compiler.js","names":["entries","x","y","compiler","item","number","compile","entries","leaf","compiler","unevaluatedProperties","unevaluatedItems"],"sources":["../../../node_modules/.pnpm/@earendil-works+pi-schema@1.6.0/node_modules/@earendil-works/pi-schema/dist/checks.js","../../../node_modules/.pnpm/@earendil-works+pi-schema@1.6.0/node_modules/@earendil-works/pi-schema/dist/resolver.js","../../../node_modules/.pnpm/@earendil-works+pi-schema@1.6.0/node_modules/@earendil-works/pi-schema/dist/shared.js","../../../node_modules/.pnpm/@earendil-works+pi-schema@1.6.0/node_modules/@earendil-works/pi-schema/dist/coerce.js","../../../node_modules/.pnpm/@earendil-works+pi-schema@1.6.0/node_modules/@earendil-works/pi-schema/dist/annotations.js","../../../node_modules/.pnpm/@earendil-works+pi-schema@1.6.0/node_modules/@earendil-works/pi-schema/dist/compiler.js","../../../node_modules/.pnpm/@earendil-works+pi-schema@1.6.0/node_modules/@earendil-works/pi-schema/dist/explain.js","../../../node_modules/.pnpm/@earendil-works+pi-schema@1.6.0/node_modules/@earendil-works/pi-schema/dist/validator.js"],"sourcesContent":["// Check factories: each returns a closure that captures only its arguments, never the compiler, so a compiled\n// schema keeps no compile-time state alive. Leaf checks (a type, a const, an enum, bounds) are registered with a code\n// and an argument, so object and array loops run them inline instead of calling them.\nexport const ALWAYS = () => true;\nexport const NEVER = () => false;\nconst IS_STRING = (v) => typeof v === \"string\";\nconst IS_NUMBER = (v) => Number.isFinite(v);\nconst IS_INTEGER = (v) => Number.isInteger(v);\nconst IS_BOOLEAN = (v) => typeof v === \"boolean\";\nconst IS_NULL = (v) => v === null;\nexport const IS_ARRAY = (v) => Array.isArray(v);\nconst IS_BYTES = (v) => v instanceof Uint8Array;\nconst IS_BIGINT = (v) => typeof v === \"bigint\";\nconst IS_UNDEFINED = (v) => v === undefined;\nexport const IS_OBJECT = (v) => isObject(v);\n/** Whether `v` is a JSON object: not null, an array or bytes. */\nexport function isObject(v) {\n return typeof v === \"object\" && v !== null && !Array.isArray(v) && !(v instanceof Uint8Array);\n}\n/**\n * The check of a `type` name. `bytes` (a Uint8Array), `bigint` (TypeBox's `Type.BigInt`) and `undefined` (TypeBox's\n * `Type.Undefined`) extend JSON Schema for values that never pass through JSON. A `number` is finite, as in TypeBox:\n * JSON has no NaN or Infinity, so only a value built in code can be one.\n */\nexport const TYPE_CHECKS = new Map([\n [\"string\", IS_STRING],\n [\"number\", IS_NUMBER],\n [\"integer\", IS_INTEGER],\n [\"boolean\", IS_BOOLEAN],\n [\"null\", IS_NULL],\n [\"array\", IS_ARRAY],\n [\"object\", IS_OBJECT],\n [\"bytes\", IS_BYTES],\n [\"bigint\", IS_BIGINT],\n [\"undefined\", IS_UNDEFINED],\n]);\nconst leaves = new WeakMap([\n [IS_STRING, [1, undefined]],\n [IS_NUMBER, [2, undefined]],\n [IS_INTEGER, [3, undefined]],\n [IS_BOOLEAN, [4, undefined]],\n [IS_NULL, [5, undefined]],\n [ALWAYS, [6, undefined]],\n]);\n/** The leaf form of `check`, undefined when it is not a leaf. */\nexport function leafOf(check) {\n return leaves.get(check);\n}\nfunction leaf(code, arg, check) {\n leaves.set(check, [code, arg]);\n return check;\n}\n/** Bounds of a number or a string length leaf. */\nclass Bounds {\n min;\n max;\n xmin;\n xmax;\n constructor(min, max, xmin, xmax) {\n this.min = min;\n this.max = max;\n this.xmin = xmin;\n this.xmax = xmax;\n }\n}\n// Codes 1-6 are the bare types and `true`; the others read their argument.\nfunction leafOk(code, x, arg) {\n switch (code) {\n case 1:\n return typeof x === \"string\";\n case 2:\n return Number.isFinite(x);\n case 3:\n return Number.isInteger(x);\n case 4:\n return typeof x === \"boolean\";\n case 5:\n return x === null;\n case 7:\n return x === arg;\n case 8: {\n const list = arg;\n for (let i = 0; i < list.length; i++)\n if (list[i] === x)\n return true;\n return false;\n }\n case 9:\n return (typeBits(x) & arg) !== 0;\n case 10:\n return Number.isInteger(x) && inBounds(x, arg);\n case 11:\n return Number.isFinite(x) && inBounds(x, arg);\n case 12:\n return typeof x === \"string\" && lengthOk(x, arg.min, arg.max);\n case 13:\n return typeof x === \"string\" && arg.test(x);\n default:\n return true;\n }\n}\nfunction inBounds(x, b) {\n return x >= b.min && x <= b.max && x > b.xmin && x < b.xmax;\n}\n/** Whether a combined object or array check also checks the type: not at all, strictly, or passing other types. */\nexport const GUARD_NONE = 0;\nexport const GUARD_STRICT = 1;\nexport const GUARD_LOOSE = 2;\n/** Flags of a declared property in an object check's entries: its leaf code and two bits. */\nexport const CODE = 15;\nexport const REQUIRED = 16;\nexport const INHERITED = 32;\n/** All of `parts`; two and three parts get closures without a loop. */\nexport function and(parts) {\n switch (parts.length) {\n case 0:\n return ALWAYS;\n case 1:\n return parts[0];\n case 2: {\n const [a, b] = parts;\n return (v) => a(v) && b(v);\n }\n case 3: {\n const [a, b, c] = parts;\n return (v) => a(v) && b(v) && c(v);\n }\n default:\n return (v) => {\n for (let i = 0; i < parts.length; i++)\n if (!parts[i](v))\n return false;\n return true;\n };\n }\n}\n/** A check whose implementation is set later: the indirection a recursive reference goes through. */\nexport function indirect(slot) {\n return (v) => slot.check(v);\n}\n/** `check` with `uri` pushed onto the dynamic scope while it runs (only for schemas with `$dynamicRef`). */\nexport function scopedCheck(scope, uri, check) {\n return (v) => {\n scope.push(uri);\n const ok = check(v);\n scope.pop();\n return ok;\n };\n}\n/** Any of the named types. */\nexport function typeCheck(types) {\n if (types.length === 1)\n return (typeof types[0] === \"string\" ? TYPE_CHECKS.get(types[0]) : undefined) ?? NEVER;\n return maskCheck(typeMask(types));\n}\nconst TYPE_BITS = new Map([\n [\"string\", 1],\n [\"number\", 2],\n [\"integer\", 4],\n [\"boolean\", 8],\n [\"null\", 16],\n [\"array\", 32],\n [\"object\", 64],\n [\"bytes\", 128],\n [\"bigint\", 256],\n [\"undefined\", 512],\n]);\n/** The bits of the named types; unknown names add none. */\nexport function typeMask(types) {\n let mask = 0;\n for (const t of types)\n if (typeof t === \"string\")\n mask |= TYPE_BITS.get(t) ?? 0;\n return mask;\n}\n/** The type bits of `v`: an integer has the bits of `number` and `integer`; NaN and Infinity have neither. */\nfunction typeBits(v) {\n switch (typeof v) {\n case \"string\":\n return 1;\n case \"number\":\n return Number.isInteger(v) ? 6 : Number.isFinite(v) ? 2 : 0;\n case \"boolean\":\n return 8;\n case \"object\":\n return v === null ? 16 : Array.isArray(v) ? 32 : v instanceof Uint8Array ? 128 : 64;\n case \"bigint\":\n return 256;\n case \"undefined\":\n return 512;\n default:\n return 0;\n }\n}\nfunction maskCheck(mask) {\n return leaf(9, mask, (v) => (typeBits(v) & mask) !== 0);\n}\n/** `anyOf` whose bare-type branches have the types of `mask`: those by one type test, the others by their checks. */\nexport function maskedAnyCheck(mask, checks) {\n if (checks.length === 0)\n return maskCheck(mask);\n const rest = checks.length === 1 ? checks[0] : anyCheck(checks);\n return (v) => (typeBits(v) & mask) !== 0 || rest(v);\n}\n/** A Uint8Array within the length bounds. */\nexport function bytesCheck(min, max) {\n return (v) => v instanceof Uint8Array && v.length >= min && v.length <= max;\n}\n/** The number of Unicode code points of `s`: JSON Schema string lengths count code points, not UTF-16 units. */\nexport function codePoints(s) {\n let n = 0;\n for (let i = 0; i < s.length; i++, n++) {\n const c = s.charCodeAt(i);\n // A high surrogate starts a pair only when a low surrogate follows; an unpaired one is a code point of its own.\n if (c >= 0xd800 && c <= 0xdbff && i + 1 < s.length) {\n const next = s.charCodeAt(i + 1);\n if (next >= 0xdc00 && next <= 0xdfff)\n i++;\n }\n }\n return n;\n}\n// UTF-16 units bound code points from both sides (units / 2 <= points <= units), so most strings need no count.\nfunction lengthOk(s, min, max) {\n const units = s.length;\n if (units < min)\n return false;\n if (units < 2 * min && codePoints(s) < min)\n return false;\n return units <= max || codePoints(s) <= max;\n}\n/** The string keywords: length bounds, pattern and format. */\nexport function stringCheck(strict, min, max, re, format) {\n if (re !== undefined && min === 0 && max === Number.POSITIVE_INFINITY && format === undefined) {\n return strict\n ? leaf(13, re, (v) => typeof v === \"string\" && re.test(v))\n : (v) => typeof v !== \"string\" || re.test(v);\n }\n if (re === undefined && format === undefined) {\n return strict\n ? leaf(12, new Bounds(min, max, 0, 0), (v) => typeof v === \"string\" && lengthOk(v, min, max))\n : (v) => typeof v !== \"string\" || lengthOk(v, min, max);\n }\n return (v) => {\n if (typeof v !== \"string\")\n return !strict;\n return lengthOk(v, min, max) && (re === undefined || re.test(v)) && (format === undefined || format(v));\n };\n}\n/**\n * The number keywords, for numbers and bigints alike (as TypeBox applies them): bounds of either kind compare with\n * values of either kind. `mode`: 0 passes other types, 1 requires a number, 2 an integer, 3 a bigint.\n */\nexport function numberCheck(mode, min, max, xmin, xmax, multipleOf) {\n const check = (v) => {\n if (typeof v !== \"number\" && typeof v !== \"bigint\")\n return mode === 0;\n if (mode === 3 ? typeof v !== \"bigint\" : mode !== 0 && !Number.isFinite(v))\n return false;\n if (mode === 2 && !Number.isInteger(v))\n return false;\n return v >= min && v <= max && v > xmin && v < xmax && (multipleOf === undefined || isMultiple(v, multipleOf));\n };\n const plain = typeof min === \"number\" && typeof max === \"number\" && typeof xmin === \"number\" && typeof xmax === \"number\";\n if (mode === 0 || mode === 3 || multipleOf !== undefined || !plain)\n return check;\n return leaf(mode === 2 ? 10 : 11, new Bounds(min, max, xmin, xmax), check);\n}\n/**\n * Whether `v` is a multiple of `d`, exactly for decimals: 0.0075 / 0.0001 is 74.99999999999999 in floating point. With\n * a bigint on either side, exact integer arithmetic; a bigint is no multiple of 0 or of a fraction.\n *\n * Deliberately unlike TypeBox, which throws there (`BigInt(0.5)`, division by zero): a check answers for every value\n * and never throws, and no real schema pairs a bigint with a fractional or zero `multipleOf`.\n */\nexport function isMultiple(v, d) {\n if (typeof v === \"bigint\" || typeof d === \"bigint\") {\n if ((typeof v === \"number\" && !Number.isInteger(v)) || (typeof d === \"number\" && !Number.isInteger(d)))\n return false;\n const divisor = BigInt(d);\n return divisor !== 0n && BigInt(v) % divisor === 0n;\n }\n const q = v / d;\n if (Number.isInteger(q))\n return true;\n if (!Number.isFinite(q))\n return v % d === 0;\n const [vc, ve] = decimal(v);\n const [dc, de] = decimal(d);\n return ve >= de ? (vc * 10n ** BigInt(ve - de)) % dc === 0n : vc % (dc * 10n ** BigInt(de - ve)) === 0n;\n}\nfunction decimal(x) {\n const [mantissa, exponent = \"0\"] = Math.abs(x).toString().split(\"e\");\n const point = mantissa.indexOf(\".\");\n const fraction = point < 0 ? 0 : mantissa.length - point - 1;\n return [BigInt(mantissa.replace(\".\", \"\")), Number(exponent) - fraction];\n}\n/** `inner` for objects; other values pass unless `strict`. */\nexport function guardObject(inner, strict) {\n return strict ? (v) => isObject(v) && inner(v) : (v) => !isObject(v) || inner(v);\n}\n/** `inner` for arrays; other values pass unless `strict`. */\nexport function guardArray(inner, strict) {\n return strict ? (v) => Array.isArray(v) && inner(v) : (v) => !Array.isArray(v) || inner(v);\n}\n/**\n * An object with declared properties: `entries` is `[key, check, flags]` per property. The value's own keys are\n * walked with for...in (whose `o[k]` V8 reads from the enum cache, unlike a load by a name from a list), each found\n * among the declared names; `closed` rejects any other key. A property whose value is `undefined` counts as absent.\n */\nexport function declaredObject(entries, requiredCount, closed, guard) {\n const n = entries.length;\n return (v) => {\n if (guard !== GUARD_NONE && !isObject(v))\n return guard === GUARD_LOOSE;\n // Guarded: by the check above, or by the caller for GUARD_NONE.\n const o = v;\n let required = 0;\n let next = 0;\n for (const k in o) {\n // Keys usually come in the declared order: try the entry after the last match before searching.\n let i = next;\n if (entries[i] !== k) {\n i = 0;\n while (i < n && entries[i] !== k)\n i += 3;\n if (i === n) {\n if (closed)\n return false;\n continue;\n }\n }\n next = i + 3;\n const x = o[k];\n const f = entries[i + 2];\n // An optional property set to undefined counts as absent; a required one is present, and its schema decides\n // whether undefined is a value of it (TypeBox's Type.Undefined, Unknown, Any).\n if (x === undefined && !(f & REQUIRED))\n continue;\n const c = f & CODE;\n if (c !== 0 ? !leafOk(c, x, entries[i + 1]) : !entries[i + 1](x))\n return false;\n if (f & REQUIRED)\n required++;\n }\n return required === requiredCount;\n };\n}\n/** An object with declared properties, required keys not declared, pattern properties and additional properties. */\nexport function openObject(entries, keys, extraRequired, patterns, additional, guard) {\n const known = patterns.length > 0 || additional !== undefined ? new Set(keys) : undefined;\n return (v) => {\n if (guard !== GUARD_NONE && !isObject(v))\n return guard === GUARD_LOOSE;\n const o = v;\n for (let i = 0; i < entries.length; i += 3) {\n const k = entries[i];\n const x = o[k];\n const f = entries[i + 2];\n // Absent, or an optional property set to undefined (which counts as absent); see declaredObject.\n if ((x === undefined && !(f & REQUIRED && Object.hasOwn(o, k))) || (f & INHERITED && !Object.hasOwn(o, k))) {\n if (f & REQUIRED)\n return false;\n continue;\n }\n const c = f & CODE;\n if (c !== 0 ? !leafOk(c, x, entries[i + 1]) : !entries[i + 1](x))\n return false;\n }\n for (let i = 0; i < extraRequired.length; i++)\n if (!Object.hasOwn(o, extraRequired[i]))\n return false;\n if (known === undefined)\n return true;\n for (const k of Object.keys(o)) {\n let matched = known.has(k);\n for (let i = 0; i < patterns.length; i++) {\n if (patterns[i][0].test(k)) {\n matched = true;\n if (!patterns[i][1](o[k]))\n return false;\n }\n }\n if (!matched && additional !== undefined && !additional(o[k]))\n return false;\n }\n return true;\n };\n}\n/** Every property name passes `check` (`v` is an object). */\nexport function propertyNamesCheck(check) {\n return (v) => {\n for (const k in v)\n if (!check(k))\n return false;\n return true;\n };\n}\n/** `minProperties` and `maxProperties` (`v` is an object). */\nexport function propertyCountCheck(min, max) {\n return (v) => {\n let n = 0;\n for (const _ in v)\n n++;\n return n >= min && n <= max;\n };\n}\n/** `dependentRequired` (`v` is an object). */\nexport function dependentRequiredCheck(entries) {\n return (v) => {\n const o = v;\n for (const [k, list] of entries)\n if (Object.hasOwn(o, k))\n for (const r of list)\n if (!Object.hasOwn(o, r))\n return false;\n return true;\n };\n}\n/** `dependentSchemas` (`v` is an object). */\nexport function dependentSchemasCheck(entries) {\n return (v) => {\n for (const [k, check] of entries)\n if (Object.hasOwn(v, k) && !check(v))\n return false;\n return true;\n };\n}\nconst NO_LEAF = [0, undefined];\n/** The common array: guard, length bounds, prefix items and the items after them, in one closure. */\nexport function listCheck(guard, min, max, prefix, rest) {\n const n = prefix.length;\n const [code, arg] = (rest === undefined ? undefined : leafOf(rest)) ?? NO_LEAF;\n return (v) => {\n if (!Array.isArray(v))\n return guard === GUARD_LOOSE;\n const length = v.length;\n if (length < min || length > max)\n return false;\n const m = length < n ? length : n;\n for (let i = 0; i < m; i++)\n if (!prefix[i](v[i]))\n return false;\n if (rest === undefined)\n return true;\n if (code !== 0) {\n for (let i = n; i < length; i++)\n if (!leafOk(code, v[i], arg))\n return false;\n return true;\n }\n for (let i = n; i < length; i++)\n if (!rest(v[i]))\n return false;\n return true;\n };\n}\n/** Prefix items and the items after them (`v` is an array). */\nexport function itemsCheck(prefix, rest) {\n return listCheck(GUARD_NONE, 0, Number.POSITIVE_INFINITY, prefix, rest);\n}\n/** `minItems` and `maxItems` (`v` is an array). */\nexport function lengthCheck(min, max) {\n return (v) => v.length >= min && v.length <= max;\n}\n/** `contains` with its bounds (`v` is an array). */\nexport function containsCheck(check, min, max) {\n return (v) => {\n const list = v;\n let n = 0;\n for (let i = 0; i < list.length; i++)\n if (check(list[i]) && ++n > max)\n return false;\n return n >= min;\n };\n}\n/** `uniqueItems` (`v` is an array). */\nexport function uniqueCheck(v) {\n const list = v;\n for (let i = 1; i < list.length; i++)\n for (let j = 0; j < i; j++)\n if (deepEqual(list[i], list[j]))\n return false;\n return true;\n}\n/** `enum`: up to 8 primitives by a scan, more by a Set, objects and arrays by deep equality. */\nexport function enumCheck(values) {\n const primitives = values.filter((x) => typeof x !== \"object\" || x === null);\n if (primitives.length === values.length && primitives.length <= 8) {\n return leaf(8, primitives, (v) => {\n for (let i = 0; i < primitives.length; i++)\n if (primitives[i] === v)\n return true;\n return false;\n });\n }\n const set = new Set(primitives);\n const objects = values.filter((x) => typeof x === \"object\" && x !== null);\n return (v) => set.has(v) || (typeof v === \"object\" && objects.some((o) => deepEqual(v, o)));\n}\n/** `const`. */\nexport function constCheck(value) {\n if (typeof value !== \"object\" || value === null)\n return leaf(7, value, (v) => v === value);\n return (v) => deepEqual(v, value);\n}\n/** `anyOf`. */\nexport function anyCheck(checks) {\n return (v) => {\n for (let i = 0; i < checks.length; i++)\n if (checks[i](v))\n return true;\n return false;\n };\n}\n/** `oneOf`. */\nexport function oneCheck(checks) {\n return (v) => {\n let n = 0;\n for (let i = 0; i < checks.length; i++)\n if (checks[i](v) && ++n > 1)\n return false;\n return n === 1;\n };\n}\n/** `not`. */\nexport function notCheck(check) {\n return (v) => !check(v);\n}\n/** `if`, `then` and `else`. */\nexport function ifCheck(cond, then, otherwise) {\n return (v) => (cond(v) ? then(v) : otherwise(v));\n}\n/** A union of objects tagged by a const on `key`: the tag selects the one branch that can match. */\nexport function taggedCheck(key, tags, checks) {\n return (v) => {\n if (!isObject(v))\n return false;\n const tag = v[key];\n for (let i = 0; i < tags.length; i++)\n if (tags[i] === tag)\n return checks[i](v);\n return false;\n };\n}\n/**\n * JSON equality, as `const`, `enum` and `uniqueItems` compare: the same primitives, arrays with equal items in order,\n * objects with the same keys and equal values (key order does not matter).\n */\nexport function deepEqual(a, b) {\n if (a === b)\n return true;\n if (typeof a !== \"object\" || typeof b !== \"object\" || a === null || b === null)\n return false;\n const array = Array.isArray(a);\n if (array !== Array.isArray(b))\n return false;\n if (array) {\n const x = a;\n const y = b;\n if (x.length !== y.length)\n return false;\n for (let i = 0; i < x.length; i++)\n if (!deepEqual(x[i], y[i]))\n return false;\n return true;\n }\n const x = a;\n const y = b;\n const keys = Object.keys(x);\n if (keys.length !== Object.keys(y).length)\n return false;\n for (const k of keys)\n if (!Object.hasOwn(y, k) || !deepEqual(x[k], y[k]))\n return false;\n return true;\n}\n//# sourceMappingURL=checks.js.map","// Reference resolution of one compile: schema resources, anchors and JSON Pointers over the root schema and the\n// registered documents. A Resolver lives only while a schema compiles (or while its errors are explained).\n/** The base URI of a root schema without `$id`; relative references resolve against it. */\nexport const DEFAULT_BASE = \"https://json-schema.invalid/root.json\";\n/**\n * Resolves references in the root schema and the registered documents. The schema is indexed on the first\n * reference or the first `$id` a walker meets, so a schema with neither is never walked for identifiers.\n */\nexport class Resolver {\n draft;\n /** The base URI the root schema is walked from; walkers apply the root's own `$id` through `baseFor`. */\n rootBase = DEFAULT_BASE;\n /** Schema object to the base URI it was indexed under. */\n baseOf = new Map();\n /** URI (with a `#name` fragment) of every `$dynamicAnchor`, to its schema. */\n dynamicAnchors = new Map();\n root;\n options;\n registry = new Map();\n rejectUnresolved;\n /** The references that named nothing and resolved to `false` (with `unresolvedRefs: \"reject\"`). */\n unresolved = new Set();\n resources = new Map();\n anchors = new Map();\n indexed = false;\n constructor(root, options) {\n this.draft = options.draft === \"7\" ? \"7\" : \"2020-12\";\n this.root = root;\n this.options = options;\n this.rejectUnresolved = options.unresolvedRefs === \"reject\";\n }\n /**\n * The base URI of `node`, whose parent has `base`: its `$id` changes it, unless draft 7 makes the `$id` inert. Once\n * the schema is indexed, the indexed base (a resolved reference target already has its own).\n */\n baseFor(node, base) {\n let indexed = this.baseOf.get(node);\n if (indexed !== undefined)\n return indexed;\n const id = node.$id;\n if (typeof id !== \"string\")\n return base;\n // Index before applying an `$id`: a caller's `base` may already include it, and the index applies it once.\n if (!this.indexed) {\n this.ensureIndexed();\n indexed = this.baseOf.get(node);\n if (indexed !== undefined)\n return indexed;\n }\n if (this.draft === \"7\" && (typeof node.$ref === \"string\" || id.startsWith(\"#\")))\n return base;\n return documentOf(resolveUri(id, base));\n }\n /** Indexes the root schema and the registered documents' URIs (once). */\n ensureIndexed() {\n if (this.indexed)\n return;\n this.indexed = true;\n for (const [uri, schema] of Object.entries(this.options.schemas ?? {})) {\n this.registry.set(documentOf(resolveUri(uri, DEFAULT_BASE)), schema);\n }\n this.resources.set(DEFAULT_BASE, this.root);\n this.index(this.root, DEFAULT_BASE);\n }\n /**\n * The schema a reference names, with the base URI it compiles under. Throws if it names nothing, or, with\n * `unresolvedRefs: \"reject\"`, resolves to `false`, the schema no value passes.\n */\n resolve(ref, base) {\n this.ensureIndexed();\n if (!this.rejectUnresolved)\n return this.find(ref, base);\n try {\n return this.find(ref, base);\n }\n catch {\n this.unresolved.add(resolveUri(ref, base));\n return { node: false, base };\n }\n }\n /** Whether `ref`, from `base`, named nothing and resolved to `false`. */\n isUnresolved(ref, base) {\n return this.unresolved.has(resolveUri(ref, base));\n }\n find(ref, base) {\n const uri = resolveUri(ref, base);\n const doc = documentOf(uri);\n const fragment = uri.length > doc.length ? decodeURIComponent(uri.slice(doc.length + 1)) : \"\";\n const root = this.resources.has(doc) ? this.resources.get(doc) : this.load(doc);\n if (root === undefined)\n throw new Error(`Unresolved $ref ${ref} (no schema registered for ${doc})`);\n if (fragment === \"\")\n return { node: root, base: doc };\n if (fragment.startsWith(\"/\"))\n return this.pointer(root, doc, fragment);\n const target = this.anchors.get(`${doc}#${fragment}`);\n if (target === undefined)\n throw new Error(`Unresolved $ref ${ref} (no anchor ${fragment} in ${doc})`);\n return { node: target, base: this.baseOf.get(target) ?? doc };\n }\n /** Whether `node` is the root of the schema resource at `base`. */\n isResource(node, base) {\n this.ensureIndexed();\n return this.resources.get(base) === node;\n }\n // Walks only keywords that hold subschemas: an `$id` inside `enum`, `const` or an unknown keyword names nothing.\n index(node, base) {\n if (!isSchemaObject(node) || this.baseOf.has(node))\n return;\n let b = base;\n // In draft 7 a `$ref` makes every sibling keyword, `$id` included, inert.\n const refOnly = this.draft === \"7\" && typeof node.$ref === \"string\";\n if (!refOnly && typeof node.$id === \"string\") {\n if (this.draft === \"7\" && node.$id.startsWith(\"#\"))\n this.anchors.set(documentOf(b) + node.$id, node);\n else {\n const uri = resolveUri(node.$id, b);\n b = documentOf(uri);\n this.resources.set(b, node);\n if (uri.length > b.length + 1)\n this.anchors.set(uri, node);\n }\n }\n this.baseOf.set(node, b);\n if (refOnly)\n return;\n if (this.draft !== \"7\") {\n if (typeof node.$anchor === \"string\")\n this.anchors.set(`${b}#${node.$anchor}`, node);\n if (typeof node.$dynamicAnchor === \"string\") {\n this.anchors.set(`${b}#${node.$dynamicAnchor}`, node);\n this.dynamicAnchors.set(`${b}#${node.$dynamicAnchor}`, node);\n }\n }\n for (const key of SCHEMA_KEYWORDS)\n this.index(node[key], b);\n for (const key of MAP_KEYWORDS) {\n const map = node[key];\n if (isSchemaObject(map))\n for (const k of Object.keys(map))\n this.index(map[k], b);\n }\n for (const key of ARRAY_KEYWORDS) {\n const list = node[key];\n if (Array.isArray(list))\n for (const s of list)\n this.index(s, b);\n }\n }\n load(doc) {\n const schema = this.registry.get(doc);\n if (schema === undefined)\n return undefined;\n this.resources.set(doc, schema);\n this.index(schema, doc);\n return schema;\n }\n pointer(root, base, fragment) {\n let node = root;\n let b = base;\n for (const raw of fragment.split(\"/\").slice(1)) {\n const key = raw.replace(/~1/g, \"/\").replace(/~0/g, \"~\");\n node =\n typeof node === \"object\" && node !== null && Object.hasOwn(node, key)\n ? node[key]\n : undefined;\n if (node === undefined)\n throw new Error(`Unresolved $ref #${fragment} in ${base}`);\n if (typeof node === \"object\" && node !== null)\n b = this.baseOf.get(node) ?? b;\n }\n return { node, base: b };\n }\n}\nconst SCHEMA_KEYWORDS = [\n \"additionalProperties\",\n \"propertyNames\",\n \"contains\",\n \"not\",\n \"if\",\n \"then\",\n \"else\",\n \"unevaluatedProperties\",\n \"unevaluatedItems\",\n \"additionalItems\",\n \"contentSchema\",\n \"items\",\n];\nconst MAP_KEYWORDS = [\"properties\", \"patternProperties\", \"$defs\", \"definitions\", \"dependentSchemas\", \"dependencies\"];\nconst ARRAY_KEYWORDS = [\"allOf\", \"anyOf\", \"oneOf\", \"prefixItems\", \"items\"];\n/** Whether `value` is a schema object (not `true`/`false`, an array or a primitive). */\nexport function isSchemaObject(value) {\n return typeof value === \"object\" && value !== null && !Array.isArray(value);\n}\n/** `ref` resolved against `base`. URNs and other bases a URL parser rejects take fragment-only references. */\nexport function resolveUri(ref, base) {\n try {\n return new URL(ref, base).href;\n }\n catch {\n return ref.startsWith(\"#\") ? documentOf(base) + ref : ref;\n }\n}\n/** `uri` without its fragment. */\nexport function documentOf(uri) {\n const hash = uri.indexOf(\"#\");\n return hash < 0 ? uri : uri.slice(0, hash);\n}\n//# sourceMappingURL=resolver.js.map","// Regular expressions shared across all compiled schemas while one still uses them: tool schemas repeat a few\n// patterns many times, and a RegExp is large once it has run. The cache holds its values weakly and drops an entry\n// once its RegExp is collected, so it keeps nothing alive.\n/**\n * The regular expression of a `pattern` source, shared by source. Patterns are ECMAScript regular expressions with\n * the `u` flag; a source that is invalid with it (some older schemas escape characters `u` rejects) compiles\n * without it.\n */\nexport function sharedRegex(source) {\n const hit = regexes.get(source)?.deref();\n if (hit !== undefined)\n return hit;\n let re;\n try {\n re = new RegExp(source, \"u\");\n }\n catch {\n re = new RegExp(source);\n }\n regexes.set(source, new WeakRef(re));\n regexCleanup.register(re, source);\n return re;\n}\nconst regexes = new Map();\nconst regexCleanup = new FinalizationRegistry((source) => {\n if (regexes.get(source)?.deref() === undefined)\n regexes.delete(source);\n});\n/** The number of cached regular expressions (for tests). */\nexport function sharedRegexCount() {\n return regexes.size;\n}\n//# sourceMappingURL=shared.js.map","// Coercion: turns a loosely typed value (a model's tool call arguments, form input, query strings) into the value a\n// schema most likely meant, before it is checked. Only validators compiled with `{ coerce: true }` have it, and they\n// build it on their first coerce() or parse(); the check path never runs it.\n//\n// Three passes, in this order:\n// 1. Optional nulls: a `null` in an optional property whose schema rejects null is dropped, as if omitted.\n// 2. Conversion rules ported from TypeBox 1.3.27's Value.Convert (MIT), keyed on JSON Schema structure (`$ref`, `const`,\n// `enum`, `anyOf`/`oneOf`, `allOf`, `type`, `items`/`prefixItems`, `properties`/`patternProperties`) instead of\n// TypeBox's kind marks: `null` becomes \"null\" for a string, `\"3.5\"` becomes 3 for an integer, a single value becomes\n// a one-item array, and a union takes the first branch whose conversion passes.\n// 3. Primitive coercion by `type` (also type arrays), as in Ajv's `coerceTypes`: what pass 2 left, for example a type\n// array `[\"integer\", \"null\"]`, or `\"\"` for `null`.\n// A value that cannot be coerced is left as it is; the check then reports it.\n//\n// Every pass is copy-on-write: an object or array is copied only when one of its members changes, so an unchanged\n// value comes back as the same reference and the input is never modified. All passes walk the same keywords for\n// members: `properties`, then `patternProperties`, then `additionalProperties` for keys neither names; tuple items by\n// `prefixItems` (or a draft-7 `items` array), the rest by `items`. Draft 7's `additionalItems` is not coerced.\nimport { isSchemaObject } from \"./resolver.js\";\nimport { sharedRegex } from \"./shared.js\";\n/** Coerces values for one compiled schema. */\nexport class Coercer {\n c;\n schema;\n /**\n * The (schema node, value) pairs pass 2 is converting through a re-entry point, as a stack. Conversion can enter\n * a node again with the same value only through a `$ref` or by wrapping a single value into an array (also for\n * schemas that cycle through shared JS objects): a recursive schema that meets a value no branch accepts would\n * convert it without end. A pair already on the stack (primitives by value, objects by reference) leaves the value\n * unchanged. Only those two points push, so schemas without references or wraps pay nothing.\n */\n entered = [];\n /** How often a re-entry was cut short in this coerce() call; results computed across one are not memoized. */\n cuts = 0;\n /**\n * Results of `$ref` targets by (node, value) within one coerce() call: a recursive union whose branches all\n * convert the same children (and all fail) would convert them once per branch, exponentially in the depth.\n */\n memo = undefined;\n constructor(compiler, schema) {\n this.c = compiler;\n this.schema = schema;\n }\n /** `value` coerced: a copy along the changed paths only, or `value` itself when nothing changes. */\n coerce(value) {\n const base = this.c.r.rootBase;\n const withoutNulls = this.dropOptionalNulls(value, this.schema, base);\n return this.coerceTypes(this.convertOnly(withoutNulls), this.schema, base);\n }\n /** Pass 2 alone, as TypeBox's `Value.Convert` (the TypeBox conformance tests run it). */\n convertOnly(value) {\n try {\n return this.convert(this.schema, this.c.r.rootBase, value);\n }\n finally {\n this.memo = undefined;\n this.cuts = 0;\n }\n }\n /** `node` converted for `value` at a re-entry point: unchanged when that pair is already being converted. */\n reenter(node, base, value, memoize) {\n const entered = this.entered;\n for (let i = 0; i < entered.length; i += 2) {\n if (entered[i] === node && Object.is(entered[i + 1], value)) {\n this.cuts++;\n return value;\n }\n }\n const memo = memoize ? this.memo?.get(node) : undefined;\n if (memo?.has(value))\n return memo.get(value);\n const cuts = this.cuts;\n entered.push(node, value);\n let result;\n try {\n result = this.convert(node, base, value);\n }\n finally {\n entered.length -= 2;\n }\n if (memoize && this.cuts === cuts) {\n this.memo ??= new Map();\n let values = this.memo.get(node);\n if (values === undefined) {\n values = new Map();\n this.memo.set(node, values);\n }\n values.set(value, result);\n }\n return result;\n }\n /** Whether `value` passes the schema `node`; undefined when `node` cannot be compiled. */\n passes(node, base, value) {\n try {\n return this.c.check(node, this.baseOf(node, base))(value);\n }\n catch {\n return undefined;\n }\n }\n baseOf(node, base) {\n return isSchemaObject(node) ? this.c.r.baseFor(node, base) : base;\n }\n // ---------------------------------------------------------------------------------------------------------------\n // Pass 1: optional nulls\n // ---------------------------------------------------------------------------------------------------------------\n dropOptionalNulls(value, schema, base) {\n if (!isSchemaObject(schema))\n return value;\n const b = this.baseOf(schema, base);\n if (Array.isArray(value)) {\n return mapItems(value, (item, i) => {\n const itemSchema = itemSchemaAt(schema, i);\n return itemSchema === undefined ? item : this.dropOptionalNulls(item, itemSchema, b);\n });\n }\n if (!isPlainObject(value))\n return value;\n const properties = isSchemaObject(schema.properties) ? schema.properties : {};\n const patterns = isSchemaObject(schema.patternProperties)\n ? Object.entries(schema.patternProperties).map(([pattern, item]) => [sharedRegex(pattern), item])\n : [];\n const additional = isSchemaObject(schema.additionalProperties) ? schema.additionalProperties : undefined;\n if (patterns.length === 0 && additional === undefined && !isSchemaObject(schema.properties))\n return value;\n const required = new Set(Array.isArray(schema.required) ? schema.required : []);\n let out;\n const set = (key, next) => {\n if (next === (out ?? value)[key])\n return;\n out ??= { ...value };\n out[key] = next;\n };\n for (const [key, property] of Object.entries(properties)) {\n if (!Object.hasOwn(value, key))\n continue;\n const isRef = isSchemaObject(property) && typeof property.$ref === \"string\";\n if (value[key] === null && !required.has(key) && !isRef && this.passes(property, b, null) === false) {\n out ??= { ...value };\n delete out[key];\n continue;\n }\n set(key, this.dropOptionalNulls(value[key], property, b));\n }\n // Values of pattern and additional properties are walked for their own optional nulls; the keys themselves\n // are not optional properties, so they stay.\n if (patterns.length > 0 || additional !== undefined) {\n for (const key of Object.keys(value)) {\n let matched = Object.hasOwn(properties, key);\n for (const [pattern, item] of patterns) {\n if (!pattern.test(key))\n continue;\n matched = true;\n set(key, this.dropOptionalNulls((out ?? value)[key], item, b));\n }\n if (!matched && additional !== undefined)\n set(key, this.dropOptionalNulls(value[key], additional, b));\n }\n }\n return out ?? value;\n }\n // ---------------------------------------------------------------------------------------------------------------\n // Pass 2: TypeBox's conversion rules\n // ---------------------------------------------------------------------------------------------------------------\n convert(node, base, value) {\n if (!isSchemaObject(node))\n return value;\n const b = this.baseOf(node, base);\n if (typeof node.$ref === \"string\") {\n let target;\n try {\n target = this.c.r.resolve(node.$ref, b);\n }\n catch {\n return value;\n }\n return isSchemaObject(target.node) ? this.reenter(target.node, target.base, value, true) : value;\n }\n return this.convertNode(node, b, value);\n }\n /** One schema node's conversion: its first keyword among `const`, `enum`, the unions, `allOf` and `type`. */\n convertNode(node, b, value) {\n if (Object.hasOwn(node, \"const\"))\n return convertLiteral(node.const, value);\n if (Array.isArray(node.enum))\n return this.convertEnum(node, node.enum, b, value);\n // A union or intersection node may also declare members (plain JSON Schema; TypeBox's never do): they convert\n // after the branches.\n if (Array.isArray(node.anyOf))\n return this.convertUnion(node, node.anyOf, b, value);\n if (Array.isArray(node.oneOf))\n return this.convertUnion(node, node.oneOf, b, value);\n if (Array.isArray(node.allOf)) {\n let next = value;\n for (const member of node.allOf)\n next = this.convert(member, b, next);\n return this.convertMembers(node, b, next);\n }\n switch (node.type) {\n case \"string\":\n return orValue(tryString(value), value);\n case \"number\":\n return orValue(tryNumber(value), value);\n case \"integer\": {\n const result = tryNumber(value);\n return result === undefined ? value : Math.trunc(result.value);\n }\n case \"boolean\":\n return orValue(tryBoolean(value), value);\n case \"null\":\n return orValue(tryNull(value), value);\n case \"bigint\":\n return orValue(tryBigInt(value), value);\n case \"undefined\":\n return orValue(tryUndefined(value), value);\n case \"array\":\n return this.convertArray(node, b, value);\n case \"object\":\n return this.convertObject(node, b, value);\n case undefined:\n if (node.properties !== undefined || node.patternProperties !== undefined) {\n return this.convertObject(node, b, value);\n }\n if (node.items !== undefined || node.prefixItems !== undefined)\n return this.convertArray(node, b, value);\n return value;\n default:\n return value;\n }\n }\n /** An enum is a union of its values: a member stays, else the first value the input converts to. */\n convertEnum(node, values, base, value) {\n if (values.some((member) => member === value))\n return value;\n for (const member of values) {\n const candidate = convertLiteral(member, value);\n if (candidate !== value && this.passes(node, base, candidate) === true)\n return candidate;\n }\n return value;\n }\n /**\n * A value one branch accepts stays; else the first branch's conversion that the whole union accepts. Branches are\n * converted in order and only until one is accepted, so a later recursive branch is not entered needlessly. A node\n * that also declares members (plain JSON Schema; TypeBox's never do) converts them into each candidate before it is\n * checked, so a branch is not discarded for a sibling property that is converted after it.\n */\n convertUnion(node, branches, base, value) {\n if (branches.some((branch) => this.passes(branch, base, value) === true))\n return this.convertMembers(node, base, value);\n for (const branch of branches) {\n const candidate = this.convertMembers(node, base, this.convert(branch, base, value));\n if (this.passes(node, base, candidate) === true)\n return candidate;\n }\n return this.convertMembers(node, base, value);\n }\n /** The object members of a union or intersection node, when it declares any. */\n convertMembers(node, base, value) {\n const declares = node.properties !== undefined ||\n node.patternProperties !== undefined ||\n node.additionalProperties !== undefined;\n return declares ? this.convertObject(node, base, value) : value;\n }\n convertArray(node, base, value) {\n const prefix = Array.isArray(node.items)\n ? node.items\n : Array.isArray(node.prefixItems)\n ? node.prefixItems\n : undefined;\n if (prefix !== undefined) {\n // A tuple converts its items and never wraps a single value.\n if (!Array.isArray(value))\n return value;\n const rest = Array.isArray(node.items) ? undefined : node.items;\n return mapItems(value, (item, i) => {\n const schema = i < prefix.length ? prefix[i] : rest;\n return schema === undefined ? item : this.convert(schema, base, item);\n });\n }\n if (Array.isArray(value)) {\n return node.items === undefined ? value : mapItems(value, (item) => this.convert(node.items, base, item));\n }\n // The wrapped single value is converted by the item schema with the same value: a re-entry point.\n const item = node.items;\n return [isSchemaObject(item) ? this.reenter(item, base, value, false) : value];\n }\n convertObject(node, base, value) {\n if (!isPlainObject(value))\n return value;\n const properties = isSchemaObject(node.properties) ? node.properties : {};\n const patterns = isSchemaObject(node.patternProperties)\n ? Object.entries(node.patternProperties).map(([pattern, schema]) => [sharedRegex(pattern), schema])\n : [];\n const additional = isSchemaObject(node.additionalProperties) ? node.additionalProperties : undefined;\n let out;\n for (const key of Object.keys(value)) {\n // An undefined property counts as absent.\n if (value[key] === undefined)\n continue;\n let next = value[key];\n let matched = Object.hasOwn(properties, key);\n if (matched)\n next = this.convert(properties[key], base, next);\n for (const [pattern, schema] of patterns) {\n if (!pattern.test(key))\n continue;\n matched = true;\n next = this.convert(schema, base, next);\n }\n if (!matched && additional !== undefined)\n next = this.convert(additional, base, next);\n if (next !== value[key]) {\n out ??= { ...value };\n out[key] = next;\n }\n }\n return out ?? value;\n }\n // ---------------------------------------------------------------------------------------------------------------\n // Pass 3: primitive coercion by type\n // ---------------------------------------------------------------------------------------------------------------\n coerceTypes(value, schema, base) {\n if (!isSchemaObject(schema))\n return value;\n const b = this.baseOf(schema, base);\n let next = value;\n if (Array.isArray(schema.allOf))\n for (const member of schema.allOf)\n next = this.coerceTypes(next, member, b);\n if (Array.isArray(schema.anyOf))\n next = this.coerceUnion(next, schema.anyOf, b);\n if (Array.isArray(schema.oneOf))\n next = this.coerceUnion(next, schema.oneOf, b);\n const types = typesOf(schema);\n const matchesUnionMember = types.length > 1 && types.some((type) => matchesType(next, type));\n if (types.length > 0 && !matchesUnionMember) {\n for (const type of types) {\n const candidate = coercePrimitive(next, type);\n if (candidate !== next) {\n next = candidate;\n break;\n }\n }\n }\n if (types.includes(\"object\") && isPlainObject(next))\n next = this.coerceProperties(next, schema, b);\n if (types.includes(\"array\") && Array.isArray(next))\n next = this.coerceItems(next, schema, b);\n return next;\n }\n coerceUnion(value, branches, base) {\n for (const branch of branches)\n if (this.passes(branch, base, value) === true)\n return value;\n for (const branch of branches) {\n const coerced = this.coerceTypes(value, branch, base);\n if (this.passes(branch, base, coerced) === true)\n return coerced;\n }\n return value;\n }\n coerceProperties(value, schema, base) {\n const properties = isSchemaObject(schema.properties) ? schema.properties : {};\n const patterns = isSchemaObject(schema.patternProperties)\n ? Object.entries(schema.patternProperties).map(([pattern, item]) => [sharedRegex(pattern), item])\n : [];\n const additional = isSchemaObject(schema.additionalProperties) ? schema.additionalProperties : undefined;\n let out;\n const set = (key, next) => {\n if (next === (out ?? value)[key])\n return;\n out ??= { ...value };\n out[key] = next;\n };\n for (const [key, property] of Object.entries(properties)) {\n if (key in value)\n set(key, this.coerceTypes(value[key], property, base));\n }\n for (const key of Object.keys(value)) {\n let matched = Object.hasOwn(properties, key);\n for (const [pattern, item] of patterns) {\n if (!pattern.test(key))\n continue;\n matched = true;\n set(key, this.coerceTypes((out ?? value)[key], item, base));\n }\n if (!matched && additional !== undefined)\n set(key, this.coerceTypes(value[key], additional, base));\n }\n return out ?? value;\n }\n coerceItems(value, schema, base) {\n return mapItems(value, (item, i) => {\n const itemSchema = itemSchemaAt(schema, i);\n return isSchemaObject(itemSchema) ? this.coerceTypes(item, itemSchema, base) : item;\n });\n }\n}\n/**\n * The schema of an array's item at `index`: a tuple's (`prefixItems`, or a draft-7 `items` array) for its prefix,\n * `items` after `prefixItems`, or `items` for every item. Undefined when nothing applies.\n */\nfunction itemSchemaAt(schema, index) {\n if (Array.isArray(schema.items))\n return schema.items[index];\n if (Array.isArray(schema.prefixItems) && index < schema.prefixItems.length)\n return schema.prefixItems[index];\n return schema.items;\n}\n/** `items` mapped by `map`; the same array when every item maps to itself. */\nfunction mapItems(items, map) {\n let out;\n for (let i = 0; i < items.length; i++) {\n const next = map(items[i], i);\n if (next === items[i])\n continue;\n out ??= items.slice();\n out[i] = next;\n }\n return out ?? items;\n}\nfunction orValue(result, value) {\n return result === undefined ? value : result.value;\n}\n/** A literal (`const`, an enum value) taken from a value of another type that converts to exactly it. */\nfunction convertLiteral(literal, value) {\n if (literal === value)\n return value;\n const result = typeof literal === \"string\"\n ? tryString(value)\n : typeof literal === \"number\"\n ? tryNumber(value)\n : typeof literal === \"boolean\"\n ? tryBoolean(value)\n : typeof literal === \"bigint\"\n ? tryBigInt(value)\n : undefined;\n return result !== undefined && result.value === literal ? result.value : value;\n}\nfunction tryString(value) {\n if (typeof value === \"bigint\" || typeof value === \"boolean\" || isFiniteNumber(value))\n return { value: String(value) };\n if (value === null)\n return { value: \"null\" };\n if (typeof value === \"string\")\n return { value };\n if (value === undefined)\n return { value: \"\" };\n return undefined;\n}\nconst MAX_BIGINT = BigInt(Number.MAX_SAFE_INTEGER);\nconst MIN_BIGINT = BigInt(Number.MIN_SAFE_INTEGER);\nfunction tryNumber(value) {\n if (typeof value === \"bigint\")\n return value <= MAX_BIGINT && value >= MIN_BIGINT ? { value: Number(value) } : undefined;\n if (typeof value === \"boolean\")\n return { value: value ? 1 : 0 };\n if (isFiniteNumber(value))\n return { value };\n if (value === null || value === undefined)\n return { value: 0 };\n if (typeof value !== \"string\")\n return undefined;\n const coerced = +value;\n if (Number.isFinite(coerced))\n return { value: coerced };\n const lowercase = value.toLowerCase();\n if (lowercase === \"false\")\n return { value: 0 };\n if (lowercase === \"true\")\n return { value: 1 };\n const big = bigIntOfString(value);\n return big !== undefined && big <= MAX_BIGINT && big >= MIN_BIGINT ? { value: Number(big) } : undefined;\n}\n/** TypeBox's TryBigInt of a string: `12n`, `12.5` (truncated) or `12`; true and false are not reached from tryNumber. */\nfunction bigIntOfString(value) {\n if (/^-?(0|[1-9]\\d*)n$/.test(value))\n return BigInt(value.slice(0, -1));\n if (/^-?(0|[1-9]\\d*)\\.\\d+$/.test(value))\n return BigInt(value.split(\".\")[0]);\n if (/^-?(0|[1-9]\\d*)$/.test(value))\n return BigInt(value);\n return undefined;\n}\n/** TypeBox's TryBigInt: booleans to 1n/0n, numbers truncated, null and undefined to 0n, bigint-like strings. */\nfunction tryBigInt(value) {\n if (typeof value === \"bigint\")\n return { value };\n if (typeof value === \"boolean\")\n return { value: value ? 1n : 0n };\n if (isFiniteNumber(value))\n return { value: BigInt(Math.trunc(value)) };\n if (value === null || value === undefined)\n return { value: 0n };\n if (typeof value !== \"string\")\n return undefined;\n const big = bigIntOfString(value);\n if (big !== undefined)\n return { value: big };\n const lowercase = value.toLowerCase();\n return lowercase === \"false\" ? { value: 0n } : lowercase === \"true\" ? { value: 1n } : undefined;\n}\n/** TypeBox's TryUndefined: 0n, false, 0, null, `\"undefined\"`, `\"null\"`, `\"\"` and `\"0\"` to undefined. */\nfunction tryUndefined(value) {\n if (value === undefined || value === null || value === 0n || value === false || value === 0)\n return { value: undefined };\n if (typeof value !== \"string\")\n return undefined;\n const lowercase = value.toLowerCase();\n return lowercase === \"undefined\" || lowercase === \"null\" || value === \"\" || value === \"0\"\n ? { value: undefined }\n : undefined;\n}\nfunction tryBoolean(value) {\n if (typeof value === \"bigint\")\n return value === 0n ? { value: false } : value === 1n ? { value: true } : undefined;\n if (typeof value === \"boolean\")\n return { value };\n if (isFiniteNumber(value))\n return value === 0 ? { value: false } : value === 1 ? { value: true } : undefined;\n if (value === null || value === undefined)\n return { value: false };\n if (typeof value !== \"string\")\n return undefined;\n const lowercase = value.toLowerCase();\n if (lowercase === \"false\" || value === \"0\")\n return { value: false };\n if (lowercase === \"true\" || value === \"1\")\n return { value: true };\n return undefined;\n}\nfunction tryNull(value) {\n if (typeof value === \"bigint\")\n return value === 0n ? { value: null } : undefined;\n if (typeof value === \"boolean\")\n return value === false ? { value: null } : undefined;\n if (isFiniteNumber(value))\n return value === 0 ? { value: null } : undefined;\n if (value === null || value === undefined)\n return { value: null };\n if (typeof value !== \"string\")\n return undefined;\n const lowercase = value.toLowerCase();\n return lowercase === \"undefined\" || lowercase === \"null\" || value === \"\" || value === \"0\"\n ? { value: null }\n : undefined;\n}\nfunction isFiniteNumber(value) {\n return typeof value === \"number\" && Number.isFinite(value);\n}\n// -------------------------------------------------------------------------------------------------------------------\n// Primitive coercion by type (pass 3)\n// -------------------------------------------------------------------------------------------------------------------\nfunction typesOf(schema) {\n if (typeof schema.type === \"string\")\n return [schema.type];\n if (Array.isArray(schema.type))\n return schema.type.filter((type) => typeof type === \"string\");\n return [];\n}\nfunction matchesType(value, type) {\n switch (type) {\n case \"number\":\n return Number.isFinite(value);\n case \"integer\":\n return typeof value === \"number\" && Number.isInteger(value);\n case \"boolean\":\n return typeof value === \"boolean\";\n case \"string\":\n return typeof value === \"string\";\n case \"null\":\n return value === null;\n case \"bigint\":\n return typeof value === \"bigint\";\n case \"undefined\":\n return value === undefined;\n case \"array\":\n return Array.isArray(value);\n case \"object\":\n return isPlainObject(value);\n default:\n return false;\n }\n}\nfunction coercePrimitive(value, type) {\n switch (type) {\n case \"number\":\n case \"integer\": {\n if (value === null)\n return 0;\n if (typeof value === \"string\" && value.trim() !== \"\") {\n const parsed = Number(value);\n if (type === \"number\" ? Number.isFinite(parsed) : Number.isInteger(parsed))\n return parsed;\n }\n if (typeof value === \"boolean\")\n return value ? 1 : 0;\n return value;\n }\n case \"boolean\":\n if (value === null)\n return false;\n if (value === \"true\" || value === 1)\n return true;\n if (value === \"false\" || value === 0)\n return false;\n return value;\n case \"string\":\n if (value === null)\n return \"\";\n if (typeof value === \"number\" || typeof value === \"boolean\")\n return String(value);\n return value;\n case \"null\":\n return value === \"\" || value === 0 || value === false ? null : value;\n default:\n return value;\n }\n}\nfunction isPlainObject(value) {\n return typeof value === \"object\" && value !== null && !Array.isArray(value);\n}\n//# sourceMappingURL=coerce.js.map","// Annotation tracking for `unevaluatedProperties` and `unevaluatedItems`: annotating checks record which\n// properties and items a schema evaluated. Only schemas that use those keywords compile into these closures.\nimport { isObject } from \"./checks.js\";\n/** Empty annotations. */\nexport function newAnnotations() {\n return { props: null, allProps: false, items: 0, allItems: false, indexes: null };\n}\nfunction merge(a, b) {\n if (b.props !== null)\n for (const k of b.props)\n addProp(a, k);\n a.allProps ||= b.allProps;\n if (b.items > a.items)\n a.items = b.items;\n a.allItems ||= b.allItems;\n if (b.indexes !== null)\n for (const i of b.indexes)\n addIndex(a, i);\n}\nfunction addProp(a, key) {\n if (a.props === null)\n a.props = new Set();\n a.props.add(key);\n}\nfunction addIndex(a, index) {\n if (a.indexes === null)\n a.indexes = new Set();\n a.indexes.add(index);\n}\nexport const ANNOTATING_TRUE = () => true;\nexport const ANNOTATING_FALSE = () => false;\n/** The indirection a recursive reference goes through. */\nexport function indirectAnnotating(slot) {\n return (v, a) => slot.check(v, a);\n}\n/** A plain check in annotating position: it evaluates nothing that unevaluated* sees. */\nexport function ignoreAnnotations(check) {\n return (v) => check(v);\n}\n/** An annotating check run as a plain check, with fresh annotations. */\nexport function withFreshAnnotations(check) {\n return (v) => check(v, newAnnotations());\n}\n/** `check` with `uri` pushed onto the dynamic scope while it runs. */\nexport function scopedAnnotating(scope, uri, check) {\n return (v, a) => {\n scope.push(uri);\n const ok = check(v, a);\n scope.pop();\n return ok;\n };\n}\n/** unevaluated* sees only the annotations of its own schema, never those of its siblings in the parent. */\nexport function isolateAnnotations(check) {\n return (v, a) => {\n const b = newAnnotations();\n if (!check(v, b))\n return false;\n merge(a, b);\n return true;\n };\n}\n/** The non-annotating keywords, then each annotating part in order. */\nexport function annotateAll(plain, parts) {\n return (v, a) => {\n if (!plain(v))\n return false;\n for (let i = 0; i < parts.length; i++)\n if (!parts[i](v, a))\n return false;\n return true;\n };\n}\n/** `properties`, `patternProperties` and `additionalProperties`. */\nexport function annotateObject(props, patterns, additional) {\n const declared = new Set(props.map(([k]) => k));\n return (v, a) => {\n if (!isObject(v))\n return true;\n const seen = [];\n for (const [k, check] of props) {\n if (!Object.hasOwn(v, k))\n continue;\n if (!check(v[k]))\n return false;\n seen.push(k);\n }\n for (const k of Object.keys(v)) {\n let matched = declared.has(k);\n for (const [re, check] of patterns) {\n if (re.test(k)) {\n if (!check(v[k]))\n return false;\n matched = true;\n seen.push(k);\n }\n }\n if (!matched && additional !== undefined) {\n if (!additional(v[k]))\n return false;\n seen.push(k);\n }\n }\n for (const k of seen)\n addProp(a, k);\n return true;\n };\n}\n/** `prefixItems`/`items`/`additionalItems` and `contains` with its bounds. */\nexport function annotateArray(prefix, rest, contains, minContains, maxContains) {\n return (v, a) => {\n if (!Array.isArray(v))\n return true;\n const m = Math.min(v.length, prefix.length);\n for (let i = 0; i < m; i++)\n if (!prefix[i](v[i]))\n return false;\n if (rest !== undefined) {\n for (let i = prefix.length; i < v.length; i++)\n if (!rest(v[i]))\n return false;\n a.allItems = true;\n }\n if (m > a.items)\n a.items = m;\n if (contains !== undefined) {\n let n = 0;\n for (let i = 0; i < v.length; i++) {\n if (contains(v[i])) {\n n++;\n addIndex(a, i);\n }\n }\n if (n < minContains || n > maxContains)\n return false;\n }\n return true;\n };\n}\n/** `anyOf` (or `oneOf` when `exactlyOne`): every passing branch contributes its annotations. */\nexport function annotateAny(branches, exactlyOne) {\n return (v, a) => {\n let n = 0;\n for (const branch of branches) {\n const b = newAnnotations();\n if (branch(v, b)) {\n n++;\n merge(a, b);\n }\n }\n return exactlyOne ? n === 1 : n > 0;\n };\n}\n/** `if`, `then` and `else`: a passing `if` contributes its annotations even without `then`. */\nexport function annotateIf(cond, then, otherwise) {\n return (v, a) => {\n const b = newAnnotations();\n if (cond(v, b)) {\n merge(a, b);\n return then === undefined || then(v, a);\n }\n return otherwise === undefined || otherwise(v, a);\n };\n}\n/** One `dependentSchemas` entry. */\nexport function annotateDependent(key, check) {\n return (v, a) => !isObject(v) || !Object.hasOwn(v, key) || check(v, a);\n}\n/** `unevaluatedProperties`: every property no other keyword evaluated passes `check`. */\nexport function unevaluatedProperties(check) {\n return (v, a) => {\n if (!isObject(v) || a.allProps)\n return true;\n for (const k of Object.keys(v))\n if (!(a.props?.has(k) ?? false) && !check(v[k]))\n return false;\n a.allProps = true;\n return true;\n };\n}\n/** `unevaluatedItems`: every item no other keyword evaluated passes `check`. */\nexport function unevaluatedItems(check) {\n return (v, a) => {\n if (!Array.isArray(v) || a.allItems)\n return true;\n for (let i = a.items; i < v.length; i++)\n if (!(a.indexes?.has(i) ?? false) && !check(v[i]))\n return false;\n a.allItems = true;\n return true;\n };\n}\n//# sourceMappingURL=annotations.js.map","// The compiler: a schema to one check closure, built once. Keywords group by the type they constrain, so a value\n// is classified once per schema, and the common shapes (closed objects, arrays of one item schema, tagged unions,\n// leaf schemas) get one specialized closure each.\nimport { ANNOTATING_FALSE, ANNOTATING_TRUE, annotateAll, annotateAny, annotateArray, annotateDependent, annotateIf, annotateObject, ignoreAnnotations, indirectAnnotating, isolateAnnotations, scopedAnnotating, unevaluatedItems, unevaluatedProperties, withFreshAnnotations, } from \"./annotations.js\";\nimport { ALWAYS, and, anyCheck, bytesCheck, constCheck, containsCheck, declaredObject, dependentRequiredCheck, dependentSchemasCheck, enumCheck, GUARD_LOOSE, GUARD_NONE, GUARD_STRICT, guardArray, guardObject, INHERITED, IS_ARRAY, IS_OBJECT, ifCheck, indirect, itemsCheck, leafOf, lengthCheck, listCheck, maskedAnyCheck, NEVER, notCheck, numberCheck, oneCheck, openObject, propertyCountCheck, propertyNamesCheck, REQUIRED, scopedCheck, stringCheck, TYPE_CHECKS, taggedCheck, typeCheck, typeMask, uniqueCheck, } from \"./checks.js\";\nimport { documentOf, isSchemaObject, Resolver, resolveUri } from \"./resolver.js\";\nimport { sharedRegex } from \"./shared.js\";\n/** Thrown when a compile without dynamic scope tracking meets a bookended `$dynamicRef`: compile again with it. */\nexport const RESTART = Symbol(\"restart\");\n/** One compile of a schema. Its caches and indexes are garbage once the root check is built. */\nexport class Compiler {\n r;\n draft;\n formats;\n /** Whether checks track the dynamic scope (the schema has a bookended `$dynamicRef`). */\n dynamic;\n schema;\n scope;\n cache = new Map();\n annotatingCache = new Map();\n constructor(schema, options, dynamic) {\n this.schema = schema;\n this.r = new Resolver(schema, options);\n this.draft = this.r.draft;\n this.formats = options.formats;\n this.dynamic = dynamic;\n this.scope = [];\n }\n /** The check of the root schema. */\n root() {\n return this.check(this.schema, this.r.rootBase);\n }\n /** The check of a schema (cached by schema object; a recursive reference goes through an indirection). */\n check(node, base) {\n if (node === true)\n return ALWAYS;\n if (node === false)\n return NEVER;\n if (!isSchemaObject(node))\n throw new Error(`A schema must be an object or a boolean, got ${JSON.stringify(node)}`);\n const cached = this.cache.get(node);\n if (cached !== undefined)\n return cached;\n const bare = this.bareType(node);\n if (bare !== undefined)\n return bare;\n const slot = { check: undefined };\n this.cache.set(node, indirect(slot));\n const check = this.build(node, this.r.baseFor(node, base));\n slot.check = check;\n this.cache.set(node, check);\n return check;\n }\n build(node, base) {\n if (this.draft === \"7\" && typeof node.$ref === \"string\")\n return this.ref(node.$ref, base);\n if (this.draft !== \"7\" && (node.unevaluatedProperties !== undefined || node.unevaluatedItems !== undefined)) {\n return withFreshAnnotations(this.annotating(node, base));\n }\n const check = this.plain(node, base);\n return this.dynamic && this.r.isResource(node, base) ? scopedCheck(this.scope, base, check) : check;\n }\n /**\n * The module-level check of a schema that is only a `type` (with annotations), `ALWAYS` for one with no assertion\n * at all; undefined for every other schema. These are the most common subschemas and cost nothing to share.\n */\n bareType(node) {\n let type;\n for (const k in node) {\n if (k === \"type\")\n type = node.type;\n else if (!NEUTRAL_KEYWORDS.has(k))\n return undefined;\n }\n if (type === undefined)\n return ALWAYS;\n return typeof type === \"string\" ? TYPE_CHECKS.get(type) : undefined;\n }\n /** Every keyword of `node`, not tracking annotations. */\n plain(node, base) {\n const parts = [];\n const types = node.type === undefined ? undefined : Array.isArray(node.type) ? node.type : [node.type];\n const single = types?.length === 1 ? types[0] : undefined;\n let typeInGroup = false;\n if (single === \"bytes\") {\n parts.push(bytesCheck(number(node.minLength) ?? 0, number(node.maxLength) ?? Number.POSITIVE_INFINITY));\n typeInGroup = true;\n }\n else {\n const string = this.stringGroup(node, single === \"string\");\n if (string !== undefined)\n parts.push(string);\n const numeric = single === \"number\" || single === \"integer\" || single === \"bigint\";\n const mode = single === \"number\" ? 1 : single === \"integer\" ? 2 : single === \"bigint\" ? 3 : 0;\n const number = this.numberGroup(node, mode);\n if (number !== undefined)\n parts.push(number);\n const object = this.objectGroup(node, base, single === \"object\");\n if (object !== undefined)\n parts.push(object);\n const array = this.arrayGroup(node, base, single === \"array\");\n if (array !== undefined)\n parts.push(array);\n typeInGroup =\n (single === \"string\" && string !== undefined) ||\n (numeric && number !== undefined) ||\n (single === \"object\" && object !== undefined) ||\n (single === \"array\" && array !== undefined);\n }\n if (types !== undefined && !typeInGroup)\n parts.unshift(typeCheck(types));\n this.inPlace(node, base, parts);\n return and(parts);\n }\n // The keywords that apply to the value itself, whatever its type.\n inPlace(node, base, parts) {\n if (Array.isArray(node.enum))\n parts.push(enumCheck(node.enum));\n if (Object.hasOwn(node, \"const\"))\n parts.push(constCheck(node.const));\n if (Array.isArray(node.allOf))\n parts.push(and(node.allOf.map((s) => this.check(s, base))));\n if (Array.isArray(node.anyOf))\n parts.push(this.union(node.anyOf, base, false));\n if (Array.isArray(node.oneOf))\n parts.push(this.union(node.oneOf, base, true));\n if (node.not !== undefined)\n parts.push(notCheck(this.check(node.not, base)));\n if (node.if !== undefined && (node.then !== undefined || node.else !== undefined)) {\n const then = node.then === undefined ? ALWAYS : this.check(node.then, base);\n const otherwise = node.else === undefined ? ALWAYS : this.check(node.else, base);\n parts.push(ifCheck(this.check(node.if, base), then, otherwise));\n }\n if (typeof node.$ref === \"string\")\n parts.push(this.ref(node.$ref, base));\n if (this.draft !== \"7\" && typeof node.$dynamicRef === \"string\") {\n parts.push(this.dynamicRef(node.$dynamicRef, base));\n }\n }\n union(branches, base, exactlyOne) {\n const checks = () => branches.map((s) => this.check(s, base));\n return (constUnion(branches, exactlyOne) ??\n this.tagged(branches, base) ??\n (exactlyOne ? oneCheck(checks()) : anyOf(checks())));\n }\n ref(ref, base) {\n const target = this.r.resolve(ref, base);\n const check = this.check(target.node, target.base);\n return this.dynamic && target.base !== base ? scopedCheck(this.scope, target.base, check) : check;\n }\n dynamicRef(ref, base) {\n const resolved = this.bookended(ref, base);\n if (resolved === undefined)\n return this.ref(ref, base);\n const { initial, name } = resolved;\n const fallback = this.check(initial.node, initial.base);\n const lookup = this.dynamicLookup(name, (node, b) => this.check(node, b));\n const scope = this.scope;\n return (v) => {\n for (let i = 0; i < scope.length; i++) {\n const check = lookup(scope[i]);\n if (check !== null)\n return check(v);\n }\n return fallback(v);\n };\n }\n /** The initial target and anchor name of a `$dynamicRef` that resolves dynamically, or undefined for a plain ref. */\n bookended(ref, base) {\n const initial = this.r.resolve(ref, base);\n const uri = resolveUri(ref, base);\n const name = uri.slice(documentOf(uri).length + 1);\n const anchored = isSchemaObject(initial.node) && initial.node.$dynamicAnchor === name;\n if (name === \"\" || name.startsWith(\"/\") || !anchored)\n return undefined;\n if (!this.dynamic)\n throw RESTART;\n return { initial, name };\n }\n // Resolved at run time against the dynamic scope, so a schema with a bookended $dynamicRef keeps its compiler.\n dynamicLookup(name, compile) {\n const found = new Map();\n return (uri) => {\n const key = `${uri}#${name}`;\n let check = found.get(key);\n if (check === undefined) {\n const target = this.r.dynamicAnchors.get(key);\n check = target === undefined ? null : compile(target, this.r.baseOf.get(target) ?? uri);\n found.set(key, check);\n }\n return check;\n };\n }\n /** anyOf/oneOf whose branches are all objects with a distinct required const on one key: the tag picks the branch. */\n tagged(branches, base) {\n if (branches.length < 2)\n return undefined;\n const resolved = [];\n for (const branch of branches) {\n if (!isSchemaObject(branch))\n return undefined;\n const ref = typeof branch.$ref === \"string\" && Object.keys(branch).length === 1 ? branch.$ref : undefined;\n const node = ref === undefined ? branch : this.r.resolve(ref, this.r.baseFor(branch, base)).node;\n if (!isSchemaObject(node))\n return undefined;\n resolved.push(node);\n }\n const first = resolved[0].properties;\n if (!isSchemaObject(first))\n return undefined;\n for (const key of Object.keys(first)) {\n const tags = resolved.map((s) => tagOf(s, key));\n if (tags.some((t) => t === undefined) || new Set(tags).size !== tags.length)\n continue;\n return taggedCheck(key, tags, branches.map((s) => this.check(s, base)));\n }\n return undefined;\n }\n stringGroup(node, strict) {\n const min = number(node.minLength) ?? 0;\n const max = number(node.maxLength) ?? Number.POSITIVE_INFINITY;\n const re = typeof node.pattern === \"string\" ? sharedRegex(node.pattern) : undefined;\n const format = this.formats !== undefined && typeof node.format === \"string\" && Object.hasOwn(this.formats, node.format)\n ? this.formats[node.format]\n : undefined;\n if (min === 0 && max === Number.POSITIVE_INFINITY && re === undefined && format === undefined)\n return undefined;\n return stringCheck(strict, min, max, re, format);\n }\n numberGroup(node, mode) {\n const min = bound(node.minimum);\n const max = bound(node.maximum);\n const xmin = bound(node.exclusiveMinimum);\n const xmax = bound(node.exclusiveMaximum);\n const multipleOf = bound(node.multipleOf);\n if ([min, max, xmin, xmax, multipleOf].every((x) => x === undefined))\n return undefined;\n const inf = Number.POSITIVE_INFINITY;\n return numberCheck(mode, min ?? -inf, max ?? inf, xmin ?? -inf, xmax ?? inf, multipleOf);\n }\n objectGroup(node, base, strict) {\n const onlyCore = OBJECT_EXTRAS.every((k) => node[k] === undefined);\n // A schema with only the core object keywords gets one closure that also does the type guard.\n const core = this.objectCore(node, base, onlyCore ? (strict ? GUARD_STRICT : GUARD_LOOSE) : GUARD_NONE);\n if (core !== undefined && onlyCore)\n return core;\n const parts = core === undefined ? [] : [core];\n if (node.propertyNames !== undefined)\n parts.push(propertyNamesCheck(this.check(node.propertyNames, base)));\n const minProperties = number(node.minProperties);\n const maxProperties = number(node.maxProperties);\n if (minProperties !== undefined || maxProperties !== undefined) {\n parts.push(propertyCountCheck(minProperties ?? 0, maxProperties ?? Number.POSITIVE_INFINITY));\n }\n const dependentRequired = [];\n const dependentSchemas = [];\n if (this.draft !== \"7\") {\n for (const [k, list] of entries(node.dependentRequired))\n if (Array.isArray(list))\n dependentRequired.push([k, list]);\n for (const [k, s] of entries(node.dependentSchemas))\n dependentSchemas.push([k, this.check(s, base)]);\n }\n for (const [k, d] of entries(node.dependencies)) {\n if (Array.isArray(d))\n dependentRequired.push([k, d]);\n else\n dependentSchemas.push([k, this.check(d, base)]);\n }\n if (dependentRequired.length > 0)\n parts.push(dependentRequiredCheck(dependentRequired));\n if (dependentSchemas.length > 0)\n parts.push(dependentSchemasCheck(dependentSchemas));\n if (parts.length === 0)\n return strict ? IS_OBJECT : undefined;\n return guardObject(and(parts), strict);\n }\n objectCore(node, base, guard) {\n const properties = isSchemaObject(node.properties) ? node.properties : {};\n const required = Array.isArray(node.required) ? node.required.filter((k) => typeof k === \"string\") : [];\n const patterns = isSchemaObject(node.patternProperties) ? node.patternProperties : {};\n const additional = node.additionalProperties;\n const keys = Object.keys(properties);\n const patternKeys = Object.keys(patterns);\n if (keys.length + required.length + patternKeys.length === 0 &&\n (additional === undefined || additional === true)) {\n return undefined;\n }\n // One array per object: key, check (or a leaf's argument), flags (leaf code, required, key also names an\n // Object.prototype member).\n const entries = [];\n for (const k of keys) {\n const check = this.check(properties[k], base);\n const leaf = leafOf(check);\n const flags = (leaf?.[0] ?? 0) | (required.includes(k) ? REQUIRED : 0) | (k in Object.prototype ? INHERITED : 0);\n entries.push(k, leaf === undefined ? check : leaf[1], flags);\n }\n const extraRequired = required.filter((k) => !Object.hasOwn(properties, k));\n const pats = patternKeys.map((p) => [sharedRegex(p), this.check(patterns[p], base)]);\n const extra = additional === undefined || additional === true ? undefined : this.check(additional, base);\n if (pats.length === 0 && extraRequired.length === 0 && (extra === undefined || additional === false)) {\n const requiredCount = keys.filter((k) => required.includes(k)).length;\n return declaredObject(entries, requiredCount, additional === false, guard);\n }\n return openObject(entries, keys, extraRequired, pats, extra, guard);\n }\n arrayGroup(node, base, strict) {\n let prefix = [];\n let rest;\n if (Array.isArray(node.items)) {\n prefix = node.items;\n rest = node.additionalItems;\n }\n else {\n if (this.draft !== \"7\" && Array.isArray(node.prefixItems))\n prefix = node.prefixItems;\n rest = node.items;\n }\n const prefixChecks = prefix.map((s) => this.check(s, base));\n const restCheck = rest === undefined || rest === true ? undefined : this.check(rest, base);\n const minItems = number(node.minItems);\n const maxItems = number(node.maxItems);\n if (node.contains === undefined &&\n node.uniqueItems !== true &&\n (prefixChecks.length > 0 || restCheck !== undefined)) {\n // The common array: one closure for the guard, the length bounds and the items.\n const guard = strict ? GUARD_STRICT : GUARD_LOOSE;\n return listCheck(guard, minItems ?? 0, maxItems ?? Number.POSITIVE_INFINITY, prefixChecks, restCheck);\n }\n const parts = [];\n if (prefixChecks.length > 0 || restCheck !== undefined)\n parts.push(itemsCheck(prefixChecks, restCheck));\n if (minItems !== undefined || maxItems !== undefined) {\n parts.push(lengthCheck(minItems ?? 0, maxItems ?? Number.POSITIVE_INFINITY));\n }\n if (node.contains !== undefined) {\n const min = this.draft === \"7\" ? 1 : (number(node.minContains) ?? 1);\n const max = this.draft === \"7\" ? Number.POSITIVE_INFINITY : (number(node.maxContains) ?? Number.POSITIVE_INFINITY);\n parts.push(containsCheck(this.check(node.contains, base), min, max));\n }\n if (node.uniqueItems === true)\n parts.push(uniqueCheck);\n if (parts.length === 0)\n return strict ? IS_ARRAY : undefined;\n return guardArray(and(parts), strict);\n }\n /** The annotating check of a schema evaluated in place (only below `unevaluatedProperties`/`unevaluatedItems`). */\n annotating(node, base) {\n if (node === true)\n return ANNOTATING_TRUE;\n if (node === false)\n return ANNOTATING_FALSE;\n if (!isSchemaObject(node))\n throw new Error(`A schema must be an object or a boolean, got ${JSON.stringify(node)}`);\n const cached = this.annotatingCache.get(node);\n if (cached !== undefined)\n return cached;\n const slot = { check: undefined };\n this.annotatingCache.set(node, indirectAnnotating(slot));\n const check = this.buildAnnotating(node, this.r.baseFor(node, base));\n slot.check = check;\n this.annotatingCache.set(node, check);\n return check;\n }\n buildAnnotating(node, base) {\n const rest = {};\n let annotates = false;\n for (const k of Object.keys(node)) {\n if (ANNOTATING.has(k))\n annotates = true;\n else\n rest[k] = node[k];\n }\n const plain = this.plain(rest, base);\n const parts = [];\n if (annotates)\n this.annotatingParts(node, base, parts);\n const all = parts.length === 0 ? ignoreAnnotations(plain) : annotateAll(plain, parts);\n const own = node.unevaluatedProperties !== undefined || node.unevaluatedItems !== undefined\n ? isolateAnnotations(all)\n : all;\n return this.dynamic && this.r.isResource(node, base) ? scopedAnnotating(this.scope, base, own) : own;\n }\n annotatingParts(node, base, parts) {\n if (node.properties !== undefined ||\n node.patternProperties !== undefined ||\n node.additionalProperties !== undefined) {\n const props = entries(node.properties).map(([k, s]) => [k, this.check(s, base)]);\n const pats = entries(node.patternProperties).map(([p, s]) => [sharedRegex(p), this.check(s, base)]);\n const extra = node.additionalProperties === undefined ? undefined : this.check(node.additionalProperties, base);\n parts.push(annotateObject(props, pats, extra));\n }\n if (node.prefixItems !== undefined || node.items !== undefined || node.contains !== undefined) {\n const prefix = Array.isArray(node.prefixItems)\n ? node.prefixItems\n : Array.isArray(node.items)\n ? node.items\n : [];\n const rest = Array.isArray(node.items) ? node.additionalItems : node.items;\n parts.push(annotateArray(prefix.map((s) => this.check(s, base)), rest === undefined ? undefined : this.check(rest, base), node.contains === undefined ? undefined : this.check(node.contains, base), number(node.minContains) ?? 1, number(node.maxContains) ?? Number.POSITIVE_INFINITY));\n }\n if (Array.isArray(node.allOf))\n for (const s of node.allOf)\n parts.push(this.annotating(s, base));\n if (Array.isArray(node.anyOf))\n parts.push(annotateAny(node.anyOf.map((s) => this.annotating(s, base)), false));\n if (Array.isArray(node.oneOf))\n parts.push(annotateAny(node.oneOf.map((s) => this.annotating(s, base)), true));\n if (node.if !== undefined) {\n const then = node.then === undefined ? undefined : this.annotating(node.then, base);\n const otherwise = node.else === undefined ? undefined : this.annotating(node.else, base);\n parts.push(annotateIf(this.annotating(node.if, base), then, otherwise));\n }\n if (typeof node.$ref === \"string\")\n parts.push(this.annotatingRef(node.$ref, base));\n if (typeof node.$dynamicRef === \"string\")\n parts.push(this.annotatingDynamicRef(node.$dynamicRef, base));\n for (const [k, s] of entries(node.dependentSchemas))\n parts.push(annotateDependent(k, this.annotating(s, base)));\n if (node.unevaluatedProperties !== undefined) {\n parts.push(unevaluatedProperties(this.check(node.unevaluatedProperties, base)));\n }\n if (node.unevaluatedItems !== undefined)\n parts.push(unevaluatedItems(this.check(node.unevaluatedItems, base)));\n }\n annotatingRef(ref, base) {\n const target = this.r.resolve(ref, base);\n const check = this.annotating(target.node, target.base);\n return this.dynamic && target.base !== base ? scopedAnnotating(this.scope, target.base, check) : check;\n }\n annotatingDynamicRef(ref, base) {\n const resolved = this.bookended(ref, base);\n if (resolved === undefined)\n return this.annotatingRef(ref, base);\n const { initial, name } = resolved;\n const fallback = this.annotating(initial.node, initial.base);\n const lookup = this.dynamicLookup(name, (node, b) => this.annotating(node, b));\n const scope = this.scope;\n return (v, a) => {\n for (let i = 0; i < scope.length; i++) {\n const check = lookup(scope[i]);\n if (check !== null)\n return check(v, a);\n }\n return fallback(v, a);\n };\n }\n}\n/** Keywords that never affect a check. */\nexport const NEUTRAL_KEYWORDS = new Set([\n \"$schema\",\n \"$comment\",\n \"title\",\n \"description\",\n \"default\",\n \"examples\",\n \"deprecated\",\n \"readOnly\",\n \"writeOnly\",\n \"$defs\",\n \"definitions\",\n \"contentEncoding\",\n \"contentMediaType\",\n \"minContains\",\n \"maxContains\",\n \"$vocabulary\",\n]);\n// The object keywords besides the core (properties, required, patternProperties, additionalProperties).\nconst OBJECT_EXTRAS = [\n \"propertyNames\",\n \"minProperties\",\n \"maxProperties\",\n \"dependentRequired\",\n \"dependentSchemas\",\n \"dependencies\",\n];\n// The keywords an annotating check handles itself; every other keyword compiles into its plain part.\nconst ANNOTATING = new Set([\n \"properties\",\n \"patternProperties\",\n \"additionalProperties\",\n \"prefixItems\",\n \"items\",\n \"additionalItems\",\n \"contains\",\n \"minContains\",\n \"maxContains\",\n \"allOf\",\n \"anyOf\",\n \"oneOf\",\n \"if\",\n \"then\",\n \"else\",\n \"$ref\",\n \"$dynamicRef\",\n \"dependentSchemas\",\n \"unevaluatedProperties\",\n \"unevaluatedItems\",\n]);\n/** anyOf/oneOf whose branches are all `{ const: primitive }`: an enum (distinct values make oneOf the same). */\nfunction constUnion(branches, exactlyOne) {\n const values = [];\n for (const branch of branches) {\n if (!isSchemaObject(branch) || !Object.hasOwn(branch, \"const\"))\n return undefined;\n for (const k of Object.keys(branch))\n if (k !== \"const\" && !NEUTRAL_KEYWORDS.has(k))\n return undefined;\n if (typeof branch.const === \"object\" && branch.const !== null)\n return undefined;\n if (exactlyOne && values.includes(branch.const))\n return undefined;\n values.push(branch.const);\n }\n return enumCheck(values);\n}\n/** `anyOf`: its bare-type branches (`nullable` gives one) run as one type test. */\nfunction anyOf(checks) {\n const types = [];\n const rest = [];\n for (const check of checks) {\n const type = BARE_TYPES.get(check);\n if (type === undefined)\n rest.push(check);\n else\n types.push(type);\n }\n return types.length === 0 ? anyCheck(rest) : maskedAnyCheck(typeMask(types), rest);\n}\nconst BARE_TYPES = new Map([...TYPE_CHECKS].map(([type, check]) => [check, type]));\n// The tag of a tagged-union branch: a primitive const on a required property of an object schema.\nfunction tagOf(branch, key) {\n const properties = branch.properties;\n if (branch.type !== \"object\" || !Array.isArray(branch.required) || !branch.required.includes(key))\n return undefined;\n const tag = isSchemaObject(properties) ? properties[key] : undefined;\n if (!isSchemaObject(tag) || !Object.hasOwn(tag, \"const\"))\n return undefined;\n return typeof tag.const === \"object\" && tag.const !== null ? undefined : tag.const;\n}\n/** A number keyword's value: a number, or a bigint (TypeBox's `Type.BigInt` bounds). */\nfunction bound(value) {\n return typeof value === \"number\" || typeof value === \"bigint\" ? value : undefined;\n}\nfunction number(value) {\n return typeof value === \"number\" ? value : undefined;\n}\nfunction entries(value) {\n return isSchemaObject(value) ? Object.entries(value) : [];\n}\n//# sourceMappingURL=compiler.js.map","// Errors of a failed value: a walk over the schema that reports each failing keyword at the value it failed on.\n// It runs only for values that failed the check, using the compiler's checks for subschemas.\nimport { newAnnotations } from \"./annotations.js\";\nimport { codePoints, constCheck, containsCheck, enumCheck, isMultiple, isObject, NEVER, TYPE_CHECKS, uniqueCheck, } from \"./checks.js\";\nimport { isSchemaObject } from \"./resolver.js\";\nimport { sharedRegex } from \"./shared.js\";\n/** Explains failures of one compiled schema. */\nexport class Explainer {\n c;\n schema;\n /**\n * The errors of `$ref` targets for object values, within one errors() call: a recursive union explains each branch\n * to pick the one to blame, and every branch would explain the same children again, exponentially in the depth.\n */\n memo = undefined;\n constructor(compiler, schema) {\n this.c = compiler;\n this.schema = schema;\n compiler.root();\n }\n /** The errors of `value`, at least one (`value` failed the check). */\n errors(value) {\n const out = [];\n try {\n this.walk(this.schema, this.c.r.rootBase, value, \"\", out);\n }\n finally {\n this.memo = undefined;\n }\n if (out.length === 0)\n out.push({ path: \"\", keyword: \"schema\", message: \"invalid\" });\n return out;\n }\n ok(node, base, v) {\n return this.c.check(node, base)(v);\n }\n // For $dynamicRef schemas this check runs outside the original dynamic scope, so their errors are approximate.\n walk(node, base, v, path, out) {\n if (node === true)\n return;\n if (node === false) {\n out.push({ path, keyword: \"false\", message: \"no value is allowed here\" });\n return;\n }\n if (!isSchemaObject(node))\n return;\n const b = this.c.r.baseFor(node, base);\n if (this.ok(node, b, v))\n return;\n const start = out.length;\n const push = (keyword, message, at = path) => {\n out.push({ path: at, keyword, message });\n };\n if (this.c.draft === \"7\" && typeof node.$ref === \"string\") {\n this.walkRef(node.$ref, b, v, path, out);\n return;\n }\n if (node.type !== undefined) {\n const types = Array.isArray(node.type) ? node.type : [node.type];\n const checks = types.map((t) => (typeof t === \"string\" ? TYPE_CHECKS.get(t) : undefined) ?? NEVER);\n if (!checks.some((check) => check(v))) {\n push(\"type\", `expected ${types.join(\" or \")}, got ${typeName(v)}`);\n return;\n }\n }\n if (Array.isArray(node.enum) && !enumCheck(node.enum)(v))\n push(\"enum\", `expected one of ${listValues(node.enum)}`);\n if (Object.hasOwn(node, \"const\") && !constCheck(node.const)(v))\n push(\"const\", `expected ${JSON.stringify(node.const)}`);\n if (typeof v === \"string\" && node.type !== \"bytes\")\n this.walkString(node, v, push);\n if (v instanceof Uint8Array && node.type === \"bytes\")\n this.walkBytes(node, v, push);\n if (typeof v === \"number\" || typeof v === \"bigint\")\n this.walkNumber(node, v, push);\n if (isObject(v))\n this.walkObject(node, b, v, path, out, push);\n if (Array.isArray(v))\n this.walkArray(node, b, v, path, out, push);\n if (Array.isArray(node.allOf))\n for (const s of node.allOf)\n this.walk(s, b, v, path, out);\n if (Array.isArray(node.anyOf))\n this.walkUnion(node.anyOf, b, v, path, out, false);\n if (Array.isArray(node.oneOf))\n this.walkUnion(node.oneOf, b, v, path, out, true);\n if (node.not !== undefined && this.ok(node.not, b, v))\n push(\"not\", \"must not match the schema in not\");\n if (node.if !== undefined) {\n const branch = this.ok(node.if, b, v) ? node.then : node.else;\n if (branch !== undefined)\n this.walk(branch, b, v, path, out);\n }\n if (typeof node.$ref === \"string\")\n this.walkRef(node.$ref, b, v, path, out);\n if (out.length === start && (node.unevaluatedProperties !== undefined || node.unevaluatedItems !== undefined)) {\n this.walkUnevaluated(node, b, v, path, out);\n }\n if (out.length === start && typeof node.$dynamicRef === \"string\") {\n push(\"$dynamicRef\", \"does not match the dynamically referenced schema\");\n }\n }\n walkRef(ref, base, v, path, out) {\n const target = this.c.r.resolve(ref, base);\n if (target.node === false && this.c.r.isUnresolved(ref, base)) {\n out.push({ path, keyword: \"$ref\", message: `unresolved reference ${ref}` });\n return;\n }\n if (!isSchemaObject(target.node) || typeof v !== \"object\" || v === null) {\n this.walk(target.node, target.base, v, path, out);\n return;\n }\n this.memo ??= new Map();\n let values = this.memo.get(target.node);\n const known = values?.get(v);\n if (known !== undefined && known.path === path) {\n out.push(...known.errors);\n return;\n }\n const errors = [];\n this.walk(target.node, target.base, v, path, errors);\n if (values === undefined) {\n values = new Map();\n this.memo.set(target.node, values);\n }\n values.set(v, { path, errors });\n out.push(...errors);\n }\n walkString(node, v, push) {\n const n = codePoints(v);\n if (typeof node.minLength === \"number\" && n < node.minLength) {\n push(\"minLength\", `expected at least ${node.minLength} characters`);\n }\n if (typeof node.maxLength === \"number\" && n > node.maxLength) {\n push(\"maxLength\", `expected at most ${node.maxLength} characters`);\n }\n if (typeof node.pattern === \"string\" && !sharedRegex(node.pattern).test(v)) {\n push(\"pattern\", `expected to match ${node.pattern}`);\n }\n const formats = this.c.formats;\n const format = formats !== undefined && typeof node.format === \"string\" && Object.hasOwn(formats, node.format)\n ? formats[node.format]\n : undefined;\n if (format !== undefined && !format(v))\n push(\"format\", `expected format ${node.format}`);\n }\n walkBytes(node, v, push) {\n if (typeof node.minLength === \"number\" && v.length < node.minLength) {\n push(\"minLength\", `expected at least ${node.minLength} bytes`);\n }\n if (typeof node.maxLength === \"number\" && v.length > node.maxLength) {\n push(\"maxLength\", `expected at most ${node.maxLength} bytes`);\n }\n }\n // Numbers and bigints alike: bounds of either kind compare with values of either kind.\n walkNumber(node, v, push) {\n const { minimum, maximum, exclusiveMinimum, exclusiveMaximum, multipleOf } = node;\n if (isBound(minimum) && v < minimum)\n push(\"minimum\", `expected >= ${minimum}`);\n if (isBound(maximum) && v > maximum)\n push(\"maximum\", `expected <= ${maximum}`);\n if (isBound(exclusiveMinimum) && v <= exclusiveMinimum)\n push(\"exclusiveMinimum\", `expected > ${exclusiveMinimum}`);\n if (isBound(exclusiveMaximum) && v >= exclusiveMaximum)\n push(\"exclusiveMaximum\", `expected < ${exclusiveMaximum}`);\n if (isBound(multipleOf) && !isMultiple(v, multipleOf))\n push(\"multipleOf\", `expected a multiple of ${multipleOf}`);\n }\n walkObject(node, b, v, path, out, push) {\n const properties = isSchemaObject(node.properties) ? node.properties : {};\n const required = Array.isArray(node.required) ? node.required : [];\n for (const k of required) {\n if (typeof k !== \"string\")\n continue;\n // Present and set to undefined: missing unless its schema takes undefined (see declaredObject).\n const accepted = v[k] === undefined && Object.hasOwn(properties, k) && this.ok(properties[k], b, undefined);\n if (!Object.hasOwn(v, k) || (v[k] === undefined && !accepted))\n push(\"required\", \"missing\", pointer(path, k));\n }\n for (const k of Object.keys(properties)) {\n if (Object.hasOwn(v, k) && v[k] !== undefined)\n this.walk(properties[k], b, v[k], pointer(path, k), out);\n }\n const patterns = isSchemaObject(node.patternProperties) ? Object.entries(node.patternProperties) : [];\n for (const k of Object.keys(v)) {\n let matched = Object.hasOwn(properties, k);\n for (const [p, s] of patterns) {\n if (sharedRegex(p).test(k)) {\n matched = true;\n this.walk(s, b, v[k], pointer(path, k), out);\n }\n }\n if (!matched && node.additionalProperties !== undefined) {\n if (node.additionalProperties === false)\n push(\"additionalProperties\", \"unknown field\", pointer(path, k));\n else\n this.walk(node.additionalProperties, b, v[k], pointer(path, k), out);\n }\n if (node.propertyNames !== undefined && !this.ok(node.propertyNames, b, k)) {\n push(\"propertyNames\", \"invalid property name\", pointer(path, k));\n }\n }\n const count = Object.keys(v).length;\n if (typeof node.minProperties === \"number\" && count < node.minProperties) {\n push(\"minProperties\", `expected at least ${node.minProperties} properties`);\n }\n if (typeof node.maxProperties === \"number\" && count > node.maxProperties) {\n push(\"maxProperties\", `expected at most ${node.maxProperties} properties`);\n }\n const dependencies = {\n ...(this.c.draft === \"7\" || !isSchemaObject(node.dependentRequired) ? {} : node.dependentRequired),\n ...(isSchemaObject(node.dependencies) ? node.dependencies : {}),\n };\n for (const [k, d] of Object.entries(dependencies)) {\n if (!Object.hasOwn(v, k))\n continue;\n if (!Array.isArray(d))\n this.walk(d, b, v, path, out);\n else\n for (const r of d)\n if (!Object.hasOwn(v, r))\n push(\"dependentRequired\", `required when ${k} is present`, pointer(path, r));\n }\n if (this.c.draft !== \"7\" && isSchemaObject(node.dependentSchemas)) {\n for (const [k, s] of Object.entries(node.dependentSchemas))\n if (Object.hasOwn(v, k))\n this.walk(s, b, v, path, out);\n }\n }\n walkArray(node, b, v, path, out, push) {\n let prefix = [];\n let rest;\n if (Array.isArray(node.items)) {\n prefix = node.items;\n rest = node.additionalItems;\n }\n else {\n if (this.c.draft !== \"7\" && Array.isArray(node.prefixItems))\n prefix = node.prefixItems;\n rest = node.items;\n }\n for (let i = 0; i < v.length; i++) {\n const s = i < prefix.length ? prefix[i] : rest;\n if (s !== undefined)\n this.walk(s, b, v[i], `${path}/${i}`, out);\n }\n if (typeof node.minItems === \"number\" && v.length < node.minItems) {\n push(\"minItems\", `expected at least ${node.minItems} items`);\n }\n if (typeof node.maxItems === \"number\" && v.length > node.maxItems) {\n push(\"maxItems\", `expected at most ${node.maxItems} items`);\n }\n if (node.uniqueItems === true && !uniqueCheck(v))\n push(\"uniqueItems\", \"expected unique items\");\n if (node.contains !== undefined) {\n const draft7 = this.c.draft === \"7\";\n const min = draft7 || typeof node.minContains !== \"number\" ? 1 : node.minContains;\n const max = draft7 || typeof node.maxContains !== \"number\" ? Number.POSITIVE_INFINITY : node.maxContains;\n if (!containsCheck(this.c.check(node.contains, b), min, max)(v)) {\n push(\"contains\", containsMessage(min, max));\n }\n }\n }\n walkUnion(branches, b, v, path, out, exactlyOne) {\n const matches = branches.filter((s) => this.ok(s, b, v)).length;\n if (matches === 1 || (!exactlyOne && matches > 0))\n return;\n const keyword = exactlyOne ? \"oneOf\" : \"anyOf\";\n if (matches > 1) {\n out.push({ path, keyword, message: \"matches more than one alternative\" });\n return;\n }\n // A tagged union reports the branch its tag selects; otherwise the branch whose first error is deepest.\n const tag = this.tagOf(branches, b);\n if (tag !== undefined && isObject(v)) {\n const i = tag.values.indexOf(v[tag.key]);\n if (i < 0)\n out.push({\n path: pointer(path, tag.key),\n keyword,\n message: `expected one of ${listValues(tag.values)}`,\n });\n else\n this.walk(branches[i], b, v, path, out);\n return;\n }\n // An object is blamed on the branch that declares most of its properties (the one it was most likely meant for),\n // then on the branch whose first error is deepest.\n let best;\n for (const s of branches) {\n const errors = [];\n this.walk(s, b, v, path, errors);\n if (errors.length === 0)\n continue;\n const declared = isObject(v) ? this.declaredKeys(s, b, v) : 0;\n const better = best === undefined ||\n declared > best.declared ||\n (declared === best.declared && errors[0].path.length > best.errors[0].path.length);\n if (better)\n best = { errors, declared };\n }\n out.push(...(best?.errors ?? [{ path, keyword, message: \"matches no alternative\" }]));\n }\n /** How many of the keys of `v` the branch `s` (through a `$ref`) declares in `properties`. */\n declaredKeys(s, b, v) {\n const node = isSchemaObject(s) && typeof s.$ref === \"string\" ? this.c.r.resolve(s.$ref, this.c.r.baseFor(s, b)).node : s;\n const properties = isSchemaObject(node) && isSchemaObject(node.properties) ? node.properties : {};\n return Object.keys(v).filter((k) => Object.hasOwn(properties, k)).length;\n }\n tagOf(branches, b) {\n const resolved = branches.map((s) => isSchemaObject(s) && typeof s.$ref === \"string\" ? this.c.r.resolve(s.$ref, this.c.r.baseFor(s, b)).node : s);\n const first = resolved[0];\n if (!isSchemaObject(first) || !isSchemaObject(first.properties))\n return undefined;\n for (const key of Object.keys(first.properties)) {\n const values = resolved.map((s) => {\n const tag = isSchemaObject(s) && isSchemaObject(s.properties) ? s.properties[key] : undefined;\n return isSchemaObject(tag) ? tag.const : undefined;\n });\n const primitive = values.every((x) => x !== undefined && (typeof x !== \"object\" || x === null));\n if (primitive && new Set(values).size === values.length)\n return { key, values };\n }\n return undefined;\n }\n walkUnevaluated(node, b, v, path, out) {\n // `b` already applies the node's `$id`; the copy must not apply it again.\n const { unevaluatedProperties, unevaluatedItems, $id: _id, ...rest } = node;\n const a = newAnnotations();\n this.c.annotating(rest, b)(v, a);\n if (isObject(v) && unevaluatedProperties !== undefined && !a.allProps) {\n for (const k of Object.keys(v)) {\n if (a.props?.has(k))\n continue;\n if (unevaluatedProperties === false) {\n out.push({ path: pointer(path, k), keyword: \"unevaluatedProperties\", message: \"unknown field\" });\n }\n else\n this.walk(unevaluatedProperties, b, v[k], pointer(path, k), out);\n }\n }\n if (Array.isArray(v) && unevaluatedItems !== undefined && !a.allItems) {\n for (let i = a.items; i < v.length; i++) {\n if (a.indexes?.has(i))\n continue;\n if (unevaluatedItems === false) {\n out.push({ path: `${path}/${i}`, keyword: \"unevaluatedItems\", message: \"unexpected item\" });\n }\n else\n this.walk(unevaluatedItems, b, v[i], `${path}/${i}`, out);\n }\n }\n }\n}\n// Enum errors name the allowed values; a long list (an enum of thousands) is cut, so the message stays readable.\nconst LISTED_VALUES = 20;\n/** `values` as JSON, at most LISTED_VALUES of them, then how many more there are. */\nfunction listValues(values) {\n if (values.length <= LISTED_VALUES)\n return JSON.stringify(values);\n const listed = JSON.stringify(values.slice(0, LISTED_VALUES));\n return `${listed.slice(0, -1)}, ... and ${values.length - LISTED_VALUES} more]`;\n}\nfunction containsMessage(min, max) {\n if (max === Number.POSITIVE_INFINITY)\n return `expected at least ${min} matching ${min === 1 ? \"item\" : \"items\"}`;\n if (min === 0)\n return `expected at most ${max} matching ${max === 1 ? \"item\" : \"items\"}`;\n return `expected between ${min} and ${max} matching items`;\n}\nfunction isBound(value) {\n return typeof value === \"number\" || typeof value === \"bigint\";\n}\nfunction pointer(path, key) {\n return `${path}/${String(key).replace(/~/g, \"~0\").replace(/\\//g, \"~1\")}`;\n}\nfunction typeName(v) {\n if (v === null)\n return \"null\";\n if (Array.isArray(v))\n return \"array\";\n if (v instanceof Uint8Array)\n return \"bytes\";\n if (typeof v === \"bigint\")\n return \"bigint\";\n if (typeof v === \"number\" && Number.isInteger(v))\n return \"integer\";\n if (typeof v === \"number\" && !Number.isFinite(v))\n return String(v);\n return typeof v;\n}\n//# sourceMappingURL=explain.js.map","// compile(): a schema to a Validator, whose `check` is the fast boolean path and whose `errors` explains failures.\nimport { Coercer } from \"./coerce.js\";\nimport { Compiler, RESTART } from \"./compiler.js\";\nimport { Explainer } from \"./explain.js\";\nexport function compile(schema, options = NO_OPTIONS) {\n const check = compileCheck(schema, options);\n return options.coerce === true\n ? new CoercingValidator(schema, options, check)\n : new Validator(schema, options, check);\n}\nconst NO_OPTIONS = Object.freeze({});\n/** A compiled schema whose valid values have type `T` (`unknown` unless the schema was built with the builders). */\nexport class Validator {\n /** Whether `value` is valid. A plain function: it may be passed around without its validator. */\n check;\n schema;\n options;\n explainer = undefined;\n constructor(schema, options, check) {\n // A compiled check is exactly the test that a value has the schema's static type.\n this.check = check;\n this.schema = schema;\n this.options = options;\n }\n /**\n * Why `value` is invalid: one error per failing keyword, `[]` when it is valid. Built on the first failure and\n * kept, so a validator whose values always pass never pays for it.\n */\n errors(value) {\n if (this.check(value))\n return [];\n this.explainer ??= new Explainer(compiler(this.schema, this.options), this.schema);\n return this.explainer.errors(value);\n }\n /**\n * `value` itself when it is valid, else its errors: check() and errors() in one result, without coercion.\n *\n * Not TypeBox's `Value.Parse`, which also clones, fills defaults, converts and strips undeclared properties before\n * it checks. This only checks: the strict replacement where `Value.Parse` is used to validate (its other steps\n * change nothing for a valid value of a schema without defaults or extra properties). Use `parse()` with\n * `coerce: true` for conversion.\n */\n validate(value) {\n return this.check(value) ? { ok: true, value } : { ok: false, errors: this.errors(value) };\n }\n}\n/** A validator compiled with `coerce: true`: it also coerces loosely typed input towards the schema. */\nexport class CoercingValidator extends Validator {\n coercer = undefined;\n /**\n * `value` coerced towards the schema: numeric strings to numbers, `\"true\"` to `true`, a single value to a one-item\n * array, an optional `null` dropped, the first union branch the value converts to (the README lists every rule).\n * Only the changed paths are copied; `value` comes back itself when nothing changes, and is never modified. Values\n * that cannot be coerced stay as they are. The rules are built on the first call.\n */\n coerce(value) {\n this.coercer ??= new Coercer(compiler(this.schema, this.options), this.schema);\n return this.coercer.coerce(value);\n }\n /** Coerces `value`, then checks it: the coerced value when it is valid, else its errors. */\n parse(value) {\n return this.validate(this.coerce(value));\n }\n}\nfunction compileCheck(schema, options) {\n return compiler(schema, options).root();\n}\n// Most schemas compile without tracking the dynamic scope; one with a bookended $dynamicRef compiles again with it.\nfunction compiler(schema, options) {\n const plain = new Compiler(schema, options, false);\n try {\n plain.root();\n return plain;\n }\n catch (error) {\n if (error !== RESTART)\n throw error;\n return new Compiler(schema, options, true);\n }\n}\n//# sourceMappingURL=validator.js.map"],"x_google_ignoreList":[0,1,2,3,4,5,6,7],"mappings":";AAGA,MAAa,eAAe;AAC5B,MAAa,cAAc;AAC3B,MAAM,aAAa,MAAM,OAAO,MAAM;AACtC,MAAM,aAAa,MAAM,OAAO,SAAS,EAAE;AAC3C,MAAM,cAAc,MAAM,OAAO,UAAU,EAAE;AAC7C,MAAM,cAAc,MAAM,OAAO,MAAM;AACvC,MAAM,WAAW,MAAM,MAAM;AAC7B,MAAa,YAAY,MAAM,MAAM,QAAQ,EAAE;AAC/C,MAAM,YAAY,MAAM,aAAa;AACrC,MAAM,aAAa,MAAM,OAAO,MAAM;AACtC,MAAM,gBAAgB,MAAM,MAAM;AAClC,MAAa,aAAa,MAAM,SAAS,EAAE;;AAE3C,SAAgB,SAAS,GAAG;AACxB,QAAO,OAAO,MAAM,YAAY,MAAM,QAAQ,CAAC,MAAM,QAAQ,EAAE,IAAI,EAAE,aAAa;;;;;;;AAOtF,MAAa,cAAc,IAAI,IAAI;CAC/B,CAAC,UAAU,UAAU;CACrB,CAAC,UAAU,UAAU;CACrB,CAAC,WAAW,WAAW;CACvB,CAAC,WAAW,WAAW;CACvB,CAAC,QAAQ,QAAQ;CACjB,CAAC,SAAS,SAAS;CACnB,CAAC,UAAU,UAAU;CACrB,CAAC,SAAS,SAAS;CACnB,CAAC,UAAU,UAAU;CACrB,CAAC,aAAa,aAAa;CAC9B,CAAC;AACF,MAAM,SAAS,IAAI,QAAQ;CACvB,CAAC,WAAW,CAAC,GAAG,OAAU,CAAC;CAC3B,CAAC,WAAW,CAAC,GAAG,OAAU,CAAC;CAC3B,CAAC,YAAY,CAAC,GAAG,OAAU,CAAC;CAC5B,CAAC,YAAY,CAAC,GAAG,OAAU,CAAC;CAC5B,CAAC,SAAS,CAAC,GAAG,OAAU,CAAC;CACzB,CAAC,QAAQ,CAAC,GAAG,OAAU,CAAC;CAC3B,CAAC;;AAEF,SAAgB,OAAO,OAAO;AAC1B,QAAO,OAAO,IAAI,MAAM;;AAE5B,SAAS,KAAK,MAAM,KAAK,OAAO;AAC5B,QAAO,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC;AAC9B,QAAO;;;AAGX,IAAM,SAAN,MAAa;CACT;CACA;CACA;CACA;CACA,YAAY,KAAK,KAAK,MAAM,MAAM;AAC9B,OAAK,MAAM;AACX,OAAK,MAAM;AACX,OAAK,OAAO;AACZ,OAAK,OAAO;;;AAIpB,SAAS,OAAO,MAAM,GAAG,KAAK;AAC1B,SAAQ,MAAR;EACI,KAAK,EACD,QAAO,OAAO,MAAM;EACxB,KAAK,EACD,QAAO,OAAO,SAAS,EAAE;EAC7B,KAAK,EACD,QAAO,OAAO,UAAU,EAAE;EAC9B,KAAK,EACD,QAAO,OAAO,MAAM;EACxB,KAAK,EACD,QAAO,MAAM;EACjB,KAAK,EACD,QAAO,MAAM;EACjB,KAAK,GAAG;GACJ,MAAM,OAAO;AACb,QAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,IAC7B,KAAI,KAAK,OAAO,EACZ,QAAO;AACf,UAAO;;EAEX,KAAK,EACD,SAAQ,SAAS,EAAE,GAAG,SAAS;EACnC,KAAK,GACD,QAAO,OAAO,UAAU,EAAE,IAAI,SAAS,GAAG,IAAI;EAClD,KAAK,GACD,QAAO,OAAO,SAAS,EAAE,IAAI,SAAS,GAAG,IAAI;EACjD,KAAK,GACD,QAAO,OAAO,MAAM,YAAY,SAAS,GAAG,IAAI,KAAK,IAAI,IAAI;EACjE,KAAK,GACD,QAAO,OAAO,MAAM,YAAY,IAAI,KAAK,EAAE;EAC/C,QACI,QAAO;;;AAGnB,SAAS,SAAS,GAAG,GAAG;AACpB,QAAO,KAAK,EAAE,OAAO,KAAK,EAAE,OAAO,IAAI,EAAE,QAAQ,IAAI,EAAE;;;AAG3D,MAAa,aAAa;AAC1B,MAAa,eAAe;AAC5B,MAAa,cAAc;;AAE3B,MAAa,OAAO;AACpB,MAAa,WAAW;AACxB,MAAa,YAAY;;AAEzB,SAAgB,IAAI,OAAO;AACvB,SAAQ,MAAM,QAAd;EACI,KAAK,EACD,QAAO;EACX,KAAK,EACD,QAAO,MAAM;EACjB,KAAK,GAAG;GACJ,MAAM,CAAC,GAAG,KAAK;AACf,WAAQ,MAAM,EAAE,EAAE,IAAI,EAAE,EAAE;;EAE9B,KAAK,GAAG;GACJ,MAAM,CAAC,GAAG,GAAG,KAAK;AAClB,WAAQ,MAAM,EAAE,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,EAAE;;EAEtC,QACI,SAAQ,MAAM;AACV,QAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,IAC9B,KAAI,CAAC,MAAM,GAAG,EAAE,CACZ,QAAO;AACf,UAAO;;;;;AAKvB,SAAgB,SAAS,MAAM;AAC3B,SAAQ,MAAM,KAAK,MAAM,EAAE;;;AAG/B,SAAgB,YAAY,OAAO,KAAK,OAAO;AAC3C,SAAQ,MAAM;AACV,QAAM,KAAK,IAAI;EACf,MAAM,KAAK,MAAM,EAAE;AACnB,QAAM,KAAK;AACX,SAAO;;;;AAIf,SAAgB,UAAU,OAAO;AAC7B,KAAI,MAAM,WAAW,EACjB,SAAQ,OAAO,MAAM,OAAO,WAAW,YAAY,IAAI,MAAM,GAAG,GAAG,WAAc;AACrF,QAAO,UAAU,SAAS,MAAM,CAAC;;AAErC,MAAM,YAAY,IAAI,IAAI;CACtB,CAAC,UAAU,EAAE;CACb,CAAC,UAAU,EAAE;CACb,CAAC,WAAW,EAAE;CACd,CAAC,WAAW,EAAE;CACd,CAAC,QAAQ,GAAG;CACZ,CAAC,SAAS,GAAG;CACb,CAAC,UAAU,GAAG;CACd,CAAC,SAAS,IAAI;CACd,CAAC,UAAU,IAAI;CACf,CAAC,aAAa,IAAI;CACrB,CAAC;;AAEF,SAAgB,SAAS,OAAO;CAC5B,IAAI,OAAO;AACX,MAAK,MAAM,KAAK,MACZ,KAAI,OAAO,MAAM,SACb,SAAQ,UAAU,IAAI,EAAE,IAAI;AACpC,QAAO;;;AAGX,SAAS,SAAS,GAAG;AACjB,SAAQ,OAAO,GAAf;EACI,KAAK,SACD,QAAO;EACX,KAAK,SACD,QAAO,OAAO,UAAU,EAAE,GAAG,IAAI,OAAO,SAAS,EAAE,GAAG,IAAI;EAC9D,KAAK,UACD,QAAO;EACX,KAAK,SACD,QAAO,MAAM,OAAO,KAAK,MAAM,QAAQ,EAAE,GAAG,KAAK,aAAa,aAAa,MAAM;EACrF,KAAK,SACD,QAAO;EACX,KAAK,YACD,QAAO;EACX,QACI,QAAO;;;AAGnB,SAAS,UAAU,MAAM;AACrB,QAAO,KAAK,GAAG,OAAO,OAAO,SAAS,EAAE,GAAG,UAAU,EAAE;;;AAG3D,SAAgB,eAAe,MAAM,QAAQ;AACzC,KAAI,OAAO,WAAW,EAClB,QAAO,UAAU,KAAK;CAC1B,MAAM,OAAO,OAAO,WAAW,IAAI,OAAO,KAAK,SAAS,OAAO;AAC/D,SAAQ,OAAO,SAAS,EAAE,GAAG,UAAU,KAAK,KAAK,EAAE;;;AAGvD,SAAgB,WAAW,KAAK,KAAK;AACjC,SAAQ,MAAM,aAAa,cAAc,EAAE,UAAU,OAAO,EAAE,UAAU;;;AAG5E,SAAgB,WAAW,GAAG;CAC1B,IAAI,IAAI;AACR,MAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK,KAAK;EACpC,MAAM,IAAI,EAAE,WAAW,EAAE;AAEzB,MAAI,KAAK,SAAU,KAAK,SAAU,IAAI,IAAI,EAAE,QAAQ;GAChD,MAAM,OAAO,EAAE,WAAW,IAAI,EAAE;AAChC,OAAI,QAAQ,SAAU,QAAQ,MAC1B;;;AAGZ,QAAO;;AAGX,SAAS,SAAS,GAAG,KAAK,KAAK;CAC3B,MAAM,QAAQ,EAAE;AAChB,KAAI,QAAQ,IACR,QAAO;AACX,KAAI,QAAQ,IAAI,OAAO,WAAW,EAAE,GAAG,IACnC,QAAO;AACX,QAAO,SAAS,OAAO,WAAW,EAAE,IAAI;;;AAG5C,SAAgB,YAAY,QAAQ,KAAK,KAAK,IAAI,QAAQ;AACtD,KAAI,OAAO,UAAa,QAAQ,KAAK,QAAQ,OAAO,qBAAqB,WAAW,OAChF,QAAO,SACD,KAAK,IAAI,KAAK,MAAM,OAAO,MAAM,YAAY,GAAG,KAAK,EAAE,CAAC,IACvD,MAAM,OAAO,MAAM,YAAY,GAAG,KAAK,EAAE;AAEpD,KAAI,OAAO,UAAa,WAAW,OAC/B,QAAO,SACD,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,GAAG,EAAE,GAAG,MAAM,OAAO,MAAM,YAAY,SAAS,GAAG,KAAK,IAAI,CAAC,IAC1F,MAAM,OAAO,MAAM,YAAY,SAAS,GAAG,KAAK,IAAI;AAE/D,SAAQ,MAAM;AACV,MAAI,OAAO,MAAM,SACb,QAAO,CAAC;AACZ,SAAO,SAAS,GAAG,KAAK,IAAI,KAAK,OAAO,UAAa,GAAG,KAAK,EAAE,MAAM,WAAW,UAAa,OAAO,EAAE;;;;;;;AAO9G,SAAgB,YAAY,MAAM,KAAK,KAAK,MAAM,MAAM,YAAY;CAChE,MAAM,SAAS,MAAM;AACjB,MAAI,OAAO,MAAM,YAAY,OAAO,MAAM,SACtC,QAAO,SAAS;AACpB,MAAI,SAAS,IAAI,OAAO,MAAM,WAAW,SAAS,KAAK,CAAC,OAAO,SAAS,EAAE,CACtE,QAAO;AACX,MAAI,SAAS,KAAK,CAAC,OAAO,UAAU,EAAE,CAClC,QAAO;AACX,SAAO,KAAK,OAAO,KAAK,OAAO,IAAI,QAAQ,IAAI,SAAS,eAAe,UAAa,WAAW,GAAG,WAAW;;AAGjH,KAAI,SAAS,KAAK,SAAS,KAAK,eAAe,UAAa,EAD9C,OAAO,QAAQ,YAAY,OAAO,QAAQ,YAAY,OAAO,SAAS,YAAY,OAAO,SAAS,UAE5G,QAAO;AACX,QAAO,KAAK,SAAS,IAAI,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,MAAM,KAAK,EAAE,MAAM;;;;;;;;;AAS9E,SAAgB,WAAW,GAAG,GAAG;AAC7B,KAAI,OAAO,MAAM,YAAY,OAAO,MAAM,UAAU;AAChD,MAAK,OAAO,MAAM,YAAY,CAAC,OAAO,UAAU,EAAE,IAAM,OAAO,MAAM,YAAY,CAAC,OAAO,UAAU,EAAE,CACjG,QAAO;EACX,MAAM,UAAU,OAAO,EAAE;AACzB,SAAO,YAAY,MAAM,OAAO,EAAE,GAAG,YAAY;;CAErD,MAAM,IAAI,IAAI;AACd,KAAI,OAAO,UAAU,EAAE,CACnB,QAAO;AACX,KAAI,CAAC,OAAO,SAAS,EAAE,CACnB,QAAO,IAAI,MAAM;CACrB,MAAM,CAAC,IAAI,MAAM,QAAQ,EAAE;CAC3B,MAAM,CAAC,IAAI,MAAM,QAAQ,EAAE;AAC3B,QAAO,MAAM,KAAM,KAAK,OAAO,OAAO,KAAK,GAAG,GAAI,OAAO,KAAK,MAAM,KAAK,OAAO,OAAO,KAAK,GAAG,MAAM;;AAEzG,SAAS,QAAQ,GAAG;CAChB,MAAM,CAAC,UAAU,WAAW,OAAO,KAAK,IAAI,EAAE,CAAC,UAAU,CAAC,MAAM,IAAI;CACpE,MAAM,QAAQ,SAAS,QAAQ,IAAI;CACnC,MAAM,WAAW,QAAQ,IAAI,IAAI,SAAS,SAAS,QAAQ;AAC3D,QAAO,CAAC,OAAO,SAAS,QAAQ,KAAK,GAAG,CAAC,EAAE,OAAO,SAAS,GAAG,SAAS;;;AAG3E,SAAgB,YAAY,OAAO,QAAQ;AACvC,QAAO,UAAU,MAAM,SAAS,EAAE,IAAI,MAAM,EAAE,IAAI,MAAM,CAAC,SAAS,EAAE,IAAI,MAAM,EAAE;;;AAGpF,SAAgB,WAAW,OAAO,QAAQ;AACtC,QAAO,UAAU,MAAM,MAAM,QAAQ,EAAE,IAAI,MAAM,EAAE,IAAI,MAAM,CAAC,MAAM,QAAQ,EAAE,IAAI,MAAM,EAAE;;;;;;;AAO9F,SAAgB,eAAe,WAAS,eAAe,QAAQ,OAAO;CAClE,MAAM,IAAIA,UAAQ;AAClB,SAAQ,MAAM;AACV,MAAI,UAAU,cAAc,CAAC,SAAS,EAAE,CACpC,QAAO,UAAU;EAErB,MAAM,IAAI;EACV,IAAI,WAAW;EACf,IAAI,OAAO;AACX,OAAK,MAAM,KAAK,GAAG;GAEf,IAAI,IAAI;AACR,OAAIA,UAAQ,OAAO,GAAG;AAClB,QAAI;AACJ,WAAO,IAAI,KAAKA,UAAQ,OAAO,EAC3B,MAAK;AACT,QAAI,MAAM,GAAG;AACT,SAAI,OACA,QAAO;AACX;;;AAGR,UAAO,IAAI;GACX,MAAM,IAAI,EAAE;GACZ,MAAM,IAAIA,UAAQ,IAAI;AAGtB,OAAI,MAAM,UAAa,EAAE,IAAI,UACzB;GACJ,MAAM,IAAI,IAAI;AACd,OAAI,MAAM,IAAI,CAAC,OAAO,GAAG,GAAGA,UAAQ,IAAI,GAAG,GAAG,CAACA,UAAQ,IAAI,GAAG,EAAE,CAC5D,QAAO;AACX,OAAI,IAAI,SACJ;;AAER,SAAO,aAAa;;;;AAI5B,SAAgB,WAAW,WAAS,MAAM,eAAe,UAAU,YAAY,OAAO;CAClF,MAAM,QAAQ,SAAS,SAAS,KAAK,eAAe,SAAY,IAAI,IAAI,KAAK,GAAG;AAChF,SAAQ,MAAM;AACV,MAAI,UAAU,cAAc,CAAC,SAAS,EAAE,CACpC,QAAO,UAAU;EACrB,MAAM,IAAI;AACV,OAAK,IAAI,IAAI,GAAG,IAAIA,UAAQ,QAAQ,KAAK,GAAG;GACxC,MAAM,IAAIA,UAAQ;GAClB,MAAM,IAAI,EAAE;GACZ,MAAM,IAAIA,UAAQ,IAAI;AAEtB,OAAK,MAAM,UAAa,EAAE,IAAI,YAAY,OAAO,OAAO,GAAG,EAAE,KAAO,IAAI,aAAa,CAAC,OAAO,OAAO,GAAG,EAAE,EAAG;AACxG,QAAI,IAAI,SACJ,QAAO;AACX;;GAEJ,MAAM,IAAI,IAAI;AACd,OAAI,MAAM,IAAI,CAAC,OAAO,GAAG,GAAGA,UAAQ,IAAI,GAAG,GAAG,CAACA,UAAQ,IAAI,GAAG,EAAE,CAC5D,QAAO;;AAEf,OAAK,IAAI,IAAI,GAAG,IAAI,cAAc,QAAQ,IACtC,KAAI,CAAC,OAAO,OAAO,GAAG,cAAc,GAAG,CACnC,QAAO;AACf,MAAI,UAAU,OACV,QAAO;AACX,OAAK,MAAM,KAAK,OAAO,KAAK,EAAE,EAAE;GAC5B,IAAI,UAAU,MAAM,IAAI,EAAE;AAC1B,QAAK,IAAI,IAAI,GAAG,IAAI,SAAS,QAAQ,IACjC,KAAI,SAAS,GAAG,GAAG,KAAK,EAAE,EAAE;AACxB,cAAU;AACV,QAAI,CAAC,SAAS,GAAG,GAAG,EAAE,GAAG,CACrB,QAAO;;AAGnB,OAAI,CAAC,WAAW,eAAe,UAAa,CAAC,WAAW,EAAE,GAAG,CACzD,QAAO;;AAEf,SAAO;;;;AAIf,SAAgB,mBAAmB,OAAO;AACtC,SAAQ,MAAM;AACV,OAAK,MAAM,KAAK,EACZ,KAAI,CAAC,MAAM,EAAE,CACT,QAAO;AACf,SAAO;;;;AAIf,SAAgB,mBAAmB,KAAK,KAAK;AACzC,SAAQ,MAAM;EACV,IAAI,IAAI;AACR,OAAK,MAAM,KAAK,EACZ;AACJ,SAAO,KAAK,OAAO,KAAK;;;;AAIhC,SAAgB,uBAAuB,WAAS;AAC5C,SAAQ,MAAM;EACV,MAAM,IAAI;AACV,OAAK,MAAM,CAAC,GAAG,SAASA,UACpB,KAAI,OAAO,OAAO,GAAG,EAAE,EACnB;QAAK,MAAM,KAAK,KACZ,KAAI,CAAC,OAAO,OAAO,GAAG,EAAE,CACpB,QAAO;;AACvB,SAAO;;;;AAIf,SAAgB,sBAAsB,WAAS;AAC3C,SAAQ,MAAM;AACV,OAAK,MAAM,CAAC,GAAG,UAAUA,UACrB,KAAI,OAAO,OAAO,GAAG,EAAE,IAAI,CAAC,MAAM,EAAE,CAChC,QAAO;AACf,SAAO;;;AAGf,MAAM,UAAU,CAAC,GAAG,OAAU;;AAE9B,SAAgB,UAAU,OAAO,KAAK,KAAK,QAAQ,MAAM;CACrD,MAAM,IAAI,OAAO;CACjB,MAAM,CAAC,MAAM,QAAQ,SAAS,SAAY,SAAY,OAAO,KAAK,KAAK;AACvE,SAAQ,MAAM;AACV,MAAI,CAAC,MAAM,QAAQ,EAAE,CACjB,QAAO,UAAU;EACrB,MAAM,SAAS,EAAE;AACjB,MAAI,SAAS,OAAO,SAAS,IACzB,QAAO;EACX,MAAM,IAAI,SAAS,IAAI,SAAS;AAChC,OAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IACnB,KAAI,CAAC,OAAO,GAAG,EAAE,GAAG,CAChB,QAAO;AACf,MAAI,SAAS,OACT,QAAO;AACX,MAAI,SAAS,GAAG;AACZ,QAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,IACxB,KAAI,CAAC,OAAO,MAAM,EAAE,IAAI,IAAI,CACxB,QAAO;AACf,UAAO;;AAEX,OAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,IACxB,KAAI,CAAC,KAAK,EAAE,GAAG,CACX,QAAO;AACf,SAAO;;;;AAIf,SAAgB,WAAW,QAAQ,MAAM;AACrC,QAAO,UAAU,YAAY,GAAG,OAAO,mBAAmB,QAAQ,KAAK;;;AAG3E,SAAgB,YAAY,KAAK,KAAK;AAClC,SAAQ,MAAM,EAAE,UAAU,OAAO,EAAE,UAAU;;;AAGjD,SAAgB,cAAc,OAAO,KAAK,KAAK;AAC3C,SAAQ,MAAM;EACV,MAAM,OAAO;EACb,IAAI,IAAI;AACR,OAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,IAC7B,KAAI,MAAM,KAAK,GAAG,IAAI,EAAE,IAAI,IACxB,QAAO;AACf,SAAO,KAAK;;;;AAIpB,SAAgB,YAAY,GAAG;CAC3B,MAAM,OAAO;AACb,MAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,IAC7B,MAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IACnB,KAAI,UAAU,KAAK,IAAI,KAAK,GAAG,CAC3B,QAAO;AACnB,QAAO;;;AAGX,SAAgB,UAAU,QAAQ;CAC9B,MAAM,aAAa,OAAO,QAAQ,MAAM,OAAO,MAAM,YAAY,MAAM,KAAK;AAC5E,KAAI,WAAW,WAAW,OAAO,UAAU,WAAW,UAAU,EAC5D,QAAO,KAAK,GAAG,aAAa,MAAM;AAC9B,OAAK,IAAI,IAAI,GAAG,IAAI,WAAW,QAAQ,IACnC,KAAI,WAAW,OAAO,EAClB,QAAO;AACf,SAAO;GACT;CAEN,MAAM,MAAM,IAAI,IAAI,WAAW;CAC/B,MAAM,UAAU,OAAO,QAAQ,MAAM,OAAO,MAAM,YAAY,MAAM,KAAK;AACzE,SAAQ,MAAM,IAAI,IAAI,EAAE,IAAK,OAAO,MAAM,YAAY,QAAQ,MAAM,MAAM,UAAU,GAAG,EAAE,CAAC;;;AAG9F,SAAgB,WAAW,OAAO;AAC9B,KAAI,OAAO,UAAU,YAAY,UAAU,KACvC,QAAO,KAAK,GAAG,QAAQ,MAAM,MAAM,MAAM;AAC7C,SAAQ,MAAM,UAAU,GAAG,MAAM;;;AAGrC,SAAgB,SAAS,QAAQ;AAC7B,SAAQ,MAAM;AACV,OAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,IAC/B,KAAI,OAAO,GAAG,EAAE,CACZ,QAAO;AACf,SAAO;;;;AAIf,SAAgB,SAAS,QAAQ;AAC7B,SAAQ,MAAM;EACV,IAAI,IAAI;AACR,OAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,IAC/B,KAAI,OAAO,GAAG,EAAE,IAAI,EAAE,IAAI,EACtB,QAAO;AACf,SAAO,MAAM;;;;AAIrB,SAAgB,SAAS,OAAO;AAC5B,SAAQ,MAAM,CAAC,MAAM,EAAE;;;AAG3B,SAAgB,QAAQ,MAAM,MAAM,WAAW;AAC3C,SAAQ,MAAO,KAAK,EAAE,GAAG,KAAK,EAAE,GAAG,UAAU,EAAE;;;AAGnD,SAAgB,YAAY,KAAK,MAAM,QAAQ;AAC3C,SAAQ,MAAM;AACV,MAAI,CAAC,SAAS,EAAE,CACZ,QAAO;EACX,MAAM,MAAM,EAAE;AACd,OAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,IAC7B,KAAI,KAAK,OAAO,IACZ,QAAO,OAAO,GAAG,EAAE;AAC3B,SAAO;;;;;;;AAOf,SAAgB,UAAU,GAAG,GAAG;AAC5B,KAAI,MAAM,EACN,QAAO;AACX,KAAI,OAAO,MAAM,YAAY,OAAO,MAAM,YAAY,MAAM,QAAQ,MAAM,KACtE,QAAO;CACX,MAAM,QAAQ,MAAM,QAAQ,EAAE;AAC9B,KAAI,UAAU,MAAM,QAAQ,EAAE,CAC1B,QAAO;AACX,KAAI,OAAO;EACP,MAAMC,MAAI;EACV,MAAMC,MAAI;AACV,MAAID,IAAE,WAAWC,IAAE,OACf,QAAO;AACX,OAAK,IAAI,IAAI,GAAG,IAAID,IAAE,QAAQ,IAC1B,KAAI,CAAC,UAAUA,IAAE,IAAIC,IAAE,GAAG,CACtB,QAAO;AACf,SAAO;;CAEX,MAAM,IAAI;CACV,MAAM,IAAI;CACV,MAAM,OAAO,OAAO,KAAK,EAAE;AAC3B,KAAI,KAAK,WAAW,OAAO,KAAK,EAAE,CAAC,OAC/B,QAAO;AACX,MAAK,MAAM,KAAK,KACZ,KAAI,CAAC,OAAO,OAAO,GAAG,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,EAAE,GAAG,CAC9C,QAAO;AACf,QAAO;;;;;;AC5jBX,MAAa,eAAe;;;;;AAK5B,IAAa,WAAb,MAAsB;CAClB;;CAEA,WAAW;;CAEX,yBAAS,IAAI,KAAK;;CAElB,iCAAiB,IAAI,KAAK;CAC1B;CACA;CACA,2BAAW,IAAI,KAAK;CACpB;;CAEA,6BAAa,IAAI,KAAK;CACtB,4BAAY,IAAI,KAAK;CACrB,0BAAU,IAAI,KAAK;CACnB,UAAU;CACV,YAAY,MAAM,SAAS;AACvB,OAAK,QAAQ,QAAQ,UAAU,MAAM,MAAM;AAC3C,OAAK,OAAO;AACZ,OAAK,UAAU;AACf,OAAK,mBAAmB,QAAQ,mBAAmB;;;;;;CAMvD,QAAQ,MAAM,MAAM;EAChB,IAAI,UAAU,KAAK,OAAO,IAAI,KAAK;AACnC,MAAI,YAAY,OACZ,QAAO;EACX,MAAM,KAAK,KAAK;AAChB,MAAI,OAAO,OAAO,SACd,QAAO;AAEX,MAAI,CAAC,KAAK,SAAS;AACf,QAAK,eAAe;AACpB,aAAU,KAAK,OAAO,IAAI,KAAK;AAC/B,OAAI,YAAY,OACZ,QAAO;;AAEf,MAAI,KAAK,UAAU,QAAQ,OAAO,KAAK,SAAS,YAAY,GAAG,WAAW,IAAI,EAC1E,QAAO;AACX,SAAO,WAAW,WAAW,IAAI,KAAK,CAAC;;;CAG3C,gBAAgB;AACZ,MAAI,KAAK,QACL;AACJ,OAAK,UAAU;AACf,OAAK,MAAM,CAAC,KAAK,WAAW,OAAO,QAAQ,KAAK,QAAQ,WAAW,EAAE,CAAC,CAClE,MAAK,SAAS,IAAI,WAAW,WAAW,KAAK,aAAa,CAAC,EAAE,OAAO;AAExE,OAAK,UAAU,IAAI,cAAc,KAAK,KAAK;AAC3C,OAAK,MAAM,KAAK,MAAM,aAAa;;;;;;CAMvC,QAAQ,KAAK,MAAM;AACf,OAAK,eAAe;AACpB,MAAI,CAAC,KAAK,iBACN,QAAO,KAAK,KAAK,KAAK,KAAK;AAC/B,MAAI;AACA,UAAO,KAAK,KAAK,KAAK,KAAK;UAEzB;AACF,QAAK,WAAW,IAAI,WAAW,KAAK,KAAK,CAAC;AAC1C,UAAO;IAAE,MAAM;IAAO;IAAM;;;;CAIpC,aAAa,KAAK,MAAM;AACpB,SAAO,KAAK,WAAW,IAAI,WAAW,KAAK,KAAK,CAAC;;CAErD,KAAK,KAAK,MAAM;EACZ,MAAM,MAAM,WAAW,KAAK,KAAK;EACjC,MAAM,MAAM,WAAW,IAAI;EAC3B,MAAM,WAAW,IAAI,SAAS,IAAI,SAAS,mBAAmB,IAAI,MAAM,IAAI,SAAS,EAAE,CAAC,GAAG;EAC3F,MAAM,OAAO,KAAK,UAAU,IAAI,IAAI,GAAG,KAAK,UAAU,IAAI,IAAI,GAAG,KAAK,KAAK,IAAI;AAC/E,MAAI,SAAS,OACT,OAAM,IAAI,MAAM,mBAAmB,IAAI,6BAA6B,IAAI,GAAG;AAC/E,MAAI,aAAa,GACb,QAAO;GAAE,MAAM;GAAM,MAAM;GAAK;AACpC,MAAI,SAAS,WAAW,IAAI,CACxB,QAAO,KAAK,QAAQ,MAAM,KAAK,SAAS;EAC5C,MAAM,SAAS,KAAK,QAAQ,IAAI,GAAG,IAAI,GAAG,WAAW;AACrD,MAAI,WAAW,OACX,OAAM,IAAI,MAAM,mBAAmB,IAAI,cAAc,SAAS,MAAM,IAAI,GAAG;AAC/E,SAAO;GAAE,MAAM;GAAQ,MAAM,KAAK,OAAO,IAAI,OAAO,IAAI;GAAK;;;CAGjE,WAAW,MAAM,MAAM;AACnB,OAAK,eAAe;AACpB,SAAO,KAAK,UAAU,IAAI,KAAK,KAAK;;CAGxC,MAAM,MAAM,MAAM;AACd,MAAI,CAAC,eAAe,KAAK,IAAI,KAAK,OAAO,IAAI,KAAK,CAC9C;EACJ,IAAI,IAAI;EAER,MAAM,UAAU,KAAK,UAAU,OAAO,OAAO,KAAK,SAAS;AAC3D,MAAI,CAAC,WAAW,OAAO,KAAK,QAAQ,SAChC,KAAI,KAAK,UAAU,OAAO,KAAK,IAAI,WAAW,IAAI,CAC9C,MAAK,QAAQ,IAAI,WAAW,EAAE,GAAG,KAAK,KAAK,KAAK;OAC/C;GACD,MAAM,MAAM,WAAW,KAAK,KAAK,EAAE;AACnC,OAAI,WAAW,IAAI;AACnB,QAAK,UAAU,IAAI,GAAG,KAAK;AAC3B,OAAI,IAAI,SAAS,EAAE,SAAS,EACxB,MAAK,QAAQ,IAAI,KAAK,KAAK;;AAGvC,OAAK,OAAO,IAAI,MAAM,EAAE;AACxB,MAAI,QACA;AACJ,MAAI,KAAK,UAAU,KAAK;AACpB,OAAI,OAAO,KAAK,YAAY,SACxB,MAAK,QAAQ,IAAI,GAAG,EAAE,GAAG,KAAK,WAAW,KAAK;AAClD,OAAI,OAAO,KAAK,mBAAmB,UAAU;AACzC,SAAK,QAAQ,IAAI,GAAG,EAAE,GAAG,KAAK,kBAAkB,KAAK;AACrD,SAAK,eAAe,IAAI,GAAG,EAAE,GAAG,KAAK,kBAAkB,KAAK;;;AAGpE,OAAK,MAAM,OAAO,gBACd,MAAK,MAAM,KAAK,MAAM,EAAE;AAC5B,OAAK,MAAM,OAAO,cAAc;GAC5B,MAAM,MAAM,KAAK;AACjB,OAAI,eAAe,IAAI,CACnB,MAAK,MAAM,KAAK,OAAO,KAAK,IAAI,CAC5B,MAAK,MAAM,IAAI,IAAI,EAAE;;AAEjC,OAAK,MAAM,OAAO,gBAAgB;GAC9B,MAAM,OAAO,KAAK;AAClB,OAAI,MAAM,QAAQ,KAAK,CACnB,MAAK,MAAM,KAAK,KACZ,MAAK,MAAM,GAAG,EAAE;;;CAGhC,KAAK,KAAK;EACN,MAAM,SAAS,KAAK,SAAS,IAAI,IAAI;AACrC,MAAI,WAAW,OACX,QAAO;AACX,OAAK,UAAU,IAAI,KAAK,OAAO;AAC/B,OAAK,MAAM,QAAQ,IAAI;AACvB,SAAO;;CAEX,QAAQ,MAAM,MAAM,UAAU;EAC1B,IAAI,OAAO;EACX,IAAI,IAAI;AACR,OAAK,MAAM,OAAO,SAAS,MAAM,IAAI,CAAC,MAAM,EAAE,EAAE;GAC5C,MAAM,MAAM,IAAI,QAAQ,OAAO,IAAI,CAAC,QAAQ,OAAO,IAAI;AACvD,UACI,OAAO,SAAS,YAAY,SAAS,QAAQ,OAAO,OAAO,MAAM,IAAI,GAC/D,KAAK,OACL;AACV,OAAI,SAAS,OACT,OAAM,IAAI,MAAM,oBAAoB,SAAS,MAAM,OAAO;AAC9D,OAAI,OAAO,SAAS,YAAY,SAAS,KACrC,KAAI,KAAK,OAAO,IAAI,KAAK,IAAI;;AAErC,SAAO;GAAE;GAAM,MAAM;GAAG;;;AAGhC,MAAM,kBAAkB;CACpB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACH;AACD,MAAM,eAAe;CAAC;CAAc;CAAqB;CAAS;CAAe;CAAoB;CAAe;AACpH,MAAM,iBAAiB;CAAC;CAAS;CAAS;CAAS;CAAe;CAAQ;;AAE1E,SAAgB,eAAe,OAAO;AAClC,QAAO,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,MAAM;;;AAG/E,SAAgB,WAAW,KAAK,MAAM;AAClC,KAAI;AACA,SAAO,IAAI,IAAI,KAAK,KAAK,CAAC;SAExB;AACF,SAAO,IAAI,WAAW,IAAI,GAAG,WAAW,KAAK,GAAG,MAAM;;;;AAI9D,SAAgB,WAAW,KAAK;CAC5B,MAAM,OAAO,IAAI,QAAQ,IAAI;AAC7B,QAAO,OAAO,IAAI,MAAM,IAAI,MAAM,GAAG,KAAK;;;;;;;;;;ACtM9C,SAAgB,YAAY,QAAQ;CAChC,MAAM,MAAM,QAAQ,IAAI,OAAO,EAAE,OAAO;AACxC,KAAI,QAAQ,OACR,QAAO;CACX,IAAI;AACJ,KAAI;AACA,OAAK,IAAI,OAAO,QAAQ,IAAI;SAE1B;AACF,OAAK,IAAI,OAAO,OAAO;;AAE3B,SAAQ,IAAI,QAAQ,IAAI,QAAQ,GAAG,CAAC;AACpC,cAAa,SAAS,IAAI,OAAO;AACjC,QAAO;;AAEX,MAAM,0BAAU,IAAI,KAAK;AACzB,MAAM,eAAe,IAAI,sBAAsB,WAAW;AACtD,KAAI,QAAQ,IAAI,OAAO,EAAE,OAAO,KAAK,OACjC,SAAQ,OAAO,OAAO;EAC5B;;;;;ACNF,IAAa,UAAb,MAAqB;CACjB;CACA;;;;;;;;CAQA,UAAU,EAAE;;CAEZ,OAAO;;;;;CAKP,OAAO;CACP,YAAY,YAAU,QAAQ;AAC1B,OAAK,IAAIC;AACT,OAAK,SAAS;;;CAGlB,OAAO,OAAO;EACV,MAAM,OAAO,KAAK,EAAE,EAAE;EACtB,MAAM,eAAe,KAAK,kBAAkB,OAAO,KAAK,QAAQ,KAAK;AACrE,SAAO,KAAK,YAAY,KAAK,YAAY,aAAa,EAAE,KAAK,QAAQ,KAAK;;;CAG9E,YAAY,OAAO;AACf,MAAI;AACA,UAAO,KAAK,QAAQ,KAAK,QAAQ,KAAK,EAAE,EAAE,UAAU,MAAM;YAEtD;AACJ,QAAK,OAAO;AACZ,QAAK,OAAO;;;;CAIpB,QAAQ,MAAM,MAAM,OAAO,SAAS;EAChC,MAAM,UAAU,KAAK;AACrB,OAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK,EACrC,KAAI,QAAQ,OAAO,QAAQ,OAAO,GAAG,QAAQ,IAAI,IAAI,MAAM,EAAE;AACzD,QAAK;AACL,UAAO;;EAGf,MAAM,OAAO,UAAU,KAAK,MAAM,IAAI,KAAK,GAAG;AAC9C,MAAI,MAAM,IAAI,MAAM,CAChB,QAAO,KAAK,IAAI,MAAM;EAC1B,MAAM,OAAO,KAAK;AAClB,UAAQ,KAAK,MAAM,MAAM;EACzB,IAAI;AACJ,MAAI;AACA,YAAS,KAAK,QAAQ,MAAM,MAAM,MAAM;YAEpC;AACJ,WAAQ,UAAU;;AAEtB,MAAI,WAAW,KAAK,SAAS,MAAM;AAC/B,QAAK,yBAAS,IAAI,KAAK;GACvB,IAAI,SAAS,KAAK,KAAK,IAAI,KAAK;AAChC,OAAI,WAAW,QAAW;AACtB,6BAAS,IAAI,KAAK;AAClB,SAAK,KAAK,IAAI,MAAM,OAAO;;AAE/B,UAAO,IAAI,OAAO,OAAO;;AAE7B,SAAO;;;CAGX,OAAO,MAAM,MAAM,OAAO;AACtB,MAAI;AACA,UAAO,KAAK,EAAE,MAAM,MAAM,KAAK,OAAO,MAAM,KAAK,CAAC,CAAC,MAAM;UAEvD;AACF;;;CAGR,OAAO,MAAM,MAAM;AACf,SAAO,eAAe,KAAK,GAAG,KAAK,EAAE,EAAE,QAAQ,MAAM,KAAK,GAAG;;CAKjE,kBAAkB,OAAO,QAAQ,MAAM;AACnC,MAAI,CAAC,eAAe,OAAO,CACvB,QAAO;EACX,MAAM,IAAI,KAAK,OAAO,QAAQ,KAAK;AACnC,MAAI,MAAM,QAAQ,MAAM,CACpB,QAAO,SAAS,QAAQ,MAAM,MAAM;GAChC,MAAM,aAAa,aAAa,QAAQ,EAAE;AAC1C,UAAO,eAAe,SAAY,OAAO,KAAK,kBAAkB,MAAM,YAAY,EAAE;IACtF;AAEN,MAAI,CAAC,cAAc,MAAM,CACrB,QAAO;EACX,MAAM,aAAa,eAAe,OAAO,WAAW,GAAG,OAAO,aAAa,EAAE;EAC7E,MAAM,WAAW,eAAe,OAAO,kBAAkB,GACnD,OAAO,QAAQ,OAAO,kBAAkB,CAAC,KAAK,CAAC,SAAS,UAAU,CAAC,YAAY,QAAQ,EAAE,KAAK,CAAC,GAC/F,EAAE;EACR,MAAM,aAAa,eAAe,OAAO,qBAAqB,GAAG,OAAO,uBAAuB;AAC/F,MAAI,SAAS,WAAW,KAAK,eAAe,UAAa,CAAC,eAAe,OAAO,WAAW,CACvF,QAAO;EACX,MAAM,WAAW,IAAI,IAAI,MAAM,QAAQ,OAAO,SAAS,GAAG,OAAO,WAAW,EAAE,CAAC;EAC/E,IAAI;EACJ,MAAM,OAAO,KAAK,SAAS;AACvB,OAAI,UAAU,OAAO,OAAO,KACxB;AACJ,WAAQ,EAAE,GAAG,OAAO;AACpB,OAAI,OAAO;;AAEf,OAAK,MAAM,CAAC,KAAK,aAAa,OAAO,QAAQ,WAAW,EAAE;AACtD,OAAI,CAAC,OAAO,OAAO,OAAO,IAAI,CAC1B;GACJ,MAAM,QAAQ,eAAe,SAAS,IAAI,OAAO,SAAS,SAAS;AACnE,OAAI,MAAM,SAAS,QAAQ,CAAC,SAAS,IAAI,IAAI,IAAI,CAAC,SAAS,KAAK,OAAO,UAAU,GAAG,KAAK,KAAK,OAAO;AACjG,YAAQ,EAAE,GAAG,OAAO;AACpB,WAAO,IAAI;AACX;;AAEJ,OAAI,KAAK,KAAK,kBAAkB,MAAM,MAAM,UAAU,EAAE,CAAC;;AAI7D,MAAI,SAAS,SAAS,KAAK,eAAe,OACtC,MAAK,MAAM,OAAO,OAAO,KAAK,MAAM,EAAE;GAClC,IAAI,UAAU,OAAO,OAAO,YAAY,IAAI;AAC5C,QAAK,MAAM,CAAC,SAAS,SAAS,UAAU;AACpC,QAAI,CAAC,QAAQ,KAAK,IAAI,CAClB;AACJ,cAAU;AACV,QAAI,KAAK,KAAK,mBAAmB,OAAO,OAAO,MAAM,MAAM,EAAE,CAAC;;AAElE,OAAI,CAAC,WAAW,eAAe,OAC3B,KAAI,KAAK,KAAK,kBAAkB,MAAM,MAAM,YAAY,EAAE,CAAC;;AAGvE,SAAO,OAAO;;CAKlB,QAAQ,MAAM,MAAM,OAAO;AACvB,MAAI,CAAC,eAAe,KAAK,CACrB,QAAO;EACX,MAAM,IAAI,KAAK,OAAO,MAAM,KAAK;AACjC,MAAI,OAAO,KAAK,SAAS,UAAU;GAC/B,IAAI;AACJ,OAAI;AACA,aAAS,KAAK,EAAE,EAAE,QAAQ,KAAK,MAAM,EAAE;WAErC;AACF,WAAO;;AAEX,UAAO,eAAe,OAAO,KAAK,GAAG,KAAK,QAAQ,OAAO,MAAM,OAAO,MAAM,OAAO,KAAK,GAAG;;AAE/F,SAAO,KAAK,YAAY,MAAM,GAAG,MAAM;;;CAG3C,YAAY,MAAM,GAAG,OAAO;AACxB,MAAI,OAAO,OAAO,MAAM,QAAQ,CAC5B,QAAO,eAAe,KAAK,OAAO,MAAM;AAC5C,MAAI,MAAM,QAAQ,KAAK,KAAK,CACxB,QAAO,KAAK,YAAY,MAAM,KAAK,MAAM,GAAG,MAAM;AAGtD,MAAI,MAAM,QAAQ,KAAK,MAAM,CACzB,QAAO,KAAK,aAAa,MAAM,KAAK,OAAO,GAAG,MAAM;AACxD,MAAI,MAAM,QAAQ,KAAK,MAAM,CACzB,QAAO,KAAK,aAAa,MAAM,KAAK,OAAO,GAAG,MAAM;AACxD,MAAI,MAAM,QAAQ,KAAK,MAAM,EAAE;GAC3B,IAAI,OAAO;AACX,QAAK,MAAM,UAAU,KAAK,MACtB,QAAO,KAAK,QAAQ,QAAQ,GAAG,KAAK;AACxC,UAAO,KAAK,eAAe,MAAM,GAAG,KAAK;;AAE7C,UAAQ,KAAK,MAAb;GACI,KAAK,SACD,QAAO,QAAQ,UAAU,MAAM,EAAE,MAAM;GAC3C,KAAK,SACD,QAAO,QAAQ,UAAU,MAAM,EAAE,MAAM;GAC3C,KAAK,WAAW;IACZ,MAAM,SAAS,UAAU,MAAM;AAC/B,WAAO,WAAW,SAAY,QAAQ,KAAK,MAAM,OAAO,MAAM;;GAElE,KAAK,UACD,QAAO,QAAQ,WAAW,MAAM,EAAE,MAAM;GAC5C,KAAK,OACD,QAAO,QAAQ,QAAQ,MAAM,EAAE,MAAM;GACzC,KAAK,SACD,QAAO,QAAQ,UAAU,MAAM,EAAE,MAAM;GAC3C,KAAK,YACD,QAAO,QAAQ,aAAa,MAAM,EAAE,MAAM;GAC9C,KAAK,QACD,QAAO,KAAK,aAAa,MAAM,GAAG,MAAM;GAC5C,KAAK,SACD,QAAO,KAAK,cAAc,MAAM,GAAG,MAAM;GAC7C,KAAK;AACD,QAAI,KAAK,eAAe,UAAa,KAAK,sBAAsB,OAC5D,QAAO,KAAK,cAAc,MAAM,GAAG,MAAM;AAE7C,QAAI,KAAK,UAAU,UAAa,KAAK,gBAAgB,OACjD,QAAO,KAAK,aAAa,MAAM,GAAG,MAAM;AAC5C,WAAO;GACX,QACI,QAAO;;;;CAInB,YAAY,MAAM,QAAQ,MAAM,OAAO;AACnC,MAAI,OAAO,MAAM,WAAW,WAAW,MAAM,CACzC,QAAO;AACX,OAAK,MAAM,UAAU,QAAQ;GACzB,MAAM,YAAY,eAAe,QAAQ,MAAM;AAC/C,OAAI,cAAc,SAAS,KAAK,OAAO,MAAM,MAAM,UAAU,KAAK,KAC9D,QAAO;;AAEf,SAAO;;;;;;;;CAQX,aAAa,MAAM,UAAU,MAAM,OAAO;AACtC,MAAI,SAAS,MAAM,WAAW,KAAK,OAAO,QAAQ,MAAM,MAAM,KAAK,KAAK,CACpE,QAAO,KAAK,eAAe,MAAM,MAAM,MAAM;AACjD,OAAK,MAAM,UAAU,UAAU;GAC3B,MAAM,YAAY,KAAK,eAAe,MAAM,MAAM,KAAK,QAAQ,QAAQ,MAAM,MAAM,CAAC;AACpF,OAAI,KAAK,OAAO,MAAM,MAAM,UAAU,KAAK,KACvC,QAAO;;AAEf,SAAO,KAAK,eAAe,MAAM,MAAM,MAAM;;;CAGjD,eAAe,MAAM,MAAM,OAAO;AAI9B,SAHiB,KAAK,eAAe,UACjC,KAAK,sBAAsB,UAC3B,KAAK,yBAAyB,SAChB,KAAK,cAAc,MAAM,MAAM,MAAM,GAAG;;CAE9D,aAAa,MAAM,MAAM,OAAO;EAC5B,MAAM,SAAS,MAAM,QAAQ,KAAK,MAAM,GAClC,KAAK,QACL,MAAM,QAAQ,KAAK,YAAY,GAC3B,KAAK,cACL;AACV,MAAI,WAAW,QAAW;AAEtB,OAAI,CAAC,MAAM,QAAQ,MAAM,CACrB,QAAO;GACX,MAAM,OAAO,MAAM,QAAQ,KAAK,MAAM,GAAG,SAAY,KAAK;AAC1D,UAAO,SAAS,QAAQ,QAAM,MAAM;IAChC,MAAM,SAAS,IAAI,OAAO,SAAS,OAAO,KAAK;AAC/C,WAAO,WAAW,SAAYC,SAAO,KAAK,QAAQ,QAAQ,MAAMA,OAAK;KACvE;;AAEN,MAAI,MAAM,QAAQ,MAAM,CACpB,QAAO,KAAK,UAAU,SAAY,QAAQ,SAAS,QAAQ,WAAS,KAAK,QAAQ,KAAK,OAAO,MAAMA,OAAK,CAAC;EAG7G,MAAM,OAAO,KAAK;AAClB,SAAO,CAAC,eAAe,KAAK,GAAG,KAAK,QAAQ,MAAM,MAAM,OAAO,MAAM,GAAG,MAAM;;CAElF,cAAc,MAAM,MAAM,OAAO;AAC7B,MAAI,CAAC,cAAc,MAAM,CACrB,QAAO;EACX,MAAM,aAAa,eAAe,KAAK,WAAW,GAAG,KAAK,aAAa,EAAE;EACzE,MAAM,WAAW,eAAe,KAAK,kBAAkB,GACjD,OAAO,QAAQ,KAAK,kBAAkB,CAAC,KAAK,CAAC,SAAS,YAAY,CAAC,YAAY,QAAQ,EAAE,OAAO,CAAC,GACjG,EAAE;EACR,MAAM,aAAa,eAAe,KAAK,qBAAqB,GAAG,KAAK,uBAAuB;EAC3F,IAAI;AACJ,OAAK,MAAM,OAAO,OAAO,KAAK,MAAM,EAAE;AAElC,OAAI,MAAM,SAAS,OACf;GACJ,IAAI,OAAO,MAAM;GACjB,IAAI,UAAU,OAAO,OAAO,YAAY,IAAI;AAC5C,OAAI,QACA,QAAO,KAAK,QAAQ,WAAW,MAAM,MAAM,KAAK;AACpD,QAAK,MAAM,CAAC,SAAS,WAAW,UAAU;AACtC,QAAI,CAAC,QAAQ,KAAK,IAAI,CAClB;AACJ,cAAU;AACV,WAAO,KAAK,QAAQ,QAAQ,MAAM,KAAK;;AAE3C,OAAI,CAAC,WAAW,eAAe,OAC3B,QAAO,KAAK,QAAQ,YAAY,MAAM,KAAK;AAC/C,OAAI,SAAS,MAAM,MAAM;AACrB,YAAQ,EAAE,GAAG,OAAO;AACpB,QAAI,OAAO;;;AAGnB,SAAO,OAAO;;CAKlB,YAAY,OAAO,QAAQ,MAAM;AAC7B,MAAI,CAAC,eAAe,OAAO,CACvB,QAAO;EACX,MAAM,IAAI,KAAK,OAAO,QAAQ,KAAK;EACnC,IAAI,OAAO;AACX,MAAI,MAAM,QAAQ,OAAO,MAAM,CAC3B,MAAK,MAAM,UAAU,OAAO,MACxB,QAAO,KAAK,YAAY,MAAM,QAAQ,EAAE;AAChD,MAAI,MAAM,QAAQ,OAAO,MAAM,CAC3B,QAAO,KAAK,YAAY,MAAM,OAAO,OAAO,EAAE;AAClD,MAAI,MAAM,QAAQ,OAAO,MAAM,CAC3B,QAAO,KAAK,YAAY,MAAM,OAAO,OAAO,EAAE;EAClD,MAAM,QAAQ,QAAQ,OAAO;EAC7B,MAAM,qBAAqB,MAAM,SAAS,KAAK,MAAM,MAAM,SAAS,YAAY,MAAM,KAAK,CAAC;AAC5F,MAAI,MAAM,SAAS,KAAK,CAAC,mBACrB,MAAK,MAAM,QAAQ,OAAO;GACtB,MAAM,YAAY,gBAAgB,MAAM,KAAK;AAC7C,OAAI,cAAc,MAAM;AACpB,WAAO;AACP;;;AAIZ,MAAI,MAAM,SAAS,SAAS,IAAI,cAAc,KAAK,CAC/C,QAAO,KAAK,iBAAiB,MAAM,QAAQ,EAAE;AACjD,MAAI,MAAM,SAAS,QAAQ,IAAI,MAAM,QAAQ,KAAK,CAC9C,QAAO,KAAK,YAAY,MAAM,QAAQ,EAAE;AAC5C,SAAO;;CAEX,YAAY,OAAO,UAAU,MAAM;AAC/B,OAAK,MAAM,UAAU,SACjB,KAAI,KAAK,OAAO,QAAQ,MAAM,MAAM,KAAK,KACrC,QAAO;AACf,OAAK,MAAM,UAAU,UAAU;GAC3B,MAAM,UAAU,KAAK,YAAY,OAAO,QAAQ,KAAK;AACrD,OAAI,KAAK,OAAO,QAAQ,MAAM,QAAQ,KAAK,KACvC,QAAO;;AAEf,SAAO;;CAEX,iBAAiB,OAAO,QAAQ,MAAM;EAClC,MAAM,aAAa,eAAe,OAAO,WAAW,GAAG,OAAO,aAAa,EAAE;EAC7E,MAAM,WAAW,eAAe,OAAO,kBAAkB,GACnD,OAAO,QAAQ,OAAO,kBAAkB,CAAC,KAAK,CAAC,SAAS,UAAU,CAAC,YAAY,QAAQ,EAAE,KAAK,CAAC,GAC/F,EAAE;EACR,MAAM,aAAa,eAAe,OAAO,qBAAqB,GAAG,OAAO,uBAAuB;EAC/F,IAAI;EACJ,MAAM,OAAO,KAAK,SAAS;AACvB,OAAI,UAAU,OAAO,OAAO,KACxB;AACJ,WAAQ,EAAE,GAAG,OAAO;AACpB,OAAI,OAAO;;AAEf,OAAK,MAAM,CAAC,KAAK,aAAa,OAAO,QAAQ,WAAW,CACpD,KAAI,OAAO,MACP,KAAI,KAAK,KAAK,YAAY,MAAM,MAAM,UAAU,KAAK,CAAC;AAE9D,OAAK,MAAM,OAAO,OAAO,KAAK,MAAM,EAAE;GAClC,IAAI,UAAU,OAAO,OAAO,YAAY,IAAI;AAC5C,QAAK,MAAM,CAAC,SAAS,SAAS,UAAU;AACpC,QAAI,CAAC,QAAQ,KAAK,IAAI,CAClB;AACJ,cAAU;AACV,QAAI,KAAK,KAAK,aAAa,OAAO,OAAO,MAAM,MAAM,KAAK,CAAC;;AAE/D,OAAI,CAAC,WAAW,eAAe,OAC3B,KAAI,KAAK,KAAK,YAAY,MAAM,MAAM,YAAY,KAAK,CAAC;;AAEhE,SAAO,OAAO;;CAElB,YAAY,OAAO,QAAQ,MAAM;AAC7B,SAAO,SAAS,QAAQ,MAAM,MAAM;GAChC,MAAM,aAAa,aAAa,QAAQ,EAAE;AAC1C,UAAO,eAAe,WAAW,GAAG,KAAK,YAAY,MAAM,YAAY,KAAK,GAAG;IACjF;;;;;;;AAOV,SAAS,aAAa,QAAQ,OAAO;AACjC,KAAI,MAAM,QAAQ,OAAO,MAAM,CAC3B,QAAO,OAAO,MAAM;AACxB,KAAI,MAAM,QAAQ,OAAO,YAAY,IAAI,QAAQ,OAAO,YAAY,OAChE,QAAO,OAAO,YAAY;AAC9B,QAAO,OAAO;;;AAGlB,SAAS,SAAS,OAAO,KAAK;CAC1B,IAAI;AACJ,MAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;EACnC,MAAM,OAAO,IAAI,MAAM,IAAI,EAAE;AAC7B,MAAI,SAAS,MAAM,GACf;AACJ,UAAQ,MAAM,OAAO;AACrB,MAAI,KAAK;;AAEb,QAAO,OAAO;;AAElB,SAAS,QAAQ,QAAQ,OAAO;AAC5B,QAAO,WAAW,SAAY,QAAQ,OAAO;;;AAGjD,SAAS,eAAe,SAAS,OAAO;AACpC,KAAI,YAAY,MACZ,QAAO;CACX,MAAM,SAAS,OAAO,YAAY,WAC5B,UAAU,MAAM,GAChB,OAAO,YAAY,WACf,UAAU,MAAM,GAChB,OAAO,YAAY,YACf,WAAW,MAAM,GACjB,OAAO,YAAY,WACf,UAAU,MAAM,GAChB;AAClB,QAAO,WAAW,UAAa,OAAO,UAAU,UAAU,OAAO,QAAQ;;AAE7E,SAAS,UAAU,OAAO;AACtB,KAAI,OAAO,UAAU,YAAY,OAAO,UAAU,aAAa,eAAe,MAAM,CAChF,QAAO,EAAE,OAAO,OAAO,MAAM,EAAE;AACnC,KAAI,UAAU,KACV,QAAO,EAAE,OAAO,QAAQ;AAC5B,KAAI,OAAO,UAAU,SACjB,QAAO,EAAE,OAAO;AACpB,KAAI,UAAU,OACV,QAAO,EAAE,OAAO,IAAI;;AAG5B,MAAM,aAAa,OAAO,OAAO,iBAAiB;AAClD,MAAM,aAAa,OAAO,OAAO,iBAAiB;AAClD,SAAS,UAAU,OAAO;AACtB,KAAI,OAAO,UAAU,SACjB,QAAO,SAAS,cAAc,SAAS,aAAa,EAAE,OAAO,OAAO,MAAM,EAAE,GAAG;AACnF,KAAI,OAAO,UAAU,UACjB,QAAO,EAAE,OAAO,QAAQ,IAAI,GAAG;AACnC,KAAI,eAAe,MAAM,CACrB,QAAO,EAAE,OAAO;AACpB,KAAI,UAAU,QAAQ,UAAU,OAC5B,QAAO,EAAE,OAAO,GAAG;AACvB,KAAI,OAAO,UAAU,SACjB,QAAO;CACX,MAAM,UAAU,CAAC;AACjB,KAAI,OAAO,SAAS,QAAQ,CACxB,QAAO,EAAE,OAAO,SAAS;CAC7B,MAAM,YAAY,MAAM,aAAa;AACrC,KAAI,cAAc,QACd,QAAO,EAAE,OAAO,GAAG;AACvB,KAAI,cAAc,OACd,QAAO,EAAE,OAAO,GAAG;CACvB,MAAM,MAAM,eAAe,MAAM;AACjC,QAAO,QAAQ,UAAa,OAAO,cAAc,OAAO,aAAa,EAAE,OAAO,OAAO,IAAI,EAAE,GAAG;;;AAGlG,SAAS,eAAe,OAAO;AAC3B,KAAI,oBAAoB,KAAK,MAAM,CAC/B,QAAO,OAAO,MAAM,MAAM,GAAG,GAAG,CAAC;AACrC,KAAI,wBAAwB,KAAK,MAAM,CACnC,QAAO,OAAO,MAAM,MAAM,IAAI,CAAC,GAAG;AACtC,KAAI,mBAAmB,KAAK,MAAM,CAC9B,QAAO,OAAO,MAAM;;;AAI5B,SAAS,UAAU,OAAO;AACtB,KAAI,OAAO,UAAU,SACjB,QAAO,EAAE,OAAO;AACpB,KAAI,OAAO,UAAU,UACjB,QAAO,EAAE,OAAO,QAAQ,KAAK,IAAI;AACrC,KAAI,eAAe,MAAM,CACrB,QAAO,EAAE,OAAO,OAAO,KAAK,MAAM,MAAM,CAAC,EAAE;AAC/C,KAAI,UAAU,QAAQ,UAAU,OAC5B,QAAO,EAAE,OAAO,IAAI;AACxB,KAAI,OAAO,UAAU,SACjB,QAAO;CACX,MAAM,MAAM,eAAe,MAAM;AACjC,KAAI,QAAQ,OACR,QAAO,EAAE,OAAO,KAAK;CACzB,MAAM,YAAY,MAAM,aAAa;AACrC,QAAO,cAAc,UAAU,EAAE,OAAO,IAAI,GAAG,cAAc,SAAS,EAAE,OAAO,IAAI,GAAG;;;AAG1F,SAAS,aAAa,OAAO;AACzB,KAAI,UAAU,UAAa,UAAU,QAAQ,UAAU,MAAM,UAAU,SAAS,UAAU,EACtF,QAAO,EAAE,OAAO,QAAW;AAC/B,KAAI,OAAO,UAAU,SACjB,QAAO;CACX,MAAM,YAAY,MAAM,aAAa;AACrC,QAAO,cAAc,eAAe,cAAc,UAAU,UAAU,MAAM,UAAU,MAChF,EAAE,OAAO,QAAW,GACpB;;AAEV,SAAS,WAAW,OAAO;AACvB,KAAI,OAAO,UAAU,SACjB,QAAO,UAAU,KAAK,EAAE,OAAO,OAAO,GAAG,UAAU,KAAK,EAAE,OAAO,MAAM,GAAG;AAC9E,KAAI,OAAO,UAAU,UACjB,QAAO,EAAE,OAAO;AACpB,KAAI,eAAe,MAAM,CACrB,QAAO,UAAU,IAAI,EAAE,OAAO,OAAO,GAAG,UAAU,IAAI,EAAE,OAAO,MAAM,GAAG;AAC5E,KAAI,UAAU,QAAQ,UAAU,OAC5B,QAAO,EAAE,OAAO,OAAO;AAC3B,KAAI,OAAO,UAAU,SACjB,QAAO;CACX,MAAM,YAAY,MAAM,aAAa;AACrC,KAAI,cAAc,WAAW,UAAU,IACnC,QAAO,EAAE,OAAO,OAAO;AAC3B,KAAI,cAAc,UAAU,UAAU,IAClC,QAAO,EAAE,OAAO,MAAM;;AAG9B,SAAS,QAAQ,OAAO;AACpB,KAAI,OAAO,UAAU,SACjB,QAAO,UAAU,KAAK,EAAE,OAAO,MAAM,GAAG;AAC5C,KAAI,OAAO,UAAU,UACjB,QAAO,UAAU,QAAQ,EAAE,OAAO,MAAM,GAAG;AAC/C,KAAI,eAAe,MAAM,CACrB,QAAO,UAAU,IAAI,EAAE,OAAO,MAAM,GAAG;AAC3C,KAAI,UAAU,QAAQ,UAAU,OAC5B,QAAO,EAAE,OAAO,MAAM;AAC1B,KAAI,OAAO,UAAU,SACjB,QAAO;CACX,MAAM,YAAY,MAAM,aAAa;AACrC,QAAO,cAAc,eAAe,cAAc,UAAU,UAAU,MAAM,UAAU,MAChF,EAAE,OAAO,MAAM,GACf;;AAEV,SAAS,eAAe,OAAO;AAC3B,QAAO,OAAO,UAAU,YAAY,OAAO,SAAS,MAAM;;AAK9D,SAAS,QAAQ,QAAQ;AACrB,KAAI,OAAO,OAAO,SAAS,SACvB,QAAO,CAAC,OAAO,KAAK;AACxB,KAAI,MAAM,QAAQ,OAAO,KAAK,CAC1B,QAAO,OAAO,KAAK,QAAQ,SAAS,OAAO,SAAS,SAAS;AACjE,QAAO,EAAE;;AAEb,SAAS,YAAY,OAAO,MAAM;AAC9B,SAAQ,MAAR;EACI,KAAK,SACD,QAAO,OAAO,SAAS,MAAM;EACjC,KAAK,UACD,QAAO,OAAO,UAAU,YAAY,OAAO,UAAU,MAAM;EAC/D,KAAK,UACD,QAAO,OAAO,UAAU;EAC5B,KAAK,SACD,QAAO,OAAO,UAAU;EAC5B,KAAK,OACD,QAAO,UAAU;EACrB,KAAK,SACD,QAAO,OAAO,UAAU;EAC5B,KAAK,YACD,QAAO,UAAU;EACrB,KAAK,QACD,QAAO,MAAM,QAAQ,MAAM;EAC/B,KAAK,SACD,QAAO,cAAc,MAAM;EAC/B,QACI,QAAO;;;AAGnB,SAAS,gBAAgB,OAAO,MAAM;AAClC,SAAQ,MAAR;EACI,KAAK;EACL,KAAK;AACD,OAAI,UAAU,KACV,QAAO;AACX,OAAI,OAAO,UAAU,YAAY,MAAM,MAAM,KAAK,IAAI;IAClD,MAAM,SAAS,OAAO,MAAM;AAC5B,QAAI,SAAS,WAAW,OAAO,SAAS,OAAO,GAAG,OAAO,UAAU,OAAO,CACtE,QAAO;;AAEf,OAAI,OAAO,UAAU,UACjB,QAAO,QAAQ,IAAI;AACvB,UAAO;EAEX,KAAK;AACD,OAAI,UAAU,KACV,QAAO;AACX,OAAI,UAAU,UAAU,UAAU,EAC9B,QAAO;AACX,OAAI,UAAU,WAAW,UAAU,EAC/B,QAAO;AACX,UAAO;EACX,KAAK;AACD,OAAI,UAAU,KACV,QAAO;AACX,OAAI,OAAO,UAAU,YAAY,OAAO,UAAU,UAC9C,QAAO,OAAO,MAAM;AACxB,UAAO;EACX,KAAK,OACD,QAAO,UAAU,MAAM,UAAU,KAAK,UAAU,QAAQ,OAAO;EACnE,QACI,QAAO;;;AAGnB,SAAS,cAAc,OAAO;AAC1B,QAAO,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,MAAM;;;;;;ACzmB/E,SAAgB,iBAAiB;AAC7B,QAAO;EAAE,OAAO;EAAM,UAAU;EAAO,OAAO;EAAG,UAAU;EAAO,SAAS;EAAM;;AAErF,SAAS,MAAM,GAAG,GAAG;AACjB,KAAI,EAAE,UAAU,KACZ,MAAK,MAAM,KAAK,EAAE,MACd,SAAQ,GAAG,EAAE;AACrB,GAAE,aAAa,EAAE;AACjB,KAAI,EAAE,QAAQ,EAAE,MACZ,GAAE,QAAQ,EAAE;AAChB,GAAE,aAAa,EAAE;AACjB,KAAI,EAAE,YAAY,KACd,MAAK,MAAM,KAAK,EAAE,QACd,UAAS,GAAG,EAAE;;AAE1B,SAAS,QAAQ,GAAG,KAAK;AACrB,KAAI,EAAE,UAAU,KACZ,GAAE,wBAAQ,IAAI,KAAK;AACvB,GAAE,MAAM,IAAI,IAAI;;AAEpB,SAAS,SAAS,GAAG,OAAO;AACxB,KAAI,EAAE,YAAY,KACd,GAAE,0BAAU,IAAI,KAAK;AACzB,GAAE,QAAQ,IAAI,MAAM;;AAExB,MAAa,wBAAwB;AACrC,MAAa,yBAAyB;;AAEtC,SAAgB,mBAAmB,MAAM;AACrC,SAAQ,GAAG,MAAM,KAAK,MAAM,GAAG,EAAE;;;AAGrC,SAAgB,kBAAkB,OAAO;AACrC,SAAQ,MAAM,MAAM,EAAE;;;AAG1B,SAAgB,qBAAqB,OAAO;AACxC,SAAQ,MAAM,MAAM,GAAG,gBAAgB,CAAC;;;AAG5C,SAAgB,iBAAiB,OAAO,KAAK,OAAO;AAChD,SAAQ,GAAG,MAAM;AACb,QAAM,KAAK,IAAI;EACf,MAAM,KAAK,MAAM,GAAG,EAAE;AACtB,QAAM,KAAK;AACX,SAAO;;;;AAIf,SAAgB,mBAAmB,OAAO;AACtC,SAAQ,GAAG,MAAM;EACb,MAAM,IAAI,gBAAgB;AAC1B,MAAI,CAAC,MAAM,GAAG,EAAE,CACZ,QAAO;AACX,QAAM,GAAG,EAAE;AACX,SAAO;;;;AAIf,SAAgB,YAAY,OAAO,OAAO;AACtC,SAAQ,GAAG,MAAM;AACb,MAAI,CAAC,MAAM,EAAE,CACT,QAAO;AACX,OAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,IAC9B,KAAI,CAAC,MAAM,GAAG,GAAG,EAAE,CACf,QAAO;AACf,SAAO;;;;AAIf,SAAgB,eAAe,OAAO,UAAU,YAAY;CACxD,MAAM,WAAW,IAAI,IAAI,MAAM,KAAK,CAAC,OAAO,EAAE,CAAC;AAC/C,SAAQ,GAAG,MAAM;AACb,MAAI,CAAC,SAAS,EAAE,CACZ,QAAO;EACX,MAAM,OAAO,EAAE;AACf,OAAK,MAAM,CAAC,GAAG,UAAU,OAAO;AAC5B,OAAI,CAAC,OAAO,OAAO,GAAG,EAAE,CACpB;AACJ,OAAI,CAAC,MAAM,EAAE,GAAG,CACZ,QAAO;AACX,QAAK,KAAK,EAAE;;AAEhB,OAAK,MAAM,KAAK,OAAO,KAAK,EAAE,EAAE;GAC5B,IAAI,UAAU,SAAS,IAAI,EAAE;AAC7B,QAAK,MAAM,CAAC,IAAI,UAAU,SACtB,KAAI,GAAG,KAAK,EAAE,EAAE;AACZ,QAAI,CAAC,MAAM,EAAE,GAAG,CACZ,QAAO;AACX,cAAU;AACV,SAAK,KAAK,EAAE;;AAGpB,OAAI,CAAC,WAAW,eAAe,QAAW;AACtC,QAAI,CAAC,WAAW,EAAE,GAAG,CACjB,QAAO;AACX,SAAK,KAAK,EAAE;;;AAGpB,OAAK,MAAM,KAAK,KACZ,SAAQ,GAAG,EAAE;AACjB,SAAO;;;;AAIf,SAAgB,cAAc,QAAQ,MAAM,UAAU,aAAa,aAAa;AAC5E,SAAQ,GAAG,MAAM;AACb,MAAI,CAAC,MAAM,QAAQ,EAAE,CACjB,QAAO;EACX,MAAM,IAAI,KAAK,IAAI,EAAE,QAAQ,OAAO,OAAO;AAC3C,OAAK,IAAI,IAAI,GAAG,IAAI,GAAG,IACnB,KAAI,CAAC,OAAO,GAAG,EAAE,GAAG,CAChB,QAAO;AACf,MAAI,SAAS,QAAW;AACpB,QAAK,IAAI,IAAI,OAAO,QAAQ,IAAI,EAAE,QAAQ,IACtC,KAAI,CAAC,KAAK,EAAE,GAAG,CACX,QAAO;AACf,KAAE,WAAW;;AAEjB,MAAI,IAAI,EAAE,MACN,GAAE,QAAQ;AACd,MAAI,aAAa,QAAW;GACxB,IAAI,IAAI;AACR,QAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,IAC1B,KAAI,SAAS,EAAE,GAAG,EAAE;AAChB;AACA,aAAS,GAAG,EAAE;;AAGtB,OAAI,IAAI,eAAe,IAAI,YACvB,QAAO;;AAEf,SAAO;;;;AAIf,SAAgB,YAAY,UAAU,YAAY;AAC9C,SAAQ,GAAG,MAAM;EACb,IAAI,IAAI;AACR,OAAK,MAAM,UAAU,UAAU;GAC3B,MAAM,IAAI,gBAAgB;AAC1B,OAAI,OAAO,GAAG,EAAE,EAAE;AACd;AACA,UAAM,GAAG,EAAE;;;AAGnB,SAAO,aAAa,MAAM,IAAI,IAAI;;;;AAI1C,SAAgB,WAAW,MAAM,MAAM,WAAW;AAC9C,SAAQ,GAAG,MAAM;EACb,MAAM,IAAI,gBAAgB;AAC1B,MAAI,KAAK,GAAG,EAAE,EAAE;AACZ,SAAM,GAAG,EAAE;AACX,UAAO,SAAS,UAAa,KAAK,GAAG,EAAE;;AAE3C,SAAO,cAAc,UAAa,UAAU,GAAG,EAAE;;;;AAIzD,SAAgB,kBAAkB,KAAK,OAAO;AAC1C,SAAQ,GAAG,MAAM,CAAC,SAAS,EAAE,IAAI,CAAC,OAAO,OAAO,GAAG,IAAI,IAAI,MAAM,GAAG,EAAE;;;AAG1E,SAAgB,sBAAsB,OAAO;AACzC,SAAQ,GAAG,MAAM;AACb,MAAI,CAAC,SAAS,EAAE,IAAI,EAAE,SAClB,QAAO;AACX,OAAK,MAAM,KAAK,OAAO,KAAK,EAAE,CAC1B,KAAI,EAAE,EAAE,OAAO,IAAI,EAAE,IAAI,UAAU,CAAC,MAAM,EAAE,GAAG,CAC3C,QAAO;AACf,IAAE,WAAW;AACb,SAAO;;;;AAIf,SAAgB,iBAAiB,OAAO;AACpC,SAAQ,GAAG,MAAM;AACb,MAAI,CAAC,MAAM,QAAQ,EAAE,IAAI,EAAE,SACvB,QAAO;AACX,OAAK,IAAI,IAAI,EAAE,OAAO,IAAI,EAAE,QAAQ,IAChC,KAAI,EAAE,EAAE,SAAS,IAAI,EAAE,IAAI,UAAU,CAAC,MAAM,EAAE,GAAG,CAC7C,QAAO;AACf,IAAE,WAAW;AACb,SAAO;;;;;;;ACrLf,MAAa,UAAU,OAAO,UAAU;;AAExC,IAAa,WAAb,MAAsB;CAClB;CACA;CACA;;CAEA;CACA;CACA;CACA,wBAAQ,IAAI,KAAK;CACjB,kCAAkB,IAAI,KAAK;CAC3B,YAAY,QAAQ,SAAS,SAAS;AAClC,OAAK,SAAS;AACd,OAAK,IAAI,IAAI,SAAS,QAAQ,QAAQ;AACtC,OAAK,QAAQ,KAAK,EAAE;AACpB,OAAK,UAAU,QAAQ;AACvB,OAAK,UAAU;AACf,OAAK,QAAQ,EAAE;;;CAGnB,OAAO;AACH,SAAO,KAAK,MAAM,KAAK,QAAQ,KAAK,EAAE,SAAS;;;CAGnD,MAAM,MAAM,MAAM;AACd,MAAI,SAAS,KACT,QAAO;AACX,MAAI,SAAS,MACT,QAAO;AACX,MAAI,CAAC,eAAe,KAAK,CACrB,OAAM,IAAI,MAAM,gDAAgD,KAAK,UAAU,KAAK,GAAG;EAC3F,MAAM,SAAS,KAAK,MAAM,IAAI,KAAK;AACnC,MAAI,WAAW,OACX,QAAO;EACX,MAAM,OAAO,KAAK,SAAS,KAAK;AAChC,MAAI,SAAS,OACT,QAAO;EACX,MAAM,OAAO,EAAE,OAAO,QAAW;AACjC,OAAK,MAAM,IAAI,MAAM,SAAS,KAAK,CAAC;EACpC,MAAM,QAAQ,KAAK,MAAM,MAAM,KAAK,EAAE,QAAQ,MAAM,KAAK,CAAC;AAC1D,OAAK,QAAQ;AACb,OAAK,MAAM,IAAI,MAAM,MAAM;AAC3B,SAAO;;CAEX,MAAM,MAAM,MAAM;AACd,MAAI,KAAK,UAAU,OAAO,OAAO,KAAK,SAAS,SAC3C,QAAO,KAAK,IAAI,KAAK,MAAM,KAAK;AACpC,MAAI,KAAK,UAAU,QAAQ,KAAK,0BAA0B,UAAa,KAAK,qBAAqB,QAC7F,QAAO,qBAAqB,KAAK,WAAW,MAAM,KAAK,CAAC;EAE5D,MAAM,QAAQ,KAAK,MAAM,MAAM,KAAK;AACpC,SAAO,KAAK,WAAW,KAAK,EAAE,WAAW,MAAM,KAAK,GAAG,YAAY,KAAK,OAAO,MAAM,MAAM,GAAG;;;;;;CAMlG,SAAS,MAAM;EACX,IAAI;AACJ,OAAK,MAAM,KAAK,KACZ,KAAI,MAAM,OACN,QAAO,KAAK;WACP,CAAC,iBAAiB,IAAI,EAAE,CAC7B,QAAO;AAEf,MAAI,SAAS,OACT,QAAO;AACX,SAAO,OAAO,SAAS,WAAW,YAAY,IAAI,KAAK,GAAG;;;CAG9D,MAAM,MAAM,MAAM;EACd,MAAM,QAAQ,EAAE;EAChB,MAAM,QAAQ,KAAK,SAAS,SAAY,SAAY,MAAM,QAAQ,KAAK,KAAK,GAAG,KAAK,OAAO,CAAC,KAAK,KAAK;EACtG,MAAM,SAAS,OAAO,WAAW,IAAI,MAAM,KAAK;EAChD,IAAI,cAAc;AAClB,MAAI,WAAW,SAAS;AACpB,SAAM,KAAK,WAAW,OAAO,KAAK,UAAU,IAAI,GAAG,OAAO,KAAK,UAAU,IAAI,OAAO,kBAAkB,CAAC;AACvG,iBAAc;SAEb;GACD,MAAM,SAAS,KAAK,YAAY,MAAM,WAAW,SAAS;AAC1D,OAAI,WAAW,OACX,OAAM,KAAK,OAAO;GACtB,MAAM,UAAU,WAAW,YAAY,WAAW,aAAa,WAAW;GAC1E,MAAM,OAAO,WAAW,WAAW,IAAI,WAAW,YAAY,IAAI,WAAW,WAAW,IAAI;GAC5F,MAAMC,WAAS,KAAK,YAAY,MAAM,KAAK;AAC3C,OAAIA,aAAW,OACX,OAAM,KAAKA,SAAO;GACtB,MAAM,SAAS,KAAK,YAAY,MAAM,MAAM,WAAW,SAAS;AAChE,OAAI,WAAW,OACX,OAAM,KAAK,OAAO;GACtB,MAAM,QAAQ,KAAK,WAAW,MAAM,MAAM,WAAW,QAAQ;AAC7D,OAAI,UAAU,OACV,OAAM,KAAK,MAAM;AACrB,iBACK,WAAW,YAAY,WAAW,UAC9B,WAAWA,aAAW,UACtB,WAAW,YAAY,WAAW,UAClC,WAAW,WAAW,UAAU;;AAE7C,MAAI,UAAU,UAAa,CAAC,YACxB,OAAM,QAAQ,UAAU,MAAM,CAAC;AACnC,OAAK,QAAQ,MAAM,MAAM,MAAM;AAC/B,SAAO,IAAI,MAAM;;CAGrB,QAAQ,MAAM,MAAM,OAAO;AACvB,MAAI,MAAM,QAAQ,KAAK,KAAK,CACxB,OAAM,KAAK,UAAU,KAAK,KAAK,CAAC;AACpC,MAAI,OAAO,OAAO,MAAM,QAAQ,CAC5B,OAAM,KAAK,WAAW,KAAK,MAAM,CAAC;AACtC,MAAI,MAAM,QAAQ,KAAK,MAAM,CACzB,OAAM,KAAK,IAAI,KAAK,MAAM,KAAK,MAAM,KAAK,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC;AAC/D,MAAI,MAAM,QAAQ,KAAK,MAAM,CACzB,OAAM,KAAK,KAAK,MAAM,KAAK,OAAO,MAAM,MAAM,CAAC;AACnD,MAAI,MAAM,QAAQ,KAAK,MAAM,CACzB,OAAM,KAAK,KAAK,MAAM,KAAK,OAAO,MAAM,KAAK,CAAC;AAClD,MAAI,KAAK,QAAQ,OACb,OAAM,KAAK,SAAS,KAAK,MAAM,KAAK,KAAK,KAAK,CAAC,CAAC;AACpD,MAAI,KAAK,OAAO,WAAc,KAAK,SAAS,UAAa,KAAK,SAAS,SAAY;GAC/E,MAAM,OAAO,KAAK,SAAS,SAAY,SAAS,KAAK,MAAM,KAAK,MAAM,KAAK;GAC3E,MAAM,YAAY,KAAK,SAAS,SAAY,SAAS,KAAK,MAAM,KAAK,MAAM,KAAK;AAChF,SAAM,KAAK,QAAQ,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,MAAM,UAAU,CAAC;;AAEnE,MAAI,OAAO,KAAK,SAAS,SACrB,OAAM,KAAK,KAAK,IAAI,KAAK,MAAM,KAAK,CAAC;AACzC,MAAI,KAAK,UAAU,OAAO,OAAO,KAAK,gBAAgB,SAClD,OAAM,KAAK,KAAK,WAAW,KAAK,aAAa,KAAK,CAAC;;CAG3D,MAAM,UAAU,MAAM,YAAY;EAC9B,MAAM,eAAe,SAAS,KAAK,MAAM,KAAK,MAAM,GAAG,KAAK,CAAC;AAC7D,SAAQ,WAAW,UAAU,WAAW,IACpC,KAAK,OAAO,UAAU,KAAK,KAC1B,aAAa,SAAS,QAAQ,CAAC,GAAG,MAAM,QAAQ,CAAC;;CAE1D,IAAI,KAAK,MAAM;EACX,MAAM,SAAS,KAAK,EAAE,QAAQ,KAAK,KAAK;EACxC,MAAM,QAAQ,KAAK,MAAM,OAAO,MAAM,OAAO,KAAK;AAClD,SAAO,KAAK,WAAW,OAAO,SAAS,OAAO,YAAY,KAAK,OAAO,OAAO,MAAM,MAAM,GAAG;;CAEhG,WAAW,KAAK,MAAM;EAClB,MAAM,WAAW,KAAK,UAAU,KAAK,KAAK;AAC1C,MAAI,aAAa,OACb,QAAO,KAAK,IAAI,KAAK,KAAK;EAC9B,MAAM,EAAE,SAAS,SAAS;EAC1B,MAAM,WAAW,KAAK,MAAM,QAAQ,MAAM,QAAQ,KAAK;EACvD,MAAM,SAAS,KAAK,cAAc,OAAO,MAAM,MAAM,KAAK,MAAM,MAAM,EAAE,CAAC;EACzE,MAAM,QAAQ,KAAK;AACnB,UAAQ,MAAM;AACV,QAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;IACnC,MAAM,QAAQ,OAAO,MAAM,GAAG;AAC9B,QAAI,UAAU,KACV,QAAO,MAAM,EAAE;;AAEvB,UAAO,SAAS,EAAE;;;;CAI1B,UAAU,KAAK,MAAM;EACjB,MAAM,UAAU,KAAK,EAAE,QAAQ,KAAK,KAAK;EACzC,MAAM,MAAM,WAAW,KAAK,KAAK;EACjC,MAAM,OAAO,IAAI,MAAM,WAAW,IAAI,CAAC,SAAS,EAAE;EAClD,MAAM,WAAW,eAAe,QAAQ,KAAK,IAAI,QAAQ,KAAK,mBAAmB;AACjF,MAAI,SAAS,MAAM,KAAK,WAAW,IAAI,IAAI,CAAC,SACxC,QAAO;AACX,MAAI,CAAC,KAAK,QACN,OAAM;AACV,SAAO;GAAE;GAAS;GAAM;;CAG5B,cAAc,MAAM,WAAS;EACzB,MAAM,wBAAQ,IAAI,KAAK;AACvB,UAAQ,QAAQ;GACZ,MAAM,MAAM,GAAG,IAAI,GAAG;GACtB,IAAI,QAAQ,MAAM,IAAI,IAAI;AAC1B,OAAI,UAAU,QAAW;IACrB,MAAM,SAAS,KAAK,EAAE,eAAe,IAAI,IAAI;AAC7C,YAAQ,WAAW,SAAY,OAAOC,UAAQ,QAAQ,KAAK,EAAE,OAAO,IAAI,OAAO,IAAI,IAAI;AACvF,UAAM,IAAI,KAAK,MAAM;;AAEzB,UAAO;;;;CAIf,OAAO,UAAU,MAAM;AACnB,MAAI,SAAS,SAAS,EAClB,QAAO;EACX,MAAM,WAAW,EAAE;AACnB,OAAK,MAAM,UAAU,UAAU;AAC3B,OAAI,CAAC,eAAe,OAAO,CACvB,QAAO;GACX,MAAM,MAAM,OAAO,OAAO,SAAS,YAAY,OAAO,KAAK,OAAO,CAAC,WAAW,IAAI,OAAO,OAAO;GAChG,MAAM,OAAO,QAAQ,SAAY,SAAS,KAAK,EAAE,QAAQ,KAAK,KAAK,EAAE,QAAQ,QAAQ,KAAK,CAAC,CAAC;AAC5F,OAAI,CAAC,eAAe,KAAK,CACrB,QAAO;AACX,YAAS,KAAK,KAAK;;EAEvB,MAAM,QAAQ,SAAS,GAAG;AAC1B,MAAI,CAAC,eAAe,MAAM,CACtB,QAAO;AACX,OAAK,MAAM,OAAO,OAAO,KAAK,MAAM,EAAE;GAClC,MAAM,OAAO,SAAS,KAAK,MAAM,MAAM,GAAG,IAAI,CAAC;AAC/C,OAAI,KAAK,MAAM,MAAM,MAAM,OAAU,IAAI,IAAI,IAAI,KAAK,CAAC,SAAS,KAAK,OACjE;AACJ,UAAO,YAAY,KAAK,MAAM,SAAS,KAAK,MAAM,KAAK,MAAM,GAAG,KAAK,CAAC,CAAC;;;CAI/E,YAAY,MAAM,QAAQ;EACtB,MAAM,MAAM,OAAO,KAAK,UAAU,IAAI;EACtC,MAAM,MAAM,OAAO,KAAK,UAAU,IAAI,OAAO;EAC7C,MAAM,KAAK,OAAO,KAAK,YAAY,WAAW,YAAY,KAAK,QAAQ,GAAG;EAC1E,MAAM,SAAS,KAAK,YAAY,UAAa,OAAO,KAAK,WAAW,YAAY,OAAO,OAAO,KAAK,SAAS,KAAK,OAAO,GAClH,KAAK,QAAQ,KAAK,UAClB;AACN,MAAI,QAAQ,KAAK,QAAQ,OAAO,qBAAqB,OAAO,UAAa,WAAW,OAChF,QAAO;AACX,SAAO,YAAY,QAAQ,KAAK,KAAK,IAAI,OAAO;;CAEpD,YAAY,MAAM,MAAM;EACpB,MAAM,MAAM,MAAM,KAAK,QAAQ;EAC/B,MAAM,MAAM,MAAM,KAAK,QAAQ;EAC/B,MAAM,OAAO,MAAM,KAAK,iBAAiB;EACzC,MAAM,OAAO,MAAM,KAAK,iBAAiB;EACzC,MAAM,aAAa,MAAM,KAAK,WAAW;AACzC,MAAI;GAAC;GAAK;GAAK;GAAM;GAAM;GAAW,CAAC,OAAO,MAAM,MAAM,OAAU,CAChE,QAAO;EACX,MAAM,MAAM,OAAO;AACnB,SAAO,YAAY,MAAM,OAAO,CAAC,KAAK,OAAO,KAAK,QAAQ,CAAC,KAAK,QAAQ,KAAK,WAAW;;CAE5F,YAAY,MAAM,MAAM,QAAQ;EAC5B,MAAM,WAAW,cAAc,OAAO,MAAM,KAAK,OAAO,OAAU;EAElE,MAAM,OAAO,KAAK,WAAW,MAAM,MAAM,WAAY,SAAS,eAAe,cAAe,WAAW;AACvG,MAAI,SAAS,UAAa,SACtB,QAAO;EACX,MAAM,QAAQ,SAAS,SAAY,EAAE,GAAG,CAAC,KAAK;AAC9C,MAAI,KAAK,kBAAkB,OACvB,OAAM,KAAK,mBAAmB,KAAK,MAAM,KAAK,eAAe,KAAK,CAAC,CAAC;EACxE,MAAM,gBAAgB,OAAO,KAAK,cAAc;EAChD,MAAM,gBAAgB,OAAO,KAAK,cAAc;AAChD,MAAI,kBAAkB,UAAa,kBAAkB,OACjD,OAAM,KAAK,mBAAmB,iBAAiB,GAAG,iBAAiB,OAAO,kBAAkB,CAAC;EAEjG,MAAM,oBAAoB,EAAE;EAC5B,MAAM,mBAAmB,EAAE;AAC3B,MAAI,KAAK,UAAU,KAAK;AACpB,QAAK,MAAM,CAAC,GAAG,SAAS,QAAQ,KAAK,kBAAkB,CACnD,KAAI,MAAM,QAAQ,KAAK,CACnB,mBAAkB,KAAK,CAAC,GAAG,KAAK,CAAC;AACzC,QAAK,MAAM,CAAC,GAAG,MAAM,QAAQ,KAAK,iBAAiB,CAC/C,kBAAiB,KAAK,CAAC,GAAG,KAAK,MAAM,GAAG,KAAK,CAAC,CAAC;;AAEvD,OAAK,MAAM,CAAC,GAAG,MAAM,QAAQ,KAAK,aAAa,CAC3C,KAAI,MAAM,QAAQ,EAAE,CAChB,mBAAkB,KAAK,CAAC,GAAG,EAAE,CAAC;MAE9B,kBAAiB,KAAK,CAAC,GAAG,KAAK,MAAM,GAAG,KAAK,CAAC,CAAC;AAEvD,MAAI,kBAAkB,SAAS,EAC3B,OAAM,KAAK,uBAAuB,kBAAkB,CAAC;AACzD,MAAI,iBAAiB,SAAS,EAC1B,OAAM,KAAK,sBAAsB,iBAAiB,CAAC;AACvD,MAAI,MAAM,WAAW,EACjB,QAAO,SAAS,YAAY;AAChC,SAAO,YAAY,IAAI,MAAM,EAAE,OAAO;;CAE1C,WAAW,MAAM,MAAM,OAAO;EAC1B,MAAM,aAAa,eAAe,KAAK,WAAW,GAAG,KAAK,aAAa,EAAE;EACzE,MAAM,WAAW,MAAM,QAAQ,KAAK,SAAS,GAAG,KAAK,SAAS,QAAQ,MAAM,OAAO,MAAM,SAAS,GAAG,EAAE;EACvG,MAAM,WAAW,eAAe,KAAK,kBAAkB,GAAG,KAAK,oBAAoB,EAAE;EACrF,MAAM,aAAa,KAAK;EACxB,MAAM,OAAO,OAAO,KAAK,WAAW;EACpC,MAAM,cAAc,OAAO,KAAK,SAAS;AACzC,MAAI,KAAK,SAAS,SAAS,SAAS,YAAY,WAAW,MACtD,eAAe,UAAa,eAAe,MAC5C;EAIJ,MAAMC,YAAU,EAAE;AAClB,OAAK,MAAM,KAAK,MAAM;GAClB,MAAM,QAAQ,KAAK,MAAM,WAAW,IAAI,KAAK;GAC7C,MAAMC,SAAO,OAAO,MAAM;GAC1B,MAAM,SAASA,SAAO,MAAM,MAAM,SAAS,SAAS,EAAE,GAAG,WAAW,MAAM,KAAK,OAAO,YAAY,YAAY;AAC9G,aAAQ,KAAK,GAAGA,WAAS,SAAY,QAAQA,OAAK,IAAI,MAAM;;EAEhE,MAAM,gBAAgB,SAAS,QAAQ,MAAM,CAAC,OAAO,OAAO,YAAY,EAAE,CAAC;EAC3E,MAAM,OAAO,YAAY,KAAK,MAAM,CAAC,YAAY,EAAE,EAAE,KAAK,MAAM,SAAS,IAAI,KAAK,CAAC,CAAC;EACpF,MAAM,QAAQ,eAAe,UAAa,eAAe,OAAO,SAAY,KAAK,MAAM,YAAY,KAAK;AACxG,MAAI,KAAK,WAAW,KAAK,cAAc,WAAW,MAAM,UAAU,UAAa,eAAe,QAAQ;GAClG,MAAM,gBAAgB,KAAK,QAAQ,MAAM,SAAS,SAAS,EAAE,CAAC,CAAC;AAC/D,UAAO,eAAeD,WAAS,eAAe,eAAe,OAAO,MAAM;;AAE9E,SAAO,WAAWA,WAAS,MAAM,eAAe,MAAM,OAAO,MAAM;;CAEvE,WAAW,MAAM,MAAM,QAAQ;EAC3B,IAAI,SAAS,EAAE;EACf,IAAI;AACJ,MAAI,MAAM,QAAQ,KAAK,MAAM,EAAE;AAC3B,YAAS,KAAK;AACd,UAAO,KAAK;SAEX;AACD,OAAI,KAAK,UAAU,OAAO,MAAM,QAAQ,KAAK,YAAY,CACrD,UAAS,KAAK;AAClB,UAAO,KAAK;;EAEhB,MAAM,eAAe,OAAO,KAAK,MAAM,KAAK,MAAM,GAAG,KAAK,CAAC;EAC3D,MAAM,YAAY,SAAS,UAAa,SAAS,OAAO,SAAY,KAAK,MAAM,MAAM,KAAK;EAC1F,MAAM,WAAW,OAAO,KAAK,SAAS;EACtC,MAAM,WAAW,OAAO,KAAK,SAAS;AACtC,MAAI,KAAK,aAAa,UAClB,KAAK,gBAAgB,SACpB,aAAa,SAAS,KAAK,cAAc,QAG1C,QAAO,UADO,SAAS,eAAe,aACd,YAAY,GAAG,YAAY,OAAO,mBAAmB,cAAc,UAAU;EAEzG,MAAM,QAAQ,EAAE;AAChB,MAAI,aAAa,SAAS,KAAK,cAAc,OACzC,OAAM,KAAK,WAAW,cAAc,UAAU,CAAC;AACnD,MAAI,aAAa,UAAa,aAAa,OACvC,OAAM,KAAK,YAAY,YAAY,GAAG,YAAY,OAAO,kBAAkB,CAAC;AAEhF,MAAI,KAAK,aAAa,QAAW;GAC7B,MAAM,MAAM,KAAK,UAAU,MAAM,IAAK,OAAO,KAAK,YAAY,IAAI;GAClE,MAAM,MAAM,KAAK,UAAU,MAAM,OAAO,oBAAqB,OAAO,KAAK,YAAY,IAAI,OAAO;AAChG,SAAM,KAAK,cAAc,KAAK,MAAM,KAAK,UAAU,KAAK,EAAE,KAAK,IAAI,CAAC;;AAExE,MAAI,KAAK,gBAAgB,KACrB,OAAM,KAAK,YAAY;AAC3B,MAAI,MAAM,WAAW,EACjB,QAAO,SAAS,WAAW;AAC/B,SAAO,WAAW,IAAI,MAAM,EAAE,OAAO;;;CAGzC,WAAW,MAAM,MAAM;AACnB,MAAI,SAAS,KACT,QAAO;AACX,MAAI,SAAS,MACT,QAAO;AACX,MAAI,CAAC,eAAe,KAAK,CACrB,OAAM,IAAI,MAAM,gDAAgD,KAAK,UAAU,KAAK,GAAG;EAC3F,MAAM,SAAS,KAAK,gBAAgB,IAAI,KAAK;AAC7C,MAAI,WAAW,OACX,QAAO;EACX,MAAM,OAAO,EAAE,OAAO,QAAW;AACjC,OAAK,gBAAgB,IAAI,MAAM,mBAAmB,KAAK,CAAC;EACxD,MAAM,QAAQ,KAAK,gBAAgB,MAAM,KAAK,EAAE,QAAQ,MAAM,KAAK,CAAC;AACpE,OAAK,QAAQ;AACb,OAAK,gBAAgB,IAAI,MAAM,MAAM;AACrC,SAAO;;CAEX,gBAAgB,MAAM,MAAM;EACxB,MAAM,OAAO,EAAE;EACf,IAAI,YAAY;AAChB,OAAK,MAAM,KAAK,OAAO,KAAK,KAAK,CAC7B,KAAI,WAAW,IAAI,EAAE,CACjB,aAAY;MAEZ,MAAK,KAAK,KAAK;EAEvB,MAAM,QAAQ,KAAK,MAAM,MAAM,KAAK;EACpC,MAAM,QAAQ,EAAE;AAChB,MAAI,UACA,MAAK,gBAAgB,MAAM,MAAM,MAAM;EAC3C,MAAM,MAAM,MAAM,WAAW,IAAI,kBAAkB,MAAM,GAAG,YAAY,OAAO,MAAM;EACrF,MAAM,MAAM,KAAK,0BAA0B,UAAa,KAAK,qBAAqB,SAC5E,mBAAmB,IAAI,GACvB;AACN,SAAO,KAAK,WAAW,KAAK,EAAE,WAAW,MAAM,KAAK,GAAG,iBAAiB,KAAK,OAAO,MAAM,IAAI,GAAG;;CAErG,gBAAgB,MAAM,MAAM,OAAO;AAC/B,MAAI,KAAK,eAAe,UACpB,KAAK,sBAAsB,UAC3B,KAAK,yBAAyB,QAAW;GACzC,MAAM,QAAQ,QAAQ,KAAK,WAAW,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC,GAAG,KAAK,MAAM,GAAG,KAAK,CAAC,CAAC;GAChF,MAAM,OAAO,QAAQ,KAAK,kBAAkB,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC,YAAY,EAAE,EAAE,KAAK,MAAM,GAAG,KAAK,CAAC,CAAC;GACnG,MAAM,QAAQ,KAAK,yBAAyB,SAAY,SAAY,KAAK,MAAM,KAAK,sBAAsB,KAAK;AAC/G,SAAM,KAAK,eAAe,OAAO,MAAM,MAAM,CAAC;;AAElD,MAAI,KAAK,gBAAgB,UAAa,KAAK,UAAU,UAAa,KAAK,aAAa,QAAW;GAC3F,MAAM,SAAS,MAAM,QAAQ,KAAK,YAAY,GACxC,KAAK,cACL,MAAM,QAAQ,KAAK,MAAM,GACrB,KAAK,QACL,EAAE;GACZ,MAAM,OAAO,MAAM,QAAQ,KAAK,MAAM,GAAG,KAAK,kBAAkB,KAAK;AACrE,SAAM,KAAK,cAAc,OAAO,KAAK,MAAM,KAAK,MAAM,GAAG,KAAK,CAAC,EAAE,SAAS,SAAY,SAAY,KAAK,MAAM,MAAM,KAAK,EAAE,KAAK,aAAa,SAAY,SAAY,KAAK,MAAM,KAAK,UAAU,KAAK,EAAE,OAAO,KAAK,YAAY,IAAI,GAAG,OAAO,KAAK,YAAY,IAAI,OAAO,kBAAkB,CAAC;;AAE9R,MAAI,MAAM,QAAQ,KAAK,MAAM,CACzB,MAAK,MAAM,KAAK,KAAK,MACjB,OAAM,KAAK,KAAK,WAAW,GAAG,KAAK,CAAC;AAC5C,MAAI,MAAM,QAAQ,KAAK,MAAM,CACzB,OAAM,KAAK,YAAY,KAAK,MAAM,KAAK,MAAM,KAAK,WAAW,GAAG,KAAK,CAAC,EAAE,MAAM,CAAC;AACnF,MAAI,MAAM,QAAQ,KAAK,MAAM,CACzB,OAAM,KAAK,YAAY,KAAK,MAAM,KAAK,MAAM,KAAK,WAAW,GAAG,KAAK,CAAC,EAAE,KAAK,CAAC;AAClF,MAAI,KAAK,OAAO,QAAW;GACvB,MAAM,OAAO,KAAK,SAAS,SAAY,SAAY,KAAK,WAAW,KAAK,MAAM,KAAK;GACnF,MAAM,YAAY,KAAK,SAAS,SAAY,SAAY,KAAK,WAAW,KAAK,MAAM,KAAK;AACxF,SAAM,KAAK,WAAW,KAAK,WAAW,KAAK,IAAI,KAAK,EAAE,MAAM,UAAU,CAAC;;AAE3E,MAAI,OAAO,KAAK,SAAS,SACrB,OAAM,KAAK,KAAK,cAAc,KAAK,MAAM,KAAK,CAAC;AACnD,MAAI,OAAO,KAAK,gBAAgB,SAC5B,OAAM,KAAK,KAAK,qBAAqB,KAAK,aAAa,KAAK,CAAC;AACjE,OAAK,MAAM,CAAC,GAAG,MAAM,QAAQ,KAAK,iBAAiB,CAC/C,OAAM,KAAK,kBAAkB,GAAG,KAAK,WAAW,GAAG,KAAK,CAAC,CAAC;AAC9D,MAAI,KAAK,0BAA0B,OAC/B,OAAM,KAAK,sBAAsB,KAAK,MAAM,KAAK,uBAAuB,KAAK,CAAC,CAAC;AAEnF,MAAI,KAAK,qBAAqB,OAC1B,OAAM,KAAK,iBAAiB,KAAK,MAAM,KAAK,kBAAkB,KAAK,CAAC,CAAC;;CAE7E,cAAc,KAAK,MAAM;EACrB,MAAM,SAAS,KAAK,EAAE,QAAQ,KAAK,KAAK;EACxC,MAAM,QAAQ,KAAK,WAAW,OAAO,MAAM,OAAO,KAAK;AACvD,SAAO,KAAK,WAAW,OAAO,SAAS,OAAO,iBAAiB,KAAK,OAAO,OAAO,MAAM,MAAM,GAAG;;CAErG,qBAAqB,KAAK,MAAM;EAC5B,MAAM,WAAW,KAAK,UAAU,KAAK,KAAK;AAC1C,MAAI,aAAa,OACb,QAAO,KAAK,cAAc,KAAK,KAAK;EACxC,MAAM,EAAE,SAAS,SAAS;EAC1B,MAAM,WAAW,KAAK,WAAW,QAAQ,MAAM,QAAQ,KAAK;EAC5D,MAAM,SAAS,KAAK,cAAc,OAAO,MAAM,MAAM,KAAK,WAAW,MAAM,EAAE,CAAC;EAC9E,MAAM,QAAQ,KAAK;AACnB,UAAQ,GAAG,MAAM;AACb,QAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK;IACnC,MAAM,QAAQ,OAAO,MAAM,GAAG;AAC9B,QAAI,UAAU,KACV,QAAO,MAAM,GAAG,EAAE;;AAE1B,UAAO,SAAS,GAAG,EAAE;;;;;AAKjC,MAAa,mBAAmB,IAAI,IAAI;CACpC;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACH,CAAC;AAEF,MAAM,gBAAgB;CAClB;CACA;CACA;CACA;CACA;CACA;CACH;AAED,MAAM,aAAa,IAAI,IAAI;CACvB;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACA;CACH,CAAC;;AAEF,SAAS,WAAW,UAAU,YAAY;CACtC,MAAM,SAAS,EAAE;AACjB,MAAK,MAAM,UAAU,UAAU;AAC3B,MAAI,CAAC,eAAe,OAAO,IAAI,CAAC,OAAO,OAAO,QAAQ,QAAQ,CAC1D,QAAO;AACX,OAAK,MAAM,KAAK,OAAO,KAAK,OAAO,CAC/B,KAAI,MAAM,WAAW,CAAC,iBAAiB,IAAI,EAAE,CACzC,QAAO;AACf,MAAI,OAAO,OAAO,UAAU,YAAY,OAAO,UAAU,KACrD,QAAO;AACX,MAAI,cAAc,OAAO,SAAS,OAAO,MAAM,CAC3C,QAAO;AACX,SAAO,KAAK,OAAO,MAAM;;AAE7B,QAAO,UAAU,OAAO;;;AAG5B,SAAS,MAAM,QAAQ;CACnB,MAAM,QAAQ,EAAE;CAChB,MAAM,OAAO,EAAE;AACf,MAAK,MAAM,SAAS,QAAQ;EACxB,MAAM,OAAO,WAAW,IAAI,MAAM;AAClC,MAAI,SAAS,OACT,MAAK,KAAK,MAAM;MAEhB,OAAM,KAAK,KAAK;;AAExB,QAAO,MAAM,WAAW,IAAI,SAAS,KAAK,GAAG,eAAe,SAAS,MAAM,EAAE,KAAK;;AAEtF,MAAM,aAAa,IAAI,IAAI,CAAC,GAAG,YAAY,CAAC,KAAK,CAAC,MAAM,WAAW,CAAC,OAAO,KAAK,CAAC,CAAC;AAElF,SAAS,MAAM,QAAQ,KAAK;CACxB,MAAM,aAAa,OAAO;AAC1B,KAAI,OAAO,SAAS,YAAY,CAAC,MAAM,QAAQ,OAAO,SAAS,IAAI,CAAC,OAAO,SAAS,SAAS,IAAI,CAC7F,QAAO;CACX,MAAM,MAAM,eAAe,WAAW,GAAG,WAAW,OAAO;AAC3D,KAAI,CAAC,eAAe,IAAI,IAAI,CAAC,OAAO,OAAO,KAAK,QAAQ,CACpD,QAAO;AACX,QAAO,OAAO,IAAI,UAAU,YAAY,IAAI,UAAU,OAAO,SAAY,IAAI;;;AAGjF,SAAS,MAAM,OAAO;AAClB,QAAO,OAAO,UAAU,YAAY,OAAO,UAAU,WAAW,QAAQ;;AAE5E,SAAS,OAAO,OAAO;AACnB,QAAO,OAAO,UAAU,WAAW,QAAQ;;AAE/C,SAAS,QAAQ,OAAO;AACpB,QAAO,eAAe,MAAM,GAAG,OAAO,QAAQ,MAAM,GAAG,EAAE;;;;;;AC7hB7D,IAAa,YAAb,MAAuB;CACnB;CACA;;;;;CAKA,OAAO;CACP,YAAY,YAAU,QAAQ;AAC1B,OAAK,IAAIE;AACT,OAAK,SAAS;AACd,aAAS,MAAM;;;CAGnB,OAAO,OAAO;EACV,MAAM,MAAM,EAAE;AACd,MAAI;AACA,QAAK,KAAK,KAAK,QAAQ,KAAK,EAAE,EAAE,UAAU,OAAO,IAAI,IAAI;YAErD;AACJ,QAAK,OAAO;;AAEhB,MAAI,IAAI,WAAW,EACf,KAAI,KAAK;GAAE,MAAM;GAAI,SAAS;GAAU,SAAS;GAAW,CAAC;AACjE,SAAO;;CAEX,GAAG,MAAM,MAAM,GAAG;AACd,SAAO,KAAK,EAAE,MAAM,MAAM,KAAK,CAAC,EAAE;;CAGtC,KAAK,MAAM,MAAM,GAAG,MAAM,KAAK;AAC3B,MAAI,SAAS,KACT;AACJ,MAAI,SAAS,OAAO;AAChB,OAAI,KAAK;IAAE;IAAM,SAAS;IAAS,SAAS;IAA4B,CAAC;AACzE;;AAEJ,MAAI,CAAC,eAAe,KAAK,CACrB;EACJ,MAAM,IAAI,KAAK,EAAE,EAAE,QAAQ,MAAM,KAAK;AACtC,MAAI,KAAK,GAAG,MAAM,GAAG,EAAE,CACnB;EACJ,MAAM,QAAQ,IAAI;EAClB,MAAM,QAAQ,SAAS,SAAS,KAAK,SAAS;AAC1C,OAAI,KAAK;IAAE,MAAM;IAAI;IAAS;IAAS,CAAC;;AAE5C,MAAI,KAAK,EAAE,UAAU,OAAO,OAAO,KAAK,SAAS,UAAU;AACvD,QAAK,QAAQ,KAAK,MAAM,GAAG,GAAG,MAAM,IAAI;AACxC;;AAEJ,MAAI,KAAK,SAAS,QAAW;GACzB,MAAM,QAAQ,MAAM,QAAQ,KAAK,KAAK,GAAG,KAAK,OAAO,CAAC,KAAK,KAAK;AAEhE,OAAI,CADW,MAAM,KAAK,OAAO,OAAO,MAAM,WAAW,YAAY,IAAI,EAAE,GAAG,WAAc,MAAM,CACtF,MAAM,UAAU,MAAM,EAAE,CAAC,EAAE;AACnC,SAAK,QAAQ,YAAY,MAAM,KAAK,OAAO,CAAC,QAAQ,SAAS,EAAE,GAAG;AAClE;;;AAGR,MAAI,MAAM,QAAQ,KAAK,KAAK,IAAI,CAAC,UAAU,KAAK,KAAK,CAAC,EAAE,CACpD,MAAK,QAAQ,mBAAmB,WAAW,KAAK,KAAK,GAAG;AAC5D,MAAI,OAAO,OAAO,MAAM,QAAQ,IAAI,CAAC,WAAW,KAAK,MAAM,CAAC,EAAE,CAC1D,MAAK,SAAS,YAAY,KAAK,UAAU,KAAK,MAAM,GAAG;AAC3D,MAAI,OAAO,MAAM,YAAY,KAAK,SAAS,QACvC,MAAK,WAAW,MAAM,GAAG,KAAK;AAClC,MAAI,aAAa,cAAc,KAAK,SAAS,QACzC,MAAK,UAAU,MAAM,GAAG,KAAK;AACjC,MAAI,OAAO,MAAM,YAAY,OAAO,MAAM,SACtC,MAAK,WAAW,MAAM,GAAG,KAAK;AAClC,MAAI,SAAS,EAAE,CACX,MAAK,WAAW,MAAM,GAAG,GAAG,MAAM,KAAK,KAAK;AAChD,MAAI,MAAM,QAAQ,EAAE,CAChB,MAAK,UAAU,MAAM,GAAG,GAAG,MAAM,KAAK,KAAK;AAC/C,MAAI,MAAM,QAAQ,KAAK,MAAM,CACzB,MAAK,MAAM,KAAK,KAAK,MACjB,MAAK,KAAK,GAAG,GAAG,GAAG,MAAM,IAAI;AACrC,MAAI,MAAM,QAAQ,KAAK,MAAM,CACzB,MAAK,UAAU,KAAK,OAAO,GAAG,GAAG,MAAM,KAAK,MAAM;AACtD,MAAI,MAAM,QAAQ,KAAK,MAAM,CACzB,MAAK,UAAU,KAAK,OAAO,GAAG,GAAG,MAAM,KAAK,KAAK;AACrD,MAAI,KAAK,QAAQ,UAAa,KAAK,GAAG,KAAK,KAAK,GAAG,EAAE,CACjD,MAAK,OAAO,mCAAmC;AACnD,MAAI,KAAK,OAAO,QAAW;GACvB,MAAM,SAAS,KAAK,GAAG,KAAK,IAAI,GAAG,EAAE,GAAG,KAAK,OAAO,KAAK;AACzD,OAAI,WAAW,OACX,MAAK,KAAK,QAAQ,GAAG,GAAG,MAAM,IAAI;;AAE1C,MAAI,OAAO,KAAK,SAAS,SACrB,MAAK,QAAQ,KAAK,MAAM,GAAG,GAAG,MAAM,IAAI;AAC5C,MAAI,IAAI,WAAW,UAAU,KAAK,0BAA0B,UAAa,KAAK,qBAAqB,QAC/F,MAAK,gBAAgB,MAAM,GAAG,GAAG,MAAM,IAAI;AAE/C,MAAI,IAAI,WAAW,SAAS,OAAO,KAAK,gBAAgB,SACpD,MAAK,eAAe,mDAAmD;;CAG/E,QAAQ,KAAK,MAAM,GAAG,MAAM,KAAK;EAC7B,MAAM,SAAS,KAAK,EAAE,EAAE,QAAQ,KAAK,KAAK;AAC1C,MAAI,OAAO,SAAS,SAAS,KAAK,EAAE,EAAE,aAAa,KAAK,KAAK,EAAE;AAC3D,OAAI,KAAK;IAAE;IAAM,SAAS;IAAQ,SAAS,wBAAwB;IAAO,CAAC;AAC3E;;AAEJ,MAAI,CAAC,eAAe,OAAO,KAAK,IAAI,OAAO,MAAM,YAAY,MAAM,MAAM;AACrE,QAAK,KAAK,OAAO,MAAM,OAAO,MAAM,GAAG,MAAM,IAAI;AACjD;;AAEJ,OAAK,yBAAS,IAAI,KAAK;EACvB,IAAI,SAAS,KAAK,KAAK,IAAI,OAAO,KAAK;EACvC,MAAM,QAAQ,QAAQ,IAAI,EAAE;AAC5B,MAAI,UAAU,UAAa,MAAM,SAAS,MAAM;AAC5C,OAAI,KAAK,GAAG,MAAM,OAAO;AACzB;;EAEJ,MAAM,SAAS,EAAE;AACjB,OAAK,KAAK,OAAO,MAAM,OAAO,MAAM,GAAG,MAAM,OAAO;AACpD,MAAI,WAAW,QAAW;AACtB,4BAAS,IAAI,KAAK;AAClB,QAAK,KAAK,IAAI,OAAO,MAAM,OAAO;;AAEtC,SAAO,IAAI,GAAG;GAAE;GAAM;GAAQ,CAAC;AAC/B,MAAI,KAAK,GAAG,OAAO;;CAEvB,WAAW,MAAM,GAAG,MAAM;EACtB,MAAM,IAAI,WAAW,EAAE;AACvB,MAAI,OAAO,KAAK,cAAc,YAAY,IAAI,KAAK,UAC/C,MAAK,aAAa,qBAAqB,KAAK,UAAU,aAAa;AAEvE,MAAI,OAAO,KAAK,cAAc,YAAY,IAAI,KAAK,UAC/C,MAAK,aAAa,oBAAoB,KAAK,UAAU,aAAa;AAEtE,MAAI,OAAO,KAAK,YAAY,YAAY,CAAC,YAAY,KAAK,QAAQ,CAAC,KAAK,EAAE,CACtE,MAAK,WAAW,qBAAqB,KAAK,UAAU;EAExD,MAAM,UAAU,KAAK,EAAE;EACvB,MAAM,SAAS,YAAY,UAAa,OAAO,KAAK,WAAW,YAAY,OAAO,OAAO,SAAS,KAAK,OAAO,GACxG,QAAQ,KAAK,UACb;AACN,MAAI,WAAW,UAAa,CAAC,OAAO,EAAE,CAClC,MAAK,UAAU,mBAAmB,KAAK,SAAS;;CAExD,UAAU,MAAM,GAAG,MAAM;AACrB,MAAI,OAAO,KAAK,cAAc,YAAY,EAAE,SAAS,KAAK,UACtD,MAAK,aAAa,qBAAqB,KAAK,UAAU,QAAQ;AAElE,MAAI,OAAO,KAAK,cAAc,YAAY,EAAE,SAAS,KAAK,UACtD,MAAK,aAAa,oBAAoB,KAAK,UAAU,QAAQ;;CAIrE,WAAW,MAAM,GAAG,MAAM;EACtB,MAAM,EAAE,SAAS,SAAS,kBAAkB,kBAAkB,eAAe;AAC7E,MAAI,QAAQ,QAAQ,IAAI,IAAI,QACxB,MAAK,WAAW,eAAe,UAAU;AAC7C,MAAI,QAAQ,QAAQ,IAAI,IAAI,QACxB,MAAK,WAAW,eAAe,UAAU;AAC7C,MAAI,QAAQ,iBAAiB,IAAI,KAAK,iBAClC,MAAK,oBAAoB,cAAc,mBAAmB;AAC9D,MAAI,QAAQ,iBAAiB,IAAI,KAAK,iBAClC,MAAK,oBAAoB,cAAc,mBAAmB;AAC9D,MAAI,QAAQ,WAAW,IAAI,CAAC,WAAW,GAAG,WAAW,CACjD,MAAK,cAAc,0BAA0B,aAAa;;CAElE,WAAW,MAAM,GAAG,GAAG,MAAM,KAAK,MAAM;EACpC,MAAM,aAAa,eAAe,KAAK,WAAW,GAAG,KAAK,aAAa,EAAE;EACzE,MAAM,WAAW,MAAM,QAAQ,KAAK,SAAS,GAAG,KAAK,WAAW,EAAE;AAClE,OAAK,MAAM,KAAK,UAAU;AACtB,OAAI,OAAO,MAAM,SACb;GAEJ,MAAM,WAAW,EAAE,OAAO,UAAa,OAAO,OAAO,YAAY,EAAE,IAAI,KAAK,GAAG,WAAW,IAAI,GAAG,OAAU;AAC3G,OAAI,CAAC,OAAO,OAAO,GAAG,EAAE,IAAK,EAAE,OAAO,UAAa,CAAC,SAChD,MAAK,YAAY,WAAW,QAAQ,MAAM,EAAE,CAAC;;AAErD,OAAK,MAAM,KAAK,OAAO,KAAK,WAAW,CACnC,KAAI,OAAO,OAAO,GAAG,EAAE,IAAI,EAAE,OAAO,OAChC,MAAK,KAAK,WAAW,IAAI,GAAG,EAAE,IAAI,QAAQ,MAAM,EAAE,EAAE,IAAI;EAEhE,MAAM,WAAW,eAAe,KAAK,kBAAkB,GAAG,OAAO,QAAQ,KAAK,kBAAkB,GAAG,EAAE;AACrG,OAAK,MAAM,KAAK,OAAO,KAAK,EAAE,EAAE;GAC5B,IAAI,UAAU,OAAO,OAAO,YAAY,EAAE;AAC1C,QAAK,MAAM,CAAC,GAAG,MAAM,SACjB,KAAI,YAAY,EAAE,CAAC,KAAK,EAAE,EAAE;AACxB,cAAU;AACV,SAAK,KAAK,GAAG,GAAG,EAAE,IAAI,QAAQ,MAAM,EAAE,EAAE,IAAI;;AAGpD,OAAI,CAAC,WAAW,KAAK,yBAAyB,OAC1C,KAAI,KAAK,yBAAyB,MAC9B,MAAK,wBAAwB,iBAAiB,QAAQ,MAAM,EAAE,CAAC;OAE/D,MAAK,KAAK,KAAK,sBAAsB,GAAG,EAAE,IAAI,QAAQ,MAAM,EAAE,EAAE,IAAI;AAE5E,OAAI,KAAK,kBAAkB,UAAa,CAAC,KAAK,GAAG,KAAK,eAAe,GAAG,EAAE,CACtE,MAAK,iBAAiB,yBAAyB,QAAQ,MAAM,EAAE,CAAC;;EAGxE,MAAM,QAAQ,OAAO,KAAK,EAAE,CAAC;AAC7B,MAAI,OAAO,KAAK,kBAAkB,YAAY,QAAQ,KAAK,cACvD,MAAK,iBAAiB,qBAAqB,KAAK,cAAc,aAAa;AAE/E,MAAI,OAAO,KAAK,kBAAkB,YAAY,QAAQ,KAAK,cACvD,MAAK,iBAAiB,oBAAoB,KAAK,cAAc,aAAa;EAE9E,MAAM,eAAe;GACjB,GAAI,KAAK,EAAE,UAAU,OAAO,CAAC,eAAe,KAAK,kBAAkB,GAAG,EAAE,GAAG,KAAK;GAChF,GAAI,eAAe,KAAK,aAAa,GAAG,KAAK,eAAe,EAAE;GACjE;AACD,OAAK,MAAM,CAAC,GAAG,MAAM,OAAO,QAAQ,aAAa,EAAE;AAC/C,OAAI,CAAC,OAAO,OAAO,GAAG,EAAE,CACpB;AACJ,OAAI,CAAC,MAAM,QAAQ,EAAE,CACjB,MAAK,KAAK,GAAG,GAAG,GAAG,MAAM,IAAI;OAE7B,MAAK,MAAM,KAAK,EACZ,KAAI,CAAC,OAAO,OAAO,GAAG,EAAE,CACpB,MAAK,qBAAqB,iBAAiB,EAAE,cAAc,QAAQ,MAAM,EAAE,CAAC;;AAE5F,MAAI,KAAK,EAAE,UAAU,OAAO,eAAe,KAAK,iBAAiB,EAC7D;QAAK,MAAM,CAAC,GAAG,MAAM,OAAO,QAAQ,KAAK,iBAAiB,CACtD,KAAI,OAAO,OAAO,GAAG,EAAE,CACnB,MAAK,KAAK,GAAG,GAAG,GAAG,MAAM,IAAI;;;CAG7C,UAAU,MAAM,GAAG,GAAG,MAAM,KAAK,MAAM;EACnC,IAAI,SAAS,EAAE;EACf,IAAI;AACJ,MAAI,MAAM,QAAQ,KAAK,MAAM,EAAE;AAC3B,YAAS,KAAK;AACd,UAAO,KAAK;SAEX;AACD,OAAI,KAAK,EAAE,UAAU,OAAO,MAAM,QAAQ,KAAK,YAAY,CACvD,UAAS,KAAK;AAClB,UAAO,KAAK;;AAEhB,OAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;GAC/B,MAAM,IAAI,IAAI,OAAO,SAAS,OAAO,KAAK;AAC1C,OAAI,MAAM,OACN,MAAK,KAAK,GAAG,GAAG,EAAE,IAAI,GAAG,KAAK,GAAG,KAAK,IAAI;;AAElD,MAAI,OAAO,KAAK,aAAa,YAAY,EAAE,SAAS,KAAK,SACrD,MAAK,YAAY,qBAAqB,KAAK,SAAS,QAAQ;AAEhE,MAAI,OAAO,KAAK,aAAa,YAAY,EAAE,SAAS,KAAK,SACrD,MAAK,YAAY,oBAAoB,KAAK,SAAS,QAAQ;AAE/D,MAAI,KAAK,gBAAgB,QAAQ,CAAC,YAAY,EAAE,CAC5C,MAAK,eAAe,wBAAwB;AAChD,MAAI,KAAK,aAAa,QAAW;GAC7B,MAAM,SAAS,KAAK,EAAE,UAAU;GAChC,MAAM,MAAM,UAAU,OAAO,KAAK,gBAAgB,WAAW,IAAI,KAAK;GACtE,MAAM,MAAM,UAAU,OAAO,KAAK,gBAAgB,WAAW,OAAO,oBAAoB,KAAK;AAC7F,OAAI,CAAC,cAAc,KAAK,EAAE,MAAM,KAAK,UAAU,EAAE,EAAE,KAAK,IAAI,CAAC,EAAE,CAC3D,MAAK,YAAY,gBAAgB,KAAK,IAAI,CAAC;;;CAIvD,UAAU,UAAU,GAAG,GAAG,MAAM,KAAK,YAAY;EAC7C,MAAM,UAAU,SAAS,QAAQ,MAAM,KAAK,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC;AACzD,MAAI,YAAY,KAAM,CAAC,cAAc,UAAU,EAC3C;EACJ,MAAM,UAAU,aAAa,UAAU;AACvC,MAAI,UAAU,GAAG;AACb,OAAI,KAAK;IAAE;IAAM;IAAS,SAAS;IAAqC,CAAC;AACzE;;EAGJ,MAAM,MAAM,KAAK,MAAM,UAAU,EAAE;AACnC,MAAI,QAAQ,UAAa,SAAS,EAAE,EAAE;GAClC,MAAM,IAAI,IAAI,OAAO,QAAQ,EAAE,IAAI,KAAK;AACxC,OAAI,IAAI,EACJ,KAAI,KAAK;IACL,MAAM,QAAQ,MAAM,IAAI,IAAI;IAC5B;IACA,SAAS,mBAAmB,WAAW,IAAI,OAAO;IACrD,CAAC;OAEF,MAAK,KAAK,SAAS,IAAI,GAAG,GAAG,MAAM,IAAI;AAC3C;;EAIJ,IAAI;AACJ,OAAK,MAAM,KAAK,UAAU;GACtB,MAAM,SAAS,EAAE;AACjB,QAAK,KAAK,GAAG,GAAG,GAAG,MAAM,OAAO;AAChC,OAAI,OAAO,WAAW,EAClB;GACJ,MAAM,WAAW,SAAS,EAAE,GAAG,KAAK,aAAa,GAAG,GAAG,EAAE,GAAG;AAI5D,OAHe,SAAS,UACpB,WAAW,KAAK,YACf,aAAa,KAAK,YAAY,OAAO,GAAG,KAAK,SAAS,KAAK,OAAO,GAAG,KAAK,OAE3E,QAAO;IAAE;IAAQ;IAAU;;AAEnC,MAAI,KAAK,GAAI,MAAM,UAAU,CAAC;GAAE;GAAM;GAAS,SAAS;GAA0B,CAAC,CAAE;;;CAGzF,aAAa,GAAG,GAAG,GAAG;EAClB,MAAM,OAAO,eAAe,EAAE,IAAI,OAAO,EAAE,SAAS,WAAW,KAAK,EAAE,EAAE,QAAQ,EAAE,MAAM,KAAK,EAAE,EAAE,QAAQ,GAAG,EAAE,CAAC,CAAC,OAAO;EACvH,MAAM,aAAa,eAAe,KAAK,IAAI,eAAe,KAAK,WAAW,GAAG,KAAK,aAAa,EAAE;AACjG,SAAO,OAAO,KAAK,EAAE,CAAC,QAAQ,MAAM,OAAO,OAAO,YAAY,EAAE,CAAC,CAAC;;CAEtE,MAAM,UAAU,GAAG;EACf,MAAM,WAAW,SAAS,KAAK,MAAM,eAAe,EAAE,IAAI,OAAO,EAAE,SAAS,WAAW,KAAK,EAAE,EAAE,QAAQ,EAAE,MAAM,KAAK,EAAE,EAAE,QAAQ,GAAG,EAAE,CAAC,CAAC,OAAO,EAAE;EACjJ,MAAM,QAAQ,SAAS;AACvB,MAAI,CAAC,eAAe,MAAM,IAAI,CAAC,eAAe,MAAM,WAAW,CAC3D,QAAO;AACX,OAAK,MAAM,OAAO,OAAO,KAAK,MAAM,WAAW,EAAE;GAC7C,MAAM,SAAS,SAAS,KAAK,MAAM;IAC/B,MAAM,MAAM,eAAe,EAAE,IAAI,eAAe,EAAE,WAAW,GAAG,EAAE,WAAW,OAAO;AACpF,WAAO,eAAe,IAAI,GAAG,IAAI,QAAQ;KAC3C;AAEF,OADkB,OAAO,OAAO,MAAM,MAAM,WAAc,OAAO,MAAM,YAAY,MAAM,MAAM,IAC9E,IAAI,IAAI,OAAO,CAAC,SAAS,OAAO,OAC7C,QAAO;IAAE;IAAK;IAAQ;;;CAIlC,gBAAgB,MAAM,GAAG,GAAG,MAAM,KAAK;EAEnC,MAAM,EAAE,gDAAuB,sCAAkB,KAAK,IAAK,GAAG,SAAS;EACvE,MAAM,IAAI,gBAAgB;AAC1B,OAAK,EAAE,WAAW,MAAM,EAAE,CAAC,GAAG,EAAE;AAChC,MAAI,SAAS,EAAE,IAAIC,4BAA0B,UAAa,CAAC,EAAE,SACzD,MAAK,MAAM,KAAK,OAAO,KAAK,EAAE,EAAE;AAC5B,OAAI,EAAE,OAAO,IAAI,EAAE,CACf;AACJ,OAAIA,4BAA0B,MAC1B,KAAI,KAAK;IAAE,MAAM,QAAQ,MAAM,EAAE;IAAE,SAAS;IAAyB,SAAS;IAAiB,CAAC;OAGhG,MAAK,KAAKA,yBAAuB,GAAG,EAAE,IAAI,QAAQ,MAAM,EAAE,EAAE,IAAI;;AAG5E,MAAI,MAAM,QAAQ,EAAE,IAAIC,uBAAqB,UAAa,CAAC,EAAE,SACzD,MAAK,IAAI,IAAI,EAAE,OAAO,IAAI,EAAE,QAAQ,KAAK;AACrC,OAAI,EAAE,SAAS,IAAI,EAAE,CACjB;AACJ,OAAIA,uBAAqB,MACrB,KAAI,KAAK;IAAE,MAAM,GAAG,KAAK,GAAG;IAAK,SAAS;IAAoB,SAAS;IAAmB,CAAC;OAG3F,MAAK,KAAKA,oBAAkB,GAAG,EAAE,IAAI,GAAG,KAAK,GAAG,KAAK,IAAI;;;;AAM7E,MAAM,gBAAgB;;AAEtB,SAAS,WAAW,QAAQ;AACxB,KAAI,OAAO,UAAU,cACjB,QAAO,KAAK,UAAU,OAAO;AAEjC,QAAO,GADQ,KAAK,UAAU,OAAO,MAAM,GAAG,cAAc,CAAC,CAC5C,MAAM,GAAG,GAAG,CAAC,YAAY,OAAO,SAAS,cAAc;;AAE5E,SAAS,gBAAgB,KAAK,KAAK;AAC/B,KAAI,QAAQ,OAAO,kBACf,QAAO,qBAAqB,IAAI,YAAY,QAAQ,IAAI,SAAS;AACrE,KAAI,QAAQ,EACR,QAAO,oBAAoB,IAAI,YAAY,QAAQ,IAAI,SAAS;AACpE,QAAO,oBAAoB,IAAI,OAAO,IAAI;;AAE9C,SAAS,QAAQ,OAAO;AACpB,QAAO,OAAO,UAAU,YAAY,OAAO,UAAU;;AAEzD,SAAS,QAAQ,MAAM,KAAK;AACxB,QAAO,GAAG,KAAK,GAAG,OAAO,IAAI,CAAC,QAAQ,MAAM,KAAK,CAAC,QAAQ,OAAO,KAAK;;AAE1E,SAAS,SAAS,GAAG;AACjB,KAAI,MAAM,KACN,QAAO;AACX,KAAI,MAAM,QAAQ,EAAE,CAChB,QAAO;AACX,KAAI,aAAa,WACb,QAAO;AACX,KAAI,OAAO,MAAM,SACb,QAAO;AACX,KAAI,OAAO,MAAM,YAAY,OAAO,UAAU,EAAE,CAC5C,QAAO;AACX,KAAI,OAAO,MAAM,YAAY,CAAC,OAAO,SAAS,EAAE,CAC5C,QAAO,OAAO,EAAE;AACpB,QAAO,OAAO;;;;;ACjYlB,SAAgB,QAAQ,QAAQ,UAAU,YAAY;CAClD,MAAM,QAAQ,aAAa,QAAQ,QAAQ;AAC3C,QAAO,QAAQ,WAAW,OACpB,IAAI,kBAAkB,QAAQ,SAAS,MAAM,GAC7C,IAAI,UAAU,QAAQ,SAAS,MAAM;;AAE/C,MAAM,aAAa,OAAO,OAAO,EAAE,CAAC;;AAEpC,IAAa,YAAb,MAAuB;;CAEnB;CACA;CACA;CACA,YAAY;CACZ,YAAY,QAAQ,SAAS,OAAO;AAEhC,OAAK,QAAQ;AACb,OAAK,SAAS;AACd,OAAK,UAAU;;;;;;CAMnB,OAAO,OAAO;AACV,MAAI,KAAK,MAAM,MAAM,CACjB,QAAO,EAAE;AACb,OAAK,cAAc,IAAI,UAAU,SAAS,KAAK,QAAQ,KAAK,QAAQ,EAAE,KAAK,OAAO;AAClF,SAAO,KAAK,UAAU,OAAO,MAAM;;;;;;;;;;CAUvC,SAAS,OAAO;AACZ,SAAO,KAAK,MAAM,MAAM,GAAG;GAAE,IAAI;GAAM;GAAO,GAAG;GAAE,IAAI;GAAO,QAAQ,KAAK,OAAO,MAAM;GAAE;;;;AAIlG,IAAa,oBAAb,cAAuC,UAAU;CAC7C,UAAU;;;;;;;CAOV,OAAO,OAAO;AACV,OAAK,YAAY,IAAI,QAAQ,SAAS,KAAK,QAAQ,KAAK,QAAQ,EAAE,KAAK,OAAO;AAC9E,SAAO,KAAK,QAAQ,OAAO,MAAM;;;CAGrC,MAAM,OAAO;AACT,SAAO,KAAK,SAAS,KAAK,OAAO,MAAM,CAAC;;;AAGhD,SAAS,aAAa,QAAQ,SAAS;AACnC,QAAO,SAAS,QAAQ,QAAQ,CAAC,MAAM;;AAG3C,SAAS,SAAS,QAAQ,SAAS;CAC/B,MAAM,QAAQ,IAAI,SAAS,QAAQ,SAAS,MAAM;AAClD,KAAI;AACA,QAAM,MAAM;AACZ,SAAO;UAEJ,OAAO;AACV,MAAI,UAAU,QACV,OAAM;AACV,SAAO,IAAI,SAAS,QAAQ,SAAS,KAAK"}
|