@video-editor/protocol 0.0.1-beta.22 → 0.0.1-beta.24

package/dist/index.js

@@ -255,7 +255,7 @@ function Ln() {
   })(Or)), Or;
 }
 var $n;
-function Z() {
+function X() {
   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,36 +302,36 @@ function Z() {
       optimizeNodes() {
         return this;
       }
-      optimizeNames(x, I) {
+      optimizeNames(x, A) {
         return this;
       }
     }
     class g extends h {
-      constructor(x, I, D) {
-        super(), this.varKind = x, this.name = I, this.rhs = D;
+      constructor(x, A, B) {
+        super(), this.varKind = x, this.name = A, this.rhs = B;
       }
-      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};` + I;
+      render({ es5: x, _n: A }) {
+        const B = x ? c.varKinds.var : this.varKind, O = this.rhs === void 0 ? "" : ` = ${this.rhs}`;
+        return `${B} ${this.name}${O};` + A;
       }
-      optimizeNames(x, I) {
+      optimizeNames(x, A) {
         if (x[this.name.str])
-          return this.rhs && (this.rhs = V(this.rhs, x, I)), this;
+          return this.rhs && (this.rhs = H(this.rhs, x, A)), this;
       }
       get names() {
         return this.rhs instanceof o._CodeOrName ? this.rhs.names : {};
       }
     }
     class n extends h {
-      constructor(x, I, D) {
-        super(), this.lhs = x, this.rhs = I, this.sideEffects = D;
+      constructor(x, A, B) {
+        super(), this.lhs = x, this.rhs = A, this.sideEffects = B;
       }
       render({ _n: x }) {
         return `${this.lhs} = ${this.rhs};` + x;
       }
-      optimizeNames(x, I) {
+      optimizeNames(x, A) {
         if (!(this.lhs instanceof o.Name && !x[this.lhs.str] && !this.sideEffects))
-          return this.rhs = V(this.rhs, x, I), this;
+          return this.rhs = H(this.rhs, x, A), this;
       }
       get names() {
         const x = this.lhs instanceof o.Name ? {} : { ...this.lhs.names };
@@ -339,8 +339,8 @@ function Z() {
       }
     }
     class v extends n {
-      constructor(x, I, D, N) {
-        super(x, D, N), this.op = I;
+      constructor(x, A, B, O) {
+        super(x, B, O), this.op = A;
       }
       render({ _n: x }) {
         return `${this.lhs} ${this.op}= ${this.rhs};` + x;
@@ -383,8 +383,8 @@ function Z() {
       optimizeNodes() {
         return `${this.code}` ? this : void 0;
       }
-      optimizeNames(x, I) {
-        return this.code = V(this.code, x, I), this;
+      optimizeNames(x, A) {
+        return this.code = H(this.code, x, A), this;
       }
       get names() {
         return this.code instanceof o._CodeOrName ? this.code.names : {};
@@ -395,28 +395,28 @@ function Z() {
         super(), this.nodes = x;
       }
       render(x) {
-        return this.nodes.reduce((I, D) => I + D.render(x), "");
+        return this.nodes.reduce((A, B) => A + B.render(x), "");
       }
       optimizeNodes() {
         const { nodes: x } = this;
-        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);
+        let A = x.length;
+        for (; A--; ) {
+          const B = x[A].optimizeNodes();
+          Array.isArray(B) ? x.splice(A, 1, ...B) : B ? x[A] = B : x.splice(A, 1);
         }
         return x.length > 0 ? this : void 0;
       }
-      optimizeNames(x, I) {
-        const { nodes: D } = this;
-        let N = D.length;
-        for (; N--; ) {
-          const L = D[N];
-          L.optimizeNames(x, I) || (K(x, L.names), D.splice(N, 1));
+      optimizeNames(x, A) {
+        const { nodes: B } = this;
+        let O = B.length;
+        for (; O--; ) {
+          const N = B[O];
+          N.optimizeNames(x, A) || (W(x, N.names), B.splice(O, 1));
         }
-        return D.length > 0 ? this : void 0;
+        return B.length > 0 ? this : void 0;
       }
       get names() {
-        return this.nodes.reduce((x, I) => M(x, I.names), {});
+        return this.nodes.reduce((x, A) => M(x, A.names), {});
       }
     }
     class e extends a {
@@ -430,32 +430,32 @@ function Z() {
     }
     s.kind = "else";
     class f extends e {
-      constructor(x, I) {
-        super(I), this.condition = x;
+      constructor(x, A) {
+        super(A), this.condition = x;
       }
       render(x) {
-        let I = `if(${this.condition})` + super.render(x);
-        return this.else && (I += "else " + this.else.render(x)), I;
+        let A = `if(${this.condition})` + super.render(x);
+        return this.else && (A += "else " + this.else.render(x)), A;
       }
       optimizeNodes() {
         super.optimizeNodes();
         const x = this.condition;
         if (x === !0)
           return this.nodes;
-        let I = this.else;
-        if (I) {
-          const D = I.optimizeNodes();
-          I = this.else = Array.isArray(D) ? new s(D) : D;
+        let A = this.else;
+        if (A) {
+          const B = A.optimizeNodes();
+          A = this.else = Array.isArray(B) ? new s(B) : B;
         }
-        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 (A)
+          return x === !1 ? A instanceof f ? A : A.nodes : this.nodes.length ? this : new f(Q(x), A instanceof f ? [A] : A.nodes);
         if (!(x === !1 || !this.nodes.length))
           return this;
       }
-      optimizeNames(x, I) {
-        var D;
-        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;
+      optimizeNames(x, A) {
+        var B;
+        if (this.else = (B = this.else) === null || B === void 0 ? void 0 : B.optimizeNames(x, A), !!(super.optimizeNames(x, A) || this.else))
+          return this.condition = H(this.condition, x, A), this;
       }
       get names() {
         const x = super.names;
@@ -473,21 +473,21 @@ function Z() {
       render(x) {
         return `for(${this.iteration})` + super.render(x);
       }
-      optimizeNames(x, I) {
-        if (super.optimizeNames(x, I))
-          return this.iteration = V(this.iteration, x, I), this;
+      optimizeNames(x, A) {
+        if (super.optimizeNames(x, A))
+          return this.iteration = H(this.iteration, x, A), this;
       }
       get names() {
         return M(super.names, this.iteration.names);
       }
     }
     class m extends d {
-      constructor(x, I, D, N) {
-        super(), this.varKind = x, this.name = I, this.from = D, this.to = N;
+      constructor(x, A, B, O) {
+        super(), this.varKind = x, this.name = A, this.from = B, this.to = O;
       }
       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);
+        const A = x.es5 ? c.varKinds.var : this.varKind, { name: B, from: O, to: N } = this;
+        return `for(${A} ${B}=${O}; ${B}<${N}; ${B}++)` + super.render(x);
       }
       get names() {
         const x = G(super.names, this.from);
@@ -495,23 +495,23 @@ function Z() {
       }
     }
     class b extends d {
-      constructor(x, I, D, N) {
-        super(), this.loop = x, this.varKind = I, this.name = D, this.iterable = N;
+      constructor(x, A, B, O) {
+        super(), this.loop = x, this.varKind = A, this.name = B, this.iterable = O;
       }
       render(x) {
         return `for(${this.varKind} ${this.name} ${this.loop} ${this.iterable})` + super.render(x);
       }
-      optimizeNames(x, I) {
-        if (super.optimizeNames(x, I))
-          return this.iterable = V(this.iterable, x, I), this;
+      optimizeNames(x, A) {
+        if (super.optimizeNames(x, A))
+          return this.iterable = H(this.iterable, x, A), this;
       }
       get names() {
         return M(super.names, this.iterable.names);
       }
     }
     class w extends e {
-      constructor(x, I, D) {
-        super(), this.name = x, this.args = I, this.async = D;
+      constructor(x, A, B) {
+        super(), this.name = x, this.args = A, this.async = B;
       }
       render(x) {
         return `${this.async ? "async " : ""}function ${this.name}(${this.args})` + super.render(x);
@@ -526,16 +526,16 @@ function Z() {
     U.kind = "return";
     class P extends e {
       render(x) {
-        let I = "try" + super.render(x);
-        return this.catch && (I += this.catch.render(x)), this.finally && (I += this.finally.render(x)), I;
+        let A = "try" + super.render(x);
+        return this.catch && (A += this.catch.render(x)), this.finally && (A += this.finally.render(x)), A;
       }
       optimizeNodes() {
-        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;
+        var x, A;
+        return super.optimizeNodes(), (x = this.catch) === null || x === void 0 || x.optimizeNodes(), (A = this.finally) === null || A === void 0 || A.optimizeNodes(), this;
       }
-      optimizeNames(x, I) {
-        var D, N;
-        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;
+      optimizeNames(x, A) {
+        var B, O;
+        return super.optimizeNames(x, A), (B = this.catch) === null || B === void 0 || B.optimizeNames(x, A), (O = this.finally) === null || O === void 0 || O.optimizeNames(x, A), this;
       }
       get names() {
         const x = super.names;
@@ -551,15 +551,15 @@ function Z() {
       }
     }
     C.kind = "catch";
-    class O extends e {
+    class L extends e {
       render(x) {
         return "finally" + super.render(x);
       }
     }
-    O.kind = "finally";
-    class z {
-      constructor(x, I = {}) {
-        this._values = {}, this._blockStarts = [], this._constants = {}, this.opts = { ...I, _n: I.lines ? `
+    L.kind = "finally";
+    class F {
+      constructor(x, A = {}) {
+        this._values = {}, this._blockStarts = [], this._constants = {}, this.opts = { ...A, _n: A.lines ? `
 ` : "" }, this._extScope = x, this._scope = new c.Scope({ parent: x }), this._nodes = [new r()];
       }
       toString() {
@@ -574,12 +574,12 @@ function Z() {
         return this._extScope.name(x);
       }
       // reserves unique name in the external scope and assigns value to it
-      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;
+      scopeValue(x, A) {
+        const B = this._extScope.value(x, A);
+        return (this._values[B.prefix] || (this._values[B.prefix] = /* @__PURE__ */ new Set())).add(B), B;
       }
-      getScopeValue(x, I) {
-        return this._extScope.getValue(x, I);
+      getScopeValue(x, A) {
+        return this._extScope.getValue(x, A);
       }
       // 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 Z() {
       scopeCode() {
         return this._extScope.scopeCode(this._values);
       }
-      _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;
+      _def(x, A, B, O) {
+        const N = this._scope.toName(A);
+        return B !== void 0 && O && (this._constants[N.str] = B), this._leafNode(new g(x, N, B)), N;
       }
       // `const` declaration (`var` in es5 mode)
-      const(x, I, D) {
-        return this._def(c.varKinds.const, x, I, D);
+      const(x, A, B) {
+        return this._def(c.varKinds.const, x, A, B);
       }
       // `let` declaration with optional assignment (`var` in es5 mode)
-      let(x, I, D) {
-        return this._def(c.varKinds.let, x, I, D);
+      let(x, A, B) {
+        return this._def(c.varKinds.let, x, A, B);
       }
       // `var` declaration with optional assignment
-      var(x, I, D) {
-        return this._def(c.varKinds.var, x, I, D);
+      var(x, A, B) {
+        return this._def(c.varKinds.var, x, A, B);
       }
       // assignment code
-      assign(x, I, D) {
-        return this._leafNode(new n(x, I, D));
+      assign(x, A, B) {
+        return this._leafNode(new n(x, A, B));
       }
       // `+=` code
-      add(x, I) {
-        return this._leafNode(new v(x, l.operators.ADD, I));
+      add(x, A) {
+        return this._leafNode(new v(x, l.operators.ADD, A));
       }
       // appends passed SafeExpr to code or executes Block
       code(x) {
@@ -619,18 +619,18 @@ function Z() {
       }
       // returns code for object literal for the passed argument list of key-value pairs
       object(...x) {
-        const I = ["{"];
-        for (const [D, N] of x)
-          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);
+        const A = ["{"];
+        for (const [B, O] of x)
+          A.length > 1 && A.push(","), A.push(B), (B !== O || this.opts.es5) && (A.push(":"), (0, o.addCodeArg)(A, O));
+        return A.push("}"), new o._Code(A);
       }
       // `if` clause (or statement if `thenBody` and, optionally, `elseBody` are passed)
-      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)
+      if(x, A, B) {
+        if (this._blockNode(new f(x)), A && B)
+          this.code(A).else().code(B).endIf();
+        else if (A)
+          this.code(A).endIf();
+        else if (B)
           throw new Error('CodeGen: "else" body without "then" body');
         return this;
       }
@@ -646,36 +646,36 @@ function Z() {
       endIf() {
         return this._endBlockNode(f, s);
       }
-      _for(x, I) {
-        return this._blockNode(x), I && this.code(I).endFor(), this;
+      _for(x, A) {
+        return this._blockNode(x), A && this.code(A).endFor(), this;
       }
       // a generic `for` clause (or statement if `forBody` is passed)
-      for(x, I) {
-        return this._for(new p(x), I);
+      for(x, A) {
+        return this._for(new p(x), A);
       }
       // `for` statement for a range of values
-      forRange(x, I, D, N, L = this.opts.es5 ? c.varKinds.var : c.varKinds.let) {
+      forRange(x, A, B, O, N = this.opts.es5 ? c.varKinds.var : c.varKinds.let) {
         const q = this._scope.toName(x);
-        return this._for(new m(L, q, I, D), () => N(q));
+        return this._for(new m(N, q, A, B), () => O(q));
       }
       // `for-of` statement (in es5 mode replace with a normal for loop)
-      forOf(x, I, D, N = c.varKinds.const) {
-        const L = this._scope.toName(x);
+      forOf(x, A, B, O = c.varKinds.const) {
+        const N = this._scope.toName(x);
         if (this.opts.es5) {
-          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);
+          const q = A instanceof o.Name ? A : this.var("_arr", A);
+          return this.forRange("_i", 0, (0, o._)`${q}.length`, (K) => {
+            this.var(N, (0, o._)`${q}[${K}]`), B(N);
           });
         }
-        return this._for(new b("of", N, L, I), () => D(L));
+        return this._for(new b("of", O, N, A), () => B(N));
       }
       // `for-in` statement.
       // With option `ownProperties` replaced with a `for-of` loop for object keys
-      forIn(x, I, D, N = this.opts.es5 ? c.varKinds.var : c.varKinds.const) {
+      forIn(x, A, B, O = this.opts.es5 ? c.varKinds.var : c.varKinds.const) {
         if (this.opts.ownProperties)
-          return this.forOf(x, (0, o._)`Object.keys(${I})`, D);
-        const L = this._scope.toName(x);
-        return this._for(new b("in", N, L, I), () => D(L));
+          return this.forOf(x, (0, o._)`Object.keys(${A})`, B);
+        const N = this._scope.toName(x);
+        return this._for(new b("in", O, N, A), () => B(N));
       }
       // end `for` loop
       endFor() {
@@ -691,43 +691,43 @@ function Z() {
       }
       // `return` statement
       return(x) {
-        const I = new U();
-        if (this._blockNode(I), this.code(x), I.nodes.length !== 1)
+        const A = new U();
+        if (this._blockNode(A), this.code(x), A.nodes.length !== 1)
           throw new Error('CodeGen: "return" should have one node');
         return this._endBlockNode(U);
       }
       // `try` statement
-      try(x, I, D) {
-        if (!I && !D)
+      try(x, A, B) {
+        if (!A && !B)
           throw new Error('CodeGen: "try" without "catch" and "finally"');
-        const N = new P();
-        if (this._blockNode(N), this.code(x), I) {
-          const L = this.name("e");
-          this._currNode = N.catch = new C(L), I(L);
+        const O = new P();
+        if (this._blockNode(O), this.code(x), A) {
+          const N = this.name("e");
+          this._currNode = O.catch = new C(N), A(N);
         }
-        return D && (this._currNode = N.finally = new O(), this.code(D)), this._endBlockNode(C, O);
+        return B && (this._currNode = O.finally = new L(), this.code(B)), this._endBlockNode(C, L);
       }
       // `throw` statement
       throw(x) {
         return this._leafNode(new E(x));
       }
       // start self-balancing block
-      block(x, I) {
-        return this._blockStarts.push(this._nodes.length), x && this.code(x).endBlock(I), this;
+      block(x, A) {
+        return this._blockStarts.push(this._nodes.length), x && this.code(x).endBlock(A), this;
       }
       // end the current self-balancing block
       endBlock(x) {
-        const I = this._blockStarts.pop();
-        if (I === void 0)
+        const A = this._blockStarts.pop();
+        if (A === void 0)
           throw new Error("CodeGen: not in self-balancing block");
-        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 = I, this;
+        const B = this._nodes.length - A;
+        if (B < 0 || x !== void 0 && B !== x)
+          throw new Error(`CodeGen: wrong number of nodes: ${B} vs ${x} expected`);
+        return this._nodes.length = A, this;
       }
       // `function` heading (or definition if funcBody is passed)
-      func(x, I = o.nil, D, N) {
-        return this._blockNode(new w(x, I, D)), N && this.code(N).endFunc(), this;
+      func(x, A = o.nil, B, O) {
+        return this._blockNode(new w(x, A, B)), O && this.code(O).endFunc(), this;
       }
       // end function definition
       endFunc() {
@@ -743,17 +743,17 @@ function Z() {
       _blockNode(x) {
         this._currNode.nodes.push(x), this._nodes.push(x);
       }
-      _endBlockNode(x, I) {
-        const D = this._currNode;
-        if (D instanceof x || I && D instanceof I)
+      _endBlockNode(x, A) {
+        const B = this._currNode;
+        if (B instanceof x || A && B instanceof A)
           return this._nodes.pop(), this;
-        throw new Error(`CodeGen: not in block "${I ? `${x.kind}/${I.kind}` : x.kind}"`);
+        throw new Error(`CodeGen: not in block "${A ? `${x.kind}/${A.kind}` : x.kind}"`);
       }
       _elseNode(x) {
-        const I = this._currNode;
-        if (!(I instanceof f))
+        const A = this._currNode;
+        if (!(A instanceof f))
           throw new Error('CodeGen: "else" without "if"');
-        return this._currNode = I.else = x, this;
+        return this._currNode = A.else = x, this;
       }
       get _root() {
         return this._nodes[0];
@@ -763,84 +763,84 @@ function Z() {
         return x[x.length - 1];
       }
       set _currNode(x) {
-        const I = this._nodes;
-        I[I.length - 1] = x;
+        const A = this._nodes;
+        A[A.length - 1] = x;
       }
     }
-    l.CodeGen = z;
+    l.CodeGen = F;
     function M(T, x) {
-      for (const I in x)
-        T[I] = (T[I] || 0) + (x[I] || 0);
+      for (const A in x)
+        T[A] = (T[A] || 0) + (x[A] || 0);
       return T;
     }
     function G(T, x) {
       return x instanceof o._CodeOrName ? M(T, x.names) : T;
     }
-    function V(T, x, I) {
+    function H(T, x, A) {
       if (T instanceof o.Name)
-        return D(T);
-      if (!N(T))
+        return B(T);
+      if (!O(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 = I[L.str];
-        return q === void 0 || x[L.str] !== 1 ? L : (delete x[L.str], q);
+      return new o._Code(T._items.reduce((N, q) => (q instanceof o.Name && (q = B(q)), q instanceof o._Code ? N.push(...q._items) : N.push(q), N), []));
+      function B(N) {
+        const q = A[N.str];
+        return q === void 0 || x[N.str] !== 1 ? N : (delete x[N.str], q);
       }
-      function N(L) {
-        return L instanceof o._Code && L._items.some((q) => q instanceof o.Name && x[q.str] === 1 && I[q.str] !== void 0);
+      function O(N) {
+        return N instanceof o._Code && N._items.some((q) => q instanceof o.Name && x[q.str] === 1 && A[q.str] !== void 0);
       }
     }
-    function K(T, x) {
-      for (const I in x)
-        T[I] = (T[I] || 0) - (x[I] || 0);
+    function W(T, x) {
+      for (const A in x)
+        T[A] = (T[A] || 0) - (x[A] || 0);
     }
-    function ee(T) {
+    function Q(T) {
       return typeof T == "boolean" || typeof T == "number" || T === null ? !T : (0, o._)`!${k(T)}`;
     }
-    l.not = ee;
-    const J = A(l.operators.AND);
-    function X(...T) {
-      return T.reduce(J);
+    l.not = Q;
+    const ie = I(l.operators.AND);
+    function J(...T) {
+      return T.reduce(ie);
     }
-    l.and = X;
-    const ne = A(l.operators.OR);
-    function B(...T) {
-      return T.reduce(ne);
+    l.and = J;
+    const j = I(l.operators.OR);
+    function D(...T) {
+      return T.reduce(j);
     }
-    l.or = B;
-    function A(T) {
-      return (x, I) => x === o.nil ? I : I === o.nil ? x : (0, o._)`${k(x)} ${T} ${k(I)}`;
+    l.or = D;
+    function I(T) {
+      return (x, A) => x === o.nil ? A : A === o.nil ? x : (0, o._)`${k(x)} ${T} ${k(A)}`;
     }
     function k(T) {
       return T instanceof o.Name ? T : (0, o._)`(${T})`;
     }
   })(Lr)), Lr;
 }
-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 = Z(), o = Gt();
+var ee = {}, On;
+function ne() {
+  if (On) return ee;
+  On = 1, Object.defineProperty(ee, "__esModule", { value: !0 }), ee.checkStrictMode = ee.getErrorPath = ee.Type = ee.useFunc = ee.setEvaluated = ee.evaluatedPropsToName = ee.mergeEvaluated = ee.eachItem = ee.unescapeJsonPointer = ee.escapeJsonPointer = ee.escapeFragment = ee.unescapeFragment = ee.schemaRefOrVal = ee.schemaHasRulesButRef = ee.schemaHasRules = ee.checkUnknownRules = ee.alwaysValidSchema = ee.toHash = void 0;
+  const l = X(), o = Gt();
   function c(b) {
     const w = {};
     for (const U of b)
       w[U] = !0;
     return w;
   }
-  Q.toHash = c;
+  ee.toHash = c;
   function u(b, w) {
     return typeof w == "boolean" ? w : Object.keys(w).length === 0 ? !0 : (_(b, w), !h(w, b.self.RULES.all));
   }
-  Q.alwaysValidSchema = u;
+  ee.alwaysValidSchema = u;
   function _(b, w = b.schema) {
     const { opts: U, self: P } = b;
     if (!U.strictSchema || typeof w == "boolean")
       return;
     const C = P.RULES.keywords;
-    for (const O in w)
-      C[O] || m(b, `unknown keyword: "${O}"`);
+    for (const L in w)
+      C[L] || m(b, `unknown keyword: "${L}"`);
   }
-  Q.checkUnknownRules = _;
+  ee.checkUnknownRules = _;
   function h(b, w) {
     if (typeof b == "boolean")
       return !b;
@@ -849,7 +849,7 @@ function re() {
         return !0;
     return !1;
   }
-  Q.schemaHasRules = h;
+  ee.schemaHasRules = h;
   function g(b, w) {
     if (typeof b == "boolean")
       return !b;
@@ -858,7 +858,7 @@ function re() {
         return !0;
     return !1;
   }
-  Q.schemaHasRulesButRef = g;
+  ee.schemaHasRulesButRef = g;
   function n({ topSchemaRef: b, schemaPath: w }, U, P, C) {
     if (!C) {
       if (typeof U == "number" || typeof U == "boolean")
@@ -868,23 +868,23 @@ function re() {
     }
     return (0, l._)`${b}${w}${(0, l.getProperty)(P)}`;
   }
-  Q.schemaRefOrVal = n;
+  ee.schemaRefOrVal = n;
   function v(b) {
     return E(decodeURIComponent(b));
   }
-  Q.unescapeFragment = v;
+  ee.unescapeFragment = v;
   function S(b) {
     return encodeURIComponent(y(b));
   }
-  Q.escapeFragment = S;
+  ee.escapeFragment = S;
   function y(b) {
     return typeof b == "number" ? `${b}` : b.replace(/~/g, "~0").replace(/\//g, "~1");
   }
-  Q.escapeJsonPointer = y;
+  ee.escapeJsonPointer = y;
   function E(b) {
     return b.replace(/~1/g, "/").replace(/~0/g, "~");
   }
-  Q.unescapeJsonPointer = E;
+  ee.unescapeJsonPointer = E;
   function t(b, w) {
     if (Array.isArray(b))
       for (const U of b)
@@ -892,14 +892,14 @@ function re() {
     else
       w(b);
   }
-  Q.eachItem = t;
+  ee.eachItem = t;
   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 (C, L, F, M) => {
+      const G = F === void 0 ? L : F instanceof l.Name ? (L instanceof l.Name ? b(C, L, F) : w(C, L, F), F) : L instanceof l.Name ? (w(C, F, L), L) : U(L, F);
       return M === l.Name && !(G instanceof l.Name) ? P(C, G) : G;
     };
   }
-  Q.mergeEvaluated = {
+  ee.mergeEvaluated = {
     props: a({
       mergeNames: (b, w, U) => b.if((0, l._)`${U} !== true && ${w} !== undefined`, () => {
         b.if((0, l._)`${w} === true`, () => b.assign(U, !0), () => b.assign(U, (0, l._)`${U} || {}`).code((0, l._)`Object.assign(${U}, ${w})`));
@@ -923,11 +923,11 @@ function re() {
     const U = b.var("props", (0, l._)`{}`);
     return w !== void 0 && r(b, U, w), U;
   }
-  Q.evaluatedPropsToName = e;
+  ee.evaluatedPropsToName = e;
   function r(b, w, U) {
     Object.keys(U).forEach((P) => b.assign((0, l._)`${w}${(0, l.getProperty)(P)}`, !0));
   }
-  Q.setEvaluated = r;
+  ee.setEvaluated = r;
   const s = {};
   function f(b, w) {
     return b.scopeValue("func", {
@@ -935,11 +935,11 @@ function re() {
       code: s[w.code] || (s[w.code] = new o._Code(w.code))
     });
   }
-  Q.useFunc = f;
+  ee.useFunc = f;
   var d;
   (function(b) {
     b[b.Num = 0] = "Num", b[b.Str = 1] = "Str";
-  })(d || (Q.Type = d = {}));
+  })(d || (ee.Type = d = {}));
   function p(b, w, U) {
     if (b instanceof l.Name) {
       const P = w === d.Num;
@@ -947,7 +947,7 @@ function re() {
     }
     return U ? (0, l.getProperty)(b).toString() : "/" + y(b);
   }
-  Q.getErrorPath = p;
+  ee.getErrorPath = p;
   function m(b, w, U = b.opts.strictSchema) {
     if (U) {
       if (w = `strict mode: ${w}`, U === !0)
@@ -955,13 +955,13 @@ function re() {
       b.self.logger.warn(w);
     }
   }
-  return Q.checkStrictMode = m, Q;
+  return ee.checkStrictMode = m, ee;
 }
 var oi = {}, Nn;
 function De() {
   if (Nn) return oi;
   Nn = 1, Object.defineProperty(oi, "__esModule", { value: !0 });
-  const l = Z(), o = {
+  const l = X(), o = {
     // validation function arguments
     data: new l.Name("data"),
     // data passed to validation function
@@ -996,7 +996,7 @@ 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 = Z(), c = re(), u = De();
+    const o = X(), c = ne(), u = De();
     l.keywordError = {
       message: ({ keyword: s }) => (0, o.str)`must pass "${s}" keyword validation`
     }, l.keyword$DataError = {
@@ -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: 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]);
+      const { keyword: m, data: b, schemaValue: w, it: U } = s, { opts: P, propertyName: C, topSchemaRef: L, schemaPath: F } = 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._)`${L}${F}`], [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 = Z(), c = De(), u = {
+  const l = Xt(), o = X(), c = De(), u = {
     message: "boolean schema is false"
   };
   function _(n) {
@@ -1100,7 +1100,7 @@ function bl() {
   }
   return Ge;
 }
-var ce = {}, qe = {}, Gn;
+var pe = {}, qe = {}, Gn;
 function Co() {
   if (Gn) return qe;
   Gn = 1, Object.defineProperty(qe, "__esModule", { value: !0 }), qe.getRules = qe.isJSONType = void 0;
@@ -1147,13 +1147,13 @@ function ko() {
 }
 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 = Z(), _ = re();
+  if (Vn) return pe;
+  Vn = 1, Object.defineProperty(pe, "__esModule", { value: !0 }), pe.reportTypeError = pe.checkDataTypes = pe.checkDataType = pe.coerceAndCheckDataType = pe.getJSONTypes = pe.getSchemaTypes = pe.DataType = void 0;
+  const l = Co(), o = ko(), c = Xt(), u = X(), _ = ne();
   var h;
   (function(d) {
     d[d.Correct = 0] = "Correct", d[d.Wrong = 1] = "Wrong";
-  })(h || (ce.DataType = h = {}));
+  })(h || (pe.DataType = h = {}));
   function g(d) {
     const p = n(d.type);
     if (p.includes("null")) {
@@ -1166,14 +1166,14 @@ function yr() {
     }
     return p;
   }
-  ce.getSchemaTypes = g;
+  pe.getSchemaTypes = g;
   function n(d) {
     const p = Array.isArray(d) ? d : d ? [d] : [];
     if (p.every(l.isJSONType))
       return p;
     throw new Error("type must be JSONType or JSONType[]: " + p.join(","));
   }
-  ce.getJSONTypes = n;
+  pe.getJSONTypes = n;
   function v(d, p) {
     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) {
@@ -1184,7 +1184,7 @@ function yr() {
     }
     return P;
   }
-  ce.coerceAndCheckDataType = v;
+  pe.coerceAndCheckDataType = v;
   const S = /* @__PURE__ */ new Set(["string", "number", "integer", "boolean", "null"]);
   function y(d, p) {
     return p ? d.filter((m) => S.has(m) || p === "array" && m === "array") : [];
@@ -1192,13 +1192,13 @@ function yr() {
   function E(d, p, m) {
     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") && O(z);
+    for (const F of m)
+      (S.has(F) || F === "array" && U.coerceTypes === "array") && L(F);
     b.else(), s(d), b.endIf(), b.if((0, u._)`${C} !== undefined`, () => {
       b.assign(w, C), t(d, C);
     });
-    function O(z) {
-      switch (z) {
+    function L(F) {
+      switch (F) {
         case "string":
           b.elseIf((0, u._)`${P} == "number" || ${P} == "boolean"`).assign(C, (0, u._)`"" + ${w}`).elseIf((0, u._)`${w} === null`).assign(C, (0, u._)`""`);
           return;
@@ -1251,7 +1251,7 @@ function yr() {
       return (0, u.and)((0, u._)`typeof ${p} == "number"`, C, m ? (0, u._)`isFinite(${p})` : u.nil);
     }
   }
-  ce.checkDataType = a;
+  pe.checkDataType = a;
   function e(d, p, m, b) {
     if (d.length === 1)
       return a(d[0], p, m, b);
@@ -1267,7 +1267,7 @@ function yr() {
       w = (0, u.and)(w, a(P, p, m, b));
     return w;
   }
-  ce.checkDataTypes = e;
+  pe.checkDataTypes = e;
   const r = {
     message: ({ schema: d }) => `must be ${d}`,
     params: ({ schema: d, schemaValue: p }) => typeof d == "string" ? (0, u._)`{type: ${d}}` : (0, u._)`{type: ${p}}`
@@ -1276,7 +1276,7 @@ function yr() {
     const p = f(d);
     (0, c.reportError)(p, r);
   }
-  ce.reportTypeError = s;
+  pe.reportTypeError = s;
   function f(d) {
     const { gen: p, data: m, schema: b } = d, w = (0, _.schemaRefOrVal)(d, b, "type");
     return {
@@ -1291,13 +1291,13 @@ function yr() {
       it: d
     };
   }
-  return ce;
+  return pe;
 }
 var ct = {}, Hn;
 function wl() {
   if (Hn) return ct;
   Hn = 1, Object.defineProperty(ct, "__esModule", { value: !0 }), ct.assignDefaults = void 0;
-  const l = Z(), o = re();
+  const l = X(), o = ne();
   function c(_, h) {
     const { properties: g, items: n } = _.schema;
     if (h === "object" && g)
@@ -1320,26 +1320,26 @@ function wl() {
   }
   return ct;
 }
-var Ue = {}, se = {}, Yn;
+var Ue = {}, ae = {}, 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 = Z(), o = re(), c = De(), u = re();
+  if (Yn) return ae;
+  Yn = 1, Object.defineProperty(ae, "__esModule", { value: !0 }), ae.validateUnion = ae.validateArray = ae.usePattern = ae.callValidateCode = ae.schemaProperties = ae.allSchemaProperties = ae.noPropertyInData = ae.propertyInData = ae.isOwnProperty = ae.hasPropFunc = ae.reportMissingProp = ae.checkMissingProp = ae.checkReportMissingProp = void 0;
+  const l = X(), o = ne(), c = De(), u = ne();
   function _(d, p) {
     const { gen: m, data: b, it: w } = d;
     m.if(y(m, b, p, w.opts.ownProperties), () => {
       d.setParams({ missingProperty: (0, l._)`${p}` }, !0), d.error();
     });
   }
-  se.checkReportMissingProp = _;
+  ae.checkReportMissingProp = _;
   function h({ gen: d, data: p, it: { opts: m } }, b, w) {
     return (0, l.or)(...b.map((U) => (0, l.and)(y(d, p, U, m.ownProperties), (0, l._)`${w} = ${U}`)));
   }
-  se.checkMissingProp = h;
+  ae.checkMissingProp = h;
   function g(d, p) {
     d.setParams({ missingProperty: p }, !0), d.error();
   }
-  se.reportMissingProp = g;
+  ae.reportMissingProp = g;
   function n(d) {
     return d.scopeValue("func", {
       // eslint-disable-next-line @typescript-eslint/unbound-method
@@ -1347,41 +1347,41 @@ function Ee() {
       code: (0, l._)`Object.prototype.hasOwnProperty`
     });
   }
-  se.hasPropFunc = n;
+  ae.hasPropFunc = n;
   function v(d, p, m) {
     return (0, l._)`${n(d)}.call(${p}, ${m})`;
   }
-  se.isOwnProperty = v;
+  ae.isOwnProperty = v;
   function S(d, p, m, b) {
     const w = (0, l._)`${p}${(0, l.getProperty)(m)} !== undefined`;
     return b ? (0, l._)`${w} && ${v(d, p, m)}` : w;
   }
-  se.propertyInData = S;
+  ae.propertyInData = S;
   function y(d, p, m, b) {
     const w = (0, l._)`${p}${(0, l.getProperty)(m)} === undefined`;
     return b ? (0, l.or)(w, (0, l.not)(v(d, p, m))) : w;
   }
-  se.noPropertyInData = y;
+  ae.noPropertyInData = y;
   function E(d) {
     return d ? Object.keys(d).filter((p) => p !== "__proto__") : [];
   }
-  se.allSchemaProperties = E;
+  ae.allSchemaProperties = E;
   function t(d, p) {
     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: P }, C, O, z) {
-    const M = z ? (0, l._)`${d}, ${p}, ${b}${w}` : p, G = [
+  ae.schemaProperties = t;
+  function a({ schemaCode: d, data: p, it: { gen: m, topSchemaRef: b, schemaPath: w, errorPath: U }, it: P }, C, L, F) {
+    const M = F ? (0, l._)`${d}, ${p}, ${b}${w}` : p, G = [
       [c.default.instancePath, (0, l.strConcat)(c.default.instancePath, U)],
       [c.default.parentData, P.parentData],
       [c.default.parentDataProperty, P.parentDataProperty],
       [c.default.rootData, c.default.rootData]
     ];
     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})`;
+    const H = (0, l._)`${M}, ${m.object(...G)}`;
+    return L !== l.nil ? (0, l._)`${C}.call(${L}, ${H})` : (0, l._)`${C}(${H})`;
   }
-  se.callValidateCode = a;
+  ae.callValidateCode = a;
   const e = (0, l._)`new RegExp`;
   function r({ gen: d, it: { opts: p } }, m) {
     const b = p.unicodeRegExp ? "u" : "", { regExp: w } = p.code, U = w(m, b);
@@ -1391,7 +1391,7 @@ function Ee() {
       code: (0, l._)`${w.code === "new RegExp" ? e : (0, u.useFunc)(d, w)}(${m}, ${b})`
     });
   }
-  se.usePattern = r;
+  ae.usePattern = r;
   function s(d) {
     const { gen: p, data: m, keyword: b, it: w } = d, U = p.name("valid");
     if (w.allErrors) {
@@ -1400,40 +1400,40 @@ function Ee() {
     }
     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) => {
+      const L = p.const("len", (0, l._)`${m}.length`);
+      p.forRange("i", 0, L, (F) => {
         d.subschema({
           keyword: b,
-          dataProp: z,
+          dataProp: F,
           dataPropType: o.Type.Num
         }, U), p.if((0, l.not)(U), C);
       });
     }
   }
-  se.validateArray = s;
+  ae.validateArray = s;
   function f(d) {
     const { gen: p, schema: m, keyword: b, it: w } = d;
     if (!Array.isArray(m))
       throw new Error("ajv implementation error");
-    if (m.some((O) => (0, o.alwaysValidSchema)(w, O)) && !w.opts.unevaluated)
+    if (m.some((L) => (0, o.alwaysValidSchema)(w, L)) && !w.opts.unevaluated)
       return;
     const P = p.let("valid", !1), C = p.name("_valid");
-    p.block(() => m.forEach((O, z) => {
+    p.block(() => m.forEach((L, F) => {
       const M = d.subschema({
         keyword: b,
-        schemaProp: z,
+        schemaProp: F,
         compositeRule: !0
       }, C);
       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;
+  return ae.validateUnion = f, ae;
 }
 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 = Z(), o = De(), c = Ee(), u = Xt();
+  const l = X(), 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);
@@ -1455,27 +1455,27 @@ function Sl() {
     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());
+        F(), a.modifying && g(t), M(() => t.error());
       else {
-        const G = a.async ? C() : O();
+        const G = a.async ? C() : L();
         a.modifying && g(t), M(() => n(t, G));
       }
     }
     function C() {
       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;
+      return r.try(() => F((0, l._)`await `), (H) => r.assign(U, !1).if((0, l._)`${H} instanceof ${m.ValidationError}`, () => r.assign(G, (0, l._)`${H}.errors`), () => r.throw(H))), G;
     }
-    function O() {
+    function L() {
       const G = (0, l._)`${w}.errors`;
-      return r.assign(G, null), z(l.nil), G;
+      return r.assign(G, null), F(l.nil), G;
     }
-    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._)`${G}${(0, c.callValidateCode)(t, w, V, K)}`, a.modifying);
+    function F(G = a.async ? (0, l._)`await ` : l.nil) {
+      const H = m.opts.passContext ? o.default.this : o.default.self, W = !("compile" in a && !p || a.schema === !1);
+      r.assign(U, (0, l._)`${G}${(0, c.callValidateCode)(t, w, H, W)}`, a.modifying);
     }
     function M(G) {
-      var V;
-      r.if((0, l.not)((V = a.valid) !== null && V !== void 0 ? V : U), G);
+      var H;
+      r.if((0, l.not)((H = a.valid) !== null && H !== void 0 ? H : 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 = Z(), o = re();
+  const l = X(), o = ne();
   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');
@@ -1574,7 +1574,7 @@ function xl() {
   }
   return Ce.extendSubschemaMode = _, Ce;
 }
-var pe = {}, Nr, Zn;
+var _e = {}, Nr, Zn;
 function yn() {
   return Zn || (Zn = 1, Nr = function l(o, c) {
     if (o === c) return !0;
@@ -1679,9 +1679,9 @@ function Ul() {
 }
 var Jn;
 function Tr() {
-  if (Jn) return pe;
-  Jn = 1, Object.defineProperty(pe, "__esModule", { value: !0 }), pe.getSchemaRefs = pe.resolveUrl = pe.normalizeId = pe._getFullPath = pe.getFullPath = pe.inlineRef = void 0;
-  const l = re(), o = yn(), c = Ul(), u = /* @__PURE__ */ new Set([
+  if (Jn) return _e;
+  Jn = 1, Object.defineProperty(_e, "__esModule", { value: !0 }), _e.getSchemaRefs = _e.resolveUrl = _e.normalizeId = _e._getFullPath = _e.getFullPath = _e.inlineRef = void 0;
+  const l = ne(), o = yn(), c = Ul(), u = /* @__PURE__ */ new Set([
     "type",
     "format",
     "pattern",
@@ -1702,7 +1702,7 @@ function Tr() {
   function _(r, s = !0) {
     return typeof r == "boolean" ? !0 : s === !0 ? !g(r) : s ? n(r) <= s : !1;
   }
-  pe.inlineRef = _;
+  _e.inlineRef = _;
   const h = /* @__PURE__ */ new Set([
     "$ref",
     "$recursiveRef",
@@ -1735,242 +1735,242 @@ function Tr() {
     const d = r.parse(s);
     return S(r, d);
   }
-  pe.getFullPath = v;
+  _e.getFullPath = v;
   function S(r, s) {
     return r.serialize(s).split("#")[0] + "#";
   }
-  pe._getFullPath = S;
+  _e._getFullPath = S;
   const y = /#\/?$/;
   function E(r) {
     return r ? r.replace(y, "") : "";
   }
-  pe.normalizeId = E;
+  _e.normalizeId = E;
   function t(r, s, f) {
     return f = E(f), r.resolve(s, f);
   }
-  pe.resolveUrl = t;
+  _e.resolveUrl = t;
   const a = /^[a-z_][-a-z0-9._]*$/i;
   function e(r, s) {
     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 }, (O, z, M, G) => {
+    return c(r, { allKeys: !0 }, (L, F, M, G) => {
       if (G === void 0)
         return;
-      const V = b + z;
-      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" ? 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") {
-          if (!a.test(X))
-            throw new Error(`invalid anchor "${X}"`);
-          ee.call(this, `#${X}`);
+      const H = b + F;
+      let W = m[G];
+      typeof L[f] == "string" && (W = Q.call(this, L[f])), ie.call(this, L.$anchor), ie.call(this, L.$dynamicAnchor), m[F] = W;
+      function Q(J) {
+        const j = this.opts.uriResolver.resolve;
+        if (J = E(W ? j(W, J) : J), U.has(J))
+          throw C(J);
+        U.add(J);
+        let D = this.refs[J];
+        return typeof D == "string" && (D = this.refs[D]), typeof D == "object" ? P(L, D.schema, J) : J !== E(H) && (J[0] === "#" ? (P(L, w[J], J), w[J] = L) : this.refs[J] = H), J;
+      }
+      function ie(J) {
+        if (typeof J == "string") {
+          if (!a.test(J))
+            throw new Error(`invalid anchor "${J}"`);
+          Q.call(this, `#${J}`);
         }
       }
     }), w;
-    function P(O, z, M) {
-      if (z !== void 0 && !o(O, z))
+    function P(L, F, M) {
+      if (F !== void 0 && !o(L, F))
         throw C(M);
     }
-    function C(O) {
-      return new Error(`reference "${O}" resolves to more than one schema`);
+    function C(L) {
+      return new Error(`reference "${L}" resolves to more than one schema`);
     }
   }
-  return pe.getSchemaRefs = e, pe;
+  return _e.getSchemaRefs = e, _e;
 }
 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 = Z(), v = De(), S = Tr(), y = re(), E = Xt();
-  function t(F) {
-    if (b(F) && (U(F), m(F))) {
-      s(F);
+  const l = bl(), o = yr(), c = ko(), u = yr(), _ = wl(), h = Sl(), g = xl(), n = X(), v = De(), S = Tr(), y = ne(), E = Xt();
+  function t(z) {
+    if (b(z) && (U(z), m(z))) {
+      s(z);
       return;
     }
-    a(F, () => (0, l.topBoolOrEmptySchema)(F));
+    a(z, () => (0, l.topBoolOrEmptySchema)(z));
   }
   Pe.validateFunctionCode = t;
-  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 a({ gen: z, validateName: R, schema: $, schemaEnv: V, opts: Y }, Z) {
+    Y.code.es5 ? z.func(R, (0, n._)`${v.default.data}, ${v.default.valCxt}`, V.$async, () => {
+      z.code((0, n._)`"use strict"; ${d($, Y)}`), r(z, Y), z.code(Z);
+    }) : z.func(R, (0, n._)`${v.default.data}, ${e(Y)}`, V.$async, () => z.code(d($, Y)).code(Z));
   }
-  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 e(z) {
+    return (0, n._)`{${v.default.instancePath}="", ${v.default.parentData}, ${v.default.parentDataProperty}, ${v.default.rootData}=${v.default.data}${z.dynamicRef ? (0, n._)`, ${v.default.dynamicAnchors}={}` : n.nil}}={}`;
   }
-  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}`);
+  function r(z, R) {
+    z.if(v.default.valCxt, () => {
+      z.var(v.default.instancePath, (0, n._)`${v.default.valCxt}.${v.default.instancePath}`), z.var(v.default.parentData, (0, n._)`${v.default.valCxt}.${v.default.parentData}`), z.var(v.default.parentDataProperty, (0, n._)`${v.default.valCxt}.${v.default.parentDataProperty}`), z.var(v.default.rootData, (0, n._)`${v.default.valCxt}.${v.default.rootData}`), R.dynamicRef && z.var(v.default.dynamicAnchors, (0, n._)`${v.default.valCxt}.${v.default.dynamicAnchors}`);
     }, () => {
-      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._)`{}`);
+      z.var(v.default.instancePath, (0, n._)`""`), z.var(v.default.parentData, (0, n._)`undefined`), z.var(v.default.parentDataProperty, (0, n._)`undefined`), z.var(v.default.rootData, v.default.data), R.dynamicRef && z.var(v.default.dynamicAnchors, (0, n._)`{}`);
     });
   }
-  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 s(z) {
+    const { schema: R, opts: $, gen: V } = z;
+    a(z, () => {
+      $.$comment && R.$comment && G(z), L(z), V.let(v.default.vErrors, null), V.let(v.default.errors, 0), $.unevaluated && f(z), P(z), H(z);
     });
   }
-  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 f(z) {
+    const { gen: R, validateName: $ } = z;
+    z.evaluated = R.const("evaluated", (0, n._)`${$}.evaluated`), R.if((0, n._)`${z.evaluated}.dynamicProps`, () => R.assign((0, n._)`${z.evaluated}.props`, (0, n._)`undefined`)), R.if((0, n._)`${z.evaluated}.dynamicItems`, () => R.assign((0, n._)`${z.evaluated}.items`, (0, n._)`undefined`));
   }
-  function d(F, R) {
-    const $ = typeof F == "object" && F[R.schemaId];
+  function d(z, R) {
+    const $ = typeof z == "object" && z[R.schemaId];
     return $ && (R.code.source || R.code.process) ? (0, n._)`/*# sourceURL=${$} */` : n.nil;
   }
-  function p(F, R) {
-    if (b(F) && (U(F), m(F))) {
-      w(F, R);
+  function p(z, R) {
+    if (b(z) && (U(z), m(z))) {
+      w(z, R);
       return;
     }
-    (0, l.boolOrEmptySchema)(F, R);
+    (0, l.boolOrEmptySchema)(z, R);
   }
-  function m({ schema: F, self: R }) {
-    if (typeof F == "boolean")
-      return !F;
-    for (const $ in F)
+  function m({ schema: z, self: R }) {
+    if (typeof z == "boolean")
+      return !z;
+    for (const $ in z)
       if (R.RULES.all[$])
         return !0;
     return !1;
   }
-  function b(F) {
-    return typeof F.schema != "boolean";
+  function b(z) {
+    return typeof z.schema != "boolean";
   }
-  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 w(z, R) {
+    const { schema: $, gen: V, opts: Y } = z;
+    Y.$comment && $.$comment && G(z), F(z), M(z);
+    const Z = V.const("_errs", v.default.errors);
+    P(z, Z), V.var(R, (0, n._)`${Z} === ${v.default.errors}`);
   }
-  function U(F) {
-    (0, y.checkUnknownRules)(F), C(F);
+  function U(z) {
+    (0, y.checkUnknownRules)(z), C(z);
   }
-  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 P(z, R) {
+    if (z.opts.jtd)
+      return Q(z, [], !1, R);
+    const $ = (0, o.getSchemaTypes)(z.schema), V = (0, o.coerceAndCheckDataType)(z, $);
+    Q(z, $, !V, R);
   }
-  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 C(z) {
+    const { schema: R, errSchemaPath: $, opts: V, self: Y } = z;
+    R.$ref && V.ignoreKeywordsWithRef && (0, y.schemaHasRulesButRef)(R, Y.RULES) && Y.logger.warn(`$ref: keywords ignored in schema at path "${$}"`);
   }
-  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 L(z) {
+    const { schema: R, opts: $ } = z;
+    R.default !== void 0 && $.useDefaults && $.strictSchema && (0, y.checkStrictMode)(z, "default is ignored in the schema root");
   }
-  function z(F) {
-    const R = F.schema[F.opts.schemaId];
-    R && (F.baseId = (0, S.resolveUrl)(F.opts.uriResolver, F.baseId, R));
+  function F(z) {
+    const R = z.schema[z.opts.schemaId];
+    R && (z.baseId = (0, S.resolveUrl)(z.opts.uriResolver, z.baseId, R));
   }
-  function M(F) {
-    if (F.schema.$async && !F.schemaEnv.$async)
+  function M(z) {
+    if (z.schema.$async && !z.schemaEnv.$async)
       throw new Error("async schema in sync schema");
   }
-  function G({ gen: F, schemaEnv: R, schema: $, errSchemaPath: j, opts: Y }) {
-    const W = $.$comment;
+  function G({ gen: z, schemaEnv: R, schema: $, errSchemaPath: V, opts: Y }) {
+    const Z = $.$comment;
     if (Y.$comment === !0)
-      F.code((0, n._)`${v.default.self}.logger.log(${W})`);
+      z.code((0, n._)`${v.default.self}.logger.log(${Z})`);
     else if (typeof Y.$comment == "function") {
-      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)`);
+      const oe = (0, n.str)`${V}/$comment`, se = z.scopeValue("root", { ref: R.root });
+      z.code((0, n._)`${v.default.self}.opts.$comment(${Z}, ${oe}, ${se}.schema)`);
     }
   }
-  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 H(z) {
+    const { gen: R, schemaEnv: $, validateName: V, ValidationError: Y, opts: Z } = z;
+    $.$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._)`${V}.errors`, v.default.vErrors), Z.unevaluated && W(z), R.return((0, n._)`${v.default.errors} === 0`));
   }
-  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 W({ gen: z, evaluated: R, props: $, items: V }) {
+    $ instanceof n.Name && z.assign((0, n._)`${R}.props`, $), V instanceof n.Name && z.assign((0, n._)`${R}.items`, V);
   }
-  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));
+  function Q(z, R, $, V) {
+    const { gen: Y, schema: Z, data: oe, allErrors: se, opts: de, self: fe } = z, { RULES: he } = fe;
+    if (Z.$ref && (de.ignoreKeywordsWithRef || !(0, y.schemaHasRulesButRef)(Z, he))) {
+      Y.block(() => O(z, "$ref", he.all.$ref.definition));
       return;
     }
-    le.jtd || X(F, R), Y.block(() => {
-      for (const ve of ue.rules)
+    de.jtd || J(z, R), Y.block(() => {
+      for (const ve of he.rules)
         Qe(ve);
-      Qe(ue.post);
+      Qe(he.post);
     });
     function Qe(ve) {
-      (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}`));
+      (0, c.shouldUseGroup)(Z, ve) && (ve.type ? (Y.if((0, u.checkDataType)(ve.type, oe, de.strictNumbers)), ie(z, ve), R.length === 1 && R[0] === ve.type && $ && (Y.else(), (0, u.reportTypeError)(z)), Y.endIf()) : ie(z, ve), se || Y.if((0, n._)`${v.default.errors} === ${V || 0}`));
     }
   }
-  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 ie(z, R) {
+    const { gen: $, schema: V, opts: { useDefaults: Y } } = z;
+    Y && (0, _.assignDefaults)(z, R.type), $.block(() => {
+      for (const Z of R.rules)
+        (0, c.shouldUseRule)(V, Z) && O(z, Z.keyword, Z.definition, R.type);
     });
   }
-  function X(F, R) {
-    F.schemaEnv.meta || !F.opts.strictTypes || (ne(F, R), F.opts.allowUnionTypes || B(F, R), A(F, F.dataTypes));
+  function J(z, R) {
+    z.schemaEnv.meta || !z.opts.strictTypes || (j(z, R), z.opts.allowUnionTypes || D(z, R), I(z, z.dataTypes));
   }
-  function ne(F, R) {
+  function j(z, R) {
     if (R.length) {
-      if (!F.dataTypes.length) {
-        F.dataTypes = R;
+      if (!z.dataTypes.length) {
+        z.dataTypes = R;
         return;
       }
       R.forEach(($) => {
-        T(F.dataTypes, $) || I(F, `type "${$}" not allowed by context "${F.dataTypes.join(",")}"`);
-      }), x(F, R);
+        T(z.dataTypes, $) || A(z, `type "${$}" not allowed by context "${z.dataTypes.join(",")}"`);
+      }), x(z, R);
     }
   }
-  function B(F, R) {
-    R.length > 1 && !(R.length === 2 && R.includes("null")) && I(F, "use allowUnionTypes to allow union type keyword");
+  function D(z, R) {
+    R.length > 1 && !(R.length === 2 && R.includes("null")) && A(z, "use allowUnionTypes to allow union type keyword");
   }
-  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 I(z, R) {
+    const $ = z.self.RULES.all;
+    for (const V in $) {
+      const Y = $[V];
+      if (typeof Y == "object" && (0, c.shouldUseRule)(z.schema, Y)) {
+        const { type: Z } = Y.definition;
+        Z.length && !Z.some((oe) => k(R, oe)) && A(z, `missing type "${Z.join(",")}" for keyword "${V}"`);
       }
     }
   }
-  function k(F, R) {
-    return F.includes(R) || R === "number" && F.includes("integer");
+  function k(z, R) {
+    return z.includes(R) || R === "number" && z.includes("integer");
   }
-  function T(F, R) {
-    return F.includes(R) || R === "integer" && F.includes("number");
+  function T(z, R) {
+    return z.includes(R) || R === "integer" && z.includes("number");
   }
-  function x(F, R) {
+  function x(z, R) {
     const $ = [];
-    for (const j of F.dataTypes)
-      T(R, j) ? $.push(j) : R.includes("integer") && j === "number" && $.push("integer");
-    F.dataTypes = $;
-  }
-  function I(F, R) {
-    const $ = F.schemaEnv.baseId + F.errSchemaPath;
-    R += ` at "${$}" (strictTypes)`, (0, y.checkStrictMode)(F, R, F.opts.strictTypes);
-  }
-  class D {
-    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));
+    for (const V of z.dataTypes)
+      T(R, V) ? $.push(V) : R.includes("integer") && V === "number" && $.push("integer");
+    z.dataTypes = $;
+  }
+  function A(z, R) {
+    const $ = z.schemaEnv.baseId + z.errSchemaPath;
+    R += ` at "${$}" (strictTypes)`, (0, y.checkStrictMode)(z, R, z.opts.strictTypes);
+  }
+  class B {
+    constructor(R, $, V) {
+      if ((0, h.validateKeywordUsage)(R, $, V), this.gen = R.gen, this.allErrors = R.allErrors, this.keyword = V, this.data = R.data, this.schema = R.schema[V], this.$data = $.$data && R.opts.$data && this.schema && this.schema.$data, this.schemaValue = (0, y.schemaRefOrVal)(R, this.schema, V, this.$data), this.schemaType = $.schemaType, this.parentSchema = R.schema, this.params = {}, this.it = R, this.def = $, this.$data)
+        this.schemaCode = R.gen.const("vSchema", K(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)}`);
+        throw new Error(`${V} value must be ${JSON.stringify($.schemaType)}`);
       ("code" in $ ? $.trackErrors : $.errors !== !1) && (this.errsCount = R.gen.const("_errs", v.default.errors));
     }
-    result(R, $, j) {
-      this.failResult((0, n.not)(R), $, j);
+    result(R, $, V) {
+      this.failResult((0, n.not)(R), $, V);
     }
-    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();
+    failResult(R, $, V) {
+      this.gen.if(R), V ? V() : this.error(), $ ? (this.gen.else(), $(), this.allErrors && this.gen.endIf()) : this.allErrors ? this.gen.endIf() : this.gen.else();
     }
     pass(R, $) {
       this.failResult((0, n.not)(R), void 0, $);
@@ -1988,12 +1988,12 @@ function Jt() {
       const { schemaCode: $ } = this;
       this.fail((0, n._)`${$} !== undefined && (${(0, n.or)(this.invalid$data(), R)})`);
     }
-    error(R, $, j) {
+    error(R, $, V) {
       if ($) {
-        this.setParams($), this._error(R, j), this.setParams({});
+        this.setParams($), this._error(R, V), this.setParams({});
         return;
       }
-      this._error(R, j);
+      this._error(R, V);
     }
     _error(R, $) {
       (R ? E.reportExtraError : E.reportError)(this, this.def.error, $);
@@ -2012,92 +2012,92 @@ function Jt() {
     setParams(R, $) {
       $ ? Object.assign(this.params, R) : this.params = R;
     }
-    block$data(R, $, j = n.nil) {
+    block$data(R, $, V = n.nil) {
       this.gen.block(() => {
-        this.check$data(R, j), $();
+        this.check$data(R, V), $();
       });
     }
     check$data(R = n.nil, $ = n.nil) {
       if (!this.$data)
         return;
-      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();
+      const { gen: V, schemaCode: Y, schemaType: Z, def: oe } = this;
+      V.if((0, n.or)((0, n._)`${Y} === undefined`, $)), R !== n.nil && V.assign(R, !0), (Z.length || oe.validateSchema) && (V.elseIf(this.invalid$data()), this.$dataError(), R !== n.nil && V.assign(R, !1)), V.else();
     }
     invalid$data() {
-      const { gen: R, schemaCode: $, schemaType: j, def: Y, it: W } = this;
-      return (0, n.or)(ae(), he());
-      function ae() {
-        if (j.length) {
+      const { gen: R, schemaCode: $, schemaType: V, def: Y, it: Z } = this;
+      return (0, n.or)(oe(), se());
+      function oe() {
+        if (V.length) {
           if (!($ instanceof n.Name))
             throw new Error("ajv implementation error");
-          const le = Array.isArray(j) ? j : [j];
-          return (0, n._)`${(0, u.checkDataTypes)(le, $, W.opts.strictNumbers, u.DataType.Wrong)}`;
+          const de = Array.isArray(V) ? V : [V];
+          return (0, n._)`${(0, u.checkDataTypes)(de, $, Z.opts.strictNumbers, u.DataType.Wrong)}`;
         }
         return n.nil;
       }
-      function he() {
+      function se() {
         if (Y.validateSchema) {
-          const le = R.scopeValue("validate$data", { ref: Y.validateSchema });
-          return (0, n._)`!${le}(${$})`;
+          const de = R.scopeValue("validate$data", { ref: Y.validateSchema });
+          return (0, n._)`!${de}(${$})`;
         }
         return n.nil;
       }
     }
     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 };
+      const V = (0, g.getSubschema)(this.it, R);
+      (0, g.extendSubschemaData)(V, this.it, R), (0, g.extendSubschemaMode)(V, R);
+      const Y = { ...this.it, ...V, items: void 0, props: void 0 };
       return p(Y, $), Y;
     }
     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, $)));
+      const { it: V, gen: Y } = this;
+      V.opts.unevaluated && (V.props !== !0 && R.props !== void 0 && (V.props = y.mergeEvaluated.props(Y, R.props, V.props, $)), V.items !== !0 && R.items !== void 0 && (V.items = y.mergeEvaluated.items(Y, R.items, V.items, $)));
     }
     mergeValidEvaluated(R, $) {
-      const { it: j, gen: Y } = this;
-      if (j.opts.unevaluated && (j.props !== !0 || j.items !== !0))
+      const { it: V, gen: Y } = this;
+      if (V.opts.unevaluated && (V.props !== !0 || V.items !== !0))
         return Y.if($, () => this.mergeEvaluated(R, n.Name)), !0;
     }
   }
-  Pe.KeywordCxt = D;
-  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, $);
+  Pe.KeywordCxt = B;
+  function O(z, R, $, V) {
+    const Y = new B(z, $, R);
+    "code" in $ ? $.code(Y, V) : 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(F, { dataLevel: R, dataNames: $, dataPathArr: j }) {
-    let Y, W;
-    if (F === "")
+  const N = /^\/(?:[^~]|~0|~1)*$/, q = /^([0-9]+)(#|\/(?:[^~]|~0|~1)*)?$/;
+  function K(z, { dataLevel: R, dataNames: $, dataPathArr: V }) {
+    let Y, Z;
+    if (z === "")
       return v.default.rootData;
-    if (F[0] === "/") {
-      if (!L.test(F))
-        throw new Error(`Invalid JSON-pointer: ${F}`);
-      Y = F, W = v.default.rootData;
+    if (z[0] === "/") {
+      if (!N.test(z))
+        throw new Error(`Invalid JSON-pointer: ${z}`);
+      Y = z, Z = v.default.rootData;
     } else {
-      const me = q.exec(F);
-      if (!me)
-        throw new Error(`Invalid JSON-pointer: ${F}`);
-      const ue = +me[1];
-      if (Y = me[2], Y === "#") {
-        if (ue >= R)
-          throw new Error(le("property/index", ue));
-        return j[R - ue];
-      }
-      if (ue > R)
-        throw new Error(le("data", ue));
-      if (W = $[R - ue], !Y)
-        return W;
-    }
-    let ae = W;
-    const he = Y.split("/");
-    for (const me of he)
-      me && (W = (0, n._)`${W}${(0, n.getProperty)((0, y.unescapeJsonPointer)(me))}`, ae = (0, n._)`${ae} && ${W}`);
-    return ae;
-    function le(me, ue) {
-      return `Cannot access ${me} ${ue} levels up, current level is ${R}`;
-    }
-  }
-  return Pe.getData = H, Pe;
+      const fe = q.exec(z);
+      if (!fe)
+        throw new Error(`Invalid JSON-pointer: ${z}`);
+      const he = +fe[1];
+      if (Y = fe[2], Y === "#") {
+        if (he >= R)
+          throw new Error(de("property/index", he));
+        return V[R - he];
+      }
+      if (he > R)
+        throw new Error(de("data", he));
+      if (Z = $[R - he], !Y)
+        return Z;
+    }
+    let oe = Z;
+    const se = Y.split("/");
+    for (const fe of se)
+      fe && (Z = (0, n._)`${Z}${(0, n.getProperty)((0, y.unescapeJsonPointer)(fe))}`, oe = (0, n._)`${oe} && ${Z}`);
+    return oe;
+    function de(fe, he) {
+      return `Cannot access ${fe} ${he} levels up, current level is ${R}`;
+    }
+  }
+  return Pe.getData = K, Pe;
 }
 var li = {}, es;
 function gn() {
@@ -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 = Z(), o = gn(), c = De(), u = Tr(), _ = re(), h = Jt();
+  const l = X(), o = gn(), c = De(), u = Tr(), _ = ne(), h = Jt();
   class g {
     constructor(f) {
       var d;
@@ -2173,24 +2173,24 @@ function vn() {
       opts: this.opts,
       self: this
     };
-    let O;
+    let L;
     try {
       this._compilations.add(s), (0, h.validateFunctionCode)(C), w.optimize(this.opts.code.optimize);
-      const z = w.toString();
-      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;
+      const F = w.toString();
+      L = `${w.scopeRefs(c.default.scope)}return ${F}`, this.opts.code.process && (L = this.opts.code.process(L, s));
+      const G = new Function(`${c.default.self}`, `${c.default.scope}`, L)(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: F, scopeValues: w._values }), this.opts.unevaluated) {
+        const { props: H, items: W } = C;
         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
+          props: H instanceof l.Name ? void 0 : H,
+          items: W instanceof l.Name ? void 0 : W,
+          dynamicProps: H instanceof l.Name,
+          dynamicItems: W instanceof l.Name
         }, G.source && (G.source.evaluated = (0, l.stringify)(G.evaluated));
       }
       return s.validate = G, s;
-    } catch (z) {
-      throw delete s.validate, delete s.validateName, O && this.logger.error("Error compiling schema, function code:", O), z;
+    } catch (F) {
+      throw delete s.validate, delete s.validateName, L && this.logger.error("Error compiling schema, function code:", L), F;
     } finally {
       this._compilations.delete(s);
     }
@@ -2658,7 +2658,7 @@ function Ll() {
     Object.defineProperty(l, "KeywordCxt", { enumerable: !0, get: function() {
       return o.KeywordCxt;
     } });
-    var c = Z();
+    var c = X();
     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 = Z(), v = Tr(), S = yr(), y = re(), E = kl, t = Dl(), a = (B, A) => new RegExp(B, A);
+    const u = gn(), _ = Ir(), h = Co(), g = vn(), n = X(), v = Tr(), S = yr(), y = ne(), E = kl, t = Dl(), a = (D, I) => new RegExp(D, I);
     a.code = "new RegExp";
     const e = ["removeAdditional", "useDefaults", "coerceTypes"], r = /* @__PURE__ */ new Set([
       "validate",
@@ -2709,155 +2709,155 @@ function Ll() {
       jsPropertySyntax: "",
       unicode: '"minLength"/"maxLength" account for unicode characters by default.'
     }, d = 200;
-    function p(B) {
-      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;
+    function p(D) {
+      var I, k, T, x, A, B, O, N, q, K, z, R, $, V, Y, Z, oe, se, de, fe, he, Qe, ve, zr, Fr;
+      const ut = D.strict, Rr = (I = D.code) === null || I === void 0 ? void 0 : I.optimize, Fn = Rr === !0 || Rr === void 0 ? 1 : Rr || 0, Rn = (T = (k = D.code) === null || k === void 0 ? void 0 : k.regExp) !== null && T !== void 0 ? T : a, pl = (x = D.uriResolver) !== null && x !== void 0 ? x : t.default;
       return {
-        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: (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: (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: (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,
-        validateFormats: (ve = B.validateFormats) !== null && ve !== void 0 ? ve : !0,
-        unicodeRegExp: (zr = B.unicodeRegExp) !== null && zr !== void 0 ? zr : !0,
-        int32range: (Fr = B.int32range) !== null && Fr !== void 0 ? Fr : !0,
+        strictSchema: (B = (A = D.strictSchema) !== null && A !== void 0 ? A : ut) !== null && B !== void 0 ? B : !0,
+        strictNumbers: (N = (O = D.strictNumbers) !== null && O !== void 0 ? O : ut) !== null && N !== void 0 ? N : !0,
+        strictTypes: (K = (q = D.strictTypes) !== null && q !== void 0 ? q : ut) !== null && K !== void 0 ? K : "log",
+        strictTuples: (R = (z = D.strictTuples) !== null && z !== void 0 ? z : ut) !== null && R !== void 0 ? R : "log",
+        strictRequired: (V = ($ = D.strictRequired) !== null && $ !== void 0 ? $ : ut) !== null && V !== void 0 ? V : !1,
+        code: D.code ? { ...D.code, optimize: Fn, regExp: Rn } : { optimize: Fn, regExp: Rn },
+        loopRequired: (Y = D.loopRequired) !== null && Y !== void 0 ? Y : d,
+        loopEnum: (Z = D.loopEnum) !== null && Z !== void 0 ? Z : d,
+        meta: (oe = D.meta) !== null && oe !== void 0 ? oe : !0,
+        messages: (se = D.messages) !== null && se !== void 0 ? se : !0,
+        inlineRefs: (de = D.inlineRefs) !== null && de !== void 0 ? de : !0,
+        schemaId: (fe = D.schemaId) !== null && fe !== void 0 ? fe : "$id",
+        addUsedSchema: (he = D.addUsedSchema) !== null && he !== void 0 ? he : !0,
+        validateSchema: (Qe = D.validateSchema) !== null && Qe !== void 0 ? Qe : !0,
+        validateFormats: (ve = D.validateFormats) !== null && ve !== void 0 ? ve : !0,
+        unicodeRegExp: (zr = D.unicodeRegExp) !== null && zr !== void 0 ? zr : !0,
+        int32range: (Fr = D.int32range) !== null && Fr !== void 0 ? Fr : !0,
         uriResolver: pl
       };
     }
     class m {
-      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) };
+      constructor(I = {}) {
+        this.schemas = {}, this.refs = {}, this.formats = {}, this._compilations = /* @__PURE__ */ new Set(), this._loading = {}, this._cache = /* @__PURE__ */ new Map(), I = this.opts = { ...I, ...p(I) };
         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;
+        this.scope = new n.ValueScope({ scope: {}, prefixes: r, es5: k, lines: T }), this.logger = M(I.logger);
+        const x = I.validateFormats;
+        I.validateFormats = !1, this.RULES = (0, h.getRules)(), b.call(this, s, I, "NOT SUPPORTED"), b.call(this, f, I, "DEPRECATED", "warn"), this._metaOpts = L.call(this), I.formats && P.call(this), this._addVocabularies(), this._addDefaultMetaSchema(), I.keywords && C.call(this, I.keywords), typeof I.meta == "object" && this.addMetaSchema(I.meta), U.call(this), I.validateFormats = x;
       }
       _addVocabularies() {
         this.addKeyword("$async");
       }
       _addDefaultMetaSchema() {
-        const { $data: A, meta: k, schemaId: T } = this.opts;
+        const { $data: I, meta: k, schemaId: T } = this.opts;
         let x = E;
-        T === "id" && (x = { ...E }, x.id = x.$id, delete x.$id), k && A && this.addMetaSchema(x, x[T], !1);
+        T === "id" && (x = { ...E }, x.id = x.$id, delete x.$id), k && I && this.addMetaSchema(x, x[T], !1);
       }
       defaultMeta() {
-        const { meta: A, schemaId: k } = this.opts;
-        return this.opts.defaultMeta = typeof A == "object" ? A[k] || A : void 0;
+        const { meta: I, schemaId: k } = this.opts;
+        return this.opts.defaultMeta = typeof I == "object" ? I[k] || I : void 0;
       }
-      validate(A, k) {
+      validate(I, k) {
         let T;
-        if (typeof A == "string") {
-          if (T = this.getSchema(A), !T)
-            throw new Error(`no schema with key or ref "${A}"`);
+        if (typeof I == "string") {
+          if (T = this.getSchema(I), !T)
+            throw new Error(`no schema with key or ref "${I}"`);
         } else
-          T = this.compile(A);
+          T = this.compile(I);
         const x = T(k);
         return "$async" in T || (this.errors = T.errors), x;
       }
-      compile(A, k) {
-        const T = this._addSchema(A, k);
+      compile(I, k) {
+        const T = this._addSchema(I, k);
         return T.validate || this._compileSchemaEnv(T);
       }
-      compileAsync(A, k) {
+      compileAsync(I, k) {
         if (typeof this.opts.loadSchema != "function")
           throw new Error("options.loadSchema should be a function");
         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);
+        return x.call(this, I, k);
+        async function x(K, z) {
+          await A.call(this, K.$schema);
+          const R = this._addSchema(K, z);
+          return R.validate || B.call(this, R);
         }
-        async function I(H) {
-          H && !this.getSchema(H) && await x.call(this, { $ref: H }, !0);
+        async function A(K) {
+          K && !this.getSchema(K) && await x.call(this, { $ref: K }, !0);
         }
-        async function D(H) {
+        async function B(K) {
           try {
-            return this._compileSchemaEnv(H);
-          } catch (F) {
-            if (!(F instanceof _.default))
-              throw F;
-            return N.call(this, F), await L.call(this, F.missingSchema), D.call(this, H);
+            return this._compileSchemaEnv(K);
+          } catch (z) {
+            if (!(z instanceof _.default))
+              throw z;
+            return O.call(this, z), await N.call(this, z.missingSchema), B.call(this, K);
           }
         }
-        function N({ missingSchema: H, missingRef: F }) {
-          if (this.refs[H])
-            throw new Error(`AnySchema ${H} is loaded but ${F} cannot be resolved`);
+        function O({ missingSchema: K, missingRef: z }) {
+          if (this.refs[K])
+            throw new Error(`AnySchema ${K} is loaded but ${z} cannot be resolved`);
         }
-        async function L(H) {
-          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 N(K) {
+          const z = await q.call(this, K);
+          this.refs[K] || await A.call(this, z.$schema), this.refs[K] || this.addSchema(z, K, k);
         }
-        async function q(H) {
-          const F = this._loading[H];
-          if (F)
-            return F;
+        async function q(K) {
+          const z = this._loading[K];
+          if (z)
+            return z;
           try {
-            return await (this._loading[H] = T(H));
+            return await (this._loading[K] = T(K));
           } finally {
-            delete this._loading[H];
+            delete this._loading[K];
           }
         }
       }
       // Adds schema to the instance
-      addSchema(A, k, T, x = this.opts.validateSchema) {
-        if (Array.isArray(A)) {
-          for (const D of A)
-            this.addSchema(D, void 0, T, x);
+      addSchema(I, k, T, x = this.opts.validateSchema) {
+        if (Array.isArray(I)) {
+          for (const B of I)
+            this.addSchema(B, void 0, T, x);
           return this;
         }
-        let I;
-        if (typeof A == "object") {
-          const { schemaId: D } = this.opts;
-          if (I = A[D], I !== void 0 && typeof I != "string")
-            throw new Error(`schema ${D} must be string`);
+        let A;
+        if (typeof I == "object") {
+          const { schemaId: B } = this.opts;
+          if (A = I[B], A !== void 0 && typeof A != "string")
+            throw new Error(`schema ${B} must be string`);
         }
-        return k = (0, v.normalizeId)(k || I), this._checkUnique(k), this.schemas[k] = this._addSchema(A, T, k, x, !0), this;
+        return k = (0, v.normalizeId)(k || A), this._checkUnique(k), this.schemas[k] = this._addSchema(I, 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(A, k, T = this.opts.validateSchema) {
-        return this.addSchema(A, k, !0, T), this;
+      addMetaSchema(I, k, T = this.opts.validateSchema) {
+        return this.addSchema(I, k, !0, T), this;
       }
       //  Validate schema against its meta-schema
-      validateSchema(A, k) {
-        if (typeof A == "boolean")
+      validateSchema(I, k) {
+        if (typeof I == "boolean")
           return !0;
         let T;
-        if (T = A.$schema, T !== void 0 && typeof T != "string")
+        if (T = I.$schema, T !== void 0 && typeof T != "string")
           throw new Error("$schema must be a string");
         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(T, A);
+        const x = this.validate(T, I);
         if (!x && k) {
-          const I = "schema is invalid: " + this.errorsText();
+          const A = "schema is invalid: " + this.errorsText();
           if (this.opts.validateSchema === "log")
-            this.logger.error(I);
+            this.logger.error(A);
           else
-            throw new Error(I);
+            throw new Error(A);
         }
         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(A) {
+      getSchema(I) {
         let k;
-        for (; typeof (k = w.call(this, A)) == "string"; )
-          A = k;
+        for (; typeof (k = w.call(this, I)) == "string"; )
+          I = k;
         if (k === void 0) {
           const { schemaId: T } = this.opts, x = new g.SchemaEnv({ schema: {}, schemaId: T });
-          if (k = g.resolveSchema.call(this, x, A), !k)
+          if (k = g.resolveSchema.call(this, x, I), !k)
             return;
-          this.refs[A] = k;
+          this.refs[I] = k;
         }
         return k.validate || this._compileSchemaEnv(k);
       }
@@ -2865,20 +2865,20 @@ 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(A) {
-        if (A instanceof RegExp)
-          return this._removeAllSchemas(this.schemas, A), this._removeAllSchemas(this.refs, A), this;
-        switch (typeof A) {
+      removeSchema(I) {
+        if (I instanceof RegExp)
+          return this._removeAllSchemas(this.schemas, I), this._removeAllSchemas(this.refs, I), this;
+        switch (typeof I) {
           case "undefined":
             return this._removeAllSchemas(this.schemas), this._removeAllSchemas(this.refs), this._cache.clear(), this;
           case "string": {
-            const k = w.call(this, A);
-            return typeof k == "object" && this._cache.delete(k.schema), delete this.schemas[A], delete this.refs[A], this;
+            const k = w.call(this, I);
+            return typeof k == "object" && this._cache.delete(k.schema), delete this.schemas[I], delete this.refs[I], this;
           }
           case "object": {
-            const k = A;
+            const k = I;
             this._cache.delete(k);
-            let T = A[this.opts.schemaId];
+            let T = I[this.opts.schemaId];
             return T && (T = (0, v.normalizeId)(T), delete this.schemas[T], delete this.refs[T]), this;
           }
           default:
@@ -2886,210 +2886,210 @@ function Ll() {
         }
       }
       // add "vocabulary" - a collection of keywords
-      addVocabulary(A) {
-        for (const k of A)
+      addVocabulary(I) {
+        for (const k of I)
           this.addKeyword(k);
         return this;
       }
-      addKeyword(A, k) {
+      addKeyword(I, 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)
+        if (typeof I == "string")
+          T = I, typeof k == "object" && (this.logger.warn("these parameters are deprecated, see docs for addKeyword"), k.keyword = T);
+        else if (typeof I == "object" && k === void 0) {
+          if (k = I, 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, T, k), !k)
-          return (0, y.eachItem)(T, (I) => K.call(this, I)), this;
-        J.call(this, k);
+        if (H.call(this, T, k), !k)
+          return (0, y.eachItem)(T, (A) => W.call(this, A)), this;
+        ie.call(this, k);
         const x = {
           ...k,
           type: (0, S.getJSONTypes)(k.type),
           schemaType: (0, S.getJSONTypes)(k.schemaType)
         };
-        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;
+        return (0, y.eachItem)(T, x.type.length === 0 ? (A) => W.call(this, A, x) : (A) => x.type.forEach((B) => W.call(this, A, x, B))), this;
       }
-      getKeyword(A) {
-        const k = this.RULES.all[A];
+      getKeyword(I) {
+        const k = this.RULES.all[I];
         return typeof k == "object" ? k.definition : !!k;
       }
       // Remove keyword
-      removeKeyword(A) {
+      removeKeyword(I) {
         const { RULES: k } = this;
-        delete k.keywords[A], delete k.all[A];
+        delete k.keywords[I], delete k.all[I];
         for (const T of k.rules) {
-          const x = T.rules.findIndex((I) => I.keyword === A);
+          const x = T.rules.findIndex((A) => A.keyword === I);
           x >= 0 && T.rules.splice(x, 1);
         }
         return this;
       }
       // Add format
-      addFormat(A, k) {
-        return typeof k == "string" && (k = new RegExp(k)), this.formats[A] = k, this;
+      addFormat(I, k) {
+        return typeof k == "string" && (k = new RegExp(k)), this.formats[I] = k, this;
       }
-      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);
+      errorsText(I = this.errors, { separator: k = ", ", dataVar: T = "data" } = {}) {
+        return !I || I.length === 0 ? "No errors" : I.map((x) => `${T}${x.instancePath} ${x.message}`).reduce((x, A) => x + k + A);
       }
-      $dataMetaSchema(A, k) {
+      $dataMetaSchema(I, k) {
         const T = this.RULES.all;
-        A = JSON.parse(JSON.stringify(A));
+        I = JSON.parse(JSON.stringify(I));
         for (const x of k) {
-          const I = x.split("/").slice(1);
-          let D = A;
-          for (const N of I)
-            D = D[N];
-          for (const N in T) {
-            const L = T[N];
-            if (typeof L != "object")
+          const A = x.split("/").slice(1);
+          let B = I;
+          for (const O of A)
+            B = B[O];
+          for (const O in T) {
+            const N = T[O];
+            if (typeof N != "object")
               continue;
-            const { $data: q } = L.definition, H = D[N];
-            q && H && (D[N] = ne(H));
+            const { $data: q } = N.definition, K = B[O];
+            q && K && (B[O] = j(K));
           }
         }
-        return A;
+        return 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]));
+      _removeAllSchemas(I, k) {
+        for (const T in I) {
+          const x = I[T];
+          (!k || k.test(T)) && (typeof x == "string" ? delete I[T] : x && !x.meta && (this._cache.delete(x.schema), delete I[T]));
         }
       }
-      _addSchema(A, k, T, x = this.opts.validateSchema, I = this.opts.addUsedSchema) {
-        let D;
-        const { schemaId: N } = this.opts;
-        if (typeof A == "object")
-          D = A[N];
+      _addSchema(I, k, T, x = this.opts.validateSchema, A = this.opts.addUsedSchema) {
+        let B;
+        const { schemaId: O } = this.opts;
+        if (typeof I == "object")
+          B = I[O];
         else {
           if (this.opts.jtd)
             throw new Error("schema must be object");
-          if (typeof A != "boolean")
+          if (typeof I != "boolean")
             throw new Error("schema must be object or boolean");
         }
-        let L = this._cache.get(A);
-        if (L !== void 0)
-          return 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;
+        let N = this._cache.get(I);
+        if (N !== void 0)
+          return N;
+        T = (0, v.normalizeId)(B || T);
+        const q = v.getSchemaRefs.call(this, I, T);
+        return N = new g.SchemaEnv({ schema: I, schemaId: O, meta: k, baseId: T, localRefs: q }), this._cache.set(N.schema, N), A && !T.startsWith("#") && (T && this._checkUnique(T), this.refs[T] = N), x && this.validateSchema(I, !0), N;
       }
-      _checkUnique(A) {
-        if (this.schemas[A] || this.refs[A])
-          throw new Error(`schema with key or id "${A}" already exists`);
+      _checkUnique(I) {
+        if (this.schemas[I] || this.refs[I])
+          throw new Error(`schema with key or id "${I}" already exists`);
       }
-      _compileSchemaEnv(A) {
-        if (A.meta ? this._compileMetaSchema(A) : g.compileSchema.call(this, A), !A.validate)
+      _compileSchemaEnv(I) {
+        if (I.meta ? this._compileMetaSchema(I) : g.compileSchema.call(this, I), !I.validate)
           throw new Error("ajv implementation error");
-        return A.validate;
+        return I.validate;
       }
-      _compileMetaSchema(A) {
+      _compileMetaSchema(I) {
         const k = this.opts;
         this.opts = this._metaOpts;
         try {
-          g.compileSchema.call(this, A);
+          g.compileSchema.call(this, I);
         } finally {
           this.opts = k;
         }
       }
     }
     m.ValidationError = u.default, m.MissingRefError = _.default, l.default = m;
-    function b(B, A, k, T = "error") {
-      for (const x in B) {
-        const I = x;
-        I in A && this.logger[T](`${k}: option ${x}. ${B[I]}`);
+    function b(D, I, k, T = "error") {
+      for (const x in D) {
+        const A = x;
+        A in I && this.logger[T](`${k}: option ${x}. ${D[A]}`);
       }
     }
-    function w(B) {
-      return B = (0, v.normalizeId)(B), this.schemas[B] || this.refs[B];
+    function w(D) {
+      return D = (0, v.normalizeId)(D), this.schemas[D] || this.refs[D];
     }
     function U() {
-      const B = this.opts.schemas;
-      if (B)
-        if (Array.isArray(B))
-          this.addSchema(B);
+      const D = this.opts.schemas;
+      if (D)
+        if (Array.isArray(D))
+          this.addSchema(D);
         else
-          for (const A in B)
-            this.addSchema(B[A], A);
+          for (const I in D)
+            this.addSchema(D[I], I);
     }
     function P() {
-      for (const B in this.opts.formats) {
-        const A = this.opts.formats[B];
-        A && this.addFormat(B, A);
+      for (const D in this.opts.formats) {
+        const I = this.opts.formats[D];
+        I && this.addFormat(D, I);
       }
     }
-    function C(B) {
-      if (Array.isArray(B)) {
-        this.addVocabulary(B);
+    function C(D) {
+      if (Array.isArray(D)) {
+        this.addVocabulary(D);
         return;
       }
       this.logger.warn("keywords option as map is deprecated, pass array");
-      for (const A in B) {
-        const k = B[A];
-        k.keyword || (k.keyword = A), this.addKeyword(k);
+      for (const I in D) {
+        const k = D[I];
+        k.keyword || (k.keyword = I), this.addKeyword(k);
       }
     }
-    function O() {
-      const B = { ...this.opts };
-      for (const A of e)
-        delete B[A];
-      return B;
+    function L() {
+      const D = { ...this.opts };
+      for (const I of e)
+        delete D[I];
+      return D;
     }
-    const z = { log() {
+    const F = { log() {
     }, warn() {
     }, error() {
     } };
-    function M(B) {
-      if (B === !1)
-        return z;
-      if (B === void 0)
+    function M(D) {
+      if (D === !1)
+        return F;
+      if (D === void 0)
         return console;
-      if (B.log && B.warn && B.error)
-        return B;
+      if (D.log && D.warn && D.error)
+        return D;
       throw new Error("logger must implement log, warn and error methods");
     }
     const G = /^[a-z_$][a-z0-9_$:-]*$/i;
-    function V(B, A) {
+    function H(D, I) {
       const { RULES: k } = this;
-      if ((0, y.eachItem)(B, (T) => {
+      if ((0, y.eachItem)(D, (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))
+      }), !!I && I.$data && !("code" in I || "validate" in I))
         throw new Error('$data keyword must have "code" or "validate" function');
     }
-    function K(B, A, k) {
+    function W(D, I, k) {
       var T;
-      const x = A?.post;
+      const x = I?.post;
       if (k && x)
         throw new Error('keyword with "post" flag cannot have "type"');
-      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)
+      const { RULES: A } = this;
+      let B = x ? A.post : A.rules.find(({ type: N }) => N === k);
+      if (B || (B = { type: k, rules: [] }, A.rules.push(B)), A.keywords[D] = !0, !I)
         return;
-      const N = {
-        keyword: B,
+      const O = {
+        keyword: D,
         definition: {
-          ...A,
-          type: (0, S.getJSONTypes)(A.type),
-          schemaType: (0, S.getJSONTypes)(A.schemaType)
+          ...I,
+          type: (0, S.getJSONTypes)(I.type),
+          schemaType: (0, S.getJSONTypes)(I.schemaType)
         }
       };
-      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));
+      I.before ? Q.call(this, B, O, I.before) : B.rules.push(O), A.all[D] = O, (T = I.implements) === null || T === void 0 || T.forEach((N) => this.addKeyword(N));
     }
-    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 Q(D, I, k) {
+      const T = D.rules.findIndex((x) => x.keyword === k);
+      T >= 0 ? D.rules.splice(T, 0, I) : (D.rules.push(I), this.logger.warn(`rule ${k} is not defined`));
     }
-    function J(B) {
-      let { metaSchema: A } = B;
-      A !== void 0 && (B.$data && this.opts.$data && (A = ne(A)), B.validateSchema = this.compile(A, !0));
+    function ie(D) {
+      let { metaSchema: I } = D;
+      I !== void 0 && (D.$data && this.opts.$data && (I = j(I)), D.validateSchema = this.compile(I, !0));
     }
-    const X = {
+    const J = {
       $ref: "https://raw.githubusercontent.com/ajv-validator/ajv/master/lib/refs/data.json#"
     };
-    function ne(B) {
-      return { anyOf: [B, X] };
+    function j(D) {
+      return { anyOf: [D, J] };
     }
   })(Br)), Br;
 }
@@ -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 = Z(), u = De(), _ = vn(), h = re(), g = {
+  const l = Ir(), o = Ee(), c = X(), u = De(), _ = vn(), h = ne(), g = {
     keyword: "$ref",
     schemaType: "string",
     code(S) {
@@ -3133,14 +3133,14 @@ function Ol() {
         v(S, P, U, U.$async);
       }
       function w(U) {
-        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({
+        const P = y.scopeValue("schema", s.code.source === !0 ? { ref: U, code: (0, c.stringify)(U) } : { ref: U }), C = y.name("valid"), L = S.subschema({
           schema: U,
           dataTypes: [],
           schemaPath: c.nil,
           topSchemaRef: P,
           errSchemaPath: E
         }, C);
-        S.mergeEvaluated(O), S.ok(C);
+        S.mergeEvaluated(L), S.ok(C);
       }
     }
   };
@@ -3178,15 +3178,15 @@ function Ol() {
         if (C && !C.dynamicProps)
           C.props !== void 0 && (e.props = h.mergeEvaluated.props(a, C.props, e.props));
         else {
-          const O = a.var("props", (0, c._)`${U}.evaluated.props`);
-          e.props = h.mergeEvaluated.props(a, O, e.props, c.Name);
+          const L = a.var("props", (0, c._)`${U}.evaluated.props`);
+          e.props = h.mergeEvaluated.props(a, L, 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 O = a.var("items", (0, c._)`${U}.evaluated.items`);
-          e.items = h.mergeEvaluated.items(a, O, e.items, c.Name);
+          const L = a.var("items", (0, c._)`${U}.evaluated.items`);
+          e.items = h.mergeEvaluated.items(a, L, 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 = Z(), o = l.operators, c = {
+  const l = X(), 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 = Z(), c = {
+  const l = X(), 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 = Z(), o = re(), c = Gl(), _ = {
+  const l = X(), o = ne(), 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 = Z(), u = {
+  const l = Ee(), o = X(), 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 = Z(), c = {
+  const l = X(), 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 = Z(), c = re(), _ = {
+  const l = Ee(), o = X(), c = ne(), _ = {
     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 = Z(), c = {
+  const l = X(), 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 = Z(), c = re(), u = bn(), h = {
+  const l = yr(), o = X(), c = ne(), u = bn(), h = {
     keyword: "uniqueItems",
     type: "array",
     schemaType: "boolean",
@@ -3467,7 +3467,7 @@ var Ei = {}, Ss;
 function Zl() {
   if (Ss) return Ei;
   Ss = 1, Object.defineProperty(Ei, "__esModule", { value: !0 });
-  const l = Z(), o = re(), c = bn(), _ = {
+  const l = X(), o = ne(), 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 = Z(), o = re(), c = bn(), _ = {
+  const l = X(), o = ne(), 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 = Z(), o = re(), u = {
+  const l = X(), o = ne(), 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 = Z(), o = re(), c = Ee(), u = {
+  const l = X(), o = ne(), 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 = Z(), o = re(), c = Ee(), u = zo(), h = {
+  const l = X(), o = ne(), 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 = Z(), o = re(), u = {
+  const l = X(), o = ne(), 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 = Z(), c = re(), u = Ee();
+    const o = X(), c = ne(), 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 = Z(), o = re(), u = {
+  const l = X(), o = ne(), 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 = Z(), c = De(), u = re(), h = {
+  const l = Ee(), o = X(), c = De(), u = ne(), h = {
     keyword: "additionalProperties",
     type: ["object"],
     schemaType: ["boolean", "object"],
@@ -3893,7 +3893,7 @@ var Fi = {}, Fs;
 function nd() {
   if (Fs) return Fi;
   Fs = 1, Object.defineProperty(Fi, "__esModule", { value: !0 });
-  const l = Jt(), o = Ee(), c = re(), u = Ro(), _ = {
+  const l = Jt(), o = Ee(), c = ne(), u = Ro(), _ = {
     keyword: "properties",
     type: "object",
     schemaType: "object",
@@ -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 = Z(), c = re(), u = re(), _ = {
+  const l = Ee(), o = X(), c = ne(), u = ne(), _ = {
     keyword: "patternProperties",
     type: "object",
     schemaType: "object",
@@ -3969,7 +3969,7 @@ var Bi = {}, Bs;
 function ad() {
   if (Bs) return Bi;
   Bs = 1, Object.defineProperty(Bi, "__esModule", { value: !0 });
-  const l = re(), o = {
+  const l = ne(), o = {
     keyword: "not",
     schemaType: ["object", "boolean"],
     trackErrors: !0,
@@ -4008,7 +4008,7 @@ var Li = {}, Ls;
 function ld() {
   if (Ls) return Li;
   Ls = 1, Object.defineProperty(Li, "__esModule", { value: !0 });
-  const l = Z(), o = re(), u = {
+  const l = X(), o = ne(), u = {
     keyword: "oneOf",
     schemaType: "array",
     trackErrors: !0,
@@ -4044,7 +4044,7 @@ var $i = {}, $s;
 function dd() {
   if ($s) return $i;
   $s = 1, Object.defineProperty($i, "__esModule", { value: !0 });
-  const l = re(), o = {
+  const l = ne(), o = {
     keyword: "allOf",
     schemaType: "array",
     code(c) {
@@ -4066,7 +4066,7 @@ var Oi = {}, Os;
 function fd() {
   if (Os) return Oi;
   Os = 1, Object.defineProperty(Oi, "__esModule", { value: !0 });
-  const l = Z(), o = re(), u = {
+  const l = X(), o = ne(), u = {
     keyword: "if",
     schemaType: ["object", "boolean"],
     trackErrors: !0,
@@ -4113,7 +4113,7 @@ var Ni = {}, Ns;
 function ud() {
   if (Ns) return Ni;
   Ns = 1, Object.defineProperty(Ni, "__esModule", { value: !0 });
-  const l = re(), o = {
+  const l = ne(), o = {
     keyword: ["then", "else"],
     schemaType: ["object", "boolean"],
     code({ keyword: c, parentSchema: u, it: _ }) {
@@ -4151,7 +4151,7 @@ var Mi = {}, ji = {}, js;
 function hd() {
   if (js) return ji;
   js = 1, Object.defineProperty(ji, "__esModule", { value: !0 });
-  const l = Z(), c = {
+  const l = X(), c = {
     keyword: "format",
     type: ["number", "string"],
     schemaType: "string",
@@ -4200,8 +4200,8 @@ function hd() {
           }
         }
         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];
+          const C = P instanceof RegExp ? (0, l.regexpCode)(P) : E.code.formats ? (0, l._)`${E.code.formats}${(0, l.getProperty)(v)}` : void 0, L = h.scopeValue("formats", { key: v, ref: P, code: C });
+          return typeof P == "object" && !(P instanceof RegExp) ? [P.type || "string", P.validate, (0, l._)`${L}.validate`] : ["string", P, L];
         }
         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 = Z(), o = yd(), c = vn(), u = Ir(), _ = re(), g = {
+  const l = X(), o = yd(), c = vn(), u = Ir(), _ = ne(), g = {
     keyword: "discriminator",
     type: "object",
     schemaType: "object",
@@ -4302,37 +4302,37 @@ function gd() {
         var m;
         const b = {}, w = P(E);
         let U = !0;
-        for (let z = 0; z < a.length; z++) {
-          let M = a[z];
+        for (let F = 0; F < a.length; F++) {
+          let M = a[F];
           if (M?.$ref && !(0, _.schemaHasRulesButRef)(M, t.self.RULES)) {
-            const V = M.$ref;
-            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 H = M.$ref;
+            if (M = c.resolveRef.call(t.self, t.schemaEnv.root, t.baseId, H), M instanceof c.SchemaEnv && (M = M.schema), M === void 0)
+              throw new u.default(t.opts.uriResolver, t.baseId, H);
           }
           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 || P(M)), C(G, z);
+          U = U && (w || P(M)), C(G, F);
         }
         if (!U)
           throw new Error(`discriminator: "${e}" must be required`);
         return b;
-        function P({ required: z }) {
-          return Array.isArray(z) && z.includes(e);
-        }
-        function C(z, M) {
-          if (z.const)
-            O(z.const, M);
-          else if (z.enum)
-            for (const G of z.enum)
-              O(G, M);
+        function P({ required: F }) {
+          return Array.isArray(F) && F.includes(e);
+        }
+        function C(F, M) {
+          if (F.const)
+            L(F.const, M);
+          else if (F.enum)
+            for (const G of F.enum)
+              L(G, M);
           else
             throw new Error(`discriminator: "properties/${e}" must have "const" or "enum"`);
         }
-        function O(z, M) {
-          if (typeof z != "string" || z in b)
+        function L(F, M) {
+          if (typeof F != "string" || F in b)
             throw new Error(`discriminator: "${e}" values must be unique strings`);
-          b[z] = M;
+          b[F] = M;
         }
       }
     }
@@ -4372,7 +4372,7 @@ function wn() {
     Object.defineProperty(o, "KeywordCxt", { enumerable: !0, get: function() {
       return S.KeywordCxt;
     } });
-    var y = Z();
+    var y = X();
     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 = Z(), _ = Gt(), h = Jt(), g = Xt(), n = De(), v = "errorMessage", S = new c.Name("emUsed"), y = {
+    const c = wn(), u = X(), _ = Gt(), h = Jt(), g = Xt(), n = De(), v = "errorMessage", S = new c.Name("emUsed"), y = {
       required: "missingProperty",
       dependencies: "property",
       dependentRequired: "property"
@@ -4419,61 +4419,61 @@ function Pd() {
           const U = m, P = u.strConcat(n.default.instancePath, w.errorPath);
           d.if(c._`${n.default.errors} > 0`, () => {
             if (typeof U == "object") {
-              const [T, x] = O(U);
-              x && z(x), T && M(T), G(C(U));
+              const [T, x] = L(U);
+              x && F(x), T && M(T), G(C(U));
             }
             const k = typeof U == "string" ? U : U._;
-            k && V(k), s.keepErrors || K();
+            k && H(k), s.keepErrors || W();
           });
           function C({ properties: k, items: T }) {
             const x = {};
             if (k) {
               x.props = {};
-              for (const I in k)
-                x.props[I] = [];
+              for (const A in k)
+                x.props[A] = [];
             }
             if (T) {
               x.items = {};
-              for (let I = 0; I < T.length; I++)
-                x.items[I] = [];
+              for (let A = 0; A < T.length; A++)
+                x.items[A] = [];
             }
             return x;
           }
-          function O(k) {
+          function L(k) {
             let T, x;
-            for (const I in k) {
-              if (I === "properties" || I === "items")
+            for (const A in k) {
+              if (A === "properties" || A === "items")
                 continue;
-              const D = k[I];
-              if (typeof D == "object") {
+              const B = k[A];
+              if (typeof B == "object") {
                 T || (T = {});
-                const N = T[I] = {};
-                for (const L in D)
-                  N[L] = [];
+                const O = T[A] = {};
+                for (const N in B)
+                  O[N] = [];
               } else
-                x || (x = {}), x[I] = [];
+                x || (x = {}), x[A] = [];
             }
             return [T, x];
           }
-          function z(k) {
-            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 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}}` });
+          function F(k) {
+            const T = d.const("emErrors", c.stringify(k)), x = d.const("templates", j(k, m));
+            d.forOf("err", n.default.vErrors, (N) => d.if(Q(N, T), () => d.code(c._`${T}[${N}.keyword].push(${N})`).assign(c._`${N}.${S}`, !0)));
+            const { singleError: A } = s;
+            if (A) {
+              const N = d.let("message", c._`""`), q = d.let("paramsErrors", c._`[]`);
+              B((K) => {
+                d.if(N, () => d.code(c._`${N} += ${typeof A == "string" ? A : ";"}`)), d.code(c._`${N} += ${O(K)}`), d.assign(q, c._`${q}.concat(${T}[${K}])`);
+              }), g.reportError(f, { message: N, params: c._`{errors: ${q}}` });
             } else
-              D((L) => g.reportError(f, {
-                message: N(L),
-                params: c._`{errors: ${T}[${L}]}`
+              B((N) => g.reportError(f, {
+                message: O(N),
+                params: c._`{errors: ${T}[${N}]}`
               }));
-            function D(L) {
-              d.forIn("key", T, (q) => d.if(c._`${T}[${q}].length`, () => L(q)));
+            function B(N) {
+              d.forIn("key", T, (q) => d.if(c._`${T}[${q}].length`, () => N(q)));
             }
-            function N(L) {
-              return c._`${L} in ${x} ? ${x}[${L}]() : ${b}[${L}]`;
+            function O(N) {
+              return c._`${N} in ${x} ? ${x}[${N}]() : ${b}[${N}]`;
             }
           }
           function M(k) {
@@ -4481,20 +4481,20 @@ function Pd() {
             for (const q in k)
               x.push([
                 q,
-                ne(k[q], m[q])
+                j(k[q], m[q])
               ]);
-            const I = d.const("templates", d.object(...x)), D = d.scopeValue("obj", {
+            const A = d.const("templates", d.object(...x)), B = 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, 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}]`);
+            }), O = d.let("emPropParams"), N = d.let("emParamsErrors");
+            d.forOf("err", n.default.vErrors, (q) => d.if(Q(q, T), () => {
+              d.assign(O, c._`${B}[${q}.keyword]`), d.assign(N, c._`${T}[${q}.keyword][${q}.params[${O}]]`), d.if(N, () => d.code(c._`${N}.push(${q})`).assign(c._`${q}.${S}`, !0));
+            })), d.forIn("key", T, (q) => d.forIn("keyProp", c._`${T}[${q}]`, (K) => {
+              d.assign(N, c._`${T}[${q}][${K}]`), d.if(c._`${N}.length`, () => {
+                const z = d.const("tmpl", c._`${A}[${q}] && ${A}[${q}][${K}]`);
                 g.reportError(f, {
-                  message: c._`${F} ? ${F}() : ${b}[${q}][${H}]`,
-                  params: c._`{errors: ${L}}`
+                  message: c._`${z} ? ${z}() : ${b}[${q}][${K}]`,
+                  params: c._`{errors: ${N}}`
                 });
               });
             }));
@@ -4503,35 +4503,35 @@ function Pd() {
             const { props: T, items: x } = k;
             if (!T && !x)
               return;
-            const I = c._`typeof ${p} == "object"`, D = c._`Array.isArray(${p})`, N = d.let("emErrors");
-            let L, q;
-            const H = d.let("templates");
-            T && x ? (L = d.let("emChildKwd"), d.if(I), d.if(D, () => {
-              F(x, m.items), d.assign(L, c.str`items`);
+            const A = c._`typeof ${p} == "object"`, B = c._`Array.isArray(${p})`, O = d.let("emErrors");
+            let N, q;
+            const K = d.let("templates");
+            T && x ? (N = d.let("emChildKwd"), d.if(A), d.if(B, () => {
+              z(x, m.items), d.assign(N, c.str`items`);
             }, () => {
-              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`, () => {
+              z(T, m.properties), d.assign(N, c.str`properties`);
+            }), q = c._`[${N}]`) : x ? (d.if(B), z(x, m.items), q = c._`.items`) : T && (d.if(u.and(A, u.not(B))), z(T, m.properties), q = c._`.properties`), d.forOf("err", n.default.vErrors, (R) => ie(R, O, ($) => d.code(c._`${O}[${$}].push(${R})`).assign(c._`${R}.${S}`, !0))), d.forIn("key", O, (R) => d.if(c._`${O}[${R}].length`, () => {
               g.reportError(f, {
-                message: c._`${R} in ${H} ? ${H}[${R}]() : ${b}${q}[${R}]`,
-                params: c._`{errors: ${N}[${R}]}`
+                message: c._`${R} in ${K} ? ${K}[${R}]() : ${b}${q}[${R}]`,
+                params: c._`{errors: ${O}[${R}]}`
               }), d.assign(c._`${n.default.vErrors}[${n.default.errors}-1].instancePath`, c._`${P} + "/" + ${R}.replace(/~/g, "~0").replace(/\\//g, "~1")`);
             })), d.endIf();
-            function F(R, $) {
-              d.assign(N, c.stringify(R)), d.assign(H, ne(R, $));
+            function z(R, $) {
+              d.assign(O, c.stringify(R)), d.assign(K, j(R, $));
             }
           }
-          function V(k) {
+          function H(k) {
             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),
+            d.forOf("err", n.default.vErrors, (x) => d.if(J(x), () => d.code(c._`${T}.push(${x})`).assign(c._`${x}.${S}`, !0))), d.if(c._`${T}.length`, () => g.reportError(f, {
+              message: D(k),
               params: c._`{errors: ${T}}`
             }));
           }
-          function K() {
+          function W() {
             const k = d.const("emErrs", c._`[]`);
             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, T) {
+          function Q(k, T) {
             return u.and(
               c._`${k}.keyword !== ${v}`,
               c._`!${k}.${S}`,
@@ -4542,31 +4542,31 @@ function Pd() {
               c._`/^\\/[^\\/]*$/.test(${k}.schemaPath.slice(${w.errSchemaPath.length}))`
             );
           }
-          function J(k, T, x) {
+          function ie(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", {
+              const A = d.scopeValue("pattern", {
                 ref: /^\/([^/]*)(?:\/|$)/,
                 code: c._`new RegExp("^\\\/([^/]*)(?:\\\/|$)")`
-              }), 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));
+              }), B = d.const("emMatches", c._`${A}.exec(${k}.instancePath.slice(${P}.length))`), O = d.const("emChild", c._`${B} && ${B}[1].replace(/~1/g, "/").replace(/~0/g, "~")`);
+              d.if(c._`${O} !== undefined && ${O} in ${T}`, () => x(O));
             });
           }
-          function X(k) {
+          function J(k) {
             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, T) {
+          function j(k, T) {
             const x = [];
-            for (const I in k) {
-              const D = T[I];
-              E.test(D) && x.push([I, A(D)]);
+            for (const A in k) {
+              const B = T[A];
+              E.test(B) && x.push([A, I(B)]);
             }
             return d.object(...x);
           }
-          function B(k) {
+          function D(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 A(k) {
-            return c._`function(){return ${B(k)}}`;
+          function I(k) {
+            return c._`function(){return ${D(k)}}`;
           }
         },
         metaSchema: {
@@ -4612,8 +4612,8 @@ var Vi = { exports: {} }, Hr = {}, Zs;
 function kd() {
   return Zs || (Zs = 1, (function(l) {
     Object.defineProperty(l, "__esModule", { value: !0 }), l.formatNames = l.fastFormats = l.fullFormats = void 0;
-    function o(z, M) {
-      return { validate: z, compare: M };
+    function o(F, M) {
+      return { validate: F, compare: M };
     }
     l.fullFormats = {
       // date: http://tools.ietf.org/html/rfc3339#section-5.6
@@ -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: O,
+      regex: L,
       // uuid: http://tools.ietf.org/html/rfc4122
       uuid: /^(?:urn:uuid:)?[0-9a-f]{8}-(?:[0-9a-f]{4}-){3}[0-9a-f]{12}$/i,
       // JSON-pointer: https://tools.ietf.org/html/rfc6901
@@ -4676,96 +4676,96 @@ function kd() {
       // http://www.w3.org/TR/html5/forms.html#valid-e-mail-address (search for 'wilful violation')
       email: /^[a-z0-9.!#$%&'*+/=?^_`{|}~-]+@[a-z0-9](?:[a-z0-9-]{0,61}[a-z0-9])?(?:\.[a-z0-9](?:[a-z0-9-]{0,61}[a-z0-9])?)*$/i
     }, l.formatNames = Object.keys(l.fullFormats);
-    function c(z) {
-      return z % 4 === 0 && (z % 100 !== 0 || z % 400 === 0);
+    function c(F) {
+      return F % 4 === 0 && (F % 100 !== 0 || F % 400 === 0);
     }
     const u = /^(\d\d\d\d)-(\d\d)-(\d\d)$/, _ = [0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31];
-    function h(z) {
-      const M = u.exec(z);
+    function h(F) {
+      const M = u.exec(F);
       if (!M)
         return !1;
-      const G = +M[1], V = +M[2], K = +M[3];
-      return V >= 1 && V <= 12 && K >= 1 && K <= (V === 2 && c(G) ? 29 : _[V]);
+      const G = +M[1], H = +M[2], W = +M[3];
+      return H >= 1 && H <= 12 && W >= 1 && W <= (H === 2 && c(G) ? 29 : _[H]);
     }
-    function g(z, M) {
-      if (z && M)
-        return z > M ? 1 : z < M ? -1 : 0;
+    function g(F, M) {
+      if (F && M)
+        return F > M ? 1 : F < M ? -1 : 0;
     }
     const n = /^(\d\d):(\d\d):(\d\d(?:\.\d+)?)(z|([+-])(\d\d)(?::?(\d\d))?)?$/i;
-    function v(z) {
+    function v(F) {
       return function(G) {
-        const V = n.exec(G);
-        if (!V)
+        const H = n.exec(G);
+        if (!H)
           return !1;
-        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)
+        const W = +H[1], Q = +H[2], ie = +H[3], J = H[4], j = H[5] === "-" ? -1 : 1, D = +(H[6] || 0), I = +(H[7] || 0);
+        if (D > 23 || I > 59 || F && !J)
           return !1;
-        if (K <= 23 && ee <= 59 && J < 60)
+        if (W <= 23 && Q <= 59 && ie < 60)
           return !0;
-        const k = ee - A * ne, T = K - B * ne - (k < 0 ? 1 : 0);
-        return (T === 23 || T === -1) && (k === 59 || k === -1) && J < 61;
+        const k = Q - I * j, T = W - D * j - (k < 0 ? 1 : 0);
+        return (T === 23 || T === -1) && (k === 59 || k === -1) && ie < 61;
       };
     }
-    function S(z, M) {
-      if (!(z && M))
+    function S(F, M) {
+      if (!(F && M))
         return;
-      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;
+      const G = (/* @__PURE__ */ new Date("2020-01-01T" + F)).valueOf(), H = (/* @__PURE__ */ new Date("2020-01-01T" + M)).valueOf();
+      if (G && H)
+        return G - H;
     }
-    function y(z, M) {
-      if (!(z && M))
+    function y(F, M) {
+      if (!(F && M))
         return;
-      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 G = n.exec(F), H = n.exec(M);
+      if (G && H)
+        return F = G[1] + G[2] + G[3], M = H[1] + H[2] + H[3], F > M ? 1 : F < M ? -1 : 0;
     }
     const E = /t|\s/i;
-    function t(z) {
-      const M = v(z);
-      return function(V) {
-        const K = V.split(E);
-        return K.length === 2 && h(K[0]) && M(K[1]);
+    function t(F) {
+      const M = v(F);
+      return function(H) {
+        const W = H.split(E);
+        return W.length === 2 && h(W[0]) && M(W[1]);
       };
     }
-    function a(z, M) {
-      if (!(z && M))
+    function a(F, M) {
+      if (!(F && M))
         return;
-      const G = new Date(z).valueOf(), V = new Date(M).valueOf();
-      if (G && V)
-        return G - V;
+      const G = new Date(F).valueOf(), H = new Date(M).valueOf();
+      if (G && H)
+        return G - H;
     }
-    function e(z, M) {
-      if (!(z && M))
+    function e(F, M) {
+      if (!(F && M))
         return;
-      const [G, V] = z.split(E), [K, ee] = M.split(E), J = g(G, K);
-      if (J !== void 0)
-        return J || S(V, ee);
+      const [G, H] = F.split(E), [W, Q] = M.split(E), ie = g(G, W);
+      if (ie !== void 0)
+        return ie || S(H, Q);
     }
     const r = /\/|:/, s = /^(?:[a-z][a-z0-9+\-.]*:)(?:\/?\/(?:(?:[a-z0-9\-._~!$&'()*+,;=:]|%[0-9a-f]{2})*@)?(?:\[(?:(?:(?:(?:[0-9a-f]{1,4}:){6}|::(?:[0-9a-f]{1,4}:){5}|(?:[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){4}|(?:(?:[0-9a-f]{1,4}:){0,1}[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){3}|(?:(?:[0-9a-f]{1,4}:){0,2}[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){2}|(?:(?:[0-9a-f]{1,4}:){0,3}[0-9a-f]{1,4})?::[0-9a-f]{1,4}:|(?:(?:[0-9a-f]{1,4}:){0,4}[0-9a-f]{1,4})?::)(?:[0-9a-f]{1,4}:[0-9a-f]{1,4}|(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?))|(?:(?:[0-9a-f]{1,4}:){0,5}[0-9a-f]{1,4})?::[0-9a-f]{1,4}|(?:(?:[0-9a-f]{1,4}:){0,6}[0-9a-f]{1,4})?::)|[Vv][0-9a-f]+\.[a-z0-9\-._~!$&'()*+,;=:]+)\]|(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?)|(?:[a-z0-9\-._~!$&'()*+,;=]|%[0-9a-f]{2})*)(?::\d*)?(?:\/(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})*)*|\/(?:(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})+(?:\/(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})*)*)?|(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})+(?:\/(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})*)*)(?:\?(?:[a-z0-9\-._~!$&'()*+,;=:@/?]|%[0-9a-f]{2})*)?(?:#(?:[a-z0-9\-._~!$&'()*+,;=:@/?]|%[0-9a-f]{2})*)?$/i;
-    function f(z) {
-      return r.test(z) && s.test(z);
+    function f(F) {
+      return r.test(F) && s.test(F);
     }
     const d = /^(?:[A-Za-z0-9+/]{4})*(?:[A-Za-z0-9+/]{2}==|[A-Za-z0-9+/]{3}=)?$/gm;
-    function p(z) {
-      return d.lastIndex = 0, d.test(z);
+    function p(F) {
+      return d.lastIndex = 0, d.test(F);
     }
     const m = -2147483648, b = 2 ** 31 - 1;
-    function w(z) {
-      return Number.isInteger(z) && z <= b && z >= m;
+    function w(F) {
+      return Number.isInteger(F) && F <= b && F >= m;
     }
-    function U(z) {
-      return Number.isInteger(z);
+    function U(F) {
+      return Number.isInteger(F);
     }
     function P() {
       return !0;
     }
     const C = /[^\\]\\Z/;
-    function O(z) {
-      if (C.test(z))
+    function L(F) {
+      if (C.test(F))
         return !1;
       try {
-        return new RegExp(z), !0;
+        return new RegExp(F), !0;
       } catch {
         return !1;
       }
@@ -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 = Z(), u = c.operators, _ = {
+    const o = wn(), c = X(), 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(), _ = Z(), h = new _.Name("fullFormats"), g = new _.Name("fastFormats"), n = (S, y = { keywords: !0 }) => {
+    const c = kd(), u = zd(), _ = X(), 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 = Z(), u = ["undefined", "string", "number", "object", "function", "boolean", "symbol"];
+    const c = X(), 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 = Z(), o = "http://json-schema.org/schema";
+  const l = X(), 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 = Z(), u = Pr(), _ = {
+    const c = X(), 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 = Z(), u = {
+    const c = X(), 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 = Z(), u = Pr(), _ = {
+    const c = X(), 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 = Z();
+    const c = X();
     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 = Z(), u = Pr(), _ = {
+    const c = X(), 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}`
     };
@@ -6157,11 +6157,11 @@ function ou() {
     });
     w.tracks = U;
     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;
+      const C = P.children.map((L) => {
+        const F = f({ ...L, segmentType: P.trackType });
+        if (m.has(F.id))
+          throw new Error(`${su} ${F.id}`);
+        return m.add(F.id), F;
       });
       P.children = C;
     }
@@ -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 fe(l, ...o) {
+function ce(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, de = (l) => l.copy_ || l.base_, uu = (l) => {
+var Go = (l) => nt(l) ? l?.[te] : null, ue = (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() {
-  fe(2);
+  ce(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 || fe(0, l), o;
+  return o || ce(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), fe(4)), xe(l) && (l = uo(o, l));
+    c[te].modified_ && (an(o), ce(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 _ = de(l), h = l.type_;
+  const _ = ue(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 = de(l);
+    const h = ue(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 _ = de(l);
+    const _ = ue(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 de(l);
+    return o in ue(l);
   },
   ownKeys(l) {
-    return Reflect.ownKeys(de(l));
+    return Reflect.ownKeys(ue(l));
   },
   set(l, o, c) {
-    const u = Ko(de(l), o);
+    const u = Ko(ue(l), o);
     if (u?.set)
       return u.set.call(l.draft_, c), !0;
     if (!l.modified_) {
-      const _ = Wr(de(l), o), h = _?.[te];
+      const _ = Wr(ue(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 = de(l), u = Reflect.getOwnPropertyDescriptor(c, o);
+    const c = ue(l), u = Reflect.getOwnPropertyDescriptor(c, o);
     return u && {
       [dr]: !0,
       [nn]: l.type_ !== 1 || o !== "length",
@@ -6545,13 +6545,13 @@ var Pn = {
     };
   },
   defineProperty() {
-    fe(11);
+    ce(11);
   },
   getPrototypeOf(l) {
     return We(l.base_);
   },
   setPrototypeOf() {
-    fe(12);
+    ce(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)) && fe(13), Kt.set.call(this, l, o, void 0);
+  return process.env.NODE_ENV !== "production" && isNaN(parseInt(o)) && ce(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)) && fe(14), Pn.set.call(this, l[0], o, c, l[0]);
+  return process.env.NODE_ENV !== "production" && o !== "length" && isNaN(parseInt(o)) && ce(14), Pn.set.call(this, l[0], o, c, l[0]);
 };
 function Wr(l, o) {
   const c = l[te];
-  return (c ? de(c) : l)[o];
+  return (c ? ue(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) || fe(6), u !== void 0 && !$e(u) && fe(7);
+      $e(c) || ce(6), u !== void 0 && !$e(u) && ce(7);
       let _;
       if (xe(o)) {
         const h = lo(this), g = Wt(h, o, void 0);
@@ -6630,7 +6630,7 @@ var wu = class {
         }
         return _;
       } else
-        fe(1, o);
+        ce(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) || fe(8), Be(l) && (l = Su(l));
+    xe(l) || ce(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_) && fe(9);
+    (!c || !c.isManual_) && ce(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) || fe(10, l), Wo(l);
+  return Be(l) || ce(10, l), Wo(l);
 }
 function Wo(l) {
   if (!xe(l) || Ar(l))
@@ -6810,19 +6810,19 @@ function xu() {
     for (let w = 0; w < d.length; w++) {
       const U = m[w], P = d[w];
       if ((b || p?.get(w.toString())) && U !== P) {
-        const O = U?.[te];
-        if (O && O.modified_)
+        const L = U?.[te];
+        if (L && L.modified_)
           continue;
-        const z = r.concat([w]);
+        const F = r.concat([w]);
         s.push({
           op: u,
-          path: z,
+          path: F,
           // Need to maybe clone it, as it can in fact be the original value
           // due to the base/copy inversion at the start of this function
           value: a(U)
         }), f.push({
           op: u,
-          path: z,
+          path: F,
           value: a(P)
         });
       }
@@ -6851,11 +6851,11 @@ function xu() {
       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 O = r.concat(b);
+      const L = r.concat(b);
       s.push(
-        C === h ? { op: C, path: O } : { op: C, path: O, value: a(P) }
+        C === h ? { op: C, path: L } : { op: C, path: L, value: a(P) }
       ), f.push(
-        C === _ ? { op: h, path: O } : C === h ? { op: _, path: O, value: a(U) } : { op: u, path: O, value: a(U) }
+        C === _ ? { op: h, path: L } : C === h ? { op: _, path: L, value: a(U) } : { op: u, path: L, value: a(U) }
       );
     });
   }
@@ -6910,7 +6910,7 @@ function xu() {
       for (let U = 0; U < f.length - 1; U++) {
         const P = Ze(p);
         let C = f[U];
-        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("/"));
+        typeof C != "string" && typeof C != "number" && (C = "" + C), (P === 0 || P === 1) && (C === "__proto__" || C === qt) && ce(19), $e(p) && C === ei && ce(19), p = ze(p, C), nt(p) || ce(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:
-              fe(16);
+              ce(16);
             default:
               return p[w] = b;
           }
@@ -6946,7 +6946,7 @@ function xu() {
               return delete p[w];
           }
         default:
-          fe(17, d);
+          ce(17, d);
       }
     }), e;
   }
@@ -6995,14 +6995,14 @@ function Uu() {
       };
     }
     get size() {
-      return de(this[te]).size;
+      return ue(this[te]).size;
     }
     has(S) {
-      return de(this[te]).has(S);
+      return ue(this[te]).has(S);
     }
     set(S, y) {
       const E = this[te];
-      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;
+      return g(E), (!ue(E).has(S) || ue(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), de(S).size && (c(S), Fe(S), S.assigned_ = /* @__PURE__ */ new Map(), Je(S.base_, (y) => {
+      g(S), ue(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];
-      de(E).forEach((t, a, e) => {
+      ue(E).forEach((t, a, e) => {
         S.call(y, this.get(a), a, this);
       });
     }
     get(S) {
       const y = this[te];
       g(y);
-      const E = de(y).get(S);
+      const E = ue(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 de(this[te]).keys();
+      return ue(this[te]).keys();
     }
     values() {
       const S = this.keys();
@@ -7093,7 +7093,7 @@ function Uu() {
       };
     }
     get size() {
-      return de(this[te]).size;
+      return ue(this[te]).size;
     }
     has(S) {
       const y = this[te];
@@ -7114,7 +7114,7 @@ function Uu() {
     }
     clear() {
       const S = this[te];
-      g(S), de(S).size && (h(S), Fe(S), S.copy_.clear());
+      g(S), ue(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_ && fe(3, JSON.stringify(de(v)));
+    v.revoked_ && ce(3, JSON.stringify(ue(v)));
   }
   function n(v) {
     if (v.type_ === 3 && v.copy_) {
@@ -7347,240 +7347,251 @@ function Jc(l, o) {
   } = zu(c.verify(l)), a = Nt(0), e = Nt(), r = Re(() => {
     if (e.value)
       return _.value[e.value];
-  }), s = (B) => {
-    e.value = B;
-  }, f = (B, A) => {
-    const k = {
-      isMain: B.segmentType === "frames" && !A?.length ? !0 : void 0,
-      trackType: B.segmentType,
+  }), s = (j) => {
+    e.value = j;
+  }, f = (j, D) => {
+    const I = D.some((x) => x.trackType === "frames" && x.isMain), k = j.segmentType === "frames" && !I, T = {
+      isMain: k ? !0 : void 0,
+      trackType: j.segmentType,
       trackId: o?.idFactory?.track?.() ?? Zr(),
-      children: [B]
+      children: [j]
     };
-    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;
+    return k ? D.push(T) : D.unshift(T), j.id;
+  }, d = (j, D, I) => {
+    if (D.isMain) {
+      const k = _o(D.children, I), T = j.endTime - j.startTime;
+      if (k === 0)
+        j.startTime = 0, j.endTime = T;
       else {
-        const I = A.children[T - 1];
-        B.startTime = I.endTime, B.endTime = I.endTime + x;
+        const x = D.children[k - 1];
+        j.startTime = x.endTime, j.endTime = x.endTime + T;
       }
-      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;
+      D.children.splice(k, 0, j);
+      for (let x = k; x < D.children.length; x++) {
+        const A = D.children[x], B = D.children[x - 1]?.endTime ?? 0, O = A.endTime - A.startTime;
+        A.startTime = B, A.endTime = B + O;
       }
     } else
-      A.children.push(B), A.children.sort((T, x) => T.startTime - x.startTime);
-    return B.id;
-  }, p = (B, A) => d(B, A, a.value), m = (B, A = 0) => {
-    const k = B.children;
-    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) {
-        T && (I.startTime = 0, I.endTime = D);
+      D.children.push(j), D.children.sort((k, T) => k.startTime - T.startTime);
+    return j.id;
+  }, p = (j, D = 0) => {
+    const I = j.children;
+    I.sort((T, x) => T.startTime - x.startTime);
+    const k = j.trackType === "frames" && j.isMain;
+    for (let T = D; T < I.length; T++) {
+      const x = I[T], A = x.endTime - x.startTime, B = I[T - 1];
+      if (!B) {
+        k && (x.startTime = 0, x.endTime = A);
         continue;
       }
-      (T || I.startTime < N.endTime) && (I.startTime = N.endTime, I.endTime = N.endTime + D);
-    }
-  }, b = (B) => {
-    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 === A)
-      return k;
-    if (k && !A)
-      return k;
-  }, U = (B, A) => {
-    const k = b(B), T = /* @__PURE__ */ new Set(), x = [], I = [], D = [];
+      (k || x.startTime < B.endTime) && (x.startTime = B.endTime, x.endTime = B.endTime + A);
+    }
+  }, m = (j) => {
+    const D = ur(j);
+    (!D.id || _.value[D.id]) && (D.id = o?.idFactory?.segment?.() ?? Zr());
+    const I = a.value - D.startTime;
+    return D.startTime += I, D.endTime += I, D;
+  }, b = (j, D) => {
+    const I = _.value[j];
+    if (I && I.segmentType === D)
+      return I;
+    if (I && !D)
+      return I;
+  }, w = (j, D) => {
+    const I = m(j), k = /* @__PURE__ */ new Set(), T = [], x = [], A = [];
     try {
-      c.verifySegment(k);
+      c.verifySegment(I);
     } catch {
       throw new Error("invalid segment data");
     }
-    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 Y = p(k, j);
-        return T.add(j.trackId), Y;
-      }
-      const H = q.tracks;
-      for (let $ = H.length - 1; $ >= 0; $--) {
-        if (H[$].trackType !== k.segmentType)
+    const B = g((N) => {
+      if (I.segmentType === "frames") {
+        const R = I.startTime, $ = I.endTime, V = N.tracks.filter((se) => se.trackType === "frames");
+        let Y;
+        if (D) {
+          const se = V.find((de) => de.trackId === D);
+          se && (se.children.some((fe) => fe.startTime < $ && fe.endTime > R) || (Y = se));
+        }
+        if (!Y)
+          for (const se of V) {
+            if (se.trackId === D)
+              continue;
+            if (!se.children.some((fe) => fe.startTime < $ && fe.endTime > R)) {
+              Y = se;
+              break;
+            }
+          }
+        if (Y)
+          return Y.children.push(I), Y.children.sort((se, de) => se.startTime - de.startTime), k.add(Y.trackId), I.id;
+        const Z = f(I, N.tracks), oe = N.tracks.find((se) => se.children.some((de) => de.id === Z));
+        return oe && (T.push(Ye(oe)), k.add(oe.trackId)), Z;
+      }
+      const q = N.tracks;
+      for (let R = q.length - 1; R >= 0; R--) {
+        if (q[R].trackType !== I.segmentType)
           continue;
-        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((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), A = q.trackId) : (N.tracks.splice(L, 1), x.push(q.trackId)), !0;
+        const $ = q[R].children, V = Au(I, $, a.value);
+        if (V !== -1)
+          return $.splice(V, 0, I), k.add(q[R].trackId), I.id;
+      }
+      const K = f(I, q), z = N.tracks.find((R) => R.children.some(($) => $.id === K));
+      return z && (T.push(Ye(z)), k.add(z.trackId)), K;
+    }), O = [];
+    if (k.size > 0) {
+      const N = S();
+      for (const q of k) {
+        const K = N.tracks.find((z) => z.trackId === q);
+        K && (O.push(...or(K.children)), x.push(Ye(K)));
+      }
+    }
+    return { id: B, affectedSegments: O, affectedTracks: x, createdTracks: T, removedTrackIds: A };
+  }, U = (j) => {
+    let D = null;
+    const I = [], k = [], T = [], x = g((B) => {
+      for (let O = 0; O < B.tracks.length; O++) {
+        const N = B.tracks[O], q = N.children.findIndex((K) => K.id === j);
+        if (q !== -1)
+          return N.children.splice(q, 1), N.children.length > 0 ? N.trackType === "frames" && N.isMain && (p(N, 0), D = N.trackId) : (B.tracks.splice(O, 1), T.push(N.trackId)), !0;
       }
       return !1;
-    }), D = [];
-    if (I && A) {
-      const L = S().tracks.find((q) => q.trackId === A);
-      L && (D.push(...or(L.children)), k.push(Ye(L)));
-    }
-    return { success: I, affectedSegments: D, affectedTracks: k, createdTracks: T, removedTrackIds: x };
-  }, C = (B) => {
-    const A = /* @__PURE__ */ new Set(), k = [], T = [], x = [], I = g((N) => {
-      const L = N.tracks.find((R) => R.trackId === B.sourceTrackId);
-      if (!L)
+    }), A = [];
+    if (x && D) {
+      const O = S().tracks.find((N) => N.trackId === D);
+      O && (A.push(...or(O.children)), I.push(Ye(O)));
+    }
+    return { success: x, affectedSegments: A, affectedTracks: I, createdTracks: k, removedTrackIds: T };
+  }, P = (j) => {
+    const D = /* @__PURE__ */ new Set(), I = [], k = [], T = [], x = g((B) => {
+      const O = B.tracks.find((z) => z.trackId === j.sourceTrackId);
+      if (!O)
         return !1;
-      const q = L.children.findIndex((R) => R.id === B.segmentId);
-      if (q < 0)
+      const N = O.children.findIndex((z) => z.id === j.segmentId);
+      if (N < 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), A.add(L.trackId);
+      const q = O.children[N];
+      if (j.targetTrackId === j.sourceTrackId && j.isNewTrack !== !0)
+        q.startTime = j.startTime, q.endTime = j.endTime, p(O), D.add(O.trackId);
       else {
-        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 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],
-            ...R ? { isMain: !0 } : {}
+        if (O.children.splice(N, 1), O.children.length > 0 && (p(O), D.add(O.trackId)), O.children.length === 0) {
+          const z = B.tracks.findIndex((R) => R.trackId === O.trackId);
+          z >= 0 && (B.tracks.splice(z, 1), T.push(O.trackId));
+        }
+        if (q.startTime = j.startTime, q.endTime = j.endTime, j.isNewTrack && j.newTrackInsertIndex !== void 0) {
+          const z = q.segmentType === "frames" && !B.tracks.some(($) => $.trackType === "frames" && $.isMain), R = {
+            trackId: j.newTrackId ?? o?.idFactory?.track?.() ?? Zr(),
+            trackType: q.segmentType,
+            children: [q],
+            ...z ? { isMain: !0 } : {}
           };
-          if (R) {
-            const j = H.endTime - H.startTime;
-            H.startTime = 0, H.endTime = j;
+          if (z) {
+            const $ = q.endTime - q.startTime;
+            q.startTime = 0, q.endTime = $;
           }
-          N.tracks.splice(B.newTrackInsertIndex, 0, $), A.add($.trackId), T.push(Ye($));
-        } else if (B.targetTrackId) {
-          const R = N.tracks.find(($) => $.trackId === B.targetTrackId);
-          if (!R || R.trackType !== H.segmentType)
+          B.tracks.splice(j.newTrackInsertIndex, 0, R), D.add(R.trackId), k.push(Ye(R));
+        } else if (j.targetTrackId) {
+          const z = B.tracks.find((R) => R.trackId === j.targetTrackId);
+          if (!z || z.trackType !== q.segmentType)
             return !1;
-          R.trackType === "frames" ? d(
-            H,
-            R,
-            H.startTime
-          ) : (R.children.push(H), m(R)), A.add(R.trackId);
+          z.trackType === "frames" ? d(
+            q,
+            z,
+            q.startTime
+          ) : (z.children.push(q), p(z)), D.add(z.trackId);
         }
       }
       return !0;
-    }), D = [];
-    if (I) {
-      const N = S();
-      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: 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)
+    }), A = [];
+    if (x) {
+      const B = S();
+      for (const O of D) {
+        const N = B.tracks.find((q) => q.trackId === O);
+        N && (A.push(...or(N.children)), I.push(Ye(N)));
+      }
+    }
+    return { success: x, affectedSegments: A, affectedTracks: I, createdTracks: k, removedTrackIds: T };
+  }, C = (j) => {
+    let D = null;
+    const I = [], k = [], T = [], x = g((B) => {
+      const O = B.tracks.find((Z) => Z.trackId === j.trackId);
+      if (!O)
         return !1;
-      const q = L.children.findIndex((ae) => ae.id === B.segmentId);
-      if (q < 0)
+      const N = O.children.findIndex((Z) => Z.id === j.segmentId);
+      if (N < 0)
         return !1;
-      const H = L.children[q], F = H.startTime;
-      let R = B.startTime, $ = B.endTime, j = $ - R;
-      if (!Number.isFinite(j) || j < 0)
+      const q = O.children[N], K = q.startTime;
+      let z = j.startTime, R = j.endTime, $ = R - z;
+      if (!Number.isFinite($) || $ < 0)
         return !1;
-      const Y = ku(H) ? H : null;
-      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)
+      const V = ku(q) ? q : null;
+      let Y = V ? V.fromTime ?? 0 : 0;
+      if (V && z !== K) {
+        const Z = V.fromTime ?? 0, oe = z - K, se = Math.max(oe, -Z);
+        if (se !== oe && (z = K + se, $ = R - z), !Number.isFinite($) || $ < 0)
           return !1;
-        W = ae + le, Y.fromTime = W;
+        Y = Z + se, V.fromTime = Y;
       }
-      return H.startTime = R, H.endTime = $, m(L, q), A = L.trackId, !0;
-    }), D = [];
-    if (I && A) {
-      const L = S().tracks.find((q) => q.trackId === A);
-      L && D.push(...or(L.children));
+      return q.startTime = z, q.endTime = R, p(O, N), D = O.trackId, !0;
+    }), A = [];
+    if (x && D) {
+      const O = S().tracks.find((N) => N.trackId === D);
+      O && A.push(...or(O.children));
     }
-    return { success: I, affectedSegments: D, affectedTracks: k, createdTracks: T, removedTrackIds: x };
+    return { success: x, affectedSegments: A, affectedTracks: I, createdTracks: k, removedTrackIds: T };
   };
-  function z(B, A, k) {
-    g((T) => {
-      const x = A ?? r.value?.id;
-      if (x === void 0)
+  function L(j, D, I) {
+    g((k) => {
+      const T = D ?? r.value?.id;
+      if (T === void 0)
         return;
-      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 x = Ru(T, k);
+      x && (!I || x.segmentType === I) && j(x);
+    }, (k, T, x) => {
+      x((A) => {
+        Pu(k, T, A, c) ? Tu(k, T, A, n) : n();
       });
     });
   }
-  const M = (B, A) => g((k) => {
-    const T = k.tracks.find((q) => q.trackType === "frames" && q.isMain);
-    if (!T || T.children.length < 2)
+  const F = (j, D) => g((I) => {
+    const k = I.tracks.find((N) => N.trackType === "frames" && N.isMain);
+    if (!k || k.children.length < 2)
       return !1;
-    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)
+    const T = Math.max(0, D ?? a.value);
+    let x = _o(k.children, T) - 1;
+    if (x = Math.min(Math.max(0, x), k.children.length - 2), !j || typeof j != "object" || typeof j.id != "string" || typeof j.name != "string" || typeof j.duration != "number" || j.duration < 0)
       return !0;
-    const D = T.children[I], N = T.children[I + 1], L = ur(B);
-    return D.transitionIn = L, N.transitionOut = L, !0;
-  }), G = (B) => g((A) => {
-    const k = A.tracks.find((L) => L.trackType === "frames" && L.isMain);
-    if (!k)
+    const A = k.children[x], B = k.children[x + 1], O = ur(j);
+    return A.transitionIn = O, B.transitionOut = O, !0;
+  }), M = (j) => g((D) => {
+    const I = D.tracks.find((O) => O.trackType === "frames" && O.isMain);
+    if (!I)
       return !1;
-    const T = k.children.findIndex((L) => L.id === B);
-    if (T === -1)
+    const k = I.children.findIndex((O) => O.id === j);
+    if (k === -1)
       return !1;
-    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, 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)
+    const T = I.children[k], x = k > 0 ? I.children[k - 1] : void 0, A = k < I.children.length - 1 ? I.children[k + 1] : void 0;
+    let B = !1;
+    return T.transitionIn && (T.transitionIn = void 0, A && (A.transitionOut = void 0), B = !0), T.transitionOut && (T.transitionOut = void 0, x && (x.transitionIn = void 0), B = !0), B;
+  }), G = (j, D) => {
+    const I = h.value.frames?.find((T) => T.trackType === "frames" && T.isMain);
+    if (!I)
       return !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 = {
+    const k = I.children.findIndex((T) => T.id === j);
+    return k === -1 ? !1 : (L((T) => {
+      T.transitionIn && D(T.transitionIn);
+    }, I.children[k].id, "frames"), L((T) => {
+      T.transitionOut && D(T.transitionOut);
+    }, I.children[k + 1].id, "frames"), !0);
+  }, H = (j, D) => g((I) => {
+    const k = I.tracks.find((T) => T.trackId === j);
+    return k ? (k.trackId = D, !0) : !1;
+  }), W = {
     success: !1,
     affectedSegments: [],
     affectedTracks: [],
     createdTracks: [],
     removedTrackIds: [],
     removedSegmentIds: []
-  }, J = () => Cu(ur(Er(t.value)));
+  }, Q = () => Cu(ur(Er(t.value)));
   return {
     videoBasicInfo: u,
     curTime: a,
@@ -7589,45 +7600,45 @@ function Jc(l, o) {
     trackMap: h,
     segmentMap: _,
     protocol: t,
-    getSegment: w,
-    addSegment: U,
-    removeSegment: P,
-    updateSegment: z,
-    moveSegment: C,
-    resizeSegment: O,
+    getSegment: b,
+    addSegment: w,
+    removeSegment: U,
+    updateSegment: L,
+    moveSegment: P,
+    resizeSegment: C,
     exportProtocol: S,
-    addTransition: M,
-    removeTransition: G,
-    updateTransition: V,
-    replaceTrackId: K,
+    addTransition: F,
+    removeTransition: M,
+    updateTransition: G,
+    replaceTrackId: H,
     undo: () => {
       if (y.value <= 0)
-        return ee;
-      const B = J();
+        return W;
+      const j = Q();
       n();
-      const A = J(), k = mo(B, A);
+      const D = Q(), I = mo(j, D);
       return {
         success: !0,
-        affectedSegments: k.affectedSegments,
-        affectedTracks: k.affectedTracks,
-        createdTracks: k.addedTracks,
-        removedTrackIds: k.removedTrackIds,
-        removedSegmentIds: k.removedSegmentIds
+        affectedSegments: I.affectedSegments,
+        affectedTracks: I.affectedTracks,
+        createdTracks: I.addedTracks,
+        removedTrackIds: I.removedTrackIds,
+        removedSegmentIds: I.removedSegmentIds
       };
     },
     redo: () => {
       if (E.value <= 0)
-        return ee;
-      const B = J();
+        return W;
+      const j = Q();
       v();
-      const A = J(), k = mo(B, A);
+      const D = Q(), I = mo(j, D);
       return {
         success: !0,
-        affectedSegments: k.affectedSegments,
-        affectedTracks: k.affectedTracks,
-        createdTracks: k.addedTracks,
-        removedTrackIds: k.removedTrackIds,
-        removedSegmentIds: k.removedSegmentIds
+        affectedSegments: I.affectedSegments,
+        affectedTracks: I.affectedTracks,
+        createdTracks: I.addedTracks,
+        removedTrackIds: I.removedTrackIds,
+        removedSegmentIds: I.removedSegmentIds
       };
     },
     redoCount: E,
@@ -7700,7 +7711,7 @@ function Bu(l) {
 }
 var Zo = (l) => {
   throw TypeError(l);
-}, Xo = (l, o, c) => o.has(l) || Zo("Cannot " + c), ie = (l, o, c) => (Xo(l, o, "read from private field"), c ? c.call(l) : o.get(l)), we = (l, o, c) => o.has(l) ? Zo("Cannot add the same private member more than once") : o instanceof WeakSet ? o.add(l) : o.set(l, c), _e = (l, o, c, u) => (Xo(l, o, "write to private field"), o.set(l, c), c);
+}, Xo = (l, o, c) => o.has(l) || Zo("Cannot " + c), re = (l, o, c) => (Xo(l, o, "read from private field"), c ? c.call(l) : o.get(l)), we = (l, o, c) => o.has(l) ? Zo("Cannot add the same private member more than once") : o instanceof WeakSet ? o.add(l) : o.set(l, c), me = (l, o, c, u) => (Xo(l, o, "write to private field"), o.set(l, c), c);
 const Jo = "KGZ1bmN0aW9uKCl7InVzZSBzdHJpY3QiO2Z1bmN0aW9uIHUobil7aWYobj09PSIvIilyZXR1cm57cGFyZW50Om51bGwsbmFtZToiIn07Y29uc3QgZT1uLnNwbGl0KCIvIikuZmlsdGVyKGk9PmkubGVuZ3RoPjApO2lmKGUubGVuZ3RoPT09MCl0aHJvdyBFcnJvcigiSW52YWxpZCBwYXRoIik7Y29uc3QgYT1lW2UubGVuZ3RoLTFdLHI9Ii8iK2Uuc2xpY2UoMCwtMSkuam9pbigiLyIpO3JldHVybntuYW1lOmEscGFyZW50OnJ9fWFzeW5jIGZ1bmN0aW9uIHcobixlKXtjb25zdHtwYXJlbnQ6YSxuYW1lOnJ9PXUobik7aWYoYT09bnVsbClyZXR1cm4gYXdhaXQgbmF2aWdhdG9yLnN0b3JhZ2UuZ2V0RGlyZWN0b3J5KCk7Y29uc3QgaT1hLnNwbGl0KCIvIikuZmlsdGVyKHQ9PnQubGVuZ3RoPjApO3RyeXtsZXQgdD1hd2FpdCBuYXZpZ2F0b3Iuc3RvcmFnZS5nZXREaXJlY3RvcnkoKTtmb3IoY29uc3QgcyBvZiBpKXQ9YXdhaXQgdC5nZXREaXJlY3RvcnlIYW5kbGUocyx7Y3JlYXRlOmUuY3JlYXRlfSk7aWYoZS5pc0ZpbGUpcmV0dXJuIGF3YWl0IHQuZ2V0RmlsZUhhbmRsZShyLHtjcmVhdGU6ZS5jcmVhdGV9KX1jYXRjaCh0KXtpZih0Lm5hbWU9PT0iTm90Rm91bmRFcnJvciIpcmV0dXJuIG51bGw7dGhyb3cgdH19Y29uc3QgZj17fTtzZWxmLm9ubWVzc2FnZT1hc3luYyBuPT57dmFyIGk7Y29uc3R7ZXZ0VHlwZTplLGFyZ3M6YX09bi5kYXRhO2xldCByPWZbYS5maWxlSWRdO3RyeXtsZXQgdDtjb25zdCBzPVtdO2lmKGU9PT0icmVnaXN0ZXIiKXtjb25zdCBsPWF3YWl0IHcoYS5maWxlUGF0aCx7Y3JlYXRlOiEwLGlzRmlsZTohMH0pO2lmKGw9PW51bGwpdGhyb3cgRXJyb3IoYG5vdCBmb3VuZCBmaWxlOiAke2EuZmlsZUlkfWApO3I9YXdhaXQgbC5jcmVhdGVTeW5jQWNjZXNzSGFuZGxlKHttb2RlOmEubW9kZX0pLGZbYS5maWxlSWRdPXJ9ZWxzZSBpZihlPT09ImNsb3NlIilhd2FpdCByLmNsb3NlKCksZGVsZXRlIGZbYS5maWxlSWRdO2Vsc2UgaWYoZT09PSJ0cnVuY2F0ZSIpYXdhaXQgci50cnVuY2F0ZShhLm5ld1NpemUpO2Vsc2UgaWYoZT09PSJ3cml0ZSIpe2NvbnN0e2RhdGE6bCxvcHRzOm99PW4uZGF0YS5hcmdzO3Q9YXdhaXQgci53cml0ZShsLG8pfWVsc2UgaWYoZT09PSJyZWFkIil7Y29uc3R7b2Zmc2V0Omwsc2l6ZTpvfT1uLmRhdGEuYXJncyxnPW5ldyBVaW50OEFycmF5KG8pLGQ9YXdhaXQgci5yZWFkKGcse2F0Omx9KSxjPWcuYnVmZmVyO3Q9ZD09PW8/YzooKGk9Yy50cmFuc2Zlcik9PW51bGw/dm9pZCAwOmkuY2FsbChjLGQpKT8/Yy5zbGljZSgwLGQpLHMucHVzaCh0KX1lbHNlIGU9PT0iZ2V0U2l6ZSI/dD1hd2FpdCByLmdldFNpemUoKTplPT09ImZsdXNoIiYmYXdhaXQgci5mbHVzaCgpO3NlbGYucG9zdE1lc3NhZ2Uoe2V2dFR5cGU6ImNhbGxiYWNrIixjYklkOm4uZGF0YS5jYklkLHJldHVyblZhbDp0fSxzKX1jYXRjaCh0KXtjb25zdCBzPXQ7c2VsZi5wb3N0TWVzc2FnZSh7ZXZ0VHlwZToidGhyb3dFcnJvciIsY2JJZDpuLmRhdGEuY2JJZCxlcnJNc2c6cy5uYW1lKyI6ICIrcy5tZXNzYWdlK2AKYCtKU09OLnN0cmluZ2lmeShuLmRhdGEpfSl9fX0pKCk7Ci8vIyBzb3VyY2VNYXBwaW5nVVJMPW9wZnMtd29ya2VyLUY0UldscWNfLmpzLm1hcAo=", Du = (l) => Uint8Array.from(atob(l), (o) => o.charCodeAt(0)), yo = typeof self < "u" && self.Blob && new Blob([Du(Jo)], { type: "text/javascript;charset=utf-8" });
 function Lu(l) {
   let o;
@@ -7846,38 +7857,38 @@ function Ne(l) {
 var Te, cr, Lt;
 const Nu = class Qo {
   constructor(o) {
-    we(this, Te), we(this, cr), we(this, Lt), _e(this, Te, o);
+    we(this, Te), we(this, cr), we(this, Lt), me(this, Te, o);
     const { parent: c, name: u } = kr(o);
-    _e(this, cr, u), _e(this, Lt, c);
+    me(this, cr, u), me(this, Lt, c);
   }
   get kind() {
     return "dir";
   }
   get name() {
-    return ie(this, cr);
+    return re(this, cr);
   }
   get path() {
-    return ie(this, Te);
+    return re(this, Te);
   }
   get parent() {
-    return ie(this, Lt) == null ? null : Ne(ie(this, Lt));
+    return re(this, Lt) == null ? null : Ne(re(this, Lt));
   }
   /**
    * Creates the directory.
    * return A promise that resolves when the directory is created.
    */
   async create() {
-    return await Oe(ie(this, Te), {
+    return await Oe(re(this, Te), {
       create: !0,
       isFile: !1
-    }), Ne(ie(this, Te));
+    }), Ne(re(this, Te));
   }
   /**
    * Checks if the directory exists.
    * return A promise that resolves to true if the directory exists, otherwise false.
    */
   async exists() {
-    return await Oe(ie(this, Te), {
+    return await Oe(re(this, Te), {
       create: !1,
       isFile: !1
     }) instanceof FileSystemDirectoryHandle;
@@ -7894,7 +7905,7 @@ const Nu = class Qo {
         console.warn(u);
       }
     try {
-      await ln(ie(this, Te));
+      await ln(re(this, Te));
     } catch (c) {
       console.warn(c);
     }
@@ -7904,14 +7915,14 @@ const Nu = class Qo {
    * return A promise that resolves to an array of objects representing the children.
    */
   async children() {
-    const o = await Oe(ie(this, Te), {
+    const o = await Oe(re(this, Te), {
       create: !1,
       isFile: !1
     });
     if (o == null) return [];
     const c = [];
     for await (const u of o.values())
-      c.push((u.kind === "file" ? Se : Ne)(dn(ie(this, Te), u.name)));
+      c.push((u.kind === "file" ? Se : Ne)(dn(re(this, Te), u.name)));
     return c;
   }
   async copyTo(o) {
@@ -7980,55 +7991,55 @@ const Gu = class tl {
     we(this, be), we(this, $t), we(this, hr), we(this, Ot), we(this, pr), we(this, ke, 0), we(this, _r, async () => {
     }), we(this, mr, /* @__PURE__ */ (() => {
       let h = null;
-      return () => (_e(this, ke, ie(this, ke) + 1), h != null || (h = new Promise(async (g, n) => {
+      return () => (me(this, ke, re(this, ke) + 1), h != null || (h = new Promise(async (g, n) => {
         try {
           const v = await $u(
-            ie(this, pr),
-            ie(this, be),
-            ie(this, Ot)
+            re(this, pr),
+            re(this, be),
+            re(this, Ot)
           );
-          _e(this, _r, async () => {
-            h != null && (h = null, _e(this, ke, 0), await v.close().catch(console.error));
+          me(this, _r, async () => {
+            h != null && (h = null, me(this, ke, 0), await v.close().catch(console.error));
           }), g([
             v,
             async () => {
-              _e(this, ke, ie(this, ke) - 1), !(ie(this, ke) > 0) && (h = null, await v.close());
+              me(this, ke, re(this, ke) - 1), !(re(this, ke) > 0) && (h = null, await v.close());
             }
           ]);
         } catch (v) {
           n(v);
         }
       })), h);
-    })()), we(this, it, !1), _e(this, pr, ju()), _e(this, be, o), _e(this, Ot, {
+    })()), we(this, it, !1), me(this, pr, ju()), me(this, be, o), me(this, Ot, {
       r: "read-only",
       rw: "readwrite",
       "rw-unsafe": "readwrite-unsafe"
     }[c]);
     const { parent: u, name: _ } = kr(o);
     if (u == null) throw Error("Invalid path");
-    _e(this, hr, _), _e(this, $t, u);
+    me(this, hr, _), me(this, $t, u);
   }
   get kind() {
     return "file";
   }
   get path() {
-    return ie(this, be);
+    return re(this, be);
   }
   get name() {
-    return ie(this, hr);
+    return re(this, hr);
   }
   get parent() {
-    return ie(this, $t) == null ? null : Ne(ie(this, $t));
+    return re(this, $t) == null ? null : Ne(re(this, $t));
   }
   /**
    * Random write to file
    */
   async createWriter() {
-    if (ie(this, Ot) === "read-only") throw Error("file is read-only");
-    if (ie(this, it)) throw Error("Other writer have not been closed");
-    _e(this, it, !0);
+    if (re(this, Ot) === "read-only") throw Error("file is read-only");
+    if (re(this, it)) throw Error("Other writer have not been closed");
+    me(this, it, !0);
     try {
-      const o = new TextEncoder(), [c, u] = await ie(this, mr).call(this);
+      const o = new TextEncoder(), [c, u] = await re(this, mr).call(this);
       let _ = await c.getSize(), h = !1;
       return {
         write: async (g, n = {}) => {
@@ -8046,18 +8057,18 @@ const Gu = class tl {
         },
         close: async () => {
           if (h) throw Error("Writer is closed");
-          h = !0, _e(this, it, !1), await u();
+          h = !0, me(this, it, !1), await u();
         }
       };
     } catch (o) {
-      throw _e(this, it, !1), o;
+      throw me(this, it, !1), o;
     }
   }
   /**
    * Random access to file
    */
   async createReader() {
-    const [o, c] = await ie(this, mr).call(this);
+    const [o, c] = await re(this, mr).call(this);
     let u = !1, _ = 0;
     return {
       read: async (h, g = {}) => {
@@ -8078,7 +8089,7 @@ const Gu = class tl {
     return new TextDecoder().decode(await this.arrayBuffer());
   }
   async arrayBuffer() {
-    const o = await Oe(ie(this, be), { create: !1, isFile: !0 });
+    const o = await Oe(re(this, be), { create: !1, isFile: !0 });
     return o == null ? new ArrayBuffer(0) : (await o.getFile()).arrayBuffer();
   }
   async stream() {
@@ -8091,25 +8102,25 @@ const Gu = class tl {
   }
   async getOriginFile() {
     var o;
-    return (o = await Oe(ie(this, be), { create: !1, isFile: !0 })) == null ? void 0 : o.getFile();
+    return (o = await Oe(re(this, be), { create: !1, isFile: !0 })) == null ? void 0 : o.getFile();
   }
   async getSize() {
-    const o = await Oe(ie(this, be), { create: !1, isFile: !0 });
+    const o = await Oe(re(this, be), { create: !1, isFile: !0 });
     return o == null ? 0 : (await o.getFile()).size;
   }
   async exists() {
-    return await Oe(ie(this, be), {
+    return await Oe(re(this, be), {
       create: !1,
       isFile: !0
     }) instanceof FileSystemFileHandle;
   }
   async remove(o = {}) {
     if (o.force === !0) {
-      await ie(this, _r).call(this), await ln(ie(this, be)), fn.delete(ie(this, be));
+      await re(this, _r).call(this), await ln(re(this, be)), fn.delete(re(this, be));
       return;
     }
-    if (ie(this, ke) > 0) throw Error("exists unclosed reader/writer");
-    await ln(ie(this, be));
+    if (re(this, ke) > 0) throw Error("exists unclosed reader/writer");
+    await ln(re(this, be));
   }
   async copyTo(o) {
     if (o instanceof tl)
@@ -10025,8 +10036,8 @@ function Yu() {
           this.held_bits = C.readUint16(), this.num_held_bits = 16;
         },
         extract_bits: function(C) {
-          var O = this.held_bits >> this.num_held_bits - C & (1 << C) - 1;
-          return this.num_held_bits -= C, O;
+          var L = this.held_bits >> this.num_held_bits - C & (1 << C) - 1;
+          return this.num_held_bits -= C, L;
         }
       };
       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) {
@@ -10792,33 +10803,33 @@ 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, 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")) {
+      var a, e, r, s, f, d, p, m, b, w, U, P, C, L, F, M, G, H, W, Q, ie, J, j, D;
+      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, H = -1, W = -1, Q = -1, ie = -1, J = 0, j = 0, D = 0, y.initSampleGroups(t, null, w, U), !(typeof s > "u")) {
         for (a = 0; a < s.sample_sizes.length; a++) {
-          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);
+          var I = {};
+          I.number = a, I.track_id = t.tkhd.track_id, I.timescale = t.mdia.mdhd.timescale, I.alreadyRead = 0, t.samples[a] = I, I.size = s.sample_sizes[a], t.samples_size += I.size, a === 0 ? (L = 1, C = 0, I.chunk_index = L, I.chunk_run_index = C, G = r.samples_per_chunk[C], M = 0, C + 1 < r.first_chunk.length ? F = r.first_chunk[C + 1] - 1 : F = 1 / 0) : a < G ? (I.chunk_index = L, I.chunk_run_index = C) : (L++, I.chunk_index = L, M = 0, L <= F || (C++, C + 1 < r.first_chunk.length ? F = r.first_chunk[C + 1] - 1 : F = 1 / 0), I.chunk_run_index = C, G += r.samples_per_chunk[C]), I.description_index = r.sample_description_index[I.chunk_run_index] - 1, I.description = m.entries[I.description_index], I.offset = e.chunk_offsets[I.chunk_index - 1] + M, M += I.size, a > H && (W++, H < 0 && (H = 0), H += f.sample_counts[W]), a > 0 ? (t.samples[a - 1].duration = f.sample_deltas[W], t.samples_duration += t.samples[a - 1].duration, I.dts = t.samples[a - 1].dts + t.samples[a - 1].duration) : I.dts = 0, d ? (a >= Q && (ie++, Q < 0 && (Q = 0), Q += d.sample_counts[ie]), I.cts = t.samples[a].dts + d.sample_offsets[ie]) : I.cts = I.dts, p ? (a == p.sample_numbers[J] - 1 ? (I.is_sync = !0, J++) : (I.is_sync = !1, I.degradation_priority = 0), b && b.entries[j].sample_delta + D == a + 1 && (I.subsamples = b.entries[j].subsamples, D += b.entries[j].sample_delta, j++)) : I.is_sync = !0, y.process_sdtp(t.mdia.minf.stbl.sdtp, I, I.number), P ? I.degradation_priority = P.priority[a] : I.degradation_priority = 0, b && b.entries[j].sample_delta + D == a && (I.subsamples = b.entries[j].subsamples, D += b.entries[j].sample_delta), (w.length > 0 || U.length > 0) && y.setSampleGroupProperties(t, I, 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, P, C, O;
+      var t, a, e, r, s, f, d, p, m, b, w, U, P, C, L;
       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), 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]), 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);
+                var F = w.truns[a];
+                for (e = 0; e < F.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, F.flags & n.TRUN_FLAGS_SIZE && (C.size = F.sample_size[e]), U.samples_size += C.size, C.duration = s, F.flags & n.TRUN_FLAGS_DURATION && (C.duration = F.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, F.flags & n.TRUN_FLAGS_CTS_OFFSET && (C.cts = C.dts + F.sample_composition_time_offset[e]), L = d, F.flags & n.TRUN_FLAGS_FLAGS ? L = F.sample_flags[e] : e === 0 && F.flags & n.TRUN_FLAGS_FIRST_FLAG && (L = F.first_sample_flags), C.is_sync = !(L >> 16 & 1), C.is_leading = L >> 26 & 3, C.depends_on = L >> 24 & 3, C.is_depended_on = L >> 22 & 3, C.has_redundancy = L >> 20 & 3, C.degradation_priority = L & 65535;
+                  var M = !!(w.tfhd.flags & n.TFHD_FLAG_BASE_DATA_OFFSET), G = !!(w.tfhd.flags & n.TFHD_FLAG_DEFAULT_BASE_IS_MOOF), H = !!(F.flags & n.TRUN_FLAGS_DATA_OFFSET), W = 0;
+                  M ? W = w.tfhd.base_data_offset : G || a === 0 ? W = b.start : W = p, a === 0 && e === 0 ? H ? C.offset = W + F.data_offset : C.offset = W : 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) {
                 U.has_fragment_subsamples = !0;
-                var ee = w.first_sample_index;
+                var Q = w.first_sample_index;
                 for (a = 0; a < w.subs.entries.length; a++)
-                  ee += w.subs.entries[a].sample_delta, C = U.samples[ee - 1], C.subsamples = w.subs.entries[a].subsamples;
+                  Q += w.subs.entries[a].sample_delta, C = U.samples[Q - 1], C.subsamples = w.subs.entries[a].subsamples;
               }
             }
       }
@@ -11235,9 +11246,9 @@ function ic() {
     o.getDurationString = function(e, r) {
       var s;
       function f(U, P) {
-        for (var C = "" + U, O = C.split("."); O[0].length < P; )
-          O[0] = "0" + O[0];
-        return O.join(".");
+        for (var C = "" + U, L = C.split("."); L[0].length < P; )
+          L[0] = "0" + L[0];
+        return L.join(".");
       }
       e < 0 ? (s = !0, e = -e) : s = !1;
       var d = r || 1, p = e / d, m = Math.floor(p / 3600);
@@ -13098,15 +13109,15 @@ function ic() {
       var r, s, f = {
         held_bits: void 0,
         num_held_bits: 0,
-        stream_read_1_bytes: function(z) {
-          this.held_bits = z.readUint8(), this.num_held_bits = 8;
+        stream_read_1_bytes: function(F) {
+          this.held_bits = F.readUint8(), this.num_held_bits = 8;
         },
-        stream_read_2_bytes: function(z) {
-          this.held_bits = z.readUint16(), this.num_held_bits = 16;
+        stream_read_2_bytes: function(F) {
+          this.held_bits = F.readUint16(), this.num_held_bits = 16;
         },
-        extract_bits: function(z) {
-          var M = this.held_bits >> this.num_held_bits - z & (1 << z) - 1;
-          return this.num_held_bits -= z, M;
+        extract_bits: function(F) {
+          var M = this.held_bits >> this.num_held_bits - F & (1 << F) - 1;
+          return this.num_held_bits -= F, M;
         }
       };
       if (f.stream_read_1_bytes(e), f.extract_bits(5), this.lengthSizeMinusOne = f.extract_bits(2), this.ptl_present_flag = f.extract_bits(1), this.ptl_present_flag) {
@@ -13146,10 +13157,10 @@ function ic() {
         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 (P.nalu_type != w && P.nalu_type != b && (C = e.readUint16()), s = 0; s < C; s++) {
-          var O = e.readUint16();
+          var L = e.readUint16();
           P.push({
-            data: e.readUint8Array(O),
-            length: O
+            data: e.readUint8Array(L),
+            length: L
           });
         }
       }
@@ -13794,8 +13805,8 @@ function ic() {
               var C = new n.hvcCBox();
               C.parse(new c(r.hevcDecoderConfigRecord)), p.addBox(C);
             } else if (r.vpcDecoderConfigRecord) {
-              var O = new n.vpcCBox();
-              O.parse(new c(r.vpcDecoderConfigRecord)), p.addBox(O);
+              var L = new n.vpcCBox();
+              L.parse(new c(r.vpcDecoderConfigRecord)), p.addBox(L);
             }
             break;
           case "Audio":
@@ -13820,8 +13831,8 @@ function ic() {
         r.description && p.addBox(r.description), r.description_boxes && r.description_boxes.forEach(function(M) {
           p.addBox(M);
         }), d.add("dinf").add("dref").addEntry(new n["url Box"]().set("flags", 1));
-        var z = d.add("stbl");
-        return z.add("stsd").addEntry(p), z.add("stts").set("sample_counts", []).set("sample_deltas", []), z.add("stsc").set("first_chunk", []).set("samples_per_chunk", []).set("sample_description_index", []), z.add("stco").set("chunk_offsets", []), z.add("stsz").set("sample_sizes", []), this.moov.mvex.add("trex").set("track_id", r.id).set("default_sample_description_index", r.default_sample_description_index || 1).set("default_sample_duration", r.default_sample_duration || 0).set("default_sample_size", r.default_sample_size || 0).set("default_sample_flags", r.default_sample_flags || 0), this.buildTrakSampleLists(s), r.id;
+        var F = d.add("stbl");
+        return F.add("stsd").addEntry(p), F.add("stts").set("sample_counts", []).set("sample_deltas", []), F.add("stsc").set("first_chunk", []).set("samples_per_chunk", []).set("sample_description_index", []), F.add("stco").set("chunk_offsets", []), F.add("stsz").set("sample_sizes", []), this.moov.mvex.add("trex").set("track_id", r.id).set("default_sample_description_index", r.default_sample_description_index || 1).set("default_sample_duration", r.default_sample_duration || 0).set("default_sample_size", r.default_sample_size || 0).set("default_sample_flags", r.default_sample_flags || 0), this.buildTrakSampleLists(s), r.id;
       }
     }, n.Box.prototype.computeSize = function(e) {
       var r = e || new u();
@@ -13849,8 +13860,8 @@ function ic() {
       }
     }, t.initSampleGroups = function(e, r, s, f, d) {
       var p, m, b, w;
-      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;
+      function U(P, C, L) {
+        this.grouping_type = P, this.grouping_type_parameter = C, this.sbgp = L, 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++)
@@ -13881,33 +13892,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, 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")) {
+      var r, s, f, d, p, m, b, w, U, P, C, L, F, M, G, H, W, Q, ie, J, j, D, I, 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, L = e.mdia.minf.stbl.stdp, P = e.mdia.minf.stbl.sbgps, C = e.mdia.minf.stbl.sgpds, Q = -1, ie = -1, J = -1, j = -1, D = 0, I = 0, k = 0, t.initSampleGroups(e, null, P, C), !(typeof d > "u")) {
         for (r = 0; r < d.sample_sizes.length; r++) {
           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);
+          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, F = 0, T.chunk_index = M, T.chunk_run_index = F, W = f.samples_per_chunk[F], H = 0, F + 1 < f.first_chunk.length ? G = f.first_chunk[F + 1] - 1 : G = 1 / 0) : r < W ? (T.chunk_index = M, T.chunk_run_index = F) : (M++, T.chunk_index = M, H = 0, M <= G || (F++, F + 1 < f.first_chunk.length ? G = f.first_chunk[F + 1] - 1 : G = 1 / 0), T.chunk_run_index = F, W += f.samples_per_chunk[F]), 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] + H, H += T.size, r > Q && (ie++, Q < 0 && (Q = 0), Q += p.sample_counts[ie]), r > 0 ? (e.samples[r - 1].duration = p.sample_deltas[ie], 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 >= J && (j++, J < 0 && (J = 0), J += m.sample_counts[j]), T.cts = e.samples[r].dts + m.sample_offsets[j]) : T.cts = T.dts, b ? (r == b.sample_numbers[D] - 1 ? (T.is_sync = !0, D++) : (T.is_sync = !1, T.degradation_priority = 0), U && U.entries[I].sample_delta + k == r + 1 && (T.subsamples = U.entries[I].subsamples, k += U.entries[I].sample_delta, I++)) : T.is_sync = !0, t.process_sdtp(e.mdia.minf.stbl.sdtp, T, T.number), L ? T.degradation_priority = L.priority[r] : T.degradation_priority = 0, U && U.entries[I].sample_delta + k == r && (T.subsamples = U.entries[I].subsamples, k += U.entries[I].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, P, C, O, z, M;
+      var e, r, s, f, d, p, m, b, w, U, P, C, L, F, 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 (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++) {
+              for (P = U.trafs[e], C = this.getTrackById(P.tfhd.track_id), C.samples == null && (C.samples = []), L = this.getTrexById(P.tfhd.track_id), P.tfhd.flags & n.TFHD_FLAG_SAMPLE_DESC ? f = P.tfhd.default_sample_description_index : f = L ? L.default_sample_description_index : 1, P.tfhd.flags & n.TFHD_FLAG_SAMPLE_DUR ? d = P.tfhd.default_sample_duration : d = L ? L.default_sample_duration : 0, P.tfhd.flags & n.TFHD_FLAG_SAMPLE_SIZE ? p = P.tfhd.default_sample_size : p = L ? L.default_sample_size : 0, P.tfhd.flags & n.TFHD_FLAG_SAMPLE_FLAGS ? m = P.tfhd.default_sample_flags : m = L ? L.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);
+                  F = {}, F.moof_number = this.lastMoofIndex, F.number_in_traf = P.sample_number, P.sample_number++, F.number = C.samples.length, P.first_sample_index = C.samples.length, C.samples.push(F), F.track_id = C.tkhd.track_id, F.timescale = C.mdia.mdhd.timescale, F.description_index = f - 1, F.description = C.mdia.minf.stbl.stsd.entries[F.description_index], F.size = p, G.flags & n.TRUN_FLAGS_SIZE && (F.size = G.sample_size[s]), C.samples_size += F.size, F.duration = d, G.flags & n.TRUN_FLAGS_DURATION && (F.duration = G.sample_duration[s]), C.samples_duration += F.duration, C.first_traf_merged || s > 0 ? F.dts = C.samples[C.samples.length - 2].dts + C.samples[C.samples.length - 2].duration : (P.tfdt ? F.dts = P.tfdt.baseMediaDecodeTime : F.dts = 0, C.first_traf_merged = !0), F.cts = F.dts, G.flags & n.TRUN_FLAGS_CTS_OFFSET && (F.cts = F.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), F.is_sync = !(M >> 16 & 1), F.is_leading = M >> 26 & 3, F.depends_on = M >> 24 & 3, F.is_depended_on = M >> 22 & 3, F.has_redundancy = M >> 20 & 3, F.degradation_priority = M & 65535;
+                  var H = !!(P.tfhd.flags & n.TFHD_FLAG_BASE_DATA_OFFSET), W = !!(P.tfhd.flags & n.TFHD_FLAG_DEFAULT_BASE_IS_MOOF), Q = !!(G.flags & n.TRUN_FLAGS_DATA_OFFSET), ie = 0;
+                  H ? ie = P.tfhd.base_data_offset : W || r === 0 ? ie = U.start : ie = b, r === 0 && s === 0 ? Q ? F.offset = ie + G.data_offset : F.offset = ie : F.offset = b, b = F.offset + F.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, F, F.number_in_traf, P.sample_groups_info);
                 }
               }
               if (P.subs) {
                 C.has_fragment_subsamples = !0;
-                var X = P.first_sample_index;
+                var J = 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;
+                  J += P.subs.entries[r].sample_delta, F = C.samples[J - 1], F.subsamples = P.subs.entries[r].subsamples;
               }
             }
       }
@@ -14010,8 +14021,8 @@ function ic() {
                 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 O = p.iprp.ipco.boxes[C.property_index - 1];
-                    d.properties[O.type] = O, d.properties.boxes.push(O);
+                    var L = p.iprp.ipco.boxes[C.property_index - 1];
+                    d.properties[L.type] = L, d.properties.boxes.push(L);
                   }
                 }
             }
@@ -14196,7 +14207,7 @@ const ll = [], So = ["debug", "info", "warn", "error"].reduce(
     }
   }),
   {}
-), si = /* @__PURE__ */ new Map(), oe = {
+), si = /* @__PURE__ */ new Map(), le = {
   /**
    * 设置记录日志的级别
    *
@@ -14235,20 +14246,20 @@ const ll = [], So = ["debug", "info", "warn", "error"].reduce(
     );
   }
 };
-si.set(oe.debug, 0);
-si.set(oe.info, 1);
-si.set(oe.warn, 2);
-si.set(oe.error, 3);
+si.set(le.debug, 0);
+si.set(le.info, 1);
+si.set(le.warn, 2);
+si.set(le.error, 3);
 (async function() {
-  if (await Promise.resolve(), !(globalThis.navigator == null || globalThis.document == null) && (oe.info(
+  if (await Promise.resolve(), !(globalThis.navigator == null || globalThis.document == null) && (le.info(
     `@webav version: 1.2.7, date: ${(/* @__PURE__ */ new Date()).toLocaleDateString()}`
-  ), oe.info(globalThis.navigator.userAgent), document.addEventListener("visibilitychange", () => {
-    oe.info(`visibilitychange: ${document.visibilityState}`);
+  ), le.info(globalThis.navigator.userAgent), document.addEventListener("visibilitychange", () => {
+    le.info(`visibilitychange: ${document.visibilityState}`);
   }), "PressureObserver" in globalThis)) {
     let l = "";
     new PressureObserver((o) => {
       const c = JSON.stringify(o.map((u) => u.state));
-      c !== l && (oe.info(`cpu state change: ${c}`), l = c);
+      c !== l && (le.info(`cpu state change: ${c}`), l = c);
     }).observe("cpu");
   }
 })();
@@ -14733,7 +14744,7 @@ function en(l) {
 }
 class Ie {
   #r = zn++;
-  #d = oe.create(`MP4Clip id:${this.#r},`);
+  #d = le.create(`MP4Clip id:${this.#r},`);
   ready;
   #n = !1;
   #s = {
@@ -15105,15 +15116,15 @@ async function Uo(l, o = {}) {
         t.mp4boxFile,
         t.info
       );
-      if (u.video = r ?? null, u.audio = s ?? null, r == null && s == null && oe.error("MP4Clip no video and audio track"), s != null) {
+      if (u.video = r ?? null, u.audio = s ?? null, r == null && s == null && le.error("MP4Clip no video and audio track"), s != null) {
         const { supported: f } = await AudioDecoder.isConfigSupported(s);
-        f || oe.error(`MP4Clip audio codec is not supported: ${s.codec}`);
+        f || le.error(`MP4Clip audio codec is not supported: ${s.codec}`);
       }
       if (r != null) {
         const { supported: f } = await VideoDecoder.isConfigSupported(r);
-        f || oe.error(`MP4Clip video codec is not supported: ${r.codec}`);
+        f || le.error(`MP4Clip video codec is not supported: ${r.codec}`);
       }
-      oe.info(
+      le.info(
         "mp4BoxFile moov ready",
         {
           ...t.info,
@@ -15141,7 +15152,7 @@ async function Uo(l, o = {}) {
     throw Error("MP4Clip stream is done, but not emit ready");
   if (E == null)
     throw Error("MP4Clip stream not contain any sample");
-  return _n(_), oe.info("mp4 stream parsed"), {
+  return _n(_), le.info("mp4 stream parsed"), {
     videoSamples: _,
     audioSamples: h,
     decoderConf: u,
@@ -15226,12 +15237,12 @@ class ul {
     if (u) {
       const _ = this.samples.slice(this.#i, c);
       if (_[0]?.is_idr !== !0)
-        oe.warn("First sample not idr frame");
+        le.warn("First sample not idr frame");
       else {
         const h = performance.now(), g = await cl(_, this.localFileReader), n = performance.now() - h;
         if (n > 1e3) {
           const v = _[0], S = _.at(-1), y = S.offset + S.size - v.offset;
-          oe.warn(
+          le.warn(
             `Read video samples time cost: ${Math.round(n)}ms, file chunk size: ${y}`
           );
         }
@@ -15240,7 +15251,7 @@ class ul {
           onDecodingError: (v) => {
             if (this.#t)
               throw v;
-            this.#l === 0 && (this.#t = !0, oe.warn("Downgrade to software decode"), this.#a());
+            this.#l === 0 && (this.#t = !0, le.warn("Downgrade to software decode"), this.#a());
           }
         }), this.#f += g.length;
       }
@@ -15278,11 +15289,11 @@ class ul {
       },
       error: (u) => {
         if (u.message.includes("Codec reclaimed due to inactivity")) {
-          this.#r = null, oe.warn(u.message);
+          this.#r = null, le.warn(u.message);
           return;
         }
         const _ = `VideoFinder VideoDecoder err: ${u.message}, config: ${JSON.stringify(c)}, state: ${JSON.stringify(this.#_())}`;
-        throw oe.error(_), Error(_);
+        throw le.error(_), Error(_);
       }
     }), this.#r.configure(c);
   };
@@ -15446,7 +15457,7 @@ function Dc(l, o, c) {
         outputCnt: _
       }
     )}`;
-    throw oe.error(t), Error(t);
+    throw le.error(t), Error(t);
   }
   return {
     decode(y) {
@@ -15618,9 +15629,9 @@ async function jc(l, o, c, u, _, h) {
   let v = 0;
   pn(S(), n, {
     onDecodingError: (y) => {
-      oe.warn("thumbnailsByKeyFrame", y), v === 0 ? pn(S(!0), n, {
+      le.warn("thumbnailsByKeyFrame", y), v === 0 ? pn(S(!0), n, {
         onDecodingError: (E) => {
-          g.close(), oe.error("thumbnailsByKeyFrame retry soft deocde", E);
+          g.close(), le.error("thumbnailsByKeyFrame retry soft deocde", E);
         }
       }) : (h(null, !0), g.close());
     }
@@ -15644,7 +15655,7 @@ async function jc(l, o, c, u, _, h) {
             inputCnt: n.length
           }
         )}`;
-        throw oe.error(e), Error(e);
+        throw le.error(e), Error(e);
       }
     });
     return u.addEventListener("abort", () => {