langgraph-ui-components 0.0.24 → 0.0.25

package/dist/node_modules/.pnpm/@cfworker_json-schema@4.1.1/node_modules/@cfworker/json-schema/dist/esm/validate.es.js

@@ -1,526 +0,0 @@
-import { deepCompareStrict as L } from "./deep-compare-strict.es.js";
-import { dereference as ge } from "./dereference.es.js";
-import { format as pe } from "./format.es.js";
-import { encodePointer as x } from "./pointer.es.js";
-import { ucs2length as be } from "./ucs2-length.es.js";
-function k(d, O, y = "2019-09", p = ge(O), m = !0, i = null, e = "#", f = "#", w = /* @__PURE__ */ Object.create(null)) {
-  if (O === !0)
-    return { valid: !0, errors: [] };
-  if (O === !1)
-    return {
-      valid: !1,
-      errors: [
-        {
-          instanceLocation: e,
-          keyword: "false",
-          keywordLocation: e,
-          error: "False boolean schema."
-        }
-      ]
-    };
-  const U = typeof d;
-  let h;
-  switch (U) {
-    case "boolean":
-    case "number":
-    case "string":
-      h = U;
-      break;
-    case "object":
-      d === null ? h = "null" : Array.isArray(d) ? h = "array" : h = "object";
-      break;
-    default:
-      throw new Error(`Instances of "${U}" type are not supported.`);
-  }
-  const { $ref: R, $recursiveRef: we, $recursiveAnchor: _, type: b, const: v, enum: S, required: c, not: ee, anyOf: V, allOf: X, oneOf: re, if: de, then: te, else: se, format: M, properties: D, patternProperties: z, additionalProperties: oe, unevaluatedProperties: fe, minProperties: B, maxProperties: H, propertyNames: ne, dependentRequired: Q, dependentSchemas: W, dependencies: Y, prefixItems: Z, items: j, additionalItems: le, unevaluatedItems: ue, contains: $e, minContains: I, maxContains: N, minItems: A, maxItems: C, uniqueItems: ke, minimum: a, maximum: P, exclusiveMinimum: E, exclusiveMaximum: q, multipleOf: J, minLength: T, maxLength: F, pattern: me, __absolute_ref__: K, __absolute_recursive_ref__: he } = O, t = [];
-  if (_ === !0 && i === null && (i = O), we === "#") {
-    const n = i === null ? p[he] : i, o = `${f}/$recursiveRef`, $ = k(d, i === null ? O : i, y, p, m, n, e, o, w);
-    $.valid || t.push({
-      instanceLocation: e,
-      keyword: "$recursiveRef",
-      keywordLocation: o,
-      error: "A subschema had errors."
-    }, ...$.errors);
-  }
-  if (R !== void 0) {
-    const o = p[K || R];
-    if (o === void 0) {
-      let r = `Unresolved $ref "${R}".`;
-      throw K && K !== R && (r += `  Absolute URI "${K}".`), r += `
-Known schemas:
-- ${Object.keys(p).join(`
-- `)}`, new Error(r);
-    }
-    const $ = `${f}/$ref`, s = k(d, o, y, p, m, i, e, $, w);
-    if (s.valid || t.push({
-      instanceLocation: e,
-      keyword: "$ref",
-      keywordLocation: $,
-      error: "A subschema had errors."
-    }, ...s.errors), y === "4" || y === "7")
-      return { valid: t.length === 0, errors: t };
-  }
-  if (Array.isArray(b)) {
-    let n = b.length, o = !1;
-    for (let $ = 0; $ < n; $++)
-      if (h === b[$] || b[$] === "integer" && h === "number" && d % 1 === 0 && d === d) {
-        o = !0;
-        break;
-      }
-    o || t.push({
-      instanceLocation: e,
-      keyword: "type",
-      keywordLocation: `${f}/type`,
-      error: `Instance type "${h}" is invalid. Expected "${b.join('", "')}".`
-    });
-  } else b === "integer" ? (h !== "number" || d % 1 || d !== d) && t.push({
-    instanceLocation: e,
-    keyword: "type",
-    keywordLocation: `${f}/type`,
-    error: `Instance type "${h}" is invalid. Expected "${b}".`
-  }) : b !== void 0 && h !== b && t.push({
-    instanceLocation: e,
-    keyword: "type",
-    keywordLocation: `${f}/type`,
-    error: `Instance type "${h}" is invalid. Expected "${b}".`
-  });
-  if (v !== void 0 && (h === "object" || h === "array" ? L(d, v) || t.push({
-    instanceLocation: e,
-    keyword: "const",
-    keywordLocation: `${f}/const`,
-    error: `Instance does not match ${JSON.stringify(v)}.`
-  }) : d !== v && t.push({
-    instanceLocation: e,
-    keyword: "const",
-    keywordLocation: `${f}/const`,
-    error: `Instance does not match ${JSON.stringify(v)}.`
-  })), S !== void 0 && (h === "object" || h === "array" ? S.some((n) => L(d, n)) || t.push({
-    instanceLocation: e,
-    keyword: "enum",
-    keywordLocation: `${f}/enum`,
-    error: `Instance does not match any of ${JSON.stringify(S)}.`
-  }) : S.some((n) => d === n) || t.push({
-    instanceLocation: e,
-    keyword: "enum",
-    keywordLocation: `${f}/enum`,
-    error: `Instance does not match any of ${JSON.stringify(S)}.`
-  })), ee !== void 0) {
-    const n = `${f}/not`;
-    k(d, ee, y, p, m, i, e, n).valid && t.push({
-      instanceLocation: e,
-      keyword: "not",
-      keywordLocation: n,
-      error: 'Instance matched "not" schema.'
-    });
-  }
-  let G = [];
-  if (V !== void 0) {
-    const n = `${f}/anyOf`, o = t.length;
-    let $ = !1;
-    for (let s = 0; s < V.length; s++) {
-      const r = V[s], u = Object.create(w), l = k(d, r, y, p, m, _ === !0 ? i : null, e, `${n}/${s}`, u);
-      t.push(...l.errors), $ = $ || l.valid, l.valid && G.push(u);
-    }
-    $ ? t.length = o : t.splice(o, 0, {
-      instanceLocation: e,
-      keyword: "anyOf",
-      keywordLocation: n,
-      error: "Instance does not match any subschemas."
-    });
-  }
-  if (X !== void 0) {
-    const n = `${f}/allOf`, o = t.length;
-    let $ = !0;
-    for (let s = 0; s < X.length; s++) {
-      const r = X[s], u = Object.create(w), l = k(d, r, y, p, m, _ === !0 ? i : null, e, `${n}/${s}`, u);
-      t.push(...l.errors), $ = $ && l.valid, l.valid && G.push(u);
-    }
-    $ ? t.length = o : t.splice(o, 0, {
-      instanceLocation: e,
-      keyword: "allOf",
-      keywordLocation: n,
-      error: "Instance does not match every subschema."
-    });
-  }
-  if (re !== void 0) {
-    const n = `${f}/oneOf`, o = t.length, $ = re.filter((s, r) => {
-      const u = Object.create(w), l = k(d, s, y, p, m, _ === !0 ? i : null, e, `${n}/${r}`, u);
-      return t.push(...l.errors), l.valid && G.push(u), l.valid;
-    }).length;
-    $ === 1 ? t.length = o : t.splice(o, 0, {
-      instanceLocation: e,
-      keyword: "oneOf",
-      keywordLocation: n,
-      error: `Instance does not match exactly one subschema (${$} matches).`
-    });
-  }
-  if ((h === "object" || h === "array") && Object.assign(w, ...G), de !== void 0) {
-    const n = `${f}/if`;
-    if (k(d, de, y, p, m, i, e, n, w).valid) {
-      if (te !== void 0) {
-        const $ = k(d, te, y, p, m, i, e, `${f}/then`, w);
-        $.valid || t.push({
-          instanceLocation: e,
-          keyword: "if",
-          keywordLocation: n,
-          error: 'Instance does not match "then" schema.'
-        }, ...$.errors);
-      }
-    } else if (se !== void 0) {
-      const $ = k(d, se, y, p, m, i, e, `${f}/else`, w);
-      $.valid || t.push({
-        instanceLocation: e,
-        keyword: "if",
-        keywordLocation: n,
-        error: 'Instance does not match "else" schema.'
-      }, ...$.errors);
-    }
-  }
-  if (h === "object") {
-    if (c !== void 0)
-      for (const s of c)
-        s in d || t.push({
-          instanceLocation: e,
-          keyword: "required",
-          keywordLocation: `${f}/required`,
-          error: `Instance does not have required property "${s}".`
-        });
-    const n = Object.keys(d);
-    if (B !== void 0 && n.length < B && t.push({
-      instanceLocation: e,
-      keyword: "minProperties",
-      keywordLocation: `${f}/minProperties`,
-      error: `Instance does not have at least ${B} properties.`
-    }), H !== void 0 && n.length > H && t.push({
-      instanceLocation: e,
-      keyword: "maxProperties",
-      keywordLocation: `${f}/maxProperties`,
-      error: `Instance does not have at least ${H} properties.`
-    }), ne !== void 0) {
-      const s = `${f}/propertyNames`;
-      for (const r in d) {
-        const u = `${e}/${x(r)}`, l = k(r, ne, y, p, m, i, u, s);
-        l.valid || t.push({
-          instanceLocation: e,
-          keyword: "propertyNames",
-          keywordLocation: s,
-          error: `Property name "${r}" does not match schema.`
-        }, ...l.errors);
-      }
-    }
-    if (Q !== void 0) {
-      const s = `${f}/dependantRequired`;
-      for (const r in Q)
-        if (r in d) {
-          const u = Q[r];
-          for (const l of u)
-            l in d || t.push({
-              instanceLocation: e,
-              keyword: "dependentRequired",
-              keywordLocation: s,
-              error: `Instance has "${r}" but does not have "${l}".`
-            });
-        }
-    }
-    if (W !== void 0)
-      for (const s in W) {
-        const r = `${f}/dependentSchemas`;
-        if (s in d) {
-          const u = k(d, W[s], y, p, m, i, e, `${r}/${x(s)}`, w);
-          u.valid || t.push({
-            instanceLocation: e,
-            keyword: "dependentSchemas",
-            keywordLocation: r,
-            error: `Instance has "${s}" but does not match dependant schema.`
-          }, ...u.errors);
-        }
-      }
-    if (Y !== void 0) {
-      const s = `${f}/dependencies`;
-      for (const r in Y)
-        if (r in d) {
-          const u = Y[r];
-          if (Array.isArray(u))
-            for (const l of u)
-              l in d || t.push({
-                instanceLocation: e,
-                keyword: "dependencies",
-                keywordLocation: s,
-                error: `Instance has "${r}" but does not have "${l}".`
-              });
-          else {
-            const l = k(d, u, y, p, m, i, e, `${s}/${x(r)}`);
-            l.valid || t.push({
-              instanceLocation: e,
-              keyword: "dependencies",
-              keywordLocation: s,
-              error: `Instance has "${r}" but does not match dependant schema.`
-            }, ...l.errors);
-          }
-        }
-    }
-    const o = /* @__PURE__ */ Object.create(null);
-    let $ = !1;
-    if (D !== void 0) {
-      const s = `${f}/properties`;
-      for (const r in D) {
-        if (!(r in d))
-          continue;
-        const u = `${e}/${x(r)}`, l = k(d[r], D[r], y, p, m, i, u, `${s}/${x(r)}`);
-        if (l.valid)
-          w[r] = o[r] = !0;
-        else if ($ = m, t.push({
-          instanceLocation: e,
-          keyword: "properties",
-          keywordLocation: s,
-          error: `Property "${r}" does not match schema.`
-        }, ...l.errors), $)
-          break;
-      }
-    }
-    if (!$ && z !== void 0) {
-      const s = `${f}/patternProperties`;
-      for (const r in z) {
-        const u = new RegExp(r, "u"), l = z[r];
-        for (const g in d) {
-          if (!u.test(g))
-            continue;
-          const ie = `${e}/${x(g)}`, ye = k(d[g], l, y, p, m, i, ie, `${s}/${x(r)}`);
-          ye.valid ? w[g] = o[g] = !0 : ($ = m, t.push({
-            instanceLocation: e,
-            keyword: "patternProperties",
-            keywordLocation: s,
-            error: `Property "${g}" matches pattern "${r}" but does not match associated schema.`
-          }, ...ye.errors));
-        }
-      }
-    }
-    if (!$ && oe !== void 0) {
-      const s = `${f}/additionalProperties`;
-      for (const r in d) {
-        if (o[r])
-          continue;
-        const u = `${e}/${x(r)}`, l = k(d[r], oe, y, p, m, i, u, s);
-        l.valid ? w[r] = !0 : ($ = m, t.push({
-          instanceLocation: e,
-          keyword: "additionalProperties",
-          keywordLocation: s,
-          error: `Property "${r}" does not match additional properties schema.`
-        }, ...l.errors));
-      }
-    } else if (!$ && fe !== void 0) {
-      const s = `${f}/unevaluatedProperties`;
-      for (const r in d)
-        if (!w[r]) {
-          const u = `${e}/${x(r)}`, l = k(d[r], fe, y, p, m, i, u, s);
-          l.valid ? w[r] = !0 : t.push({
-            instanceLocation: e,
-            keyword: "unevaluatedProperties",
-            keywordLocation: s,
-            error: `Property "${r}" does not match unevaluated properties schema.`
-          }, ...l.errors);
-        }
-    }
-  } else if (h === "array") {
-    C !== void 0 && d.length > C && t.push({
-      instanceLocation: e,
-      keyword: "maxItems",
-      keywordLocation: `${f}/maxItems`,
-      error: `Array has too many items (${d.length} > ${C}).`
-    }), A !== void 0 && d.length < A && t.push({
-      instanceLocation: e,
-      keyword: "minItems",
-      keywordLocation: `${f}/minItems`,
-      error: `Array has too few items (${d.length} < ${A}).`
-    });
-    const n = d.length;
-    let o = 0, $ = !1;
-    if (Z !== void 0) {
-      const s = `${f}/prefixItems`, r = Math.min(Z.length, n);
-      for (; o < r; o++) {
-        const u = k(d[o], Z[o], y, p, m, i, `${e}/${o}`, `${s}/${o}`);
-        if (w[o] = !0, !u.valid && ($ = m, t.push({
-          instanceLocation: e,
-          keyword: "prefixItems",
-          keywordLocation: s,
-          error: "Items did not match schema."
-        }, ...u.errors), $))
-          break;
-      }
-    }
-    if (j !== void 0) {
-      const s = `${f}/items`;
-      if (Array.isArray(j)) {
-        const r = Math.min(j.length, n);
-        for (; o < r; o++) {
-          const u = k(d[o], j[o], y, p, m, i, `${e}/${o}`, `${s}/${o}`);
-          if (w[o] = !0, !u.valid && ($ = m, t.push({
-            instanceLocation: e,
-            keyword: "items",
-            keywordLocation: s,
-            error: "Items did not match schema."
-          }, ...u.errors), $))
-            break;
-        }
-      } else
-        for (; o < n; o++) {
-          const r = k(d[o], j, y, p, m, i, `${e}/${o}`, s);
-          if (w[o] = !0, !r.valid && ($ = m, t.push({
-            instanceLocation: e,
-            keyword: "items",
-            keywordLocation: s,
-            error: "Items did not match schema."
-          }, ...r.errors), $))
-            break;
-        }
-      if (!$ && le !== void 0) {
-        const r = `${f}/additionalItems`;
-        for (; o < n; o++) {
-          const u = k(d[o], le, y, p, m, i, `${e}/${o}`, r);
-          w[o] = !0, u.valid || ($ = m, t.push({
-            instanceLocation: e,
-            keyword: "additionalItems",
-            keywordLocation: r,
-            error: "Items did not match additional items schema."
-          }, ...u.errors));
-        }
-      }
-    }
-    if ($e !== void 0)
-      if (n === 0 && I === void 0)
-        t.push({
-          instanceLocation: e,
-          keyword: "contains",
-          keywordLocation: `${f}/contains`,
-          error: "Array is empty. It must contain at least one item matching the schema."
-        });
-      else if (I !== void 0 && n < I)
-        t.push({
-          instanceLocation: e,
-          keyword: "minContains",
-          keywordLocation: `${f}/minContains`,
-          error: `Array has less items (${n}) than minContains (${I}).`
-        });
-      else {
-        const s = `${f}/contains`, r = t.length;
-        let u = 0;
-        for (let l = 0; l < n; l++) {
-          const g = k(d[l], $e, y, p, m, i, `${e}/${l}`, s);
-          g.valid ? (w[l] = !0, u++) : t.push(...g.errors);
-        }
-        u >= (I || 0) && (t.length = r), I === void 0 && N === void 0 && u === 0 ? t.splice(r, 0, {
-          instanceLocation: e,
-          keyword: "contains",
-          keywordLocation: s,
-          error: "Array does not contain item matching schema."
-        }) : I !== void 0 && u < I ? t.push({
-          instanceLocation: e,
-          keyword: "minContains",
-          keywordLocation: `${f}/minContains`,
-          error: `Array must contain at least ${I} items matching schema. Only ${u} items were found.`
-        }) : N !== void 0 && u > N && t.push({
-          instanceLocation: e,
-          keyword: "maxContains",
-          keywordLocation: `${f}/maxContains`,
-          error: `Array may contain at most ${N} items matching schema. ${u} items were found.`
-        });
-      }
-    if (!$ && ue !== void 0) {
-      const s = `${f}/unevaluatedItems`;
-      for (o; o < n; o++) {
-        if (w[o])
-          continue;
-        const r = k(d[o], ue, y, p, m, i, `${e}/${o}`, s);
-        w[o] = !0, r.valid || t.push({
-          instanceLocation: e,
-          keyword: "unevaluatedItems",
-          keywordLocation: s,
-          error: "Items did not match unevaluated items schema."
-        }, ...r.errors);
-      }
-    }
-    if (ke)
-      for (let s = 0; s < n; s++) {
-        const r = d[s], u = typeof r == "object" && r !== null;
-        for (let l = 0; l < n; l++) {
-          if (s === l)
-            continue;
-          const g = d[l];
-          (r === g || u && (typeof g == "object" && g !== null) && L(r, g)) && (t.push({
-            instanceLocation: e,
-            keyword: "uniqueItems",
-            keywordLocation: `${f}/uniqueItems`,
-            error: `Duplicate items at indexes ${s} and ${l}.`
-          }), s = Number.MAX_SAFE_INTEGER, l = Number.MAX_SAFE_INTEGER);
-        }
-      }
-  } else if (h === "number") {
-    if (y === "4" ? (a !== void 0 && (E === !0 && d <= a || d < a) && t.push({
-      instanceLocation: e,
-      keyword: "minimum",
-      keywordLocation: `${f}/minimum`,
-      error: `${d} is less than ${E ? "or equal to " : ""} ${a}.`
-    }), P !== void 0 && (q === !0 && d >= P || d > P) && t.push({
-      instanceLocation: e,
-      keyword: "maximum",
-      keywordLocation: `${f}/maximum`,
-      error: `${d} is greater than ${q ? "or equal to " : ""} ${P}.`
-    })) : (a !== void 0 && d < a && t.push({
-      instanceLocation: e,
-      keyword: "minimum",
-      keywordLocation: `${f}/minimum`,
-      error: `${d} is less than ${a}.`
-    }), P !== void 0 && d > P && t.push({
-      instanceLocation: e,
-      keyword: "maximum",
-      keywordLocation: `${f}/maximum`,
-      error: `${d} is greater than ${P}.`
-    }), E !== void 0 && d <= E && t.push({
-      instanceLocation: e,
-      keyword: "exclusiveMinimum",
-      keywordLocation: `${f}/exclusiveMinimum`,
-      error: `${d} is less than ${E}.`
-    }), q !== void 0 && d >= q && t.push({
-      instanceLocation: e,
-      keyword: "exclusiveMaximum",
-      keywordLocation: `${f}/exclusiveMaximum`,
-      error: `${d} is greater than or equal to ${q}.`
-    })), J !== void 0) {
-      const n = d % J;
-      Math.abs(0 - n) >= 11920929e-14 && Math.abs(J - n) >= 11920929e-14 && t.push({
-        instanceLocation: e,
-        keyword: "multipleOf",
-        keywordLocation: `${f}/multipleOf`,
-        error: `${d} is not a multiple of ${J}.`
-      });
-    }
-  } else if (h === "string") {
-    const n = T === void 0 && F === void 0 ? 0 : be(d);
-    T !== void 0 && n < T && t.push({
-      instanceLocation: e,
-      keyword: "minLength",
-      keywordLocation: `${f}/minLength`,
-      error: `String is too short (${n} < ${T}).`
-    }), F !== void 0 && n > F && t.push({
-      instanceLocation: e,
-      keyword: "maxLength",
-      keywordLocation: `${f}/maxLength`,
-      error: `String is too long (${n} > ${F}).`
-    }), me !== void 0 && !new RegExp(me, "u").test(d) && t.push({
-      instanceLocation: e,
-      keyword: "pattern",
-      keywordLocation: `${f}/pattern`,
-      error: "String does not match pattern."
-    }), M !== void 0 && pe[M] && !pe[M](d) && t.push({
-      instanceLocation: e,
-      keyword: "format",
-      keywordLocation: `${f}/format`,
-      error: `String does not match format "${M}".`
-    });
-  }
-  return { valid: t.length === 0, errors: t };
-}
-export {
-  k as validate
-};
-//# sourceMappingURL=validate.es.js.map

package/dist/node_modules/.pnpm/@cfworker_json-schema@4.1.1/node_modules/@cfworker/json-schema/dist/esm/validate.es.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"validate.es.js","sources":["../../../../../../../../../node_modules/.pnpm/@cfworker+json-schema@4.1.1/node_modules/@cfworker/json-schema/dist/esm/validate.js"],"sourcesContent":["import { deepCompareStrict } from './deep-compare-strict.js';\nimport { dereference } from './dereference.js';\nimport { format } from './format.js';\nimport { encodePointer } from './pointer.js';\nimport { ucs2length } from './ucs2-length.js';\nexport function validate(instance, schema, draft = '2019-09', lookup = dereference(schema), shortCircuit = true, recursiveAnchor = null, instanceLocation = '#', schemaLocation = '#', evaluated = Object.create(null)) {\n    if (schema === true) {\n        return { valid: true, errors: [] };\n    }\n    if (schema === false) {\n        return {\n            valid: false,\n            errors: [\n                {\n                    instanceLocation,\n                    keyword: 'false',\n                    keywordLocation: instanceLocation,\n                    error: 'False boolean schema.'\n                }\n            ]\n        };\n    }\n    const rawInstanceType = typeof instance;\n    let instanceType;\n    switch (rawInstanceType) {\n        case 'boolean':\n        case 'number':\n        case 'string':\n            instanceType = rawInstanceType;\n            break;\n        case 'object':\n            if (instance === null) {\n                instanceType = 'null';\n            }\n            else if (Array.isArray(instance)) {\n                instanceType = 'array';\n            }\n            else {\n                instanceType = 'object';\n            }\n            break;\n        default:\n            throw new Error(`Instances of \"${rawInstanceType}\" type are not supported.`);\n    }\n    const { $ref, $recursiveRef, $recursiveAnchor, type: $type, const: $const, enum: $enum, required: $required, not: $not, anyOf: $anyOf, allOf: $allOf, oneOf: $oneOf, if: $if, then: $then, else: $else, format: $format, properties: $properties, patternProperties: $patternProperties, additionalProperties: $additionalProperties, unevaluatedProperties: $unevaluatedProperties, minProperties: $minProperties, maxProperties: $maxProperties, propertyNames: $propertyNames, dependentRequired: $dependentRequired, dependentSchemas: $dependentSchemas, dependencies: $dependencies, prefixItems: $prefixItems, items: $items, additionalItems: $additionalItems, unevaluatedItems: $unevaluatedItems, contains: $contains, minContains: $minContains, maxContains: $maxContains, minItems: $minItems, maxItems: $maxItems, uniqueItems: $uniqueItems, minimum: $minimum, maximum: $maximum, exclusiveMinimum: $exclusiveMinimum, exclusiveMaximum: $exclusiveMaximum, multipleOf: $multipleOf, minLength: $minLength, maxLength: $maxLength, pattern: $pattern, __absolute_ref__, __absolute_recursive_ref__ } = schema;\n    const errors = [];\n    if ($recursiveAnchor === true && recursiveAnchor === null) {\n        recursiveAnchor = schema;\n    }\n    if ($recursiveRef === '#') {\n        const refSchema = recursiveAnchor === null\n            ? lookup[__absolute_recursive_ref__]\n            : recursiveAnchor;\n        const keywordLocation = `${schemaLocation}/$recursiveRef`;\n        const result = validate(instance, recursiveAnchor === null ? schema : recursiveAnchor, draft, lookup, shortCircuit, refSchema, instanceLocation, keywordLocation, evaluated);\n        if (!result.valid) {\n            errors.push({\n                instanceLocation,\n                keyword: '$recursiveRef',\n                keywordLocation,\n                error: 'A subschema had errors.'\n            }, ...result.errors);\n        }\n    }\n    if ($ref !== undefined) {\n        const uri = __absolute_ref__ || $ref;\n        const refSchema = lookup[uri];\n        if (refSchema === undefined) {\n            let message = `Unresolved $ref \"${$ref}\".`;\n            if (__absolute_ref__ && __absolute_ref__ !== $ref) {\n                message += `  Absolute URI \"${__absolute_ref__}\".`;\n            }\n            message += `\\nKnown schemas:\\n- ${Object.keys(lookup).join('\\n- ')}`;\n            throw new Error(message);\n        }\n        const keywordLocation = `${schemaLocation}/$ref`;\n        const result = validate(instance, refSchema, draft, lookup, shortCircuit, recursiveAnchor, instanceLocation, keywordLocation, evaluated);\n        if (!result.valid) {\n            errors.push({\n                instanceLocation,\n                keyword: '$ref',\n                keywordLocation,\n                error: 'A subschema had errors.'\n            }, ...result.errors);\n        }\n        if (draft === '4' || draft === '7') {\n            return { valid: errors.length === 0, errors };\n        }\n    }\n    if (Array.isArray($type)) {\n        let length = $type.length;\n        let valid = false;\n        for (let i = 0; i < length; i++) {\n            if (instanceType === $type[i] ||\n                ($type[i] === 'integer' &&\n                    instanceType === 'number' &&\n                    instance % 1 === 0 &&\n                    instance === instance)) {\n                valid = true;\n                break;\n            }\n        }\n        if (!valid) {\n            errors.push({\n                instanceLocation,\n                keyword: 'type',\n                keywordLocation: `${schemaLocation}/type`,\n                error: `Instance type \"${instanceType}\" is invalid. Expected \"${$type.join('\", \"')}\".`\n            });\n        }\n    }\n    else if ($type === 'integer') {\n        if (instanceType !== 'number' || instance % 1 || instance !== instance) {\n            errors.push({\n                instanceLocation,\n                keyword: 'type',\n                keywordLocation: `${schemaLocation}/type`,\n                error: `Instance type \"${instanceType}\" is invalid. Expected \"${$type}\".`\n            });\n        }\n    }\n    else if ($type !== undefined && instanceType !== $type) {\n        errors.push({\n            instanceLocation,\n            keyword: 'type',\n            keywordLocation: `${schemaLocation}/type`,\n            error: `Instance type \"${instanceType}\" is invalid. Expected \"${$type}\".`\n        });\n    }\n    if ($const !== undefined) {\n        if (instanceType === 'object' || instanceType === 'array') {\n            if (!deepCompareStrict(instance, $const)) {\n                errors.push({\n                    instanceLocation,\n                    keyword: 'const',\n                    keywordLocation: `${schemaLocation}/const`,\n                    error: `Instance does not match ${JSON.stringify($const)}.`\n                });\n            }\n        }\n        else if (instance !== $const) {\n            errors.push({\n                instanceLocation,\n                keyword: 'const',\n                keywordLocation: `${schemaLocation}/const`,\n                error: `Instance does not match ${JSON.stringify($const)}.`\n            });\n        }\n    }\n    if ($enum !== undefined) {\n        if (instanceType === 'object' || instanceType === 'array') {\n            if (!$enum.some(value => deepCompareStrict(instance, value))) {\n                errors.push({\n                    instanceLocation,\n                    keyword: 'enum',\n                    keywordLocation: `${schemaLocation}/enum`,\n                    error: `Instance does not match any of ${JSON.stringify($enum)}.`\n                });\n            }\n        }\n        else if (!$enum.some(value => instance === value)) {\n            errors.push({\n                instanceLocation,\n                keyword: 'enum',\n                keywordLocation: `${schemaLocation}/enum`,\n                error: `Instance does not match any of ${JSON.stringify($enum)}.`\n            });\n        }\n    }\n    if ($not !== undefined) {\n        const keywordLocation = `${schemaLocation}/not`;\n        const result = validate(instance, $not, draft, lookup, shortCircuit, recursiveAnchor, instanceLocation, keywordLocation);\n        if (result.valid) {\n            errors.push({\n                instanceLocation,\n                keyword: 'not',\n                keywordLocation,\n                error: 'Instance matched \"not\" schema.'\n            });\n        }\n    }\n    let subEvaluateds = [];\n    if ($anyOf !== undefined) {\n        const keywordLocation = `${schemaLocation}/anyOf`;\n        const errorsLength = errors.length;\n        let anyValid = false;\n        for (let i = 0; i < $anyOf.length; i++) {\n            const subSchema = $anyOf[i];\n            const subEvaluated = Object.create(evaluated);\n            const result = validate(instance, subSchema, draft, lookup, shortCircuit, $recursiveAnchor === true ? recursiveAnchor : null, instanceLocation, `${keywordLocation}/${i}`, subEvaluated);\n            errors.push(...result.errors);\n            anyValid = anyValid || result.valid;\n            if (result.valid) {\n                subEvaluateds.push(subEvaluated);\n            }\n        }\n        if (anyValid) {\n            errors.length = errorsLength;\n        }\n        else {\n            errors.splice(errorsLength, 0, {\n                instanceLocation,\n                keyword: 'anyOf',\n                keywordLocation,\n                error: 'Instance does not match any subschemas.'\n            });\n        }\n    }\n    if ($allOf !== undefined) {\n        const keywordLocation = `${schemaLocation}/allOf`;\n        const errorsLength = errors.length;\n        let allValid = true;\n        for (let i = 0; i < $allOf.length; i++) {\n            const subSchema = $allOf[i];\n            const subEvaluated = Object.create(evaluated);\n            const result = validate(instance, subSchema, draft, lookup, shortCircuit, $recursiveAnchor === true ? recursiveAnchor : null, instanceLocation, `${keywordLocation}/${i}`, subEvaluated);\n            errors.push(...result.errors);\n            allValid = allValid && result.valid;\n            if (result.valid) {\n                subEvaluateds.push(subEvaluated);\n            }\n        }\n        if (allValid) {\n            errors.length = errorsLength;\n        }\n        else {\n            errors.splice(errorsLength, 0, {\n                instanceLocation,\n                keyword: 'allOf',\n                keywordLocation,\n                error: `Instance does not match every subschema.`\n            });\n        }\n    }\n    if ($oneOf !== undefined) {\n        const keywordLocation = `${schemaLocation}/oneOf`;\n        const errorsLength = errors.length;\n        const matches = $oneOf.filter((subSchema, i) => {\n            const subEvaluated = Object.create(evaluated);\n            const result = validate(instance, subSchema, draft, lookup, shortCircuit, $recursiveAnchor === true ? recursiveAnchor : null, instanceLocation, `${keywordLocation}/${i}`, subEvaluated);\n            errors.push(...result.errors);\n            if (result.valid) {\n                subEvaluateds.push(subEvaluated);\n            }\n            return result.valid;\n        }).length;\n        if (matches === 1) {\n            errors.length = errorsLength;\n        }\n        else {\n            errors.splice(errorsLength, 0, {\n                instanceLocation,\n                keyword: 'oneOf',\n                keywordLocation,\n                error: `Instance does not match exactly one subschema (${matches} matches).`\n            });\n        }\n    }\n    if (instanceType === 'object' || instanceType === 'array') {\n        Object.assign(evaluated, ...subEvaluateds);\n    }\n    if ($if !== undefined) {\n        const keywordLocation = `${schemaLocation}/if`;\n        const conditionResult = validate(instance, $if, draft, lookup, shortCircuit, recursiveAnchor, instanceLocation, keywordLocation, evaluated).valid;\n        if (conditionResult) {\n            if ($then !== undefined) {\n                const thenResult = validate(instance, $then, draft, lookup, shortCircuit, recursiveAnchor, instanceLocation, `${schemaLocation}/then`, evaluated);\n                if (!thenResult.valid) {\n                    errors.push({\n                        instanceLocation,\n                        keyword: 'if',\n                        keywordLocation,\n                        error: `Instance does not match \"then\" schema.`\n                    }, ...thenResult.errors);\n                }\n            }\n        }\n        else if ($else !== undefined) {\n            const elseResult = validate(instance, $else, draft, lookup, shortCircuit, recursiveAnchor, instanceLocation, `${schemaLocation}/else`, evaluated);\n            if (!elseResult.valid) {\n                errors.push({\n                    instanceLocation,\n                    keyword: 'if',\n                    keywordLocation,\n                    error: `Instance does not match \"else\" schema.`\n                }, ...elseResult.errors);\n            }\n        }\n    }\n    if (instanceType === 'object') {\n        if ($required !== undefined) {\n            for (const key of $required) {\n                if (!(key in instance)) {\n                    errors.push({\n                        instanceLocation,\n                        keyword: 'required',\n                        keywordLocation: `${schemaLocation}/required`,\n                        error: `Instance does not have required property \"${key}\".`\n                    });\n                }\n            }\n        }\n        const keys = Object.keys(instance);\n        if ($minProperties !== undefined && keys.length < $minProperties) {\n            errors.push({\n                instanceLocation,\n                keyword: 'minProperties',\n                keywordLocation: `${schemaLocation}/minProperties`,\n                error: `Instance does not have at least ${$minProperties} properties.`\n            });\n        }\n        if ($maxProperties !== undefined && keys.length > $maxProperties) {\n            errors.push({\n                instanceLocation,\n                keyword: 'maxProperties',\n                keywordLocation: `${schemaLocation}/maxProperties`,\n                error: `Instance does not have at least ${$maxProperties} properties.`\n            });\n        }\n        if ($propertyNames !== undefined) {\n            const keywordLocation = `${schemaLocation}/propertyNames`;\n            for (const key in instance) {\n                const subInstancePointer = `${instanceLocation}/${encodePointer(key)}`;\n                const result = validate(key, $propertyNames, draft, lookup, shortCircuit, recursiveAnchor, subInstancePointer, keywordLocation);\n                if (!result.valid) {\n                    errors.push({\n                        instanceLocation,\n                        keyword: 'propertyNames',\n                        keywordLocation,\n                        error: `Property name \"${key}\" does not match schema.`\n                    }, ...result.errors);\n                }\n            }\n        }\n        if ($dependentRequired !== undefined) {\n            const keywordLocation = `${schemaLocation}/dependantRequired`;\n            for (const key in $dependentRequired) {\n                if (key in instance) {\n                    const required = $dependentRequired[key];\n                    for (const dependantKey of required) {\n                        if (!(dependantKey in instance)) {\n                            errors.push({\n                                instanceLocation,\n                                keyword: 'dependentRequired',\n                                keywordLocation,\n                                error: `Instance has \"${key}\" but does not have \"${dependantKey}\".`\n                            });\n                        }\n                    }\n                }\n            }\n        }\n        if ($dependentSchemas !== undefined) {\n            for (const key in $dependentSchemas) {\n                const keywordLocation = `${schemaLocation}/dependentSchemas`;\n                if (key in instance) {\n                    const result = validate(instance, $dependentSchemas[key], draft, lookup, shortCircuit, recursiveAnchor, instanceLocation, `${keywordLocation}/${encodePointer(key)}`, evaluated);\n                    if (!result.valid) {\n                        errors.push({\n                            instanceLocation,\n                            keyword: 'dependentSchemas',\n                            keywordLocation,\n                            error: `Instance has \"${key}\" but does not match dependant schema.`\n                        }, ...result.errors);\n                    }\n                }\n            }\n        }\n        if ($dependencies !== undefined) {\n            const keywordLocation = `${schemaLocation}/dependencies`;\n            for (const key in $dependencies) {\n                if (key in instance) {\n                    const propsOrSchema = $dependencies[key];\n                    if (Array.isArray(propsOrSchema)) {\n                        for (const dependantKey of propsOrSchema) {\n                            if (!(dependantKey in instance)) {\n                                errors.push({\n                                    instanceLocation,\n                                    keyword: 'dependencies',\n                                    keywordLocation,\n                                    error: `Instance has \"${key}\" but does not have \"${dependantKey}\".`\n                                });\n                            }\n                        }\n                    }\n                    else {\n                        const result = validate(instance, propsOrSchema, draft, lookup, shortCircuit, recursiveAnchor, instanceLocation, `${keywordLocation}/${encodePointer(key)}`);\n                        if (!result.valid) {\n                            errors.push({\n                                instanceLocation,\n                                keyword: 'dependencies',\n                                keywordLocation,\n                                error: `Instance has \"${key}\" but does not match dependant schema.`\n                            }, ...result.errors);\n                        }\n                    }\n                }\n            }\n        }\n        const thisEvaluated = Object.create(null);\n        let stop = false;\n        if ($properties !== undefined) {\n            const keywordLocation = `${schemaLocation}/properties`;\n            for (const key in $properties) {\n                if (!(key in instance)) {\n                    continue;\n                }\n                const subInstancePointer = `${instanceLocation}/${encodePointer(key)}`;\n                const result = validate(instance[key], $properties[key], draft, lookup, shortCircuit, recursiveAnchor, subInstancePointer, `${keywordLocation}/${encodePointer(key)}`);\n                if (result.valid) {\n                    evaluated[key] = thisEvaluated[key] = true;\n                }\n                else {\n                    stop = shortCircuit;\n                    errors.push({\n                        instanceLocation,\n                        keyword: 'properties',\n                        keywordLocation,\n                        error: `Property \"${key}\" does not match schema.`\n                    }, ...result.errors);\n                    if (stop)\n                        break;\n                }\n            }\n        }\n        if (!stop && $patternProperties !== undefined) {\n            const keywordLocation = `${schemaLocation}/patternProperties`;\n            for (const pattern in $patternProperties) {\n                const regex = new RegExp(pattern, 'u');\n                const subSchema = $patternProperties[pattern];\n                for (const key in instance) {\n                    if (!regex.test(key)) {\n                        continue;\n                    }\n                    const subInstancePointer = `${instanceLocation}/${encodePointer(key)}`;\n                    const result = validate(instance[key], subSchema, draft, lookup, shortCircuit, recursiveAnchor, subInstancePointer, `${keywordLocation}/${encodePointer(pattern)}`);\n                    if (result.valid) {\n                        evaluated[key] = thisEvaluated[key] = true;\n                    }\n                    else {\n                        stop = shortCircuit;\n                        errors.push({\n                            instanceLocation,\n                            keyword: 'patternProperties',\n                            keywordLocation,\n                            error: `Property \"${key}\" matches pattern \"${pattern}\" but does not match associated schema.`\n                        }, ...result.errors);\n                    }\n                }\n            }\n        }\n        if (!stop && $additionalProperties !== undefined) {\n            const keywordLocation = `${schemaLocation}/additionalProperties`;\n            for (const key in instance) {\n                if (thisEvaluated[key]) {\n                    continue;\n                }\n                const subInstancePointer = `${instanceLocation}/${encodePointer(key)}`;\n                const result = validate(instance[key], $additionalProperties, draft, lookup, shortCircuit, recursiveAnchor, subInstancePointer, keywordLocation);\n                if (result.valid) {\n                    evaluated[key] = true;\n                }\n                else {\n                    stop = shortCircuit;\n                    errors.push({\n                        instanceLocation,\n                        keyword: 'additionalProperties',\n                        keywordLocation,\n                        error: `Property \"${key}\" does not match additional properties schema.`\n                    }, ...result.errors);\n                }\n            }\n        }\n        else if (!stop && $unevaluatedProperties !== undefined) {\n            const keywordLocation = `${schemaLocation}/unevaluatedProperties`;\n            for (const key in instance) {\n                if (!evaluated[key]) {\n                    const subInstancePointer = `${instanceLocation}/${encodePointer(key)}`;\n                    const result = validate(instance[key], $unevaluatedProperties, draft, lookup, shortCircuit, recursiveAnchor, subInstancePointer, keywordLocation);\n                    if (result.valid) {\n                        evaluated[key] = true;\n                    }\n                    else {\n                        errors.push({\n                            instanceLocation,\n                            keyword: 'unevaluatedProperties',\n                            keywordLocation,\n                            error: `Property \"${key}\" does not match unevaluated properties schema.`\n                        }, ...result.errors);\n                    }\n                }\n            }\n        }\n    }\n    else if (instanceType === 'array') {\n        if ($maxItems !== undefined && instance.length > $maxItems) {\n            errors.push({\n                instanceLocation,\n                keyword: 'maxItems',\n                keywordLocation: `${schemaLocation}/maxItems`,\n                error: `Array has too many items (${instance.length} > ${$maxItems}).`\n            });\n        }\n        if ($minItems !== undefined && instance.length < $minItems) {\n            errors.push({\n                instanceLocation,\n                keyword: 'minItems',\n                keywordLocation: `${schemaLocation}/minItems`,\n                error: `Array has too few items (${instance.length} < ${$minItems}).`\n            });\n        }\n        const length = instance.length;\n        let i = 0;\n        let stop = false;\n        if ($prefixItems !== undefined) {\n            const keywordLocation = `${schemaLocation}/prefixItems`;\n            const length2 = Math.min($prefixItems.length, length);\n            for (; i < length2; i++) {\n                const result = validate(instance[i], $prefixItems[i], draft, lookup, shortCircuit, recursiveAnchor, `${instanceLocation}/${i}`, `${keywordLocation}/${i}`);\n                evaluated[i] = true;\n                if (!result.valid) {\n                    stop = shortCircuit;\n                    errors.push({\n                        instanceLocation,\n                        keyword: 'prefixItems',\n                        keywordLocation,\n                        error: `Items did not match schema.`\n                    }, ...result.errors);\n                    if (stop)\n                        break;\n                }\n            }\n        }\n        if ($items !== undefined) {\n            const keywordLocation = `${schemaLocation}/items`;\n            if (Array.isArray($items)) {\n                const length2 = Math.min($items.length, length);\n                for (; i < length2; i++) {\n                    const result = validate(instance[i], $items[i], draft, lookup, shortCircuit, recursiveAnchor, `${instanceLocation}/${i}`, `${keywordLocation}/${i}`);\n                    evaluated[i] = true;\n                    if (!result.valid) {\n                        stop = shortCircuit;\n                        errors.push({\n                            instanceLocation,\n                            keyword: 'items',\n                            keywordLocation,\n                            error: `Items did not match schema.`\n                        }, ...result.errors);\n                        if (stop)\n                            break;\n                    }\n                }\n            }\n            else {\n                for (; i < length; i++) {\n                    const result = validate(instance[i], $items, draft, lookup, shortCircuit, recursiveAnchor, `${instanceLocation}/${i}`, keywordLocation);\n                    evaluated[i] = true;\n                    if (!result.valid) {\n                        stop = shortCircuit;\n                        errors.push({\n                            instanceLocation,\n                            keyword: 'items',\n                            keywordLocation,\n                            error: `Items did not match schema.`\n                        }, ...result.errors);\n                        if (stop)\n                            break;\n                    }\n                }\n            }\n            if (!stop && $additionalItems !== undefined) {\n                const keywordLocation = `${schemaLocation}/additionalItems`;\n                for (; i < length; i++) {\n                    const result = validate(instance[i], $additionalItems, draft, lookup, shortCircuit, recursiveAnchor, `${instanceLocation}/${i}`, keywordLocation);\n                    evaluated[i] = true;\n                    if (!result.valid) {\n                        stop = shortCircuit;\n                        errors.push({\n                            instanceLocation,\n                            keyword: 'additionalItems',\n                            keywordLocation,\n                            error: `Items did not match additional items schema.`\n                        }, ...result.errors);\n                    }\n                }\n            }\n        }\n        if ($contains !== undefined) {\n            if (length === 0 && $minContains === undefined) {\n                errors.push({\n                    instanceLocation,\n                    keyword: 'contains',\n                    keywordLocation: `${schemaLocation}/contains`,\n                    error: `Array is empty. It must contain at least one item matching the schema.`\n                });\n            }\n            else if ($minContains !== undefined && length < $minContains) {\n                errors.push({\n                    instanceLocation,\n                    keyword: 'minContains',\n                    keywordLocation: `${schemaLocation}/minContains`,\n                    error: `Array has less items (${length}) than minContains (${$minContains}).`\n                });\n            }\n            else {\n                const keywordLocation = `${schemaLocation}/contains`;\n                const errorsLength = errors.length;\n                let contained = 0;\n                for (let j = 0; j < length; j++) {\n                    const result = validate(instance[j], $contains, draft, lookup, shortCircuit, recursiveAnchor, `${instanceLocation}/${j}`, keywordLocation);\n                    if (result.valid) {\n                        evaluated[j] = true;\n                        contained++;\n                    }\n                    else {\n                        errors.push(...result.errors);\n                    }\n                }\n                if (contained >= ($minContains || 0)) {\n                    errors.length = errorsLength;\n                }\n                if ($minContains === undefined &&\n                    $maxContains === undefined &&\n                    contained === 0) {\n                    errors.splice(errorsLength, 0, {\n                        instanceLocation,\n                        keyword: 'contains',\n                        keywordLocation,\n                        error: `Array does not contain item matching schema.`\n                    });\n                }\n                else if ($minContains !== undefined && contained < $minContains) {\n                    errors.push({\n                        instanceLocation,\n                        keyword: 'minContains',\n                        keywordLocation: `${schemaLocation}/minContains`,\n                        error: `Array must contain at least ${$minContains} items matching schema. Only ${contained} items were found.`\n                    });\n                }\n                else if ($maxContains !== undefined && contained > $maxContains) {\n                    errors.push({\n                        instanceLocation,\n                        keyword: 'maxContains',\n                        keywordLocation: `${schemaLocation}/maxContains`,\n                        error: `Array may contain at most ${$maxContains} items matching schema. ${contained} items were found.`\n                    });\n                }\n            }\n        }\n        if (!stop && $unevaluatedItems !== undefined) {\n            const keywordLocation = `${schemaLocation}/unevaluatedItems`;\n            for (i; i < length; i++) {\n                if (evaluated[i]) {\n                    continue;\n                }\n                const result = validate(instance[i], $unevaluatedItems, draft, lookup, shortCircuit, recursiveAnchor, `${instanceLocation}/${i}`, keywordLocation);\n                evaluated[i] = true;\n                if (!result.valid) {\n                    errors.push({\n                        instanceLocation,\n                        keyword: 'unevaluatedItems',\n                        keywordLocation,\n                        error: `Items did not match unevaluated items schema.`\n                    }, ...result.errors);\n                }\n            }\n        }\n        if ($uniqueItems) {\n            for (let j = 0; j < length; j++) {\n                const a = instance[j];\n                const ao = typeof a === 'object' && a !== null;\n                for (let k = 0; k < length; k++) {\n                    if (j === k) {\n                        continue;\n                    }\n                    const b = instance[k];\n                    const bo = typeof b === 'object' && b !== null;\n                    if (a === b || (ao && bo && deepCompareStrict(a, b))) {\n                        errors.push({\n                            instanceLocation,\n                            keyword: 'uniqueItems',\n                            keywordLocation: `${schemaLocation}/uniqueItems`,\n                            error: `Duplicate items at indexes ${j} and ${k}.`\n                        });\n                        j = Number.MAX_SAFE_INTEGER;\n                        k = Number.MAX_SAFE_INTEGER;\n                    }\n                }\n            }\n        }\n    }\n    else if (instanceType === 'number') {\n        if (draft === '4') {\n            if ($minimum !== undefined &&\n                (($exclusiveMinimum === true && instance <= $minimum) ||\n                    instance < $minimum)) {\n                errors.push({\n                    instanceLocation,\n                    keyword: 'minimum',\n                    keywordLocation: `${schemaLocation}/minimum`,\n                    error: `${instance} is less than ${$exclusiveMinimum ? 'or equal to ' : ''} ${$minimum}.`\n                });\n            }\n            if ($maximum !== undefined &&\n                (($exclusiveMaximum === true && instance >= $maximum) ||\n                    instance > $maximum)) {\n                errors.push({\n                    instanceLocation,\n                    keyword: 'maximum',\n                    keywordLocation: `${schemaLocation}/maximum`,\n                    error: `${instance} is greater than ${$exclusiveMaximum ? 'or equal to ' : ''} ${$maximum}.`\n                });\n            }\n        }\n        else {\n            if ($minimum !== undefined && instance < $minimum) {\n                errors.push({\n                    instanceLocation,\n                    keyword: 'minimum',\n                    keywordLocation: `${schemaLocation}/minimum`,\n                    error: `${instance} is less than ${$minimum}.`\n                });\n            }\n            if ($maximum !== undefined && instance > $maximum) {\n                errors.push({\n                    instanceLocation,\n                    keyword: 'maximum',\n                    keywordLocation: `${schemaLocation}/maximum`,\n                    error: `${instance} is greater than ${$maximum}.`\n                });\n            }\n            if ($exclusiveMinimum !== undefined && instance <= $exclusiveMinimum) {\n                errors.push({\n                    instanceLocation,\n                    keyword: 'exclusiveMinimum',\n                    keywordLocation: `${schemaLocation}/exclusiveMinimum`,\n                    error: `${instance} is less than ${$exclusiveMinimum}.`\n                });\n            }\n            if ($exclusiveMaximum !== undefined && instance >= $exclusiveMaximum) {\n                errors.push({\n                    instanceLocation,\n                    keyword: 'exclusiveMaximum',\n                    keywordLocation: `${schemaLocation}/exclusiveMaximum`,\n                    error: `${instance} is greater than or equal to ${$exclusiveMaximum}.`\n                });\n            }\n        }\n        if ($multipleOf !== undefined) {\n            const remainder = instance % $multipleOf;\n            if (Math.abs(0 - remainder) >= 1.1920929e-7 &&\n                Math.abs($multipleOf - remainder) >= 1.1920929e-7) {\n                errors.push({\n                    instanceLocation,\n                    keyword: 'multipleOf',\n                    keywordLocation: `${schemaLocation}/multipleOf`,\n                    error: `${instance} is not a multiple of ${$multipleOf}.`\n                });\n            }\n        }\n    }\n    else if (instanceType === 'string') {\n        const length = $minLength === undefined && $maxLength === undefined\n            ? 0\n            : ucs2length(instance);\n        if ($minLength !== undefined && length < $minLength) {\n            errors.push({\n                instanceLocation,\n                keyword: 'minLength',\n                keywordLocation: `${schemaLocation}/minLength`,\n                error: `String is too short (${length} < ${$minLength}).`\n            });\n        }\n        if ($maxLength !== undefined && length > $maxLength) {\n            errors.push({\n                instanceLocation,\n                keyword: 'maxLength',\n                keywordLocation: `${schemaLocation}/maxLength`,\n                error: `String is too long (${length} > ${$maxLength}).`\n            });\n        }\n        if ($pattern !== undefined && !new RegExp($pattern, 'u').test(instance)) {\n            errors.push({\n                instanceLocation,\n                keyword: 'pattern',\n                keywordLocation: `${schemaLocation}/pattern`,\n                error: `String does not match pattern.`\n            });\n        }\n        if ($format !== undefined &&\n            format[$format] &&\n            !format[$format](instance)) {\n            errors.push({\n                instanceLocation,\n                keyword: 'format',\n                keywordLocation: `${schemaLocation}/format`,\n                error: `String does not match format \"${$format}\".`\n            });\n        }\n    }\n    return { valid: errors.length === 0, errors };\n}\n"],"names":["validate","instance","schema","draft","lookup","dereference","shortCircuit","recursiveAnchor","instanceLocation","schemaLocation","evaluated","rawInstanceType","instanceType","$ref","$recursiveRef","$recursiveAnchor","$type","$const","$enum","$required","$not","$anyOf","$allOf","$oneOf","$if","$then","$else","$format","$properties","$patternProperties","$additionalProperties","$unevaluatedProperties","$minProperties","$maxProperties","$propertyNames","$dependentRequired","$dependentSchemas","$dependencies","$prefixItems","$items","$additionalItems","$unevaluatedItems","$contains","$minContains","$maxContains","$minItems","$maxItems","$uniqueItems","$minimum","$maximum","$exclusiveMinimum","$exclusiveMaximum","$multipleOf","$minLength","$maxLength","$pattern","__absolute_ref__","__absolute_recursive_ref__","errors","refSchema","keywordLocation","result","message","length","valid","i","deepCompareStrict","value","subEvaluateds","errorsLength","anyValid","subSchema","subEvaluated","allValid","matches","thenResult","elseResult","key","keys","subInstancePointer","encodePointer","required","dependantKey","propsOrSchema","thisEvaluated","stop","pattern","regex","length2","contained","j","a","ao","k","b","remainder","ucs2length","format"],"mappings":";;;;;AAKO,SAASA,EAASC,GAAUC,GAAQC,IAAQ,WAAWC,IAASC,GAAYH,CAAM,GAAGI,IAAe,IAAMC,IAAkB,MAAMC,IAAmB,KAAKC,IAAiB,KAAKC,IAAY,uBAAO,OAAO,IAAI,GAAG;AACpN,MAAIR,MAAW;AACX,WAAO,EAAE,OAAO,IAAM,QAAQ,CAAA,EAAE;AAEpC,MAAIA,MAAW;AACX,WAAO;AAAA,MACH,OAAO;AAAA,MACP,QAAQ;AAAA,QACJ;AAAA,UACI,kBAAAM;AAAA,UACA,SAAS;AAAA,UACT,iBAAiBA;AAAA,UACjB,OAAO;AAAA,QAC3B;AAAA,MACA;AAAA,IACA;AAEI,QAAMG,IAAkB,OAAOV;AAC/B,MAAIW;AACJ,UAAQD,GAAe;AAAA,IACnB,KAAK;AAAA,IACL,KAAK;AAAA,IACL,KAAK;AACD,MAAAC,IAAeD;AACf;AAAA,IACJ,KAAK;AACD,MAAIV,MAAa,OACbW,IAAe,SAEV,MAAM,QAAQX,CAAQ,IAC3BW,IAAe,UAGfA,IAAe;AAEnB;AAAA,IACJ;AACI,YAAM,IAAI,MAAM,iBAAiBD,CAAe,2BAA2B;AAAA,EACvF;AACI,QAAM,EAAE,MAAAE,GAAM,eAAAC,IAAe,kBAAAC,GAAkB,MAAMC,GAAO,OAAOC,GAAQ,MAAMC,GAAO,UAAUC,GAAW,KAAKC,IAAM,OAAOC,GAAQ,OAAOC,GAAQ,OAAOC,IAAQ,IAAIC,IAAK,MAAMC,IAAO,MAAMC,IAAO,QAAQC,GAAS,YAAYC,GAAa,mBAAmBC,GAAoB,sBAAsBC,IAAuB,uBAAuBC,IAAwB,eAAeC,GAAgB,eAAeC,GAAgB,eAAeC,IAAgB,mBAAmBC,GAAoB,kBAAkBC,GAAmB,cAAcC,GAAe,aAAaC,GAAc,OAAOC,GAAQ,iBAAiBC,IAAkB,kBAAkBC,IAAmB,UAAUC,IAAW,aAAaC,GAAc,aAAaC,GAAc,UAAUC,GAAW,UAAUC,GAAW,aAAaC,IAAc,SAASC,GAAU,SAASC,GAAU,kBAAkBC,GAAmB,kBAAkBC,GAAmB,YAAYC,GAAa,WAAWC,GAAY,WAAWC,GAAY,SAASC,IAAU,kBAAAC,GAAkB,4BAAAC,GAA0B,IAAKvD,GACljCwD,IAAS,CAAA;AAIf,MAHI3C,MAAqB,MAAQR,MAAoB,SACjDA,IAAkBL,IAElBY,OAAkB,KAAK;AACvB,UAAM6C,IAAYpD,MAAoB,OAChCH,EAAOqD,EAA0B,IACjClD,GACAqD,IAAkB,GAAGnD,CAAc,kBACnCoD,IAAS7D,EAASC,GAAUM,MAAoB,OAAOL,IAASK,GAAiBJ,GAAOC,GAAQE,GAAcqD,GAAWnD,GAAkBoD,GAAiBlD,CAAS;AAC3K,IAAKmD,EAAO,SACRH,EAAO,KAAK;AAAA,MACR,kBAAAlD;AAAA,MACA,SAAS;AAAA,MACT,iBAAAoD;AAAA,MACA,OAAO;AAAA,IACvB,GAAe,GAAGC,EAAO,MAAM;AAAA,EAE3B;AACA,MAAIhD,MAAS,QAAW;AAEpB,UAAM8C,IAAYvD,EADNoD,KAAoB3C,CACJ;AAC5B,QAAI8C,MAAc,QAAW;AACzB,UAAIG,IAAU,oBAAoBjD,CAAI;AACtC,YAAI2C,KAAoBA,MAAqB3C,MACzCiD,KAAW,mBAAmBN,CAAgB,OAElDM,KAAW;AAAA;AAAA,IAAuB,OAAO,KAAK1D,CAAM,EAAE,KAAK;AAAA,GAAM,CAAC,IAC5D,IAAI,MAAM0D,CAAO;AAAA,IAC3B;AACA,UAAMF,IAAkB,GAAGnD,CAAc,SACnCoD,IAAS7D,EAASC,GAAU0D,GAAWxD,GAAOC,GAAQE,GAAcC,GAAiBC,GAAkBoD,GAAiBlD,CAAS;AASvI,QARKmD,EAAO,SACRH,EAAO,KAAK;AAAA,MACR,kBAAAlD;AAAA,MACA,SAAS;AAAA,MACT,iBAAAoD;AAAA,MACA,OAAO;AAAA,IACvB,GAAe,GAAGC,EAAO,MAAM,GAEnB1D,MAAU,OAAOA,MAAU;AAC3B,aAAO,EAAE,OAAOuD,EAAO,WAAW,GAAG,QAAAA,EAAM;AAAA,EAEnD;AACA,MAAI,MAAM,QAAQ1C,CAAK,GAAG;AACtB,QAAI+C,IAAS/C,EAAM,QACfgD,IAAQ;AACZ,aAASC,IAAI,GAAGA,IAAIF,GAAQE;AACxB,UAAIrD,MAAiBI,EAAMiD,CAAC,KACvBjD,EAAMiD,CAAC,MAAM,aACVrD,MAAiB,YACjBX,IAAW,MAAM,KACjBA,MAAaA,GAAW;AAC5B,QAAA+D,IAAQ;AACR;AAAA,MACJ;AAEJ,IAAKA,KACDN,EAAO,KAAK;AAAA,MACR,kBAAAlD;AAAA,MACA,SAAS;AAAA,MACT,iBAAiB,GAAGC,CAAc;AAAA,MAClC,OAAO,kBAAkBG,CAAY,2BAA2BI,EAAM,KAAK,MAAM,CAAC;AAAA,IAClG,CAAa;AAAA,EAET,MACK,CAAIA,MAAU,aACXJ,MAAiB,YAAYX,IAAW,KAAKA,MAAaA,MAC1DyD,EAAO,KAAK;AAAA,IACR,kBAAAlD;AAAA,IACA,SAAS;AAAA,IACT,iBAAiB,GAAGC,CAAc;AAAA,IAClC,OAAO,kBAAkBG,CAAY,2BAA2BI,CAAK;AAAA,EACrF,CAAa,IAGAA,MAAU,UAAaJ,MAAiBI,KAC7C0C,EAAO,KAAK;AAAA,IACR,kBAAAlD;AAAA,IACA,SAAS;AAAA,IACT,iBAAiB,GAAGC,CAAc;AAAA,IAClC,OAAO,kBAAkBG,CAAY,2BAA2BI,CAAK;AAAA,EACjF,CAAS;AA0CL,MAxCIC,MAAW,WACPL,MAAiB,YAAYA,MAAiB,UACzCsD,EAAkBjE,GAAUgB,CAAM,KACnCyC,EAAO,KAAK;AAAA,IACR,kBAAAlD;AAAA,IACA,SAAS;AAAA,IACT,iBAAiB,GAAGC,CAAc;AAAA,IAClC,OAAO,2BAA2B,KAAK,UAAUQ,CAAM,CAAC;AAAA,EAC5E,CAAiB,IAGAhB,MAAagB,KAClByC,EAAO,KAAK;AAAA,IACR,kBAAAlD;AAAA,IACA,SAAS;AAAA,IACT,iBAAiB,GAAGC,CAAc;AAAA,IAClC,OAAO,2BAA2B,KAAK,UAAUQ,CAAM,CAAC;AAAA,EACxE,CAAa,IAGLC,MAAU,WACNN,MAAiB,YAAYA,MAAiB,UACzCM,EAAM,KAAK,CAAAiD,MAASD,EAAkBjE,GAAUkE,CAAK,CAAC,KACvDT,EAAO,KAAK;AAAA,IACR,kBAAAlD;AAAA,IACA,SAAS;AAAA,IACT,iBAAiB,GAAGC,CAAc;AAAA,IAClC,OAAO,kCAAkC,KAAK,UAAUS,CAAK,CAAC;AAAA,EAClF,CAAiB,IAGCA,EAAM,KAAK,CAAAiD,MAASlE,MAAakE,CAAK,KAC5CT,EAAO,KAAK;AAAA,IACR,kBAAAlD;AAAA,IACA,SAAS;AAAA,IACT,iBAAiB,GAAGC,CAAc;AAAA,IAClC,OAAO,kCAAkC,KAAK,UAAUS,CAAK,CAAC;AAAA,EAC9E,CAAa,IAGLE,OAAS,QAAW;AACpB,UAAMwC,IAAkB,GAAGnD,CAAc;AAEzC,IADeT,EAASC,GAAUmB,IAAMjB,GAAOC,GAAQE,GAAcC,GAAiBC,GAAkBoD,CAAe,EAC5G,SACPF,EAAO,KAAK;AAAA,MACR,kBAAAlD;AAAA,MACA,SAAS;AAAA,MACT,iBAAAoD;AAAA,MACA,OAAO;AAAA,IACvB,CAAa;AAAA,EAET;AACA,MAAIQ,IAAgB,CAAA;AACpB,MAAI/C,MAAW,QAAW;AACtB,UAAMuC,IAAkB,GAAGnD,CAAc,UACnC4D,IAAeX,EAAO;AAC5B,QAAIY,IAAW;AACf,aAASL,IAAI,GAAGA,IAAI5C,EAAO,QAAQ4C,KAAK;AACpC,YAAMM,IAAYlD,EAAO4C,CAAC,GACpBO,IAAe,OAAO,OAAO9D,CAAS,GACtCmD,IAAS7D,EAASC,GAAUsE,GAAWpE,GAAOC,GAAQE,GAAcS,MAAqB,KAAOR,IAAkB,MAAMC,GAAkB,GAAGoD,CAAe,IAAIK,CAAC,IAAIO,CAAY;AACvL,MAAAd,EAAO,KAAK,GAAGG,EAAO,MAAM,GAC5BS,IAAWA,KAAYT,EAAO,OAC1BA,EAAO,SACPO,EAAc,KAAKI,CAAY;AAAA,IAEvC;AACA,IAAIF,IACAZ,EAAO,SAASW,IAGhBX,EAAO,OAAOW,GAAc,GAAG;AAAA,MAC3B,kBAAA7D;AAAA,MACA,SAAS;AAAA,MACT,iBAAAoD;AAAA,MACA,OAAO;AAAA,IACvB,CAAa;AAAA,EAET;AACA,MAAItC,MAAW,QAAW;AACtB,UAAMsC,IAAkB,GAAGnD,CAAc,UACnC4D,IAAeX,EAAO;AAC5B,QAAIe,IAAW;AACf,aAASR,IAAI,GAAGA,IAAI3C,EAAO,QAAQ2C,KAAK;AACpC,YAAMM,IAAYjD,EAAO2C,CAAC,GACpBO,IAAe,OAAO,OAAO9D,CAAS,GACtCmD,IAAS7D,EAASC,GAAUsE,GAAWpE,GAAOC,GAAQE,GAAcS,MAAqB,KAAOR,IAAkB,MAAMC,GAAkB,GAAGoD,CAAe,IAAIK,CAAC,IAAIO,CAAY;AACvL,MAAAd,EAAO,KAAK,GAAGG,EAAO,MAAM,GAC5BY,IAAWA,KAAYZ,EAAO,OAC1BA,EAAO,SACPO,EAAc,KAAKI,CAAY;AAAA,IAEvC;AACA,IAAIC,IACAf,EAAO,SAASW,IAGhBX,EAAO,OAAOW,GAAc,GAAG;AAAA,MAC3B,kBAAA7D;AAAA,MACA,SAAS;AAAA,MACT,iBAAAoD;AAAA,MACA,OAAO;AAAA,IACvB,CAAa;AAAA,EAET;AACA,MAAIrC,OAAW,QAAW;AACtB,UAAMqC,IAAkB,GAAGnD,CAAc,UACnC4D,IAAeX,EAAO,QACtBgB,IAAUnD,GAAO,OAAO,CAACgD,GAAWN,MAAM;AAC5C,YAAMO,IAAe,OAAO,OAAO9D,CAAS,GACtCmD,IAAS7D,EAASC,GAAUsE,GAAWpE,GAAOC,GAAQE,GAAcS,MAAqB,KAAOR,IAAkB,MAAMC,GAAkB,GAAGoD,CAAe,IAAIK,CAAC,IAAIO,CAAY;AACvL,aAAAd,EAAO,KAAK,GAAGG,EAAO,MAAM,GACxBA,EAAO,SACPO,EAAc,KAAKI,CAAY,GAE5BX,EAAO;AAAA,IAClB,CAAC,EAAE;AACH,IAAIa,MAAY,IACZhB,EAAO,SAASW,IAGhBX,EAAO,OAAOW,GAAc,GAAG;AAAA,MAC3B,kBAAA7D;AAAA,MACA,SAAS;AAAA,MACT,iBAAAoD;AAAA,MACA,OAAO,kDAAkDc,CAAO;AAAA,IAChF,CAAa;AAAA,EAET;AAIA,OAHI9D,MAAiB,YAAYA,MAAiB,YAC9C,OAAO,OAAOF,GAAW,GAAG0D,CAAa,GAEzC5C,OAAQ,QAAW;AACnB,UAAMoC,IAAkB,GAAGnD,CAAc;AAEzC,QADwBT,EAASC,GAAUuB,IAAKrB,GAAOC,GAAQE,GAAcC,GAAiBC,GAAkBoD,GAAiBlD,CAAS,EAAE;AAExI,UAAIe,OAAU,QAAW;AACrB,cAAMkD,IAAa3E,EAASC,GAAUwB,IAAOtB,GAAOC,GAAQE,GAAcC,GAAiBC,GAAkB,GAAGC,CAAc,SAASC,CAAS;AAChJ,QAAKiE,EAAW,SACZjB,EAAO,KAAK;AAAA,UACR,kBAAAlD;AAAA,UACA,SAAS;AAAA,UACT,iBAAAoD;AAAA,UACA,OAAO;AAAA,QAC/B,GAAuB,GAAGe,EAAW,MAAM;AAAA,MAE/B;AAAA,eAEKjD,OAAU,QAAW;AAC1B,YAAMkD,IAAa5E,EAASC,GAAUyB,IAAOvB,GAAOC,GAAQE,GAAcC,GAAiBC,GAAkB,GAAGC,CAAc,SAASC,CAAS;AAChJ,MAAKkE,EAAW,SACZlB,EAAO,KAAK;AAAA,QACR,kBAAAlD;AAAA,QACA,SAAS;AAAA,QACT,iBAAAoD;AAAA,QACA,OAAO;AAAA,MAC3B,GAAmB,GAAGgB,EAAW,MAAM;AAAA,IAE/B;AAAA,EACJ;AACA,MAAIhE,MAAiB,UAAU;AAC3B,QAAIO,MAAc;AACd,iBAAW0D,KAAO1D;AACd,QAAM0D,KAAO5E,KACTyD,EAAO,KAAK;AAAA,UACR,kBAAAlD;AAAA,UACA,SAAS;AAAA,UACT,iBAAiB,GAAGC,CAAc;AAAA,UAClC,OAAO,6CAA6CoE,CAAG;AAAA,QAC/E,CAAqB;AAIb,UAAMC,IAAO,OAAO,KAAK7E,CAAQ;AAiBjC,QAhBI+B,MAAmB,UAAa8C,EAAK,SAAS9C,KAC9C0B,EAAO,KAAK;AAAA,MACR,kBAAAlD;AAAA,MACA,SAAS;AAAA,MACT,iBAAiB,GAAGC,CAAc;AAAA,MAClC,OAAO,mCAAmCuB,CAAc;AAAA,IACxE,CAAa,GAEDC,MAAmB,UAAa6C,EAAK,SAAS7C,KAC9CyB,EAAO,KAAK;AAAA,MACR,kBAAAlD;AAAA,MACA,SAAS;AAAA,MACT,iBAAiB,GAAGC,CAAc;AAAA,MAClC,OAAO,mCAAmCwB,CAAc;AAAA,IACxE,CAAa,GAEDC,OAAmB,QAAW;AAC9B,YAAM0B,IAAkB,GAAGnD,CAAc;AACzC,iBAAWoE,KAAO5E,GAAU;AACxB,cAAM8E,IAAqB,GAAGvE,CAAgB,IAAIwE,EAAcH,CAAG,CAAC,IAC9DhB,IAAS7D,EAAS6E,GAAK3C,IAAgB/B,GAAOC,GAAQE,GAAcC,GAAiBwE,GAAoBnB,CAAe;AAC9H,QAAKC,EAAO,SACRH,EAAO,KAAK;AAAA,UACR,kBAAAlD;AAAA,UACA,SAAS;AAAA,UACT,iBAAAoD;AAAA,UACA,OAAO,kBAAkBiB,CAAG;AAAA,QACpD,GAAuB,GAAGhB,EAAO,MAAM;AAAA,MAE3B;AAAA,IACJ;AACA,QAAI1B,MAAuB,QAAW;AAClC,YAAMyB,IAAkB,GAAGnD,CAAc;AACzC,iBAAWoE,KAAO1C;AACd,YAAI0C,KAAO5E,GAAU;AACjB,gBAAMgF,IAAW9C,EAAmB0C,CAAG;AACvC,qBAAWK,KAAgBD;AACvB,YAAMC,KAAgBjF,KAClByD,EAAO,KAAK;AAAA,cACR,kBAAAlD;AAAA,cACA,SAAS;AAAA,cACT,iBAAAoD;AAAA,cACA,OAAO,iBAAiBiB,CAAG,wBAAwBK,CAAY;AAAA,YAC/F,CAA6B;AAAA,QAGb;AAAA,IAER;AACA,QAAI9C,MAAsB;AACtB,iBAAWyC,KAAOzC,GAAmB;AACjC,cAAMwB,IAAkB,GAAGnD,CAAc;AACzC,YAAIoE,KAAO5E,GAAU;AACjB,gBAAM4D,IAAS7D,EAASC,GAAUmC,EAAkByC,CAAG,GAAG1E,GAAOC,GAAQE,GAAcC,GAAiBC,GAAkB,GAAGoD,CAAe,IAAIoB,EAAcH,CAAG,CAAC,IAAInE,CAAS;AAC/K,UAAKmD,EAAO,SACRH,EAAO,KAAK;AAAA,YACR,kBAAAlD;AAAA,YACA,SAAS;AAAA,YACT,iBAAAoD;AAAA,YACA,OAAO,iBAAiBiB,CAAG;AAAA,UACvD,GAA2B,GAAGhB,EAAO,MAAM;AAAA,QAE3B;AAAA,MACJ;AAEJ,QAAIxB,MAAkB,QAAW;AAC7B,YAAMuB,IAAkB,GAAGnD,CAAc;AACzC,iBAAWoE,KAAOxC;AACd,YAAIwC,KAAO5E,GAAU;AACjB,gBAAMkF,IAAgB9C,EAAcwC,CAAG;AACvC,cAAI,MAAM,QAAQM,CAAa;AAC3B,uBAAWD,KAAgBC;AACvB,cAAMD,KAAgBjF,KAClByD,EAAO,KAAK;AAAA,gBACR,kBAAAlD;AAAA,gBACA,SAAS;AAAA,gBACT,iBAAAoD;AAAA,gBACA,OAAO,iBAAiBiB,CAAG,wBAAwBK,CAAY;AAAA,cACnG,CAAiC;AAAA,eAIR;AACD,kBAAMrB,IAAS7D,EAASC,GAAUkF,GAAehF,GAAOC,GAAQE,GAAcC,GAAiBC,GAAkB,GAAGoD,CAAe,IAAIoB,EAAcH,CAAG,CAAC,EAAE;AAC3J,YAAKhB,EAAO,SACRH,EAAO,KAAK;AAAA,cACR,kBAAAlD;AAAA,cACA,SAAS;AAAA,cACT,iBAAAoD;AAAA,cACA,OAAO,iBAAiBiB,CAAG;AAAA,YAC3D,GAA+B,GAAGhB,EAAO,MAAM;AAAA,UAE3B;AAAA,QACJ;AAAA,IAER;AACA,UAAMuB,IAAgB,uBAAO,OAAO,IAAI;AACxC,QAAIC,IAAO;AACX,QAAIzD,MAAgB,QAAW;AAC3B,YAAMgC,IAAkB,GAAGnD,CAAc;AACzC,iBAAWoE,KAAOjD,GAAa;AAC3B,YAAI,EAAEiD,KAAO5E;AACT;AAEJ,cAAM8E,IAAqB,GAAGvE,CAAgB,IAAIwE,EAAcH,CAAG,CAAC,IAC9DhB,IAAS7D,EAASC,EAAS4E,CAAG,GAAGjD,EAAYiD,CAAG,GAAG1E,GAAOC,GAAQE,GAAcC,GAAiBwE,GAAoB,GAAGnB,CAAe,IAAIoB,EAAcH,CAAG,CAAC,EAAE;AACrK,YAAIhB,EAAO;AACP,UAAAnD,EAAUmE,CAAG,IAAIO,EAAcP,CAAG,IAAI;AAAA,iBAGtCQ,IAAO/E,GACPoD,EAAO,KAAK;AAAA,UACR,kBAAAlD;AAAA,UACA,SAAS;AAAA,UACT,iBAAAoD;AAAA,UACA,OAAO,aAAaiB,CAAG;AAAA,QAC/C,GAAuB,GAAGhB,EAAO,MAAM,GACfwB;AACA;AAAA,MAEZ;AAAA,IACJ;AACA,QAAI,CAACA,KAAQxD,MAAuB,QAAW;AAC3C,YAAM+B,IAAkB,GAAGnD,CAAc;AACzC,iBAAW6E,KAAWzD,GAAoB;AACtC,cAAM0D,IAAQ,IAAI,OAAOD,GAAS,GAAG,GAC/Bf,IAAY1C,EAAmByD,CAAO;AAC5C,mBAAWT,KAAO5E,GAAU;AACxB,cAAI,CAACsF,EAAM,KAAKV,CAAG;AACf;AAEJ,gBAAME,KAAqB,GAAGvE,CAAgB,IAAIwE,EAAcH,CAAG,CAAC,IAC9DhB,KAAS7D,EAASC,EAAS4E,CAAG,GAAGN,GAAWpE,GAAOC,GAAQE,GAAcC,GAAiBwE,IAAoB,GAAGnB,CAAe,IAAIoB,EAAcM,CAAO,CAAC,EAAE;AAClK,UAAIzB,GAAO,QACPnD,EAAUmE,CAAG,IAAIO,EAAcP,CAAG,IAAI,MAGtCQ,IAAO/E,GACPoD,EAAO,KAAK;AAAA,YACR,kBAAAlD;AAAA,YACA,SAAS;AAAA,YACT,iBAAAoD;AAAA,YACA,OAAO,aAAaiB,CAAG,sBAAsBS,CAAO;AAAA,UAChF,GAA2B,GAAGzB,GAAO,MAAM;AAAA,QAE3B;AAAA,MACJ;AAAA,IACJ;AACA,QAAI,CAACwB,KAAQvD,OAA0B,QAAW;AAC9C,YAAM8B,IAAkB,GAAGnD,CAAc;AACzC,iBAAWoE,KAAO5E,GAAU;AACxB,YAAImF,EAAcP,CAAG;AACjB;AAEJ,cAAME,IAAqB,GAAGvE,CAAgB,IAAIwE,EAAcH,CAAG,CAAC,IAC9DhB,IAAS7D,EAASC,EAAS4E,CAAG,GAAG/C,IAAuB3B,GAAOC,GAAQE,GAAcC,GAAiBwE,GAAoBnB,CAAe;AAC/I,QAAIC,EAAO,QACPnD,EAAUmE,CAAG,IAAI,MAGjBQ,IAAO/E,GACPoD,EAAO,KAAK;AAAA,UACR,kBAAAlD;AAAA,UACA,SAAS;AAAA,UACT,iBAAAoD;AAAA,UACA,OAAO,aAAaiB,CAAG;AAAA,QAC/C,GAAuB,GAAGhB,EAAO,MAAM;AAAA,MAE3B;AAAA,IACJ,WACS,CAACwB,KAAQtD,OAA2B,QAAW;AACpD,YAAM6B,IAAkB,GAAGnD,CAAc;AACzC,iBAAWoE,KAAO5E;AACd,YAAI,CAACS,EAAUmE,CAAG,GAAG;AACjB,gBAAME,IAAqB,GAAGvE,CAAgB,IAAIwE,EAAcH,CAAG,CAAC,IAC9DhB,IAAS7D,EAASC,EAAS4E,CAAG,GAAG9C,IAAwB5B,GAAOC,GAAQE,GAAcC,GAAiBwE,GAAoBnB,CAAe;AAChJ,UAAIC,EAAO,QACPnD,EAAUmE,CAAG,IAAI,KAGjBnB,EAAO,KAAK;AAAA,YACR,kBAAAlD;AAAA,YACA,SAAS;AAAA,YACT,iBAAAoD;AAAA,YACA,OAAO,aAAaiB,CAAG;AAAA,UACnD,GAA2B,GAAGhB,EAAO,MAAM;AAAA,QAE3B;AAAA,IAER;AAAA,EACJ,WACSjD,MAAiB,SAAS;AAC/B,IAAIkC,MAAc,UAAa7C,EAAS,SAAS6C,KAC7CY,EAAO,KAAK;AAAA,MACR,kBAAAlD;AAAA,MACA,SAAS;AAAA,MACT,iBAAiB,GAAGC,CAAc;AAAA,MAClC,OAAO,6BAA6BR,EAAS,MAAM,MAAM6C,CAAS;AAAA,IAClF,CAAa,GAEDD,MAAc,UAAa5C,EAAS,SAAS4C,KAC7Ca,EAAO,KAAK;AAAA,MACR,kBAAAlD;AAAA,MACA,SAAS;AAAA,MACT,iBAAiB,GAAGC,CAAc;AAAA,MAClC,OAAO,4BAA4BR,EAAS,MAAM,MAAM4C,CAAS;AAAA,IACjF,CAAa;AAEL,UAAMkB,IAAS9D,EAAS;AACxB,QAAIgE,IAAI,GACJoB,IAAO;AACX,QAAI/C,MAAiB,QAAW;AAC5B,YAAMsB,IAAkB,GAAGnD,CAAc,gBACnC+E,IAAU,KAAK,IAAIlD,EAAa,QAAQyB,CAAM;AACpD,aAAOE,IAAIuB,GAASvB,KAAK;AACrB,cAAMJ,IAAS7D,EAASC,EAASgE,CAAC,GAAG3B,EAAa2B,CAAC,GAAG9D,GAAOC,GAAQE,GAAcC,GAAiB,GAAGC,CAAgB,IAAIyD,CAAC,IAAI,GAAGL,CAAe,IAAIK,CAAC,EAAE;AAEzJ,YADAvD,EAAUuD,CAAC,IAAI,IACX,CAACJ,EAAO,UACRwB,IAAO/E,GACPoD,EAAO,KAAK;AAAA,UACR,kBAAAlD;AAAA,UACA,SAAS;AAAA,UACT,iBAAAoD;AAAA,UACA,OAAO;AAAA,QAC/B,GAAuB,GAAGC,EAAO,MAAM,GACfwB;AACA;AAAA,MAEZ;AAAA,IACJ;AACA,QAAI9C,MAAW,QAAW;AACtB,YAAMqB,IAAkB,GAAGnD,CAAc;AACzC,UAAI,MAAM,QAAQ8B,CAAM,GAAG;AACvB,cAAMiD,IAAU,KAAK,IAAIjD,EAAO,QAAQwB,CAAM;AAC9C,eAAOE,IAAIuB,GAASvB,KAAK;AACrB,gBAAMJ,IAAS7D,EAASC,EAASgE,CAAC,GAAG1B,EAAO0B,CAAC,GAAG9D,GAAOC,GAAQE,GAAcC,GAAiB,GAAGC,CAAgB,IAAIyD,CAAC,IAAI,GAAGL,CAAe,IAAIK,CAAC,EAAE;AAEnJ,cADAvD,EAAUuD,CAAC,IAAI,IACX,CAACJ,EAAO,UACRwB,IAAO/E,GACPoD,EAAO,KAAK;AAAA,YACR,kBAAAlD;AAAA,YACA,SAAS;AAAA,YACT,iBAAAoD;AAAA,YACA,OAAO;AAAA,UACnC,GAA2B,GAAGC,EAAO,MAAM,GACfwB;AACA;AAAA,QAEZ;AAAA,MACJ;AAEI,eAAOpB,IAAIF,GAAQE,KAAK;AACpB,gBAAMJ,IAAS7D,EAASC,EAASgE,CAAC,GAAG1B,GAAQpC,GAAOC,GAAQE,GAAcC,GAAiB,GAAGC,CAAgB,IAAIyD,CAAC,IAAIL,CAAe;AAEtI,cADAlD,EAAUuD,CAAC,IAAI,IACX,CAACJ,EAAO,UACRwB,IAAO/E,GACPoD,EAAO,KAAK;AAAA,YACR,kBAAAlD;AAAA,YACA,SAAS;AAAA,YACT,iBAAAoD;AAAA,YACA,OAAO;AAAA,UACnC,GAA2B,GAAGC,EAAO,MAAM,GACfwB;AACA;AAAA,QAEZ;AAEJ,UAAI,CAACA,KAAQ7C,OAAqB,QAAW;AACzC,cAAMoB,IAAkB,GAAGnD,CAAc;AACzC,eAAOwD,IAAIF,GAAQE,KAAK;AACpB,gBAAMJ,IAAS7D,EAASC,EAASgE,CAAC,GAAGzB,IAAkBrC,GAAOC,GAAQE,GAAcC,GAAiB,GAAGC,CAAgB,IAAIyD,CAAC,IAAIL,CAAe;AAChJ,UAAAlD,EAAUuD,CAAC,IAAI,IACVJ,EAAO,UACRwB,IAAO/E,GACPoD,EAAO,KAAK;AAAA,YACR,kBAAAlD;AAAA,YACA,SAAS;AAAA,YACT,iBAAAoD;AAAA,YACA,OAAO;AAAA,UACnC,GAA2B,GAAGC,EAAO,MAAM;AAAA,QAE3B;AAAA,MACJ;AAAA,IACJ;AACA,QAAInB,OAAc;AACd,UAAIqB,MAAW,KAAKpB,MAAiB;AACjC,QAAAe,EAAO,KAAK;AAAA,UACR,kBAAAlD;AAAA,UACA,SAAS;AAAA,UACT,iBAAiB,GAAGC,CAAc;AAAA,UAClC,OAAO;AAAA,QAC3B,CAAiB;AAAA,eAEIkC,MAAiB,UAAaoB,IAASpB;AAC5C,QAAAe,EAAO,KAAK;AAAA,UACR,kBAAAlD;AAAA,UACA,SAAS;AAAA,UACT,iBAAiB,GAAGC,CAAc;AAAA,UAClC,OAAO,yBAAyBsD,CAAM,uBAAuBpB,CAAY;AAAA,QAC7F,CAAiB;AAAA,WAEA;AACD,cAAMiB,IAAkB,GAAGnD,CAAc,aACnC4D,IAAeX,EAAO;AAC5B,YAAI+B,IAAY;AAChB,iBAASC,IAAI,GAAGA,IAAI3B,GAAQ2B,KAAK;AAC7B,gBAAM7B,IAAS7D,EAASC,EAASyF,CAAC,GAAGhD,IAAWvC,GAAOC,GAAQE,GAAcC,GAAiB,GAAGC,CAAgB,IAAIkF,CAAC,IAAI9B,CAAe;AACzI,UAAIC,EAAO,SACPnD,EAAUgF,CAAC,IAAI,IACfD,OAGA/B,EAAO,KAAK,GAAGG,EAAO,MAAM;AAAA,QAEpC;AACA,QAAI4B,MAAc9C,KAAgB,OAC9Be,EAAO,SAASW,IAEhB1B,MAAiB,UACjBC,MAAiB,UACjB6C,MAAc,IACd/B,EAAO,OAAOW,GAAc,GAAG;AAAA,UAC3B,kBAAA7D;AAAA,UACA,SAAS;AAAA,UACT,iBAAAoD;AAAA,UACA,OAAO;AAAA,QAC/B,CAAqB,IAEIjB,MAAiB,UAAa8C,IAAY9C,IAC/Ce,EAAO,KAAK;AAAA,UACR,kBAAAlD;AAAA,UACA,SAAS;AAAA,UACT,iBAAiB,GAAGC,CAAc;AAAA,UAClC,OAAO,+BAA+BkC,CAAY,gCAAgC8C,CAAS;AAAA,QACnH,CAAqB,IAEI7C,MAAiB,UAAa6C,IAAY7C,KAC/Cc,EAAO,KAAK;AAAA,UACR,kBAAAlD;AAAA,UACA,SAAS;AAAA,UACT,iBAAiB,GAAGC,CAAc;AAAA,UAClC,OAAO,6BAA6BmC,CAAY,2BAA2B6C,CAAS;AAAA,QAC5G,CAAqB;AAAA,MAET;AAEJ,QAAI,CAACJ,KAAQ5C,OAAsB,QAAW;AAC1C,YAAMmB,IAAkB,GAAGnD,CAAc;AACzC,WAAKwD,GAAGA,IAAIF,GAAQE,KAAK;AACrB,YAAIvD,EAAUuD,CAAC;AACX;AAEJ,cAAMJ,IAAS7D,EAASC,EAASgE,CAAC,GAAGxB,IAAmBtC,GAAOC,GAAQE,GAAcC,GAAiB,GAAGC,CAAgB,IAAIyD,CAAC,IAAIL,CAAe;AACjJ,QAAAlD,EAAUuD,CAAC,IAAI,IACVJ,EAAO,SACRH,EAAO,KAAK;AAAA,UACR,kBAAAlD;AAAA,UACA,SAAS;AAAA,UACT,iBAAAoD;AAAA,UACA,OAAO;AAAA,QAC/B,GAAuB,GAAGC,EAAO,MAAM;AAAA,MAE3B;AAAA,IACJ;AACA,QAAId;AACA,eAAS2C,IAAI,GAAGA,IAAI3B,GAAQ2B,KAAK;AAC7B,cAAMC,IAAI1F,EAASyF,CAAC,GACdE,IAAK,OAAOD,KAAM,YAAYA,MAAM;AAC1C,iBAASE,IAAI,GAAGA,IAAI9B,GAAQ8B,KAAK;AAC7B,cAAIH,MAAMG;AACN;AAEJ,gBAAMC,IAAI7F,EAAS4F,CAAC;AAEpB,WAAIF,MAAMG,KAAMF,MADL,OAAOE,KAAM,YAAYA,MAAM,SACd5B,EAAkByB,GAAGG,CAAC,OAC9CpC,EAAO,KAAK;AAAA,YACR,kBAAAlD;AAAA,YACA,SAAS;AAAA,YACT,iBAAiB,GAAGC,CAAc;AAAA,YAClC,OAAO,8BAA8BiF,CAAC,QAAQG,CAAC;AAAA,UAC3E,CAAyB,GACDH,IAAI,OAAO,kBACXG,IAAI,OAAO;AAAA,QAEnB;AAAA,MACJ;AAAA,EAER,WACSjF,MAAiB;AAyDtB,QAxDIT,MAAU,OACN6C,MAAa,WACXE,MAAsB,MAAQjD,KAAY+C,KACxC/C,IAAW+C,MACfU,EAAO,KAAK;AAAA,MACR,kBAAAlD;AAAA,MACA,SAAS;AAAA,MACT,iBAAiB,GAAGC,CAAc;AAAA,MAClC,OAAO,GAAGR,CAAQ,iBAAiBiD,IAAoB,iBAAiB,EAAE,IAAIF,CAAQ;AAAA,IAC1G,CAAiB,GAEDC,MAAa,WACXE,MAAsB,MAAQlD,KAAYgD,KACxChD,IAAWgD,MACfS,EAAO,KAAK;AAAA,MACR,kBAAAlD;AAAA,MACA,SAAS;AAAA,MACT,iBAAiB,GAAGC,CAAc;AAAA,MAClC,OAAO,GAAGR,CAAQ,oBAAoBkD,IAAoB,iBAAiB,EAAE,IAAIF,CAAQ;AAAA,IAC7G,CAAiB,MAIDD,MAAa,UAAa/C,IAAW+C,KACrCU,EAAO,KAAK;AAAA,MACR,kBAAAlD;AAAA,MACA,SAAS;AAAA,MACT,iBAAiB,GAAGC,CAAc;AAAA,MAClC,OAAO,GAAGR,CAAQ,iBAAiB+C,CAAQ;AAAA,IAC/D,CAAiB,GAEDC,MAAa,UAAahD,IAAWgD,KACrCS,EAAO,KAAK;AAAA,MACR,kBAAAlD;AAAA,MACA,SAAS;AAAA,MACT,iBAAiB,GAAGC,CAAc;AAAA,MAClC,OAAO,GAAGR,CAAQ,oBAAoBgD,CAAQ;AAAA,IAClE,CAAiB,GAEDC,MAAsB,UAAajD,KAAYiD,KAC/CQ,EAAO,KAAK;AAAA,MACR,kBAAAlD;AAAA,MACA,SAAS;AAAA,MACT,iBAAiB,GAAGC,CAAc;AAAA,MAClC,OAAO,GAAGR,CAAQ,iBAAiBiD,CAAiB;AAAA,IACxE,CAAiB,GAEDC,MAAsB,UAAalD,KAAYkD,KAC/CO,EAAO,KAAK;AAAA,MACR,kBAAAlD;AAAA,MACA,SAAS;AAAA,MACT,iBAAiB,GAAGC,CAAc;AAAA,MAClC,OAAO,GAAGR,CAAQ,gCAAgCkD,CAAiB;AAAA,IACvF,CAAiB,IAGLC,MAAgB,QAAW;AAC3B,YAAM2C,IAAY9F,IAAWmD;AAC7B,MAAI,KAAK,IAAI,IAAI2C,CAAS,KAAK,gBAC3B,KAAK,IAAI3C,IAAc2C,CAAS,KAAK,gBACrCrC,EAAO,KAAK;AAAA,QACR,kBAAAlD;AAAA,QACA,SAAS;AAAA,QACT,iBAAiB,GAAGC,CAAc;AAAA,QAClC,OAAO,GAAGR,CAAQ,yBAAyBmD,CAAW;AAAA,MAC1E,CAAiB;AAAA,IAET;AAAA,aAEKxC,MAAiB,UAAU;AAChC,UAAMmD,IAASV,MAAe,UAAaC,MAAe,SACpD,IACA0C,GAAW/F,CAAQ;AACzB,IAAIoD,MAAe,UAAaU,IAASV,KACrCK,EAAO,KAAK;AAAA,MACR,kBAAAlD;AAAA,MACA,SAAS;AAAA,MACT,iBAAiB,GAAGC,CAAc;AAAA,MAClC,OAAO,wBAAwBsD,CAAM,MAAMV,CAAU;AAAA,IACrE,CAAa,GAEDC,MAAe,UAAaS,IAAST,KACrCI,EAAO,KAAK;AAAA,MACR,kBAAAlD;AAAA,MACA,SAAS;AAAA,MACT,iBAAiB,GAAGC,CAAc;AAAA,MAClC,OAAO,uBAAuBsD,CAAM,MAAMT,CAAU;AAAA,IACpE,CAAa,GAEDC,OAAa,UAAa,CAAC,IAAI,OAAOA,IAAU,GAAG,EAAE,KAAKtD,CAAQ,KAClEyD,EAAO,KAAK;AAAA,MACR,kBAAAlD;AAAA,MACA,SAAS;AAAA,MACT,iBAAiB,GAAGC,CAAc;AAAA,MAClC,OAAO;AAAA,IACvB,CAAa,GAEDkB,MAAY,UACZsE,GAAOtE,CAAO,KACd,CAACsE,GAAOtE,CAAO,EAAE1B,CAAQ,KACzByD,EAAO,KAAK;AAAA,MACR,kBAAAlD;AAAA,MACA,SAAS;AAAA,MACT,iBAAiB,GAAGC,CAAc;AAAA,MAClC,OAAO,iCAAiCkB,CAAO;AAAA,IAC/D,CAAa;AAAA,EAET;AACA,SAAO,EAAE,OAAO+B,EAAO,WAAW,GAAG,QAAAA,EAAM;AAC/C;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@cfworker_json-schema@4.1.1/node_modules/@cfworker/json-schema/dist/esm/validator.cjs.js

@@ -1,2 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const r=require("./dereference.cjs.js"),o=require("./validate.cjs.js");class s{schema;draft;shortCircuit;lookup;constructor(t,e="2019-09",i=!0){this.schema=t,this.draft=e,this.shortCircuit=i,this.lookup=r.dereference(t)}validate(t){return o.validate(t,this.schema,this.draft,this.lookup,this.shortCircuit)}addSchema(t,e){e&&(t={...t,$id:e}),r.dereference(t,this.lookup)}}exports.Validator=s;
-//# sourceMappingURL=validator.cjs.js.map

package/dist/node_modules/.pnpm/@cfworker_json-schema@4.1.1/node_modules/@cfworker/json-schema/dist/esm/validator.cjs.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"validator.cjs.js","sources":["../../../../../../../../../node_modules/.pnpm/@cfworker+json-schema@4.1.1/node_modules/@cfworker/json-schema/dist/esm/validator.js"],"sourcesContent":["import { dereference } from './dereference.js';\nimport { validate } from './validate.js';\nexport class Validator {\n    schema;\n    draft;\n    shortCircuit;\n    lookup;\n    constructor(schema, draft = '2019-09', shortCircuit = true) {\n        this.schema = schema;\n        this.draft = draft;\n        this.shortCircuit = shortCircuit;\n        this.lookup = dereference(schema);\n    }\n    validate(instance) {\n        return validate(instance, this.schema, this.draft, this.lookup, this.shortCircuit);\n    }\n    addSchema(schema, id) {\n        if (id) {\n            schema = { ...schema, $id: id };\n        }\n        dereference(schema, this.lookup);\n    }\n}\n"],"names":["Validator","schema","draft","shortCircuit","dereference","instance","validate","id"],"mappings":"uJAEO,MAAMA,CAAU,CACnB,OACA,MACA,aACA,OACA,YAAYC,EAAQC,EAAQ,UAAWC,EAAe,GAAM,CACxD,KAAK,OAASF,EACd,KAAK,MAAQC,EACb,KAAK,aAAeC,EACpB,KAAK,OAASC,EAAAA,YAAYH,CAAM,CACpC,CACA,SAASI,EAAU,CACf,OAAOC,WAASD,EAAU,KAAK,OAAQ,KAAK,MAAO,KAAK,OAAQ,KAAK,YAAY,CACrF,CACA,UAAUJ,EAAQM,EAAI,CACdA,IACAN,EAAS,CAAE,GAAGA,EAAQ,IAAKM,CAAE,GAEjCH,cAAYH,EAAQ,KAAK,MAAM,CACnC,CACJ","x_google_ignoreList":[0]}