@xwiki/cristal-sharedworker-impl 1.2.0-rc-1 → 1.2.0

package/dist/assets/{worker-D8G3G-8O.js → worker-jC4O7JRI.js}

@@ -52,7 +52,7 @@ function Ep() {
         } : function(S, A) {
           return S[A];
         }
-      }, b = Object.getPrototypeOf(Function), x = typeof Map == "function" && typeof Map.prototype.entries == "function" ? Map : at(), B = typeof Set == "function" && typeof Set.prototype.entries == "function" ? Set : We(), N = typeof WeakMap == "function" ? WeakMap : vt(), V = s ? /* @__PURE__ */ Symbol.for("@reflect-metadata:registry") : void 0, z = q(), G = W(z);
+      }, b = Object.getPrototypeOf(Function), x = typeof Map == "function" && typeof Map.prototype.entries == "function" ? Map : at(), B = typeof Set == "function" && typeof Set.prototype.entries == "function" ? Set : We(), N = typeof WeakMap == "function" ? WeakMap : vt(), V = s ? /* @__PURE__ */ Symbol.for("@reflect-metadata:registry") : void 0, q = z(), H = W(q);
       function ie(S, A, j, U) {
         if (be(j)) {
           if (!Pe(S))
@@ -449,7 +449,7 @@ function Ep() {
           return !0;
         }
       }
-      function q() {
+      function z() {
         var S;
         return !be(V) && Ie(i.Reflect) && Object.isExtensible(i.Reflect) && (S = i.Reflect[V]), be(S) && (S = D()), !be(V) && Ie(i.Reflect) && Object.isExtensible(i.Reflect) && Object.defineProperty(i.Reflect, V, {
           enumerable: !1,
@@ -470,7 +470,7 @@ function Ep() {
           OrdinaryOwnMetadataKeys: xe,
           OrdinaryDeleteMetadata: L
         };
-        return z.registerProvider(j), j;
+        return q.registerProvider(j), j;
         function U(ae, fe, pe) {
           var ke = A.get(ae), Be = !1;
           if (be(ke)) {
@@ -572,12 +572,12 @@ function Ep() {
         return xe;
       }
       function me(S, A, j) {
-        var U = z.getProvider(S, A);
+        var U = q.getProvider(S, A);
         if (!be(U))
           return U;
         if (j) {
-          if (z.setProvider(S, A, G))
-            return G;
+          if (q.setProvider(S, A, H))
+            return H;
           throw new Error("Illegal state.");
         }
       }
@@ -1900,13 +1900,13 @@ function yh(n, e, t = Nr) {
     const J = b, ce = r === !0 ? 1 / 0 : r;
     b = () => Dn(J(), ce);
   }
-  const z = zu(), G = () => {
-    g.stop(), z && z.active && Np(z.effects, g);
+  const q = zu(), H = () => {
+    g.stop(), q && q.active && Np(q.effects, g);
   };
   if (s && e) {
     const J = e;
     e = (...ce) => {
-      J(...ce), G();
+      J(...ce), H();
     };
   }
   let ie = V ? new Array(n.length).fill(ws) : ws;
@@ -1945,7 +1945,7 @@ function yh(n, e, t = Nr) {
         for (const ce of J) ce();
       Ws.delete(g);
     }
-  }, process.env.NODE_ENV !== "production" && (g.onTrack = t.onTrack, g.onTrigger = t.onTrigger), e ? i ? se(!0) : ie = g.run() : a ? a(se.bind(null, !0), !0) : g.run(), G.pause = g.pause.bind(g), G.resume = g.resume.bind(g), G.stop = G, G;
+  }, process.env.NODE_ENV !== "production" && (g.onTrack = t.onTrack, g.onTrigger = t.onTrigger), e ? i ? se(!0) : ie = g.run() : a ? a(se.bind(null, !0), !0) : g.run(), H.pause = g.pause.bind(g), H.resume = g.resume.bind(g), H.stop = H, H;
 }
 function Dn(n, e = 1 / 0, t) {
   if (e <= 0 || !xt(n) || n.__v_skip || (t = t || /* @__PURE__ */ new Map(), (t.get(n) || 0) >= e))
@@ -2767,104 +2767,104 @@ function ig() {
       }
     })(function(t, i) {
       var r = typeof Symbol == "function", s = r && typeof Symbol.toPrimitive < "u" ? Symbol.toPrimitive : nn("Symbol.toPrimitive not found."), a = r && typeof Symbol.iterator < "u" ? Symbol.iterator : nn("Symbol.iterator not found."), l = Object.getPrototypeOf(Function), f = typeof Map == "function" && typeof Map.prototype.entries == "function" ? Map : nn("A valid Map constructor could not be found."), h = typeof Set == "function" && typeof Set.prototype.entries == "function" ? Set : nn("A valid Set constructor could not be found."), v = typeof WeakMap == "function" ? WeakMap : nn("A valid WeakMap constructor could not be found."), g = r ? /* @__PURE__ */ Symbol.for("@reflect-metadata:registry") : void 0, b = vi(), x = kn(b);
-      function B(D, q, W, X) {
+      function B(D, z, W, X) {
         if (he(W)) {
           if (!Jt(D))
             throw new TypeError();
-          if (!Un(q))
+          if (!Un(z))
             throw new TypeError();
-          return oe(D, q);
+          return oe(D, z);
         } else {
           if (!Jt(D))
             throw new TypeError();
-          if (!qe(q))
+          if (!qe(z))
             throw new TypeError();
           if (!qe(X) && !he(X) && !De(X))
             throw new TypeError();
-          return De(X) && (X = void 0), W = Ie(W), Ne(D, q, W, X);
+          return De(X) && (X = void 0), W = Ie(W), Ne(D, z, W, X);
         }
       }
       t("decorate", B);
-      function N(D, q) {
+      function N(D, z) {
         function W(X, me) {
           if (!qe(X))
             throw new TypeError();
           if (!he(me) && !ge(me))
             throw new TypeError();
-          $t(D, q, X, me);
+          $t(D, z, X, me);
         }
         return W;
       }
       t("metadata", N);
-      function V(D, q, W, X) {
+      function V(D, z, W, X) {
         if (!qe(W))
           throw new TypeError();
-        return he(X) || (X = Ie(X)), $t(D, q, W, X);
+        return he(X) || (X = Ie(X)), $t(D, z, W, X);
       }
       t("defineMetadata", V);
-      function z(D, q, W) {
-        if (!qe(q))
+      function q(D, z, W) {
+        if (!qe(z))
           throw new TypeError();
-        return he(W) || (W = Ie(W)), le(D, q, W);
+        return he(W) || (W = Ie(W)), le(D, z, W);
       }
-      t("hasMetadata", z);
-      function G(D, q, W) {
-        if (!qe(q))
+      t("hasMetadata", q);
+      function H(D, z, W) {
+        if (!qe(z))
           throw new TypeError();
-        return he(W) || (W = Ie(W)), ne(D, q, W);
+        return he(W) || (W = Ie(W)), ne(D, z, W);
       }
-      t("hasOwnMetadata", G);
-      function ie(D, q, W) {
-        if (!qe(q))
+      t("hasOwnMetadata", H);
+      function ie(D, z, W) {
+        if (!qe(z))
           throw new TypeError();
-        return he(W) || (W = Ie(W)), ve(D, q, W);
+        return he(W) || (W = Ie(W)), ve(D, z, W);
       }
       t("getMetadata", ie);
-      function se(D, q, W) {
-        if (!qe(q))
+      function se(D, z, W) {
+        if (!qe(z))
           throw new TypeError();
-        return he(W) || (W = Ie(W)), Ve(D, q, W);
+        return he(W) || (W = Ie(W)), Ve(D, z, W);
       }
       t("getOwnMetadata", se);
-      function J(D, q) {
+      function J(D, z) {
         if (!qe(D))
           throw new TypeError();
-        return he(q) || (q = Ie(q)), It(D, q);
+        return he(z) || (z = Ie(z)), It(D, z);
       }
       t("getMetadataKeys", J);
-      function ce(D, q) {
+      function ce(D, z) {
         if (!qe(D))
           throw new TypeError();
-        return he(q) || (q = Ie(q)), Lt(D, q);
+        return he(z) || (z = Ie(z)), Lt(D, z);
       }
       t("getOwnMetadataKeys", ce);
-      function Q(D, q, W) {
-        if (!qe(q))
+      function Q(D, z, W) {
+        if (!qe(z))
           throw new TypeError();
         he(W) || (W = Ie(W));
         var X = Bt(
-          q,
+          z,
           W,
           /*Create*/
           !1
         );
-        return he(X) ? !1 : X.OrdinaryDeleteMetadata(D, q, W);
+        return he(X) ? !1 : X.OrdinaryDeleteMetadata(D, z, W);
       }
       t("deleteMetadata", Q);
-      function oe(D, q) {
+      function oe(D, z) {
         for (var W = D.length - 1; W >= 0; --W) {
-          var X = D[W], me = X(q);
+          var X = D[W], me = X(z);
           if (!he(me) && !De(me)) {
             if (!Un(me))
               throw new TypeError();
-            q = me;
+            z = me;
           }
         }
-        return q;
+        return z;
       }
-      function Ne(D, q, W, X) {
+      function Ne(D, z, W, X) {
         for (var me = D.length - 1; me >= 0; --me) {
-          var at = D[me], We = at(q, W, X);
+          var at = D[me], We = at(z, W, X);
           if (!he(We) && !De(We)) {
             if (!qe(We))
               throw new TypeError();
@@ -2873,54 +2873,54 @@ function ig() {
         }
         return X;
       }
-      function le(D, q, W) {
-        var X = ne(D, q, W);
+      function le(D, z, W) {
+        var X = ne(D, z, W);
         if (X)
           return !0;
-        var me = dn(q);
+        var me = dn(z);
         return De(me) ? !1 : le(D, me, W);
       }
-      function ne(D, q, W) {
+      function ne(D, z, W) {
         var X = Bt(
-          q,
+          z,
           W,
           /*Create*/
           !1
         );
-        return he(X) ? !1 : dt(X.OrdinaryHasOwnMetadata(D, q, W));
+        return he(X) ? !1 : dt(X.OrdinaryHasOwnMetadata(D, z, W));
       }
-      function ve(D, q, W) {
-        var X = ne(D, q, W);
+      function ve(D, z, W) {
+        var X = ne(D, z, W);
         if (X)
-          return Ve(D, q, W);
-        var me = dn(q);
+          return Ve(D, z, W);
+        var me = dn(z);
         if (!De(me))
           return ve(D, me, W);
       }
-      function Ve(D, q, W) {
+      function Ve(D, z, W) {
         var X = Bt(
-          q,
+          z,
           W,
           /*Create*/
           !1
         );
         if (!he(X))
-          return X.OrdinaryGetOwnMetadata(D, q, W);
+          return X.OrdinaryGetOwnMetadata(D, z, W);
       }
-      function $t(D, q, W, X) {
+      function $t(D, z, W, X) {
         var me = Bt(
           W,
           X,
           /*Create*/
           !0
         );
-        me.OrdinaryDefineOwnMetadata(D, q, W, X);
+        me.OrdinaryDefineOwnMetadata(D, z, W, X);
       }
-      function It(D, q) {
-        var W = Lt(D, q), X = dn(D);
+      function It(D, z) {
+        var W = Lt(D, z), X = dn(D);
         if (X === null)
           return W;
-        var me = It(X, q);
+        var me = It(X, z);
         if (me.length <= 0)
           return W;
         if (W.length <= 0)
@@ -2935,14 +2935,14 @@ function ig() {
         }
         return We;
       }
-      function Lt(D, q) {
+      function Lt(D, z) {
         var W = Bt(
           D,
-          q,
+          z,
           /*create*/
           !1
         );
-        return W ? W.OrdinaryOwnMetadataKeys(D, q) : [];
+        return W ? W.OrdinaryOwnMetadataKeys(D, z) : [];
       }
       function fn(D) {
         if (D === null)
@@ -2976,7 +2976,7 @@ function ig() {
       function qe(D) {
         return typeof D == "object" ? D !== null : typeof D == "function";
       }
-      function Ot(D, q) {
+      function Ot(D, z) {
         switch (fn(D)) {
           case 0:
             return D;
@@ -3000,7 +3000,7 @@ function ig() {
         }
         return be(D);
       }
-      function be(D, q) {
+      function be(D, z) {
         var W, X;
         {
           var me = D.toString;
@@ -3025,8 +3025,8 @@ function ig() {
         return "" + D;
       }
       function Ie(D) {
-        var q = Ot(D);
-        return Et(q) ? q : gi(q);
+        var z = Ot(D);
+        return Et(z) ? z : gi(z);
       }
       function Jt(D) {
         return Array.isArray ? Array.isArray(D) : D instanceof Object ? D instanceof Array : Object.prototype.toString.call(D) === "[object Array]";
@@ -3047,8 +3047,8 @@ function ig() {
             return !1;
         }
       }
-      function pt(D, q) {
-        var W = D[q];
+      function pt(D, z) {
+        var W = D[z];
         if (W != null) {
           if (!tn(W))
             throw new TypeError();
@@ -3056,10 +3056,10 @@ function ig() {
         }
       }
       function Pe(D) {
-        var q = pt(D, a);
-        if (!tn(q))
+        var z = pt(D, a);
+        if (!tn(z))
           throw new TypeError();
-        var W = q.call(D);
+        var W = z.call(D);
         if (!qe(W))
           throw new TypeError();
         return W;
@@ -3068,22 +3068,22 @@ function ig() {
         return D.value;
       }
       function Kn(D) {
-        var q = D.next();
-        return q.done ? !1 : q;
+        var z = D.next();
+        return z.done ? !1 : z;
       }
       function Dt(D) {
-        var q = D.return;
-        q && q.call(D);
+        var z = D.return;
+        z && z.call(D);
       }
       function dn(D) {
-        var q = Object.getPrototypeOf(D);
-        if (typeof D != "function" || D === l || q !== l)
-          return q;
+        var z = Object.getPrototypeOf(D);
+        if (typeof D != "function" || D === l || z !== l)
+          return z;
         var W = D.prototype, X = W && Object.getPrototypeOf(W);
         if (X == null || X === Object.prototype)
-          return q;
+          return z;
         var me = X.constructor;
-        return typeof me != "function" || me === D ? q : me;
+        return typeof me != "function" || me === D ? z : me;
       }
       function nn(D) {
         throw D;
@@ -3091,7 +3091,7 @@ function ig() {
       function mi() {
         var D;
         !he(g) && typeof i.Reflect < "u" && !(g in i.Reflect) && typeof i.Reflect.defineMetadata == "function" && (D = mt(i.Reflect));
-        var q, W, X, me = new v(), at = {
+        var z, W, X, me = new v(), at = {
           registerProvider: We,
           getProvider: st,
           setProvider: A
@@ -3103,10 +3103,10 @@ function ig() {
           switch (!0) {
             case D === j:
               break;
-            case he(q):
-              q = j;
+            case he(z):
+              z = j;
               break;
-            case q === j:
+            case z === j:
               break;
             case he(W):
               W = j;
@@ -3119,12 +3119,12 @@ function ig() {
           }
         }
         function vt(j, U) {
-          if (!he(q)) {
-            if (q.isProviderFor(j, U))
-              return q;
+          if (!he(z)) {
+            if (z.isProviderFor(j, U))
+              return z;
             if (!he(W)) {
               if (W.isProviderFor(j, U))
-                return q;
+                return z;
               if (!he(X))
                 for (var F = Pe(X); ; ) {
                   var we = Kn(F);
@@ -3146,7 +3146,7 @@ function ig() {
         function S(j) {
           if (he(j))
             throw new TypeError();
-          return q === j || W === j || !he(X) && X.has(j);
+          return z === j || W === j || !he(X) && X.has(j);
         }
         function A(j, U, F) {
           if (!S(F))
@@ -3171,9 +3171,9 @@ function ig() {
         }), D;
       }
       function kn(D) {
-        var q = new v(), W = {
+        var z = new v(), W = {
           isProviderFor: function(S, A) {
-            var j = q.get(S);
+            var j = z.get(S);
             return he(j) ? !1 : j.has(A);
           },
           OrdinaryDefineOwnMetadata: We,
@@ -3184,18 +3184,18 @@ function ig() {
         };
         return b.registerProvider(W), W;
         function X(S, A, j) {
-          var U = q.get(S), F = !1;
+          var U = z.get(S), F = !1;
           if (he(U)) {
             if (!j)
               return;
-            U = new f(), q.set(S, U), F = !0;
+            U = new f(), z.set(S, U), F = !0;
           }
           var we = U.get(A);
           if (he(we)) {
             if (!j)
               return;
             if (we = new f(), U.set(A, we), !D.setProvider(S, A, W))
-              throw U.delete(A), F && q.delete(S), new Error("Wrong provider for target.");
+              throw U.delete(A), F && z.delete(S), new Error("Wrong provider for target.");
           }
           return we;
         }
@@ -3263,19 +3263,19 @@ function ig() {
           if (he(U) || !U.delete(S))
             return !1;
           if (U.size === 0) {
-            var F = q.get(A);
-            he(F) || (F.delete(j), F.size === 0 && q.delete(F));
+            var F = z.get(A);
+            he(F) || (F.delete(j), F.size === 0 && z.delete(F));
           }
           return !0;
         }
       }
       function mt(D) {
-        var q = D.defineMetadata, W = D.hasOwnMetadata, X = D.getOwnMetadata, me = D.getOwnMetadataKeys, at = D.deleteMetadata, We = new v(), vt = {
+        var z = D.defineMetadata, W = D.hasOwnMetadata, X = D.getOwnMetadata, me = D.getOwnMetadataKeys, at = D.deleteMetadata, We = new v(), vt = {
           isProviderFor: function(st, S) {
             var A = We.get(st);
             return !he(A) && A.has(S) ? !0 : me(st, S).length ? (he(A) && (A = new h(), We.set(st, A)), A.add(S), !0) : !1;
           },
-          OrdinaryDefineOwnMetadata: q,
+          OrdinaryDefineOwnMetadata: z,
           OrdinaryHasOwnMetadata: W,
           OrdinaryGetOwnMetadata: X,
           OrdinaryOwnMetadataKeys: me,
@@ -3283,12 +3283,12 @@ function ig() {
         };
         return vt;
       }
-      function Bt(D, q, W) {
-        var X = b.getProvider(D, q);
+      function Bt(D, z, W) {
+        var X = b.getProvider(D, z);
         if (!he(X))
           return X;
         if (W) {
-          if (b.setProvider(D, q, x))
+          if (b.setProvider(D, z, x))
             return x;
           throw new Error("Illegal state.");
         }
@@ -4112,22 +4112,22 @@ function qf(n, e, t, i) {
     const f = /* @__PURE__ */ (function(h, v) {
       return (g, b, x) => {
         if (x.kind === St.unmanaged) return;
-        const B = (function(z) {
-          let G;
-          if (z.tags.size === 0) G = void 0;
+        const B = (function(q) {
+          let H;
+          if (q.tags.size === 0) H = void 0;
           else {
-            if (z.tags.size !== 1) return;
+            if (q.tags.size !== 1) return;
             {
-              const [se, J] = z.tags.entries().next().value;
-              G = { key: se, value: J };
+              const [se, J] = q.tags.entries().next().value;
+              H = { key: se, value: J };
             }
           }
-          const ie = Zs.is(z.value) ? z.value.unwrap() : z.value;
-          return z.kind === St.multipleInjection ? { chained: z.chained, isMultiple: !0, name: z.name, optional: z.optional, serviceIdentifier: ie, tag: G } : { isMultiple: !1, name: z.name, optional: z.optional, serviceIdentifier: ie, tag: G };
+          const ie = Zs.is(q.value) ? q.value.unwrap() : q.value;
+          return q.kind === St.multipleInjection ? { chained: q.chained, isMultiple: !0, name: q.name, optional: q.optional, serviceIdentifier: ie, tag: H } : { isMultiple: !1, name: q.name, optional: q.optional, serviceIdentifier: ie, tag: H };
         })(x);
         if (B !== void 0) {
-          const z = g.operations.getPlan(B);
-          if (z !== void 0 && z.tree.root.isContextFree) return z.tree.root;
+          const q = g.operations.getPlan(B);
+          if (q !== void 0 && q.tree.root.isContextFree) return q.tree.root;
         }
         const N = v(g, b, x), V = new mg(g, h, b, x, N);
         return Xl(B, g.operations, V, { bindingConstraintsList: b, chainedBindings: x.kind === St.multipleInjection && x.chained, optionalBindings: x.optional }), V;
@@ -4145,22 +4145,22 @@ function qf(n, e, t, i) {
   })(n, t), s = /* @__PURE__ */ (function(a, l) {
     const f = /* @__PURE__ */ (function(h, v) {
       return (g, b, x) => {
-        const B = (function(z) {
-          let G;
-          if (z.tags.size === 0) G = void 0;
+        const B = (function(q) {
+          let H;
+          if (q.tags.size === 0) H = void 0;
           else {
-            if (z.tags.size !== 1) return;
+            if (q.tags.size !== 1) return;
             {
-              const [se, J] = z.tags.entries().next().value;
-              G = { key: se, value: J };
+              const [se, J] = q.tags.entries().next().value;
+              H = { key: se, value: J };
             }
           }
-          const ie = Zs.is(z.value) ? z.value.unwrap() : z.value;
-          return z.kind === bn.multipleInjection ? { chained: z.chained, isMultiple: !0, name: z.name, optional: z.optional, serviceIdentifier: ie, tag: G } : { isMultiple: !1, name: z.name, optional: z.optional, serviceIdentifier: ie, tag: G };
+          const ie = Zs.is(q.value) ? q.value.unwrap() : q.value;
+          return q.kind === bn.multipleInjection ? { chained: q.chained, isMultiple: !0, name: q.name, optional: q.optional, serviceIdentifier: ie, tag: H } : { isMultiple: !1, name: q.name, optional: q.optional, serviceIdentifier: ie, tag: H };
         })(x);
         if (B !== void 0) {
-          const z = g.operations.getPlan(B);
-          if (z !== void 0 && z.tree.root.isContextFree) return z.tree.root;
+          const q = g.operations.getPlan(B);
+          if (q !== void 0 && q.tree.root.isContextFree) return q.tree.root;
         }
         const N = v(g, b, x), V = new vg(g, h, b, x, N);
         return Xl(B, g.operations, V, { bindingConstraintsList: b, chainedBindings: x.kind === bn.multipleInjection && x.chained, optionalBindings: x.optional }), V;
@@ -5927,7 +5927,7 @@ function Ha(n, e, t = {}, i, r, s) {
   !s && !B && (process.env.NODE_ENV === "production" || !r) && (i.state.value[n] = {});
   const N = /* @__PURE__ */ Ec({});
   let V;
-  function z(le) {
+  function q(le) {
     let ne;
     h = v = !1, process.env.NODE_ENV !== "production" && (x = []), typeof le == "function" ? (le(i.state.value[n]), ne = {
       type: kr.patchFunction,
@@ -5944,7 +5944,7 @@ function Ha(n, e, t = {}, i, r, s) {
       V === ve && (h = !0);
     }), v = !0, Oi(g, ne, i.state.value[n]);
   }
-  const G = s ? function() {
+  const H = s ? function() {
     const { state: ne } = t, ve = ne ? ne() : {};
     this.$patch((Ve) => {
       Ut(Ve, ve);
@@ -5996,8 +5996,8 @@ function Ha(n, e, t = {}, i, r, s) {
     // _s: scope,
     $id: n,
     $onAction: yu.bind(null, b),
-    $patch: z,
-    $reset: G,
+    $patch: q,
+    $reset: H,
     $subscribe(le, ne = {}) {
       const ve = yu(g, le, ne.detached, () => Ve()), Ve = a.run(() => Rh(() => i.state.value[n], ($t) => {
         (ne.flush === "sync" ? v : h) && le({
@@ -6039,7 +6039,7 @@ function Ha(n, e, t = {}, i, r, s) {
     set: (le) => {
       if (process.env.NODE_ENV !== "production" && r)
         throw new Error("cannot set hotState");
-      z((ne) => {
+      q((ne) => {
         Ut(ne, le);
       });
     }
@@ -6312,9 +6312,9 @@ function Em() {
           return o.prototype = Object.create(c.prototype), B(o.prototype, "constructor", o), { extend: b.bind(null, o.prototype) };
         } };
       }
-      var V = Object.getOwnPropertyDescriptor, z = [].slice;
-      function G(o, c, u) {
-        return z.call(o, c, u);
+      var V = Object.getOwnPropertyDescriptor, q = [].slice;
+      function H(o, c, u) {
+        return q.call(o, c, u);
       }
       function ie(o, c) {
         return c(o);
@@ -6507,7 +6507,7 @@ function Em() {
       function Bt(o) {
         mt = o;
       }
-      var D = {}, q = 100, W = typeof Promise > "u" ? [] : (X = Promise.resolve(), typeof crypto < "u" && crypto.subtle ? [W = crypto.subtle.digest("SHA-512", new Uint8Array([0])), h(W), X] : [X, h(X), X]), X = W[0], Si = W[1], Si = Si && Si.then, me = X && X.constructor, at = !!W[2], We = function(o, c) {
+      var D = {}, z = 100, W = typeof Promise > "u" ? [] : (X = Promise.resolve(), typeof crypto < "u" && crypto.subtle ? [W = crypto.subtle.digest("SHA-512", new Uint8Array([0])), h(W), X] : [X, h(X), X]), X = W[0], Si = W[1], Si = Si && Si.then, me = X && X.constructor, at = !!W[2], We = function(o, c) {
         we.push([o, c]), st && (queueMicrotask(At), st = !1);
       }, vt = !0, st = !0, S = [], A = [], j = Pt, U = { id: "global", global: !0, ref: 0, unhandleds: [], onunhandled: Pe, pgp: !1, env: {}, finalize: Pe }, F = U, we = [], Se = 0, xe = [];
       function L(o) {
@@ -6743,10 +6743,10 @@ function Em() {
         return m.ref === 0 && m.finalize(), y;
       }
       function yi() {
-        return ct.id || (ct.id = ++tp), ++ct.awaits, ct.echoes += q, ct.id;
+        return ct.id || (ct.id = ++tp), ++ct.awaits, ct.echoes += z, ct.id;
       }
       function Cn() {
-        return !!ct.awaits && (--ct.awaits == 0 && (ct.id = 0), ct.echoes = ct.awaits * q, !0);
+        return !!ct.awaits && (--ct.awaits == 0 && (ct.id = 0), ct.echoes = ct.awaits * z, !0);
       }
       function es(o) {
         return ct.echoes && o && o.constructor === me ? (yi(), o.then(function(c) {
@@ -7418,8 +7418,8 @@ function Em() {
             var $ = R.failures;
             I += k - R.numFailures;
             for (var T = 0, K = a($); T < K.length; T++) {
-              var H = K[T];
-              _.push($[H]);
+              var G = K[T];
+              _.push($[G]);
             }
           }
           var m = typeof o == "function" ? o : function(k) {
@@ -7427,9 +7427,9 @@ function Em() {
           }, y = u.table.core, O = y.schema.primaryKey, w = O.outbound, E = O.extractKey, M = 200, O = c.db._options.modifyChunkSize, _ = (O && (M = typeof O == "object" ? O[y.name] || O["*"] || 200 : O), []), I = 0, P = [], C = o === ml;
           return c.clone().primaryKeys().then(function(k) {
             function R(T) {
-              var K = Math.min(M, k.length - T), H = k.slice(T, T + K);
-              return (C ? Promise.resolve([]) : y.getMany({ trans: d, keys: H, cache: "immutable" })).then(function(ee) {
-                var te = [], Y = [], ue = w ? [] : null, re = C ? H : [];
+              var K = Math.min(M, k.length - T), G = k.slice(T, T + K);
+              return (C ? Promise.resolve([]) : y.getMany({ trans: d, keys: G, cache: "immutable" })).then(function(ee) {
+                var te = [], Y = [], ue = w ? [] : null, re = C ? G : [];
                 if (!C) for (var Z = 0; Z < K; ++Z) {
                   var de = ee[Z], Ae = { value: Ve(de), primKey: k[T + Z] };
                   m.call(Ae, Ae.value, Ae) !== !1 && (Ae.value == null ? re.push(k[T + Z]) : w || Ce(E(de), E(Ae.value)) === 0 ? (Y.push(Ae.value), w && ue.push(k[T + Z])) : (re.push(k[T + Z]), te.push(Ae.value)));
@@ -7531,7 +7531,7 @@ function Em() {
           if (typeof T == "string") {
             var K = m(T);
             if (c(K, E, C)) return !0;
-            for (var H = null, ee = C; ee < _; ++ee) {
+            for (var G = null, ee = C; ee < _; ++ee) {
               var te = ((Y, ue, re, Z, de, Ae) => {
                 for (var Me = Math.min(Y.length, Z.length), ye = -1, Ee = 0; Ee < Me; ++Ee) {
                   var Ge = ue[Ee];
@@ -7540,10 +7540,10 @@ function Em() {
                 }
                 return Me < Z.length && Ae === "next" ? Y + re.substr(Y.length) : Me < Y.length && Ae === "prev" ? Y.substr(0, re.length) : ye < 0 ? null : Y.substr(0, ye) + Z[ye] + re.substr(ye + 1);
               })(T, K, w[ee], E[ee], y, M);
-              te === null && H === null ? C = ee + 1 : (H === null || 0 < y(H, te)) && (H = te);
+              te === null && G === null ? C = ee + 1 : (G === null || 0 < y(G, te)) && (G = te);
             }
-            R(H !== null ? function() {
-              k.continue(H + O);
+            R(G !== null ? function() {
+              k.continue(G + O);
             } : $);
           }
           return !1;
@@ -7651,14 +7651,14 @@ function Em() {
         }
         try {
           (O = o.reduce(function(T, K) {
-            for (var H = 0, ee = T.length; H < ee; ++H) {
-              var te = T[H];
+            for (var G = 0, ee = T.length; G < ee; ++G) {
+              var te = T[G];
               if (d(K[0], te[1]) < 0 && 0 < d(K[1], te[0])) {
                 te[0] = y(te[0], K[0]), te[1] = w(te[1], K[1]);
                 break;
               }
             }
-            return H === ee && T.push(K), T;
+            return G === ee && T.push(K), T;
           }, [])).sort(I);
         } catch {
           return Tt(this, hn);
@@ -7676,8 +7676,8 @@ function Em() {
         });
         return $._ondirectionchange = function(T) {
           _ = T === "next" ? (R = C, p) : (R = k, m), O.sort(I);
-        }, $._addAlgorithm(function(T, K, H) {
-          for (var ee, te = T.key; R(te); ) if (++P === O.length) return K(H), !1;
+        }, $._addAlgorithm(function(T, K, G) {
+          for (var ee, te = T.key; R(te); ) if (++P === O.length) return K(G), !1;
           return !C(ee = te) && !k(ee) || (u._cmp(te, O[P][1]) === 0 || u._cmp(te, O[P][0]) === 0 || K(function() {
             _ === p ? T.continue(O[P][0]) : T.continue(O[P][1]);
           }), !1);
@@ -7838,7 +7838,7 @@ function Em() {
           var _, I = O.name;
           return { name: I, schema: O, mutate: function(P) {
             var C = P.trans, k = P.type, R = P.keys, $ = P.values, T = P.range;
-            return new Promise(function(K, H) {
+            return new Promise(function(K, G) {
               K = ze(K);
               var ee = C.objectStore(I), te = ee.keyPath == null, Y = k === "put" || k === "add";
               if (!Y && k !== "delete" && k !== "deleteRange") throw new Error("Invalid operation type: " + k);
@@ -7872,9 +7872,9 @@ function Em() {
             var C = P.trans, k = P.keys;
             return new Promise(function(R, $) {
               R = ze(R);
-              for (var T, K = C.objectStore(I), H = k.length, ee = new Array(H), te = 0, Y = 0, ue = function(de) {
+              for (var T, K = C.objectStore(I), G = k.length, ee = new Array(G), te = 0, Y = 0, ue = function(de) {
                 de = de.target, ee[de._pos] = de.result, ++Y === te && R(ee);
-              }, re = rn($), Z = 0; Z < H; ++Z) k[Z] != null && ((T = K.get(k[Z]))._pos = Z, T.onsuccess = ue, T.onerror = re, ++te);
+              }, re = rn($), Z = 0; Z < G; ++Z) k[Z] != null && ((T = K.get(k[Z]))._pos = Z, T.onsuccess = ue, T.onerror = re, ++te);
               te === 0 && R(ee);
             });
           }, get: function(P) {
@@ -7889,27 +7889,27 @@ function Em() {
           }, query: (_ = w, function(P) {
             return new Promise(function(C, k) {
               C = ze(C);
-              var R, $, T, Y = P.trans, K = P.values, H = P.limit, te = P.query, ee = H === 1 / 0 ? void 0 : H, ue = te.index, te = te.range, Y = Y.objectStore(I), Y = ue.isPrimaryKey ? Y : Y.index(ue.name), ue = d(te);
-              if (H === 0) return C({ result: [] });
+              var R, $, T, Y = P.trans, K = P.values, G = P.limit, te = P.query, ee = G === 1 / 0 ? void 0 : G, ue = te.index, te = te.range, Y = Y.objectStore(I), Y = ue.isPrimaryKey ? Y : Y.index(ue.name), ue = d(te);
+              if (G === 0) return C({ result: [] });
               _ ? ((te = K ? Y.getAll(ue, ee) : Y.getAllKeys(ue, ee)).onsuccess = function(re) {
                 return C({ result: re.target.result });
               }, te.onerror = rn(k)) : (R = 0, $ = !K && "openKeyCursor" in Y ? Y.openKeyCursor(ue) : Y.openCursor(ue), T = [], $.onsuccess = function(re) {
                 var Z = $.result;
-                return !Z || (T.push(K ? Z.value : Z.primaryKey), ++R === H) ? C({ result: T }) : void Z.continue();
+                return !Z || (T.push(K ? Z.value : Z.primaryKey), ++R === G) ? C({ result: T }) : void Z.continue();
               }, $.onerror = rn(k));
             });
           }), openCursor: function(P) {
             var C = P.trans, k = P.values, R = P.query, $ = P.reverse, T = P.unique;
-            return new Promise(function(K, H) {
+            return new Promise(function(K, G) {
               K = ze(K);
               var Y = R.index, ee = R.range, te = C.objectStore(I), te = Y.isPrimaryKey ? te : te.index(Y.name), Y = $ ? T ? "prevunique" : "prev" : T ? "nextunique" : "next", ue = !k && "openKeyCursor" in te ? te.openKeyCursor(d(ee), Y) : te.openCursor(d(ee), Y);
-              ue.onerror = rn(H), ue.onsuccess = ze(function(re) {
+              ue.onerror = rn(G), ue.onsuccess = ze(function(re) {
                 var Z, de, Ae, Me, ye = ue.result;
                 ye ? (ye.___id = ++cp, ye.done = !1, Z = ye.continue.bind(ye), de = (de = ye.continuePrimaryKey) && de.bind(ye), Ae = ye.advance.bind(ye), Me = function() {
                   throw new Error("Cursor not stopped");
                 }, ye.trans = C, ye.stop = ye.continue = ye.continuePrimaryKey = ye.advance = function() {
                   throw new Error("Cursor not started");
-                }, ye.fail = ze(H), ye.next = function() {
+                }, ye.fail = ze(G), ye.next = function() {
                   var Ee = this, Ge = 1;
                   return this.start(function() {
                     return Ge-- ? Ee.continue() : Ee.stop();
@@ -7936,12 +7936,12 @@ function Em() {
                     ue.onsuccess = Ge, Ge();
                   }), ye.continue = Z, ye.continuePrimaryKey = de, ye.advance = Ae, Ge(), Ft;
                 }, K(ye)) : K(null);
-              }, H);
+              }, G);
             });
           }, count: function(P) {
             var C = P.query, k = P.trans, R = C.index, $ = C.range;
             return new Promise(function(T, K) {
-              var H = k.objectStore(I), H = R.isPrimaryKey ? H : H.index(R.name), ee = d($), ee = ee ? H.count(ee) : H.count();
+              var G = k.objectStore(I), G = R.isPrimaryKey ? G : G.index(R.name), ee = d($), ee = ee ? G.count(ee) : G.count();
               ee.onsuccess = ze(function(te) {
                 return T(te.target.result);
               }), ee.onerror = rn(K);
@@ -8017,7 +8017,7 @@ function Em() {
               return T._cfg.version >= I;
             })).length === 0 ? L.resolve() : (R.forEach(function(T) {
               k.push(function() {
-                var K, H, ee, te = $, Y = T._cfg.dbschema, ue = (fs(_, te, C), fs(_, Y, C), $ = _._dbSchema = Y, Bo(te, Y)), re = (ue.add.forEach(function(Z) {
+                var K, G, ee, te = $, Y = T._cfg.dbschema, ue = (fs(_, te, C), fs(_, Y, C), $ = _._dbSchema = Y, Bo(te, Y)), re = (ue.add.forEach(function(Z) {
                   Fo(C, Z[0], Z[1].primKey, Z[1].indexes);
                 }), ue.change.forEach(function(Z) {
                   if (Z.recreate) throw new ge.Upgrade("Not yet support for changing primary key");
@@ -8032,20 +8032,20 @@ function Em() {
                 }), T._cfg.contentUpgrade);
                 if (re && T._cfg.version > I) return as(_, C), P._memoizedTables = {}, K = oe(Y), ue.del.forEach(function(Z) {
                   K[Z] = te[Z];
-                }), Do(_, [_.Transaction.prototype]), cs(_, [_.Transaction.prototype], a(K), K), P.schema = K, (H = qe(re)) && yi(), Y = L.follow(function() {
+                }), Do(_, [_.Transaction.prototype]), cs(_, [_.Transaction.prototype], a(K), K), P.schema = K, (G = qe(re)) && yi(), Y = L.follow(function() {
                   var Z;
-                  (ee = re(P)) && H && (Z = Cn.bind(null, null), ee.then(Z, Z));
+                  (ee = re(P)) && G && (Z = Cn.bind(null, null), ee.then(Z, Z));
                 }), ee && typeof ee.then == "function" ? L.resolve(ee) : Y.then(function() {
                   return ee;
                 });
               }), k.push(function(K) {
-                var H, ee, te = T._cfg.dbschema;
-                H = te, ee = K, [].slice.call(ee.db.objectStoreNames).forEach(function(Y) {
-                  return H[Y] == null && ee.db.deleteObjectStore(Y);
+                var G, ee, te = T._cfg.dbschema;
+                G = te, ee = K, [].slice.call(ee.db.objectStoreNames).forEach(function(Y) {
+                  return G[Y] == null && ee.db.deleteObjectStore(Y);
                 }), Do(_, [_.Transaction.prototype]), cs(_, [_.Transaction.prototype], _._storeNames, _._dbSchema), P.schema = _._dbSchema;
               }), k.push(function(K) {
-                _.idbdb.objectStoreNames.contains("$meta") && (Math.ceil(_.idbdb.version / 10) === T._cfg.version ? (_.idbdb.deleteObjectStore("$meta"), delete _._dbSchema.$meta, _._storeNames = _._storeNames.filter(function(H) {
-                  return H !== "$meta";
+                _.idbdb.objectStoreNames.contains("$meta") && (Math.ceil(_.idbdb.version / 10) === T._cfg.version ? (_.idbdb.deleteObjectStore("$meta"), delete _._dbSchema.$meta, _._storeNames = _._storeNames.filter(function(G) {
+                  return G !== "$meta";
                 })) : K.objectStore("$meta").put(T._cfg.version, "version"));
               });
             }), (function T() {
@@ -8114,7 +8114,7 @@ function Em() {
       }
       function us(o, c, u) {
         var d = {};
-        return G(c.objectStoreNames, 0).forEach(function(p) {
+        return H(c.objectStoreNames, 0).forEach(function(p) {
           for (var m = u.objectStore(p), y = Ro(bl(M = m.keyPath), M || "", !0, !1, !!m.autoIncrement, M && typeof M != "string", !0), w = [], E = 0; E < m.indexNames.length; ++E) {
             var O = m.index(m.indexNames[E]), M = O.keyPath, O = Ro(O.name, M, !!O.unique, !!O.multiEntry, !1, M && typeof M != "string", !1);
             w.push(O);
@@ -8127,7 +8127,7 @@ function Em() {
           var m = d[p], y = u.objectStore(m);
           o._hasGetAll = "getAll" in y;
           for (var w = 0; w < y.indexNames.length; ++w) {
-            var E, M = y.indexNames[w], O = y.index(M).keyPath, O = typeof O == "string" ? O : "[" + G(O).join("+") + "]";
+            var E, M = y.indexNames[w], O = y.index(M).keyPath, O = typeof O == "string" ? O : "[" + H(O).join("+") + "]";
             c[m] && (E = c[m].idxByName[O]) && (E.name = M, delete c[m].idxByName[O], c[m].idxByName[M] = E);
           }
         }
@@ -8320,10 +8320,10 @@ function Em() {
               })) : (O.onerror = rn(P), $ = R.oldVersion > Math.pow(2, 62) ? 0 : R.oldVersion, _ = $ < 1, o.idbdb = k.result, m && pp(o, O), dp(o, $ / 10, O, P));
             }, P), k.onsuccess = ze(function() {
               O = null;
-              var R, $, T, K, H, ee, te = o.idbdb = k.result, Y = G(te.objectStoreNames);
+              var R, $, T, K, G, ee, te = o.idbdb = k.result, Y = H(te.objectStoreNames);
               if (0 < Y.length) try {
-                var ue = te.transaction((H = Y).length === 1 ? H[0] : H, "readonly");
-                if (c.autoSchema) ee = te, K = ue, (T = o).verno = ee.version / 10, K = T._dbSchema = us(0, ee, K), T._storeNames = G(ee.objectStoreNames, 0), cs(T, [T._allTables], a(K), K);
+                var ue = te.transaction((G = Y).length === 1 ? G[0] : G, "readonly");
+                if (c.autoSchema) ee = te, K = ue, (T = o).verno = ee.version / 10, K = T._dbSchema = us(0, ee, K), T._storeNames = H(ee.objectStoreNames, 0), cs(T, [T._allTables], a(K), K);
                 else if (fs(o, o._dbSchema, ue), $ = ue, (($ = Bo(us(0, (R = o).idbdb, $), R._dbSchema)).add.length || $.change.some(function(re) {
                   return re.add.length || re.change.length;
                 })) && !m) return console.warn("Dexie SchemaDiff: Schema was extended without increasing the number passed to db.version(). Dexie will add missing parts and increment native version number to workaround this."), te.close(), p = te.version + 1, m = !0, I(w());
@@ -8334,7 +8334,7 @@ function Em() {
                 c.vcFired = !0, o.on("versionchange").fire(re);
               }), te.onclose = ze(function() {
                 o.close({ disableAutoOpen: !1 });
-              }), _ && (Y = o._deps, H = C, Uo(ee = Y.indexedDB) || H === ts || Vo(ee, Y.IDBKeyRange).put({ name: H }).catch(Pe)), I();
+              }), _ && (Y = o._deps, G = C, Uo(ee = Y.indexedDB) || G === ts || Vo(ee, Y.IDBKeyRange).put({ name: G }).catch(Pe)), I();
             }, P);
           }).catch(function(I) {
             switch (I?.name) {
@@ -8408,8 +8408,8 @@ function Em() {
           var u = o.table(d), d = u.schema, p = {}, m = [];
           function y(I, P, C) {
             var T = ir(I), k = p[T] = p[T] || [], R = I == null ? 0 : typeof I == "string" ? 1 : I.length, $ = 0 < P, T = i(i({}, C), { name: $ ? "".concat(T, "(virtual-from:").concat(C.name, ")") : C.name, lowLevelIndex: C, isVirtual: $, keyTail: P, keyLength: R, extractKey: Lo(I), unique: !$ && C.unique });
-            return k.push(T), T.isPrimaryKey || m.push(T), 1 < R && y(R === 2 ? I[0] : I.slice(0, R - 1), P + 1, C), k.sort(function(K, H) {
-              return K.keyTail - H.keyTail;
+            return k.push(T), T.isPrimaryKey || m.push(T), 1 < R && y(R === 2 ? I[0] : I.slice(0, R - 1), P + 1, C), k.sort(function(K, G) {
+              return K.keyTail - G.keyTail;
             }), T;
           }
           var w = y(d.primaryKey.keyPath, 0, d.primaryKey);
@@ -8499,21 +8499,21 @@ function Em() {
             function O(_) {
               var I, P, C, k = F.trans, R = _.keys || Qo(d, _);
               if (R) return (_ = _.type === "add" || _.type === "put" ? i(i({}, _), { keys: R }) : i({}, _)).type !== "delete" && (_.values = r([], _.values)), _.keys && (_.keys = r([], _.keys)), I = u, C = R, ((P = _).type === "add" ? Promise.resolve([]) : I.getMany({ trans: P.trans, keys: C, cache: "immutable" })).then(function($) {
-                var T = R.map(function(K, H) {
-                  var ee, te, Y, ue = $[H], re = { onerror: null, onsuccess: null };
-                  return _.type === "delete" ? w.fire.call(re, K, ue, k) : _.type === "add" || ue === void 0 ? (ee = E.fire.call(re, K, _.values[H], k), K == null && ee != null && (_.keys[H] = K = ee, d.outbound || Q(_.values[H], d.keyPath, K))) : (ee = Jo(ue, _.values[H]), (te = M.fire.call(re, ee, K, ue, k)) && (Y = _.values[H], Object.keys(te).forEach(function(Z) {
+                var T = R.map(function(K, G) {
+                  var ee, te, Y, ue = $[G], re = { onerror: null, onsuccess: null };
+                  return _.type === "delete" ? w.fire.call(re, K, ue, k) : _.type === "add" || ue === void 0 ? (ee = E.fire.call(re, K, _.values[G], k), K == null && ee != null && (_.keys[G] = K = ee, d.outbound || Q(_.values[G], d.keyPath, K))) : (ee = Jo(ue, _.values[G]), (te = M.fire.call(re, ee, K, ue, k)) && (Y = _.values[G], Object.keys(te).forEach(function(Z) {
                     g(Y, Z) ? Y[Z] = te[Z] : Q(Y, Z, te[Z]);
                   }))), re;
                 });
                 return u.mutate(_).then(function(K) {
-                  for (var H = K.failures, ee = K.results, te = K.numFailures, K = K.lastResult, Y = 0; Y < R.length; ++Y) {
+                  for (var G = K.failures, ee = K.results, te = K.numFailures, K = K.lastResult, Y = 0; Y < R.length; ++Y) {
                     var ue = (ee || R)[Y], re = T[Y];
-                    ue == null ? re.onerror && re.onerror(H[Y]) : re.onsuccess && re.onsuccess(_.type === "put" && $[Y] ? _.values[Y] : ue);
+                    ue == null ? re.onerror && re.onerror(G[Y]) : re.onsuccess && re.onsuccess(_.type === "put" && $[Y] ? _.values[Y] : ue);
                   }
-                  return { failures: H, results: ee, numFailures: te, lastResult: K };
+                  return { failures: G, results: ee, numFailures: te, lastResult: K };
                 }).catch(function(K) {
-                  return T.forEach(function(H) {
-                    return H.onerror && H.onerror(K);
+                  return T.forEach(function(G) {
+                    return G.onerror && G.onerror(K);
                   }), Promise.reject(K);
                 });
               });
@@ -8572,9 +8572,9 @@ function Em() {
             return C.compound && C.keyPath.includes(w.keyPath);
           }), I = i(i({}, m), { mutate: function(C) {
             function k(de) {
-              return de = "idb://".concat(c, "/").concat(d, "/").concat(de), H[de] || (H[de] = new ht());
+              return de = "idb://".concat(c, "/").concat(d, "/").concat(de), G[de] || (G[de] = new ht());
             }
-            var R, $, T, K = C.trans, H = C.mutatedParts || (C.mutatedParts = {}), ee = k(""), te = k(":dels"), Y = C.type, re = C.type === "deleteRange" ? [C.range] : C.type === "delete" ? [C.keys] : C.values.length < 50 ? [Qo(w, C).filter(function(de) {
+            var R, $, T, K = C.trans, G = C.mutatedParts || (C.mutatedParts = {}), ee = k(""), te = k(":dels"), Y = C.type, re = C.type === "deleteRange" ? [C.range] : C.type === "delete" ? [C.keys] : C.values.length < 50 ? [Qo(w, C).filter(function(de) {
               return de;
             }), C.values] : [], ue = re[0], re = re[1], Z = C.trans._cache;
             return l(ue) ? (ee.addKeys(ue), (Y = Y === "delete" || ue.length === re.length ? Cl(ue, Z) : null) || te.addKeys(ue), (Y || re) && (R = k, $ = Y, T = re, y.indexes.forEach(function(de) {
@@ -8601,7 +8601,7 @@ function Em() {
                   return Ft === w.keyPath;
                 }), Ee = 0, Ge = de.results.length; Ee < Ge; ++Ee) Me[Ee][ye] = de.results[Ee];
                 k(Ae.name).addKeys(Me);
-              })), K.mutatedParts = ps(K.mutatedParts || {}, H), de;
+              })), K.mutatedParts = ps(K.mutatedParts || {}, G), de;
             });
           } }), P = { get: function(C) {
             return [w, new ht(C.key)];
@@ -8614,15 +8614,15 @@ function Em() {
               if ($) {
                 var K, R = function(re) {
                   return re = "idb://".concat(c, "/").concat(d, "/").concat(re), T[re] || (T[re] = new ht());
-                }, H = R(""), ee = R(":dels"), $ = P[C](k), te = $[0], $ = $[1];
+                }, G = R(""), ee = R(":dels"), $ = P[C](k), te = $[0], $ = $[1];
                 if ((C === "query" && te.isPrimaryKey && !k.values ? ee : R(te.name || "")).add($), !te.isPrimaryKey) {
                   if (C !== "count") return K = C === "query" && O && k.values && m.query(i(i({}, k), { values: !1 })), m[C].apply(this, arguments).then(function(re) {
                     if (C === "query") {
                       if (O && k.values) return K.then(function(Me) {
-                        return Me = Me.result, H.addKeys(Me), re;
+                        return Me = Me.result, G.addKeys(Me), re;
                       });
                       var Z = k.values ? re.result.map(M) : re.result;
-                      (k.values ? H : ee).addKeys(Z);
+                      (k.values ? G : ee).addKeys(Z);
                     } else {
                       var de, Ae;
                       if (C === "openCursor") return Ae = k.values, (de = re) && Object.create(de, { key: { get: function() {
@@ -8631,7 +8631,7 @@ function Em() {
                         var Me = de.primaryKey;
                         return ee.addKey(Me), Me;
                       } }, value: { get: function() {
-                        return Ae && H.addKey(de.primaryKey), de.value;
+                        return Ae && G.addKey(de.primaryKey), de.value;
                       } } });
                     }
                     return re;
@@ -8661,10 +8661,10 @@ function Em() {
         return !u || u.length === 0 || (y = c.query.index, w = y.multiEntry, E = c.query.range, M = d.schema.primaryKey.extractKey, O = y.extractKey, _ = (y.lowLevelIndex || y).extractKey, (d = u.reduce(function(I, P) {
           var C = I, k = [];
           if (P.type === "add" || P.type === "put") for (var R = new ht(), $ = P.values.length - 1; 0 <= $; --$) {
-            var T, K = P.values[$], H = M(K);
-            !R.hasKey(H) && (T = O(K), w && l(T) ? T.some(function(re) {
+            var T, K = P.values[$], G = M(K);
+            !R.hasKey(G) && (T = O(K), w && l(T) ? T.some(function(re) {
               return Xo(re, E);
-            }) : Xo(T, E)) && (R.addKey(H), k.push(K));
+            }) : Xo(T, E)) && (R.addKey(G), k.push(K));
           }
           switch (P.type) {
             case "add":
@@ -8757,7 +8757,7 @@ function Em() {
                       P.optimisticOps = P.optimisticOps.filter(function(de) {
                         return de.trans !== w;
                       });
-                      for (var H = 0, ee = Object.values(P.queries.query); H < ee.length; H++) for (var te, Y, ue, re = 0, Z = (te = ee[H]).slice(); re < Z.length; re++) (Y = Z[re]).res != null && w.mutatedParts && (E && !Y.dirty ? (ue = Object.isFrozen(Y.res), ue = Al(Y.res, Y.req, k, C, Y, ue), Y.dirty ? (he(te, Y), Y.subscribers.forEach(function(de) {
+                      for (var G = 0, ee = Object.values(P.queries.query); G < ee.length; G++) for (var te, Y, ue, re = 0, Z = (te = ee[G]).slice(); re < Z.length; re++) (Y = Z[re]).res != null && w.mutatedParts && (E && !Y.dirty ? (ue = Object.isFrozen(Y.res), ue = Al(Y.res, Y.req, k, C, Y, ue), Y.dirty ? (he(te, Y), Y.subscribers.forEach(function(de) {
                         return M.add(de);
                       })) : ue !== Y.res && (Y.res = ue, Y.promise = L.resolve({ result: ue }))) : (Y.dirty && he(te, Y), Y.subscribers.forEach(function(de) {
                         return M.add(de);
@@ -8800,15 +8800,15 @@ function Em() {
               if (!T) return [null, !1, $, null];
               switch (k) {
                 case "query":
-                  var K = T.find(function(H) {
-                    return H.req.limit === R.limit && H.req.values === R.values && Tl(H.req.query.range, R.query.range);
+                  var K = T.find(function(G) {
+                    return G.req.limit === R.limit && G.req.values === R.values && Tl(G.req.query.range, R.query.range);
                   });
-                  return K ? [K, !0, $, T] : [T.find(function(H) {
-                    return ("limit" in H.req ? H.req.limit : 1 / 0) >= R.limit && (!R.values || H.req.values) && wp(H.req.query.range, R.query.range);
+                  return K ? [K, !0, $, T] : [T.find(function(G) {
+                    return ("limit" in G.req ? G.req.limit : 1 / 0) >= R.limit && (!R.values || G.req.values) && wp(G.req.query.range, R.query.range);
                   }), !1, $, T];
                 case "count":
-                  return K = T.find(function(H) {
-                    return Tl(H.req.query.range, R.query.range);
+                  return K = T.find(function(G) {
+                    return Tl(G.req.query.range, R.query.range);
                   }), [K, !!K, $, T];
               }
             })(c, u, "query", m), I = _[0], M = _[2], O = _[3], I && _[1] ? I.obsSet = m.obsSet : (_ = d.query(m).then(function(P) {
@@ -9096,14 +9096,14 @@ function Em() {
               var K = pn();
               try {
                 m && yi();
-                var H = On(o, T);
-                return H = m ? H.finally(Cn) : H;
+                var G = On(o, T);
+                return G = m ? G.finally(Cn) : G;
               } finally {
                 K && En();
               }
             })(R = { subscr: k, signal: y.signal, requery: I, querier: o, trans: null }), Promise.resolve($).then(function(T) {
               u = !0, c = T, w || R.signal.aborted || (E = {}, ((K) => {
-                for (var H in K) if (g(K, H)) return;
+                for (var G in K) if (g(K, G)) return;
                 return 1;
               })(M = k) || _ || (Pn(tr, P), _ = !0), Io(function() {
                 return !w && p.next && p.next(T);
@@ -10059,7 +10059,7 @@ function wo(n, e, t = "flow", { indentAtStart: i, lineWidth: r = 80, minContentW
   const h = [], v = {};
   let g = r - e.length;
   typeof i == "number" && (i > r - Math.max(2, s) ? h.push(0) : g = r - i);
-  let b, x, B = !1, N = -1, V = -1, z = -1;
+  let b, x, B = !1, N = -1, V = -1, q = -1;
   t === nc && (N = ku(n, N, e.length), N !== -1 && (g = N + f));
   for (let ie; ie = n[N += 1]; ) {
     if (t === Vs && ie === "\\") {
@@ -10076,7 +10076,7 @@ function wo(n, e, t = "flow", { indentAtStart: i, lineWidth: r = 80, minContentW
         default:
           N += 1;
       }
-      z = N;
+      q = N;
     }
     if (ie === `
 `)
@@ -10094,7 +10094,7 @@ function wo(n, e, t = "flow", { indentAtStart: i, lineWidth: r = 80, minContentW
         else if (t === Vs) {
           for (; x === " " || x === "	"; )
             x = ie, ie = n[N += 1], B = !0;
-          const se = N > z + 1 ? N - 2 : V - 1;
+          const se = N > q + 1 ? N - 2 : V - 1;
           if (v[se])
             return n;
           h.push(se), v[se] = !0, g = se + f, b = void 0;
@@ -10106,14 +10106,14 @@ function wo(n, e, t = "flow", { indentAtStart: i, lineWidth: r = 80, minContentW
   if (B && l && l(), h.length === 0)
     return n;
   a && a();
-  let G = n.slice(0, h[0]);
+  let H = n.slice(0, h[0]);
   for (let ie = 0; ie < h.length; ++ie) {
     const se = h[ie], J = h[ie + 1] || n.length;
-    se === 0 ? G = `
-${e}${n.slice(0, J)}` : (t === Vs && v[se] && (G += `${n[se]}\\`), G += `
+    se === 0 ? H = `
+${e}${n.slice(0, J)}` : (t === Vs && v[se] && (H += `${n[se]}\\`), H += `
 ${e}${n.slice(se + 1, J)}`);
   }
-  return G;
+  return H;
 }
 function ku(n, e, t) {
   let i = e, r = e + 1, s = n[r];
@@ -10260,19 +10260,19 @@ function Us({ comment: n, type: e, value: t }, i, r, s) {
 `);
   B === -1 ? g = "-" : t === x || B !== x.length - 1 ? (g = "+", s && s()) : g = "", x && (t = t.slice(0, -x.length), x[x.length - 1] === `
 ` && (x = x.slice(0, -1)), x = x.replace(rc, `$&${h}`));
-  let N = !1, V, z = -1;
+  let N = !1, V, q = -1;
   for (V = 0; V < t.length; ++V) {
     const J = t[V];
     if (J === " ")
       N = !0;
     else if (J === `
 `)
-      z = V;
+      q = V;
     else
       break;
   }
-  let G = t.substring(0, z < V ? z + 1 : V);
-  G && (t = t.substring(G.length), G = G.replace(/\n+/g, `$&${h}`));
+  let H = t.substring(0, q < V ? q + 1 : V);
+  H && (t = t.substring(H.length), H = H.replace(/\n+/g, `$&${h}`));
   let se = (N ? h ? "2" : "1" : "") + g;
   if (n && (se += " " + l(n.replace(/ ?[\r\n]+/g, " ")), r && r()), !v) {
     const J = t.replace(/\n+/g, `
@@ -10282,13 +10282,13 @@ $&`).replace(/(?:^|\n)([\t ].*)(?:([\n\t ]*)\n(?![\n\t ]))?/g, "$1$2").replace(/
     a !== "folded" && e !== _e.BLOCK_FOLDED && (Q.onOverflow = () => {
       ce = !0;
     });
-    const oe = wo(`${G}${J}${x}`, h, nc, Q);
+    const oe = wo(`${H}${J}${x}`, h, nc, Q);
     if (!ce)
       return `>${se}
 ${h}${oe}`;
   }
   return t = t.replace(/\n+/g, `$&${h}`), `|${se}
-${h}${G}${t}${x}`;
+${h}${H}${t}${x}`;
 }
 function Hm(n, e, t, i) {
   const { type: r, value: s } = n, { actualString: a, implicitKey: l, indent: f, indentStep: h, inFlow: v } = e;
@@ -10360,6 +10360,7 @@ function cd(n, e) {
     nullStr: "null",
     simpleKeys: !1,
     singleQuote: null,
+    trailingComma: !1,
     trueStr: "true",
     verifyAliasOrder: !0
   }, n.schema.toStringOptions, e);
@@ -10464,15 +10465,15 @@ function Jm({ key: n, value: e }, t, i, r) {
     return V = `? ${V}`, b && !B ? V += ii(V, t.indent, h(b)) : N && r && r(), V;
   B && (b = null), x ? (b && (V += ii(V, t.indent, h(b))), V = `? ${V}
 ${l}:`) : (V = `${V}:`, b && (V += ii(V, t.indent, h(b))));
-  let z, G, ie;
-  tt(e) ? (z = !!e.spaceBefore, G = e.commentBefore, ie = e.comment) : (z = !1, G = null, ie = null, e && typeof e == "object" && (e = a.createNode(e))), t.implicitKey = !1, !x && !b && Ke(e) && (t.indentAtStart = V.length + 1), N = !1, !v && f.length >= 2 && !t.inFlow && !x && Wr(e) && !e.flow && !e.tag && !e.anchor && (t.indent = t.indent.substring(2));
+  let q, H, ie;
+  tt(e) ? (q = !!e.spaceBefore, H = e.commentBefore, ie = e.comment) : (q = !1, H = null, ie = null, e && typeof e == "object" && (e = a.createNode(e))), t.implicitKey = !1, !x && !b && Ke(e) && (t.indentAtStart = V.length + 1), N = !1, !v && f.length >= 2 && !t.inFlow && !x && Wr(e) && !e.flow && !e.tag && !e.anchor && (t.indent = t.indent.substring(2));
   let se = !1;
   const J = qi(e, t, () => se = !0, () => N = !0);
   let ce = " ";
-  if (b || z || G) {
-    if (ce = z ? `
-` : "", G) {
-      const Q = h(G);
+  if (b || q || H) {
+    if (ce = q ? `
+` : "", H) {
+      const Q = h(H);
       ce += `
 ${yn(Q, t.indent)}`;
     }
@@ -10610,12 +10611,12 @@ function Zm({ comment: n, items: e }, t, { blockItemPrefix: i, flowChars: r, ite
     if (tt(N))
       !g && N.spaceBefore && b.push(""), ro(t, b, N.commentBefore, g), N.comment && (V = N.comment);
     else if (rt(N)) {
-      const G = tt(N.key) ? N.key : null;
-      G && (!g && G.spaceBefore && b.push(""), ro(t, b, G.commentBefore, g));
+      const H = tt(N.key) ? N.key : null;
+      H && (!g && H.spaceBefore && b.push(""), ro(t, b, H.commentBefore, g));
     }
     g = !1;
-    let z = qi(N, v, () => V = null, () => g = !0);
-    V && (z += ii(z, s, h(V))), g && V && (g = !1), b.push(i + z);
+    let q = qi(N, v, () => V = null, () => g = !0);
+    V && (q += ii(q, s, h(V))), g && V && (g = !1), b.push(i + q);
   }
   let x;
   if (b.length === 0)
@@ -10648,15 +10649,15 @@ function ev({ items: n }, e, { flowChars: t, itemIndent: i }) {
     if (tt(N))
       N.spaceBefore && g.push(""), ro(e, g, N.commentBefore, !1), N.comment && (V = N.comment);
     else if (rt(N)) {
-      const G = tt(N.key) ? N.key : null;
-      G && (G.spaceBefore && g.push(""), ro(e, g, G.commentBefore, !1), G.comment && (h = !0));
+      const H = tt(N.key) ? N.key : null;
+      H && (H.spaceBefore && g.push(""), ro(e, g, H.commentBefore, !1), H.comment && (h = !0));
       const ie = tt(N.value) ? N.value : null;
-      ie ? (ie.comment && (V = ie.comment), ie.commentBefore && (h = !0)) : N.value == null && G?.comment && (V = G.comment);
+      ie ? (ie.comment && (V = ie.comment), ie.commentBefore && (h = !0)) : N.value == null && H?.comment && (V = H.comment);
     }
     V && (h = !0);
-    let z = qi(N, f, () => V = null);
-    B < n.length - 1 && (z += ","), V && (z += ii(z, i, l(V))), !h && (g.length > v || z.includes(`
-`)) && (h = !0), g.push(z), v = g.length;
+    let q = qi(N, f, () => V = null);
+    h || (h = g.length > v || q.includes(`
+`)), B < n.length - 1 ? q += "," : e.options.trailingComma && (e.options.lineWidth > 0 && (h || (h = g.reduce((H, ie) => H + ie.length + 2, 2) + (q.length + 2) > e.options.lineWidth)), h && (q += ",")), V && (q += ii(q, i, l(V))), g.push(q), v = g.length;
   }
   const { start: b, end: x } = t;
   if (g.length === 0)
@@ -11605,8 +11606,8 @@ class Gr {
     if (typeof t == "function")
       e = t.call({ "": e }, "", e), r = t;
     else if (Array.isArray(t)) {
-      const V = (G) => typeof G == "number" || G instanceof String || G instanceof Number, z = t.filter(V).map(String);
-      z.length > 0 && (t = t.concat(z)), r = t;
+      const V = (H) => typeof H == "number" || H instanceof String || H instanceof Number, q = t.filter(V).map(String);
+      q.length > 0 && (t = t.concat(q)), r = t;
     } else i === void 0 && t && (i = t, t = void 0);
     const { aliasDuplicateObjects: s, anchorPrefix: a, flow: l, keepUndefined: f, onTagObj: h, tag: v } = i ?? {}, { onAnchor: g, setAnchors: b, sourceObjects: x } = Um(
       this,
@@ -11804,7 +11805,7 @@ ${h}
   }
 };
 function zi(n, { flow: e, indicator: t, next: i, offset: r, onError: s, parentIndent: a, startOnNewline: l }) {
-  let f = !1, h = l, v = l, g = "", b = "", x = !1, B = !1, N = null, V = null, z = null, G = null, ie = null, se = null, J = null;
+  let f = !1, h = l, v = l, g = "", b = "", x = !1, B = !1, N = null, V = null, q = null, H = null, ie = null, se = null, J = null;
   for (const oe of n)
     switch (B && (oe.type !== "space" && oe.type !== "newline" && oe.type !== "comma" && s(oe.offset, "MISSING_CHAR", "Tags and anchors must be separated from the next token by white space"), B = !1), N && (h && oe.type !== "comment" && oe.type !== "newline" && s(N, "TAB_AS_INDENT", "Tabs are not allowed as indentation"), N = null), oe.type) {
       case "space":
@@ -11817,17 +11818,17 @@ function zi(n, { flow: e, indicator: t, next: i, offset: r, onError: s, parentIn
         break;
       }
       case "newline":
-        h ? g ? g += oe.source : (!se || t !== "seq-item-ind") && (f = !0) : b += oe.source, h = !0, x = !0, (V || z) && (G = oe), v = !0;
+        h ? g ? g += oe.source : (!se || t !== "seq-item-ind") && (f = !0) : b += oe.source, h = !0, x = !0, (V || q) && (H = oe), v = !0;
         break;
       case "anchor":
         V && s(oe, "MULTIPLE_ANCHORS", "A node can have at most one anchor"), oe.source.endsWith(":") && s(oe.offset + oe.source.length - 1, "BAD_ALIAS", "Anchor ending in : is ambiguous", !0), V = oe, J ?? (J = oe.offset), h = !1, v = !1, B = !0;
         break;
       case "tag": {
-        z && s(oe, "MULTIPLE_TAGS", "A node can have at most one tag"), z = oe, J ?? (J = oe.offset), h = !1, v = !1, B = !0;
+        q && s(oe, "MULTIPLE_TAGS", "A node can have at most one tag"), q = oe, J ?? (J = oe.offset), h = !1, v = !1, B = !0;
         break;
       }
       case t:
-        (V || z) && s(oe, "BAD_PROP_ORDER", `Anchors and tags must be after the ${oe.source} indicator`), se && s(oe, "UNEXPECTED_TOKEN", `Unexpected ${oe.source} in ${e ?? "collection"}`), se = oe, h = t === "seq-item-ind" || t === "explicit-key-ind", v = !1;
+        (V || q) && s(oe, "BAD_PROP_ORDER", `Anchors and tags must be after the ${oe.source} indicator`), se && s(oe, "UNEXPECTED_TOKEN", `Unexpected ${oe.source} in ${e ?? "collection"}`), se = oe, h = t === "seq-item-ind" || t === "explicit-key-ind", v = !1;
         break;
       case "comma":
         if (e) {
@@ -11846,8 +11847,8 @@ function zi(n, { flow: e, indicator: t, next: i, offset: r, onError: s, parentIn
     comment: g,
     hasNewline: x,
     anchor: V,
-    tag: z,
-    newlineAfterProp: G,
+    tag: q,
+    newlineAfterProp: H,
     end: Q,
     start: J ?? Q
   };
@@ -11923,26 +11924,26 @@ function mv({ composeNode: n, composeEmptyNode: e }, t, i, r, s) {
       (N.newlineAfterProp || Dr(b)) && r(b ?? g[g.length - 1], "MULTILINE_IMPLICIT_KEY", "Implicit keys need to be on a single line");
     } else N.found?.indent !== i.indent && r(f, "BAD_INDENT", Pu);
     t.atKey = !0;
-    const z = N.end, G = b ? n(t, b, N, r) : e(t, z, g, null, N, r);
-    t.schema.compat && sc(i.indent, b, r), t.atKey = !1, Id(t, l.items, G) && r(z, "DUPLICATE_KEY", "Map keys must be unique");
+    const q = N.end, H = b ? n(t, b, N, r) : e(t, q, g, null, N, r);
+    t.schema.compat && sc(i.indent, b, r), t.atKey = !1, Id(t, l.items, H) && r(q, "DUPLICATE_KEY", "Map keys must be unique");
     const ie = zi(x ?? [], {
       indicator: "map-value-ind",
       next: B,
-      offset: G.range[2],
+      offset: H.range[2],
       onError: r,
       parentIndent: i.indent,
       startOnNewline: !b || b.type === "block-scalar"
     });
     if (f = ie.end, ie.found) {
-      V && (B?.type === "block-map" && !ie.hasNewline && r(f, "BLOCK_AS_IMPLICIT_KEY", "Nested mappings are not allowed in compact mappings"), t.options.strict && N.start < ie.found.offset - 1024 && r(G.range, "KEY_OVER_1024_CHARS", "The : indicator must be at most 1024 chars after the start of an implicit block mapping key"));
+      V && (B?.type === "block-map" && !ie.hasNewline && r(f, "BLOCK_AS_IMPLICIT_KEY", "Nested mappings are not allowed in compact mappings"), t.options.strict && N.start < ie.found.offset - 1024 && r(H.range, "KEY_OVER_1024_CHARS", "The : indicator must be at most 1024 chars after the start of an implicit block mapping key"));
       const se = B ? n(t, B, ie, r) : e(t, f, x, null, ie, r);
       t.schema.compat && sc(i.indent, B, r), f = se.range[2];
-      const J = new kt(G, se);
+      const J = new kt(H, se);
       t.options.keepSourceTokens && (J.srcToken = v), l.items.push(J);
     } else {
-      V && r(G.range, "MISSING_CHAR", "Implicit map keys need to be followed by map values"), ie.comment && (G.comment ? G.comment += `
-` + ie.comment : G.comment = ie.comment);
-      const se = new kt(G);
+      V && r(H.range, "MISSING_CHAR", "Implicit map keys need to be followed by map values"), ie.comment && (H.comment ? H.comment += `
+` + ie.comment : H.comment = ie.comment);
+      const se = new kt(H);
       t.options.keepSourceTokens && (se.srcToken = v), l.items.push(se);
     }
   }
@@ -12008,7 +12009,7 @@ function yv({ composeNode: n, composeEmptyNode: e }, t, i, r, s) {
   v && (t.atRoot = !1), t.atKey && (t.atKey = !1);
   let g = i.offset + i.start.source.length;
   for (let V = 0; V < i.items.length; ++V) {
-    const z = i.items[V], { start: G, key: ie, sep: se, value: J } = z, ce = zi(G, {
+    const q = i.items[V], { start: H, key: ie, sep: se, value: J } = q, ce = zi(H, {
       flow: l,
       indicator: "explicit-key-ind",
       next: ie ?? se?.[0],
@@ -12034,7 +12035,7 @@ function yv({ composeNode: n, composeEmptyNode: e }, t, i, r, s) {
       ce.comma && r(ce.comma, "UNEXPECTED_TOKEN", `Unexpected , in ${l}`);
     else if (ce.comma || r(ce.start, "MISSING_CHAR", `Missing , between ${l} items`), ce.comment) {
       let Q = "";
-      e: for (const oe of G)
+      e: for (const oe of H)
         switch (oe.type) {
           case "comma":
           case "space":
@@ -12056,7 +12057,7 @@ function yv({ composeNode: n, composeEmptyNode: e }, t, i, r, s) {
       h.items.push(Q), g = Q.range[2], wa(J) && r(Q.range, "BLOCK_IN_FLOW", ba);
     } else {
       t.atKey = !0;
-      const Q = ce.end, oe = ie ? n(t, ie, ce, r) : e(t, Q, G, null, ce, r);
+      const Q = ce.end, oe = ie ? n(t, ie, ce, r) : e(t, Q, H, null, ce, r);
       wa(ie) && r(oe.range, "BLOCK_IN_FLOW", ba), t.atKey = !1;
       const Ne = zi(se ?? [], {
         flow: l,
@@ -12085,7 +12086,7 @@ function yv({ composeNode: n, composeEmptyNode: e }, t, i, r, s) {
       le ? wa(J) && r(le.range, "BLOCK_IN_FLOW", ba) : Ne.comment && (oe.comment ? oe.comment += `
 ` + Ne.comment : oe.comment = Ne.comment);
       const ne = new kt(oe, le);
-      if (t.options.keepSourceTokens && (ne.srcToken = z), a) {
+      if (t.options.keepSourceTokens && (ne.srcToken = q), a) {
         const ve = h;
         Id(t, ve.items, oe) && r(Q, "DUPLICATE_KEY", "Map keys must be unique"), ve.items.push(ne);
       } else {
@@ -12102,8 +12103,8 @@ function yv({ composeNode: n, composeEmptyNode: e }, t, i, r, s) {
   if (x?.source === b)
     N = x.offset + x.source.length;
   else {
-    const V = l[0].toUpperCase() + l.substring(1), z = v ? `${V} must end with a ${b}` : `${V} in block collection must be sufficiently indented and end with a ${b}`;
-    r(g, v ? "MISSING_CHAR" : "BAD_INDENT", z), x && x.source.length !== 1 && B.unshift(x);
+    const V = l[0].toUpperCase() + l.substring(1), q = v ? `${V} must end with a ${b}` : `${V} in block collection must be sufficiently indented and end with a ${b}`;
+    r(g, v ? "MISSING_CHAR" : "BAD_INDENT", q), x && x.source.length !== 1 && B.unshift(x);
   }
   if (B.length > 0) {
     const V = Yr(B, N, t.options.strict, r);
@@ -12158,14 +12159,14 @@ function wv(n, e, t) {
   }
   let f = e.indent + r.indent, h = e.offset + r.length, v = 0;
   for (let N = 0; N < l; ++N) {
-    const [V, z] = a[N];
-    if (z === "" || z === "\r")
+    const [V, q] = a[N];
+    if (q === "" || q === "\r")
       r.indent === 0 && V.length > f && (f = V.length);
     else {
       V.length < f && t(h + V.length, "MISSING_CHAR", "Block scalars with more-indented leading empty lines must use an explicit indentation indicator"), r.indent === 0 && (f = V.length), v = N, f === 0 && !n.atRoot && t(h, "BAD_INDENT", "Block scalar values in collections must be indented");
       break;
     }
-    h += V.length + z.length + 1;
+    h += V.length + q.length + 1;
   }
   for (let N = a.length - 1; N >= l; --N)
     a[N][0].length > f && (l = N + 1);
@@ -12174,23 +12175,23 @@ function wv(n, e, t) {
     g += a[N][0].slice(f) + `
 `;
   for (let N = v; N < l; ++N) {
-    let [V, z] = a[N];
-    h += V.length + z.length + 1;
-    const G = z[z.length - 1] === "\r";
-    if (G && (z = z.slice(0, -1)), z && V.length < f) {
+    let [V, q] = a[N];
+    h += V.length + q.length + 1;
+    const H = q[q.length - 1] === "\r";
+    if (H && (q = q.slice(0, -1)), q && V.length < f) {
       const se = `Block scalar lines must not be less indented than their ${r.indent ? "explicit indentation indicator" : "first line"}`;
-      t(h - z.length - (G ? 2 : 1), "BAD_INDENT", se), V = "";
+      t(h - q.length - (H ? 2 : 1), "BAD_INDENT", se), V = "";
     }
-    s === _e.BLOCK_LITERAL ? (g += b + V.slice(f) + z, b = `
-`) : V.length > f || z[0] === "	" ? (b === " " ? b = `
+    s === _e.BLOCK_LITERAL ? (g += b + V.slice(f) + q, b = `
+`) : V.length > f || q[0] === "	" ? (b === " " ? b = `
 ` : !x && b === `
 ` && (b = `
 
-`), g += b + V.slice(f) + z, b = `
-`, x = !0) : z === "" ? b === `
+`), g += b + V.slice(f) + q, b = `
+`, x = !0) : q === "" ? b === `
 ` ? g += `
 ` : b = `
-` : (g += b + z, b = " ", x = !1);
+` : (g += b + q, b = " ", x = !1);
   }
   switch (r.chomp) {
     case "-":
@@ -12510,14 +12511,19 @@ function Td(n, e, t, i) {
     case "block-map":
     case "block-seq":
     case "flow-collection":
-      h = bv(jv, n, e, t, i), l && (h.anchor = l.source.substring(1));
+      try {
+        h = bv(jv, n, e, t, i), l && (h.anchor = l.source.substring(1));
+      } catch (g) {
+        const b = g instanceof Error ? g.message : String(g);
+        i(e, "RESOURCE_EXHAUSTION", b);
+      }
       break;
     default: {
       const g = e.type === "error" ? e.message : `Unsupported token (type: ${e.type})`;
-      i(e, "UNEXPECTED_TOKEN", g), h = el(n, e.offset, void 0, null, t, i), v = !1;
+      i(e, "UNEXPECTED_TOKEN", g), v = !1;
     }
   }
-  return l && h.anchor === "" && i(l, "BAD_ALIAS", "Anchor cannot be an empty string"), r && n.options.stringKeys && (!Ke(h) || typeof h.value != "string" || h.tag && h.tag !== "tag:yaml.org,2002:str") && i(f ?? e, "NON_STRING_KEY", "With stringKeys, all keys must be strings"), s && (h.spaceBefore = !0), a && (e.type === "scalar" && e.source === "" ? h.comment = a : h.commentBefore = a), n.options.keepSourceTokens && v && (h.srcToken = e), h;
+  return h ?? (h = el(n, e.offset, void 0, null, t, i)), l && h.anchor === "" && i(l, "BAD_ALIAS", "Anchor cannot be an empty string"), r && n.options.stringKeys && (!Ke(h) || typeof h.value != "string" || h.tag && h.tag !== "tag:yaml.org,2002:str") && i(f ?? e, "NON_STRING_KEY", "With stringKeys, all keys must be strings"), s && (h.spaceBefore = !0), a && (e.type === "scalar" && e.source === "" ? h.comment = a : h.commentBefore = a), n.options.keepSourceTokens && v && (h.srcToken = e), h;
 }
 function el(n, e, t, i, { spaceBefore: r, comment: s, anchor: a, tag: l, end: f }, h) {
   const v = {
@@ -16643,8 +16649,8 @@ const Ky = function(n) {
       } else {
         let l = lc(n, s, this.options.removeNSPrefix);
         if (!l) {
-          const G = n.substring(Math.max(0, s - 50), Math.min(n.length, s + 50));
-          throw new Error(`readTagExp returned undefined at position ${s}. Context: "${G}"`);
+          const H = n.substring(Math.max(0, s - 50), Math.min(n.length, s + 50));
+          throw new Error(`readTagExp returned undefined at position ${s}. Context: "${H}"`);
         }
         let f = l.tagName;
         const h = l.rawTagName;
@@ -16658,9 +16664,9 @@ const Ky = function(n) {
         v.length > 0 && v.lastIndexOf("/") === v.length - 1 && (B = !0, f[f.length - 1] === "/" ? (f = f.substr(0, f.length - 1), v = f) : v = v.substr(0, v.length - 1), g = f !== v);
         let N = null, V;
         V = $y(h), f !== e.tagname && this.matcher.push(f, {}, V), f !== v && g && (N = this.buildAttributesMap(v, this.matcher, f), N && Ry(N, this.options)), f !== e.tagname && (this.isCurrentNodeStopNode = this.isItStopNode(this.stopNodeExpressions, this.matcher));
-        const z = s;
+        const q = s;
         if (this.isCurrentNodeStopNode) {
-          let G = "";
+          let H = "";
           if (B)
             s = l.closeIndex;
           else if (this.options.unpairedTags.indexOf(f) !== -1)
@@ -16668,24 +16674,24 @@ const Ky = function(n) {
           else {
             const se = this.readStopNodeData(n, h, b + 1);
             if (!se) throw new Error(`Unexpected end of ${h}`);
-            s = se.i, G = se.tagContent;
+            s = se.i, H = se.tagContent;
           }
           const ie = new $n(f);
-          N && (ie[":@"] = N), ie.add(this.options.textNodeName, G), this.matcher.pop(), this.isCurrentNodeStopNode = !1, this.addChild(t, ie, this.matcher, z);
+          N && (ie[":@"] = N), ie.add(this.options.textNodeName, H), this.matcher.pop(), this.isCurrentNodeStopNode = !1, this.addChild(t, ie, this.matcher, q);
         } else {
           if (B) {
             ({ tagName: f, tagExp: v } = ka(this.options.transformTagName, f, v, this.options));
-            const G = new $n(f);
-            N && (G[":@"] = N), this.addChild(t, G, this.matcher, z), this.matcher.pop(), this.isCurrentNodeStopNode = !1;
+            const H = new $n(f);
+            N && (H[":@"] = N), this.addChild(t, H, this.matcher, q), this.matcher.pop(), this.isCurrentNodeStopNode = !1;
           } else if (this.options.unpairedTags.indexOf(f) !== -1) {
-            const G = new $n(f);
-            N && (G[":@"] = N), this.addChild(t, G, this.matcher, z), this.matcher.pop(), this.isCurrentNodeStopNode = !1, s = l.closeIndex;
+            const H = new $n(f);
+            N && (H[":@"] = N), this.addChild(t, H, this.matcher, q), this.matcher.pop(), this.isCurrentNodeStopNode = !1, s = l.closeIndex;
             continue;
           } else {
-            const G = new $n(f);
+            const H = new $n(f);
             if (this.tagsNodeStack.length > this.options.maxNestedTags)
               throw new Error("Maximum nested tags exceeded");
-            this.tagsNodeStack.push(t), N && (G[":@"] = N), this.addChild(t, G, this.matcher, z), t = G;
+            this.tagsNodeStack.push(t), N && (H[":@"] = N), this.addChild(t, H, this.matcher, q), t = H;
           }
           i = "", s = b;
         }
@@ -18067,4 +18073,4 @@ onconnect = (n) => {
   il(ep, n.ports[0]);
 };
 console.log("Worker code loaded");
-//# sourceMappingURL=worker-D8G3G-8O.js.map
+//# sourceMappingURL=worker-jC4O7JRI.js.map