@tempots/beatui 0.40.0 → 0.41.0

package/dist/{index-BTZqW3-b.js → index-CWq36UAJ.js}

@@ -1,7 +1,7 @@
-import { a as Pe, S as de, I as Ye, c as Z, M as Zt, P as Ys, E as Zs, b as qr, N as ps, L as Fe, x as Qs, C as hs, i as ea, A as ta, l as ra } from "./notice-C4n5jXi6.js";
-import { _ as wr, X as na, S as sa, N as aa, a as ms, g as ia, t as le, u as De, s as Qt, z as oa, C as ua, W as ca, I as la, K as fa, r as da, p as pa, o as ha, q as ma, c as Ke, T as ya, y as ga, w as mr, v as va, M as Ze, H as _a, D as ba, A as $a, R as wa, x as Sa, m as Pa, G as Ea, j as ys, O as Oa, L as ja, b as ka } from "./utils-BCbc19N0.js";
-import { attr as F, Value as ne, Fragment as we, WithElement as gs, Empty as vs, html as H, When as Ge, OnDispose as Ee, computedOf as ie, prop as Re, Use as Sr, style as _s, Ensure as bs, aria as Ra, on as xe, MapSignal as Kt, Async as Na } from "@tempots/dom";
-import { T as Ia, a as Pr, I as $s, B as Aa } from "./translations-DEEflRUY.js";
+import { a as Pe, S as de, I as Ye, c as Z, M as Zt, P as Ys, E as Zs, b as qr, N as hs, L as Fe, x as Qs, C as ps, i as ea, A as ta, l as ra } from "./notice-B5Yn_3Ay.js";
+import { ah as wr, ai as na, S as sa, N as aa, a as ms, j as ia, t as le, x as De, w as Qt, H as oa, C as ua, W as ca, O as la, Q as fa, v as da, s as ha, r as pa, u as ma, g as Ke, T as ya, D as ga, z as mr, y as va, M as Ze, K as _a, J as ba, I as $a, R as wa, A as Sa, q as Pa, G as Ea, m as ys, V as Oa, L as ja, f as ka } from "./utils-BOEQMy82.js";
+import { attr as F, Value as ne, Fragment as we, WithElement as gs, Empty as vs, html as J, When as Ge, OnDispose as Ee, computedOf as ie, prop as Re, Use as Sr, style as _s, Ensure as bs, aria as Ra, on as xe, MapSignal as Kt, Async as Na } from "@tempots/dom";
+import { T as Ia, a as Pr, I as $s, B as Aa } from "./translations-D-fMB_IO.js";
 import { f as Ca } from "./colors-WfmhQ5e1.js";
 function Ta(e, t) {
   for (var r = 0; r < t.length; r++) {
@@ -33,9 +33,9 @@ function qa() {
       // date: http://tools.ietf.org/html/rfc3339#section-5.6
       date: t(s, o),
       // date-time: http://tools.ietf.org/html/rfc3339#section-5.6
-      time: t(p(!0), y),
+      time: t(h(!0), y),
       "date-time": t($(!0), S),
-      "iso-time": t(p(), d),
+      "iso-time": t(h(), d),
       "iso-date-time": t($(), w),
       // duration: https://tools.ietf.org/html/rfc3339#appendix-A
       duration: /^P(?!$)((\d+Y)?(\d+M)?(\d+D)?(T(?=\d)(\d+H)?(\d+M)?(\d+S)?)?|(\d+W)?)$/,
@@ -106,7 +106,7 @@ function qa() {
         return A > V ? 1 : A < V ? -1 : 0;
     }
     const u = /^(\d\d):(\d\d):(\d\d(?:\.\d+)?)(z|([+-])(\d\d)(?::?(\d\d))?)?$/i;
-    function p(A) {
+    function h(A) {
       return function(L) {
         const B = u.exec(L);
         if (!B)
@@ -136,7 +136,7 @@ function qa() {
     }
     const v = /t|\s/i;
     function $(A) {
-      const V = p(A);
+      const V = h(A);
       return function(B) {
         const Q = B.split(v);
         return Q.length === 2 && s(Q[0]) && V(Q[1]);
@@ -247,14 +247,14 @@ function Dt() {
       let m = 0;
       for (; m < i.length; )
         c.push(s), u(c, i[m]), c.push(s, S(l[++m]));
-      return p(c), new n(c);
+      return h(c), new n(c);
     }
     e.str = o;
     function u(l, i) {
       i instanceof n ? l.push(...i._items) : i instanceof r ? l.push(i) : l.push(v(i));
     }
     e.addCodeArg = u;
-    function p(l) {
+    function h(l) {
       let i = 1;
       for (; i < l.length - 1; ) {
         if (l[i] === s) {
@@ -320,8 +320,8 @@ function zr() {
       }
     }
     var n;
-    (function(p) {
-      p[p.Started = 0] = "Started", p[p.Completed = 1] = "Completed";
+    (function(h) {
+      h[h.Started = 0] = "Started", h[h.Completed = 1] = "Completed";
     })(n || (e.UsedValueState = n = {})), e.varKinds = {
       const: new t.Name("const"),
       let: new t.Name("let"),
@@ -480,126 +480,126 @@ function G() {
       optimizeNodes() {
         return this;
       }
-      optimizeNames(h, P) {
+      optimizeNames(p, P) {
         return this;
       }
     }
     class o extends s {
-      constructor(h, P, R) {
-        super(), this.varKind = h, this.name = P, this.rhs = R;
+      constructor(p, P, R) {
+        super(), this.varKind = p, this.name = P, this.rhs = R;
       }
-      render({ es5: h, _n: P }) {
-        const R = h ? r.varKinds.var : this.varKind, U = this.rhs === void 0 ? "" : ` = ${this.rhs}`;
+      render({ es5: p, _n: P }) {
+        const R = p ? r.varKinds.var : this.varKind, U = this.rhs === void 0 ? "" : ` = ${this.rhs}`;
         return `${R} ${this.name}${U};` + P;
       }
-      optimizeNames(h, P) {
-        if (h[this.name.str])
-          return this.rhs && (this.rhs = B(this.rhs, h, P)), this;
+      optimizeNames(p, P) {
+        if (p[this.name.str])
+          return this.rhs && (this.rhs = B(this.rhs, p, P)), this;
       }
       get names() {
         return this.rhs instanceof t._CodeOrName ? this.rhs.names : {};
       }
     }
     class u extends s {
-      constructor(h, P, R) {
-        super(), this.lhs = h, this.rhs = P, this.sideEffects = R;
+      constructor(p, P, R) {
+        super(), this.lhs = p, this.rhs = P, this.sideEffects = R;
       }
-      render({ _n: h }) {
-        return `${this.lhs} = ${this.rhs};` + h;
+      render({ _n: p }) {
+        return `${this.lhs} = ${this.rhs};` + p;
       }
-      optimizeNames(h, P) {
-        if (!(this.lhs instanceof t.Name && !h[this.lhs.str] && !this.sideEffects))
-          return this.rhs = B(this.rhs, h, P), this;
+      optimizeNames(p, P) {
+        if (!(this.lhs instanceof t.Name && !p[this.lhs.str] && !this.sideEffects))
+          return this.rhs = B(this.rhs, p, P), this;
       }
       get names() {
-        const h = this.lhs instanceof t.Name ? {} : { ...this.lhs.names };
-        return L(h, this.rhs);
+        const p = this.lhs instanceof t.Name ? {} : { ...this.lhs.names };
+        return L(p, this.rhs);
       }
     }
-    class p extends u {
-      constructor(h, P, R, U) {
-        super(h, R, U), this.op = P;
+    class h extends u {
+      constructor(p, P, R, U) {
+        super(p, R, U), this.op = P;
       }
-      render({ _n: h }) {
-        return `${this.lhs} ${this.op}= ${this.rhs};` + h;
+      render({ _n: p }) {
+        return `${this.lhs} ${this.op}= ${this.rhs};` + p;
       }
     }
     class y extends s {
-      constructor(h) {
-        super(), this.label = h, this.names = {};
+      constructor(p) {
+        super(), this.label = p, this.names = {};
       }
-      render({ _n: h }) {
-        return `${this.label}:` + h;
+      render({ _n: p }) {
+        return `${this.label}:` + p;
       }
     }
     class d extends s {
-      constructor(h) {
-        super(), this.label = h, this.names = {};
+      constructor(p) {
+        super(), this.label = p, this.names = {};
       }
-      render({ _n: h }) {
-        return `break${this.label ? ` ${this.label}` : ""};` + h;
+      render({ _n: p }) {
+        return `break${this.label ? ` ${this.label}` : ""};` + p;
       }
     }
     class v extends s {
-      constructor(h) {
-        super(), this.error = h;
+      constructor(p) {
+        super(), this.error = p;
       }
-      render({ _n: h }) {
-        return `throw ${this.error};` + h;
+      render({ _n: p }) {
+        return `throw ${this.error};` + p;
       }
       get names() {
         return this.error.names;
       }
     }
     class $ extends s {
-      constructor(h) {
-        super(), this.code = h;
+      constructor(p) {
+        super(), this.code = p;
       }
-      render({ _n: h }) {
-        return `${this.code};` + h;
+      render({ _n: p }) {
+        return `${this.code};` + p;
       }
       optimizeNodes() {
         return `${this.code}` ? this : void 0;
       }
-      optimizeNames(h, P) {
-        return this.code = B(this.code, h, P), this;
+      optimizeNames(p, P) {
+        return this.code = B(this.code, p, P), this;
       }
       get names() {
         return this.code instanceof t._CodeOrName ? this.code.names : {};
       }
     }
     class S extends s {
-      constructor(h = []) {
-        super(), this.nodes = h;
+      constructor(p = []) {
+        super(), this.nodes = p;
       }
-      render(h) {
-        return this.nodes.reduce((P, R) => P + R.render(h), "");
+      render(p) {
+        return this.nodes.reduce((P, R) => P + R.render(p), "");
       }
       optimizeNodes() {
-        const { nodes: h } = this;
-        let P = h.length;
+        const { nodes: p } = this;
+        let P = p.length;
         for (; P--; ) {
-          const R = h[P].optimizeNodes();
-          Array.isArray(R) ? h.splice(P, 1, ...R) : R ? h[P] = R : h.splice(P, 1);
+          const R = p[P].optimizeNodes();
+          Array.isArray(R) ? p.splice(P, 1, ...R) : R ? p[P] = R : p.splice(P, 1);
         }
-        return h.length > 0 ? this : void 0;
+        return p.length > 0 ? this : void 0;
       }
-      optimizeNames(h, P) {
+      optimizeNames(p, P) {
         const { nodes: R } = this;
         let U = R.length;
         for (; U--; ) {
           const K = R[U];
-          K.optimizeNames(h, P) || (Q(h, K.names), R.splice(U, 1));
+          K.optimizeNames(p, P) || (Q(p, K.names), R.splice(U, 1));
         }
         return R.length > 0 ? this : void 0;
       }
       get names() {
-        return this.nodes.reduce((h, P) => V(h, P.names), {});
+        return this.nodes.reduce((p, P) => V(p, P.names), {});
       }
     }
     class w extends S {
-      render(h) {
-        return "{" + h._n + super.render(h) + "}" + h._n;
+      render(p) {
+        return "{" + p._n + super.render(p) + "}" + p._n;
       }
     }
     class g extends S {
@@ -608,17 +608,17 @@ function G() {
     }
     f.kind = "else";
     class l extends w {
-      constructor(h, P) {
-        super(P), this.condition = h;
+      constructor(p, P) {
+        super(P), this.condition = p;
       }
-      render(h) {
-        let P = `if(${this.condition})` + super.render(h);
-        return this.else && (P += "else " + this.else.render(h)), P;
+      render(p) {
+        let P = `if(${this.condition})` + super.render(p);
+        return this.else && (P += "else " + this.else.render(p)), P;
       }
       optimizeNodes() {
         super.optimizeNodes();
-        const h = this.condition;
-        if (h === !0)
+        const p = this.condition;
+        if (p === !0)
           return this.nodes;
         let P = this.else;
         if (P) {
@@ -626,18 +626,18 @@ function G() {
           P = this.else = Array.isArray(R) ? new f(R) : R;
         }
         if (P)
-          return h === !1 ? P instanceof l ? P : P.nodes : this.nodes.length ? this : new l(oe(h), P instanceof l ? [P] : P.nodes);
-        if (!(h === !1 || !this.nodes.length))
+          return p === !1 ? P instanceof l ? P : P.nodes : this.nodes.length ? this : new l(oe(p), P instanceof l ? [P] : P.nodes);
+        if (!(p === !1 || !this.nodes.length))
           return this;
       }
-      optimizeNames(h, P) {
+      optimizeNames(p, P) {
         var R;
-        if (this.else = (R = this.else) === null || R === void 0 ? void 0 : R.optimizeNames(h, P), !!(super.optimizeNames(h, P) || this.else))
-          return this.condition = B(this.condition, h, P), this;
+        if (this.else = (R = this.else) === null || R === void 0 ? void 0 : R.optimizeNames(p, P), !!(super.optimizeNames(p, P) || this.else))
+          return this.condition = B(this.condition, p, P), this;
       }
       get names() {
-        const h = super.names;
-        return L(h, this.condition), this.else && V(h, this.else.names), h;
+        const p = super.names;
+        return L(p, this.condition), this.else && V(p, this.else.names), p;
       }
     }
     l.kind = "if";
@@ -645,166 +645,166 @@ function G() {
     }
     i.kind = "for";
     class c extends i {
-      constructor(h) {
-        super(), this.iteration = h;
+      constructor(p) {
+        super(), this.iteration = p;
       }
-      render(h) {
-        return `for(${this.iteration})` + super.render(h);
+      render(p) {
+        return `for(${this.iteration})` + super.render(p);
       }
-      optimizeNames(h, P) {
-        if (super.optimizeNames(h, P))
-          return this.iteration = B(this.iteration, h, P), this;
+      optimizeNames(p, P) {
+        if (super.optimizeNames(p, P))
+          return this.iteration = B(this.iteration, p, P), this;
       }
       get names() {
         return V(super.names, this.iteration.names);
       }
     }
     class m extends i {
-      constructor(h, P, R, U) {
-        super(), this.varKind = h, this.name = P, this.from = R, this.to = U;
+      constructor(p, P, R, U) {
+        super(), this.varKind = p, this.name = P, this.from = R, this.to = U;
       }
-      render(h) {
-        const P = h.es5 ? r.varKinds.var : this.varKind, { name: R, from: U, to: K } = this;
-        return `for(${P} ${R}=${U}; ${R}<${K}; ${R}++)` + super.render(h);
+      render(p) {
+        const P = p.es5 ? r.varKinds.var : this.varKind, { name: R, from: U, to: K } = this;
+        return `for(${P} ${R}=${U}; ${R}<${K}; ${R}++)` + super.render(p);
       }
       get names() {
-        const h = L(super.names, this.from);
-        return L(h, this.to);
+        const p = L(super.names, this.from);
+        return L(p, this.to);
       }
     }
     class _ extends i {
-      constructor(h, P, R, U) {
-        super(), this.loop = h, this.varKind = P, this.name = R, this.iterable = U;
+      constructor(p, P, R, U) {
+        super(), this.loop = p, this.varKind = P, this.name = R, this.iterable = U;
       }
-      render(h) {
-        return `for(${this.varKind} ${this.name} ${this.loop} ${this.iterable})` + super.render(h);
+      render(p) {
+        return `for(${this.varKind} ${this.name} ${this.loop} ${this.iterable})` + super.render(p);
       }
-      optimizeNames(h, P) {
-        if (super.optimizeNames(h, P))
-          return this.iterable = B(this.iterable, h, P), this;
+      optimizeNames(p, P) {
+        if (super.optimizeNames(p, P))
+          return this.iterable = B(this.iterable, p, P), this;
       }
       get names() {
         return V(super.names, this.iterable.names);
       }
     }
     class b extends w {
-      constructor(h, P, R) {
-        super(), this.name = h, this.args = P, this.async = R;
+      constructor(p, P, R) {
+        super(), this.name = p, this.args = P, this.async = R;
       }
-      render(h) {
-        return `${this.async ? "async " : ""}function ${this.name}(${this.args})` + super.render(h);
+      render(p) {
+        return `${this.async ? "async " : ""}function ${this.name}(${this.args})` + super.render(p);
       }
     }
     b.kind = "func";
     class E extends S {
-      render(h) {
-        return "return " + super.render(h);
+      render(p) {
+        return "return " + super.render(p);
       }
     }
     E.kind = "return";
     class I extends w {
-      render(h) {
-        let P = "try" + super.render(h);
-        return this.catch && (P += this.catch.render(h)), this.finally && (P += this.finally.render(h)), P;
+      render(p) {
+        let P = "try" + super.render(p);
+        return this.catch && (P += this.catch.render(p)), this.finally && (P += this.finally.render(p)), P;
       }
       optimizeNodes() {
-        var h, P;
-        return super.optimizeNodes(), (h = this.catch) === null || h === void 0 || h.optimizeNodes(), (P = this.finally) === null || P === void 0 || P.optimizeNodes(), this;
+        var p, P;
+        return super.optimizeNodes(), (p = this.catch) === null || p === void 0 || p.optimizeNodes(), (P = this.finally) === null || P === void 0 || P.optimizeNodes(), this;
       }
-      optimizeNames(h, P) {
+      optimizeNames(p, P) {
         var R, U;
-        return super.optimizeNames(h, P), (R = this.catch) === null || R === void 0 || R.optimizeNames(h, P), (U = this.finally) === null || U === void 0 || U.optimizeNames(h, P), this;
+        return super.optimizeNames(p, P), (R = this.catch) === null || R === void 0 || R.optimizeNames(p, P), (U = this.finally) === null || U === void 0 || U.optimizeNames(p, P), this;
       }
       get names() {
-        const h = super.names;
-        return this.catch && V(h, this.catch.names), this.finally && V(h, this.finally.names), h;
+        const p = super.names;
+        return this.catch && V(p, this.catch.names), this.finally && V(p, this.finally.names), p;
       }
     }
     class q extends w {
-      constructor(h) {
-        super(), this.error = h;
+      constructor(p) {
+        super(), this.error = p;
       }
-      render(h) {
-        return `catch(${this.error})` + super.render(h);
+      render(p) {
+        return `catch(${this.error})` + super.render(p);
       }
     }
     q.kind = "catch";
     class D extends w {
-      render(h) {
-        return "finally" + super.render(h);
+      render(p) {
+        return "finally" + super.render(p);
       }
     }
     D.kind = "finally";
     class A {
-      constructor(h, P = {}) {
+      constructor(p, P = {}) {
         this._values = {}, this._blockStarts = [], this._constants = {}, this.opts = { ...P, _n: P.lines ? `
-` : "" }, this._extScope = h, this._scope = new r.Scope({ parent: h }), this._nodes = [new g()];
+` : "" }, this._extScope = p, this._scope = new r.Scope({ parent: p }), this._nodes = [new g()];
       }
       toString() {
         return this._root.render(this.opts);
       }
       // returns unique name in the internal scope
-      name(h) {
-        return this._scope.name(h);
+      name(p) {
+        return this._scope.name(p);
       }
       // reserves unique name in the external scope
-      scopeName(h) {
-        return this._extScope.name(h);
+      scopeName(p) {
+        return this._extScope.name(p);
       }
       // reserves unique name in the external scope and assigns value to it
-      scopeValue(h, P) {
-        const R = this._extScope.value(h, P);
+      scopeValue(p, P) {
+        const R = this._extScope.value(p, P);
         return (this._values[R.prefix] || (this._values[R.prefix] = /* @__PURE__ */ new Set())).add(R), R;
       }
-      getScopeValue(h, P) {
-        return this._extScope.getValue(h, P);
+      getScopeValue(p, P) {
+        return this._extScope.getValue(p, P);
       }
       // return code that assigns values in the external scope to the names that are used internally
       // (same names that were returned by gen.scopeName or gen.scopeValue)
-      scopeRefs(h) {
-        return this._extScope.scopeRefs(h, this._values);
+      scopeRefs(p) {
+        return this._extScope.scopeRefs(p, this._values);
       }
       scopeCode() {
         return this._extScope.scopeCode(this._values);
       }
-      _def(h, P, R, U) {
+      _def(p, P, R, U) {
         const K = this._scope.toName(P);
-        return R !== void 0 && U && (this._constants[K.str] = R), this._leafNode(new o(h, K, R)), K;
+        return R !== void 0 && U && (this._constants[K.str] = R), this._leafNode(new o(p, K, R)), K;
       }
       // `const` declaration (`var` in es5 mode)
-      const(h, P, R) {
-        return this._def(r.varKinds.const, h, P, R);
+      const(p, P, R) {
+        return this._def(r.varKinds.const, p, P, R);
       }
       // `let` declaration with optional assignment (`var` in es5 mode)
-      let(h, P, R) {
-        return this._def(r.varKinds.let, h, P, R);
+      let(p, P, R) {
+        return this._def(r.varKinds.let, p, P, R);
       }
       // `var` declaration with optional assignment
-      var(h, P, R) {
-        return this._def(r.varKinds.var, h, P, R);
+      var(p, P, R) {
+        return this._def(r.varKinds.var, p, P, R);
       }
       // assignment code
-      assign(h, P, R) {
-        return this._leafNode(new u(h, P, R));
+      assign(p, P, R) {
+        return this._leafNode(new u(p, P, R));
       }
       // `+=` code
-      add(h, P) {
-        return this._leafNode(new p(h, e.operators.ADD, P));
+      add(p, P) {
+        return this._leafNode(new h(p, e.operators.ADD, P));
       }
       // appends passed SafeExpr to code or executes Block
-      code(h) {
-        return typeof h == "function" ? h() : h !== t.nil && this._leafNode(new $(h)), this;
+      code(p) {
+        return typeof p == "function" ? p() : p !== t.nil && this._leafNode(new $(p)), this;
       }
       // returns code for object literal for the passed argument list of key-value pairs
-      object(...h) {
+      object(...p) {
         const P = ["{"];
-        for (const [R, U] of h)
+        for (const [R, U] of p)
           P.length > 1 && P.push(","), P.push(R), (R !== U || this.opts.es5) && (P.push(":"), (0, t.addCodeArg)(P, U));
         return P.push("}"), new t._Code(P);
       }
       // `if` clause (or statement if `thenBody` and, optionally, `elseBody` are passed)
-      if(h, P, R) {
-        if (this._blockNode(new l(h)), P && R)
+      if(p, P, R) {
+        if (this._blockNode(new l(p)), P && R)
           this.code(P).else().code(R).endIf();
         else if (P)
           this.code(P).endIf();
@@ -813,8 +813,8 @@ function G() {
         return this;
       }
       // `else if` clause - invalid without `if` or after `else` clauses
-      elseIf(h) {
-        return this._elseNode(new l(h));
+      elseIf(p) {
+        return this._elseNode(new l(p));
       }
       // `else` clause - only valid after `if` or `else if` clauses
       else() {
@@ -824,21 +824,21 @@ function G() {
       endIf() {
         return this._endBlockNode(l, f);
       }
-      _for(h, P) {
-        return this._blockNode(h), P && this.code(P).endFor(), this;
+      _for(p, P) {
+        return this._blockNode(p), P && this.code(P).endFor(), this;
       }
       // a generic `for` clause (or statement if `forBody` is passed)
-      for(h, P) {
-        return this._for(new c(h), P);
+      for(p, P) {
+        return this._for(new c(p), P);
       }
       // `for` statement for a range of values
-      forRange(h, P, R, U, K = this.opts.es5 ? r.varKinds.var : r.varKinds.let) {
-        const Y = this._scope.toName(h);
+      forRange(p, P, R, U, K = this.opts.es5 ? r.varKinds.var : r.varKinds.let) {
+        const Y = this._scope.toName(p);
         return this._for(new m(K, Y, P, R), () => U(Y));
       }
       // `for-of` statement (in es5 mode replace with a normal for loop)
-      forOf(h, P, R, U = r.varKinds.const) {
-        const K = this._scope.toName(h);
+      forOf(p, P, R, U = r.varKinds.const) {
+        const K = this._scope.toName(p);
         if (this.opts.es5) {
           const Y = P instanceof t.Name ? P : this.var("_arr", P);
           return this.forRange("_i", 0, (0, t._)`${Y}.length`, (X) => {
@@ -849,10 +849,10 @@ function G() {
       }
       // `for-in` statement.
       // With option `ownProperties` replaced with a `for-of` loop for object keys
-      forIn(h, P, R, U = this.opts.es5 ? r.varKinds.var : r.varKinds.const) {
+      forIn(p, P, R, U = this.opts.es5 ? r.varKinds.var : r.varKinds.const) {
         if (this.opts.ownProperties)
-          return this.forOf(h, (0, t._)`Object.keys(${P})`, R);
-        const K = this._scope.toName(h);
+          return this.forOf(p, (0, t._)`Object.keys(${P})`, R);
+        const K = this._scope.toName(p);
         return this._for(new _("in", U, K, P), () => R(K));
       }
       // end `for` loop
@@ -860,101 +860,101 @@ function G() {
         return this._endBlockNode(i);
       }
       // `label` statement
-      label(h) {
-        return this._leafNode(new y(h));
+      label(p) {
+        return this._leafNode(new y(p));
       }
       // `break` statement
-      break(h) {
-        return this._leafNode(new d(h));
+      break(p) {
+        return this._leafNode(new d(p));
       }
       // `return` statement
-      return(h) {
+      return(p) {
         const P = new E();
-        if (this._blockNode(P), this.code(h), P.nodes.length !== 1)
+        if (this._blockNode(P), this.code(p), P.nodes.length !== 1)
           throw new Error('CodeGen: "return" should have one node');
         return this._endBlockNode(E);
       }
       // `try` statement
-      try(h, P, R) {
+      try(p, P, R) {
         if (!P && !R)
           throw new Error('CodeGen: "try" without "catch" and "finally"');
         const U = new I();
-        if (this._blockNode(U), this.code(h), P) {
+        if (this._blockNode(U), this.code(p), P) {
           const K = this.name("e");
           this._currNode = U.catch = new q(K), P(K);
         }
         return R && (this._currNode = U.finally = new D(), this.code(R)), this._endBlockNode(q, D);
       }
       // `throw` statement
-      throw(h) {
-        return this._leafNode(new v(h));
+      throw(p) {
+        return this._leafNode(new v(p));
       }
       // start self-balancing block
-      block(h, P) {
-        return this._blockStarts.push(this._nodes.length), h && this.code(h).endBlock(P), this;
+      block(p, P) {
+        return this._blockStarts.push(this._nodes.length), p && this.code(p).endBlock(P), this;
       }
       // end the current self-balancing block
-      endBlock(h) {
+      endBlock(p) {
         const P = this._blockStarts.pop();
         if (P === void 0)
           throw new Error("CodeGen: not in self-balancing block");
         const R = this._nodes.length - P;
-        if (R < 0 || h !== void 0 && R !== h)
-          throw new Error(`CodeGen: wrong number of nodes: ${R} vs ${h} expected`);
+        if (R < 0 || p !== void 0 && R !== p)
+          throw new Error(`CodeGen: wrong number of nodes: ${R} vs ${p} expected`);
         return this._nodes.length = P, this;
       }
       // `function` heading (or definition if funcBody is passed)
-      func(h, P = t.nil, R, U) {
-        return this._blockNode(new b(h, P, R)), U && this.code(U).endFunc(), this;
+      func(p, P = t.nil, R, U) {
+        return this._blockNode(new b(p, P, R)), U && this.code(U).endFunc(), this;
       }
       // end function definition
       endFunc() {
         return this._endBlockNode(b);
       }
-      optimize(h = 1) {
-        for (; h-- > 0; )
+      optimize(p = 1) {
+        for (; p-- > 0; )
           this._root.optimizeNodes(), this._root.optimizeNames(this._root.names, this._constants);
       }
-      _leafNode(h) {
-        return this._currNode.nodes.push(h), this;
+      _leafNode(p) {
+        return this._currNode.nodes.push(p), this;
       }
-      _blockNode(h) {
-        this._currNode.nodes.push(h), this._nodes.push(h);
+      _blockNode(p) {
+        this._currNode.nodes.push(p), this._nodes.push(p);
       }
-      _endBlockNode(h, P) {
+      _endBlockNode(p, P) {
         const R = this._currNode;
-        if (R instanceof h || P && R instanceof P)
+        if (R instanceof p || P && R instanceof P)
           return this._nodes.pop(), this;
-        throw new Error(`CodeGen: not in block "${P ? `${h.kind}/${P.kind}` : h.kind}"`);
+        throw new Error(`CodeGen: not in block "${P ? `${p.kind}/${P.kind}` : p.kind}"`);
       }
-      _elseNode(h) {
+      _elseNode(p) {
         const P = this._currNode;
         if (!(P instanceof l))
           throw new Error('CodeGen: "else" without "if"');
-        return this._currNode = P.else = h, this;
+        return this._currNode = P.else = p, this;
       }
       get _root() {
         return this._nodes[0];
       }
       get _currNode() {
-        const h = this._nodes;
-        return h[h.length - 1];
+        const p = this._nodes;
+        return p[p.length - 1];
       }
-      set _currNode(h) {
+      set _currNode(p) {
         const P = this._nodes;
-        P[P.length - 1] = h;
+        P[P.length - 1] = p;
       }
     }
     e.CodeGen = A;
-    function V(N, h) {
-      for (const P in h)
-        N[P] = (N[P] || 0) + (h[P] || 0);
+    function V(N, p) {
+      for (const P in p)
+        N[P] = (N[P] || 0) + (p[P] || 0);
       return N;
     }
-    function L(N, h) {
-      return h instanceof t._CodeOrName ? V(N, h.names) : N;
+    function L(N, p) {
+      return p instanceof t._CodeOrName ? V(N, p.names) : N;
     }
-    function B(N, h, P) {
+    function B(N, p, P) {
       if (N instanceof t.Name)
         return R(N);
       if (!U(N))
@@ -962,15 +962,15 @@ function G() {
       return new t._Code(N._items.reduce((K, Y) => (Y instanceof t.Name && (Y = R(Y)), Y instanceof t._Code ? K.push(...Y._items) : K.push(Y), K), []));
       function R(K) {
         const Y = P[K.str];
-        return Y === void 0 || h[K.str] !== 1 ? K : (delete h[K.str], Y);
+        return Y === void 0 || p[K.str] !== 1 ? K : (delete p[K.str], Y);
       }
       function U(K) {
-        return K instanceof t._Code && K._items.some((Y) => Y instanceof t.Name && h[Y.str] === 1 && P[Y.str] !== void 0);
+        return K instanceof t._Code && K._items.some((Y) => Y instanceof t.Name && p[Y.str] === 1 && P[Y.str] !== void 0);
       }
     }
-    function Q(N, h) {
-      for (const P in h)
-        N[P] = (N[P] || 0) - (h[P] || 0);
+    function Q(N, p) {
+      for (const P in p)
+        N[P] = (N[P] || 0) - (p[P] || 0);
     }
     function oe(N) {
       return typeof N == "boolean" || typeof N == "number" || N === null ? !N : (0, t._)`!${C(N)}`;
@@ -987,17 +987,17 @@ function G() {
     }
     e.or = M;
     function j(N) {
-      return (h, P) => h === t.nil ? P : P === t.nil ? h : (0, t._)`${C(h)} ${N} ${C(P)}`;
+      return (p, P) => p === t.nil ? P : P === t.nil ? p : (0, t._)`${C(p)} ${N} ${C(P)}`;
     }
     function C(N) {
       return N instanceof t.Name ? N : (0, t._)`(${N})`;
     }
   }(sr)), sr;
 }
-var J = {}, Fr;
+var H = {}, Fr;
 function ee() {
-  if (Fr) return J;
-  Fr = 1, Object.defineProperty(J, "__esModule", { value: !0 }), J.checkStrictMode = J.getErrorPath = J.Type = J.useFunc = J.setEvaluated = J.evaluatedPropsToName = J.mergeEvaluated = J.eachItem = J.unescapeJsonPointer = J.escapeJsonPointer = J.escapeFragment = J.unescapeFragment = J.schemaRefOrVal = J.schemaHasRulesButRef = J.schemaHasRules = J.checkUnknownRules = J.alwaysValidSchema = J.toHash = void 0;
+  if (Fr) return H;
+  Fr = 1, Object.defineProperty(H, "__esModule", { value: !0 }), H.checkStrictMode = H.getErrorPath = H.Type = H.useFunc = H.setEvaluated = H.evaluatedPropsToName = H.mergeEvaluated = H.eachItem = H.unescapeJsonPointer = H.escapeJsonPointer = H.escapeFragment = H.unescapeFragment = H.schemaRefOrVal = H.schemaHasRulesButRef = H.schemaHasRules = H.checkUnknownRules = H.alwaysValidSchema = H.toHash = void 0;
   const e = G(), t = Dt();
   function r(_) {
     const b = {};
@@ -1005,11 +1005,11 @@ function ee() {
       b[E] = !0;
     return b;
   }
-  J.toHash = r;
+  H.toHash = r;
   function n(_, b) {
     return typeof b == "boolean" ? b : Object.keys(b).length === 0 ? !0 : (a(_, b), !s(b, _.self.RULES.all));
   }
-  J.alwaysValidSchema = n;
+  H.alwaysValidSchema = n;
   function a(_, b = _.schema) {
     const { opts: E, self: I } = _;
     if (!E.strictSchema || typeof b == "boolean")
@@ -1018,7 +1018,7 @@ function ee() {
     for (const D in b)
       q[D] || m(_, `unknown keyword: "${D}"`);
   }
-  J.checkUnknownRules = a;
+  H.checkUnknownRules = a;
   function s(_, b) {
     if (typeof _ == "boolean")
       return !_;
@@ -1027,7 +1027,7 @@ function ee() {
         return !0;
     return !1;
   }
-  J.schemaHasRules = s;
+  H.schemaHasRules = s;
   function o(_, b) {
     if (typeof _ == "boolean")
       return !_;
@@ -1036,7 +1036,7 @@ function ee() {
         return !0;
     return !1;
   }
-  J.schemaHasRulesButRef = o;
+  H.schemaHasRulesButRef = o;
   function u({ topSchemaRef: _, schemaPath: b }, E, I, q) {
     if (!q) {
       if (typeof E == "number" || typeof E == "boolean")
@@ -1046,23 +1046,23 @@ function ee() {
     }
     return (0, e._)`${_}${b}${(0, e.getProperty)(I)}`;
   }
-  J.schemaRefOrVal = u;
-  function p(_) {
+  H.schemaRefOrVal = u;
+  function h(_) {
     return v(decodeURIComponent(_));
   }
-  J.unescapeFragment = p;
+  H.unescapeFragment = h;
   function y(_) {
     return encodeURIComponent(d(_));
   }
-  J.escapeFragment = y;
+  H.escapeFragment = y;
   function d(_) {
     return typeof _ == "number" ? `${_}` : _.replace(/~/g, "~0").replace(/\//g, "~1");
   }
-  J.escapeJsonPointer = d;
+  H.escapeJsonPointer = d;
   function v(_) {
     return _.replace(/~1/g, "/").replace(/~0/g, "~");
   }
-  J.unescapeJsonPointer = v;
+  H.unescapeJsonPointer = v;
   function $(_, b) {
     if (Array.isArray(_))
       for (const E of _)
@@ -1070,14 +1070,14 @@ function ee() {
     else
       b(_);
   }
-  J.eachItem = $;
+  H.eachItem = $;
   function S({ mergeNames: _, mergeToName: b, mergeValues: E, resultToName: I }) {
     return (q, D, A, V) => {
       const L = A === void 0 ? D : A instanceof e.Name ? (D instanceof e.Name ? _(q, D, A) : b(q, D, A), A) : D instanceof e.Name ? (b(q, A, D), D) : E(D, A);
       return V === e.Name && !(L instanceof e.Name) ? I(q, L) : L;
     };
   }
-  J.mergeEvaluated = {
+  H.mergeEvaluated = {
     props: S({
       mergeNames: (_, b, E) => _.if((0, e._)`${E} !== true && ${b} !== undefined`, () => {
         _.if((0, e._)`${b} === true`, () => _.assign(E, !0), () => _.assign(E, (0, e._)`${E} || {}`).code((0, e._)`Object.assign(${E}, ${b})`));
@@ -1101,11 +1101,11 @@ function ee() {
     const E = _.var("props", (0, e._)`{}`);
     return b !== void 0 && g(_, E, b), E;
   }
-  J.evaluatedPropsToName = w;
+  H.evaluatedPropsToName = w;
   function g(_, b, E) {
     Object.keys(E).forEach((I) => _.assign((0, e._)`${b}${(0, e.getProperty)(I)}`, !0));
   }
-  J.setEvaluated = g;
+  H.setEvaluated = g;
   const f = {};
   function l(_, b) {
     return _.scopeValue("func", {
@@ -1113,11 +1113,11 @@ function ee() {
       code: f[b.code] || (f[b.code] = new t._Code(b.code))
     });
   }
-  J.useFunc = l;
+  H.useFunc = l;
   var i;
   (function(_) {
     _[_.Num = 0] = "Num", _[_.Str = 1] = "Str";
-  })(i || (J.Type = i = {}));
+  })(i || (H.Type = i = {}));
   function c(_, b, E) {
     if (_ instanceof e.Name) {
       const I = b === i.Num;
@@ -1125,7 +1125,7 @@ function ee() {
     }
     return E ? (0, e.getProperty)(_).toString() : "/" + d(_);
   }
-  J.getErrorPath = c;
+  H.getErrorPath = c;
   function m(_, b, E = _.opts.strictSchema) {
     if (E) {
       if (b = `strict mode: ${b}`, E === !0)
@@ -1133,7 +1133,7 @@ function ee() {
       _.self.logger.warn(b);
     }
   }
-  return J.checkStrictMode = m, J;
+  return H.checkStrictMode = m, H;
 }
 var tt = {}, Ur;
 function Ae() {
@@ -1182,12 +1182,12 @@ function Bt() {
     };
     function a(f, l = e.keywordError, i, c) {
       const { it: m } = f, { gen: _, compositeRule: b, allErrors: E } = m, I = v(f, l, i);
-      c ?? (b || E) ? p(_, I) : y(m, (0, t._)`[${I}]`);
+      c ?? (b || E) ? h(_, I) : y(m, (0, t._)`[${I}]`);
     }
     e.reportError = a;
     function s(f, l = e.keywordError, i) {
       const { it: c } = f, { gen: m, compositeRule: _, allErrors: b } = c, E = v(f, l, i);
-      p(m, E), _ || b || y(c, n.default.vErrors);
+      h(m, E), _ || b || y(c, n.default.vErrors);
     }
     e.reportExtraError = s;
     function o(f, l) {
@@ -1203,7 +1203,7 @@ function Bt() {
       });
     }
     e.extendErrors = u;
-    function p(f, l) {
+    function h(f, l) {
       const i = f.const("err", l);
       f.if((0, t._)`${n.default.vErrors} === null`, () => f.assign(n.default.vErrors, (0, t._)`[${i}]`), (0, t._)`${n.default.vErrors}.push(${i})`), f.code((0, t._)`${n.default.errors}++`);
     }
@@ -1254,16 +1254,16 @@ function Ma() {
     message: "boolean schema is false"
   };
   function a(u) {
-    const { gen: p, schema: y, validateName: d } = u;
-    y === !1 ? o(u, !1) : typeof y == "object" && y.$async === !0 ? p.return(r.default.data) : (p.assign((0, t._)`${d}.errors`, null), p.return(!0));
+    const { gen: h, schema: y, validateName: d } = u;
+    y === !1 ? o(u, !1) : typeof y == "object" && y.$async === !0 ? h.return(r.default.data) : (h.assign((0, t._)`${d}.errors`, null), h.return(!0));
   }
   Ce.topBoolOrEmptySchema = a;
-  function s(u, p) {
+  function s(u, h) {
     const { gen: y, schema: d } = u;
-    d === !1 ? (y.var(p, !1), o(u)) : y.var(p, !0);
+    d === !1 ? (y.var(h, !1), o(u)) : y.var(h, !0);
   }
   Ce.boolOrEmptySchema = s;
-  function o(u, p) {
+  function o(u, h) {
     const { gen: y, data: d } = u, v = {
       gen: y,
       keyword: "false schema",
@@ -1274,7 +1274,7 @@ function Ma() {
       params: {},
       it: u
     };
-    (0, e.reportError)(v, n, void 0, p);
+    (0, e.reportError)(v, n, void 0, h);
   }
   return Ce;
 }
@@ -1304,10 +1304,10 @@ function Ss() {
   }
   return Te.getRules = n, Te;
 }
-var je = {}, Hr;
+var je = {}, Jr;
 function Ps() {
-  if (Hr) return je;
-  Hr = 1, Object.defineProperty(je, "__esModule", { value: !0 }), je.shouldUseRule = je.shouldUseGroup = je.schemaHasRulesForType = void 0;
+  if (Jr) return je;
+  Jr = 1, Object.defineProperty(je, "__esModule", { value: !0 }), je.shouldUseRule = je.shouldUseGroup = je.schemaHasRulesForType = void 0;
   function e({ schema: n, self: a }, s) {
     const o = a.RULES.types[s];
     return o && o !== !0 && t(n, o);
@@ -1323,10 +1323,10 @@ function Ps() {
   }
   return je.shouldUseRule = r, je;
 }
-var Jr;
+var Hr;
 function zt() {
-  if (Jr) return fe;
-  Jr = 1, Object.defineProperty(fe, "__esModule", { value: !0 }), fe.reportTypeError = fe.checkDataTypes = fe.checkDataType = fe.coerceAndCheckDataType = fe.getJSONTypes = fe.getSchemaTypes = fe.DataType = void 0;
+  if (Hr) return fe;
+  Hr = 1, Object.defineProperty(fe, "__esModule", { value: !0 }), fe.reportTypeError = fe.checkDataTypes = fe.checkDataType = fe.coerceAndCheckDataType = fe.getJSONTypes = fe.getSchemaTypes = fe.DataType = void 0;
   const e = Ss(), t = Ps(), r = Bt(), n = G(), a = ee();
   var s;
   (function(i) {
@@ -1352,7 +1352,7 @@ function zt() {
     throw new Error("type must be JSONType or JSONType[]: " + c.join(","));
   }
   fe.getJSONTypes = u;
-  function p(i, c) {
+  function h(i, c) {
     const { gen: m, data: _, opts: b } = i, E = d(c, b.coerceTypes), I = c.length > 0 && !(E.length === 0 && c.length === 1 && (0, t.schemaHasRulesForType)(i, c[0]));
     if (I) {
       const q = w(c, _, b.strictNumbers, s.Wrong);
@@ -1362,7 +1362,7 @@ function zt() {
     }
     return I;
   }
-  fe.coerceAndCheckDataType = p;
+  fe.coerceAndCheckDataType = h;
   const y = /* @__PURE__ */ new Set(["string", "number", "integer", "boolean", "null"]);
   function d(i, c) {
     return c ? i.filter((m) => y.has(m) || c === "array" && m === "array") : [];
@@ -1479,17 +1479,17 @@ function Va() {
   function r(a, s) {
     const { properties: o, items: u } = a.schema;
     if (s === "object" && o)
-      for (const p in o)
-        n(a, p, o[p].default);
-    else s === "array" && Array.isArray(u) && u.forEach((p, y) => n(a, y, p.default));
+      for (const h in o)
+        n(a, h, o[h].default);
+    else s === "array" && Array.isArray(u) && u.forEach((h, y) => n(a, y, h.default));
   }
   Be.assignDefaults = r;
   function n(a, s, o) {
-    const { gen: u, compositeRule: p, data: y, opts: d } = a;
+    const { gen: u, compositeRule: h, data: y, opts: d } = a;
     if (o === void 0)
       return;
     const v = (0, e._)`${y}${(0, e.getProperty)(s)}`;
-    if (p) {
+    if (h) {
       (0, t.checkStrictMode)(a, `default is ignored for: ${v}`);
       return;
     }
@@ -1526,18 +1526,18 @@ function Se() {
     });
   }
   re.hasPropFunc = u;
-  function p(i, c, m) {
+  function h(i, c, m) {
     return (0, e._)`${u(i)}.call(${c}, ${m})`;
   }
-  re.isOwnProperty = p;
+  re.isOwnProperty = h;
   function y(i, c, m, _) {
     const b = (0, e._)`${c}${(0, e.getProperty)(m)} !== undefined`;
-    return _ ? (0, e._)`${b} && ${p(i, c, m)}` : b;
+    return _ ? (0, e._)`${b} && ${h(i, c, m)}` : b;
   }
   re.propertyInData = y;
   function d(i, c, m, _) {
     const b = (0, e._)`${c}${(0, e.getProperty)(m)} === undefined`;
-    return _ ? (0, e.or)(b, (0, e.not)(p(i, c, m))) : b;
+    return _ ? (0, e.or)(b, (0, e.not)(h(i, c, m))) : b;
   }
   re.noPropertyInData = d;
   function v(i) {
@@ -1628,7 +1628,7 @@ function Da() {
   function s($, S) {
     var w;
     const { gen: g, keyword: f, schema: l, parentSchema: i, $data: c, it: m } = $;
-    p(m, S);
+    h(m, S);
     const _ = !c && S.compile ? S.compile.call(m.self, l, i, m) : S.validate, b = y(g, f, _), E = g.let("valid");
     $.block$data(E, I), $.ok((w = S.valid) !== null && w !== void 0 ? w : E);
     function I() {
@@ -1667,7 +1667,7 @@ function Da() {
       w.assign(t.default.vErrors, (0, e._)`${t.default.vErrors} === null ? ${S} : ${t.default.vErrors}.concat(${S})`).assign(t.default.errors, (0, e._)`${t.default.vErrors}.length`), (0, n.extendErrors)($);
     }, () => $.error());
   }
-  function p({ schemaEnv: $ }, S) {
+  function h({ schemaEnv: $ }, S) {
     if (S.async && !$.$async)
       throw new Error("async keyword in sync schema");
   }
@@ -1701,8 +1701,8 @@ function za() {
   if (Yr) return ke;
   Yr = 1, Object.defineProperty(ke, "__esModule", { value: !0 }), ke.extendSubschemaMode = ke.extendSubschemaData = ke.getSubschema = void 0;
   const e = G(), t = ee();
-  function r(s, { keyword: o, schemaProp: u, schema: p, schemaPath: y, errSchemaPath: d, topSchemaRef: v }) {
-    if (o !== void 0 && p !== void 0)
+  function r(s, { keyword: o, schemaProp: u, schema: h, schemaPath: y, errSchemaPath: d, topSchemaRef: v }) {
+    if (o !== void 0 && h !== void 0)
       throw new Error('both "keyword" and "schema" passed, only one allowed');
     if (o !== void 0) {
       const $ = s.schema[o];
@@ -1716,11 +1716,11 @@ function za() {
         errSchemaPath: `${s.errSchemaPath}/${o}/${(0, t.escapeFragment)(u)}`
       };
     }
-    if (p !== void 0) {
+    if (h !== void 0) {
       if (y === void 0 || d === void 0 || v === void 0)
         throw new Error('"schemaPath", "errSchemaPath" and "topSchemaRef" are required with "schema"');
       return {
-        schema: p,
+        schema: h,
         schemaPath: y,
         topSchemaRef: v,
         errSchemaPath: d
@@ -1729,13 +1729,13 @@ function za() {
     throw new Error('either "keyword" or "schema" must be passed');
   }
   ke.getSubschema = r;
-  function n(s, o, { dataProp: u, dataPropType: p, data: y, dataTypes: d, propertyName: v }) {
+  function n(s, o, { dataProp: u, dataPropType: h, data: y, dataTypes: d, propertyName: v }) {
     if (y !== void 0 && u !== void 0)
       throw new Error('both "data" and "dataProp" passed, only one allowed');
     const { gen: $ } = o;
     if (u !== void 0) {
       const { errorPath: w, dataPathArr: g, opts: f } = o, l = $.let("data", (0, e._)`${o.data}${(0, e.getProperty)(u)}`, !0);
-      S(l), s.errorPath = (0, e.str)`${w}${(0, t.getErrorPath)(u, p, f.jsPropertySyntax)}`, s.parentDataProperty = (0, e._)`${u}`, s.dataPathArr = [...g, s.parentDataProperty];
+      S(l), s.errorPath = (0, e.str)`${w}${(0, t.getErrorPath)(u, h, f.jsPropertySyntax)}`, s.parentDataProperty = (0, e._)`${u}`, s.dataPathArr = [...g, s.parentDataProperty];
     }
     if (y !== void 0) {
       const w = y instanceof e.Name ? y : $.let("data", y, !0);
@@ -1747,12 +1747,12 @@ function za() {
     }
   }
   ke.extendSubschemaData = n;
-  function a(s, { jtdDiscriminator: o, jtdMetadata: u, compositeRule: p, createErrors: y, allErrors: d }) {
-    p !== void 0 && (s.compositeRule = p), y !== void 0 && (s.createErrors = y), d !== void 0 && (s.allErrors = d), s.jtdDiscriminator = o, s.jtdMetadata = u;
+  function a(s, { jtdDiscriminator: o, jtdMetadata: u, compositeRule: h, createErrors: y, allErrors: d }) {
+    h !== void 0 && (s.compositeRule = h), y !== void 0 && (s.createErrors = y), d !== void 0 && (s.allErrors = d), s.jtdDiscriminator = o, s.jtdMetadata = u;
   }
   return ke.extendSubschemaMode = a, ke;
 }
-var pe = {}, or, Zr;
+var he = {}, or, Zr;
 function Es() {
   return Zr || (Zr = 1, or = function e(t, r) {
     if (t === r) return !0;
@@ -1832,22 +1832,22 @@ function La() {
     maxProperties: !0,
     minProperties: !0
   };
-  function t(n, a, s, o, u, p, y, d, v, $) {
+  function t(n, a, s, o, u, h, y, d, v, $) {
     if (o && typeof o == "object" && !Array.isArray(o)) {
-      a(o, u, p, y, d, v, $);
+      a(o, u, h, y, d, v, $);
       for (var S in o) {
         var w = o[S];
         if (Array.isArray(w)) {
           if (S in e.arrayKeywords)
             for (var g = 0; g < w.length; g++)
-              t(n, a, s, w[g], u + "/" + S + "/" + g, p, u, S, o, g);
+              t(n, a, s, w[g], u + "/" + S + "/" + g, h, u, S, o, g);
         } else if (S in e.propsKeywords) {
           if (w && typeof w == "object")
             for (var f in w)
-              t(n, a, s, w[f], u + "/" + S + "/" + r(f), p, u, S, o, f);
-        } else (S in e.keywords || n.allKeys && !(S in e.skipKeywords)) && t(n, a, s, w, u + "/" + S, p, u, S, o);
+              t(n, a, s, w[f], u + "/" + S + "/" + r(f), h, u, S, o, f);
+        } else (S in e.keywords || n.allKeys && !(S in e.skipKeywords)) && t(n, a, s, w, u + "/" + S, h, u, S, o);
       }
-      s(o, u, p, y, d, v, $);
+      s(o, u, h, y, d, v, $);
     }
   }
   function r(n) {
@@ -1857,8 +1857,8 @@ function La() {
 }
 var en;
 function Wt() {
-  if (en) return pe;
-  en = 1, Object.defineProperty(pe, "__esModule", { value: !0 }), pe.getSchemaRefs = pe.resolveUrl = pe.normalizeId = pe._getFullPath = pe.getFullPath = pe.inlineRef = void 0;
+  if (en) return he;
+  en = 1, Object.defineProperty(he, "__esModule", { value: !0 }), he.getSchemaRefs = he.resolveUrl = he.normalizeId = he._getFullPath = he.getFullPath = he.inlineRef = void 0;
   const e = ee(), t = Es(), r = La(), n = /* @__PURE__ */ new Set([
     "type",
     "format",
@@ -1880,7 +1880,7 @@ function Wt() {
   function a(g, f = !0) {
     return typeof g == "boolean" ? !0 : f === !0 ? !o(g) : f ? u(g) <= f : !1;
   }
-  pe.inlineRef = a;
+  he.inlineRef = a;
   const s = /* @__PURE__ */ new Set([
     "$ref",
     "$recursiveRef",
@@ -1908,30 +1908,30 @@ function Wt() {
     }
     return f;
   }
-  function p(g, f = "", l) {
+  function h(g, f = "", l) {
     l !== !1 && (f = v(f));
     const i = g.parse(f);
     return y(g, i);
   }
-  pe.getFullPath = p;
+  he.getFullPath = h;
   function y(g, f) {
     return g.serialize(f).split("#")[0] + "#";
   }
-  pe._getFullPath = y;
+  he._getFullPath = y;
   const d = /#\/?$/;
   function v(g) {
     return g ? g.replace(d, "") : "";
   }
-  pe.normalizeId = v;
+  he.normalizeId = v;
   function $(g, f, l) {
     return l = v(l), g.resolve(f, l);
   }
-  pe.resolveUrl = $;
+  he.resolveUrl = $;
   const S = /^[a-z_][-a-z0-9._]*$/i;
   function w(g, f) {
     if (typeof g == "boolean")
       return {};
-    const { schemaId: l, uriResolver: i } = this.opts, c = v(g[l] || f), m = { "": c }, _ = p(i, c, !1), b = {}, E = /* @__PURE__ */ new Set();
+    const { schemaId: l, uriResolver: i } = this.opts, c = v(g[l] || f), m = { "": c }, _ = h(i, c, !1), b = {}, E = /* @__PURE__ */ new Set();
     return r(g, { allKeys: !0 }, (D, A, V, L) => {
       if (L === void 0)
         return;
@@ -1962,13 +1962,13 @@ function Wt() {
       return new Error(`reference "${D}" resolves to more than one schema`);
     }
   }
-  return pe.getSchemaRefs = w, pe;
+  return he.getSchemaRefs = w, he;
 }
 var tn;
-function Ht() {
+function Jt() {
   if (tn) return Oe;
   tn = 1, Object.defineProperty(Oe, "__esModule", { value: !0 }), Oe.getData = Oe.KeywordCxt = Oe.validateFunctionCode = void 0;
-  const e = Ma(), t = zt(), r = Ps(), n = zt(), a = Va(), s = Da(), o = za(), u = G(), p = Ae(), y = Wt(), d = ee(), v = Bt();
+  const e = Ma(), t = zt(), r = Ps(), n = zt(), a = Va(), s = Da(), o = za(), u = G(), h = Ae(), y = Wt(), d = ee(), v = Bt();
   function $(O) {
     if (_(O) && (E(O), m(O))) {
       f(O);
@@ -1978,24 +1978,24 @@ function Ht() {
   }
   Oe.validateFunctionCode = $;
   function S({ gen: O, validateName: k, schema: T, schemaEnv: z, opts: W }, x) {
-    W.code.es5 ? O.func(k, (0, u._)`${p.default.data}, ${p.default.valCxt}`, z.$async, () => {
+    W.code.es5 ? O.func(k, (0, u._)`${h.default.data}, ${h.default.valCxt}`, z.$async, () => {
       O.code((0, u._)`"use strict"; ${i(T, W)}`), g(O, W), O.code(x);
-    }) : O.func(k, (0, u._)`${p.default.data}, ${w(W)}`, z.$async, () => O.code(i(T, W)).code(x));
+    }) : O.func(k, (0, u._)`${h.default.data}, ${w(W)}`, z.$async, () => O.code(i(T, W)).code(x));
   }
   function w(O) {
-    return (0, u._)`{${p.default.instancePath}="", ${p.default.parentData}, ${p.default.parentDataProperty}, ${p.default.rootData}=${p.default.data}${O.dynamicRef ? (0, u._)`, ${p.default.dynamicAnchors}={}` : u.nil}}={}`;
+    return (0, u._)`{${h.default.instancePath}="", ${h.default.parentData}, ${h.default.parentDataProperty}, ${h.default.rootData}=${h.default.data}${O.dynamicRef ? (0, u._)`, ${h.default.dynamicAnchors}={}` : u.nil}}={}`;
   }
   function g(O, k) {
-    O.if(p.default.valCxt, () => {
-      O.var(p.default.instancePath, (0, u._)`${p.default.valCxt}.${p.default.instancePath}`), O.var(p.default.parentData, (0, u._)`${p.default.valCxt}.${p.default.parentData}`), O.var(p.default.parentDataProperty, (0, u._)`${p.default.valCxt}.${p.default.parentDataProperty}`), O.var(p.default.rootData, (0, u._)`${p.default.valCxt}.${p.default.rootData}`), k.dynamicRef && O.var(p.default.dynamicAnchors, (0, u._)`${p.default.valCxt}.${p.default.dynamicAnchors}`);
+    O.if(h.default.valCxt, () => {
+      O.var(h.default.instancePath, (0, u._)`${h.default.valCxt}.${h.default.instancePath}`), O.var(h.default.parentData, (0, u._)`${h.default.valCxt}.${h.default.parentData}`), O.var(h.default.parentDataProperty, (0, u._)`${h.default.valCxt}.${h.default.parentDataProperty}`), O.var(h.default.rootData, (0, u._)`${h.default.valCxt}.${h.default.rootData}`), k.dynamicRef && O.var(h.default.dynamicAnchors, (0, u._)`${h.default.valCxt}.${h.default.dynamicAnchors}`);
     }, () => {
-      O.var(p.default.instancePath, (0, u._)`""`), O.var(p.default.parentData, (0, u._)`undefined`), O.var(p.default.parentDataProperty, (0, u._)`undefined`), O.var(p.default.rootData, p.default.data), k.dynamicRef && O.var(p.default.dynamicAnchors, (0, u._)`{}`);
+      O.var(h.default.instancePath, (0, u._)`""`), O.var(h.default.parentData, (0, u._)`undefined`), O.var(h.default.parentDataProperty, (0, u._)`undefined`), O.var(h.default.rootData, h.default.data), k.dynamicRef && O.var(h.default.dynamicAnchors, (0, u._)`{}`);
     });
   }
   function f(O) {
     const { schema: k, opts: T, gen: z } = O;
     S(O, () => {
-      T.$comment && k.$comment && L(O), D(O), z.let(p.default.vErrors, null), z.let(p.default.errors, 0), T.unevaluated && l(O), I(O), B(O);
+      T.$comment && k.$comment && L(O), D(O), z.let(h.default.vErrors, null), z.let(h.default.errors, 0), T.unevaluated && l(O), I(O), B(O);
     });
   }
   function l(O) {
@@ -2027,8 +2027,8 @@ function Ht() {
   function b(O, k) {
     const { schema: T, gen: z, opts: W } = O;
     W.$comment && T.$comment && L(O), A(O), V(O);
-    const x = z.const("_errs", p.default.errors);
-    I(O, x), z.var(k, (0, u._)`${x} === ${p.default.errors}`);
+    const x = z.const("_errs", h.default.errors);
+    I(O, x), z.var(k, (0, u._)`${x} === ${h.default.errors}`);
   }
   function E(O) {
     (0, d.checkUnknownRules)(O), q(O);
@@ -2058,15 +2058,15 @@ function Ht() {
   function L({ gen: O, schemaEnv: k, schema: T, errSchemaPath: z, opts: W }) {
     const x = T.$comment;
     if (W.$comment === !0)
-      O.code((0, u._)`${p.default.self}.logger.log(${x})`);
+      O.code((0, u._)`${h.default.self}.logger.log(${x})`);
     else if (typeof W.$comment == "function") {
       const ue = (0, u.str)`${z}/$comment`, be = O.scopeValue("root", { ref: k.root });
-      O.code((0, u._)`${p.default.self}.opts.$comment(${x}, ${ue}, ${be}.schema)`);
+      O.code((0, u._)`${h.default.self}.opts.$comment(${x}, ${ue}, ${be}.schema)`);
     }
   }
   function B(O) {
     const { gen: k, schemaEnv: T, validateName: z, ValidationError: W, opts: x } = O;
-    T.$async ? k.if((0, u._)`${p.default.errors} === 0`, () => k.return(p.default.data), () => k.throw((0, u._)`new ${W}(${p.default.vErrors})`)) : (k.assign((0, u._)`${z}.errors`, p.default.vErrors), x.unevaluated && Q(O), k.return((0, u._)`${p.default.errors} === 0`));
+    T.$async ? k.if((0, u._)`${h.default.errors} === 0`, () => k.return(h.default.data), () => k.throw((0, u._)`new ${W}(${h.default.vErrors})`)) : (k.assign((0, u._)`${z}.errors`, h.default.vErrors), x.unevaluated && Q(O), k.return((0, u._)`${h.default.errors} === 0`));
   }
   function Q({ gen: O, evaluated: k, props: T, items: z }) {
     T instanceof u.Name && O.assign((0, u._)`${k}.props`, T), z instanceof u.Name && O.assign((0, u._)`${k}.items`, z);
@@ -2083,7 +2083,7 @@ function Ht() {
       Ve(ce.post);
     });
     function Ve(_e) {
-      (0, r.shouldUseGroup)(x, _e) && (_e.type ? (W.if((0, n.checkDataType)(_e.type, ue, me.strictNumbers)), ae(O, _e), k.length === 1 && k[0] === _e.type && T && (W.else(), (0, n.reportTypeError)(O)), W.endIf()) : ae(O, _e), be || W.if((0, u._)`${p.default.errors} === ${z || 0}`));
+      (0, r.shouldUseGroup)(x, _e) && (_e.type ? (W.if((0, n.checkDataType)(_e.type, ue, me.strictNumbers)), ae(O, _e), k.length === 1 && k[0] === _e.type && T && (W.else(), (0, n.reportTypeError)(O)), W.endIf()) : ae(O, _e), be || W.if((0, u._)`${h.default.errors} === ${z || 0}`));
     }
   }
   function ae(O, k) {
@@ -2104,7 +2104,7 @@ function Ht() {
       }
       k.forEach((T) => {
         N(O.dataTypes, T) || P(O, `type "${T}" not allowed by context "${O.dataTypes.join(",")}"`);
-      }), h(O, k);
+      }), p(O, k);
     }
   }
   function M(O, k) {
@@ -2126,7 +2126,7 @@ function Ht() {
   function N(O, k) {
     return O.includes(k) || k === "integer" && O.includes("number");
   }
-  function h(O, k) {
+  function p(O, k) {
     const T = [];
     for (const z of O.dataTypes)
       N(k, z) ? T.push(z) : k.includes("integer") && z === "number" && T.push("integer");
@@ -2142,7 +2142,7 @@ function Ht() {
         this.schemaCode = k.gen.const("vSchema", X(this.$data, k));
       else if (this.schemaCode = this.schemaValue, !(0, s.validSchemaType)(this.schema, T.schemaType, T.allowUndefined))
         throw new Error(`${z} value must be ${JSON.stringify(T.schemaType)}`);
-      ("code" in T ? T.trackErrors : T.errors !== !1) && (this.errsCount = k.gen.const("_errs", p.default.errors));
+      ("code" in T ? T.trackErrors : T.errors !== !1) && (this.errsCount = k.gen.const("_errs", h.default.errors));
     }
     result(k, T, z) {
       this.failResult((0, u.not)(k), T, z);
@@ -2246,11 +2246,11 @@ function Ht() {
   function X(O, { dataLevel: k, dataNames: T, dataPathArr: z }) {
     let W, x;
     if (O === "")
-      return p.default.rootData;
+      return h.default.rootData;
     if (O[0] === "/") {
       if (!K.test(O))
         throw new Error(`Invalid JSON-pointer: ${O}`);
-      W = O, x = p.default.rootData;
+      W = O, x = h.default.rootData;
     } else {
       const ye = Y.exec(O);
       if (!ye)
@@ -2289,7 +2289,7 @@ function Er() {
   return rt.default = e, rt;
 }
 var nt = {}, nn;
-function Jt() {
+function Ht() {
   if (nn) return nt;
   nn = 1, Object.defineProperty(nt, "__esModule", { value: !0 });
   const e = Wt();
@@ -2304,7 +2304,7 @@ var ge = {}, sn;
 function Or() {
   if (sn) return ge;
   sn = 1, Object.defineProperty(ge, "__esModule", { value: !0 }), ge.resolveSchema = ge.getCompilingSchema = ge.resolveRef = ge.compileSchema = ge.SchemaEnv = void 0;
-  const e = G(), t = Er(), r = Ae(), n = Wt(), a = ee(), s = Ht();
+  const e = G(), t = Er(), r = Ae(), n = Wt(), a = ee(), s = Jt();
   class o {
     constructor(l) {
       var i;
@@ -2374,7 +2374,7 @@ function Or() {
     }
   }
   ge.compileSchema = u;
-  function p(f, l, i) {
+  function h(f, l, i) {
     var c;
     i = (0, n.resolveUrl)(this.opts.uriResolver, l, i);
     const m = f.refs[i];
@@ -2388,7 +2388,7 @@ function Or() {
     if (_ !== void 0)
       return f.refs[i] = y.call(this, _);
   }
-  ge.resolveRef = p;
+  ge.resolveRef = h;
   function y(f) {
     return (0, n.inlineRef)(f.schema, this.opts.inlineRefs) ? f.schema : f.validate ? f : u.call(this, f);
   }
@@ -2458,13 +2458,13 @@ function Or() {
   }
   return ge;
 }
-const Fa = "https://raw.githubusercontent.com/ajv-validator/ajv/master/lib/refs/data.json#", Ua = "Meta-schema for $data reference (JSON AnySchema extension proposal)", Ka = "object", Ba = ["$data"], Wa = { $data: { type: "string", anyOf: [{ format: "relative-json-pointer" }, { format: "json-pointer" }] } }, Ha = !1, Ja = {
+const Fa = "https://raw.githubusercontent.com/ajv-validator/ajv/master/lib/refs/data.json#", Ua = "Meta-schema for $data reference (JSON AnySchema extension proposal)", Ka = "object", Ba = ["$data"], Wa = { $data: { type: "string", anyOf: [{ format: "relative-json-pointer" }, { format: "json-pointer" }] } }, Ja = !1, Ha = {
   $id: Fa,
   description: Ua,
   type: Ka,
   required: Ba,
   properties: Wa,
-  additionalProperties: Ha
+  additionalProperties: Ja
 };
 var st = {}, We = { exports: {} }, cr, an;
 function Ga() {
@@ -2580,12 +2580,12 @@ function xa() {
       g[i] === f && l++;
     return l;
   }
-  const p = /^\.\.?\//u, y = /^\/\.(?:\/|$)/u, d = /^\/\.\.(?:\/|$)/u, v = /^\/?(?:.|\n)*?(?=\/|$)/u;
+  const h = /^\.\.?\//u, y = /^\/\.(?:\/|$)/u, d = /^\/\.\.(?:\/|$)/u, v = /^\/?(?:.|\n)*?(?=\/|$)/u;
   function $(g) {
     const f = [];
     for (; g.length; )
-      if (g.match(p))
-        g = g.replace(p, "");
+      if (g.match(h))
+        g = g.replace(h, "");
       else if (g.match(y))
         g = g.replace(y, "/");
       else if (g.match(d))
@@ -2668,7 +2668,7 @@ function Xa() {
       i.error = i.error || "URN can not be parsed.";
     return i;
   }
-  function p(i, c) {
+  function h(i, c) {
     const m = c.scheme || i.scheme || "urn", _ = i.nid.toLowerCase(), b = `${m}:${c.nid || _}`, E = l[b];
     E && (i = E.serialize(i, c));
     const I = i, q = i.nss;
@@ -2710,7 +2710,7 @@ function Xa() {
     urn: {
       scheme: "urn",
       parse: u,
-      serialize: p,
+      serialize: h,
       skipNormalize: !0
     },
     "urn:uuid": {
@@ -2731,10 +2731,10 @@ function Ya() {
     return typeof f == "string" ? f = d(w(f, l), l) : typeof f == "object" && (f = w(d(f, l), l)), f;
   }
   function u(f, l, i) {
-    const c = Object.assign({ scheme: "null" }, i), m = p(w(f, c), w(l, c), c, !0);
+    const c = Object.assign({ scheme: "null" }, i), m = h(w(f, c), w(l, c), c, !0);
     return d(m, { ...c, skipEscape: !0 });
   }
-  function p(f, l, i, c) {
+  function h(f, l, i, c) {
     const m = {};
     return c || (f = w(d(f, i), i), l = w(d(l, i), i)), i = i || {}, !i.tolerant && l.scheme ? (m.scheme = l.scheme, m.userinfo = l.userinfo, m.host = l.host, m.port = l.port, m.path = r(l.path || ""), m.query = l.query) : (l.userinfo !== void 0 || l.host !== void 0 || l.port !== void 0 ? (m.userinfo = l.userinfo, m.host = l.host, m.port = l.port, m.path = r(l.path || ""), m.query = l.query) : (l.path ? (l.path.charAt(0) === "/" ? m.path = r(l.path) : ((f.userinfo !== void 0 || f.host !== void 0 || f.port !== void 0) && !f.path ? m.path = "/" + l.path : f.path ? m.path = f.path.slice(0, f.path.lastIndexOf("/") + 1) + l.path : m.path = l.path, m.path = r(m.path)), m.query = l.query) : (m.path = f.path, l.query !== void 0 ? m.query = l.query : m.query = f.query), m.userinfo = f.userinfo, m.host = f.host, m.port = f.port), m.scheme = f.scheme), m.fragment = l.fragment, m;
   }
@@ -2814,7 +2814,7 @@ function Ya() {
     SCHEMES: s,
     normalize: o,
     resolve: u,
-    resolveComponents: p,
+    resolveComponents: h,
     equal: y,
     serialize: d,
     parse: w
@@ -2832,7 +2832,7 @@ var fn;
 function Qa() {
   return fn || (fn = 1, function(e) {
     Object.defineProperty(e, "__esModule", { value: !0 }), e.CodeGen = e.Name = e.nil = e.stringify = e.str = e._ = e.KeywordCxt = void 0;
-    var t = Ht();
+    var t = Jt();
     Object.defineProperty(e, "KeywordCxt", { enumerable: !0, get: function() {
       return t.KeywordCxt;
     } });
@@ -2850,7 +2850,7 @@ function Qa() {
     } }), Object.defineProperty(e, "CodeGen", { enumerable: !0, get: function() {
       return r.CodeGen;
     } });
-    const n = Er(), a = Jt(), s = Ss(), o = Or(), u = G(), p = Wt(), y = zt(), d = ee(), v = Ja, $ = Za(), S = (M, j) => new RegExp(M, j);
+    const n = Er(), a = Ht(), s = Ss(), o = Or(), u = G(), h = Wt(), y = zt(), d = ee(), v = Ha, $ = Za(), S = (M, j) => new RegExp(M, j);
     S.code = "new RegExp";
     const w = ["removeAdditional", "useDefaults", "coerceTypes"], g = /* @__PURE__ */ new Set([
       "validate",
@@ -2888,8 +2888,8 @@ function Qa() {
       unicode: '"minLength"/"maxLength" account for unicode characters by default.'
     }, i = 200;
     function c(M) {
-      var j, C, N, h, P, R, U, K, Y, X, O, k, T, z, W, x, ue, be, me, ye, ce, Ve, _e, xt, Xt;
-      const Ue = M.strict, Yt = (j = M.code) === null || j === void 0 ? void 0 : j.optimize, Cr = Yt === !0 || Yt === void 0 ? 1 : Yt || 0, Tr = (N = (C = M.code) === null || C === void 0 ? void 0 : C.regExp) !== null && N !== void 0 ? N : S, Xs = (h = M.uriResolver) !== null && h !== void 0 ? h : $.default;
+      var j, C, N, p, P, R, U, K, Y, X, O, k, T, z, W, x, ue, be, me, ye, ce, Ve, _e, xt, Xt;
+      const Ue = M.strict, Yt = (j = M.code) === null || j === void 0 ? void 0 : j.optimize, Cr = Yt === !0 || Yt === void 0 ? 1 : Yt || 0, Tr = (N = (C = M.code) === null || C === void 0 ? void 0 : C.regExp) !== null && N !== void 0 ? N : S, Xs = (p = M.uriResolver) !== null && p !== void 0 ? p : $.default;
       return {
         strictSchema: (R = (P = M.strictSchema) !== null && P !== void 0 ? P : Ue) !== null && R !== void 0 ? R : !0,
         strictNumbers: (K = (U = M.strictNumbers) !== null && U !== void 0 ? U : Ue) !== null && K !== void 0 ? K : !0,
@@ -2916,16 +2916,16 @@ function Qa() {
         this.schemas = {}, this.refs = {}, this.formats = {}, this._compilations = /* @__PURE__ */ new Set(), this._loading = {}, this._cache = /* @__PURE__ */ new Map(), j = this.opts = { ...j, ...c(j) };
         const { es5: C, lines: N } = this.opts.code;
         this.scope = new u.ValueScope({ scope: {}, prefixes: g, es5: C, lines: N }), this.logger = V(j.logger);
-        const h = j.validateFormats;
-        j.validateFormats = !1, this.RULES = (0, s.getRules)(), _.call(this, f, j, "NOT SUPPORTED"), _.call(this, l, j, "DEPRECATED", "warn"), this._metaOpts = D.call(this), j.formats && I.call(this), this._addVocabularies(), this._addDefaultMetaSchema(), j.keywords && q.call(this, j.keywords), typeof j.meta == "object" && this.addMetaSchema(j.meta), E.call(this), j.validateFormats = h;
+        const p = j.validateFormats;
+        j.validateFormats = !1, this.RULES = (0, s.getRules)(), _.call(this, f, j, "NOT SUPPORTED"), _.call(this, l, j, "DEPRECATED", "warn"), this._metaOpts = D.call(this), j.formats && I.call(this), this._addVocabularies(), this._addDefaultMetaSchema(), j.keywords && q.call(this, j.keywords), typeof j.meta == "object" && this.addMetaSchema(j.meta), E.call(this), j.validateFormats = p;
       }
       _addVocabularies() {
         this.addKeyword("$async");
       }
       _addDefaultMetaSchema() {
         const { $data: j, meta: C, schemaId: N } = this.opts;
-        let h = v;
-        N === "id" && (h = { ...v }, h.id = h.$id, delete h.$id), C && j && this.addMetaSchema(h, h[N], !1);
+        let p = v;
+        N === "id" && (p = { ...v }, p.id = p.$id, delete p.$id), C && j && this.addMetaSchema(p, p[N], !1);
       }
       defaultMeta() {
         const { meta: j, schemaId: C } = this.opts;
@@ -2938,8 +2938,8 @@ function Qa() {
             throw new Error(`no schema with key or ref "${j}"`);
         } else
           N = this.compile(j);
-        const h = N(C);
-        return "$async" in N || (this.errors = N.errors), h;
+        const p = N(C);
+        return "$async" in N || (this.errors = N.errors), p;
       }
       compile(j, C) {
         const N = this._addSchema(j, C);
@@ -2949,14 +2949,14 @@ function Qa() {
         if (typeof this.opts.loadSchema != "function")
           throw new Error("options.loadSchema should be a function");
         const { loadSchema: N } = this.opts;
-        return h.call(this, j, C);
-        async function h(X, O) {
+        return p.call(this, j, C);
+        async function p(X, O) {
           await P.call(this, X.$schema);
           const k = this._addSchema(X, O);
           return k.validate || R.call(this, k);
         }
         async function P(X) {
-          X && !this.getSchema(X) && await h.call(this, { $ref: X }, !0);
+          X && !this.getSchema(X) && await p.call(this, { $ref: X }, !0);
         }
         async function R(X) {
           try {
@@ -2987,10 +2987,10 @@ function Qa() {
         }
       }
       // Adds schema to the instance
-      addSchema(j, C, N, h = this.opts.validateSchema) {
+      addSchema(j, C, N, p = this.opts.validateSchema) {
         if (Array.isArray(j)) {
           for (const R of j)
-            this.addSchema(R, void 0, N, h);
+            this.addSchema(R, void 0, N, p);
           return this;
         }
         let P;
@@ -2999,7 +2999,7 @@ function Qa() {
           if (P = j[R], P !== void 0 && typeof P != "string")
             throw new Error(`schema ${R} must be string`);
         }
-        return C = (0, p.normalizeId)(C || P), this._checkUnique(C), this.schemas[C] = this._addSchema(j, N, C, h, !0), this;
+        return C = (0, h.normalizeId)(C || P), this._checkUnique(C), this.schemas[C] = this._addSchema(j, N, C, p, !0), this;
       }
       // Add schema that will be used to validate other schemas
       // options in META_IGNORE_OPTIONS are alway set to false
@@ -3015,15 +3015,15 @@ function Qa() {
           throw new Error("$schema must be a string");
         if (N = N || this.opts.defaultMeta || this.defaultMeta(), !N)
           return this.logger.warn("meta-schema not available"), this.errors = null, !0;
-        const h = this.validate(N, j);
-        if (!h && C) {
+        const p = this.validate(N, j);
+        if (!p && C) {
           const P = "schema is invalid: " + this.errorsText();
           if (this.opts.validateSchema === "log")
             this.logger.error(P);
           else
             throw new Error(P);
         }
-        return h;
+        return p;
       }
       // Get compiled schema by `key` or `ref`.
       // (`key` that was passed to `addSchema` or full schema reference - `schema.$id` or resolved id)
@@ -3032,8 +3032,8 @@ function Qa() {
         for (; typeof (C = b.call(this, j)) == "string"; )
           j = C;
         if (C === void 0) {
-          const { schemaId: N } = this.opts, h = new o.SchemaEnv({ schema: {}, schemaId: N });
-          if (C = o.resolveSchema.call(this, h, j), !C)
+          const { schemaId: N } = this.opts, p = new o.SchemaEnv({ schema: {}, schemaId: N });
+          if (C = o.resolveSchema.call(this, p, j), !C)
             return;
           this.refs[j] = C;
         }
@@ -3057,7 +3057,7 @@ function Qa() {
             const C = j;
             this._cache.delete(C);
             let N = j[this.opts.schemaId];
-            return N && (N = (0, p.normalizeId)(N), delete this.schemas[N], delete this.refs[N]), this;
+            return N && (N = (0, h.normalizeId)(N), delete this.schemas[N], delete this.refs[N]), this;
           }
           default:
             throw new Error("ajv.removeSchema: invalid parameter");
@@ -3081,12 +3081,12 @@ function Qa() {
         if (B.call(this, N, C), !C)
           return (0, d.eachItem)(N, (P) => Q.call(this, P)), this;
         ae.call(this, C);
-        const h = {
+        const p = {
           ...C,
           type: (0, y.getJSONTypes)(C.type),
           schemaType: (0, y.getJSONTypes)(C.schemaType)
         };
-        return (0, d.eachItem)(N, h.type.length === 0 ? (P) => Q.call(this, P, h) : (P) => h.type.forEach((R) => Q.call(this, P, h, R))), this;
+        return (0, d.eachItem)(N, p.type.length === 0 ? (P) => Q.call(this, P, p) : (P) => p.type.forEach((R) => Q.call(this, P, p, R))), this;
       }
       getKeyword(j) {
         const C = this.RULES.all[j];
@@ -3097,8 +3097,8 @@ function Qa() {
         const { RULES: C } = this;
         delete C.keywords[j], delete C.all[j];
         for (const N of C.rules) {
-          const h = N.rules.findIndex((P) => P.keyword === j);
-          h >= 0 && N.rules.splice(h, 1);
+          const p = N.rules.findIndex((P) => P.keyword === j);
+          p >= 0 && N.rules.splice(p, 1);
         }
         return this;
       }
@@ -3107,13 +3107,13 @@ function Qa() {
         return typeof C == "string" && (C = new RegExp(C)), this.formats[j] = C, this;
       }
       errorsText(j = this.errors, { separator: C = ", ", dataVar: N = "data" } = {}) {
-        return !j || j.length === 0 ? "No errors" : j.map((h) => `${N}${h.instancePath} ${h.message}`).reduce((h, P) => h + C + P);
+        return !j || j.length === 0 ? "No errors" : j.map((p) => `${N}${p.instancePath} ${p.message}`).reduce((p, P) => p + C + P);
       }
       $dataMetaSchema(j, C) {
         const N = this.RULES.all;
         j = JSON.parse(JSON.stringify(j));
-        for (const h of C) {
-          const P = h.split("/").slice(1);
+        for (const p of C) {
+          const P = p.split("/").slice(1);
           let R = j;
           for (const U of P)
             R = R[U];
@@ -3129,11 +3129,11 @@ function Qa() {
       }
       _removeAllSchemas(j, C) {
         for (const N in j) {
-          const h = j[N];
-          (!C || C.test(N)) && (typeof h == "string" ? delete j[N] : h && !h.meta && (this._cache.delete(h.schema), delete j[N]));
+          const p = j[N];
+          (!C || C.test(N)) && (typeof p == "string" ? delete j[N] : p && !p.meta && (this._cache.delete(p.schema), delete j[N]));
         }
       }
-      _addSchema(j, C, N, h = this.opts.validateSchema, P = this.opts.addUsedSchema) {
+      _addSchema(j, C, N, p = this.opts.validateSchema, P = this.opts.addUsedSchema) {
         let R;
         const { schemaId: U } = this.opts;
         if (typeof j == "object")
@@ -3147,9 +3147,9 @@ function Qa() {
         let K = this._cache.get(j);
         if (K !== void 0)
           return K;
-        N = (0, p.normalizeId)(R || N);
-        const Y = p.getSchemaRefs.call(this, j, N);
-        return K = new o.SchemaEnv({ schema: j, schemaId: U, meta: C, baseId: N, localRefs: Y }), this._cache.set(K.schema, K), P && !N.startsWith("#") && (N && this._checkUnique(N), this.refs[N] = K), h && this.validateSchema(j, !0), K;
+        N = (0, h.normalizeId)(R || N);
+        const Y = h.getSchemaRefs.call(this, j, N);
+        return K = new o.SchemaEnv({ schema: j, schemaId: U, meta: C, baseId: N, localRefs: Y }), this._cache.set(K.schema, K), P && !N.startsWith("#") && (N && this._checkUnique(N), this.refs[N] = K), p && this.validateSchema(j, !0), K;
       }
       _checkUnique(j) {
         if (this.schemas[j] || this.refs[j])
@@ -3172,13 +3172,13 @@ function Qa() {
     }
     m.ValidationError = n.default, m.MissingRefError = a.default, e.default = m;
     function _(M, j, C, N = "error") {
-      for (const h in M) {
-        const P = h;
-        P in j && this.logger[N](`${C}: option ${h}. ${M[P]}`);
+      for (const p in M) {
+        const P = p;
+        P in j && this.logger[N](`${C}: option ${p}. ${M[P]}`);
       }
     }
     function b(M) {
-      return M = (0, p.normalizeId)(M), this.schemas[M] || this.refs[M];
+      return M = (0, h.normalizeId)(M), this.schemas[M] || this.refs[M];
     }
     function E() {
       const M = this.opts.schemas;
@@ -3238,11 +3238,11 @@ function Qa() {
     }
     function Q(M, j, C) {
       var N;
-      const h = j?.post;
-      if (C && h)
+      const p = j?.post;
+      if (C && p)
         throw new Error('keyword with "post" flag cannot have "type"');
       const { RULES: P } = this;
-      let R = h ? P.post : P.rules.find(({ type: K }) => K === C);
+      let R = p ? P.post : P.rules.find(({ type: K }) => K === C);
       if (R || (R = { type: C, rules: [] }, P.rules.push(R)), P.keywords[M] = !0, !j)
         return;
       const U = {
@@ -3256,7 +3256,7 @@ function Qa() {
       j.before ? oe.call(this, R, U, j.before) : R.rules.push(U), P.all[M] = U, (N = j.implements) === null || N === void 0 || N.forEach((K) => this.addKeyword(K));
     }
     function oe(M, j, C) {
-      const N = M.rules.findIndex((h) => h.keyword === C);
+      const N = M.rules.findIndex((p) => p.keyword === C);
       N >= 0 ? M.rules.splice(N, 0, j) : (M.rules.push(j), this.logger.warn(`rule ${C} is not defined`));
     }
     function ae(M) {
@@ -3283,11 +3283,11 @@ function ei() {
   };
   return ot.default = e, ot;
 }
-var Ie = {}, pn;
+var Ie = {}, hn;
 function ti() {
-  if (pn) return Ie;
-  pn = 1, Object.defineProperty(Ie, "__esModule", { value: !0 }), Ie.callRef = Ie.getValidate = void 0;
-  const e = Jt(), t = Se(), r = G(), n = Ae(), a = Or(), s = ee(), o = {
+  if (hn) return Ie;
+  hn = 1, Object.defineProperty(Ie, "__esModule", { value: !0 }), Ie.callRef = Ie.getValidate = void 0;
+  const e = Ht(), t = Se(), r = G(), n = Ae(), a = Or(), s = ee(), o = {
     keyword: "$ref",
     schemaType: "string",
     code(y) {
@@ -3302,13 +3302,13 @@ function ti() {
       return b(c);
       function m() {
         if (w === i)
-          return p(y, g, w, w.$async);
+          return h(y, g, w, w.$async);
         const E = d.scopeValue("root", { ref: i });
-        return p(y, (0, r._)`${E}.validate`, i, i.$async);
+        return h(y, (0, r._)`${E}.validate`, i, i.$async);
       }
       function _(E) {
         const I = u(y, E);
-        p(y, I, E, E.$async);
+        h(y, I, E, E.$async);
       }
       function b(E) {
         const I = d.scopeValue("schema", f.code.source === !0 ? { ref: E, code: (0, r.stringify)(E) } : { ref: E }), q = d.name("valid"), D = y.subschema({
@@ -3327,7 +3327,7 @@ function ti() {
     return d.validate ? v.scopeValue("validate", { ref: d.validate }) : (0, r._)`${v.scopeValue("wrapper", { ref: d })}.validate`;
   }
   Ie.getValidate = u;
-  function p(y, d, v, $) {
+  function h(y, d, v, $) {
     const { gen: S, it: w } = y, { allErrors: g, schemaEnv: f, opts: l } = w, i = l.passContext ? n.default.this : r.nil;
     $ ? c() : m();
     function c() {
@@ -3368,12 +3368,12 @@ function ti() {
         }
     }
   }
-  return Ie.callRef = p, Ie.default = o, Ie;
+  return Ie.callRef = h, Ie.default = o, Ie;
 }
-var hn;
+var pn;
 function ri() {
-  if (hn) return it;
-  hn = 1, Object.defineProperty(it, "__esModule", { value: !0 });
+  if (pn) return it;
+  pn = 1, Object.defineProperty(it, "__esModule", { value: !0 });
   const e = ei(), t = ti(), r = [
     "$schema",
     "$id",
@@ -3405,8 +3405,8 @@ function ni() {
     $data: !0,
     error: n,
     code(s) {
-      const { keyword: o, data: u, schemaCode: p } = s;
-      s.fail$data((0, e._)`${u} ${r[o].fail} ${p} || isNaN(${u})`);
+      const { keyword: o, data: u, schemaCode: h } = s;
+      s.fail$data((0, e._)`${u} ${r[o].fail} ${h} || isNaN(${u})`);
     }
   };
   return ct.default = a, ct;
@@ -3425,7 +3425,7 @@ function si() {
       params: ({ schemaCode: n }) => (0, e._)`{multipleOf: ${n}}`
     },
     code(n) {
-      const { gen: a, data: s, schemaCode: o, it: u } = n, p = u.opts.multipleOfPrecision, y = a.let("res"), d = p ? (0, e._)`Math.abs(Math.round(${y}) - ${y}) > 1e-${p}` : (0, e._)`${y} !== parseInt(${y})`;
+      const { gen: a, data: s, schemaCode: o, it: u } = n, h = u.opts.multipleOfPrecision, y = a.let("res"), d = h ? (0, e._)`Math.abs(Math.round(${y}) - ${y}) > 1e-${h}` : (0, e._)`${y} !== parseInt(${y})`;
       n.fail$data((0, e._)`(${o} === 0 || (${y} = ${s}/${o}, ${d}))`);
     }
   };
@@ -3461,16 +3461,16 @@ function ii() {
       params: ({ schemaCode: s }) => (0, e._)`{limit: ${s}}`
     },
     code(s) {
-      const { keyword: o, data: u, schemaCode: p, it: y } = s, d = o === "maxLength" ? e.operators.GT : e.operators.LT, v = y.opts.unicode === !1 ? (0, e._)`${u}.length` : (0, e._)`${(0, t.useFunc)(s.gen, r.default)}(${u})`;
-      s.fail$data((0, e._)`${v} ${d} ${p}`);
+      const { keyword: o, data: u, schemaCode: h, it: y } = s, d = o === "maxLength" ? e.operators.GT : e.operators.LT, v = y.opts.unicode === !1 ? (0, e._)`${u}.length` : (0, e._)`${(0, t.useFunc)(s.gen, r.default)}(${u})`;
+      s.fail$data((0, e._)`${v} ${d} ${h}`);
     }
   };
   return ft.default = a, ft;
 }
-var pt = {}, _n;
+var ht = {}, _n;
 function oi() {
-  if (_n) return pt;
-  _n = 1, Object.defineProperty(pt, "__esModule", { value: !0 });
+  if (_n) return ht;
+  _n = 1, Object.defineProperty(ht, "__esModule", { value: !0 });
   const e = Se(), t = G(), n = {
     keyword: "pattern",
     type: "string",
@@ -3481,16 +3481,16 @@ function oi() {
       params: ({ schemaCode: a }) => (0, t._)`{pattern: ${a}}`
     },
     code(a) {
-      const { data: s, $data: o, schema: u, schemaCode: p, it: y } = a, d = y.opts.unicodeRegExp ? "u" : "", v = o ? (0, t._)`(new RegExp(${p}, ${d}))` : (0, e.usePattern)(a, u);
+      const { data: s, $data: o, schema: u, schemaCode: h, it: y } = a, d = y.opts.unicodeRegExp ? "u" : "", v = o ? (0, t._)`(new RegExp(${h}, ${d}))` : (0, e.usePattern)(a, u);
       a.fail$data((0, t._)`!${v}.test(${s})`);
     }
   };
-  return pt.default = n, pt;
+  return ht.default = n, ht;
 }
-var ht = {}, bn;
+var pt = {}, bn;
 function ui() {
-  if (bn) return ht;
-  bn = 1, Object.defineProperty(ht, "__esModule", { value: !0 });
+  if (bn) return pt;
+  bn = 1, Object.defineProperty(pt, "__esModule", { value: !0 });
   const e = G(), r = {
     keyword: ["maxProperties", "minProperties"],
     type: "object",
@@ -3508,7 +3508,7 @@ function ui() {
       n.fail$data((0, e._)`Object.keys(${s}).length ${u} ${o}`);
     }
   };
-  return ht.default = r, ht;
+  return pt.default = r, pt;
 }
 var mt = {}, $n;
 function ci() {
@@ -3524,7 +3524,7 @@ function ci() {
       params: ({ params: { missingProperty: s } }) => (0, t._)`{missingProperty: ${s}}`
     },
     code(s) {
-      const { gen: o, schema: u, schemaCode: p, data: y, $data: d, it: v } = s, { opts: $ } = v;
+      const { gen: o, schema: u, schemaCode: h, data: y, $data: d, it: v } = s, { opts: $ } = v;
       if (!d && u.length === 0)
         return;
       const S = u.length >= $.loopRequired;
@@ -3552,12 +3552,12 @@ function ci() {
           o.if((0, e.checkMissingProp)(s, u, i)), (0, e.reportMissingProp)(s, i), o.else();
       }
       function f() {
-        o.forOf("prop", p, (i) => {
+        o.forOf("prop", h, (i) => {
           s.setParams({ missingProperty: i }), o.if((0, e.noPropertyInData)(o, y, i, $.ownProperties), () => s.error());
         });
       }
       function l(i, c) {
-        s.setParams({ missingProperty: i }), o.forOf(i, p, () => {
+        s.setParams({ missingProperty: i }), o.forOf(i, h, () => {
           o.assign(c, (0, e.propertyInData)(o, y, i, $.ownProperties)), o.if((0, t.not)(c), () => {
             s.error(), o.break();
           });
@@ -3611,13 +3611,13 @@ function fi() {
       params: ({ params: { i: o, j: u } }) => (0, t._)`{i: ${o}, j: ${u}}`
     },
     code(o) {
-      const { gen: u, data: p, $data: y, schema: d, parentSchema: v, schemaCode: $, it: S } = o;
+      const { gen: u, data: h, $data: y, schema: d, parentSchema: v, schemaCode: $, it: S } = o;
       if (!y && !d)
         return;
       const w = u.let("valid"), g = v.items ? (0, e.getSchemaTypes)(v.items) : [];
       o.block$data(w, f, (0, t._)`${$} === false`), o.ok(w);
       function f() {
-        const m = u.let("i", (0, t._)`${p}.length`), _ = u.let("j");
+        const m = u.let("i", (0, t._)`${h}.length`), _ = u.let("j");
         o.setParams({ i: m, j: _ }), u.assign(w, !0), u.if((0, t._)`${m} > 1`, () => (l() ? i : c)(m, _));
       }
       function l() {
@@ -3626,14 +3626,14 @@ function fi() {
       function i(m, _) {
         const b = u.name("item"), E = (0, e.checkDataTypes)(g, b, S.opts.strictNumbers, e.DataType.Wrong), I = u.const("indices", (0, t._)`{}`);
         u.for((0, t._)`;${m}--;`, () => {
-          u.let(b, (0, t._)`${p}[${m}]`), u.if(E, (0, t._)`continue`), g.length > 1 && u.if((0, t._)`typeof ${b} == "string"`, (0, t._)`${b} += "_"`), u.if((0, t._)`typeof ${I}[${b}] == "number"`, () => {
+          u.let(b, (0, t._)`${h}[${m}]`), u.if(E, (0, t._)`continue`), g.length > 1 && u.if((0, t._)`typeof ${b} == "string"`, (0, t._)`${b} += "_"`), u.if((0, t._)`typeof ${I}[${b}] == "number"`, () => {
             u.assign(_, (0, t._)`${I}[${b}]`), o.error(), u.assign(w, !1).break();
           }).code((0, t._)`${I}[${b}] = ${m}`);
         });
       }
       function c(m, _) {
         const b = (0, r.useFunc)(u, n.default), E = u.name("outer");
-        u.label(E).for((0, t._)`;${m}--;`, () => u.for((0, t._)`${_} = ${m}; ${_}--;`, () => u.if((0, t._)`${b}(${p}[${m}], ${p}[${_}])`, () => {
+        u.label(E).for((0, t._)`;${m}--;`, () => u.for((0, t._)`${_} = ${m}; ${_}--;`, () => u.if((0, t._)`${b}(${h}[${m}], ${h}[${_}])`, () => {
           o.error(), u.assign(w, !1).break(E);
         })));
       }
@@ -3653,14 +3653,14 @@ function di() {
       params: ({ schemaCode: s }) => (0, e._)`{allowedValue: ${s}}`
     },
     code(s) {
-      const { gen: o, data: u, $data: p, schemaCode: y, schema: d } = s;
-      p || d && typeof d == "object" ? s.fail$data((0, e._)`!${(0, t.useFunc)(o, r.default)}(${u}, ${y})`) : s.fail((0, e._)`${d} !== ${u}`);
+      const { gen: o, data: u, $data: h, schemaCode: y, schema: d } = s;
+      h || d && typeof d == "object" ? s.fail$data((0, e._)`!${(0, t.useFunc)(o, r.default)}(${u}, ${y})`) : s.fail((0, e._)`${d} !== ${u}`);
     }
   };
   return _t.default = a, _t;
 }
 var bt = {}, On;
-function pi() {
+function hi() {
   if (On) return bt;
   On = 1, Object.defineProperty(bt, "__esModule", { value: !0 });
   const e = G(), t = ee(), r = jr(), a = {
@@ -3672,14 +3672,14 @@ function pi() {
       params: ({ schemaCode: s }) => (0, e._)`{allowedValues: ${s}}`
     },
     code(s) {
-      const { gen: o, data: u, $data: p, schema: y, schemaCode: d, it: v } = s;
-      if (!p && y.length === 0)
+      const { gen: o, data: u, $data: h, schema: y, schemaCode: d, it: v } = s;
+      if (!h && y.length === 0)
         throw new Error("enum must have non-empty array");
       const $ = y.length >= v.opts.loopEnum;
       let S;
       const w = () => S ?? (S = (0, t.useFunc)(o, r.default));
       let g;
-      if ($ || p)
+      if ($ || h)
         g = o.let("valid"), s.block$data(g, f);
       else {
         if (!Array.isArray(y))
@@ -3700,10 +3700,10 @@ function pi() {
   return bt.default = a, bt;
 }
 var jn;
-function hi() {
+function pi() {
   if (jn) return ut;
   jn = 1, Object.defineProperty(ut, "__esModule", { value: !0 });
-  const e = ni(), t = si(), r = ii(), n = oi(), a = ui(), s = ci(), o = li(), u = fi(), p = di(), y = pi(), d = [
+  const e = ni(), t = si(), r = ii(), n = oi(), a = ui(), s = ci(), o = li(), u = fi(), h = di(), y = hi(), d = [
     // number
     e.default,
     t.default,
@@ -3719,7 +3719,7 @@ function hi() {
     // any
     { keyword: "type", schemaType: ["string", "array"] },
     { keyword: "nullable", schemaType: "boolean" },
-    p.default,
+    h.default,
     y.default
   ];
   return ut.default = d, ut;
@@ -3738,21 +3738,21 @@ function Os() {
       params: ({ params: { len: s } }) => (0, e._)`{limit: ${s}}`
     },
     code(s) {
-      const { parentSchema: o, it: u } = s, { items: p } = o;
-      if (!Array.isArray(p)) {
+      const { parentSchema: o, it: u } = s, { items: h } = o;
+      if (!Array.isArray(h)) {
         (0, t.checkStrictMode)(u, '"additionalItems" is ignored when "items" is not an array of schemas');
         return;
       }
-      a(s, p);
+      a(s, h);
     }
   };
   function a(s, o) {
-    const { gen: u, schema: p, data: y, keyword: d, it: v } = s;
+    const { gen: u, schema: h, data: y, keyword: d, it: v } = s;
     v.items = !0;
     const $ = u.const("len", (0, e._)`${y}.length`);
-    if (p === !1)
+    if (h === !1)
       s.setParams({ len: o.length }), s.pass((0, e._)`${$} <= ${o.length}`);
-    else if (typeof p == "object" && !(0, t.alwaysValidSchema)(v, p)) {
+    else if (typeof h == "object" && !(0, t.alwaysValidSchema)(v, h)) {
       const w = u.var("valid", (0, e._)`${$} <= ${o.length}`);
       u.if((0, e.not)(w), () => S(w)), s.ok(w);
     }
@@ -3781,11 +3781,11 @@ function js() {
     }
   };
   function a(s, o, u = s.schema) {
-    const { gen: p, parentSchema: y, data: d, keyword: v, it: $ } = s;
-    g(y), $.opts.unevaluated && u.length && $.items !== !0 && ($.items = t.mergeEvaluated.items(p, u.length, $.items));
-    const S = p.name("valid"), w = p.const("len", (0, e._)`${d}.length`);
+    const { gen: h, parentSchema: y, data: d, keyword: v, it: $ } = s;
+    g(y), $.opts.unevaluated && u.length && $.items !== !0 && ($.items = t.mergeEvaluated.items(h, u.length, $.items));
+    const S = h.name("valid"), w = h.const("len", (0, e._)`${d}.length`);
     u.forEach((f, l) => {
-      (0, t.alwaysValidSchema)($, f) || (p.if((0, e._)`${w} > ${l}`, () => s.subschema({
+      (0, t.alwaysValidSchema)($, f) || (h.if((0, e._)`${w} > ${l}`, () => s.subschema({
         keyword: v,
         schemaProp: l,
         dataProp: l
@@ -3828,7 +3828,7 @@ function yi() {
       params: ({ params: { len: o } }) => (0, e._)`{limit: ${o}}`
     },
     code(o) {
-      const { schema: u, parentSchema: p, it: y } = o, { prefixItems: d } = p;
+      const { schema: u, parentSchema: h, it: y } = o, { prefixItems: d } = h;
       y.items = !0, !(0, t.alwaysValidSchema)(y, u) && (d ? (0, n.validateAdditionalItems)(o, d) : o.ok((0, r.validateArray)(o)));
     }
   };
@@ -3849,11 +3849,11 @@ function gi() {
       params: ({ params: { min: a, max: s } }) => s === void 0 ? (0, e._)`{minContains: ${a}}` : (0, e._)`{minContains: ${a}, maxContains: ${s}}`
     },
     code(a) {
-      const { gen: s, schema: o, parentSchema: u, data: p, it: y } = a;
+      const { gen: s, schema: o, parentSchema: u, data: h, it: y } = a;
       let d, v;
       const { minContains: $, maxContains: S } = u;
       y.opts.next ? (d = $ === void 0 ? 1 : $, v = S) : d = 1;
-      const w = s.const("len", (0, e._)`${p}.length`);
+      const w = s.const("len", (0, e._)`${h}.length`);
       if (a.setParams({ min: d, max: v }), v === void 0 && d === 0) {
         (0, t.checkStrictMode)(y, '"minContains" == 0 without "maxContains": "contains" keyword ignored');
         return;
@@ -3869,7 +3869,7 @@ function gi() {
       }
       y.items = !0;
       const g = s.name("valid");
-      v === void 0 && d === 1 ? l(g, () => s.if(g, () => s.break())) : d === 0 ? (s.let(g, !0), v !== void 0 && s.if((0, e._)`${p}.length > 0`, f)) : (s.let(g, !1), f()), a.result(g, () => a.reset());
+      v === void 0 && d === 1 ? l(g, () => s.if(g, () => s.break())) : d === 0 ? (s.let(g, !0), v !== void 0 && s.if((0, e._)`${h}.length > 0`, f)) : (s.let(g, !1), f()), a.result(g, () => a.reset());
       function f() {
         const c = s.name("_valid"), m = s.let("count", 0);
         l(c, () => s.if(c, () => i(m)));
@@ -3897,11 +3897,11 @@ function vi() {
     Object.defineProperty(e, "__esModule", { value: !0 }), e.validateSchemaDeps = e.validatePropertyDeps = e.error = void 0;
     const t = G(), r = ee(), n = Se();
     e.error = {
-      message: ({ params: { property: p, depsCount: y, deps: d } }) => {
+      message: ({ params: { property: h, depsCount: y, deps: d } }) => {
         const v = y === 1 ? "property" : "properties";
-        return (0, t.str)`must have ${v} ${d} when property ${p} is present`;
+        return (0, t.str)`must have ${v} ${d} when property ${h} is present`;
       },
-      params: ({ params: { property: p, depsCount: y, deps: d, missingProperty: v } }) => (0, t._)`{property: ${p},
+      params: ({ params: { property: h, depsCount: y, deps: d, missingProperty: v } }) => (0, t._)`{property: ${h},
     missingProperty: ${v},
     depsCount: ${y},
     deps: ${d}}`
@@ -3912,23 +3912,23 @@ function vi() {
       type: "object",
       schemaType: "object",
       error: e.error,
-      code(p) {
-        const [y, d] = s(p);
-        o(p, y), u(p, d);
+      code(h) {
+        const [y, d] = s(h);
+        o(h, y), u(h, d);
       }
     };
-    function s({ schema: p }) {
+    function s({ schema: h }) {
       const y = {}, d = {};
-      for (const v in p) {
+      for (const v in h) {
         if (v === "__proto__")
           continue;
-        const $ = Array.isArray(p[v]) ? y : d;
-        $[v] = p[v];
+        const $ = Array.isArray(h[v]) ? y : d;
+        $[v] = h[v];
       }
       return [y, d];
     }
-    function o(p, y = p.schema) {
-      const { gen: d, data: v, it: $ } = p;
+    function o(h, y = h.schema) {
+      const { gen: d, data: v, it: $ } = h;
       if (Object.keys(y).length === 0)
         return;
       const S = d.let("missing");
@@ -3937,29 +3937,29 @@ function vi() {
         if (g.length === 0)
           continue;
         const f = (0, n.propertyInData)(d, v, w, $.opts.ownProperties);
-        p.setParams({
+        h.setParams({
           property: w,
           depsCount: g.length,
           deps: g.join(", ")
         }), $.allErrors ? d.if(f, () => {
           for (const l of g)
-            (0, n.checkReportMissingProp)(p, l);
-        }) : (d.if((0, t._)`${f} && (${(0, n.checkMissingProp)(p, g, S)})`), (0, n.reportMissingProp)(p, S), d.else());
+            (0, n.checkReportMissingProp)(h, l);
+        }) : (d.if((0, t._)`${f} && (${(0, n.checkMissingProp)(h, g, S)})`), (0, n.reportMissingProp)(h, S), d.else());
       }
     }
     e.validatePropertyDeps = o;
-    function u(p, y = p.schema) {
-      const { gen: d, data: v, keyword: $, it: S } = p, w = d.name("valid");
+    function u(h, y = h.schema) {
+      const { gen: d, data: v, keyword: $, it: S } = h, w = d.name("valid");
       for (const g in y)
         (0, r.alwaysValidSchema)(S, y[g]) || (d.if(
           (0, n.propertyInData)(d, v, g, S.opts.ownProperties),
           () => {
-            const f = p.subschema({ keyword: $, schemaProp: g }, w);
-            p.mergeValidEvaluated(f, w);
+            const f = h.subschema({ keyword: $, schemaProp: g }, w);
+            h.mergeValidEvaluated(f, w);
           },
           () => d.var(w, !0)
           // TODO var
-        ), p.ok(w));
+        ), h.ok(w));
     }
     e.validateSchemaDeps = u, e.default = a;
   }(dr)), dr;
@@ -3977,8 +3977,8 @@ function _i() {
       params: ({ params: a }) => (0, e._)`{propertyName: ${a.propertyName}}`
     },
     code(a) {
-      const { gen: s, schema: o, data: u, it: p } = a;
-      if ((0, t.alwaysValidSchema)(p, o))
+      const { gen: s, schema: o, data: u, it: h } = a;
+      if ((0, t.alwaysValidSchema)(h, o))
         return;
       const y = s.name("valid");
       s.forIn("key", u, (d) => {
@@ -3989,7 +3989,7 @@ function _i() {
           propertyName: d,
           compositeRule: !0
         }, y), s.if((0, e.not)(y), () => {
-          a.error(!0), p.allErrors || s.break();
+          a.error(!0), h.allErrors || s.break();
         });
       }), a.ok(y);
     }
@@ -4011,11 +4011,11 @@ function ks() {
       params: ({ params: o }) => (0, t._)`{additionalProperty: ${o.additionalProperty}}`
     },
     code(o) {
-      const { gen: u, schema: p, parentSchema: y, data: d, errsCount: v, it: $ } = o;
+      const { gen: u, schema: h, parentSchema: y, data: d, errsCount: v, it: $ } = o;
       if (!v)
         throw new Error("ajv implementation error");
       const { allErrors: S, opts: w } = $;
-      if ($.props = !0, w.removeAdditional !== "all" && (0, n.alwaysValidSchema)($, p))
+      if ($.props = !0, w.removeAdditional !== "all" && (0, n.alwaysValidSchema)($, h))
         return;
       const g = (0, e.allSchemaProperties)(y.properties), f = (0, e.allSchemaProperties)(y.patternProperties);
       l(), o.ok((0, t._)`${v} === ${r.default.errors}`);
@@ -4036,15 +4036,15 @@ function ks() {
         u.code((0, t._)`delete ${d}[${b}]`);
       }
       function m(b) {
-        if (w.removeAdditional === "all" || w.removeAdditional && p === !1) {
+        if (w.removeAdditional === "all" || w.removeAdditional && h === !1) {
           c(b);
           return;
         }
-        if (p === !1) {
+        if (h === !1) {
           o.setParams({ additionalProperty: b }), o.error(), S || u.break();
           return;
         }
-        if (typeof p == "object" && !(0, n.alwaysValidSchema)($, p)) {
+        if (typeof h == "object" && !(0, n.alwaysValidSchema)($, h)) {
           const E = u.name("valid");
           w.removeAdditional === "failing" ? (_(b, E, !1), u.if((0, t.not)(E), () => {
             o.reset(), c(b);
@@ -4071,13 +4071,13 @@ var jt = {}, Mn;
 function bi() {
   if (Mn) return jt;
   Mn = 1, Object.defineProperty(jt, "__esModule", { value: !0 });
-  const e = Ht(), t = Se(), r = ee(), n = ks(), a = {
+  const e = Jt(), t = Se(), r = ee(), n = ks(), a = {
     keyword: "properties",
     type: "object",
     schemaType: "object",
     code(s) {
-      const { gen: o, schema: u, parentSchema: p, data: y, it: d } = s;
-      d.opts.removeAdditional === "all" && p.additionalProperties === void 0 && n.default.code(new e.KeywordCxt(d, n.default, "additionalProperties"));
+      const { gen: o, schema: u, parentSchema: h, data: y, it: d } = s;
+      d.opts.removeAdditional === "all" && h.additionalProperties === void 0 && n.default.code(new e.KeywordCxt(d, n.default, "additionalProperties"));
       const v = (0, t.allSchemaProperties)(u);
       for (const f of v)
         d.definedProperties.add(f);
@@ -4111,7 +4111,7 @@ function $i() {
     type: "object",
     schemaType: "object",
     code(s) {
-      const { gen: o, schema: u, data: p, parentSchema: y, it: d } = s, { opts: v } = d, $ = (0, e.allSchemaProperties)(u), S = $.filter((m) => (0, r.alwaysValidSchema)(d, u[m]));
+      const { gen: o, schema: u, data: h, parentSchema: y, it: d } = s, { opts: v } = d, $ = (0, e.allSchemaProperties)(u), S = $.filter((m) => (0, r.alwaysValidSchema)(d, u[m]));
       if ($.length === 0 || S.length === $.length && (!d.opts.unevaluated || d.props === !0))
         return;
       const w = v.strictSchema && !v.allowMatchingProperties && y.properties, g = o.name("valid");
@@ -4127,7 +4127,7 @@ function $i() {
           new RegExp(m).test(_) && (0, r.checkStrictMode)(d, `property ${_} matches pattern ${m} (use allowMatchingProperties)`);
       }
       function c(m) {
-        o.forIn("key", p, (_) => {
+        o.forIn("key", h, (_) => {
           o.if((0, t._)`${(0, e.usePattern)(s, m)}.test(${_})`, () => {
             const b = S.includes(m);
             b || s.subschema({
@@ -4195,17 +4195,17 @@ function Pi() {
       params: ({ params: a }) => (0, e._)`{passingSchemas: ${a.passing}}`
     },
     code(a) {
-      const { gen: s, schema: o, parentSchema: u, it: p } = a;
+      const { gen: s, schema: o, parentSchema: u, it: h } = a;
       if (!Array.isArray(o))
         throw new Error("ajv implementation error");
-      if (p.opts.discriminator && u.discriminator)
+      if (h.opts.discriminator && u.discriminator)
         return;
       const y = o, d = s.let("valid", !1), v = s.let("passing", null), $ = s.name("_valid");
       a.setParams({ passing: v }), s.block(S), a.result(d, () => a.reset(), () => a.error(!0));
       function S() {
         y.forEach((w, g) => {
           let f;
-          (0, t.alwaysValidSchema)(p, w) ? s.var($, !0) : f = a.subschema({
+          (0, t.alwaysValidSchema)(h, w) ? s.var($, !0) : f = a.subschema({
             keyword: "oneOf",
             schemaProp: g,
             compositeRule: !0
@@ -4230,10 +4230,10 @@ function Ei() {
       if (!Array.isArray(a))
         throw new Error("ajv implementation error");
       const o = n.name("valid");
-      a.forEach((u, p) => {
+      a.forEach((u, h) => {
         if ((0, e.alwaysValidSchema)(s, u))
           return;
-        const y = r.subschema({ keyword: "allOf", schemaProp: p }, o);
+        const y = r.subschema({ keyword: "allOf", schemaProp: h }, o);
         r.ok(o), r.mergeEvaluated(y);
       });
     }
@@ -4253,9 +4253,9 @@ function Oi() {
       params: ({ params: s }) => (0, e._)`{failingKeyword: ${s.ifClause}}`
     },
     code(s) {
-      const { gen: o, parentSchema: u, it: p } = s;
-      u.then === void 0 && u.else === void 0 && (0, t.checkStrictMode)(p, '"if" without "then" and "else" is ignored');
-      const y = a(p, "then"), d = a(p, "else");
+      const { gen: o, parentSchema: u, it: h } = s;
+      u.then === void 0 && u.else === void 0 && (0, t.checkStrictMode)(h, '"if" without "then" and "else" is ignored');
+      const y = a(h, "then"), d = a(h, "else");
       if (!y && !d)
         return;
       const v = o.let("valid", !0), $ = o.name("_valid");
@@ -4304,7 +4304,7 @@ var Bn;
 function ki() {
   if (Bn) return $t;
   Bn = 1, Object.defineProperty($t, "__esModule", { value: !0 });
-  const e = Os(), t = mi(), r = js(), n = yi(), a = gi(), s = vi(), o = _i(), u = ks(), p = bi(), y = $i(), d = wi(), v = Si(), $ = Pi(), S = Ei(), w = Oi(), g = ji();
+  const e = Os(), t = mi(), r = js(), n = yi(), a = gi(), s = vi(), o = _i(), u = ks(), h = bi(), y = $i(), d = wi(), v = Si(), $ = Pi(), S = Ei(), w = Oi(), g = ji();
   function f(l = !1) {
     const i = [
       // any
@@ -4318,7 +4318,7 @@ function ki() {
       o.default,
       u.default,
       s.default,
-      p.default,
+      h.default,
       y.default
     ];
     return l ? i.push(t.default, n.default) : i.push(e.default, r.default), i.push(a.default), i;
@@ -4339,7 +4339,7 @@ function Ri() {
       params: ({ schemaCode: n }) => (0, e._)`{format: ${n}}`
     },
     code(n, a) {
-      const { gen: s, data: o, $data: u, schema: p, schemaCode: y, it: d } = n, { opts: v, errSchemaPath: $, schemaEnv: S, self: w } = d;
+      const { gen: s, data: o, $data: u, schema: h, schemaCode: y, it: d } = n, { opts: v, errSchemaPath: $, schemaEnv: S, self: w } = d;
       if (!v.validateFormats)
         return;
       u ? g() : f();
@@ -4358,7 +4358,7 @@ function Ri() {
         }
       }
       function f() {
-        const l = w.formats[p];
+        const l = w.formats[h];
         if (!l) {
           _();
           return;
@@ -4374,11 +4374,11 @@ function Ri() {
           }
           throw new Error(I());
           function I() {
-            return `unknown format "${p}" ignored in schema at path "${$}"`;
+            return `unknown format "${h}" ignored in schema at path "${$}"`;
           }
         }
         function b(I) {
-          const q = I instanceof RegExp ? (0, e.regexpCode)(I) : v.code.formats ? (0, e._)`${v.code.formats}${(0, e.getProperty)(p)}` : void 0, D = s.scopeValue("formats", { key: p, ref: I, code: q });
+          const q = I instanceof RegExp ? (0, e.regexpCode)(I) : v.code.formats ? (0, e._)`${v.code.formats}${(0, e.getProperty)(h)}` : void 0, D = s.scopeValue("formats", { key: h, ref: I, code: q });
           return typeof I == "object" && !(I instanceof RegExp) ? [I.type || "string", I.validate, (0, e._)`${D}.validate`] : ["string", I, D];
         }
         function E() {
@@ -4394,16 +4394,16 @@ function Ri() {
   };
   return Mt.default = r, Mt;
 }
-var Hn;
+var Jn;
 function Ni() {
-  if (Hn) return qt;
-  Hn = 1, Object.defineProperty(qt, "__esModule", { value: !0 });
+  if (Jn) return qt;
+  Jn = 1, Object.defineProperty(qt, "__esModule", { value: !0 });
   const t = [Ri().default];
   return qt.default = t, qt;
 }
-var qe = {}, Jn;
+var qe = {}, Hn;
 function Ii() {
-  return Jn || (Jn = 1, Object.defineProperty(qe, "__esModule", { value: !0 }), qe.contentVocabulary = qe.metadataVocabulary = void 0, qe.metadataVocabulary = [
+  return Hn || (Hn = 1, Object.defineProperty(qe, "__esModule", { value: !0 }), qe.contentVocabulary = qe.metadataVocabulary = void 0, qe.metadataVocabulary = [
     "title",
     "description",
     "default",
@@ -4421,7 +4421,7 @@ var Gn;
 function Ai() {
   if (Gn) return at;
   Gn = 1, Object.defineProperty(at, "__esModule", { value: !0 });
-  const e = ri(), t = hi(), r = ki(), n = Ni(), a = Ii(), s = [
+  const e = ri(), t = pi(), r = ki(), n = Ni(), a = Ii(), s = [
     e.default,
     t.default,
     (0, r.default)(),
@@ -4431,29 +4431,29 @@ function Ai() {
   ];
   return at.default = s, at;
 }
-var Vt = {}, He = {}, xn;
+var Vt = {}, Je = {}, xn;
 function Ci() {
-  if (xn) return He;
-  xn = 1, Object.defineProperty(He, "__esModule", { value: !0 }), He.DiscrError = void 0;
+  if (xn) return Je;
+  xn = 1, Object.defineProperty(Je, "__esModule", { value: !0 }), Je.DiscrError = void 0;
   var e;
   return function(t) {
     t.Tag = "tag", t.Mapping = "mapping";
-  }(e || (He.DiscrError = e = {})), He;
+  }(e || (Je.DiscrError = e = {})), Je;
 }
 var Xn;
 function Ti() {
   if (Xn) return Vt;
   Xn = 1, Object.defineProperty(Vt, "__esModule", { value: !0 });
-  const e = G(), t = Ci(), r = Or(), n = Jt(), a = ee(), o = {
+  const e = G(), t = Ci(), r = Or(), n = Ht(), a = ee(), o = {
     keyword: "discriminator",
     type: "object",
     schemaType: "object",
     error: {
-      message: ({ params: { discrError: u, tagName: p } }) => u === t.DiscrError.Tag ? `tag "${p}" must be string` : `value of tag "${p}" must be in oneOf`,
-      params: ({ params: { discrError: u, tag: p, tagName: y } }) => (0, e._)`{error: ${u}, tag: ${y}, tagValue: ${p}}`
+      message: ({ params: { discrError: u, tagName: h } }) => u === t.DiscrError.Tag ? `tag "${h}" must be string` : `value of tag "${h}" must be in oneOf`,
+      params: ({ params: { discrError: u, tag: h, tagName: y } }) => (0, e._)`{error: ${u}, tag: ${y}, tagValue: ${h}}`
     },
     code(u) {
-      const { gen: p, data: y, schema: d, parentSchema: v, it: $ } = u, { oneOf: S } = v;
+      const { gen: h, data: y, schema: d, parentSchema: v, it: $ } = u, { oneOf: S } = v;
       if (!$.opts.discriminator)
         throw new Error("discriminator: requires discriminator option");
       const w = d.propertyName;
@@ -4463,17 +4463,17 @@ function Ti() {
         throw new Error("discriminator: mapping is not supported");
       if (!S)
         throw new Error("discriminator: requires oneOf keyword");
-      const g = p.let("valid", !1), f = p.const("tag", (0, e._)`${y}${(0, e.getProperty)(w)}`);
-      p.if((0, e._)`typeof ${f} == "string"`, () => l(), () => u.error(!1, { discrError: t.DiscrError.Tag, tag: f, tagName: w })), u.ok(g);
+      const g = h.let("valid", !1), f = h.const("tag", (0, e._)`${y}${(0, e.getProperty)(w)}`);
+      h.if((0, e._)`typeof ${f} == "string"`, () => l(), () => u.error(!1, { discrError: t.DiscrError.Tag, tag: f, tagName: w })), u.ok(g);
       function l() {
         const m = c();
-        p.if(!1);
+        h.if(!1);
         for (const _ in m)
-          p.elseIf((0, e._)`${f} === ${_}`), p.assign(g, i(m[_]));
-        p.else(), u.error(!1, { discrError: t.DiscrError.Mapping, tag: f, tagName: w }), p.endIf();
+          h.elseIf((0, e._)`${f} === ${_}`), h.assign(g, i(m[_]));
+        h.else(), u.error(!1, { discrError: t.DiscrError.Mapping, tag: f, tagName: w }), h.endIf();
       }
       function i(m) {
-        const _ = p.name("valid"), b = u.subschema({ keyword: "oneOf", schemaProp: m }, _);
+        const _ = h.name("valid"), b = u.subschema({ keyword: "oneOf", schemaProp: m }, _);
         return u.mergeEvaluated(b, e.Name), _;
       }
       function c() {
@@ -4531,7 +4531,7 @@ function Rs() {
   return Yn || (Yn = 1, function(e, t) {
     Object.defineProperty(t, "__esModule", { value: !0 }), t.MissingRefError = t.ValidationError = t.CodeGen = t.Name = t.nil = t.stringify = t.str = t._ = t.KeywordCxt = t.Ajv = void 0;
     const r = Qa(), n = Ai(), a = Ti(), s = Fi, o = ["/properties"], u = "http://json-schema.org/draft-07/schema";
-    class p extends r.default {
+    class h extends r.default {
       _addVocabularies() {
         super._addVocabularies(), n.default.forEach((w) => this.addVocabulary(w)), this.opts.discriminator && this.addKeyword(a.default);
       }
@@ -4545,8 +4545,8 @@ function Rs() {
         return this.opts.defaultMeta = super.defaultMeta() || (this.getSchema(u) ? u : void 0);
       }
     }
-    t.Ajv = p, e.exports = t = p, e.exports.Ajv = p, Object.defineProperty(t, "__esModule", { value: !0 }), t.default = p;
-    var y = Ht();
+    t.Ajv = h, e.exports = t = h, e.exports.Ajv = h, Object.defineProperty(t, "__esModule", { value: !0 }), t.default = h;
+    var y = Jt();
     Object.defineProperty(t, "KeywordCxt", { enumerable: !0, get: function() {
       return y.KeywordCxt;
     } });
@@ -4568,7 +4568,7 @@ function Rs() {
     Object.defineProperty(t, "ValidationError", { enumerable: !0, get: function() {
       return v.default;
     } });
-    var $ = Jt();
+    var $ = Ht();
     Object.defineProperty(t, "MissingRefError", { enumerable: !0, get: function() {
       return $.default;
     } });
@@ -4584,8 +4584,8 @@ function Ui() {
       formatExclusiveMaximum: { okStr: "<", ok: n.LT, fail: n.GTE },
       formatExclusiveMinimum: { okStr: ">", ok: n.GT, fail: n.LTE }
     }, s = {
-      message: ({ keyword: u, schemaCode: p }) => (0, r.str)`should be ${a[u].okStr} ${p}`,
-      params: ({ keyword: u, schemaCode: p }) => (0, r._)`{comparison: ${a[u].okStr}, limit: ${p}}`
+      message: ({ keyword: u, schemaCode: h }) => (0, r.str)`should be ${a[u].okStr} ${h}`,
+      params: ({ keyword: u, schemaCode: h }) => (0, r._)`{comparison: ${a[u].okStr}, limit: ${h}}`
     };
     e.formatLimitDefinition = {
       keyword: Object.keys(a),
@@ -4594,16 +4594,16 @@ function Ui() {
       $data: !0,
       error: s,
       code(u) {
-        const { gen: p, data: y, schemaCode: d, keyword: v, it: $ } = u, { opts: S, self: w } = $;
+        const { gen: h, data: y, schemaCode: d, keyword: v, it: $ } = u, { opts: S, self: w } = $;
         if (!S.validateFormats)
           return;
         const g = new t.KeywordCxt($, w.RULES.all.format.definition, "format");
         g.$data ? f() : l();
         function f() {
-          const c = p.scopeValue("formats", {
+          const c = h.scopeValue("formats", {
             ref: w.formats,
             code: S.code.formats
-          }), m = p.const("fmt", (0, r._)`${c}[${g.schemaCode}]`);
+          }), m = h.const("fmt", (0, r._)`${c}[${g.schemaCode}]`);
           u.fail$data((0, r.or)((0, r._)`typeof ${m} != "object"`, (0, r._)`${m} instanceof RegExp`, (0, r._)`typeof ${m}.compare != "function"`, i(m)));
         }
         function l() {
@@ -4612,7 +4612,7 @@ function Ui() {
             return;
           if (typeof m != "object" || m instanceof RegExp || typeof m.compare != "function")
             throw new Error(`"${v}": format "${c}" does not define "compare" function`);
-          const _ = p.scopeValue("formats", {
+          const _ = h.scopeValue("formats", {
             key: c,
             ref: m,
             code: S.code.formats ? (0, r._)`${S.code.formats}${(0, r.getProperty)(c)}` : void 0
@@ -4635,9 +4635,9 @@ function Ki() {
     Object.defineProperty(t, "__esModule", { value: !0 });
     const r = qa(), n = Ui(), a = G(), s = new a.Name("fullFormats"), o = new a.Name("fastFormats"), u = (y, d = { keywords: !0 }) => {
       if (Array.isArray(d))
-        return p(y, d, r.fullFormats, s), y;
+        return h(y, d, r.fullFormats, s), y;
       const [v, $] = d.mode === "fast" ? [r.fastFormats, o] : [r.fullFormats, s], S = d.formats || r.formatNames;
-      return p(y, S, v, $), d.keywords && (0, n.default)(y), y;
+      return h(y, S, v, $), d.keywords && (0, n.default)(y), y;
     };
     u.get = (y, d = "full") => {
       const $ = (d === "fast" ? r.fastFormats : r.fullFormats)[y];
@@ -4645,7 +4645,7 @@ function Ki() {
         throw new Error(`Unknown format "${y}"`);
       return $;
     };
-    function p(y, d, v, $) {
+    function h(y, d, v, $) {
       var S, w;
       (S = (w = y.opts.code).formats) !== null && S !== void 0 || (w.formats = (0, a._)`require("ajv-formats/dist/formats").${$}`);
       for (const g of d)
@@ -4659,7 +4659,7 @@ const Wi = /* @__PURE__ */ ws(Bi);
 function Ns(e) {
   return e.split("/").slice(1).map((t) => t.replace(/~1/g, "/").replace(/~0/g, "~"));
 }
-function Hi(e) {
+function Ji(e) {
   const t = Ns(e.instancePath || "");
   if (e.keyword === "required") {
     const r = e.params.missingProperty;
@@ -4675,19 +4675,19 @@ function Hi(e) {
   }
   return t.length > 0 ? t : void 0;
 }
-function Ji(e) {
+function Hi(e) {
   return e.message ?? `${e.keyword} validation failed`;
 }
 function Gi(e) {
   return e.reduce((t, r) => {
-    const n = Hi(r);
+    const n = Ji(r);
     if (n == null) return t;
     let a = t;
     for (const s of n) {
       const o = s;
       a.dependencies == null && (a.dependencies = {}), a.dependencies[o] == null && (a.dependencies[o] = {}), a = a.dependencies[o];
     }
-    return a.message = Ji(r), t;
+    return a.message = Hi(r), t;
   }, {});
 }
 function kr(e) {
@@ -4730,9 +4730,9 @@ async function es(e, t, r) {
   const n = (await (() => {
     switch (e) {
       case "2020-12":
-        return import("./2020-B4xCW_nu.js").then((s) => s._);
+        return import("./2020-D0-tZTo7.js").then((s) => s._);
       case "2019-09":
-        return import("./2019-sCKLAY8c.js").then((s) => s._);
+        return import("./2019-DnG5Y5sm.js").then((s) => s._);
       case "draft-07":
         return Promise.resolve().then(() => iu);
     }
@@ -4805,14 +4805,14 @@ async function Zi(e, t, r, n) {
   const a = /* @__PURE__ */ new Set();
   if (n && n.length > 0)
     for (const u of n) {
-      const p = u.$id;
-      typeof p == "string" && p.length > 0 && a.add(p);
+      const h = u.$id;
+      typeof h == "string" && h.length > 0 && a.add(h);
     }
   const s = [], o = 5;
   for (let u = 0; u < o; u++) {
-    const p = ts(t), y = s.flatMap(
+    const h = ts(t), y = s.flatMap(
       ($) => ts($)
-    ), d = /* @__PURE__ */ new Set([...p, ...y]), v = [];
+    ), d = /* @__PURE__ */ new Set([...h, ...y]), v = [];
     for (const $ of d)
       if (!a.has($)) {
         if (e.getSchema($)) {
@@ -4855,10 +4855,10 @@ async function Qi(e, t) {
       const $ = d.getSchema(s ?? o) ?? d.compile(v);
       return { ok: !0, value: { ajv: d, validate: $ } };
     }
-    const p = await es(r, n, !0);
-    if (t?.externalSchemas && t.externalSchemas.length > 0 && Is(p, t.externalSchemas), t?.refResolver) {
+    const h = await es(r, n, !0);
+    if (t?.externalSchemas && t.externalSchemas.length > 0 && Is(h, t.externalSchemas), t?.refResolver) {
       const d = await Zi(
-        p,
+        h,
         e,
         t.refResolver,
         t.externalSchemas
@@ -4866,8 +4866,8 @@ async function Qi(e, t) {
       if (d != null)
         return { ok: !1, error: d };
     }
-    const y = p.compile(e);
-    return { ok: !0, value: { ajv: p, validate: y } };
+    const y = h.compile(e);
+    return { ok: !0, value: { ajv: h, validate: y } };
   } catch (r) {
     return { ok: !1, error: r instanceof Error ? r.message : String(r) };
   }
@@ -4890,11 +4890,11 @@ class Nr {
       path: s,
       ajv: o,
       isPropertyRequired: u,
-      suppressLabel: p,
+      suppressLabel: h,
       schemaConflicts: y,
       notViolations: d
     } = t;
-    this.schema = r, this.definition = n, this.horizontal = a, this.path = s, this.ajv = o, this.isPropertyRequired = u ?? !1, this.suppressLabel = p ?? !1, this.schemaConflicts = y ?? [], this.notViolations = d ?? [];
+    this.schema = r, this.definition = n, this.horizontal = a, this.path = s, this.ajv = o, this.isPropertyRequired = u ?? !1, this.suppressLabel = h ?? !1, this.schemaConflicts = y ?? [], this.notViolations = d ?? [];
   }
   with = (t) => new Nr({
     schema: t.schema ?? this.schema,
@@ -5110,7 +5110,7 @@ function Ir(e, t = []) {
         ) : o[l] = i;
       }
     const {
-      type: p,
+      type: h,
       required: y,
       properties: d,
       allOf: v,
@@ -5145,15 +5145,15 @@ function Ir(e, t = []) {
           y.has(v) && d.add(v);
         u = d;
       }
-    const p = Array.from(u ?? []);
-    if (p.length === 0) {
+    const h = Array.from(u ?? []);
+    if (h.length === 0) {
       const y = a.map((d) => Array.from(d));
       r.push({
         path: [...t, "type"],
         message: "Incompatible types in allOf (no common types)",
         conflictingValues: y
       });
-    } else p.length === 1 ? n.type = p[0] : n.type = p;
+    } else h.length === 1 ? n.type = h[0] : n.type = h;
   }
   return s.length > 0 && (n.required = [...new Set(s)]), Object.keys(o).length > 0 && (n.properties = o), {
     mergedSchema: n,
@@ -5201,8 +5201,8 @@ function so(e, t, r, n = []) {
       for (const [g, f] of Object.entries(w))
         Object.prototype.hasOwnProperty.call(v, g) && a.push(f);
   }
-  const p = [e, ...a], { mergedSchema: y, conflicts: d } = Ir(
-    p,
+  const h = [e, ...a], { mergedSchema: y, conflicts: d } = Ir(
+    h,
     n
   );
   if (u.length > 0) {
@@ -5227,7 +5227,7 @@ function As(e, t, r) {
   }
   return null;
 }
-function Je(e, t, r) {
+function He(e, t, r) {
   const n = /* @__PURE__ */ new Set();
   if (!t || typeof t != "object")
     return n;
@@ -5245,9 +5245,9 @@ function Je(e, t, r) {
     e.properties && Object.keys(e.properties).forEach((u) => {
       u in t && o.add(u);
     }), e.patternProperties && Object.keys(t).forEach((u) => {
-      Object.keys(e.patternProperties).forEach((p) => {
+      Object.keys(e.patternProperties).forEach((h) => {
         try {
-          new RegExp(p).test(u) && o.add(u);
+          new RegExp(h).test(u) && o.add(u);
         } catch {
         }
       });
@@ -5256,15 +5256,15 @@ function Je(e, t, r) {
     });
   }
   e.allOf && e.allOf.forEach((o) => {
-    typeof o == "object" && Je(o, t, r).forEach((p) => n.add(p));
+    typeof o == "object" && He(o, t, r).forEach((h) => n.add(h));
   });
   const a = As(e, t, r);
-  a && Je(a, t, r).forEach((u) => n.add(u));
+  a && He(a, t, r).forEach((u) => n.add(u));
   const s = e.dependentSchemas;
   return s && Object.keys(s).forEach((o) => {
     if (o in t) {
       const u = s[o];
-      typeof u == "object" && Je(
+      typeof u == "object" && He(
         u,
         t,
         r
@@ -5273,7 +5273,7 @@ function Je(e, t, r) {
   }), e.dependencies && Object.keys(e.dependencies).forEach((o) => {
     if (o in t) {
       const u = e.dependencies[o];
-      typeof u == "object" && !Array.isArray(u) && Je(u, t, r).forEach((y) => n.add(y));
+      typeof u == "object" && !Array.isArray(u) && He(u, t, r).forEach((y) => n.add(y));
     }
   }), n;
 }
@@ -5315,8 +5315,8 @@ function Ts(e) {
     size: s = "sm",
     keyFor: o = (d) => String(d),
     parseKey: u = (d) => d
-  } = e, p = t.length;
-  if ((a === "auto" ? p <= 3 ? "segmented" : "select" : a) === "segmented") {
+  } = e, h = t.length;
+  if ((a === "auto" ? h <= 3 ? "segmented" : "select" : a) === "segmented") {
     const d = Object.fromEntries(
       t.map((v) => [o(v.value), v.label])
     );
@@ -5426,11 +5426,11 @@ function uo(e) {
   }
   return {};
 }
-const pr = ["description", "comment", "notes", "text"];
+const hr = ["description", "comment", "notes", "text"];
 function co(e) {
-  if (typeof e == "boolean") return pr;
+  if (typeof e == "boolean") return hr;
   const t = e["x:ui"];
-  return t && Array.isArray(t.textAreaTriggers) ? [...pr, ...t.textAreaTriggers] : pr;
+  return t && Array.isArray(t.textAreaTriggers) ? [...hr, ...t.textAreaTriggers] : hr;
 }
 function Ms(e) {
   if (typeof e == "boolean") return;
@@ -5576,14 +5576,14 @@ function lo(e) {
     }
 }
 const fo = (e) => {
-  const { value: t, onBlur: r, onChange: n, onInput: a, after: s, disabled: o, ...u } = e, p = ms(t, o, n);
+  const { value: t, onBlur: r, onChange: n, onInput: a, after: s, disabled: o, ...u } = e, h = ms(t, o, n);
   return ia({
     ...u,
     value: ne.map(t, (y) => y ?? void 0),
     onChange: n != null ? (y) => n(y ?? null) : void 0,
     onInput: a != null ? (y) => a(y ?? null) : void 0,
     onBlur: r,
-    after: s != null ? we(p, s) : p
+    after: s != null ? we(h, s) : h
   });
 };
 function rs({
@@ -5599,14 +5599,14 @@ function rs({
         controller: le(r)
       });
     case "date":
-      return Zt(ha, {
+      return Zt(pa, {
         ...t,
         controller: le(r),
         toInput: (a) => a == null ? null : new Date(a),
         fromInput: (a) => a?.toISOString().split("T")[0] ?? null
       });
     case "date-time":
-      return Zt(pa, {
+      return Zt(ha, {
         ...t,
         controller: le(r),
         toInput: (a) => a == null ? null : new Date(a),
@@ -5767,7 +5767,7 @@ function gr({
       });
   }
 }
-function po(e) {
+function ho(e) {
   const t = Ar(e.definition, e.name);
   if (t?.widget === "slider")
     return { widget: "slider", options: t.options };
@@ -5787,7 +5787,7 @@ function Ft({
 }) {
   if (e.isWriteOnly && !e.shouldShowWriteOnly)
     return we();
-  const r = e.definition, n = po(e), a = {
+  const r = e.definition, n = ho(e), a = {
     ...Ne({ ctx: e }),
     placeholder: Xe(e.definition, String),
     min: r.minimum,
@@ -5848,12 +5848,12 @@ function Ft({
   }
 }
 function ns(e) {
-  return `${ho(e)} 000,000.00`;
+  return `${po(e)} 000,000.00`;
 }
 function ss() {
   return "000.00%";
 }
-function ho(e) {
+function po(e) {
   return {
     USD: "$",
     EUR: "€",
@@ -5910,11 +5910,11 @@ function Vs({
     e.change(null);
   });
 }
-let hr = /* @__PURE__ */ new WeakMap(), as = /* @__PURE__ */ new WeakMap();
+let pr = /* @__PURE__ */ new WeakMap(), as = /* @__PURE__ */ new WeakMap();
 function Ds(e, t) {
   const r = typeof t == "object" && t != null ? t : null;
   if (r != null) {
-    const o = hr.get(r)?.get(e);
+    const o = pr.get(r)?.get(e);
     if (o != null) return o;
   }
   let n = e;
@@ -5937,12 +5937,12 @@ function Ds(e, t) {
       console.warn(`resolveRef: could not resolve JSON Pointer ${s}`);
       break;
     }
-    const { $ref: u, ...p } = n;
-    n = { ...o, ...p };
+    const { $ref: u, ...h } = n;
+    n = { ...o, ...h };
   }
   if (r != null) {
-    let s = hr.get(r);
-    s == null && (s = /* @__PURE__ */ new WeakMap(), hr.set(r, s)), s.set(e, n);
+    let s = pr.get(r);
+    s == null && (s = /* @__PURE__ */ new WeakMap(), pr.set(r, s)), s.set(e, n);
   }
   return n;
 }
@@ -5975,7 +5975,7 @@ function Ls(e, t) {
 function Fs(e, t, r) {
   let n = e;
   const a = /* @__PURE__ */ new Set(), s = (o, u) => {
-    const { $ref: p, ...y } = u;
+    const { $ref: h, ...y } = u;
     return { ...o, ...y };
   };
   for (; zs(n); ) {
@@ -6001,8 +6001,8 @@ function Fs(e, t, r) {
       );
       break;
     }
-    const u = o.indexOf("#"), p = u >= 0 ? o.slice(0, u) : o;
-    let y = r.getSchema(o) || r.getSchema(p);
+    const u = o.indexOf("#"), h = u >= 0 ? o.slice(0, u) : o;
+    let y = r.getSchema(o) || r.getSchema(h);
     if (!y)
       try {
         y = r.compile({ $ref: o });
@@ -6020,20 +6020,20 @@ function Fs(e, t, r) {
 function mo({
   conflicts: e
 }) {
-  return e.length === 0 ? vs : ps(
+  return e.length === 0 ? vs : hs(
     {
       variant: "warning",
       tone: "prominent",
       title: "Schema Conflicts Detected",
       class: "bc-schema-conflicts-banner"
     },
-    H.ul(
+    J.ul(
       F.style("margin: 0; padding-left: 1.25rem; list-style-type: disc;"),
       ...e.map(
-        (t) => H.li(
+        (t) => J.li(
           F.style("margin-bottom: 0.25rem;"),
           t.message,
-          t.path.length > 0 ? H.code(
+          t.path.length > 0 ? J.code(
             F.style(
               "margin-left: 0.5rem; font-size: 0.75rem; opacity: 0.7;"
             ),
@@ -6047,20 +6047,20 @@ function mo({
 function yo({
   violations: e
 }) {
-  return e.length === 0 ? vs : ps(
+  return e.length === 0 ? vs : hs(
     {
       variant: "danger",
       tone: "prominent",
       title: "Schema Violations Detected",
       class: "bc-not-violations-banner"
     },
-    H.ul(
+    J.ul(
       F.style("margin: 0; padding-left: 1.25rem; list-style-type: disc;"),
       ...e.map(
-        (t) => H.li(
+        (t) => J.li(
           F.style("margin-bottom: 0.25rem;"),
           t.message,
-          t.path.length > 0 ? H.code(
+          t.path.length > 0 ? J.code(
             F.style(
               "margin-left: 0.5rem; font-size: 0.75rem; opacity: 0.7;"
             ),
@@ -6082,15 +6082,15 @@ function go({
       if (u !== void 0)
         t.change(u);
       else {
-        const p = e.definition;
-        p.type === "string" ? t.change("") : p.type === "number" || p.type === "integer" ? t.change(0) : p.type === "boolean" ? t.change(!1) : p.type === "array" ? t.change([]) : p.type === "object" ? t.change({}) : t.change(null);
+        const h = e.definition;
+        h.type === "string" ? t.change("") : h.type === "number" || h.type === "integer" ? t.change(0) : h.type === "boolean" ? t.change(!1) : h.type === "array" ? t.change([]) : h.type === "object" ? t.change({}) : t.change(null);
       }
     } else
       t.change(void 0);
   };
   return de(
     Ee(() => ne.dispose(n)),
-    H.div(
+    J.div(
       F.class("bc-presence-toggle"),
       Ye({
         layout: "horizontal",
@@ -6252,8 +6252,8 @@ function wo({
   if (!a)
     return r;
   const s = { ...os, ...n }, o = So(t), u = $o(a, o);
-  switch (s.clearOnHide && u.on((p) => {
-    !p && t.signal.value !== void 0 && t.change(void 0);
+  switch (s.clearOnHide && u.on((h) => {
+    !h && t.signal.value !== void 0 && t.change(void 0);
   }), s.behavior) {
     case "unmount":
       return Ge(
@@ -6313,7 +6313,7 @@ function Oo(e, t, r) {
     patternProps: s,
     apSchema: o,
     canRemove: u,
-    lockKeyAfterSet: p,
+    lockKeyAfterSet: h,
     validatePropertyName: y
   } = r, d = n.field(e), v = Re(e), $ = Re(null);
   let S = o;
@@ -6347,7 +6347,7 @@ function Oo(e, t, r) {
     delete m[e], m[i] = _, n.change(m);
   }, g = Sr(
     Pr,
-    (l) => hs({
+    (l) => ps({
       size: "xs",
       label: l.$.removeItem,
       disabled: !u(
@@ -6362,9 +6362,9 @@ function Oo(e, t, r) {
     })
   ), f = ne.map(
     d.signal,
-    (l) => p && l != null
+    (l) => h && l != null
   );
-  return H.div(
+  return J.div(
     Ee(v, $, () => ne.dispose(f)),
     F.class("bc-object-helpers__row"),
     _s.gridTemplateColumns("2fr 3fr min-content"),
@@ -6379,21 +6379,21 @@ function Oo(e, t, r) {
       }),
       error: bs(
         $,
-        (l) => H.div(F.class("bc-object-helpers__error"), l)
+        (l) => J.div(F.class("bc-object-helpers__error"), l)
       ),
-      description: Object.keys(s).length > 0 ? H.div(
+      description: Object.keys(s).length > 0 ? J.div(
         F.class("bc-object-helpers__description"),
         "Allowed patterns: ",
         Object.keys(s).join(", ")
       ) : null
     }),
-    H.div(
+    J.div(
       Me({
         ctx: a.with({ definition: S, suppressLabel: !0 }).append(e),
         controller: d
       })
     ),
-    H.div(F.class("bc-object-helpers__remove"), g)
+    J.div(F.class("bc-object-helpers__remove"), g)
   );
 }
 function jo(e, t, r) {
@@ -6403,7 +6403,7 @@ function jo(e, t, r) {
     patternProps: s,
     apSchema: o,
     unevaluatedProps: u,
-    canRemove: p,
+    canRemove: h,
     lockKeyAfterSet: y,
     validatePropertyName: d
   } = r, v = n.field(e), $ = Re(e), S = Re(null);
@@ -6442,15 +6442,15 @@ function jo(e, t, r) {
     delete _[e], _[c] = b, n.change(_);
   }, f = Sr(
     Pr,
-    (i) => hs({
+    (i) => ps({
       size: "xs",
       label: i.$.removeItem,
-      disabled: !p(
+      disabled: !h(
         Object.keys(ne.get(n.signal) ?? {}).length
       ),
       onClick: () => {
         const c = Object.keys(ne.get(n.signal) ?? {}).length;
-        if (!p(c)) return;
+        if (!h(c)) return;
         const m = { ...ne.get(n.signal) ?? {} };
         delete m[e], n.change(m);
       }
@@ -6459,7 +6459,7 @@ function jo(e, t, r) {
     v.signal,
     (i) => y && i != null
   );
-  return H.div(
+  return J.div(
     Ee($, S, () => ne.dispose(l)),
     F.class("bc-object-helpers__row"),
     _s.gridTemplateColumns("2fr 3fr min-content"),
@@ -6474,24 +6474,24 @@ function jo(e, t, r) {
       }),
       error: bs(
         S,
-        (i) => H.div(F.class("bc-object-helpers__error"), i)
+        (i) => J.div(F.class("bc-object-helpers__error"), i)
       ),
-      description: H.div(
+      description: J.div(
         F.class("bc-object-helpers__description"),
         u === !1 ? "Unevaluated property (not allowed by schema)" : "Unevaluated property",
-        Object.keys(s).length > 0 ? H.span(
+        Object.keys(s).length > 0 ? J.span(
           " • Allowed patterns: ",
           Object.keys(s).join(", ")
         ) : null
       )
     }),
-    H.div(
+    J.div(
       Me({
         ctx: a.with({ definition: w, suppressLabel: !0 }).append(e),
         controller: v
       })
     ),
-    H.div(F.class("bc-object-helpers__remove"), f)
+    J.div(F.class("bc-object-helpers__remove"), f)
   );
 }
 function ko(e) {
@@ -6507,10 +6507,10 @@ function Ro({
   title: e,
   children: t
 }) {
-  return H.fieldset(
+  return J.fieldset(
     F.class("bc-fieldset"),
-    e ? H.legend(F.class("bc-fieldset__legend"), e) : null,
-    H.div(
+    e ? J.legend(F.class("bc-fieldset__legend"), e) : null,
+    J.div(
       F.class("bc-fieldset__content"),
       de(F.class("bc-stack--gap-1"), ...t)
     )
@@ -6542,7 +6542,7 @@ function Io({
     }
     return "bc-schema-grid bc-schema-grid--cols-1";
   });
-  return H.div(
+  return J.div(
     F.class(r),
     F.class("bc-schema-grid--gap-4"),
     ...t
@@ -6555,15 +6555,15 @@ function Ao({
   if (!e || Object.keys(e).length === 0)
     return Co({ title: "Properties", children: t });
   const r = Re(Object.keys(e)[0]), n = Object.entries(e);
-  return H.div(
+  return J.div(
     Ee(r),
     F.class("bc-tabs"),
     // Tab headers
-    H.div(
+    J.div(
       F.class("bc-tabs__header"),
       F.role("tablist"),
       ...n.map(
-        ([a], s) => H.button(
+        ([a], s) => J.button(
           F.type("button"),
           F.class("bc-tabs__tab"),
           F.class(
@@ -6585,8 +6585,8 @@ function Ao({
                 break;
               case "ArrowRight":
                 o.preventDefault();
-                const p = s < n.length - 1 ? s + 1 : 0;
-                r.set(n[p][0]);
+                const h = s < n.length - 1 ? s + 1 : 0;
+                r.set(n[h][0]);
                 break;
               case "Home":
                 o.preventDefault(), r.set(n[0][0]);
@@ -6601,10 +6601,10 @@ function Ao({
       )
     ),
     // Tab content
-    H.div(
+    J.div(
       F.class("bc-tabs__content"),
       ...n.map(
-        ([a, s]) => H.div(
+        ([a, s]) => J.div(
           F.class("bc-tabs__panel"),
           F.class(
             ie(r)(
@@ -6625,15 +6625,15 @@ function Co({
   title: e,
   children: t
 }) {
-  return H.div(
+  return J.div(
     F.class("bc-tabs"),
-    H.div(
+    J.div(
       F.class("bc-tabs__header"),
-      H.div(F.class("bc-tabs__tab bc-tabs__tab--active"), e)
+      J.div(F.class("bc-tabs__tab bc-tabs__tab--active"), e)
     ),
-    H.div(
+    J.div(
       F.class("bc-tabs__content"),
-      H.div(
+      J.div(
         F.class("bc-tabs__panel bc-tabs__panel--active"),
         de(F.class("bc-stack--gap-1"), ...t)
       )
@@ -6647,32 +6647,32 @@ function To({
   if (!e || Object.keys(e).length === 0)
     return qo({ title: "Properties", children: t });
   const r = Object.entries(e), n = Re(new Set([r[0]?.[0]].filter(Boolean)));
-  return H.div(
+  return J.div(
     Ee(n),
     F.class("bc-accordion"),
     ...r.map(([a, s]) => {
       const o = ie(n)(
         (u) => u.has(a)
       );
-      return H.div(
+      return J.div(
         Ee(o),
         F.class("bc-accordion__item"),
-        H.button(
+        J.button(
           F.type("button"),
           F.class("bc-accordion__header"),
           Ra.expanded(o),
           xe.click(() => {
-            const u = n.value, p = new Set(u);
-            p.has(a) ? p.delete(a) : p.add(a), n.set(p);
+            const u = n.value, h = new Set(u);
+            h.has(a) ? h.delete(a) : h.add(a), n.set(h);
           }),
           xe.keydown((u) => {
             if (u.key === "Enter" || u.key === " ") {
               u.preventDefault();
-              const p = n.value, y = new Set(p);
+              const h = n.value, y = new Set(h);
               y.has(a) ? y.delete(a) : y.add(a), n.set(y);
             }
           }),
-          H.span(a),
+          J.span(a),
           $s({
             icon: ie(o)(
               (u) => u ? "chevron-up" : "chevron-down"
@@ -6680,7 +6680,7 @@ function To({
             size: "sm"
           })
         ),
-        H.div(
+        J.div(
           F.class("bc-accordion__content"),
           F.class(
             ie(o)(
@@ -6689,7 +6689,7 @@ function To({
           ),
           de(
             F.class("bc-stack--gap-1"),
-            ...t.filter((u, p) => s.length === 0 || p < s.length)
+            ...t.filter((u, h) => s.length === 0 || h < s.length)
           )
         )
       );
@@ -6701,16 +6701,16 @@ function qo({
   children: t
 }) {
   const r = Re(!0);
-  return H.div(
+  return J.div(
     Ee(r),
     F.class("bc-accordion"),
-    H.div(
+    J.div(
       F.class("bc-accordion__item"),
-      H.button(
+      J.button(
         F.type("button"),
         F.class("bc-accordion__header"),
         xe.click(() => r.set(!r.value)),
-        H.span(e),
+        J.span(e),
         $s({
           icon: ie(r)(
             (n) => n ? "chevron-up" : "chevron-down"
@@ -6718,7 +6718,7 @@ function qo({
           size: "sm"
         })
       ),
-      H.div(
+      J.div(
         F.class("bc-accordion__content"),
         F.class(
           ie(r)(
@@ -6738,25 +6738,25 @@ function us(e, t, r) {
   let a = e;
   if (t.order && t.order.length > 0) {
     const o = /* @__PURE__ */ new Map(), u = [];
-    t.order.forEach((p) => {
-      const y = n.get(p);
-      y && o.set(p, y);
-    }), r.forEach((p, y) => {
-      !t.order.includes(p) && e[y] && u.push(e[y]);
+    t.order.forEach((h) => {
+      const y = n.get(h);
+      y && o.set(h, y);
+    }), r.forEach((h, y) => {
+      !t.order.includes(h) && e[y] && u.push(e[y]);
     }), a = [...Array.from(o.values()), ...u];
   }
   let s;
   if (t.groups && Object.keys(t.groups).length > 0) {
     s = {};
     const o = /* @__PURE__ */ new Set();
-    Object.entries(t.groups).forEach(([p, y]) => {
-      s[p] = [], y.forEach((d) => {
+    Object.entries(t.groups).forEach(([h, y]) => {
+      s[h] = [], y.forEach((d) => {
         const v = n.get(d);
-        v && (s[p].push(v), o.add(v));
+        v && (s[h].push(v), o.add(v));
       });
     });
     const u = a.filter(
-      (p) => !o.has(p)
+      (h) => !o.has(h)
     );
     u.length > 0 && (s.Other = u);
   }
@@ -6813,23 +6813,23 @@ function Bs({
     ), o = e.with({
       definition: a,
       schemaConflicts: [...e.schemaConflicts, ...s]
-    }), u = a.properties ?? {}, p = new Set(Object.keys(u)), y = Object.keys(r ?? {}), d = y.filter((h) => !p.has(h)), v = a.unevaluatedProperties, $ = Je(
+    }), u = a.properties ?? {}, h = new Set(Object.keys(u)), y = Object.keys(r ?? {}), d = y.filter((p) => !h.has(p)), v = a.unevaluatedProperties, $ = He(
       a,
       r ?? {},
       e.ajv
-    ), S = d.filter((h) => !$.has(h)), w = d.filter(
-      (h) => $.has(h)
+    ), S = d.filter((p) => !$.has(p)), w = d.filter(
+      (p) => $.has(p)
     ), g = a.additionalProperties ?? !0, f = g !== !1, l = g === !0 || g === void 0 ? {} : g, i = a.minProperties ?? 0, c = a.maxProperties ?? 1 / 0;
     let m = !0, _ = null;
     v === !1 ? (m = !1, _ = "No unevaluated properties are allowed by schema") : v && typeof v == "object" && (m = !0);
-    const b = f && m && y.length < c, E = (h) => h > i, I = a.patternProperties ?? {}, q = Object.keys(I).filter(Boolean).map((h) => {
+    const b = f && m && y.length < c, E = (p) => p > i, I = a.patternProperties ?? {}, q = Object.keys(I).filter(Boolean).map((p) => {
       try {
-        return new RegExp(h);
+        return new RegExp(p);
       } catch {
         return null;
       }
-    }).filter((h) => h != null), D = a.propertyNames, A = (h) => {
-      const P = (h ?? "").trim();
+    }).filter((p) => p != null), D = a.propertyNames, A = (p) => {
+      const P = (p ?? "").trim();
       if (P === "") return { ok: !1, message: "Key cannot be empty" };
       if (D === !1)
         return { ok: !1, message: "No property names are allowed by schema" };
@@ -6840,7 +6840,7 @@ function Bs({
             return { ok: !1, message: R.errors?.[0]?.message ?? "Invalid property name" };
         } catch {
         }
-      if (!f && !p.has(P)) {
+      if (!f && !h.has(P)) {
         if (q.length === 0)
           return { ok: !1, message: "Only declared properties are allowed" };
         if (!q.some((U) => U.test(P)))
@@ -6850,24 +6850,24 @@ function Bs({
           };
       }
       return { ok: !0 };
-    }, V = a["x:ui"], L = !!(V && typeof V == "object" && V.lockKeyAfterSet), B = (h) => {
-      const P = Xe(h, (U) => U);
+    }, V = a["x:ui"], L = !!(V && typeof V == "object" && V.lockKeyAfterSet), B = (p) => {
+      const P = Xe(p, (U) => U);
       if (P !== void 0) return P;
-      const R = h.type;
+      const R = p.type;
       if (R === "string") return "";
       if (R === "number" || R === "integer") return 0;
       if (R === "boolean") return !1;
       if (R === "array") return [];
       if (R === "object") return {};
-    }, Q = (h, P) => {
-      const R = h, U = (Y) => P.has(Y) ? !1 : A(Y).ok;
+    }, Q = (p, P) => {
+      const R = p, U = (Y) => P.has(Y) ? !1 : A(Y).ok;
       if (U(R)) return R;
       let K = 1;
       for (; P.has(R + K) || !U(R + K); ) K++;
       return R + K;
     }, oe = Sr(
       Pr,
-      (h) => Aa(
+      (p) => Aa(
         {
           variant: "outline",
           disabled: !b,
@@ -6887,18 +6887,18 @@ function Bs({
           }
         },
         F.title(_),
-        h.$.addLabel
+        p.$.addLabel
       )
     ), ae = ko(o), te = Ca(u).filter(
-      ([, h]) => h !== !1
+      ([, p]) => p !== !1
     ), M = [
-      ...te.map(([h]) => h),
+      ...te.map(([p]) => p),
       ...w,
       ...S
     ], j = [
       // Known properties
-      ...te.map(([h, P]) => {
-        const R = h, U = t.field(R);
+      ...te.map(([p, P]) => {
+        const R = p, U = t.field(R);
         return Me({
           ctx: o.with({
             definition: P,
@@ -6911,9 +6911,9 @@ function Bs({
         });
       }),
       // Evaluated additional keys (pattern-matched and truly additional)
-      ...w.map((h) => {
-        const P = q.some((R) => R.test(h));
-        return Oo(h, P, {
+      ...w.map((p) => {
+        const P = q.some((R) => R.test(p));
+        return Oo(p, P, {
           controller: t,
           effCtx: o,
           patternProps: I,
@@ -6924,9 +6924,9 @@ function Bs({
         });
       }),
       // Unevaluated keys (use unevaluatedProperties schema if available)
-      ...S.map((h) => {
-        const P = q.some((R) => R.test(h));
-        return jo(h, P, {
+      ...S.map((p) => {
+        const P = q.some((R) => R.test(p));
+        return jo(p, P, {
           controller: t,
           effCtx: o,
           patternProps: I,
@@ -6983,12 +6983,12 @@ function Vo(e, t, r) {
     else
       cs(v, t) && o.push(d);
   }
-  const u = o.length > 1, p = o.length === 0;
+  const u = o.length > 1, h = o.length === 0;
   return {
     matchingBranch: o.length === 1 ? o[0] : -1,
     validBranches: o,
     isAmbiguous: u,
-    hasNoMatch: p
+    hasNoMatch: h
   };
 }
 function cs(e, t) {
@@ -7161,24 +7161,24 @@ function Ws({
       return ls(e, g, f);
     }
     return ls(e, g, f);
-  }), u = ne.get(o), p = Re(u >= 0 ? u : 0);
-  t.onDispose(p.dispose);
+  }), u = ne.get(o), h = Re(u >= 0 ? u : 0);
+  t.onDispose(h.dispose);
   let y = !1;
   const d = o.on((g) => {
-    !y && g >= 0 && p.set(g);
+    !y && g >= 0 && h.set(g);
   });
   t.onDispose(d);
   const v = n.length, $ = (g) => {
-    y = !0, p.set(g);
+    y = !0, h.set(g);
   }, S = v > 1 ? Ts({
     options: n.map((g, f) => ({
       value: f,
       label: a[f]
     })),
-    selected: p,
+    selected: h,
     onChange: $
     // auto mode chooses segmented for <=3
-  }) : "", w = Kt(p, (g) => Me({
+  }) : "", w = Kt(h, (g) => Me({
     ctx: e.with({
       definition: n[ne.get(g)],
       // Suppress inner labels only when combinator is nested (non-root)
@@ -7187,7 +7187,7 @@ function Ws({
     controller: t
   }));
   return we(
-    Ee(o, p),
+    Ee(o, h),
     qs({
       ctx: e,
       showSelector: v > 1,
@@ -7209,8 +7209,8 @@ function Me({
     if (o.length > 0) {
       const u = o.map(
         ($) => Fs($, e.schema, e.ajv)
-      ), { mergedSchema: p, conflicts: y } = Ir(u, e.path), { allOf: d, ...v } = n;
-      n = { ...v, ...p }, a = e.with({
+      ), { mergedSchema: h, conflicts: y } = Ir(u, e.path), { allOf: d, ...v } = n;
+      n = { ...v, ...h }, a = e.with({
         definition: n,
         schemaConflicts: [...e.schemaConflicts, ...y]
       });
@@ -7227,7 +7227,7 @@ function Me({
     u && (s = [...s, u], a = a.with({ notViolations: s }));
   }
   if (n == null)
-    return he(
+    return pe(
       a,
       t,
       se(
@@ -7240,7 +7240,7 @@ function Me({
       )
     );
   if (n.enum != null)
-    return he(
+    return pe(
       a,
       t,
       se(
@@ -7253,7 +7253,7 @@ function Me({
       )
     );
   if (n.const != null)
-    return he(
+    return pe(
       a,
       t,
       se(
@@ -7266,7 +7266,7 @@ function Me({
       )
     );
   if (n.anyOf != null)
-    return he(
+    return pe(
       a,
       t,
       se(
@@ -7279,7 +7279,7 @@ function Me({
       )
     );
   if (n.oneOf != null)
-    return he(
+    return pe(
       a,
       t,
       se(
@@ -7301,7 +7301,7 @@ function Me({
       t
     );
   if (Array.isArray(n.type)) {
-    const u = n.type.filter((p) => p !== "null");
+    const u = n.type.filter((h) => h !== "null");
     if (u.length === 1 && ["string", "number", "integer", "boolean"].includes(u[0]))
       switch (u[0]) {
         case "number":
@@ -7341,12 +7341,12 @@ function Me({
             t
           );
       }
-    return he(
+    return pe(
       a,
       t,
       se(
         a,
-        Js({
+        Hs({
           ctx: a,
           controller: t
         }),
@@ -7356,7 +7356,7 @@ function Me({
   }
   switch (n.type) {
     case "number":
-      return he(
+      return pe(
         a,
         t,
         se(
@@ -7369,7 +7369,7 @@ function Me({
         )
       );
     case "integer":
-      return he(
+      return pe(
         a,
         t,
         se(
@@ -7382,7 +7382,7 @@ function Me({
         )
       );
     case "string":
-      return he(
+      return pe(
         a,
         t,
         se(
@@ -7395,7 +7395,7 @@ function Me({
         )
       );
     case "boolean":
-      return he(
+      return pe(
         a,
         t,
         se(
@@ -7408,12 +7408,12 @@ function Me({
         )
       );
     case "array":
-      return he(
+      return pe(
         a,
         t,
         se(
           a,
-          Hs({
+          Js({
             ctx: a,
             controller: t instanceof ta ? t : t.array()
           }),
@@ -7425,22 +7425,22 @@ function Me({
         ctx: a,
         controller: t instanceof ea ? t : t.object()
       });
-      return a.isRoot ? he(
+      return a.isRoot ? pe(
         a,
         t,
         se(a, o, t)
-      ) : he(
+      ) : pe(
         a,
         t,
         se(
           a,
-          H.div(F.class("bc-json-schema-object"), o),
+          J.div(F.class("bc-json-schema-object"), o),
           t
         )
       );
     }
     case "null":
-      return he(
+      return pe(
         a,
         t,
         se(
@@ -7452,12 +7452,12 @@ function Me({
         )
       );
     default:
-      return console.warn("Unknown type", n.type), he(
+      return console.warn("Unknown type", n.type), pe(
         a,
         t,
         se(
           a,
-          H.div(F.class("bc-json-schema-unknown"), "Unknown"),
+          J.div(F.class("bc-json-schema-unknown"), "Unknown"),
           t
         )
       );
@@ -7478,7 +7478,7 @@ function Wo({
   });
   return e === !0 ? Ut({ ctx: n, controller: t }) : e === !1 ? we() : Me({ ctx: n, controller: t });
 }
-function he(e, t, r) {
+function pe(e, t, r) {
   return Us(e.definition) ? wo({
     ctx: e,
     controller: t,
@@ -7491,7 +7491,7 @@ function he(e, t, r) {
     }
   }) : r;
 }
-function Ho(e) {
+function Jo(e) {
   return e.prefixItems != null ? {
     isTuple: !0,
     prefixItems: e.prefixItems,
@@ -7513,11 +7513,11 @@ function ds(e) {
   const t = e["x:ui"];
   return Array.isArray(t?.tupleLabels) ? t.tupleLabels : void 0;
 }
-function Hs({
+function Js({
   ctx: e,
   controller: t
 }) {
-  const r = e.definition, n = Ho(r), a = ie(t.signal)((d) => {
+  const r = e.definition, n = Jo(r), a = ie(t.signal)((d) => {
     const v = d?.length ?? 0;
     return !(r.maxItems != null && v >= r.maxItems || n.isTuple && v >= n.prefixItems.length && n.additionalItemsSchema === !1);
   }), s = ie(t.signal)((d) => {
@@ -7567,7 +7567,7 @@ function Hs({
     }
     const S = r.minContains ?? (r.contains ? 1 : 0), w = r.maxContains, g = $ >= S && (w == null || $ <= w);
     return { matchingIndices: v, count: $, isValid: g, minContains: S, maxContains: w };
-  }), p = r.contains ? u.map((d) => {
+  }), h = r.contains ? u.map((d) => {
     const v = typeof r.contains == "object" && r.contains.title ? r.contains.title : "required pattern";
     if (!d.isValid) {
       if (d.count < (d.minContains ?? 0))
@@ -7637,13 +7637,13 @@ function Hs({
       ), c.length > 0 ? de(F.class("bc-stack--gap-1"), i, ...c) : i;
     }
   });
-  return r.contains && p ? de(
+  return r.contains && h ? de(
     F.class("bc-stack--gap-2"),
     y,
     Kt(
       ie(
         u,
-        p
+        h
       )((d, v) => ({
         info: d,
         summary: v
@@ -7660,7 +7660,7 @@ function Hs({
     y
   );
 }
-function Jo(e) {
+function Ho(e) {
   return e.map((t) => ({
     key: t,
     label: wr(t),
@@ -7669,7 +7669,7 @@ function Jo(e) {
     defaultValue: () => oo(t)
   }));
 }
-function Js({
+function Hs({
   ctx: e,
   controller: t
 }) {
@@ -7679,13 +7679,13 @@ function Js({
     (S) => S !== "null" && (S === "string" || S === "number" || S === "integer" || S === "boolean")
   ), u = s && o.length === n.length - 1;
   u && (n = o);
-  const p = Jo(n), y = new ka(
+  const h = Ho(n), y = new ka(
     t.path,
     t.change,
     t.signal,
     t.status,
     { disabled: t.disabled },
-    p
+    h
   );
   t.onDispose(() => y.dispose());
   const d = (S) => Ts({
@@ -7742,7 +7742,7 @@ function Js({
         });
       case "array": {
         const l = g.array();
-        return Hs({
+        return Js({
           ctx: f,
           controller: l
         });
@@ -7779,7 +7779,7 @@ function Ut({
       }
     }),
     controller: t
-  }) : Js({
+  }) : Hs({
     ctx: e.with({
       definition: {
         ...e.definition,
@@ -7804,11 +7804,11 @@ function xo(e, t, r = !1) {
     if (!(s.onSubmitOnly && !r))
       try {
         const o = {};
-        for (const p of s.fields)
-          o[p] = Xo(e, p);
+        for (const h of s.fields)
+          o[h] = Xo(e, h);
         const u = s.validate(o, e);
         if (!u.valid) {
-          const p = s.targets || s.fields;
+          const h = s.targets || s.fields;
           if (u.fieldErrors)
             for (const [y, d] of Object.entries(u.fieldErrors))
               n.push({
@@ -7824,7 +7824,7 @@ function xo(e, t, r = !1) {
               });
           else {
             const y = u.message || s.message || "Cross-field validation failed";
-            for (const d of p)
+            for (const d of h)
               n.push({
                 instancePath: `/${d}`,
                 schemaPath: `#/x:ui/crossField/${s.id}`,
@@ -7943,13 +7943,13 @@ function Qo(e, t, r, n) {
     for (const s of r.crossField)
       try {
         const o = {};
-        for (const p of s.fields)
-          o[p] = $r(`$.${p}`, t);
+        for (const h of s.fields)
+          o[h] = $r(`$.${h}`, t);
         const u = s.validate(o, t);
         if (u) {
-          const p = s.target || s.fields[0];
+          const h = s.target || s.fields[0];
           a.push({
-            instancePath: `/${p}`,
+            instancePath: `/${h}`,
             schemaPath: "#/x:ui/crossField",
             keyword: "crossField",
             params: { fields: s.fields },
@@ -8033,8 +8033,8 @@ class nu {
   async validateField(t, r, n, a = !1) {
     const s = `${t.field}_${t.id}`, o = this.getValidationState(s), u = this.timeouts.get(s);
     u !== void 0 && clearTimeout(u);
-    const p = this.abortControllers.get(s);
-    if (p && p.abort(), !a && o.value.lastValidatedValue === r)
+    const h = this.abortControllers.get(s);
+    if (h && h.abort(), !a && o.value.lastValidatedValue === r)
       return;
     if (t.minLength && typeof r == "string" && r.length < t.minLength) {
       o.set({
@@ -8151,9 +8151,9 @@ function $u({
       refResolver: n,
       sanitizeAdditional: a
     }),
-    (p) => {
-      if (p.ok) {
-        const { ajv: y, validate: d } = p.value, v = Yo(e), $ = ru(e), S = $.length > 0 ? new nu() : null, w = s ?? "touchedOrSubmit", g = (D) => {
+    (h) => {
+      if (h.ok) {
+        const { ajv: y, validate: d } = h.value, v = Yo(e), $ = ru(e), S = $.length > 0 ? new nu() : null, w = s ?? "touchedOrSubmit", g = (D) => {
           const A = d(D);
           let V;
           return A ? V = Pe.valid : V = kr(
@@ -8195,7 +8195,7 @@ function $u({
         );
         return u({ Form: q, controller: f, setStatus: l });
       }
-      return H.div(F.class("bc-json-schema-form__error"), p.error);
+      return J.div(F.class("bc-json-schema-form__error"), h.error);
     }
   );
 }
@@ -8253,7 +8253,7 @@ export {
   no as D,
   so as E,
   As as F,
-  Je as G,
+  He as G,
   Po as H,
   Eo as I,
   Ut as J,
@@ -8262,9 +8262,9 @@ export {
   gr as M,
   _r as N,
   Vs as O,
-  Hs as P,
+  Js as P,
   Bs as Q,
-  Js as R,
+  Hs as R,
   Nr as S,
   Ko as T,
   Bo as U,
@@ -8275,13 +8275,13 @@ export {
   wu as Z,
   Ai as a,
   Ti as b,
-  Ht as c,
+  Jt as c,
   G as d,
   Er as e,
-  Jt as f,
+  Ht as f,
   ws as g,
   ri as h,
-  hi as i,
+  pi as i,
   ki as j,
   Ni as k,
   Ii as l,
@@ -8292,8 +8292,8 @@ export {
   vi as q,
   Qa as r,
   Ns as s,
-  Hi as t,
-  Ji as u,
+  Ji as t,
+  Hi as u,
   Gi as v,
   kr as w,
   gu as x,