@tempots/beatui 0.75.0 → 0.76.0

package/dist/json-schema/index.es.js

@@ -1,9 +1,9 @@
-import { U as sn, V as ye, B as Gs, o as ze, m as br, p as Xs, C as Zs, t as xs, l as Ys, j as Qs, N as ei, k as ti, s as ri, r as ni, q as ai, R as si, S as ii, E as rs, W as oi, u as ci, X as ui } from "../widget-customization-CobH7Rj_.js";
+import { U as sn, V as ye, B as Gs, o as ze, m as br, p as Xs, C as Zs, t as Ys, l as xs, j as Qs, N as ei, k as ti, s as ri, r as ni, q as ai, R as si, S as ii, E as rs, W as oi, u as ci, X as ui } from "../widget-customization-CobH7Rj_.js";
 import { Y as gf, c as vf, d as $f, f as bf } from "../widget-customization-CobH7Rj_.js";
 import { g as dr } from "../_commonjsHelpers-C6fGbg64.js";
 import { a as Ee, S as me, I as nt, c as te, j as _r, b as on, L as We, M as li, C as ns, g as di, A as fi, h as mi } from "../use-form-B7A865EM.js";
 import { _ as Kr, g as pi, S as hi, f as yi, N as as, l as de, W as gi, e as vi, t as Xe, T as $i, U as bi, b as Mr, c as _i, M as st, h as wi, G as Si, L as Pi, i as ji, j as Ei } from "../deep-merge-CQQCMLwG.js";
-import { attr as K, Value as se, Fragment as ke, WithElement as ss, Empty as is, html as J, When as et, computedOf as oe, prop as Ne, Use as Wr, style as os, Ensure as cs, aria as Oi, on as tt, MapSignal as fr, Async as Ri, OnDispose as Ai } from "@tempots/dom";
+import { attr as K, Value as ae, Fragment as ke, WithElement as ss, Empty as is, html as J, When as et, computedOf as ce, prop as Ne, Use as Wr, style as os, Ensure as cs, aria as Oi, on as tt, MapSignal as fr, Async as Ri, OnDispose as Ai } from "@tempots/dom";
 import { T as ki, a as Br, c as us, B as Ni } from "../translations-DQxouiBG.js";
 import { P as Ii, E as Ci, N as ls } from "../notice-Cqq8g17n.js";
 import { f as Ti } from "../colors-pQZlNrwM.js";
@@ -301,126 +301,126 @@ function H() {
       optimizeNodes() {
         return this;
       }
-      optimizeNames($, j) {
+      optimizeNames(v, j) {
         return this;
       }
     }
     class i extends a {
-      constructor($, j, R) {
-        super(), this.varKind = $, this.name = j, this.rhs = R;
+      constructor(v, j, R) {
+        super(), this.varKind = v, this.name = j, this.rhs = R;
       }
-      render({ es5: $, _n: j }) {
-        const R = $ ? r.varKinds.var : this.varKind, F = this.rhs === void 0 ? "" : ` = ${this.rhs}`;
+      render({ es5: v, _n: j }) {
+        const R = v ? r.varKinds.var : this.varKind, F = this.rhs === void 0 ? "" : ` = ${this.rhs}`;
         return `${R} ${this.name}${F};` + j;
       }
-      optimizeNames($, j) {
-        if ($[this.name.str])
-          return this.rhs && (this.rhs = W(this.rhs, $, j)), this;
+      optimizeNames(v, j) {
+        if (v[this.name.str])
+          return this.rhs && (this.rhs = W(this.rhs, v, j)), this;
       }
       get names() {
         return this.rhs instanceof t._CodeOrName ? this.rhs.names : {};
       }
     }
     class c extends a {
-      constructor($, j, R) {
-        super(), this.lhs = $, this.rhs = j, this.sideEffects = R;
+      constructor(v, j, R) {
+        super(), this.lhs = v, this.rhs = j, this.sideEffects = R;
       }
-      render({ _n: $ }) {
-        return `${this.lhs} = ${this.rhs};` + $;
+      render({ _n: v }) {
+        return `${this.lhs} = ${this.rhs};` + v;
       }
-      optimizeNames($, j) {
-        if (!(this.lhs instanceof t.Name && !$[this.lhs.str] && !this.sideEffects))
-          return this.rhs = W(this.rhs, $, j), this;
+      optimizeNames(v, j) {
+        if (!(this.lhs instanceof t.Name && !v[this.lhs.str] && !this.sideEffects))
+          return this.rhs = W(this.rhs, v, j), this;
       }
       get names() {
-        const $ = this.lhs instanceof t.Name ? {} : { ...this.lhs.names };
-        return L($, this.rhs);
+        const v = this.lhs instanceof t.Name ? {} : { ...this.lhs.names };
+        return U(v, this.rhs);
       }
     }
     class l extends c {
-      constructor($, j, R, F) {
-        super($, R, F), this.op = j;
+      constructor(v, j, R, F) {
+        super(v, R, F), this.op = j;
       }
-      render({ _n: $ }) {
-        return `${this.lhs} ${this.op}= ${this.rhs};` + $;
+      render({ _n: v }) {
+        return `${this.lhs} ${this.op}= ${this.rhs};` + v;
       }
     }
     class p extends a {
-      constructor($) {
-        super(), this.label = $, this.names = {};
+      constructor(v) {
+        super(), this.label = v, this.names = {};
       }
-      render({ _n: $ }) {
-        return `${this.label}:` + $;
+      render({ _n: v }) {
+        return `${this.label}:` + v;
       }
     }
     class m extends a {
-      constructor($) {
-        super(), this.label = $, this.names = {};
+      constructor(v) {
+        super(), this.label = v, this.names = {};
       }
-      render({ _n: $ }) {
-        return `break${this.label ? ` ${this.label}` : ""};` + $;
+      render({ _n: v }) {
+        return `break${this.label ? ` ${this.label}` : ""};` + v;
       }
     }
     class b extends a {
-      constructor($) {
-        super(), this.error = $;
+      constructor(v) {
+        super(), this.error = v;
       }
-      render({ _n: $ }) {
-        return `throw ${this.error};` + $;
+      render({ _n: v }) {
+        return `throw ${this.error};` + v;
       }
       get names() {
         return this.error.names;
       }
     }
     class g extends a {
-      constructor($) {
-        super(), this.code = $;
+      constructor(v) {
+        super(), this.code = v;
       }
-      render({ _n: $ }) {
-        return `${this.code};` + $;
+      render({ _n: v }) {
+        return `${this.code};` + v;
       }
       optimizeNodes() {
         return `${this.code}` ? this : void 0;
       }
-      optimizeNames($, j) {
-        return this.code = W(this.code, $, j), this;
+      optimizeNames(v, j) {
+        return this.code = W(this.code, v, j), this;
       }
       get names() {
         return this.code instanceof t._CodeOrName ? this.code.names : {};
       }
     }
     class w extends a {
-      constructor($ = []) {
-        super(), this.nodes = $;
+      constructor(v = []) {
+        super(), this.nodes = v;
       }
-      render($) {
-        return this.nodes.reduce((j, R) => j + R.render($), "");
+      render(v) {
+        return this.nodes.reduce((j, R) => j + R.render(v), "");
       }
       optimizeNodes() {
-        const { nodes: $ } = this;
-        let j = $.length;
+        const { nodes: v } = this;
+        let j = v.length;
         for (; j--; ) {
-          const R = $[j].optimizeNodes();
-          Array.isArray(R) ? $.splice(j, 1, ...R) : R ? $[j] = R : $.splice(j, 1);
+          const R = v[j].optimizeNodes();
+          Array.isArray(R) ? v.splice(j, 1, ...R) : R ? v[j] = R : v.splice(j, 1);
         }
-        return $.length > 0 ? this : void 0;
+        return v.length > 0 ? this : void 0;
       }
-      optimizeNames($, j) {
+      optimizeNames(v, j) {
         const { nodes: R } = this;
         let F = R.length;
         for (; F--; ) {
-          const D = R[F];
-          D.optimizeNames($, j) || (ee($, D.names), R.splice(F, 1));
+          const V = R[F];
+          V.optimizeNames(v, j) || (ee(v, V.names), R.splice(F, 1));
         }
         return R.length > 0 ? this : void 0;
       }
       get names() {
-        return this.nodes.reduce(($, j) => V($, j.names), {});
+        return this.nodes.reduce((v, j) => D(v, j.names), {});
       }
     }
     class S extends w {
-      render($) {
-        return "{" + $._n + super.render($) + "}" + $._n;
+      render(v) {
+        return "{" + v._n + super.render(v) + "}" + v._n;
       }
     }
     class h extends w {
@@ -429,17 +429,17 @@ function H() {
     }
     u.kind = "else";
     class f extends S {
-      constructor($, j) {
-        super(j), this.condition = $;
+      constructor(v, j) {
+        super(j), this.condition = v;
       }
-      render($) {
-        let j = `if(${this.condition})` + super.render($);
-        return this.else && (j += "else " + this.else.render($)), j;
+      render(v) {
+        let j = `if(${this.condition})` + super.render(v);
+        return this.else && (j += "else " + this.else.render(v)), j;
       }
       optimizeNodes() {
         super.optimizeNodes();
-        const $ = this.condition;
-        if ($ === !0)
+        const v = this.condition;
+        if (v === !0)
           return this.nodes;
         let j = this.else;
         if (j) {
@@ -447,18 +447,18 @@ function H() {
           j = this.else = Array.isArray(R) ? new u(R) : R;
         }
         if (j)
-          return $ === !1 ? j instanceof f ? j : j.nodes : this.nodes.length ? this : new f(re($), j instanceof f ? [j] : j.nodes);
-        if (!($ === !1 || !this.nodes.length))
+          return v === !1 ? j instanceof f ? j : j.nodes : this.nodes.length ? this : new f(oe(v), j instanceof f ? [j] : j.nodes);
+        if (!(v === !1 || !this.nodes.length))
           return this;
       }
-      optimizeNames($, j) {
+      optimizeNames(v, j) {
         var R;
-        if (this.else = (R = this.else) === null || R === void 0 ? void 0 : R.optimizeNames($, j), !!(super.optimizeNames($, j) || this.else))
-          return this.condition = W(this.condition, $, j), this;
+        if (this.else = (R = this.else) === null || R === void 0 ? void 0 : R.optimizeNames(v, j), !!(super.optimizeNames(v, j) || this.else))
+          return this.condition = W(this.condition, v, j), this;
       }
       get names() {
-        const $ = super.names;
-        return L($, this.condition), this.else && V($, this.else.names), $;
+        const v = super.names;
+        return U(v, this.condition), this.else && D(v, this.else.names), v;
       }
     }
     f.kind = "if";
@@ -466,166 +466,166 @@ function H() {
     }
     o.kind = "for";
     class d extends o {
-      constructor($) {
-        super(), this.iteration = $;
+      constructor(v) {
+        super(), this.iteration = v;
       }
-      render($) {
-        return `for(${this.iteration})` + super.render($);
+      render(v) {
+        return `for(${this.iteration})` + super.render(v);
       }
-      optimizeNames($, j) {
-        if (super.optimizeNames($, j))
-          return this.iteration = W(this.iteration, $, j), this;
+      optimizeNames(v, j) {
+        if (super.optimizeNames(v, j))
+          return this.iteration = W(this.iteration, v, j), this;
       }
       get names() {
-        return V(super.names, this.iteration.names);
+        return D(super.names, this.iteration.names);
       }
     }
     class y extends o {
-      constructor($, j, R, F) {
-        super(), this.varKind = $, this.name = j, this.from = R, this.to = F;
+      constructor(v, j, R, F) {
+        super(), this.varKind = v, this.name = j, this.from = R, this.to = F;
       }
-      render($) {
-        const j = $.es5 ? r.varKinds.var : this.varKind, { name: R, from: F, to: D } = this;
-        return `for(${j} ${R}=${F}; ${R}<${D}; ${R}++)` + super.render($);
+      render(v) {
+        const j = v.es5 ? r.varKinds.var : this.varKind, { name: R, from: F, to: V } = this;
+        return `for(${j} ${R}=${F}; ${R}<${V}; ${R}++)` + super.render(v);
       }
       get names() {
-        const $ = L(super.names, this.from);
-        return L($, this.to);
+        const v = U(super.names, this.from);
+        return U(v, this.to);
       }
     }
-    class v extends o {
-      constructor($, j, R, F) {
-        super(), this.loop = $, this.varKind = j, this.name = R, this.iterable = F;
+    class $ extends o {
+      constructor(v, j, R, F) {
+        super(), this.loop = v, this.varKind = j, this.name = R, this.iterable = F;
       }
-      render($) {
-        return `for(${this.varKind} ${this.name} ${this.loop} ${this.iterable})` + super.render($);
+      render(v) {
+        return `for(${this.varKind} ${this.name} ${this.loop} ${this.iterable})` + super.render(v);
       }
-      optimizeNames($, j) {
-        if (super.optimizeNames($, j))
-          return this.iterable = W(this.iterable, $, j), this;
+      optimizeNames(v, j) {
+        if (super.optimizeNames(v, j))
+          return this.iterable = W(this.iterable, v, j), this;
       }
       get names() {
-        return V(super.names, this.iterable.names);
+        return D(super.names, this.iterable.names);
       }
     }
     class _ extends S {
-      constructor($, j, R) {
-        super(), this.name = $, this.args = j, this.async = R;
+      constructor(v, j, R) {
+        super(), this.name = v, this.args = j, this.async = R;
       }
-      render($) {
-        return `${this.async ? "async " : ""}function ${this.name}(${this.args})` + super.render($);
+      render(v) {
+        return `${this.async ? "async " : ""}function ${this.name}(${this.args})` + super.render(v);
       }
     }
     _.kind = "func";
     class P extends w {
-      render($) {
-        return "return " + super.render($);
+      render(v) {
+        return "return " + super.render(v);
       }
     }
     P.kind = "return";
     class N extends S {
-      render($) {
-        let j = "try" + super.render($);
-        return this.catch && (j += this.catch.render($)), this.finally && (j += this.finally.render($)), j;
+      render(v) {
+        let j = "try" + super.render(v);
+        return this.catch && (j += this.catch.render(v)), this.finally && (j += this.finally.render(v)), j;
       }
       optimizeNodes() {
-        var $, j;
-        return super.optimizeNodes(), ($ = this.catch) === null || $ === void 0 || $.optimizeNodes(), (j = this.finally) === null || j === void 0 || j.optimizeNodes(), this;
+        var v, j;
+        return super.optimizeNodes(), (v = this.catch) === null || v === void 0 || v.optimizeNodes(), (j = this.finally) === null || j === void 0 || j.optimizeNodes(), this;
       }
-      optimizeNames($, j) {
+      optimizeNames(v, j) {
         var R, F;
-        return super.optimizeNames($, j), (R = this.catch) === null || R === void 0 || R.optimizeNames($, j), (F = this.finally) === null || F === void 0 || F.optimizeNames($, j), this;
+        return super.optimizeNames(v, j), (R = this.catch) === null || R === void 0 || R.optimizeNames(v, j), (F = this.finally) === null || F === void 0 || F.optimizeNames(v, j), this;
       }
       get names() {
-        const $ = super.names;
-        return this.catch && V($, this.catch.names), this.finally && V($, this.finally.names), $;
+        const v = super.names;
+        return this.catch && D(v, this.catch.names), this.finally && D(v, this.finally.names), v;
       }
     }
     class q extends S {
-      constructor($) {
-        super(), this.error = $;
+      constructor(v) {
+        super(), this.error = v;
       }
-      render($) {
-        return `catch(${this.error})` + super.render($);
+      render(v) {
+        return `catch(${this.error})` + super.render(v);
       }
     }
     q.kind = "catch";
-    class U extends S {
-      render($) {
-        return "finally" + super.render($);
+    class L extends S {
+      render(v) {
+        return "finally" + super.render(v);
       }
     }
-    U.kind = "finally";
+    L.kind = "finally";
     class I {
-      constructor($, j = {}) {
+      constructor(v, j = {}) {
         this._values = {}, this._blockStarts = [], this._constants = {}, this.opts = { ...j, _n: j.lines ? `
-` : "" }, this._extScope = $, this._scope = new r.Scope({ parent: $ }), this._nodes = [new h()];
+` : "" }, this._extScope = v, this._scope = new r.Scope({ parent: v }), this._nodes = [new h()];
       }
       toString() {
         return this._root.render(this.opts);
       }
       // returns unique name in the internal scope
-      name($) {
-        return this._scope.name($);
+      name(v) {
+        return this._scope.name(v);
       }
       // reserves unique name in the external scope
-      scopeName($) {
-        return this._extScope.name($);
+      scopeName(v) {
+        return this._extScope.name(v);
       }
       // reserves unique name in the external scope and assigns value to it
-      scopeValue($, j) {
-        const R = this._extScope.value($, j);
+      scopeValue(v, j) {
+        const R = this._extScope.value(v, j);
         return (this._values[R.prefix] || (this._values[R.prefix] = /* @__PURE__ */ new Set())).add(R), R;
       }
-      getScopeValue($, j) {
-        return this._extScope.getValue($, j);
+      getScopeValue(v, j) {
+        return this._extScope.getValue(v, j);
       }
       // 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($) {
-        return this._extScope.scopeRefs($, this._values);
+      scopeRefs(v) {
+        return this._extScope.scopeRefs(v, this._values);
       }
       scopeCode() {
         return this._extScope.scopeCode(this._values);
       }
-      _def($, j, R, F) {
-        const D = this._scope.toName(j);
-        return R !== void 0 && F && (this._constants[D.str] = R), this._leafNode(new i($, D, R)), D;
+      _def(v, j, R, F) {
+        const V = this._scope.toName(j);
+        return R !== void 0 && F && (this._constants[V.str] = R), this._leafNode(new i(v, V, R)), V;
       }
       // `const` declaration (`var` in es5 mode)
-      const($, j, R) {
-        return this._def(r.varKinds.const, $, j, R);
+      const(v, j, R) {
+        return this._def(r.varKinds.const, v, j, R);
       }
       // `let` declaration with optional assignment (`var` in es5 mode)
-      let($, j, R) {
-        return this._def(r.varKinds.let, $, j, R);
+      let(v, j, R) {
+        return this._def(r.varKinds.let, v, j, R);
       }
       // `var` declaration with optional assignment
-      var($, j, R) {
-        return this._def(r.varKinds.var, $, j, R);
+      var(v, j, R) {
+        return this._def(r.varKinds.var, v, j, R);
       }
       // assignment code
-      assign($, j, R) {
-        return this._leafNode(new c($, j, R));
+      assign(v, j, R) {
+        return this._leafNode(new c(v, j, R));
       }
       // `+=` code
-      add($, j) {
-        return this._leafNode(new l($, e.operators.ADD, j));
+      add(v, j) {
+        return this._leafNode(new l(v, e.operators.ADD, j));
       }
       // appends passed SafeExpr to code or executes Block
-      code($) {
-        return typeof $ == "function" ? $() : $ !== t.nil && this._leafNode(new g($)), this;
+      code(v) {
+        return typeof v == "function" ? v() : v !== t.nil && this._leafNode(new g(v)), this;
       }
       // returns code for object literal for the passed argument list of key-value pairs
-      object(...$) {
+      object(...v) {
         const j = ["{"];
-        for (const [R, F] of $)
+        for (const [R, F] of v)
           j.length > 1 && j.push(","), j.push(R), (R !== F || this.opts.es5) && (j.push(":"), (0, t.addCodeArg)(j, F));
         return j.push("}"), new t._Code(j);
       }
       // `if` clause (or statement if `thenBody` and, optionally, `elseBody` are passed)
-      if($, j, R) {
-        if (this._blockNode(new f($)), j && R)
+      if(v, j, R) {
+        if (this._blockNode(new f(v)), j && R)
           this.code(j).else().code(R).endIf();
         else if (j)
           this.code(j).endIf();
@@ -634,8 +634,8 @@ function H() {
         return this;
       }
       // `else if` clause - invalid without `if` or after `else` clauses
-      elseIf($) {
-        return this._elseNode(new f($));
+      elseIf(v) {
+        return this._elseNode(new f(v));
       }
       // `else` clause - only valid after `if` or `else if` clauses
       else() {
@@ -645,316 +645,316 @@ function H() {
       endIf() {
         return this._endBlockNode(f, u);
       }
-      _for($, j) {
-        return this._blockNode($), j && this.code(j).endFor(), this;
+      _for(v, j) {
+        return this._blockNode(v), j && this.code(j).endFor(), this;
       }
       // a generic `for` clause (or statement if `forBody` is passed)
-      for($, j) {
-        return this._for(new d($), j);
+      for(v, j) {
+        return this._for(new d(v), j);
       }
       // `for` statement for a range of values
-      forRange($, j, R, F, D = this.opts.es5 ? r.varKinds.var : r.varKinds.let) {
-        const X = this._scope.toName($);
-        return this._for(new y(D, X, j, R), () => F(X));
+      forRange(v, j, R, F, V = this.opts.es5 ? r.varKinds.var : r.varKinds.let) {
+        const X = this._scope.toName(v);
+        return this._for(new y(V, X, j, R), () => F(X));
       }
       // `for-of` statement (in es5 mode replace with a normal for loop)
-      forOf($, j, R, F = r.varKinds.const) {
-        const D = this._scope.toName($);
+      forOf(v, j, R, F = r.varKinds.const) {
+        const V = this._scope.toName(v);
         if (this.opts.es5) {
           const X = j instanceof t.Name ? j : this.var("_arr", j);
           return this.forRange("_i", 0, (0, t._)`${X}.length`, (G) => {
-            this.var(D, (0, t._)`${X}[${G}]`), R(D);
+            this.var(V, (0, t._)`${X}[${G}]`), R(V);
           });
         }
-        return this._for(new v("of", F, D, j), () => R(D));
+        return this._for(new $("of", F, V, j), () => R(V));
       }
       // `for-in` statement.
       // With option `ownProperties` replaced with a `for-of` loop for object keys
-      forIn($, j, R, F = this.opts.es5 ? r.varKinds.var : r.varKinds.const) {
+      forIn(v, j, R, F = this.opts.es5 ? r.varKinds.var : r.varKinds.const) {
         if (this.opts.ownProperties)
-          return this.forOf($, (0, t._)`Object.keys(${j})`, R);
-        const D = this._scope.toName($);
-        return this._for(new v("in", F, D, j), () => R(D));
+          return this.forOf(v, (0, t._)`Object.keys(${j})`, R);
+        const V = this._scope.toName(v);
+        return this._for(new $("in", F, V, j), () => R(V));
       }
       // end `for` loop
       endFor() {
         return this._endBlockNode(o);
       }
       // `label` statement
-      label($) {
-        return this._leafNode(new p($));
+      label(v) {
+        return this._leafNode(new p(v));
       }
       // `break` statement
-      break($) {
-        return this._leafNode(new m($));
+      break(v) {
+        return this._leafNode(new m(v));
       }
       // `return` statement
-      return($) {
+      return(v) {
         const j = new P();
-        if (this._blockNode(j), this.code($), j.nodes.length !== 1)
+        if (this._blockNode(j), this.code(v), j.nodes.length !== 1)
           throw new Error('CodeGen: "return" should have one node');
         return this._endBlockNode(P);
       }
       // `try` statement
-      try($, j, R) {
+      try(v, j, R) {
         if (!j && !R)
           throw new Error('CodeGen: "try" without "catch" and "finally"');
         const F = new N();
-        if (this._blockNode(F), this.code($), j) {
-          const D = this.name("e");
-          this._currNode = F.catch = new q(D), j(D);
+        if (this._blockNode(F), this.code(v), j) {
+          const V = this.name("e");
+          this._currNode = F.catch = new q(V), j(V);
         }
-        return R && (this._currNode = F.finally = new U(), this.code(R)), this._endBlockNode(q, U);
+        return R && (this._currNode = F.finally = new L(), this.code(R)), this._endBlockNode(q, L);
       }
       // `throw` statement
-      throw($) {
-        return this._leafNode(new b($));
+      throw(v) {
+        return this._leafNode(new b(v));
       }
       // start self-balancing block
-      block($, j) {
-        return this._blockStarts.push(this._nodes.length), $ && this.code($).endBlock(j), this;
+      block(v, j) {
+        return this._blockStarts.push(this._nodes.length), v && this.code(v).endBlock(j), this;
       }
       // end the current self-balancing block
-      endBlock($) {
+      endBlock(v) {
         const j = this._blockStarts.pop();
         if (j === void 0)
           throw new Error("CodeGen: not in self-balancing block");
         const R = this._nodes.length - j;
-        if (R < 0 || $ !== void 0 && R !== $)
-          throw new Error(`CodeGen: wrong number of nodes: ${R} vs ${$} expected`);
+        if (R < 0 || v !== void 0 && R !== v)
+          throw new Error(`CodeGen: wrong number of nodes: ${R} vs ${v} expected`);
         return this._nodes.length = j, this;
       }
       // `function` heading (or definition if funcBody is passed)
-      func($, j = t.nil, R, F) {
-        return this._blockNode(new _($, j, R)), F && this.code(F).endFunc(), this;
+      func(v, j = t.nil, R, F) {
+        return this._blockNode(new _(v, j, R)), F && this.code(F).endFunc(), this;
       }
       // end function definition
       endFunc() {
         return this._endBlockNode(_);
       }
-      optimize($ = 1) {
-        for (; $-- > 0; )
+      optimize(v = 1) {
+        for (; v-- > 0; )
           this._root.optimizeNodes(), this._root.optimizeNames(this._root.names, this._constants);
       }
-      _leafNode($) {
-        return this._currNode.nodes.push($), this;
+      _leafNode(v) {
+        return this._currNode.nodes.push(v), this;
       }
-      _blockNode($) {
-        this._currNode.nodes.push($), this._nodes.push($);
+      _blockNode(v) {
+        this._currNode.nodes.push(v), this._nodes.push(v);
       }
-      _endBlockNode($, j) {
+      _endBlockNode(v, j) {
         const R = this._currNode;
-        if (R instanceof $ || j && R instanceof j)
+        if (R instanceof v || j && R instanceof j)
           return this._nodes.pop(), this;
-        throw new Error(`CodeGen: not in block "${j ? `${$.kind}/${j.kind}` : $.kind}"`);
+        throw new Error(`CodeGen: not in block "${j ? `${v.kind}/${j.kind}` : v.kind}"`);
       }
-      _elseNode($) {
+      _elseNode(v) {
         const j = this._currNode;
         if (!(j instanceof f))
           throw new Error('CodeGen: "else" without "if"');
-        return this._currNode = j.else = $, this;
+        return this._currNode = j.else = v, this;
       }
       get _root() {
         return this._nodes[0];
       }
       get _currNode() {
-        const $ = this._nodes;
-        return $[$.length - 1];
+        const v = this._nodes;
+        return v[v.length - 1];
       }
-      set _currNode($) {
+      set _currNode(v) {
         const j = this._nodes;
-        j[j.length - 1] = $;
+        j[j.length - 1] = v;
       }
     }
     e.CodeGen = I;
-    function V(k, $) {
-      for (const j in $)
-        k[j] = (k[j] || 0) + ($[j] || 0);
+    function D(k, v) {
+      for (const j in v)
+        k[j] = (k[j] || 0) + (v[j] || 0);
       return k;
     }
-    function L(k, $) {
-      return $ instanceof t._CodeOrName ? V(k, $.names) : k;
+    function U(k, v) {
+      return v instanceof t._CodeOrName ? D(k, v.names) : k;
     }
-    function W(k, $, j) {
+    function W(k, v, j) {
       if (k instanceof t.Name)
         return R(k);
       if (!F(k))
         return k;
-      return new t._Code(k._items.reduce((D, X) => (X instanceof t.Name && (X = R(X)), X instanceof t._Code ? D.push(...X._items) : D.push(X), D), []));
-      function R(D) {
-        const X = j[D.str];
-        return X === void 0 || $[D.str] !== 1 ? D : (delete $[D.str], X);
+      return new t._Code(k._items.reduce((V, X) => (X instanceof t.Name && (X = R(X)), X instanceof t._Code ? V.push(...X._items) : V.push(X), V), []));
+      function R(V) {
+        const X = j[V.str];
+        return X === void 0 || v[V.str] !== 1 ? V : (delete v[V.str], X);
       }
-      function F(D) {
-        return D instanceof t._Code && D._items.some((X) => X instanceof t.Name && $[X.str] === 1 && j[X.str] !== void 0);
+      function F(V) {
+        return V instanceof t._Code && V._items.some((X) => X instanceof t.Name && v[X.str] === 1 && j[X.str] !== void 0);
       }
     }
-    function ee(k, $) {
-      for (const j in $)
-        k[j] = (k[j] || 0) - ($[j] || 0);
+    function ee(k, v) {
+      for (const j in v)
+        k[j] = (k[j] || 0) - (v[j] || 0);
     }
-    function re(k) {
+    function oe(k) {
       return typeof k == "boolean" || typeof k == "number" || k === null ? !k : (0, t._)`!${C(k)}`;
     }
-    e.not = re;
-    const ae = O(e.operators.AND);
-    function Y(...k) {
-      return k.reduce(ae);
+    e.not = oe;
+    const re = O(e.operators.AND);
+    function Z(...k) {
+      return k.reduce(re);
     }
-    e.and = Y;
-    const ce = O(e.operators.OR);
+    e.and = Z;
+    const se = O(e.operators.OR);
     function M(...k) {
-      return k.reduce(ce);
+      return k.reduce(se);
     }
     e.or = M;
     function O(k) {
-      return ($, j) => $ === t.nil ? j : j === t.nil ? $ : (0, t._)`${C($)} ${k} ${C(j)}`;
+      return (v, j) => v === t.nil ? j : j === t.nil ? v : (0, t._)`${C(v)} ${k} ${C(j)}`;
     }
     function C(k) {
       return k instanceof t.Name ? k : (0, t._)`(${k})`;
     }
   }(Pr)), Pr;
 }
-var Z = {}, fn;
+var Y = {}, fn;
 function Q() {
-  if (fn) return Z;
-  fn = 1, Object.defineProperty(Z, "__esModule", { value: !0 }), Z.checkStrictMode = Z.getErrorPath = Z.Type = Z.useFunc = Z.setEvaluated = Z.evaluatedPropsToName = Z.mergeEvaluated = Z.eachItem = Z.unescapeJsonPointer = Z.escapeJsonPointer = Z.escapeFragment = Z.unescapeFragment = Z.schemaRefOrVal = Z.schemaHasRulesButRef = Z.schemaHasRules = Z.checkUnknownRules = Z.alwaysValidSchema = Z.toHash = void 0;
+  if (fn) return Y;
+  fn = 1, Object.defineProperty(Y, "__esModule", { value: !0 }), Y.checkStrictMode = Y.getErrorPath = Y.Type = Y.useFunc = Y.setEvaluated = Y.evaluatedPropsToName = Y.mergeEvaluated = Y.eachItem = Y.unescapeJsonPointer = Y.escapeJsonPointer = Y.escapeFragment = Y.unescapeFragment = Y.schemaRefOrVal = Y.schemaHasRulesButRef = Y.schemaHasRules = Y.checkUnknownRules = Y.alwaysValidSchema = Y.toHash = void 0;
   const e = H(), t = ir();
-  function r(v) {
+  function r($) {
     const _ = {};
-    for (const P of v)
+    for (const P of $)
       _[P] = !0;
     return _;
   }
-  Z.toHash = r;
-  function n(v, _) {
-    return typeof _ == "boolean" ? _ : Object.keys(_).length === 0 ? !0 : (s(v, _), !a(_, v.self.RULES.all));
+  Y.toHash = r;
+  function n($, _) {
+    return typeof _ == "boolean" ? _ : Object.keys(_).length === 0 ? !0 : (s($, _), !a(_, $.self.RULES.all));
   }
-  Z.alwaysValidSchema = n;
-  function s(v, _ = v.schema) {
-    const { opts: P, self: N } = v;
+  Y.alwaysValidSchema = n;
+  function s($, _ = $.schema) {
+    const { opts: P, self: N } = $;
     if (!P.strictSchema || typeof _ == "boolean")
       return;
     const q = N.RULES.keywords;
-    for (const U in _)
-      q[U] || y(v, `unknown keyword: "${U}"`);
-  }
-  Z.checkUnknownRules = s;
-  function a(v, _) {
-    if (typeof v == "boolean")
-      return !v;
-    for (const P in v)
+    for (const L in _)
+      q[L] || y($, `unknown keyword: "${L}"`);
+  }
+  Y.checkUnknownRules = s;
+  function a($, _) {
+    if (typeof $ == "boolean")
+      return !$;
+    for (const P in $)
       if (_[P])
         return !0;
     return !1;
   }
-  Z.schemaHasRules = a;
-  function i(v, _) {
-    if (typeof v == "boolean")
-      return !v;
-    for (const P in v)
+  Y.schemaHasRules = a;
+  function i($, _) {
+    if (typeof $ == "boolean")
+      return !$;
+    for (const P in $)
       if (P !== "$ref" && _.all[P])
         return !0;
     return !1;
   }
-  Z.schemaHasRulesButRef = i;
-  function c({ topSchemaRef: v, schemaPath: _ }, P, N, q) {
+  Y.schemaHasRulesButRef = i;
+  function c({ topSchemaRef: $, schemaPath: _ }, P, N, q) {
     if (!q) {
       if (typeof P == "number" || typeof P == "boolean")
         return P;
       if (typeof P == "string")
         return (0, e._)`${P}`;
     }
-    return (0, e._)`${v}${_}${(0, e.getProperty)(N)}`;
+    return (0, e._)`${$}${_}${(0, e.getProperty)(N)}`;
   }
-  Z.schemaRefOrVal = c;
-  function l(v) {
-    return b(decodeURIComponent(v));
+  Y.schemaRefOrVal = c;
+  function l($) {
+    return b(decodeURIComponent($));
   }
-  Z.unescapeFragment = l;
-  function p(v) {
-    return encodeURIComponent(m(v));
+  Y.unescapeFragment = l;
+  function p($) {
+    return encodeURIComponent(m($));
   }
-  Z.escapeFragment = p;
-  function m(v) {
-    return typeof v == "number" ? `${v}` : v.replace(/~/g, "~0").replace(/\//g, "~1");
+  Y.escapeFragment = p;
+  function m($) {
+    return typeof $ == "number" ? `${$}` : $.replace(/~/g, "~0").replace(/\//g, "~1");
   }
-  Z.escapeJsonPointer = m;
-  function b(v) {
-    return v.replace(/~1/g, "/").replace(/~0/g, "~");
+  Y.escapeJsonPointer = m;
+  function b($) {
+    return $.replace(/~1/g, "/").replace(/~0/g, "~");
   }
-  Z.unescapeJsonPointer = b;
-  function g(v, _) {
-    if (Array.isArray(v))
-      for (const P of v)
+  Y.unescapeJsonPointer = b;
+  function g($, _) {
+    if (Array.isArray($))
+      for (const P of $)
         _(P);
     else
-      _(v);
+      _($);
   }
-  Z.eachItem = g;
-  function w({ mergeNames: v, mergeToName: _, mergeValues: P, resultToName: N }) {
-    return (q, U, I, V) => {
-      const L = I === void 0 ? U : I instanceof e.Name ? (U instanceof e.Name ? v(q, U, I) : _(q, U, I), I) : U instanceof e.Name ? (_(q, I, U), U) : P(U, I);
-      return V === e.Name && !(L instanceof e.Name) ? N(q, L) : L;
+  Y.eachItem = g;
+  function w({ mergeNames: $, mergeToName: _, mergeValues: P, resultToName: N }) {
+    return (q, L, I, D) => {
+      const U = I === void 0 ? L : I instanceof e.Name ? (L instanceof e.Name ? $(q, L, I) : _(q, L, I), I) : L instanceof e.Name ? (_(q, I, L), L) : P(L, I);
+      return D === e.Name && !(U instanceof e.Name) ? N(q, U) : U;
     };
   }
-  Z.mergeEvaluated = {
+  Y.mergeEvaluated = {
     props: w({
-      mergeNames: (v, _, P) => v.if((0, e._)`${P} !== true && ${_} !== undefined`, () => {
-        v.if((0, e._)`${_} === true`, () => v.assign(P, !0), () => v.assign(P, (0, e._)`${P} || {}`).code((0, e._)`Object.assign(${P}, ${_})`));
+      mergeNames: ($, _, P) => $.if((0, e._)`${P} !== true && ${_} !== undefined`, () => {
+        $.if((0, e._)`${_} === true`, () => $.assign(P, !0), () => $.assign(P, (0, e._)`${P} || {}`).code((0, e._)`Object.assign(${P}, ${_})`));
       }),
-      mergeToName: (v, _, P) => v.if((0, e._)`${P} !== true`, () => {
-        _ === !0 ? v.assign(P, !0) : (v.assign(P, (0, e._)`${P} || {}`), h(v, P, _));
+      mergeToName: ($, _, P) => $.if((0, e._)`${P} !== true`, () => {
+        _ === !0 ? $.assign(P, !0) : ($.assign(P, (0, e._)`${P} || {}`), h($, P, _));
       }),
-      mergeValues: (v, _) => v === !0 ? !0 : { ...v, ..._ },
+      mergeValues: ($, _) => $ === !0 ? !0 : { ...$, ..._ },
       resultToName: S
     }),
     items: w({
-      mergeNames: (v, _, P) => v.if((0, e._)`${P} !== true && ${_} !== undefined`, () => v.assign(P, (0, e._)`${_} === true ? true : ${P} > ${_} ? ${P} : ${_}`)),
-      mergeToName: (v, _, P) => v.if((0, e._)`${P} !== true`, () => v.assign(P, _ === !0 ? !0 : (0, e._)`${P} > ${_} ? ${P} : ${_}`)),
-      mergeValues: (v, _) => v === !0 ? !0 : Math.max(v, _),
-      resultToName: (v, _) => v.var("items", _)
+      mergeNames: ($, _, P) => $.if((0, e._)`${P} !== true && ${_} !== undefined`, () => $.assign(P, (0, e._)`${_} === true ? true : ${P} > ${_} ? ${P} : ${_}`)),
+      mergeToName: ($, _, P) => $.if((0, e._)`${P} !== true`, () => $.assign(P, _ === !0 ? !0 : (0, e._)`${P} > ${_} ? ${P} : ${_}`)),
+      mergeValues: ($, _) => $ === !0 ? !0 : Math.max($, _),
+      resultToName: ($, _) => $.var("items", _)
     })
   };
-  function S(v, _) {
+  function S($, _) {
     if (_ === !0)
-      return v.var("props", !0);
-    const P = v.var("props", (0, e._)`{}`);
-    return _ !== void 0 && h(v, P, _), P;
+      return $.var("props", !0);
+    const P = $.var("props", (0, e._)`{}`);
+    return _ !== void 0 && h($, P, _), P;
   }
-  Z.evaluatedPropsToName = S;
-  function h(v, _, P) {
-    Object.keys(P).forEach((N) => v.assign((0, e._)`${_}${(0, e.getProperty)(N)}`, !0));
+  Y.evaluatedPropsToName = S;
+  function h($, _, P) {
+    Object.keys(P).forEach((N) => $.assign((0, e._)`${_}${(0, e.getProperty)(N)}`, !0));
   }
-  Z.setEvaluated = h;
+  Y.setEvaluated = h;
   const u = {};
-  function f(v, _) {
-    return v.scopeValue("func", {
+  function f($, _) {
+    return $.scopeValue("func", {
       ref: _,
       code: u[_.code] || (u[_.code] = new t._Code(_.code))
     });
   }
-  Z.useFunc = f;
+  Y.useFunc = f;
   var o;
-  (function(v) {
-    v[v.Num = 0] = "Num", v[v.Str = 1] = "Str";
-  })(o || (Z.Type = o = {}));
-  function d(v, _, P) {
-    if (v instanceof e.Name) {
+  (function($) {
+    $[$.Num = 0] = "Num", $[$.Str = 1] = "Str";
+  })(o || (Y.Type = o = {}));
+  function d($, _, P) {
+    if ($ instanceof e.Name) {
       const N = _ === o.Num;
-      return P ? N ? (0, e._)`"[" + ${v} + "]"` : (0, e._)`"['" + ${v} + "']"` : N ? (0, e._)`"/" + ${v}` : (0, e._)`"/" + ${v}.replace(/~/g, "~0").replace(/\\//g, "~1")`;
+      return P ? N ? (0, e._)`"[" + ${$} + "]"` : (0, e._)`"['" + ${$} + "']"` : N ? (0, e._)`"/" + ${$}` : (0, e._)`"/" + ${$}.replace(/~/g, "~0").replace(/\\//g, "~1")`;
     }
-    return P ? (0, e.getProperty)(v).toString() : "/" + m(v);
+    return P ? (0, e.getProperty)($).toString() : "/" + m($);
   }
-  Z.getErrorPath = d;
-  function y(v, _, P = v.opts.strictSchema) {
+  Y.getErrorPath = d;
+  function y($, _, P = $.opts.strictSchema) {
     if (P) {
       if (_ = `strict mode: ${_}`, P === !0)
         throw new Error(_);
-      v.self.logger.warn(_);
+      $.self.logger.warn(_);
     }
   }
-  return Z.checkStrictMode = y, Z;
+  return Y.checkStrictMode = y, Y;
 }
 var ot = {}, mn;
 function Pe() {
@@ -1002,25 +1002,25 @@ function mr() {
       message: ({ keyword: u, schemaType: f }) => f ? (0, t.str)`"${u}" keyword must be ${f} ($data)` : (0, t.str)`"${u}" keyword is invalid ($data)`
     };
     function s(u, f = e.keywordError, o, d) {
-      const { it: y } = u, { gen: v, compositeRule: _, allErrors: P } = y, N = b(u, f, o);
-      d ?? (_ || P) ? l(v, N) : p(y, (0, t._)`[${N}]`);
+      const { it: y } = u, { gen: $, compositeRule: _, allErrors: P } = y, N = b(u, f, o);
+      d ?? (_ || P) ? l($, N) : p(y, (0, t._)`[${N}]`);
     }
     e.reportError = s;
     function a(u, f = e.keywordError, o) {
-      const { it: d } = u, { gen: y, compositeRule: v, allErrors: _ } = d, P = b(u, f, o);
-      l(y, P), v || _ || p(d, n.default.vErrors);
+      const { it: d } = u, { gen: y, compositeRule: $, allErrors: _ } = d, P = b(u, f, o);
+      l(y, P), $ || _ || p(d, n.default.vErrors);
     }
     e.reportExtraError = a;
     function i(u, f) {
       u.assign(n.default.errors, f), u.if((0, t._)`${n.default.vErrors} !== null`, () => u.if(f, () => u.assign((0, t._)`${n.default.vErrors}.length`, f), () => u.assign(n.default.vErrors, null)));
     }
     e.resetErrorsCount = i;
-    function c({ gen: u, keyword: f, schemaValue: o, data: d, errsCount: y, it: v }) {
+    function c({ gen: u, keyword: f, schemaValue: o, data: d, errsCount: y, it: $ }) {
       if (y === void 0)
         throw new Error("ajv implementation error");
       const _ = u.name("err");
       u.forRange("i", y, n.default.errors, (P) => {
-        u.const(_, (0, t._)`${n.default.vErrors}[${P}]`), u.if((0, t._)`${_}.instancePath === undefined`, () => u.assign((0, t._)`${_}.instancePath`, (0, t.strConcat)(n.default.instancePath, v.errorPath))), u.assign((0, t._)`${_}.schemaPath`, (0, t.str)`${v.errSchemaPath}/${f}`), v.opts.verbose && (u.assign((0, t._)`${_}.schema`, o), u.assign((0, t._)`${_}.data`, d));
+        u.const(_, (0, t._)`${n.default.vErrors}[${P}]`), u.if((0, t._)`${_}.instancePath === undefined`, () => u.assign((0, t._)`${_}.instancePath`, (0, t.strConcat)(n.default.instancePath, $.errorPath))), u.assign((0, t._)`${_}.schemaPath`, (0, t.str)`${$.errSchemaPath}/${f}`), $.opts.verbose && (u.assign((0, t._)`${_}.schema`, o), u.assign((0, t._)`${_}.data`, d));
       });
     }
     e.extendErrors = c;
@@ -1047,11 +1047,11 @@ function mr() {
       return d === !1 ? (0, t._)`{}` : g(u, f, o);
     }
     function g(u, f, o = {}) {
-      const { gen: d, it: y } = u, v = [
+      const { gen: d, it: y } = u, $ = [
         w(y, o),
         S(u, o)
       ];
-      return h(u, f, v), d.object(...v);
+      return h(u, f, $), d.object(...$);
     }
     function w({ errorPath: u }, { instancePath: f }) {
       const o = f ? (0, t.str)`${u}${(0, r.getErrorPath)(f, r.Type.Str)}` : u;
@@ -1062,8 +1062,8 @@ function mr() {
       return o && (y = (0, t.str)`${y}${(0, r.getErrorPath)(o, r.Type.Str)}`), [m.schemaPath, y];
     }
     function h(u, { params: f, message: o }, d) {
-      const { keyword: y, data: v, schemaValue: _, it: P } = u, { opts: N, propertyName: q, topSchemaRef: U, schemaPath: I } = P;
-      d.push([m.keyword, y], [m.params, typeof f == "function" ? f(u) : f || (0, t._)`{}`]), N.messages && d.push([m.message, typeof o == "function" ? o(u) : o]), N.verbose && d.push([m.schema, _], [m.parentSchema, (0, t._)`${U}${I}`], [n.default.data, v]), q && d.push([m.propertyName, q]);
+      const { keyword: y, data: $, schemaValue: _, it: P } = u, { opts: N, propertyName: q, topSchemaRef: L, schemaPath: I } = P;
+      d.push([m.keyword, y], [m.params, typeof f == "function" ? f(u) : f || (0, t._)`{}`]), N.messages && d.push([m.message, typeof o == "function" ? o(u) : o]), N.verbose && d.push([m.schema, _], [m.parentSchema, (0, t._)`${L}${I}`], [n.default.data, $]), q && d.push([m.propertyName, q]);
     }
   }(Sr)), Sr;
 }
@@ -1174,9 +1174,9 @@ function or() {
   }
   fe.getJSONTypes = c;
   function l(o, d) {
-    const { gen: y, data: v, opts: _ } = o, P = m(d, _.coerceTypes), N = d.length > 0 && !(P.length === 0 && d.length === 1 && (0, t.schemaHasRulesForType)(o, d[0]));
+    const { gen: y, data: $, opts: _ } = o, P = m(d, _.coerceTypes), N = d.length > 0 && !(P.length === 0 && d.length === 1 && (0, t.schemaHasRulesForType)(o, d[0]));
     if (N) {
-      const q = S(d, v, _.strictNumbers, a.Wrong);
+      const q = S(d, $, _.strictNumbers, a.Wrong);
       y.if(q, () => {
         P.length ? b(o, d, P) : u(o);
       });
@@ -1189,43 +1189,43 @@ function or() {
     return d ? o.filter((y) => p.has(y) || d === "array" && y === "array") : [];
   }
   function b(o, d, y) {
-    const { gen: v, data: _, opts: P } = o, N = v.let("dataType", (0, n._)`typeof ${_}`), q = v.let("coerced", (0, n._)`undefined`);
-    P.coerceTypes === "array" && v.if((0, n._)`${N} == 'object' && Array.isArray(${_}) && ${_}.length == 1`, () => v.assign(_, (0, n._)`${_}[0]`).assign(N, (0, n._)`typeof ${_}`).if(S(d, _, P.strictNumbers), () => v.assign(q, _))), v.if((0, n._)`${q} !== undefined`);
+    const { gen: $, data: _, opts: P } = o, N = $.let("dataType", (0, n._)`typeof ${_}`), q = $.let("coerced", (0, n._)`undefined`);
+    P.coerceTypes === "array" && $.if((0, n._)`${N} == 'object' && Array.isArray(${_}) && ${_}.length == 1`, () => $.assign(_, (0, n._)`${_}[0]`).assign(N, (0, n._)`typeof ${_}`).if(S(d, _, P.strictNumbers), () => $.assign(q, _))), $.if((0, n._)`${q} !== undefined`);
     for (const I of y)
-      (p.has(I) || I === "array" && P.coerceTypes === "array") && U(I);
-    v.else(), u(o), v.endIf(), v.if((0, n._)`${q} !== undefined`, () => {
-      v.assign(_, q), g(o, q);
+      (p.has(I) || I === "array" && P.coerceTypes === "array") && L(I);
+    $.else(), u(o), $.endIf(), $.if((0, n._)`${q} !== undefined`, () => {
+      $.assign(_, q), g(o, q);
     });
-    function U(I) {
+    function L(I) {
       switch (I) {
         case "string":
-          v.elseIf((0, n._)`${N} == "number" || ${N} == "boolean"`).assign(q, (0, n._)`"" + ${_}`).elseIf((0, n._)`${_} === null`).assign(q, (0, n._)`""`);
+          $.elseIf((0, n._)`${N} == "number" || ${N} == "boolean"`).assign(q, (0, n._)`"" + ${_}`).elseIf((0, n._)`${_} === null`).assign(q, (0, n._)`""`);
           return;
         case "number":
-          v.elseIf((0, n._)`${N} == "boolean" || ${_} === null
+          $.elseIf((0, n._)`${N} == "boolean" || ${_} === null
               || (${N} == "string" && ${_} && ${_} == +${_})`).assign(q, (0, n._)`+${_}`);
           return;
         case "integer":
-          v.elseIf((0, n._)`${N} === "boolean" || ${_} === null
+          $.elseIf((0, n._)`${N} === "boolean" || ${_} === null
               || (${N} === "string" && ${_} && ${_} == +${_} && !(${_} % 1))`).assign(q, (0, n._)`+${_}`);
           return;
         case "boolean":
-          v.elseIf((0, n._)`${_} === "false" || ${_} === 0 || ${_} === null`).assign(q, !1).elseIf((0, n._)`${_} === "true" || ${_} === 1`).assign(q, !0);
+          $.elseIf((0, n._)`${_} === "false" || ${_} === 0 || ${_} === null`).assign(q, !1).elseIf((0, n._)`${_} === "true" || ${_} === 1`).assign(q, !0);
           return;
         case "null":
-          v.elseIf((0, n._)`${_} === "" || ${_} === 0 || ${_} === false`), v.assign(q, null);
+          $.elseIf((0, n._)`${_} === "" || ${_} === 0 || ${_} === false`), $.assign(q, null);
           return;
         case "array":
-          v.elseIf((0, n._)`${N} === "string" || ${N} === "number"
+          $.elseIf((0, n._)`${N} === "string" || ${N} === "number"
               || ${N} === "boolean" || ${_} === null`).assign(q, (0, n._)`[${_}]`);
       }
     }
   }
-  function g({ gen: o, parentData: d, parentDataProperty: y }, v) {
-    o.if((0, n._)`${d} !== undefined`, () => o.assign((0, n._)`${d}[${y}]`, v));
+  function g({ gen: o, parentData: d, parentDataProperty: y }, $) {
+    o.if((0, n._)`${d} !== undefined`, () => o.assign((0, n._)`${d}[${y}]`, $));
   }
-  function w(o, d, y, v = a.Correct) {
-    const _ = v === a.Correct ? n.operators.EQ : n.operators.NEQ;
+  function w(o, d, y, $ = a.Correct) {
+    const _ = $ === a.Correct ? n.operators.EQ : n.operators.NEQ;
     let P;
     switch (o) {
       case "null":
@@ -1245,15 +1245,15 @@ function or() {
       default:
         return (0, n._)`typeof ${d} ${_} ${o}`;
     }
-    return v === a.Correct ? P : (0, n.not)(P);
+    return $ === a.Correct ? P : (0, n.not)(P);
     function N(q = n.nil) {
       return (0, n.and)((0, n._)`typeof ${d} == "number"`, q, y ? (0, n._)`isFinite(${d})` : n.nil);
     }
   }
   fe.checkDataType = w;
-  function S(o, d, y, v) {
+  function S(o, d, y, $) {
     if (o.length === 1)
-      return w(o[0], d, y, v);
+      return w(o[0], d, y, $);
     let _;
     const P = (0, s.toHash)(o);
     if (P.array && P.object) {
@@ -1263,7 +1263,7 @@ function or() {
       _ = n.nil;
     P.number && delete P.integer;
     for (const N in P)
-      _ = (0, n.and)(_, w(N, d, y, v));
+      _ = (0, n.and)(_, w(N, d, y, $));
     return _;
   }
   fe.checkDataTypes = S;
@@ -1277,15 +1277,15 @@ function or() {
   }
   fe.reportTypeError = u;
   function f(o) {
-    const { gen: d, data: y, schema: v } = o, _ = (0, s.schemaRefOrVal)(o, v, "type");
+    const { gen: d, data: y, schema: $ } = o, _ = (0, s.schemaRefOrVal)(o, $, "type");
     return {
       gen: d,
       keyword: "type",
       data: y,
-      schema: v.type,
+      schema: $.type,
       schemaCode: _,
       schemaValue: _,
-      parentSchema: v,
+      parentSchema: $,
       params: {},
       it: o
     };
@@ -1325,14 +1325,14 @@ function je() {
   bn = 1, Object.defineProperty(ne, "__esModule", { value: !0 }), ne.validateUnion = ne.validateArray = ne.usePattern = ne.callValidateCode = ne.schemaProperties = ne.allSchemaProperties = ne.noPropertyInData = ne.propertyInData = ne.isOwnProperty = ne.hasPropFunc = ne.reportMissingProp = ne.checkMissingProp = ne.checkReportMissingProp = void 0;
   const e = H(), t = Q(), r = Pe(), n = Q();
   function s(o, d) {
-    const { gen: y, data: v, it: _ } = o;
-    y.if(m(y, v, d, _.opts.ownProperties), () => {
+    const { gen: y, data: $, it: _ } = o;
+    y.if(m(y, $, d, _.opts.ownProperties), () => {
       o.setParams({ missingProperty: (0, e._)`${d}` }, !0), o.error();
     });
   }
   ne.checkReportMissingProp = s;
-  function a({ gen: o, data: d, it: { opts: y } }, v, _) {
-    return (0, e.or)(...v.map((P) => (0, e.and)(m(o, d, P, y.ownProperties), (0, e._)`${_} = ${P}`)));
+  function a({ gen: o, data: d, it: { opts: y } }, $, _) {
+    return (0, e.or)(...$.map((P) => (0, e.and)(m(o, d, P, y.ownProperties), (0, e._)`${_} = ${P}`)));
   }
   ne.checkMissingProp = a;
   function i(o, d) {
@@ -1351,14 +1351,14 @@ function je() {
     return (0, e._)`${c(o)}.call(${d}, ${y})`;
   }
   ne.isOwnProperty = l;
-  function p(o, d, y, v) {
+  function p(o, d, y, $) {
     const _ = (0, e._)`${d}${(0, e.getProperty)(y)} !== undefined`;
-    return v ? (0, e._)`${_} && ${l(o, d, y)}` : _;
+    return $ ? (0, e._)`${_} && ${l(o, d, y)}` : _;
   }
   ne.propertyInData = p;
-  function m(o, d, y, v) {
+  function m(o, d, y, $) {
     const _ = (0, e._)`${d}${(0, e.getProperty)(y)} === undefined`;
-    return v ? (0, e.or)(_, (0, e.not)(l(o, d, y))) : _;
+    return $ ? (0, e.or)(_, (0, e.not)(l(o, d, y))) : _;
   }
   ne.noPropertyInData = m;
   function b(o) {
@@ -1369,40 +1369,40 @@ function je() {
     return b(d).filter((y) => !(0, t.alwaysValidSchema)(o, d[y]));
   }
   ne.schemaProperties = g;
-  function w({ schemaCode: o, data: d, it: { gen: y, topSchemaRef: v, schemaPath: _, errorPath: P }, it: N }, q, U, I) {
-    const V = I ? (0, e._)`${o}, ${d}, ${v}${_}` : d, L = [
+  function w({ schemaCode: o, data: d, it: { gen: y, topSchemaRef: $, schemaPath: _, errorPath: P }, it: N }, q, L, I) {
+    const D = I ? (0, e._)`${o}, ${d}, ${$}${_}` : d, U = [
       [r.default.instancePath, (0, e.strConcat)(r.default.instancePath, P)],
       [r.default.parentData, N.parentData],
       [r.default.parentDataProperty, N.parentDataProperty],
       [r.default.rootData, r.default.rootData]
     ];
-    N.opts.dynamicRef && L.push([r.default.dynamicAnchors, r.default.dynamicAnchors]);
-    const W = (0, e._)`${V}, ${y.object(...L)}`;
-    return U !== e.nil ? (0, e._)`${q}.call(${U}, ${W})` : (0, e._)`${q}(${W})`;
+    N.opts.dynamicRef && U.push([r.default.dynamicAnchors, r.default.dynamicAnchors]);
+    const W = (0, e._)`${D}, ${y.object(...U)}`;
+    return L !== e.nil ? (0, e._)`${q}.call(${L}, ${W})` : (0, e._)`${q}(${W})`;
   }
   ne.callValidateCode = w;
   const S = (0, e._)`new RegExp`;
   function h({ gen: o, it: { opts: d } }, y) {
-    const v = d.unicodeRegExp ? "u" : "", { regExp: _ } = d.code, P = _(y, v);
+    const $ = d.unicodeRegExp ? "u" : "", { regExp: _ } = d.code, P = _(y, $);
     return o.scopeValue("pattern", {
       key: P.toString(),
       ref: P,
-      code: (0, e._)`${_.code === "new RegExp" ? S : (0, n.useFunc)(o, _)}(${y}, ${v})`
+      code: (0, e._)`${_.code === "new RegExp" ? S : (0, n.useFunc)(o, _)}(${y}, ${$})`
     });
   }
   ne.usePattern = h;
   function u(o) {
-    const { gen: d, data: y, keyword: v, it: _ } = o, P = d.name("valid");
+    const { gen: d, data: y, keyword: $, it: _ } = o, P = d.name("valid");
     if (_.allErrors) {
       const q = d.let("valid", !0);
       return N(() => d.assign(q, !1)), q;
     }
     return d.var(P, !0), N(() => d.break()), P;
     function N(q) {
-      const U = d.const("len", (0, e._)`${y}.length`);
-      d.forRange("i", 0, U, (I) => {
+      const L = d.const("len", (0, e._)`${y}.length`);
+      d.forRange("i", 0, L, (I) => {
         o.subschema({
-          keyword: v,
+          keyword: $,
           dataProp: I,
           dataPropType: t.Type.Num
         }, P), d.if((0, e.not)(P), q);
@@ -1411,70 +1411,70 @@ function je() {
   }
   ne.validateArray = u;
   function f(o) {
-    const { gen: d, schema: y, keyword: v, it: _ } = o;
+    const { gen: d, schema: y, keyword: $, it: _ } = o;
     if (!Array.isArray(y))
       throw new Error("ajv implementation error");
-    if (y.some((U) => (0, t.alwaysValidSchema)(_, U)) && !_.opts.unevaluated)
+    if (y.some((L) => (0, t.alwaysValidSchema)(_, L)) && !_.opts.unevaluated)
       return;
     const N = d.let("valid", !1), q = d.name("_valid");
-    d.block(() => y.forEach((U, I) => {
-      const V = o.subschema({
-        keyword: v,
+    d.block(() => y.forEach((L, I) => {
+      const D = o.subschema({
+        keyword: $,
         schemaProp: I,
         compositeRule: !0
       }, q);
-      d.assign(N, (0, e._)`${N} || ${q}`), o.mergeValidEvaluated(V, q) || d.if((0, e.not)(N));
+      d.assign(N, (0, e._)`${N} || ${q}`), o.mergeValidEvaluated(D, q) || d.if((0, e.not)(N));
     })), o.result(N, () => o.reset(), () => o.error(!0));
   }
   return ne.validateUnion = f, ne;
 }
 var _n;
-function Di() {
+function Vi() {
   if (_n) return Se;
   _n = 1, Object.defineProperty(Se, "__esModule", { value: !0 }), Se.validateKeywordUsage = Se.validSchemaType = Se.funcKeywordCode = Se.macroKeywordCode = void 0;
   const e = H(), t = Pe(), r = je(), n = mr();
   function s(g, w) {
     const { gen: S, keyword: h, schema: u, parentSchema: f, it: o } = g, d = w.macro.call(o.self, u, f, o), y = p(S, h, d);
     o.opts.validateSchema !== !1 && o.self.validateSchema(d, !0);
-    const v = S.name("valid");
+    const $ = S.name("valid");
     g.subschema({
       schema: d,
       schemaPath: e.nil,
       errSchemaPath: `${o.errSchemaPath}/${h}`,
       topSchemaRef: y,
       compositeRule: !0
-    }, v), g.pass(v, () => g.error(!0));
+    }, $), g.pass($, () => g.error(!0));
   }
   Se.macroKeywordCode = s;
   function a(g, w) {
     var S;
     const { gen: h, keyword: u, schema: f, parentSchema: o, $data: d, it: y } = g;
     l(y, w);
-    const v = !d && w.compile ? w.compile.call(y.self, f, o, y) : w.validate, _ = p(h, u, v), P = h.let("valid");
+    const $ = !d && w.compile ? w.compile.call(y.self, f, o, y) : w.validate, _ = p(h, u, $), P = h.let("valid");
     g.block$data(P, N), g.ok((S = w.valid) !== null && S !== void 0 ? S : P);
     function N() {
       if (w.errors === !1)
-        I(), w.modifying && i(g), V(() => g.error());
+        I(), w.modifying && i(g), D(() => g.error());
       else {
-        const L = w.async ? q() : U();
-        w.modifying && i(g), V(() => c(g, L));
+        const U = w.async ? q() : L();
+        w.modifying && i(g), D(() => c(g, U));
       }
     }
     function q() {
-      const L = h.let("ruleErrs", null);
-      return h.try(() => I((0, e._)`await `), (W) => h.assign(P, !1).if((0, e._)`${W} instanceof ${y.ValidationError}`, () => h.assign(L, (0, e._)`${W}.errors`), () => h.throw(W))), L;
+      const U = h.let("ruleErrs", null);
+      return h.try(() => I((0, e._)`await `), (W) => h.assign(P, !1).if((0, e._)`${W} instanceof ${y.ValidationError}`, () => h.assign(U, (0, e._)`${W}.errors`), () => h.throw(W))), U;
     }
-    function U() {
-      const L = (0, e._)`${_}.errors`;
-      return h.assign(L, null), I(e.nil), L;
+    function L() {
+      const U = (0, e._)`${_}.errors`;
+      return h.assign(U, null), I(e.nil), U;
     }
-    function I(L = w.async ? (0, e._)`await ` : e.nil) {
+    function I(U = w.async ? (0, e._)`await ` : e.nil) {
       const W = y.opts.passContext ? t.default.this : t.default.self, ee = !("compile" in w && !d || w.schema === !1);
-      h.assign(P, (0, e._)`${L}${(0, r.callValidateCode)(g, _, W, ee)}`, w.modifying);
+      h.assign(P, (0, e._)`${U}${(0, r.callValidateCode)(g, _, W, ee)}`, w.modifying);
     }
-    function V(L) {
+    function D(U) {
       var W;
-      h.if((0, e.not)((W = w.valid) !== null && W !== void 0 ? W : P), L);
+      h.if((0, e.not)((W = w.valid) !== null && W !== void 0 ? W : P), U);
     }
   }
   Se.funcKeywordCode = a;
@@ -1518,7 +1518,7 @@ function Di() {
   return Se.validateKeywordUsage = b, Se;
 }
 var Ae = {}, wn;
-function Vi() {
+function Di() {
   if (wn) return Ae;
   wn = 1, Object.defineProperty(Ae, "__esModule", { value: !0 }), Ae.extendSubschemaMode = Ae.extendSubschemaData = Ae.getSubschema = void 0;
   const e = H(), t = Q();
@@ -1752,35 +1752,35 @@ function pr() {
   function S(h, u) {
     if (typeof h == "boolean")
       return {};
-    const { schemaId: f, uriResolver: o } = this.opts, d = b(h[f] || u), y = { "": d }, v = l(o, d, !1), _ = {}, P = /* @__PURE__ */ new Set();
-    return r(h, { allKeys: !0 }, (U, I, V, L) => {
-      if (L === void 0)
+    const { schemaId: f, uriResolver: o } = this.opts, d = b(h[f] || u), y = { "": d }, $ = l(o, d, !1), _ = {}, P = /* @__PURE__ */ new Set();
+    return r(h, { allKeys: !0 }, (L, I, D, U) => {
+      if (U === void 0)
         return;
-      const W = v + I;
-      let ee = y[L];
-      typeof U[f] == "string" && (ee = re.call(this, U[f])), ae.call(this, U.$anchor), ae.call(this, U.$dynamicAnchor), y[I] = ee;
-      function re(Y) {
-        const ce = this.opts.uriResolver.resolve;
-        if (Y = b(ee ? ce(ee, Y) : Y), P.has(Y))
-          throw q(Y);
-        P.add(Y);
-        let M = this.refs[Y];
-        return typeof M == "string" && (M = this.refs[M]), typeof M == "object" ? N(U, M.schema, Y) : Y !== b(W) && (Y[0] === "#" ? (N(U, _[Y], Y), _[Y] = U) : this.refs[Y] = W), Y;
-      }
-      function ae(Y) {
-        if (typeof Y == "string") {
-          if (!w.test(Y))
-            throw new Error(`invalid anchor "${Y}"`);
-          re.call(this, `#${Y}`);
+      const W = $ + I;
+      let ee = y[U];
+      typeof L[f] == "string" && (ee = oe.call(this, L[f])), re.call(this, L.$anchor), re.call(this, L.$dynamicAnchor), y[I] = ee;
+      function oe(Z) {
+        const se = this.opts.uriResolver.resolve;
+        if (Z = b(ee ? se(ee, Z) : Z), P.has(Z))
+          throw q(Z);
+        P.add(Z);
+        let M = this.refs[Z];
+        return typeof M == "string" && (M = this.refs[M]), typeof M == "object" ? N(L, M.schema, Z) : Z !== b(W) && (Z[0] === "#" ? (N(L, _[Z], Z), _[Z] = L) : this.refs[Z] = W), Z;
+      }
+      function re(Z) {
+        if (typeof Z == "string") {
+          if (!w.test(Z))
+            throw new Error(`invalid anchor "${Z}"`);
+          oe.call(this, `#${Z}`);
         }
       }
     }), _;
-    function N(U, I, V) {
-      if (I !== void 0 && !t(U, I))
-        throw q(V);
+    function N(L, I, D) {
+      if (I !== void 0 && !t(L, I))
+        throw q(D);
     }
-    function q(U) {
-      return new Error(`reference "${U}" resolves to more than one schema`);
+    function q(L) {
+      return new Error(`reference "${L}" resolves to more than one schema`);
     }
   }
   return pe.getSchemaRefs = S, pe;
@@ -1789,9 +1789,9 @@ var En;
 function Je() {
   if (En) return Oe;
   En = 1, Object.defineProperty(Oe, "__esModule", { value: !0 }), Oe.getData = Oe.KeywordCxt = Oe.validateFunctionCode = void 0;
-  const e = qi(), t = or(), r = fs(), n = or(), s = Mi(), a = Di(), i = Vi(), c = H(), l = Pe(), p = pr(), m = Q(), b = mr();
+  const e = qi(), t = or(), r = fs(), n = or(), s = Mi(), a = Vi(), i = Di(), c = H(), l = Pe(), p = pr(), m = Q(), b = mr();
   function g(E) {
-    if (v(E) && (P(E), y(E))) {
+    if ($(E) && (P(E), y(E))) {
       u(E);
       return;
     }
@@ -1816,7 +1816,7 @@ function Je() {
   function u(E) {
     const { schema: A, opts: T, gen: z } = E;
     w(E, () => {
-      T.$comment && A.$comment && L(E), U(E), z.let(l.default.vErrors, null), z.let(l.default.errors, 0), T.unevaluated && f(E), N(E), W(E);
+      T.$comment && A.$comment && U(E), L(E), z.let(l.default.vErrors, null), z.let(l.default.errors, 0), T.unevaluated && f(E), N(E), W(E);
     });
   }
   function f(E) {
@@ -1828,7 +1828,7 @@ function Je() {
     return T && (A.code.source || A.code.process) ? (0, c._)`/*# sourceURL=${T} */` : c.nil;
   }
   function d(E, A) {
-    if (v(E) && (P(E), y(E))) {
+    if ($(E) && (P(E), y(E))) {
       _(E, A);
       return;
     }
@@ -1842,12 +1842,12 @@ function Je() {
         return !0;
     return !1;
   }
-  function v(E) {
+  function $(E) {
     return typeof E.schema != "boolean";
   }
   function _(E, A) {
     const { schema: T, gen: z, opts: B } = E;
-    B.$comment && T.$comment && L(E), I(E), V(E);
+    B.$comment && T.$comment && U(E), I(E), D(E);
     const x = z.const("_errs", l.default.errors);
     N(E, x), z.var(A, (0, c._)`${x} === ${l.default.errors}`);
   }
@@ -1856,15 +1856,15 @@ function Je() {
   }
   function N(E, A) {
     if (E.opts.jtd)
-      return re(E, [], !1, A);
+      return oe(E, [], !1, A);
     const T = (0, t.getSchemaTypes)(E.schema), z = (0, t.coerceAndCheckDataType)(E, T);
-    re(E, T, !z, A);
+    oe(E, T, !z, A);
   }
   function q(E) {
     const { schema: A, errSchemaPath: T, opts: z, self: B } = E;
     A.$ref && z.ignoreKeywordsWithRef && (0, m.schemaHasRulesButRef)(A, B.RULES) && B.logger.warn(`$ref: keywords ignored in schema at path "${T}"`);
   }
-  function U(E) {
+  function L(E) {
     const { schema: A, opts: T } = E;
     A.default !== void 0 && T.useDefaults && T.strictSchema && (0, m.checkStrictMode)(E, "default is ignored in the schema root");
   }
@@ -1872,11 +1872,11 @@ function Je() {
     const A = E.schema[E.opts.schemaId];
     A && (E.baseId = (0, p.resolveUrl)(E.opts.uriResolver, E.baseId, A));
   }
-  function V(E) {
+  function D(E) {
     if (E.schema.$async && !E.schemaEnv.$async)
       throw new Error("async schema in sync schema");
   }
-  function L({ gen: E, schemaEnv: A, schema: T, errSchemaPath: z, opts: B }) {
+  function U({ gen: E, schemaEnv: A, schema: T, errSchemaPath: z, opts: B }) {
     const x = T.$comment;
     if (B.$comment === !0)
       E.code((0, c._)`${l.default.self}.logger.log(${x})`);
@@ -1892,32 +1892,32 @@ function Je() {
   function ee({ gen: E, evaluated: A, props: T, items: z }) {
     T instanceof c.Name && E.assign((0, c._)`${A}.props`, T), z instanceof c.Name && E.assign((0, c._)`${A}.items`, z);
   }
-  function re(E, A, T, z) {
+  function oe(E, A, T, z) {
     const { gen: B, schema: x, data: ue, allErrors: we, opts: ge, self: ve } = E, { RULES: le } = ve;
     if (x.$ref && (ge.ignoreKeywordsWithRef || !(0, m.schemaHasRulesButRef)(x, le))) {
       B.block(() => F(E, "$ref", le.all.$ref.definition));
       return;
     }
-    ge.jtd || Y(E, A), B.block(() => {
+    ge.jtd || Z(E, A), B.block(() => {
       for (const _e of le.rules)
-        Ve(_e);
-      Ve(le.post);
+        De(_e);
+      De(le.post);
     });
-    function Ve(_e) {
-      (0, r.shouldUseGroup)(x, _e) && (_e.type ? (B.if((0, n.checkDataType)(_e.type, ue, ge.strictNumbers)), ae(E, _e), A.length === 1 && A[0] === _e.type && T && (B.else(), (0, n.reportTypeError)(E)), B.endIf()) : ae(E, _e), we || B.if((0, c._)`${l.default.errors} === ${z || 0}`));
+    function De(_e) {
+      (0, r.shouldUseGroup)(x, _e) && (_e.type ? (B.if((0, n.checkDataType)(_e.type, ue, ge.strictNumbers)), re(E, _e), A.length === 1 && A[0] === _e.type && T && (B.else(), (0, n.reportTypeError)(E)), B.endIf()) : re(E, _e), we || B.if((0, c._)`${l.default.errors} === ${z || 0}`));
     }
   }
-  function ae(E, A) {
+  function re(E, A) {
     const { gen: T, schema: z, opts: { useDefaults: B } } = E;
     B && (0, s.assignDefaults)(E, A.type), T.block(() => {
       for (const x of A.rules)
         (0, r.shouldUseRule)(z, x) && F(E, x.keyword, x.definition, A.type);
     });
   }
-  function Y(E, A) {
-    E.schemaEnv.meta || !E.opts.strictTypes || (ce(E, A), E.opts.allowUnionTypes || M(E, A), O(E, E.dataTypes));
+  function Z(E, A) {
+    E.schemaEnv.meta || !E.opts.strictTypes || (se(E, A), E.opts.allowUnionTypes || M(E, A), O(E, E.dataTypes));
   }
-  function ce(E, A) {
+  function se(E, A) {
     if (A.length) {
       if (!E.dataTypes.length) {
         E.dataTypes = A;
@@ -1925,7 +1925,7 @@ function Je() {
       }
       A.forEach((T) => {
         k(E.dataTypes, T) || j(E, `type "${T}" not allowed by context "${E.dataTypes.join(",")}"`);
-      }), $(E, A);
+      }), v(E, A);
     }
   }
   function M(E, A) {
@@ -1947,7 +1947,7 @@ function Je() {
   function k(E, A) {
     return E.includes(A) || A === "integer" && E.includes("number");
   }
-  function $(E, A) {
+  function v(E, A) {
     const T = [];
     for (const z of E.dataTypes)
       k(A, z) ? T.push(z) : A.includes("integer") && z === "number" && T.push("integer");
@@ -2063,13 +2063,13 @@ function Je() {
     const B = new R(E, T, A);
     "code" in T ? T.code(B, z) : B.$data && T.validate ? (0, a.funcKeywordCode)(B, T) : "macro" in T ? (0, a.macroKeywordCode)(B, T) : (T.compile || T.validate) && (0, a.funcKeywordCode)(B, T);
   }
-  const D = /^\/(?:[^~]|~0|~1)*$/, X = /^([0-9]+)(#|\/(?:[^~]|~0|~1)*)?$/;
+  const V = /^\/(?:[^~]|~0|~1)*$/, X = /^([0-9]+)(#|\/(?:[^~]|~0|~1)*)?$/;
   function G(E, { dataLevel: A, dataNames: T, dataPathArr: z }) {
     let B, x;
     if (E === "")
       return l.default.rootData;
     if (E[0] === "/") {
-      if (!D.test(E))
+      if (!V.test(E))
         throw new Error(`Invalid JSON-pointer: ${E}`);
       B = E, x = l.default.rootData;
     } else {
@@ -2139,7 +2139,7 @@ function hr() {
     const f = m.call(this, u);
     if (f)
       return f;
-    const o = (0, n.getFullPath)(this.opts.uriResolver, u.root.baseId), { es5: d, lines: y } = this.opts.code, { ownProperties: v } = this.opts, _ = new e.CodeGen(this.scope, { es5: d, lines: y, ownProperties: v });
+    const o = (0, n.getFullPath)(this.opts.uriResolver, u.root.baseId), { es5: d, lines: y } = this.opts.code, { ownProperties: $ } = this.opts, _ = new e.CodeGen(this.scope, { es5: d, lines: y, ownProperties: $ });
     let P;
     u.$async && (P = _.scopeValue("Error", {
       ref: t.default,
@@ -2172,24 +2172,24 @@ function hr() {
       opts: this.opts,
       self: this
     };
-    let U;
+    let L;
     try {
       this._compilations.add(u), (0, a.validateFunctionCode)(q), _.optimize(this.opts.code.optimize);
       const I = _.toString();
-      U = `${_.scopeRefs(r.default.scope)}return ${I}`, this.opts.code.process && (U = this.opts.code.process(U, u));
-      const L = new Function(`${r.default.self}`, `${r.default.scope}`, U)(this, this.scope.get());
-      if (this.scope.value(N, { ref: L }), L.errors = null, L.schema = u.schema, L.schemaEnv = u, u.$async && (L.$async = !0), this.opts.code.source === !0 && (L.source = { validateName: N, validateCode: I, scopeValues: _._values }), this.opts.unevaluated) {
+      L = `${_.scopeRefs(r.default.scope)}return ${I}`, this.opts.code.process && (L = this.opts.code.process(L, u));
+      const U = new Function(`${r.default.self}`, `${r.default.scope}`, L)(this, this.scope.get());
+      if (this.scope.value(N, { ref: U }), U.errors = null, U.schema = u.schema, U.schemaEnv = u, u.$async && (U.$async = !0), this.opts.code.source === !0 && (U.source = { validateName: N, validateCode: I, scopeValues: _._values }), this.opts.unevaluated) {
         const { props: W, items: ee } = q;
-        L.evaluated = {
+        U.evaluated = {
           props: W instanceof e.Name ? void 0 : W,
           items: ee instanceof e.Name ? void 0 : ee,
           dynamicProps: W instanceof e.Name,
           dynamicItems: ee instanceof e.Name
-        }, L.source && (L.source.evaluated = (0, e.stringify)(L.evaluated));
+        }, U.source && (U.source.evaluated = (0, e.stringify)(U.evaluated));
       }
-      return u.validate = L, u;
+      return u.validate = U, u;
     } catch (I) {
-      throw delete u.validate, delete u.validateName, U && this.logger.error("Error compiling schema, function code:", U), I;
+      throw delete u.validate, delete u.validateName, L && this.logger.error("Error compiling schema, function code:", L), I;
     } finally {
       this._compilations.delete(u);
     }
@@ -2201,13 +2201,13 @@ function hr() {
     const y = u.refs[o];
     if (y)
       return y;
-    let v = g.call(this, u, o);
-    if (v === void 0) {
+    let $ = g.call(this, u, o);
+    if ($ === void 0) {
       const _ = (d = u.localRefs) === null || d === void 0 ? void 0 : d[o], { schemaId: P } = this.opts;
-      _ && (v = new i({ schema: _, schemaId: P, root: u, baseId: f }));
+      _ && ($ = new i({ schema: _, schemaId: P, root: u, baseId: f }));
     }
-    if (v !== void 0)
-      return u.refs[o] = p.call(this, v);
+    if ($ !== void 0)
+      return u.refs[o] = p.call(this, $);
   }
   $e.resolveRef = l;
   function p(u) {
@@ -2233,13 +2233,13 @@ function hr() {
     let y = (0, n.getFullPath)(this.opts.uriResolver, u.baseId, void 0);
     if (Object.keys(u.schema).length > 0 && d === y)
       return h.call(this, o, u);
-    const v = (0, n.normalizeId)(d), _ = this.refs[v] || this.schemas[v];
+    const $ = (0, n.normalizeId)(d), _ = this.refs[$] || this.schemas[$];
     if (typeof _ == "string") {
       const P = w.call(this, u, _);
       return typeof P?.schema != "object" ? void 0 : h.call(this, o, P);
     }
     if (typeof _?.schema == "object") {
-      if (_.validate || c.call(this, _), v === (0, n.normalizeId)(f)) {
+      if (_.validate || c.call(this, _), $ === (0, n.normalizeId)(f)) {
         const { schema: P } = _, { schemaId: N } = this.opts, q = P[N];
         return q && (y = (0, n.resolveUrl)(this.opts.uriResolver, y, q)), new i({ schema: P, schemaId: N, root: u, baseId: y });
       }
@@ -2268,14 +2268,14 @@ function hr() {
       const q = typeof o == "object" && o[this.opts.schemaId];
       !S.has(P) && q && (f = (0, n.resolveUrl)(this.opts.uriResolver, f, q));
     }
-    let v;
+    let $;
     if (typeof o != "boolean" && o.$ref && !(0, s.schemaHasRulesButRef)(o, this.RULES)) {
       const P = (0, n.resolveUrl)(this.opts.uriResolver, f, o.$ref);
-      v = w.call(this, d, P);
+      $ = w.call(this, d, P);
     }
     const { schemaId: _ } = this.opts;
-    if (v = v || new i({ schema: o, schemaId: _, root: d, baseId: f }), v.schema !== v.root.schema)
-      return v;
+    if ($ = $ || new i({ schema: o, schemaId: _, root: d, baseId: f }), $.schema !== $.root.schema)
+      return $;
   }
   return $e;
 }
@@ -2287,7 +2287,7 @@ const Fi = "https://raw.githubusercontent.com/ajv-validator/ajv/master/lib/refs/
   properties: Wi,
   additionalProperties: Bi
 };
-var lt = {}, xe = { exports: {} }, Ar, kn;
+var lt = {}, Ye = { exports: {} }, Ar, kn;
 function Hi() {
   return kn || (kn = 1, Ar = {
     HEX: {
@@ -2338,7 +2338,7 @@ function Gi() {
   function s(h) {
     let u = 0;
     const f = { error: !1, address: "", zone: "" }, o = [], d = [];
-    let y = !1, v = !1, _ = !1;
+    let y = !1, $ = !1, _ = !1;
     function P() {
       if (d.length) {
         if (y === !1) {
@@ -2356,13 +2356,13 @@ function Gi() {
       const q = h[N];
       if (!(q === "[" || q === "]"))
         if (q === ":") {
-          if (v === !0 && (_ = !0), !P())
+          if ($ === !0 && (_ = !0), !P())
             break;
           if (u++, o.push(":"), u > 7) {
             f.error = !0;
             break;
           }
-          N - 1 >= 0 && h[N - 1] === ":" && (v = !0);
+          N - 1 >= 0 && h[N - 1] === ":" && ($ = !0);
           continue;
         } else if (q === "%") {
           if (!P())
@@ -2390,8 +2390,8 @@ function Gi() {
     let f = "", o = !0;
     const d = h.length;
     for (let y = 0; y < d; y++) {
-      const v = h[y];
-      v === "0" && o ? (y + 1 <= d && h[y + 1] === u || y + 1 === d) && (f += v, o = !1) : (v === u ? o = !0 : o = !1, f += v);
+      const $ = h[y];
+      $ === "0" && o ? (y + 1 <= d && h[y + 1] === u || y + 1 === d) && (f += $, o = !1) : ($ === u ? o = !0 : o = !1, f += $);
     }
     return f;
   }
@@ -2481,19 +2481,19 @@ function Xi() {
       return o.error = "URN can not be parsed", o;
     const y = o.path.match(t);
     if (y) {
-      const v = d.scheme || o.scheme || "urn";
+      const $ = d.scheme || o.scheme || "urn";
       o.nid = y[1].toLowerCase(), o.nss = y[2];
-      const _ = `${v}:${d.nid || o.nid}`, P = f[_];
+      const _ = `${$}:${d.nid || o.nid}`, P = f[_];
       o.path = void 0, P && (o = P.parse(o, d));
     } else
       o.error = o.error || "URN can not be parsed.";
     return o;
   }
   function l(o, d) {
-    const y = d.scheme || o.scheme || "urn", v = o.nid.toLowerCase(), _ = `${y}:${d.nid || v}`, P = f[_];
+    const y = d.scheme || o.scheme || "urn", $ = o.nid.toLowerCase(), _ = `${y}:${d.nid || $}`, P = f[_];
     P && (o = P.serialize(o, d));
     const N = o, q = o.nss;
-    return N.path = `${v || d.nid}:${q}`, d.skipEscape = !0, N;
+    return N.path = `${$ || d.nid}:${q}`, d.skipEscape = !0, N;
   }
   function p(o, d) {
     const y = o;
@@ -2545,7 +2545,7 @@ function Xi() {
 }
 var Cn;
 function Zi() {
-  if (Cn) return xe.exports;
+  if (Cn) return Ye.exports;
   Cn = 1;
   const { normalizeIPv6: e, normalizeIPv4: t, removeDotSegments: r, recomposeAuthority: n, normalizeComponentEncoding: s } = Gi(), a = Xi();
   function i(u, f) {
@@ -2578,12 +2578,12 @@ function Zi() {
       resourceName: u.resourceName,
       secure: u.secure,
       error: ""
-    }, d = Object.assign({}, f), y = [], v = a[(d.scheme || o.scheme || "").toLowerCase()];
-    v && v.serialize && v.serialize(o, d), o.path !== void 0 && (d.skipEscape ? o.path = unescape(o.path) : (o.path = escape(o.path), o.scheme !== void 0 && (o.path = o.path.split("%3A").join(":")))), d.reference !== "suffix" && o.scheme && y.push(o.scheme, ":");
+    }, d = Object.assign({}, f), y = [], $ = a[(d.scheme || o.scheme || "").toLowerCase()];
+    $ && $.serialize && $.serialize(o, d), o.path !== void 0 && (d.skipEscape ? o.path = unescape(o.path) : (o.path = escape(o.path), o.scheme !== void 0 && (o.path = o.path.split("%3A").join(":")))), d.reference !== "suffix" && o.scheme && y.push(o.scheme, ":");
     const _ = n(o);
     if (_ !== void 0 && (d.reference !== "suffix" && y.push("//"), y.push(_), o.path && o.path.charAt(0) !== "/" && y.push("/")), o.path !== void 0) {
       let P = o.path;
-      !d.absolutePath && (!v || !v.absolutePath) && (P = r(P)), _ === void 0 && (P = P.replace(/^\/\//u, "/%2F")), y.push(P);
+      !d.absolutePath && (!$ || !$.absolutePath) && (P = r(P)), _ === void 0 && (P = P.replace(/^\/\//u, "/%2F")), y.push(P);
     }
     return o.query !== void 0 && y.push("?", o.query), o.fragment !== void 0 && y.push("#", o.fragment), y.join("");
   }
@@ -2606,7 +2606,7 @@ function Zi() {
       query: void 0,
       fragment: void 0
     }, y = u.indexOf("%") !== -1;
-    let v = !1;
+    let $ = !1;
     o.reference === "suffix" && (u = (o.scheme ? o.scheme + ":" : "") + "//" + u);
     const _ = u.match(w);
     if (_) {
@@ -2614,13 +2614,13 @@ function Zi() {
         const N = t(d.host);
         if (N.isIPV4 === !1) {
           const q = e(N.host);
-          d.host = q.host.toLowerCase(), v = q.isIPV6;
+          d.host = q.host.toLowerCase(), $ = q.isIPV6;
         } else
-          d.host = N.host, v = !0;
+          d.host = N.host, $ = !0;
       }
       d.scheme === void 0 && d.userinfo === void 0 && d.host === void 0 && d.port === void 0 && d.query === void 0 && !d.path ? d.reference = "same-document" : d.scheme === void 0 ? d.reference = "relative" : d.fragment === void 0 ? d.reference = "absolute" : d.reference = "uri", o.reference && o.reference !== "suffix" && o.reference !== d.reference && (d.error = d.error || "URI is not a " + o.reference + " reference.");
       const P = a[(o.scheme || d.scheme || "").toLowerCase()];
-      if (!o.unicodeSupport && (!P || !P.unicodeSupport) && d.host && (o.domainHost || P && P.domainHost) && v === !1 && g(d.host))
+      if (!o.unicodeSupport && (!P || !P.unicodeSupport) && d.host && (o.domainHost || P && P.domainHost) && $ === !1 && g(d.host))
         try {
           d.host = URL.domainToASCII(d.host.toLowerCase());
         } catch (N) {
@@ -2640,10 +2640,10 @@ function Zi() {
     serialize: m,
     parse: S
   };
-  return xe.exports = h, xe.exports.default = h, xe.exports.fastUri = h, xe.exports;
+  return Ye.exports = h, Ye.exports.default = h, Ye.exports.fastUri = h, Ye.exports;
 }
 var Tn;
-function xi() {
+function Yi() {
   if (Tn) return lt;
   Tn = 1, Object.defineProperty(lt, "__esModule", { value: !0 });
   const e = Zi();
@@ -2671,7 +2671,7 @@ function Jr() {
     } }), Object.defineProperty(e, "CodeGen", { enumerable: !0, get: function() {
       return r.CodeGen;
     } });
-    const n = at(), s = He(), a = ds(), i = hr(), c = H(), l = pr(), p = or(), m = Q(), b = Ji, g = xi(), w = (M, O) => new RegExp(M, O);
+    const n = at(), s = He(), a = ds(), i = hr(), c = H(), l = pr(), p = or(), m = Q(), b = Ji, g = Yi(), w = (M, O) => new RegExp(M, O);
     w.code = "new RegExp";
     const S = ["removeAdditional", "useDefaults", "coerceTypes"], h = /* @__PURE__ */ new Set([
       "validate",
@@ -2709,11 +2709,11 @@ function Jr() {
       unicode: '"minLength"/"maxLength" account for unicode characters by default.'
     }, o = 200;
     function d(M) {
-      var O, C, k, $, j, R, F, D, X, G, E, A, T, z, B, x, ue, we, ge, ve, le, Ve, _e, gr, vr;
-      const Ge = M.strict, $r = (O = M.code) === null || O === void 0 ? void 0 : O.optimize, nn = $r === !0 || $r === void 0 ? 1 : $r || 0, an = (k = (C = M.code) === null || C === void 0 ? void 0 : C.regExp) !== null && k !== void 0 ? k : w, Hs = ($ = M.uriResolver) !== null && $ !== void 0 ? $ : g.default;
+      var O, C, k, v, j, R, F, V, X, G, E, A, T, z, B, x, ue, we, ge, ve, le, De, _e, gr, vr;
+      const Ge = M.strict, $r = (O = M.code) === null || O === void 0 ? void 0 : O.optimize, nn = $r === !0 || $r === void 0 ? 1 : $r || 0, an = (k = (C = M.code) === null || C === void 0 ? void 0 : C.regExp) !== null && k !== void 0 ? k : w, Hs = (v = M.uriResolver) !== null && v !== void 0 ? v : g.default;
       return {
         strictSchema: (R = (j = M.strictSchema) !== null && j !== void 0 ? j : Ge) !== null && R !== void 0 ? R : !0,
-        strictNumbers: (D = (F = M.strictNumbers) !== null && F !== void 0 ? F : Ge) !== null && D !== void 0 ? D : !0,
+        strictNumbers: (V = (F = M.strictNumbers) !== null && F !== void 0 ? F : Ge) !== null && V !== void 0 ? V : !0,
         strictTypes: (G = (X = M.strictTypes) !== null && X !== void 0 ? X : Ge) !== null && G !== void 0 ? G : "log",
         strictTuples: (A = (E = M.strictTuples) !== null && E !== void 0 ? E : Ge) !== null && A !== void 0 ? A : "log",
         strictRequired: (z = (T = M.strictRequired) !== null && T !== void 0 ? T : Ge) !== null && z !== void 0 ? z : !1,
@@ -2725,7 +2725,7 @@ function Jr() {
         inlineRefs: (ge = M.inlineRefs) !== null && ge !== void 0 ? ge : !0,
         schemaId: (ve = M.schemaId) !== null && ve !== void 0 ? ve : "$id",
         addUsedSchema: (le = M.addUsedSchema) !== null && le !== void 0 ? le : !0,
-        validateSchema: (Ve = M.validateSchema) !== null && Ve !== void 0 ? Ve : !0,
+        validateSchema: (De = M.validateSchema) !== null && De !== void 0 ? De : !0,
         validateFormats: (_e = M.validateFormats) !== null && _e !== void 0 ? _e : !0,
         unicodeRegExp: (gr = M.unicodeRegExp) !== null && gr !== void 0 ? gr : !0,
         int32range: (vr = M.int32range) !== null && vr !== void 0 ? vr : !0,
@@ -2736,17 +2736,17 @@ function Jr() {
       constructor(O = {}) {
         this.schemas = {}, this.refs = {}, this.formats = {}, this._compilations = /* @__PURE__ */ new Set(), this._loading = {}, this._cache = /* @__PURE__ */ new Map(), O = this.opts = { ...O, ...d(O) };
         const { es5: C, lines: k } = this.opts.code;
-        this.scope = new c.ValueScope({ scope: {}, prefixes: h, es5: C, lines: k }), this.logger = V(O.logger);
-        const $ = O.validateFormats;
-        O.validateFormats = !1, this.RULES = (0, a.getRules)(), v.call(this, u, O, "NOT SUPPORTED"), v.call(this, f, O, "DEPRECATED", "warn"), this._metaOpts = U.call(this), O.formats && N.call(this), this._addVocabularies(), this._addDefaultMetaSchema(), O.keywords && q.call(this, O.keywords), typeof O.meta == "object" && this.addMetaSchema(O.meta), P.call(this), O.validateFormats = $;
+        this.scope = new c.ValueScope({ scope: {}, prefixes: h, es5: C, lines: k }), this.logger = D(O.logger);
+        const v = O.validateFormats;
+        O.validateFormats = !1, this.RULES = (0, a.getRules)(), $.call(this, u, O, "NOT SUPPORTED"), $.call(this, f, O, "DEPRECATED", "warn"), this._metaOpts = L.call(this), O.formats && N.call(this), this._addVocabularies(), this._addDefaultMetaSchema(), O.keywords && q.call(this, O.keywords), typeof O.meta == "object" && this.addMetaSchema(O.meta), P.call(this), O.validateFormats = v;
       }
       _addVocabularies() {
         this.addKeyword("$async");
       }
       _addDefaultMetaSchema() {
         const { $data: O, meta: C, schemaId: k } = this.opts;
-        let $ = b;
-        k === "id" && ($ = { ...b }, $.id = $.$id, delete $.$id), C && O && this.addMetaSchema($, $[k], !1);
+        let v = b;
+        k === "id" && (v = { ...b }, v.id = v.$id, delete v.$id), C && O && this.addMetaSchema(v, v[k], !1);
       }
       defaultMeta() {
         const { meta: O, schemaId: C } = this.opts;
@@ -2759,8 +2759,8 @@ function Jr() {
             throw new Error(`no schema with key or ref "${O}"`);
         } else
           k = this.compile(O);
-        const $ = k(C);
-        return "$async" in k || (this.errors = k.errors), $;
+        const v = k(C);
+        return "$async" in k || (this.errors = k.errors), v;
       }
       compile(O, C) {
         const k = this._addSchema(O, C);
@@ -2770,14 +2770,14 @@ function Jr() {
         if (typeof this.opts.loadSchema != "function")
           throw new Error("options.loadSchema should be a function");
         const { loadSchema: k } = this.opts;
-        return $.call(this, O, C);
-        async function $(G, E) {
+        return v.call(this, O, C);
+        async function v(G, E) {
           await j.call(this, G.$schema);
           const A = this._addSchema(G, E);
           return A.validate || R.call(this, A);
         }
         async function j(G) {
-          G && !this.getSchema(G) && await $.call(this, { $ref: G }, !0);
+          G && !this.getSchema(G) && await v.call(this, { $ref: G }, !0);
         }
         async function R(G) {
           try {
@@ -2785,14 +2785,14 @@ function Jr() {
           } catch (E) {
             if (!(E instanceof s.default))
               throw E;
-            return F.call(this, E), await D.call(this, E.missingSchema), R.call(this, G);
+            return F.call(this, E), await V.call(this, E.missingSchema), R.call(this, G);
           }
         }
         function F({ missingSchema: G, missingRef: E }) {
           if (this.refs[G])
             throw new Error(`AnySchema ${G} is loaded but ${E} cannot be resolved`);
         }
-        async function D(G) {
+        async function V(G) {
           const E = await X.call(this, G);
           this.refs[G] || await j.call(this, E.$schema), this.refs[G] || this.addSchema(E, G, C);
         }
@@ -2808,10 +2808,10 @@ function Jr() {
         }
       }
       // Adds schema to the instance
-      addSchema(O, C, k, $ = this.opts.validateSchema) {
+      addSchema(O, C, k, v = this.opts.validateSchema) {
         if (Array.isArray(O)) {
           for (const R of O)
-            this.addSchema(R, void 0, k, $);
+            this.addSchema(R, void 0, k, v);
           return this;
         }
         let j;
@@ -2820,7 +2820,7 @@ function Jr() {
           if (j = O[R], j !== void 0 && typeof j != "string")
             throw new Error(`schema ${R} must be string`);
         }
-        return C = (0, l.normalizeId)(C || j), this._checkUnique(C), this.schemas[C] = this._addSchema(O, k, C, $, !0), this;
+        return C = (0, l.normalizeId)(C || j), this._checkUnique(C), this.schemas[C] = this._addSchema(O, k, C, v, !0), this;
       }
       // Add schema that will be used to validate other schemas
       // options in META_IGNORE_OPTIONS are alway set to false
@@ -2836,15 +2836,15 @@ function Jr() {
           throw new Error("$schema must be a string");
         if (k = k || this.opts.defaultMeta || this.defaultMeta(), !k)
           return this.logger.warn("meta-schema not available"), this.errors = null, !0;
-        const $ = this.validate(k, O);
-        if (!$ && C) {
+        const v = this.validate(k, O);
+        if (!v && C) {
           const j = "schema is invalid: " + this.errorsText();
           if (this.opts.validateSchema === "log")
             this.logger.error(j);
           else
             throw new Error(j);
         }
-        return $;
+        return v;
       }
       // Get compiled schema by `key` or `ref`.
       // (`key` that was passed to `addSchema` or full schema reference - `schema.$id` or resolved id)
@@ -2853,8 +2853,8 @@ function Jr() {
         for (; typeof (C = _.call(this, O)) == "string"; )
           O = C;
         if (C === void 0) {
-          const { schemaId: k } = this.opts, $ = new i.SchemaEnv({ schema: {}, schemaId: k });
-          if (C = i.resolveSchema.call(this, $, O), !C)
+          const { schemaId: k } = this.opts, v = new i.SchemaEnv({ schema: {}, schemaId: k });
+          if (C = i.resolveSchema.call(this, v, O), !C)
             return;
           this.refs[O] = C;
         }
@@ -2901,13 +2901,13 @@ function Jr() {
           throw new Error("invalid addKeywords parameters");
         if (W.call(this, k, C), !C)
           return (0, m.eachItem)(k, (j) => ee.call(this, j)), this;
-        ae.call(this, C);
-        const $ = {
+        re.call(this, C);
+        const v = {
           ...C,
           type: (0, p.getJSONTypes)(C.type),
           schemaType: (0, p.getJSONTypes)(C.schemaType)
         };
-        return (0, m.eachItem)(k, $.type.length === 0 ? (j) => ee.call(this, j, $) : (j) => $.type.forEach((R) => ee.call(this, j, $, R))), this;
+        return (0, m.eachItem)(k, v.type.length === 0 ? (j) => ee.call(this, j, v) : (j) => v.type.forEach((R) => ee.call(this, j, v, R))), this;
       }
       getKeyword(O) {
         const C = this.RULES.all[O];
@@ -2918,8 +2918,8 @@ function Jr() {
         const { RULES: C } = this;
         delete C.keywords[O], delete C.all[O];
         for (const k of C.rules) {
-          const $ = k.rules.findIndex((j) => j.keyword === O);
-          $ >= 0 && k.rules.splice($, 1);
+          const v = k.rules.findIndex((j) => j.keyword === O);
+          v >= 0 && k.rules.splice(v, 1);
         }
         return this;
       }
@@ -2928,33 +2928,33 @@ function Jr() {
         return typeof C == "string" && (C = new RegExp(C)), this.formats[O] = C, this;
       }
       errorsText(O = this.errors, { separator: C = ", ", dataVar: k = "data" } = {}) {
-        return !O || O.length === 0 ? "No errors" : O.map(($) => `${k}${$.instancePath} ${$.message}`).reduce(($, j) => $ + C + j);
+        return !O || O.length === 0 ? "No errors" : O.map((v) => `${k}${v.instancePath} ${v.message}`).reduce((v, j) => v + C + j);
       }
       $dataMetaSchema(O, C) {
         const k = this.RULES.all;
         O = JSON.parse(JSON.stringify(O));
-        for (const $ of C) {
-          const j = $.split("/").slice(1);
+        for (const v of C) {
+          const j = v.split("/").slice(1);
           let R = O;
           for (const F of j)
             R = R[F];
           for (const F in k) {
-            const D = k[F];
-            if (typeof D != "object")
+            const V = k[F];
+            if (typeof V != "object")
               continue;
-            const { $data: X } = D.definition, G = R[F];
-            X && G && (R[F] = ce(G));
+            const { $data: X } = V.definition, G = R[F];
+            X && G && (R[F] = se(G));
           }
         }
         return O;
       }
       _removeAllSchemas(O, C) {
         for (const k in O) {
-          const $ = O[k];
-          (!C || C.test(k)) && (typeof $ == "string" ? delete O[k] : $ && !$.meta && (this._cache.delete($.schema), delete O[k]));
+          const v = O[k];
+          (!C || C.test(k)) && (typeof v == "string" ? delete O[k] : v && !v.meta && (this._cache.delete(v.schema), delete O[k]));
         }
       }
-      _addSchema(O, C, k, $ = this.opts.validateSchema, j = this.opts.addUsedSchema) {
+      _addSchema(O, C, k, v = this.opts.validateSchema, j = this.opts.addUsedSchema) {
         let R;
         const { schemaId: F } = this.opts;
         if (typeof O == "object")
@@ -2965,12 +2965,12 @@ function Jr() {
           if (typeof O != "boolean")
             throw new Error("schema must be object or boolean");
         }
-        let D = this._cache.get(O);
-        if (D !== void 0)
-          return D;
+        let V = this._cache.get(O);
+        if (V !== void 0)
+          return V;
         k = (0, l.normalizeId)(R || k);
         const X = l.getSchemaRefs.call(this, O, k);
-        return D = new i.SchemaEnv({ schema: O, schemaId: F, meta: C, baseId: k, localRefs: X }), this._cache.set(D.schema, D), j && !k.startsWith("#") && (k && this._checkUnique(k), this.refs[k] = D), $ && this.validateSchema(O, !0), D;
+        return V = new i.SchemaEnv({ schema: O, schemaId: F, meta: C, baseId: k, localRefs: X }), this._cache.set(V.schema, V), j && !k.startsWith("#") && (k && this._checkUnique(k), this.refs[k] = V), v && this.validateSchema(O, !0), V;
       }
       _checkUnique(O) {
         if (this.schemas[O] || this.refs[O])
@@ -2992,10 +2992,10 @@ function Jr() {
       }
     }
     y.ValidationError = n.default, y.MissingRefError = s.default, e.default = y;
-    function v(M, O, C, k = "error") {
-      for (const $ in M) {
-        const j = $;
-        j in O && this.logger[k](`${C}: option ${$}. ${M[j]}`);
+    function $(M, O, C, k = "error") {
+      for (const v in M) {
+        const j = v;
+        j in O && this.logger[k](`${C}: option ${v}. ${M[j]}`);
       }
     }
     function _(M) {
@@ -3027,7 +3027,7 @@ function Jr() {
         C.keyword || (C.keyword = O), this.addKeyword(C);
       }
     }
-    function U() {
+    function L() {
       const M = { ...this.opts };
       for (const O of S)
         delete M[O];
@@ -3037,7 +3037,7 @@ function Jr() {
     }, warn() {
     }, error() {
     } };
-    function V(M) {
+    function D(M) {
       if (M === !1)
         return I;
       if (M === void 0)
@@ -3046,24 +3046,24 @@ function Jr() {
         return M;
       throw new Error("logger must implement log, warn and error methods");
     }
-    const L = /^[a-z_$][a-z0-9_$:-]*$/i;
+    const U = /^[a-z_$][a-z0-9_$:-]*$/i;
     function W(M, O) {
       const { RULES: C } = this;
       if ((0, m.eachItem)(M, (k) => {
         if (C.keywords[k])
           throw new Error(`Keyword ${k} is already defined`);
-        if (!L.test(k))
+        if (!U.test(k))
           throw new Error(`Keyword ${k} has invalid name`);
       }), !!O && O.$data && !("code" in O || "validate" in O))
         throw new Error('$data keyword must have "code" or "validate" function');
     }
     function ee(M, O, C) {
       var k;
-      const $ = O?.post;
-      if (C && $)
+      const v = O?.post;
+      if (C && v)
         throw new Error('keyword with "post" flag cannot have "type"');
       const { RULES: j } = this;
-      let R = $ ? j.post : j.rules.find(({ type: D }) => D === C);
+      let R = v ? j.post : j.rules.find(({ type: V }) => V === C);
       if (R || (R = { type: C, rules: [] }, j.rules.push(R)), j.keywords[M] = !0, !O)
         return;
       const F = {
@@ -3074,26 +3074,26 @@ function Jr() {
           schemaType: (0, p.getJSONTypes)(O.schemaType)
         }
       };
-      O.before ? re.call(this, R, F, O.before) : R.rules.push(F), j.all[M] = F, (k = O.implements) === null || k === void 0 || k.forEach((D) => this.addKeyword(D));
+      O.before ? oe.call(this, R, F, O.before) : R.rules.push(F), j.all[M] = F, (k = O.implements) === null || k === void 0 || k.forEach((V) => this.addKeyword(V));
     }
-    function re(M, O, C) {
-      const k = M.rules.findIndex(($) => $.keyword === C);
+    function oe(M, O, C) {
+      const k = M.rules.findIndex((v) => v.keyword === C);
       k >= 0 ? M.rules.splice(k, 0, O) : (M.rules.push(O), this.logger.warn(`rule ${C} is not defined`));
     }
-    function ae(M) {
+    function re(M) {
       let { metaSchema: O } = M;
-      O !== void 0 && (M.$data && this.opts.$data && (O = ce(O)), M.validateSchema = this.compile(O, !0));
+      O !== void 0 && (M.$data && this.opts.$data && (O = se(O)), M.validateSchema = this.compile(O, !0));
     }
-    const Y = {
+    const Z = {
       $ref: "https://raw.githubusercontent.com/ajv-validator/ajv/master/lib/refs/data.json#"
     };
-    function ce(M) {
-      return { anyOf: [M, Y] };
+    function se(M) {
+      return { anyOf: [M, Z] };
     }
   }(wr)), wr;
 }
 var dt = {}, ft = {}, mt = {}, Mn;
-function Yi() {
+function xi() {
   if (Mn) return mt;
   Mn = 1, Object.defineProperty(mt, "__esModule", { value: !0 });
   const e = {
@@ -3104,10 +3104,10 @@ function Yi() {
   };
   return mt.default = e, mt;
 }
-var Ce = {}, Dn;
+var Ce = {}, Vn;
 function Hr() {
-  if (Dn) return Ce;
-  Dn = 1, Object.defineProperty(Ce, "__esModule", { value: !0 }), Ce.callRef = Ce.getValidate = void 0;
+  if (Vn) return Ce;
+  Vn = 1, Object.defineProperty(Ce, "__esModule", { value: !0 }), Ce.callRef = Ce.getValidate = void 0;
   const e = He(), t = je(), r = H(), n = Pe(), s = hr(), a = Q(), i = {
     keyword: "$ref",
     schemaType: "string",
@@ -3119,7 +3119,7 @@ function Hr() {
       if (d === void 0)
         throw new e.default(g.opts.uriResolver, w, b);
       if (d instanceof s.SchemaEnv)
-        return v(d);
+        return $(d);
       return _(d);
       function y() {
         if (S === o)
@@ -3127,19 +3127,19 @@ function Hr() {
         const P = m.scopeValue("root", { ref: o });
         return l(p, (0, r._)`${P}.validate`, o, o.$async);
       }
-      function v(P) {
+      function $(P) {
         const N = c(p, P);
         l(p, N, P, P.$async);
       }
       function _(P) {
-        const N = m.scopeValue("schema", u.code.source === !0 ? { ref: P, code: (0, r.stringify)(P) } : { ref: P }), q = m.name("valid"), U = p.subschema({
+        const N = m.scopeValue("schema", u.code.source === !0 ? { ref: P, code: (0, r.stringify)(P) } : { ref: P }), q = m.name("valid"), L = p.subschema({
           schema: P,
           dataTypes: [],
           schemaPath: r.nil,
           topSchemaRef: N,
           errSchemaPath: b
         }, q);
-        p.mergeEvaluated(U), p.ok(q);
+        p.mergeEvaluated(L), p.ok(q);
       }
     }
   };
@@ -3158,13 +3158,13 @@ function Hr() {
       w.try(() => {
         w.code((0, r._)`await ${(0, t.callValidateCode)(p, m, o)}`), _(m), h || w.assign(P, !0);
       }, (N) => {
-        w.if((0, r._)`!(${N} instanceof ${S.ValidationError})`, () => w.throw(N)), v(N), h || w.assign(P, !1);
+        w.if((0, r._)`!(${N} instanceof ${S.ValidationError})`, () => w.throw(N)), $(N), h || w.assign(P, !1);
       }), p.ok(P);
     }
     function y() {
-      p.result((0, t.callValidateCode)(p, m, o), () => _(m), () => v(m));
+      p.result((0, t.callValidateCode)(p, m, o), () => _(m), () => $(m));
     }
-    function v(P) {
+    function $(P) {
       const N = (0, r._)`${P}.errors`;
       w.assign(n.default.vErrors, (0, r._)`${n.default.vErrors} === null ? ${N} : ${n.default.vErrors}.concat(${N})`), w.assign(n.default.errors, (0, r._)`${n.default.vErrors}.length`);
     }
@@ -3177,25 +3177,25 @@ function Hr() {
         if (q && !q.dynamicProps)
           q.props !== void 0 && (S.props = a.mergeEvaluated.props(w, q.props, S.props));
         else {
-          const U = w.var("props", (0, r._)`${P}.evaluated.props`);
-          S.props = a.mergeEvaluated.props(w, U, S.props, r.Name);
+          const L = w.var("props", (0, r._)`${P}.evaluated.props`);
+          S.props = a.mergeEvaluated.props(w, L, S.props, r.Name);
         }
       if (S.items !== !0)
         if (q && !q.dynamicItems)
           q.items !== void 0 && (S.items = a.mergeEvaluated.items(w, q.items, S.items));
         else {
-          const U = w.var("items", (0, r._)`${P}.evaluated.items`);
-          S.items = a.mergeEvaluated.items(w, U, S.items, r.Name);
+          const L = w.var("items", (0, r._)`${P}.evaluated.items`);
+          S.items = a.mergeEvaluated.items(w, L, S.items, r.Name);
         }
     }
   }
   return Ce.callRef = l, Ce.default = i, Ce;
 }
-var Vn;
+var Dn;
 function ps() {
-  if (Vn) return ft;
-  Vn = 1, Object.defineProperty(ft, "__esModule", { value: !0 });
-  const e = Yi(), t = Hr(), r = [
+  if (Dn) return ft;
+  Dn = 1, Object.defineProperty(ft, "__esModule", { value: !0 });
+  const e = xi(), t = Hr(), r = [
     "$schema",
     "$id",
     "$defs",
@@ -3353,7 +3353,7 @@ function so() {
         const o = a.parentSchema.properties, { definedProperties: d } = a.it;
         for (const y of c)
           if (o?.[y] === void 0 && !d.has(y)) {
-            const v = b.schemaEnv.baseId + b.errSchemaPath, _ = `required property "${y}" is not defined at "${v}" (strictRequired)`;
+            const $ = b.schemaEnv.baseId + b.errSchemaPath, _ = `required property "${y}" is not defined at "${$}" (strictRequired)`;
             (0, r.checkStrictMode)(b, _, b.opts.strictRequired);
           }
       }
@@ -3438,23 +3438,23 @@ function oo() {
       const S = c.let("valid"), h = b.items ? (0, e.getSchemaTypes)(b.items) : [];
       i.block$data(S, u, (0, t._)`${g} === false`), i.ok(S);
       function u() {
-        const y = c.let("i", (0, t._)`${l}.length`), v = c.let("j");
-        i.setParams({ i: y, j: v }), c.assign(S, !0), c.if((0, t._)`${y} > 1`, () => (f() ? o : d)(y, v));
+        const y = c.let("i", (0, t._)`${l}.length`), $ = c.let("j");
+        i.setParams({ i: y, j: $ }), c.assign(S, !0), c.if((0, t._)`${y} > 1`, () => (f() ? o : d)(y, $));
       }
       function f() {
         return h.length > 0 && !h.some((y) => y === "object" || y === "array");
       }
-      function o(y, v) {
+      function o(y, $) {
         const _ = c.name("item"), P = (0, e.checkDataTypes)(h, _, w.opts.strictNumbers, e.DataType.Wrong), N = c.const("indices", (0, t._)`{}`);
         c.for((0, t._)`;${y}--;`, () => {
           c.let(_, (0, t._)`${l}[${y}]`), c.if(P, (0, t._)`continue`), h.length > 1 && c.if((0, t._)`typeof ${_} == "string"`, (0, t._)`${_} += "_"`), c.if((0, t._)`typeof ${N}[${_}] == "number"`, () => {
-            c.assign(v, (0, t._)`${N}[${_}]`), i.error(), c.assign(S, !1).break();
+            c.assign($, (0, t._)`${N}[${_}]`), i.error(), c.assign(S, !1).break();
           }).code((0, t._)`${N}[${_}] = ${y}`);
         });
       }
-      function d(y, v) {
+      function d(y, $) {
         const _ = (0, r.useFunc)(c, n.default), P = c.name("outer");
-        c.label(P).for((0, t._)`;${y}--;`, () => c.for((0, t._)`${v} = ${y}; ${v}--;`, () => c.if((0, t._)`${_}(${l}[${y}], ${l}[${v}])`, () => {
+        c.label(P).for((0, t._)`;${y}--;`, () => c.for((0, t._)`${$} = ${y}; ${$}--;`, () => c.if((0, t._)`${_}(${l}[${y}], ${l}[${$}])`, () => {
           i.error(), c.assign(S, !1).break(P);
         })));
       }
@@ -3520,10 +3520,10 @@ function uo() {
   };
   return Et.default = s, Et;
 }
-var xn;
+var Yn;
 function hs() {
-  if (xn) return pt;
-  xn = 1, Object.defineProperty(pt, "__esModule", { value: !0 });
+  if (Yn) return pt;
+  Yn = 1, Object.defineProperty(pt, "__esModule", { value: !0 });
   const e = Qi(), t = eo(), r = ro(), n = no(), s = ao(), a = so(), i = io(), c = oo(), l = co(), p = uo(), m = [
     // number
     e.default,
@@ -3545,10 +3545,10 @@ function hs() {
   ];
   return pt.default = m, pt;
 }
-var Ot = {}, Fe = {}, Yn;
+var Ot = {}, Fe = {}, xn;
 function ys() {
-  if (Yn) return Fe;
-  Yn = 1, Object.defineProperty(Fe, "__esModule", { value: !0 }), Fe.validateAdditionalItems = void 0;
+  if (xn) return Fe;
+  xn = 1, Object.defineProperty(Fe, "__esModule", { value: !0 }), Fe.validateAdditionalItems = void 0;
   const e = H(), t = Q(), n = {
     keyword: "additionalItems",
     type: "array",
@@ -3615,8 +3615,8 @@ function gs() {
     function h(u) {
       const { opts: f, errSchemaPath: o } = g, d = c.length, y = d === u.minItems && (d === u.maxItems || u[i] === !1);
       if (f.strictTuples && !y) {
-        const v = `"${b}" is ${d}-tuple, but minItems or maxItems/${i} are not specified or different at path "${o}"`;
-        (0, t.checkStrictMode)(g, v, f.strictTuples);
+        const $ = `"${b}" is ${d}-tuple, but minItems or maxItems/${i} are not specified or different at path "${o}"`;
+        (0, t.checkStrictMode)(g, $, f.strictTuples);
       }
     }
   }
@@ -3696,10 +3696,10 @@ function mo() {
         f(d, () => a.if(d, () => o(y)));
       }
       function f(d, y) {
-        a.forRange("i", 0, S, (v) => {
+        a.forRange("i", 0, S, ($) => {
           s.subschema({
             keyword: "contains",
-            dataProp: v,
+            dataProp: $,
             dataPropType: t.Type.Num,
             compositeRule: !0
           }, d), y();
@@ -3867,12 +3867,12 @@ function vs() {
         }
         if (typeof l == "object" && !(0, n.alwaysValidSchema)(g, l)) {
           const P = c.name("valid");
-          S.removeAdditional === "failing" ? (v(_, P, !1), c.if((0, t.not)(P), () => {
+          S.removeAdditional === "failing" ? ($(_, P, !1), c.if((0, t.not)(P), () => {
             i.reset(), d(_);
-          })) : (v(_, P), w || c.if((0, t.not)(P), () => c.break()));
+          })) : ($(_, P), w || c.if((0, t.not)(P), () => c.break()));
         }
       }
-      function v(_, P, N) {
+      function $(_, P, N) {
         const q = {
           keyword: "additionalProperties",
           dataProp: _,
@@ -3944,19 +3944,19 @@ function yo() {
           S && o(y), m.allErrors ? d(y) : (i.var(h, !0), d(y), i.if(h));
       }
       function o(y) {
-        for (const v in S)
-          new RegExp(y).test(v) && (0, r.checkStrictMode)(m, `property ${v} matches pattern ${y} (use allowMatchingProperties)`);
+        for (const $ in S)
+          new RegExp(y).test($) && (0, r.checkStrictMode)(m, `property ${$} matches pattern ${y} (use allowMatchingProperties)`);
       }
       function d(y) {
-        i.forIn("key", l, (v) => {
-          i.if((0, t._)`${(0, e.usePattern)(a, y)}.test(${v})`, () => {
+        i.forIn("key", l, ($) => {
+          i.if((0, t._)`${(0, e.usePattern)(a, y)}.test(${$})`, () => {
             const _ = w.includes(y);
             _ || a.subschema({
               keyword: "patternProperties",
               schemaProp: y,
-              dataProp: v,
+              dataProp: $,
               dataPropType: n.Type.Str
-            }, h), m.opts.unevaluated && u !== !0 ? i.assign((0, t._)`${u}[${v}]`, !0) : !_ && !m.allErrors && i.if((0, t.not)(h), () => i.break());
+            }, h), m.opts.unevaluated && u !== !0 ? i.assign((0, t._)`${u}[${$}]`, !0) : !_ && !m.allErrors && i.if((0, t.not)(h), () => i.break());
           });
         });
       }
@@ -4003,10 +4003,10 @@ function vo() {
   };
   return Mt.default = t, Mt;
 }
-var Dt = {}, la;
+var Vt = {}, la;
 function $o() {
-  if (la) return Dt;
-  la = 1, Object.defineProperty(Dt, "__esModule", { value: !0 });
+  if (la) return Vt;
+  la = 1, Object.defineProperty(Vt, "__esModule", { value: !0 });
   const e = H(), t = Q(), n = {
     keyword: "oneOf",
     schemaType: "array",
@@ -4037,12 +4037,12 @@ function $o() {
       }
     }
   };
-  return Dt.default = n, Dt;
+  return Vt.default = n, Vt;
 }
-var Vt = {}, da;
+var Dt = {}, da;
 function bo() {
-  if (da) return Vt;
-  da = 1, Object.defineProperty(Vt, "__esModule", { value: !0 });
+  if (da) return Dt;
+  da = 1, Object.defineProperty(Dt, "__esModule", { value: !0 });
   const e = Q(), t = {
     keyword: "allOf",
     schemaType: "array",
@@ -4059,7 +4059,7 @@ function bo() {
       });
     }
   };
-  return Vt.default = t, Vt;
+  return Dt.default = t, Dt;
 }
 var zt = {}, fa;
 function _o() {
@@ -4169,8 +4169,8 @@ function So() {
           ref: S.formats,
           code: b.code.formats
         }), o = a.const("fDef", (0, e._)`${f}[${p}]`), d = a.let("fType"), y = a.let("format");
-        a.if((0, e._)`typeof ${o} == "object" && !(${o} instanceof RegExp)`, () => a.assign(d, (0, e._)`${o}.type || "string"`).assign(y, (0, e._)`${o}.validate`), () => a.assign(d, (0, e._)`"string"`).assign(y, o)), n.fail$data((0, e.or)(v(), _()));
-        function v() {
+        a.if((0, e._)`typeof ${o} == "object" && !(${o} instanceof RegExp)`, () => a.assign(d, (0, e._)`${o}.type || "string"`).assign(y, (0, e._)`${o}.validate`), () => a.assign(d, (0, e._)`"string"`).assign(y, o)), n.fail$data((0, e.or)($(), _()));
+        function $() {
           return b.strictSchema === !1 ? e.nil : (0, e._)`${p} && !${y}`;
         }
         function _() {
@@ -4181,14 +4181,14 @@ function So() {
       function u() {
         const f = S.formats[l];
         if (!f) {
-          v();
+          $();
           return;
         }
         if (f === !0)
           return;
         const [o, d, y] = _(f);
         o === s && n.pass(P());
-        function v() {
+        function $() {
           if (b.strictSchema === !1) {
             S.logger.warn(N());
             return;
@@ -4199,8 +4199,8 @@ function So() {
           }
         }
         function _(N) {
-          const q = N instanceof RegExp ? (0, e.regexpCode)(N) : b.code.formats ? (0, e._)`${b.code.formats}${(0, e.getProperty)(l)}` : void 0, U = a.scopeValue("formats", { key: l, ref: N, code: q });
-          return typeof N == "object" && !(N instanceof RegExp) ? [N.type || "string", N.validate, (0, e._)`${U}.validate`] : ["string", N, U];
+          const q = N instanceof RegExp ? (0, e.regexpCode)(N) : b.code.formats ? (0, e._)`${b.code.formats}${(0, e.getProperty)(l)}` : void 0, L = a.scopeValue("formats", { key: l, ref: N, code: q });
+          return typeof N == "object" && !(N instanceof RegExp) ? [N.type || "string", N.validate, (0, e._)`${L}.validate`] : ["string", N, L];
         }
         function P() {
           if (typeof f == "object" && !(f instanceof RegExp) && f.async) {
@@ -4252,14 +4252,14 @@ function ws() {
   ];
   return dt.default = a, dt;
 }
-var Kt = {}, Ye = {}, $a;
+var Kt = {}, xe = {}, $a;
 function Po() {
-  if ($a) return Ye;
-  $a = 1, Object.defineProperty(Ye, "__esModule", { value: !0 }), Ye.DiscrError = void 0;
+  if ($a) return xe;
+  $a = 1, Object.defineProperty(xe, "__esModule", { value: !0 }), xe.DiscrError = void 0;
   var e;
   return function(t) {
     t.Tag = "tag", t.Mapping = "mapping";
-  }(e || (Ye.DiscrError = e = {})), Ye;
+  }(e || (xe.DiscrError = e = {})), xe;
 }
 var ba;
 function Zr() {
@@ -4289,49 +4289,49 @@ function Zr() {
       function f() {
         const y = d();
         l.if(!1);
-        for (const v in y)
-          l.elseIf((0, e._)`${u} === ${v}`), l.assign(h, o(y[v]));
+        for (const $ in y)
+          l.elseIf((0, e._)`${u} === ${$}`), l.assign(h, o(y[$]));
         l.else(), c.error(!1, { discrError: t.DiscrError.Mapping, tag: u, tagName: S }), l.endIf();
       }
       function o(y) {
-        const v = l.name("valid"), _ = c.subschema({ keyword: "oneOf", schemaProp: y }, v);
-        return c.mergeEvaluated(_, e.Name), v;
+        const $ = l.name("valid"), _ = c.subschema({ keyword: "oneOf", schemaProp: y }, $);
+        return c.mergeEvaluated(_, e.Name), $;
       }
       function d() {
         var y;
-        const v = {}, _ = N(b);
+        const $ = {}, _ = N(b);
         let P = !0;
         for (let I = 0; I < w.length; I++) {
-          let V = w[I];
-          if (V?.$ref && !(0, s.schemaHasRulesButRef)(V, g.self.RULES)) {
-            const W = V.$ref;
-            if (V = r.resolveRef.call(g.self, g.schemaEnv.root, g.baseId, W), V instanceof r.SchemaEnv && (V = V.schema), V === void 0)
+          let D = w[I];
+          if (D?.$ref && !(0, s.schemaHasRulesButRef)(D, g.self.RULES)) {
+            const W = D.$ref;
+            if (D = r.resolveRef.call(g.self, g.schemaEnv.root, g.baseId, W), D instanceof r.SchemaEnv && (D = D.schema), D === void 0)
               throw new n.default(g.opts.uriResolver, g.baseId, W);
           }
-          const L = (y = V?.properties) === null || y === void 0 ? void 0 : y[S];
-          if (typeof L != "object")
+          const U = (y = D?.properties) === null || y === void 0 ? void 0 : y[S];
+          if (typeof U != "object")
             throw new Error(`discriminator: oneOf subschemas (or referenced schemas) must have "properties/${S}"`);
-          P = P && (_ || N(V)), q(L, I);
+          P = P && (_ || N(D)), q(U, I);
         }
         if (!P)
           throw new Error(`discriminator: "${S}" must be required`);
-        return v;
+        return $;
         function N({ required: I }) {
           return Array.isArray(I) && I.includes(S);
         }
-        function q(I, V) {
+        function q(I, D) {
           if (I.const)
-            U(I.const, V);
+            L(I.const, D);
           else if (I.enum)
-            for (const L of I.enum)
-              U(L, V);
+            for (const U of I.enum)
+              L(U, D);
           else
             throw new Error(`discriminator: "properties/${S}" must have "const" or "enum"`);
         }
-        function U(I, V) {
-          if (typeof I != "string" || I in v)
+        function L(I, D) {
+          if (typeof I != "string" || I in $)
             throw new Error(`discriminator: "${S}" values must be unique strings`);
-          v[I] = V;
+          $[I] = D;
         }
       }
     }
@@ -4510,10 +4510,10 @@ function Mo() {
   };
   return Zt.default = t, Zt;
 }
-var xt = {}, Aa;
-function Do() {
-  if (Aa) return xt;
-  Aa = 1, Object.defineProperty(xt, "__esModule", { value: !0 });
+var Yt = {}, Aa;
+function Vo() {
+  if (Aa) return Yt;
+  Aa = 1, Object.defineProperty(Yt, "__esModule", { value: !0 });
   const e = Q(), t = {
     keyword: ["maxContains", "minContains"],
     type: "array",
@@ -4522,17 +4522,17 @@ function Do() {
       n.contains === void 0 && (0, e.checkStrictMode)(s, `"${r}" without "contains" is ignored`);
     }
   };
-  return xt.default = t, xt;
+  return Yt.default = t, Yt;
 }
 var ka;
 function Rs() {
   if (ka) return Gt;
   ka = 1, Object.defineProperty(Gt, "__esModule", { value: !0 });
-  const e = qo(), t = Mo(), r = Do(), n = [e.default, t.default, r.default];
+  const e = qo(), t = Mo(), r = Vo(), n = [e.default, t.default, r.default];
   return Gt.default = n, Gt;
 }
-var Yt = {}, Qt = {}, Na;
-function Vo() {
+var xt = {}, Qt = {}, Na;
+function Do() {
   if (Na) return Qt;
   Na = 1, Object.defineProperty(Qt, "__esModule", { value: !0 });
   const e = H(), t = Q(), r = Pe(), s = {
@@ -4612,10 +4612,10 @@ function zo() {
 }
 var Ca;
 function As() {
-  if (Ca) return Yt;
-  Ca = 1, Object.defineProperty(Yt, "__esModule", { value: !0 });
-  const e = Vo(), t = zo(), r = [e.default, t.default];
-  return Yt.default = r, Yt;
+  if (Ca) return xt;
+  Ca = 1, Object.defineProperty(xt, "__esModule", { value: !0 });
+  const e = Do(), t = zo(), r = [e.default, t.default];
+  return xt.default = r, xt;
 }
 var tr = {};
 const Fo = "https://json-schema.org/draft/2019-09/schema", Lo = "https://json-schema.org/draft/2019-09/schema", Uo = { "https://json-schema.org/draft/2019-09/vocab/core": !0, "https://json-schema.org/draft/2019-09/vocab/applicator": !0, "https://json-schema.org/draft/2019-09/vocab/validation": !0, "https://json-schema.org/draft/2019-09/vocab/meta-data": !0, "https://json-schema.org/draft/2019-09/vocab/format": !1, "https://json-schema.org/draft/2019-09/vocab/content": !0 }, Ko = !0, Wo = "Core and Validation specifications meta-schema", Bo = [{ $ref: "meta/core" }, { $ref: "meta/applicator" }, { $ref: "meta/validation" }, { $ref: "meta/meta-data" }, { $ref: "meta/format" }, { $ref: "meta/content" }], Jo = ["object", "boolean"], Ho = { definitions: { $comment: "While no longer an official keyword as it is replaced by $defs, this keyword is retained in the meta-schema to prevent incompatible extensions as it remains in common use.", type: "object", additionalProperties: { $recursiveRef: "#" }, default: {} }, dependencies: { $comment: '"dependencies" is no longer a keyword, but schema authors should avoid redefining it to facilitate a smooth transition to "dependentSchemas" and "dependentRequired"', type: "object", additionalProperties: { anyOf: [{ $recursiveRef: "#" }, { $ref: "meta/validation#/$defs/stringArray" }] } } }, Go = {
@@ -4627,11 +4627,11 @@ const Fo = "https://json-schema.org/draft/2019-09/schema", Lo = "https://json-sc
   allOf: Bo,
   type: Jo,
   properties: Ho
-}, Xo = "https://json-schema.org/draft/2019-09/schema", Zo = "https://json-schema.org/draft/2019-09/meta/applicator", xo = { "https://json-schema.org/draft/2019-09/vocab/applicator": !0 }, Yo = !0, Qo = "Applicator vocabulary meta-schema", ec = ["object", "boolean"], tc = { additionalItems: { $recursiveRef: "#" }, unevaluatedItems: { $recursiveRef: "#" }, items: { anyOf: [{ $recursiveRef: "#" }, { $ref: "#/$defs/schemaArray" }] }, contains: { $recursiveRef: "#" }, additionalProperties: { $recursiveRef: "#" }, unevaluatedProperties: { $recursiveRef: "#" }, properties: { type: "object", additionalProperties: { $recursiveRef: "#" }, default: {} }, patternProperties: { type: "object", additionalProperties: { $recursiveRef: "#" }, propertyNames: { format: "regex" }, default: {} }, dependentSchemas: { type: "object", additionalProperties: { $recursiveRef: "#" } }, propertyNames: { $recursiveRef: "#" }, if: { $recursiveRef: "#" }, then: { $recursiveRef: "#" }, else: { $recursiveRef: "#" }, allOf: { $ref: "#/$defs/schemaArray" }, anyOf: { $ref: "#/$defs/schemaArray" }, oneOf: { $ref: "#/$defs/schemaArray" }, not: { $recursiveRef: "#" } }, rc = { schemaArray: { type: "array", minItems: 1, items: { $recursiveRef: "#" } } }, nc = {
+}, Xo = "https://json-schema.org/draft/2019-09/schema", Zo = "https://json-schema.org/draft/2019-09/meta/applicator", Yo = { "https://json-schema.org/draft/2019-09/vocab/applicator": !0 }, xo = !0, Qo = "Applicator vocabulary meta-schema", ec = ["object", "boolean"], tc = { additionalItems: { $recursiveRef: "#" }, unevaluatedItems: { $recursiveRef: "#" }, items: { anyOf: [{ $recursiveRef: "#" }, { $ref: "#/$defs/schemaArray" }] }, contains: { $recursiveRef: "#" }, additionalProperties: { $recursiveRef: "#" }, unevaluatedProperties: { $recursiveRef: "#" }, properties: { type: "object", additionalProperties: { $recursiveRef: "#" }, default: {} }, patternProperties: { type: "object", additionalProperties: { $recursiveRef: "#" }, propertyNames: { format: "regex" }, default: {} }, dependentSchemas: { type: "object", additionalProperties: { $recursiveRef: "#" } }, propertyNames: { $recursiveRef: "#" }, if: { $recursiveRef: "#" }, then: { $recursiveRef: "#" }, else: { $recursiveRef: "#" }, allOf: { $ref: "#/$defs/schemaArray" }, anyOf: { $ref: "#/$defs/schemaArray" }, oneOf: { $ref: "#/$defs/schemaArray" }, not: { $recursiveRef: "#" } }, rc = { schemaArray: { type: "array", minItems: 1, items: { $recursiveRef: "#" } } }, nc = {
   $schema: Xo,
   $id: Zo,
-  $vocabulary: xo,
-  $recursiveAnchor: Yo,
+  $vocabulary: Yo,
+  $recursiveAnchor: xo,
   title: Qo,
   type: ec,
   properties: tc,
@@ -4668,10 +4668,10 @@ const Fo = "https://json-schema.org/draft/2019-09/schema", Lo = "https://json-sc
   title: Ic,
   type: Cc,
   properties: Tc
-}, Mc = "https://json-schema.org/draft/2019-09/schema", Dc = "https://json-schema.org/draft/2019-09/meta/validation", Vc = { "https://json-schema.org/draft/2019-09/vocab/validation": !0 }, zc = !0, Fc = "Validation vocabulary meta-schema", Lc = ["object", "boolean"], Uc = { multipleOf: { type: "number", exclusiveMinimum: 0 }, maximum: { type: "number" }, exclusiveMaximum: { type: "number" }, minimum: { type: "number" }, exclusiveMinimum: { type: "number" }, maxLength: { $ref: "#/$defs/nonNegativeInteger" }, minLength: { $ref: "#/$defs/nonNegativeIntegerDefault0" }, pattern: { type: "string", format: "regex" }, maxItems: { $ref: "#/$defs/nonNegativeInteger" }, minItems: { $ref: "#/$defs/nonNegativeIntegerDefault0" }, uniqueItems: { type: "boolean", default: !1 }, maxContains: { $ref: "#/$defs/nonNegativeInteger" }, minContains: { $ref: "#/$defs/nonNegativeInteger", default: 1 }, maxProperties: { $ref: "#/$defs/nonNegativeInteger" }, minProperties: { $ref: "#/$defs/nonNegativeIntegerDefault0" }, required: { $ref: "#/$defs/stringArray" }, dependentRequired: { type: "object", additionalProperties: { $ref: "#/$defs/stringArray" } }, const: !0, enum: { type: "array", items: !0 }, type: { anyOf: [{ $ref: "#/$defs/simpleTypes" }, { type: "array", items: { $ref: "#/$defs/simpleTypes" }, minItems: 1, uniqueItems: !0 }] } }, Kc = { nonNegativeInteger: { type: "integer", minimum: 0 }, nonNegativeIntegerDefault0: { $ref: "#/$defs/nonNegativeInteger", default: 0 }, simpleTypes: { enum: ["array", "boolean", "integer", "null", "number", "object", "string"] }, stringArray: { type: "array", items: { type: "string" }, uniqueItems: !0, default: [] } }, Wc = {
+}, Mc = "https://json-schema.org/draft/2019-09/schema", Vc = "https://json-schema.org/draft/2019-09/meta/validation", Dc = { "https://json-schema.org/draft/2019-09/vocab/validation": !0 }, zc = !0, Fc = "Validation vocabulary meta-schema", Lc = ["object", "boolean"], Uc = { multipleOf: { type: "number", exclusiveMinimum: 0 }, maximum: { type: "number" }, exclusiveMaximum: { type: "number" }, minimum: { type: "number" }, exclusiveMinimum: { type: "number" }, maxLength: { $ref: "#/$defs/nonNegativeInteger" }, minLength: { $ref: "#/$defs/nonNegativeIntegerDefault0" }, pattern: { type: "string", format: "regex" }, maxItems: { $ref: "#/$defs/nonNegativeInteger" }, minItems: { $ref: "#/$defs/nonNegativeIntegerDefault0" }, uniqueItems: { type: "boolean", default: !1 }, maxContains: { $ref: "#/$defs/nonNegativeInteger" }, minContains: { $ref: "#/$defs/nonNegativeInteger", default: 1 }, maxProperties: { $ref: "#/$defs/nonNegativeInteger" }, minProperties: { $ref: "#/$defs/nonNegativeIntegerDefault0" }, required: { $ref: "#/$defs/stringArray" }, dependentRequired: { type: "object", additionalProperties: { $ref: "#/$defs/stringArray" } }, const: !0, enum: { type: "array", items: !0 }, type: { anyOf: [{ $ref: "#/$defs/simpleTypes" }, { type: "array", items: { $ref: "#/$defs/simpleTypes" }, minItems: 1, uniqueItems: !0 }] } }, Kc = { nonNegativeInteger: { type: "integer", minimum: 0 }, nonNegativeIntegerDefault0: { $ref: "#/$defs/nonNegativeInteger", default: 0 }, simpleTypes: { enum: ["array", "boolean", "integer", "null", "number", "object", "string"] }, stringArray: { type: "array", items: { type: "string" }, uniqueItems: !0, default: [] } }, Wc = {
   $schema: Mc,
-  $id: Dc,
-  $vocabulary: Vc,
+  $id: Vc,
+  $vocabulary: Dc,
   $recursiveAnchor: zc,
   title: Fc,
   type: Lc,
@@ -4774,10 +4774,10 @@ function Xc() {
   return nr.default = l, nr;
 }
 var ar = {};
-const Zc = "https://json-schema.org/draft/2020-12/schema", xc = "https://json-schema.org/draft/2020-12/schema", Yc = { "https://json-schema.org/draft/2020-12/vocab/core": !0, "https://json-schema.org/draft/2020-12/vocab/applicator": !0, "https://json-schema.org/draft/2020-12/vocab/unevaluated": !0, "https://json-schema.org/draft/2020-12/vocab/validation": !0, "https://json-schema.org/draft/2020-12/vocab/meta-data": !0, "https://json-schema.org/draft/2020-12/vocab/format-annotation": !0, "https://json-schema.org/draft/2020-12/vocab/content": !0 }, Qc = "meta", eu = "Core and Validation specifications meta-schema", tu = [{ $ref: "meta/core" }, { $ref: "meta/applicator" }, { $ref: "meta/unevaluated" }, { $ref: "meta/validation" }, { $ref: "meta/meta-data" }, { $ref: "meta/format-annotation" }, { $ref: "meta/content" }], ru = ["object", "boolean"], nu = "This meta-schema also defines keywords that have appeared in previous drafts in order to prevent incompatible extensions as they remain in common use.", au = { definitions: { $comment: '"definitions" has been replaced by "$defs".', type: "object", additionalProperties: { $dynamicRef: "#meta" }, deprecated: !0, default: {} }, dependencies: { $comment: '"dependencies" has been split and replaced by "dependentSchemas" and "dependentRequired" in order to serve their differing semantics.', type: "object", additionalProperties: { anyOf: [{ $dynamicRef: "#meta" }, { $ref: "meta/validation#/$defs/stringArray" }] }, deprecated: !0, default: {} }, $recursiveAnchor: { $comment: '"$recursiveAnchor" has been replaced by "$dynamicAnchor".', $ref: "meta/core#/$defs/anchorString", deprecated: !0 }, $recursiveRef: { $comment: '"$recursiveRef" has been replaced by "$dynamicRef".', $ref: "meta/core#/$defs/uriReferenceString", deprecated: !0 } }, su = {
+const Zc = "https://json-schema.org/draft/2020-12/schema", Yc = "https://json-schema.org/draft/2020-12/schema", xc = { "https://json-schema.org/draft/2020-12/vocab/core": !0, "https://json-schema.org/draft/2020-12/vocab/applicator": !0, "https://json-schema.org/draft/2020-12/vocab/unevaluated": !0, "https://json-schema.org/draft/2020-12/vocab/validation": !0, "https://json-schema.org/draft/2020-12/vocab/meta-data": !0, "https://json-schema.org/draft/2020-12/vocab/format-annotation": !0, "https://json-schema.org/draft/2020-12/vocab/content": !0 }, Qc = "meta", eu = "Core and Validation specifications meta-schema", tu = [{ $ref: "meta/core" }, { $ref: "meta/applicator" }, { $ref: "meta/unevaluated" }, { $ref: "meta/validation" }, { $ref: "meta/meta-data" }, { $ref: "meta/format-annotation" }, { $ref: "meta/content" }], ru = ["object", "boolean"], nu = "This meta-schema also defines keywords that have appeared in previous drafts in order to prevent incompatible extensions as they remain in common use.", au = { definitions: { $comment: '"definitions" has been replaced by "$defs".', type: "object", additionalProperties: { $dynamicRef: "#meta" }, deprecated: !0, default: {} }, dependencies: { $comment: '"dependencies" has been split and replaced by "dependentSchemas" and "dependentRequired" in order to serve their differing semantics.', type: "object", additionalProperties: { anyOf: [{ $dynamicRef: "#meta" }, { $ref: "meta/validation#/$defs/stringArray" }] }, deprecated: !0, default: {} }, $recursiveAnchor: { $comment: '"$recursiveAnchor" has been replaced by "$dynamicAnchor".', $ref: "meta/core#/$defs/anchorString", deprecated: !0 }, $recursiveRef: { $comment: '"$recursiveRef" has been replaced by "$dynamicRef".', $ref: "meta/core#/$defs/uriReferenceString", deprecated: !0 } }, su = {
   $schema: Zc,
-  $id: xc,
-  $vocabulary: Yc,
+  $id: Yc,
+  $vocabulary: xc,
   $dynamicAnchor: Qc,
   title: eu,
   allOf: tu,
@@ -4809,15 +4809,15 @@ const Zc = "https://json-schema.org/draft/2020-12/schema", xc = "https://json-sc
   title: Ou,
   type: Ru,
   properties: Au
-}, Nu = "https://json-schema.org/draft/2020-12/schema", Iu = "https://json-schema.org/draft/2020-12/meta/core", Cu = { "https://json-schema.org/draft/2020-12/vocab/core": !0 }, Tu = "meta", qu = "Core vocabulary meta-schema", Mu = ["object", "boolean"], Du = { $id: { $ref: "#/$defs/uriReferenceString", $comment: "Non-empty fragments not allowed.", pattern: "^[^#]*#?$" }, $schema: { $ref: "#/$defs/uriString" }, $ref: { $ref: "#/$defs/uriReferenceString" }, $anchor: { $ref: "#/$defs/anchorString" }, $dynamicRef: { $ref: "#/$defs/uriReferenceString" }, $dynamicAnchor: { $ref: "#/$defs/anchorString" }, $vocabulary: { type: "object", propertyNames: { $ref: "#/$defs/uriString" }, additionalProperties: { type: "boolean" } }, $comment: { type: "string" }, $defs: { type: "object", additionalProperties: { $dynamicRef: "#meta" } } }, Vu = { anchorString: { type: "string", pattern: "^[A-Za-z_][-A-Za-z0-9._]*$" }, uriString: { type: "string", format: "uri" }, uriReferenceString: { type: "string", format: "uri-reference" } }, zu = {
+}, Nu = "https://json-schema.org/draft/2020-12/schema", Iu = "https://json-schema.org/draft/2020-12/meta/core", Cu = { "https://json-schema.org/draft/2020-12/vocab/core": !0 }, Tu = "meta", qu = "Core vocabulary meta-schema", Mu = ["object", "boolean"], Vu = { $id: { $ref: "#/$defs/uriReferenceString", $comment: "Non-empty fragments not allowed.", pattern: "^[^#]*#?$" }, $schema: { $ref: "#/$defs/uriString" }, $ref: { $ref: "#/$defs/uriReferenceString" }, $anchor: { $ref: "#/$defs/anchorString" }, $dynamicRef: { $ref: "#/$defs/uriReferenceString" }, $dynamicAnchor: { $ref: "#/$defs/anchorString" }, $vocabulary: { type: "object", propertyNames: { $ref: "#/$defs/uriString" }, additionalProperties: { type: "boolean" } }, $comment: { type: "string" }, $defs: { type: "object", additionalProperties: { $dynamicRef: "#meta" } } }, Du = { anchorString: { type: "string", pattern: "^[A-Za-z_][-A-Za-z0-9._]*$" }, uriString: { type: "string", format: "uri" }, uriReferenceString: { type: "string", format: "uri-reference" } }, zu = {
   $schema: Nu,
   $id: Iu,
   $vocabulary: Cu,
   $dynamicAnchor: Tu,
   title: qu,
   type: Mu,
-  properties: Du,
-  $defs: Vu
+  properties: Vu,
+  $defs: Du
 }, Fu = "https://json-schema.org/draft/2020-12/schema", Lu = "https://json-schema.org/draft/2020-12/meta/format-annotation", Uu = { "https://json-schema.org/draft/2020-12/vocab/format-annotation": !0 }, Ku = "meta", Wu = "Format vocabulary meta-schema for annotation results", Bu = ["object", "boolean"], Ju = { format: { type: "string" } }, Hu = {
   $schema: Fu,
   $id: Lu,
@@ -4826,12 +4826,12 @@ const Zc = "https://json-schema.org/draft/2020-12/schema", xc = "https://json-sc
   title: Wu,
   type: Bu,
   properties: Ju
-}, Gu = "https://json-schema.org/draft/2020-12/schema", Xu = "https://json-schema.org/draft/2020-12/meta/meta-data", Zu = { "https://json-schema.org/draft/2020-12/vocab/meta-data": !0 }, xu = "meta", Yu = "Meta-data vocabulary meta-schema", Qu = ["object", "boolean"], el = { title: { type: "string" }, description: { type: "string" }, default: !0, deprecated: { type: "boolean", default: !1 }, readOnly: { type: "boolean", default: !1 }, writeOnly: { type: "boolean", default: !1 }, examples: { type: "array", items: !0 } }, tl = {
+}, Gu = "https://json-schema.org/draft/2020-12/schema", Xu = "https://json-schema.org/draft/2020-12/meta/meta-data", Zu = { "https://json-schema.org/draft/2020-12/vocab/meta-data": !0 }, Yu = "meta", xu = "Meta-data vocabulary meta-schema", Qu = ["object", "boolean"], el = { title: { type: "string" }, description: { type: "string" }, default: !0, deprecated: { type: "boolean", default: !1 }, readOnly: { type: "boolean", default: !1 }, writeOnly: { type: "boolean", default: !1 }, examples: { type: "array", items: !0 } }, tl = {
   $schema: Gu,
   $id: Xu,
   $vocabulary: Zu,
-  $dynamicAnchor: xu,
-  title: Yu,
+  $dynamicAnchor: Yu,
+  title: xu,
   type: Qu,
   properties: el
 }, rl = "https://json-schema.org/draft/2020-12/schema", nl = "https://json-schema.org/draft/2020-12/meta/validation", al = { "https://json-schema.org/draft/2020-12/vocab/validation": !0 }, sl = "meta", il = "Validation vocabulary meta-schema", ol = ["object", "boolean"], cl = { type: { anyOf: [{ $ref: "#/$defs/simpleTypes" }, { type: "array", items: { $ref: "#/$defs/simpleTypes" }, minItems: 1, uniqueItems: !0 }] }, const: !0, enum: { type: "array", items: !0 }, multipleOf: { type: "number", exclusiveMinimum: 0 }, maximum: { type: "number" }, exclusiveMaximum: { type: "number" }, minimum: { type: "number" }, exclusiveMinimum: { type: "number" }, maxLength: { $ref: "#/$defs/nonNegativeInteger" }, minLength: { $ref: "#/$defs/nonNegativeIntegerDefault0" }, pattern: { type: "string", format: "regex" }, maxItems: { $ref: "#/$defs/nonNegativeInteger" }, minItems: { $ref: "#/$defs/nonNegativeIntegerDefault0" }, uniqueItems: { type: "boolean", default: !1 }, maxContains: { $ref: "#/$defs/nonNegativeInteger" }, minContains: { $ref: "#/$defs/nonNegativeInteger", default: 1 }, maxProperties: { $ref: "#/$defs/nonNegativeInteger" }, minProperties: { $ref: "#/$defs/nonNegativeIntegerDefault0" }, required: { $ref: "#/$defs/stringArray" }, dependentRequired: { type: "object", additionalProperties: { $ref: "#/$defs/stringArray" } } }, ul = { nonNegativeInteger: { type: "integer", minimum: 0 }, nonNegativeIntegerDefault0: { $ref: "#/$defs/nonNegativeInteger", default: 0 }, simpleTypes: { enum: ["array", "boolean", "integer", "null", "number", "object", "string"] }, stringArray: { type: "array", items: { type: "string" }, uniqueItems: !0, default: [] } }, ll = {
@@ -4844,10 +4844,10 @@ const Zc = "https://json-schema.org/draft/2020-12/schema", xc = "https://json-sc
   properties: cl,
   $defs: ul
 };
-var Da;
+var Va;
 function dl() {
-  if (Da) return ar;
-  Da = 1, Object.defineProperty(ar, "__esModule", { value: !0 });
+  if (Va) return ar;
+  Va = 1, Object.defineProperty(ar, "__esModule", { value: !0 });
   const e = su, t = pu, r = wu, n = ku, s = zu, a = Hu, i = tl, c = ll, l = ["/properties"];
   function p(m) {
     return [
@@ -4866,9 +4866,9 @@ function dl() {
   }
   return ar.default = p, ar;
 }
-var Va;
+var Da;
 function fl() {
-  return Va || (Va = 1, function(e, t) {
+  return Da || (Da = 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.Ajv2020 = void 0;
     const r = Jr(), n = Xc(), s = Zr(), a = dl(), i = "https://json-schema.org/draft/2020-12/schema";
     class c extends r.default {
@@ -4927,8 +4927,8 @@ var sr = { exports: {} }, Cr = {}, za;
 function hl() {
   return za || (za = 1, function(e) {
     Object.defineProperty(e, "__esModule", { value: !0 }), e.formatNames = e.fastFormats = e.fullFormats = void 0;
-    function t(I, V) {
-      return { validate: I, compare: V };
+    function t(I, D) {
+      return { validate: I, compare: D };
     }
     e.fullFormats = {
       // date: http://tools.ietf.org/html/rfc3339#section-5.6
@@ -4952,7 +4952,7 @@ function hl() {
       // optimized https://www.safaribooksonline.com/library/view/regular-expressions-cookbook/9780596802837/ch07s16.html
       ipv4: /^(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)\.){3}(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)$/,
       ipv6: /^((([0-9a-f]{1,4}:){7}([0-9a-f]{1,4}|:))|(([0-9a-f]{1,4}:){6}(:[0-9a-f]{1,4}|((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3})|:))|(([0-9a-f]{1,4}:){5}(((:[0-9a-f]{1,4}){1,2})|:((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3})|:))|(([0-9a-f]{1,4}:){4}(((:[0-9a-f]{1,4}){1,3})|((:[0-9a-f]{1,4})?:((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(([0-9a-f]{1,4}:){3}(((:[0-9a-f]{1,4}){1,4})|((:[0-9a-f]{1,4}){0,2}:((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(([0-9a-f]{1,4}:){2}(((:[0-9a-f]{1,4}){1,5})|((:[0-9a-f]{1,4}){0,3}:((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(([0-9a-f]{1,4}:){1}(((:[0-9a-f]{1,4}){1,6})|((:[0-9a-f]{1,4}){0,4}:((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(:(((:[0-9a-f]{1,4}){1,7})|((:[0-9a-f]{1,4}){0,5}:((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:)))$/i,
-      regex: U,
+      regex: L,
       // uuid: http://tools.ietf.org/html/rfc4122
       uuid: /^(?:urn:uuid:)?[0-9a-f]{8}-(?:[0-9a-f]{4}-){3}[0-9a-f]{12}$/i,
       // JSON-pointer: https://tools.ietf.org/html/rfc6901
@@ -4996,66 +4996,66 @@ function hl() {
     }
     const n = /^(\d\d\d\d)-(\d\d)-(\d\d)$/, s = [0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31];
     function a(I) {
-      const V = n.exec(I);
-      if (!V)
+      const D = n.exec(I);
+      if (!D)
         return !1;
-      const L = +V[1], W = +V[2], ee = +V[3];
-      return W >= 1 && W <= 12 && ee >= 1 && ee <= (W === 2 && r(L) ? 29 : s[W]);
+      const U = +D[1], W = +D[2], ee = +D[3];
+      return W >= 1 && W <= 12 && ee >= 1 && ee <= (W === 2 && r(U) ? 29 : s[W]);
     }
-    function i(I, V) {
-      if (I && V)
-        return I > V ? 1 : I < V ? -1 : 0;
+    function i(I, D) {
+      if (I && D)
+        return I > D ? 1 : I < D ? -1 : 0;
     }
     const c = /^(\d\d):(\d\d):(\d\d(?:\.\d+)?)(z|([+-])(\d\d)(?::?(\d\d))?)?$/i;
     function l(I) {
-      return function(L) {
-        const W = c.exec(L);
+      return function(U) {
+        const W = c.exec(U);
         if (!W)
           return !1;
-        const ee = +W[1], re = +W[2], ae = +W[3], Y = W[4], ce = W[5] === "-" ? -1 : 1, M = +(W[6] || 0), O = +(W[7] || 0);
-        if (M > 23 || O > 59 || I && !Y)
+        const ee = +W[1], oe = +W[2], re = +W[3], Z = W[4], se = W[5] === "-" ? -1 : 1, M = +(W[6] || 0), O = +(W[7] || 0);
+        if (M > 23 || O > 59 || I && !Z)
           return !1;
-        if (ee <= 23 && re <= 59 && ae < 60)
+        if (ee <= 23 && oe <= 59 && re < 60)
           return !0;
-        const C = re - O * ce, k = ee - M * ce - (C < 0 ? 1 : 0);
-        return (k === 23 || k === -1) && (C === 59 || C === -1) && ae < 61;
+        const C = oe - O * se, k = ee - M * se - (C < 0 ? 1 : 0);
+        return (k === 23 || k === -1) && (C === 59 || C === -1) && re < 61;
       };
     }
-    function p(I, V) {
-      if (!(I && V))
+    function p(I, D) {
+      if (!(I && D))
         return;
-      const L = (/* @__PURE__ */ new Date("2020-01-01T" + I)).valueOf(), W = (/* @__PURE__ */ new Date("2020-01-01T" + V)).valueOf();
-      if (L && W)
-        return L - W;
+      const U = (/* @__PURE__ */ new Date("2020-01-01T" + I)).valueOf(), W = (/* @__PURE__ */ new Date("2020-01-01T" + D)).valueOf();
+      if (U && W)
+        return U - W;
     }
-    function m(I, V) {
-      if (!(I && V))
+    function m(I, D) {
+      if (!(I && D))
         return;
-      const L = c.exec(I), W = c.exec(V);
-      if (L && W)
-        return I = L[1] + L[2] + L[3], V = W[1] + W[2] + W[3], I > V ? 1 : I < V ? -1 : 0;
+      const U = c.exec(I), W = c.exec(D);
+      if (U && W)
+        return I = U[1] + U[2] + U[3], D = W[1] + W[2] + W[3], I > D ? 1 : I < D ? -1 : 0;
     }
     const b = /t|\s/i;
     function g(I) {
-      const V = l(I);
+      const D = l(I);
       return function(W) {
         const ee = W.split(b);
-        return ee.length === 2 && a(ee[0]) && V(ee[1]);
+        return ee.length === 2 && a(ee[0]) && D(ee[1]);
       };
     }
-    function w(I, V) {
-      if (!(I && V))
+    function w(I, D) {
+      if (!(I && D))
         return;
-      const L = new Date(I).valueOf(), W = new Date(V).valueOf();
-      if (L && W)
-        return L - W;
+      const U = new Date(I).valueOf(), W = new Date(D).valueOf();
+      if (U && W)
+        return U - W;
     }
-    function S(I, V) {
-      if (!(I && V))
+    function S(I, D) {
+      if (!(I && D))
         return;
-      const [L, W] = I.split(b), [ee, re] = V.split(b), ae = i(L, ee);
-      if (ae !== void 0)
-        return ae || p(W, re);
+      const [U, W] = I.split(b), [ee, oe] = D.split(b), re = i(U, ee);
+      if (re !== void 0)
+        return re || p(W, oe);
     }
     const h = /\/|:/, u = /^(?:[a-z][a-z0-9+\-.]*:)(?:\/?\/(?:(?:[a-z0-9\-._~!$&'()*+,;=:]|%[0-9a-f]{2})*@)?(?:\[(?:(?:(?:(?:[0-9a-f]{1,4}:){6}|::(?:[0-9a-f]{1,4}:){5}|(?:[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){4}|(?:(?:[0-9a-f]{1,4}:){0,1}[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){3}|(?:(?:[0-9a-f]{1,4}:){0,2}[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){2}|(?:(?:[0-9a-f]{1,4}:){0,3}[0-9a-f]{1,4})?::[0-9a-f]{1,4}:|(?:(?:[0-9a-f]{1,4}:){0,4}[0-9a-f]{1,4})?::)(?:[0-9a-f]{1,4}:[0-9a-f]{1,4}|(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?))|(?:(?:[0-9a-f]{1,4}:){0,5}[0-9a-f]{1,4})?::[0-9a-f]{1,4}|(?:(?:[0-9a-f]{1,4}:){0,6}[0-9a-f]{1,4})?::)|[Vv][0-9a-f]+\.[a-z0-9\-._~!$&'()*+,;=:]+)\]|(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?)|(?:[a-z0-9\-._~!$&'()*+,;=]|%[0-9a-f]{2})*)(?::\d*)?(?:\/(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})*)*|\/(?:(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})+(?:\/(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})*)*)?|(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})+(?:\/(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})*)*)(?:\?(?:[a-z0-9\-._~!$&'()*+,;=:@/?]|%[0-9a-f]{2})*)?(?:#(?:[a-z0-9\-._~!$&'()*+,;=:@/?]|%[0-9a-f]{2})*)?$/i;
     function f(I) {
@@ -5065,9 +5065,9 @@ function hl() {
     function d(I) {
       return o.lastIndex = 0, o.test(I);
     }
-    const y = -2147483648, v = 2 ** 31 - 1;
+    const y = -2147483648, $ = 2 ** 31 - 1;
     function _(I) {
-      return Number.isInteger(I) && I <= v && I >= y;
+      return Number.isInteger(I) && I <= $ && I >= y;
     }
     function P(I) {
       return Number.isInteger(I);
@@ -5076,7 +5076,7 @@ function hl() {
       return !0;
     }
     const q = /[^\\]\\Z/;
-    function U(I) {
+    function L(I) {
       if (q.test(I))
         return !1;
       try {
@@ -5125,12 +5125,12 @@ function yl() {
             return;
           if (typeof y != "object" || y instanceof RegExp || typeof y.compare != "function")
             throw new Error(`"${b}": format "${d}" does not define "compare" function`);
-          const v = l.scopeValue("formats", {
+          const $ = l.scopeValue("formats", {
             key: d,
             ref: y,
             code: w.code.formats ? (0, r._)`${w.code.formats}${(0, r.getProperty)(d)}` : void 0
           });
-          c.fail$data(o(v));
+          c.fail$data(o($));
         }
         function o(d) {
           return (0, r._)`${d}.compare(${p}, ${m}) ${s[b].fail} 0`;
@@ -5203,7 +5203,7 @@ function wl(e) {
     return s.message = _l(r), t;
   }, {});
 }
-function xr(e) {
+function Yr(e) {
   const t = wl(e);
   return Ee.invalid(t);
 }
@@ -5231,7 +5231,7 @@ function df() {
     // WeakMap doesn't expose size for privacy/security
   };
 }
-function Yr(e, t) {
+function xr(e, t) {
   let r = cr.get(e);
   r == null && (r = /* @__PURE__ */ new WeakMap(), cr.set(e, r));
   const n = r.get(t);
@@ -5271,13 +5271,13 @@ function jl(e) {
   const t = e.indexOf("#");
   return t >= 0 ? e.slice(0, t) : e;
 }
-function Dr(e, t = !0) {
+function Vr(e, t = !0) {
   if (Array.isArray(e))
-    return e.map((r) => Dr(r, !1));
+    return e.map((r) => Vr(r, !1));
   if (e != null && typeof e == "object") {
     const r = e, n = {};
     for (const [s, a] of Object.entries(r))
-      !t && (s === "$id" || s === "$schema" || s === "$dynamicAnchor") || (n[s] = Dr(a, !1));
+      !t && (s === "$id" || s === "$schema" || s === "$dynamicAnchor") || (n[s] = Vr(a, !1));
     return n;
   }
   return e;
@@ -5353,7 +5353,7 @@ async function Ol(e, t) {
       "https://json-schema.org/draft/2019-09/schema",
       "http://json-schema.org/draft-07/schema"
     ])).has(i)) {
-      const m = await Ua(r, n, !1), b = Dr(
+      const m = await Ua(r, n, !1), b = Vr(
         e
       );
       try {
@@ -5546,7 +5546,7 @@ function Ml(e, t, r, n = []) {
   if (!r)
     return null;
   try {
-    if (Yr(r, e)(t)) {
+    if (xr(r, e)(t)) {
       const i = e.title || "disallowed schema";
       return {
         path: n,
@@ -5559,7 +5559,7 @@ function Ml(e, t, r, n = []) {
     return null;
   }
 }
-function Dl(e, t, r, n = []) {
+function Vl(e, t, r, n = []) {
   const s = [], a = [], i = Is(e, t, r);
   i && s.push(i);
   const c = Array.isArray(e.required) ? [...e.required] : [];
@@ -5596,7 +5596,7 @@ function Dl(e, t, r, n = []) {
 function Is(e, t, r) {
   if (!r || !e.if || typeof e.if != "object") return null;
   try {
-    if (Yr(r, e.if)(t)) {
+    if (xr(r, e.if)(t)) {
       const a = e.then;
       if (a && typeof a == "object")
         return a;
@@ -5670,6 +5670,26 @@ class en {
   schemaConflicts;
   notViolations;
   widgetRegistry;
+  /**
+   * Function to set the form's validation status.
+   * Available for custom widgets that need to perform their own validation.
+   */
+  setStatus;
+  /**
+   * Signal containing the entire form's current value.
+   * Useful for cross-field validation or conditional rendering.
+   */
+  formValue;
+  /**
+   * Current validation mode ('eager', 'onTouched', 'onSubmit').
+   * Custom widgets may want to behave differently based on this.
+   */
+  validationMode;
+  /**
+   * Signal indicating whether the form is currently submitting.
+   * Widgets should typically disable during submission.
+   */
+  submitting;
   constructor(t) {
     const {
       schema: r,
@@ -5681,9 +5701,13 @@ class en {
       suppressLabel: l,
       schemaConflicts: p,
       notViolations: m,
-      widgetRegistry: b
+      widgetRegistry: b,
+      setStatus: g,
+      formValue: w,
+      validationMode: S,
+      submitting: h
     } = t;
-    this.schema = r, this.definition = n, this.horizontal = s, this.path = a, this.ajv = i, this.isPropertyRequired = c ?? !1, this.suppressLabel = l ?? !1, this.schemaConflicts = p ?? [], this.notViolations = m ?? [], this.widgetRegistry = b;
+    this.schema = r, this.definition = n, this.horizontal = s, this.path = a, this.ajv = i, this.isPropertyRequired = c ?? !1, this.suppressLabel = l ?? !1, this.schemaConflicts = p ?? [], this.notViolations = m ?? [], this.widgetRegistry = b, this.setStatus = g, this.formValue = w, this.validationMode = S, this.submitting = h;
   }
   with = (t) => new en({
     schema: t.schema ?? this.schema,
@@ -5695,7 +5719,11 @@ class en {
     suppressLabel: t.suppressLabel ?? this.suppressLabel,
     schemaConflicts: t.schemaConflicts ?? this.schemaConflicts,
     notViolations: t.notViolations ?? this.notViolations,
-    widgetRegistry: t.widgetRegistry ?? this.widgetRegistry
+    widgetRegistry: t.widgetRegistry ?? this.widgetRegistry,
+    setStatus: t.setStatus ?? this.setStatus,
+    formValue: t.formValue ?? this.formValue,
+    validationMode: t.validationMode ?? this.validationMode,
+    submitting: t.submitting ?? this.submitting
   });
   append = (t) => this.with({ path: [...this.path, t] });
   get isRoot() {
@@ -5853,40 +5881,32 @@ function be({
   controller: t,
   resolved: r
 }) {
-  const n = r?.widget;
+  const n = r?.widget, s = {
+    controller: t,
+    ctx: e,
+    options: r?.options,
+    setStatus: e.setStatus,
+    formValue: e.formValue,
+    validationMode: e.validationMode,
+    submitting: e.submitting
+  };
   if (n != null && e.widgetRegistry) {
-    const a = e.widgetRegistry.get(n);
-    if (a)
-      return a.factory({
-        controller: t,
-        ctx: e,
-        options: r?.options
-      });
+    const i = e.widgetRegistry.get(n);
+    if (i)
+      return i.factory(s);
   }
   if (n != null) {
-    const a = sn.get(n);
-    if (a)
-      return a.factory({
-        controller: t,
-        ctx: e,
-        options: r?.options
-      });
+    const i = sn.get(n);
+    if (i)
+      return i.factory(s);
   }
   if (e.widgetRegistry) {
-    const a = e.widgetRegistry.findBestWidget(e);
-    if (a)
-      return a.registration.factory({
-        controller: t,
-        ctx: e,
-        options: r?.options
-      });
+    const i = e.widgetRegistry.findBestWidget(e);
+    if (i)
+      return i.registration.factory(s);
   }
-  const s = sn.findBestWidget(e);
-  return s ? s.registration.factory({
-    controller: t,
-    ctx: e,
-    options: r?.options
-  }) : null;
+  const a = sn.findBestWidget(e);
+  return a ? a.registration.factory(s) : null;
 }
 function Ts(e) {
   const {
@@ -5904,7 +5924,7 @@ function Ts(e) {
     );
     return hi({
       options: m,
-      value: se.map(r, (b) => i(b)),
+      value: ae.map(r, (b) => i(b)),
       onChange: (b) => n(c(b)),
       size: a
     });
@@ -5934,7 +5954,7 @@ function qs({
     ) : n
   });
 }
-function Vl(e, t) {
+function Dl(e, t) {
   if (e === null) return t.includes("null") ? "null" : null;
   switch (typeof e) {
     case "string":
@@ -6060,7 +6080,7 @@ const Kl = (e) => {
   const { value: t, onBlur: r, onChange: n, onInput: s, after: a, disabled: i, ...c } = e, l = as(t, i, n ?? s);
   return Gs({
     ...c,
-    value: se.map(t, (p) => p ?? void 0),
+    value: ae.map(t, (p) => p ?? void 0),
     onChange: n != null ? (p) => n(p ?? null) : void 0,
     onInput: s != null ? (p) => s(p ?? null) : void 0,
     onBlur: r,
@@ -6100,7 +6120,7 @@ function Wa({
         placeholder: "HH:MM:SS"
       });
     case "password":
-      return te(Ys, {
+      return te(xs, {
         ...t,
         controller: de(r)
       });
@@ -6122,7 +6142,7 @@ function Wa({
     }
     case "uri":
     case "url":
-      return te(xs, {
+      return te(Ys, {
         ...t,
         controller: de(r),
         placeholder: "https://example.com"
@@ -6190,27 +6210,27 @@ function Wa({
       });
   }
 }
-function Vr({
+function Dr({
   ctx: e,
   controller: t
 }) {
   if (tn(e))
     return ke();
-  const r = {
+  const r = ye(e.definition, e.name), n = r?.widget, s = be({
+    ctx: e,
+    controller: t,
+    resolved: r
+  });
+  if (s)
+    return s;
+  const a = {
     ...Ie({ ctx: e }),
     placeholder: rt(e.definition, String),
     disabled: rn(e)
   };
-  if (e.isNullable && (e.isOptional || !e.shouldShowPresenceToggle))
-    return Wa({ ctx: e, options: r, controller: t });
-  const n = ye(e.definition, e.name), s = n?.widget, a = be({
-    ctx: e,
-    controller: t,
-    resolved: n
-  });
-  if (a)
-    return a;
-  if (s != null && [
+  if ((e.isNullable || e.isOptional) && !e.shouldShowPresenceToggle)
+    return Wa({ ctx: e, options: a, controller: t });
+  if (n != null && [
     "url",
     "uri",
     "uri-reference",
@@ -6223,32 +6243,32 @@ function Vr({
     "markdown",
     "time",
     "color"
-  ].includes(s))
-    return Wa({ ctx: e, options: r, controller: t });
-  switch (s) {
+  ].includes(n))
+    return Wa({ ctx: e, options: a, controller: t });
+  switch (n) {
     case "email":
       return te(Ci, {
-        ...r,
+        ...a,
         controller: Xe(t)
       });
     case "password":
       return te(Ii, {
-        ...r,
+        ...a,
         controller: Xe(t)
       });
     case "uuid":
       return te(bi, {
-        ...r,
+        ...a,
         controller: Xe(t)
       });
     case "textarea":
       return te($i, {
-        ...r,
+        ...a,
         controller: Xe(t)
       });
     default:
       return te(ki, {
-        ...r,
+        ...a,
         controller: Xe(t)
       });
   }
@@ -6287,7 +6307,7 @@ function ur({
     max: r.maximum,
     step: r.multipleOf,
     disabled: rn(e)
-  }, c = e.isNullable && (e.isOptional || !e.shouldShowPresenceToggle);
+  }, c = (e.isNullable || e.isOptional) && !e.shouldShowPresenceToggle;
   switch (n.widget) {
     case "rating":
       const l = (typeof n.options?.max == "number" ? n.options.max : r.maximum) || 5;
@@ -6391,7 +6411,7 @@ function Fr({
     ...s,
     controller: t
   });
-  return !e.isNullable || e.isOptional && !e.shouldShowPresenceToggle ? a : te(on, {
+  return !e.isNullable && (!e.isOptional || e.shouldShowPresenceToggle) ? a : te(on, {
     ...s,
     controller: t,
     after: as(
@@ -6415,7 +6435,7 @@ function Ms({
   });
 }
 let qr = /* @__PURE__ */ new WeakMap(), Ha = /* @__PURE__ */ new WeakMap();
-function Ds(e, t) {
+function Vs(e, t) {
   const r = typeof t == "object" && t != null ? t : null;
   if (r != null) {
     const i = qr.get(r)?.get(e);
@@ -6423,7 +6443,7 @@ function Ds(e, t) {
   }
   let n = e;
   const s = /* @__PURE__ */ new Set();
-  for (; Vs(n); ) {
+  for (; Ds(n); ) {
     const a = n.$ref;
     if (!a.startsWith("#")) {
       console.warn(`resolveRef: external $ref not supported here: ${a}`);
@@ -6450,7 +6470,7 @@ function Ds(e, t) {
   }
   return n;
 }
-function Vs(e) {
+function Ds(e) {
   return yr(e) && typeof e.$ref == "string";
 }
 function yr(e) {
@@ -6482,7 +6502,7 @@ function Fs(e, t, r) {
     const { $ref: l, ...p } = c;
     return { ...i, ...p };
   };
-  for (; Vs(n); ) {
+  for (; Ds(n); ) {
     const i = n.$ref;
     if (s.has(i)) {
       console.warn(
@@ -6580,7 +6600,7 @@ function Gl({
   controller: t,
   content: r
 }) {
-  const n = se.map(t.signal, (i) => i !== void 0), s = e.widgetLabel ?? "Property", a = (i) => {
+  const n = ae.map(t.signal, (i) => i !== void 0), s = e.widgetLabel ?? "Property", a = (i) => {
     if (i) {
       const c = e.default;
       if (c !== void 0)
@@ -6725,7 +6745,7 @@ function Us(e, t) {
       return !1;
   }
 }
-function xl(e, t) {
+function Yl(e, t) {
   try {
     if (typeof e == "string") {
       const r = Xl(e);
@@ -6736,9 +6756,9 @@ function xl(e, t) {
     return console.warn("Error evaluating visibility condition:", r), !0;
   }
 }
-function Yl(e, t) {
-  return oe(t)(
-    (r) => xl(e, r)
+function xl(e, t) {
+  return ce(t)(
+    (r) => Yl(e, r)
   );
 }
 const Xa = {
@@ -6754,7 +6774,7 @@ function Ql({
   const s = Ls(e.definition);
   if (!s)
     return r;
-  const a = { ...Xa, ...n }, i = ed(t), c = Yl(s, i);
+  const a = { ...Xa, ...n }, i = ed(t), c = xl(s, i);
   switch (a.clearOnHide && c.on((l) => {
     !l && t.signal.value !== void 0 && t.change(void 0);
   }), a.behavior) {
@@ -6818,7 +6838,7 @@ function rd({
   const s = e.definition;
   return ke(
     ss(() => {
-      se.get(t.signal) !== s.const && t.change(s.const);
+      ae.get(t.signal) !== s.const && t.change(s.const);
     }),
     Si(li(e.widgetLabel, ": "), We(String(s.const)))
   );
@@ -6850,7 +6870,7 @@ function nd(e, t, r) {
   const S = (f) => {
     const o = (f ?? "").trim();
     if (!o || o === e || Object.prototype.hasOwnProperty.call(
-      se.get(n.signal) ?? {},
+      ae.get(n.signal) ?? {},
       o
     ))
       return;
@@ -6860,24 +6880,24 @@ function nd(e, t, r) {
       return;
     }
     g.set(null);
-    const y = { ...se.get(n.signal) ?? {} }, v = y[e];
-    delete y[e], y[o] = v, n.change(y);
+    const y = { ...ae.get(n.signal) ?? {} }, $ = y[e];
+    delete y[e], y[o] = $, n.change(y);
   }, h = Wr(
     Br,
     (f) => ns({
       size: "xs",
       label: f.$.removeItem,
       disabled: !c(
-        Object.keys(se.get(n.signal) ?? {}).length
+        Object.keys(ae.get(n.signal) ?? {}).length
       ),
       onClick: () => {
-        const o = Object.keys(se.get(n.signal) ?? {}).length;
+        const o = Object.keys(ae.get(n.signal) ?? {}).length;
         if (!c(o)) return;
-        const d = { ...se.get(n.signal) ?? {} };
+        const d = { ...ae.get(n.signal) ?? {} };
         delete d[e], n.change(d);
       }
     })
-  ), u = se.map(
+  ), u = ae.map(
     m.signal,
     (f) => l && f != null
   );
@@ -6888,7 +6908,7 @@ function nd(e, t, r) {
       content: rs({
         value: b,
         onChange: S,
-        disabled: oe(
+        disabled: ce(
           n.disabled,
           u
         )((f, o) => f || o)
@@ -6904,7 +6924,7 @@ function nd(e, t, r) {
       ) : null
     }),
     J.div(
-      De({
+      Ve({
         ctx: s.with({ definition: w, suppressLabel: !0 }).append(e),
         controller: m
       })
@@ -6944,7 +6964,7 @@ function ad(e, t, r) {
   const h = (o) => {
     const d = (o ?? "").trim();
     if (!d || d === e || Object.prototype.hasOwnProperty.call(
-      se.get(n.signal) ?? {},
+      ae.get(n.signal) ?? {},
       d
     ))
       return;
@@ -6954,24 +6974,24 @@ function ad(e, t, r) {
       return;
     }
     w.set(null);
-    const v = { ...se.get(n.signal) ?? {} }, _ = v[e];
-    delete v[e], v[d] = _, n.change(v);
+    const $ = { ...ae.get(n.signal) ?? {} }, _ = $[e];
+    delete $[e], $[d] = _, n.change($);
   }, u = Wr(
     Br,
     (o) => ns({
       size: "xs",
       label: o.$.removeItem,
       disabled: !l(
-        Object.keys(se.get(n.signal) ?? {}).length
+        Object.keys(ae.get(n.signal) ?? {}).length
       ),
       onClick: () => {
-        const d = Object.keys(se.get(n.signal) ?? {}).length;
+        const d = Object.keys(ae.get(n.signal) ?? {}).length;
         if (!l(d)) return;
-        const y = { ...se.get(n.signal) ?? {} };
+        const y = { ...ae.get(n.signal) ?? {} };
         delete y[e], n.change(y);
       }
     })
-  ), f = se.map(
+  ), f = ae.map(
     b.signal,
     (o) => p && o != null
   );
@@ -6982,7 +7002,7 @@ function ad(e, t, r) {
       content: rs({
         value: g,
         onChange: h,
-        disabled: oe(
+        disabled: ce(
           n.disabled,
           f
         )((o, d) => o || d)
@@ -7001,7 +7021,7 @@ function ad(e, t, r) {
       )
     }),
     J.div(
-      De({
+      Ve({
         ctx: s.with({ definition: S, suppressLabel: !0 }).append(e),
         controller: b
       })
@@ -7048,7 +7068,7 @@ function cd({
   cols: e = 1,
   children: t
 }) {
-  const r = typeof e == "number" ? `bc-schema-grid bc-schema-grid--cols-${e}` : oe(e)((n) => {
+  const r = typeof e == "number" ? `bc-schema-grid bc-schema-grid--cols-${e}` : ce(e)((n) => {
     if (typeof n == "number")
       return `bc-schema-grid bc-schema-grid--cols-${n}`;
     if (n && typeof n == "object") {
@@ -7081,7 +7101,7 @@ function ud({
           K.type("button"),
           K.class("bc-tabs__tab"),
           K.class(
-            oe(r)(
+            ce(r)(
               (i) => i === s ? "bc-tabs__tab--active" : ""
             )
           ),
@@ -7121,7 +7141,7 @@ function ud({
         ([s, a]) => J.div(
           K.class("bc-tabs__panel"),
           K.class(
-            oe(r)(
+            ce(r)(
               (i) => i === s ? "bc-tabs__panel--active" : "bc-tabs__panel--hidden"
             )
           ),
@@ -7164,7 +7184,7 @@ function dd({
   return J.div(
     K.class("bc-accordion"),
     ...r.map(([s, a]) => {
-      const i = oe(n)(
+      const i = ce(n)(
         (c) => c.has(s)
       );
       return J.div(
@@ -7186,7 +7206,7 @@ function dd({
           }),
           J.span(s),
           us({
-            icon: oe(i)(
+            icon: ce(i)(
               (c) => c ? "chevron-up" : "chevron-down"
             ),
             size: "sm"
@@ -7195,7 +7215,7 @@ function dd({
         J.div(
           K.class("bc-accordion__content"),
           K.class(
-            oe(i)(
+            ce(i)(
               (c) => c ? "bc-accordion__content--open" : "bc-accordion__content--closed"
             )
           ),
@@ -7223,7 +7243,7 @@ function fd({
         tt.click(() => r.set(!r.value)),
         J.span(e),
         us({
-          icon: oe(r)(
+          icon: ce(r)(
             (n) => n ? "chevron-up" : "chevron-down"
           ),
           size: "sm"
@@ -7232,7 +7252,7 @@ function fd({
       J.div(
         K.class("bc-accordion__content"),
         K.class(
-          oe(r)(
+          ce(r)(
             (n) => n ? "bc-accordion__content--open" : "bc-accordion__content--closed"
           )
         ),
@@ -7321,7 +7341,7 @@ function Ks({
     resolved: r
   });
   return n || fr(t.signal, (s) => {
-    const a = e.definition, { effective: i, conflicts: c } = Dl(
+    const a = e.definition, { effective: i, conflicts: c } = Vl(
       a,
       s,
       e.ajv,
@@ -7335,25 +7355,25 @@ function Ks({
       e.ajv
     ), h = g.filter((R) => !S.has(R)), u = g.filter(
       (R) => S.has(R)
-    ), f = i.additionalProperties ?? !0, o = f !== !1, d = f === !0 || f === void 0 ? {} : f, y = i.minProperties ?? 0, v = i.maxProperties ?? 1 / 0;
+    ), f = i.additionalProperties ?? !0, o = f !== !1, d = f === !0 || f === void 0 ? {} : f, y = i.minProperties ?? 0, $ = i.maxProperties ?? 1 / 0;
     let _ = !0, P = null;
     w === !1 ? (_ = !1, P = "No unevaluated properties are allowed by schema") : w && typeof w == "object" && (_ = !0);
-    const N = o && _ && b.length < v, q = (R) => R > y, U = i.patternProperties ?? {}, I = Object.keys(U).filter(Boolean).map((R) => {
+    const N = o && _ && b.length < $, q = (R) => R > y, L = i.patternProperties ?? {}, I = Object.keys(L).filter(Boolean).map((R) => {
       try {
         return new RegExp(R);
       } catch {
         return null;
       }
-    }).filter((R) => R != null), V = i.propertyNames, L = (R) => {
+    }).filter((R) => R != null), D = i.propertyNames, U = (R) => {
       const F = (R ?? "").trim();
       if (F === "") return { ok: !1, message: "Key cannot be empty" };
-      if (V === !1)
+      if (D === !1)
         return { ok: !1, message: "No property names are allowed by schema" };
-      if (V && typeof V == "object" && e.ajv)
+      if (D && typeof D == "object" && e.ajv)
         try {
-          const D = e.ajv.compile(V);
-          if (!D(F))
-            return { ok: !1, message: D.errors?.[0]?.message ?? "Invalid property name" };
+          const V = e.ajv.compile(D);
+          if (!V(F))
+            return { ok: !1, message: V.errors?.[0]?.message ?? "Invalid property name" };
         } catch {
         }
       if (!o && !m.has(F)) {
@@ -7362,26 +7382,26 @@ function Ks({
         if (!I.some((X) => X.test(F)))
           return {
             ok: !1,
-            message: `Key must match one of: ${Object.keys(U).join(", ")}`
+            message: `Key must match one of: ${Object.keys(L).join(", ")}`
           };
       }
       return { ok: !0 };
-    }, W = i["x:ui"], ee = !!(W && typeof W == "object" && W.lockKeyAfterSet), re = (R) => {
+    }, W = i["x:ui"], ee = !!(W && typeof W == "object" && W.lockKeyAfterSet), oe = (R) => {
       const F = rt(R, (X) => X);
       if (F !== void 0) return F;
-      const D = R.type;
-      if (D === "string") return "";
-      if (D === "number" || D === "integer") return 0;
-      if (D === "boolean") return !1;
-      if (D === "array") return [];
-      if (D === "object") return {};
-    }, ae = (R, F) => {
-      const D = R, X = (E) => F.has(E) ? !1 : L(E).ok;
-      if (X(D)) return D;
+      const V = R.type;
+      if (V === "string") return "";
+      if (V === "number" || V === "integer") return 0;
+      if (V === "boolean") return !1;
+      if (V === "array") return [];
+      if (V === "object") return {};
+    }, re = (R, F) => {
+      const V = R, X = (E) => F.has(E) ? !1 : U(E).ok;
+      if (X(V)) return V;
       let G = 1;
-      for (; F.has(D + G) || !X(D + G); ) G++;
-      return D + G;
-    }, Y = Wr(
+      for (; F.has(V + G) || !X(V + G); ) G++;
+      return V + G;
+    }, Z = Wr(
       Br,
       (R) => Ni(
         {
@@ -7390,14 +7410,14 @@ function Ks({
           onClick: () => {
             if (!N) return;
             const F = new Set(
-              Object.keys(se.get(t.signal) ?? {})
-            ), D = ae("property", F);
-            if (!L(D).ok) return;
+              Object.keys(ae.get(t.signal) ?? {})
+            ), V = re("property", F);
+            if (!U(V).ok) return;
             let G = d;
             w && typeof w == "object" && (G = w);
-            const E = re(G), A = {
-              ...se.get(t.signal) ?? {},
-              [D]: E
+            const E = oe(G), A = {
+              ...ae.get(t.signal) ?? {},
+              [V]: E
             };
             t.change(A);
           }
@@ -7405,7 +7425,7 @@ function Ks({
         K.title(P),
         R.$.addLabel
       )
-    ), ce = sd(l), M = Ti(p).filter(
+    ), se = sd(l), M = Ti(p).filter(
       ([, R]) => R !== !1
     ), C = [
       ...M.map(([R]) => R),
@@ -7414,57 +7434,57 @@ function Ks({
     ], k = [
       // Known properties
       ...M.map(([R, F]) => {
-        const D = R, X = t.field(D);
-        return De({
+        const V = R, X = t.field(V);
+        return Ve({
           ctx: l.with({
             definition: F,
-            isPropertyRequired: Array.isArray(i.required) ? i.required.includes(D) : l.hasRequiredProperty(D),
+            isPropertyRequired: Array.isArray(i.required) ? i.required.includes(V) : l.hasRequiredProperty(V),
             // Ensure child fields show their own labels even when this object
             // is rendered inside a union/combinator where labels are suppressed
             suppressLabel: !1
-          }).append(D),
+          }).append(V),
           controller: X
         });
       }),
       // Evaluated additional keys (pattern-matched and truly additional)
       ...u.map((R) => {
-        const F = I.some((D) => D.test(R));
+        const F = I.some((V) => V.test(R));
         return nd(R, F, {
           controller: t,
           effCtx: l,
-          patternProps: U,
+          patternProps: L,
           apSchema: d,
           canRemove: q,
           lockKeyAfterSet: ee,
-          validatePropertyName: L
+          validatePropertyName: U
         });
       }),
       // Unevaluated keys (use unevaluatedProperties schema if available)
       ...h.map((R) => {
-        const F = I.some((D) => D.test(R));
+        const F = I.some((V) => V.test(R));
         return ad(R, F, {
           controller: t,
           effCtx: l,
-          patternProps: U,
+          patternProps: L,
           apSchema: d,
           unevaluatedProps: w,
           canRemove: q,
           lockKeyAfterSet: ee,
-          validatePropertyName: L
+          validatePropertyName: U
         });
       }),
       // Add affordance
-      o ? Y : null
-    ].filter(Boolean), $ = md(
-      ce,
+      o ? Z : null
+    ].filter(Boolean), v = md(
+      se,
       l,
       k,
       C
     );
-    return !l.suppressLabel && l.name != null && (!ce || !["fieldset", "group"].includes(ce.format || "")) ? nt({
+    return !l.suppressLabel && l.name != null && (!se || !["fieldset", "group"].includes(se.format || "")) ? nt({
       ...Ie({ ctx: l }),
-      content: $
-    }) : $;
+      content: v
+    }) : v;
   });
 }
 function pd(e, t, r) {
@@ -7480,7 +7500,7 @@ function pd(e, t, r) {
     if (typeof m == "object" && m != null && "$ref" in m) {
       const b = m.$ref;
       if (typeof b == "string" && b.startsWith("#"))
-        return Ds(m, e.schema);
+        return Vs(m, e.schema);
     }
     return m;
   }), i = [];
@@ -7492,12 +7512,12 @@ function pd(e, t, r) {
     }
     if (r)
       try {
-        Yr(r, b)(t) && i.push(m);
+        xr(r, b)(t) && i.push(m);
       } catch (g) {
-        console.warn(`Failed to compile oneOf branch ${m}:`, g), xa(b, t) && i.push(m);
+        console.warn(`Failed to compile oneOf branch ${m}:`, g), Ya(b, t) && i.push(m);
       }
     else
-      xa(b, t) && i.push(m);
+      Ya(b, t) && i.push(m);
   }
   const c = i.length > 1, l = i.length === 0;
   return {
@@ -7507,7 +7527,7 @@ function pd(e, t, r) {
     hasNoMatch: l
   };
 }
-function xa(e, t) {
+function Ya(e, t) {
   if ("const" in e)
     return e.const === t;
   if (Array.isArray(e.enum))
@@ -7543,7 +7563,7 @@ function yd(e, t, r = `Option ${t + 1}`) {
   }
   return "const" in e && typeof e.const == "string" ? e.const : e.type ? (Array.isArray(e.type) ? e.type : [e.type]).join(" | ") : r;
 }
-function Ya(e, t, r) {
+function xa(e, t, r) {
   const n = pd(e, t, r);
   return n.matchingBranch !== -1 ? n.matchingBranch : -1;
 }
@@ -7670,7 +7690,7 @@ function ff({
     definition: i,
     schemaConflicts: [...e.schemaConflicts, ...c]
   });
-  return De({
+  return Ve({
     ctx: l,
     controller: t
   });
@@ -7681,7 +7701,7 @@ function Ws({
   kind: r,
   variants: n
 }) {
-  const s = n.map((h, u) => yd(h, u, `${r} ${u + 1}`)), a = typeof e.definition == "boolean" ? { discriminator: null, type: null } : gd(e.definition), i = oe(
+  const s = n.map((h, u) => yd(h, u, `${r} ${u + 1}`)), a = typeof e.definition == "boolean" ? { discriminator: null, type: null } : gd(e.definition), i = ce(
     t.signal,
     e.ajv
   )((h, u) => {
@@ -7695,10 +7715,10 @@ function Ws({
         if (f !== null)
           return f;
       }
-      return Ya(e, h, u);
+      return xa(e, h, u);
     }
-    return Ya(e, h, u);
-  }), c = se.get(i), l = Ne(c >= 0 ? c : 0);
+    return xa(e, h, u);
+  }), c = ae.get(i), l = Ne(c >= 0 ? c : 0);
   t.onDispose(l.dispose);
   let p = !1;
   const m = i.on((h) => {
@@ -7715,9 +7735,9 @@ function Ws({
     selected: l,
     onChange: g
     // auto mode chooses segmented for <=3
-  }) : "", S = fr(l, (h) => De({
+  }) : "", S = fr(l, (h) => Ve({
     ctx: e.with({
-      definition: n[se.get(h)],
+      definition: n[ae.get(h)],
       // Suppress inner labels only when combinator is nested (non-root)
       suppressLabel: !e.isRoot
     }),
@@ -7730,12 +7750,12 @@ function Ws({
     inner: S
   });
 }
-function De({
+function Ve({
   ctx: e,
   controller: t
 }) {
   const r = typeof e.definition == "boolean" ? {} : e.definition;
-  let n = r?.$ref ? Ds(r, e.schema) : r, s = e.with({ definition: n });
+  let n = r?.$ref ? Vs(r, e.schema) : r, s = e.with({ definition: n });
   if (n?.allOf != null) {
     const i = n.allOf.filter(
       (c) => typeof c == "object" && c !== null
@@ -7752,7 +7772,7 @@ function De({
   }
   let a = [...s.notViolations];
   if (n?.not != null && typeof n.not == "object") {
-    const i = se.get(t.signal), c = Ml(
+    const i = ae.get(t.signal), c = Ml(
       n.not,
       i,
       s.ajv,
@@ -7859,7 +7879,7 @@ function De({
         case "string":
           return ie(
             s,
-            Vr({
+            Dr({
               ctx: s,
               controller: t
             }),
@@ -7921,7 +7941,7 @@ function De({
         t,
         ie(
           s,
-          Vr({
+          Dr({
             ctx: s,
             controller: t
           }),
@@ -8002,18 +8022,26 @@ function wd({
   schema: e,
   controller: t,
   ajv: r,
-  widgetRegistry: n
+  widgetRegistry: n,
+  setStatus: s,
+  formValue: a,
+  validationMode: i,
+  submitting: c
 }) {
-  const s = new en({
+  const l = new en({
     schema: e,
     definition: e,
     horizontal: !1,
     isPropertyRequired: !1,
     path: [],
     ajv: r,
-    widgetRegistry: n
+    widgetRegistry: n,
+    setStatus: s,
+    formValue: a,
+    validationMode: i,
+    submitting: c
   });
-  return e === !0 ? lr({ ctx: s, controller: t }) : e === !1 ? ke() : De({ ctx: s, controller: t });
+  return e === !0 ? lr({ ctx: l, controller: t }) : e === !1 ? ke() : Ve({ ctx: l, controller: t });
 }
 function he(e, t, r) {
   return Ls(e.definition) ? Ql({
@@ -8061,13 +8089,13 @@ function Bs({
   });
   if (n)
     return n;
-  const s = e.definition, a = Sd(s), i = oe(t.signal)((g) => {
+  const s = e.definition, a = Sd(s), i = ce(t.signal)((g) => {
     const w = g?.length ?? 0;
     return !(s.maxItems != null && w >= s.maxItems || a.isTuple && w >= a.prefixItems.length && a.additionalItemsSchema === !1);
-  }), c = oe(t.signal)((g) => {
+  }), c = ce(t.signal)((g) => {
     const w = g?.length ?? 0;
     return s.minItems == null || w > s.minItems;
-  }), l = oe(t.signal)((g) => {
+  }), l = ce(t.signal)((g) => {
     if (!s.uniqueItems || !g) return /* @__PURE__ */ new Set();
     const w = /* @__PURE__ */ new Map(), S = /* @__PURE__ */ new Set();
     for (let h = 0; h < g.length; h++) {
@@ -8075,7 +8103,7 @@ function Bs({
       w.has(u) ? (S.add(w.get(u)), S.add(h)) : w.set(u, h);
     }
     return S;
-  }), p = oe(t.signal)((g) => {
+  }), p = ce(t.signal)((g) => {
     if (!s.contains || !g)
       return { matchingIndices: /* @__PURE__ */ new Set(), count: 0, isValid: !0 };
     const w = /* @__PURE__ */ new Set();
@@ -8091,15 +8119,15 @@ function Bs({
       const o = s.contains, d = (y) => {
         if (typeof o == "boolean") return o;
         if (typeof o != "object" || o == null) return !1;
-        const v = o, _ = v.type;
+        const $ = o, _ = $.type;
         if (_ === "integer" || _ === "number")
-          return !(typeof y != "number" || !Number.isFinite(y) || _ === "integer" && !Number.isInteger(y) || typeof v.minimum == "number" && y < v.minimum || typeof v.exclusiveMinimum == "number" && y <= v.exclusiveMinimum || typeof v.maximum == "number" && y > v.maximum || typeof v.exclusiveMaximum == "number" && y >= v.exclusiveMaximum || typeof v.multipleOf == "number" && y % v.multipleOf !== 0);
+          return !(typeof y != "number" || !Number.isFinite(y) || _ === "integer" && !Number.isInteger(y) || typeof $.minimum == "number" && y < $.minimum || typeof $.exclusiveMinimum == "number" && y <= $.exclusiveMinimum || typeof $.maximum == "number" && y > $.maximum || typeof $.exclusiveMaximum == "number" && y >= $.exclusiveMaximum || typeof $.multipleOf == "number" && y % $.multipleOf !== 0);
         if (_ === "string") {
-          if (typeof y != "string" || typeof v.minLength == "number" && y.length < v.minLength || typeof v.maxLength == "number" && y.length > v.maxLength)
+          if (typeof y != "string" || typeof $.minLength == "number" && y.length < $.minLength || typeof $.maxLength == "number" && y.length > $.maxLength)
             return !1;
-          if (typeof v.pattern == "string")
+          if (typeof $.pattern == "string")
             try {
-              if (!new RegExp(v.pattern).test(y)) return !1;
+              if (!new RegExp($.pattern).test(y)) return !1;
             } catch {
             }
           return !0;
@@ -8138,14 +8166,14 @@ function Bs({
     controller: t,
     // Always render add/remove controls but disable them when constraints forbid actions
     showAdd: !0,
-    addDisabled: oe(i)((g) => !g),
+    addDisabled: ce(i)((g) => !g),
     showRemove: !0,
-    removeDisabled: oe(c)((g) => !g),
+    removeDisabled: ce(c)((g) => !g),
     element: (g) => {
       const w = g.item, S = g.position.index;
       let h, u;
       a.isTuple && S < a.prefixItems.length ? (h = a.prefixItems[S], a.tupleLabels?.[S] ? u = a.tupleLabels[S] : typeof h == "object" && h.title ? u = h.title : u = `Item ${S + 1}`) : (h = a.additionalItemsSchema, a.isTuple && (u = `Additional Item ${S - a.prefixItems.length + 1}`));
-      const f = De({
+      const f = Ve({
         ctx: e.with({ definition: h }).append(S),
         controller: w
       }), o = l.map((_) => _.has(S)), d = p.map(
@@ -8157,8 +8185,8 @@ function Bs({
         We(K.class("bc-array-control__item-label"), u),
         y
       ));
-      const v = [];
-      return s.uniqueItems && v.push(
+      const $ = [];
+      return s.uniqueItems && $.push(
         et(
           o,
           () => We(
@@ -8168,7 +8196,7 @@ function Bs({
             "⚠️ Duplicate value"
           )
         )
-      ), s.contains && v.push(
+      ), s.contains && $.push(
         et(
           d,
           () => We(
@@ -8178,14 +8206,14 @@ function Bs({
             "✓ Matches required pattern"
           )
         )
-      ), v.length > 0 ? me(K.class("bc-stack--gap-1"), y, ...v) : y;
+      ), $.length > 0 ? me(K.class("bc-stack--gap-1"), y, ...$) : y;
     }
   });
   return s.contains && m ? me(
     K.class("bc-stack--gap-2"),
     b,
     fr(
-      oe(
+      ce(
         p,
         m
       )((g, w) => ({
@@ -8205,7 +8233,7 @@ function Pd(e) {
   return e.map((t) => ({
     key: t,
     label: Kr(t),
-    detect: (r) => Vl(r, [t]) === t,
+    detect: (r) => Dl(r, [t]) === t,
     convert: (r) => zl(r, t),
     defaultValue: () => Fl(t)
   }));
@@ -8244,7 +8272,7 @@ function Js({
   }), w = (h) => {
     b.switchToBranch(h, i.confirmBranchChange);
   }, S = fr(b.activeBranch, (h) => {
-    const u = se.get(h), f = b.getBranchController(u);
+    const u = ae.get(h), f = b.getBranchController(u);
     if (p && (u === "number" || u === "integer")) {
       const d = s;
       return te(Mr, {
@@ -8265,7 +8293,7 @@ function Js({
     });
     switch (u) {
       case "string":
-        return Vr({
+        return Dr({
           ctx: o,
           controller: f
         });
@@ -8403,7 +8431,7 @@ function Ed(e, t, r = !1) {
           message: "Cross-field validation error"
         });
       }
-  return n.length > 0 ? xr(n) : Ee.valid;
+  return n.length > 0 ? Yr(n) : Ee.valid;
 }
 function Od(e, t) {
   if (e == null || typeof e != "object")
@@ -8523,7 +8551,7 @@ function kd(e, t, r, n) {
       s.push(...i);
     }
   }
-  return s.length > 0 ? xr(s) : Ee.valid;
+  return s.length > 0 ? Yr(s) : Ee.valid;
 }
 function Nd(e) {
   if (e.type === "valid") return [];
@@ -8703,7 +8731,7 @@ function qd(e) {
       if (n !== void 0)
         return n;
     }
-  return Dd(e);
+  return Vd(e);
 }
 function Md(e) {
   const t = {};
@@ -8714,10 +8742,10 @@ function Md(e) {
   }
   return r ? t : void 0;
 }
-function Dd(e) {
+function Vd(e) {
   switch (Kd(e)) {
     case "object":
-      return Vd(e);
+      return Dd(e);
     case "array":
       return zd(e);
     case "string":
@@ -8733,7 +8761,7 @@ function Dd(e) {
       return;
   }
 }
-function Vd(e) {
+function Dd(e) {
   if (!e.properties)
     return {};
   const t = new Set(e.required ?? []), r = {};
@@ -8844,69 +8872,74 @@ function mf({
   validationMode: a,
   validateDebounceMs: i,
   customWidgets: c,
-  applySchemaDefaults: l = !0
-}, p) {
-  const m = t !== void 0 ? se.get(t) : void 0, b = Be(e);
-  let g;
-  return t === void 0 ? g = b ?? {} : l ? g = Ei(
-    b,
-    m
-  ) : g = m, Ri(
+  applySchemaDefaults: l = !0,
+  submitting: p
+}, m) {
+  const b = t !== void 0 ? ae.get(t) : void 0, g = Be(e);
+  let w;
+  return t === void 0 ? w = g ?? {} : l ? w = Ei(
+    g,
+    b
+  ) : w = b, Ri(
     Ol(e, {
       externalSchemas: r,
       refResolver: n,
       sanitizeAdditional: s
     }),
-    (w) => {
-      if (w.ok) {
-        const { ajv: S, validate: h } = w.value, u = Rd(e), f = Cd(e), o = f.length > 0 ? new Td() : null, d = a ?? "onTouched", y = (re) => {
-          const ae = h(re);
-          let Y;
-          return ae ? Y = Ee.valid : Y = xr(
-            h.errors ?? []
-          ), u ? kd(
+    (S) => {
+      if (S.ok) {
+        const { ajv: h, validate: u } = S.value, f = Rd(e), o = Cd(e), d = o.length > 0 ? new Td() : null, y = a ?? "onTouched", $ = (re) => {
+          const Z = u(re);
+          let se;
+          return Z ? se = Ee.valid : se = Yr(
+            u.errors ?? []
+          ), f ? kd(
             re,
             re,
             // formData is the same as value for root-level validation
-            u,
-            h
-          ) : Y;
-        }, { controller: v, setStatus: _ } = mi({
-          initialValue: g,
-          validationMode: d,
+            f,
+            u
+          ) : se;
+        }, { controller: _, setStatus: P } = mi({
+          initialValue: w,
+          validationMode: y,
           validateDebounceMs: i,
-          validate: d === "onSubmit" ? void 0 : y
-        }), P = u ? Id(u) : null, N = s !== !1;
-        let q = !1;
-        const U = N ? v.signal.on((re) => {
-          if (q) return;
-          const ae = Jd(re);
-          h(ae) && !Hd(ae, re) && (q = !0, v.change(ae), q = !1);
+          validate: y === "onSubmit" ? void 0 : $
+        }), N = f ? Id(f) : null, q = s !== !1;
+        let L = !1;
+        const I = q ? _.signal.on((re) => {
+          if (L) return;
+          const Z = Jd(re);
+          u(Z) && !Hd(Z, re) && (L = !0, _.change(Z), L = !1);
         }) : () => {
-        }, I = P ? v.signal.on((re, ae) => {
-          ae != null && JSON.stringify(re) !== JSON.stringify(ae) && setTimeout(() => {
-            const ce = v.status.value;
-            _(ce);
+        }, D = N ? _.signal.on((re, Z) => {
+          Z != null && JSON.stringify(re) !== JSON.stringify(Z) && setTimeout(() => {
+            const M = _.status.value;
+            P(M);
           }, 10);
         }) : () => {
-        }, V = o && f.length > 0 ? v.signal.on((re) => {
-          for (const ae of f)
-            o.validateField(ae, re, re);
+        }, U = d && o.length > 0 ? _.signal.on((re) => {
+          for (const Z of o)
+            d.validateField(Z, re, re);
         }) : () => {
-        }, L = () => {
-          U(), I(), V(), o?.dispose(), v.dispose();
-        }, W = c ? Gd(c) : void 0, ee = ke(
-          Ai(L),
+        }, W = () => {
+          I(), D(), U(), d?.dispose(), _.dispose();
+        }, ee = c ? Gd(c) : void 0, oe = ke(
+          Ai(W),
           wd({
             schema: e,
-            controller: v,
-            ajv: S,
-            widgetRegistry: W
+            controller: _,
+            ajv: h,
+            widgetRegistry: ee,
+            setStatus: P,
+            formValue: _.signal,
+            validationMode: y,
+            submitting: p
           })
         );
-        return p({ Form: ee, controller: v, setStatus: _ });
+        return m({ Form: oe, controller: _, setStatus: P });
       }
-      return J.div(K.class("bc-json-schema-form__error"), w.error);
+      return J.div(K.class("bc-json-schema-form__error"), S.error);
     }
   );
 }
@@ -8924,14 +8957,14 @@ function pf(e, t) {
 function Xd(e) {
   return e.map((t) => ({
     message: Zd(t),
-    path: xd(t)
+    path: Yd(t)
   }));
 }
 function Zd(e) {
   return e.message ?? `${e.keyword} validation failed`;
 }
-function xd(e) {
-  const t = Yd(e.instancePath || "");
+function Yd(e) {
+  const t = xd(e.instancePath || "");
   if (e.keyword === "required") {
     const r = e.params.missingProperty;
     if (r != null) return [...t, r];
@@ -8946,7 +8979,7 @@ function xd(e) {
   }
   return t.length > 0 ? t : void 0;
 }
-function Yd(e) {
+function xd(e) {
   return e ? e.split("/").slice(1).map((r) => r.replace(/~1/g, "/").replace(/~0/g, "~")).map((r) => Qd(r) ? Number(r) : r) : [];
 }
 function Qd(e) {
@@ -8962,23 +8995,23 @@ export {
   wd as JSONSchemaControl,
   td as JSONSchemaEnum,
   mf as JSONSchemaForm,
-  De as JSONSchemaGenericControl,
+  Ve as JSONSchemaGenericControl,
   zr as JSONSchemaInteger,
   Ms as JSONSchemaNull,
   ur as JSONSchemaNumber,
   Ks as JSONSchemaObject,
   _d as JSONSchemaOneOf,
-  Vr as JSONSchemaString,
+  Dr as JSONSchemaString,
   Js as JSONSchemaUnion,
   en as SchemaContext,
-  xr as ajvErrorsToControllerValidation,
+  Yr as ajvErrorsToControllerValidation,
   wl as ajvErrorsToDependencies,
   _l as buildMessage,
   bl as buildPath,
   uf as clearCaches,
   lf as clearCachesForAjv,
-  Yr as compileWithCache,
-  Dl as composeEffectiveObjectSchema,
+  xr as compileWithCache,
+  Vl as composeEffectiveObjectSchema,
   pf as createAJVStandardSchema,
   gf as createDiagnosticWidget,
   Is as evaluateIfThenElseOverlay,