@earendil-works/pi-schema 0.0.0-stage → 1.5.0

package/dist/compiler.js

@@ -0,0 +1,532 @@
+// The compiler: a schema to one check closure, built once. Keywords group by the type they constrain, so a value
+// is classified once per schema, and the common shapes (closed objects, arrays of one item schema, tagged unions,
+// leaf schemas) get one specialized closure each.
+import { ANNOTATING_FALSE, ANNOTATING_TRUE, annotateAll, annotateAny, annotateArray, annotateDependent, annotateIf, annotateObject, ignoreAnnotations, indirectAnnotating, isolateAnnotations, scopedAnnotating, unevaluatedItems, unevaluatedProperties, withFreshAnnotations, } from "./annotations.js";
+import { 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";
+import { documentOf, isSchemaObject, Resolver, resolveUri } from "./resolver.js";
+import { sharedRegex } from "./shared.js";
+/** Thrown when a compile without dynamic scope tracking meets a bookended `$dynamicRef`: compile again with it. */
+export const RESTART = Symbol("restart");
+/** One compile of a schema. Its caches and indexes are garbage once the root check is built. */
+export class Compiler {
+    r;
+    draft;
+    formats;
+    /** Whether checks track the dynamic scope (the schema has a bookended `$dynamicRef`). */
+    dynamic;
+    schema;
+    scope;
+    cache = new Map();
+    annotatingCache = new Map();
+    constructor(schema, options, dynamic) {
+        this.schema = schema;
+        this.r = new Resolver(schema, options);
+        this.draft = this.r.draft;
+        this.formats = options.formats;
+        this.dynamic = dynamic;
+        this.scope = [];
+    }
+    /** The check of the root schema. */
+    root() {
+        return this.check(this.schema, this.r.rootBase);
+    }
+    /** The check of a schema (cached by schema object; a recursive reference goes through an indirection). */
+    check(node, base) {
+        if (node === true)
+            return ALWAYS;
+        if (node === false)
+            return NEVER;
+        if (!isSchemaObject(node))
+            throw new Error(`A schema must be an object or a boolean, got ${JSON.stringify(node)}`);
+        const cached = this.cache.get(node);
+        if (cached !== undefined)
+            return cached;
+        const bare = this.bareType(node);
+        if (bare !== undefined)
+            return bare;
+        const slot = { check: undefined };
+        this.cache.set(node, indirect(slot));
+        const check = this.build(node, this.r.baseFor(node, base));
+        slot.check = check;
+        this.cache.set(node, check);
+        return check;
+    }
+    build(node, base) {
+        if (this.draft === "7" && typeof node.$ref === "string")
+            return this.ref(node.$ref, base);
+        if (this.draft !== "7" && (node.unevaluatedProperties !== undefined || node.unevaluatedItems !== undefined)) {
+            return withFreshAnnotations(this.annotating(node, base));
+        }
+        const check = this.plain(node, base);
+        return this.dynamic && this.r.isResource(node, base) ? scopedCheck(this.scope, base, check) : check;
+    }
+    /**
+     * The module-level check of a schema that is only a `type` (with annotations), `ALWAYS` for one with no assertion
+     * at all; undefined for every other schema. These are the most common subschemas and cost nothing to share.
+     */
+    bareType(node) {
+        let type;
+        for (const k in node) {
+            if (k === "type")
+                type = node.type;
+            else if (!NEUTRAL_KEYWORDS.has(k))
+                return undefined;
+        }
+        if (type === undefined)
+            return ALWAYS;
+        return typeof type === "string" ? TYPE_CHECKS.get(type) : undefined;
+    }
+    /** Every keyword of `node`, not tracking annotations. */
+    plain(node, base) {
+        const parts = [];
+        const types = node.type === undefined ? undefined : Array.isArray(node.type) ? node.type : [node.type];
+        const single = types?.length === 1 ? types[0] : undefined;
+        let typeInGroup = false;
+        if (single === "bytes") {
+            parts.push(bytesCheck(number(node.minLength) ?? 0, number(node.maxLength) ?? Number.POSITIVE_INFINITY));
+            typeInGroup = true;
+        }
+        else {
+            const string = this.stringGroup(node, single === "string");
+            if (string !== undefined)
+                parts.push(string);
+            const numeric = single === "number" || single === "integer";
+            const number = this.numberGroup(node, single === "number" ? 1 : single === "integer" ? 2 : 0);
+            if (number !== undefined)
+                parts.push(number);
+            const object = this.objectGroup(node, base, single === "object");
+            if (object !== undefined)
+                parts.push(object);
+            const array = this.arrayGroup(node, base, single === "array");
+            if (array !== undefined)
+                parts.push(array);
+            typeInGroup =
+                (single === "string" && string !== undefined) ||
+                    (numeric && number !== undefined) ||
+                    (single === "object" && object !== undefined) ||
+                    (single === "array" && array !== undefined);
+        }
+        if (types !== undefined && !typeInGroup)
+            parts.unshift(typeCheck(types));
+        this.inPlace(node, base, parts);
+        return and(parts);
+    }
+    // The keywords that apply to the value itself, whatever its type.
+    inPlace(node, base, parts) {
+        if (Array.isArray(node.enum))
+            parts.push(enumCheck(node.enum));
+        if (Object.hasOwn(node, "const"))
+            parts.push(constCheck(node.const));
+        if (Array.isArray(node.allOf))
+            parts.push(and(node.allOf.map((s) => this.check(s, base))));
+        if (Array.isArray(node.anyOf))
+            parts.push(this.union(node.anyOf, base, false));
+        if (Array.isArray(node.oneOf))
+            parts.push(this.union(node.oneOf, base, true));
+        if (node.not !== undefined)
+            parts.push(notCheck(this.check(node.not, base)));
+        if (node.if !== undefined && (node.then !== undefined || node.else !== undefined)) {
+            const then = node.then === undefined ? ALWAYS : this.check(node.then, base);
+            const otherwise = node.else === undefined ? ALWAYS : this.check(node.else, base);
+            parts.push(ifCheck(this.check(node.if, base), then, otherwise));
+        }
+        if (typeof node.$ref === "string")
+            parts.push(this.ref(node.$ref, base));
+        if (this.draft !== "7" && typeof node.$dynamicRef === "string") {
+            parts.push(this.dynamicRef(node.$dynamicRef, base));
+        }
+    }
+    union(branches, base, exactlyOne) {
+        const checks = () => branches.map((s) => this.check(s, base));
+        return (constUnion(branches, exactlyOne) ??
+            this.tagged(branches, base) ??
+            (exactlyOne ? oneCheck(checks()) : anyCheck(checks())));
+    }
+    ref(ref, base) {
+        const target = this.r.resolve(ref, base);
+        const check = this.check(target.node, target.base);
+        return this.dynamic && target.base !== base ? scopedCheck(this.scope, target.base, check) : check;
+    }
+    dynamicRef(ref, base) {
+        const resolved = this.bookended(ref, base);
+        if (resolved === undefined)
+            return this.ref(ref, base);
+        const { initial, name } = resolved;
+        const fallback = this.check(initial.node, initial.base);
+        const lookup = this.dynamicLookup(name, (node, b) => this.check(node, b));
+        const scope = this.scope;
+        return (v) => {
+            for (let i = 0; i < scope.length; i++) {
+                const check = lookup(scope[i]);
+                if (check !== null)
+                    return check(v);
+            }
+            return fallback(v);
+        };
+    }
+    /** The initial target and anchor name of a `$dynamicRef` that resolves dynamically, or undefined for a plain ref. */
+    bookended(ref, base) {
+        const initial = this.r.resolve(ref, base);
+        const uri = resolveUri(ref, base);
+        const name = uri.slice(documentOf(uri).length + 1);
+        const anchored = isSchemaObject(initial.node) && initial.node.$dynamicAnchor === name;
+        if (name === "" || name.startsWith("/") || !anchored)
+            return undefined;
+        if (!this.dynamic)
+            throw RESTART;
+        return { initial, name };
+    }
+    // Resolved at run time against the dynamic scope, so a schema with a bookended $dynamicRef keeps its compiler.
+    dynamicLookup(name, compile) {
+        const found = new Map();
+        return (uri) => {
+            const key = `${uri}#${name}`;
+            let check = found.get(key);
+            if (check === undefined) {
+                const target = this.r.dynamicAnchors.get(key);
+                check = target === undefined ? null : compile(target, this.r.baseOf.get(target) ?? uri);
+                found.set(key, check);
+            }
+            return check;
+        };
+    }
+    /** anyOf/oneOf whose branches are all objects with a distinct required const on one key: the tag picks the branch. */
+    tagged(branches, base) {
+        if (branches.length < 2)
+            return undefined;
+        const resolved = [];
+        for (const branch of branches) {
+            if (!isSchemaObject(branch))
+                return undefined;
+            const ref = typeof branch.$ref === "string" && Object.keys(branch).length === 1 ? branch.$ref : undefined;
+            const node = ref === undefined ? branch : this.r.resolve(ref, this.r.baseFor(branch, base)).node;
+            if (!isSchemaObject(node))
+                return undefined;
+            resolved.push(node);
+        }
+        const first = resolved[0].properties;
+        if (!isSchemaObject(first))
+            return undefined;
+        for (const key of Object.keys(first)) {
+            const tags = resolved.map((s) => tagOf(s, key));
+            if (tags.some((t) => t === undefined) || new Set(tags).size !== tags.length)
+                continue;
+            return taggedCheck(key, tags, branches.map((s) => this.check(s, base)));
+        }
+        return undefined;
+    }
+    stringGroup(node, strict) {
+        const min = number(node.minLength) ?? 0;
+        const max = number(node.maxLength) ?? Number.POSITIVE_INFINITY;
+        const re = typeof node.pattern === "string" ? sharedRegex(node.pattern) : undefined;
+        const format = this.formats !== undefined && typeof node.format === "string" && Object.hasOwn(this.formats, node.format)
+            ? this.formats[node.format]
+            : undefined;
+        if (min === 0 && max === Number.POSITIVE_INFINITY && re === undefined && format === undefined)
+            return undefined;
+        return stringCheck(strict, min, max, re, format);
+    }
+    numberGroup(node, mode) {
+        const min = number(node.minimum);
+        const max = number(node.maximum);
+        const xmin = number(node.exclusiveMinimum);
+        const xmax = number(node.exclusiveMaximum);
+        const multipleOf = number(node.multipleOf);
+        if ([min, max, xmin, xmax, multipleOf].every((x) => x === undefined))
+            return undefined;
+        const inf = Number.POSITIVE_INFINITY;
+        return numberCheck(mode, min ?? -inf, max ?? inf, xmin ?? -inf, xmax ?? inf, multipleOf);
+    }
+    objectGroup(node, base, strict) {
+        const onlyCore = OBJECT_EXTRAS.every((k) => node[k] === undefined);
+        // A schema with only the core object keywords gets one closure that also does the type guard.
+        const core = this.objectCore(node, base, onlyCore ? (strict ? GUARD_STRICT : GUARD_LOOSE) : GUARD_NONE);
+        if (core !== undefined && onlyCore)
+            return core;
+        const parts = core === undefined ? [] : [core];
+        if (node.propertyNames !== undefined)
+            parts.push(propertyNamesCheck(this.check(node.propertyNames, base)));
+        const minProperties = number(node.minProperties);
+        const maxProperties = number(node.maxProperties);
+        if (minProperties !== undefined || maxProperties !== undefined) {
+            parts.push(propertyCountCheck(minProperties ?? 0, maxProperties ?? Number.POSITIVE_INFINITY));
+        }
+        const dependentRequired = [];
+        const dependentSchemas = [];
+        if (this.draft !== "7") {
+            for (const [k, list] of entries(node.dependentRequired))
+                if (Array.isArray(list))
+                    dependentRequired.push([k, list]);
+            for (const [k, s] of entries(node.dependentSchemas))
+                dependentSchemas.push([k, this.check(s, base)]);
+        }
+        for (const [k, d] of entries(node.dependencies)) {
+            if (Array.isArray(d))
+                dependentRequired.push([k, d]);
+            else
+                dependentSchemas.push([k, this.check(d, base)]);
+        }
+        if (dependentRequired.length > 0)
+            parts.push(dependentRequiredCheck(dependentRequired));
+        if (dependentSchemas.length > 0)
+            parts.push(dependentSchemasCheck(dependentSchemas));
+        if (parts.length === 0)
+            return strict ? IS_OBJECT : undefined;
+        return guardObject(and(parts), strict);
+    }
+    objectCore(node, base, guard) {
+        const properties = isSchemaObject(node.properties) ? node.properties : {};
+        const required = Array.isArray(node.required) ? node.required.filter((k) => typeof k === "string") : [];
+        const patterns = isSchemaObject(node.patternProperties) ? node.patternProperties : {};
+        const additional = node.additionalProperties;
+        const keys = Object.keys(properties);
+        const patternKeys = Object.keys(patterns);
+        if (keys.length + required.length + patternKeys.length === 0 &&
+            (additional === undefined || additional === true)) {
+            return undefined;
+        }
+        // One array per object: key, check, flags (leaf code, required, key also names an Object.prototype member).
+        const entries = [];
+        for (const k of keys) {
+            const check = this.check(properties[k], base);
+            const flags = (LEAF_CODES.get(check) ?? 0) |
+                (required.includes(k) ? REQUIRED : 0) |
+                (k in Object.prototype ? INHERITED : 0);
+            entries.push(k, check, flags);
+        }
+        const extraRequired = required.filter((k) => !Object.hasOwn(properties, k));
+        const pats = patternKeys.map((p) => [sharedRegex(p), this.check(patterns[p], base)]);
+        const extra = additional === undefined || additional === true ? undefined : this.check(additional, base);
+        if (pats.length === 0 && extraRequired.length === 0 && (extra === undefined || additional === false)) {
+            const requiredCount = keys.filter((k) => required.includes(k)).length;
+            return declaredObject(entries, requiredCount, additional === false, guard);
+        }
+        return openObject(entries, keys, extraRequired, pats, extra, guard);
+    }
+    arrayGroup(node, base, strict) {
+        let prefix = [];
+        let rest;
+        if (Array.isArray(node.items)) {
+            prefix = node.items;
+            rest = node.additionalItems;
+        }
+        else {
+            if (this.draft !== "7" && Array.isArray(node.prefixItems))
+                prefix = node.prefixItems;
+            rest = node.items;
+        }
+        const prefixChecks = prefix.map((s) => this.check(s, base));
+        const restCheck = rest === undefined || rest === true ? undefined : this.check(rest, base);
+        const minItems = number(node.minItems);
+        const maxItems = number(node.maxItems);
+        if (node.contains === undefined &&
+            node.uniqueItems !== true &&
+            (prefixChecks.length > 0 || restCheck !== undefined)) {
+            // The common array: one closure for the guard, the length bounds and the items.
+            const guard = strict ? GUARD_STRICT : GUARD_LOOSE;
+            return listCheck(guard, minItems ?? 0, maxItems ?? Number.POSITIVE_INFINITY, prefixChecks, restCheck);
+        }
+        const parts = [];
+        if (prefixChecks.length > 0 || restCheck !== undefined)
+            parts.push(itemsCheck(prefixChecks, restCheck));
+        if (minItems !== undefined || maxItems !== undefined) {
+            parts.push(lengthCheck(minItems ?? 0, maxItems ?? Number.POSITIVE_INFINITY));
+        }
+        if (node.contains !== undefined) {
+            const min = this.draft === "7" ? 1 : (number(node.minContains) ?? 1);
+            const max = this.draft === "7" ? Number.POSITIVE_INFINITY : (number(node.maxContains) ?? Number.POSITIVE_INFINITY);
+            parts.push(containsCheck(this.check(node.contains, base), min, max));
+        }
+        if (node.uniqueItems === true)
+            parts.push(uniqueCheck);
+        if (parts.length === 0)
+            return strict ? IS_ARRAY : undefined;
+        return guardArray(and(parts), strict);
+    }
+    /** The annotating check of a schema evaluated in place (only below `unevaluatedProperties`/`unevaluatedItems`). */
+    annotating(node, base) {
+        if (node === true)
+            return ANNOTATING_TRUE;
+        if (node === false)
+            return ANNOTATING_FALSE;
+        if (!isSchemaObject(node))
+            throw new Error(`A schema must be an object or a boolean, got ${JSON.stringify(node)}`);
+        const cached = this.annotatingCache.get(node);
+        if (cached !== undefined)
+            return cached;
+        const slot = { check: undefined };
+        this.annotatingCache.set(node, indirectAnnotating(slot));
+        const check = this.buildAnnotating(node, this.r.baseFor(node, base));
+        slot.check = check;
+        this.annotatingCache.set(node, check);
+        return check;
+    }
+    buildAnnotating(node, base) {
+        const rest = {};
+        let annotates = false;
+        for (const k of Object.keys(node)) {
+            if (ANNOTATING.has(k))
+                annotates = true;
+            else
+                rest[k] = node[k];
+        }
+        const plain = this.plain(rest, base);
+        const parts = [];
+        if (annotates)
+            this.annotatingParts(node, base, parts);
+        const all = parts.length === 0 ? ignoreAnnotations(plain) : annotateAll(plain, parts);
+        const own = node.unevaluatedProperties !== undefined || node.unevaluatedItems !== undefined
+            ? isolateAnnotations(all)
+            : all;
+        return this.dynamic && this.r.isResource(node, base) ? scopedAnnotating(this.scope, base, own) : own;
+    }
+    annotatingParts(node, base, parts) {
+        if (node.properties !== undefined ||
+            node.patternProperties !== undefined ||
+            node.additionalProperties !== undefined) {
+            const props = entries(node.properties).map(([k, s]) => [k, this.check(s, base)]);
+            const pats = entries(node.patternProperties).map(([p, s]) => [sharedRegex(p), this.check(s, base)]);
+            const extra = node.additionalProperties === undefined ? undefined : this.check(node.additionalProperties, base);
+            parts.push(annotateObject(props, pats, extra));
+        }
+        if (node.prefixItems !== undefined || node.items !== undefined || node.contains !== undefined) {
+            const prefix = Array.isArray(node.prefixItems)
+                ? node.prefixItems
+                : Array.isArray(node.items)
+                    ? node.items
+                    : [];
+            const rest = Array.isArray(node.items) ? node.additionalItems : node.items;
+            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));
+        }
+        if (Array.isArray(node.allOf))
+            for (const s of node.allOf)
+                parts.push(this.annotating(s, base));
+        if (Array.isArray(node.anyOf))
+            parts.push(annotateAny(node.anyOf.map((s) => this.annotating(s, base)), false));
+        if (Array.isArray(node.oneOf))
+            parts.push(annotateAny(node.oneOf.map((s) => this.annotating(s, base)), true));
+        if (node.if !== undefined) {
+            const then = node.then === undefined ? undefined : this.annotating(node.then, base);
+            const otherwise = node.else === undefined ? undefined : this.annotating(node.else, base);
+            parts.push(annotateIf(this.annotating(node.if, base), then, otherwise));
+        }
+        if (typeof node.$ref === "string")
+            parts.push(this.annotatingRef(node.$ref, base));
+        if (typeof node.$dynamicRef === "string")
+            parts.push(this.annotatingDynamicRef(node.$dynamicRef, base));
+        for (const [k, s] of entries(node.dependentSchemas))
+            parts.push(annotateDependent(k, this.annotating(s, base)));
+        if (node.unevaluatedProperties !== undefined) {
+            parts.push(unevaluatedProperties(this.check(node.unevaluatedProperties, base)));
+        }
+        if (node.unevaluatedItems !== undefined)
+            parts.push(unevaluatedItems(this.check(node.unevaluatedItems, base)));
+    }
+    annotatingRef(ref, base) {
+        const target = this.r.resolve(ref, base);
+        const check = this.annotating(target.node, target.base);
+        return this.dynamic && target.base !== base ? scopedAnnotating(this.scope, target.base, check) : check;
+    }
+    annotatingDynamicRef(ref, base) {
+        const resolved = this.bookended(ref, base);
+        if (resolved === undefined)
+            return this.annotatingRef(ref, base);
+        const { initial, name } = resolved;
+        const fallback = this.annotating(initial.node, initial.base);
+        const lookup = this.dynamicLookup(name, (node, b) => this.annotating(node, b));
+        const scope = this.scope;
+        return (v, a) => {
+            for (let i = 0; i < scope.length; i++) {
+                const check = lookup(scope[i]);
+                if (check !== null)
+                    return check(v, a);
+            }
+            return fallback(v, a);
+        };
+    }
+}
+/** Keywords that never affect a check. */
+export const NEUTRAL_KEYWORDS = new Set([
+    "$schema",
+    "$comment",
+    "title",
+    "description",
+    "default",
+    "examples",
+    "deprecated",
+    "readOnly",
+    "writeOnly",
+    "$defs",
+    "definitions",
+    "contentEncoding",
+    "contentMediaType",
+    "minContains",
+    "maxContains",
+    "$vocabulary",
+]);
+// The object keywords besides the core (properties, required, patternProperties, additionalProperties).
+const OBJECT_EXTRAS = [
+    "propertyNames",
+    "minProperties",
+    "maxProperties",
+    "dependentRequired",
+    "dependentSchemas",
+    "dependencies",
+];
+// The keywords an annotating check handles itself; every other keyword compiles into its plain part.
+const ANNOTATING = new Set([
+    "properties",
+    "patternProperties",
+    "additionalProperties",
+    "prefixItems",
+    "items",
+    "additionalItems",
+    "contains",
+    "minContains",
+    "maxContains",
+    "allOf",
+    "anyOf",
+    "oneOf",
+    "if",
+    "then",
+    "else",
+    "$ref",
+    "$dynamicRef",
+    "dependentSchemas",
+    "unevaluatedProperties",
+    "unevaluatedItems",
+]);
+/** anyOf/oneOf whose branches are all `{ const: primitive }`: an enum (distinct values make oneOf the same). */
+function constUnion(branches, exactlyOne) {
+    const values = [];
+    for (const branch of branches) {
+        if (!isSchemaObject(branch) || !Object.hasOwn(branch, "const"))
+            return undefined;
+        for (const k of Object.keys(branch))
+            if (k !== "const" && !NEUTRAL_KEYWORDS.has(k))
+                return undefined;
+        if (typeof branch.const === "object" && branch.const !== null)
+            return undefined;
+        if (exactlyOne && values.includes(branch.const))
+            return undefined;
+        values.push(branch.const);
+    }
+    return enumCheck(values);
+}
+// The tag of a tagged-union branch: a primitive const on a required property of an object schema.
+function tagOf(branch, key) {
+    const properties = branch.properties;
+    if (branch.type !== "object" || !Array.isArray(branch.required) || !branch.required.includes(key))
+        return undefined;
+    const tag = isSchemaObject(properties) ? properties[key] : undefined;
+    if (!isSchemaObject(tag) || !Object.hasOwn(tag, "const"))
+        return undefined;
+    return typeof tag.const === "object" && tag.const !== null ? undefined : tag.const;
+}
+function number(value) {
+    return typeof value === "number" ? value : undefined;
+}
+function entries(value) {
+    return isSchemaObject(value) ? Object.entries(value) : [];
+}
+//# sourceMappingURL=compiler.js.map

package/dist/compiler.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"compiler.js","sourceRoot":"","sources":["../src/compiler.ts"],"names":[],"mappings":"AAAA,iHAAiH;AACjH,kHAAkH;AAClH,kDAAkD;AAElD,OAAO,EACN,gBAAgB,EAChB,eAAe,EAEf,WAAW,EACX,WAAW,EACX,aAAa,EACb,iBAAiB,EACjB,UAAU,EACV,cAAc,EACd,iBAAiB,EACjB,kBAAkB,EAClB,kBAAkB,EAClB,gBAAgB,EAChB,gBAAgB,EAChB,qBAAqB,EACrB,oBAAoB,GACpB,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EACN,MAAM,EACN,GAAG,EACH,QAAQ,EACR,UAAU,EACV,UAAU,EACV,aAAa,EACb,cAAc,EACd,sBAAsB,EACtB,qBAAqB,EACrB,SAAS,EACT,WAAW,EACX,UAAU,EACV,YAAY,EAEZ,UAAU,EACV,WAAW,EACX,SAAS,EACT,QAAQ,EACR,SAAS,EACT,OAAO,EACP,QAAQ,EACR,UAAU,EACV,UAAU,EACV,WAAW,EACX,SAAS,EACT,KAAK,EACL,QAAQ,EACR,WAAW,EACX,QAAQ,EACR,UAAU,EACV,kBAAkB,EAClB,kBAAkB,EAClB,QAAQ,EACR,WAAW,EACX,WAAW,EACX,WAAW,EACX,WAAW,EACX,SAAS,EACT,WAAW,GACX,MAAM,aAAa,CAAC;AACrB,OAAO,EAAE,UAAU,EAAE,cAAc,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,eAAe,CAAC;AACjF,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAG1C,mHAAmH;AACnH,MAAM,CAAC,MAAM,OAAO,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC;AAEzC,gGAAgG;AAChG,MAAM,OAAO,QAAQ;IACX,CAAC,CAAW;IACZ,KAAK,CAAkB;IACvB,OAAO,CAAoD;IACpE,yFAAyF;IAChF,OAAO,CAAU;IACT,MAAM,CAAa;IACnB,KAAK,CAAW;IAChB,KAAK,GAAG,IAAI,GAAG,EAAiB,CAAC;IACjC,eAAe,GAAG,IAAI,GAAG,EAA2B,CAAC;IAEtE,YAAY,MAAkB,EAAE,OAAuB,EAAE,OAAgB;QACxE,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,CAAC,GAAG,IAAI,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QACvC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;QAC1B,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC;QAC/B,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;IACjB,CAAC;IAED,oCAAoC;IACpC,IAAI;QACH,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;IACjD,CAAC;IAED,0GAA0G;IAC1G,KAAK,CAAC,IAAa,EAAE,IAAY;QAChC,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,MAAM,CAAC;QACjC,IAAI,IAAI,KAAK,KAAK;YAAE,OAAO,KAAK,CAAC;QACjC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC;YACxB,MAAM,IAAI,KAAK,CAAC,gDAAgD,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACzF,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACpC,IAAI,MAAM,KAAK,SAAS;YAAE,OAAO,MAAM,CAAC;QACxC,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC;QACpC,MAAM,IAAI,GAAiC,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;QAChE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;QACrC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;QAC3D,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAC5B,OAAO,KAAK,CAAC;IACd,CAAC;IAEO,KAAK,CAAC,IAAkB,EAAE,IAAY;QAC7C,IAAI,IAAI,CAAC,KAAK,KAAK,GAAG,IAAI,OAAO,IAAI,CAAC,IAAI,KAAK,QAAQ;YAAE,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAC1F,IAAI,IAAI,CAAC,KAAK,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,qBAAqB,KAAK,SAAS,IAAI,IAAI,CAAC,gBAAgB,KAAK,SAAS,CAAC,EAAE,CAAC;YAC7G,OAAO,oBAAoB,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;QAC1D,CAAC;QACD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACrC,OAAO,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;IACrG,CAAC;IAED;;;OAGG;IACK,QAAQ,CAAC,IAAkB;QAClC,IAAI,IAAa,CAAC;QAClB,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACtB,IAAI,CAAC,KAAK,MAAM;gBAAE,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;iBAC9B,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,OAAO,SAAS,CAAC;QACrD,CAAC;QACD,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO,MAAM,CAAC;QACtC,OAAO,OAAO,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACrE,CAAC;IAED,yDAAyD;IACjD,KAAK,CAAC,IAAkB,EAAE,IAAY;QAC7C,MAAM,KAAK,GAAY,EAAE,CAAC;QAC1B,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvG,MAAM,MAAM,GAAG,KAAK,EAAE,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAC1D,IAAI,WAAW,GAAG,KAAK,CAAC;QACxB,IAAI,MAAM,KAAK,OAAO,EAAE,CAAC;YACxB,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,MAAM,CAAC,iBAAiB,CAAC,CAAC,CAAC;YACxG,WAAW,GAAG,IAAI,CAAC;QACpB,CAAC;aAAM,CAAC;YACP,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,MAAM,KAAK,QAAQ,CAAC,CAAC;YAC3D,IAAI,MAAM,KAAK,SAAS;gBAAE,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC7C,MAAM,OAAO,GAAG,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,SAAS,CAAC;YAC5D,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9F,IAAI,MAAM,KAAK,SAAS;gBAAE,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC7C,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,KAAK,QAAQ,CAAC,CAAC;YACjE,IAAI,MAAM,KAAK,SAAS;gBAAE,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC7C,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,KAAK,OAAO,CAAC,CAAC;YAC9D,IAAI,KAAK,KAAK,SAAS;gBAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC3C,WAAW;gBACV,CAAC,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,SAAS,CAAC;oBAC7C,CAAC,OAAO,IAAI,MAAM,KAAK,SAAS,CAAC;oBACjC,CAAC,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,SAAS,CAAC;oBAC7C,CAAC,MAAM,KAAK,OAAO,IAAI,KAAK,KAAK,SAAS,CAAC,CAAC;QAC9C,CAAC;QACD,IAAI,KAAK,KAAK,SAAS,IAAI,CAAC,WAAW;YAAE,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC;QACzE,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QAChC,OAAO,GAAG,CAAC,KAAK,CAAC,CAAC;IACnB,CAAC;IAED,kEAAkE;IAC1D,OAAO,CAAC,IAAkB,EAAE,IAAY,EAAE,KAAc;QAC/D,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC/D,IAAI,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;QACrE,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3F,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;QAC/E,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;QAC9E,IAAI,IAAI,CAAC,GAAG,KAAK,SAAS;YAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7E,IAAI,IAAI,CAAC,EAAE,KAAK,SAAS,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,CAAC,EAAE,CAAC;YACnF,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAC5E,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACjF,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC;QACjE,CAAC;QACD,IAAI,OAAO,IAAI,CAAC,IAAI,KAAK,QAAQ;YAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;QACzE,IAAI,IAAI,CAAC,KAAK,KAAK,GAAG,IAAI,OAAO,IAAI,CAAC,WAAW,KAAK,QAAQ,EAAE,CAAC;YAChE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC,CAAC;QACrD,CAAC;IACF,CAAC;IAEO,KAAK,CAAC,QAA4B,EAAE,IAAY,EAAE,UAAmB;QAC5E,MAAM,MAAM,GAAG,GAAG,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;QAC9D,OAAO,CACN,UAAU,CAAC,QAAQ,EAAE,UAAU,CAAC;YAChC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC;YAC3B,CAAC,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CACtD,CAAC;IACH,CAAC;IAEO,GAAG,CAAC,GAAW,EAAE,IAAY;QACpC,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACzC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;QACnD,OAAO,IAAI,CAAC,OAAO,IAAI,MAAM,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;IACnG,CAAC;IAEO,UAAU,CAAC,GAAW,EAAE,IAAY;QAC3C,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAC3C,IAAI,QAAQ,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACvD,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,QAAQ,CAAC;QACnC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC;QACxD,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;QAC1E,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,OAAO,CAAC,CAAC,EAAE,EAAE;YACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACvC,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC/B,IAAI,KAAK,KAAK,IAAI;oBAAE,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC;YACrC,CAAC;YACD,OAAO,QAAQ,CAAC,CAAC,CAAC,CAAC;QACpB,CAAC,CAAC;IACH,CAAC;IAED,qHAAqH;IAC7G,SAAS,CAChB,GAAW,EACX,IAAY;QAEZ,MAAM,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAC1C,MAAM,GAAG,GAAG,UAAU,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAClC,MAAM,IAAI,GAAG,GAAG,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACnD,MAAM,QAAQ,GAAG,cAAc,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC,cAAc,KAAK,IAAI,CAAC;QACtF,IAAI,IAAI,KAAK,EAAE,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ;YAAE,OAAO,SAAS,CAAC;QACvE,IAAI,CAAC,IAAI,CAAC,OAAO;YAAE,MAAM,OAAO,CAAC;QACjC,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;IAC1B,CAAC;IAED,+GAA+G;IACvG,aAAa,CAAI,IAAY,EAAE,OAAgD;QACtF,MAAM,KAAK,GAAG,IAAI,GAAG,EAAoB,CAAC;QAC1C,OAAO,CAAC,GAAG,EAAE,EAAE;YACd,MAAM,GAAG,GAAG,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC;YAC7B,IAAI,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC3B,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACzB,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC9C,KAAK,GAAG,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,CAAC;gBACxF,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YACvB,CAAC;YACD,OAAO,KAAK,CAAC;QACd,CAAC,CAAC;IACH,CAAC;IAED,sHAAsH;IAC9G,MAAM,CAAC,QAA4B,EAAE,IAAY;QACxD,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,SAAS,CAAC;QAC1C,MAAM,QAAQ,GAAmB,EAAE,CAAC;QACpC,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;YAC/B,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC;gBAAE,OAAO,SAAS,CAAC;YAC9C,MAAM,GAAG,GAAG,OAAO,MAAM,CAAC,IAAI,KAAK,QAAQ,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;YAC1G,MAAM,IAAI,GAAG,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;YACjG,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC;gBAAE,OAAO,SAAS,CAAC;YAC5C,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrB,CAAC;QACD,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC;QACrC,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC7C,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACtC,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YAChD,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,MAAM;gBAAE,SAAS;YACtF,OAAO,WAAW,CACjB,GAAG,EACH,IAAI,EACJ,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CACxC,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IAClB,CAAC;IAEO,WAAW,CAAC,IAAkB,EAAE,MAAe;QACtD,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QACxC,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,MAAM,CAAC,iBAAiB,CAAC;QAC/D,MAAM,EAAE,GAAG,OAAO,IAAI,CAAC,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QACpF,MAAM,MAAM,GACX,IAAI,CAAC,OAAO,KAAK,SAAS,IAAI,OAAO,IAAI,CAAC,MAAM,KAAK,QAAQ,IAAI,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC;YACxG,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC;YAC3B,CAAC,CAAC,SAAS,CAAC;QACd,IAAI,GAAG,KAAK,CAAC,IAAI,GAAG,KAAK,MAAM,CAAC,iBAAiB,IAAI,EAAE,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QAChH,OAAO,WAAW,CAAC,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,MAAM,CAAC,CAAC;IAClD,CAAC;IAEO,WAAW,CAAC,IAAkB,EAAE,IAAe;QACtD,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACjC,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACjC,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;QAC3C,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;QAC3C,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC3C,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC;YAAE,OAAO,SAAS,CAAC;QACvF,MAAM,GAAG,GAAG,MAAM,CAAC,iBAAiB,CAAC;QACrC,OAAO,WAAW,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,IAAI,GAAG,EAAE,IAAI,IAAI,CAAC,GAAG,EAAE,IAAI,IAAI,GAAG,EAAE,UAAU,CAAC,CAAC;IAC1F,CAAC;IAEO,WAAW,CAAC,IAAkB,EAAE,IAAY,EAAE,MAAe;QACpE,MAAM,QAAQ,GAAG,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC;QACnE,8FAA8F;QAC9F,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;QACxG,IAAI,IAAI,KAAK,SAAS,IAAI,QAAQ;YAAE,OAAO,IAAI,CAAC;QAChD,MAAM,KAAK,GAAY,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACxD,IAAI,IAAI,CAAC,aAAa,KAAK,SAAS;YAAE,KAAK,CAAC,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3G,MAAM,aAAa,GAAG,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QACjD,MAAM,aAAa,GAAG,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QACjD,IAAI,aAAa,KAAK,SAAS,IAAI,aAAa,KAAK,SAAS,EAAE,CAAC;YAChE,KAAK,CAAC,IAAI,CAAC,kBAAkB,CAAC,aAAa,IAAI,CAAC,EAAE,aAAa,IAAI,MAAM,CAAC,iBAAiB,CAAC,CAAC,CAAC;QAC/F,CAAC;QACD,MAAM,iBAAiB,GAAyB,EAAE,CAAC;QACnD,MAAM,gBAAgB,GAAsB,EAAE,CAAC;QAC/C,IAAI,IAAI,CAAC,KAAK,KAAK,GAAG,EAAE,CAAC;YACxB,KAAK,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC,iBAAiB,CAAC;gBACtD,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;oBAAE,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;YAC5D,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC,gBAAgB,CAAC;gBAAE,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QACtG,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC;YACjD,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;gBAAE,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;;gBAChD,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QACtD,CAAC;QACD,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,sBAAsB,CAAC,iBAAiB,CAAC,CAAC,CAAC;QACxF,IAAI,gBAAgB,CAAC,MAAM,GAAG,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,qBAAqB,CAAC,gBAAgB,CAAC,CAAC,CAAC;QACrF,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC;QAC9D,OAAO,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,CAAC;IACxC,CAAC;IAEO,UAAU,CAAC,IAAkB,EAAE,IAAY,EAAE,KAAY;QAChE,MAAM,UAAU,GAAG,cAAc,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;QAC1E,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACxG,MAAM,QAAQ,GAAG,cAAc,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAAE,CAAC;QACtF,MAAM,UAAU,GAAG,IAAI,CAAC,oBAAoB,CAAC;QAC7C,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACrC,MAAM,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC1C,IACC,IAAI,CAAC,MAAM,GAAG,QAAQ,CAAC,MAAM,GAAG,WAAW,CAAC,MAAM,KAAK,CAAC;YACxD,CAAC,UAAU,KAAK,SAAS,IAAI,UAAU,KAAK,IAAI,CAAC,EAChD,CAAC;YACF,OAAO,SAAS,CAAC;QAClB,CAAC;QACD,4GAA4G;QAC5G,MAAM,OAAO,GAAc,EAAE,CAAC;QAC9B,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACtB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YAC9C,MAAM,KAAK,GACV,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAC5B,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;gBACrC,CAAC,CAAC,IAAI,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACzC,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QAC/B,CAAC;QACD,MAAM,aAAa,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,CAAC;QAC5E,MAAM,IAAI,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAU,CAAC,CAAC;QAC9F,MAAM,KAAK,GAAG,UAAU,KAAK,SAAS,IAAI,UAAU,KAAK,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QACzG,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,KAAK,KAAK,SAAS,IAAI,UAAU,KAAK,KAAK,CAAC,EAAE,CAAC;YACtG,MAAM,aAAa,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;YACtE,OAAO,cAAc,CAAC,OAAO,EAAE,aAAa,EAAE,UAAU,KAAK,KAAK,EAAE,KAAK,CAAC,CAAC;QAC5E,CAAC;QACD,OAAO,UAAU,CAAC,OAAO,EAAE,IAAI,EAAE,aAAa,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IACrE,CAAC;IAEO,UAAU,CAAC,IAAkB,EAAE,IAAY,EAAE,MAAe;QACnE,IAAI,MAAM,GAAuB,EAAE,CAAC;QACpC,IAAI,IAAa,CAAC;QAClB,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YAC/B,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC;YACpB,IAAI,GAAG,IAAI,CAAC,eAAe,CAAC;QAC7B,CAAC;aAAM,CAAC;YACP,IAAI,IAAI,CAAC,KAAK,KAAK,GAAG,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC;gBAAE,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC;YACrF,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACnB,CAAC;QACD,MAAM,YAAY,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;QAC5D,MAAM,SAAS,GAAG,IAAI,KAAK,SAAS,IAAI,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAC3F,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACvC,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACvC,IACC,IAAI,CAAC,QAAQ,KAAK,SAAS;YAC3B,IAAI,CAAC,WAAW,KAAK,IAAI;YACzB,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,KAAK,SAAS,CAAC,EACnD,CAAC;YACF,gFAAgF;YAChF,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,WAAW,CAAC;YAClD,OAAO,SAAS,CAAC,KAAK,EAAE,QAAQ,IAAI,CAAC,EAAE,QAAQ,IAAI,MAAM,CAAC,iBAAiB,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC;QACvG,CAAC;QACD,MAAM,KAAK,GAAY,EAAE,CAAC;QAC1B,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,KAAK,SAAS;YAAE,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,YAAY,EAAE,SAAS,CAAC,CAAC,CAAC;QACxG,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YACtD,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,QAAQ,IAAI,CAAC,EAAE,QAAQ,IAAI,MAAM,CAAC,iBAAiB,CAAC,CAAC,CAAC;QAC9E,CAAC;QACD,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YACjC,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC;YACrE,MAAM,GAAG,GACR,IAAI,CAAC,KAAK,KAAK,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,MAAM,CAAC,iBAAiB,CAAC,CAAC;YACxG,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;QACtE,CAAC;QACD,IAAI,IAAI,CAAC,WAAW,KAAK,IAAI;YAAE,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QACvD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC;QAC7D,OAAO,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,CAAC;IACvC,CAAC;IAED,mHAAmH;IACnH,UAAU,CAAC,IAAa,EAAE,IAAY;QACrC,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,eAAe,CAAC;QAC1C,IAAI,IAAI,KAAK,KAAK;YAAE,OAAO,gBAAgB,CAAC;QAC5C,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC;YACxB,MAAM,IAAI,KAAK,CAAC,gDAAgD,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACzF,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC9C,IAAI,MAAM,KAAK,SAAS;YAAE,OAAO,MAAM,CAAC;QACxC,MAAM,IAAI,GAA2C,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;QAC1E,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,IAAI,EAAE,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC;QACzD,MAAM,KAAK,GAAG,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;QACrE,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACtC,OAAO,KAAK,CAAC;IACd,CAAC;IAEO,eAAe,CAAC,IAAkB,EAAE,IAAY;QACvD,MAAM,IAAI,GAA4B,EAAE,CAAC;QACzC,IAAI,SAAS,GAAG,KAAK,CAAC;QACtB,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YACnC,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,SAAS,GAAG,IAAI,CAAC;;gBACnC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACxB,CAAC;QACD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACrC,MAAM,KAAK,GAAsB,EAAE,CAAC;QACpC,IAAI,SAAS;YAAE,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QACvD,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACtF,MAAM,GAAG,GACR,IAAI,CAAC,qBAAqB,KAAK,SAAS,IAAI,IAAI,CAAC,gBAAgB,KAAK,SAAS;YAC9E,CAAC,CAAC,kBAAkB,CAAC,GAAG,CAAC;YACzB,CAAC,CAAC,GAAG,CAAC;QACR,OAAO,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;IACtG,CAAC;IAEO,eAAe,CAAC,IAAkB,EAAE,IAAY,EAAE,KAAwB;QACjF,IACC,IAAI,CAAC,UAAU,KAAK,SAAS;YAC7B,IAAI,CAAC,iBAAiB,KAAK,SAAS;YACpC,IAAI,CAAC,oBAAoB,KAAK,SAAS,EACtC,CAAC;YACF,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAU,CAAC,CAAC;YAC1F,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAU,CAAC,CAAC;YAC7G,MAAM,KAAK,GACV,IAAI,CAAC,oBAAoB,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,oBAAoB,EAAE,IAAI,CAAC,CAAC;YACnG,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC;QAChD,CAAC;QACD,IAAI,IAAI,CAAC,WAAW,KAAK,SAAS,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC/F,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC;gBAC7C,CAAC,CAAC,IAAI,CAAC,WAAW;gBAClB,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC;oBAC1B,CAAC,CAAC,IAAI,CAAC,KAAK;oBACZ,CAAC,CAAC,EAAE,CAAC;YACP,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;YAC3E,KAAK,CAAC,IAAI,CACT,aAAa,CACZ,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EACtC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,EACvD,IAAI,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,EACzE,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,EAC7B,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,MAAM,CAAC,iBAAiB,CACpD,CACD,CAAC;QACH,CAAC;QACD,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC;YAAE,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK;gBAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;QAChG,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC;YAC5B,KAAK,CAAC,IAAI,CACT,WAAW,CACV,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAC/C,KAAK,CACL,CACD,CAAC;QACH,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC;YAC5B,KAAK,CAAC,IAAI,CACT,WAAW,CACV,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAC/C,IAAI,CACJ,CACD,CAAC;QACH,IAAI,IAAI,CAAC,EAAE,KAAK,SAAS,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACpF,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACzF,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC;QACzE,CAAC;QACD,IAAI,OAAO,IAAI,CAAC,IAAI,KAAK,QAAQ;YAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;QACnF,IAAI,OAAO,IAAI,CAAC,WAAW,KAAK,QAAQ;YAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC,CAAC;QACxG,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC,gBAAgB,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QAChH,IAAI,IAAI,CAAC,qBAAqB,KAAK,SAAS,EAAE,CAAC;YAC9C,KAAK,CAAC,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,qBAAqB,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QACjF,CAAC;QACD,IAAI,IAAI,CAAC,gBAAgB,KAAK,SAAS;YAAE,KAAK,CAAC,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,gBAAgB,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IAChH,CAAC;IAEO,aAAa,CAAC,GAAW,EAAE,IAAY;QAC9C,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACzC,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;QACxD,OAAO,IAAI,CAAC,OAAO,IAAI,MAAM,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;IACxG,CAAC;IAEO,oBAAoB,CAAC,GAAW,EAAE,IAAY;QACrD,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAC3C,IAAI,QAAQ,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC,aAAa,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACjE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,GAAG,QAAQ,CAAC;QACnC,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC;QAC7D,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;QAC/E,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACzB,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACvC,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC/B,IAAI,KAAK,KAAK,IAAI;oBAAE,OAAO,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACxC,CAAC;YACD,OAAO,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACvB,CAAC,CAAC;IACH,CAAC;CACD;AAED,0CAA0C;AAC1C,MAAM,CAAC,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAC;IACvC,SAAS;IACT,UAAU;IACV,OAAO;IACP,aAAa;IACb,SAAS;IACT,UAAU;IACV,YAAY;IACZ,UAAU;IACV,WAAW;IACX,OAAO;IACP,aAAa;IACb,iBAAiB;IACjB,kBAAkB;IAClB,aAAa;IACb,aAAa;IACb,aAAa;CACb,CAAC,CAAC;AAEH,wGAAwG;AACxG,MAAM,aAAa,GAAG;IACrB,eAAe;IACf,eAAe;IACf,eAAe;IACf,mBAAmB;IACnB,kBAAkB;IAClB,cAAc;CACd,CAAC;AAEF,qGAAqG;AACrG,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC;IAC1B,YAAY;IACZ,mBAAmB;IACnB,sBAAsB;IACtB,aAAa;IACb,OAAO;IACP,iBAAiB;IACjB,UAAU;IACV,aAAa;IACb,aAAa;IACb,OAAO;IACP,OAAO;IACP,OAAO;IACP,IAAI;IACJ,MAAM;IACN,MAAM;IACN,MAAM;IACN,aAAa;IACb,kBAAkB;IAClB,uBAAuB;IACvB,kBAAkB;CAClB,CAAC,CAAC;AAEH,gHAAgH;AAChH,SAAS,UAAU,CAAC,QAA4B,EAAE,UAAmB;IACpE,MAAM,MAAM,GAAc,EAAE,CAAC;IAC7B,KAAK,MAAM,MAAM,IAAI,QAAQ,EAAE,CAAC;QAC/B,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;YAAE,OAAO,SAAS,CAAC;QACjF,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC;YAAE,IAAI,CAAC,KAAK,OAAO,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,OAAO,SAAS,CAAC;QACrG,IAAI,OAAO,MAAM,CAAC,KAAK,KAAK,QAAQ,IAAI,MAAM,CAAC,KAAK,KAAK,IAAI;YAAE,OAAO,SAAS,CAAC;QAChF,IAAI,UAAU,IAAI,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAClE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC3B,CAAC;IACD,OAAO,SAAS,CAAC,MAAM,CAAC,CAAC;AAC1B,CAAC;AAED,kGAAkG;AAClG,SAAS,KAAK,CAAC,MAAoB,EAAE,GAAW;IAC/C,MAAM,UAAU,GAAG,MAAM,CAAC,UAAU,CAAC;IACrC,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC;QAAE,OAAO,SAAS,CAAC;IACpH,MAAM,GAAG,GAAG,cAAc,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACrE,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,OAAO,CAAC;QAAE,OAAO,SAAS,CAAC;IAC3E,OAAO,OAAO,GAAG,CAAC,KAAK,KAAK,QAAQ,IAAI,GAAG,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC;AACpF,CAAC;AAED,SAAS,MAAM,CAAC,KAAc;IAC7B,OAAO,OAAO,KAAK,KAAK,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;AACtD,CAAC;AAED,SAAS,OAAO,CAAC,KAAc;IAC9B,OAAO,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;AAC3D,CAAC","sourcesContent":["// 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.\n\nimport {\n\tANNOTATING_FALSE,\n\tANNOTATING_TRUE,\n\ttype AnnotatingCheck,\n\tannotateAll,\n\tannotateAny,\n\tannotateArray,\n\tannotateDependent,\n\tannotateIf,\n\tannotateObject,\n\tignoreAnnotations,\n\tindirectAnnotating,\n\tisolateAnnotations,\n\tscopedAnnotating,\n\tunevaluatedItems,\n\tunevaluatedProperties,\n\twithFreshAnnotations,\n} from \"./annotations.ts\";\nimport {\n\tALWAYS,\n\tand,\n\tanyCheck,\n\tbytesCheck,\n\tconstCheck,\n\tcontainsCheck,\n\tdeclaredObject,\n\tdependentRequiredCheck,\n\tdependentSchemasCheck,\n\tenumCheck,\n\tGUARD_LOOSE,\n\tGUARD_NONE,\n\tGUARD_STRICT,\n\ttype Guard,\n\tguardArray,\n\tguardObject,\n\tINHERITED,\n\tIS_ARRAY,\n\tIS_OBJECT,\n\tifCheck,\n\tindirect,\n\titemsCheck,\n\tLEAF_CODES,\n\tlengthCheck,\n\tlistCheck,\n\tNEVER,\n\tnotCheck,\n\tnumberCheck,\n\toneCheck,\n\topenObject,\n\tpropertyCountCheck,\n\tpropertyNamesCheck,\n\tREQUIRED,\n\tscopedCheck,\n\tstringCheck,\n\tTYPE_CHECKS,\n\ttaggedCheck,\n\ttypeCheck,\n\tuniqueCheck,\n} from \"./checks.ts\";\nimport { documentOf, isSchemaObject, Resolver, resolveUri } from \"./resolver.ts\";\nimport { sharedRegex } from \"./shared.ts\";\nimport type { Check, CompileOptions, FormatCheck, JsonSchema, SchemaObject } from \"./types.ts\";\n\n/** Thrown when a compile without dynamic scope tracking meets a bookended `$dynamicRef`: compile again with it. */\nexport const RESTART = Symbol(\"restart\");\n\n/** One compile of a schema. Its caches and indexes are garbage once the root check is built. */\nexport class Compiler {\n\treadonly r: Resolver;\n\treadonly draft: \"2020-12\" | \"7\";\n\treadonly formats: Readonly<Record<string, FormatCheck>> | undefined;\n\t/** Whether checks track the dynamic scope (the schema has a bookended `$dynamicRef`). */\n\treadonly dynamic: boolean;\n\tprivate readonly schema: JsonSchema;\n\tprivate readonly scope: string[];\n\tprivate readonly cache = new Map<object, Check>();\n\tprivate readonly annotatingCache = new Map<object, AnnotatingCheck>();\n\n\tconstructor(schema: JsonSchema, options: CompileOptions, dynamic: boolean) {\n\t\tthis.schema = schema;\n\t\tthis.r = new Resolver(schema, options);\n\t\tthis.draft = this.r.draft;\n\t\tthis.formats = options.formats;\n\t\tthis.dynamic = dynamic;\n\t\tthis.scope = [];\n\t}\n\n\t/** The check of the root schema. */\n\troot(): Check {\n\t\treturn this.check(this.schema, this.r.rootBase);\n\t}\n\n\t/** The check of a schema (cached by schema object; a recursive reference goes through an indirection). */\n\tcheck(node: unknown, base: string): Check {\n\t\tif (node === true) return ALWAYS;\n\t\tif (node === false) return NEVER;\n\t\tif (!isSchemaObject(node))\n\t\t\tthrow new Error(`A schema must be an object or a boolean, got ${JSON.stringify(node)}`);\n\t\tconst cached = this.cache.get(node);\n\t\tif (cached !== undefined) return cached;\n\t\tconst bare = this.bareType(node);\n\t\tif (bare !== undefined) return bare;\n\t\tconst slot: { check: Check | undefined } = { check: undefined };\n\t\tthis.cache.set(node, indirect(slot));\n\t\tconst check = this.build(node, this.r.baseFor(node, base));\n\t\tslot.check = check;\n\t\tthis.cache.set(node, check);\n\t\treturn check;\n\t}\n\n\tprivate build(node: SchemaObject, base: string): Check {\n\t\tif (this.draft === \"7\" && typeof node.$ref === \"string\") return this.ref(node.$ref, base);\n\t\tif (this.draft !== \"7\" && (node.unevaluatedProperties !== undefined || node.unevaluatedItems !== undefined)) {\n\t\t\treturn withFreshAnnotations(this.annotating(node, base));\n\t\t}\n\t\tconst check = this.plain(node, base);\n\t\treturn this.dynamic && this.r.isResource(node, base) ? scopedCheck(this.scope, base, check) : check;\n\t}\n\n\t/**\n\t * The module-level check of a schema that is only a `type` (with annotations), `ALWAYS` for one with no assertion\n\t * at all; undefined for every other schema. These are the most common subschemas and cost nothing to share.\n\t */\n\tprivate bareType(node: SchemaObject): Check | undefined {\n\t\tlet type: unknown;\n\t\tfor (const k in node) {\n\t\t\tif (k === \"type\") type = node.type;\n\t\t\telse if (!NEUTRAL_KEYWORDS.has(k)) return undefined;\n\t\t}\n\t\tif (type === undefined) return ALWAYS;\n\t\treturn typeof type === \"string\" ? TYPE_CHECKS.get(type) : undefined;\n\t}\n\n\t/** Every keyword of `node`, not tracking annotations. */\n\tprivate plain(node: SchemaObject, base: string): Check {\n\t\tconst parts: Check[] = [];\n\t\tconst types = node.type === undefined ? undefined : Array.isArray(node.type) ? node.type : [node.type];\n\t\tconst single = types?.length === 1 ? types[0] : undefined;\n\t\tlet typeInGroup = false;\n\t\tif (single === \"bytes\") {\n\t\t\tparts.push(bytesCheck(number(node.minLength) ?? 0, number(node.maxLength) ?? Number.POSITIVE_INFINITY));\n\t\t\ttypeInGroup = true;\n\t\t} else {\n\t\t\tconst string = this.stringGroup(node, single === \"string\");\n\t\t\tif (string !== undefined) parts.push(string);\n\t\t\tconst numeric = single === \"number\" || single === \"integer\";\n\t\t\tconst number = this.numberGroup(node, single === \"number\" ? 1 : single === \"integer\" ? 2 : 0);\n\t\t\tif (number !== undefined) parts.push(number);\n\t\t\tconst object = this.objectGroup(node, base, single === \"object\");\n\t\t\tif (object !== undefined) parts.push(object);\n\t\t\tconst array = this.arrayGroup(node, base, single === \"array\");\n\t\t\tif (array !== undefined) parts.push(array);\n\t\t\ttypeInGroup =\n\t\t\t\t(single === \"string\" && string !== undefined) ||\n\t\t\t\t(numeric && number !== undefined) ||\n\t\t\t\t(single === \"object\" && object !== undefined) ||\n\t\t\t\t(single === \"array\" && array !== undefined);\n\t\t}\n\t\tif (types !== undefined && !typeInGroup) parts.unshift(typeCheck(types));\n\t\tthis.inPlace(node, base, parts);\n\t\treturn and(parts);\n\t}\n\n\t// The keywords that apply to the value itself, whatever its type.\n\tprivate inPlace(node: SchemaObject, base: string, parts: Check[]): void {\n\t\tif (Array.isArray(node.enum)) parts.push(enumCheck(node.enum));\n\t\tif (Object.hasOwn(node, \"const\")) parts.push(constCheck(node.const));\n\t\tif (Array.isArray(node.allOf)) parts.push(and(node.allOf.map((s) => this.check(s, base))));\n\t\tif (Array.isArray(node.anyOf)) parts.push(this.union(node.anyOf, base, false));\n\t\tif (Array.isArray(node.oneOf)) parts.push(this.union(node.oneOf, base, true));\n\t\tif (node.not !== undefined) parts.push(notCheck(this.check(node.not, base)));\n\t\tif (node.if !== undefined && (node.then !== undefined || node.else !== undefined)) {\n\t\t\tconst then = node.then === undefined ? ALWAYS : this.check(node.then, base);\n\t\t\tconst otherwise = node.else === undefined ? ALWAYS : this.check(node.else, base);\n\t\t\tparts.push(ifCheck(this.check(node.if, base), then, otherwise));\n\t\t}\n\t\tif (typeof node.$ref === \"string\") parts.push(this.ref(node.$ref, base));\n\t\tif (this.draft !== \"7\" && typeof node.$dynamicRef === \"string\") {\n\t\t\tparts.push(this.dynamicRef(node.$dynamicRef, base));\n\t\t}\n\t}\n\n\tprivate union(branches: readonly unknown[], base: string, exactlyOne: boolean): Check {\n\t\tconst checks = () => branches.map((s) => this.check(s, base));\n\t\treturn (\n\t\t\tconstUnion(branches, exactlyOne) ??\n\t\t\tthis.tagged(branches, base) ??\n\t\t\t(exactlyOne ? oneCheck(checks()) : anyCheck(checks()))\n\t\t);\n\t}\n\n\tprivate ref(ref: string, base: string): Check {\n\t\tconst target = this.r.resolve(ref, base);\n\t\tconst check = this.check(target.node, target.base);\n\t\treturn this.dynamic && target.base !== base ? scopedCheck(this.scope, target.base, check) : check;\n\t}\n\n\tprivate dynamicRef(ref: string, base: string): Check {\n\t\tconst resolved = this.bookended(ref, base);\n\t\tif (resolved === undefined) return this.ref(ref, base);\n\t\tconst { initial, name } = resolved;\n\t\tconst fallback = this.check(initial.node, initial.base);\n\t\tconst lookup = this.dynamicLookup(name, (node, b) => this.check(node, b));\n\t\tconst scope = this.scope;\n\t\treturn (v) => {\n\t\t\tfor (let i = 0; i < scope.length; i++) {\n\t\t\t\tconst check = lookup(scope[i]);\n\t\t\t\tif (check !== null) return check(v);\n\t\t\t}\n\t\t\treturn fallback(v);\n\t\t};\n\t}\n\n\t/** The initial target and anchor name of a `$dynamicRef` that resolves dynamically, or undefined for a plain ref. */\n\tprivate bookended(\n\t\tref: string,\n\t\tbase: string,\n\t): { initial: { node: unknown; base: string }; name: string } | undefined {\n\t\tconst initial = this.r.resolve(ref, base);\n\t\tconst uri = resolveUri(ref, base);\n\t\tconst name = uri.slice(documentOf(uri).length + 1);\n\t\tconst anchored = isSchemaObject(initial.node) && initial.node.$dynamicAnchor === name;\n\t\tif (name === \"\" || name.startsWith(\"/\") || !anchored) return undefined;\n\t\tif (!this.dynamic) throw RESTART;\n\t\treturn { initial, name };\n\t}\n\n\t// Resolved at run time against the dynamic scope, so a schema with a bookended $dynamicRef keeps its compiler.\n\tprivate dynamicLookup<T>(name: string, compile: (node: SchemaObject, base: string) => T): (uri: string) => T | null {\n\t\tconst found = new Map<string, T | null>();\n\t\treturn (uri) => {\n\t\t\tconst key = `${uri}#${name}`;\n\t\t\tlet check = found.get(key);\n\t\t\tif (check === undefined) {\n\t\t\t\tconst target = this.r.dynamicAnchors.get(key);\n\t\t\t\tcheck = target === undefined ? null : compile(target, this.r.baseOf.get(target) ?? uri);\n\t\t\t\tfound.set(key, check);\n\t\t\t}\n\t\t\treturn check;\n\t\t};\n\t}\n\n\t/** anyOf/oneOf whose branches are all objects with a distinct required const on one key: the tag picks the branch. */\n\tprivate tagged(branches: readonly unknown[], base: string): Check | undefined {\n\t\tif (branches.length < 2) return undefined;\n\t\tconst resolved: SchemaObject[] = [];\n\t\tfor (const branch of branches) {\n\t\t\tif (!isSchemaObject(branch)) return undefined;\n\t\t\tconst ref = typeof branch.$ref === \"string\" && Object.keys(branch).length === 1 ? branch.$ref : undefined;\n\t\t\tconst node = ref === undefined ? branch : this.r.resolve(ref, this.r.baseFor(branch, base)).node;\n\t\t\tif (!isSchemaObject(node)) return undefined;\n\t\t\tresolved.push(node);\n\t\t}\n\t\tconst first = resolved[0].properties;\n\t\tif (!isSchemaObject(first)) return undefined;\n\t\tfor (const key of Object.keys(first)) {\n\t\t\tconst tags = resolved.map((s) => tagOf(s, key));\n\t\t\tif (tags.some((t) => t === undefined) || new Set(tags).size !== tags.length) continue;\n\t\t\treturn taggedCheck(\n\t\t\t\tkey,\n\t\t\t\ttags,\n\t\t\t\tbranches.map((s) => this.check(s, base)),\n\t\t\t);\n\t\t}\n\t\treturn undefined;\n\t}\n\n\tprivate stringGroup(node: SchemaObject, strict: boolean): Check | undefined {\n\t\tconst min = number(node.minLength) ?? 0;\n\t\tconst max = number(node.maxLength) ?? Number.POSITIVE_INFINITY;\n\t\tconst re = typeof node.pattern === \"string\" ? sharedRegex(node.pattern) : undefined;\n\t\tconst format =\n\t\t\tthis.formats !== undefined && typeof node.format === \"string\" && Object.hasOwn(this.formats, node.format)\n\t\t\t\t? this.formats[node.format]\n\t\t\t\t: undefined;\n\t\tif (min === 0 && max === Number.POSITIVE_INFINITY && re === undefined && format === undefined) return undefined;\n\t\treturn stringCheck(strict, min, max, re, format);\n\t}\n\n\tprivate numberGroup(node: SchemaObject, mode: 0 | 1 | 2): Check | undefined {\n\t\tconst min = number(node.minimum);\n\t\tconst max = number(node.maximum);\n\t\tconst xmin = number(node.exclusiveMinimum);\n\t\tconst xmax = number(node.exclusiveMaximum);\n\t\tconst multipleOf = number(node.multipleOf);\n\t\tif ([min, max, xmin, xmax, multipleOf].every((x) => x === undefined)) return undefined;\n\t\tconst inf = Number.POSITIVE_INFINITY;\n\t\treturn numberCheck(mode, min ?? -inf, max ?? inf, xmin ?? -inf, xmax ?? inf, multipleOf);\n\t}\n\n\tprivate objectGroup(node: SchemaObject, base: string, strict: boolean): Check | undefined {\n\t\tconst onlyCore = OBJECT_EXTRAS.every((k) => node[k] === undefined);\n\t\t// A schema with only the core object keywords gets one closure that also does the type guard.\n\t\tconst core = this.objectCore(node, base, onlyCore ? (strict ? GUARD_STRICT : GUARD_LOOSE) : GUARD_NONE);\n\t\tif (core !== undefined && onlyCore) return core;\n\t\tconst parts: Check[] = core === undefined ? [] : [core];\n\t\tif (node.propertyNames !== undefined) parts.push(propertyNamesCheck(this.check(node.propertyNames, base)));\n\t\tconst minProperties = number(node.minProperties);\n\t\tconst maxProperties = number(node.maxProperties);\n\t\tif (minProperties !== undefined || maxProperties !== undefined) {\n\t\t\tparts.push(propertyCountCheck(minProperties ?? 0, maxProperties ?? Number.POSITIVE_INFINITY));\n\t\t}\n\t\tconst dependentRequired: [string, string[]][] = [];\n\t\tconst dependentSchemas: [string, Check][] = [];\n\t\tif (this.draft !== \"7\") {\n\t\t\tfor (const [k, list] of entries(node.dependentRequired))\n\t\t\t\tif (Array.isArray(list)) dependentRequired.push([k, list]);\n\t\t\tfor (const [k, s] of entries(node.dependentSchemas)) dependentSchemas.push([k, this.check(s, base)]);\n\t\t}\n\t\tfor (const [k, d] of entries(node.dependencies)) {\n\t\t\tif (Array.isArray(d)) dependentRequired.push([k, d]);\n\t\t\telse dependentSchemas.push([k, this.check(d, base)]);\n\t\t}\n\t\tif (dependentRequired.length > 0) parts.push(dependentRequiredCheck(dependentRequired));\n\t\tif (dependentSchemas.length > 0) parts.push(dependentSchemasCheck(dependentSchemas));\n\t\tif (parts.length === 0) return strict ? IS_OBJECT : undefined;\n\t\treturn guardObject(and(parts), strict);\n\t}\n\n\tprivate objectCore(node: SchemaObject, base: string, guard: Guard): Check | undefined {\n\t\tconst properties = isSchemaObject(node.properties) ? node.properties : {};\n\t\tconst required = Array.isArray(node.required) ? node.required.filter((k) => typeof k === \"string\") : [];\n\t\tconst patterns = isSchemaObject(node.patternProperties) ? node.patternProperties : {};\n\t\tconst additional = node.additionalProperties;\n\t\tconst keys = Object.keys(properties);\n\t\tconst patternKeys = Object.keys(patterns);\n\t\tif (\n\t\t\tkeys.length + required.length + patternKeys.length === 0 &&\n\t\t\t(additional === undefined || additional === true)\n\t\t) {\n\t\t\treturn undefined;\n\t\t}\n\t\t// One array per object: key, check, flags (leaf code, required, key also names an Object.prototype member).\n\t\tconst entries: unknown[] = [];\n\t\tfor (const k of keys) {\n\t\t\tconst check = this.check(properties[k], base);\n\t\t\tconst flags =\n\t\t\t\t(LEAF_CODES.get(check) ?? 0) |\n\t\t\t\t(required.includes(k) ? REQUIRED : 0) |\n\t\t\t\t(k in Object.prototype ? INHERITED : 0);\n\t\t\tentries.push(k, check, flags);\n\t\t}\n\t\tconst extraRequired = required.filter((k) => !Object.hasOwn(properties, k));\n\t\tconst pats = patternKeys.map((p) => [sharedRegex(p), this.check(patterns[p], base)] as const);\n\t\tconst extra = additional === undefined || additional === true ? undefined : this.check(additional, base);\n\t\tif (pats.length === 0 && extraRequired.length === 0 && (extra === undefined || additional === false)) {\n\t\t\tconst requiredCount = keys.filter((k) => required.includes(k)).length;\n\t\t\treturn declaredObject(entries, requiredCount, additional === false, guard);\n\t\t}\n\t\treturn openObject(entries, keys, extraRequired, pats, extra, guard);\n\t}\n\n\tprivate arrayGroup(node: SchemaObject, base: string, strict: boolean): Check | undefined {\n\t\tlet prefix: readonly unknown[] = [];\n\t\tlet rest: unknown;\n\t\tif (Array.isArray(node.items)) {\n\t\t\tprefix = node.items;\n\t\t\trest = node.additionalItems;\n\t\t} else {\n\t\t\tif (this.draft !== \"7\" && Array.isArray(node.prefixItems)) prefix = node.prefixItems;\n\t\t\trest = node.items;\n\t\t}\n\t\tconst prefixChecks = prefix.map((s) => this.check(s, base));\n\t\tconst restCheck = rest === undefined || rest === true ? undefined : this.check(rest, base);\n\t\tconst minItems = number(node.minItems);\n\t\tconst maxItems = number(node.maxItems);\n\t\tif (\n\t\t\tnode.contains === undefined &&\n\t\t\tnode.uniqueItems !== true &&\n\t\t\t(prefixChecks.length > 0 || restCheck !== undefined)\n\t\t) {\n\t\t\t// The common array: one closure for the guard, the length bounds and the items.\n\t\t\tconst guard = strict ? GUARD_STRICT : GUARD_LOOSE;\n\t\t\treturn listCheck(guard, minItems ?? 0, maxItems ?? Number.POSITIVE_INFINITY, prefixChecks, restCheck);\n\t\t}\n\t\tconst parts: Check[] = [];\n\t\tif (prefixChecks.length > 0 || restCheck !== undefined) parts.push(itemsCheck(prefixChecks, restCheck));\n\t\tif (minItems !== undefined || maxItems !== undefined) {\n\t\t\tparts.push(lengthCheck(minItems ?? 0, maxItems ?? Number.POSITIVE_INFINITY));\n\t\t}\n\t\tif (node.contains !== undefined) {\n\t\t\tconst min = this.draft === \"7\" ? 1 : (number(node.minContains) ?? 1);\n\t\t\tconst max =\n\t\t\t\tthis.draft === \"7\" ? Number.POSITIVE_INFINITY : (number(node.maxContains) ?? Number.POSITIVE_INFINITY);\n\t\t\tparts.push(containsCheck(this.check(node.contains, base), min, max));\n\t\t}\n\t\tif (node.uniqueItems === true) parts.push(uniqueCheck);\n\t\tif (parts.length === 0) return strict ? IS_ARRAY : undefined;\n\t\treturn guardArray(and(parts), strict);\n\t}\n\n\t/** The annotating check of a schema evaluated in place (only below `unevaluatedProperties`/`unevaluatedItems`). */\n\tannotating(node: unknown, base: string): AnnotatingCheck {\n\t\tif (node === true) return ANNOTATING_TRUE;\n\t\tif (node === false) return ANNOTATING_FALSE;\n\t\tif (!isSchemaObject(node))\n\t\t\tthrow new Error(`A schema must be an object or a boolean, got ${JSON.stringify(node)}`);\n\t\tconst cached = this.annotatingCache.get(node);\n\t\tif (cached !== undefined) return cached;\n\t\tconst slot: { check: AnnotatingCheck | undefined } = { check: undefined };\n\t\tthis.annotatingCache.set(node, indirectAnnotating(slot));\n\t\tconst check = this.buildAnnotating(node, this.r.baseFor(node, base));\n\t\tslot.check = check;\n\t\tthis.annotatingCache.set(node, check);\n\t\treturn check;\n\t}\n\n\tprivate buildAnnotating(node: SchemaObject, base: string): AnnotatingCheck {\n\t\tconst rest: Record<string, unknown> = {};\n\t\tlet annotates = false;\n\t\tfor (const k of Object.keys(node)) {\n\t\t\tif (ANNOTATING.has(k)) annotates = true;\n\t\t\telse rest[k] = node[k];\n\t\t}\n\t\tconst plain = this.plain(rest, base);\n\t\tconst parts: AnnotatingCheck[] = [];\n\t\tif (annotates) this.annotatingParts(node, base, parts);\n\t\tconst all = parts.length === 0 ? ignoreAnnotations(plain) : annotateAll(plain, parts);\n\t\tconst own =\n\t\t\tnode.unevaluatedProperties !== undefined || node.unevaluatedItems !== undefined\n\t\t\t\t? isolateAnnotations(all)\n\t\t\t\t: all;\n\t\treturn this.dynamic && this.r.isResource(node, base) ? scopedAnnotating(this.scope, base, own) : own;\n\t}\n\n\tprivate annotatingParts(node: SchemaObject, base: string, parts: AnnotatingCheck[]): void {\n\t\tif (\n\t\t\tnode.properties !== undefined ||\n\t\t\tnode.patternProperties !== undefined ||\n\t\t\tnode.additionalProperties !== undefined\n\t\t) {\n\t\t\tconst props = entries(node.properties).map(([k, s]) => [k, this.check(s, base)] as const);\n\t\t\tconst pats = entries(node.patternProperties).map(([p, s]) => [sharedRegex(p), this.check(s, base)] as const);\n\t\t\tconst extra =\n\t\t\t\tnode.additionalProperties === undefined ? undefined : this.check(node.additionalProperties, base);\n\t\t\tparts.push(annotateObject(props, pats, extra));\n\t\t}\n\t\tif (node.prefixItems !== undefined || node.items !== undefined || node.contains !== undefined) {\n\t\t\tconst prefix = Array.isArray(node.prefixItems)\n\t\t\t\t? node.prefixItems\n\t\t\t\t: Array.isArray(node.items)\n\t\t\t\t\t? node.items\n\t\t\t\t\t: [];\n\t\t\tconst rest = Array.isArray(node.items) ? node.additionalItems : node.items;\n\t\t\tparts.push(\n\t\t\t\tannotateArray(\n\t\t\t\t\tprefix.map((s) => this.check(s, base)),\n\t\t\t\t\trest === undefined ? undefined : this.check(rest, base),\n\t\t\t\t\tnode.contains === undefined ? undefined : this.check(node.contains, base),\n\t\t\t\t\tnumber(node.minContains) ?? 1,\n\t\t\t\t\tnumber(node.maxContains) ?? Number.POSITIVE_INFINITY,\n\t\t\t\t),\n\t\t\t);\n\t\t}\n\t\tif (Array.isArray(node.allOf)) for (const s of node.allOf) parts.push(this.annotating(s, base));\n\t\tif (Array.isArray(node.anyOf))\n\t\t\tparts.push(\n\t\t\t\tannotateAny(\n\t\t\t\t\tnode.anyOf.map((s) => this.annotating(s, base)),\n\t\t\t\t\tfalse,\n\t\t\t\t),\n\t\t\t);\n\t\tif (Array.isArray(node.oneOf))\n\t\t\tparts.push(\n\t\t\t\tannotateAny(\n\t\t\t\t\tnode.oneOf.map((s) => this.annotating(s, base)),\n\t\t\t\t\ttrue,\n\t\t\t\t),\n\t\t\t);\n\t\tif (node.if !== undefined) {\n\t\t\tconst then = node.then === undefined ? undefined : this.annotating(node.then, base);\n\t\t\tconst otherwise = node.else === undefined ? undefined : this.annotating(node.else, base);\n\t\t\tparts.push(annotateIf(this.annotating(node.if, base), then, otherwise));\n\t\t}\n\t\tif (typeof node.$ref === \"string\") parts.push(this.annotatingRef(node.$ref, base));\n\t\tif (typeof node.$dynamicRef === \"string\") parts.push(this.annotatingDynamicRef(node.$dynamicRef, base));\n\t\tfor (const [k, s] of entries(node.dependentSchemas)) parts.push(annotateDependent(k, this.annotating(s, base)));\n\t\tif (node.unevaluatedProperties !== undefined) {\n\t\t\tparts.push(unevaluatedProperties(this.check(node.unevaluatedProperties, base)));\n\t\t}\n\t\tif (node.unevaluatedItems !== undefined) parts.push(unevaluatedItems(this.check(node.unevaluatedItems, base)));\n\t}\n\n\tprivate annotatingRef(ref: string, base: string): AnnotatingCheck {\n\t\tconst target = this.r.resolve(ref, base);\n\t\tconst check = this.annotating(target.node, target.base);\n\t\treturn this.dynamic && target.base !== base ? scopedAnnotating(this.scope, target.base, check) : check;\n\t}\n\n\tprivate annotatingDynamicRef(ref: string, base: string): AnnotatingCheck {\n\t\tconst resolved = this.bookended(ref, base);\n\t\tif (resolved === undefined) return this.annotatingRef(ref, base);\n\t\tconst { initial, name } = resolved;\n\t\tconst fallback = this.annotating(initial.node, initial.base);\n\t\tconst lookup = this.dynamicLookup(name, (node, b) => this.annotating(node, b));\n\t\tconst scope = this.scope;\n\t\treturn (v, a) => {\n\t\t\tfor (let i = 0; i < scope.length; i++) {\n\t\t\t\tconst check = lookup(scope[i]);\n\t\t\t\tif (check !== null) return check(v, a);\n\t\t\t}\n\t\t\treturn fallback(v, a);\n\t\t};\n\t}\n}\n\n/** Keywords that never affect a check. */\nexport const NEUTRAL_KEYWORDS = new Set([\n\t\"$schema\",\n\t\"$comment\",\n\t\"title\",\n\t\"description\",\n\t\"default\",\n\t\"examples\",\n\t\"deprecated\",\n\t\"readOnly\",\n\t\"writeOnly\",\n\t\"$defs\",\n\t\"definitions\",\n\t\"contentEncoding\",\n\t\"contentMediaType\",\n\t\"minContains\",\n\t\"maxContains\",\n\t\"$vocabulary\",\n]);\n\n// The object keywords besides the core (properties, required, patternProperties, additionalProperties).\nconst OBJECT_EXTRAS = [\n\t\"propertyNames\",\n\t\"minProperties\",\n\t\"maxProperties\",\n\t\"dependentRequired\",\n\t\"dependentSchemas\",\n\t\"dependencies\",\n];\n\n// The keywords an annotating check handles itself; every other keyword compiles into its plain part.\nconst ANNOTATING = new Set([\n\t\"properties\",\n\t\"patternProperties\",\n\t\"additionalProperties\",\n\t\"prefixItems\",\n\t\"items\",\n\t\"additionalItems\",\n\t\"contains\",\n\t\"minContains\",\n\t\"maxContains\",\n\t\"allOf\",\n\t\"anyOf\",\n\t\"oneOf\",\n\t\"if\",\n\t\"then\",\n\t\"else\",\n\t\"$ref\",\n\t\"$dynamicRef\",\n\t\"dependentSchemas\",\n\t\"unevaluatedProperties\",\n\t\"unevaluatedItems\",\n]);\n\n/** anyOf/oneOf whose branches are all `{ const: primitive }`: an enum (distinct values make oneOf the same). */\nfunction constUnion(branches: readonly unknown[], exactlyOne: boolean): Check | undefined {\n\tconst values: unknown[] = [];\n\tfor (const branch of branches) {\n\t\tif (!isSchemaObject(branch) || !Object.hasOwn(branch, \"const\")) return undefined;\n\t\tfor (const k of Object.keys(branch)) if (k !== \"const\" && !NEUTRAL_KEYWORDS.has(k)) return undefined;\n\t\tif (typeof branch.const === \"object\" && branch.const !== null) return undefined;\n\t\tif (exactlyOne && values.includes(branch.const)) return undefined;\n\t\tvalues.push(branch.const);\n\t}\n\treturn enumCheck(values);\n}\n\n// The tag of a tagged-union branch: a primitive const on a required property of an object schema.\nfunction tagOf(branch: SchemaObject, key: string): unknown {\n\tconst properties = branch.properties;\n\tif (branch.type !== \"object\" || !Array.isArray(branch.required) || !branch.required.includes(key)) return undefined;\n\tconst tag = isSchemaObject(properties) ? properties[key] : undefined;\n\tif (!isSchemaObject(tag) || !Object.hasOwn(tag, \"const\")) return undefined;\n\treturn typeof tag.const === \"object\" && tag.const !== null ? undefined : tag.const;\n}\n\nfunction number(value: unknown): number | undefined {\n\treturn typeof value === \"number\" ? value : undefined;\n}\n\nfunction entries(value: unknown): [string, unknown][] {\n\treturn isSchemaObject(value) ? Object.entries(value) : [];\n}\n"]}