@video-editor/protocol 0.0.1-beta.20 → 0.0.1-beta.21

package/dist/index.js

@@ -255,7 +255,7 @@ function Ln() {
   })(Or)), Or;
 }
 var $n;
-function W() {
+function Z() {
   return $n || ($n = 1, (function(l) {
     Object.defineProperty(l, "__esModule", { value: !0 }), l.or = l.and = l.not = l.CodeGen = l.operators = l.varKinds = l.ValueScopeName = l.ValueScope = l.Scope = l.Name = l.regexpCode = l.stringify = l.getProperty = l.nil = l.strConcat = l.str = l._ = void 0;
     const o = Gt(), c = Ln();
@@ -302,45 +302,45 @@ function W() {
       optimizeNodes() {
         return this;
       }
-      optimizeNames(x, T) {
+      optimizeNames(x, I) {
         return this;
       }
     }
     class g extends h {
-      constructor(x, T, D) {
-        super(), this.varKind = x, this.name = T, this.rhs = D;
+      constructor(x, I, D) {
+        super(), this.varKind = x, this.name = I, this.rhs = D;
       }
-      render({ es5: x, _n: T }) {
+      render({ es5: x, _n: I }) {
         const D = x ? c.varKinds.var : this.varKind, N = this.rhs === void 0 ? "" : ` = ${this.rhs}`;
-        return `${D} ${this.name}${N};` + T;
+        return `${D} ${this.name}${N};` + I;
       }
-      optimizeNames(x, T) {
+      optimizeNames(x, I) {
         if (x[this.name.str])
-          return this.rhs && (this.rhs = V(this.rhs, x, T)), this;
+          return this.rhs && (this.rhs = V(this.rhs, x, I)), this;
       }
       get names() {
         return this.rhs instanceof o._CodeOrName ? this.rhs.names : {};
       }
     }
     class n extends h {
-      constructor(x, T, D) {
-        super(), this.lhs = x, this.rhs = T, this.sideEffects = D;
+      constructor(x, I, D) {
+        super(), this.lhs = x, this.rhs = I, this.sideEffects = D;
       }
       render({ _n: x }) {
         return `${this.lhs} = ${this.rhs};` + x;
       }
-      optimizeNames(x, T) {
+      optimizeNames(x, I) {
         if (!(this.lhs instanceof o.Name && !x[this.lhs.str] && !this.sideEffects))
-          return this.rhs = V(this.rhs, x, T), this;
+          return this.rhs = V(this.rhs, x, I), this;
       }
       get names() {
         const x = this.lhs instanceof o.Name ? {} : { ...this.lhs.names };
-        return j(x, this.rhs);
+        return G(x, this.rhs);
       }
     }
     class v extends n {
-      constructor(x, T, D, N) {
-        super(x, D, N), this.op = T;
+      constructor(x, I, D, N) {
+        super(x, D, N), this.op = I;
       }
       render({ _n: x }) {
         return `${this.lhs} ${this.op}= ${this.rhs};` + x;
@@ -383,8 +383,8 @@ function W() {
       optimizeNodes() {
         return `${this.code}` ? this : void 0;
       }
-      optimizeNames(x, T) {
-        return this.code = V(this.code, x, T), this;
+      optimizeNames(x, I) {
+        return this.code = V(this.code, x, I), this;
       }
       get names() {
         return this.code instanceof o._CodeOrName ? this.code.names : {};
@@ -395,28 +395,28 @@ function W() {
         super(), this.nodes = x;
       }
       render(x) {
-        return this.nodes.reduce((T, D) => T + D.render(x), "");
+        return this.nodes.reduce((I, D) => I + D.render(x), "");
       }
       optimizeNodes() {
         const { nodes: x } = this;
-        let T = x.length;
-        for (; T--; ) {
-          const D = x[T].optimizeNodes();
-          Array.isArray(D) ? x.splice(T, 1, ...D) : D ? x[T] = D : x.splice(T, 1);
+        let I = x.length;
+        for (; I--; ) {
+          const D = x[I].optimizeNodes();
+          Array.isArray(D) ? x.splice(I, 1, ...D) : D ? x[I] = D : x.splice(I, 1);
         }
         return x.length > 0 ? this : void 0;
       }
-      optimizeNames(x, T) {
+      optimizeNames(x, I) {
         const { nodes: D } = this;
         let N = D.length;
         for (; N--; ) {
           const L = D[N];
-          L.optimizeNames(x, T) || (K(x, L.names), D.splice(N, 1));
+          L.optimizeNames(x, I) || (K(x, L.names), D.splice(N, 1));
         }
         return D.length > 0 ? this : void 0;
       }
       get names() {
-        return this.nodes.reduce((x, T) => M(x, T.names), {});
+        return this.nodes.reduce((x, I) => M(x, I.names), {});
       }
     }
     class e extends a {
@@ -430,36 +430,36 @@ function W() {
     }
     s.kind = "else";
     class f extends e {
-      constructor(x, T) {
-        super(T), this.condition = x;
+      constructor(x, I) {
+        super(I), this.condition = x;
       }
       render(x) {
-        let T = `if(${this.condition})` + super.render(x);
-        return this.else && (T += "else " + this.else.render(x)), T;
+        let I = `if(${this.condition})` + super.render(x);
+        return this.else && (I += "else " + this.else.render(x)), I;
       }
       optimizeNodes() {
         super.optimizeNodes();
         const x = this.condition;
         if (x === !0)
           return this.nodes;
-        let T = this.else;
-        if (T) {
-          const D = T.optimizeNodes();
-          T = this.else = Array.isArray(D) ? new s(D) : D;
+        let I = this.else;
+        if (I) {
+          const D = I.optimizeNodes();
+          I = this.else = Array.isArray(D) ? new s(D) : D;
         }
-        if (T)
-          return x === !1 ? T instanceof f ? T : T.nodes : this.nodes.length ? this : new f(ee(x), T instanceof f ? [T] : T.nodes);
+        if (I)
+          return x === !1 ? I instanceof f ? I : I.nodes : this.nodes.length ? this : new f(ee(x), I instanceof f ? [I] : I.nodes);
         if (!(x === !1 || !this.nodes.length))
           return this;
       }
-      optimizeNames(x, T) {
+      optimizeNames(x, I) {
         var D;
-        if (this.else = (D = this.else) === null || D === void 0 ? void 0 : D.optimizeNames(x, T), !!(super.optimizeNames(x, T) || this.else))
-          return this.condition = V(this.condition, x, T), this;
+        if (this.else = (D = this.else) === null || D === void 0 ? void 0 : D.optimizeNames(x, I), !!(super.optimizeNames(x, I) || this.else))
+          return this.condition = V(this.condition, x, I), this;
       }
       get names() {
         const x = super.names;
-        return j(x, this.condition), this.else && M(x, this.else.names), x;
+        return G(x, this.condition), this.else && M(x, this.else.names), x;
       }
     }
     f.kind = "if";
@@ -473,45 +473,45 @@ function W() {
       render(x) {
         return `for(${this.iteration})` + super.render(x);
       }
-      optimizeNames(x, T) {
-        if (super.optimizeNames(x, T))
-          return this.iteration = V(this.iteration, x, T), this;
+      optimizeNames(x, I) {
+        if (super.optimizeNames(x, I))
+          return this.iteration = V(this.iteration, x, I), this;
       }
       get names() {
         return M(super.names, this.iteration.names);
       }
     }
     class m extends d {
-      constructor(x, T, D, N) {
-        super(), this.varKind = x, this.name = T, this.from = D, this.to = N;
+      constructor(x, I, D, N) {
+        super(), this.varKind = x, this.name = I, this.from = D, this.to = N;
       }
       render(x) {
-        const T = x.es5 ? c.varKinds.var : this.varKind, { name: D, from: N, to: L } = this;
-        return `for(${T} ${D}=${N}; ${D}<${L}; ${D}++)` + super.render(x);
+        const I = x.es5 ? c.varKinds.var : this.varKind, { name: D, from: N, to: L } = this;
+        return `for(${I} ${D}=${N}; ${D}<${L}; ${D}++)` + super.render(x);
       }
       get names() {
-        const x = j(super.names, this.from);
-        return j(x, this.to);
+        const x = G(super.names, this.from);
+        return G(x, this.to);
       }
     }
     class b extends d {
-      constructor(x, T, D, N) {
-        super(), this.loop = x, this.varKind = T, this.name = D, this.iterable = N;
+      constructor(x, I, D, N) {
+        super(), this.loop = x, this.varKind = I, this.name = D, this.iterable = N;
       }
       render(x) {
         return `for(${this.varKind} ${this.name} ${this.loop} ${this.iterable})` + super.render(x);
       }
-      optimizeNames(x, T) {
-        if (super.optimizeNames(x, T))
-          return this.iterable = V(this.iterable, x, T), this;
+      optimizeNames(x, I) {
+        if (super.optimizeNames(x, I))
+          return this.iterable = V(this.iterable, x, I), this;
       }
       get names() {
         return M(super.names, this.iterable.names);
       }
     }
     class w extends e {
-      constructor(x, T, D) {
-        super(), this.name = x, this.args = T, this.async = D;
+      constructor(x, I, D) {
+        super(), this.name = x, this.args = I, this.async = D;
       }
       render(x) {
         return `${this.async ? "async " : ""}function ${this.name}(${this.args})` + super.render(x);
@@ -524,18 +524,18 @@ function W() {
       }
     }
     U.kind = "return";
-    class A extends e {
+    class P extends e {
       render(x) {
-        let T = "try" + super.render(x);
-        return this.catch && (T += this.catch.render(x)), this.finally && (T += this.finally.render(x)), T;
+        let I = "try" + super.render(x);
+        return this.catch && (I += this.catch.render(x)), this.finally && (I += this.finally.render(x)), I;
       }
       optimizeNodes() {
-        var x, T;
-        return super.optimizeNodes(), (x = this.catch) === null || x === void 0 || x.optimizeNodes(), (T = this.finally) === null || T === void 0 || T.optimizeNodes(), this;
+        var x, I;
+        return super.optimizeNodes(), (x = this.catch) === null || x === void 0 || x.optimizeNodes(), (I = this.finally) === null || I === void 0 || I.optimizeNodes(), this;
       }
-      optimizeNames(x, T) {
+      optimizeNames(x, I) {
         var D, N;
-        return super.optimizeNames(x, T), (D = this.catch) === null || D === void 0 || D.optimizeNames(x, T), (N = this.finally) === null || N === void 0 || N.optimizeNames(x, T), this;
+        return super.optimizeNames(x, I), (D = this.catch) === null || D === void 0 || D.optimizeNames(x, I), (N = this.finally) === null || N === void 0 || N.optimizeNames(x, I), this;
       }
       get names() {
         const x = super.names;
@@ -551,15 +551,15 @@ function W() {
       }
     }
     C.kind = "catch";
-    class $ extends e {
+    class O extends e {
       render(x) {
         return "finally" + super.render(x);
       }
     }
-    $.kind = "finally";
+    O.kind = "finally";
     class z {
-      constructor(x, T = {}) {
-        this._values = {}, this._blockStarts = [], this._constants = {}, this.opts = { ...T, _n: T.lines ? `
+      constructor(x, I = {}) {
+        this._values = {}, this._blockStarts = [], this._constants = {}, this.opts = { ...I, _n: I.lines ? `
 ` : "" }, this._extScope = x, this._scope = new c.Scope({ parent: x }), this._nodes = [new r()];
       }
       toString() {
@@ -574,12 +574,12 @@ function W() {
         return this._extScope.name(x);
       }
       // reserves unique name in the external scope and assigns value to it
-      scopeValue(x, T) {
-        const D = this._extScope.value(x, T);
+      scopeValue(x, I) {
+        const D = this._extScope.value(x, I);
         return (this._values[D.prefix] || (this._values[D.prefix] = /* @__PURE__ */ new Set())).add(D), D;
       }
-      getScopeValue(x, T) {
-        return this._extScope.getValue(x, T);
+      getScopeValue(x, I) {
+        return this._extScope.getValue(x, I);
       }
       // 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)
@@ -589,29 +589,29 @@ function W() {
       scopeCode() {
         return this._extScope.scopeCode(this._values);
       }
-      _def(x, T, D, N) {
-        const L = this._scope.toName(T);
+      _def(x, I, D, N) {
+        const L = this._scope.toName(I);
         return D !== void 0 && N && (this._constants[L.str] = D), this._leafNode(new g(x, L, D)), L;
       }
       // `const` declaration (`var` in es5 mode)
-      const(x, T, D) {
-        return this._def(c.varKinds.const, x, T, D);
+      const(x, I, D) {
+        return this._def(c.varKinds.const, x, I, D);
       }
       // `let` declaration with optional assignment (`var` in es5 mode)
-      let(x, T, D) {
-        return this._def(c.varKinds.let, x, T, D);
+      let(x, I, D) {
+        return this._def(c.varKinds.let, x, I, D);
       }
       // `var` declaration with optional assignment
-      var(x, T, D) {
-        return this._def(c.varKinds.var, x, T, D);
+      var(x, I, D) {
+        return this._def(c.varKinds.var, x, I, D);
       }
       // assignment code
-      assign(x, T, D) {
-        return this._leafNode(new n(x, T, D));
+      assign(x, I, D) {
+        return this._leafNode(new n(x, I, D));
       }
       // `+=` code
-      add(x, T) {
-        return this._leafNode(new v(x, l.operators.ADD, T));
+      add(x, I) {
+        return this._leafNode(new v(x, l.operators.ADD, I));
       }
       // appends passed SafeExpr to code or executes Block
       code(x) {
@@ -619,17 +619,17 @@ function W() {
       }
       // returns code for object literal for the passed argument list of key-value pairs
       object(...x) {
-        const T = ["{"];
+        const I = ["{"];
         for (const [D, N] of x)
-          T.length > 1 && T.push(","), T.push(D), (D !== N || this.opts.es5) && (T.push(":"), (0, o.addCodeArg)(T, N));
-        return T.push("}"), new o._Code(T);
+          I.length > 1 && I.push(","), I.push(D), (D !== N || this.opts.es5) && (I.push(":"), (0, o.addCodeArg)(I, N));
+        return I.push("}"), new o._Code(I);
       }
       // `if` clause (or statement if `thenBody` and, optionally, `elseBody` are passed)
-      if(x, T, D) {
-        if (this._blockNode(new f(x)), T && D)
-          this.code(T).else().code(D).endIf();
-        else if (T)
-          this.code(T).endIf();
+      if(x, I, D) {
+        if (this._blockNode(new f(x)), I && D)
+          this.code(I).else().code(D).endIf();
+        else if (I)
+          this.code(I).endIf();
         else if (D)
           throw new Error('CodeGen: "else" body without "then" body');
         return this;
@@ -646,36 +646,36 @@ function W() {
       endIf() {
         return this._endBlockNode(f, s);
       }
-      _for(x, T) {
-        return this._blockNode(x), T && this.code(T).endFor(), this;
+      _for(x, I) {
+        return this._blockNode(x), I && this.code(I).endFor(), this;
       }
       // a generic `for` clause (or statement if `forBody` is passed)
-      for(x, T) {
-        return this._for(new p(x), T);
+      for(x, I) {
+        return this._for(new p(x), I);
       }
       // `for` statement for a range of values
-      forRange(x, T, D, N, L = this.opts.es5 ? c.varKinds.var : c.varKinds.let) {
+      forRange(x, I, D, N, L = this.opts.es5 ? c.varKinds.var : c.varKinds.let) {
         const q = this._scope.toName(x);
-        return this._for(new m(L, q, T, D), () => N(q));
+        return this._for(new m(L, q, I, D), () => N(q));
       }
       // `for-of` statement (in es5 mode replace with a normal for loop)
-      forOf(x, T, D, N = c.varKinds.const) {
+      forOf(x, I, D, N = c.varKinds.const) {
         const L = this._scope.toName(x);
         if (this.opts.es5) {
-          const q = T instanceof o.Name ? T : this.var("_arr", T);
+          const q = I instanceof o.Name ? I : this.var("_arr", I);
           return this.forRange("_i", 0, (0, o._)`${q}.length`, (H) => {
             this.var(L, (0, o._)`${q}[${H}]`), D(L);
           });
         }
-        return this._for(new b("of", N, L, T), () => D(L));
+        return this._for(new b("of", N, L, I), () => D(L));
       }
       // `for-in` statement.
       // With option `ownProperties` replaced with a `for-of` loop for object keys
-      forIn(x, T, D, N = this.opts.es5 ? c.varKinds.var : c.varKinds.const) {
+      forIn(x, I, D, N = this.opts.es5 ? c.varKinds.var : c.varKinds.const) {
         if (this.opts.ownProperties)
-          return this.forOf(x, (0, o._)`Object.keys(${T})`, D);
+          return this.forOf(x, (0, o._)`Object.keys(${I})`, D);
         const L = this._scope.toName(x);
-        return this._for(new b("in", N, L, T), () => D(L));
+        return this._for(new b("in", N, L, I), () => D(L));
       }
       // end `for` loop
       endFor() {
@@ -691,43 +691,43 @@ function W() {
       }
       // `return` statement
       return(x) {
-        const T = new U();
-        if (this._blockNode(T), this.code(x), T.nodes.length !== 1)
+        const I = new U();
+        if (this._blockNode(I), this.code(x), I.nodes.length !== 1)
           throw new Error('CodeGen: "return" should have one node');
         return this._endBlockNode(U);
       }
       // `try` statement
-      try(x, T, D) {
-        if (!T && !D)
+      try(x, I, D) {
+        if (!I && !D)
           throw new Error('CodeGen: "try" without "catch" and "finally"');
-        const N = new A();
-        if (this._blockNode(N), this.code(x), T) {
+        const N = new P();
+        if (this._blockNode(N), this.code(x), I) {
           const L = this.name("e");
-          this._currNode = N.catch = new C(L), T(L);
+          this._currNode = N.catch = new C(L), I(L);
         }
-        return D && (this._currNode = N.finally = new $(), this.code(D)), this._endBlockNode(C, $);
+        return D && (this._currNode = N.finally = new O(), this.code(D)), this._endBlockNode(C, O);
       }
       // `throw` statement
       throw(x) {
         return this._leafNode(new E(x));
       }
       // start self-balancing block
-      block(x, T) {
-        return this._blockStarts.push(this._nodes.length), x && this.code(x).endBlock(T), this;
+      block(x, I) {
+        return this._blockStarts.push(this._nodes.length), x && this.code(x).endBlock(I), this;
       }
       // end the current self-balancing block
       endBlock(x) {
-        const T = this._blockStarts.pop();
-        if (T === void 0)
+        const I = this._blockStarts.pop();
+        if (I === void 0)
           throw new Error("CodeGen: not in self-balancing block");
-        const D = this._nodes.length - T;
+        const D = this._nodes.length - I;
         if (D < 0 || x !== void 0 && D !== x)
           throw new Error(`CodeGen: wrong number of nodes: ${D} vs ${x} expected`);
-        return this._nodes.length = T, this;
+        return this._nodes.length = I, this;
       }
       // `function` heading (or definition if funcBody is passed)
-      func(x, T = o.nil, D, N) {
-        return this._blockNode(new w(x, T, D)), N && this.code(N).endFunc(), this;
+      func(x, I = o.nil, D, N) {
+        return this._blockNode(new w(x, I, D)), N && this.code(N).endFunc(), this;
       }
       // end function definition
       endFunc() {
@@ -743,17 +743,17 @@ function W() {
       _blockNode(x) {
         this._currNode.nodes.push(x), this._nodes.push(x);
       }
-      _endBlockNode(x, T) {
+      _endBlockNode(x, I) {
         const D = this._currNode;
-        if (D instanceof x || T && D instanceof T)
+        if (D instanceof x || I && D instanceof I)
           return this._nodes.pop(), this;
-        throw new Error(`CodeGen: not in block "${T ? `${x.kind}/${T.kind}` : x.kind}"`);
+        throw new Error(`CodeGen: not in block "${I ? `${x.kind}/${I.kind}` : x.kind}"`);
       }
       _elseNode(x) {
-        const T = this._currNode;
-        if (!(T instanceof f))
+        const I = this._currNode;
+        if (!(I instanceof f))
           throw new Error('CodeGen: "else" without "if"');
-        return this._currNode = T.else = x, this;
+        return this._currNode = I.else = x, this;
       }
       get _root() {
         return this._nodes[0];
@@ -763,56 +763,56 @@ function W() {
         return x[x.length - 1];
       }
       set _currNode(x) {
-        const T = this._nodes;
-        T[T.length - 1] = x;
+        const I = this._nodes;
+        I[I.length - 1] = x;
       }
     }
     l.CodeGen = z;
-    function M(I, x) {
-      for (const T in x)
-        I[T] = (I[T] || 0) + (x[T] || 0);
-      return I;
-    }
-    function j(I, x) {
-      return x instanceof o._CodeOrName ? M(I, x.names) : I;
-    }
-    function V(I, x, T) {
-      if (I instanceof o.Name)
-        return D(I);
-      if (!N(I))
-        return I;
-      return new o._Code(I._items.reduce((L, q) => (q instanceof o.Name && (q = D(q)), q instanceof o._Code ? L.push(...q._items) : L.push(q), L), []));
+    function M(T, x) {
+      for (const I in x)
+        T[I] = (T[I] || 0) + (x[I] || 0);
+      return T;
+    }
+    function G(T, x) {
+      return x instanceof o._CodeOrName ? M(T, x.names) : T;
+    }
+    function V(T, x, I) {
+      if (T instanceof o.Name)
+        return D(T);
+      if (!N(T))
+        return T;
+      return new o._Code(T._items.reduce((L, q) => (q instanceof o.Name && (q = D(q)), q instanceof o._Code ? L.push(...q._items) : L.push(q), L), []));
       function D(L) {
-        const q = T[L.str];
+        const q = I[L.str];
         return q === void 0 || x[L.str] !== 1 ? L : (delete x[L.str], q);
       }
       function N(L) {
-        return L instanceof o._Code && L._items.some((q) => q instanceof o.Name && x[q.str] === 1 && T[q.str] !== void 0);
+        return L instanceof o._Code && L._items.some((q) => q instanceof o.Name && x[q.str] === 1 && I[q.str] !== void 0);
       }
     }
-    function K(I, x) {
-      for (const T in x)
-        I[T] = (I[T] || 0) - (x[T] || 0);
+    function K(T, x) {
+      for (const I in x)
+        T[I] = (T[I] || 0) - (x[I] || 0);
     }
-    function ee(I) {
-      return typeof I == "boolean" || typeof I == "number" || I === null ? !I : (0, o._)`!${k(I)}`;
+    function ee(T) {
+      return typeof T == "boolean" || typeof T == "number" || T === null ? !T : (0, o._)`!${k(T)}`;
     }
     l.not = ee;
-    const J = P(l.operators.AND);
-    function X(...I) {
-      return I.reduce(J);
+    const J = A(l.operators.AND);
+    function X(...T) {
+      return T.reduce(J);
     }
     l.and = X;
-    const ne = P(l.operators.OR);
-    function B(...I) {
-      return I.reduce(ne);
+    const ne = A(l.operators.OR);
+    function B(...T) {
+      return T.reduce(ne);
     }
     l.or = B;
-    function P(I) {
-      return (x, T) => x === o.nil ? T : T === o.nil ? x : (0, o._)`${k(x)} ${I} ${k(T)}`;
+    function A(T) {
+      return (x, I) => x === o.nil ? I : I === o.nil ? x : (0, o._)`${k(x)} ${T} ${k(I)}`;
     }
-    function k(I) {
-      return I instanceof o.Name ? I : (0, o._)`(${I})`;
+    function k(T) {
+      return T instanceof o.Name ? T : (0, o._)`(${T})`;
     }
   })(Lr)), Lr;
 }
@@ -820,7 +820,7 @@ var Q = {}, On;
 function re() {
   if (On) return Q;
   On = 1, Object.defineProperty(Q, "__esModule", { value: !0 }), Q.checkStrictMode = Q.getErrorPath = Q.Type = Q.useFunc = Q.setEvaluated = Q.evaluatedPropsToName = Q.mergeEvaluated = Q.eachItem = Q.unescapeJsonPointer = Q.escapeJsonPointer = Q.escapeFragment = Q.unescapeFragment = Q.schemaRefOrVal = Q.schemaHasRulesButRef = Q.schemaHasRules = Q.checkUnknownRules = Q.alwaysValidSchema = Q.toHash = void 0;
-  const l = W(), o = Gt();
+  const l = Z(), o = Gt();
   function c(b) {
     const w = {};
     for (const U of b)
@@ -833,12 +833,12 @@ function re() {
   }
   Q.alwaysValidSchema = u;
   function _(b, w = b.schema) {
-    const { opts: U, self: A } = b;
+    const { opts: U, self: P } = b;
     if (!U.strictSchema || typeof w == "boolean")
       return;
-    const C = A.RULES.keywords;
-    for (const $ in w)
-      C[$] || m(b, `unknown keyword: "${$}"`);
+    const C = P.RULES.keywords;
+    for (const O in w)
+      C[O] || m(b, `unknown keyword: "${O}"`);
   }
   Q.checkUnknownRules = _;
   function h(b, w) {
@@ -859,14 +859,14 @@ function re() {
     return !1;
   }
   Q.schemaHasRulesButRef = g;
-  function n({ topSchemaRef: b, schemaPath: w }, U, A, C) {
+  function n({ topSchemaRef: b, schemaPath: w }, U, P, C) {
     if (!C) {
       if (typeof U == "number" || typeof U == "boolean")
         return U;
       if (typeof U == "string")
         return (0, l._)`${U}`;
     }
-    return (0, l._)`${b}${w}${(0, l.getProperty)(A)}`;
+    return (0, l._)`${b}${w}${(0, l.getProperty)(P)}`;
   }
   Q.schemaRefOrVal = n;
   function v(b) {
@@ -893,10 +893,10 @@ function re() {
       w(b);
   }
   Q.eachItem = t;
-  function a({ mergeNames: b, mergeToName: w, mergeValues: U, resultToName: A }) {
-    return (C, $, z, M) => {
-      const j = z === void 0 ? $ : z instanceof l.Name ? ($ instanceof l.Name ? b(C, $, z) : w(C, $, z), z) : $ instanceof l.Name ? (w(C, z, $), $) : U($, z);
-      return M === l.Name && !(j instanceof l.Name) ? A(C, j) : j;
+  function a({ mergeNames: b, mergeToName: w, mergeValues: U, resultToName: P }) {
+    return (C, O, z, M) => {
+      const G = z === void 0 ? O : z instanceof l.Name ? (O instanceof l.Name ? b(C, O, z) : w(C, O, z), z) : O instanceof l.Name ? (w(C, z, O), O) : U(O, z);
+      return M === l.Name && !(G instanceof l.Name) ? P(C, G) : G;
     };
   }
   Q.mergeEvaluated = {
@@ -925,7 +925,7 @@ function re() {
   }
   Q.evaluatedPropsToName = e;
   function r(b, w, U) {
-    Object.keys(U).forEach((A) => b.assign((0, l._)`${w}${(0, l.getProperty)(A)}`, !0));
+    Object.keys(U).forEach((P) => b.assign((0, l._)`${w}${(0, l.getProperty)(P)}`, !0));
   }
   Q.setEvaluated = r;
   const s = {};
@@ -942,8 +942,8 @@ function re() {
   })(d || (Q.Type = d = {}));
   function p(b, w, U) {
     if (b instanceof l.Name) {
-      const A = w === d.Num;
-      return U ? A ? (0, l._)`"[" + ${b} + "]"` : (0, l._)`"['" + ${b} + "']"` : A ? (0, l._)`"/" + ${b}` : (0, l._)`"/" + ${b}.replace(/~/g, "~0").replace(/\\//g, "~1")`;
+      const P = w === d.Num;
+      return U ? P ? (0, l._)`"[" + ${b} + "]"` : (0, l._)`"['" + ${b} + "']"` : P ? (0, l._)`"/" + ${b}` : (0, l._)`"/" + ${b}.replace(/~/g, "~0").replace(/\\//g, "~1")`;
     }
     return U ? (0, l.getProperty)(b).toString() : "/" + y(b);
   }
@@ -961,7 +961,7 @@ var oi = {}, Nn;
 function De() {
   if (Nn) return oi;
   Nn = 1, Object.defineProperty(oi, "__esModule", { value: !0 });
-  const l = W(), o = {
+  const l = Z(), o = {
     // validation function arguments
     data: new l.Name("data"),
     // data passed to validation function
@@ -996,15 +996,15 @@ var Mn;
 function Xt() {
   return Mn || (Mn = 1, (function(l) {
     Object.defineProperty(l, "__esModule", { value: !0 }), l.extendErrors = l.resetErrorsCount = l.reportExtraError = l.reportError = l.keyword$DataError = l.keywordError = void 0;
-    const o = W(), c = re(), u = De();
+    const o = Z(), c = re(), u = De();
     l.keywordError = {
       message: ({ keyword: s }) => (0, o.str)`must pass "${s}" keyword validation`
     }, l.keyword$DataError = {
       message: ({ keyword: s, schemaType: f }) => f ? (0, o.str)`"${s}" keyword must be ${f} ($data)` : (0, o.str)`"${s}" keyword is invalid ($data)`
     };
     function _(s, f = l.keywordError, d, p) {
-      const { it: m } = s, { gen: b, compositeRule: w, allErrors: U } = m, A = E(s, f, d);
-      p ?? (w || U) ? v(b, A) : S(m, (0, o._)`[${A}]`);
+      const { it: m } = s, { gen: b, compositeRule: w, allErrors: U } = m, P = E(s, f, d);
+      p ?? (w || U) ? v(b, P) : S(m, (0, o._)`[${P}]`);
     }
     l.reportError = _;
     function h(s, f = l.keywordError, d) {
@@ -1063,8 +1063,8 @@ function Xt() {
       return d && (m = (0, o.str)`${m}${(0, c.getErrorPath)(d, c.Type.Str)}`), [y.schemaPath, m];
     }
     function r(s, { params: f, message: d }, p) {
-      const { keyword: m, data: b, schemaValue: w, it: U } = s, { opts: A, propertyName: C, topSchemaRef: $, schemaPath: z } = U;
-      p.push([y.keyword, m], [y.params, typeof f == "function" ? f(s) : f || (0, o._)`{}`]), A.messages && p.push([y.message, typeof d == "function" ? d(s) : d]), A.verbose && p.push([y.schema, w], [y.parentSchema, (0, o._)`${$}${z}`], [u.default.data, b]), C && p.push([y.propertyName, C]);
+      const { keyword: m, data: b, schemaValue: w, it: U } = s, { opts: P, propertyName: C, topSchemaRef: O, schemaPath: z } = U;
+      p.push([y.keyword, m], [y.params, typeof f == "function" ? f(s) : f || (0, o._)`{}`]), P.messages && p.push([y.message, typeof d == "function" ? d(s) : d]), P.verbose && p.push([y.schema, w], [y.parentSchema, (0, o._)`${O}${z}`], [u.default.data, b]), C && p.push([y.propertyName, C]);
     }
   })(Dr)), Dr;
 }
@@ -1072,7 +1072,7 @@ var jn;
 function bl() {
   if (jn) return Ge;
   jn = 1, Object.defineProperty(Ge, "__esModule", { value: !0 }), Ge.boolOrEmptySchema = Ge.topBoolOrEmptySchema = void 0;
-  const l = Xt(), o = W(), c = De(), u = {
+  const l = Xt(), o = Z(), c = De(), u = {
     message: "boolean schema is false"
   };
   function _(n) {
@@ -1149,7 +1149,7 @@ var Vn;
 function yr() {
   if (Vn) return ce;
   Vn = 1, Object.defineProperty(ce, "__esModule", { value: !0 }), ce.reportTypeError = ce.checkDataTypes = ce.checkDataType = ce.coerceAndCheckDataType = ce.getJSONTypes = ce.getSchemaTypes = ce.DataType = void 0;
-  const l = Co(), o = ko(), c = Xt(), u = W(), _ = re();
+  const l = Co(), o = ko(), c = Xt(), u = Z(), _ = re();
   var h;
   (function(d) {
     d[d.Correct = 0] = "Correct", d[d.Wrong = 1] = "Wrong";
@@ -1175,14 +1175,14 @@ function yr() {
   }
   ce.getJSONTypes = n;
   function v(d, p) {
-    const { gen: m, data: b, opts: w } = d, U = y(p, w.coerceTypes), A = p.length > 0 && !(U.length === 0 && p.length === 1 && (0, o.schemaHasRulesForType)(d, p[0]));
-    if (A) {
+    const { gen: m, data: b, opts: w } = d, U = y(p, w.coerceTypes), P = p.length > 0 && !(U.length === 0 && p.length === 1 && (0, o.schemaHasRulesForType)(d, p[0]));
+    if (P) {
       const C = e(p, b, w.strictNumbers, h.Wrong);
       m.if(C, () => {
         U.length ? E(d, p, U) : s(d);
       });
     }
-    return A;
+    return P;
   }
   ce.coerceAndCheckDataType = v;
   const S = /* @__PURE__ */ new Set(["string", "number", "integer", "boolean", "null"]);
@@ -1190,25 +1190,25 @@ function yr() {
     return p ? d.filter((m) => S.has(m) || p === "array" && m === "array") : [];
   }
   function E(d, p, m) {
-    const { gen: b, data: w, opts: U } = d, A = b.let("dataType", (0, u._)`typeof ${w}`), C = b.let("coerced", (0, u._)`undefined`);
-    U.coerceTypes === "array" && b.if((0, u._)`${A} == 'object' && Array.isArray(${w}) && ${w}.length == 1`, () => b.assign(w, (0, u._)`${w}[0]`).assign(A, (0, u._)`typeof ${w}`).if(e(p, w, U.strictNumbers), () => b.assign(C, w))), b.if((0, u._)`${C} !== undefined`);
+    const { gen: b, data: w, opts: U } = d, P = b.let("dataType", (0, u._)`typeof ${w}`), C = b.let("coerced", (0, u._)`undefined`);
+    U.coerceTypes === "array" && b.if((0, u._)`${P} == 'object' && Array.isArray(${w}) && ${w}.length == 1`, () => b.assign(w, (0, u._)`${w}[0]`).assign(P, (0, u._)`typeof ${w}`).if(e(p, w, U.strictNumbers), () => b.assign(C, w))), b.if((0, u._)`${C} !== undefined`);
     for (const z of m)
-      (S.has(z) || z === "array" && U.coerceTypes === "array") && $(z);
+      (S.has(z) || z === "array" && U.coerceTypes === "array") && O(z);
     b.else(), s(d), b.endIf(), b.if((0, u._)`${C} !== undefined`, () => {
       b.assign(w, C), t(d, C);
     });
-    function $(z) {
+    function O(z) {
       switch (z) {
         case "string":
-          b.elseIf((0, u._)`${A} == "number" || ${A} == "boolean"`).assign(C, (0, u._)`"" + ${w}`).elseIf((0, u._)`${w} === null`).assign(C, (0, u._)`""`);
+          b.elseIf((0, u._)`${P} == "number" || ${P} == "boolean"`).assign(C, (0, u._)`"" + ${w}`).elseIf((0, u._)`${w} === null`).assign(C, (0, u._)`""`);
           return;
         case "number":
-          b.elseIf((0, u._)`${A} == "boolean" || ${w} === null
-              || (${A} == "string" && ${w} && ${w} == +${w})`).assign(C, (0, u._)`+${w}`);
+          b.elseIf((0, u._)`${P} == "boolean" || ${w} === null
+              || (${P} == "string" && ${w} && ${w} == +${w})`).assign(C, (0, u._)`+${w}`);
           return;
         case "integer":
-          b.elseIf((0, u._)`${A} === "boolean" || ${w} === null
-              || (${A} === "string" && ${w} && ${w} == +${w} && !(${w} % 1))`).assign(C, (0, u._)`+${w}`);
+          b.elseIf((0, u._)`${P} === "boolean" || ${w} === null
+              || (${P} === "string" && ${w} && ${w} == +${w} && !(${w} % 1))`).assign(C, (0, u._)`+${w}`);
           return;
         case "boolean":
           b.elseIf((0, u._)`${w} === "false" || ${w} === 0 || ${w} === null`).assign(C, !1).elseIf((0, u._)`${w} === "true" || ${w} === 1`).assign(C, !0);
@@ -1217,8 +1217,8 @@ function yr() {
           b.elseIf((0, u._)`${w} === "" || ${w} === 0 || ${w} === false`), b.assign(C, null);
           return;
         case "array":
-          b.elseIf((0, u._)`${A} === "string" || ${A} === "number"
-              || ${A} === "boolean" || ${w} === null`).assign(C, (0, u._)`[${w}]`);
+          b.elseIf((0, u._)`${P} === "string" || ${P} === "number"
+              || ${P} === "boolean" || ${w} === null`).assign(C, (0, u._)`[${w}]`);
       }
     }
   }
@@ -1238,16 +1238,16 @@ function yr() {
         U = (0, u._)`${p} && typeof ${p} == "object" && !Array.isArray(${p})`;
         break;
       case "integer":
-        U = A((0, u._)`!(${p} % 1) && !isNaN(${p})`);
+        U = P((0, u._)`!(${p} % 1) && !isNaN(${p})`);
         break;
       case "number":
-        U = A();
+        U = P();
         break;
       default:
         return (0, u._)`typeof ${p} ${w} ${d}`;
     }
     return b === h.Correct ? U : (0, u.not)(U);
-    function A(C = u.nil) {
+    function P(C = u.nil) {
       return (0, u.and)((0, u._)`typeof ${p} == "number"`, C, m ? (0, u._)`isFinite(${p})` : u.nil);
     }
   }
@@ -1258,13 +1258,13 @@ function yr() {
     let w;
     const U = (0, _.toHash)(d);
     if (U.array && U.object) {
-      const A = (0, u._)`typeof ${p} != "object"`;
-      w = U.null ? A : (0, u._)`!${p} || ${A}`, delete U.null, delete U.array, delete U.object;
+      const P = (0, u._)`typeof ${p} != "object"`;
+      w = U.null ? P : (0, u._)`!${p} || ${P}`, delete U.null, delete U.array, delete U.object;
     } else
       w = u.nil;
     U.number && delete U.integer;
-    for (const A in U)
-      w = (0, u.and)(w, a(A, p, m, b));
+    for (const P in U)
+      w = (0, u.and)(w, a(P, p, m, b));
     return w;
   }
   ce.checkDataTypes = e;
@@ -1297,7 +1297,7 @@ var ct = {}, Hn;
 function wl() {
   if (Hn) return ct;
   Hn = 1, Object.defineProperty(ct, "__esModule", { value: !0 }), ct.assignDefaults = void 0;
-  const l = W(), o = re();
+  const l = Z(), o = re();
   function c(_, h) {
     const { properties: g, items: n } = _.schema;
     if (h === "object" && g)
@@ -1324,7 +1324,7 @@ var Ue = {}, se = {}, Yn;
 function Ee() {
   if (Yn) return se;
   Yn = 1, Object.defineProperty(se, "__esModule", { value: !0 }), se.validateUnion = se.validateArray = se.usePattern = se.callValidateCode = se.schemaProperties = se.allSchemaProperties = se.noPropertyInData = se.propertyInData = se.isOwnProperty = se.hasPropFunc = se.reportMissingProp = se.checkMissingProp = se.checkReportMissingProp = void 0;
-  const l = W(), o = re(), c = De(), u = re();
+  const l = Z(), o = re(), c = De(), u = re();
   function _(d, p) {
     const { gen: m, data: b, it: w } = d;
     m.if(y(m, b, p, w.opts.ownProperties), () => {
@@ -1370,16 +1370,16 @@ function Ee() {
     return E(p).filter((m) => !(0, o.alwaysValidSchema)(d, p[m]));
   }
   se.schemaProperties = t;
-  function a({ schemaCode: d, data: p, it: { gen: m, topSchemaRef: b, schemaPath: w, errorPath: U }, it: A }, C, $, z) {
-    const M = z ? (0, l._)`${d}, ${p}, ${b}${w}` : p, j = [
+  function a({ schemaCode: d, data: p, it: { gen: m, topSchemaRef: b, schemaPath: w, errorPath: U }, it: P }, C, O, z) {
+    const M = z ? (0, l._)`${d}, ${p}, ${b}${w}` : p, G = [
       [c.default.instancePath, (0, l.strConcat)(c.default.instancePath, U)],
-      [c.default.parentData, A.parentData],
-      [c.default.parentDataProperty, A.parentDataProperty],
+      [c.default.parentData, P.parentData],
+      [c.default.parentDataProperty, P.parentDataProperty],
       [c.default.rootData, c.default.rootData]
     ];
-    A.opts.dynamicRef && j.push([c.default.dynamicAnchors, c.default.dynamicAnchors]);
-    const V = (0, l._)`${M}, ${m.object(...j)}`;
-    return $ !== l.nil ? (0, l._)`${C}.call(${$}, ${V})` : (0, l._)`${C}(${V})`;
+    P.opts.dynamicRef && G.push([c.default.dynamicAnchors, c.default.dynamicAnchors]);
+    const V = (0, l._)`${M}, ${m.object(...G)}`;
+    return O !== l.nil ? (0, l._)`${C}.call(${O}, ${V})` : (0, l._)`${C}(${V})`;
   }
   se.callValidateCode = a;
   const e = (0, l._)`new RegExp`;
@@ -1396,12 +1396,12 @@ function Ee() {
     const { gen: p, data: m, keyword: b, it: w } = d, U = p.name("valid");
     if (w.allErrors) {
       const C = p.let("valid", !0);
-      return A(() => p.assign(C, !1)), C;
+      return P(() => p.assign(C, !1)), C;
     }
-    return p.var(U, !0), A(() => p.break()), U;
-    function A(C) {
-      const $ = p.const("len", (0, l._)`${m}.length`);
-      p.forRange("i", 0, $, (z) => {
+    return p.var(U, !0), P(() => p.break()), U;
+    function P(C) {
+      const O = p.const("len", (0, l._)`${m}.length`);
+      p.forRange("i", 0, O, (z) => {
         d.subschema({
           keyword: b,
           dataProp: z,
@@ -1415,17 +1415,17 @@ function Ee() {
     const { gen: p, schema: m, keyword: b, it: w } = d;
     if (!Array.isArray(m))
       throw new Error("ajv implementation error");
-    if (m.some(($) => (0, o.alwaysValidSchema)(w, $)) && !w.opts.unevaluated)
+    if (m.some((O) => (0, o.alwaysValidSchema)(w, O)) && !w.opts.unevaluated)
       return;
-    const A = p.let("valid", !1), C = p.name("_valid");
-    p.block(() => m.forEach(($, z) => {
+    const P = p.let("valid", !1), C = p.name("_valid");
+    p.block(() => m.forEach((O, z) => {
       const M = d.subschema({
         keyword: b,
         schemaProp: z,
         compositeRule: !0
       }, C);
-      p.assign(A, (0, l._)`${A} || ${C}`), d.mergeValidEvaluated(M, C) || p.if((0, l.not)(A));
-    })), d.result(A, () => d.reset(), () => d.error(!0));
+      p.assign(P, (0, l._)`${P} || ${C}`), d.mergeValidEvaluated(M, C) || p.if((0, l.not)(P));
+    })), d.result(P, () => d.reset(), () => d.error(!0));
   }
   return se.validateUnion = f, se;
 }
@@ -1433,7 +1433,7 @@ var Kn;
 function Sl() {
   if (Kn) return Ue;
   Kn = 1, Object.defineProperty(Ue, "__esModule", { value: !0 }), Ue.validateKeywordUsage = Ue.validSchemaType = Ue.funcKeywordCode = Ue.macroKeywordCode = void 0;
-  const l = W(), o = De(), c = Ee(), u = Xt();
+  const l = Z(), o = De(), c = Ee(), u = Xt();
   function _(t, a) {
     const { gen: e, keyword: r, schema: s, parentSchema: f, it: d } = t, p = a.macro.call(d.self, s, f, d), m = S(e, r, p);
     d.opts.validateSchema !== !1 && d.self.validateSchema(p, !0);
@@ -1452,30 +1452,30 @@ function Sl() {
     const { gen: r, keyword: s, schema: f, parentSchema: d, $data: p, it: m } = t;
     v(m, a);
     const b = !p && a.compile ? a.compile.call(m.self, f, d, m) : a.validate, w = S(r, s, b), U = r.let("valid");
-    t.block$data(U, A), t.ok((e = a.valid) !== null && e !== void 0 ? e : U);
-    function A() {
+    t.block$data(U, P), t.ok((e = a.valid) !== null && e !== void 0 ? e : U);
+    function P() {
       if (a.errors === !1)
         z(), a.modifying && g(t), M(() => t.error());
       else {
-        const j = a.async ? C() : $();
-        a.modifying && g(t), M(() => n(t, j));
+        const G = a.async ? C() : O();
+        a.modifying && g(t), M(() => n(t, G));
       }
     }
     function C() {
-      const j = r.let("ruleErrs", null);
-      return r.try(() => z((0, l._)`await `), (V) => r.assign(U, !1).if((0, l._)`${V} instanceof ${m.ValidationError}`, () => r.assign(j, (0, l._)`${V}.errors`), () => r.throw(V))), j;
+      const G = r.let("ruleErrs", null);
+      return r.try(() => z((0, l._)`await `), (V) => r.assign(U, !1).if((0, l._)`${V} instanceof ${m.ValidationError}`, () => r.assign(G, (0, l._)`${V}.errors`), () => r.throw(V))), G;
     }
-    function $() {
-      const j = (0, l._)`${w}.errors`;
-      return r.assign(j, null), z(l.nil), j;
+    function O() {
+      const G = (0, l._)`${w}.errors`;
+      return r.assign(G, null), z(l.nil), G;
     }
-    function z(j = a.async ? (0, l._)`await ` : l.nil) {
+    function z(G = a.async ? (0, l._)`await ` : l.nil) {
       const V = m.opts.passContext ? o.default.this : o.default.self, K = !("compile" in a && !p || a.schema === !1);
-      r.assign(U, (0, l._)`${j}${(0, c.callValidateCode)(t, w, V, K)}`, a.modifying);
+      r.assign(U, (0, l._)`${G}${(0, c.callValidateCode)(t, w, V, K)}`, a.modifying);
     }
-    function M(j) {
+    function M(G) {
       var V;
-      r.if((0, l.not)((V = a.valid) !== null && V !== void 0 ? V : U), j);
+      r.if((0, l.not)((V = a.valid) !== null && V !== void 0 ? V : U), G);
     }
   }
   Ue.funcKeywordCode = h;
@@ -1522,7 +1522,7 @@ var Ce = {}, Wn;
 function xl() {
   if (Wn) return Ce;
   Wn = 1, Object.defineProperty(Ce, "__esModule", { value: !0 }), Ce.extendSubschemaMode = Ce.extendSubschemaData = Ce.getSubschema = void 0;
-  const l = W(), o = re();
+  const l = Z(), o = re();
   function c(h, { keyword: g, schemaProp: n, schema: v, schemaPath: S, errSchemaPath: y, topSchemaRef: E }) {
     if (g !== void 0 && v !== void 0)
       throw new Error('both "keyword" and "schema" passed, only one allowed');
@@ -1754,19 +1754,19 @@ function Tr() {
     if (typeof r == "boolean")
       return {};
     const { schemaId: f, uriResolver: d } = this.opts, p = E(r[f] || s), m = { "": p }, b = v(d, p, !1), w = {}, U = /* @__PURE__ */ new Set();
-    return c(r, { allKeys: !0 }, ($, z, M, j) => {
-      if (j === void 0)
+    return c(r, { allKeys: !0 }, (O, z, M, G) => {
+      if (G === void 0)
         return;
       const V = b + z;
-      let K = m[j];
-      typeof $[f] == "string" && (K = ee.call(this, $[f])), J.call(this, $.$anchor), J.call(this, $.$dynamicAnchor), m[z] = K;
+      let K = m[G];
+      typeof O[f] == "string" && (K = ee.call(this, O[f])), J.call(this, O.$anchor), J.call(this, O.$dynamicAnchor), m[z] = K;
       function ee(X) {
         const ne = this.opts.uriResolver.resolve;
         if (X = E(K ? ne(K, X) : X), U.has(X))
           throw C(X);
         U.add(X);
         let B = this.refs[X];
-        return typeof B == "string" && (B = this.refs[B]), typeof B == "object" ? A($, B.schema, X) : X !== E(V) && (X[0] === "#" ? (A($, w[X], X), w[X] = $) : this.refs[X] = V), X;
+        return typeof B == "string" && (B = this.refs[B]), typeof B == "object" ? P(O, B.schema, X) : X !== E(V) && (X[0] === "#" ? (P(O, w[X], X), w[X] = O) : this.refs[X] = V), X;
       }
       function J(X) {
         if (typeof X == "string") {
@@ -1776,12 +1776,12 @@ function Tr() {
         }
       }
     }), w;
-    function A($, z, M) {
-      if (z !== void 0 && !o($, z))
+    function P(O, z, M) {
+      if (z !== void 0 && !o(O, z))
         throw C(M);
     }
-    function C($) {
-      return new Error(`reference "${$}" resolves to more than one schema`);
+    function C(O) {
+      return new Error(`reference "${O}" resolves to more than one schema`);
     }
   }
   return pe.getSchemaRefs = e, pe;
@@ -1790,213 +1790,213 @@ var Qn;
 function Jt() {
   if (Qn) return Pe;
   Qn = 1, Object.defineProperty(Pe, "__esModule", { value: !0 }), Pe.getData = Pe.KeywordCxt = Pe.validateFunctionCode = void 0;
-  const l = bl(), o = yr(), c = ko(), u = yr(), _ = wl(), h = Sl(), g = xl(), n = W(), v = De(), S = Tr(), y = re(), E = Xt();
-  function t(R) {
-    if (b(R) && (U(R), m(R))) {
-      s(R);
+  const l = bl(), o = yr(), c = ko(), u = yr(), _ = wl(), h = Sl(), g = xl(), n = Z(), v = De(), S = Tr(), y = re(), E = Xt();
+  function t(F) {
+    if (b(F) && (U(F), m(F))) {
+      s(F);
       return;
     }
-    a(R, () => (0, l.topBoolOrEmptySchema)(R));
+    a(F, () => (0, l.topBoolOrEmptySchema)(F));
   }
   Pe.validateFunctionCode = t;
-  function a({ gen: R, validateName: F, schema: O, schemaEnv: G, opts: Y }, Z) {
-    Y.code.es5 ? R.func(F, (0, n._)`${v.default.data}, ${v.default.valCxt}`, G.$async, () => {
-      R.code((0, n._)`"use strict"; ${d(O, Y)}`), r(R, Y), R.code(Z);
-    }) : R.func(F, (0, n._)`${v.default.data}, ${e(Y)}`, G.$async, () => R.code(d(O, Y)).code(Z));
+  function a({ gen: F, validateName: R, schema: $, schemaEnv: j, opts: Y }, W) {
+    Y.code.es5 ? F.func(R, (0, n._)`${v.default.data}, ${v.default.valCxt}`, j.$async, () => {
+      F.code((0, n._)`"use strict"; ${d($, Y)}`), r(F, Y), F.code(W);
+    }) : F.func(R, (0, n._)`${v.default.data}, ${e(Y)}`, j.$async, () => F.code(d($, Y)).code(W));
   }
-  function e(R) {
-    return (0, n._)`{${v.default.instancePath}="", ${v.default.parentData}, ${v.default.parentDataProperty}, ${v.default.rootData}=${v.default.data}${R.dynamicRef ? (0, n._)`, ${v.default.dynamicAnchors}={}` : n.nil}}={}`;
+  function e(F) {
+    return (0, n._)`{${v.default.instancePath}="", ${v.default.parentData}, ${v.default.parentDataProperty}, ${v.default.rootData}=${v.default.data}${F.dynamicRef ? (0, n._)`, ${v.default.dynamicAnchors}={}` : n.nil}}={}`;
   }
-  function r(R, F) {
-    R.if(v.default.valCxt, () => {
-      R.var(v.default.instancePath, (0, n._)`${v.default.valCxt}.${v.default.instancePath}`), R.var(v.default.parentData, (0, n._)`${v.default.valCxt}.${v.default.parentData}`), R.var(v.default.parentDataProperty, (0, n._)`${v.default.valCxt}.${v.default.parentDataProperty}`), R.var(v.default.rootData, (0, n._)`${v.default.valCxt}.${v.default.rootData}`), F.dynamicRef && R.var(v.default.dynamicAnchors, (0, n._)`${v.default.valCxt}.${v.default.dynamicAnchors}`);
+  function r(F, R) {
+    F.if(v.default.valCxt, () => {
+      F.var(v.default.instancePath, (0, n._)`${v.default.valCxt}.${v.default.instancePath}`), F.var(v.default.parentData, (0, n._)`${v.default.valCxt}.${v.default.parentData}`), F.var(v.default.parentDataProperty, (0, n._)`${v.default.valCxt}.${v.default.parentDataProperty}`), F.var(v.default.rootData, (0, n._)`${v.default.valCxt}.${v.default.rootData}`), R.dynamicRef && F.var(v.default.dynamicAnchors, (0, n._)`${v.default.valCxt}.${v.default.dynamicAnchors}`);
     }, () => {
-      R.var(v.default.instancePath, (0, n._)`""`), R.var(v.default.parentData, (0, n._)`undefined`), R.var(v.default.parentDataProperty, (0, n._)`undefined`), R.var(v.default.rootData, v.default.data), F.dynamicRef && R.var(v.default.dynamicAnchors, (0, n._)`{}`);
+      F.var(v.default.instancePath, (0, n._)`""`), F.var(v.default.parentData, (0, n._)`undefined`), F.var(v.default.parentDataProperty, (0, n._)`undefined`), F.var(v.default.rootData, v.default.data), R.dynamicRef && F.var(v.default.dynamicAnchors, (0, n._)`{}`);
     });
   }
-  function s(R) {
-    const { schema: F, opts: O, gen: G } = R;
-    a(R, () => {
-      O.$comment && F.$comment && j(R), $(R), G.let(v.default.vErrors, null), G.let(v.default.errors, 0), O.unevaluated && f(R), A(R), V(R);
+  function s(F) {
+    const { schema: R, opts: $, gen: j } = F;
+    a(F, () => {
+      $.$comment && R.$comment && G(F), O(F), j.let(v.default.vErrors, null), j.let(v.default.errors, 0), $.unevaluated && f(F), P(F), V(F);
     });
   }
-  function f(R) {
-    const { gen: F, validateName: O } = R;
-    R.evaluated = F.const("evaluated", (0, n._)`${O}.evaluated`), F.if((0, n._)`${R.evaluated}.dynamicProps`, () => F.assign((0, n._)`${R.evaluated}.props`, (0, n._)`undefined`)), F.if((0, n._)`${R.evaluated}.dynamicItems`, () => F.assign((0, n._)`${R.evaluated}.items`, (0, n._)`undefined`));
+  function f(F) {
+    const { gen: R, validateName: $ } = F;
+    F.evaluated = R.const("evaluated", (0, n._)`${$}.evaluated`), R.if((0, n._)`${F.evaluated}.dynamicProps`, () => R.assign((0, n._)`${F.evaluated}.props`, (0, n._)`undefined`)), R.if((0, n._)`${F.evaluated}.dynamicItems`, () => R.assign((0, n._)`${F.evaluated}.items`, (0, n._)`undefined`));
   }
-  function d(R, F) {
-    const O = typeof R == "object" && R[F.schemaId];
-    return O && (F.code.source || F.code.process) ? (0, n._)`/*# sourceURL=${O} */` : n.nil;
+  function d(F, R) {
+    const $ = typeof F == "object" && F[R.schemaId];
+    return $ && (R.code.source || R.code.process) ? (0, n._)`/*# sourceURL=${$} */` : n.nil;
   }
-  function p(R, F) {
-    if (b(R) && (U(R), m(R))) {
-      w(R, F);
+  function p(F, R) {
+    if (b(F) && (U(F), m(F))) {
+      w(F, R);
       return;
     }
-    (0, l.boolOrEmptySchema)(R, F);
+    (0, l.boolOrEmptySchema)(F, R);
   }
-  function m({ schema: R, self: F }) {
-    if (typeof R == "boolean")
-      return !R;
-    for (const O in R)
-      if (F.RULES.all[O])
+  function m({ schema: F, self: R }) {
+    if (typeof F == "boolean")
+      return !F;
+    for (const $ in F)
+      if (R.RULES.all[$])
         return !0;
     return !1;
   }
-  function b(R) {
-    return typeof R.schema != "boolean";
+  function b(F) {
+    return typeof F.schema != "boolean";
   }
-  function w(R, F) {
-    const { schema: O, gen: G, opts: Y } = R;
-    Y.$comment && O.$comment && j(R), z(R), M(R);
-    const Z = G.const("_errs", v.default.errors);
-    A(R, Z), G.var(F, (0, n._)`${Z} === ${v.default.errors}`);
+  function w(F, R) {
+    const { schema: $, gen: j, opts: Y } = F;
+    Y.$comment && $.$comment && G(F), z(F), M(F);
+    const W = j.const("_errs", v.default.errors);
+    P(F, W), j.var(R, (0, n._)`${W} === ${v.default.errors}`);
   }
-  function U(R) {
-    (0, y.checkUnknownRules)(R), C(R);
+  function U(F) {
+    (0, y.checkUnknownRules)(F), C(F);
   }
-  function A(R, F) {
-    if (R.opts.jtd)
-      return ee(R, [], !1, F);
-    const O = (0, o.getSchemaTypes)(R.schema), G = (0, o.coerceAndCheckDataType)(R, O);
-    ee(R, O, !G, F);
+  function P(F, R) {
+    if (F.opts.jtd)
+      return ee(F, [], !1, R);
+    const $ = (0, o.getSchemaTypes)(F.schema), j = (0, o.coerceAndCheckDataType)(F, $);
+    ee(F, $, !j, R);
   }
-  function C(R) {
-    const { schema: F, errSchemaPath: O, opts: G, self: Y } = R;
-    F.$ref && G.ignoreKeywordsWithRef && (0, y.schemaHasRulesButRef)(F, Y.RULES) && Y.logger.warn(`$ref: keywords ignored in schema at path "${O}"`);
+  function C(F) {
+    const { schema: R, errSchemaPath: $, opts: j, self: Y } = F;
+    R.$ref && j.ignoreKeywordsWithRef && (0, y.schemaHasRulesButRef)(R, Y.RULES) && Y.logger.warn(`$ref: keywords ignored in schema at path "${$}"`);
   }
-  function $(R) {
-    const { schema: F, opts: O } = R;
-    F.default !== void 0 && O.useDefaults && O.strictSchema && (0, y.checkStrictMode)(R, "default is ignored in the schema root");
+  function O(F) {
+    const { schema: R, opts: $ } = F;
+    R.default !== void 0 && $.useDefaults && $.strictSchema && (0, y.checkStrictMode)(F, "default is ignored in the schema root");
   }
-  function z(R) {
-    const F = R.schema[R.opts.schemaId];
-    F && (R.baseId = (0, S.resolveUrl)(R.opts.uriResolver, R.baseId, F));
+  function z(F) {
+    const R = F.schema[F.opts.schemaId];
+    R && (F.baseId = (0, S.resolveUrl)(F.opts.uriResolver, F.baseId, R));
   }
-  function M(R) {
-    if (R.schema.$async && !R.schemaEnv.$async)
+  function M(F) {
+    if (F.schema.$async && !F.schemaEnv.$async)
       throw new Error("async schema in sync schema");
   }
-  function j({ gen: R, schemaEnv: F, schema: O, errSchemaPath: G, opts: Y }) {
-    const Z = O.$comment;
+  function G({ gen: F, schemaEnv: R, schema: $, errSchemaPath: j, opts: Y }) {
+    const W = $.$comment;
     if (Y.$comment === !0)
-      R.code((0, n._)`${v.default.self}.logger.log(${Z})`);
+      F.code((0, n._)`${v.default.self}.logger.log(${W})`);
     else if (typeof Y.$comment == "function") {
-      const ae = (0, n.str)`${G}/$comment`, he = R.scopeValue("root", { ref: F.root });
-      R.code((0, n._)`${v.default.self}.opts.$comment(${Z}, ${ae}, ${he}.schema)`);
+      const ae = (0, n.str)`${j}/$comment`, he = F.scopeValue("root", { ref: R.root });
+      F.code((0, n._)`${v.default.self}.opts.$comment(${W}, ${ae}, ${he}.schema)`);
     }
   }
-  function V(R) {
-    const { gen: F, schemaEnv: O, validateName: G, ValidationError: Y, opts: Z } = R;
-    O.$async ? F.if((0, n._)`${v.default.errors} === 0`, () => F.return(v.default.data), () => F.throw((0, n._)`new ${Y}(${v.default.vErrors})`)) : (F.assign((0, n._)`${G}.errors`, v.default.vErrors), Z.unevaluated && K(R), F.return((0, n._)`${v.default.errors} === 0`));
+  function V(F) {
+    const { gen: R, schemaEnv: $, validateName: j, ValidationError: Y, opts: W } = F;
+    $.$async ? R.if((0, n._)`${v.default.errors} === 0`, () => R.return(v.default.data), () => R.throw((0, n._)`new ${Y}(${v.default.vErrors})`)) : (R.assign((0, n._)`${j}.errors`, v.default.vErrors), W.unevaluated && K(F), R.return((0, n._)`${v.default.errors} === 0`));
   }
-  function K({ gen: R, evaluated: F, props: O, items: G }) {
-    O instanceof n.Name && R.assign((0, n._)`${F}.props`, O), G instanceof n.Name && R.assign((0, n._)`${F}.items`, G);
+  function K({ gen: F, evaluated: R, props: $, items: j }) {
+    $ instanceof n.Name && F.assign((0, n._)`${R}.props`, $), j instanceof n.Name && F.assign((0, n._)`${R}.items`, j);
   }
-  function ee(R, F, O, G) {
-    const { gen: Y, schema: Z, data: ae, allErrors: he, opts: fe, self: me } = R, { RULES: ue } = me;
-    if (Z.$ref && (fe.ignoreKeywordsWithRef || !(0, y.schemaHasRulesButRef)(Z, ue))) {
-      Y.block(() => N(R, "$ref", ue.all.$ref.definition));
+  function ee(F, R, $, j) {
+    const { gen: Y, schema: W, data: ae, allErrors: he, opts: le, self: me } = F, { RULES: ue } = me;
+    if (W.$ref && (le.ignoreKeywordsWithRef || !(0, y.schemaHasRulesButRef)(W, ue))) {
+      Y.block(() => N(F, "$ref", ue.all.$ref.definition));
       return;
     }
-    fe.jtd || X(R, F), Y.block(() => {
+    le.jtd || X(F, R), Y.block(() => {
       for (const ve of ue.rules)
         Qe(ve);
       Qe(ue.post);
     });
     function Qe(ve) {
-      (0, c.shouldUseGroup)(Z, ve) && (ve.type ? (Y.if((0, u.checkDataType)(ve.type, ae, fe.strictNumbers)), J(R, ve), F.length === 1 && F[0] === ve.type && O && (Y.else(), (0, u.reportTypeError)(R)), Y.endIf()) : J(R, ve), he || Y.if((0, n._)`${v.default.errors} === ${G || 0}`));
+      (0, c.shouldUseGroup)(W, ve) && (ve.type ? (Y.if((0, u.checkDataType)(ve.type, ae, le.strictNumbers)), J(F, ve), R.length === 1 && R[0] === ve.type && $ && (Y.else(), (0, u.reportTypeError)(F)), Y.endIf()) : J(F, ve), he || Y.if((0, n._)`${v.default.errors} === ${j || 0}`));
     }
   }
-  function J(R, F) {
-    const { gen: O, schema: G, opts: { useDefaults: Y } } = R;
-    Y && (0, _.assignDefaults)(R, F.type), O.block(() => {
-      for (const Z of F.rules)
-        (0, c.shouldUseRule)(G, Z) && N(R, Z.keyword, Z.definition, F.type);
+  function J(F, R) {
+    const { gen: $, schema: j, opts: { useDefaults: Y } } = F;
+    Y && (0, _.assignDefaults)(F, R.type), $.block(() => {
+      for (const W of R.rules)
+        (0, c.shouldUseRule)(j, W) && N(F, W.keyword, W.definition, R.type);
     });
   }
-  function X(R, F) {
-    R.schemaEnv.meta || !R.opts.strictTypes || (ne(R, F), R.opts.allowUnionTypes || B(R, F), P(R, R.dataTypes));
+  function X(F, R) {
+    F.schemaEnv.meta || !F.opts.strictTypes || (ne(F, R), F.opts.allowUnionTypes || B(F, R), A(F, F.dataTypes));
   }
-  function ne(R, F) {
-    if (F.length) {
-      if (!R.dataTypes.length) {
-        R.dataTypes = F;
+  function ne(F, R) {
+    if (R.length) {
+      if (!F.dataTypes.length) {
+        F.dataTypes = R;
         return;
       }
-      F.forEach((O) => {
-        I(R.dataTypes, O) || T(R, `type "${O}" not allowed by context "${R.dataTypes.join(",")}"`);
-      }), x(R, F);
+      R.forEach(($) => {
+        T(F.dataTypes, $) || I(F, `type "${$}" not allowed by context "${F.dataTypes.join(",")}"`);
+      }), x(F, R);
     }
   }
-  function B(R, F) {
-    F.length > 1 && !(F.length === 2 && F.includes("null")) && T(R, "use allowUnionTypes to allow union type keyword");
+  function B(F, R) {
+    R.length > 1 && !(R.length === 2 && R.includes("null")) && I(F, "use allowUnionTypes to allow union type keyword");
   }
-  function P(R, F) {
-    const O = R.self.RULES.all;
-    for (const G in O) {
-      const Y = O[G];
-      if (typeof Y == "object" && (0, c.shouldUseRule)(R.schema, Y)) {
-        const { type: Z } = Y.definition;
-        Z.length && !Z.some((ae) => k(F, ae)) && T(R, `missing type "${Z.join(",")}" for keyword "${G}"`);
+  function A(F, R) {
+    const $ = F.self.RULES.all;
+    for (const j in $) {
+      const Y = $[j];
+      if (typeof Y == "object" && (0, c.shouldUseRule)(F.schema, Y)) {
+        const { type: W } = Y.definition;
+        W.length && !W.some((ae) => k(R, ae)) && I(F, `missing type "${W.join(",")}" for keyword "${j}"`);
       }
     }
   }
-  function k(R, F) {
-    return R.includes(F) || F === "number" && R.includes("integer");
+  function k(F, R) {
+    return F.includes(R) || R === "number" && F.includes("integer");
   }
-  function I(R, F) {
-    return R.includes(F) || F === "integer" && R.includes("number");
+  function T(F, R) {
+    return F.includes(R) || R === "integer" && F.includes("number");
   }
-  function x(R, F) {
-    const O = [];
-    for (const G of R.dataTypes)
-      I(F, G) ? O.push(G) : F.includes("integer") && G === "number" && O.push("integer");
-    R.dataTypes = O;
+  function x(F, R) {
+    const $ = [];
+    for (const j of F.dataTypes)
+      T(R, j) ? $.push(j) : R.includes("integer") && j === "number" && $.push("integer");
+    F.dataTypes = $;
   }
-  function T(R, F) {
-    const O = R.schemaEnv.baseId + R.errSchemaPath;
-    F += ` at "${O}" (strictTypes)`, (0, y.checkStrictMode)(R, F, R.opts.strictTypes);
+  function I(F, R) {
+    const $ = F.schemaEnv.baseId + F.errSchemaPath;
+    R += ` at "${$}" (strictTypes)`, (0, y.checkStrictMode)(F, R, F.opts.strictTypes);
   }
   class D {
-    constructor(F, O, G) {
-      if ((0, h.validateKeywordUsage)(F, O, G), this.gen = F.gen, this.allErrors = F.allErrors, this.keyword = G, this.data = F.data, this.schema = F.schema[G], this.$data = O.$data && F.opts.$data && this.schema && this.schema.$data, this.schemaValue = (0, y.schemaRefOrVal)(F, this.schema, G, this.$data), this.schemaType = O.schemaType, this.parentSchema = F.schema, this.params = {}, this.it = F, this.def = O, this.$data)
-        this.schemaCode = F.gen.const("vSchema", H(this.$data, F));
-      else if (this.schemaCode = this.schemaValue, !(0, h.validSchemaType)(this.schema, O.schemaType, O.allowUndefined))
-        throw new Error(`${G} value must be ${JSON.stringify(O.schemaType)}`);
-      ("code" in O ? O.trackErrors : O.errors !== !1) && (this.errsCount = F.gen.const("_errs", v.default.errors));
+    constructor(R, $, j) {
+      if ((0, h.validateKeywordUsage)(R, $, j), this.gen = R.gen, this.allErrors = R.allErrors, this.keyword = j, this.data = R.data, this.schema = R.schema[j], this.$data = $.$data && R.opts.$data && this.schema && this.schema.$data, this.schemaValue = (0, y.schemaRefOrVal)(R, this.schema, j, this.$data), this.schemaType = $.schemaType, this.parentSchema = R.schema, this.params = {}, this.it = R, this.def = $, this.$data)
+        this.schemaCode = R.gen.const("vSchema", H(this.$data, R));
+      else if (this.schemaCode = this.schemaValue, !(0, h.validSchemaType)(this.schema, $.schemaType, $.allowUndefined))
+        throw new Error(`${j} value must be ${JSON.stringify($.schemaType)}`);
+      ("code" in $ ? $.trackErrors : $.errors !== !1) && (this.errsCount = R.gen.const("_errs", v.default.errors));
     }
-    result(F, O, G) {
-      this.failResult((0, n.not)(F), O, G);
+    result(R, $, j) {
+      this.failResult((0, n.not)(R), $, j);
     }
-    failResult(F, O, G) {
-      this.gen.if(F), G ? G() : this.error(), O ? (this.gen.else(), O(), this.allErrors && this.gen.endIf()) : this.allErrors ? this.gen.endIf() : this.gen.else();
+    failResult(R, $, j) {
+      this.gen.if(R), j ? j() : this.error(), $ ? (this.gen.else(), $(), this.allErrors && this.gen.endIf()) : this.allErrors ? this.gen.endIf() : this.gen.else();
     }
-    pass(F, O) {
-      this.failResult((0, n.not)(F), void 0, O);
+    pass(R, $) {
+      this.failResult((0, n.not)(R), void 0, $);
     }
-    fail(F) {
-      if (F === void 0) {
+    fail(R) {
+      if (R === void 0) {
         this.error(), this.allErrors || this.gen.if(!1);
         return;
       }
-      this.gen.if(F), this.error(), this.allErrors ? this.gen.endIf() : this.gen.else();
+      this.gen.if(R), this.error(), this.allErrors ? this.gen.endIf() : this.gen.else();
     }
-    fail$data(F) {
+    fail$data(R) {
       if (!this.$data)
-        return this.fail(F);
-      const { schemaCode: O } = this;
-      this.fail((0, n._)`${O} !== undefined && (${(0, n.or)(this.invalid$data(), F)})`);
+        return this.fail(R);
+      const { schemaCode: $ } = this;
+      this.fail((0, n._)`${$} !== undefined && (${(0, n.or)(this.invalid$data(), R)})`);
     }
-    error(F, O, G) {
-      if (O) {
-        this.setParams(O), this._error(F, G), this.setParams({});
+    error(R, $, j) {
+      if ($) {
+        this.setParams($), this._error(R, j), this.setParams({});
         return;
       }
-      this._error(F, G);
+      this._error(R, j);
     }
-    _error(F, O) {
-      (F ? E.reportExtraError : E.reportError)(this, this.def.error, O);
+    _error(R, $) {
+      (R ? E.reportExtraError : E.reportError)(this, this.def.error, $);
     }
     $dataError() {
       (0, E.reportError)(this, this.def.$dataError || E.keyword$DataError);
@@ -2006,95 +2006,95 @@ function Jt() {
         throw new Error('add "trackErrors" to keyword definition');
       (0, E.resetErrorsCount)(this.gen, this.errsCount);
     }
-    ok(F) {
-      this.allErrors || this.gen.if(F);
+    ok(R) {
+      this.allErrors || this.gen.if(R);
     }
-    setParams(F, O) {
-      O ? Object.assign(this.params, F) : this.params = F;
+    setParams(R, $) {
+      $ ? Object.assign(this.params, R) : this.params = R;
     }
-    block$data(F, O, G = n.nil) {
+    block$data(R, $, j = n.nil) {
       this.gen.block(() => {
-        this.check$data(F, G), O();
+        this.check$data(R, j), $();
       });
     }
-    check$data(F = n.nil, O = n.nil) {
+    check$data(R = n.nil, $ = n.nil) {
       if (!this.$data)
         return;
-      const { gen: G, schemaCode: Y, schemaType: Z, def: ae } = this;
-      G.if((0, n.or)((0, n._)`${Y} === undefined`, O)), F !== n.nil && G.assign(F, !0), (Z.length || ae.validateSchema) && (G.elseIf(this.invalid$data()), this.$dataError(), F !== n.nil && G.assign(F, !1)), G.else();
+      const { gen: j, schemaCode: Y, schemaType: W, def: ae } = this;
+      j.if((0, n.or)((0, n._)`${Y} === undefined`, $)), R !== n.nil && j.assign(R, !0), (W.length || ae.validateSchema) && (j.elseIf(this.invalid$data()), this.$dataError(), R !== n.nil && j.assign(R, !1)), j.else();
     }
     invalid$data() {
-      const { gen: F, schemaCode: O, schemaType: G, def: Y, it: Z } = this;
+      const { gen: R, schemaCode: $, schemaType: j, def: Y, it: W } = this;
       return (0, n.or)(ae(), he());
       function ae() {
-        if (G.length) {
-          if (!(O instanceof n.Name))
+        if (j.length) {
+          if (!($ instanceof n.Name))
             throw new Error("ajv implementation error");
-          const fe = Array.isArray(G) ? G : [G];
-          return (0, n._)`${(0, u.checkDataTypes)(fe, O, Z.opts.strictNumbers, u.DataType.Wrong)}`;
+          const le = Array.isArray(j) ? j : [j];
+          return (0, n._)`${(0, u.checkDataTypes)(le, $, W.opts.strictNumbers, u.DataType.Wrong)}`;
         }
         return n.nil;
       }
       function he() {
         if (Y.validateSchema) {
-          const fe = F.scopeValue("validate$data", { ref: Y.validateSchema });
-          return (0, n._)`!${fe}(${O})`;
+          const le = R.scopeValue("validate$data", { ref: Y.validateSchema });
+          return (0, n._)`!${le}(${$})`;
         }
         return n.nil;
       }
     }
-    subschema(F, O) {
-      const G = (0, g.getSubschema)(this.it, F);
-      (0, g.extendSubschemaData)(G, this.it, F), (0, g.extendSubschemaMode)(G, F);
-      const Y = { ...this.it, ...G, items: void 0, props: void 0 };
-      return p(Y, O), Y;
+    subschema(R, $) {
+      const j = (0, g.getSubschema)(this.it, R);
+      (0, g.extendSubschemaData)(j, this.it, R), (0, g.extendSubschemaMode)(j, R);
+      const Y = { ...this.it, ...j, items: void 0, props: void 0 };
+      return p(Y, $), Y;
     }
-    mergeEvaluated(F, O) {
-      const { it: G, gen: Y } = this;
-      G.opts.unevaluated && (G.props !== !0 && F.props !== void 0 && (G.props = y.mergeEvaluated.props(Y, F.props, G.props, O)), G.items !== !0 && F.items !== void 0 && (G.items = y.mergeEvaluated.items(Y, F.items, G.items, O)));
+    mergeEvaluated(R, $) {
+      const { it: j, gen: Y } = this;
+      j.opts.unevaluated && (j.props !== !0 && R.props !== void 0 && (j.props = y.mergeEvaluated.props(Y, R.props, j.props, $)), j.items !== !0 && R.items !== void 0 && (j.items = y.mergeEvaluated.items(Y, R.items, j.items, $)));
     }
-    mergeValidEvaluated(F, O) {
-      const { it: G, gen: Y } = this;
-      if (G.opts.unevaluated && (G.props !== !0 || G.items !== !0))
-        return Y.if(O, () => this.mergeEvaluated(F, n.Name)), !0;
+    mergeValidEvaluated(R, $) {
+      const { it: j, gen: Y } = this;
+      if (j.opts.unevaluated && (j.props !== !0 || j.items !== !0))
+        return Y.if($, () => this.mergeEvaluated(R, n.Name)), !0;
     }
   }
   Pe.KeywordCxt = D;
-  function N(R, F, O, G) {
-    const Y = new D(R, O, F);
-    "code" in O ? O.code(Y, G) : Y.$data && O.validate ? (0, h.funcKeywordCode)(Y, O) : "macro" in O ? (0, h.macroKeywordCode)(Y, O) : (O.compile || O.validate) && (0, h.funcKeywordCode)(Y, O);
+  function N(F, R, $, j) {
+    const Y = new D(F, $, R);
+    "code" in $ ? $.code(Y, j) : Y.$data && $.validate ? (0, h.funcKeywordCode)(Y, $) : "macro" in $ ? (0, h.macroKeywordCode)(Y, $) : ($.compile || $.validate) && (0, h.funcKeywordCode)(Y, $);
   }
   const L = /^\/(?:[^~]|~0|~1)*$/, q = /^([0-9]+)(#|\/(?:[^~]|~0|~1)*)?$/;
-  function H(R, { dataLevel: F, dataNames: O, dataPathArr: G }) {
-    let Y, Z;
-    if (R === "")
+  function H(F, { dataLevel: R, dataNames: $, dataPathArr: j }) {
+    let Y, W;
+    if (F === "")
       return v.default.rootData;
-    if (R[0] === "/") {
-      if (!L.test(R))
-        throw new Error(`Invalid JSON-pointer: ${R}`);
-      Y = R, Z = v.default.rootData;
+    if (F[0] === "/") {
+      if (!L.test(F))
+        throw new Error(`Invalid JSON-pointer: ${F}`);
+      Y = F, W = v.default.rootData;
     } else {
-      const me = q.exec(R);
+      const me = q.exec(F);
       if (!me)
-        throw new Error(`Invalid JSON-pointer: ${R}`);
+        throw new Error(`Invalid JSON-pointer: ${F}`);
       const ue = +me[1];
       if (Y = me[2], Y === "#") {
-        if (ue >= F)
-          throw new Error(fe("property/index", ue));
-        return G[F - ue];
+        if (ue >= R)
+          throw new Error(le("property/index", ue));
+        return j[R - ue];
       }
-      if (ue > F)
-        throw new Error(fe("data", ue));
-      if (Z = O[F - ue], !Y)
-        return Z;
+      if (ue > R)
+        throw new Error(le("data", ue));
+      if (W = $[R - ue], !Y)
+        return W;
     }
-    let ae = Z;
+    let ae = W;
     const he = Y.split("/");
     for (const me of he)
-      me && (Z = (0, n._)`${Z}${(0, n.getProperty)((0, y.unescapeJsonPointer)(me))}`, ae = (0, n._)`${ae} && ${Z}`);
+      me && (W = (0, n._)`${W}${(0, n.getProperty)((0, y.unescapeJsonPointer)(me))}`, ae = (0, n._)`${ae} && ${W}`);
     return ae;
-    function fe(me, ue) {
-      return `Cannot access ${me} ${ue} levels up, current level is ${F}`;
+    function le(me, ue) {
+      return `Cannot access ${me} ${ue} levels up, current level is ${R}`;
     }
   }
   return Pe.getData = H, Pe;
@@ -2126,7 +2126,7 @@ var ye = {}, is;
 function vn() {
   if (is) return ye;
   is = 1, Object.defineProperty(ye, "__esModule", { value: !0 }), ye.resolveSchema = ye.getCompilingSchema = ye.resolveRef = ye.compileSchema = ye.SchemaEnv = void 0;
-  const l = W(), o = gn(), c = De(), u = Tr(), _ = re(), h = Jt();
+  const l = Z(), o = gn(), c = De(), u = Tr(), _ = re(), h = Jt();
   class g {
     constructor(f) {
       var d;
@@ -2146,8 +2146,8 @@ function vn() {
       ref: o.default,
       code: (0, l._)`require("ajv/dist/runtime/validation_error").default`
     }));
-    const A = w.scopeName("validate");
-    s.validateName = A;
+    const P = w.scopeName("validate");
+    s.validateName = P;
     const C = {
       gen: w,
       allErrors: this.opts.allErrors,
@@ -2161,7 +2161,7 @@ function vn() {
       dataTypes: [],
       definedProperties: /* @__PURE__ */ new Set(),
       topSchemaRef: w.scopeValue("schema", this.opts.code.source === !0 ? { ref: s.schema, code: (0, l.stringify)(s.schema) } : { ref: s.schema }),
-      validateName: A,
+      validateName: P,
       ValidationError: U,
       schema: s.schema,
       schemaEnv: s,
@@ -2173,24 +2173,24 @@ function vn() {
       opts: this.opts,
       self: this
     };
-    let $;
+    let O;
     try {
       this._compilations.add(s), (0, h.validateFunctionCode)(C), w.optimize(this.opts.code.optimize);
       const z = w.toString();
-      $ = `${w.scopeRefs(c.default.scope)}return ${z}`, this.opts.code.process && ($ = this.opts.code.process($, s));
-      const j = new Function(`${c.default.self}`, `${c.default.scope}`, $)(this, this.scope.get());
-      if (this.scope.value(A, { ref: j }), j.errors = null, j.schema = s.schema, j.schemaEnv = s, s.$async && (j.$async = !0), this.opts.code.source === !0 && (j.source = { validateName: A, validateCode: z, scopeValues: w._values }), this.opts.unevaluated) {
+      O = `${w.scopeRefs(c.default.scope)}return ${z}`, this.opts.code.process && (O = this.opts.code.process(O, s));
+      const G = new Function(`${c.default.self}`, `${c.default.scope}`, O)(this, this.scope.get());
+      if (this.scope.value(P, { ref: G }), G.errors = null, G.schema = s.schema, G.schemaEnv = s, s.$async && (G.$async = !0), this.opts.code.source === !0 && (G.source = { validateName: P, validateCode: z, scopeValues: w._values }), this.opts.unevaluated) {
         const { props: V, items: K } = C;
-        j.evaluated = {
+        G.evaluated = {
           props: V instanceof l.Name ? void 0 : V,
           items: K instanceof l.Name ? void 0 : K,
           dynamicProps: V instanceof l.Name,
           dynamicItems: K instanceof l.Name
-        }, j.source && (j.source.evaluated = (0, l.stringify)(j.evaluated));
+        }, G.source && (G.source.evaluated = (0, l.stringify)(G.evaluated));
       }
-      return s.validate = j, s;
+      return s.validate = G, s;
     } catch (z) {
-      throw delete s.validate, delete s.validateName, $ && this.logger.error("Error compiling schema, function code:", $), z;
+      throw delete s.validate, delete s.validateName, O && this.logger.error("Error compiling schema, function code:", O), z;
     } finally {
       this._compilations.delete(s);
     }
@@ -2241,8 +2241,8 @@ function vn() {
     }
     if (typeof w?.schema == "object") {
       if (w.validate || n.call(this, w), b === (0, u.normalizeId)(f)) {
-        const { schema: U } = w, { schemaId: A } = this.opts, C = U[A];
-        return C && (m = (0, u.resolveUrl)(this.opts.uriResolver, m, C)), new g({ schema: U, schemaId: A, root: s, baseId: m });
+        const { schema: U } = w, { schemaId: P } = this.opts, C = U[P];
+        return C && (m = (0, u.resolveUrl)(this.opts.uriResolver, m, C)), new g({ schema: U, schemaId: P, root: s, baseId: m });
       }
       return r.call(this, d, w);
     }
@@ -2262,10 +2262,10 @@ function vn() {
     for (const U of s.fragment.slice(1).split("/")) {
       if (typeof d == "boolean")
         return;
-      const A = d[(0, _.unescapeFragment)(U)];
-      if (A === void 0)
+      const P = d[(0, _.unescapeFragment)(U)];
+      if (P === void 0)
         return;
-      d = A;
+      d = P;
       const C = typeof d == "object" && d[this.opts.schemaId];
       !e.has(U) && C && (f = (0, u.resolveUrl)(this.opts.uriResolver, f, C));
     }
@@ -2343,9 +2343,9 @@ function Fl() {
     function U() {
       if (p.length) {
         if (m === !1) {
-          const A = u(p);
-          if (A !== void 0)
-            d.push(A);
+          const P = u(p);
+          if (P !== void 0)
+            d.push(P);
           else
             return f.error = !0, !1;
         }
@@ -2353,8 +2353,8 @@ function Fl() {
       }
       return !0;
     }
-    for (let A = 0; A < r.length; A++) {
-      const C = r[A];
+    for (let P = 0; P < r.length; P++) {
+      const C = r[P];
       if (!(C === "[" || C === "]"))
         if (C === ":") {
           if (b === !0 && (w = !0), !U())
@@ -2363,7 +2363,7 @@ function Fl() {
             f.error = !0;
             break;
           }
-          A - 1 >= 0 && r[A - 1] === ":" && (b = !0);
+          P - 1 >= 0 && r[P - 1] === ":" && (b = !0);
           continue;
         } else if (C === "%") {
           if (!U())
@@ -2493,8 +2493,8 @@ function Rl() {
   function v(d, p) {
     const m = p.scheme || d.scheme || "urn", b = d.nid.toLowerCase(), w = `${m}:${p.nid || b}`, U = f[w];
     U && (d = U.serialize(d, p));
-    const A = d, C = d.nss;
-    return A.path = `${b || p.nid}:${C}`, p.skipEscape = !0, A;
+    const P = d, C = d.nss;
+    return P.path = `${b || p.nid}:${C}`, p.skipEscape = !0, P;
   }
   function S(d, p) {
     const m = d;
@@ -2612,20 +2612,20 @@ function Bl() {
     const w = s.match(a);
     if (w) {
       if (p.scheme = w[1], p.userinfo = w[3], p.host = w[4], p.port = parseInt(w[5], 10), p.path = w[6] || "", p.query = w[7], p.fragment = w[8], isNaN(p.port) && (p.port = w[5]), p.host) {
-        const A = o(p.host);
-        if (A.isIPV4 === !1) {
-          const C = l(A.host);
+        const P = o(p.host);
+        if (P.isIPV4 === !1) {
+          const C = l(P.host);
           p.host = C.host.toLowerCase(), b = C.isIPV6;
         } else
-          p.host = A.host, b = !0;
+          p.host = P.host, b = !0;
       }
       p.scheme === void 0 && p.userinfo === void 0 && p.host === void 0 && p.port === void 0 && p.query === void 0 && !p.path ? p.reference = "same-document" : p.scheme === void 0 ? p.reference = "relative" : p.fragment === void 0 ? p.reference = "absolute" : p.reference = "uri", d.reference && d.reference !== "suffix" && d.reference !== p.reference && (p.error = p.error || "URI is not a " + d.reference + " reference.");
       const U = h[(d.scheme || p.scheme || "").toLowerCase()];
       if (!d.unicodeSupport && (!U || !U.unicodeSupport) && p.host && (d.domainHost || U && U.domainHost) && b === !1 && t(p.host))
         try {
           p.host = URL.domainToASCII(p.host.toLowerCase());
-        } catch (A) {
-          p.error = p.error || "Host's domain name can not be converted to ASCII: " + A;
+        } catch (P) {
+          p.error = p.error || "Host's domain name can not be converted to ASCII: " + P;
         }
       (!U || U && !U.skipNormalize) && (m && p.scheme !== void 0 && (p.scheme = unescape(p.scheme)), m && 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)))), U && U.parse && U.parse(p, d);
     } else
@@ -2658,7 +2658,7 @@ function Ll() {
     Object.defineProperty(l, "KeywordCxt", { enumerable: !0, get: function() {
       return o.KeywordCxt;
     } });
-    var c = W();
+    var c = Z();
     Object.defineProperty(l, "_", { enumerable: !0, get: function() {
       return c._;
     } }), Object.defineProperty(l, "str", { enumerable: !0, get: function() {
@@ -2672,7 +2672,7 @@ function Ll() {
     } }), Object.defineProperty(l, "CodeGen", { enumerable: !0, get: function() {
       return c.CodeGen;
     } });
-    const u = gn(), _ = Ir(), h = Co(), g = vn(), n = W(), v = Tr(), S = yr(), y = re(), E = kl, t = Dl(), a = (B, P) => new RegExp(B, P);
+    const u = gn(), _ = Ir(), h = Co(), g = vn(), n = Z(), v = Tr(), S = yr(), y = re(), E = kl, t = Dl(), a = (B, A) => new RegExp(B, A);
     a.code = "new RegExp";
     const e = ["removeAdditional", "useDefaults", "coerceTypes"], r = /* @__PURE__ */ new Set([
       "validate",
@@ -2710,20 +2710,20 @@ function Ll() {
       unicode: '"minLength"/"maxLength" account for unicode characters by default.'
     }, d = 200;
     function p(B) {
-      var P, k, I, x, T, D, N, L, q, H, R, F, O, G, Y, Z, ae, he, fe, me, ue, Qe, ve, zr, Fr;
-      const ut = B.strict, Rr = (P = B.code) === null || P === void 0 ? void 0 : P.optimize, Fn = Rr === !0 || Rr === void 0 ? 1 : Rr || 0, Rn = (I = (k = B.code) === null || k === void 0 ? void 0 : k.regExp) !== null && I !== void 0 ? I : a, pl = (x = B.uriResolver) !== null && x !== void 0 ? x : t.default;
+      var A, k, T, x, I, D, N, L, q, H, F, R, $, j, Y, W, ae, he, le, me, ue, Qe, ve, zr, Fr;
+      const ut = B.strict, Rr = (A = B.code) === null || A === void 0 ? void 0 : A.optimize, Fn = Rr === !0 || Rr === void 0 ? 1 : Rr || 0, Rn = (T = (k = B.code) === null || k === void 0 ? void 0 : k.regExp) !== null && T !== void 0 ? T : a, pl = (x = B.uriResolver) !== null && x !== void 0 ? x : t.default;
       return {
-        strictSchema: (D = (T = B.strictSchema) !== null && T !== void 0 ? T : ut) !== null && D !== void 0 ? D : !0,
+        strictSchema: (D = (I = B.strictSchema) !== null && I !== void 0 ? I : ut) !== null && D !== void 0 ? D : !0,
         strictNumbers: (L = (N = B.strictNumbers) !== null && N !== void 0 ? N : ut) !== null && L !== void 0 ? L : !0,
         strictTypes: (H = (q = B.strictTypes) !== null && q !== void 0 ? q : ut) !== null && H !== void 0 ? H : "log",
-        strictTuples: (F = (R = B.strictTuples) !== null && R !== void 0 ? R : ut) !== null && F !== void 0 ? F : "log",
-        strictRequired: (G = (O = B.strictRequired) !== null && O !== void 0 ? O : ut) !== null && G !== void 0 ? G : !1,
+        strictTuples: (R = (F = B.strictTuples) !== null && F !== void 0 ? F : ut) !== null && R !== void 0 ? R : "log",
+        strictRequired: (j = ($ = B.strictRequired) !== null && $ !== void 0 ? $ : ut) !== null && j !== void 0 ? j : !1,
         code: B.code ? { ...B.code, optimize: Fn, regExp: Rn } : { optimize: Fn, regExp: Rn },
         loopRequired: (Y = B.loopRequired) !== null && Y !== void 0 ? Y : d,
-        loopEnum: (Z = B.loopEnum) !== null && Z !== void 0 ? Z : d,
+        loopEnum: (W = B.loopEnum) !== null && W !== void 0 ? W : d,
         meta: (ae = B.meta) !== null && ae !== void 0 ? ae : !0,
         messages: (he = B.messages) !== null && he !== void 0 ? he : !0,
-        inlineRefs: (fe = B.inlineRefs) !== null && fe !== void 0 ? fe : !0,
+        inlineRefs: (le = B.inlineRefs) !== null && le !== void 0 ? le : !0,
         schemaId: (me = B.schemaId) !== null && me !== void 0 ? me : "$id",
         addUsedSchema: (ue = B.addUsedSchema) !== null && ue !== void 0 ? ue : !0,
         validateSchema: (Qe = B.validateSchema) !== null && Qe !== void 0 ? Qe : !0,
@@ -2734,130 +2734,130 @@ function Ll() {
       };
     }
     class m {
-      constructor(P = {}) {
-        this.schemas = {}, this.refs = {}, this.formats = {}, this._compilations = /* @__PURE__ */ new Set(), this._loading = {}, this._cache = /* @__PURE__ */ new Map(), P = this.opts = { ...P, ...p(P) };
-        const { es5: k, lines: I } = this.opts.code;
-        this.scope = new n.ValueScope({ scope: {}, prefixes: r, es5: k, lines: I }), this.logger = M(P.logger);
-        const x = P.validateFormats;
-        P.validateFormats = !1, this.RULES = (0, h.getRules)(), b.call(this, s, P, "NOT SUPPORTED"), b.call(this, f, P, "DEPRECATED", "warn"), this._metaOpts = $.call(this), P.formats && A.call(this), this._addVocabularies(), this._addDefaultMetaSchema(), P.keywords && C.call(this, P.keywords), typeof P.meta == "object" && this.addMetaSchema(P.meta), U.call(this), P.validateFormats = x;
+      constructor(A = {}) {
+        this.schemas = {}, this.refs = {}, this.formats = {}, this._compilations = /* @__PURE__ */ new Set(), this._loading = {}, this._cache = /* @__PURE__ */ new Map(), A = this.opts = { ...A, ...p(A) };
+        const { es5: k, lines: T } = this.opts.code;
+        this.scope = new n.ValueScope({ scope: {}, prefixes: r, es5: k, lines: T }), this.logger = M(A.logger);
+        const x = A.validateFormats;
+        A.validateFormats = !1, this.RULES = (0, h.getRules)(), b.call(this, s, A, "NOT SUPPORTED"), b.call(this, f, A, "DEPRECATED", "warn"), this._metaOpts = O.call(this), A.formats && P.call(this), this._addVocabularies(), this._addDefaultMetaSchema(), A.keywords && C.call(this, A.keywords), typeof A.meta == "object" && this.addMetaSchema(A.meta), U.call(this), A.validateFormats = x;
       }
       _addVocabularies() {
         this.addKeyword("$async");
       }
       _addDefaultMetaSchema() {
-        const { $data: P, meta: k, schemaId: I } = this.opts;
+        const { $data: A, meta: k, schemaId: T } = this.opts;
         let x = E;
-        I === "id" && (x = { ...E }, x.id = x.$id, delete x.$id), k && P && this.addMetaSchema(x, x[I], !1);
+        T === "id" && (x = { ...E }, x.id = x.$id, delete x.$id), k && A && this.addMetaSchema(x, x[T], !1);
       }
       defaultMeta() {
-        const { meta: P, schemaId: k } = this.opts;
-        return this.opts.defaultMeta = typeof P == "object" ? P[k] || P : void 0;
+        const { meta: A, schemaId: k } = this.opts;
+        return this.opts.defaultMeta = typeof A == "object" ? A[k] || A : void 0;
       }
-      validate(P, k) {
-        let I;
-        if (typeof P == "string") {
-          if (I = this.getSchema(P), !I)
-            throw new Error(`no schema with key or ref "${P}"`);
+      validate(A, k) {
+        let T;
+        if (typeof A == "string") {
+          if (T = this.getSchema(A), !T)
+            throw new Error(`no schema with key or ref "${A}"`);
         } else
-          I = this.compile(P);
-        const x = I(k);
-        return "$async" in I || (this.errors = I.errors), x;
+          T = this.compile(A);
+        const x = T(k);
+        return "$async" in T || (this.errors = T.errors), x;
       }
-      compile(P, k) {
-        const I = this._addSchema(P, k);
-        return I.validate || this._compileSchemaEnv(I);
+      compile(A, k) {
+        const T = this._addSchema(A, k);
+        return T.validate || this._compileSchemaEnv(T);
       }
-      compileAsync(P, k) {
+      compileAsync(A, k) {
         if (typeof this.opts.loadSchema != "function")
           throw new Error("options.loadSchema should be a function");
-        const { loadSchema: I } = this.opts;
-        return x.call(this, P, k);
-        async function x(H, R) {
-          await T.call(this, H.$schema);
-          const F = this._addSchema(H, R);
-          return F.validate || D.call(this, F);
-        }
-        async function T(H) {
+        const { loadSchema: T } = this.opts;
+        return x.call(this, A, k);
+        async function x(H, F) {
+          await I.call(this, H.$schema);
+          const R = this._addSchema(H, F);
+          return R.validate || D.call(this, R);
+        }
+        async function I(H) {
           H && !this.getSchema(H) && await x.call(this, { $ref: H }, !0);
         }
         async function D(H) {
           try {
             return this._compileSchemaEnv(H);
-          } catch (R) {
-            if (!(R instanceof _.default))
-              throw R;
-            return N.call(this, R), await L.call(this, R.missingSchema), D.call(this, H);
+          } catch (F) {
+            if (!(F instanceof _.default))
+              throw F;
+            return N.call(this, F), await L.call(this, F.missingSchema), D.call(this, H);
           }
         }
-        function N({ missingSchema: H, missingRef: R }) {
+        function N({ missingSchema: H, missingRef: F }) {
           if (this.refs[H])
-            throw new Error(`AnySchema ${H} is loaded but ${R} cannot be resolved`);
+            throw new Error(`AnySchema ${H} is loaded but ${F} cannot be resolved`);
         }
         async function L(H) {
-          const R = await q.call(this, H);
-          this.refs[H] || await T.call(this, R.$schema), this.refs[H] || this.addSchema(R, H, k);
+          const F = await q.call(this, H);
+          this.refs[H] || await I.call(this, F.$schema), this.refs[H] || this.addSchema(F, H, k);
         }
         async function q(H) {
-          const R = this._loading[H];
-          if (R)
-            return R;
+          const F = this._loading[H];
+          if (F)
+            return F;
           try {
-            return await (this._loading[H] = I(H));
+            return await (this._loading[H] = T(H));
           } finally {
             delete this._loading[H];
           }
         }
       }
       // Adds schema to the instance
-      addSchema(P, k, I, x = this.opts.validateSchema) {
-        if (Array.isArray(P)) {
-          for (const D of P)
-            this.addSchema(D, void 0, I, x);
+      addSchema(A, k, T, x = this.opts.validateSchema) {
+        if (Array.isArray(A)) {
+          for (const D of A)
+            this.addSchema(D, void 0, T, x);
           return this;
         }
-        let T;
-        if (typeof P == "object") {
+        let I;
+        if (typeof A == "object") {
           const { schemaId: D } = this.opts;
-          if (T = P[D], T !== void 0 && typeof T != "string")
+          if (I = A[D], I !== void 0 && typeof I != "string")
             throw new Error(`schema ${D} must be string`);
         }
-        return k = (0, v.normalizeId)(k || T), this._checkUnique(k), this.schemas[k] = this._addSchema(P, I, k, x, !0), this;
+        return k = (0, v.normalizeId)(k || I), this._checkUnique(k), this.schemas[k] = this._addSchema(A, T, k, x, !0), this;
       }
       // Add schema that will be used to validate other schemas
       // options in META_IGNORE_OPTIONS are alway set to false
-      addMetaSchema(P, k, I = this.opts.validateSchema) {
-        return this.addSchema(P, k, !0, I), this;
+      addMetaSchema(A, k, T = this.opts.validateSchema) {
+        return this.addSchema(A, k, !0, T), this;
       }
       //  Validate schema against its meta-schema
-      validateSchema(P, k) {
-        if (typeof P == "boolean")
+      validateSchema(A, k) {
+        if (typeof A == "boolean")
           return !0;
-        let I;
-        if (I = P.$schema, I !== void 0 && typeof I != "string")
+        let T;
+        if (T = A.$schema, T !== void 0 && typeof T != "string")
           throw new Error("$schema must be a string");
-        if (I = I || this.opts.defaultMeta || this.defaultMeta(), !I)
+        if (T = T || this.opts.defaultMeta || this.defaultMeta(), !T)
           return this.logger.warn("meta-schema not available"), this.errors = null, !0;
-        const x = this.validate(I, P);
+        const x = this.validate(T, A);
         if (!x && k) {
-          const T = "schema is invalid: " + this.errorsText();
+          const I = "schema is invalid: " + this.errorsText();
           if (this.opts.validateSchema === "log")
-            this.logger.error(T);
+            this.logger.error(I);
           else
-            throw new Error(T);
+            throw new Error(I);
         }
         return x;
       }
       // Get compiled schema by `key` or `ref`.
       // (`key` that was passed to `addSchema` or full schema reference - `schema.$id` or resolved id)
-      getSchema(P) {
+      getSchema(A) {
         let k;
-        for (; typeof (k = w.call(this, P)) == "string"; )
-          P = k;
+        for (; typeof (k = w.call(this, A)) == "string"; )
+          A = k;
         if (k === void 0) {
-          const { schemaId: I } = this.opts, x = new g.SchemaEnv({ schema: {}, schemaId: I });
-          if (k = g.resolveSchema.call(this, x, P), !k)
+          const { schemaId: T } = this.opts, x = new g.SchemaEnv({ schema: {}, schemaId: T });
+          if (k = g.resolveSchema.call(this, x, A), !k)
             return;
-          this.refs[P] = k;
+          this.refs[A] = k;
         }
         return k.validate || this._compileSchemaEnv(k);
       }
@@ -2865,138 +2865,138 @@ function Ll() {
       // If no parameter is passed all schemas but meta-schemas are removed.
       // If RegExp is passed all schemas with key/id matching pattern but meta-schemas are removed.
       // Even if schema is referenced by other schemas it still can be removed as other schemas have local references.
-      removeSchema(P) {
-        if (P instanceof RegExp)
-          return this._removeAllSchemas(this.schemas, P), this._removeAllSchemas(this.refs, P), this;
-        switch (typeof P) {
+      removeSchema(A) {
+        if (A instanceof RegExp)
+          return this._removeAllSchemas(this.schemas, A), this._removeAllSchemas(this.refs, A), this;
+        switch (typeof A) {
           case "undefined":
             return this._removeAllSchemas(this.schemas), this._removeAllSchemas(this.refs), this._cache.clear(), this;
           case "string": {
-            const k = w.call(this, P);
-            return typeof k == "object" && this._cache.delete(k.schema), delete this.schemas[P], delete this.refs[P], this;
+            const k = w.call(this, A);
+            return typeof k == "object" && this._cache.delete(k.schema), delete this.schemas[A], delete this.refs[A], this;
           }
           case "object": {
-            const k = P;
+            const k = A;
             this._cache.delete(k);
-            let I = P[this.opts.schemaId];
-            return I && (I = (0, v.normalizeId)(I), delete this.schemas[I], delete this.refs[I]), this;
+            let T = A[this.opts.schemaId];
+            return T && (T = (0, v.normalizeId)(T), delete this.schemas[T], delete this.refs[T]), this;
           }
           default:
             throw new Error("ajv.removeSchema: invalid parameter");
         }
       }
       // add "vocabulary" - a collection of keywords
-      addVocabulary(P) {
-        for (const k of P)
+      addVocabulary(A) {
+        for (const k of A)
           this.addKeyword(k);
         return this;
       }
-      addKeyword(P, k) {
-        let I;
-        if (typeof P == "string")
-          I = P, typeof k == "object" && (this.logger.warn("these parameters are deprecated, see docs for addKeyword"), k.keyword = I);
-        else if (typeof P == "object" && k === void 0) {
-          if (k = P, I = k.keyword, Array.isArray(I) && !I.length)
+      addKeyword(A, k) {
+        let T;
+        if (typeof A == "string")
+          T = A, typeof k == "object" && (this.logger.warn("these parameters are deprecated, see docs for addKeyword"), k.keyword = T);
+        else if (typeof A == "object" && k === void 0) {
+          if (k = A, T = k.keyword, Array.isArray(T) && !T.length)
             throw new Error("addKeywords: keyword must be string or non-empty array");
         } else
           throw new Error("invalid addKeywords parameters");
-        if (V.call(this, I, k), !k)
-          return (0, y.eachItem)(I, (T) => K.call(this, T)), this;
+        if (V.call(this, T, k), !k)
+          return (0, y.eachItem)(T, (I) => K.call(this, I)), this;
         J.call(this, k);
         const x = {
           ...k,
           type: (0, S.getJSONTypes)(k.type),
           schemaType: (0, S.getJSONTypes)(k.schemaType)
         };
-        return (0, y.eachItem)(I, x.type.length === 0 ? (T) => K.call(this, T, x) : (T) => x.type.forEach((D) => K.call(this, T, x, D))), this;
+        return (0, y.eachItem)(T, x.type.length === 0 ? (I) => K.call(this, I, x) : (I) => x.type.forEach((D) => K.call(this, I, x, D))), this;
       }
-      getKeyword(P) {
-        const k = this.RULES.all[P];
+      getKeyword(A) {
+        const k = this.RULES.all[A];
         return typeof k == "object" ? k.definition : !!k;
       }
       // Remove keyword
-      removeKeyword(P) {
+      removeKeyword(A) {
         const { RULES: k } = this;
-        delete k.keywords[P], delete k.all[P];
-        for (const I of k.rules) {
-          const x = I.rules.findIndex((T) => T.keyword === P);
-          x >= 0 && I.rules.splice(x, 1);
+        delete k.keywords[A], delete k.all[A];
+        for (const T of k.rules) {
+          const x = T.rules.findIndex((I) => I.keyword === A);
+          x >= 0 && T.rules.splice(x, 1);
         }
         return this;
       }
       // Add format
-      addFormat(P, k) {
-        return typeof k == "string" && (k = new RegExp(k)), this.formats[P] = k, this;
+      addFormat(A, k) {
+        return typeof k == "string" && (k = new RegExp(k)), this.formats[A] = k, this;
       }
-      errorsText(P = this.errors, { separator: k = ", ", dataVar: I = "data" } = {}) {
-        return !P || P.length === 0 ? "No errors" : P.map((x) => `${I}${x.instancePath} ${x.message}`).reduce((x, T) => x + k + T);
+      errorsText(A = this.errors, { separator: k = ", ", dataVar: T = "data" } = {}) {
+        return !A || A.length === 0 ? "No errors" : A.map((x) => `${T}${x.instancePath} ${x.message}`).reduce((x, I) => x + k + I);
       }
-      $dataMetaSchema(P, k) {
-        const I = this.RULES.all;
-        P = JSON.parse(JSON.stringify(P));
+      $dataMetaSchema(A, k) {
+        const T = this.RULES.all;
+        A = JSON.parse(JSON.stringify(A));
         for (const x of k) {
-          const T = x.split("/").slice(1);
-          let D = P;
-          for (const N of T)
+          const I = x.split("/").slice(1);
+          let D = A;
+          for (const N of I)
             D = D[N];
-          for (const N in I) {
-            const L = I[N];
+          for (const N in T) {
+            const L = T[N];
             if (typeof L != "object")
               continue;
             const { $data: q } = L.definition, H = D[N];
             q && H && (D[N] = ne(H));
           }
         }
-        return P;
+        return A;
       }
-      _removeAllSchemas(P, k) {
-        for (const I in P) {
-          const x = P[I];
-          (!k || k.test(I)) && (typeof x == "string" ? delete P[I] : x && !x.meta && (this._cache.delete(x.schema), delete P[I]));
+      _removeAllSchemas(A, k) {
+        for (const T in A) {
+          const x = A[T];
+          (!k || k.test(T)) && (typeof x == "string" ? delete A[T] : x && !x.meta && (this._cache.delete(x.schema), delete A[T]));
         }
       }
-      _addSchema(P, k, I, x = this.opts.validateSchema, T = this.opts.addUsedSchema) {
+      _addSchema(A, k, T, x = this.opts.validateSchema, I = this.opts.addUsedSchema) {
         let D;
         const { schemaId: N } = this.opts;
-        if (typeof P == "object")
-          D = P[N];
+        if (typeof A == "object")
+          D = A[N];
         else {
           if (this.opts.jtd)
             throw new Error("schema must be object");
-          if (typeof P != "boolean")
+          if (typeof A != "boolean")
             throw new Error("schema must be object or boolean");
         }
-        let L = this._cache.get(P);
+        let L = this._cache.get(A);
         if (L !== void 0)
           return L;
-        I = (0, v.normalizeId)(D || I);
-        const q = v.getSchemaRefs.call(this, P, I);
-        return L = new g.SchemaEnv({ schema: P, schemaId: N, meta: k, baseId: I, localRefs: q }), this._cache.set(L.schema, L), T && !I.startsWith("#") && (I && this._checkUnique(I), this.refs[I] = L), x && this.validateSchema(P, !0), L;
+        T = (0, v.normalizeId)(D || T);
+        const q = v.getSchemaRefs.call(this, A, T);
+        return L = new g.SchemaEnv({ schema: A, schemaId: N, meta: k, baseId: T, localRefs: q }), this._cache.set(L.schema, L), I && !T.startsWith("#") && (T && this._checkUnique(T), this.refs[T] = L), x && this.validateSchema(A, !0), L;
       }
-      _checkUnique(P) {
-        if (this.schemas[P] || this.refs[P])
-          throw new Error(`schema with key or id "${P}" already exists`);
+      _checkUnique(A) {
+        if (this.schemas[A] || this.refs[A])
+          throw new Error(`schema with key or id "${A}" already exists`);
       }
-      _compileSchemaEnv(P) {
-        if (P.meta ? this._compileMetaSchema(P) : g.compileSchema.call(this, P), !P.validate)
+      _compileSchemaEnv(A) {
+        if (A.meta ? this._compileMetaSchema(A) : g.compileSchema.call(this, A), !A.validate)
           throw new Error("ajv implementation error");
-        return P.validate;
+        return A.validate;
       }
-      _compileMetaSchema(P) {
+      _compileMetaSchema(A) {
         const k = this.opts;
         this.opts = this._metaOpts;
         try {
-          g.compileSchema.call(this, P);
+          g.compileSchema.call(this, A);
         } finally {
           this.opts = k;
         }
       }
     }
     m.ValidationError = u.default, m.MissingRefError = _.default, l.default = m;
-    function b(B, P, k, I = "error") {
+    function b(B, A, k, T = "error") {
       for (const x in B) {
-        const T = x;
-        T in P && this.logger[I](`${k}: option ${x}. ${B[T]}`);
+        const I = x;
+        I in A && this.logger[T](`${k}: option ${x}. ${B[I]}`);
       }
     }
     function w(B) {
@@ -3008,13 +3008,13 @@ function Ll() {
         if (Array.isArray(B))
           this.addSchema(B);
         else
-          for (const P in B)
-            this.addSchema(B[P], P);
+          for (const A in B)
+            this.addSchema(B[A], A);
     }
-    function A() {
+    function P() {
       for (const B in this.opts.formats) {
-        const P = this.opts.formats[B];
-        P && this.addFormat(B, P);
+        const A = this.opts.formats[B];
+        A && this.addFormat(B, A);
       }
     }
     function C(B) {
@@ -3023,15 +3023,15 @@ function Ll() {
         return;
       }
       this.logger.warn("keywords option as map is deprecated, pass array");
-      for (const P in B) {
-        const k = B[P];
-        k.keyword || (k.keyword = P), this.addKeyword(k);
+      for (const A in B) {
+        const k = B[A];
+        k.keyword || (k.keyword = A), this.addKeyword(k);
       }
     }
-    function $() {
+    function O() {
       const B = { ...this.opts };
-      for (const P of e)
-        delete B[P];
+      for (const A of e)
+        delete B[A];
       return B;
     }
     const z = { log() {
@@ -3047,43 +3047,43 @@ function Ll() {
         return B;
       throw new Error("logger must implement log, warn and error methods");
     }
-    const j = /^[a-z_$][a-z0-9_$:-]*$/i;
-    function V(B, P) {
+    const G = /^[a-z_$][a-z0-9_$:-]*$/i;
+    function V(B, A) {
       const { RULES: k } = this;
-      if ((0, y.eachItem)(B, (I) => {
-        if (k.keywords[I])
-          throw new Error(`Keyword ${I} is already defined`);
-        if (!j.test(I))
-          throw new Error(`Keyword ${I} has invalid name`);
-      }), !!P && P.$data && !("code" in P || "validate" in P))
+      if ((0, y.eachItem)(B, (T) => {
+        if (k.keywords[T])
+          throw new Error(`Keyword ${T} is already defined`);
+        if (!G.test(T))
+          throw new Error(`Keyword ${T} has invalid name`);
+      }), !!A && A.$data && !("code" in A || "validate" in A))
         throw new Error('$data keyword must have "code" or "validate" function');
     }
-    function K(B, P, k) {
-      var I;
-      const x = P?.post;
+    function K(B, A, k) {
+      var T;
+      const x = A?.post;
       if (k && x)
         throw new Error('keyword with "post" flag cannot have "type"');
-      const { RULES: T } = this;
-      let D = x ? T.post : T.rules.find(({ type: L }) => L === k);
-      if (D || (D = { type: k, rules: [] }, T.rules.push(D)), T.keywords[B] = !0, !P)
+      const { RULES: I } = this;
+      let D = x ? I.post : I.rules.find(({ type: L }) => L === k);
+      if (D || (D = { type: k, rules: [] }, I.rules.push(D)), I.keywords[B] = !0, !A)
         return;
       const N = {
         keyword: B,
         definition: {
-          ...P,
-          type: (0, S.getJSONTypes)(P.type),
-          schemaType: (0, S.getJSONTypes)(P.schemaType)
+          ...A,
+          type: (0, S.getJSONTypes)(A.type),
+          schemaType: (0, S.getJSONTypes)(A.schemaType)
         }
       };
-      P.before ? ee.call(this, D, N, P.before) : D.rules.push(N), T.all[B] = N, (I = P.implements) === null || I === void 0 || I.forEach((L) => this.addKeyword(L));
+      A.before ? ee.call(this, D, N, A.before) : D.rules.push(N), I.all[B] = N, (T = A.implements) === null || T === void 0 || T.forEach((L) => this.addKeyword(L));
     }
-    function ee(B, P, k) {
-      const I = B.rules.findIndex((x) => x.keyword === k);
-      I >= 0 ? B.rules.splice(I, 0, P) : (B.rules.push(P), this.logger.warn(`rule ${k} is not defined`));
+    function ee(B, A, k) {
+      const T = B.rules.findIndex((x) => x.keyword === k);
+      T >= 0 ? B.rules.splice(T, 0, A) : (B.rules.push(A), this.logger.warn(`rule ${k} is not defined`));
     }
     function J(B) {
-      let { metaSchema: P } = B;
-      P !== void 0 && (B.$data && this.opts.$data && (P = ne(P)), B.validateSchema = this.compile(P, !0));
+      let { metaSchema: A } = B;
+      A !== void 0 && (B.$data && this.opts.$data && (A = ne(A)), B.validateSchema = this.compile(A, !0));
     }
     const X = {
       $ref: "https://raw.githubusercontent.com/ajv-validator/ajv/master/lib/refs/data.json#"
@@ -3109,7 +3109,7 @@ var Le = {}, fs;
 function Ol() {
   if (fs) return Le;
   fs = 1, Object.defineProperty(Le, "__esModule", { value: !0 }), Le.callRef = Le.getValidate = void 0;
-  const l = Ir(), o = Ee(), c = W(), u = De(), _ = vn(), h = re(), g = {
+  const l = Ir(), o = Ee(), c = Z(), u = De(), _ = vn(), h = re(), g = {
     keyword: "$ref",
     schemaType: "string",
     code(S) {
@@ -3129,18 +3129,18 @@ function Ol() {
         return v(S, (0, c._)`${U}.validate`, d, d.$async);
       }
       function b(U) {
-        const A = n(S, U);
-        v(S, A, U, U.$async);
+        const P = n(S, U);
+        v(S, P, U, U.$async);
       }
       function w(U) {
-        const A = y.scopeValue("schema", s.code.source === !0 ? { ref: U, code: (0, c.stringify)(U) } : { ref: U }), C = y.name("valid"), $ = S.subschema({
+        const P = y.scopeValue("schema", s.code.source === !0 ? { ref: U, code: (0, c.stringify)(U) } : { ref: U }), C = y.name("valid"), O = S.subschema({
           schema: U,
           dataTypes: [],
           schemaPath: c.nil,
-          topSchemaRef: A,
+          topSchemaRef: P,
           errSchemaPath: E
         }, C);
-        S.mergeEvaluated($), S.ok(C);
+        S.mergeEvaluated(O), S.ok(C);
       }
     }
   };
@@ -3158,35 +3158,35 @@ function Ol() {
       const U = a.let("valid");
       a.try(() => {
         a.code((0, c._)`await ${(0, o.callValidateCode)(S, y, d)}`), w(y), r || a.assign(U, !0);
-      }, (A) => {
-        a.if((0, c._)`!(${A} instanceof ${e.ValidationError})`, () => a.throw(A)), b(A), r || a.assign(U, !1);
+      }, (P) => {
+        a.if((0, c._)`!(${P} instanceof ${e.ValidationError})`, () => a.throw(P)), b(P), r || a.assign(U, !1);
       }), S.ok(U);
     }
     function m() {
       S.result((0, o.callValidateCode)(S, y, d), () => w(y), () => b(y));
     }
     function b(U) {
-      const A = (0, c._)`${U}.errors`;
-      a.assign(u.default.vErrors, (0, c._)`${u.default.vErrors} === null ? ${A} : ${u.default.vErrors}.concat(${A})`), a.assign(u.default.errors, (0, c._)`${u.default.vErrors}.length`);
+      const P = (0, c._)`${U}.errors`;
+      a.assign(u.default.vErrors, (0, c._)`${u.default.vErrors} === null ? ${P} : ${u.default.vErrors}.concat(${P})`), a.assign(u.default.errors, (0, c._)`${u.default.vErrors}.length`);
     }
     function w(U) {
-      var A;
+      var P;
       if (!e.opts.unevaluated)
         return;
-      const C = (A = E?.validate) === null || A === void 0 ? void 0 : A.evaluated;
+      const C = (P = E?.validate) === null || P === void 0 ? void 0 : P.evaluated;
       if (e.props !== !0)
         if (C && !C.dynamicProps)
           C.props !== void 0 && (e.props = h.mergeEvaluated.props(a, C.props, e.props));
         else {
-          const $ = a.var("props", (0, c._)`${U}.evaluated.props`);
-          e.props = h.mergeEvaluated.props(a, $, e.props, c.Name);
+          const O = a.var("props", (0, c._)`${U}.evaluated.props`);
+          e.props = h.mergeEvaluated.props(a, O, e.props, c.Name);
         }
       if (e.items !== !0)
         if (C && !C.dynamicItems)
           C.items !== void 0 && (e.items = h.mergeEvaluated.items(a, C.items, e.items));
         else {
-          const $ = a.var("items", (0, c._)`${U}.evaluated.items`);
-          e.items = h.mergeEvaluated.items(a, $, e.items, c.Name);
+          const O = a.var("items", (0, c._)`${U}.evaluated.items`);
+          e.items = h.mergeEvaluated.items(a, O, e.items, c.Name);
         }
     }
   }
@@ -3212,7 +3212,7 @@ var pi = {}, _i = {}, cs;
 function Ml() {
   if (cs) return _i;
   cs = 1, Object.defineProperty(_i, "__esModule", { value: !0 });
-  const l = W(), o = l.operators, c = {
+  const l = Z(), o = l.operators, c = {
     maximum: { okStr: "<=", ok: o.LTE, fail: o.GT },
     minimum: { okStr: ">=", ok: o.GTE, fail: o.LT },
     exclusiveMaximum: { okStr: "<", ok: o.LT, fail: o.GTE },
@@ -3237,7 +3237,7 @@ var mi = {}, hs;
 function jl() {
   if (hs) return mi;
   hs = 1, Object.defineProperty(mi, "__esModule", { value: !0 });
-  const l = W(), c = {
+  const l = Z(), c = {
     keyword: "multipleOf",
     type: "number",
     schemaType: "number",
@@ -3270,7 +3270,7 @@ var _s;
 function ql() {
   if (_s) return yi;
   _s = 1, Object.defineProperty(yi, "__esModule", { value: !0 });
-  const l = W(), o = re(), c = Gl(), _ = {
+  const l = Z(), o = re(), c = Gl(), _ = {
     keyword: ["maxLength", "minLength"],
     type: "string",
     schemaType: "number",
@@ -3293,7 +3293,7 @@ var vi = {}, ms;
 function Vl() {
   if (ms) return vi;
   ms = 1, Object.defineProperty(vi, "__esModule", { value: !0 });
-  const l = Ee(), o = W(), u = {
+  const l = Ee(), o = Z(), u = {
     keyword: "pattern",
     type: "string",
     schemaType: "string",
@@ -3313,7 +3313,7 @@ var bi = {}, ys;
 function Hl() {
   if (ys) return bi;
   ys = 1, Object.defineProperty(bi, "__esModule", { value: !0 });
-  const l = W(), c = {
+  const l = Z(), c = {
     keyword: ["maxProperties", "minProperties"],
     type: "object",
     schemaType: "number",
@@ -3336,7 +3336,7 @@ var wi = {}, gs;
 function Yl() {
   if (gs) return wi;
   gs = 1, Object.defineProperty(wi, "__esModule", { value: !0 });
-  const l = Ee(), o = W(), c = re(), _ = {
+  const l = Ee(), o = Z(), c = re(), _ = {
     keyword: "required",
     type: "object",
     schemaType: "array",
@@ -3393,7 +3393,7 @@ var Si = {}, vs;
 function Kl() {
   if (vs) return Si;
   vs = 1, Object.defineProperty(Si, "__esModule", { value: !0 });
-  const l = W(), c = {
+  const l = Z(), c = {
     keyword: ["maxItems", "minItems"],
     type: "array",
     schemaType: "number",
@@ -3423,7 +3423,7 @@ var ws;
 function Wl() {
   if (ws) return xi;
   ws = 1, Object.defineProperty(xi, "__esModule", { value: !0 });
-  const l = yr(), o = W(), c = re(), u = bn(), h = {
+  const l = yr(), o = Z(), c = re(), u = bn(), h = {
     keyword: "uniqueItems",
     type: "array",
     schemaType: "boolean",
@@ -3446,11 +3446,11 @@ function Wl() {
         return r.length > 0 && !r.some((m) => m === "object" || m === "array");
       }
       function d(m, b) {
-        const w = n.name("item"), U = (0, l.checkDataTypes)(r, w, a.opts.strictNumbers, l.DataType.Wrong), A = n.const("indices", (0, o._)`{}`);
+        const w = n.name("item"), U = (0, l.checkDataTypes)(r, w, a.opts.strictNumbers, l.DataType.Wrong), P = n.const("indices", (0, o._)`{}`);
         n.for((0, o._)`;${m}--;`, () => {
-          n.let(w, (0, o._)`${v}[${m}]`), n.if(U, (0, o._)`continue`), r.length > 1 && n.if((0, o._)`typeof ${w} == "string"`, (0, o._)`${w} += "_"`), n.if((0, o._)`typeof ${A}[${w}] == "number"`, () => {
-            n.assign(b, (0, o._)`${A}[${w}]`), g.error(), n.assign(e, !1).break();
-          }).code((0, o._)`${A}[${w}] = ${m}`);
+          n.let(w, (0, o._)`${v}[${m}]`), n.if(U, (0, o._)`continue`), r.length > 1 && n.if((0, o._)`typeof ${w} == "string"`, (0, o._)`${w} += "_"`), n.if((0, o._)`typeof ${P}[${w}] == "number"`, () => {
+            n.assign(b, (0, o._)`${P}[${w}]`), g.error(), n.assign(e, !1).break();
+          }).code((0, o._)`${P}[${w}] = ${m}`);
         });
       }
       function p(m, b) {
@@ -3467,7 +3467,7 @@ var Ei = {}, Ss;
 function Zl() {
   if (Ss) return Ei;
   Ss = 1, Object.defineProperty(Ei, "__esModule", { value: !0 });
-  const l = W(), o = re(), c = bn(), _ = {
+  const l = Z(), o = re(), c = bn(), _ = {
     keyword: "const",
     $data: !0,
     error: {
@@ -3485,7 +3485,7 @@ var Ti = {}, xs;
 function Xl() {
   if (xs) return Ti;
   xs = 1, Object.defineProperty(Ti, "__esModule", { value: !0 });
-  const l = W(), o = re(), c = bn(), _ = {
+  const l = Z(), o = re(), c = bn(), _ = {
     keyword: "enum",
     schemaType: "array",
     $data: !0,
@@ -3550,7 +3550,7 @@ var Ii = {}, et = {}, Es;
 function zo() {
   if (Es) return et;
   Es = 1, Object.defineProperty(et, "__esModule", { value: !0 }), et.validateAdditionalItems = void 0;
-  const l = W(), o = re(), u = {
+  const l = Z(), o = re(), u = {
     keyword: "additionalItems",
     type: "array",
     schemaType: ["boolean", "object"],
@@ -3590,7 +3590,7 @@ var Pi = {}, tt = {}, Ts;
 function Fo() {
   if (Ts) return tt;
   Ts = 1, Object.defineProperty(tt, "__esModule", { value: !0 }), tt.validateTuple = void 0;
-  const l = W(), o = re(), c = Ee(), u = {
+  const l = Z(), o = re(), c = Ee(), u = {
     keyword: "items",
     type: "array",
     schemaType: ["object", "array", "boolean"],
@@ -3640,7 +3640,7 @@ var Ai = {}, Ps;
 function ed() {
   if (Ps) return Ai;
   Ps = 1, Object.defineProperty(Ai, "__esModule", { value: !0 });
-  const l = W(), o = re(), c = Ee(), u = zo(), h = {
+  const l = Z(), o = re(), c = Ee(), u = zo(), h = {
     keyword: "items",
     type: "array",
     schemaType: ["object", "boolean"],
@@ -3660,7 +3660,7 @@ var Ci = {}, As;
 function td() {
   if (As) return Ci;
   As = 1, Object.defineProperty(Ci, "__esModule", { value: !0 });
-  const l = W(), o = re(), u = {
+  const l = Z(), o = re(), u = {
     keyword: "contains",
     type: "array",
     schemaType: ["object", "boolean"],
@@ -3717,7 +3717,7 @@ var Vr = {}, Cs;
 function id() {
   return Cs || (Cs = 1, (function(l) {
     Object.defineProperty(l, "__esModule", { value: !0 }), l.validateSchemaDeps = l.validatePropertyDeps = l.error = void 0;
-    const o = W(), c = re(), u = Ee();
+    const o = Z(), c = re(), u = Ee();
     l.error = {
       message: ({ params: { property: v, depsCount: S, deps: y } }) => {
         const E = S === 1 ? "property" : "properties";
@@ -3790,7 +3790,7 @@ var ki = {}, ks;
 function rd() {
   if (ks) return ki;
   ks = 1, Object.defineProperty(ki, "__esModule", { value: !0 });
-  const l = W(), o = re(), u = {
+  const l = Z(), o = re(), u = {
     keyword: "propertyNames",
     type: "object",
     schemaType: ["object", "boolean"],
@@ -3822,7 +3822,7 @@ var zi = {}, zs;
 function Ro() {
   if (zs) return zi;
   zs = 1, Object.defineProperty(zi, "__esModule", { value: !0 });
-  const l = Ee(), o = W(), c = De(), u = re(), h = {
+  const l = Ee(), o = Z(), c = De(), u = re(), h = {
     keyword: "additionalProperties",
     type: ["object"],
     schemaType: ["boolean", "object"],
@@ -3849,10 +3849,10 @@ function Ro() {
       function d(w) {
         let U;
         if (r.length > 8) {
-          const A = (0, u.schemaRefOrVal)(t, S.properties, "properties");
-          U = (0, l.isOwnProperty)(n, A, w);
-        } else r.length ? U = (0, o.or)(...r.map((A) => (0, o._)`${w} === ${A}`)) : U = o.nil;
-        return s.length && (U = (0, o.or)(U, ...s.map((A) => (0, o._)`${(0, l.usePattern)(g, A)}.test(${w})`))), (0, o.not)(U);
+          const P = (0, u.schemaRefOrVal)(t, S.properties, "properties");
+          U = (0, l.isOwnProperty)(n, P, w);
+        } else r.length ? U = (0, o.or)(...r.map((P) => (0, o._)`${w} === ${P}`)) : U = o.nil;
+        return s.length && (U = (0, o.or)(U, ...s.map((P) => (0, o._)`${(0, l.usePattern)(g, P)}.test(${w})`))), (0, o.not)(U);
       }
       function p(w) {
         n.code((0, o._)`delete ${y}[${w}]`);
@@ -3873,13 +3873,13 @@ function Ro() {
           })) : (b(w, U), a || n.if((0, o.not)(U), () => n.break()));
         }
       }
-      function b(w, U, A) {
+      function b(w, U, P) {
         const C = {
           keyword: "additionalProperties",
           dataProp: w,
           dataPropType: u.Type.Str
         };
-        A === !1 && Object.assign(C, {
+        P === !1 && Object.assign(C, {
           compositeRule: !0,
           createErrors: !1,
           allErrors: !1
@@ -3928,7 +3928,7 @@ var Ri = {}, Rs;
 function sd() {
   if (Rs) return Ri;
   Rs = 1, Object.defineProperty(Ri, "__esModule", { value: !0 });
-  const l = Ee(), o = W(), c = re(), u = re(), _ = {
+  const l = Ee(), o = Z(), c = re(), u = re(), _ = {
     keyword: "patternProperties",
     type: "object",
     schemaType: "object",
@@ -4008,7 +4008,7 @@ var Li = {}, Ls;
 function ld() {
   if (Ls) return Li;
   Ls = 1, Object.defineProperty(Li, "__esModule", { value: !0 });
-  const l = W(), o = re(), u = {
+  const l = Z(), o = re(), u = {
     keyword: "oneOf",
     schemaType: "array",
     trackErrors: !0,
@@ -4066,7 +4066,7 @@ var Oi = {}, Os;
 function fd() {
   if (Os) return Oi;
   Os = 1, Object.defineProperty(Oi, "__esModule", { value: !0 });
-  const l = W(), o = re(), u = {
+  const l = Z(), o = re(), u = {
     keyword: "if",
     schemaType: ["object", "boolean"],
     trackErrors: !0,
@@ -4151,7 +4151,7 @@ var Mi = {}, ji = {}, js;
 function hd() {
   if (js) return ji;
   js = 1, Object.defineProperty(ji, "__esModule", { value: !0 });
-  const l = W(), c = {
+  const l = Z(), c = {
     keyword: "format",
     type: ["number", "string"],
     schemaType: "string",
@@ -4175,8 +4175,8 @@ function hd() {
           return E.strictSchema === !1 ? l.nil : (0, l._)`${S} && !${m}`;
         }
         function w() {
-          const U = a.$async ? (0, l._)`(${d}.async ? await ${m}(${g}) : ${m}(${g}))` : (0, l._)`${m}(${g})`, A = (0, l._)`(typeof ${m} == "function" ? ${U} : ${m}.test(${g}))`;
-          return (0, l._)`${m} && ${m} !== true && ${p} === ${_} && !${A}`;
+          const U = a.$async ? (0, l._)`(${d}.async ? await ${m}(${g}) : ${m}(${g}))` : (0, l._)`${m}(${g})`, P = (0, l._)`(typeof ${m} == "function" ? ${U} : ${m}.test(${g}))`;
+          return (0, l._)`${m} && ${m} !== true && ${p} === ${_} && !${P}`;
         }
       }
       function s() {
@@ -4191,17 +4191,17 @@ function hd() {
         d === _ && u.pass(U());
         function b() {
           if (E.strictSchema === !1) {
-            e.logger.warn(A());
+            e.logger.warn(P());
             return;
           }
-          throw new Error(A());
-          function A() {
+          throw new Error(P());
+          function P() {
             return `unknown format "${v}" ignored in schema at path "${t}"`;
           }
         }
-        function w(A) {
-          const C = A instanceof RegExp ? (0, l.regexpCode)(A) : E.code.formats ? (0, l._)`${E.code.formats}${(0, l.getProperty)(v)}` : void 0, $ = h.scopeValue("formats", { key: v, ref: A, code: C });
-          return typeof A == "object" && !(A instanceof RegExp) ? [A.type || "string", A.validate, (0, l._)`${$}.validate`] : ["string", A, $];
+        function w(P) {
+          const C = P instanceof RegExp ? (0, l.regexpCode)(P) : E.code.formats ? (0, l._)`${E.code.formats}${(0, l.getProperty)(v)}` : void 0, O = h.scopeValue("formats", { key: v, ref: P, code: C });
+          return typeof P == "object" && !(P instanceof RegExp) ? [P.type || "string", P.validate, (0, l._)`${O}.validate`] : ["string", P, O];
         }
         function U() {
           if (typeof f == "object" && !(f instanceof RegExp) && f.async) {
@@ -4266,7 +4266,7 @@ var Ys;
 function gd() {
   if (Ys) return Gi;
   Ys = 1, Object.defineProperty(Gi, "__esModule", { value: !0 });
-  const l = W(), o = yd(), c = vn(), u = Ir(), _ = re(), g = {
+  const l = Z(), o = yd(), c = vn(), u = Ir(), _ = re(), g = {
     keyword: "discriminator",
     type: "object",
     schemaType: "object",
@@ -4300,7 +4300,7 @@ function gd() {
       }
       function p() {
         var m;
-        const b = {}, w = A(E);
+        const b = {}, w = P(E);
         let U = !0;
         for (let z = 0; z < a.length; z++) {
           let M = a[z];
@@ -4309,27 +4309,27 @@ function gd() {
             if (M = c.resolveRef.call(t.self, t.schemaEnv.root, t.baseId, V), M instanceof c.SchemaEnv && (M = M.schema), M === void 0)
               throw new u.default(t.opts.uriResolver, t.baseId, V);
           }
-          const j = (m = M?.properties) === null || m === void 0 ? void 0 : m[e];
-          if (typeof j != "object")
+          const G = (m = M?.properties) === null || m === void 0 ? void 0 : m[e];
+          if (typeof G != "object")
             throw new Error(`discriminator: oneOf subschemas (or referenced schemas) must have "properties/${e}"`);
-          U = U && (w || A(M)), C(j, z);
+          U = U && (w || P(M)), C(G, z);
         }
         if (!U)
           throw new Error(`discriminator: "${e}" must be required`);
         return b;
-        function A({ required: z }) {
+        function P({ required: z }) {
           return Array.isArray(z) && z.includes(e);
         }
         function C(z, M) {
           if (z.const)
-            $(z.const, M);
+            O(z.const, M);
           else if (z.enum)
-            for (const j of z.enum)
-              $(j, M);
+            for (const G of z.enum)
+              O(G, M);
           else
             throw new Error(`discriminator: "properties/${e}" must have "const" or "enum"`);
         }
-        function $(z, M) {
+        function O(z, M) {
           if (typeof z != "string" || z in b)
             throw new Error(`discriminator: "${e}" values must be unique strings`);
           b[z] = M;
@@ -4372,7 +4372,7 @@ function wn() {
     Object.defineProperty(o, "KeywordCxt", { enumerable: !0, get: function() {
       return S.KeywordCxt;
     } });
-    var y = W();
+    var y = Z();
     Object.defineProperty(o, "_", { enumerable: !0, get: function() {
       return y._;
     } }), Object.defineProperty(o, "str", { enumerable: !0, get: function() {
@@ -4402,7 +4402,7 @@ var qi = { exports: {} }, Ws;
 function Pd() {
   return Ws || (Ws = 1, (function(l, o) {
     Object.defineProperty(o, "__esModule", { value: !0 });
-    const c = wn(), u = W(), _ = Gt(), h = Jt(), g = Xt(), n = De(), v = "errorMessage", S = new c.Name("emUsed"), y = {
+    const c = wn(), u = Z(), _ = Gt(), h = Jt(), g = Xt(), n = De(), v = "errorMessage", S = new c.Name("emUsed"), y = {
       required: "missingProperty",
       dependencies: "property",
       dependentRequired: "property"
@@ -4416,156 +4416,156 @@ function Pd() {
           const { gen: d, data: p, schema: m, schemaValue: b, it: w } = f;
           if (w.createErrors === !1)
             return;
-          const U = m, A = u.strConcat(n.default.instancePath, w.errorPath);
+          const U = m, P = u.strConcat(n.default.instancePath, w.errorPath);
           d.if(c._`${n.default.errors} > 0`, () => {
             if (typeof U == "object") {
-              const [I, x] = $(U);
-              x && z(x), I && M(I), j(C(U));
+              const [T, x] = O(U);
+              x && z(x), T && M(T), G(C(U));
             }
             const k = typeof U == "string" ? U : U._;
             k && V(k), s.keepErrors || K();
           });
-          function C({ properties: k, items: I }) {
+          function C({ properties: k, items: T }) {
             const x = {};
             if (k) {
               x.props = {};
-              for (const T in k)
-                x.props[T] = [];
+              for (const I in k)
+                x.props[I] = [];
             }
-            if (I) {
+            if (T) {
               x.items = {};
-              for (let T = 0; T < I.length; T++)
-                x.items[T] = [];
+              for (let I = 0; I < T.length; I++)
+                x.items[I] = [];
             }
             return x;
           }
-          function $(k) {
-            let I, x;
-            for (const T in k) {
-              if (T === "properties" || T === "items")
+          function O(k) {
+            let T, x;
+            for (const I in k) {
+              if (I === "properties" || I === "items")
                 continue;
-              const D = k[T];
+              const D = k[I];
               if (typeof D == "object") {
-                I || (I = {});
-                const N = I[T] = {};
+                T || (T = {});
+                const N = T[I] = {};
                 for (const L in D)
                   N[L] = [];
               } else
-                x || (x = {}), x[T] = [];
+                x || (x = {}), x[I] = [];
             }
-            return [I, x];
+            return [T, x];
           }
           function z(k) {
-            const I = d.const("emErrors", c.stringify(k)), x = d.const("templates", ne(k, m));
-            d.forOf("err", n.default.vErrors, (L) => d.if(ee(L, I), () => d.code(c._`${I}[${L}.keyword].push(${L})`).assign(c._`${L}.${S}`, !0)));
-            const { singleError: T } = s;
-            if (T) {
+            const T = d.const("emErrors", c.stringify(k)), x = d.const("templates", ne(k, m));
+            d.forOf("err", n.default.vErrors, (L) => d.if(ee(L, T), () => d.code(c._`${T}[${L}.keyword].push(${L})`).assign(c._`${L}.${S}`, !0)));
+            const { singleError: I } = s;
+            if (I) {
               const L = d.let("message", c._`""`), q = d.let("paramsErrors", c._`[]`);
               D((H) => {
-                d.if(L, () => d.code(c._`${L} += ${typeof T == "string" ? T : ";"}`)), d.code(c._`${L} += ${N(H)}`), d.assign(q, c._`${q}.concat(${I}[${H}])`);
+                d.if(L, () => d.code(c._`${L} += ${typeof I == "string" ? I : ";"}`)), d.code(c._`${L} += ${N(H)}`), d.assign(q, c._`${q}.concat(${T}[${H}])`);
               }), g.reportError(f, { message: L, params: c._`{errors: ${q}}` });
             } else
               D((L) => g.reportError(f, {
                 message: N(L),
-                params: c._`{errors: ${I}[${L}]}`
+                params: c._`{errors: ${T}[${L}]}`
               }));
             function D(L) {
-              d.forIn("key", I, (q) => d.if(c._`${I}[${q}].length`, () => L(q)));
+              d.forIn("key", T, (q) => d.if(c._`${T}[${q}].length`, () => L(q)));
             }
             function N(L) {
               return c._`${L} in ${x} ? ${x}[${L}]() : ${b}[${L}]`;
             }
           }
           function M(k) {
-            const I = d.const("emErrors", c.stringify(k)), x = [];
+            const T = d.const("emErrors", c.stringify(k)), x = [];
             for (const q in k)
               x.push([
                 q,
                 ne(k[q], m[q])
               ]);
-            const T = d.const("templates", d.object(...x)), D = d.scopeValue("obj", {
+            const I = d.const("templates", d.object(...x)), D = d.scopeValue("obj", {
               ref: y,
               code: c.stringify(y)
             }), N = d.let("emPropParams"), L = d.let("emParamsErrors");
-            d.forOf("err", n.default.vErrors, (q) => d.if(ee(q, I), () => {
-              d.assign(N, c._`${D}[${q}.keyword]`), d.assign(L, c._`${I}[${q}.keyword][${q}.params[${N}]]`), d.if(L, () => d.code(c._`${L}.push(${q})`).assign(c._`${q}.${S}`, !0));
-            })), d.forIn("key", I, (q) => d.forIn("keyProp", c._`${I}[${q}]`, (H) => {
-              d.assign(L, c._`${I}[${q}][${H}]`), d.if(c._`${L}.length`, () => {
-                const R = d.const("tmpl", c._`${T}[${q}] && ${T}[${q}][${H}]`);
+            d.forOf("err", n.default.vErrors, (q) => d.if(ee(q, T), () => {
+              d.assign(N, c._`${D}[${q}.keyword]`), d.assign(L, c._`${T}[${q}.keyword][${q}.params[${N}]]`), d.if(L, () => d.code(c._`${L}.push(${q})`).assign(c._`${q}.${S}`, !0));
+            })), d.forIn("key", T, (q) => d.forIn("keyProp", c._`${T}[${q}]`, (H) => {
+              d.assign(L, c._`${T}[${q}][${H}]`), d.if(c._`${L}.length`, () => {
+                const F = d.const("tmpl", c._`${I}[${q}] && ${I}[${q}][${H}]`);
                 g.reportError(f, {
-                  message: c._`${R} ? ${R}() : ${b}[${q}][${H}]`,
+                  message: c._`${F} ? ${F}() : ${b}[${q}][${H}]`,
                   params: c._`{errors: ${L}}`
                 });
               });
             }));
           }
-          function j(k) {
-            const { props: I, items: x } = k;
-            if (!I && !x)
+          function G(k) {
+            const { props: T, items: x } = k;
+            if (!T && !x)
               return;
-            const T = c._`typeof ${p} == "object"`, D = c._`Array.isArray(${p})`, N = d.let("emErrors");
+            const I = c._`typeof ${p} == "object"`, D = c._`Array.isArray(${p})`, N = d.let("emErrors");
             let L, q;
             const H = d.let("templates");
-            I && x ? (L = d.let("emChildKwd"), d.if(T), d.if(D, () => {
-              R(x, m.items), d.assign(L, c.str`items`);
+            T && x ? (L = d.let("emChildKwd"), d.if(I), d.if(D, () => {
+              F(x, m.items), d.assign(L, c.str`items`);
             }, () => {
-              R(I, m.properties), d.assign(L, c.str`properties`);
-            }), q = c._`[${L}]`) : x ? (d.if(D), R(x, m.items), q = c._`.items`) : I && (d.if(u.and(T, u.not(D))), R(I, m.properties), q = c._`.properties`), d.forOf("err", n.default.vErrors, (F) => J(F, N, (O) => d.code(c._`${N}[${O}].push(${F})`).assign(c._`${F}.${S}`, !0))), d.forIn("key", N, (F) => d.if(c._`${N}[${F}].length`, () => {
+              F(T, m.properties), d.assign(L, c.str`properties`);
+            }), q = c._`[${L}]`) : x ? (d.if(D), F(x, m.items), q = c._`.items`) : T && (d.if(u.and(I, u.not(D))), F(T, m.properties), q = c._`.properties`), d.forOf("err", n.default.vErrors, (R) => J(R, N, ($) => d.code(c._`${N}[${$}].push(${R})`).assign(c._`${R}.${S}`, !0))), d.forIn("key", N, (R) => d.if(c._`${N}[${R}].length`, () => {
               g.reportError(f, {
-                message: c._`${F} in ${H} ? ${H}[${F}]() : ${b}${q}[${F}]`,
-                params: c._`{errors: ${N}[${F}]}`
-              }), d.assign(c._`${n.default.vErrors}[${n.default.errors}-1].instancePath`, c._`${A} + "/" + ${F}.replace(/~/g, "~0").replace(/\\//g, "~1")`);
+                message: c._`${R} in ${H} ? ${H}[${R}]() : ${b}${q}[${R}]`,
+                params: c._`{errors: ${N}[${R}]}`
+              }), d.assign(c._`${n.default.vErrors}[${n.default.errors}-1].instancePath`, c._`${P} + "/" + ${R}.replace(/~/g, "~0").replace(/\\//g, "~1")`);
             })), d.endIf();
-            function R(F, O) {
-              d.assign(N, c.stringify(F)), d.assign(H, ne(F, O));
+            function F(R, $) {
+              d.assign(N, c.stringify(R)), d.assign(H, ne(R, $));
             }
           }
           function V(k) {
-            const I = d.const("emErrs", c._`[]`);
-            d.forOf("err", n.default.vErrors, (x) => d.if(X(x), () => d.code(c._`${I}.push(${x})`).assign(c._`${x}.${S}`, !0))), d.if(c._`${I}.length`, () => g.reportError(f, {
+            const T = d.const("emErrs", c._`[]`);
+            d.forOf("err", n.default.vErrors, (x) => d.if(X(x), () => d.code(c._`${T}.push(${x})`).assign(c._`${x}.${S}`, !0))), d.if(c._`${T}.length`, () => g.reportError(f, {
               message: B(k),
-              params: c._`{errors: ${I}}`
+              params: c._`{errors: ${T}}`
             }));
           }
           function K() {
             const k = d.const("emErrs", c._`[]`);
-            d.forOf("err", n.default.vErrors, (I) => d.if(c._`!${I}.${S}`, () => d.code(c._`${k}.push(${I})`))), d.assign(n.default.vErrors, k).assign(n.default.errors, c._`${k}.length`);
+            d.forOf("err", n.default.vErrors, (T) => d.if(c._`!${T}.${S}`, () => d.code(c._`${k}.push(${T})`))), d.assign(n.default.vErrors, k).assign(n.default.errors, c._`${k}.length`);
           }
-          function ee(k, I) {
+          function ee(k, T) {
             return u.and(
               c._`${k}.keyword !== ${v}`,
               c._`!${k}.${S}`,
-              c._`${k}.instancePath === ${A}`,
-              c._`${k}.keyword in ${I}`,
+              c._`${k}.instancePath === ${P}`,
+              c._`${k}.keyword in ${T}`,
               // TODO match the end of the string?
               c._`${k}.schemaPath.indexOf(${w.errSchemaPath}) === 0`,
               c._`/^\\/[^\\/]*$/.test(${k}.schemaPath.slice(${w.errSchemaPath.length}))`
             );
           }
-          function J(k, I, x) {
-            d.if(u.and(c._`${k}.keyword !== ${v}`, c._`!${k}.${S}`, c._`${k}.instancePath.indexOf(${A}) === 0`), () => {
-              const T = d.scopeValue("pattern", {
+          function J(k, T, x) {
+            d.if(u.and(c._`${k}.keyword !== ${v}`, c._`!${k}.${S}`, c._`${k}.instancePath.indexOf(${P}) === 0`), () => {
+              const I = d.scopeValue("pattern", {
                 ref: /^\/([^/]*)(?:\/|$)/,
                 code: c._`new RegExp("^\\\/([^/]*)(?:\\\/|$)")`
-              }), D = d.const("emMatches", c._`${T}.exec(${k}.instancePath.slice(${A}.length))`), N = d.const("emChild", c._`${D} && ${D}[1].replace(/~1/g, "/").replace(/~0/g, "~")`);
-              d.if(c._`${N} !== undefined && ${N} in ${I}`, () => x(N));
+              }), D = d.const("emMatches", c._`${I}.exec(${k}.instancePath.slice(${P}.length))`), N = d.const("emChild", c._`${D} && ${D}[1].replace(/~1/g, "/").replace(/~0/g, "~")`);
+              d.if(c._`${N} !== undefined && ${N} in ${T}`, () => x(N));
             });
           }
           function X(k) {
-            return u.and(c._`${k}.keyword !== ${v}`, c._`!${k}.${S}`, u.or(c._`${k}.instancePath === ${A}`, u.and(c._`${k}.instancePath.indexOf(${A}) === 0`, c._`${k}.instancePath[${A}.length] === "/"`)), c._`${k}.schemaPath.indexOf(${w.errSchemaPath}) === 0`, c._`${k}.schemaPath[${w.errSchemaPath}.length] === "/"`);
+            return u.and(c._`${k}.keyword !== ${v}`, c._`!${k}.${S}`, u.or(c._`${k}.instancePath === ${P}`, u.and(c._`${k}.instancePath.indexOf(${P}) === 0`, c._`${k}.instancePath[${P}.length] === "/"`)), c._`${k}.schemaPath.indexOf(${w.errSchemaPath}) === 0`, c._`${k}.schemaPath[${w.errSchemaPath}.length] === "/"`);
           }
-          function ne(k, I) {
+          function ne(k, T) {
             const x = [];
-            for (const T in k) {
-              const D = I[T];
-              E.test(D) && x.push([T, P(D)]);
+            for (const I in k) {
+              const D = T[I];
+              E.test(D) && x.push([I, A(D)]);
             }
             return d.object(...x);
           }
           function B(k) {
-            return E.test(k) ? new _._Code(_.safeStringify(k).replace(t, (I, x) => `" + JSON.stringify(${h.getData(x, w)}) + "`).replace(a, "")) : c.stringify(k);
+            return E.test(k) ? new _._Code(_.safeStringify(k).replace(t, (T, x) => `" + JSON.stringify(${h.getData(x, w)}) + "`).replace(a, "")) : c.stringify(k);
           }
-          function P(k) {
+          function A(k) {
             return c._`function(){return ${B(k)}}`;
           }
         },
@@ -4637,7 +4637,7 @@ function kd() {
       // optimized https://www.safaribooksonline.com/library/view/regular-expressions-cookbook/9780596802837/ch07s16.html
       ipv4: /^(?:(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)\.){3}(?:25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)$/,
       ipv6: /^((([0-9a-f]{1,4}:){7}([0-9a-f]{1,4}|:))|(([0-9a-f]{1,4}:){6}(:[0-9a-f]{1,4}|((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3})|:))|(([0-9a-f]{1,4}:){5}(((:[0-9a-f]{1,4}){1,2})|:((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3})|:))|(([0-9a-f]{1,4}:){4}(((:[0-9a-f]{1,4}){1,3})|((:[0-9a-f]{1,4})?:((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(([0-9a-f]{1,4}:){3}(((:[0-9a-f]{1,4}){1,4})|((:[0-9a-f]{1,4}){0,2}:((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(([0-9a-f]{1,4}:){2}(((:[0-9a-f]{1,4}){1,5})|((:[0-9a-f]{1,4}){0,3}:((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(([0-9a-f]{1,4}:){1}(((:[0-9a-f]{1,4}){1,6})|((:[0-9a-f]{1,4}){0,4}:((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(:(((:[0-9a-f]{1,4}){1,7})|((:[0-9a-f]{1,4}){0,5}:((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:)))$/i,
-      regex: $,
+      regex: O,
       // uuid: http://tools.ietf.org/html/rfc4122
       uuid: /^(?:urn:uuid:)?[0-9a-f]{8}-(?:[0-9a-f]{4}-){3}[0-9a-f]{12}$/i,
       // JSON-pointer: https://tools.ietf.org/html/rfc6901
@@ -4654,9 +4654,9 @@ function kd() {
       // signed 64 bit integer
       int64: { type: "number", validate: U },
       // C-type float
-      float: { type: "number", validate: A },
+      float: { type: "number", validate: P },
       // C-type double
-      double: { type: "number", validate: A },
+      double: { type: "number", validate: P },
       // hint to the UI to hide input strings
       password: !0,
       // unchecked string payload
@@ -4684,8 +4684,8 @@ function kd() {
       const M = u.exec(z);
       if (!M)
         return !1;
-      const j = +M[1], V = +M[2], K = +M[3];
-      return V >= 1 && V <= 12 && K >= 1 && K <= (V === 2 && c(j) ? 29 : _[V]);
+      const G = +M[1], V = +M[2], K = +M[3];
+      return V >= 1 && V <= 12 && K >= 1 && K <= (V === 2 && c(G) ? 29 : _[V]);
     }
     function g(z, M) {
       if (z && M)
@@ -4693,32 +4693,32 @@ function kd() {
     }
     const n = /^(\d\d):(\d\d):(\d\d(?:\.\d+)?)(z|([+-])(\d\d)(?::?(\d\d))?)?$/i;
     function v(z) {
-      return function(j) {
-        const V = n.exec(j);
+      return function(G) {
+        const V = n.exec(G);
         if (!V)
           return !1;
-        const K = +V[1], ee = +V[2], J = +V[3], X = V[4], ne = V[5] === "-" ? -1 : 1, B = +(V[6] || 0), P = +(V[7] || 0);
-        if (B > 23 || P > 59 || z && !X)
+        const K = +V[1], ee = +V[2], J = +V[3], X = V[4], ne = V[5] === "-" ? -1 : 1, B = +(V[6] || 0), A = +(V[7] || 0);
+        if (B > 23 || A > 59 || z && !X)
           return !1;
         if (K <= 23 && ee <= 59 && J < 60)
           return !0;
-        const k = ee - P * ne, I = K - B * ne - (k < 0 ? 1 : 0);
-        return (I === 23 || I === -1) && (k === 59 || k === -1) && J < 61;
+        const k = ee - A * ne, T = K - B * ne - (k < 0 ? 1 : 0);
+        return (T === 23 || T === -1) && (k === 59 || k === -1) && J < 61;
       };
     }
     function S(z, M) {
       if (!(z && M))
         return;
-      const j = (/* @__PURE__ */ new Date("2020-01-01T" + z)).valueOf(), V = (/* @__PURE__ */ new Date("2020-01-01T" + M)).valueOf();
-      if (j && V)
-        return j - V;
+      const G = (/* @__PURE__ */ new Date("2020-01-01T" + z)).valueOf(), V = (/* @__PURE__ */ new Date("2020-01-01T" + M)).valueOf();
+      if (G && V)
+        return G - V;
     }
     function y(z, M) {
       if (!(z && M))
         return;
-      const j = n.exec(z), V = n.exec(M);
-      if (j && V)
-        return z = j[1] + j[2] + j[3], M = V[1] + V[2] + V[3], z > M ? 1 : z < M ? -1 : 0;
+      const G = n.exec(z), V = n.exec(M);
+      if (G && V)
+        return z = G[1] + G[2] + G[3], M = V[1] + V[2] + V[3], z > M ? 1 : z < M ? -1 : 0;
     }
     const E = /t|\s/i;
     function t(z) {
@@ -4731,14 +4731,14 @@ function kd() {
     function a(z, M) {
       if (!(z && M))
         return;
-      const j = new Date(z).valueOf(), V = new Date(M).valueOf();
-      if (j && V)
-        return j - V;
+      const G = new Date(z).valueOf(), V = new Date(M).valueOf();
+      if (G && V)
+        return G - V;
     }
     function e(z, M) {
       if (!(z && M))
         return;
-      const [j, V] = z.split(E), [K, ee] = M.split(E), J = g(j, K);
+      const [G, V] = z.split(E), [K, ee] = M.split(E), J = g(G, K);
       if (J !== void 0)
         return J || S(V, ee);
     }
@@ -4757,11 +4757,11 @@ function kd() {
     function U(z) {
       return Number.isInteger(z);
     }
-    function A() {
+    function P() {
       return !0;
     }
     const C = /[^\\]\\Z/;
-    function $(z) {
+    function O(z) {
       if (C.test(z))
         return !1;
       try {
@@ -4776,7 +4776,7 @@ var Yr = {}, Xs;
 function zd() {
   return Xs || (Xs = 1, (function(l) {
     Object.defineProperty(l, "__esModule", { value: !0 }), l.formatLimitDefinition = void 0;
-    const o = wn(), c = W(), u = c.operators, _ = {
+    const o = wn(), c = Z(), u = c.operators, _ = {
       formatMaximum: { okStr: "<=", ok: u.LTE, fail: u.GT },
       formatMinimum: { okStr: ">=", ok: u.GTE, fail: u.LT },
       formatExclusiveMaximum: { okStr: "<", ok: u.LT, fail: u.GTE },
@@ -4831,7 +4831,7 @@ var Js;
 function Fd() {
   return Js || (Js = 1, (function(l, o) {
     Object.defineProperty(o, "__esModule", { value: !0 });
-    const c = kd(), u = zd(), _ = W(), h = new _.Name("fullFormats"), g = new _.Name("fastFormats"), n = (S, y = { keywords: !0 }) => {
+    const c = kd(), u = zd(), _ = Z(), h = new _.Name("fullFormats"), g = new _.Name("fastFormats"), n = (S, y = { keywords: !0 }) => {
       if (Array.isArray(y))
         return v(S, y, c.fullFormats, h), S;
       const [E, t] = y.mode === "fast" ? [c.fastFormats, g] : [c.fullFormats, h], a = y.formats || c.formatNames;
@@ -4858,7 +4858,7 @@ var _t = { exports: {} }, mt = { exports: {} }, yt = { exports: {} }, Hi = { exp
 function Dd() {
   return Qs || (Qs = 1, (function(l, o) {
     Object.defineProperty(o, "__esModule", { value: !0 });
-    const c = W(), u = ["undefined", "string", "number", "object", "function", "boolean", "symbol"];
+    const c = Z(), u = ["undefined", "string", "number", "object", "function", "boolean", "symbol"];
     function _() {
       return {
         keyword: "typeof",
@@ -5023,7 +5023,7 @@ var xt = { exports: {} }, Wi = { exports: {} }, He = {}, pa;
 function Pr() {
   if (pa) return He;
   pa = 1, Object.defineProperty(He, "__esModule", { value: !0 }), He.usePattern = He.metaSchemaRef = void 0;
-  const l = W(), o = "http://json-schema.org/schema";
+  const l = Z(), o = "http://json-schema.org/schema";
   function c({ defaultMeta: _ } = {}) {
     return _ === !1 ? {} : { $ref: _ || o };
   }
@@ -5042,7 +5042,7 @@ var _a;
 function qd() {
   return _a || (_a = 1, (function(l, o) {
     Object.defineProperty(o, "__esModule", { value: !0 });
-    const c = W(), u = Pr(), _ = {
+    const c = Z(), u = Pr(), _ = {
       type: "object",
       properties: {
         pattern: { type: "string" },
@@ -5091,7 +5091,7 @@ var Ut = { exports: {} }, Zi = { exports: {} }, ga;
 function Hd() {
   return ga || (ga = 1, (function(l, o) {
     Object.defineProperty(o, "__esModule", { value: !0 });
-    const c = W(), u = {
+    const c = Z(), u = {
       trimStart: (v) => v.trimStart(),
       trimEnd: (v) => v.trimEnd(),
       trimLeft: (v) => v.trimStart(),
@@ -5339,7 +5339,7 @@ var kt = { exports: {} }, er = { exports: {} }, Da;
 function rf() {
   return Da || (Da = 1, (function(l, o) {
     Object.defineProperty(o, "__esModule", { value: !0 });
-    const c = W(), u = Pr(), _ = {
+    const c = Z(), u = Pr(), _ = {
       message: ({ params: { missingPattern: g } }) => (0, c.str)`should have property matching pattern '${g}'`,
       params: ({ params: { missingPattern: g } }) => (0, c._)`{missingPattern: ${g}}`
     };
@@ -5480,7 +5480,7 @@ var Rt = { exports: {} }, rr = { exports: {} }, Va;
 function df() {
   return Va || (Va = 1, (function(l, o) {
     Object.defineProperty(o, "__esModule", { value: !0 });
-    const c = W();
+    const c = Z();
     function u() {
       return {
         keyword: "deepRequired",
@@ -5615,7 +5615,7 @@ var Dt = { exports: {} }, sr = { exports: {} }, Xa;
 function hf() {
   return Xa || (Xa = 1, (function(l, o) {
     Object.defineProperty(o, "__esModule", { value: !0 });
-    const c = W(), u = Pr(), _ = {
+    const c = Z(), u = Pr(), _ = {
       message: ({ params: { schemaProp: g } }) => g ? (0, c.str)`should match case "${g}" schema` : (0, c.str)`should match default case schema`,
       params: ({ params: { schemaProp: g } }) => g ? (0, c._)`{failingCase: ${g}}` : (0, c._)`{failingDefault: true}`
     };
@@ -6149,21 +6149,21 @@ function ou() {
     filter: r
   })[p.segmentType](p);
   return { verify: (p) => {
-    const m = /* @__PURE__ */ new Set(), b = /* @__PURE__ */ new Set(), w = S(p), U = w.tracks.map((A) => {
-      const C = s(A);
+    const m = /* @__PURE__ */ new Set(), b = /* @__PURE__ */ new Set(), w = S(p), U = w.tracks.map((P) => {
+      const C = s(P);
       if (b.has(C.trackId))
         throw new Error(`${au} ${C.trackId}`);
       return b.add(C.trackId), C;
     });
     w.tracks = U;
-    for (const A of U) {
-      const C = A.children.map(($) => {
-        const z = f({ ...$, segmentType: A.trackType });
+    for (const P of U) {
+      const C = P.children.map((O) => {
+        const z = f({ ...O, segmentType: P.trackType });
         if (m.has(z.id))
           throw new Error(`${su} ${z.id}`);
         return m.add(z.id), z;
       });
-      A.children = C;
+      P.children = C;
     }
     return w;
   }, verifyBasic: S, verifyFramesSegment: y, verifyTextSegment: E, verifyStickerSegment: t, verifyAudioSegment: a, verifyEffectSegment: e, verifyFilterSegment: r, verifyTrack: s, verifySegment: f };
@@ -6199,7 +6199,7 @@ var Un = /* @__PURE__ */ Symbol.for("immer-nothing"), Mt = /* @__PURE__ */ Symbo
   // Note: if more errors are added, the errorOffset in Patches.ts should be increased
   // See Patches.ts for additional errors
 ] : [];
-function de(l, ...o) {
+function fe(l, ...o) {
   if (process.env.NODE_ENV !== "production") {
     const c = Mo[l], u = $e(c) ? c.apply(null, o) : c;
     throw new Error(`[Immer] ${u}`);
@@ -6250,7 +6250,7 @@ function fu(l) {
   const o = +l;
   return Number.isInteger(o) && String(o) === l;
 }
-var Go = (l) => nt(l) ? l?.[te] : null, le = (l) => l.copy_ || l.base_, uu = (l) => {
+var Go = (l) => nt(l) ? l?.[te] : null, de = (l) => l.copy_ || l.base_, uu = (l) => {
   const o = Go(l);
   return o ? o.copy_ ?? o.base_ : l;
 }, En = (l) => l.modified_ ? l.copy_ : l.base_;
@@ -6300,7 +6300,7 @@ function Tn(l, o = !1) {
   )), l;
 }
 function cu() {
-  de(2);
+  fe(2);
 }
 var ar = {
   [Vt]: cu
@@ -6311,7 +6311,7 @@ function Ar(l) {
 var Ht = "MapSet", br = "Patches", so = "ArrayMethods", wr = {};
 function Xe(l) {
   const o = wr[l];
-  return o || de(0, l), o;
+  return o || fe(0, l), o;
 }
 var ao = (l) => !!wr[l];
 function qo(l, o) {
@@ -6348,7 +6348,7 @@ function fo(l, o) {
   o.unfinalizedDrafts_ = o.drafts_.length;
   const c = o.drafts_[0];
   if (l !== void 0 && l !== c) {
-    c[te].modified_ && (an(o), de(4)), xe(l) && (l = uo(o, l));
+    c[te].modified_ && (an(o), fe(4)), xe(l) && (l = uo(o, l));
     const { patchPlugin_: _ } = o;
     _ && _.generateReplacementPatches_(
       c[te].base_,
@@ -6386,7 +6386,7 @@ function Vo(l) {
 }
 var Cr = (l, o) => l.scope_ === o, mu = [];
 function Ho(l, o, c, u) {
-  const _ = le(l), h = l.type_;
+  const _ = de(l), h = l.type_;
   if (u !== void 0 && ze(_, u, h) === o) {
     vr(_, u, c, h);
     return;
@@ -6434,7 +6434,7 @@ function gu(l, o, c) {
       Ho(l, c, g, o);
     });
   } else xe(c) && l.callbacks_.push(function() {
-    const h = le(l);
+    const h = de(l);
     ze(h, o, l.type_) === c && u.drafts_.length > 1 && (l.assigned_.get(o) ?? !1) === !0 && l.copy_ && In(
       ze(l.copy_, o, l.type_),
       u.handledSet_,
@@ -6493,7 +6493,7 @@ var Pn = {
     const u = l.type_ === 1 && typeof o == "string";
     if (u && c?.isArrayOperationMethod(o))
       return c.createMethodInterceptor(l, o);
-    const _ = le(l);
+    const _ = de(l);
     if (!jt(_, o, l.type_))
       return bu(l, _, o);
     const h = _[o];
@@ -6509,17 +6509,17 @@ var Pn = {
     return h;
   },
   has(l, o) {
-    return o in le(l);
+    return o in de(l);
   },
   ownKeys(l) {
-    return Reflect.ownKeys(le(l));
+    return Reflect.ownKeys(de(l));
   },
   set(l, o, c) {
-    const u = Ko(le(l), o);
+    const u = Ko(de(l), o);
     if (u?.set)
       return u.set.call(l.draft_, c), !0;
     if (!l.modified_) {
-      const _ = Wr(le(l), o), h = _?.[te];
+      const _ = Wr(de(l), o), h = _?.[te];
       if (h && h.base_ === c)
         return l.copy_[o] = c, l.assigned_.set(o, !1), !0;
       if (du(c, _) && (c !== void 0 || jt(l.base_, o, l.type_)))
@@ -6536,7 +6536,7 @@ var Pn = {
   // Note: We never coerce `desc.value` into an Immer draft, because we can't make
   // the same guarantee in ES5 mode.
   getOwnPropertyDescriptor(l, o) {
-    const c = le(l), u = Reflect.getOwnPropertyDescriptor(c, o);
+    const c = de(l), u = Reflect.getOwnPropertyDescriptor(c, o);
     return u && {
       [dr]: !0,
       [nn]: l.type_ !== 1 || o !== "length",
@@ -6545,13 +6545,13 @@ var Pn = {
     };
   },
   defineProperty() {
-    de(11);
+    fe(11);
   },
   getPrototypeOf(l) {
     return We(l.base_);
   },
   setPrototypeOf() {
-    de(12);
+    fe(12);
   }
 }, Kt = {};
 Je(Pn, (l, o) => {
@@ -6561,14 +6561,14 @@ Je(Pn, (l, o) => {
   };
 });
 Kt.deleteProperty = function(l, o) {
-  return process.env.NODE_ENV !== "production" && isNaN(parseInt(o)) && de(13), Kt.set.call(this, l, o, void 0);
+  return process.env.NODE_ENV !== "production" && isNaN(parseInt(o)) && fe(13), Kt.set.call(this, l, o, void 0);
 };
 Kt.set = function(l, o, c) {
-  return process.env.NODE_ENV !== "production" && o !== "length" && isNaN(parseInt(o)) && de(14), Pn.set.call(this, l[0], o, c, l[0]);
+  return process.env.NODE_ENV !== "production" && o !== "length" && isNaN(parseInt(o)) && fe(14), Pn.set.call(this, l[0], o, c, l[0]);
 };
 function Wr(l, o) {
   const c = l[te];
-  return (c ? le(c) : l)[o];
+  return (c ? de(c) : l)[o];
 }
 function bu(l, o, c) {
   const u = Ko(o, c);
@@ -6609,7 +6609,7 @@ var wu = class {
           return g.produce(v, (y) => c.call(this, y, ...S));
         };
       }
-      $e(c) || de(6), u !== void 0 && !$e(u) && de(7);
+      $e(c) || fe(6), u !== void 0 && !$e(u) && fe(7);
       let _;
       if (xe(o)) {
         const h = lo(this), g = Wt(h, o, void 0);
@@ -6630,7 +6630,7 @@ var wu = class {
         }
         return _;
       } else
-        de(1, o);
+        fe(1, o);
     }, this.produceWithPatches = (o, c) => {
       if ($e(o))
         return (g, ...n) => this.produceWithPatches(g, (v) => o(v, ...n));
@@ -6641,13 +6641,13 @@ var wu = class {
     }, Kr(l?.autoFreeze) && this.setAutoFreeze(l.autoFreeze), Kr(l?.useStrictShallowCopy) && this.setUseStrictShallowCopy(l.useStrictShallowCopy), Kr(l?.useStrictIteration) && this.setUseStrictIteration(l.useStrictIteration);
   }
   createDraft(l) {
-    xe(l) || de(8), Be(l) && (l = Su(l));
+    xe(l) || fe(8), Be(l) && (l = Su(l));
     const o = lo(this), c = Wt(o, l, void 0);
     return c[te].isManual_ = !0, on(o), c;
   }
   finishDraft(l, o) {
     const c = l && l[te];
-    (!c || !c.isManual_) && de(9);
+    (!c || !c.isManual_) && fe(9);
     const { scope_: u } = c;
     return oo(u, o), fo(void 0, u);
   }
@@ -6705,7 +6705,7 @@ function Wt(l, o, c, u) {
   }), _;
 }
 function Su(l) {
-  return Be(l) || de(10, l), Wo(l);
+  return Be(l) || fe(10, l), Wo(l);
 }
 function Wo(l) {
   if (!xe(l) || Ar(l))
@@ -6808,10 +6808,10 @@ function xu() {
     m.length < d.length && ([d, m] = [m, d], [s, f] = [f, s]);
     const b = e.allIndicesReassigned_ === !0;
     for (let w = 0; w < d.length; w++) {
-      const U = m[w], A = d[w];
-      if ((b || p?.get(w.toString())) && U !== A) {
-        const $ = U?.[te];
-        if ($ && $.modified_)
+      const U = m[w], P = d[w];
+      if ((b || p?.get(w.toString())) && U !== P) {
+        const O = U?.[te];
+        if (O && O.modified_)
           continue;
         const z = r.concat([w]);
         s.push({
@@ -6823,7 +6823,7 @@ function xu() {
         }), f.push({
           op: u,
           path: z,
-          value: a(A)
+          value: a(P)
         });
       }
     }
@@ -6848,14 +6848,14 @@ function xu() {
   function v(e, r, s, f) {
     const { base_: d, copy_: p, type_: m } = e;
     Je(e.assigned_, (b, w) => {
-      const U = ze(d, b, m), A = ze(p, b, m), C = w ? jt(d, b) ? u : _ : h;
-      if (U === A && C === u)
+      const U = ze(d, b, m), P = ze(p, b, m), C = w ? jt(d, b) ? u : _ : h;
+      if (U === P && C === u)
         return;
-      const $ = r.concat(b);
+      const O = r.concat(b);
       s.push(
-        C === h ? { op: C, path: $ } : { op: C, path: $, value: a(A) }
+        C === h ? { op: C, path: O } : { op: C, path: O, value: a(P) }
       ), f.push(
-        C === _ ? { op: h, path: $ } : C === h ? { op: _, path: $, value: a(U) } : { op: u, path: $, value: a(U) }
+        C === _ ? { op: h, path: O } : C === h ? { op: _, path: O, value: a(U) } : { op: u, path: O, value: a(U) }
       );
     });
   }
@@ -6908,9 +6908,9 @@ function xu() {
       const { path: f, op: d } = s;
       let p = e;
       for (let U = 0; U < f.length - 1; U++) {
-        const A = Ze(p);
+        const P = Ze(p);
         let C = f[U];
-        typeof C != "string" && typeof C != "number" && (C = "" + C), (A === 0 || A === 1) && (C === "__proto__" || C === qt) && de(19), $e(p) && C === ei && de(19), p = ze(p, C), nt(p) || de(18, f.join("/"));
+        typeof C != "string" && typeof C != "number" && (C = "" + C), (P === 0 || P === 1) && (C === "__proto__" || C === qt) && fe(19), $e(p) && C === ei && fe(19), p = ze(p, C), nt(p) || fe(18, f.join("/"));
       }
       const m = Ze(p), b = t(s.value), w = f[f.length - 1];
       switch (d) {
@@ -6919,7 +6919,7 @@ function xu() {
             case 2:
               return p.set(w, b);
             case 3:
-              de(16);
+              fe(16);
             default:
               return p[w] = b;
           }
@@ -6946,7 +6946,7 @@ function xu() {
               return delete p[w];
           }
         default:
-          de(17, d);
+          fe(17, d);
       }
     }), e;
   }
@@ -6995,14 +6995,14 @@ function Uu() {
       };
     }
     get size() {
-      return le(this[te]).size;
+      return de(this[te]).size;
     }
     has(S) {
-      return le(this[te]).has(S);
+      return de(this[te]).has(S);
     }
     set(S, y) {
       const E = this[te];
-      return g(E), (!le(E).has(S) || le(E).get(S) !== y) && (c(E), Fe(E), E.assigned_.set(S, !0), E.copy_.set(S, y), E.assigned_.set(S, !0)), this;
+      return g(E), (!de(E).has(S) || de(E).get(S) !== y) && (c(E), Fe(E), E.assigned_.set(S, !0), E.copy_.set(S, y), E.assigned_.set(S, !0)), this;
     }
     delete(S) {
       if (!this.has(S))
@@ -7012,27 +7012,27 @@ function Uu() {
     }
     clear() {
       const S = this[te];
-      g(S), le(S).size && (c(S), Fe(S), S.assigned_ = /* @__PURE__ */ new Map(), Je(S.base_, (y) => {
+      g(S), de(S).size && (c(S), Fe(S), S.assigned_ = /* @__PURE__ */ new Map(), Je(S.base_, (y) => {
         S.assigned_.set(y, !1);
       }), S.copy_.clear());
     }
     forEach(S, y) {
       const E = this[te];
-      le(E).forEach((t, a, e) => {
+      de(E).forEach((t, a, e) => {
         S.call(y, this.get(a), a, this);
       });
     }
     get(S) {
       const y = this[te];
       g(y);
-      const E = le(y).get(S);
+      const E = de(y).get(S);
       if (y.finalized_ || !xe(E) || E !== y.base_.get(S))
         return E;
       const t = Wt(y.scope_, E, y, S);
       return c(y), y.copy_.set(S, t), t;
     }
     keys() {
-      return le(this[te]).keys();
+      return de(this[te]).keys();
     }
     values() {
       const S = this.keys();
@@ -7093,7 +7093,7 @@ function Uu() {
       };
     }
     get size() {
-      return le(this[te]).size;
+      return de(this[te]).size;
     }
     has(S) {
       const y = this[te];
@@ -7114,7 +7114,7 @@ function Uu() {
     }
     clear() {
       const S = this[te];
-      g(S), le(S).size && (h(S), Fe(S), S.copy_.clear());
+      g(S), de(S).size && (h(S), Fe(S), S.copy_.clear());
     }
     values() {
       const S = this[te];
@@ -7151,7 +7151,7 @@ function Uu() {
     }));
   }
   function g(v) {
-    v.revoked_ && de(3, JSON.stringify(le(v)));
+    v.revoked_ && fe(3, JSON.stringify(de(v)));
   }
   function n(v) {
     if (v.type_ === 3 && v.copy_) {
@@ -7349,226 +7349,230 @@ function Jc(l, o) {
       return _.value[e.value];
   }), s = (B) => {
     e.value = B;
-  }, f = (B, P) => {
+  }, f = (B, A) => {
     const k = {
-      isMain: B.segmentType === "frames" && !P?.length ? !0 : void 0,
+      isMain: B.segmentType === "frames" && !A?.length ? !0 : void 0,
       trackType: B.segmentType,
       trackId: o?.idFactory?.track?.() ?? Zr(),
       children: [B]
     };
-    return P.push(k), B.id;
-  }, d = (B, P, k) => {
-    const I = _o(P.children, k), x = B.endTime - B.startTime;
-    if (I === 0)
-      B.startTime = 0, B.endTime = x;
-    else {
-      const T = P.children[I - 1];
-      B.startTime = T.endTime, B.endTime = T.endTime + x;
-    }
-    P.children.splice(I, 0, B);
-    for (let T = I; T < P.children.length; T++) {
-      const D = P.children[T], N = P.children[T - 1]?.endTime ?? 0, L = D.endTime - D.startTime;
-      D.startTime = N, D.endTime = N + L;
-    }
+    return A.push(k), B.id;
+  }, d = (B, A, k) => {
+    if (A.isMain) {
+      const T = _o(A.children, k), x = B.endTime - B.startTime;
+      if (T === 0)
+        B.startTime = 0, B.endTime = x;
+      else {
+        const I = A.children[T - 1];
+        B.startTime = I.endTime, B.endTime = I.endTime + x;
+      }
+      A.children.splice(T, 0, B);
+      for (let I = T; I < A.children.length; I++) {
+        const D = A.children[I], N = A.children[I - 1]?.endTime ?? 0, L = D.endTime - D.startTime;
+        D.startTime = N, D.endTime = N + L;
+      }
+    } else
+      A.children.push(B), A.children.sort((T, x) => T.startTime - x.startTime);
     return B.id;
-  }, p = (B, P) => d(B, P, a.value), m = (B, P = 0) => {
+  }, p = (B, A) => d(B, A, a.value), m = (B, A = 0) => {
     const k = B.children;
-    k.sort((x, T) => x.startTime - T.startTime);
-    const I = B.trackType === "frames" && B.isMain;
-    for (let x = P; x < k.length; x++) {
-      const T = k[x], D = T.endTime - T.startTime, N = k[x - 1];
+    k.sort((x, I) => x.startTime - I.startTime);
+    const T = B.trackType === "frames" && B.isMain;
+    for (let x = A; x < k.length; x++) {
+      const I = k[x], D = I.endTime - I.startTime, N = k[x - 1];
       if (!N) {
-        I && (T.startTime = 0, T.endTime = D);
+        T && (I.startTime = 0, I.endTime = D);
         continue;
       }
-      (I || T.startTime < N.endTime) && (T.startTime = N.endTime, T.endTime = N.endTime + D);
+      (T || I.startTime < N.endTime) && (I.startTime = N.endTime, I.endTime = N.endTime + D);
     }
   }, b = (B) => {
-    const P = ur(B);
-    (!P.id || _.value[P.id]) && (P.id = o?.idFactory?.segment?.() ?? Zr());
-    const k = a.value - P.startTime;
-    return P.startTime += k, P.endTime += k, P;
-  }, w = (B, P) => {
+    const A = ur(B);
+    (!A.id || _.value[A.id]) && (A.id = o?.idFactory?.segment?.() ?? Zr());
+    const k = a.value - A.startTime;
+    return A.startTime += k, A.endTime += k, A;
+  }, w = (B, A) => {
     const k = _.value[B];
-    if (k && k.segmentType === P)
+    if (k && k.segmentType === A)
       return k;
-    if (k && !P)
+    if (k && !A)
       return k;
-  }, U = (B) => {
-    const P = b(B), k = /* @__PURE__ */ new Set(), I = [], x = [], T = [];
+  }, U = (B, A) => {
+    const k = b(B), T = /* @__PURE__ */ new Set(), x = [], I = [], D = [];
     try {
-      c.verifySegment(P);
+      c.verifySegment(k);
     } catch {
       throw new Error("invalid segment data");
     }
-    const D = g((L) => {
-      if (P.segmentType === "frames") {
-        const O = L.tracks.filter((Y) => Y.trackType === "frames").find((Y) => Y.isMain);
-        if (!O) {
-          const Y = f(P, L.tracks), Z = L.tracks.find((ae) => ae.children.some((he) => he.id === Y));
-          return Z && (I.push(Ye(Z)), k.add(Z.trackId)), Y;
+    const N = g((q) => {
+      if (k.segmentType === "frames") {
+        const $ = q.tracks.filter((W) => W.trackType === "frames");
+        let j = $.find((W) => W.trackId === A);
+        if (j || (j = $.find((W) => W.isMain)), !j) {
+          const W = f(k, q.tracks), ae = q.tracks.find((he) => he.children.some((le) => le.id === W));
+          return ae && (x.push(Ye(ae)), T.add(ae.trackId)), W;
         }
-        const G = p(P, O);
-        return k.add(O.trackId), G;
+        const Y = p(k, j);
+        return T.add(j.trackId), Y;
       }
-      const q = L.tracks;
-      for (let F = q.length - 1; F >= 0; F--) {
-        if (q[F].trackType !== P.segmentType)
+      const H = q.tracks;
+      for (let $ = H.length - 1; $ >= 0; $--) {
+        if (H[$].trackType !== k.segmentType)
           continue;
-        const O = q[F].children, G = Au(P, O, a.value);
-        if (G !== -1)
-          return O.splice(G, 0, P), k.add(q[F].trackId), P.id;
-      }
-      const H = f(P, q), R = L.tracks.find((F) => F.children.some((O) => O.id === H));
-      return R && (I.push(Ye(R)), k.add(R.trackId)), H;
-    }), N = [];
-    if (k.size > 0) {
-      const L = S();
-      for (const q of k) {
-        const H = L.tracks.find((R) => R.trackId === q);
-        H && (N.push(...or(H.children)), x.push(Ye(H)));
-      }
-    }
-    return { id: D, affectedSegments: N, affectedTracks: x, createdTracks: I, removedTrackIds: T };
-  }, A = (B) => {
-    let P = null;
-    const k = [], I = [], x = [], T = g((N) => {
+        const j = H[$].children, Y = Au(k, j, a.value);
+        if (Y !== -1)
+          return j.splice(Y, 0, k), T.add(H[$].trackId), k.id;
+      }
+      const F = f(k, H), R = q.tracks.find(($) => $.children.some((j) => j.id === F));
+      return R && (x.push(Ye(R)), T.add(R.trackId)), F;
+    }), L = [];
+    if (T.size > 0) {
+      const q = S();
+      for (const H of T) {
+        const F = q.tracks.find((R) => R.trackId === H);
+        F && (L.push(...or(F.children)), I.push(Ye(F)));
+      }
+    }
+    return { id: N, affectedSegments: L, affectedTracks: I, createdTracks: x, removedTrackIds: D };
+  }, P = (B) => {
+    let A = null;
+    const k = [], T = [], x = [], I = g((N) => {
       for (let L = 0; L < N.tracks.length; L++) {
-        const q = N.tracks[L], H = q.children.findIndex((R) => R.id === B);
+        const q = N.tracks[L], H = q.children.findIndex((F) => F.id === B);
         if (H !== -1)
-          return q.children.splice(H, 1), q.children.length > 0 ? q.trackType === "frames" && q.isMain && (m(q, 0), P = q.trackId) : (N.tracks.splice(L, 1), x.push(q.trackId)), !0;
+          return q.children.splice(H, 1), q.children.length > 0 ? q.trackType === "frames" && q.isMain && (m(q, 0), A = q.trackId) : (N.tracks.splice(L, 1), x.push(q.trackId)), !0;
       }
       return !1;
     }), D = [];
-    if (T && P) {
-      const L = S().tracks.find((q) => q.trackId === P);
+    if (I && A) {
+      const L = S().tracks.find((q) => q.trackId === A);
       L && (D.push(...or(L.children)), k.push(Ye(L)));
     }
-    return { success: T, affectedSegments: D, affectedTracks: k, createdTracks: I, removedTrackIds: x };
+    return { success: I, affectedSegments: D, affectedTracks: k, createdTracks: T, removedTrackIds: x };
   }, C = (B) => {
-    const P = /* @__PURE__ */ new Set(), k = [], I = [], x = [], T = g((N) => {
-      const L = N.tracks.find((F) => F.trackId === B.sourceTrackId);
+    const A = /* @__PURE__ */ new Set(), k = [], T = [], x = [], I = g((N) => {
+      const L = N.tracks.find((R) => R.trackId === B.sourceTrackId);
       if (!L)
         return !1;
-      const q = L.children.findIndex((F) => F.id === B.segmentId);
+      const q = L.children.findIndex((R) => R.id === B.segmentId);
       if (q < 0)
         return !1;
       const H = L.children[q];
       if (B.targetTrackId === B.sourceTrackId && B.isNewTrack !== !0)
-        H.startTime = B.startTime, H.endTime = B.endTime, m(L), P.add(L.trackId);
+        H.startTime = B.startTime, H.endTime = B.endTime, m(L), A.add(L.trackId);
       else {
-        if (L.children.splice(q, 1), L.children.length > 0 && (m(L), P.add(L.trackId)), L.children.length === 0) {
-          const F = N.tracks.findIndex((O) => O.trackId === L.trackId);
-          F >= 0 && (N.tracks.splice(F, 1), x.push(L.trackId));
+        if (L.children.splice(q, 1), L.children.length > 0 && (m(L), A.add(L.trackId)), L.children.length === 0) {
+          const R = N.tracks.findIndex(($) => $.trackId === L.trackId);
+          R >= 0 && (N.tracks.splice(R, 1), x.push(L.trackId));
         }
         if (H.startTime = B.startTime, H.endTime = B.endTime, B.isNewTrack && B.newTrackInsertIndex !== void 0) {
-          const F = H.segmentType === "frames" && !N.tracks.some((G) => G.trackType === "frames" && G.isMain), O = {
+          const R = H.segmentType === "frames" && !N.tracks.some((j) => j.trackType === "frames" && j.isMain), $ = {
             trackId: B.newTrackId ?? o?.idFactory?.track?.() ?? Zr(),
             trackType: H.segmentType,
             children: [H],
-            ...F ? { isMain: !0 } : {}
+            ...R ? { isMain: !0 } : {}
           };
-          if (F) {
-            const G = H.endTime - H.startTime;
-            H.startTime = 0, H.endTime = G;
+          if (R) {
+            const j = H.endTime - H.startTime;
+            H.startTime = 0, H.endTime = j;
           }
-          N.tracks.splice(B.newTrackInsertIndex, 0, O), P.add(O.trackId), I.push(Ye(O));
+          N.tracks.splice(B.newTrackInsertIndex, 0, $), A.add($.trackId), T.push(Ye($));
         } else if (B.targetTrackId) {
-          const F = N.tracks.find((O) => O.trackId === B.targetTrackId);
-          if (!F || F.trackType !== H.segmentType)
+          const R = N.tracks.find(($) => $.trackId === B.targetTrackId);
+          if (!R || R.trackType !== H.segmentType)
             return !1;
-          F.trackType === "frames" ? d(
+          R.trackType === "frames" ? d(
             H,
-            F,
+            R,
             H.startTime
-          ) : (F.children.push(H), m(F)), P.add(F.trackId);
+          ) : (R.children.push(H), m(R)), A.add(R.trackId);
         }
       }
       return !0;
     }), D = [];
-    if (T) {
+    if (I) {
       const N = S();
-      for (const L of P) {
+      for (const L of A) {
         const q = N.tracks.find((H) => H.trackId === L);
         q && (D.push(...or(q.children)), k.push(Ye(q)));
       }
     }
-    return { success: T, affectedSegments: D, affectedTracks: k, createdTracks: I, removedTrackIds: x };
-  }, $ = (B) => {
-    let P = null;
-    const k = [], I = [], x = [], T = g((N) => {
+    return { success: I, affectedSegments: D, affectedTracks: k, createdTracks: T, removedTrackIds: x };
+  }, O = (B) => {
+    let A = null;
+    const k = [], T = [], x = [], I = g((N) => {
       const L = N.tracks.find((ae) => ae.trackId === B.trackId);
       if (!L)
         return !1;
       const q = L.children.findIndex((ae) => ae.id === B.segmentId);
       if (q < 0)
         return !1;
-      const H = L.children[q], R = H.startTime;
-      let F = B.startTime, O = B.endTime, G = O - F;
-      if (!Number.isFinite(G) || G < 0)
+      const H = L.children[q], F = H.startTime;
+      let R = B.startTime, $ = B.endTime, j = $ - R;
+      if (!Number.isFinite(j) || j < 0)
         return !1;
       const Y = ku(H) ? H : null;
-      let Z = Y ? Y.fromTime ?? 0 : 0;
-      if (Y && F !== R) {
-        const ae = Y.fromTime ?? 0, he = F - R, fe = Math.max(he, -ae);
-        if (fe !== he && (F = R + fe, G = O - F), !Number.isFinite(G) || G < 0)
+      let W = Y ? Y.fromTime ?? 0 : 0;
+      if (Y && R !== F) {
+        const ae = Y.fromTime ?? 0, he = R - F, le = Math.max(he, -ae);
+        if (le !== he && (R = F + le, j = $ - R), !Number.isFinite(j) || j < 0)
           return !1;
-        Z = ae + fe, Y.fromTime = Z;
+        W = ae + le, Y.fromTime = W;
       }
-      return H.startTime = F, H.endTime = O, m(L, q), P = L.trackId, !0;
+      return H.startTime = R, H.endTime = $, m(L, q), A = L.trackId, !0;
     }), D = [];
-    if (T && P) {
-      const L = S().tracks.find((q) => q.trackId === P);
+    if (I && A) {
+      const L = S().tracks.find((q) => q.trackId === A);
       L && D.push(...or(L.children));
     }
-    return { success: T, affectedSegments: D, affectedTracks: k, createdTracks: I, removedTrackIds: x };
+    return { success: I, affectedSegments: D, affectedTracks: k, createdTracks: T, removedTrackIds: x };
   };
-  function z(B, P, k) {
-    g((I) => {
-      const x = P ?? r.value?.id;
+  function z(B, A, k) {
+    g((T) => {
+      const x = A ?? r.value?.id;
       if (x === void 0)
         return;
-      const T = Ru(x, I);
-      T && (!k || T.segmentType === k) && B(T);
-    }, (I, x, T) => {
-      T((D) => {
-        Pu(I, x, D, c) ? Tu(I, x, D, n) : n();
+      const I = Ru(x, T);
+      I && (!k || I.segmentType === k) && B(I);
+    }, (T, x, I) => {
+      I((D) => {
+        Pu(T, x, D, c) ? Tu(T, x, D, n) : n();
       });
     });
   }
-  const M = (B, P) => g((k) => {
-    const I = k.tracks.find((q) => q.trackType === "frames" && q.isMain);
-    if (!I || I.children.length < 2)
+  const M = (B, A) => g((k) => {
+    const T = k.tracks.find((q) => q.trackType === "frames" && q.isMain);
+    if (!T || T.children.length < 2)
       return !1;
-    const x = Math.max(0, P ?? a.value);
-    let T = _o(I.children, x) - 1;
-    if (T = Math.min(Math.max(0, T), I.children.length - 2), !B || typeof B != "object" || typeof B.id != "string" || typeof B.name != "string" || typeof B.duration != "number" || B.duration < 0)
+    const x = Math.max(0, A ?? a.value);
+    let I = _o(T.children, x) - 1;
+    if (I = Math.min(Math.max(0, I), T.children.length - 2), !B || typeof B != "object" || typeof B.id != "string" || typeof B.name != "string" || typeof B.duration != "number" || B.duration < 0)
       return !0;
-    const D = I.children[T], N = I.children[T + 1], L = ur(B);
+    const D = T.children[I], N = T.children[I + 1], L = ur(B);
     return D.transitionIn = L, N.transitionOut = L, !0;
-  }), j = (B) => g((P) => {
-    const k = P.tracks.find((L) => L.trackType === "frames" && L.isMain);
+  }), G = (B) => g((A) => {
+    const k = A.tracks.find((L) => L.trackType === "frames" && L.isMain);
     if (!k)
       return !1;
-    const I = k.children.findIndex((L) => L.id === B);
-    if (I === -1)
+    const T = k.children.findIndex((L) => L.id === B);
+    if (T === -1)
       return !1;
-    const x = k.children[I], T = I > 0 ? k.children[I - 1] : void 0, D = I < k.children.length - 1 ? k.children[I + 1] : void 0;
+    const x = k.children[T], I = T > 0 ? k.children[T - 1] : void 0, D = T < k.children.length - 1 ? k.children[T + 1] : void 0;
     let N = !1;
-    return x.transitionIn && (x.transitionIn = void 0, D && (D.transitionOut = void 0), N = !0), x.transitionOut && (x.transitionOut = void 0, T && (T.transitionIn = void 0), N = !0), N;
-  }), V = (B, P) => {
+    return x.transitionIn && (x.transitionIn = void 0, D && (D.transitionOut = void 0), N = !0), x.transitionOut && (x.transitionOut = void 0, I && (I.transitionIn = void 0), N = !0), N;
+  }), V = (B, A) => {
     const k = h.value.frames?.find((x) => x.trackType === "frames" && x.isMain);
     if (!k)
       return !1;
-    const I = k.children.findIndex((x) => x.id === B);
-    return I === -1 ? !1 : (z((x) => {
-      x.transitionIn && P(x.transitionIn);
-    }, k.children[I].id, "frames"), z((x) => {
-      x.transitionOut && P(x.transitionOut);
-    }, k.children[I + 1].id, "frames"), !0);
-  }, K = (B, P) => g((k) => {
-    const I = k.tracks.find((x) => x.trackId === B);
-    return I ? (I.trackId = P, !0) : !1;
+    const T = k.children.findIndex((x) => x.id === B);
+    return T === -1 ? !1 : (z((x) => {
+      x.transitionIn && A(x.transitionIn);
+    }, k.children[T].id, "frames"), z((x) => {
+      x.transitionOut && A(x.transitionOut);
+    }, k.children[T + 1].id, "frames"), !0);
+  }, K = (B, A) => g((k) => {
+    const T = k.tracks.find((x) => x.trackId === B);
+    return T ? (T.trackId = A, !0) : !1;
   }), ee = {
     success: !1,
     affectedSegments: [],
@@ -7587,13 +7591,13 @@ function Jc(l, o) {
     protocol: t,
     getSegment: w,
     addSegment: U,
-    removeSegment: A,
+    removeSegment: P,
     updateSegment: z,
     moveSegment: C,
-    resizeSegment: $,
+    resizeSegment: O,
     exportProtocol: S,
     addTransition: M,
-    removeTransition: j,
+    removeTransition: G,
     updateTransition: V,
     replaceTrackId: K,
     undo: () => {
@@ -7601,7 +7605,7 @@ function Jc(l, o) {
         return ee;
       const B = J();
       n();
-      const P = J(), k = mo(B, P);
+      const A = J(), k = mo(B, A);
       return {
         success: !0,
         affectedSegments: k.affectedSegments,
@@ -7616,7 +7620,7 @@ function Jc(l, o) {
         return ee;
       const B = J();
       v();
-      const P = J(), k = mo(B, P);
+      const A = J(), k = mo(B, A);
       return {
         success: !0,
         affectedSegments: k.affectedSegments,
@@ -8204,9 +8208,9 @@ function Yu() {
     o.getDurationString = function(t, a) {
       var e;
       function r(b, w) {
-        for (var U = "" + b, A = U.split("."); A[0].length < w; )
-          A[0] = "0" + A[0];
-        return A.join(".");
+        for (var U = "" + b, P = U.split("."); P[0].length < w; )
+          P[0] = "0" + P[0];
+        return P.join(".");
       }
       t < 0 ? (e = !0, t = -t) : e = !1;
       var s = a || 1, f = t / s, d = Math.floor(f / 3600);
@@ -10021,8 +10025,8 @@ function Yu() {
           this.held_bits = C.readUint16(), this.num_held_bits = 16;
         },
         extract_bits: function(C) {
-          var $ = this.held_bits >> this.num_held_bits - C & (1 << C) - 1;
-          return this.num_held_bits -= C, $;
+          var O = this.held_bits >> this.num_held_bits - C & (1 << C) - 1;
+          return this.num_held_bits -= C, O;
         }
       };
       if (r.stream_read_1_bytes(t), r.extract_bits(5), this.lengthSizeMinusOne = r.extract_bits(2), this.ptl_present_flag = r.extract_bits(1), this.ptl_present_flag) {
@@ -10062,10 +10066,10 @@ function Yu() {
         this.nalu_arrays.push(w), r.stream_read_1_bytes(t), w.completeness = r.extract_bits(1), r.extract_bits(2), w.nalu_type = r.extract_bits(5);
         var U = 1;
         for (w.nalu_type != m && w.nalu_type != p && (U = t.readUint16()), e = 0; e < U; e++) {
-          var A = t.readUint16();
+          var P = t.readUint16();
           w.push({
-            data: t.readUint8Array(A),
-            length: A
+            data: t.readUint8Array(P),
+            length: P
           });
         }
       }
@@ -10727,8 +10731,8 @@ function Yu() {
         a.description && f.addBox(a.description), a.description_boxes && a.description_boxes.forEach(function(C) {
           f.addBox(C);
         }), s.add("dinf").add("dref").addEntry(new n["url Box"]().set("flags", 1));
-        var A = s.add("stbl");
-        return A.add("stsd").addEntry(f), A.add("stts").set("sample_counts", []).set("sample_deltas", []), A.add("stsc").set("first_chunk", []).set("samples_per_chunk", []).set("sample_description_index", []), A.add("stco").set("chunk_offsets", []), A.add("stsz").set("sample_sizes", []), this.moov.mvex.add("trex").set("track_id", a.id).set("default_sample_description_index", a.default_sample_description_index || 1).set("default_sample_duration", a.default_sample_duration || 0).set("default_sample_size", a.default_sample_size || 0).set("default_sample_flags", a.default_sample_flags || 0), this.buildTrakSampleLists(e), a.id;
+        var P = s.add("stbl");
+        return P.add("stsd").addEntry(f), P.add("stts").set("sample_counts", []).set("sample_deltas", []), P.add("stsc").set("first_chunk", []).set("samples_per_chunk", []).set("sample_description_index", []), P.add("stco").set("chunk_offsets", []), P.add("stsz").set("sample_sizes", []), this.moov.mvex.add("trex").set("track_id", a.id).set("default_sample_description_index", a.default_sample_description_index || 1).set("default_sample_duration", a.default_sample_duration || 0).set("default_sample_size", a.default_sample_size || 0).set("default_sample_flags", a.default_sample_flags || 0), this.buildTrakSampleLists(e), a.id;
       }
     }, n.Box.prototype.computeSize = function(t) {
       var a = t || new u();
@@ -10756,8 +10760,8 @@ function Yu() {
       }
     }, y.initSampleGroups = function(t, a, e, r, s) {
       var f, d, p, m;
-      function b(w, U, A) {
-        this.grouping_type = w, this.grouping_type_parameter = U, this.sbgp = A, this.last_sample_in_run = -1, this.entry_index = -1;
+      function b(w, U, P) {
+        this.grouping_type = w, this.grouping_type_parameter = U, this.sbgp = P, this.last_sample_in_run = -1, this.entry_index = -1;
       }
       for (a && (a.sample_groups_info = []), t.sample_groups_info || (t.sample_groups_info = []), d = 0; d < e.length; d++) {
         for (m = e[d].grouping_type + "/" + e[d].grouping_type_parameter, p = new b(e[d].grouping_type, e[d].grouping_type_parameter, e[d]), a && (a.sample_groups_info[m] = p), t.sample_groups_info[m] || (t.sample_groups_info[m] = p), f = 0; f < r.length; f++)
@@ -10788,26 +10792,26 @@ function Yu() {
       for (t = 0; t < this.moov.traks.length; t++)
         a = this.moov.traks[t], this.buildTrakSampleLists(a);
     }, y.prototype.buildTrakSampleLists = function(t) {
-      var a, e, r, s, f, d, p, m, b, w, U, A, C, $, z, M, j, V, K, ee, J, X, ne, B;
-      if (t.samples = [], t.samples_duration = 0, t.samples_size = 0, e = t.mdia.minf.stbl.stco || t.mdia.minf.stbl.co64, r = t.mdia.minf.stbl.stsc, s = t.mdia.minf.stbl.stsz || t.mdia.minf.stbl.stz2, f = t.mdia.minf.stbl.stts, d = t.mdia.minf.stbl.ctts, p = t.mdia.minf.stbl.stss, m = t.mdia.minf.stbl.stsd, b = t.mdia.minf.stbl.subs, A = t.mdia.minf.stbl.stdp, w = t.mdia.minf.stbl.sbgps, U = t.mdia.minf.stbl.sgpds, V = -1, K = -1, ee = -1, J = -1, X = 0, ne = 0, B = 0, y.initSampleGroups(t, null, w, U), !(typeof s > "u")) {
+      var a, e, r, s, f, d, p, m, b, w, U, P, C, O, z, M, G, V, K, ee, J, X, ne, B;
+      if (t.samples = [], t.samples_duration = 0, t.samples_size = 0, e = t.mdia.minf.stbl.stco || t.mdia.minf.stbl.co64, r = t.mdia.minf.stbl.stsc, s = t.mdia.minf.stbl.stsz || t.mdia.minf.stbl.stz2, f = t.mdia.minf.stbl.stts, d = t.mdia.minf.stbl.ctts, p = t.mdia.minf.stbl.stss, m = t.mdia.minf.stbl.stsd, b = t.mdia.minf.stbl.subs, P = t.mdia.minf.stbl.stdp, w = t.mdia.minf.stbl.sbgps, U = t.mdia.minf.stbl.sgpds, V = -1, K = -1, ee = -1, J = -1, X = 0, ne = 0, B = 0, y.initSampleGroups(t, null, w, U), !(typeof s > "u")) {
         for (a = 0; a < s.sample_sizes.length; a++) {
-          var P = {};
-          P.number = a, P.track_id = t.tkhd.track_id, P.timescale = t.mdia.mdhd.timescale, P.alreadyRead = 0, t.samples[a] = P, P.size = s.sample_sizes[a], t.samples_size += P.size, a === 0 ? ($ = 1, C = 0, P.chunk_index = $, P.chunk_run_index = C, j = r.samples_per_chunk[C], M = 0, C + 1 < r.first_chunk.length ? z = r.first_chunk[C + 1] - 1 : z = 1 / 0) : a < j ? (P.chunk_index = $, P.chunk_run_index = C) : ($++, P.chunk_index = $, M = 0, $ <= z || (C++, C + 1 < r.first_chunk.length ? z = r.first_chunk[C + 1] - 1 : z = 1 / 0), P.chunk_run_index = C, j += r.samples_per_chunk[C]), P.description_index = r.sample_description_index[P.chunk_run_index] - 1, P.description = m.entries[P.description_index], P.offset = e.chunk_offsets[P.chunk_index - 1] + M, M += P.size, a > V && (K++, V < 0 && (V = 0), V += f.sample_counts[K]), a > 0 ? (t.samples[a - 1].duration = f.sample_deltas[K], t.samples_duration += t.samples[a - 1].duration, P.dts = t.samples[a - 1].dts + t.samples[a - 1].duration) : P.dts = 0, d ? (a >= ee && (J++, ee < 0 && (ee = 0), ee += d.sample_counts[J]), P.cts = t.samples[a].dts + d.sample_offsets[J]) : P.cts = P.dts, p ? (a == p.sample_numbers[X] - 1 ? (P.is_sync = !0, X++) : (P.is_sync = !1, P.degradation_priority = 0), b && b.entries[ne].sample_delta + B == a + 1 && (P.subsamples = b.entries[ne].subsamples, B += b.entries[ne].sample_delta, ne++)) : P.is_sync = !0, y.process_sdtp(t.mdia.minf.stbl.sdtp, P, P.number), A ? P.degradation_priority = A.priority[a] : P.degradation_priority = 0, b && b.entries[ne].sample_delta + B == a && (P.subsamples = b.entries[ne].subsamples, B += b.entries[ne].sample_delta), (w.length > 0 || U.length > 0) && y.setSampleGroupProperties(t, P, a, t.sample_groups_info);
+          var A = {};
+          A.number = a, A.track_id = t.tkhd.track_id, A.timescale = t.mdia.mdhd.timescale, A.alreadyRead = 0, t.samples[a] = A, A.size = s.sample_sizes[a], t.samples_size += A.size, a === 0 ? (O = 1, C = 0, A.chunk_index = O, A.chunk_run_index = C, G = r.samples_per_chunk[C], M = 0, C + 1 < r.first_chunk.length ? z = r.first_chunk[C + 1] - 1 : z = 1 / 0) : a < G ? (A.chunk_index = O, A.chunk_run_index = C) : (O++, A.chunk_index = O, M = 0, O <= z || (C++, C + 1 < r.first_chunk.length ? z = r.first_chunk[C + 1] - 1 : z = 1 / 0), A.chunk_run_index = C, G += r.samples_per_chunk[C]), A.description_index = r.sample_description_index[A.chunk_run_index] - 1, A.description = m.entries[A.description_index], A.offset = e.chunk_offsets[A.chunk_index - 1] + M, M += A.size, a > V && (K++, V < 0 && (V = 0), V += f.sample_counts[K]), a > 0 ? (t.samples[a - 1].duration = f.sample_deltas[K], t.samples_duration += t.samples[a - 1].duration, A.dts = t.samples[a - 1].dts + t.samples[a - 1].duration) : A.dts = 0, d ? (a >= ee && (J++, ee < 0 && (ee = 0), ee += d.sample_counts[J]), A.cts = t.samples[a].dts + d.sample_offsets[J]) : A.cts = A.dts, p ? (a == p.sample_numbers[X] - 1 ? (A.is_sync = !0, X++) : (A.is_sync = !1, A.degradation_priority = 0), b && b.entries[ne].sample_delta + B == a + 1 && (A.subsamples = b.entries[ne].subsamples, B += b.entries[ne].sample_delta, ne++)) : A.is_sync = !0, y.process_sdtp(t.mdia.minf.stbl.sdtp, A, A.number), P ? A.degradation_priority = P.priority[a] : A.degradation_priority = 0, b && b.entries[ne].sample_delta + B == a && (A.subsamples = b.entries[ne].subsamples, B += b.entries[ne].sample_delta), (w.length > 0 || U.length > 0) && y.setSampleGroupProperties(t, A, a, t.sample_groups_info);
         }
         a > 0 && (t.samples[a - 1].duration = Math.max(t.mdia.mdhd.duration - t.samples[a - 1].dts, 0), t.samples_duration += t.samples[a - 1].duration);
       }
     }, y.prototype.updateSampleLists = function() {
-      var t, a, e, r, s, f, d, p, m, b, w, U, A, C, $;
+      var t, a, e, r, s, f, d, p, m, b, w, U, P, C, O;
       if (this.moov !== void 0) {
         for (; this.lastMoofIndex < this.moofs.length; )
           if (m = this.moofs[this.lastMoofIndex], this.lastMoofIndex++, m.type == "moof")
             for (b = m, t = 0; t < b.trafs.length; t++) {
-              for (w = b.trafs[t], U = this.getTrackById(w.tfhd.track_id), A = this.getTrexById(w.tfhd.track_id), w.tfhd.flags & n.TFHD_FLAG_SAMPLE_DESC ? r = w.tfhd.default_sample_description_index : r = A ? A.default_sample_description_index : 1, w.tfhd.flags & n.TFHD_FLAG_SAMPLE_DUR ? s = w.tfhd.default_sample_duration : s = A ? A.default_sample_duration : 0, w.tfhd.flags & n.TFHD_FLAG_SAMPLE_SIZE ? f = w.tfhd.default_sample_size : f = A ? A.default_sample_size : 0, w.tfhd.flags & n.TFHD_FLAG_SAMPLE_FLAGS ? d = w.tfhd.default_sample_flags : d = A ? A.default_sample_flags : 0, w.sample_number = 0, w.sbgps.length > 0 && y.initSampleGroups(U, w, w.sbgps, U.mdia.minf.stbl.sgpds, w.sgpds), a = 0; a < w.truns.length; a++) {
+              for (w = b.trafs[t], U = this.getTrackById(w.tfhd.track_id), P = this.getTrexById(w.tfhd.track_id), w.tfhd.flags & n.TFHD_FLAG_SAMPLE_DESC ? r = w.tfhd.default_sample_description_index : r = P ? P.default_sample_description_index : 1, w.tfhd.flags & n.TFHD_FLAG_SAMPLE_DUR ? s = w.tfhd.default_sample_duration : s = P ? P.default_sample_duration : 0, w.tfhd.flags & n.TFHD_FLAG_SAMPLE_SIZE ? f = w.tfhd.default_sample_size : f = P ? P.default_sample_size : 0, w.tfhd.flags & n.TFHD_FLAG_SAMPLE_FLAGS ? d = w.tfhd.default_sample_flags : d = P ? P.default_sample_flags : 0, w.sample_number = 0, w.sbgps.length > 0 && y.initSampleGroups(U, w, w.sbgps, U.mdia.minf.stbl.sgpds, w.sgpds), a = 0; a < w.truns.length; a++) {
                 var z = w.truns[a];
                 for (e = 0; e < z.sample_count; e++) {
-                  C = {}, C.moof_number = this.lastMoofIndex, C.number_in_traf = w.sample_number, w.sample_number++, C.number = U.samples.length, w.first_sample_index = U.samples.length, U.samples.push(C), C.track_id = U.tkhd.track_id, C.timescale = U.mdia.mdhd.timescale, C.description_index = r - 1, C.description = U.mdia.minf.stbl.stsd.entries[C.description_index], C.size = f, z.flags & n.TRUN_FLAGS_SIZE && (C.size = z.sample_size[e]), U.samples_size += C.size, C.duration = s, z.flags & n.TRUN_FLAGS_DURATION && (C.duration = z.sample_duration[e]), U.samples_duration += C.duration, U.first_traf_merged || e > 0 ? C.dts = U.samples[U.samples.length - 2].dts + U.samples[U.samples.length - 2].duration : (w.tfdt ? C.dts = w.tfdt.baseMediaDecodeTime : C.dts = 0, U.first_traf_merged = !0), C.cts = C.dts, z.flags & n.TRUN_FLAGS_CTS_OFFSET && (C.cts = C.dts + z.sample_composition_time_offset[e]), $ = d, z.flags & n.TRUN_FLAGS_FLAGS ? $ = z.sample_flags[e] : e === 0 && z.flags & n.TRUN_FLAGS_FIRST_FLAG && ($ = z.first_sample_flags), C.is_sync = !($ >> 16 & 1), C.is_leading = $ >> 26 & 3, C.depends_on = $ >> 24 & 3, C.is_depended_on = $ >> 22 & 3, C.has_redundancy = $ >> 20 & 3, C.degradation_priority = $ & 65535;
-                  var M = !!(w.tfhd.flags & n.TFHD_FLAG_BASE_DATA_OFFSET), j = !!(w.tfhd.flags & n.TFHD_FLAG_DEFAULT_BASE_IS_MOOF), V = !!(z.flags & n.TRUN_FLAGS_DATA_OFFSET), K = 0;
-                  M ? K = w.tfhd.base_data_offset : j || a === 0 ? K = b.start : K = p, a === 0 && e === 0 ? V ? C.offset = K + z.data_offset : C.offset = K : C.offset = p, p = C.offset + C.size, (w.sbgps.length > 0 || w.sgpds.length > 0 || U.mdia.minf.stbl.sbgps.length > 0 || U.mdia.minf.stbl.sgpds.length > 0) && y.setSampleGroupProperties(U, C, C.number_in_traf, w.sample_groups_info);
+                  C = {}, C.moof_number = this.lastMoofIndex, C.number_in_traf = w.sample_number, w.sample_number++, C.number = U.samples.length, w.first_sample_index = U.samples.length, U.samples.push(C), C.track_id = U.tkhd.track_id, C.timescale = U.mdia.mdhd.timescale, C.description_index = r - 1, C.description = U.mdia.minf.stbl.stsd.entries[C.description_index], C.size = f, z.flags & n.TRUN_FLAGS_SIZE && (C.size = z.sample_size[e]), U.samples_size += C.size, C.duration = s, z.flags & n.TRUN_FLAGS_DURATION && (C.duration = z.sample_duration[e]), U.samples_duration += C.duration, U.first_traf_merged || e > 0 ? C.dts = U.samples[U.samples.length - 2].dts + U.samples[U.samples.length - 2].duration : (w.tfdt ? C.dts = w.tfdt.baseMediaDecodeTime : C.dts = 0, U.first_traf_merged = !0), C.cts = C.dts, z.flags & n.TRUN_FLAGS_CTS_OFFSET && (C.cts = C.dts + z.sample_composition_time_offset[e]), O = d, z.flags & n.TRUN_FLAGS_FLAGS ? O = z.sample_flags[e] : e === 0 && z.flags & n.TRUN_FLAGS_FIRST_FLAG && (O = z.first_sample_flags), C.is_sync = !(O >> 16 & 1), C.is_leading = O >> 26 & 3, C.depends_on = O >> 24 & 3, C.is_depended_on = O >> 22 & 3, C.has_redundancy = O >> 20 & 3, C.degradation_priority = O & 65535;
+                  var M = !!(w.tfhd.flags & n.TFHD_FLAG_BASE_DATA_OFFSET), G = !!(w.tfhd.flags & n.TFHD_FLAG_DEFAULT_BASE_IS_MOOF), V = !!(z.flags & n.TRUN_FLAGS_DATA_OFFSET), K = 0;
+                  M ? K = w.tfhd.base_data_offset : G || a === 0 ? K = b.start : K = p, a === 0 && e === 0 ? V ? C.offset = K + z.data_offset : C.offset = K : C.offset = p, p = C.offset + C.size, (w.sbgps.length > 0 || w.sgpds.length > 0 || U.mdia.minf.stbl.sbgps.length > 0 || U.mdia.minf.stbl.sgpds.length > 0) && y.setSampleGroupProperties(U, C, C.number_in_traf, w.sample_groups_info);
                 }
               }
               if (w.subs) {
@@ -11230,10 +11234,10 @@ function ic() {
     })();
     o.getDurationString = function(e, r) {
       var s;
-      function f(U, A) {
-        for (var C = "" + U, $ = C.split("."); $[0].length < A; )
-          $[0] = "0" + $[0];
-        return $.join(".");
+      function f(U, P) {
+        for (var C = "" + U, O = C.split("."); O[0].length < P; )
+          O[0] = "0" + O[0];
+        return O.join(".");
       }
       e < 0 ? (s = !0, e = -e) : s = !1;
       var d = r || 1, p = e / d, m = Math.floor(p / 3600);
@@ -11965,10 +11969,10 @@ function ic() {
       };
       var p = this, m = {};
       return this.parseOneDescriptor = function(b) {
-        var w = 0, U, A, C;
+        var w = 0, U, P, C;
         for (U = b.readUint8(), C = b.readUint8(); C & 128; )
           w = (C & 127) << 7, C = b.readUint8();
-        return w += C & 127, o.debug("MPEG4DescriptorParser", "Found " + (d[U] || "Descriptor " + U) + ", size " + w + " at position " + b.getPosition()), d[U] ? A = new m[d[U]](w) : A = new m.Descriptor(w), A.parse(b), A;
+        return w += C & 127, o.debug("MPEG4DescriptorParser", "Found " + (d[U] || "Descriptor " + U) + ", size " + w + " at position " + b.getPosition()), d[U] ? P = new m[d[U]](w) : P = new m.Descriptor(w), P.parse(b), P;
       }, m.Descriptor = function(b, w) {
         this.tag = b, this.size = w, this.descs = [];
       }, m.Descriptor.prototype.parse = function(b) {
@@ -12000,8 +12004,8 @@ function ic() {
         if (!w) return null;
         var U = w.findDescriptor(s);
         if (U && U.data) {
-          var A = (U.data[0] & 248) >> 3;
-          return A === 31 && U.data.length >= 2 && (A = 32 + ((U.data[0] & 7) << 3) + ((U.data[1] & 224) >> 5)), A;
+          var P = (U.data[0] & 248) >> 3;
+          return P === 31 && U.data.length >= 2 && (P = 32 + ((U.data[0] & 7) << 3) + ((U.data[1] & 224) >> 5)), P;
         } else
           return null;
       }, m.DecoderConfigDescriptor = function(b) {
@@ -12167,11 +12171,11 @@ function ic() {
         return o.debug("BoxParser", "Not enough data in stream to parse the type and size of the box"), { code: n.ERR_NOT_ENOUGH_DATA };
       if (s && s < 8)
         return o.debug("BoxParser", "Not enough bytes left in the parent box to parse a new box"), { code: n.ERR_NOT_ENOUGH_DATA };
-      var w = e.readUint32(), U = e.readString(4), A = U;
+      var w = e.readUint32(), U = e.readString(4), P = U;
       if (o.debug("BoxParser", "Found box of type '" + U + "' and size " + w + " at position " + d), p = 8, U == "uuid") {
         if (e.getEndPosition() - e.getPosition() < 16 || s - p < 16)
           return e.seek(d), o.debug("BoxParser", "Not enough bytes left in the parent box to parse a UUID box"), { code: n.ERR_NOT_ENOUGH_DATA };
-        b = n.parseUUID(e), p += 16, A = b;
+        b = n.parseUUID(e), p += 16, P = b;
       }
       if (w == 1) {
         if (e.getEndPosition() - e.getPosition() < 8 || s && s - p < 8)
@@ -12183,7 +12187,7 @@ function ic() {
         else if (U !== "mdat")
           return o.error("BoxParser", "Unlimited box size not supported for type: '" + U + "'"), f = new n.Box(U, w), { code: n.OK, box: f, size: f.size };
       }
-      return w !== 0 && w < p ? (o.error("BoxParser", "Box of type " + U + " has an invalid size " + w + " (too small to be a box)"), { code: n.ERR_NOT_ENOUGH_DATA, type: U, size: w, hdr_size: p, start: d }) : w !== 0 && s && w > s ? (o.error("BoxParser", "Box of type '" + U + "' has a size " + w + " greater than its container size " + s), { code: n.ERR_NOT_ENOUGH_DATA, type: U, size: w, hdr_size: p, start: d }) : w !== 0 && d + w > e.getEndPosition() ? (e.seek(d), o.info("BoxParser", "Not enough data in stream to parse the entire '" + U + "' box"), { code: n.ERR_NOT_ENOUGH_DATA, type: U, size: w, hdr_size: p, start: d }) : r ? { code: n.OK, type: U, size: w, hdr_size: p, start: d } : (n[U + "Box"] ? f = new n[U + "Box"](w) : U !== "uuid" ? (o.warn("BoxParser", "Unknown box type: '" + U + "'"), f = new n.Box(U, w), f.has_unparsed_data = !0) : n.UUIDBoxes[b] ? f = new n.UUIDBoxes[b](w) : (o.warn("BoxParser", "Unknown uuid type: '" + b + "'"), f = new n.Box(U, w), f.uuid = b, f.has_unparsed_data = !0), f.hdr_size = p, f.start = d, f.write === n.Box.prototype.write && f.type !== "mdat" && (o.info("BoxParser", "'" + A + "' box writing not yet implemented, keeping unparsed data in memory for later write"), f.parseDataAndRewind(e)), f.parse(e), m = e.getPosition() - (f.start + f.size), m < 0 ? (o.warn("BoxParser", "Parsing of box '" + A + "' did not read the entire indicated box data size (missing " + -m + " bytes), seeking forward"), e.seek(f.start + f.size)) : m > 0 && (o.error("BoxParser", "Parsing of box '" + A + "' read " + m + " more bytes than the indicated box data size, seeking backwards"), f.size !== 0 && e.seek(f.start + f.size)), { code: n.OK, box: f, size: f.size });
+      return w !== 0 && w < p ? (o.error("BoxParser", "Box of type " + U + " has an invalid size " + w + " (too small to be a box)"), { code: n.ERR_NOT_ENOUGH_DATA, type: U, size: w, hdr_size: p, start: d }) : w !== 0 && s && w > s ? (o.error("BoxParser", "Box of type '" + U + "' has a size " + w + " greater than its container size " + s), { code: n.ERR_NOT_ENOUGH_DATA, type: U, size: w, hdr_size: p, start: d }) : w !== 0 && d + w > e.getEndPosition() ? (e.seek(d), o.info("BoxParser", "Not enough data in stream to parse the entire '" + U + "' box"), { code: n.ERR_NOT_ENOUGH_DATA, type: U, size: w, hdr_size: p, start: d }) : r ? { code: n.OK, type: U, size: w, hdr_size: p, start: d } : (n[U + "Box"] ? f = new n[U + "Box"](w) : U !== "uuid" ? (o.warn("BoxParser", "Unknown box type: '" + U + "'"), f = new n.Box(U, w), f.has_unparsed_data = !0) : n.UUIDBoxes[b] ? f = new n.UUIDBoxes[b](w) : (o.warn("BoxParser", "Unknown uuid type: '" + b + "'"), f = new n.Box(U, w), f.uuid = b, f.has_unparsed_data = !0), f.hdr_size = p, f.start = d, f.write === n.Box.prototype.write && f.type !== "mdat" && (o.info("BoxParser", "'" + P + "' box writing not yet implemented, keeping unparsed data in memory for later write"), f.parseDataAndRewind(e)), f.parse(e), m = e.getPosition() - (f.start + f.size), m < 0 ? (o.warn("BoxParser", "Parsing of box '" + P + "' did not read the entire indicated box data size (missing " + -m + " bytes), seeking forward"), e.seek(f.start + f.size)) : m > 0 && (o.error("BoxParser", "Parsing of box '" + P + "' read " + m + " more bytes than the indicated box data size, seeking backwards"), f.size !== 0 && e.seek(f.start + f.size)), { code: n.OK, box: f, size: f.size });
     }, n.Box.prototype.parse = function(e) {
       this.type != "mdat" ? this.data = e.readUint8Array(this.size - this.hdr_size) : this.size === 0 ? e.seek(e.getEndPosition()) : e.seek(this.start + this.size);
     }, n.Box.prototype.parseDataAndRewind = function(e) {
@@ -13138,14 +13142,14 @@ function ic() {
       this.nalu_arrays = [];
       var U = e.readUint8();
       for (r = 0; r < U; r++) {
-        var A = [];
-        this.nalu_arrays.push(A), f.stream_read_1_bytes(e), A.completeness = f.extract_bits(1), f.extract_bits(2), A.nalu_type = f.extract_bits(5);
+        var P = [];
+        this.nalu_arrays.push(P), f.stream_read_1_bytes(e), P.completeness = f.extract_bits(1), f.extract_bits(2), P.nalu_type = f.extract_bits(5);
         var C = 1;
-        for (A.nalu_type != w && A.nalu_type != b && (C = e.readUint16()), s = 0; s < C; s++) {
-          var $ = e.readUint16();
-          A.push({
-            data: e.readUint8Array($),
-            length: $
+        for (P.nalu_type != w && P.nalu_type != b && (C = e.readUint16()), s = 0; s < C; s++) {
+          var O = e.readUint16();
+          P.push({
+            data: e.readUint8Array(O),
+            length: O
           });
         }
       }
@@ -13784,14 +13788,14 @@ function ic() {
         switch (m) {
           case "Visual":
             if (d.add("vmhd").set("graphicsmode", 0).set("opcolor", [0, 0, 0]), p.set("width", r.width).set("height", r.height).set("horizresolution", 72 << 16).set("vertresolution", 72 << 16).set("frame_count", 1).set("compressorname", r.type + " Compressor").set("depth", 24), r.avcDecoderConfigRecord) {
-              var A = new n.avcCBox();
-              A.parse(new c(r.avcDecoderConfigRecord)), p.addBox(A);
+              var P = new n.avcCBox();
+              P.parse(new c(r.avcDecoderConfigRecord)), p.addBox(P);
             } else if (r.hevcDecoderConfigRecord) {
               var C = new n.hvcCBox();
               C.parse(new c(r.hevcDecoderConfigRecord)), p.addBox(C);
             } else if (r.vpcDecoderConfigRecord) {
-              var $ = new n.vpcCBox();
-              $.parse(new c(r.vpcDecoderConfigRecord)), p.addBox($);
+              var O = new n.vpcCBox();
+              O.parse(new c(r.vpcDecoderConfigRecord)), p.addBox(O);
             }
             break;
           case "Audio":
@@ -13845,8 +13849,8 @@ function ic() {
       }
     }, t.initSampleGroups = function(e, r, s, f, d) {
       var p, m, b, w;
-      function U(A, C, $) {
-        this.grouping_type = A, this.grouping_type_parameter = C, this.sbgp = $, this.last_sample_in_run = -1, this.entry_index = -1;
+      function U(P, C, O) {
+        this.grouping_type = P, this.grouping_type_parameter = C, this.sbgp = O, this.last_sample_in_run = -1, this.entry_index = -1;
       }
       for (r && (r.sample_groups_info = []), e.sample_groups_info || (e.sample_groups_info = []), m = 0; m < s.length; m++) {
         for (w = s[m].grouping_type + "/" + s[m].grouping_type_parameter, b = new U(s[m].grouping_type, s[m].grouping_type_parameter, s[m]), r && (r.sample_groups_info[w] = b), e.sample_groups_info[w] || (e.sample_groups_info[w] = b), p = 0; p < f.length; p++)
@@ -13877,33 +13881,33 @@ function ic() {
       for (e = 0; e < this.moov.traks.length; e++)
         r = this.moov.traks[e], this.buildTrakSampleLists(r);
     }, t.prototype.buildTrakSampleLists = function(e) {
-      var r, s, f, d, p, m, b, w, U, A, C, $, z, M, j, V, K, ee, J, X, ne, B, P, k;
-      if (e.samples = [], e.samples_duration = 0, e.samples_size = 0, s = e.mdia.minf.stbl.stco || e.mdia.minf.stbl.co64, f = e.mdia.minf.stbl.stsc, d = e.mdia.minf.stbl.stsz || e.mdia.minf.stbl.stz2, p = e.mdia.minf.stbl.stts, m = e.mdia.minf.stbl.ctts, b = e.mdia.minf.stbl.stss, w = e.mdia.minf.stbl.stsd, U = e.mdia.minf.stbl.subs, $ = e.mdia.minf.stbl.stdp, A = e.mdia.minf.stbl.sbgps, C = e.mdia.minf.stbl.sgpds, ee = -1, J = -1, X = -1, ne = -1, B = 0, P = 0, k = 0, t.initSampleGroups(e, null, A, C), !(typeof d > "u")) {
+      var r, s, f, d, p, m, b, w, U, P, C, O, z, M, G, V, K, ee, J, X, ne, B, A, k;
+      if (e.samples = [], e.samples_duration = 0, e.samples_size = 0, s = e.mdia.minf.stbl.stco || e.mdia.minf.stbl.co64, f = e.mdia.minf.stbl.stsc, d = e.mdia.minf.stbl.stsz || e.mdia.minf.stbl.stz2, p = e.mdia.minf.stbl.stts, m = e.mdia.minf.stbl.ctts, b = e.mdia.minf.stbl.stss, w = e.mdia.minf.stbl.stsd, U = e.mdia.minf.stbl.subs, O = e.mdia.minf.stbl.stdp, P = e.mdia.minf.stbl.sbgps, C = e.mdia.minf.stbl.sgpds, ee = -1, J = -1, X = -1, ne = -1, B = 0, A = 0, k = 0, t.initSampleGroups(e, null, P, C), !(typeof d > "u")) {
         for (r = 0; r < d.sample_sizes.length; r++) {
-          var I = {};
-          I.number = r, I.track_id = e.tkhd.track_id, I.timescale = e.mdia.mdhd.timescale, I.alreadyRead = 0, e.samples[r] = I, I.size = d.sample_sizes[r], e.samples_size += I.size, r === 0 ? (M = 1, z = 0, I.chunk_index = M, I.chunk_run_index = z, K = f.samples_per_chunk[z], V = 0, z + 1 < f.first_chunk.length ? j = f.first_chunk[z + 1] - 1 : j = 1 / 0) : r < K ? (I.chunk_index = M, I.chunk_run_index = z) : (M++, I.chunk_index = M, V = 0, M <= j || (z++, z + 1 < f.first_chunk.length ? j = f.first_chunk[z + 1] - 1 : j = 1 / 0), I.chunk_run_index = z, K += f.samples_per_chunk[z]), I.description_index = f.sample_description_index[I.chunk_run_index] - 1, I.description = w.entries[I.description_index], I.offset = s.chunk_offsets[I.chunk_index - 1] + V, V += I.size, r > ee && (J++, ee < 0 && (ee = 0), ee += p.sample_counts[J]), r > 0 ? (e.samples[r - 1].duration = p.sample_deltas[J], e.samples_duration += e.samples[r - 1].duration, I.dts = e.samples[r - 1].dts + e.samples[r - 1].duration) : I.dts = 0, m ? (r >= X && (ne++, X < 0 && (X = 0), X += m.sample_counts[ne]), I.cts = e.samples[r].dts + m.sample_offsets[ne]) : I.cts = I.dts, b ? (r == b.sample_numbers[B] - 1 ? (I.is_sync = !0, B++) : (I.is_sync = !1, I.degradation_priority = 0), U && U.entries[P].sample_delta + k == r + 1 && (I.subsamples = U.entries[P].subsamples, k += U.entries[P].sample_delta, P++)) : I.is_sync = !0, t.process_sdtp(e.mdia.minf.stbl.sdtp, I, I.number), $ ? I.degradation_priority = $.priority[r] : I.degradation_priority = 0, U && U.entries[P].sample_delta + k == r && (I.subsamples = U.entries[P].subsamples, k += U.entries[P].sample_delta), (A.length > 0 || C.length > 0) && t.setSampleGroupProperties(e, I, r, e.sample_groups_info);
+          var T = {};
+          T.number = r, T.track_id = e.tkhd.track_id, T.timescale = e.mdia.mdhd.timescale, T.alreadyRead = 0, e.samples[r] = T, T.size = d.sample_sizes[r], e.samples_size += T.size, r === 0 ? (M = 1, z = 0, T.chunk_index = M, T.chunk_run_index = z, K = f.samples_per_chunk[z], V = 0, z + 1 < f.first_chunk.length ? G = f.first_chunk[z + 1] - 1 : G = 1 / 0) : r < K ? (T.chunk_index = M, T.chunk_run_index = z) : (M++, T.chunk_index = M, V = 0, M <= G || (z++, z + 1 < f.first_chunk.length ? G = f.first_chunk[z + 1] - 1 : G = 1 / 0), T.chunk_run_index = z, K += f.samples_per_chunk[z]), T.description_index = f.sample_description_index[T.chunk_run_index] - 1, T.description = w.entries[T.description_index], T.offset = s.chunk_offsets[T.chunk_index - 1] + V, V += T.size, r > ee && (J++, ee < 0 && (ee = 0), ee += p.sample_counts[J]), r > 0 ? (e.samples[r - 1].duration = p.sample_deltas[J], e.samples_duration += e.samples[r - 1].duration, T.dts = e.samples[r - 1].dts + e.samples[r - 1].duration) : T.dts = 0, m ? (r >= X && (ne++, X < 0 && (X = 0), X += m.sample_counts[ne]), T.cts = e.samples[r].dts + m.sample_offsets[ne]) : T.cts = T.dts, b ? (r == b.sample_numbers[B] - 1 ? (T.is_sync = !0, B++) : (T.is_sync = !1, T.degradation_priority = 0), U && U.entries[A].sample_delta + k == r + 1 && (T.subsamples = U.entries[A].subsamples, k += U.entries[A].sample_delta, A++)) : T.is_sync = !0, t.process_sdtp(e.mdia.minf.stbl.sdtp, T, T.number), O ? T.degradation_priority = O.priority[r] : T.degradation_priority = 0, U && U.entries[A].sample_delta + k == r && (T.subsamples = U.entries[A].subsamples, k += U.entries[A].sample_delta), (P.length > 0 || C.length > 0) && t.setSampleGroupProperties(e, T, r, e.sample_groups_info);
         }
         r > 0 && (e.samples[r - 1].duration = Math.max(e.mdia.mdhd.duration - e.samples[r - 1].dts, 0), e.samples_duration += e.samples[r - 1].duration);
       }
     }, t.prototype.updateSampleLists = function() {
-      var e, r, s, f, d, p, m, b, w, U, A, C, $, z, M;
+      var e, r, s, f, d, p, m, b, w, U, P, C, O, z, M;
       if (this.moov !== void 0) {
         for (; this.lastMoofIndex < this.moofs.length; )
           if (w = this.moofs[this.lastMoofIndex], this.lastMoofIndex++, w.type == "moof")
             for (U = w, e = 0; e < U.trafs.length; e++) {
-              for (A = U.trafs[e], C = this.getTrackById(A.tfhd.track_id), C.samples == null && (C.samples = []), $ = this.getTrexById(A.tfhd.track_id), A.tfhd.flags & n.TFHD_FLAG_SAMPLE_DESC ? f = A.tfhd.default_sample_description_index : f = $ ? $.default_sample_description_index : 1, A.tfhd.flags & n.TFHD_FLAG_SAMPLE_DUR ? d = A.tfhd.default_sample_duration : d = $ ? $.default_sample_duration : 0, A.tfhd.flags & n.TFHD_FLAG_SAMPLE_SIZE ? p = A.tfhd.default_sample_size : p = $ ? $.default_sample_size : 0, A.tfhd.flags & n.TFHD_FLAG_SAMPLE_FLAGS ? m = A.tfhd.default_sample_flags : m = $ ? $.default_sample_flags : 0, A.sample_number = 0, A.sbgps.length > 0 && t.initSampleGroups(C, A, A.sbgps, C.mdia.minf.stbl.sgpds, A.sgpds), r = 0; r < A.truns.length; r++) {
-                var j = A.truns[r];
-                for (s = 0; s < j.sample_count; s++) {
-                  z = {}, z.moof_number = this.lastMoofIndex, z.number_in_traf = A.sample_number, A.sample_number++, z.number = C.samples.length, A.first_sample_index = C.samples.length, C.samples.push(z), z.track_id = C.tkhd.track_id, z.timescale = C.mdia.mdhd.timescale, z.description_index = f - 1, z.description = C.mdia.minf.stbl.stsd.entries[z.description_index], z.size = p, j.flags & n.TRUN_FLAGS_SIZE && (z.size = j.sample_size[s]), C.samples_size += z.size, z.duration = d, j.flags & n.TRUN_FLAGS_DURATION && (z.duration = j.sample_duration[s]), C.samples_duration += z.duration, C.first_traf_merged || s > 0 ? z.dts = C.samples[C.samples.length - 2].dts + C.samples[C.samples.length - 2].duration : (A.tfdt ? z.dts = A.tfdt.baseMediaDecodeTime : z.dts = 0, C.first_traf_merged = !0), z.cts = z.dts, j.flags & n.TRUN_FLAGS_CTS_OFFSET && (z.cts = z.dts + j.sample_composition_time_offset[s]), M = m, j.flags & n.TRUN_FLAGS_FLAGS ? M = j.sample_flags[s] : s === 0 && j.flags & n.TRUN_FLAGS_FIRST_FLAG && (M = j.first_sample_flags), z.is_sync = !(M >> 16 & 1), z.is_leading = M >> 26 & 3, z.depends_on = M >> 24 & 3, z.is_depended_on = M >> 22 & 3, z.has_redundancy = M >> 20 & 3, z.degradation_priority = M & 65535;
-                  var V = !!(A.tfhd.flags & n.TFHD_FLAG_BASE_DATA_OFFSET), K = !!(A.tfhd.flags & n.TFHD_FLAG_DEFAULT_BASE_IS_MOOF), ee = !!(j.flags & n.TRUN_FLAGS_DATA_OFFSET), J = 0;
-                  V ? J = A.tfhd.base_data_offset : K || r === 0 ? J = U.start : J = b, r === 0 && s === 0 ? ee ? z.offset = J + j.data_offset : z.offset = J : z.offset = b, b = z.offset + z.size, (A.sbgps.length > 0 || A.sgpds.length > 0 || C.mdia.minf.stbl.sbgps.length > 0 || C.mdia.minf.stbl.sgpds.length > 0) && t.setSampleGroupProperties(C, z, z.number_in_traf, A.sample_groups_info);
+              for (P = U.trafs[e], C = this.getTrackById(P.tfhd.track_id), C.samples == null && (C.samples = []), O = this.getTrexById(P.tfhd.track_id), P.tfhd.flags & n.TFHD_FLAG_SAMPLE_DESC ? f = P.tfhd.default_sample_description_index : f = O ? O.default_sample_description_index : 1, P.tfhd.flags & n.TFHD_FLAG_SAMPLE_DUR ? d = P.tfhd.default_sample_duration : d = O ? O.default_sample_duration : 0, P.tfhd.flags & n.TFHD_FLAG_SAMPLE_SIZE ? p = P.tfhd.default_sample_size : p = O ? O.default_sample_size : 0, P.tfhd.flags & n.TFHD_FLAG_SAMPLE_FLAGS ? m = P.tfhd.default_sample_flags : m = O ? O.default_sample_flags : 0, P.sample_number = 0, P.sbgps.length > 0 && t.initSampleGroups(C, P, P.sbgps, C.mdia.minf.stbl.sgpds, P.sgpds), r = 0; r < P.truns.length; r++) {
+                var G = P.truns[r];
+                for (s = 0; s < G.sample_count; s++) {
+                  z = {}, z.moof_number = this.lastMoofIndex, z.number_in_traf = P.sample_number, P.sample_number++, z.number = C.samples.length, P.first_sample_index = C.samples.length, C.samples.push(z), z.track_id = C.tkhd.track_id, z.timescale = C.mdia.mdhd.timescale, z.description_index = f - 1, z.description = C.mdia.minf.stbl.stsd.entries[z.description_index], z.size = p, G.flags & n.TRUN_FLAGS_SIZE && (z.size = G.sample_size[s]), C.samples_size += z.size, z.duration = d, G.flags & n.TRUN_FLAGS_DURATION && (z.duration = G.sample_duration[s]), C.samples_duration += z.duration, C.first_traf_merged || s > 0 ? z.dts = C.samples[C.samples.length - 2].dts + C.samples[C.samples.length - 2].duration : (P.tfdt ? z.dts = P.tfdt.baseMediaDecodeTime : z.dts = 0, C.first_traf_merged = !0), z.cts = z.dts, G.flags & n.TRUN_FLAGS_CTS_OFFSET && (z.cts = z.dts + G.sample_composition_time_offset[s]), M = m, G.flags & n.TRUN_FLAGS_FLAGS ? M = G.sample_flags[s] : s === 0 && G.flags & n.TRUN_FLAGS_FIRST_FLAG && (M = G.first_sample_flags), z.is_sync = !(M >> 16 & 1), z.is_leading = M >> 26 & 3, z.depends_on = M >> 24 & 3, z.is_depended_on = M >> 22 & 3, z.has_redundancy = M >> 20 & 3, z.degradation_priority = M & 65535;
+                  var V = !!(P.tfhd.flags & n.TFHD_FLAG_BASE_DATA_OFFSET), K = !!(P.tfhd.flags & n.TFHD_FLAG_DEFAULT_BASE_IS_MOOF), ee = !!(G.flags & n.TRUN_FLAGS_DATA_OFFSET), J = 0;
+                  V ? J = P.tfhd.base_data_offset : K || r === 0 ? J = U.start : J = b, r === 0 && s === 0 ? ee ? z.offset = J + G.data_offset : z.offset = J : z.offset = b, b = z.offset + z.size, (P.sbgps.length > 0 || P.sgpds.length > 0 || C.mdia.minf.stbl.sbgps.length > 0 || C.mdia.minf.stbl.sgpds.length > 0) && t.setSampleGroupProperties(C, z, z.number_in_traf, P.sample_groups_info);
                 }
               }
-              if (A.subs) {
+              if (P.subs) {
                 C.has_fragment_subsamples = !0;
-                var X = A.first_sample_index;
-                for (r = 0; r < A.subs.entries.length; r++)
-                  X += A.subs.entries[r].sample_delta, z = C.samples[X - 1], z.subsamples = A.subs.entries[r].subsamples;
+                var X = P.first_sample_index;
+                for (r = 0; r < P.subs.entries.length; r++)
+                  X += P.subs.entries[r].sample_delta, z = C.samples[X - 1], z.subsamples = P.subs.entries[r].subsamples;
               }
             }
       }
@@ -14001,13 +14005,13 @@ function ic() {
           for (var w = 0; w < p.iprp.ipmas.length; w++) {
             var U = p.iprp.ipmas[w];
             for (s = 0; s < U.associations.length; s++) {
-              var A = U.associations[s];
-              if (d = e[A.id], d || (d = r[A.id]), d)
-                for (d.properties === void 0 && (d.properties = {}, d.properties.boxes = []), f = 0; f < A.props.length; f++) {
-                  var C = A.props[f];
+              var P = U.associations[s];
+              if (d = e[P.id], d || (d = r[P.id]), d)
+                for (d.properties === void 0 && (d.properties = {}, d.properties.boxes = []), f = 0; f < P.props.length; f++) {
+                  var C = P.props[f];
                   if (C.property_index > 0 && C.property_index - 1 < p.iprp.ipco.boxes.length) {
-                    var $ = p.iprp.ipco.boxes[C.property_index - 1];
-                    d.properties[$.type] = $, d.properties.boxes.push($);
+                    var O = p.iprp.ipco.boxes[C.property_index - 1];
+                    d.properties[O.type] = O, d.properties.boxes.push(O);
                   }
                 }
             }