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

package/dist/checks.js

@@ -0,0 +1,447 @@
+// Check factories: each returns a closure that captures only its arguments, never the compiler, so a compiled
+// schema keeps no compile-time state alive. Leaf checks are module constants that object and array loops inline.
+export const ALWAYS = () => true;
+export const NEVER = () => false;
+const IS_STRING = (v) => typeof v === "string";
+const IS_NUMBER = (v) => typeof v === "number";
+const IS_INTEGER = (v) => Number.isInteger(v);
+const IS_BOOLEAN = (v) => typeof v === "boolean";
+const IS_NULL = (v) => v === null;
+export const IS_ARRAY = (v) => Array.isArray(v);
+const IS_BYTES = (v) => v instanceof Uint8Array;
+export const IS_OBJECT = (v) => isObject(v);
+/** Whether `v` is a JSON object: not null, an array or bytes. */
+export function isObject(v) {
+    return typeof v === "object" && v !== null && !Array.isArray(v) && !(v instanceof Uint8Array);
+}
+/** The check of a `type` name; `bytes` (a Uint8Array) extends JSON Schema for values that never pass through JSON. */
+export const TYPE_CHECKS = new Map([
+    ["string", IS_STRING],
+    ["number", IS_NUMBER],
+    ["integer", IS_INTEGER],
+    ["boolean", IS_BOOLEAN],
+    ["null", IS_NULL],
+    ["array", IS_ARRAY],
+    ["object", IS_OBJECT],
+    ["bytes", IS_BYTES],
+]);
+/** Leaf checks that object and array loops run inline by code instead of calling them. */
+export const LEAF_CODES = new Map([
+    [IS_STRING, 1],
+    [IS_NUMBER, 2],
+    [IS_INTEGER, 3],
+    [IS_BOOLEAN, 4],
+    [IS_NULL, 5],
+    [ALWAYS, 6],
+]);
+function leafOk(code, x) {
+    switch (code) {
+        case 1:
+            return typeof x === "string";
+        case 2:
+            return typeof x === "number";
+        case 3:
+            return Number.isInteger(x);
+        case 4:
+            return typeof x === "boolean";
+        case 5:
+            return x === null;
+        default:
+            return true;
+    }
+}
+/** Whether a combined object or array check also checks the type: not at all, strictly, or passing other types. */
+export const GUARD_NONE = 0;
+export const GUARD_STRICT = 1;
+export const GUARD_LOOSE = 2;
+/** Flags of a declared property in an object check's entries: its leaf code and two bits. */
+export const CODE = 7;
+export const REQUIRED = 8;
+export const INHERITED = 16;
+/** All of `parts`; two and three parts get closures without a loop. */
+export function and(parts) {
+    switch (parts.length) {
+        case 0:
+            return ALWAYS;
+        case 1:
+            return parts[0];
+        case 2: {
+            const [a, b] = parts;
+            return (v) => a(v) && b(v);
+        }
+        case 3: {
+            const [a, b, c] = parts;
+            return (v) => a(v) && b(v) && c(v);
+        }
+        default:
+            return (v) => {
+                for (let i = 0; i < parts.length; i++)
+                    if (!parts[i](v))
+                        return false;
+                return true;
+            };
+    }
+}
+/** A check whose implementation is set later: the indirection a recursive reference goes through. */
+export function indirect(slot) {
+    return (v) => slot.check(v);
+}
+/** `check` with `uri` pushed onto the dynamic scope while it runs (only for schemas with `$dynamicRef`). */
+export function scopedCheck(scope, uri, check) {
+    return (v) => {
+        scope.push(uri);
+        const ok = check(v);
+        scope.pop();
+        return ok;
+    };
+}
+/** Any of the named types. */
+export function typeCheck(types) {
+    const checks = types.map((t) => (typeof t === "string" ? TYPE_CHECKS.get(t) : undefined) ?? NEVER);
+    if (checks.length === 1)
+        return checks[0];
+    return (v) => {
+        for (let i = 0; i < checks.length; i++)
+            if (checks[i](v))
+                return true;
+        return false;
+    };
+}
+/** A Uint8Array within the length bounds. */
+export function bytesCheck(min, max) {
+    return (v) => v instanceof Uint8Array && v.length >= min && v.length <= max;
+}
+/** The number of Unicode code points of `s`: JSON Schema string lengths count code points, not UTF-16 units. */
+export function codePoints(s) {
+    let n = 0;
+    for (let i = 0; i < s.length; i++, n++) {
+        const c = s.charCodeAt(i);
+        // A high surrogate starts a pair only when a low surrogate follows; an unpaired one is a code point of its own.
+        if (c >= 0xd800 && c <= 0xdbff && i + 1 < s.length) {
+            const next = s.charCodeAt(i + 1);
+            if (next >= 0xdc00 && next <= 0xdfff)
+                i++;
+        }
+    }
+    return n;
+}
+// UTF-16 units bound code points from both sides (units / 2 <= points <= units), so most strings need no count.
+function lengthOk(s, min, max) {
+    const units = s.length;
+    if (units < min)
+        return false;
+    if (units < 2 * min && codePoints(s) < min)
+        return false;
+    return units <= max || codePoints(s) <= max;
+}
+/** The string keywords: length bounds, pattern and format. */
+export function stringCheck(strict, min, max, re, format) {
+    if (re !== undefined && min === 0 && max === Number.POSITIVE_INFINITY && format === undefined) {
+        return strict ? (v) => typeof v === "string" && re.test(v) : (v) => typeof v !== "string" || re.test(v);
+    }
+    if (re === undefined && format === undefined) {
+        return strict
+            ? (v) => typeof v === "string" && lengthOk(v, min, max)
+            : (v) => typeof v !== "string" || lengthOk(v, min, max);
+    }
+    return (v) => {
+        if (typeof v !== "string")
+            return !strict;
+        return lengthOk(v, min, max) && (re === undefined || re.test(v)) && (format === undefined || format(v));
+    };
+}
+/** The number keywords. `mode`: 0 passes other types, 1 requires a number, 2 an integer. */
+export function numberCheck(mode, min, max, xmin, xmax, multipleOf) {
+    return (v) => {
+        if (typeof v !== "number")
+            return mode === 0;
+        if (mode === 2 && !Number.isInteger(v))
+            return false;
+        return v >= min && v <= max && v > xmin && v < xmax && (multipleOf === undefined || isMultiple(v, multipleOf));
+    };
+}
+/** Whether `v` is a multiple of `d`, exactly for decimals: 0.0075 / 0.0001 is 74.99999999999999 in floating point. */
+export function isMultiple(v, d) {
+    const q = v / d;
+    if (Number.isInteger(q))
+        return true;
+    if (!Number.isFinite(q))
+        return v % d === 0;
+    const [vc, ve] = decimal(v);
+    const [dc, de] = decimal(d);
+    return ve >= de ? (vc * 10n ** BigInt(ve - de)) % dc === 0n : vc % (dc * 10n ** BigInt(de - ve)) === 0n;
+}
+function decimal(x) {
+    const [mantissa, exponent = "0"] = Math.abs(x).toString().split("e");
+    const point = mantissa.indexOf(".");
+    const fraction = point < 0 ? 0 : mantissa.length - point - 1;
+    return [BigInt(mantissa.replace(".", "")), Number(exponent) - fraction];
+}
+/** `inner` for objects; other values pass unless `strict`. */
+export function guardObject(inner, strict) {
+    return strict ? (v) => isObject(v) && inner(v) : (v) => !isObject(v) || inner(v);
+}
+/** `inner` for arrays; other values pass unless `strict`. */
+export function guardArray(inner, strict) {
+    return strict ? (v) => Array.isArray(v) && inner(v) : (v) => !Array.isArray(v) || inner(v);
+}
+/**
+ * An object with declared properties: `entries` is `[key, check, flags]` per property. The value's own keys are
+ * walked with for...in (whose `o[k]` V8 reads from the enum cache, unlike a load by a name from a list), each found
+ * among the declared names; `closed` rejects any other key. A property whose value is `undefined` counts as absent.
+ */
+export function declaredObject(entries, requiredCount, closed, guard) {
+    const n = entries.length;
+    return (v) => {
+        if (guard !== GUARD_NONE && !isObject(v))
+            return guard === GUARD_LOOSE;
+        // Guarded: by the check above, or by the caller for GUARD_NONE.
+        const o = v;
+        let required = 0;
+        for (const k in o) {
+            let i = 0;
+            while (i < n && entries[i] !== k)
+                i += 3;
+            if (i === n) {
+                if (closed)
+                    return false;
+                continue;
+            }
+            const x = o[k];
+            if (x === undefined)
+                continue;
+            const f = entries[i + 2];
+            const c = f & CODE;
+            if (c !== 0 ? !leafOk(c, x) : !entries[i + 1](x))
+                return false;
+            if (f & REQUIRED)
+                required++;
+        }
+        return required === requiredCount;
+    };
+}
+/** An object with declared properties, required keys not declared, pattern properties and additional properties. */
+export function openObject(entries, keys, extraRequired, patterns, additional, guard) {
+    const known = patterns.length > 0 || additional !== undefined ? new Set(keys) : undefined;
+    return (v) => {
+        if (guard !== GUARD_NONE && !isObject(v))
+            return guard === GUARD_LOOSE;
+        const o = v;
+        for (let i = 0; i < entries.length; i += 3) {
+            const k = entries[i];
+            const x = o[k];
+            const f = entries[i + 2];
+            if (x === undefined || (f & INHERITED && !Object.hasOwn(o, k))) {
+                if (f & REQUIRED)
+                    return false;
+                continue;
+            }
+            const c = f & CODE;
+            if (c !== 0 ? !leafOk(c, x) : !entries[i + 1](x))
+                return false;
+        }
+        for (let i = 0; i < extraRequired.length; i++)
+            if (!Object.hasOwn(o, extraRequired[i]))
+                return false;
+        if (known === undefined)
+            return true;
+        for (const k of Object.keys(o)) {
+            let matched = known.has(k);
+            for (let i = 0; i < patterns.length; i++) {
+                if (patterns[i][0].test(k)) {
+                    matched = true;
+                    if (!patterns[i][1](o[k]))
+                        return false;
+                }
+            }
+            if (!matched && additional !== undefined && !additional(o[k]))
+                return false;
+        }
+        return true;
+    };
+}
+/** Every property name passes `check` (`v` is an object). */
+export function propertyNamesCheck(check) {
+    return (v) => {
+        for (const k in v)
+            if (!check(k))
+                return false;
+        return true;
+    };
+}
+/** `minProperties` and `maxProperties` (`v` is an object). */
+export function propertyCountCheck(min, max) {
+    return (v) => {
+        let n = 0;
+        for (const _ in v)
+            n++;
+        return n >= min && n <= max;
+    };
+}
+/** `dependentRequired` (`v` is an object). */
+export function dependentRequiredCheck(entries) {
+    return (v) => {
+        const o = v;
+        for (const [k, list] of entries)
+            if (Object.hasOwn(o, k))
+                for (const r of list)
+                    if (!Object.hasOwn(o, r))
+                        return false;
+        return true;
+    };
+}
+/** `dependentSchemas` (`v` is an object). */
+export function dependentSchemasCheck(entries) {
+    return (v) => {
+        for (const [k, check] of entries)
+            if (Object.hasOwn(v, k) && !check(v))
+                return false;
+        return true;
+    };
+}
+/** The common array: guard, length bounds, prefix items and the items after them, in one closure. */
+export function listCheck(guard, min, max, prefix, rest) {
+    const n = prefix.length;
+    const code = rest === undefined ? 0 : (LEAF_CODES.get(rest) ?? 0);
+    return (v) => {
+        if (!Array.isArray(v))
+            return guard === GUARD_LOOSE;
+        const length = v.length;
+        if (length < min || length > max)
+            return false;
+        const m = length < n ? length : n;
+        for (let i = 0; i < m; i++)
+            if (!prefix[i](v[i]))
+                return false;
+        if (rest === undefined)
+            return true;
+        if (code !== 0) {
+            for (let i = n; i < length; i++)
+                if (!leafOk(code, v[i]))
+                    return false;
+            return true;
+        }
+        for (let i = n; i < length; i++)
+            if (!rest(v[i]))
+                return false;
+        return true;
+    };
+}
+/** Prefix items and the items after them (`v` is an array). */
+export function itemsCheck(prefix, rest) {
+    return listCheck(GUARD_NONE, 0, Number.POSITIVE_INFINITY, prefix, rest);
+}
+/** `minItems` and `maxItems` (`v` is an array). */
+export function lengthCheck(min, max) {
+    return (v) => v.length >= min && v.length <= max;
+}
+/** `contains` with its bounds (`v` is an array). */
+export function containsCheck(check, min, max) {
+    return (v) => {
+        const list = v;
+        let n = 0;
+        for (let i = 0; i < list.length; i++)
+            if (check(list[i]) && ++n > max)
+                return false;
+        return n >= min;
+    };
+}
+/** `uniqueItems` (`v` is an array). */
+export function uniqueCheck(v) {
+    const list = v;
+    for (let i = 1; i < list.length; i++)
+        for (let j = 0; j < i; j++)
+            if (deepEqual(list[i], list[j]))
+                return false;
+    return true;
+}
+/** `enum`: up to 8 primitives by a scan, more by a Set, objects and arrays by deep equality. */
+export function enumCheck(values) {
+    const primitives = values.filter((x) => typeof x !== "object" || x === null);
+    if (primitives.length === values.length && primitives.length <= 8) {
+        return (v) => {
+            for (let i = 0; i < primitives.length; i++)
+                if (primitives[i] === v)
+                    return true;
+            return false;
+        };
+    }
+    const set = new Set(primitives);
+    const objects = values.filter((x) => typeof x === "object" && x !== null);
+    return (v) => set.has(v) || (typeof v === "object" && objects.some((o) => deepEqual(v, o)));
+}
+/** `const`. */
+export function constCheck(value) {
+    if (typeof value !== "object" || value === null)
+        return (v) => v === value;
+    return (v) => deepEqual(v, value);
+}
+/** `anyOf`. */
+export function anyCheck(checks) {
+    return (v) => {
+        for (let i = 0; i < checks.length; i++)
+            if (checks[i](v))
+                return true;
+        return false;
+    };
+}
+/** `oneOf`. */
+export function oneCheck(checks) {
+    return (v) => {
+        let n = 0;
+        for (let i = 0; i < checks.length; i++)
+            if (checks[i](v) && ++n > 1)
+                return false;
+        return n === 1;
+    };
+}
+/** `not`. */
+export function notCheck(check) {
+    return (v) => !check(v);
+}
+/** `if`, `then` and `else`. */
+export function ifCheck(cond, then, otherwise) {
+    return (v) => (cond(v) ? then(v) : otherwise(v));
+}
+/** A union of objects tagged by a const on `key`: the tag selects the one branch that can match. */
+export function taggedCheck(key, tags, checks) {
+    return (v) => {
+        if (!isObject(v))
+            return false;
+        const tag = v[key];
+        for (let i = 0; i < tags.length; i++)
+            if (tags[i] === tag)
+                return checks[i](v);
+        return false;
+    };
+}
+/** JSON equality: same primitives, arrays with equal items in order, objects with the same keys and equal values. */
+export function deepEqual(a, b) {
+    if (a === b)
+        return true;
+    if (typeof a !== "object" || typeof b !== "object" || a === null || b === null)
+        return false;
+    const array = Array.isArray(a);
+    if (array !== Array.isArray(b))
+        return false;
+    if (array) {
+        const x = a;
+        const y = b;
+        if (x.length !== y.length)
+            return false;
+        for (let i = 0; i < x.length; i++)
+            if (!deepEqual(x[i], y[i]))
+                return false;
+        return true;
+    }
+    const x = a;
+    const y = b;
+    const keys = Object.keys(x);
+    if (keys.length !== Object.keys(y).length)
+        return false;
+    for (const k of keys)
+        if (!Object.hasOwn(y, k) || !deepEqual(x[k], y[k]))
+            return false;
+    return true;
+}
+//# sourceMappingURL=checks.js.map

package/dist/checks.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"checks.js","sourceRoot":"","sources":["../src/checks.ts"],"names":[],"mappings":"AAAA,8GAA8G;AAC9G,iHAAiH;AAIjH,MAAM,CAAC,MAAM,MAAM,GAAU,GAAG,EAAE,CAAC,IAAI,CAAC;AACxC,MAAM,CAAC,MAAM,KAAK,GAAU,GAAG,EAAE,CAAC,KAAK,CAAC;AACxC,MAAM,SAAS,GAAU,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC;AACtD,MAAM,SAAS,GAAU,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC;AACtD,MAAM,UAAU,GAAU,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;AACrD,MAAM,UAAU,GAAU,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,SAAS,CAAC;AACxD,MAAM,OAAO,GAAU,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC;AACzC,MAAM,CAAC,MAAM,QAAQ,GAAU,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;AACvD,MAAM,QAAQ,GAAU,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,YAAY,UAAU,CAAC;AACvD,MAAM,CAAC,MAAM,SAAS,GAAU,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;AAEnD,iEAAiE;AACjE,MAAM,UAAU,QAAQ,CAAC,CAAU;IAClC,OAAO,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,YAAY,UAAU,CAAC,CAAC;AAC/F,CAAC;AAED,sHAAsH;AACtH,MAAM,CAAC,MAAM,WAAW,GAA+B,IAAI,GAAG,CAAC;IAC9D,CAAC,QAAQ,EAAE,SAAS,CAAC;IACrB,CAAC,QAAQ,EAAE,SAAS,CAAC;IACrB,CAAC,SAAS,EAAE,UAAU,CAAC;IACvB,CAAC,SAAS,EAAE,UAAU,CAAC;IACvB,CAAC,MAAM,EAAE,OAAO,CAAC;IACjB,CAAC,OAAO,EAAE,QAAQ,CAAC;IACnB,CAAC,QAAQ,EAAE,SAAS,CAAC;IACrB,CAAC,OAAO,EAAE,QAAQ,CAAC;CACnB,CAAC,CAAC;AAEH,0FAA0F;AAC1F,MAAM,CAAC,MAAM,UAAU,GAA+B,IAAI,GAAG,CAAC;IAC7D,CAAC,SAAS,EAAE,CAAC,CAAC;IACd,CAAC,SAAS,EAAE,CAAC,CAAC;IACd,CAAC,UAAU,EAAE,CAAC,CAAC;IACf,CAAC,UAAU,EAAE,CAAC,CAAC;IACf,CAAC,OAAO,EAAE,CAAC,CAAC;IACZ,CAAC,MAAM,EAAE,CAAC,CAAC;CACX,CAAC,CAAC;AAEH,SAAS,MAAM,CAAC,IAAY,EAAE,CAAU;IACvC,QAAQ,IAAI,EAAE,CAAC;QACd,KAAK,CAAC;YACL,OAAO,OAAO,CAAC,KAAK,QAAQ,CAAC;QAC9B,KAAK,CAAC;YACL,OAAO,OAAO,CAAC,KAAK,QAAQ,CAAC;QAC9B,KAAK,CAAC;YACL,OAAO,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAC5B,KAAK,CAAC;YACL,OAAO,OAAO,CAAC,KAAK,SAAS,CAAC;QAC/B,KAAK,CAAC;YACL,OAAO,CAAC,KAAK,IAAI,CAAC;QACnB;YACC,OAAO,IAAI,CAAC;IACd,CAAC;AACF,CAAC;AAED,mHAAmH;AACnH,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,CAAC;AAC5B,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,CAAC;AAC9B,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,CAAC;AAG7B,6FAA6F;AAC7F,MAAM,CAAC,MAAM,IAAI,GAAG,CAAC,CAAC;AACtB,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,CAAC;AAC1B,MAAM,CAAC,MAAM,SAAS,GAAG,EAAE,CAAC;AAE5B,uEAAuE;AACvE,MAAM,UAAU,GAAG,CAAC,KAAuB;IAC1C,QAAQ,KAAK,CAAC,MAAM,EAAE,CAAC;QACtB,KAAK,CAAC;YACL,OAAO,MAAM,CAAC;QACf,KAAK,CAAC;YACL,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC;QACjB,KAAK,CAAC,EAAE,CAAC;YACR,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC;YACrB,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC;QACD,KAAK,CAAC,EAAE,CAAC;YACR,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC;YACxB,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACpC,CAAC;QACD;YACC,OAAO,CAAC,CAAC,EAAE,EAAE;gBACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE;oBAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;wBAAE,OAAO,KAAK,CAAC;gBACtE,OAAO,IAAI,CAAC;YACb,CAAC,CAAC;IACJ,CAAC;AACF,CAAC;AAED,qGAAqG;AACrG,MAAM,UAAU,QAAQ,CAAC,IAAkC;IAC1D,OAAO,CAAC,CAAC,EAAE,EAAE,CAAE,IAAI,CAAC,KAAe,CAAC,CAAC,CAAC,CAAC;AACxC,CAAC;AAED,4GAA4G;AAC5G,MAAM,UAAU,WAAW,CAAC,KAAe,EAAE,GAAW,EAAE,KAAY;IACrE,OAAO,CAAC,CAAC,EAAE,EAAE;QACZ,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAChB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACpB,KAAK,CAAC,GAAG,EAAE,CAAC;QACZ,OAAO,EAAE,CAAC;IACX,CAAC,CAAC;AACH,CAAC;AAED,8BAA8B;AAC9B,MAAM,UAAU,SAAS,CAAC,KAAyB;IAClD,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;IACnG,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC;IAC1C,OAAO,CAAC,CAAC,EAAE,EAAE;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAAE,OAAO,IAAI,CAAC;QACtE,OAAO,KAAK,CAAC;IACd,CAAC,CAAC;AACH,CAAC;AAED,6CAA6C;AAC7C,MAAM,UAAU,UAAU,CAAC,GAAW,EAAE,GAAW;IAClD,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,YAAY,UAAU,IAAI,CAAC,CAAC,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,MAAM,IAAI,GAAG,CAAC;AAC7E,CAAC;AAED,gHAAgH;AAChH,MAAM,UAAU,UAAU,CAAC,CAAS;IACnC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,CAAC,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QAC1B,gHAAgH;QAChH,IAAI,CAAC,IAAI,MAAM,IAAI,CAAC,IAAI,MAAM,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC;YACpD,MAAM,IAAI,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACjC,IAAI,IAAI,IAAI,MAAM,IAAI,IAAI,IAAI,MAAM;gBAAE,CAAC,EAAE,CAAC;QAC3C,CAAC;IACF,CAAC;IACD,OAAO,CAAC,CAAC;AACV,CAAC;AAED,gHAAgH;AAChH,SAAS,QAAQ,CAAC,CAAS,EAAE,GAAW,EAAE,GAAW;IACpD,MAAM,KAAK,GAAG,CAAC,CAAC,MAAM,CAAC;IACvB,IAAI,KAAK,GAAG,GAAG;QAAE,OAAO,KAAK,CAAC;IAC9B,IAAI,KAAK,GAAG,CAAC,GAAG,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,GAAG,GAAG;QAAE,OAAO,KAAK,CAAC;IACzD,OAAO,KAAK,IAAI,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC;AAC7C,CAAC;AAED,8DAA8D;AAC9D,MAAM,UAAU,WAAW,CAC1B,MAAe,EACf,GAAW,EACX,GAAW,EACX,EAAsB,EACtB,MAAgD;IAEhD,IAAI,EAAE,KAAK,SAAS,IAAI,GAAG,KAAK,CAAC,IAAI,GAAG,KAAK,MAAM,CAAC,iBAAiB,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QAC/F,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACzG,CAAC;IACD,IAAI,EAAE,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QAC9C,OAAO,MAAM;YACZ,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,IAAI,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC;YACvD,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,IAAI,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IAC1D,CAAC;IACD,OAAO,CAAC,CAAC,EAAE,EAAE;QACZ,IAAI,OAAO,CAAC,KAAK,QAAQ;YAAE,OAAO,CAAC,MAAM,CAAC;QAC1C,OAAO,QAAQ,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,KAAK,SAAS,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,SAAS,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IACzG,CAAC,CAAC;AACH,CAAC;AAED,4FAA4F;AAC5F,MAAM,UAAU,WAAW,CAC1B,IAAe,EACf,GAAW,EACX,GAAW,EACX,IAAY,EACZ,IAAY,EACZ,UAA8B;IAE9B,OAAO,CAAC,CAAC,EAAE,EAAE;QACZ,IAAI,OAAO,CAAC,KAAK,QAAQ;YAAE,OAAO,IAAI,KAAK,CAAC,CAAC;QAC7C,IAAI,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;QACrD,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,GAAG,IAAI,IAAI,CAAC,UAAU,KAAK,SAAS,IAAI,UAAU,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;IAChH,CAAC,CAAC;AACH,CAAC;AAED,sHAAsH;AACtH,MAAM,UAAU,UAAU,CAAC,CAAS,EAAE,CAAS;IAC9C,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAChB,IAAI,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IACrC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC;QAAE,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAC5C,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IAC5B,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IAC5B,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,GAAG,IAAI,MAAM,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,GAAG,IAAI,MAAM,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC;AACzG,CAAC;AAED,SAAS,OAAO,CAAC,CAAS;IACzB,MAAM,CAAC,QAAQ,EAAE,QAAQ,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IACrE,MAAM,KAAK,GAAG,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IACpC,MAAM,QAAQ,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,GAAG,KAAK,GAAG,CAAC,CAAC;IAC7D,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,QAAQ,CAAC,GAAG,QAAQ,CAAC,CAAC;AACzE,CAAC;AAED,8DAA8D;AAC9D,MAAM,UAAU,WAAW,CAAC,KAAY,EAAE,MAAe;IACxD,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;AAClF,CAAC;AAED,6DAA6D;AAC7D,MAAM,UAAU,UAAU,CAAC,KAAY,EAAE,MAAe;IACvD,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;AAC5F,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,cAAc,CAC7B,OAA2B,EAC3B,aAAqB,EACrB,MAAe,EACf,KAAY;IAEZ,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;IACzB,OAAO,CAAC,CAAC,EAAE,EAAE;QACZ,IAAI,KAAK,KAAK,UAAU,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,KAAK,WAAW,CAAC;QACvE,gEAAgE;QAChE,MAAM,CAAC,GAAG,CAA4B,CAAC;QACvC,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,KAAK,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;YACnB,IAAI,CAAC,GAAG,CAAC,CAAC;YACV,OAAO,CAAC,GAAG,CAAC,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC;gBAAE,CAAC,IAAI,CAAC,CAAC;YACzC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACb,IAAI,MAAM;oBAAE,OAAO,KAAK,CAAC;gBACzB,SAAS;YACV,CAAC;YACD,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACf,IAAI,CAAC,KAAK,SAAS;gBAAE,SAAS;YAC9B,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAW,CAAC;YACnC,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;YACnB,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,OAAO,CAAC,CAAC,GAAG,CAAC,CAAW,CAAC,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;YAC1E,IAAI,CAAC,GAAG,QAAQ;gBAAE,QAAQ,EAAE,CAAC;QAC9B,CAAC;QACD,OAAO,QAAQ,KAAK,aAAa,CAAC;IACnC,CAAC,CAAC;AACH,CAAC;AAED,oHAAoH;AACpH,MAAM,UAAU,UAAU,CACzB,OAA2B,EAC3B,IAAuB,EACvB,aAAgC,EAChC,QAA+C,EAC/C,UAA6B,EAC7B,KAAY;IAEZ,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC1F,OAAO,CAAC,CAAC,EAAE,EAAE;QACZ,IAAI,KAAK,KAAK,UAAU,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,KAAK,WAAW,CAAC;QACvE,MAAM,CAAC,GAAG,CAA4B,CAAC;QACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAC5C,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAW,CAAC;YAC/B,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACf,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAW,CAAC;YACnC,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,CAAC,GAAG,SAAS,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBAChE,IAAI,CAAC,GAAG,QAAQ;oBAAE,OAAO,KAAK,CAAC;gBAC/B,SAAS;YACV,CAAC;YACD,MAAM,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;YACnB,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAE,OAAO,CAAC,CAAC,GAAG,CAAC,CAAW,CAAC,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;QAC3E,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;QACrG,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC;QACrC,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;YAChC,IAAI,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC5B,OAAO,GAAG,IAAI,CAAC;oBACf,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;wBAAE,OAAO,KAAK,CAAC;gBACzC,CAAC;YACF,CAAC;YACD,IAAI,CAAC,OAAO,IAAI,UAAU,KAAK,SAAS,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;QAC7E,CAAC;QACD,OAAO,IAAI,CAAC;IACb,CAAC,CAAC;AACH,CAAC;AAED,6DAA6D;AAC7D,MAAM,UAAU,kBAAkB,CAAC,KAAY;IAC9C,OAAO,CAAC,CAAC,EAAE,EAAE;QACZ,KAAK,MAAM,CAAC,IAAI,CAAW;YAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;QACzD,OAAO,IAAI,CAAC;IACb,CAAC,CAAC;AACH,CAAC;AAED,8DAA8D;AAC9D,MAAM,UAAU,kBAAkB,CAAC,GAAW,EAAE,GAAW;IAC1D,OAAO,CAAC,CAAC,EAAE,EAAE;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,CAAC,IAAI,CAAW;YAAE,CAAC,EAAE,CAAC;QACjC,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,CAAC;IAC7B,CAAC,CAAC;AACH,CAAC;AAED,8CAA8C;AAC9C,MAAM,UAAU,sBAAsB,CAAC,OAA0D;IAChG,OAAO,CAAC,CAAC,EAAE,EAAE;QACZ,MAAM,CAAC,GAAG,CAAW,CAAC;QACtB,KAAK,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,OAAO;YAC9B,IAAI,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC;gBAAE,KAAK,MAAM,CAAC,IAAI,IAAI;oBAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC;wBAAE,OAAO,KAAK,CAAC;QACvF,OAAO,IAAI,CAAC;IACb,CAAC,CAAC;AACH,CAAC;AAED,6CAA6C;AAC7C,MAAM,UAAU,qBAAqB,CAAC,OAA8C;IACnF,OAAO,CAAC,CAAC,EAAE,EAAE;QACZ,KAAK,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,OAAO;YAAE,IAAI,MAAM,CAAC,MAAM,CAAC,CAAW,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;QAC/F,OAAO,IAAI,CAAC;IACb,CAAC,CAAC;AACH,CAAC;AAED,qGAAqG;AACrG,MAAM,UAAU,SAAS,CACxB,KAAY,EACZ,GAAW,EACX,GAAW,EACX,MAAwB,EACxB,IAAuB;IAEvB,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IACxB,MAAM,IAAI,GAAG,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAClE,OAAO,CAAC,CAAC,EAAE,EAAE;QACZ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,KAAK,WAAW,CAAC;QACpD,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;QACxB,IAAI,MAAM,GAAG,GAAG,IAAI,MAAM,GAAG,GAAG;YAAE,OAAO,KAAK,CAAC;QAC/C,MAAM,CAAC,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;QAC/D,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC;QACpC,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE;gBAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;oBAAE,OAAO,KAAK,CAAC;YACvE,OAAO,IAAI,CAAC;QACb,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE;YAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;QAC/D,OAAO,IAAI,CAAC;IACb,CAAC,CAAC;AACH,CAAC;AAED,+DAA+D;AAC/D,MAAM,UAAU,UAAU,CAAC,MAAwB,EAAE,IAAuB;IAC3E,OAAO,SAAS,CAAC,UAAU,EAAE,CAAC,EAAE,MAAM,CAAC,iBAAiB,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC;AACzE,CAAC;AAED,mDAAmD;AACnD,MAAM,UAAU,WAAW,CAAC,GAAW,EAAE,GAAW;IACnD,OAAO,CAAC,CAAC,EAAE,EAAE,CAAE,CAAe,CAAC,MAAM,IAAI,GAAG,IAAK,CAAe,CAAC,MAAM,IAAI,GAAG,CAAC;AAChF,CAAC;AAED,oDAAoD;AACpD,MAAM,UAAU,aAAa,CAAC,KAAY,EAAE,GAAW,EAAE,GAAW;IACnE,OAAO,CAAC,CAAC,EAAE,EAAE;QACZ,MAAM,IAAI,GAAG,CAAc,CAAC;QAC5B,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,GAAG;gBAAE,OAAO,KAAK,CAAC;QACpF,OAAO,CAAC,IAAI,GAAG,CAAC;IACjB,CAAC,CAAC;AACH,CAAC;AAED,uCAAuC;AACvC,MAAM,UAAU,WAAW,CAAC,CAAU;IACrC,MAAM,IAAI,GAAG,CAAc,CAAC;IAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE;QAAE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,IAAI,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;IAChH,OAAO,IAAI,CAAC;AACb,CAAC;AAED,gGAAgG;AAChG,MAAM,UAAU,SAAS,CAAC,MAA0B;IACnD,MAAM,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;IAC7E,IAAI,UAAU,CAAC,MAAM,KAAK,MAAM,CAAC,MAAM,IAAI,UAAU,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;QACnE,OAAO,CAAC,CAAC,EAAE,EAAE;YACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE;gBAAE,IAAI,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC;oBAAE,OAAO,IAAI,CAAC;YACjF,OAAO,KAAK,CAAC;QACd,CAAC,CAAC;IACH,CAAC;IACD,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,CAAC;IAChC,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC;IAC1E,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,QAAQ,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;AAC7F,CAAC;AAED,eAAe;AACf,MAAM,UAAU,UAAU,CAAC,KAAc;IACxC,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI;QAAE,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,KAAK,CAAC;IAC3E,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AACnC,CAAC;AAED,eAAe;AACf,MAAM,UAAU,QAAQ,CAAC,MAAwB;IAChD,OAAO,CAAC,CAAC,EAAE,EAAE;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAAE,OAAO,IAAI,CAAC;QACtE,OAAO,KAAK,CAAC;IACd,CAAC,CAAC;AACH,CAAC;AAED,eAAe;AACf,MAAM,UAAU,QAAQ,CAAC,MAAwB;IAChD,OAAO,CAAC,CAAC,EAAE,EAAE;QACZ,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC;gBAAE,OAAO,KAAK,CAAC;QAClF,OAAO,CAAC,KAAK,CAAC,CAAC;IAChB,CAAC,CAAC;AACH,CAAC;AAED,aAAa;AACb,MAAM,UAAU,QAAQ,CAAC,KAAY;IACpC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;AACzB,CAAC;AAED,+BAA+B;AAC/B,MAAM,UAAU,OAAO,CAAC,IAAW,EAAE,IAAW,EAAE,SAAgB;IACjE,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;AAClD,CAAC;AAED,oGAAoG;AACpG,MAAM,UAAU,WAAW,CAAC,GAAW,EAAE,IAAwB,EAAE,MAAwB;IAC1F,OAAO,CAAC,CAAC,EAAE,EAAE;QACZ,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;QAC/B,MAAM,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,IAAI,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG;gBAAE,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/E,OAAO,KAAK,CAAC;IACd,CAAC,CAAC;AACH,CAAC;AAED,qHAAqH;AACrH,MAAM,UAAU,SAAS,CAAC,CAAU,EAAE,CAAU;IAC/C,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACzB,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI;QAAE,OAAO,KAAK,CAAC;IAC7F,MAAM,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAC/B,IAAI,KAAK,KAAK,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;QAAE,OAAO,KAAK,CAAC;IAC7C,IAAI,KAAK,EAAE,CAAC;QACX,MAAM,CAAC,GAAG,CAAc,CAAC;QACzB,MAAM,CAAC,GAAG,CAAc,CAAC;QACzB,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;YAAE,OAAO,KAAK,CAAC;QACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAC;QAC5E,OAAO,IAAI,CAAC;IACb,CAAC;IACD,MAAM,CAAC,GAAG,CAA4B,CAAC;IACvC,MAAM,CAAC,GAAG,CAA4B,CAAC;IACvC,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5B,IAAI,IAAI,CAAC,MAAM,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM;QAAE,OAAO,KAAK,CAAC;IACxD,KAAK,MAAM,CAAC,IAAI,IAAI;QAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;IACvF,OAAO,IAAI,CAAC;AACb,CAAC","sourcesContent":["// Check factories: each returns a closure that captures only its arguments, never the compiler, so a compiled\n// schema keeps no compile-time state alive. Leaf checks are module constants that object and array loops inline.\n\nimport type { Check } from \"./types.ts\";\n\nexport const ALWAYS: Check = () => true;\nexport const NEVER: Check = () => false;\nconst IS_STRING: Check = (v) => typeof v === \"string\";\nconst IS_NUMBER: Check = (v) => typeof v === \"number\";\nconst IS_INTEGER: Check = (v) => Number.isInteger(v);\nconst IS_BOOLEAN: Check = (v) => typeof v === \"boolean\";\nconst IS_NULL: Check = (v) => v === null;\nexport const IS_ARRAY: Check = (v) => Array.isArray(v);\nconst IS_BYTES: Check = (v) => v instanceof Uint8Array;\nexport const IS_OBJECT: Check = (v) => isObject(v);\n\n/** Whether `v` is a JSON object: not null, an array or bytes. */\nexport function isObject(v: unknown): v is Record<string, unknown> {\n\treturn typeof v === \"object\" && v !== null && !Array.isArray(v) && !(v instanceof Uint8Array);\n}\n\n/** The check of a `type` name; `bytes` (a Uint8Array) extends JSON Schema for values that never pass through JSON. */\nexport const TYPE_CHECKS: ReadonlyMap<string, Check> = new Map([\n\t[\"string\", IS_STRING],\n\t[\"number\", IS_NUMBER],\n\t[\"integer\", IS_INTEGER],\n\t[\"boolean\", IS_BOOLEAN],\n\t[\"null\", IS_NULL],\n\t[\"array\", IS_ARRAY],\n\t[\"object\", IS_OBJECT],\n\t[\"bytes\", IS_BYTES],\n]);\n\n/** Leaf checks that object and array loops run inline by code instead of calling them. */\nexport const LEAF_CODES: ReadonlyMap<Check, number> = new Map([\n\t[IS_STRING, 1],\n\t[IS_NUMBER, 2],\n\t[IS_INTEGER, 3],\n\t[IS_BOOLEAN, 4],\n\t[IS_NULL, 5],\n\t[ALWAYS, 6],\n]);\n\nfunction leafOk(code: number, x: unknown): boolean {\n\tswitch (code) {\n\t\tcase 1:\n\t\t\treturn typeof x === \"string\";\n\t\tcase 2:\n\t\t\treturn typeof x === \"number\";\n\t\tcase 3:\n\t\t\treturn Number.isInteger(x);\n\t\tcase 4:\n\t\t\treturn typeof x === \"boolean\";\n\t\tcase 5:\n\t\t\treturn x === null;\n\t\tdefault:\n\t\t\treturn true;\n\t}\n}\n\n/** Whether a combined object or array check also checks the type: not at all, strictly, or passing other types. */\nexport const GUARD_NONE = 0;\nexport const GUARD_STRICT = 1;\nexport const GUARD_LOOSE = 2;\nexport type Guard = typeof GUARD_NONE | typeof GUARD_STRICT | typeof GUARD_LOOSE;\n\n/** Flags of a declared property in an object check's entries: its leaf code and two bits. */\nexport const CODE = 7;\nexport const REQUIRED = 8;\nexport const INHERITED = 16;\n\n/** All of `parts`; two and three parts get closures without a loop. */\nexport function and(parts: readonly Check[]): Check {\n\tswitch (parts.length) {\n\t\tcase 0:\n\t\t\treturn ALWAYS;\n\t\tcase 1:\n\t\t\treturn parts[0];\n\t\tcase 2: {\n\t\t\tconst [a, b] = parts;\n\t\t\treturn (v) => a(v) && b(v);\n\t\t}\n\t\tcase 3: {\n\t\t\tconst [a, b, c] = parts;\n\t\t\treturn (v) => a(v) && b(v) && c(v);\n\t\t}\n\t\tdefault:\n\t\t\treturn (v) => {\n\t\t\t\tfor (let i = 0; i < parts.length; i++) if (!parts[i](v)) return false;\n\t\t\t\treturn true;\n\t\t\t};\n\t}\n}\n\n/** A check whose implementation is set later: the indirection a recursive reference goes through. */\nexport function indirect(slot: { check: Check | undefined }): Check {\n\treturn (v) => (slot.check as Check)(v);\n}\n\n/** `check` with `uri` pushed onto the dynamic scope while it runs (only for schemas with `$dynamicRef`). */\nexport function scopedCheck(scope: string[], uri: string, check: Check): Check {\n\treturn (v) => {\n\t\tscope.push(uri);\n\t\tconst ok = check(v);\n\t\tscope.pop();\n\t\treturn ok;\n\t};\n}\n\n/** Any of the named types. */\nexport function typeCheck(types: readonly unknown[]): Check {\n\tconst checks = types.map((t) => (typeof t === \"string\" ? TYPE_CHECKS.get(t) : undefined) ?? NEVER);\n\tif (checks.length === 1) return checks[0];\n\treturn (v) => {\n\t\tfor (let i = 0; i < checks.length; i++) if (checks[i](v)) return true;\n\t\treturn false;\n\t};\n}\n\n/** A Uint8Array within the length bounds. */\nexport function bytesCheck(min: number, max: number): Check {\n\treturn (v) => v instanceof Uint8Array && v.length >= min && v.length <= max;\n}\n\n/** The number of Unicode code points of `s`: JSON Schema string lengths count code points, not UTF-16 units. */\nexport function codePoints(s: string): number {\n\tlet n = 0;\n\tfor (let i = 0; i < s.length; i++, n++) {\n\t\tconst c = s.charCodeAt(i);\n\t\t// A high surrogate starts a pair only when a low surrogate follows; an unpaired one is a code point of its own.\n\t\tif (c >= 0xd800 && c <= 0xdbff && i + 1 < s.length) {\n\t\t\tconst next = s.charCodeAt(i + 1);\n\t\t\tif (next >= 0xdc00 && next <= 0xdfff) i++;\n\t\t}\n\t}\n\treturn n;\n}\n\n// UTF-16 units bound code points from both sides (units / 2 <= points <= units), so most strings need no count.\nfunction lengthOk(s: string, min: number, max: number): boolean {\n\tconst units = s.length;\n\tif (units < min) return false;\n\tif (units < 2 * min && codePoints(s) < min) return false;\n\treturn units <= max || codePoints(s) <= max;\n}\n\n/** The string keywords: length bounds, pattern and format. */\nexport function stringCheck(\n\tstrict: boolean,\n\tmin: number,\n\tmax: number,\n\tre: RegExp | undefined,\n\tformat: ((value: string) => boolean) | undefined,\n): Check {\n\tif (re !== undefined && min === 0 && max === Number.POSITIVE_INFINITY && format === undefined) {\n\t\treturn strict ? (v) => typeof v === \"string\" && re.test(v) : (v) => typeof v !== \"string\" || re.test(v);\n\t}\n\tif (re === undefined && format === undefined) {\n\t\treturn strict\n\t\t\t? (v) => typeof v === \"string\" && lengthOk(v, min, max)\n\t\t\t: (v) => typeof v !== \"string\" || lengthOk(v, min, max);\n\t}\n\treturn (v) => {\n\t\tif (typeof v !== \"string\") return !strict;\n\t\treturn lengthOk(v, min, max) && (re === undefined || re.test(v)) && (format === undefined || format(v));\n\t};\n}\n\n/** The number keywords. `mode`: 0 passes other types, 1 requires a number, 2 an integer. */\nexport function numberCheck(\n\tmode: 0 | 1 | 2,\n\tmin: number,\n\tmax: number,\n\txmin: number,\n\txmax: number,\n\tmultipleOf: number | undefined,\n): Check {\n\treturn (v) => {\n\t\tif (typeof v !== \"number\") return mode === 0;\n\t\tif (mode === 2 && !Number.isInteger(v)) return false;\n\t\treturn v >= min && v <= max && v > xmin && v < xmax && (multipleOf === undefined || isMultiple(v, multipleOf));\n\t};\n}\n\n/** Whether `v` is a multiple of `d`, exactly for decimals: 0.0075 / 0.0001 is 74.99999999999999 in floating point. */\nexport function isMultiple(v: number, d: number): boolean {\n\tconst q = v / d;\n\tif (Number.isInteger(q)) return true;\n\tif (!Number.isFinite(q)) return v % d === 0;\n\tconst [vc, ve] = decimal(v);\n\tconst [dc, de] = decimal(d);\n\treturn ve >= de ? (vc * 10n ** BigInt(ve - de)) % dc === 0n : vc % (dc * 10n ** BigInt(de - ve)) === 0n;\n}\n\nfunction decimal(x: number): [bigint, number] {\n\tconst [mantissa, exponent = \"0\"] = Math.abs(x).toString().split(\"e\");\n\tconst point = mantissa.indexOf(\".\");\n\tconst fraction = point < 0 ? 0 : mantissa.length - point - 1;\n\treturn [BigInt(mantissa.replace(\".\", \"\")), Number(exponent) - fraction];\n}\n\n/** `inner` for objects; other values pass unless `strict`. */\nexport function guardObject(inner: Check, strict: boolean): Check {\n\treturn strict ? (v) => isObject(v) && inner(v) : (v) => !isObject(v) || inner(v);\n}\n\n/** `inner` for arrays; other values pass unless `strict`. */\nexport function guardArray(inner: Check, strict: boolean): Check {\n\treturn strict ? (v) => Array.isArray(v) && inner(v) : (v) => !Array.isArray(v) || inner(v);\n}\n\n/**\n * An object with declared properties: `entries` is `[key, check, flags]` per property. The value's own keys are\n * walked with for...in (whose `o[k]` V8 reads from the enum cache, unlike a load by a name from a list), each found\n * among the declared names; `closed` rejects any other key. A property whose value is `undefined` counts as absent.\n */\nexport function declaredObject(\n\tentries: readonly unknown[],\n\trequiredCount: number,\n\tclosed: boolean,\n\tguard: Guard,\n): Check {\n\tconst n = entries.length;\n\treturn (v) => {\n\t\tif (guard !== GUARD_NONE && !isObject(v)) return guard === GUARD_LOOSE;\n\t\t// Guarded: by the check above, or by the caller for GUARD_NONE.\n\t\tconst o = v as Record<string, unknown>;\n\t\tlet required = 0;\n\t\tfor (const k in o) {\n\t\t\tlet i = 0;\n\t\t\twhile (i < n && entries[i] !== k) i += 3;\n\t\t\tif (i === n) {\n\t\t\t\tif (closed) return false;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tconst x = o[k];\n\t\t\tif (x === undefined) continue;\n\t\t\tconst f = entries[i + 2] as number;\n\t\t\tconst c = f & CODE;\n\t\t\tif (c !== 0 ? !leafOk(c, x) : !(entries[i + 1] as Check)(x)) return false;\n\t\t\tif (f & REQUIRED) required++;\n\t\t}\n\t\treturn required === requiredCount;\n\t};\n}\n\n/** An object with declared properties, required keys not declared, pattern properties and additional properties. */\nexport function openObject(\n\tentries: readonly unknown[],\n\tkeys: readonly string[],\n\textraRequired: readonly string[],\n\tpatterns: readonly (readonly [RegExp, Check])[],\n\tadditional: Check | undefined,\n\tguard: Guard,\n): Check {\n\tconst known = patterns.length > 0 || additional !== undefined ? new Set(keys) : undefined;\n\treturn (v) => {\n\t\tif (guard !== GUARD_NONE && !isObject(v)) return guard === GUARD_LOOSE;\n\t\tconst o = v as Record<string, unknown>;\n\t\tfor (let i = 0; i < entries.length; i += 3) {\n\t\t\tconst k = entries[i] as string;\n\t\t\tconst x = o[k];\n\t\t\tconst f = entries[i + 2] as number;\n\t\t\tif (x === undefined || (f & INHERITED && !Object.hasOwn(o, k))) {\n\t\t\t\tif (f & REQUIRED) return false;\n\t\t\t\tcontinue;\n\t\t\t}\n\t\t\tconst c = f & CODE;\n\t\t\tif (c !== 0 ? !leafOk(c, x) : !(entries[i + 1] as Check)(x)) return false;\n\t\t}\n\t\tfor (let i = 0; i < extraRequired.length; i++) if (!Object.hasOwn(o, extraRequired[i])) return false;\n\t\tif (known === undefined) return true;\n\t\tfor (const k of Object.keys(o)) {\n\t\t\tlet matched = known.has(k);\n\t\t\tfor (let i = 0; i < patterns.length; i++) {\n\t\t\t\tif (patterns[i][0].test(k)) {\n\t\t\t\t\tmatched = true;\n\t\t\t\t\tif (!patterns[i][1](o[k])) return false;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!matched && additional !== undefined && !additional(o[k])) return false;\n\t\t}\n\t\treturn true;\n\t};\n}\n\n/** Every property name passes `check` (`v` is an object). */\nexport function propertyNamesCheck(check: Check): Check {\n\treturn (v) => {\n\t\tfor (const k in v as object) if (!check(k)) return false;\n\t\treturn true;\n\t};\n}\n\n/** `minProperties` and `maxProperties` (`v` is an object). */\nexport function propertyCountCheck(min: number, max: number): Check {\n\treturn (v) => {\n\t\tlet n = 0;\n\t\tfor (const _ in v as object) n++;\n\t\treturn n >= min && n <= max;\n\t};\n}\n\n/** `dependentRequired` (`v` is an object). */\nexport function dependentRequiredCheck(entries: readonly (readonly [string, readonly string[]])[]): Check {\n\treturn (v) => {\n\t\tconst o = v as object;\n\t\tfor (const [k, list] of entries)\n\t\t\tif (Object.hasOwn(o, k)) for (const r of list) if (!Object.hasOwn(o, r)) return false;\n\t\treturn true;\n\t};\n}\n\n/** `dependentSchemas` (`v` is an object). */\nexport function dependentSchemasCheck(entries: readonly (readonly [string, Check])[]): Check {\n\treturn (v) => {\n\t\tfor (const [k, check] of entries) if (Object.hasOwn(v as object, k) && !check(v)) return false;\n\t\treturn true;\n\t};\n}\n\n/** The common array: guard, length bounds, prefix items and the items after them, in one closure. */\nexport function listCheck(\n\tguard: Guard,\n\tmin: number,\n\tmax: number,\n\tprefix: readonly Check[],\n\trest: Check | undefined,\n): Check {\n\tconst n = prefix.length;\n\tconst code = rest === undefined ? 0 : (LEAF_CODES.get(rest) ?? 0);\n\treturn (v) => {\n\t\tif (!Array.isArray(v)) return guard === GUARD_LOOSE;\n\t\tconst length = v.length;\n\t\tif (length < min || length > max) return false;\n\t\tconst m = length < n ? length : n;\n\t\tfor (let i = 0; i < m; i++) if (!prefix[i](v[i])) return false;\n\t\tif (rest === undefined) return true;\n\t\tif (code !== 0) {\n\t\t\tfor (let i = n; i < length; i++) if (!leafOk(code, v[i])) return false;\n\t\t\treturn true;\n\t\t}\n\t\tfor (let i = n; i < length; i++) if (!rest(v[i])) return false;\n\t\treturn true;\n\t};\n}\n\n/** Prefix items and the items after them (`v` is an array). */\nexport function itemsCheck(prefix: readonly Check[], rest: Check | undefined): Check {\n\treturn listCheck(GUARD_NONE, 0, Number.POSITIVE_INFINITY, prefix, rest);\n}\n\n/** `minItems` and `maxItems` (`v` is an array). */\nexport function lengthCheck(min: number, max: number): Check {\n\treturn (v) => (v as unknown[]).length >= min && (v as unknown[]).length <= max;\n}\n\n/** `contains` with its bounds (`v` is an array). */\nexport function containsCheck(check: Check, min: number, max: number): Check {\n\treturn (v) => {\n\t\tconst list = v as unknown[];\n\t\tlet n = 0;\n\t\tfor (let i = 0; i < list.length; i++) if (check(list[i]) && ++n > max) return false;\n\t\treturn n >= min;\n\t};\n}\n\n/** `uniqueItems` (`v` is an array). */\nexport function uniqueCheck(v: unknown): boolean {\n\tconst list = v as unknown[];\n\tfor (let i = 1; i < list.length; i++) for (let j = 0; j < i; j++) if (deepEqual(list[i], list[j])) return false;\n\treturn true;\n}\n\n/** `enum`: up to 8 primitives by a scan, more by a Set, objects and arrays by deep equality. */\nexport function enumCheck(values: readonly unknown[]): Check {\n\tconst primitives = values.filter((x) => typeof x !== \"object\" || x === null);\n\tif (primitives.length === values.length && primitives.length <= 8) {\n\t\treturn (v) => {\n\t\t\tfor (let i = 0; i < primitives.length; i++) if (primitives[i] === v) return true;\n\t\t\treturn false;\n\t\t};\n\t}\n\tconst set = new Set(primitives);\n\tconst objects = values.filter((x) => typeof x === \"object\" && x !== null);\n\treturn (v) => set.has(v) || (typeof v === \"object\" && objects.some((o) => deepEqual(v, o)));\n}\n\n/** `const`. */\nexport function constCheck(value: unknown): Check {\n\tif (typeof value !== \"object\" || value === null) return (v) => v === value;\n\treturn (v) => deepEqual(v, value);\n}\n\n/** `anyOf`. */\nexport function anyCheck(checks: readonly Check[]): Check {\n\treturn (v) => {\n\t\tfor (let i = 0; i < checks.length; i++) if (checks[i](v)) return true;\n\t\treturn false;\n\t};\n}\n\n/** `oneOf`. */\nexport function oneCheck(checks: readonly Check[]): Check {\n\treturn (v) => {\n\t\tlet n = 0;\n\t\tfor (let i = 0; i < checks.length; i++) if (checks[i](v) && ++n > 1) return false;\n\t\treturn n === 1;\n\t};\n}\n\n/** `not`. */\nexport function notCheck(check: Check): Check {\n\treturn (v) => !check(v);\n}\n\n/** `if`, `then` and `else`. */\nexport function ifCheck(cond: Check, then: Check, otherwise: Check): Check {\n\treturn (v) => (cond(v) ? then(v) : otherwise(v));\n}\n\n/** A union of objects tagged by a const on `key`: the tag selects the one branch that can match. */\nexport function taggedCheck(key: string, tags: readonly unknown[], checks: readonly Check[]): Check {\n\treturn (v) => {\n\t\tif (!isObject(v)) return false;\n\t\tconst tag = v[key];\n\t\tfor (let i = 0; i < tags.length; i++) if (tags[i] === tag) return checks[i](v);\n\t\treturn false;\n\t};\n}\n\n/** JSON equality: same primitives, arrays with equal items in order, objects with the same keys and equal values. */\nexport function deepEqual(a: unknown, b: unknown): boolean {\n\tif (a === b) return true;\n\tif (typeof a !== \"object\" || typeof b !== \"object\" || a === null || b === null) return false;\n\tconst array = Array.isArray(a);\n\tif (array !== Array.isArray(b)) return false;\n\tif (array) {\n\t\tconst x = a as unknown[];\n\t\tconst y = b as unknown[];\n\t\tif (x.length !== y.length) return false;\n\t\tfor (let i = 0; i < x.length; i++) if (!deepEqual(x[i], y[i])) return false;\n\t\treturn true;\n\t}\n\tconst x = a as Record<string, unknown>;\n\tconst y = b as Record<string, unknown>;\n\tconst keys = Object.keys(x);\n\tif (keys.length !== Object.keys(y).length) return false;\n\tfor (const k of keys) if (!Object.hasOwn(y, k) || !deepEqual(x[k], y[k])) return false;\n\treturn true;\n}\n"]}

package/dist/coerce.d.ts

@@ -0,0 +1,53 @@
+import type { Compiler } from "./compiler.ts";
+/** Coerces values for one compiled schema. */
+export declare class Coercer {
+    private readonly c;
+    private readonly schema;
+    /**
+     * The (schema node, value) pairs pass 2 is converting through a re-entry point, as a stack. Conversion can enter
+     * a node again with the same value only through a `$ref` or by wrapping a single value into an array (also for
+     * schemas that cycle through shared JS objects): a recursive schema that meets a value no branch accepts would
+     * convert it without end. A pair already on the stack (primitives by value, objects by reference) leaves the value
+     * unchanged. Only those two points push, so schemas without references or wraps pay nothing.
+     */
+    private readonly entered;
+    /** How often a re-entry was cut short in this coerce() call; results computed across one are not memoized. */
+    private cuts;
+    /**
+     * Results of `$ref` targets by (node, value) within one coerce() call: a recursive union whose branches all
+     * convert the same children (and all fail) would convert them once per branch, exponentially in the depth.
+     */
+    private memo;
+    constructor(compiler: Compiler, schema: unknown);
+    /** `value` coerced: a copy along the changed paths only, or `value` itself when nothing changes. */
+    coerce(value: unknown): unknown;
+    /** Pass 2 alone, as TypeBox's `Value.Convert` (the TypeBox conformance tests run it). */
+    convertOnly(value: unknown): unknown;
+    /** `node` converted for `value` at a re-entry point: unchanged when that pair is already being converted. */
+    private reenter;
+    /** Whether `value` passes the schema `node`; undefined when `node` cannot be compiled. */
+    private passes;
+    private baseOf;
+    private dropOptionalNulls;
+    private convert;
+    /** One schema node's conversion: its first keyword among `const`, `enum`, the unions, `allOf` and `type`. */
+    private convertNode;
+    /** An enum is a union of its values: a member stays, else the first value the input converts to. */
+    private convertEnum;
+    /**
+     * A value one branch accepts stays; else the first branch's conversion that the whole union accepts. Branches are
+     * converted in order and only until one is accepted, so a later recursive branch is not entered needlessly. A node
+     * that also declares members (plain JSON Schema; TypeBox's never do) converts them into each candidate before it is
+     * checked, so a branch is not discarded for a sibling property that is converted after it.
+     */
+    private convertUnion;
+    /** The object members of a union or intersection node, when it declares any. */
+    private convertMembers;
+    private convertArray;
+    private convertObject;
+    private coerceTypes;
+    private coerceUnion;
+    private coerceProperties;
+    private coerceItems;
+}
+//# sourceMappingURL=coerce.d.ts.map

package/dist/coerce.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"coerce.d.ts","sourceRoot":"","sources":["../src/coerce.ts"],"names":[],"mappings":"AAmBA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AAK9C,8CAA8C;AAC9C,qBAAa,OAAO;IACnB,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAW;IAC7B,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAU;IACjC;;;;;;OAMG;IACH,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAiB;IACzC,8GAA8G;IAC9G,OAAO,CAAC,IAAI,CAAK;IACjB;;;OAGG;IACH,OAAO,CAAC,IAAI,CAA6D;IAEzE,YAAY,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAG9C;IAED,oGAAoG;IACpG,MAAM,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO,CAI9B;IAED,yFAAyF;IACzF,WAAW,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO,CAOnC;IAED,6GAA6G;IAC7G,OAAO,CAAC,OAAO;IA8Bf,0FAA0F;IAC1F,OAAO,CAAC,MAAM;IAQd,OAAO,CAAC,MAAM;IAQd,OAAO,CAAC,iBAAiB;IAqDzB,OAAO,CAAC,OAAO;IAef,6GAA6G;IAC7G,OAAO,CAAC,WAAW;IAwCnB,oGAAoG;IACpG,OAAO,CAAC,WAAW;IASnB;;;;;OAKG;IACH,OAAO,CAAC,YAAY;IAUpB,gFAAgF;IAChF,OAAO,CAAC,cAAc;IAQtB,OAAO,CAAC,YAAY;IAuBpB,OAAO,CAAC,aAAa;IAgCrB,OAAO,CAAC,WAAW;IAuBnB,OAAO,CAAC,WAAW;IASnB,OAAO,CAAC,gBAAgB;IA+BxB,OAAO,CAAC,WAAW;CAMnB"}