@bonsae/nrg 0.18.3 → 0.18.5

package/server/resources/nrg-client.js

@@ -29,8 +29,8 @@ function Cs() {
       if (b = n(g[v++]), u = E > v, typeof m[b] > "u" && (Array.isArray(m) && b === "-" && (b = m.length), u && (g[v] !== "" && g[v] < 1 / 0 || g[v] === "-" ? m[b] = [] : m[b] = {})), !u) break;
       m = m[b];
     }
-    var f = m[b];
-    return N === void 0 ? delete m[b] : m[b] = N, f;
+    var l = m[b];
+    return N === void 0 ? delete m[b] : m[b] = N, l;
   }
   function a(m) {
     if (typeof m == "string") {
@@ -191,10 +191,10 @@ function Je() {
       throw new Error(`CodeGen: invalid export name: ${y}, use explicit $id name mapping`);
     }
     e.getEsmExportName = E;
-    function f(y) {
+    function l(y) {
       return new n(y.toString());
     }
-    e.regexpCode = f;
+    e.regexpCode = l;
   })(Zt)), Zt;
 }
 var Qt = {}, Er;
@@ -270,8 +270,8 @@ function Sr() {
         } else
           E = this._values[u] = /* @__PURE__ */ new Map();
         E.set(v, b);
-        const f = this._scope[u] || (this._scope[u] = []), y = f.length;
-        return f[y] = g.ref, b.setValue(g, { property: u, itemIndex: y }), b;
+        const l = this._scope[u] || (this._scope[u] = []), y = l.length;
+        return l[y] = g.ref, b.setValue(g, { property: u, itemIndex: y }), b;
       }
       getValue(m, g) {
         const N = this._values[m];
@@ -298,11 +298,11 @@ function Sr() {
           const E = m[v];
           if (!E)
             continue;
-          const f = N[v] = N[v] || /* @__PURE__ */ new Map();
+          const l = N[v] = N[v] || /* @__PURE__ */ new Map();
           E.forEach((y) => {
-            if (f.has(y))
+            if (l.has(y))
               return;
-            f.set(y, n.Started);
+            l.set(y, n.Started);
             let s = g(y);
             if (s) {
               const p = this.opts.es5 ? e.varKinds.var : e.varKinds.const;
@@ -311,7 +311,7 @@ function Sr() {
               u = (0, t._)`${u}${s}${this.opts._n}`;
             else
               throw new r(y);
-            f.set(y, n.Completed);
+            l.set(y, n.Completed);
           });
         }
         return u;
@@ -368,164 +368,164 @@ function Y() {
       optimizeNodes() {
         return this;
       }
-      optimizeNames(l, S) {
+      optimizeNames(f, S) {
         return this;
       }
     }
     class o extends a {
-      constructor(l, S, q) {
-        super(), this.varKind = l, this.name = S, this.rhs = q;
+      constructor(f, S, q) {
+        super(), this.varKind = f, this.name = S, this.rhs = q;
       }
-      render({ es5: l, _n: S }) {
-        const q = l ? r.varKinds.var : this.varKind, F = this.rhs === void 0 ? "" : ` = ${this.rhs}`;
+      render({ es5: f, _n: S }) {
+        const q = f ? r.varKinds.var : this.varKind, F = this.rhs === void 0 ? "" : ` = ${this.rhs}`;
         return `${q} ${this.name}${F};` + S;
       }
-      optimizeNames(l, S) {
-        if (l[this.name.str])
-          return this.rhs && (this.rhs = B(this.rhs, l, S)), this;
+      optimizeNames(f, S) {
+        if (f[this.name.str])
+          return this.rhs && (this.rhs = B(this.rhs, f, S)), this;
       }
       get names() {
         return this.rhs instanceof t._CodeOrName ? this.rhs.names : {};
       }
     }
     class i extends a {
-      constructor(l, S, q) {
-        super(), this.lhs = l, this.rhs = S, this.sideEffects = q;
+      constructor(f, S, q) {
+        super(), this.lhs = f, this.rhs = S, this.sideEffects = q;
       }
-      render({ _n: l }) {
-        return `${this.lhs} = ${this.rhs};` + l;
+      render({ _n: f }) {
+        return `${this.lhs} = ${this.rhs};` + f;
       }
-      optimizeNames(l, S) {
-        if (!(this.lhs instanceof t.Name && !l[this.lhs.str] && !this.sideEffects))
-          return this.rhs = B(this.rhs, l, S), this;
+      optimizeNames(f, S) {
+        if (!(this.lhs instanceof t.Name && !f[this.lhs.str] && !this.sideEffects))
+          return this.rhs = B(this.rhs, f, S), this;
       }
       get names() {
-        const l = this.lhs instanceof t.Name ? {} : { ...this.lhs.names };
-        return K(l, this.rhs);
+        const f = this.lhs instanceof t.Name ? {} : { ...this.lhs.names };
+        return K(f, this.rhs);
       }
     }
     class h extends i {
-      constructor(l, S, q, F) {
-        super(l, q, F), this.op = S;
+      constructor(f, S, q, F) {
+        super(f, q, F), this.op = S;
       }
-      render({ _n: l }) {
-        return `${this.lhs} ${this.op}= ${this.rhs};` + l;
+      render({ _n: f }) {
+        return `${this.lhs} ${this.op}= ${this.rhs};` + f;
       }
     }
     class m extends a {
-      constructor(l) {
-        super(), this.label = l, this.names = {};
+      constructor(f) {
+        super(), this.label = f, this.names = {};
       }
-      render({ _n: l }) {
-        return `${this.label}:` + l;
+      render({ _n: f }) {
+        return `${this.label}:` + f;
       }
     }
     class g extends a {
-      constructor(l) {
-        super(), this.label = l, this.names = {};
+      constructor(f) {
+        super(), this.label = f, this.names = {};
       }
-      render({ _n: l }) {
-        return `break${this.label ? ` ${this.label}` : ""};` + l;
+      render({ _n: f }) {
+        return `break${this.label ? ` ${this.label}` : ""};` + f;
       }
     }
     class N extends a {
-      constructor(l) {
-        super(), this.error = l;
+      constructor(f) {
+        super(), this.error = f;
       }
-      render({ _n: l }) {
-        return `throw ${this.error};` + l;
+      render({ _n: f }) {
+        return `throw ${this.error};` + f;
       }
       get names() {
         return this.error.names;
       }
     }
     class b extends a {
-      constructor(l) {
-        super(), this.code = l;
+      constructor(f) {
+        super(), this.code = f;
       }
-      render({ _n: l }) {
-        return `${this.code};` + l;
+      render({ _n: f }) {
+        return `${this.code};` + f;
       }
       optimizeNodes() {
         return `${this.code}` ? this : void 0;
       }
-      optimizeNames(l, S) {
-        return this.code = B(this.code, l, S), this;
+      optimizeNames(f, S) {
+        return this.code = B(this.code, f, S), this;
       }
       get names() {
         return this.code instanceof t._CodeOrName ? this.code.names : {};
       }
     }
     class u extends a {
-      constructor(l = []) {
-        super(), this.nodes = l;
+      constructor(f = []) {
+        super(), this.nodes = f;
       }
-      render(l) {
-        return this.nodes.reduce((S, q) => S + q.render(l), "");
+      render(f) {
+        return this.nodes.reduce((S, q) => S + q.render(f), "");
       }
       optimizeNodes() {
-        const { nodes: l } = this;
-        let S = l.length;
+        const { nodes: f } = this;
+        let S = f.length;
         for (; S--; ) {
-          const q = l[S].optimizeNodes();
-          Array.isArray(q) ? l.splice(S, 1, ...q) : q ? l[S] = q : l.splice(S, 1);
+          const q = f[S].optimizeNodes();
+          Array.isArray(q) ? f.splice(S, 1, ...q) : q ? f[S] = q : f.splice(S, 1);
         }
-        return l.length > 0 ? this : void 0;
+        return f.length > 0 ? this : void 0;
       }
-      optimizeNames(l, S) {
+      optimizeNames(f, S) {
         const { nodes: q } = this;
         let F = q.length;
         for (; F--; ) {
           const z = q[F];
-          z.optimizeNames(l, S) || (x(l, z.names), q.splice(F, 1));
+          z.optimizeNames(f, S) || (x(f, z.names), q.splice(F, 1));
         }
         return q.length > 0 ? this : void 0;
       }
       get names() {
-        return this.nodes.reduce((l, S) => L(l, S.names), {});
+        return this.nodes.reduce((f, S) => L(f, S.names), {});
       }
     }
     class v extends u {
-      render(l) {
-        return "{" + l._n + super.render(l) + "}" + l._n;
+      render(f) {
+        return "{" + f._n + super.render(f) + "}" + f._n;
       }
     }
     class E extends u {
     }
-    class f extends v {
+    class l extends v {
     }
-    f.kind = "else";
+    l.kind = "else";
     class y extends v {
-      constructor(l, S) {
-        super(S), this.condition = l;
+      constructor(f, S) {
+        super(S), this.condition = f;
       }
-      render(l) {
-        let S = `if(${this.condition})` + super.render(l);
-        return this.else && (S += "else " + this.else.render(l)), S;
+      render(f) {
+        let S = `if(${this.condition})` + super.render(f);
+        return this.else && (S += "else " + this.else.render(f)), S;
       }
       optimizeNodes() {
         super.optimizeNodes();
-        const l = this.condition;
-        if (l === !0)
+        const f = this.condition;
+        if (f === !0)
           return this.nodes;
         let S = this.else;
         if (S) {
           const q = S.optimizeNodes();
-          S = this.else = Array.isArray(q) ? new f(q) : q;
+          S = this.else = Array.isArray(q) ? new l(q) : q;
         }
         if (S)
-          return l === !1 ? S instanceof y ? S : S.nodes : this.nodes.length ? this : new y(se(l), S instanceof y ? [S] : S.nodes);
-        if (!(l === !1 || !this.nodes.length))
+          return f === !1 ? S instanceof y ? S : S.nodes : this.nodes.length ? this : new y(se(f), S instanceof y ? [S] : S.nodes);
+        if (!(f === !1 || !this.nodes.length))
           return this;
       }
-      optimizeNames(l, S) {
+      optimizeNames(f, S) {
         var q;
-        if (this.else = (q = this.else) === null || q === void 0 ? void 0 : q.optimizeNames(l, S), !!(super.optimizeNames(l, S) || this.else))
-          return this.condition = B(this.condition, l, S), this;
+        if (this.else = (q = this.else) === null || q === void 0 ? void 0 : q.optimizeNames(f, S), !!(super.optimizeNames(f, S) || this.else))
+          return this.condition = B(this.condition, f, S), this;
       }
       get names() {
-        const l = super.names;
-        return K(l, this.condition), this.else && L(l, this.else.names), l;
+        const f = super.names;
+        return K(f, this.condition), this.else && L(f, this.else.names), f;
       }
     }
     y.kind = "if";
@@ -533,166 +533,166 @@ function Y() {
     }
     s.kind = "for";
     class p extends s {
-      constructor(l) {
-        super(), this.iteration = l;
+      constructor(f) {
+        super(), this.iteration = f;
       }
-      render(l) {
-        return `for(${this.iteration})` + super.render(l);
+      render(f) {
+        return `for(${this.iteration})` + super.render(f);
       }
-      optimizeNames(l, S) {
-        if (super.optimizeNames(l, S))
-          return this.iteration = B(this.iteration, l, S), this;
+      optimizeNames(f, S) {
+        if (super.optimizeNames(f, S))
+          return this.iteration = B(this.iteration, f, S), this;
       }
       get names() {
         return L(super.names, this.iteration.names);
       }
     }
     class w extends s {
-      constructor(l, S, q, F) {
-        super(), this.varKind = l, this.name = S, this.from = q, this.to = F;
+      constructor(f, S, q, F) {
+        super(), this.varKind = f, this.name = S, this.from = q, this.to = F;
       }
-      render(l) {
-        const S = l.es5 ? r.varKinds.var : this.varKind, { name: q, from: F, to: z } = this;
-        return `for(${S} ${q}=${F}; ${q}<${z}; ${q}++)` + super.render(l);
+      render(f) {
+        const S = f.es5 ? r.varKinds.var : this.varKind, { name: q, from: F, to: z } = this;
+        return `for(${S} ${q}=${F}; ${q}<${z}; ${q}++)` + super.render(f);
       }
       get names() {
-        const l = K(super.names, this.from);
-        return K(l, this.to);
+        const f = K(super.names, this.from);
+        return K(f, this.to);
       }
     }
     class d extends s {
-      constructor(l, S, q, F) {
-        super(), this.loop = l, this.varKind = S, this.name = q, this.iterable = F;
+      constructor(f, S, q, F) {
+        super(), this.loop = f, this.varKind = S, this.name = q, this.iterable = F;
       }
-      render(l) {
-        return `for(${this.varKind} ${this.name} ${this.loop} ${this.iterable})` + super.render(l);
+      render(f) {
+        return `for(${this.varKind} ${this.name} ${this.loop} ${this.iterable})` + super.render(f);
       }
-      optimizeNames(l, S) {
-        if (super.optimizeNames(l, S))
-          return this.iterable = B(this.iterable, l, S), this;
+      optimizeNames(f, S) {
+        if (super.optimizeNames(f, S))
+          return this.iterable = B(this.iterable, f, S), this;
       }
       get names() {
         return L(super.names, this.iterable.names);
       }
     }
     class _ extends v {
-      constructor(l, S, q) {
-        super(), this.name = l, this.args = S, this.async = q;
+      constructor(f, S, q) {
+        super(), this.name = f, this.args = S, this.async = q;
       }
-      render(l) {
-        return `${this.async ? "async " : ""}function ${this.name}(${this.args})` + super.render(l);
+      render(f) {
+        return `${this.async ? "async " : ""}function ${this.name}(${this.args})` + super.render(f);
       }
     }
     _.kind = "func";
     class P extends u {
-      render(l) {
-        return "return " + super.render(l);
+      render(f) {
+        return "return " + super.render(f);
       }
     }
     P.kind = "return";
     class T extends v {
-      render(l) {
-        let S = "try" + super.render(l);
-        return this.catch && (S += this.catch.render(l)), this.finally && (S += this.finally.render(l)), S;
+      render(f) {
+        let S = "try" + super.render(f);
+        return this.catch && (S += this.catch.render(f)), this.finally && (S += this.finally.render(f)), S;
       }
       optimizeNodes() {
-        var l, S;
-        return super.optimizeNodes(), (l = this.catch) === null || l === void 0 || l.optimizeNodes(), (S = this.finally) === null || S === void 0 || S.optimizeNodes(), this;
+        var f, S;
+        return super.optimizeNodes(), (f = this.catch) === null || f === void 0 || f.optimizeNodes(), (S = this.finally) === null || S === void 0 || S.optimizeNodes(), this;
       }
-      optimizeNames(l, S) {
+      optimizeNames(f, S) {
         var q, F;
-        return super.optimizeNames(l, S), (q = this.catch) === null || q === void 0 || q.optimizeNames(l, S), (F = this.finally) === null || F === void 0 || F.optimizeNames(l, S), this;
+        return super.optimizeNames(f, S), (q = this.catch) === null || q === void 0 || q.optimizeNames(f, S), (F = this.finally) === null || F === void 0 || F.optimizeNames(f, S), this;
       }
       get names() {
-        const l = super.names;
-        return this.catch && L(l, this.catch.names), this.finally && L(l, this.finally.names), l;
+        const f = super.names;
+        return this.catch && L(f, this.catch.names), this.finally && L(f, this.finally.names), f;
       }
     }
     class D extends v {
-      constructor(l) {
-        super(), this.error = l;
+      constructor(f) {
+        super(), this.error = f;
       }
-      render(l) {
-        return `catch(${this.error})` + super.render(l);
+      render(f) {
+        return `catch(${this.error})` + super.render(f);
       }
     }
     D.kind = "catch";
     class U extends v {
-      render(l) {
-        return "finally" + super.render(l);
+      render(f) {
+        return "finally" + super.render(f);
       }
     }
     U.kind = "finally";
     class A {
-      constructor(l, S = {}) {
+      constructor(f, S = {}) {
         this._values = {}, this._blockStarts = [], this._constants = {}, this.opts = { ...S, _n: S.lines ? `
-` : "" }, this._extScope = l, this._scope = new r.Scope({ parent: l }), this._nodes = [new E()];
+` : "" }, this._extScope = f, this._scope = new r.Scope({ parent: f }), this._nodes = [new E()];
       }
       toString() {
         return this._root.render(this.opts);
       }
       // returns unique name in the internal scope
-      name(l) {
-        return this._scope.name(l);
+      name(f) {
+        return this._scope.name(f);
       }
       // reserves unique name in the external scope
-      scopeName(l) {
-        return this._extScope.name(l);
+      scopeName(f) {
+        return this._extScope.name(f);
       }
       // reserves unique name in the external scope and assigns value to it
-      scopeValue(l, S) {
-        const q = this._extScope.value(l, S);
+      scopeValue(f, S) {
+        const q = this._extScope.value(f, S);
         return (this._values[q.prefix] || (this._values[q.prefix] = /* @__PURE__ */ new Set())).add(q), q;
       }
-      getScopeValue(l, S) {
-        return this._extScope.getValue(l, S);
+      getScopeValue(f, S) {
+        return this._extScope.getValue(f, S);
       }
       // 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(l) {
-        return this._extScope.scopeRefs(l, this._values);
+      scopeRefs(f) {
+        return this._extScope.scopeRefs(f, this._values);
       }
       scopeCode() {
         return this._extScope.scopeCode(this._values);
       }
-      _def(l, S, q, F) {
+      _def(f, S, q, F) {
         const z = this._scope.toName(S);
-        return q !== void 0 && F && (this._constants[z.str] = q), this._leafNode(new o(l, z, q)), z;
+        return q !== void 0 && F && (this._constants[z.str] = q), this._leafNode(new o(f, z, q)), z;
       }
       // `const` declaration (`var` in es5 mode)
-      const(l, S, q) {
-        return this._def(r.varKinds.const, l, S, q);
+      const(f, S, q) {
+        return this._def(r.varKinds.const, f, S, q);
       }
       // `let` declaration with optional assignment (`var` in es5 mode)
-      let(l, S, q) {
-        return this._def(r.varKinds.let, l, S, q);
+      let(f, S, q) {
+        return this._def(r.varKinds.let, f, S, q);
       }
       // `var` declaration with optional assignment
-      var(l, S, q) {
-        return this._def(r.varKinds.var, l, S, q);
+      var(f, S, q) {
+        return this._def(r.varKinds.var, f, S, q);
       }
       // assignment code
-      assign(l, S, q) {
-        return this._leafNode(new i(l, S, q));
+      assign(f, S, q) {
+        return this._leafNode(new i(f, S, q));
       }
       // `+=` code
-      add(l, S) {
-        return this._leafNode(new h(l, e.operators.ADD, S));
+      add(f, S) {
+        return this._leafNode(new h(f, e.operators.ADD, S));
       }
       // appends passed SafeExpr to code or executes Block
-      code(l) {
-        return typeof l == "function" ? l() : l !== t.nil && this._leafNode(new b(l)), this;
+      code(f) {
+        return typeof f == "function" ? f() : f !== t.nil && this._leafNode(new b(f)), this;
       }
       // returns code for object literal for the passed argument list of key-value pairs
-      object(...l) {
+      object(...f) {
         const S = ["{"];
-        for (const [q, F] of l)
+        for (const [q, F] of f)
           S.length > 1 && S.push(","), S.push(q), (q !== F || this.opts.es5) && (S.push(":"), (0, t.addCodeArg)(S, F));
         return S.push("}"), new t._Code(S);
       }
       // `if` clause (or statement if `thenBody` and, optionally, `elseBody` are passed)
-      if(l, S, q) {
-        if (this._blockNode(new y(l)), S && q)
+      if(f, S, q) {
+        if (this._blockNode(new y(f)), S && q)
           this.code(S).else().code(q).endIf();
         else if (S)
           this.code(S).endIf();
@@ -701,32 +701,32 @@ function Y() {
         return this;
       }
       // `else if` clause - invalid without `if` or after `else` clauses
-      elseIf(l) {
-        return this._elseNode(new y(l));
+      elseIf(f) {
+        return this._elseNode(new y(f));
       }
       // `else` clause - only valid after `if` or `else if` clauses
       else() {
-        return this._elseNode(new f());
+        return this._elseNode(new l());
       }
       // end `if` statement (needed if gen.if was used only with condition)
       endIf() {
-        return this._endBlockNode(y, f);
+        return this._endBlockNode(y, l);
       }
-      _for(l, S) {
-        return this._blockNode(l), S && this.code(S).endFor(), this;
+      _for(f, S) {
+        return this._blockNode(f), S && this.code(S).endFor(), this;
       }
       // a generic `for` clause (or statement if `forBody` is passed)
-      for(l, S) {
-        return this._for(new p(l), S);
+      for(f, S) {
+        return this._for(new p(f), S);
       }
       // `for` statement for a range of values
-      forRange(l, S, q, F, z = this.opts.es5 ? r.varKinds.var : r.varKinds.let) {
-        const H = this._scope.toName(l);
+      forRange(f, S, q, F, z = this.opts.es5 ? r.varKinds.var : r.varKinds.let) {
+        const H = this._scope.toName(f);
         return this._for(new w(z, H, S, q), () => F(H));
       }
       // `for-of` statement (in es5 mode replace with a normal for loop)
-      forOf(l, S, q, F = r.varKinds.const) {
-        const z = this._scope.toName(l);
+      forOf(f, S, q, F = r.varKinds.const) {
+        const z = this._scope.toName(f);
         if (this.opts.es5) {
           const H = S instanceof t.Name ? S : this.var("_arr", S);
           return this.forRange("_i", 0, (0, t._)`${H}.length`, (G) => {
@@ -737,10 +737,10 @@ function Y() {
       }
       // `for-in` statement.
       // With option `ownProperties` replaced with a `for-of` loop for object keys
-      forIn(l, S, q, F = this.opts.es5 ? r.varKinds.var : r.varKinds.const) {
+      forIn(f, S, q, F = this.opts.es5 ? r.varKinds.var : r.varKinds.const) {
         if (this.opts.ownProperties)
-          return this.forOf(l, (0, t._)`Object.keys(${S})`, q);
-        const z = this._scope.toName(l);
+          return this.forOf(f, (0, t._)`Object.keys(${S})`, q);
+        const z = this._scope.toName(f);
         return this._for(new d("in", F, z, S), () => q(z));
       }
       // end `for` loop
@@ -748,101 +748,101 @@ function Y() {
         return this._endBlockNode(s);
       }
       // `label` statement
-      label(l) {
-        return this._leafNode(new m(l));
+      label(f) {
+        return this._leafNode(new m(f));
       }
       // `break` statement
-      break(l) {
-        return this._leafNode(new g(l));
+      break(f) {
+        return this._leafNode(new g(f));
       }
       // `return` statement
-      return(l) {
+      return(f) {
         const S = new P();
-        if (this._blockNode(S), this.code(l), S.nodes.length !== 1)
+        if (this._blockNode(S), this.code(f), S.nodes.length !== 1)
           throw new Error('CodeGen: "return" should have one node');
         return this._endBlockNode(P);
       }
       // `try` statement
-      try(l, S, q) {
+      try(f, S, q) {
         if (!S && !q)
           throw new Error('CodeGen: "try" without "catch" and "finally"');
         const F = new T();
-        if (this._blockNode(F), this.code(l), S) {
+        if (this._blockNode(F), this.code(f), S) {
           const z = this.name("e");
           this._currNode = F.catch = new D(z), S(z);
         }
         return q && (this._currNode = F.finally = new U(), this.code(q)), this._endBlockNode(D, U);
       }
       // `throw` statement
-      throw(l) {
-        return this._leafNode(new N(l));
+      throw(f) {
+        return this._leafNode(new N(f));
       }
       // start self-balancing block
-      block(l, S) {
-        return this._blockStarts.push(this._nodes.length), l && this.code(l).endBlock(S), this;
+      block(f, S) {
+        return this._blockStarts.push(this._nodes.length), f && this.code(f).endBlock(S), this;
       }
       // end the current self-balancing block
-      endBlock(l) {
+      endBlock(f) {
         const S = this._blockStarts.pop();
         if (S === void 0)
           throw new Error("CodeGen: not in self-balancing block");
         const q = this._nodes.length - S;
-        if (q < 0 || l !== void 0 && q !== l)
-          throw new Error(`CodeGen: wrong number of nodes: ${q} vs ${l} expected`);
+        if (q < 0 || f !== void 0 && q !== f)
+          throw new Error(`CodeGen: wrong number of nodes: ${q} vs ${f} expected`);
         return this._nodes.length = S, this;
       }
       // `function` heading (or definition if funcBody is passed)
-      func(l, S = t.nil, q, F) {
-        return this._blockNode(new _(l, S, q)), F && this.code(F).endFunc(), this;
+      func(f, S = t.nil, q, F) {
+        return this._blockNode(new _(f, S, q)), F && this.code(F).endFunc(), this;
       }
       // end function definition
       endFunc() {
         return this._endBlockNode(_);
       }
-      optimize(l = 1) {
-        for (; l-- > 0; )
+      optimize(f = 1) {
+        for (; f-- > 0; )
           this._root.optimizeNodes(), this._root.optimizeNames(this._root.names, this._constants);
       }
-      _leafNode(l) {
-        return this._currNode.nodes.push(l), this;
+      _leafNode(f) {
+        return this._currNode.nodes.push(f), this;
       }
-      _blockNode(l) {
-        this._currNode.nodes.push(l), this._nodes.push(l);
+      _blockNode(f) {
+        this._currNode.nodes.push(f), this._nodes.push(f);
       }
-      _endBlockNode(l, S) {
+      _endBlockNode(f, S) {
         const q = this._currNode;
-        if (q instanceof l || S && q instanceof S)
+        if (q instanceof f || S && q instanceof S)
           return this._nodes.pop(), this;
-        throw new Error(`CodeGen: not in block "${S ? `${l.kind}/${S.kind}` : l.kind}"`);
+        throw new Error(`CodeGen: not in block "${S ? `${f.kind}/${S.kind}` : f.kind}"`);
       }
-      _elseNode(l) {
+      _elseNode(f) {
         const S = this._currNode;
         if (!(S instanceof y))
           throw new Error('CodeGen: "else" without "if"');
-        return this._currNode = S.else = l, this;
+        return this._currNode = S.else = f, this;
       }
       get _root() {
         return this._nodes[0];
       }
       get _currNode() {
-        const l = this._nodes;
-        return l[l.length - 1];
+        const f = this._nodes;
+        return f[f.length - 1];
       }
-      set _currNode(l) {
+      set _currNode(f) {
         const S = this._nodes;
-        S[S.length - 1] = l;
+        S[S.length - 1] = f;
       }
     }
     e.CodeGen = A;
-    function L(O, l) {
-      for (const S in l)
-        O[S] = (O[S] || 0) + (l[S] || 0);
+    function L(O, f) {
+      for (const S in f)
+        O[S] = (O[S] || 0) + (f[S] || 0);
       return O;
     }
-    function K(O, l) {
-      return l instanceof t._CodeOrName ? L(O, l.names) : O;
+    function K(O, f) {
+      return f instanceof t._CodeOrName ? L(O, f.names) : O;
     }
-    function B(O, l, S) {
+    function B(O, f, S) {
       if (O instanceof t.Name)
         return q(O);
       if (!F(O))
@@ -850,15 +850,15 @@ function Y() {
       return new t._Code(O._items.reduce((z, H) => (H instanceof t.Name && (H = q(H)), H instanceof t._Code ? z.push(...H._items) : z.push(H), z), []));
       function q(z) {
         const H = S[z.str];
-        return H === void 0 || l[z.str] !== 1 ? z : (delete l[z.str], H);
+        return H === void 0 || f[z.str] !== 1 ? z : (delete f[z.str], H);
       }
       function F(z) {
-        return z instanceof t._Code && z._items.some((H) => H instanceof t.Name && l[H.str] === 1 && S[H.str] !== void 0);
+        return z instanceof t._Code && z._items.some((H) => H instanceof t.Name && f[H.str] === 1 && S[H.str] !== void 0);
       }
     }
-    function x(O, l) {
-      for (const S in l)
-        O[S] = (O[S] || 0) - (l[S] || 0);
+    function x(O, f) {
+      for (const S in f)
+        O[S] = (O[S] || 0) - (f[S] || 0);
     }
     function se(O) {
       return typeof O == "boolean" || typeof O == "number" || O === null ? !O : (0, t._)`!${k(O)}`;
@@ -875,7 +875,7 @@ function Y() {
     }
     e.or = M;
     function j(O) {
-      return (l, S) => l === t.nil ? S : S === t.nil ? l : (0, t._)`${k(l)} ${O} ${k(S)}`;
+      return (f, S) => f === t.nil ? S : S === t.nil ? f : (0, t._)`${k(f)} ${O} ${k(S)}`;
     }
     function k(O) {
       return O instanceof t.Name ? O : (0, t._)`(${O})`;
@@ -994,11 +994,11 @@ function X() {
     Object.keys(P).forEach((T) => d.assign((0, e._)`${_}${(0, e.getProperty)(T)}`, !0));
   }
   Z.setEvaluated = E;
-  const f = {};
+  const l = {};
   function y(d, _) {
     return d.scopeValue("func", {
       ref: _,
-      code: f[_.code] || (f[_.code] = new t._Code(_.code))
+      code: l[_.code] || (l[_.code] = new t._Code(_.code))
     });
   }
   Z.useFunc = y;
@@ -1064,40 +1064,40 @@ function Ye() {
     Object.defineProperty(e, "__esModule", { value: !0 }), e.extendErrors = e.resetErrorsCount = e.reportExtraError = e.reportError = e.keyword$DataError = e.keywordError = void 0;
     const t = /* @__PURE__ */ Y(), r = /* @__PURE__ */ X(), n = /* @__PURE__ */ Ne();
     e.keywordError = {
-      message: ({ keyword: f }) => (0, t.str)`must pass "${f}" keyword validation`
+      message: ({ keyword: l }) => (0, t.str)`must pass "${l}" keyword validation`
     }, e.keyword$DataError = {
-      message: ({ keyword: f, schemaType: y }) => y ? (0, t.str)`"${f}" keyword must be ${y} ($data)` : (0, t.str)`"${f}" keyword is invalid ($data)`
+      message: ({ keyword: l, schemaType: y }) => y ? (0, t.str)`"${l}" keyword must be ${y} ($data)` : (0, t.str)`"${l}" keyword is invalid ($data)`
     };
-    function c(f, y = e.keywordError, s, p) {
-      const { it: w } = f, { gen: d, compositeRule: _, allErrors: P } = w, T = N(f, y, s);
+    function c(l, y = e.keywordError, s, p) {
+      const { it: w } = l, { gen: d, compositeRule: _, allErrors: P } = w, T = N(l, y, s);
       p ?? (_ || P) ? h(d, T) : m(w, (0, t._)`[${T}]`);
     }
     e.reportError = c;
-    function a(f, y = e.keywordError, s) {
-      const { it: p } = f, { gen: w, compositeRule: d, allErrors: _ } = p, P = N(f, y, s);
+    function a(l, y = e.keywordError, s) {
+      const { it: p } = l, { gen: w, compositeRule: d, allErrors: _ } = p, P = N(l, y, s);
       h(w, P), d || _ || m(p, n.default.vErrors);
     }
     e.reportExtraError = a;
-    function o(f, y) {
-      f.assign(n.default.errors, y), f.if((0, t._)`${n.default.vErrors} !== null`, () => f.if(y, () => f.assign((0, t._)`${n.default.vErrors}.length`, y), () => f.assign(n.default.vErrors, null)));
+    function o(l, y) {
+      l.assign(n.default.errors, y), l.if((0, t._)`${n.default.vErrors} !== null`, () => l.if(y, () => l.assign((0, t._)`${n.default.vErrors}.length`, y), () => l.assign(n.default.vErrors, null)));
     }
     e.resetErrorsCount = o;
-    function i({ gen: f, keyword: y, schemaValue: s, data: p, errsCount: w, it: d }) {
+    function i({ gen: l, keyword: y, schemaValue: s, data: p, errsCount: w, it: d }) {
       if (w === void 0)
         throw new Error("ajv implementation error");
-      const _ = f.name("err");
-      f.forRange("i", w, n.default.errors, (P) => {
-        f.const(_, (0, t._)`${n.default.vErrors}[${P}]`), f.if((0, t._)`${_}.instancePath === undefined`, () => f.assign((0, t._)`${_}.instancePath`, (0, t.strConcat)(n.default.instancePath, d.errorPath))), f.assign((0, t._)`${_}.schemaPath`, (0, t.str)`${d.errSchemaPath}/${y}`), d.opts.verbose && (f.assign((0, t._)`${_}.schema`, s), f.assign((0, t._)`${_}.data`, p));
+      const _ = l.name("err");
+      l.forRange("i", w, n.default.errors, (P) => {
+        l.const(_, (0, t._)`${n.default.vErrors}[${P}]`), l.if((0, t._)`${_}.instancePath === undefined`, () => l.assign((0, t._)`${_}.instancePath`, (0, t.strConcat)(n.default.instancePath, d.errorPath))), l.assign((0, t._)`${_}.schemaPath`, (0, t.str)`${d.errSchemaPath}/${y}`), d.opts.verbose && (l.assign((0, t._)`${_}.schema`, s), l.assign((0, t._)`${_}.data`, p));
       });
     }
     e.extendErrors = i;
-    function h(f, y) {
-      const s = f.const("err", y);
-      f.if((0, t._)`${n.default.vErrors} === null`, () => f.assign(n.default.vErrors, (0, t._)`[${s}]`), (0, t._)`${n.default.vErrors}.push(${s})`), f.code((0, t._)`${n.default.errors}++`);
+    function h(l, y) {
+      const s = l.const("err", y);
+      l.if((0, t._)`${n.default.vErrors} === null`, () => l.assign(n.default.vErrors, (0, t._)`[${s}]`), (0, t._)`${n.default.vErrors}.push(${s})`), l.code((0, t._)`${n.default.errors}++`);
     }
-    function m(f, y) {
-      const { gen: s, validateName: p, schemaEnv: w } = f;
-      w.$async ? s.throw((0, t._)`new ${f.ValidationError}(${y})`) : (s.assign((0, t._)`${p}.errors`, y), s.return(!1));
+    function m(l, y) {
+      const { gen: s, validateName: p, schemaEnv: w } = l;
+      w.$async ? s.throw((0, t._)`new ${l.ValidationError}(${y})`) : (s.assign((0, t._)`${p}.errors`, y), s.return(!1));
     }
     const g = {
       keyword: new t.Name("keyword"),
@@ -1109,28 +1109,28 @@ function Ye() {
       schema: new t.Name("schema"),
       parentSchema: new t.Name("parentSchema")
     };
-    function N(f, y, s) {
-      const { createErrors: p } = f.it;
-      return p === !1 ? (0, t._)`{}` : b(f, y, s);
+    function N(l, y, s) {
+      const { createErrors: p } = l.it;
+      return p === !1 ? (0, t._)`{}` : b(l, y, s);
     }
-    function b(f, y, s = {}) {
-      const { gen: p, it: w } = f, d = [
+    function b(l, y, s = {}) {
+      const { gen: p, it: w } = l, d = [
         u(w, s),
-        v(f, s)
+        v(l, s)
       ];
-      return E(f, y, d), p.object(...d);
+      return E(l, y, d), p.object(...d);
     }
-    function u({ errorPath: f }, { instancePath: y }) {
-      const s = y ? (0, t.str)`${f}${(0, r.getErrorPath)(y, r.Type.Str)}` : f;
+    function u({ errorPath: l }, { instancePath: y }) {
+      const s = y ? (0, t.str)`${l}${(0, r.getErrorPath)(y, r.Type.Str)}` : l;
       return [n.default.instancePath, (0, t.strConcat)(n.default.instancePath, s)];
     }
-    function v({ keyword: f, it: { errSchemaPath: y } }, { schemaPath: s, parentSchema: p }) {
-      let w = p ? y : (0, t.str)`${y}/${f}`;
+    function v({ keyword: l, it: { errSchemaPath: y } }, { schemaPath: s, parentSchema: p }) {
+      let w = p ? y : (0, t.str)`${y}/${l}`;
       return s && (w = (0, t.str)`${w}${(0, r.getErrorPath)(s, r.Type.Str)}`), [g.schemaPath, w];
     }
-    function E(f, { params: y, message: s }, p) {
-      const { keyword: w, data: d, schemaValue: _, it: P } = f, { opts: T, propertyName: D, topSchemaRef: U, schemaPath: A } = P;
-      p.push([g.keyword, w], [g.params, typeof y == "function" ? y(f) : y || (0, t._)`{}`]), T.messages && p.push([g.message, typeof s == "function" ? s(f) : s]), T.verbose && p.push([g.schema, _], [g.parentSchema, (0, t._)`${U}${A}`], [n.default.data, d]), D && p.push([g.propertyName, D]);
+    function E(l, { params: y, message: s }, p) {
+      const { keyword: w, data: d, schemaValue: _, it: P } = l, { opts: T, propertyName: D, topSchemaRef: U, schemaPath: A } = P;
+      p.push([g.keyword, w], [g.params, typeof y == "function" ? y(l) : y || (0, t._)`{}`]), T.messages && p.push([g.message, typeof s == "function" ? s(l) : s]), T.verbose && p.push([g.schema, _], [g.parentSchema, (0, t._)`${U}${A}`], [n.default.data, d]), D && p.push([g.propertyName, D]);
     }
   })(Jt)), Jt;
 }
@@ -1245,7 +1245,7 @@ function zt() {
     if (T) {
       const D = v(p, d, _.strictNumbers, a.Wrong);
       w.if(D, () => {
-        P.length ? N(s, p, P) : f(s);
+        P.length ? N(s, p, P) : l(s);
       });
     }
     return T;
@@ -1260,7 +1260,7 @@ function zt() {
     P.coerceTypes === "array" && d.if((0, n._)`${T} == 'object' && Array.isArray(${_}) && ${_}.length == 1`, () => d.assign(_, (0, n._)`${_}[0]`).assign(T, (0, n._)`typeof ${_}`).if(v(p, _, P.strictNumbers), () => d.assign(D, _))), d.if((0, n._)`${D} !== undefined`);
     for (const A of w)
       (m.has(A) || A === "array" && P.coerceTypes === "array") && U(A);
-    d.else(), f(s), d.endIf(), d.if((0, n._)`${D} !== undefined`, () => {
+    d.else(), l(s), d.endIf(), d.if((0, n._)`${D} !== undefined`, () => {
       d.assign(_, D), b(s, D);
     });
     function U(A) {
@@ -1338,11 +1338,11 @@ function zt() {
     message: ({ schema: s }) => `must be ${s}`,
     params: ({ schema: s, schemaValue: p }) => typeof s == "string" ? (0, n._)`{type: ${s}}` : (0, n._)`{type: ${p}}`
   };
-  function f(s) {
+  function l(s) {
     const p = y(s);
     (0, r.reportError)(p, E);
   }
-  ue.reportTypeError = f;
+  ue.reportTypeError = l;
   function y(s) {
     const { gen: p, data: w, schema: d } = s, _ = (0, c.schemaRefOrVal)(s, d, "type");
     return {
@@ -1458,7 +1458,7 @@ function $e() {
     });
   }
   re.usePattern = E;
-  function f(s) {
+  function l(s) {
     const { gen: p, data: w, keyword: d, it: _ } = s, P = p.name("valid");
     if (_.allErrors) {
       const D = p.let("valid", !0);
@@ -1476,7 +1476,7 @@ function $e() {
       });
     }
   }
-  re.validateArray = f;
+  re.validateArray = l;
   function y(s) {
     const { gen: p, schema: w, keyword: d, it: _ } = s;
     if (!Array.isArray(w))
@@ -1501,7 +1501,7 @@ function Ks() {
   Vr = 1, Object.defineProperty(ve, "__esModule", { value: !0 }), ve.validateKeywordUsage = ve.validSchemaType = ve.funcKeywordCode = ve.macroKeywordCode = void 0;
   const e = /* @__PURE__ */ Y(), t = /* @__PURE__ */ Ne(), r = /* @__PURE__ */ $e(), n = /* @__PURE__ */ Ye();
   function c(b, u) {
-    const { gen: v, keyword: E, schema: f, parentSchema: y, it: s } = b, p = u.macro.call(s.self, f, y, s), w = m(v, E, p);
+    const { gen: v, keyword: E, schema: l, parentSchema: y, it: s } = b, p = u.macro.call(s.self, l, y, s), w = m(v, E, p);
     s.opts.validateSchema !== !1 && s.self.validateSchema(p, !0);
     const d = v.name("valid");
     b.subschema({
@@ -1515,9 +1515,9 @@ function Ks() {
   ve.macroKeywordCode = c;
   function a(b, u) {
     var v;
-    const { gen: E, keyword: f, schema: y, parentSchema: s, $data: p, it: w } = b;
+    const { gen: E, keyword: l, schema: y, parentSchema: s, $data: p, it: w } = b;
     h(w, u);
-    const d = !p && u.compile ? u.compile.call(w.self, y, s, w) : u.validate, _ = m(E, f, d), P = E.let("valid");
+    const d = !p && u.compile ? u.compile.call(w.self, y, s, w) : u.validate, _ = m(E, l, d), P = E.let("valid");
     b.block$data(P, T), b.ok((v = u.valid) !== null && v !== void 0 ? v : P);
     function T() {
       if (u.errors === !1)
@@ -1568,14 +1568,14 @@ function Ks() {
     return !u.length || u.some((E) => E === "array" ? Array.isArray(b) : E === "object" ? b && typeof b == "object" && !Array.isArray(b) : typeof b == E || v && typeof b > "u");
   }
   ve.validSchemaType = g;
-  function N({ schema: b, opts: u, self: v, errSchemaPath: E }, f, y) {
-    if (Array.isArray(f.keyword) ? !f.keyword.includes(y) : f.keyword !== y)
+  function N({ schema: b, opts: u, self: v, errSchemaPath: E }, l, y) {
+    if (Array.isArray(l.keyword) ? !l.keyword.includes(y) : l.keyword !== y)
       throw new Error("ajv implementation error");
-    const s = f.dependencies;
+    const s = l.dependencies;
     if (s != null && s.some((p) => !Object.prototype.hasOwnProperty.call(b, p)))
       throw new Error(`parent schema must have dependencies of ${y}: ${s.join(",")}`);
-    if (f.validateSchema && !f.validateSchema(b[y])) {
-      const w = `keyword "${y}" value is invalid at path "${E}": ` + v.errorsText(f.validateSchema.errors);
+    if (l.validateSchema && !l.validateSchema(b[y])) {
+      const w = `keyword "${y}" value is invalid at path "${E}": ` + v.errorsText(l.validateSchema.errors);
       if (u.validateSchema === "log")
         v.logger.error(w);
       else
@@ -1622,8 +1622,8 @@ function Bs() {
       throw new Error('both "data" and "dataProp" passed, only one allowed');
     const { gen: b } = o;
     if (i !== void 0) {
-      const { errorPath: v, dataPathArr: E, opts: f } = o, y = b.let("data", (0, e._)`${o.data}${(0, e.getProperty)(i)}`, !0);
-      u(y), a.errorPath = (0, e.str)`${v}${(0, t.getErrorPath)(i, h, f.jsPropertySyntax)}`, a.parentDataProperty = (0, e._)`${i}`, a.dataPathArr = [...E, a.parentDataProperty];
+      const { errorPath: v, dataPathArr: E, opts: l } = o, y = b.let("data", (0, e._)`${o.data}${(0, e.getProperty)(i)}`, !0);
+      u(y), a.errorPath = (0, e.str)`${v}${(0, t.getErrorPath)(i, h, l.jsPropertySyntax)}`, a.parentDataProperty = (0, e._)`${i}`, a.dataPathArr = [...E, a.parentDataProperty];
     }
     if (m !== void 0) {
       const v = m instanceof e.Name ? m : b.let("data", m, !0);
@@ -1731,8 +1731,8 @@ function Hs() {
               t(n, c, a, v[E], i + "/" + u + "/" + E, h, i, u, o, E);
         } else if (u in e.propsKeywords) {
           if (v && typeof v == "object")
-            for (var f in v)
-              t(n, c, a, v[f], i + "/" + u + "/" + r(f), h, i, u, o, f);
+            for (var l in v)
+              t(n, c, a, v[l], i + "/" + u + "/" + r(l), h, i, u, o, l);
         } else (u in e.keywords || n.allKeys && !(u in e.skipKeywords)) && t(n, c, a, v, i + "/" + u, h, i, u, o);
       }
       a(o, i, h, m, g, N, b);
@@ -1765,8 +1765,8 @@ function Ft() {
     "enum",
     "const"
   ]);
-  function c(E, f = !0) {
-    return typeof E == "boolean" ? !0 : f === !0 ? !o(E) : f ? i(E) <= f : !1;
+  function c(E, l = !0) {
+    return typeof E == "boolean" ? !0 : l === !0 ? !o(E) : l ? i(E) <= l : !1;
   }
   le.inlineRef = c;
   const a = /* @__PURE__ */ new Set([
@@ -1777,33 +1777,33 @@ function Ft() {
     "$dynamicAnchor"
   ]);
   function o(E) {
-    for (const f in E) {
-      if (a.has(f))
+    for (const l in E) {
+      if (a.has(l))
         return !0;
-      const y = E[f];
+      const y = E[l];
       if (Array.isArray(y) && y.some(o) || typeof y == "object" && o(y))
         return !0;
     }
     return !1;
   }
   function i(E) {
-    let f = 0;
+    let l = 0;
     for (const y in E) {
       if (y === "$ref")
         return 1 / 0;
-      if (f++, !n.has(y) && (typeof E[y] == "object" && (0, e.eachItem)(E[y], (s) => f += i(s)), f === 1 / 0))
+      if (l++, !n.has(y) && (typeof E[y] == "object" && (0, e.eachItem)(E[y], (s) => l += i(s)), l === 1 / 0))
         return 1 / 0;
     }
-    return f;
+    return l;
   }
-  function h(E, f = "", y) {
-    y !== !1 && (f = N(f));
-    const s = E.parse(f);
+  function h(E, l = "", y) {
+    y !== !1 && (l = N(l));
+    const s = E.parse(l);
     return m(E, s);
   }
   le.getFullPath = h;
-  function m(E, f) {
-    return E.serialize(f).split("#")[0] + "#";
+  function m(E, l) {
+    return E.serialize(l).split("#")[0] + "#";
   }
   le._getFullPath = m;
   const g = /#\/?$/;
@@ -1811,15 +1811,15 @@ function Ft() {
     return E ? E.replace(g, "") : "";
   }
   le.normalizeId = N;
-  function b(E, f, y) {
-    return y = N(y), E.resolve(f, y);
+  function b(E, l, y) {
+    return y = N(y), E.resolve(l, y);
   }
   le.resolveUrl = b;
   const u = /^[a-z_][-a-z0-9._]*$/i;
-  function v(E, f) {
+  function v(E, l) {
     if (typeof E == "boolean")
       return {};
-    const { schemaId: y, uriResolver: s } = this.opts, p = N(E[y] || f), w = { "": p }, d = h(s, p, !1), _ = {}, P = /* @__PURE__ */ new Set();
+    const { schemaId: y, uriResolver: s } = this.opts, p = N(E[y] || l), w = { "": p }, d = h(s, p, !1), _ = {}, P = /* @__PURE__ */ new Set();
     return r(E, { allKeys: !0 }, (U, A, L, K) => {
       if (K === void 0)
         return;
@@ -1859,7 +1859,7 @@ function Ze() {
   const e = /* @__PURE__ */ Ls(), t = /* @__PURE__ */ zt(), r = /* @__PURE__ */ Jn(), n = /* @__PURE__ */ zt(), c = /* @__PURE__ */ Us(), a = /* @__PURE__ */ Ks(), o = /* @__PURE__ */ Bs(), i = /* @__PURE__ */ Y(), h = /* @__PURE__ */ Ne(), m = /* @__PURE__ */ Ft(), g = /* @__PURE__ */ X(), N = /* @__PURE__ */ Ye();
   function b(R) {
     if (d(R) && (P(R), w(R))) {
-      f(R);
+      l(R);
       return;
     }
     u(R, () => (0, e.topBoolOrEmptySchema)(R));
@@ -1880,7 +1880,7 @@ function Ze() {
       R.var(h.default.instancePath, (0, i._)`""`), R.var(h.default.parentData, (0, i._)`undefined`), R.var(h.default.parentDataProperty, (0, i._)`undefined`), R.var(h.default.rootData, h.default.data), I.dynamicRef && R.var(h.default.dynamicAnchors, (0, i._)`{}`);
     });
   }
-  function f(R) {
+  function l(R) {
     const { schema: I, opts: V, gen: C } = R;
     u(R, () => {
       V.$comment && I.$comment && K(R), U(R), C.let(h.default.vErrors, null), C.let(h.default.errors, 0), V.unevaluated && y(R), T(R), B(R);
@@ -1992,7 +1992,7 @@ function Ze() {
       }
       I.forEach((V) => {
         O(R.dataTypes, V) || S(R, `type "${V}" not allowed by context "${R.dataTypes.join(",")}"`);
-      }), l(R, I);
+      }), f(R, I);
     }
   }
   function M(R, I) {
@@ -2014,7 +2014,7 @@ function Ze() {
   function O(R, I) {
     return R.includes(I) || I === "integer" && R.includes("number");
   }
-  function l(R, I) {
+  function f(R, I) {
     const V = [];
     for (const C of R.dataTypes)
       O(I, C) ? V.push(C) : I.includes("integer") && C === "number" && V.push("integer");
@@ -2202,18 +2202,18 @@ function pr() {
     }
   }
   me.SchemaEnv = o;
-  function i(f) {
-    const y = g.call(this, f);
+  function i(l) {
+    const y = g.call(this, l);
     if (y)
       return y;
-    const s = (0, n.getFullPath)(this.opts.uriResolver, f.root.baseId), { es5: p, lines: w } = this.opts.code, { ownProperties: d } = this.opts, _ = new e.CodeGen(this.scope, { es5: p, lines: w, ownProperties: d });
+    const s = (0, n.getFullPath)(this.opts.uriResolver, l.root.baseId), { es5: p, lines: w } = this.opts.code, { ownProperties: d } = this.opts, _ = new e.CodeGen(this.scope, { es5: p, lines: w, ownProperties: d });
     let P;
-    f.$async && (P = _.scopeValue("Error", {
+    l.$async && (P = _.scopeValue("Error", {
       ref: t.default,
       code: (0, e._)`require("ajv/dist/runtime/validation_error").default`
     }));
     const T = _.scopeName("validate");
-    f.validateName = T;
+    l.validateName = T;
     const D = {
       gen: _,
       allErrors: this.opts.allErrors,
@@ -2226,26 +2226,26 @@ function pr() {
       dataLevel: 0,
       dataTypes: [],
       definedProperties: /* @__PURE__ */ new Set(),
-      topSchemaRef: _.scopeValue("schema", this.opts.code.source === !0 ? { ref: f.schema, code: (0, e.stringify)(f.schema) } : { ref: f.schema }),
+      topSchemaRef: _.scopeValue("schema", this.opts.code.source === !0 ? { ref: l.schema, code: (0, e.stringify)(l.schema) } : { ref: l.schema }),
       validateName: T,
       ValidationError: P,
-      schema: f.schema,
-      schemaEnv: f,
+      schema: l.schema,
+      schemaEnv: l,
       rootId: s,
-      baseId: f.baseId || s,
+      baseId: l.baseId || s,
       schemaPath: e.nil,
-      errSchemaPath: f.schemaPath || (this.opts.jtd ? "" : "#"),
+      errSchemaPath: l.schemaPath || (this.opts.jtd ? "" : "#"),
       errorPath: (0, e._)`""`,
       opts: this.opts,
       self: this
     };
     let U;
     try {
-      this._compilations.add(f), (0, a.validateFunctionCode)(D), _.optimize(this.opts.code.optimize);
+      this._compilations.add(l), (0, a.validateFunctionCode)(D), _.optimize(this.opts.code.optimize);
       const A = _.toString();
-      U = `${_.scopeRefs(r.default.scope)}return ${A}`, this.opts.code.process && (U = this.opts.code.process(U, f));
+      U = `${_.scopeRefs(r.default.scope)}return ${A}`, this.opts.code.process && (U = this.opts.code.process(U, l));
       const K = new Function(`${r.default.self}`, `${r.default.scope}`, U)(this, this.scope.get());
-      if (this.scope.value(T, { ref: K }), K.errors = null, K.schema = f.schema, K.schemaEnv = f, f.$async && (K.$async = !0), this.opts.code.source === !0 && (K.source = { validateName: T, validateCode: A, scopeValues: _._values }), this.opts.unevaluated) {
+      if (this.scope.value(T, { ref: K }), K.errors = null, K.schema = l.schema, K.schemaEnv = l, l.$async && (K.$async = !0), this.opts.code.source === !0 && (K.source = { validateName: T, validateCode: A, scopeValues: _._values }), this.opts.unevaluated) {
         const { props: B, items: x } = D;
         K.evaluated = {
           props: B instanceof e.Name ? void 0 : B,
@@ -2254,61 +2254,61 @@ function pr() {
           dynamicItems: x instanceof e.Name
         }, K.source && (K.source.evaluated = (0, e.stringify)(K.evaluated));
       }
-      return f.validate = K, f;
+      return l.validate = K, l;
     } catch (A) {
-      throw delete f.validate, delete f.validateName, U && this.logger.error("Error compiling schema, function code:", U), A;
+      throw delete l.validate, delete l.validateName, U && this.logger.error("Error compiling schema, function code:", U), A;
     } finally {
-      this._compilations.delete(f);
+      this._compilations.delete(l);
     }
   }
   me.compileSchema = i;
-  function h(f, y, s) {
+  function h(l, y, s) {
     var p;
     s = (0, n.resolveUrl)(this.opts.uriResolver, y, s);
-    const w = f.refs[s];
+    const w = l.refs[s];
     if (w)
       return w;
-    let d = b.call(this, f, s);
+    let d = b.call(this, l, s);
     if (d === void 0) {
-      const _ = (p = f.localRefs) === null || p === void 0 ? void 0 : p[s], { schemaId: P } = this.opts;
-      _ && (d = new o({ schema: _, schemaId: P, root: f, baseId: y }));
+      const _ = (p = l.localRefs) === null || p === void 0 ? void 0 : p[s], { schemaId: P } = this.opts;
+      _ && (d = new o({ schema: _, schemaId: P, root: l, baseId: y }));
     }
     if (d !== void 0)
-      return f.refs[s] = m.call(this, d);
+      return l.refs[s] = m.call(this, d);
   }
   me.resolveRef = h;
-  function m(f) {
-    return (0, n.inlineRef)(f.schema, this.opts.inlineRefs) ? f.schema : f.validate ? f : i.call(this, f);
+  function m(l) {
+    return (0, n.inlineRef)(l.schema, this.opts.inlineRefs) ? l.schema : l.validate ? l : i.call(this, l);
   }
-  function g(f) {
+  function g(l) {
     for (const y of this._compilations)
-      if (N(y, f))
+      if (N(y, l))
         return y;
   }
   me.getCompilingSchema = g;
-  function N(f, y) {
-    return f.schema === y.schema && f.root === y.root && f.baseId === y.baseId;
+  function N(l, y) {
+    return l.schema === y.schema && l.root === y.root && l.baseId === y.baseId;
   }
-  function b(f, y) {
+  function b(l, y) {
     let s;
     for (; typeof (s = this.refs[y]) == "string"; )
       y = s;
-    return s || this.schemas[y] || u.call(this, f, y);
+    return s || this.schemas[y] || u.call(this, l, y);
   }
-  function u(f, y) {
+  function u(l, y) {
     const s = this.opts.uriResolver.parse(y), p = (0, n._getFullPath)(this.opts.uriResolver, s);
-    let w = (0, n.getFullPath)(this.opts.uriResolver, f.baseId, void 0);
-    if (Object.keys(f.schema).length > 0 && p === w)
-      return E.call(this, s, f);
+    let w = (0, n.getFullPath)(this.opts.uriResolver, l.baseId, void 0);
+    if (Object.keys(l.schema).length > 0 && p === w)
+      return E.call(this, s, l);
     const d = (0, n.normalizeId)(p), _ = this.refs[d] || this.schemas[d];
     if (typeof _ == "string") {
-      const P = u.call(this, f, _);
+      const P = u.call(this, l, _);
       return typeof (P == null ? void 0 : P.schema) != "object" ? void 0 : E.call(this, s, P);
     }
     if (typeof (_ == null ? void 0 : _.schema) == "object") {
       if (_.validate || i.call(this, _), d === (0, n.normalizeId)(y)) {
         const { schema: P } = _, { schemaId: T } = this.opts, D = P[T];
-        return D && (w = (0, n.resolveUrl)(this.opts.uriResolver, w, D)), new o({ schema: P, schemaId: T, root: f, baseId: w });
+        return D && (w = (0, n.resolveUrl)(this.opts.uriResolver, w, D)), new o({ schema: P, schemaId: T, root: l, baseId: w });
       }
       return E.call(this, s, _);
     }
@@ -2321,11 +2321,11 @@ function pr() {
     "dependencies",
     "definitions"
   ]);
-  function E(f, { baseId: y, schema: s, root: p }) {
+  function E(l, { baseId: y, schema: s, root: p }) {
     var w;
-    if (((w = f.fragment) === null || w === void 0 ? void 0 : w[0]) !== "/")
+    if (((w = l.fragment) === null || w === void 0 ? void 0 : w[0]) !== "/")
       return;
-    for (const P of f.fragment.slice(1).split("/")) {
+    for (const P of l.fragment.slice(1).split("/")) {
       if (typeof s == "boolean")
         return;
       const T = s[(0, c.unescapeFragment)(P)];
@@ -2392,13 +2392,13 @@ function Zn() {
   }
   function o(b) {
     let u = 0;
-    const v = { error: !1, address: "", zone: "" }, E = [], f = [];
+    const v = { error: !1, address: "", zone: "" }, E = [], l = [];
     let y = !1, s = !1, p = a;
     for (let w = 0; w < b.length; w++) {
       const d = b[w];
       if (!(d === "[" || d === "]"))
         if (d === ":") {
-          if (y === !0 && (s = !0), !p(f, E, v))
+          if (y === !0 && (s = !0), !p(l, E, v))
             break;
           if (++u > 7) {
             v.error = !0;
@@ -2407,15 +2407,15 @@ function Zn() {
           w > 0 && b[w - 1] === ":" && (y = !0), E.push(":");
           continue;
         } else if (d === "%") {
-          if (!p(f, E, v))
+          if (!p(l, E, v))
             break;
           p = c;
         } else {
-          f.push(d);
+          l.push(d);
           continue;
         }
     }
-    return f.length && (p === c ? v.zone = f.join("") : s ? E.push(f.join("")) : E.push(r(f))), v.address = E.join(""), v;
+    return l.length && (p === c ? v.zone = l.join("") : s ? E.push(l.join("")) : E.push(r(l))), v.address = E.join(""), v;
   }
   function i(b) {
     if (h(b, ":") < 2)
@@ -2437,9 +2437,9 @@ function Zn() {
   function m(b) {
     let u = b;
     const v = [];
-    let E = -1, f = 0;
-    for (; f = u.length; ) {
-      if (f === 1) {
+    let E = -1, l = 0;
+    for (; l = u.length; ) {
+      if (l === 1) {
         if (u === ".")
           break;
         if (u === "/") {
@@ -2449,7 +2449,7 @@ function Zn() {
           v.push(u);
           break;
         }
-      } else if (f === 2) {
+      } else if (l === 2) {
         if (u[0] === ".") {
           if (u[1] === ".")
             break;
@@ -2461,7 +2461,7 @@ function Zn() {
           v.push("/");
           break;
         }
-      } else if (f === 3 && u === "/..") {
+      } else if (l === 3 && u === "/..") {
         v.length !== 0 && v.pop(), v.push("/");
         break;
       }
@@ -2613,7 +2613,7 @@ function xs() {
       parse: i,
       serialize: h
     }
-  ), f = (
+  ), l = (
     /** @type {SchemeHandler} */
     {
       scheme: "wss",
@@ -2627,7 +2627,7 @@ function xs() {
       http: u,
       https: v,
       ws: E,
-      wss: f,
+      wss: l,
       urn: (
         /** @type {SchemeHandler} */
         {
@@ -2670,37 +2670,37 @@ function eo() {
   if (Wr) return Be.exports;
   Wr = 1;
   const { normalizeIPv6: e, removeDotSegments: t, recomposeAuthority: r, normalizeComponentEncoding: n, isIPv4: c, nonSimpleDomain: a } = Zn(), { SCHEMES: o, getSchemeHandler: i } = xs();
-  function h(f, y) {
-    return typeof f == "string" ? f = /** @type {T} */
-    b(v(f, y), y) : typeof f == "object" && (f = /** @type {T} */
-    v(b(f, y), y)), f;
+  function h(l, y) {
+    return typeof l == "string" ? l = /** @type {T} */
+    b(v(l, y), y) : typeof l == "object" && (l = /** @type {T} */
+    v(b(l, y), y)), l;
   }
-  function m(f, y, s) {
-    const p = s ? Object.assign({ scheme: "null" }, s) : { scheme: "null" }, w = g(v(f, p), v(y, p), p, !0);
+  function m(l, y, s) {
+    const p = s ? Object.assign({ scheme: "null" }, s) : { scheme: "null" }, w = g(v(l, p), v(y, p), p, !0);
     return p.skipEscape = !0, b(w, p);
   }
-  function g(f, y, s, p) {
+  function g(l, y, s, p) {
     const w = {};
-    return p || (f = v(b(f, s), s), y = v(b(y, s), s)), s = s || {}, !s.tolerant && y.scheme ? (w.scheme = y.scheme, w.userinfo = y.userinfo, w.host = y.host, w.port = y.port, w.path = t(y.path || ""), w.query = y.query) : (y.userinfo !== void 0 || y.host !== void 0 || y.port !== void 0 ? (w.userinfo = y.userinfo, w.host = y.host, w.port = y.port, w.path = t(y.path || ""), w.query = y.query) : (y.path ? (y.path[0] === "/" ? w.path = t(y.path) : ((f.userinfo !== void 0 || f.host !== void 0 || f.port !== void 0) && !f.path ? w.path = "/" + y.path : f.path ? w.path = f.path.slice(0, f.path.lastIndexOf("/") + 1) + y.path : w.path = y.path, w.path = t(w.path)), w.query = y.query) : (w.path = f.path, y.query !== void 0 ? w.query = y.query : w.query = f.query), w.userinfo = f.userinfo, w.host = f.host, w.port = f.port), w.scheme = f.scheme), w.fragment = y.fragment, w;
+    return p || (l = v(b(l, s), s), y = v(b(y, s), s)), s = s || {}, !s.tolerant && y.scheme ? (w.scheme = y.scheme, w.userinfo = y.userinfo, w.host = y.host, w.port = y.port, w.path = t(y.path || ""), w.query = y.query) : (y.userinfo !== void 0 || y.host !== void 0 || y.port !== void 0 ? (w.userinfo = y.userinfo, w.host = y.host, w.port = y.port, w.path = t(y.path || ""), w.query = y.query) : (y.path ? (y.path[0] === "/" ? w.path = t(y.path) : ((l.userinfo !== void 0 || l.host !== void 0 || l.port !== void 0) && !l.path ? w.path = "/" + y.path : l.path ? w.path = l.path.slice(0, l.path.lastIndexOf("/") + 1) + y.path : w.path = y.path, w.path = t(w.path)), w.query = y.query) : (w.path = l.path, y.query !== void 0 ? w.query = y.query : w.query = l.query), w.userinfo = l.userinfo, w.host = l.host, w.port = l.port), w.scheme = l.scheme), w.fragment = y.fragment, w;
   }
-  function N(f, y, s) {
-    return typeof f == "string" ? (f = unescape(f), f = b(n(v(f, s), !0), { ...s, skipEscape: !0 })) : typeof f == "object" && (f = b(n(f, !0), { ...s, skipEscape: !0 })), typeof y == "string" ? (y = unescape(y), y = b(n(v(y, s), !0), { ...s, skipEscape: !0 })) : typeof y == "object" && (y = b(n(y, !0), { ...s, skipEscape: !0 })), f.toLowerCase() === y.toLowerCase();
+  function N(l, y, s) {
+    return typeof l == "string" ? (l = unescape(l), l = b(n(v(l, s), !0), { ...s, skipEscape: !0 })) : typeof l == "object" && (l = b(n(l, !0), { ...s, skipEscape: !0 })), typeof y == "string" ? (y = unescape(y), y = b(n(v(y, s), !0), { ...s, skipEscape: !0 })) : typeof y == "object" && (y = b(n(y, !0), { ...s, skipEscape: !0 })), l.toLowerCase() === y.toLowerCase();
   }
-  function b(f, y) {
+  function b(l, y) {
     const s = {
-      host: f.host,
-      scheme: f.scheme,
-      userinfo: f.userinfo,
-      port: f.port,
-      path: f.path,
-      query: f.query,
-      nid: f.nid,
-      nss: f.nss,
-      uuid: f.uuid,
-      fragment: f.fragment,
-      reference: f.reference,
-      resourceName: f.resourceName,
-      secure: f.secure,
+      host: l.host,
+      scheme: l.scheme,
+      userinfo: l.userinfo,
+      port: l.port,
+      path: l.path,
+      query: l.query,
+      nid: l.nid,
+      nss: l.nss,
+      uuid: l.uuid,
+      fragment: l.fragment,
+      reference: l.reference,
+      resourceName: l.resourceName,
+      secure: l.secure,
       error: ""
     }, p = Object.assign({}, y), w = [], d = i(p.scheme || s.scheme);
     d && d.serialize && d.serialize(s, p), s.path !== void 0 && (p.skipEscape ? s.path = unescape(s.path) : (s.path = escape(s.path), s.scheme !== void 0 && (s.path = s.path.split("%3A").join(":")))), p.reference !== "suffix" && s.scheme && w.push(s.scheme, ":");
@@ -2712,7 +2712,7 @@ function eo() {
     return s.query !== void 0 && w.push("?", s.query), s.fragment !== void 0 && w.push("#", s.fragment), w.join("");
   }
   const u = /^(?:([^#/:?]+):)?(?:\/\/((?:([^#/?@]*)@)?(\[[^#/?\]]+\]|[^#/:?]*)(?::(\d*))?))?([^#?]*)(?:\?([^#]*))?(?:#((?:.|[\n\r])*))?/u;
-  function v(f, y) {
+  function v(l, y) {
     const s = Object.assign({}, y), p = {
       scheme: void 0,
       userinfo: void 0,
@@ -2723,8 +2723,8 @@ function eo() {
       fragment: void 0
     };
     let w = !1;
-    s.reference === "suffix" && (s.scheme ? f = s.scheme + ":" + f : f = "//" + f);
-    const d = f.match(u);
+    s.reference === "suffix" && (s.scheme ? l = s.scheme + ":" + l : l = "//" + l);
+    const d = l.match(u);
     if (d) {
       if (p.scheme = d[1], p.userinfo = d[3], p.host = d[4], p.port = parseInt(d[5], 10), p.path = d[6] || "", p.query = d[7], p.fragment = d[8], isNaN(p.port) && (p.port = d[5]), p.host)
         if (c(p.host) === !1) {
@@ -2740,7 +2740,7 @@ function eo() {
         } catch (P) {
           p.error = p.error || "Host's domain name can not be converted to ASCII: " + P;
         }
-      (!_ || _ && !_.skipNormalize) && (f.indexOf("%") !== -1 && (p.scheme !== void 0 && (p.scheme = unescape(p.scheme)), p.host !== void 0 && (p.host = unescape(p.host))), p.path && (p.path = escape(unescape(p.path))), p.fragment && (p.fragment = encodeURI(decodeURIComponent(p.fragment)))), _ && _.parse && _.parse(p, s);
+      (!_ || _ && !_.skipNormalize) && (l.indexOf("%") !== -1 && (p.scheme !== void 0 && (p.scheme = unescape(p.scheme)), p.host !== void 0 && (p.host = unescape(p.host))), p.path && (p.path = escape(unescape(p.path))), p.fragment && (p.fragment = encodeURI(decodeURIComponent(p.fragment)))), _ && _.parse && _.parse(p, s);
     } else
       p.error = p.error || "URI can not be parsed.";
     return p;
@@ -2801,7 +2801,7 @@ function ro() {
       "func",
       "obj",
       "Error"
-    ]), f = {
+    ]), l = {
       errorDataPath: "",
       format: "`validateFormats: false` can be used instead.",
       nullable: '"nullable" keyword is supported by default.',
@@ -2823,8 +2823,8 @@ function ro() {
       unicode: '"minLength"/"maxLength" account for unicode characters by default.'
     }, s = 200;
     function p(M) {
-      var j, k, O, l, S, q, F, z, H, G, R, I, V, C, W, Q, ae, ge, fe, pe, ie, Me, ye, Kt, Bt;
-      const Le = M.strict, Ht = (j = M.code) === null || j === void 0 ? void 0 : j.optimize, gr = Ht === !0 || Ht === void 0 ? 1 : Ht || 0, vr = (O = (k = M.code) === null || k === void 0 ? void 0 : k.regExp) !== null && O !== void 0 ? O : u, qs = (l = M.uriResolver) !== null && l !== void 0 ? l : b.default;
+      var j, k, O, f, S, q, F, z, H, G, R, I, V, C, W, Q, ae, ge, fe, pe, ie, Me, ye, Kt, Bt;
+      const Le = M.strict, Ht = (j = M.code) === null || j === void 0 ? void 0 : j.optimize, gr = Ht === !0 || Ht === void 0 ? 1 : Ht || 0, vr = (O = (k = M.code) === null || k === void 0 ? void 0 : k.regExp) !== null && O !== void 0 ? O : u, qs = (f = M.uriResolver) !== null && f !== void 0 ? f : b.default;
       return {
         strictSchema: (q = (S = M.strictSchema) !== null && S !== void 0 ? S : Le) !== null && q !== void 0 ? q : !0,
         strictNumbers: (z = (F = M.strictNumbers) !== null && F !== void 0 ? F : Le) !== null && z !== void 0 ? z : !0,
@@ -2851,16 +2851,16 @@ function ro() {
         this.schemas = {}, this.refs = {}, this.formats = {}, this._compilations = /* @__PURE__ */ new Set(), this._loading = {}, this._cache = /* @__PURE__ */ new Map(), j = this.opts = { ...j, ...p(j) };
         const { es5: k, lines: O } = this.opts.code;
         this.scope = new i.ValueScope({ scope: {}, prefixes: E, es5: k, lines: O }), this.logger = L(j.logger);
-        const l = j.validateFormats;
-        j.validateFormats = !1, this.RULES = (0, a.getRules)(), d.call(this, f, j, "NOT SUPPORTED"), d.call(this, y, j, "DEPRECATED", "warn"), this._metaOpts = U.call(this), j.formats && T.call(this), this._addVocabularies(), this._addDefaultMetaSchema(), j.keywords && D.call(this, j.keywords), typeof j.meta == "object" && this.addMetaSchema(j.meta), P.call(this), j.validateFormats = l;
+        const f = j.validateFormats;
+        j.validateFormats = !1, this.RULES = (0, a.getRules)(), d.call(this, l, j, "NOT SUPPORTED"), d.call(this, y, j, "DEPRECATED", "warn"), this._metaOpts = U.call(this), j.formats && T.call(this), this._addVocabularies(), this._addDefaultMetaSchema(), j.keywords && D.call(this, j.keywords), typeof j.meta == "object" && this.addMetaSchema(j.meta), P.call(this), j.validateFormats = f;
       }
       _addVocabularies() {
         this.addKeyword("$async");
       }
       _addDefaultMetaSchema() {
         const { $data: j, meta: k, schemaId: O } = this.opts;
-        let l = N;
-        O === "id" && (l = { ...N }, l.id = l.$id, delete l.$id), k && j && this.addMetaSchema(l, l[O], !1);
+        let f = N;
+        O === "id" && (f = { ...N }, f.id = f.$id, delete f.$id), k && j && this.addMetaSchema(f, f[O], !1);
       }
       defaultMeta() {
         const { meta: j, schemaId: k } = this.opts;
@@ -2873,8 +2873,8 @@ function ro() {
             throw new Error(`no schema with key or ref "${j}"`);
         } else
           O = this.compile(j);
-        const l = O(k);
-        return "$async" in O || (this.errors = O.errors), l;
+        const f = O(k);
+        return "$async" in O || (this.errors = O.errors), f;
       }
       compile(j, k) {
         const O = this._addSchema(j, k);
@@ -2884,14 +2884,14 @@ function ro() {
         if (typeof this.opts.loadSchema != "function")
           throw new Error("options.loadSchema should be a function");
         const { loadSchema: O } = this.opts;
-        return l.call(this, j, k);
-        async function l(G, R) {
+        return f.call(this, j, k);
+        async function f(G, R) {
           await S.call(this, G.$schema);
           const I = this._addSchema(G, R);
           return I.validate || q.call(this, I);
         }
         async function S(G) {
-          G && !this.getSchema(G) && await l.call(this, { $ref: G }, !0);
+          G && !this.getSchema(G) && await f.call(this, { $ref: G }, !0);
         }
         async function q(G) {
           try {
@@ -2922,10 +2922,10 @@ function ro() {
         }
       }
       // Adds schema to the instance
-      addSchema(j, k, O, l = this.opts.validateSchema) {
+      addSchema(j, k, O, f = this.opts.validateSchema) {
         if (Array.isArray(j)) {
           for (const q of j)
-            this.addSchema(q, void 0, O, l);
+            this.addSchema(q, void 0, O, f);
           return this;
         }
         let S;
@@ -2934,7 +2934,7 @@ function ro() {
           if (S = j[q], S !== void 0 && typeof S != "string")
             throw new Error(`schema ${q} must be string`);
         }
-        return k = (0, h.normalizeId)(k || S), this._checkUnique(k), this.schemas[k] = this._addSchema(j, O, k, l, !0), this;
+        return k = (0, h.normalizeId)(k || S), this._checkUnique(k), this.schemas[k] = this._addSchema(j, O, k, f, !0), this;
       }
       // Add schema that will be used to validate other schemas
       // options in META_IGNORE_OPTIONS are alway set to false
@@ -2950,15 +2950,15 @@ function ro() {
           throw new Error("$schema must be a string");
         if (O = O || this.opts.defaultMeta || this.defaultMeta(), !O)
           return this.logger.warn("meta-schema not available"), this.errors = null, !0;
-        const l = this.validate(O, j);
-        if (!l && k) {
+        const f = this.validate(O, j);
+        if (!f && k) {
           const S = "schema is invalid: " + this.errorsText();
           if (this.opts.validateSchema === "log")
             this.logger.error(S);
           else
             throw new Error(S);
         }
-        return l;
+        return f;
       }
       // Get compiled schema by `key` or `ref`.
       // (`key` that was passed to `addSchema` or full schema reference - `schema.$id` or resolved id)
@@ -2967,8 +2967,8 @@ function ro() {
         for (; typeof (k = _.call(this, j)) == "string"; )
           j = k;
         if (k === void 0) {
-          const { schemaId: O } = this.opts, l = new o.SchemaEnv({ schema: {}, schemaId: O });
-          if (k = o.resolveSchema.call(this, l, j), !k)
+          const { schemaId: O } = this.opts, f = new o.SchemaEnv({ schema: {}, schemaId: O });
+          if (k = o.resolveSchema.call(this, f, j), !k)
             return;
           this.refs[j] = k;
         }
@@ -3016,12 +3016,12 @@ function ro() {
         if (B.call(this, O, k), !k)
           return (0, g.eachItem)(O, (S) => x.call(this, S)), this;
         oe.call(this, k);
-        const l = {
+        const f = {
           ...k,
           type: (0, m.getJSONTypes)(k.type),
           schemaType: (0, m.getJSONTypes)(k.schemaType)
         };
-        return (0, g.eachItem)(O, l.type.length === 0 ? (S) => x.call(this, S, l) : (S) => l.type.forEach((q) => x.call(this, S, l, q))), this;
+        return (0, g.eachItem)(O, f.type.length === 0 ? (S) => x.call(this, S, f) : (S) => f.type.forEach((q) => x.call(this, S, f, q))), this;
       }
       getKeyword(j) {
         const k = this.RULES.all[j];
@@ -3032,8 +3032,8 @@ function ro() {
         const { RULES: k } = this;
         delete k.keywords[j], delete k.all[j];
         for (const O of k.rules) {
-          const l = O.rules.findIndex((S) => S.keyword === j);
-          l >= 0 && O.rules.splice(l, 1);
+          const f = O.rules.findIndex((S) => S.keyword === j);
+          f >= 0 && O.rules.splice(f, 1);
         }
         return this;
       }
@@ -3042,13 +3042,13 @@ function ro() {
         return typeof k == "string" && (k = new RegExp(k)), this.formats[j] = k, this;
       }
       errorsText(j = this.errors, { separator: k = ", ", dataVar: O = "data" } = {}) {
-        return !j || j.length === 0 ? "No errors" : j.map((l) => `${O}${l.instancePath} ${l.message}`).reduce((l, S) => l + k + S);
+        return !j || j.length === 0 ? "No errors" : j.map((f) => `${O}${f.instancePath} ${f.message}`).reduce((f, S) => f + k + S);
       }
       $dataMetaSchema(j, k) {
         const O = this.RULES.all;
         j = JSON.parse(JSON.stringify(j));
-        for (const l of k) {
-          const S = l.split("/").slice(1);
+        for (const f of k) {
+          const S = f.split("/").slice(1);
           let q = j;
           for (const F of S)
             q = q[F];
@@ -3064,11 +3064,11 @@ function ro() {
       }
       _removeAllSchemas(j, k) {
         for (const O in j) {
-          const l = j[O];
-          (!k || k.test(O)) && (typeof l == "string" ? delete j[O] : l && !l.meta && (this._cache.delete(l.schema), delete j[O]));
+          const f = j[O];
+          (!k || k.test(O)) && (typeof f == "string" ? delete j[O] : f && !f.meta && (this._cache.delete(f.schema), delete j[O]));
         }
       }
-      _addSchema(j, k, O, l = this.opts.validateSchema, S = this.opts.addUsedSchema) {
+      _addSchema(j, k, O, f = this.opts.validateSchema, S = this.opts.addUsedSchema) {
         let q;
         const { schemaId: F } = this.opts;
         if (typeof j == "object")
@@ -3084,7 +3084,7 @@ function ro() {
           return z;
         O = (0, h.normalizeId)(q || O);
         const H = h.getSchemaRefs.call(this, j, O);
-        return z = new o.SchemaEnv({ schema: j, schemaId: F, meta: k, baseId: O, localRefs: H }), this._cache.set(z.schema, z), S && !O.startsWith("#") && (O && this._checkUnique(O), this.refs[O] = z), l && this.validateSchema(j, !0), z;
+        return z = new o.SchemaEnv({ schema: j, schemaId: F, meta: k, baseId: O, localRefs: H }), this._cache.set(z.schema, z), S && !O.startsWith("#") && (O && this._checkUnique(O), this.refs[O] = z), f && this.validateSchema(j, !0), z;
       }
       _checkUnique(j) {
         if (this.schemas[j] || this.refs[j])
@@ -3107,9 +3107,9 @@ function ro() {
     }
     w.ValidationError = n.default, w.MissingRefError = c.default, e.default = w;
     function d(M, j, k, O = "error") {
-      for (const l in M) {
-        const S = l;
-        S in j && this.logger[O](`${k}: option ${l}. ${M[S]}`);
+      for (const f in M) {
+        const S = f;
+        S in j && this.logger[O](`${k}: option ${f}. ${M[S]}`);
       }
     }
     function _(M) {
@@ -3173,11 +3173,11 @@ function ro() {
     }
     function x(M, j, k) {
       var O;
-      const l = j == null ? void 0 : j.post;
-      if (k && l)
+      const f = j == null ? void 0 : j.post;
+      if (k && f)
         throw new Error('keyword with "post" flag cannot have "type"');
       const { RULES: S } = this;
-      let q = l ? S.post : S.rules.find(({ type: z }) => z === k);
+      let q = f ? S.post : S.rules.find(({ type: z }) => z === k);
       if (q || (q = { type: k, rules: [] }, S.rules.push(q)), S.keywords[M] = !0, !j)
         return;
       const F = {
@@ -3191,7 +3191,7 @@ function ro() {
       j.before ? se.call(this, q, F, j.before) : q.rules.push(F), S.all[M] = F, (O = j.implements) === null || O === void 0 || O.forEach((z) => this.addKeyword(z));
     }
     function se(M, j, k) {
-      const O = M.rules.findIndex((l) => l.keyword === k);
+      const O = M.rules.findIndex((f) => f.keyword === k);
       O >= 0 ? M.rules.splice(O, 0, j) : (M.rules.push(j), this.logger.warn(`rule ${k} is not defined`));
     }
     function oe(M) {
@@ -3226,7 +3226,7 @@ function so() {
     keyword: "$ref",
     schemaType: "string",
     code(m) {
-      const { gen: g, schema: N, it: b } = m, { baseId: u, schemaEnv: v, validateName: E, opts: f, self: y } = b, { root: s } = v;
+      const { gen: g, schema: N, it: b } = m, { baseId: u, schemaEnv: v, validateName: E, opts: l, self: y } = b, { root: s } = v;
       if ((N === "#" || N === "#/") && u === s.baseId)
         return w();
       const p = c.resolveRef.call(y, s, u, N);
@@ -3246,7 +3246,7 @@ function so() {
         h(m, T, P, P.$async);
       }
       function _(P) {
-        const T = g.scopeValue("schema", f.code.source === !0 ? { ref: P, code: (0, r.stringify)(P) } : { ref: P }), D = g.name("valid"), U = m.subschema({
+        const T = g.scopeValue("schema", l.code.source === !0 ? { ref: P, code: (0, r.stringify)(P) } : { ref: P }), D = g.name("valid"), U = m.subschema({
           schema: P,
           dataTypes: [],
           schemaPath: r.nil,
@@ -3263,10 +3263,10 @@ function so() {
   }
   Re.getValidate = i;
   function h(m, g, N, b) {
-    const { gen: u, it: v } = m, { allErrors: E, schemaEnv: f, opts: y } = v, s = y.passContext ? n.default.this : r.nil;
+    const { gen: u, it: v } = m, { allErrors: E, schemaEnv: l, opts: y } = v, s = y.passContext ? n.default.this : r.nil;
     b ? p() : w();
     function p() {
-      if (!f.$async)
+      if (!l.$async)
         throw new Error("async schema referenced by sync schema");
       const P = u.let("valid");
       u.try(() => {
@@ -3479,7 +3479,7 @@ function po() {
       }
       function v() {
         if (u || g)
-          a.block$data(t.nil, f);
+          a.block$data(t.nil, l);
         else
           for (const s of i)
             (0, e.checkReportMissingProp)(a, s);
@@ -3492,7 +3492,7 @@ function po() {
         } else
           o.if((0, e.checkMissingProp)(a, i, s)), (0, e.reportMissingProp)(a, s), o.else();
       }
-      function f() {
+      function l() {
         o.forOf("prop", h, (s) => {
           a.setParams({ missingProperty: s }), o.if((0, e.noPropertyInData)(o, m, s, b.ownProperties), () => a.error());
         });
@@ -3556,8 +3556,8 @@ function mo() {
       if (!m && !g)
         return;
       const v = i.let("valid"), E = N.items ? (0, e.getSchemaTypes)(N.items) : [];
-      o.block$data(v, f, (0, t._)`${b} === false`), o.ok(v);
-      function f() {
+      o.block$data(v, l, (0, t._)`${b} === false`), o.ok(v);
+      function l() {
         const w = i.let("i", (0, t._)`${h}.length`), d = i.let("j");
         o.setParams({ i: w, j: d }), i.assign(v, !0), i.if((0, t._)`${w} > 1`, () => (y() ? s : p)(w, d));
       }
@@ -3621,7 +3621,7 @@ function go() {
       const v = () => u ?? (u = (0, t.useFunc)(o, r.default));
       let E;
       if (b || h)
-        E = o.let("valid"), a.block$data(E, f);
+        E = o.let("valid"), a.block$data(E, l);
       else {
         if (!Array.isArray(m))
           throw new Error("ajv implementation error");
@@ -3629,7 +3629,7 @@ function go() {
         E = (0, e.or)(...m.map((p, w) => y(s, w)));
       }
       a.pass(E);
-      function f() {
+      function l() {
         o.assign(E, !1), o.forOf("v", g, (s) => o.if((0, e._)`${v()}(${i}, ${s})`, () => o.assign(E, !0).break()));
       }
       function y(s, p) {
@@ -3725,15 +3725,15 @@ function Xn() {
     const { gen: h, parentSchema: m, data: g, keyword: N, it: b } = a;
     E(m), b.opts.unevaluated && i.length && b.items !== !0 && (b.items = t.mergeEvaluated.items(h, i.length, b.items));
     const u = h.name("valid"), v = h.const("len", (0, e._)`${g}.length`);
-    i.forEach((f, y) => {
-      (0, t.alwaysValidSchema)(b, f) || (h.if((0, e._)`${v} > ${y}`, () => a.subschema({
+    i.forEach((l, y) => {
+      (0, t.alwaysValidSchema)(b, l) || (h.if((0, e._)`${v} > ${y}`, () => a.subschema({
         keyword: N,
         schemaProp: y,
         dataProp: y
       }, u)), a.ok(u));
     });
-    function E(f) {
-      const { opts: y, errSchemaPath: s } = b, p = i.length, w = p === f.minItems && (p === f.maxItems || f[o] === !1);
+    function E(l) {
+      const { opts: y, errSchemaPath: s } = b, p = i.length, w = p === l.minItems && (p === l.maxItems || l[o] === !1);
       if (y.strictTuples && !w) {
         const d = `"${N}" is ${p}-tuple, but minItems or maxItems/${o} are not specified or different at path "${s}"`;
         (0, t.checkStrictMode)(b, d, y.strictTuples);
@@ -3810,8 +3810,8 @@ function bo() {
       }
       m.items = !0;
       const E = a.name("valid");
-      N === void 0 && g === 1 ? y(E, () => a.if(E, () => a.break())) : g === 0 ? (a.let(E, !0), N !== void 0 && a.if((0, e._)`${h}.length > 0`, f)) : (a.let(E, !1), f()), c.result(E, () => c.reset());
-      function f() {
+      N === void 0 && g === 1 ? y(E, () => a.if(E, () => a.break())) : g === 0 ? (a.let(E, !0), N !== void 0 && a.if((0, e._)`${h}.length > 0`, l)) : (a.let(E, !1), l()), c.result(E, () => c.reset());
+      function l() {
         const p = a.name("_valid"), w = a.let("count", 0);
         y(p, () => a.if(p, () => s(w)));
       }
@@ -3877,15 +3877,15 @@ function wo() {
         const E = m[v];
         if (E.length === 0)
           continue;
-        const f = (0, n.propertyInData)(g, N, v, b.opts.ownProperties);
+        const l = (0, n.propertyInData)(g, N, v, b.opts.ownProperties);
         h.setParams({
           property: v,
           depsCount: E.length,
           deps: E.join(", ")
-        }), b.allErrors ? g.if(f, () => {
+        }), b.allErrors ? g.if(l, () => {
           for (const y of E)
             (0, n.checkReportMissingProp)(h, y);
-        }) : (g.if((0, t._)`${f} && (${(0, n.checkMissingProp)(h, E, u)})`), (0, n.reportMissingProp)(h, u), g.else());
+        }) : (g.if((0, t._)`${l} && (${(0, n.checkMissingProp)(h, E, u)})`), (0, n.reportMissingProp)(h, u), g.else());
       }
     }
     e.validatePropertyDeps = o;
@@ -3895,8 +3895,8 @@ function wo() {
         (0, r.alwaysValidSchema)(u, m[E]) || (g.if(
           (0, n.propertyInData)(g, N, E, u.opts.ownProperties),
           () => {
-            const f = h.subschema({ keyword: b, schemaProp: E }, v);
-            h.mergeValidEvaluated(f, v);
+            const l = h.subschema({ keyword: b, schemaProp: E }, v);
+            h.mergeValidEvaluated(l, v);
           },
           () => g.var(v, !0)
           // TODO var
@@ -3958,11 +3958,11 @@ function xn() {
       const { allErrors: u, opts: v } = b;
       if (b.props = !0, v.removeAdditional !== "all" && (0, n.alwaysValidSchema)(b, h))
         return;
-      const E = (0, e.allSchemaProperties)(m.properties), f = (0, e.allSchemaProperties)(m.patternProperties);
+      const E = (0, e.allSchemaProperties)(m.properties), l = (0, e.allSchemaProperties)(m.patternProperties);
       y(), o.ok((0, t._)`${N} === ${r.default.errors}`);
       function y() {
         i.forIn("key", g, (_) => {
-          !E.length && !f.length ? w(_) : i.if(s(_), () => w(_));
+          !E.length && !l.length ? w(_) : i.if(s(_), () => w(_));
         });
       }
       function s(_) {
@@ -3971,7 +3971,7 @@ function xn() {
           const T = (0, n.schemaRefOrVal)(b, m.properties, "properties");
           P = (0, e.isOwnProperty)(i, T, _);
         } else E.length ? P = (0, t.or)(...E.map((T) => (0, t._)`${_} === ${T}`)) : P = t.nil;
-        return f.length && (P = (0, t.or)(P, ...f.map((T) => (0, t._)`${(0, e.usePattern)(o, T)}.test(${_})`))), (0, t.not)(P);
+        return l.length && (P = (0, t.or)(P, ...l.map((T) => (0, t._)`${(0, e.usePattern)(o, T)}.test(${_})`))), (0, t.not)(P);
       }
       function p(_) {
         i.code((0, t._)`delete ${g}[${_}]`);
@@ -4020,23 +4020,23 @@ function So() {
       const { gen: o, schema: i, parentSchema: h, data: m, it: g } = a;
       g.opts.removeAdditional === "all" && h.additionalProperties === void 0 && n.default.code(new e.KeywordCxt(g, n.default, "additionalProperties"));
       const N = (0, t.allSchemaProperties)(i);
-      for (const f of N)
-        g.definedProperties.add(f);
+      for (const l of N)
+        g.definedProperties.add(l);
       g.opts.unevaluated && N.length && g.props !== !0 && (g.props = r.mergeEvaluated.props(o, (0, r.toHash)(N), g.props));
-      const b = N.filter((f) => !(0, r.alwaysValidSchema)(g, i[f]));
+      const b = N.filter((l) => !(0, r.alwaysValidSchema)(g, i[l]));
       if (b.length === 0)
         return;
       const u = o.name("valid");
-      for (const f of b)
-        v(f) ? E(f) : (o.if((0, t.propertyInData)(o, m, f, g.opts.ownProperties)), E(f), g.allErrors || o.else().var(u, !0), o.endIf()), a.it.definedProperties.add(f), a.ok(u);
-      function v(f) {
-        return g.opts.useDefaults && !g.compositeRule && i[f].default !== void 0;
+      for (const l of b)
+        v(l) ? E(l) : (o.if((0, t.propertyInData)(o, m, l, g.opts.ownProperties)), E(l), g.allErrors || o.else().var(u, !0), o.endIf()), a.it.definedProperties.add(l), a.ok(u);
+      function v(l) {
+        return g.opts.useDefaults && !g.compositeRule && i[l].default !== void 0;
       }
-      function E(f) {
+      function E(l) {
         a.subschema({
           keyword: "properties",
-          schemaProp: f,
-          dataProp: f
+          schemaProp: l,
+          dataProp: l
         }, u);
       }
     }
@@ -4057,7 +4057,7 @@ function Po() {
         return;
       const v = N.strictSchema && !N.allowMatchingProperties && m.properties, E = o.name("valid");
       g.props !== !0 && !(g.props instanceof t.Name) && (g.props = (0, n.evaluatedPropsToName)(o, g.props));
-      const { props: f } = g;
+      const { props: l } = g;
       y();
       function y() {
         for (const w of b)
@@ -4076,7 +4076,7 @@ function Po() {
               schemaProp: w,
               dataProp: d,
               dataPropType: n.Type.Str
-            }, E), g.opts.unevaluated && f !== !0 ? o.assign((0, t._)`${f}[${d}]`, !0) : !_ && !g.allErrors && o.if((0, t.not)(E), () => o.break());
+            }, E), g.opts.unevaluated && l !== !0 ? o.assign((0, t._)`${l}[${d}]`, !0) : !_ && !g.allErrors && o.if((0, t.not)(E), () => o.break());
           });
         });
       }
@@ -4145,13 +4145,13 @@ function Ro() {
       c.setParams({ passing: N }), a.block(u), c.result(g, () => c.reset(), () => c.error(!0));
       function u() {
         m.forEach((v, E) => {
-          let f;
-          (0, t.alwaysValidSchema)(h, v) ? a.var(b, !0) : f = c.subschema({
+          let l;
+          (0, t.alwaysValidSchema)(h, v) ? a.var(b, !0) : l = c.subschema({
             keyword: "oneOf",
             schemaProp: E,
             compositeRule: !0
           }, b), E > 0 && a.if((0, e._)`${b} && ${g}`).assign(g, !1).assign(N, (0, e._)`[${N}, ${E}]`).else(), a.if(b, () => {
-            a.assign(g, !0), a.assign(N, E), f && c.mergeEvaluated(f, e.Name);
+            a.assign(g, !0), a.assign(N, E), l && c.mergeEvaluated(l, e.Name);
           });
         });
       }
@@ -4214,10 +4214,10 @@ function jo() {
         }, b);
         a.mergeEvaluated(E);
       }
-      function v(E, f) {
+      function v(E, l) {
         return () => {
           const y = a.subschema({ keyword: E }, b);
-          o.assign(N, b), a.mergeValidEvaluated(y, N), f ? o.assign(f, (0, e._)`${E}`) : a.setParams({ ifClause: E });
+          o.assign(N, b), a.mergeValidEvaluated(y, N), l ? o.assign(l, (0, e._)`${E}`) : a.setParams({ ifClause: E });
         };
       }
     }
@@ -4246,7 +4246,7 @@ function qo() {
   if (Rn) return vt;
   Rn = 1, Object.defineProperty(vt, "__esModule", { value: !0 });
   const e = /* @__PURE__ */ Qn(), t = /* @__PURE__ */ _o(), r = /* @__PURE__ */ Xn(), n = /* @__PURE__ */ $o(), c = /* @__PURE__ */ bo(), a = /* @__PURE__ */ wo(), o = /* @__PURE__ */ Eo(), i = /* @__PURE__ */ xn(), h = /* @__PURE__ */ So(), m = /* @__PURE__ */ Po(), g = /* @__PURE__ */ No(), N = /* @__PURE__ */ Oo(), b = /* @__PURE__ */ Ro(), u = /* @__PURE__ */ Io(), v = /* @__PURE__ */ jo(), E = /* @__PURE__ */ ko();
-  function f(y = !1) {
+  function l(y = !1) {
     const s = [
       // any
       g.default,
@@ -4264,7 +4264,7 @@ function qo() {
     ];
     return y ? s.push(t.default, n.default) : s.push(e.default, r.default), s.push(c.default), s;
   }
-  return vt.default = f, vt;
+  return vt.default = l, vt;
 }
 var qt = {}, Tt = {}, In;
 function To() {
@@ -4283,7 +4283,7 @@ function To() {
       const { gen: a, data: o, $data: i, schema: h, schemaCode: m, it: g } = n, { opts: N, errSchemaPath: b, schemaEnv: u, self: v } = g;
       if (!N.validateFormats)
         return;
-      i ? E() : f();
+      i ? E() : l();
       function E() {
         const y = a.scopeValue("formats", {
           ref: v.formats,
@@ -4298,7 +4298,7 @@ function To() {
           return (0, e._)`${w} && ${w} !== true && ${p} === ${c} && !${T}`;
         }
       }
-      function f() {
+      function l() {
         const y = v.formats[h];
         if (!y) {
           d();
@@ -4404,14 +4404,14 @@ function zo() {
         throw new Error("discriminator: mapping is not supported");
       if (!u)
         throw new Error("discriminator: requires oneOf keyword");
-      const E = h.let("valid", !1), f = h.const("tag", (0, e._)`${m}${(0, e.getProperty)(v)}`);
-      h.if((0, e._)`typeof ${f} == "string"`, () => y(), () => i.error(!1, { discrError: t.DiscrError.Tag, tag: f, tagName: v })), i.ok(E);
+      const E = h.let("valid", !1), l = h.const("tag", (0, e._)`${m}${(0, e.getProperty)(v)}`);
+      h.if((0, e._)`typeof ${l} == "string"`, () => y(), () => i.error(!1, { discrError: t.DiscrError.Tag, tag: l, tagName: v })), i.ok(E);
       function y() {
         const w = p();
         h.if(!1);
         for (const d in w)
-          h.elseIf((0, e._)`${f} === ${d}`), h.assign(E, s(w[d]));
-        h.else(), i.error(!1, { discrError: t.DiscrError.Mapping, tag: f, tagName: v }), h.endIf();
+          h.elseIf((0, e._)`${l} === ${d}`), h.assign(E, s(w[d]));
+        h.else(), i.error(!1, { discrError: t.DiscrError.Mapping, tag: l, tagName: v }), h.endIf();
       }
       function s(w) {
         const d = h.name("valid"), _ = i.subschema({ keyword: "oneOf", schemaProp: w }, d);
@@ -4651,9 +4651,9 @@ function Jo() {
       if (oe !== void 0)
         return oe || m(B, se);
     }
-    const E = /\/|:/, f = /^(?:[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;
+    const E = /\/|:/, l = /^(?:[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 y(A) {
-      return E.test(A) && f.test(A);
+      return E.test(A) && l.test(A);
     }
     const s = /^(?:[A-Za-z0-9+/]{4})*(?:[A-Za-z0-9+/]{2}==|[A-Za-z0-9+/]{3}=)?$/gm;
     function p(A) {
@@ -4705,8 +4705,8 @@ function Yo() {
         if (!u.validateFormats)
           return;
         const E = new t.KeywordCxt(b, v.RULES.all.format.definition, "format");
-        E.$data ? f() : y();
-        function f() {
+        E.$data ? l() : y();
+        function l() {
           const p = h.scopeValue("formats", {
             ref: v.formats,
             code: u.code.formats
@@ -4772,7 +4772,7 @@ function xo() {
       dependencies: "property",
       dependentRequired: "property"
     }, N = /\$\{[^}]+\}/, b = /\$\{([^}]+)\}/g, u = /^""\s*\+\s*|\s*\+\s*""$/g;
-    function v(f) {
+    function v(l) {
       return {
         keyword: h,
         schemaType: ["string", "object"],
@@ -4784,28 +4784,28 @@ function xo() {
           const P = w, T = n.strConcat(i.default.instancePath, _.errorPath);
           s.if(r._`${i.default.errors} > 0`, () => {
             if (typeof P == "object") {
-              const [O, l] = U(P);
-              l && A(l), O && L(O), K(D(P));
+              const [O, f] = U(P);
+              f && A(f), O && L(O), K(D(P));
             }
             const k = typeof P == "string" ? P : P._;
-            k && B(k), f.keepErrors || x();
+            k && B(k), l.keepErrors || x();
           });
           function D({ properties: k, items: O }) {
-            const l = {};
+            const f = {};
             if (k) {
-              l.props = {};
+              f.props = {};
               for (const S in k)
-                l.props[S] = [];
+                f.props[S] = [];
             }
             if (O) {
-              l.items = {};
+              f.items = {};
               for (let S = 0; S < O.length; S++)
-                l.items[S] = [];
+                f.items[S] = [];
             }
-            return l;
+            return f;
           }
           function U(k) {
-            let O, l;
+            let O, f;
             for (const S in k) {
               if (S === "properties" || S === "items")
                 continue;
@@ -4816,14 +4816,14 @@ function xo() {
                 for (const z in q)
                   F[z] = [];
               } else
-                l || (l = {}), l[S] = [];
+                f || (f = {}), f[S] = [];
             }
-            return [O, l];
+            return [O, f];
           }
           function A(k) {
-            const O = s.const("emErrors", r.stringify(k)), l = s.const("templates", de(k, w));
+            const O = s.const("emErrors", r.stringify(k)), f = s.const("templates", de(k, w));
             s.forOf("err", i.default.vErrors, (z) => s.if(se(z, O), () => s.code(r._`${O}[${z}.keyword].push(${z})`).assign(r._`${z}.${m}`, !0)));
-            const { singleError: S } = f;
+            const { singleError: S } = l;
             if (S) {
               const z = s.let("message", r._`""`), H = s.let("paramsErrors", r._`[]`);
               q((G) => {
@@ -4838,17 +4838,17 @@ function xo() {
               s.forIn("key", O, (H) => s.if(r._`${O}[${H}].length`, () => z(H)));
             }
             function F(z) {
-              return r._`${z} in ${l} ? ${l}[${z}]() : ${d}[${z}]`;
+              return r._`${z} in ${f} ? ${f}[${z}]() : ${d}[${z}]`;
             }
           }
           function L(k) {
-            const O = s.const("emErrors", r.stringify(k)), l = [];
+            const O = s.const("emErrors", r.stringify(k)), f = [];
             for (const H in k)
-              l.push([
+              f.push([
                 H,
                 de(k[H], w[H])
               ]);
-            const S = s.const("templates", s.object(...l)), q = s.scopeValue("obj", {
+            const S = s.const("templates", s.object(...f)), q = s.scopeValue("obj", {
               ref: g,
               code: r.stringify(g)
             }), F = s.let("emPropParams"), z = s.let("emParamsErrors");
@@ -4865,17 +4865,17 @@ function xo() {
             }));
           }
           function K(k) {
-            const { props: O, items: l } = k;
-            if (!O && !l)
+            const { props: O, items: f } = k;
+            if (!O && !f)
               return;
             const S = r._`typeof ${p} == "object"`, q = r._`Array.isArray(${p})`, F = s.let("emErrors");
             let z, H;
             const G = s.let("templates");
-            O && l ? (z = s.let("emChildKwd"), s.if(S), s.if(q, () => {
-              R(l, w.items), s.assign(z, r.str`items`);
+            O && f ? (z = s.let("emChildKwd"), s.if(S), s.if(q, () => {
+              R(f, w.items), s.assign(z, r.str`items`);
             }, () => {
               R(O, w.properties), s.assign(z, r.str`properties`);
-            }), H = r._`[${z}]`) : l ? (s.if(q), R(l, w.items), H = r._`.items`) : O && (s.if(n.and(S, n.not(q))), R(O, w.properties), H = r._`.properties`), s.forOf("err", i.default.vErrors, (I) => oe(I, F, (V) => s.code(r._`${F}[${V}].push(${I})`).assign(r._`${I}.${m}`, !0))), s.forIn("key", F, (I) => s.if(r._`${F}[${I}].length`, () => {
+            }), H = r._`[${z}]`) : f ? (s.if(q), R(f, w.items), H = r._`.items`) : O && (s.if(n.and(S, n.not(q))), R(O, w.properties), H = r._`.properties`), s.forOf("err", i.default.vErrors, (I) => oe(I, F, (V) => s.code(r._`${F}[${V}].push(${I})`).assign(r._`${I}.${m}`, !0))), s.forIn("key", F, (I) => s.if(r._`${F}[${I}].length`, () => {
               o.reportError(y, {
                 message: r._`${I} in ${G} ? ${G}[${I}]() : ${d}${H}[${I}]`,
                 params: r._`{errors: ${F}[${I}]}`
@@ -4887,7 +4887,7 @@ function xo() {
           }
           function B(k) {
             const O = s.const("emErrs", r._`[]`);
-            s.forOf("err", i.default.vErrors, (l) => s.if(te(l), () => s.code(r._`${O}.push(${l})`).assign(r._`${l}.${m}`, !0))), s.if(r._`${O}.length`, () => o.reportError(y, {
+            s.forOf("err", i.default.vErrors, (f) => s.if(te(f), () => s.code(r._`${O}.push(${f})`).assign(r._`${f}.${m}`, !0))), s.if(r._`${O}.length`, () => o.reportError(y, {
               message: M(k),
               params: r._`{errors: ${O}}`
             }));
@@ -4907,28 +4907,28 @@ function xo() {
               r._`/^\\/[^\\/]*$/.test(${k}.schemaPath.slice(${_.errSchemaPath.length}))`
             );
           }
-          function oe(k, O, l) {
+          function oe(k, O, f) {
             s.if(n.and(r._`${k}.keyword !== ${h}`, r._`!${k}.${m}`, r._`${k}.instancePath.indexOf(${T}) === 0`), () => {
               const S = s.scopeValue("pattern", {
                 ref: /^\/([^/]*)(?:\/|$)/,
                 code: r._`new RegExp("^\\\/([^/]*)(?:\\\/|$)")`
               }), q = s.const("emMatches", r._`${S}.exec(${k}.instancePath.slice(${T}.length))`), F = s.const("emChild", r._`${q} && ${q}[1].replace(/~1/g, "/").replace(/~0/g, "~")`);
-              s.if(r._`${F} !== undefined && ${F} in ${O}`, () => l(F));
+              s.if(r._`${F} !== undefined && ${F} in ${O}`, () => f(F));
             });
           }
           function te(k) {
             return n.and(r._`${k}.keyword !== ${h}`, r._`!${k}.${m}`, n.or(r._`${k}.instancePath === ${T}`, n.and(r._`${k}.instancePath.indexOf(${T}) === 0`, r._`${k}.instancePath[${T}.length] === "/"`)), r._`${k}.schemaPath.indexOf(${_.errSchemaPath}) === 0`, r._`${k}.schemaPath[${_.errSchemaPath}.length] === "/"`);
           }
           function de(k, O) {
-            const l = [];
+            const f = [];
             for (const S in k) {
               const q = O[S];
-              N.test(q) && l.push([S, j(q)]);
+              N.test(q) && f.push([S, j(q)]);
             }
-            return s.object(...l);
+            return s.object(...f);
           }
           function M(k) {
-            return N.test(k) ? new c._Code(c.safeStringify(k).replace(b, (O, l) => `" + JSON.stringify(${a.getData(l, _)}) + "`).replace(u, "")) : r.stringify(k);
+            return N.test(k) ? new c._Code(c.safeStringify(k).replace(b, (O, f) => `" + JSON.stringify(${a.getData(f, _)}) + "`).replace(u, "")) : r.stringify(k);
           }
           function j(k) {
             return r._`function(){return ${M(k)}}`;
@@ -4961,12 +4961,12 @@ function xo() {
         }
       };
     }
-    const E = (f, y = {}) => {
-      if (!f.opts.allErrors)
+    const E = (l, y = {}) => {
+      if (!l.opts.allErrors)
         throw new Error("ajv-errors: Ajv option allErrors must be true");
-      if (f.opts.jsPropertySyntax)
+      if (l.opts.jsPropertySyntax)
         throw new Error("ajv-errors: ajv option jsPropertySyntax is not supported");
-      return f.addKeyword(v(y));
+      return l.addKeyword(v(y));
     };
     t.default = E, e.exports = E, e.exports.default = E;
   })(Dt, Dt.exports)), Dt.exports;
@@ -5159,10 +5159,10 @@ function aa(e, t, { signal: r, edges: n } = {}) {
     b(), c = void 0, a = null;
   }, v = () => {
     h();
-  }, E = function(...f) {
+  }, E = function(...l) {
     if (r != null && r.aborted)
       return;
-    c = this, a = f;
+    c = this, a = l;
     const y = g == null;
     N(), o && y && h();
   };
@@ -7063,7 +7063,7 @@ async function qi(e) {
       var s;
       const u = this;
       or(u);
-      const v = Bn(u._newState), E = Bn(u), f = Is(E, v), y = !!((s = Object.keys(f)) != null && s.length);
+      const v = Bn(u._newState), E = Bn(u), l = Is(E, v), y = !!((s = Object.keys(l)) != null && s.length);
       if (!y) return !1;
       if (Ri(u), js(u, v), e.category === "config") {
         Ii(u, v, m);
@@ -7075,7 +7075,7 @@ async function qi(e) {
           {
             t: "edit",
             node: u,
-            changes: f,
+            changes: l,
             links: [],
             dirty: RED.nodes.dirty(),
             changed: y
@@ -7103,12 +7103,15 @@ async function qi(e) {
       b
     )), g && i) {
       const u = Object.keys(i)[0];
-      u && (i[u] = {
-        ...i[u],
-        validate: function(v, E) {
-          return sa(this, g);
-        }
-      });
+      if (u) {
+        const { required: v, ...E } = i[u];
+        i[u] = {
+          ...E,
+          validate: function(l, y) {
+            return sa(this, g);
+          }
+        };
+      }
     }
     RED.nodes.registerType(t, {
       type: t,