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

package/dist/explain.d.ts

@@ -0,0 +1,29 @@
+import type { Compiler } from "./compiler.ts";
+import type { ValidationError } from "./types.ts";
+/** Explains failures of one compiled schema. */
+export declare class Explainer {
+    private readonly c;
+    private readonly schema;
+    /**
+     * The errors of `$ref` targets for object values, within one errors() call: a recursive union explains each branch
+     * to pick the one to blame, and every branch would explain the same children again, exponentially in the depth.
+     */
+    private memo;
+    constructor(compiler: Compiler, schema: unknown);
+    /** The errors of `value`, at least one (`value` failed the check). */
+    errors(value: unknown): ValidationError[];
+    private ok;
+    private walk;
+    private walkRef;
+    private walkString;
+    private walkBytes;
+    private walkNumber;
+    private walkObject;
+    private walkArray;
+    private walkUnion;
+    /** How many of the keys of `v` the branch `s` (through a `$ref`) declares in `properties`. */
+    private declaredKeys;
+    private tagOf;
+    private walkUnevaluated;
+}
+//# sourceMappingURL=explain.d.ts.map

package/dist/explain.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"explain.d.ts","sourceRoot":"","sources":["../src/explain.ts"],"names":[],"mappings":"AAeA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AAG9C,OAAO,KAAK,EAAgB,eAAe,EAAE,MAAM,YAAY,CAAC;AAEhE,gDAAgD;AAChD,qBAAa,SAAS;IACrB,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAW;IAC7B,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAU;IACjC;;;OAGG;IACH,OAAO,CAAC,IAAI,CAAgG;IAE5G,YAAY,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAI9C;IAED,sEAAsE;IACtE,MAAM,CAAC,KAAK,EAAE,OAAO,GAAG,eAAe,EAAE,CASxC;IAED,OAAO,CAAC,EAAE;IAKV,OAAO,CAAC,IAAI;IAmDZ,OAAO,CAAC,OAAO;IA2Bf,OAAO,CAAC,UAAU;IAmBlB,OAAO,CAAC,SAAS;IASjB,OAAO,CAAC,UAAU;IAclB,OAAO,CAAC,UAAU;IA0DlB,OAAO,CAAC,SAAS;IAsCjB,OAAO,CAAC,SAAS;IA6CjB,8FAA8F;IAC9F,OAAO,CAAC,YAAY;IAMpB,OAAO,CAAC,KAAK;IAiBb,OAAO,CAAC,eAAe;CAqBvB"}

package/dist/explain.js

@@ -0,0 +1,381 @@
+// Errors of a failed value: a walk over the schema that reports each failing keyword at the value it failed on.
+// It runs only for values that failed the check, using the compiler's checks for subschemas.
+import { newAnnotations } from "./annotations.js";
+import { codePoints, constCheck, containsCheck, enumCheck, isMultiple, isObject, NEVER, TYPE_CHECKS, uniqueCheck, } from "./checks.js";
+import { isSchemaObject } from "./resolver.js";
+import { sharedRegex } from "./shared.js";
+/** Explains failures of one compiled schema. */
+export class Explainer {
+    c;
+    schema;
+    /**
+     * The errors of `$ref` targets for object values, within one errors() call: a recursive union explains each branch
+     * to pick the one to blame, and every branch would explain the same children again, exponentially in the depth.
+     */
+    memo = undefined;
+    constructor(compiler, schema) {
+        this.c = compiler;
+        this.schema = schema;
+        compiler.root();
+    }
+    /** The errors of `value`, at least one (`value` failed the check). */
+    errors(value) {
+        const out = [];
+        try {
+            this.walk(this.schema, this.c.r.rootBase, value, "", out);
+        }
+        finally {
+            this.memo = undefined;
+        }
+        if (out.length === 0)
+            out.push({ path: "", keyword: "schema", message: "invalid" });
+        return out;
+    }
+    ok(node, base, v) {
+        return this.c.check(node, base)(v);
+    }
+    // For $dynamicRef schemas this check runs outside the original dynamic scope, so their errors are approximate.
+    walk(node, base, v, path, out) {
+        if (node === true)
+            return;
+        if (node === false) {
+            out.push({ path, keyword: "false", message: "no value is allowed here" });
+            return;
+        }
+        if (!isSchemaObject(node))
+            return;
+        const b = this.c.r.baseFor(node, base);
+        if (this.ok(node, b, v))
+            return;
+        const start = out.length;
+        const push = (keyword, message, at = path) => {
+            out.push({ path: at, keyword, message });
+        };
+        if (this.c.draft === "7" && typeof node.$ref === "string") {
+            this.walkRef(node.$ref, b, v, path, out);
+            return;
+        }
+        if (node.type !== undefined) {
+            const types = Array.isArray(node.type) ? node.type : [node.type];
+            const checks = types.map((t) => (typeof t === "string" ? TYPE_CHECKS.get(t) : undefined) ?? NEVER);
+            if (!checks.some((check) => check(v))) {
+                push("type", `expected ${types.join(" or ")}, got ${typeName(v)}`);
+                return;
+            }
+        }
+        if (Array.isArray(node.enum) && !enumCheck(node.enum)(v))
+            push("enum", `expected one of ${listValues(node.enum)}`);
+        if (Object.hasOwn(node, "const") && !constCheck(node.const)(v))
+            push("const", `expected ${JSON.stringify(node.const)}`);
+        if (typeof v === "string" && node.type !== "bytes")
+            this.walkString(node, v, push);
+        if (v instanceof Uint8Array && node.type === "bytes")
+            this.walkBytes(node, v, push);
+        if (typeof v === "number")
+            this.walkNumber(node, v, push);
+        if (isObject(v))
+            this.walkObject(node, b, v, path, out, push);
+        if (Array.isArray(v))
+            this.walkArray(node, b, v, path, out, push);
+        if (Array.isArray(node.allOf))
+            for (const s of node.allOf)
+                this.walk(s, b, v, path, out);
+        if (Array.isArray(node.anyOf))
+            this.walkUnion(node.anyOf, b, v, path, out, false);
+        if (Array.isArray(node.oneOf))
+            this.walkUnion(node.oneOf, b, v, path, out, true);
+        if (node.not !== undefined && this.ok(node.not, b, v))
+            push("not", "must not match the schema in not");
+        if (node.if !== undefined) {
+            const branch = this.ok(node.if, b, v) ? node.then : node.else;
+            if (branch !== undefined)
+                this.walk(branch, b, v, path, out);
+        }
+        if (typeof node.$ref === "string")
+            this.walkRef(node.$ref, b, v, path, out);
+        if (out.length === start && (node.unevaluatedProperties !== undefined || node.unevaluatedItems !== undefined)) {
+            this.walkUnevaluated(node, b, v, path, out);
+        }
+        if (out.length === start && typeof node.$dynamicRef === "string") {
+            push("$dynamicRef", "does not match the dynamically referenced schema");
+        }
+    }
+    walkRef(ref, base, v, path, out) {
+        const target = this.c.r.resolve(ref, base);
+        if (target.node === false && this.c.r.isUnresolved(ref, base)) {
+            out.push({ path, keyword: "$ref", message: `unresolved reference ${ref}` });
+            return;
+        }
+        if (!isSchemaObject(target.node) || typeof v !== "object" || v === null) {
+            this.walk(target.node, target.base, v, path, out);
+            return;
+        }
+        this.memo ??= new Map();
+        let values = this.memo.get(target.node);
+        const known = values?.get(v);
+        if (known !== undefined && known.path === path) {
+            out.push(...known.errors);
+            return;
+        }
+        const errors = [];
+        this.walk(target.node, target.base, v, path, errors);
+        if (values === undefined) {
+            values = new Map();
+            this.memo.set(target.node, values);
+        }
+        values.set(v, { path, errors });
+        out.push(...errors);
+    }
+    walkString(node, v, push) {
+        const n = codePoints(v);
+        if (typeof node.minLength === "number" && n < node.minLength) {
+            push("minLength", `expected at least ${node.minLength} characters`);
+        }
+        if (typeof node.maxLength === "number" && n > node.maxLength) {
+            push("maxLength", `expected at most ${node.maxLength} characters`);
+        }
+        if (typeof node.pattern === "string" && !sharedRegex(node.pattern).test(v)) {
+            push("pattern", `expected to match ${node.pattern}`);
+        }
+        const formats = this.c.formats;
+        const format = formats !== undefined && typeof node.format === "string" && Object.hasOwn(formats, node.format)
+            ? formats[node.format]
+            : undefined;
+        if (format !== undefined && !format(v))
+            push("format", `expected format ${node.format}`);
+    }
+    walkBytes(node, v, push) {
+        if (typeof node.minLength === "number" && v.length < node.minLength) {
+            push("minLength", `expected at least ${node.minLength} bytes`);
+        }
+        if (typeof node.maxLength === "number" && v.length > node.maxLength) {
+            push("maxLength", `expected at most ${node.maxLength} bytes`);
+        }
+    }
+    walkNumber(node, v, push) {
+        if (typeof node.minimum === "number" && v < node.minimum)
+            push("minimum", `expected >= ${node.minimum}`);
+        if (typeof node.maximum === "number" && v > node.maximum)
+            push("maximum", `expected <= ${node.maximum}`);
+        if (typeof node.exclusiveMinimum === "number" && v <= node.exclusiveMinimum) {
+            push("exclusiveMinimum", `expected > ${node.exclusiveMinimum}`);
+        }
+        if (typeof node.exclusiveMaximum === "number" && v >= node.exclusiveMaximum) {
+            push("exclusiveMaximum", `expected < ${node.exclusiveMaximum}`);
+        }
+        if (typeof node.multipleOf === "number" && !isMultiple(v, node.multipleOf)) {
+            push("multipleOf", `expected a multiple of ${node.multipleOf}`);
+        }
+    }
+    walkObject(node, b, v, path, out, push) {
+        const properties = isSchemaObject(node.properties) ? node.properties : {};
+        const required = Array.isArray(node.required) ? node.required : [];
+        for (const k of required) {
+            if (typeof k === "string" && (!Object.hasOwn(v, k) || v[k] === undefined))
+                push("required", "missing", pointer(path, k));
+        }
+        for (const k of Object.keys(properties)) {
+            if (Object.hasOwn(v, k) && v[k] !== undefined)
+                this.walk(properties[k], b, v[k], pointer(path, k), out);
+        }
+        const patterns = isSchemaObject(node.patternProperties) ? Object.entries(node.patternProperties) : [];
+        for (const k of Object.keys(v)) {
+            let matched = Object.hasOwn(properties, k);
+            for (const [p, s] of patterns) {
+                if (sharedRegex(p).test(k)) {
+                    matched = true;
+                    this.walk(s, b, v[k], pointer(path, k), out);
+                }
+            }
+            if (!matched && node.additionalProperties !== undefined) {
+                if (node.additionalProperties === false)
+                    push("additionalProperties", "unknown field", pointer(path, k));
+                else
+                    this.walk(node.additionalProperties, b, v[k], pointer(path, k), out);
+            }
+            if (node.propertyNames !== undefined && !this.ok(node.propertyNames, b, k)) {
+                push("propertyNames", "invalid property name", pointer(path, k));
+            }
+        }
+        const count = Object.keys(v).length;
+        if (typeof node.minProperties === "number" && count < node.minProperties) {
+            push("minProperties", `expected at least ${node.minProperties} properties`);
+        }
+        if (typeof node.maxProperties === "number" && count > node.maxProperties) {
+            push("maxProperties", `expected at most ${node.maxProperties} properties`);
+        }
+        const dependencies = {
+            ...(this.c.draft === "7" || !isSchemaObject(node.dependentRequired) ? {} : node.dependentRequired),
+            ...(isSchemaObject(node.dependencies) ? node.dependencies : {}),
+        };
+        for (const [k, d] of Object.entries(dependencies)) {
+            if (!Object.hasOwn(v, k))
+                continue;
+            if (!Array.isArray(d))
+                this.walk(d, b, v, path, out);
+            else
+                for (const r of d)
+                    if (!Object.hasOwn(v, r))
+                        push("dependentRequired", `required when ${k} is present`, pointer(path, r));
+        }
+        if (this.c.draft !== "7" && isSchemaObject(node.dependentSchemas)) {
+            for (const [k, s] of Object.entries(node.dependentSchemas))
+                if (Object.hasOwn(v, k))
+                    this.walk(s, b, v, path, out);
+        }
+    }
+    walkArray(node, b, v, path, out, push) {
+        let prefix = [];
+        let rest;
+        if (Array.isArray(node.items)) {
+            prefix = node.items;
+            rest = node.additionalItems;
+        }
+        else {
+            if (this.c.draft !== "7" && Array.isArray(node.prefixItems))
+                prefix = node.prefixItems;
+            rest = node.items;
+        }
+        for (let i = 0; i < v.length; i++) {
+            const s = i < prefix.length ? prefix[i] : rest;
+            if (s !== undefined)
+                this.walk(s, b, v[i], `${path}/${i}`, out);
+        }
+        if (typeof node.minItems === "number" && v.length < node.minItems) {
+            push("minItems", `expected at least ${node.minItems} items`);
+        }
+        if (typeof node.maxItems === "number" && v.length > node.maxItems) {
+            push("maxItems", `expected at most ${node.maxItems} items`);
+        }
+        if (node.uniqueItems === true && !uniqueCheck(v))
+            push("uniqueItems", "expected unique items");
+        if (node.contains !== undefined) {
+            const draft7 = this.c.draft === "7";
+            const min = draft7 || typeof node.minContains !== "number" ? 1 : node.minContains;
+            const max = draft7 || typeof node.maxContains !== "number" ? Number.POSITIVE_INFINITY : node.maxContains;
+            if (!containsCheck(this.c.check(node.contains, b), min, max)(v)) {
+                push("contains", containsMessage(min, max));
+            }
+        }
+    }
+    walkUnion(branches, b, v, path, out, exactlyOne) {
+        const matches = branches.filter((s) => this.ok(s, b, v)).length;
+        if (matches === 1 || (!exactlyOne && matches > 0))
+            return;
+        const keyword = exactlyOne ? "oneOf" : "anyOf";
+        if (matches > 1) {
+            out.push({ path, keyword, message: "matches more than one alternative" });
+            return;
+        }
+        // A tagged union reports the branch its tag selects; otherwise the branch whose first error is deepest.
+        const tag = this.tagOf(branches, b);
+        if (tag !== undefined && isObject(v)) {
+            const i = tag.values.indexOf(v[tag.key]);
+            if (i < 0)
+                out.push({
+                    path: pointer(path, tag.key),
+                    keyword,
+                    message: `expected one of ${listValues(tag.values)}`,
+                });
+            else
+                this.walk(branches[i], b, v, path, out);
+            return;
+        }
+        // An object is blamed on the branch that declares most of its properties (the one it was most likely meant for),
+        // then on the branch whose first error is deepest.
+        let best;
+        for (const s of branches) {
+            const errors = [];
+            this.walk(s, b, v, path, errors);
+            if (errors.length === 0)
+                continue;
+            const declared = isObject(v) ? this.declaredKeys(s, b, v) : 0;
+            const better = best === undefined ||
+                declared > best.declared ||
+                (declared === best.declared && errors[0].path.length > best.errors[0].path.length);
+            if (better)
+                best = { errors, declared };
+        }
+        out.push(...(best?.errors ?? [{ path, keyword, message: "matches no alternative" }]));
+    }
+    /** How many of the keys of `v` the branch `s` (through a `$ref`) declares in `properties`. */
+    declaredKeys(s, b, v) {
+        const node = isSchemaObject(s) && typeof s.$ref === "string" ? this.c.r.resolve(s.$ref, b).node : s;
+        const properties = isSchemaObject(node) && isSchemaObject(node.properties) ? node.properties : {};
+        return Object.keys(v).filter((k) => Object.hasOwn(properties, k)).length;
+    }
+    tagOf(branches, b) {
+        const resolved = branches.map((s) => isSchemaObject(s) && typeof s.$ref === "string" ? this.c.r.resolve(s.$ref, b).node : s);
+        const first = resolved[0];
+        if (!isSchemaObject(first) || !isSchemaObject(first.properties))
+            return undefined;
+        for (const key of Object.keys(first.properties)) {
+            const values = resolved.map((s) => {
+                const tag = isSchemaObject(s) && isSchemaObject(s.properties) ? s.properties[key] : undefined;
+                return isSchemaObject(tag) ? tag.const : undefined;
+            });
+            const primitive = values.every((x) => x !== undefined && (typeof x !== "object" || x === null));
+            if (primitive && new Set(values).size === values.length)
+                return { key, values };
+        }
+        return undefined;
+    }
+    walkUnevaluated(node, b, v, path, out) {
+        const { unevaluatedProperties, unevaluatedItems, ...rest } = node;
+        const a = newAnnotations();
+        this.c.annotating(rest, b)(v, a);
+        if (isObject(v) && unevaluatedProperties !== undefined && !a.allProps) {
+            for (const k of Object.keys(v)) {
+                if (a.props?.has(k))
+                    continue;
+                if (unevaluatedProperties === false) {
+                    out.push({ path: pointer(path, k), keyword: "unevaluatedProperties", message: "unknown field" });
+                }
+                else
+                    this.walk(unevaluatedProperties, b, v[k], pointer(path, k), out);
+            }
+        }
+        if (Array.isArray(v) && unevaluatedItems !== undefined && !a.allItems) {
+            for (let i = a.items; i < v.length; i++) {
+                if (a.indexes?.has(i))
+                    continue;
+                if (unevaluatedItems === false) {
+                    out.push({ path: `${path}/${i}`, keyword: "unevaluatedItems", message: "unexpected item" });
+                }
+                else
+                    this.walk(unevaluatedItems, b, v[i], `${path}/${i}`, out);
+            }
+        }
+    }
+}
+// Enum errors name the allowed values; a long list (an enum of thousands) is cut, so the message stays readable.
+const LISTED_VALUES = 20;
+/** `values` as JSON, at most LISTED_VALUES of them, then how many more there are. */
+function listValues(values) {
+    if (values.length <= LISTED_VALUES)
+        return JSON.stringify(values);
+    const listed = JSON.stringify(values.slice(0, LISTED_VALUES));
+    return `${listed.slice(0, -1)}, ... and ${values.length - LISTED_VALUES} more]`;
+}
+function containsMessage(min, max) {
+    if (max === Number.POSITIVE_INFINITY)
+        return `expected at least ${min} matching ${min === 1 ? "item" : "items"}`;
+    if (min === 0)
+        return `expected at most ${max} matching ${max === 1 ? "item" : "items"}`;
+    return `expected between ${min} and ${max} matching items`;
+}
+function pointer(path, key) {
+    return `${path}/${String(key).replace(/~/g, "~0").replace(/\//g, "~1")}`;
+}
+function typeName(v) {
+    if (v === null)
+        return "null";
+    if (Array.isArray(v))
+        return "array";
+    if (v instanceof Uint8Array)
+        return "bytes";
+    if (typeof v === "number" && Number.isInteger(v))
+        return "integer";
+    return typeof v;
+}
+//# sourceMappingURL=explain.js.map

package/dist/explain.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"explain.js","sourceRoot":"","sources":["../src/explain.ts"],"names":[],"mappings":"AAAA,gHAAgH;AAChH,6FAA6F;AAE7F,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EACN,UAAU,EACV,UAAU,EACV,aAAa,EACb,SAAS,EACT,UAAU,EACV,QAAQ,EACR,KAAK,EACL,WAAW,EACX,WAAW,GACX,MAAM,aAAa,CAAC;AAErB,OAAO,EAAE,cAAc,EAAE,MAAM,eAAe,CAAC;AAC/C,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAG1C,gDAAgD;AAChD,MAAM,OAAO,SAAS;IACJ,CAAC,CAAW;IACZ,MAAM,CAAU;IACjC;;;OAGG;IACK,IAAI,GAAsF,SAAS,CAAC;IAE5G,YAAY,QAAkB,EAAE,MAAe;QAC9C,IAAI,CAAC,CAAC,GAAG,QAAQ,CAAC;QAClB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,QAAQ,CAAC,IAAI,EAAE,CAAC;IACjB,CAAC;IAED,sEAAsE;IACtE,MAAM,CAAC,KAAc;QACpB,MAAM,GAAG,GAAsB,EAAE,CAAC;QAClC,IAAI,CAAC;YACJ,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,KAAK,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC;QAC3D,CAAC;gBAAS,CAAC;YACV,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC;QACvB,CAAC;QACD,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;YAAE,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC,CAAC;QACpF,OAAO,GAAG,CAAC;IACZ,CAAC;IAEO,EAAE,CAAC,IAAa,EAAE,IAAY,EAAE,CAAU;QACjD,OAAO,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC;IAED,+GAA+G;IACvG,IAAI,CAAC,IAAa,EAAE,IAAY,EAAE,CAAU,EAAE,IAAY,EAAE,GAAsB;QACzF,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO;QAC1B,IAAI,IAAI,KAAK,KAAK,EAAE,CAAC;YACpB,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,0BAA0B,EAAE,CAAC,CAAC;YAC1E,OAAO;QACR,CAAC;QACD,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC;YAAE,OAAO;QAClC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACvC,IAAI,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC;YAAE,OAAO;QAChC,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,CAAC;QACzB,MAAM,IAAI,GAAG,CAAC,OAAe,EAAE,OAAe,EAAE,EAAE,GAAG,IAAI,EAAE,EAAE;YAC5D,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,OAAO,EAAE,OAAO,EAAE,CAAC,CAAC;QAC1C,CAAC,CAAC;QACF,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,KAAK,GAAG,IAAI,OAAO,IAAI,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;YAC3D,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;YACzC,OAAO;QACR,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;YAC7B,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjE,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,KAAK,CAAC,CAAC;YACnG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACvC,IAAI,CAAC,MAAM,EAAE,YAAY,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;gBACnE,OAAO;YACR,CAAC;QACF,CAAC;QACD,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACvD,IAAI,CAAC,MAAM,EAAE,mBAAmB,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC1D,IAAI,MAAM,CAAC,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;YAC7D,IAAI,CAAC,OAAO,EAAE,YAAY,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACzD,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO;YAAE,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;QACnF,IAAI,CAAC,YAAY,UAAU,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO;YAAE,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;QACpF,IAAI,OAAO,CAAC,KAAK,QAAQ;YAAE,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;QAC1D,IAAI,QAAQ,CAAC,CAAC,CAAC;YAAE,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;QAC9D,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;YAAE,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;QAClE,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC;YAAE,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK;gBAAE,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;QACzF,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC;YAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;QAClF,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC;YAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;QACjF,IAAI,IAAI,CAAC,GAAG,KAAK,SAAS,IAAI,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;YAAE,IAAI,CAAC,KAAK,EAAE,kCAAkC,CAAC,CAAC;QACvG,IAAI,IAAI,CAAC,EAAE,KAAK,SAAS,EAAE,CAAC;YAC3B,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;YAC9D,IAAI,MAAM,KAAK,SAAS;gBAAE,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;QAC9D,CAAC;QACD,IAAI,OAAO,IAAI,CAAC,IAAI,KAAK,QAAQ;YAAE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;QAC5E,IAAI,GAAG,CAAC,MAAM,KAAK,KAAK,IAAI,CAAC,IAAI,CAAC,qBAAqB,KAAK,SAAS,IAAI,IAAI,CAAC,gBAAgB,KAAK,SAAS,CAAC,EAAE,CAAC;YAC/G,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;QAC7C,CAAC;QACD,IAAI,GAAG,CAAC,MAAM,KAAK,KAAK,IAAI,OAAO,IAAI,CAAC,WAAW,KAAK,QAAQ,EAAE,CAAC;YAClE,IAAI,CAAC,aAAa,EAAE,kDAAkD,CAAC,CAAC;QACzE,CAAC;IACF,CAAC;IAEO,OAAO,CAAC,GAAW,EAAE,IAAY,EAAE,CAAU,EAAE,IAAY,EAAE,GAAsB;QAC1F,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAC3C,IAAI,MAAM,CAAC,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC;YAC/D,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,wBAAwB,GAAG,EAAE,EAAE,CAAC,CAAC;YAC5E,OAAO;QACR,CAAC;QACD,IAAI,CAAC,cAAc,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;YACzE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;YAClD,OAAO;QACR,CAAC;QACD,IAAI,CAAC,IAAI,KAAK,IAAI,GAAG,EAAE,CAAC;QACxB,IAAI,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACxC,MAAM,KAAK,GAAG,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;QAC7B,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;YAChD,GAAG,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;YAC1B,OAAO;QACR,CAAC;QACD,MAAM,MAAM,GAAsB,EAAE,CAAC;QACrC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;QACrD,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YAC1B,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;YACnB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACpC,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;QAChC,GAAG,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC;IACrB,CAAC;IAEO,UAAU,CAAC,IAAkB,EAAE,CAAS,EAAE,IAAU;QAC3D,MAAM,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,OAAO,IAAI,CAAC,SAAS,KAAK,QAAQ,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;YAC9D,IAAI,CAAC,WAAW,EAAE,qBAAqB,IAAI,CAAC,SAAS,aAAa,CAAC,CAAC;QACrE,CAAC;QACD,IAAI,OAAO,IAAI,CAAC,SAAS,KAAK,QAAQ,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;YAC9D,IAAI,CAAC,WAAW,EAAE,oBAAoB,IAAI,CAAC,SAAS,aAAa,CAAC,CAAC;QACpE,CAAC;QACD,IAAI,OAAO,IAAI,CAAC,OAAO,KAAK,QAAQ,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;YAC5E,IAAI,CAAC,SAAS,EAAE,qBAAqB,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;QACtD,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC;QAC/B,MAAM,MAAM,GACX,OAAO,KAAK,SAAS,IAAI,OAAO,IAAI,CAAC,MAAM,KAAK,QAAQ,IAAI,MAAM,CAAC,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC;YAC9F,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC;YACtB,CAAC,CAAC,SAAS,CAAC;QACd,IAAI,MAAM,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;YAAE,IAAI,CAAC,QAAQ,EAAE,mBAAmB,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IAC1F,CAAC;IAEO,SAAS,CAAC,IAAkB,EAAE,CAAa,EAAE,IAAU;QAC9D,IAAI,OAAO,IAAI,CAAC,SAAS,KAAK,QAAQ,IAAI,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;YACrE,IAAI,CAAC,WAAW,EAAE,qBAAqB,IAAI,CAAC,SAAS,QAAQ,CAAC,CAAC;QAChE,CAAC;QACD,IAAI,OAAO,IAAI,CAAC,SAAS,KAAK,QAAQ,IAAI,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;YACrE,IAAI,CAAC,WAAW,EAAE,oBAAoB,IAAI,CAAC,SAAS,QAAQ,CAAC,CAAC;QAC/D,CAAC;IACF,CAAC;IAEO,UAAU,CAAC,IAAkB,EAAE,CAAS,EAAE,IAAU;QAC3D,IAAI,OAAO,IAAI,CAAC,OAAO,KAAK,QAAQ,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO;YAAE,IAAI,CAAC,SAAS,EAAE,eAAe,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;QACzG,IAAI,OAAO,IAAI,CAAC,OAAO,KAAK,QAAQ,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO;YAAE,IAAI,CAAC,SAAS,EAAE,eAAe,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;QACzG,IAAI,OAAO,IAAI,CAAC,gBAAgB,KAAK,QAAQ,IAAI,CAAC,IAAI,IAAI,CAAC,gBAAgB,EAAE,CAAC;YAC7E,IAAI,CAAC,kBAAkB,EAAE,cAAc,IAAI,CAAC,gBAAgB,EAAE,CAAC,CAAC;QACjE,CAAC;QACD,IAAI,OAAO,IAAI,CAAC,gBAAgB,KAAK,QAAQ,IAAI,CAAC,IAAI,IAAI,CAAC,gBAAgB,EAAE,CAAC;YAC7E,IAAI,CAAC,kBAAkB,EAAE,cAAc,IAAI,CAAC,gBAAgB,EAAE,CAAC,CAAC;QACjE,CAAC;QACD,IAAI,OAAO,IAAI,CAAC,UAAU,KAAK,QAAQ,IAAI,CAAC,UAAU,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;YAC5E,IAAI,CAAC,YAAY,EAAE,0BAA0B,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC;QACjE,CAAC;IACF,CAAC;IAEO,UAAU,CACjB,IAAkB,EAClB,CAAS,EACT,CAA0B,EAC1B,IAAY,EACZ,GAAsB,EACtB,IAAU;QAEV,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,CAAC,CAAC,EAAE,CAAC;QACnE,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YAC1B,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC;gBACxE,IAAI,CAAC,UAAU,EAAE,SAAS,EAAE,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;QAChD,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;YACzC,IAAI,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,SAAS;gBAAE,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QACzG,CAAC;QACD,MAAM,QAAQ,GAAG,cAAc,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACtG,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;YAChC,IAAI,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;YAC3C,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,QAAQ,EAAE,CAAC;gBAC/B,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC5B,OAAO,GAAG,IAAI,CAAC;oBACf,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;gBAC9C,CAAC;YACF,CAAC;YACD,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,oBAAoB,KAAK,SAAS,EAAE,CAAC;gBACzD,IAAI,IAAI,CAAC,oBAAoB,KAAK,KAAK;oBAAE,IAAI,CAAC,sBAAsB,EAAE,eAAe,EAAE,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;;oBACpG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,oBAAoB,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YAC3E,CAAC;YACD,IAAI,IAAI,CAAC,aAAa,KAAK,SAAS,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;gBAC5E,IAAI,CAAC,eAAe,EAAE,uBAAuB,EAAE,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;YAClE,CAAC;QACF,CAAC;QACD,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QACpC,IAAI,OAAO,IAAI,CAAC,aAAa,KAAK,QAAQ,IAAI,KAAK,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;YAC1E,IAAI,CAAC,eAAe,EAAE,qBAAqB,IAAI,CAAC,aAAa,aAAa,CAAC,CAAC;QAC7E,CAAC;QACD,IAAI,OAAO,IAAI,CAAC,aAAa,KAAK,QAAQ,IAAI,KAAK,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;YAC1E,IAAI,CAAC,eAAe,EAAE,oBAAoB,IAAI,CAAC,aAAa,aAAa,CAAC,CAAC;QAC5E,CAAC;QACD,MAAM,YAAY,GAAG;YACpB,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,KAAK,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,iBAAiB,CAAC;YAClG,GAAG,CAAC,cAAc,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,CAAC;SAC/D,CAAC;QACF,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,EAAE,CAAC;YACnD,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC;gBAAE,SAAS;YACnC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;gBAAE,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;;gBAEpD,KAAK,MAAM,CAAC,IAAI,CAAC;oBAChB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC;wBAAE,IAAI,CAAC,mBAAmB,EAAE,iBAAiB,CAAC,aAAa,EAAE,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;QAC1G,CAAC;QACD,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,KAAK,GAAG,IAAI,cAAc,CAAC,IAAI,CAAC,gBAAgB,CAAC,EAAE,CAAC;YACnE,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,gBAAgB,CAAC;gBACzD,IAAI,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC;oBAAE,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;QACzD,CAAC;IACF,CAAC;IAEO,SAAS,CAChB,IAAkB,EAClB,CAAS,EACT,CAAY,EACZ,IAAY,EACZ,GAAsB,EACtB,IAAU;QAEV,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,CAAC,CAAC,KAAK,KAAK,GAAG,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC;gBAAE,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC;YACvF,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACnB,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,MAAM,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;YAC/C,IAAI,CAAC,KAAK,SAAS;gBAAE,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,IAAI,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACjE,CAAC;QACD,IAAI,OAAO,IAAI,CAAC,QAAQ,KAAK,QAAQ,IAAI,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;YACnE,IAAI,CAAC,UAAU,EAAE,qBAAqB,IAAI,CAAC,QAAQ,QAAQ,CAAC,CAAC;QAC9D,CAAC;QACD,IAAI,OAAO,IAAI,CAAC,QAAQ,KAAK,QAAQ,IAAI,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;YACnE,IAAI,CAAC,UAAU,EAAE,oBAAoB,IAAI,CAAC,QAAQ,QAAQ,CAAC,CAAC;QAC7D,CAAC;QACD,IAAI,IAAI,CAAC,WAAW,KAAK,IAAI,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;YAAE,IAAI,CAAC,aAAa,EAAE,uBAAuB,CAAC,CAAC;QAC/F,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YACjC,MAAM,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC,KAAK,KAAK,GAAG,CAAC;YACpC,MAAM,GAAG,GAAG,MAAM,IAAI,OAAO,IAAI,CAAC,WAAW,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC;YAClF,MAAM,GAAG,GAAG,MAAM,IAAI,OAAO,IAAI,CAAC,WAAW,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,iBAAiB,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC;YACzG,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACjE,IAAI,CAAC,UAAU,EAAE,eAAe,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAC7C,CAAC;QACF,CAAC;IACF,CAAC;IAEO,SAAS,CAChB,QAA4B,EAC5B,CAAS,EACT,CAAU,EACV,IAAY,EACZ,GAAsB,EACtB,UAAmB;QAEnB,MAAM,OAAO,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QAChE,IAAI,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,UAAU,IAAI,OAAO,GAAG,CAAC,CAAC;YAAE,OAAO;QAC1D,MAAM,OAAO,GAAG,UAAU,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC;QAC/C,IAAI,OAAO,GAAG,CAAC,EAAE,CAAC;YACjB,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,mCAAmC,EAAE,CAAC,CAAC;YAC1E,OAAO;QACR,CAAC;QACD,wGAAwG;QACxG,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QACpC,IAAI,GAAG,KAAK,SAAS,IAAI,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;YACtC,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;YACzC,IAAI,CAAC,GAAG,CAAC;gBACR,GAAG,CAAC,IAAI,CAAC;oBACR,IAAI,EAAE,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,GAAG,CAAC;oBAC5B,OAAO;oBACP,OAAO,EAAE,mBAAmB,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE;iBACpD,CAAC,CAAC;;gBACC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;YAC7C,OAAO;QACR,CAAC;QACD,iHAAiH;QACjH,mDAAmD;QACnD,IAAI,IAAiE,CAAC;QACtE,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YAC1B,MAAM,MAAM,GAAsB,EAAE,CAAC;YACrC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;YACjC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;gBAAE,SAAS;YAClC,MAAM,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9D,MAAM,MAAM,GACX,IAAI,KAAK,SAAS;gBAClB,QAAQ,GAAG,IAAI,CAAC,QAAQ;gBACxB,CAAC,QAAQ,KAAK,IAAI,CAAC,QAAQ,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACpF,IAAI,MAAM;gBAAE,IAAI,GAAG,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;QACzC,CAAC;QACD,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,wBAAwB,EAAE,CAAC,CAAC,CAAC,CAAC;IACvF,CAAC;IAED,8FAA8F;IACtF,YAAY,CAAC,CAAU,EAAE,CAAS,EAAE,CAA0B;QACrE,MAAM,IAAI,GAAG,cAAc,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACpG,MAAM,UAAU,GAAG,cAAc,CAAC,IAAI,CAAC,IAAI,cAAc,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;QAClG,OAAO,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAC1E,CAAC;IAEO,KAAK,CAAC,QAA4B,EAAE,CAAS;QACpD,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CACnC,cAAc,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CACtF,CAAC;QACF,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,UAAU,CAAC;YAAE,OAAO,SAAS,CAAC;QAClF,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC;YACjD,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;gBACjC,MAAM,GAAG,GAAG,cAAc,CAAC,CAAC,CAAC,IAAI,cAAc,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;gBAC9F,OAAO,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;YACpD,CAAC,CAAC,CAAC;YACH,MAAM,SAAS,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,SAAS,IAAI,CAAC,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC;YAChG,IAAI,SAAS,IAAI,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,MAAM;gBAAE,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC;QACjF,CAAC;QACD,OAAO,SAAS,CAAC;IAClB,CAAC;IAEO,eAAe,CAAC,IAAkB,EAAE,CAAS,EAAE,CAAU,EAAE,IAAY,EAAE,GAAsB;QACtG,MAAM,EAAE,qBAAqB,EAAE,gBAAgB,EAAE,GAAG,IAAI,EAAE,GAAG,IAAI,CAAC;QAClE,MAAM,CAAC,GAAG,cAAc,EAAE,CAAC;QAC3B,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACjC,IAAI,QAAQ,CAAC,CAAC,CAAC,IAAI,qBAAqB,KAAK,SAAS,IAAI,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;YACvE,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;gBAChC,IAAI,CAAC,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;oBAAE,SAAS;gBAC9B,IAAI,qBAAqB,KAAK,KAAK,EAAE,CAAC;oBACrC,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,OAAO,EAAE,uBAAuB,EAAE,OAAO,EAAE,eAAe,EAAE,CAAC,CAAC;gBAClG,CAAC;;oBAAM,IAAI,CAAC,IAAI,CAAC,qBAAqB,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YACzE,CAAC;QACF,CAAC;QACD,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,gBAAgB,KAAK,SAAS,IAAI,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;YACvE,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,IAAI,CAAC,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC;oBAAE,SAAS;gBAChC,IAAI,gBAAgB,KAAK,KAAK,EAAE,CAAC;oBAChC,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,IAAI,IAAI,CAAC,EAAE,EAAE,OAAO,EAAE,kBAAkB,EAAE,OAAO,EAAE,iBAAiB,EAAE,CAAC,CAAC;gBAC7F,CAAC;;oBAAM,IAAI,CAAC,IAAI,CAAC,gBAAgB,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,IAAI,IAAI,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;YAClE,CAAC;QACF,CAAC;IACF,CAAC;CACD;AAID,iHAAiH;AACjH,MAAM,aAAa,GAAG,EAAE,CAAC;AAEzB,qFAAqF;AACrF,SAAS,UAAU,CAAC,MAA0B;IAC7C,IAAI,MAAM,CAAC,MAAM,IAAI,aAAa;QAAE,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IAClE,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC;IAC9D,OAAO,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,aAAa,MAAM,CAAC,MAAM,GAAG,aAAa,QAAQ,CAAC;AACjF,CAAC;AAED,SAAS,eAAe,CAAC,GAAW,EAAE,GAAW;IAChD,IAAI,GAAG,KAAK,MAAM,CAAC,iBAAiB;QAAE,OAAO,qBAAqB,GAAG,aAAa,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IACjH,IAAI,GAAG,KAAK,CAAC;QAAE,OAAO,oBAAoB,GAAG,aAAa,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;IACzF,OAAO,oBAAoB,GAAG,QAAQ,GAAG,iBAAiB,CAAC;AAC5D,CAAC;AAED,SAAS,OAAO,CAAC,IAAY,EAAE,GAAoB;IAClD,OAAO,GAAG,IAAI,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC;AAC1E,CAAC;AAED,SAAS,QAAQ,CAAC,CAAU;IAC3B,IAAI,CAAC,KAAK,IAAI;QAAE,OAAO,MAAM,CAAC;IAC9B,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;QAAE,OAAO,OAAO,CAAC;IACrC,IAAI,CAAC,YAAY,UAAU;QAAE,OAAO,OAAO,CAAC;IAC5C,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC;QAAE,OAAO,SAAS,CAAC;IACnE,OAAO,OAAO,CAAC,CAAC;AACjB,CAAC","sourcesContent":["// 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.\n\nimport { newAnnotations } from \"./annotations.ts\";\nimport {\n\tcodePoints,\n\tconstCheck,\n\tcontainsCheck,\n\tenumCheck,\n\tisMultiple,\n\tisObject,\n\tNEVER,\n\tTYPE_CHECKS,\n\tuniqueCheck,\n} from \"./checks.ts\";\nimport type { Compiler } from \"./compiler.ts\";\nimport { isSchemaObject } from \"./resolver.ts\";\nimport { sharedRegex } from \"./shared.ts\";\nimport type { SchemaObject, ValidationError } from \"./types.ts\";\n\n/** Explains failures of one compiled schema. */\nexport class Explainer {\n\tprivate readonly c: Compiler;\n\tprivate readonly schema: unknown;\n\t/**\n\t * The errors of `$ref` targets for object values, within one errors() call: a recursive union explains each branch\n\t * to pick the one to blame, and every branch would explain the same children again, exponentially in the depth.\n\t */\n\tprivate memo: Map<object, Map<object, { path: string; errors: ValidationError[] }>> | undefined = undefined;\n\n\tconstructor(compiler: Compiler, schema: unknown) {\n\t\tthis.c = compiler;\n\t\tthis.schema = schema;\n\t\tcompiler.root();\n\t}\n\n\t/** The errors of `value`, at least one (`value` failed the check). */\n\terrors(value: unknown): ValidationError[] {\n\t\tconst out: ValidationError[] = [];\n\t\ttry {\n\t\t\tthis.walk(this.schema, this.c.r.rootBase, value, \"\", out);\n\t\t} finally {\n\t\t\tthis.memo = undefined;\n\t\t}\n\t\tif (out.length === 0) out.push({ path: \"\", keyword: \"schema\", message: \"invalid\" });\n\t\treturn out;\n\t}\n\n\tprivate ok(node: unknown, base: string, v: unknown): boolean {\n\t\treturn this.c.check(node, base)(v);\n\t}\n\n\t// For $dynamicRef schemas this check runs outside the original dynamic scope, so their errors are approximate.\n\tprivate walk(node: unknown, base: string, v: unknown, path: string, out: ValidationError[]): void {\n\t\tif (node === true) return;\n\t\tif (node === false) {\n\t\t\tout.push({ path, keyword: \"false\", message: \"no value is allowed here\" });\n\t\t\treturn;\n\t\t}\n\t\tif (!isSchemaObject(node)) return;\n\t\tconst b = this.c.r.baseFor(node, base);\n\t\tif (this.ok(node, b, v)) return;\n\t\tconst start = out.length;\n\t\tconst push = (keyword: string, message: string, at = path) => {\n\t\t\tout.push({ path: at, keyword, message });\n\t\t};\n\t\tif (this.c.draft === \"7\" && typeof node.$ref === \"string\") {\n\t\t\tthis.walkRef(node.$ref, b, v, path, out);\n\t\t\treturn;\n\t\t}\n\t\tif (node.type !== undefined) {\n\t\t\tconst types = Array.isArray(node.type) ? node.type : [node.type];\n\t\t\tconst checks = types.map((t) => (typeof t === \"string\" ? TYPE_CHECKS.get(t) : undefined) ?? NEVER);\n\t\t\tif (!checks.some((check) => check(v))) {\n\t\t\t\tpush(\"type\", `expected ${types.join(\" or \")}, got ${typeName(v)}`);\n\t\t\t\treturn;\n\t\t\t}\n\t\t}\n\t\tif (Array.isArray(node.enum) && !enumCheck(node.enum)(v))\n\t\t\tpush(\"enum\", `expected one of ${listValues(node.enum)}`);\n\t\tif (Object.hasOwn(node, \"const\") && !constCheck(node.const)(v))\n\t\t\tpush(\"const\", `expected ${JSON.stringify(node.const)}`);\n\t\tif (typeof v === \"string\" && node.type !== \"bytes\") this.walkString(node, v, push);\n\t\tif (v instanceof Uint8Array && node.type === \"bytes\") this.walkBytes(node, v, push);\n\t\tif (typeof v === \"number\") this.walkNumber(node, v, push);\n\t\tif (isObject(v)) this.walkObject(node, b, v, path, out, push);\n\t\tif (Array.isArray(v)) this.walkArray(node, b, v, path, out, push);\n\t\tif (Array.isArray(node.allOf)) for (const s of node.allOf) this.walk(s, b, v, path, out);\n\t\tif (Array.isArray(node.anyOf)) this.walkUnion(node.anyOf, b, v, path, out, false);\n\t\tif (Array.isArray(node.oneOf)) this.walkUnion(node.oneOf, b, v, path, out, true);\n\t\tif (node.not !== undefined && this.ok(node.not, b, v)) push(\"not\", \"must not match the schema in not\");\n\t\tif (node.if !== undefined) {\n\t\t\tconst branch = this.ok(node.if, b, v) ? node.then : node.else;\n\t\t\tif (branch !== undefined) this.walk(branch, b, v, path, out);\n\t\t}\n\t\tif (typeof node.$ref === \"string\") this.walkRef(node.$ref, b, v, path, out);\n\t\tif (out.length === start && (node.unevaluatedProperties !== undefined || node.unevaluatedItems !== undefined)) {\n\t\t\tthis.walkUnevaluated(node, b, v, path, out);\n\t\t}\n\t\tif (out.length === start && typeof node.$dynamicRef === \"string\") {\n\t\t\tpush(\"$dynamicRef\", \"does not match the dynamically referenced schema\");\n\t\t}\n\t}\n\n\tprivate walkRef(ref: string, base: string, v: unknown, path: string, out: ValidationError[]): void {\n\t\tconst target = this.c.r.resolve(ref, base);\n\t\tif (target.node === false && this.c.r.isUnresolved(ref, base)) {\n\t\t\tout.push({ path, keyword: \"$ref\", message: `unresolved reference ${ref}` });\n\t\t\treturn;\n\t\t}\n\t\tif (!isSchemaObject(target.node) || typeof v !== \"object\" || v === null) {\n\t\t\tthis.walk(target.node, target.base, v, path, out);\n\t\t\treturn;\n\t\t}\n\t\tthis.memo ??= new Map();\n\t\tlet values = this.memo.get(target.node);\n\t\tconst known = values?.get(v);\n\t\tif (known !== undefined && known.path === path) {\n\t\t\tout.push(...known.errors);\n\t\t\treturn;\n\t\t}\n\t\tconst errors: ValidationError[] = [];\n\t\tthis.walk(target.node, target.base, v, path, errors);\n\t\tif (values === undefined) {\n\t\t\tvalues = new Map();\n\t\t\tthis.memo.set(target.node, values);\n\t\t}\n\t\tvalues.set(v, { path, errors });\n\t\tout.push(...errors);\n\t}\n\n\tprivate walkString(node: SchemaObject, v: string, push: Push): void {\n\t\tconst n = codePoints(v);\n\t\tif (typeof node.minLength === \"number\" && n < node.minLength) {\n\t\t\tpush(\"minLength\", `expected at least ${node.minLength} characters`);\n\t\t}\n\t\tif (typeof node.maxLength === \"number\" && n > node.maxLength) {\n\t\t\tpush(\"maxLength\", `expected at most ${node.maxLength} characters`);\n\t\t}\n\t\tif (typeof node.pattern === \"string\" && !sharedRegex(node.pattern).test(v)) {\n\t\t\tpush(\"pattern\", `expected to match ${node.pattern}`);\n\t\t}\n\t\tconst formats = this.c.formats;\n\t\tconst format =\n\t\t\tformats !== undefined && typeof node.format === \"string\" && Object.hasOwn(formats, node.format)\n\t\t\t\t? formats[node.format]\n\t\t\t\t: undefined;\n\t\tif (format !== undefined && !format(v)) push(\"format\", `expected format ${node.format}`);\n\t}\n\n\tprivate walkBytes(node: SchemaObject, v: Uint8Array, push: Push): void {\n\t\tif (typeof node.minLength === \"number\" && v.length < node.minLength) {\n\t\t\tpush(\"minLength\", `expected at least ${node.minLength} bytes`);\n\t\t}\n\t\tif (typeof node.maxLength === \"number\" && v.length > node.maxLength) {\n\t\t\tpush(\"maxLength\", `expected at most ${node.maxLength} bytes`);\n\t\t}\n\t}\n\n\tprivate walkNumber(node: SchemaObject, v: number, push: Push): void {\n\t\tif (typeof node.minimum === \"number\" && v < node.minimum) push(\"minimum\", `expected >= ${node.minimum}`);\n\t\tif (typeof node.maximum === \"number\" && v > node.maximum) push(\"maximum\", `expected <= ${node.maximum}`);\n\t\tif (typeof node.exclusiveMinimum === \"number\" && v <= node.exclusiveMinimum) {\n\t\t\tpush(\"exclusiveMinimum\", `expected > ${node.exclusiveMinimum}`);\n\t\t}\n\t\tif (typeof node.exclusiveMaximum === \"number\" && v >= node.exclusiveMaximum) {\n\t\t\tpush(\"exclusiveMaximum\", `expected < ${node.exclusiveMaximum}`);\n\t\t}\n\t\tif (typeof node.multipleOf === \"number\" && !isMultiple(v, node.multipleOf)) {\n\t\t\tpush(\"multipleOf\", `expected a multiple of ${node.multipleOf}`);\n\t\t}\n\t}\n\n\tprivate walkObject(\n\t\tnode: SchemaObject,\n\t\tb: string,\n\t\tv: Record<string, unknown>,\n\t\tpath: string,\n\t\tout: ValidationError[],\n\t\tpush: Push,\n\t): void {\n\t\tconst properties = isSchemaObject(node.properties) ? node.properties : {};\n\t\tconst required = Array.isArray(node.required) ? node.required : [];\n\t\tfor (const k of required) {\n\t\t\tif (typeof k === \"string\" && (!Object.hasOwn(v, k) || v[k] === undefined))\n\t\t\t\tpush(\"required\", \"missing\", pointer(path, k));\n\t\t}\n\t\tfor (const k of Object.keys(properties)) {\n\t\t\tif (Object.hasOwn(v, k) && v[k] !== undefined) this.walk(properties[k], b, v[k], pointer(path, k), out);\n\t\t}\n\t\tconst patterns = isSchemaObject(node.patternProperties) ? Object.entries(node.patternProperties) : [];\n\t\tfor (const k of Object.keys(v)) {\n\t\t\tlet matched = Object.hasOwn(properties, k);\n\t\t\tfor (const [p, s] of patterns) {\n\t\t\t\tif (sharedRegex(p).test(k)) {\n\t\t\t\t\tmatched = true;\n\t\t\t\t\tthis.walk(s, b, v[k], pointer(path, k), out);\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!matched && node.additionalProperties !== undefined) {\n\t\t\t\tif (node.additionalProperties === false) push(\"additionalProperties\", \"unknown field\", pointer(path, k));\n\t\t\t\telse this.walk(node.additionalProperties, b, v[k], pointer(path, k), out);\n\t\t\t}\n\t\t\tif (node.propertyNames !== undefined && !this.ok(node.propertyNames, b, k)) {\n\t\t\t\tpush(\"propertyNames\", \"invalid property name\", pointer(path, k));\n\t\t\t}\n\t\t}\n\t\tconst count = Object.keys(v).length;\n\t\tif (typeof node.minProperties === \"number\" && count < node.minProperties) {\n\t\t\tpush(\"minProperties\", `expected at least ${node.minProperties} properties`);\n\t\t}\n\t\tif (typeof node.maxProperties === \"number\" && count > node.maxProperties) {\n\t\t\tpush(\"maxProperties\", `expected at most ${node.maxProperties} properties`);\n\t\t}\n\t\tconst dependencies = {\n\t\t\t...(this.c.draft === \"7\" || !isSchemaObject(node.dependentRequired) ? {} : node.dependentRequired),\n\t\t\t...(isSchemaObject(node.dependencies) ? node.dependencies : {}),\n\t\t};\n\t\tfor (const [k, d] of Object.entries(dependencies)) {\n\t\t\tif (!Object.hasOwn(v, k)) continue;\n\t\t\tif (!Array.isArray(d)) this.walk(d, b, v, path, out);\n\t\t\telse\n\t\t\t\tfor (const r of d)\n\t\t\t\t\tif (!Object.hasOwn(v, r)) push(\"dependentRequired\", `required when ${k} is present`, pointer(path, r));\n\t\t}\n\t\tif (this.c.draft !== \"7\" && isSchemaObject(node.dependentSchemas)) {\n\t\t\tfor (const [k, s] of Object.entries(node.dependentSchemas))\n\t\t\t\tif (Object.hasOwn(v, k)) this.walk(s, b, v, path, out);\n\t\t}\n\t}\n\n\tprivate walkArray(\n\t\tnode: SchemaObject,\n\t\tb: string,\n\t\tv: unknown[],\n\t\tpath: string,\n\t\tout: ValidationError[],\n\t\tpush: Push,\n\t): void {\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.c.draft !== \"7\" && Array.isArray(node.prefixItems)) prefix = node.prefixItems;\n\t\t\trest = node.items;\n\t\t}\n\t\tfor (let i = 0; i < v.length; i++) {\n\t\t\tconst s = i < prefix.length ? prefix[i] : rest;\n\t\t\tif (s !== undefined) this.walk(s, b, v[i], `${path}/${i}`, out);\n\t\t}\n\t\tif (typeof node.minItems === \"number\" && v.length < node.minItems) {\n\t\t\tpush(\"minItems\", `expected at least ${node.minItems} items`);\n\t\t}\n\t\tif (typeof node.maxItems === \"number\" && v.length > node.maxItems) {\n\t\t\tpush(\"maxItems\", `expected at most ${node.maxItems} items`);\n\t\t}\n\t\tif (node.uniqueItems === true && !uniqueCheck(v)) push(\"uniqueItems\", \"expected unique items\");\n\t\tif (node.contains !== undefined) {\n\t\t\tconst draft7 = this.c.draft === \"7\";\n\t\t\tconst min = draft7 || typeof node.minContains !== \"number\" ? 1 : node.minContains;\n\t\t\tconst max = draft7 || typeof node.maxContains !== \"number\" ? Number.POSITIVE_INFINITY : node.maxContains;\n\t\t\tif (!containsCheck(this.c.check(node.contains, b), min, max)(v)) {\n\t\t\t\tpush(\"contains\", containsMessage(min, max));\n\t\t\t}\n\t\t}\n\t}\n\n\tprivate walkUnion(\n\t\tbranches: readonly unknown[],\n\t\tb: string,\n\t\tv: unknown,\n\t\tpath: string,\n\t\tout: ValidationError[],\n\t\texactlyOne: boolean,\n\t): void {\n\t\tconst matches = branches.filter((s) => this.ok(s, b, v)).length;\n\t\tif (matches === 1 || (!exactlyOne && matches > 0)) return;\n\t\tconst keyword = exactlyOne ? \"oneOf\" : \"anyOf\";\n\t\tif (matches > 1) {\n\t\t\tout.push({ path, keyword, message: \"matches more than one alternative\" });\n\t\t\treturn;\n\t\t}\n\t\t// A tagged union reports the branch its tag selects; otherwise the branch whose first error is deepest.\n\t\tconst tag = this.tagOf(branches, b);\n\t\tif (tag !== undefined && isObject(v)) {\n\t\t\tconst i = tag.values.indexOf(v[tag.key]);\n\t\t\tif (i < 0)\n\t\t\t\tout.push({\n\t\t\t\t\tpath: pointer(path, tag.key),\n\t\t\t\t\tkeyword,\n\t\t\t\t\tmessage: `expected one of ${listValues(tag.values)}`,\n\t\t\t\t});\n\t\t\telse this.walk(branches[i], b, v, path, out);\n\t\t\treturn;\n\t\t}\n\t\t// An object is blamed on the branch that declares most of its properties (the one it was most likely meant for),\n\t\t// then on the branch whose first error is deepest.\n\t\tlet best: { errors: ValidationError[]; declared: number } | undefined;\n\t\tfor (const s of branches) {\n\t\t\tconst errors: ValidationError[] = [];\n\t\t\tthis.walk(s, b, v, path, errors);\n\t\t\tif (errors.length === 0) continue;\n\t\t\tconst declared = isObject(v) ? this.declaredKeys(s, b, v) : 0;\n\t\t\tconst better =\n\t\t\t\tbest === undefined ||\n\t\t\t\tdeclared > best.declared ||\n\t\t\t\t(declared === best.declared && errors[0].path.length > best.errors[0].path.length);\n\t\t\tif (better) best = { errors, declared };\n\t\t}\n\t\tout.push(...(best?.errors ?? [{ path, keyword, message: \"matches no alternative\" }]));\n\t}\n\n\t/** How many of the keys of `v` the branch `s` (through a `$ref`) declares in `properties`. */\n\tprivate declaredKeys(s: unknown, b: string, v: Record<string, unknown>): number {\n\t\tconst node = isSchemaObject(s) && typeof s.$ref === \"string\" ? this.c.r.resolve(s.$ref, b).node : s;\n\t\tconst properties = isSchemaObject(node) && isSchemaObject(node.properties) ? node.properties : {};\n\t\treturn Object.keys(v).filter((k) => Object.hasOwn(properties, k)).length;\n\t}\n\n\tprivate tagOf(branches: readonly unknown[], b: string): { key: string; values: unknown[] } | undefined {\n\t\tconst resolved = branches.map((s) =>\n\t\t\tisSchemaObject(s) && typeof s.$ref === \"string\" ? this.c.r.resolve(s.$ref, b).node : s,\n\t\t);\n\t\tconst first = resolved[0];\n\t\tif (!isSchemaObject(first) || !isSchemaObject(first.properties)) return undefined;\n\t\tfor (const key of Object.keys(first.properties)) {\n\t\t\tconst values = resolved.map((s) => {\n\t\t\t\tconst tag = isSchemaObject(s) && isSchemaObject(s.properties) ? s.properties[key] : undefined;\n\t\t\t\treturn isSchemaObject(tag) ? tag.const : undefined;\n\t\t\t});\n\t\t\tconst primitive = values.every((x) => x !== undefined && (typeof x !== \"object\" || x === null));\n\t\t\tif (primitive && new Set(values).size === values.length) return { key, values };\n\t\t}\n\t\treturn undefined;\n\t}\n\n\tprivate walkUnevaluated(node: SchemaObject, b: string, v: unknown, path: string, out: ValidationError[]): void {\n\t\tconst { unevaluatedProperties, unevaluatedItems, ...rest } = node;\n\t\tconst a = newAnnotations();\n\t\tthis.c.annotating(rest, b)(v, a);\n\t\tif (isObject(v) && unevaluatedProperties !== undefined && !a.allProps) {\n\t\t\tfor (const k of Object.keys(v)) {\n\t\t\t\tif (a.props?.has(k)) continue;\n\t\t\t\tif (unevaluatedProperties === false) {\n\t\t\t\t\tout.push({ path: pointer(path, k), keyword: \"unevaluatedProperties\", message: \"unknown field\" });\n\t\t\t\t} else this.walk(unevaluatedProperties, b, v[k], pointer(path, k), out);\n\t\t\t}\n\t\t}\n\t\tif (Array.isArray(v) && unevaluatedItems !== undefined && !a.allItems) {\n\t\t\tfor (let i = a.items; i < v.length; i++) {\n\t\t\t\tif (a.indexes?.has(i)) continue;\n\t\t\t\tif (unevaluatedItems === false) {\n\t\t\t\t\tout.push({ path: `${path}/${i}`, keyword: \"unevaluatedItems\", message: \"unexpected item\" });\n\t\t\t\t} else this.walk(unevaluatedItems, b, v[i], `${path}/${i}`, out);\n\t\t\t}\n\t\t}\n\t}\n}\n\ntype Push = (keyword: string, message: string, at?: string) => void;\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\n/** `values` as JSON, at most LISTED_VALUES of them, then how many more there are. */\nfunction listValues(values: readonly unknown[]): string {\n\tif (values.length <= LISTED_VALUES) return JSON.stringify(values);\n\tconst listed = JSON.stringify(values.slice(0, LISTED_VALUES));\n\treturn `${listed.slice(0, -1)}, ... and ${values.length - LISTED_VALUES} more]`;\n}\n\nfunction containsMessage(min: number, max: number): string {\n\tif (max === Number.POSITIVE_INFINITY) return `expected at least ${min} matching ${min === 1 ? \"item\" : \"items\"}`;\n\tif (min === 0) return `expected at most ${max} matching ${max === 1 ? \"item\" : \"items\"}`;\n\treturn `expected between ${min} and ${max} matching items`;\n}\n\nfunction pointer(path: string, key: string | number): string {\n\treturn `${path}/${String(key).replace(/~/g, \"~0\").replace(/\\//g, \"~1\")}`;\n}\n\nfunction typeName(v: unknown): string {\n\tif (v === null) return \"null\";\n\tif (Array.isArray(v)) return \"array\";\n\tif (v instanceof Uint8Array) return \"bytes\";\n\tif (typeof v === \"number\" && Number.isInteger(v)) return \"integer\";\n\treturn typeof v;\n}\n"]}

package/dist/formats/index.d.ts

@@ -0,0 +1,7 @@
+import type { FormatCheck } from "../types.ts";
+/**
+ * Every format JSON Schema 2020-12 defines, by name, plus `url` and `json-pointer-uri-fragment`, which TypeBox and
+ * ajv-formats also check. The checks are adapted from TypeBox 1.3.27 (MIT).
+ */
+export declare const formats: Readonly<Record<string, FormatCheck>>;
+//# sourceMappingURL=index.d.ts.map

package/dist/formats/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/formats/index.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAuB/C;;;GAGG;AACH,eAAO,MAAM,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,CAsBxD,CAAC"}

package/dist/formats/index.js

@@ -0,0 +1,51 @@
+// The format checks of JSON Schema 2020-12, for compile()'s `formats` option. An optional entry point: schemas
+// compiled without it treat `format` as an annotation and do not bundle these checks.
+import { IsDate } from "./typebox/date.js";
+import { IsDateTime } from "./typebox/date_time.js";
+import { IsDuration } from "./typebox/duration.js";
+import { IsEmail } from "./typebox/email.js";
+import { IsHostname } from "./typebox/hostname.js";
+import { IsIdnEmail } from "./typebox/idn_email.js";
+import { IsIdnHostname } from "./typebox/idn_hostname.js";
+import { IsIPv4 } from "./typebox/ipv4.js";
+import { IsIPv6 } from "./typebox/ipv6.js";
+import { IsIri } from "./typebox/iri.js";
+import { IsIriReference } from "./typebox/iri_reference.js";
+import { IsJsonPointer } from "./typebox/json_pointer.js";
+import { IsJsonPointerUriFragment } from "./typebox/json_pointer_uri_fragment.js";
+import { IsRegex } from "./typebox/regex.js";
+import { IsRelativeJsonPointer } from "./typebox/relative_json_pointer.js";
+import { IsTime } from "./typebox/time.js";
+import { IsUri } from "./typebox/uri.js";
+import { IsUriReference } from "./typebox/uri_reference.js";
+import { IsUriTemplate } from "./typebox/uri_template.js";
+import { IsUrl } from "./typebox/url.js";
+import { IsUuid } from "./typebox/uuid.js";
+/**
+ * Every format JSON Schema 2020-12 defines, by name, plus `url` and `json-pointer-uri-fragment`, which TypeBox and
+ * ajv-formats also check. The checks are adapted from TypeBox 1.3.27 (MIT).
+ */
+export const formats = Object.freeze({
+    date: IsDate,
+    "date-time": IsDateTime,
+    duration: IsDuration,
+    email: IsEmail,
+    hostname: IsHostname,
+    "idn-email": IsIdnEmail,
+    "idn-hostname": IsIdnHostname,
+    ipv4: IsIPv4,
+    ipv6: IsIPv6,
+    iri: IsIri,
+    "iri-reference": IsIriReference,
+    "json-pointer": IsJsonPointer,
+    "json-pointer-uri-fragment": IsJsonPointerUriFragment,
+    regex: IsRegex,
+    "relative-json-pointer": IsRelativeJsonPointer,
+    time: IsTime,
+    uri: IsUri,
+    "uri-reference": IsUriReference,
+    "uri-template": IsUriTemplate,
+    url: IsUrl,
+    uuid: IsUuid,
+});
+//# sourceMappingURL=index.js.map

package/dist/formats/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/formats/index.ts"],"names":[],"mappings":"AAAA,+GAA+G;AAC/G,sFAAsF;AAGtF,OAAO,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAC3C,OAAO,EAAE,UAAU,EAAE,MAAM,wBAAwB,CAAC;AACpD,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AACnD,OAAO,EAAE,OAAO,EAAE,MAAM,oBAAoB,CAAC;AAC7C,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AACnD,OAAO,EAAE,UAAU,EAAE,MAAM,wBAAwB,CAAC;AACpD,OAAO,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AAC1D,OAAO,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAC3C,OAAO,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAC3C,OAAO,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAC;AACzC,OAAO,EAAE,cAAc,EAAE,MAAM,4BAA4B,CAAC;AAC5D,OAAO,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AAC1D,OAAO,EAAE,wBAAwB,EAAE,MAAM,wCAAwC,CAAC;AAClF,OAAO,EAAE,OAAO,EAAE,MAAM,oBAAoB,CAAC;AAC7C,OAAO,EAAE,qBAAqB,EAAE,MAAM,oCAAoC,CAAC;AAC3E,OAAO,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAC3C,OAAO,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAC;AACzC,OAAO,EAAE,cAAc,EAAE,MAAM,4BAA4B,CAAC;AAC5D,OAAO,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AAC1D,OAAO,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAC;AACzC,OAAO,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAE3C;;;GAGG;AACH,MAAM,CAAC,MAAM,OAAO,GAA0C,MAAM,CAAC,MAAM,CAAC;IAC3E,IAAI,EAAE,MAAM;IACZ,WAAW,EAAE,UAAU;IACvB,QAAQ,EAAE,UAAU;IACpB,KAAK,EAAE,OAAO;IACd,QAAQ,EAAE,UAAU;IACpB,WAAW,EAAE,UAAU;IACvB,cAAc,EAAE,aAAa;IAC7B,IAAI,EAAE,MAAM;IACZ,IAAI,EAAE,MAAM;IACZ,GAAG,EAAE,KAAK;IACV,eAAe,EAAE,cAAc;IAC/B,cAAc,EAAE,aAAa;IAC7B,2BAA2B,EAAE,wBAAwB;IACrD,KAAK,EAAE,OAAO;IACd,uBAAuB,EAAE,qBAAqB;IAC9C,IAAI,EAAE,MAAM;IACZ,GAAG,EAAE,KAAK;IACV,eAAe,EAAE,cAAc;IAC/B,cAAc,EAAE,aAAa;IAC7B,GAAG,EAAE,KAAK;IACV,IAAI,EAAE,MAAM;CACZ,CAAC,CAAC","sourcesContent":["// The format checks of JSON Schema 2020-12, for compile()'s `formats` option. An optional entry point: schemas\n// compiled without it treat `format` as an annotation and do not bundle these checks.\n\nimport type { FormatCheck } from \"../types.ts\";\nimport { IsDate } from \"./typebox/date.ts\";\nimport { IsDateTime } from \"./typebox/date_time.ts\";\nimport { IsDuration } from \"./typebox/duration.ts\";\nimport { IsEmail } from \"./typebox/email.ts\";\nimport { IsHostname } from \"./typebox/hostname.ts\";\nimport { IsIdnEmail } from \"./typebox/idn_email.ts\";\nimport { IsIdnHostname } from \"./typebox/idn_hostname.ts\";\nimport { IsIPv4 } from \"./typebox/ipv4.ts\";\nimport { IsIPv6 } from \"./typebox/ipv6.ts\";\nimport { IsIri } from \"./typebox/iri.ts\";\nimport { IsIriReference } from \"./typebox/iri_reference.ts\";\nimport { IsJsonPointer } from \"./typebox/json_pointer.ts\";\nimport { IsJsonPointerUriFragment } from \"./typebox/json_pointer_uri_fragment.ts\";\nimport { IsRegex } from \"./typebox/regex.ts\";\nimport { IsRelativeJsonPointer } from \"./typebox/relative_json_pointer.ts\";\nimport { IsTime } from \"./typebox/time.ts\";\nimport { IsUri } from \"./typebox/uri.ts\";\nimport { IsUriReference } from \"./typebox/uri_reference.ts\";\nimport { IsUriTemplate } from \"./typebox/uri_template.ts\";\nimport { IsUrl } from \"./typebox/url.ts\";\nimport { IsUuid } from \"./typebox/uuid.ts\";\n\n/**\n * Every format JSON Schema 2020-12 defines, by name, plus `url` and `json-pointer-uri-fragment`, which TypeBox and\n * ajv-formats also check. The checks are adapted from TypeBox 1.3.27 (MIT).\n */\nexport const formats: Readonly<Record<string, FormatCheck>> = Object.freeze({\n\tdate: IsDate,\n\t\"date-time\": IsDateTime,\n\tduration: IsDuration,\n\temail: IsEmail,\n\thostname: IsHostname,\n\t\"idn-email\": IsIdnEmail,\n\t\"idn-hostname\": IsIdnHostname,\n\tipv4: IsIPv4,\n\tipv6: IsIPv6,\n\tiri: IsIri,\n\t\"iri-reference\": IsIriReference,\n\t\"json-pointer\": IsJsonPointer,\n\t\"json-pointer-uri-fragment\": IsJsonPointerUriFragment,\n\tregex: IsRegex,\n\t\"relative-json-pointer\": IsRelativeJsonPointer,\n\ttime: IsTime,\n\turi: IsUri,\n\t\"uri-reference\": IsUriReference,\n\t\"uri-template\": IsUriTemplate,\n\turl: IsUrl,\n\tuuid: IsUuid,\n});\n"]}

package/dist/formats/typebox/date.d.ts

@@ -0,0 +1,7 @@
+/**
+ * Returns true if the value is a ISO8601 Date component string
+ * @description https://datatracker.ietf.org/doc/html/rfc3339
+ * @example `2020-12-12`
+ */
+export declare function IsDate(value: string): boolean;
+//# sourceMappingURL=date.d.ts.map

package/dist/formats/typebox/date.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"date.d.ts","sourceRoot":"","sources":["../../../src/formats/typebox/date.ts"],"names":[],"mappings":"AAkCA;;;;GAIG;AACH,wBAAgB,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO,CAO7C"}

package/dist/formats/typebox/date.js

@@ -0,0 +1,47 @@
+/*--------------------------------------------------------------------------
+
+TypeBox
+
+The MIT License (MIT)
+
+Copyright (c) 2017-2026 Haydn Paterson
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.
+
+---------------------------------------------------------------------------*/
+const DAYS = [0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31];
+const DATE = /^(\d\d\d\d)-(\d\d)-(\d\d)$/;
+function IsLeapYear(year) {
+    return year % 4 === 0 && (year % 100 !== 0 || year % 400 === 0);
+}
+/**
+ * Returns true if the value is a ISO8601 Date component string
+ * @description https://datatracker.ietf.org/doc/html/rfc3339
+ * @example `2020-12-12`
+ */
+export function IsDate(value) {
+    const matches = DATE.exec(value);
+    if (!matches)
+        return false;
+    const year = +matches[1];
+    const month = +matches[2];
+    const day = +matches[3];
+    return month >= 1 && month <= 12 && day >= 1 && day <= (month === 2 && IsLeapYear(year) ? 29 : DAYS[month]);
+}
+//# sourceMappingURL=date.js.map

package/dist/formats/typebox/date.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"date.js","sourceRoot":"","sources":["../../../src/formats/typebox/date.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;6EA0B6E;AAE7E,MAAM,IAAI,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;AACjE,MAAM,IAAI,GAAG,4BAA4B,CAAC;AAE1C,SAAS,UAAU,CAAC,IAAY;IAC/B,OAAO,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,GAAG,KAAK,CAAC,IAAI,IAAI,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC;AACjE,CAAC;AACD;;;;GAIG;AACH,MAAM,UAAU,MAAM,CAAC,KAAa;IACnC,MAAM,OAAO,GAAoB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAClD,IAAI,CAAC,OAAO;QAAE,OAAO,KAAK,CAAC;IAC3B,MAAM,IAAI,GAAW,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IACjC,MAAM,KAAK,GAAW,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAClC,MAAM,GAAG,GAAW,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAChC,OAAO,KAAK,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,KAAK,CAAC,IAAI,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;AAC7G,CAAC","sourcesContent":["/*--------------------------------------------------------------------------\n\nTypeBox\n\nThe MIT License (MIT)\n\nCopyright (c) 2017-2026 Haydn Paterson\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n\n---------------------------------------------------------------------------*/\n\nconst DAYS = [0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31];\nconst DATE = /^(\\d\\d\\d\\d)-(\\d\\d)-(\\d\\d)$/;\n\nfunction IsLeapYear(year: number): boolean {\n\treturn year % 4 === 0 && (year % 100 !== 0 || year % 400 === 0);\n}\n/**\n * Returns true if the value is a ISO8601 Date component string\n * @description https://datatracker.ietf.org/doc/html/rfc3339\n * @example `2020-12-12`\n */\nexport function IsDate(value: string): boolean {\n\tconst matches: string[] | null = DATE.exec(value);\n\tif (!matches) return false;\n\tconst year: number = +matches[1];\n\tconst month: number = +matches[2];\n\tconst day: number = +matches[3];\n\treturn month >= 1 && month <= 12 && day >= 1 && day <= (month === 2 && IsLeapYear(year) ? 29 : DAYS[month]);\n}\n"]}