sykpcomposer 1.19.59 → 1.19.60

package/dist/{index-492d5d70.js → index-486ef15c.js}

@@ -463,7 +463,7 @@ function a2() {
           });
         }
       }
-      var Be = function(Ae, We, he, Ie, it, st, xt) {
+      var Fe = function(Ae, We, he, Ie, it, st, xt) {
         var kt = {
           // This tag allows us to uniquely identify this as a React Element
           $$typeof: e,
@@ -507,7 +507,7 @@ function a2() {
             var ut = typeof Ae == "function" ? Ae.displayName || Ae.name || "Unknown" : Ae;
             kt && Me(xt, ut), Ue && nt(xt, ut);
           }
-          return Be(Ae, kt, Ue, it, Ie, ge.current, xt);
+          return Fe(Ae, kt, Ue, it, Ie, ge.current, xt);
         }
       }
       var xe = y.ReactCurrentOwner, Je = y.ReactDebugCurrentFrame;
@@ -518,8 +518,8 @@ function a2() {
         } else
           Je.setExtraStackFrame(null);
       }
-      var Fe;
-      Fe = !1;
+      var Be;
+      Be = !1;
       function He(Ae) {
         return typeof Ae == "object" && Ae !== null && Ae.$$typeof === e;
       }
@@ -608,8 +608,8 @@ Check the top-level render call using <` + he + ">.");
           if (he) {
             var Ie = L(We);
             ve(he, Ae.props, "prop", Ie, Ae);
-          } else if (We.PropTypes !== void 0 && !Fe) {
-            Fe = !0;
+          } else if (We.PropTypes !== void 0 && !Be) {
+            Be = !0;
             var it = L(We);
             S("Component %s declared `PropTypes` instead of `propTypes`. Did you misspell the property assignment?", it || "Unknown");
           }
@@ -11620,7 +11620,7 @@ class Uh extends $h {
 function Hk(c) {
   return new Uh(c);
 }
-const qk = or.lazy(() => import("./ImageComponent-e9ff0a77.js"));
+const qk = or.lazy(() => import("./ImageComponent-061e4488.js"));
 function Wk(c) {
   const t = c;
   if (t.src.startsWith("file:///"))
@@ -11766,7 +11766,7 @@ function Hh({
 function Jk(c) {
   return c instanceof pu;
 }
-const Vk = or.lazy(() => import("./InlineImageComponent-b870fbd7.js"));
+const Vk = or.lazy(() => import("./InlineImageComponent-b52ddf63.js"));
 function Kk(c) {
   if (c instanceof HTMLImageElement) {
     const { alt: t, src: n, width: e, height: s } = c;
@@ -12205,7 +12205,7 @@ function BS() {
 function tO(c) {
   return c instanceof of;
 }
-const nO = or.lazy(() => import("./PollComponent-45c365aa.js"));
+const nO = or.lazy(() => import("./PollComponent-70fe1ed9.js"));
 function rO() {
   return Math.random().toString(36).replace(/[^a-z]+/g, "").substr(0, 5);
 }
@@ -15590,10 +15590,12 @@ function sN({ editor: c }) {
           S && a !== S ? c.update(() => {
             const C = go(S.elem);
             if (!C)
-              throw new Error("TableCellResizer: Table cell node not found.");
+              return;
             const O = $s(C), F = c.getElementByKey(O.getKey());
-            if (!F)
-              throw new Error("TableCellResizer: Table element not found.");
+            if (!F) {
+              console.error("TableCellResizer: Table element not found.");
+              return;
+            }
             t.current = y, e.current = F.getBoundingClientRect(), l(S);
           }) : S == null && f();
         }
@@ -15605,35 +15607,49 @@ function sN({ editor: c }) {
   }, [a, d, c, f]);
   const h = (E) => E === "bottom", m = bn(
     (E) => {
-      if (!a)
-        throw new Error("TableCellResizer: Expected active cell.");
+      if (!a) {
+        console.error("TableCellResizer: Expected active cell.");
+        return;
+      }
       c.update(() => {
         const x = go(a.elem);
-        if (!xn(x))
-          throw new Error("TableCellResizer: Table cell node not found.");
+        if (!xn(x)) {
+          console.error("TableCellResizer: Table cell node not found.");
+          return;
+        }
         const y = $s(x), S = CS(x), C = y.getChildren();
-        if (S >= C.length || S < 0)
-          throw new Error("Expected table cell to be inside of table row.");
+        if (S >= C.length || S < 0) {
+          console.error("Expected table cell to be inside of table row.");
+          return;
+        }
         const O = C[S];
-        if (!Mr(O))
-          throw new Error("Expected table row");
+        if (!Mr(O)) {
+          console.error("Expected table row");
+          return;
+        }
         O.setHeight(E);
       });
     },
     [a, c]
   ), g = bn(
     (E) => {
-      if (!a)
-        throw new Error("TableCellResizer: Expected active cell.");
+      if (!a) {
+        console.error("TableCellResizer: Expected active cell.");
+        return;
+      }
       c.update(() => {
         const x = go(a.elem);
-        if (!xn(x))
-          throw new Error("TableCellResizer: Table cell node not found.");
+        if (!xn(x)) {
+          console.error("TableCellResizer: Table cell node not found.");
+          return;
+        }
         const y = $s(x), S = C0(x), C = y.getChildren();
         for (let O = 0; O < C.length; O++) {
           const F = C[O];
-          if (!Mr(F))
-            throw new Error("Expected table row");
+          if (!Mr(F)) {
+            console.error("Expected table row");
+            return;
+          }
           const B = F.getChildren(), P = B.map((N) => N.getColSpan()).reduce(
             (N, D) => {
               const A = N[N.length - 1] ?? 0;
@@ -15643,11 +15659,15 @@ function sN({ editor: c }) {
           ).findIndex(
             (N) => N > S
           );
-          if (P >= B.length || P < 0)
-            throw new Error("Expected table cell to be inside of table row.");
+          if (P >= B.length || P < 0) {
+            console.error("Expected table cell to be inside of table row.");
+            return;
+          }
           const T = B[P];
-          if (!xn(T))
-            throw new Error("Expected table cell");
+          if (!xn(T)) {
+            console.error("Expected table cell");
+            return;
+          }
           T.setWidth(E);
         }
       });
@@ -15656,8 +15676,10 @@ function sN({ editor: c }) {
   ), v = bn(
     (E) => {
       const x = (y) => {
-        if (y.preventDefault(), y.stopPropagation(), !a)
-          throw new Error("TableCellResizer: Expected active cell.");
+        if (y.preventDefault(), y.stopPropagation(), !a) {
+          console.error("TableCellResizer: Expected active cell.");
+          return;
+        }
         if (s.current) {
           const { x: S, y: C } = s.current;
           if (a === null)
@@ -15690,8 +15712,10 @@ function sN({ editor: c }) {
     [a, f, g, m]
   ), b = bn(
     (E) => (x) => {
-      if (x.preventDefault(), x.stopPropagation(), !a)
-        throw new Error("TableCellResizer: Expected active cell.");
+      if (x.preventDefault(), x.stopPropagation(), !a) {
+        console.error("TableCellResizer: Expected active cell.");
+        return;
+      }
       s.current = {
         x: x.clientX,
         y: x.clientY
@@ -17837,11 +17861,11 @@ var sE = { exports: {} };
         return tt(), me.promise(Q);
       }
     });
-    var Be = /[+-]?(?:\d*\.|)\d+(?:[eE][+-]?\d+|)/.source, De = new RegExp("^(?:([+-])=|)(" + Be + ")([a-z%]*)$", "i"), xe = ["Top", "Right", "Bottom", "Left"], Je = v.documentElement, je = function($) {
+    var Fe = /[+-]?(?:\d*\.|)\d+(?:[eE][+-]?\d+|)/.source, De = new RegExp("^(?:([+-])=|)(" + Fe + ")([a-z%]*)$", "i"), xe = ["Top", "Right", "Bottom", "Left"], Je = v.documentElement, je = function($) {
       return y.contains($.ownerDocument, $);
-    }, Fe = { composed: !0 };
+    }, Be = { composed: !0 };
     Je.getRootNode && (je = function($) {
-      return y.contains($.ownerDocument, $) || $.getRootNode(Fe) === $.ownerDocument;
+      return y.contains($.ownerDocument, $) || $.getRootNode(Be) === $.ownerDocument;
     });
     var He = function($, Q) {
       return $ = Q || $, $.style.display === "none" || $.style.display === "" && // Otherwise, check computed style
@@ -18416,7 +18440,7 @@ var sE = { exports: {} };
         return this.pushStack(me);
       };
     });
-    var Zt = new RegExp("^(" + Be + ")(?!px)[a-z%]+$", "i"), Pe = /^--/, ze = function($) {
+    var Zt = new RegExp("^(" + Fe + ")(?!px)[a-z%]+$", "i"), Pe = /^--/, ze = function($) {
       var Q = $.ownerDocument.defaultView;
       return (!Q || !Q.opener) && (Q = t), Q.getComputedStyle($);
     }, dt = function($, Q, te) {
@@ -20266,7 +20290,7 @@ function kN({
 }) {
   const [l] = In(), [i, u] = Gt(l), [d, p] = Gt("paragraph"), [f, h] = Gt("root"), [m, g] = Gt(
     null
-  ), [v, b] = Gt("15px"), [_, w] = Gt("#000"), [E, x] = Gt("#fff"), [y, S] = Gt("Arial"), [C, O] = Gt("left"), [F, B] = Gt(!1), [M, L] = Gt(!1), [P, T] = Gt(!1), [N, D] = Gt(!1), [A, z] = Gt(!1), [I, H] = Gt(!1), [J, K] = Gt(!1), [R, q] = Gt(!1), [W, U] = Gt(!1), [Z, Y] = Gt(!1), [X, G] = hu(), [ee, ae] = Gt(!1), [de, ue] = Gt(""), [ne, Se] = Gt(() => l.isEditable()), [ve, ge] = Gt(""), [Te, ce] = Gt(""), [re, fe] = Gt(""), [le, ke] = Gt(""), [Oe, Ce] = Gt(!0), [Me, nt] = Gt(!1), Be = 1;
+  ), [v, b] = Gt("15px"), [_, w] = Gt("#000"), [E, x] = Gt("#fff"), [y, S] = Gt("Arial"), [C, O] = Gt("left"), [F, B] = Gt(!1), [M, L] = Gt(!1), [P, T] = Gt(!1), [N, D] = Gt(!1), [A, z] = Gt(!1), [I, H] = Gt(!1), [J, K] = Gt(!1), [R, q] = Gt(!1), [W, U] = Gt(!1), [Z, Y] = Gt(!1), [X, G] = hu(), [ee, ae] = Gt(!1), [de, ue] = Gt(""), [ne, Se] = Gt(() => l.isEditable()), [ve, ge] = Gt(""), [Te, ce] = Gt(""), [re, fe] = Gt(""), [le, ke] = Gt(""), [Oe, Ce] = Gt(!0), [Me, nt] = Gt(!1), Fe = 1;
   Kt(() => {
     const He = l.registerCommand(
       ql,
@@ -20276,7 +20300,7 @@ function kN({
           '<meta http-equiv=Content-Type content="text/html; charset=utf-8">'
         ) && Bt.includes("microsoft-com") ? !1 : Bt.includes("Outline") ? (ke(Bt), nt(!0), !0) : !1;
       },
-      Be
+      Fe
     );
     return () => {
       He();
@@ -20424,7 +20448,7 @@ function kN({
     [i, m]
   ), je = () => {
     d !== "number" ? l.dispatchCommand(oS, void 0) : l.dispatchCommand(iS, void 0);
-  }, Fe = () => {
+  }, Be = () => {
     l.focus(), l.dispatchCommand(rS, void 0);
   };
   return /* @__PURE__ */ Ee.jsxs("div", { className: "toolbar", children: [
@@ -20672,7 +20696,7 @@ function kN({
               {
                 className: "item",
                 onClick: () => {
-                  Fe();
+                  Be();
                 },
                 children: [
                   /* @__PURE__ */ Ee.jsx("img", { src: bN, height: 21, width: 21 }),
@@ -21869,13 +21893,13 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           }(ge, Te, (0, a.default)(ce));
         if (y(ge) && y(Te))
           return function(le, ke) {
-            var Oe, Ce, Me, nt, Be, De, xe = 2 < arguments.length && arguments[2] !== void 0 ? arguments[2] : [];
+            var Oe, Ce, Me, nt, Fe, De, xe = 2 < arguments.length && arguments[2] !== void 0 ? arguments[2] : [];
             if (z("Case: object vs object"), A("object input =  ", le, !0), A("object output = ", ke, !0), !y(le))
               throw new q("input not an object type = " + E(le));
             if (y(ke))
-              return Oe = [], Ce = g(xe), Me = de.getObjectIdentifiers({ input: le, output: ke, path: xe }), nt = Me.idName, Ce && !Me.sameId ? (Oe.push({ p: xe, ld: le }), Oe.push({ p: xe, li: ke })) : (Be = Object.keys(le), De = Object.keys(ke), new Set([].concat(Be, De)).forEach(function(Je) {
+              return Oe = [], Ce = g(xe), Me = de.getObjectIdentifiers({ input: le, output: ke, path: xe }), nt = Me.idName, Ce && !Me.sameId ? (Oe.push({ p: xe, ld: le }), Oe.push({ p: xe, li: ke })) : (Fe = Object.keys(le), De = Object.keys(ke), new Set([].concat(Fe, De)).forEach(function(Je) {
                 var je;
-                Ce && Je === nt || X._combinedFilters[Je] || (je = null, !Be.includes(Je) && De.includes(Je) ? (je = { p: xe, oi: (0, r.default)({}, Je, ke[Je]) }, A("object vs object diff newOps oi = ", je, !0), Oe.push(je)) : Be.includes(Je) && !De.includes(Je) ? (je = { p: xe, od: (0, r.default)({}, Je, le[Je]) }, A("object vs object diff newOps od = ", je, !0), Oe.push(je)) : (A("object vs object recursive invoking diff for prop = ", Je, !0), je = ve(le[Je], ke[Je], [].concat((0, a.default)(xe), [Je])), Oe.push.apply(Oe, (0, a.default)(je))));
+                Ce && Je === nt || X._combinedFilters[Je] || (je = null, !Fe.includes(Je) && De.includes(Je) ? (je = { p: xe, oi: (0, r.default)({}, Je, ke[Je]) }, A("object vs object diff newOps oi = ", je, !0), Oe.push(je)) : Fe.includes(Je) && !De.includes(Je) ? (je = { p: xe, od: (0, r.default)({}, Je, le[Je]) }, A("object vs object diff newOps od = ", je, !0), Oe.push(je)) : (A("object vs object recursive invoking diff for prop = ", Je, !0), je = ve(le[Je], ke[Je], [].concat((0, a.default)(xe), [Je])), Oe.push.apply(Oe, (0, a.default)(je))));
               }), A("object vs object diff ops = ", Oe, !0)), Oe;
             throw new q("output not an object type = " + E(ke));
           }(ge, Te, (0, a.default)(ce));
@@ -21887,8 +21911,8 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
             var Ce = G.skipCommonTail(le, ke, Oe), Me = Ce.inputPrefix;
             return ke = (le = G.skipCommonHeader(Me, Ce.outputPrefix, Oe)).inputSuffix, Me = G.arrayOfArrayDiff({ before: ke, after: le.outputSuffix, path: Oe, commonHeaderLen: le.commonHeaderLen, diff: ve, isObjectArray: !0 }).ops, A("array diff finish, result = ", Me, !0), Me;
           }(ge, Te, (0, a.default)(ce)) : O(Te) && O(ge) ? (z("Case: primitive array vs primitive array"), function(le, ke) {
-            for (var Oe = 2 < arguments.length && arguments[2] !== void 0 ? arguments[2] : [], Ce = [], Me = Math.max(le.length, ke.length), nt = 0, Be = 0; Be < Me; ++Be)
-              ve(le[Be], ke[Be], [].concat((0, a.default)(Oe), [Be + nt])).forEach(function(De) {
+            for (var Oe = 2 < arguments.length && arguments[2] !== void 0 ? arguments[2] : [], Ce = [], Me = Math.max(le.length, ke.length), nt = 0, Fe = 0; Fe < Me; ++Fe)
+              ve(le[Fe], ke[Fe], [].concat((0, a.default)(Oe), [Fe + nt])).forEach(function(De) {
                 var xe = De.p.slice(0, -1);
                 P(Oe, xe) && ("li" in De && nt++, "ld" in De) && nt--, Ce.push(De);
               });
@@ -21917,12 +21941,12 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           A("opsCompression:"), A("ops = ", fe, !0);
           for (var le, ke, Oe = [], Ce = 0; Ce < fe.length; Ce++)
             A("opsCompression: examine i = " + Ce + ";  ops[i] = ", fe[Ce], fe[Ce + 1]), G.isIdentity(fe[Ce], fe[Ce + 1]) ? ((le = ve(fe[Ce].ld, fe[Ce + 1].li, fe[Ce].p)).length && (Oe = Oe.concat(le)), A("opsCompression: isIdentity; created updates = ", le, !0), Ce++) : G.isMove(fe[Ce], fe[Ce + 1]) ? (A("isMove"), le = de.createMove(fe[Ce], fe[Ce + 1]), A("opsCompression: created a move op = ", le, !0), (ke = ve(fe[Ce].ld, fe[Ce + 1].li, fe[Ce].p)).length && (Oe = Oe.concat(ke)), A("opsCompression: isMove; created updates = ", ke, !0), Oe.push(le), Ce++) : (Oe.push(fe[Ce]), A("opsCompression: neither identity nor move -> pure ld/li op = ", fe[Ce], !0));
-          for (var Me, nt = [], Be = 0; Be < Oe.length; Be++)
-            A("opsCompression: examine i = " + Be + ";  compressedOps[i] = ", Oe[Be], Oe[Be + 1]), G.isReplace(Oe[Be], Oe[Be + 1]) ? (Me = de.createReplace(Oe[Be], Oe[Be + 1]), A("opsCompression: created a list-item-replace op = ", Me, !0), nt.push(Me), Be++) : G.isObjReplace(Oe[Be], Oe[Be + 1]) ? (Me = de.createObjReplace(Oe[Be], Oe[Be + 1]), A("opsCompression: created an objReplace  op = ", Me, !0), nt.push(Me), Be++) : (nt.push(Oe[Be]), A("opsCompression: neither identity nor move -> pure ld/li op = ", nt[Be], !0));
+          for (var Me, nt = [], Fe = 0; Fe < Oe.length; Fe++)
+            A("opsCompression: examine i = " + Fe + ";  compressedOps[i] = ", Oe[Fe], Oe[Fe + 1]), G.isReplace(Oe[Fe], Oe[Fe + 1]) ? (Me = de.createReplace(Oe[Fe], Oe[Fe + 1]), A("opsCompression: created a list-item-replace op = ", Me, !0), nt.push(Me), Fe++) : G.isObjReplace(Oe[Fe], Oe[Fe + 1]) ? (Me = de.createObjReplace(Oe[Fe], Oe[Fe + 1]), A("opsCompression: created an objReplace  op = ", Me, !0), nt.push(Me), Fe++) : (nt.push(Oe[Fe]), A("opsCompression: neither identity nor move -> pure ld/li op = ", nt[Fe], !0));
           var De = Oe = nt;
           A("Move compress (in)", De, !0);
           for (var xe = 0; xe < De.length; xe++) {
-            var Je, je = De[xe], Fe = 1;
+            var Je, je = De[xe], Be = 1;
             if (je.lm !== void 0) {
               A("Move compress (is move)", je, !0);
               var He, Ze, Qe, Bt = ne(je), Ye = void 0;
@@ -21936,9 +21960,9 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
                   A("Move compress: op2 is NOT a run; op2 = ", Je, !0);
                   break;
                 }
-                A("Move compress: op2 is a run; op2 = ", Je, !0), Fe++;
+                A("Move compress: op2 is a run; op2 = ", Je, !0), Be++;
               }
-              1 < Fe && (Qe = typeof je.lm == "number" ? [je.lm] : je.lm, Ze = je.p, He = m(Qe) - m(Ze), I("Move compress: run: ", { run: Fe, path: Ze, target: Qe }), He !== Fe && I("Move compress gap between lm=".concat(Qe, ", p=").concat(m(Ze), " does not equal to ").concat(Fe)), He === Fe) && (I("Move compress", xe, Ye), Qe = { p: (He = ue(Ze, Qe)).pathUpdate, lm: (Ze = He.targetUpdate).length === 1 ? m(Ze) : Ze }, I("Move compress (before create move)", Qe), De.splice(xe, Ye - xe, Qe), I("Move compress (after create move)", Qe)), xe += Fe;
+              1 < Be && (Qe = typeof je.lm == "number" ? [je.lm] : je.lm, Ze = je.p, He = m(Qe) - m(Ze), I("Move compress: run: ", { run: Be, path: Ze, target: Qe }), He !== Be && I("Move compress gap between lm=".concat(Qe, ", p=").concat(m(Ze), " does not equal to ").concat(Be)), He === Be) && (I("Move compress", xe, Ye), Qe = { p: (He = ue(Ze, Qe)).pathUpdate, lm: (Ze = He.targetUpdate).length === 1 ? m(Ze) : Ze }, I("Move compress (before create move)", Qe), De.splice(xe, Ye - xe, Qe), I("Move compress (after create move)", Qe)), xe += Be;
             }
           }
           return A("Move compress (out)", De, !0), De;
@@ -22792,54 +22816,54 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
             }
             return g(fe), g(le), fe;
           case 2:
-            var Ce = D, Me = A, nt = z, Be = ne, De = ce, xe = (g(Ce), g(Me), Me.p[Be]), Je = 0;
+            var Ce = D, Me = A, nt = z, Fe = ne, De = ce, xe = (g(Ce), g(Me), Me.p[Fe]), Je = 0;
             if (De)
-              xe <= Ce.p[Be] && (Me.liObj !== void 0 ? Ce.p[Be] += Me.liObj.length : Ce.p[Be]++), g(Ce);
+              xe <= Ce.p[Fe] && (Me.liObj !== void 0 ? Ce.p[Fe] += Me.liObj.length : Ce.p[Fe]++), g(Ce);
             else {
               if (Ce.li !== void 0 && Ce.ld == null)
-                g(Ce), g(Me), xe == Ce.p[Be] ? F(Ce, Me, 0, nt, Be) : xe < Ce.p[Be] && (Me.liObj !== void 0 ? (g(Ce), g(Me), Ce.p[Be] += Me.liObj.length) : Ce.p[Be]++);
+                g(Ce), g(Me), xe == Ce.p[Fe] ? F(Ce, Me, 0, nt, Fe) : xe < Ce.p[Fe] && (Me.liObj !== void 0 ? (g(Ce), g(Me), Ce.p[Fe] += Me.liObj.length) : Ce.p[Fe]++);
               else if (Ce.lm !== void 0)
-                xe <= Ce.p[Be] ? (Me.liObj !== void 0 ? Ce.p[Be] += Me.liObj.length : Ce.p[Be]++, g(Ce), g(Me)) : (xe--, Je++), xe < Ce.lm ? (Me.liObj !== void 0 ? Ce.lm += Me.liObj.length : Ce.lm++, g(Ce), g(Me)) : xe == Ce.lm ? F(Ce, Me, Je, nt, Be) : (g(Ce), g(Me));
+                xe <= Ce.p[Fe] ? (Me.liObj !== void 0 ? Ce.p[Fe] += Me.liObj.length : Ce.p[Fe]++, g(Ce), g(Me)) : (xe--, Je++), xe < Ce.lm ? (Me.liObj !== void 0 ? Ce.lm += Me.liObj.length : Ce.lm++, g(Ce), g(Me)) : xe == Ce.lm ? F(Ce, Me, Je, nt, Fe) : (g(Ce), g(Me));
               else {
                 if (Ce.ld !== void 0 && Ce.li == null && Ce.ldLen !== void 0 && Me.li !== void 0 && Me.liObj !== void 0)
-                  return Me.p[Be] >= Ce.p[Be] + Ce.ldLen || (Ce.p[Be] >= Me.p[Be] ? Ce.p[Be] += Me.liObj.length : Ce.ldLen = Ce.ldLen + Me.liObj.length), m(Ce), Ce;
-                xe <= Ce.p[Be] && (Me.liObj !== void 0 ? Ce.p[Be] += Me.liObj.length : Ce.p[Be]++), g(Ce), g(Me);
+                  return Me.p[Fe] >= Ce.p[Fe] + Ce.ldLen || (Ce.p[Fe] >= Me.p[Fe] ? Ce.p[Fe] += Me.liObj.length : Ce.ldLen = Ce.ldLen + Me.liObj.length), m(Ce), Ce;
+                xe <= Ce.p[Fe] && (Me.liObj !== void 0 ? Ce.p[Fe] += Me.liObj.length : Ce.p[Fe]++), g(Ce), g(Me);
               }
               g(Ce), g(Me);
             }
             return Ce;
           case 3:
-            var je = D, Fe = A, He = ne, Ze = ce;
-            if (m(je), m(Fe), Ze)
-              return Fe.ldLen !== void 0 ? (Fe.p[He] <= je.p[He] && je.p[He] < Fe.p[He] + Fe.ldLen ? je = null : (Fe.p[He] + Fe.ldLen <= je.p[He] && (je.p[He] -= Fe.ldLen), g(je)), je) : Fe.p[He] == je.p[He] ? null : (Fe.p[He] < je.p[He] && je.p[He]--, g(je), je);
+            var je = D, Be = A, He = ne, Ze = ce;
+            if (m(je), m(Be), Ze)
+              return Be.ldLen !== void 0 ? (Be.p[He] <= je.p[He] && je.p[He] < Be.p[He] + Be.ldLen ? je = null : (Be.p[He] + Be.ldLen <= je.p[He] && (je.p[He] -= Be.ldLen), g(je)), je) : Be.p[He] == je.p[He] ? null : (Be.p[He] < je.p[He] && je.p[He]--, g(je), je);
             if (je.lm !== void 0) {
-              Ze = Fe.p[He];
+              Ze = Be.p[He];
               var Qe = je.p[He], Bt = je.lm;
-              if (Fe.ldLen !== void 0)
-                return Fe.p[He] <= je.p[He] && je.p[He] < Fe.p[He] + Fe.ldLen ? je = null : (Fe.p[He] + Fe.ldLen <= je.p[He] ? (je.p[He] -= Fe.ldLen, g(je)) : (Ze--, g(je)), Ze + Fe.ldLen <= Bt ? (je.lm -= Fe.ldLen, je.ic == null && (je.ic = 0), je.ic += Fe.ldLen) : Ze < Bt && Bt < Ze + Fe.ldLen ? (je.ld = { type: "lm" }, je.ldLen = 1, delete je.lm) : g(je), je);
+              if (Be.ldLen !== void 0)
+                return Be.p[He] <= je.p[He] && je.p[He] < Be.p[He] + Be.ldLen ? je = null : (Be.p[He] + Be.ldLen <= je.p[He] ? (je.p[He] -= Be.ldLen, g(je)) : (Ze--, g(je)), Ze + Be.ldLen <= Bt ? (je.lm -= Be.ldLen, je.ic == null && (je.ic = 0), je.ic += Be.ldLen) : Ze < Bt && Bt < Ze + Be.ldLen ? (je.ld = { type: "lm" }, je.ldLen = 1, delete je.lm) : g(je), je);
               if (Ze == Qe)
                 return null;
               Ze < Qe ? je.p[He]-- : Ze--, Ze < Bt && (je.lm--, je.ic == null && (je.ic = 0), je.ic++);
             } else {
-              if (je.ld !== void 0 && je.ldLen !== void 0 && Fe.ldLen !== void 0)
-                return Fe.p[He] >= je.p[He] + je.ldLen || (je.p[He] >= Fe.p[He] + Fe.ldLen ? je.p[He] = je.p[He] - Fe.ldLen : Fe.p[He] <= je.p[He] && je.p[He] + je.ldLen <= Fe.p[He] + Fe.ldLen ? je = null : Fe.p[He] <= je.p[He] && je.p[He] + je.ldLen > Fe.p[He] + Fe.ldLen ? (je.ldLen = je.p[He] + je.ldLen - (Fe.p[He] + Fe.ldLen), je.p[He] = Fe.p[He], je.ld = Fe.ld) : Fe.p[He] > je.p[He] && Fe.p[He] + Fe.ldLen >= je.p[He] + je.ldLen ? je.ldLen = Fe.p[He] - je.p[He] : je.ldLen = je.ldLen - Fe.ldLen), m(je), je;
-              if (je.li !== void 0 && je.ld == null && je.liObj !== void 0 && Fe.ldLen !== void 0)
-                return je.p[He] <= Fe.p[He] || (je.p[He] >= Fe.p[He] + Fe.ldLen ? (je.p[He] -= Fe.ldLen, je.ic == null && (je.ic = 0), je.ic += Fe.ldLen) : je = null), m(je), je;
-              if (Fe.ldLen !== void 0) {
-                if (Fe.p[He] + Fe.ldLen <= je.p[He])
-                  je.p[He] -= Fe.ldLen, je.li !== void 0 && je.ld !== void 0 && (je.ic == null && (je.ic = 0), je.ic += Fe.ldLen);
-                else if (Fe.p[He] <= je.p[He] && je.p[He] < Fe.p[He] + Fe.ldLen) {
-                  if (Fe.p[He] == je.p[He] && je.ld !== void 0 && je.li !== void 0)
-                    return delete je.ld, je.liObj = [je.li], je.li = {}, g(je), g(Fe), je;
+              if (je.ld !== void 0 && je.ldLen !== void 0 && Be.ldLen !== void 0)
+                return Be.p[He] >= je.p[He] + je.ldLen || (je.p[He] >= Be.p[He] + Be.ldLen ? je.p[He] = je.p[He] - Be.ldLen : Be.p[He] <= je.p[He] && je.p[He] + je.ldLen <= Be.p[He] + Be.ldLen ? je = null : Be.p[He] <= je.p[He] && je.p[He] + je.ldLen > Be.p[He] + Be.ldLen ? (je.ldLen = je.p[He] + je.ldLen - (Be.p[He] + Be.ldLen), je.p[He] = Be.p[He], je.ld = Be.ld) : Be.p[He] > je.p[He] && Be.p[He] + Be.ldLen >= je.p[He] + je.ldLen ? je.ldLen = Be.p[He] - je.p[He] : je.ldLen = je.ldLen - Be.ldLen), m(je), je;
+              if (je.li !== void 0 && je.ld == null && je.liObj !== void 0 && Be.ldLen !== void 0)
+                return je.p[He] <= Be.p[He] || (je.p[He] >= Be.p[He] + Be.ldLen ? (je.p[He] -= Be.ldLen, je.ic == null && (je.ic = 0), je.ic += Be.ldLen) : je = null), m(je), je;
+              if (Be.ldLen !== void 0) {
+                if (Be.p[He] + Be.ldLen <= je.p[He])
+                  je.p[He] -= Be.ldLen, je.li !== void 0 && je.ld !== void 0 && (je.ic == null && (je.ic = 0), je.ic += Be.ldLen);
+                else if (Be.p[He] <= je.p[He] && je.p[He] < Be.p[He] + Be.ldLen) {
+                  if (Be.p[He] == je.p[He] && je.ld !== void 0 && je.li !== void 0)
+                    return delete je.ld, je.liObj = [je.li], je.li = {}, g(je), g(Be), je;
                   je = null;
                 }
                 return je;
               }
-              if (Fe.p[He] < je.p[He])
+              if (Be.p[He] < je.p[He])
                 je.p[He]--, (je.li !== void 0 || je.li !== void 0 && je.ld !== void 0) && (je.ic == null && (je.ic = 0), je.ic++);
-              else if (Fe.p[He] == je.p[He]) {
+              else if (Be.p[He] == je.p[He]) {
                 if (je.od !== void 0 || je.oi !== void 0)
-                  return g(je), g(Fe), null;
+                  return g(je), g(Be), null;
                 if (je.ld !== void 0) {
                   if (je.li === void 0)
                     return null;
@@ -22847,7 +22871,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
                 }
               }
             }
-            return g(je), g(Fe), je;
+            return g(je), g(Be), je;
           case 1:
             var Ye = D, Ht = A, zt = z, en = ne, an = ce;
             if (g(Ye), g(Ht), an)
@@ -23245,26 +23269,26 @@ otherCic = `).concat(A, "; type = ").concat(z, "; common = ").concat(I);
                           return !1;
                       if ((G = E(ae)) === (ee = E(de))) {
                         if (G !== "Set" && ee !== "Set")
-                          return G !== "Map" || ((Me, nt, Be, De) => {
+                          return G !== "Map" || ((Me, nt, Fe, De) => {
                             if (P(Me) !== P(nt))
                               return !1;
-                            for (var xe, Je, je, Fe, He, Ze = u(Me), Qe = u(nt); (Fe = Ze.next()) && !Fe.done; )
-                              if (je = Fe.value[0], Fe = Fe.value[1], je && typeof je == "object")
+                            for (var xe, Je, je, Be, He, Ze = u(Me), Qe = u(nt); (Be = Ze.next()) && !Be.done; )
+                              if (je = Be.value[0], Be = Be.value[1], je && typeof je == "object")
                                 Je = Je || new B(), T(Je, je);
-                              else if ((He = L(nt, je)) === void 0 && !M(nt, je) || !J(Fe, He, Be, De)) {
-                                if (Be.strict || !((Bt, Ye, Ht, zt, en, an) => {
+                              else if ((He = L(nt, je)) === void 0 && !M(nt, je) || !J(Be, He, Fe, De)) {
+                                if (Fe.strict || !((Bt, Ye, Ht, zt, en, an) => {
                                   var yt;
                                   return (Ht = I(Ht)) != null ? Ht : (yt = L(Ye, Ht), en = r({}, en, { strict: !1 }), (yt !== void 0 || M(Ye, Ht)) && J(zt, yt, en, an) && !M(Bt, Ht) && J(zt, yt, en, an));
-                                })(Me, nt, je, Fe, Be, De))
+                                })(Me, nt, je, Be, Fe, De))
                                   return !1;
                                 Je = Je || new B(), T(Je, je);
                               }
                             if (Je) {
                               for (; (xe = Qe.next()) && !xe.done; )
                                 if (je = xe.value[0], He = xe.value[1], je && typeof je == "object") {
-                                  if (!H(Je, Me, je, He, Be, De))
+                                  if (!H(Je, Me, je, He, Fe, De))
                                     return !1;
-                                } else if (!(Be.strict || Me.has(je) && J(L(Me, je), He, Be, De) || H(Je, Me, je, He, r({}, Be, { strict: !1 }), De)))
+                                } else if (!(Fe.strict || Me.has(je) && J(L(Me, je), He, Fe, De) || H(Je, Me, je, He, r({}, Fe, { strict: !1 }), De)))
                                   return !1;
                               return A(Je) === 0;
                             }
@@ -23277,7 +23301,7 @@ otherCic = `).concat(A, "; type = ").concat(z, "; common = ").concat(I);
                           if (fe.value && typeof fe.value == "object")
                             ke = ke || new B(), T(ke, fe.value);
                           else if (!D(Te, fe.value)) {
-                            if (ce.strict || !((Me, nt, Be) => (Be = I(Be)) != null ? Be : D(nt, Be) && !D(Me, Be))(ge, Te, fe.value))
+                            if (ce.strict || !((Me, nt, Fe) => (Fe = I(Fe)) != null ? Fe : D(nt, Fe) && !D(Me, Fe))(ge, Te, fe.value))
                               return !1;
                             ke = ke || new B(), T(ke, fe.value);
                           }
@@ -23977,10 +24001,10 @@ otherCic = `).concat(A, "; type = ").concat(z, "; common = ").concat(I);
       if (typeof ne == "boolean")
         return ne ? "true" : "false";
       if (typeof ne == "string")
-        return function je(Fe, He) {
-          if (Fe.length > He.maxStringLength)
-            return Ze = "... " + (Ze = Fe.length - He.maxStringLength) + " more character" + (1 < Ze ? "s" : ""), je(_.call(Fe, 0, He.maxStringLength), He) + Ze;
-          var Ze = w.call(w.call(Fe, /(['\\])/g, "\\$1"), /[\x00-\x1f]/g, Y);
+        return function je(Be, He) {
+          if (Be.length > He.maxStringLength)
+            return Ze = "... " + (Ze = Be.length - He.maxStringLength) + " more character" + (1 < Ze ? "s" : ""), je(_.call(Be, 0, He.maxStringLength), He) + Ze;
+          var Ze = w.call(w.call(Be, /(['\\])/g, "\\$1"), /[\x00-\x1f]/g, Y);
           return H(Ze, "single", He);
         }(ne, Te);
       if (typeof ne == "number")
@@ -23989,7 +24013,7 @@ otherCic = `).concat(A, "; type = ").concat(z, "; common = ").concat(I);
         return nt = String(ne) + "n", ce ? A(ne, nt) : nt;
       if ((ce = Te.depth === void 0 ? 5 : Te.depth) <= (ve = ve === void 0 ? 0 : ve) && 0 < ce && typeof ne == "object")
         return J(ne) ? "[Array]" : "[Object]";
-      var re, fe, le, ke, Oe, Ce, Me, nt = ((je, Fe) => {
+      var re, fe, le, ke, Oe, Ce, Me, nt = ((je, Be) => {
         var He;
         if (je.indent === "	")
           He = "	";
@@ -23998,17 +24022,17 @@ otherCic = `).concat(A, "; type = ").concat(z, "; common = ").concat(I);
             return null;
           He = C.call(Array(je.indent + 1), " ");
         }
-        return { base: He, prev: C.call(Array(Fe + 1), He) };
+        return { base: He, prev: C.call(Array(Be + 1), He) };
       })(Te, ve);
       if (ge === void 0)
         ge = [];
       else if (0 <= Z(ge, ne))
         return "[Circular]";
-      function Be(je, Fe, He) {
-        return Fe && (ge = O.call(ge)).push(Fe), He ? (Fe = { depth: Te.depth }, W(Te, "quoteStyle") && (Fe.quoteStyle = Te.quoteStyle), ue(je, Fe, ve + 1, ge)) : ue(je, Te, ve + 1, ge);
+      function Fe(je, Be, He) {
+        return Be && (ge = O.call(ge)).push(Be), He ? (Be = { depth: Te.depth }, W(Te, "quoteStyle") && (Be.quoteStyle = Te.quoteStyle), ue(je, Be, ve + 1, ge)) : ue(je, Te, ve + 1, ge);
       }
       if (typeof ne == "function" && !K(ne))
-        return "[Function" + ((fe = ((je) => je.name || ((je = b.call(v.call(je), /^function\s*([\w$]+)/)) ? je[1] : null))(ne)) ? ": " + fe : " (anonymous)") + "]" + (0 < (fe = de(ne, Be)).length ? " { " + C.call(fe, ", ") + " }" : "");
+        return "[Function" + ((fe = ((je) => je.name || ((je = b.call(v.call(je), /^function\s*([\w$]+)/)) ? je[1] : null))(ne)) ? ": " + fe : " (anonymous)") + "]" + (0 < (fe = de(ne, Fe)).length ? " { " + C.call(fe, ", ") + " }" : "");
       if (R(ne))
         return fe = P ? w.call(String(ne), /^(Symbol\(.*\))_[^)]*$/, "$1") : L.call(ne), typeof ne != "object" || P ? fe : X(fe);
       if (((je) => je && typeof je == "object" && (typeof HTMLElement < "u" && je instanceof HTMLElement || typeof je.nodeName == "string" && typeof je.getAttribute == "function"))(ne)) {
@@ -24017,15 +24041,15 @@ otherCic = `).concat(A, "; type = ").concat(z, "; common = ").concat(I);
         return De += ">", ne.childNodes && ne.childNodes.length && (De += "..."), De + "</" + x.call(String(ne.nodeName)) + ">";
       }
       if (J(ne))
-        return ne.length === 0 ? "[]" : (fe = de(ne, Be), nt && !((je) => {
-          for (var Fe = 0; Fe < je.length; Fe++)
-            if (0 <= Z(je[Fe], `
+        return ne.length === 0 ? "[]" : (fe = de(ne, Fe), nt && !((je) => {
+          for (var Be = 0; Be < je.length; Be++)
+            if (0 <= Z(je[Be], `
 `))
               return;
           return 1;
         })(fe) ? "[" + ae(fe, nt) + "]" : "[ " + C.call(fe, ", ") + " ]");
       if (!(U(fe = ne) !== "[object Error]" || T && typeof fe == "object" && T in fe))
-        return Oe = de(ne, Be), "cause" in Error.prototype || !("cause" in ne) || N.call(ne, "cause") ? Oe.length === 0 ? "[" + String(ne) + "]" : "{ [" + String(ne) + "] " + C.call(Oe, ", ") + " }" : "{ [" + String(ne) + "] " + C.call(S.call("[cause]: " + Be(ne.cause), Oe), ", ") + " }";
+        return Oe = de(ne, Fe), "cause" in Error.prototype || !("cause" in ne) || N.call(ne, "cause") ? Oe.length === 0 ? "[" + String(ne) + "]" : "{ [" + String(ne) + "] " + C.call(Oe, ", ") + " }" : "{ [" + String(ne) + "] " + C.call(S.call("[cause]: " + Fe(ne.cause), Oe), ", ") + " }";
       if (typeof ne == "object" && Se) {
         if (I && typeof ne[I] == "function" && z)
           return z(ne, { depth: ce - ve });
@@ -24044,8 +24068,8 @@ otherCic = `).concat(A, "; type = ").concat(z, "; common = ").concat(I);
             return je instanceof Map;
           } catch {
           }
-      })(ne) ? (le = [], i && i.call(ne, function(je, Fe) {
-        le.push(Be(Fe, ne, !0) + " => " + Be(je, ne));
+      })(ne) ? (le = [], i && i.call(ne, function(je, Be) {
+        le.push(Fe(Be, ne, !0) + " => " + Fe(je, ne));
       }), ee("Map", l.call(ne), le, nt)) : ((je) => {
         if (u && je && typeof je == "object")
           try {
@@ -24059,7 +24083,7 @@ otherCic = `).concat(A, "; type = ").concat(z, "; common = ").concat(I);
           } catch {
           }
       })(ne) ? (ke = [], d && d.call(ne, function(je) {
-        ke.push(Be(je, ne));
+        ke.push(Fe(je, ne));
       }), ee("Set", u.call(ne), ke, nt)) : ((je) => {
         if (p && je && typeof je == "object")
           try {
@@ -24096,7 +24120,7 @@ otherCic = `).concat(A, "; type = ").concat(z, "; common = ").concat(I);
             return B.call(je), 1;
           } catch {
           }
-      })(ne) ? X(Be(B.call(ne))) : U(ce = ne) !== "[object Boolean]" || T && typeof ce == "object" && T in ce ? U(Se = ne) !== "[object String]" || T && typeof Se == "object" && T in Se ? (U(ce = ne) !== "[object Date]" || T && typeof ce == "object" && T in ce) && !K(ne) ? (Se = de(ne, Be), ce = D ? D(ne) === Object.prototype : ne instanceof Object || ne.constructor === Object, Ce = ne instanceof Object ? "" : "null prototype", Me = !ce && T && Object(ne) === ne && T in ne ? _.call(U(ne), 8, -1) : Ce ? "Object" : "", ce = (!ce && typeof ne.constructor == "function" && ne.constructor.name ? ne.constructor.name + " " : "") + (Me || Ce ? "[" + C.call(S.call([], Me || [], Ce || []), ": ") + "] " : ""), Se.length === 0 ? ce + "{}" : nt ? ce + "{" + ae(Se, nt) + "}" : ce + "{ " + C.call(Se, ", ") + " }") : String(ne) : X(Be(String(ne))) : X(m.call(ne)) : X(Be(Number(ne)));
+      })(ne) ? X(Fe(B.call(ne))) : U(ce = ne) !== "[object Boolean]" || T && typeof ce == "object" && T in ce ? U(Se = ne) !== "[object String]" || T && typeof Se == "object" && T in Se ? (U(ce = ne) !== "[object Date]" || T && typeof ce == "object" && T in ce) && !K(ne) ? (Se = de(ne, Fe), ce = D ? D(ne) === Object.prototype : ne instanceof Object || ne.constructor === Object, Ce = ne instanceof Object ? "" : "null prototype", Me = !ce && T && Object(ne) === ne && T in ne ? _.call(U(ne), 8, -1) : Ce ? "Object" : "", ce = (!ce && typeof ne.constructor == "function" && ne.constructor.name ? ne.constructor.name + " " : "") + (Me || Ce ? "[" + C.call(S.call([], Me || [], Ce || []), ": ") + "] " : ""), Se.length === 0 ? ce + "{}" : nt ? ce + "{" + ae(Se, nt) + "}" : ce + "{ " + C.call(Se, ", ") + " }") : String(ne) : X(Fe(String(ne))) : X(m.call(ne)) : X(Fe(Number(ne)));
     };
     var q = Object.prototype.hasOwnProperty || function(ue) {
       return ue in this;
@@ -27052,18 +27076,18 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
       for (X = de; Z = W.heap[1], W.heap[1] = W.heap[W.heap_len--], z(W, G, 1), Y = W.heap[1], W.heap[--W.heap_max] = Z, W.heap[--W.heap_max] = Y, G[2 * X] = G[2 * Z] + G[2 * Y], W.depth[X] = (W.depth[Z] >= W.depth[Y] ? W.depth[Z] : W.depth[Y]) + 1, G[2 * Z + 1] = G[2 * Y + 1] = X, W.heap[1] = X++, z(W, G, 1), 2 <= W.heap_len; )
         ;
       W.heap[--W.heap_max] = W.heap[1];
-      for (var ne, Se, ve, ge, Te, ce = W, re = U.dyn_tree, fe = U.max_code, le = U.stat_desc.static_tree, ke = U.stat_desc.has_stree, Oe = U.stat_desc.extra_bits, Ce = U.stat_desc.extra_base, Me = U.stat_desc.max_length, nt = 0, Be = 0; Be <= h; Be++)
-        ce.bl_count[Be] = 0;
+      for (var ne, Se, ve, ge, Te, ce = W, re = U.dyn_tree, fe = U.max_code, le = U.stat_desc.static_tree, ke = U.stat_desc.has_stree, Oe = U.stat_desc.extra_bits, Ce = U.stat_desc.extra_base, Me = U.stat_desc.max_length, nt = 0, Fe = 0; Fe <= h; Fe++)
+        ce.bl_count[Fe] = 0;
       for (re[2 * ce.heap[ce.heap_max] + 1] = 0, ne = ce.heap_max + 1; ne < 573; ne++)
-        Me < (Be = re[2 * re[2 * (Se = ce.heap[ne]) + 1] + 1] + 1) && (Be = Me, nt++), re[2 * Se + 1] = Be, fe < Se || (ce.bl_count[Be]++, ge = 0, Ce <= Se && (ge = Oe[Se - Ce]), Te = re[2 * Se], ce.opt_len += Te * (Be + ge), ke && (ce.static_len += Te * (le[2 * Se + 1] + ge)));
+        Me < (Fe = re[2 * re[2 * (Se = ce.heap[ne]) + 1] + 1] + 1) && (Fe = Me, nt++), re[2 * Se + 1] = Fe, fe < Se || (ce.bl_count[Fe]++, ge = 0, Ce <= Se && (ge = Oe[Se - Ce]), Te = re[2 * Se], ce.opt_len += Te * (Fe + ge), ke && (ce.static_len += Te * (le[2 * Se + 1] + ge)));
       if (nt !== 0) {
         do
-          for (Be = Me - 1; ce.bl_count[Be] === 0; )
-            Be--;
-        while (ce.bl_count[Be]--, ce.bl_count[Be + 1] += 2, ce.bl_count[Me]--, 0 < (nt -= 2));
-        for (Be = Me; Be !== 0; Be--)
-          for (Se = ce.bl_count[Be]; Se !== 0; )
-            fe < (ve = ce.heap[--ne]) || (re[2 * ve + 1] !== Be && (ce.opt_len += (Be - re[2 * ve + 1]) * re[2 * ve], re[2 * ve + 1] = Be), Se--);
+          for (Fe = Me - 1; ce.bl_count[Fe] === 0; )
+            Fe--;
+        while (ce.bl_count[Fe]--, ce.bl_count[Fe + 1] += 2, ce.bl_count[Me]--, 0 < (nt -= 2));
+        for (Fe = Me; Fe !== 0; Fe--)
+          for (Se = ce.bl_count[Fe]; Se !== 0; )
+            fe < (ve = ce.heap[--ne]) || (re[2 * ve + 1] !== Fe && (ce.opt_len += (Fe - re[2 * ve + 1]) * re[2 * ve], re[2 * ve + 1] = Fe), Se--);
       }
       T(G, ue, W.bl_count);
     }
@@ -28040,23 +28064,23 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
                   i(re), i(Oe);
                   var Ce = F(re), Me = F(Oe);
                   if (H(re.p, Me)) {
-                    if ((Be = Oe.p.slice(re.p.length)).length == 0)
+                    if ((Fe = Oe.p.slice(re.p.length)).length == 0)
                       return !A(re) && !A(Oe) || A(re) && !A(Oe) ? (B(Oe, Ce), i(re), i(Oe)) : (fe.splice(le, 1, re), K(re.p, Oe.p) || (re.lm = Ce), re.p = Oe.p, i(re), i(Oe)), !0;
-                    A(Oe) ? Oe.p = Ce.concat(Be) : (Be = Me.slice(re.p.length), B(Oe, Ce.concat(Be)), q(re.p, Oe.p) && L(Oe.p, re.p.length - 1), q(Ce, Oe.p) && T(Oe.p, Ce.length - 1)), i(re), i(Oe);
+                    A(Oe) ? Oe.p = Ce.concat(Fe) : (Fe = Me.slice(re.p.length), B(Oe, Ce.concat(Fe)), q(re.p, Oe.p) && L(Oe.p, re.p.length - 1), q(Ce, Oe.p) && T(Oe.p, Ce.length - 1)), i(re), i(Oe);
                   } else {
                     if (H(re.p, Oe.p)) {
                       if (!I(re.p, Oe.p))
-                        return i(re), i(Oe), Be = Oe.p.slice(re.p.length), Oe.p = Ce.concat(Be), A(Oe) || (q(re.p, Me) && L(Me, re.p.length - 1, Oe), q(Ce, Me) && T(Me, Ce.length - 1), B(Oe, Me)), i(re), i(Oe), !1;
-                      if (0 < (Be = Z(fe, le, re)))
+                        return i(re), i(Oe), Fe = Oe.p.slice(re.p.length), Oe.p = Ce.concat(Fe), A(Oe) || (q(re.p, Me) && L(Me, re.p.length - 1, Oe), q(Ce, Me) && T(Me, Ce.length - 1), B(Oe, Me)), i(re), i(Oe), !1;
+                      if (0 < (Fe = Z(fe, le, re)))
                         return i(fe), !0;
                     }
-                    var nt, Be = ((De) => {
+                    var nt, Fe = ((De) => {
                       if (De.lm == null)
                         throw new Error("ESTOP: getLmETToPath invaid lmop");
                       var xe = F(De);
                       return R(De.p, xe) && T(xe, De.p.length - 1), xe;
                     })(re);
-                    I(Ce, Me) || A(re) && !D(re) && I(Be, Me) ? (i(re), i(Oe), Ce = D(re), S(re, Oe), nt = { p: u(Oe.p), ld: {} }, i(nt), i(Oe), y(nt, re, ke), Oe.p = nt.p, A(re) && !Ce && I(Be, Me) ? i(Me) : ((!A(re) || Ce ? (i(Me), T) : (i(Me), L))(Me, Me.length - 1), B(Oe, Me)), i(re), i(Oe)) : (x(re, Oe, ke), i(re), i(Oe), z(Oe) ? (i(fe[le]), fe.splice(le, 1)) : N(fe[le]));
+                    I(Ce, Me) || A(re) && !D(re) && I(Fe, Me) ? (i(re), i(Oe), Ce = D(re), S(re, Oe), nt = { p: u(Oe.p), ld: {} }, i(nt), i(Oe), y(nt, re, ke), Oe.p = nt.p, A(re) && !Ce && I(Fe, Me) ? i(Me) : ((!A(re) || Ce ? (i(Me), T) : (i(Me), L))(Me, Me.length - 1), B(Oe, Me)), i(re), i(Oe)) : (x(re, Oe, ke), i(re), i(Oe), z(Oe) ? (i(fe[le]), fe.splice(le, 1)) : N(fe[le]));
                   }
                 }
                 return !1;
@@ -28094,12 +28118,12 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
                 return !1;
               })(Se, ne, ce, ve) : ne[ce].ld !== void 0 && ne[ce].li == null ? Te = ((re, fe, le) => {
                 {
-                  let Oe = function(nt, Be, De) {
-                    (De == "LmLd" ? P : M)(nt, Be);
-                  }, Ce = function(nt, Be, De) {
-                    (De == "LmLd" ? T : L)(nt, Be);
-                  }, Me = function(nt, Be, De) {
-                    (De == "LmLd" ? L : T)(nt, Be);
+                  let Oe = function(nt, Fe, De) {
+                    (De == "LmLd" ? P : M)(nt, Fe);
+                  }, Ce = function(nt, Fe, De) {
+                    (De == "LmLd" ? T : L)(nt, Fe);
+                  }, Me = function(nt, Fe, De) {
+                    (De == "LmLd" ? L : T)(nt, Fe);
                   };
                   var ke;
                   fe = fe[le], i(re), i(fe), le = F(re), I(re.p, fe.p) || H(fe.p, re.p) ? (P(re.p, fe), R(fe.p, le) && (P(le, fe), B(re, le)), i(re)) : I(le, fe.p) ? A(re) ? R(fe.p, re.p) ? (T(fe.p, le.length - 1), P(re.p, fe), i(re), i(fe)) : R(re.p, fe.p) && (L(fe.p, re.p.length - 1), P(le, fe), B(re, le), i(re), i(fe)) : (T(fe.p, le.length - 1), i(fe)) : H(re.p, fe.p) ? (ke = fe.p.slice(re.p.length), fe.p = le.concat(ke), i(fe)) : H(le, fe.p) ? (R(re.p, fe.p) ? L(fe.p, re.p.length - 1) : T(fe.p, le.length - 1), i(fe)) : H(fe.p, le) ? ((A(re) || (P(le, fe), B(re, le), R(fe.p, re.p))) && P(re.p, fe), i(re)) : (ke = re, le = fe, re = "LmLd", i(ke), i(le), fe = F(ke), R(le.p, ke.p) ? (Oe(ke.p, le, re), R(le.p, fe) ? (Oe(fe, le, re), B(ke, fe), i(ke)) : R(fe, le.p) ? (Ce(le.p, fe.length - 1, re), i(ke), i(le)) : i(ke)) : R(le.p, fe) ? (Oe(fe, le, re), B(ke, fe), R(ke.p, le.p) ? (Me(le.p, ke.p.length - 1, re), i(fe), i(le)) : i(ke)) : (R(le.p, fe) || R(le.p, ke.p) ? i(ke) : R(ke.p, le.p) && !R(fe, le.p) ? Me(le.p, ke.p.length - 1, re) : R(fe, le.p) && !R(ke.p, le.p) ? Ce(le.p, fe.length - 1, re) : i(ke), i(le)));
@@ -29799,9 +29823,9 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
       function h(R, q) {
         var W;
         return R = [R = R.charCodeAt(0) < 33 ? R.trim() : R], 0 < H && (W = p(-1, q, R, R, N, T, 0, 0, 0, 0)) !== void 0 && typeof W == "string" && (q = W), q = function U(Z, Y, X, G, ee) {
-          for (var ae, de, ue, ne, Se, ve = 0, ge = 0, Te = 0, ce = 0, re = 0, fe = 0, le = ue = ae = 0, ke = 0, Oe = 0, Ce = 0, Me = 0, nt = X.length, Be = nt - 1, De = "", xe = "", Je = "", je = ""; ke < nt; ) {
-            if (de = X.charCodeAt(ke), ke === Be && ge + ce + Te + ve !== 0 && (ge !== 0 && (de = ge === 47 ? 10 : 47), ce = Te = ve = 0, nt++, Be++), ge + ce + Te + ve === 0) {
-              if (ke === Be && 0 < (De = 0 < Oe ? De.replace(g, "") : De).trim().length) {
+          for (var ae, de, ue, ne, Se, ve = 0, ge = 0, Te = 0, ce = 0, re = 0, fe = 0, le = ue = ae = 0, ke = 0, Oe = 0, Ce = 0, Me = 0, nt = X.length, Fe = nt - 1, De = "", xe = "", Je = "", je = ""; ke < nt; ) {
+            if (de = X.charCodeAt(ke), ke === Fe && ge + ce + Te + ve !== 0 && (ge !== 0 && (de = ge === 47 ? 10 : 47), ce = Te = ve = 0, nt++, Fe++), ge + ce + Te + ve === 0) {
+              if (ke === Fe && 0 < (De = 0 < Oe ? De.replace(g, "") : De).trim().length) {
                 switch (de) {
                   case 32:
                   case 9:
@@ -29829,7 +29853,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
                           case 42:
                           case 47:
                             e: {
-                              for (le = ke + 1; le < Be; ++le)
+                              for (le = ke + 1; le < Fe; ++le)
                                 switch (X.charCodeAt(le)) {
                                   case 47:
                                     if (de !== 42 || X.charCodeAt(le - 1) !== 42 || ke + 2 === le)
@@ -29852,7 +29876,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
                         de++;
                       case 34:
                       case 39:
-                        for (; ke++ < Be && X.charCodeAt(ke) !== de; )
+                        for (; ke++ < Fe && X.charCodeAt(ke) !== de; )
                           ;
                     }
                     if (ue === 0)
@@ -34224,7 +34248,7 @@ Error: ` + N);
             return xe = String(ge) + "n", le ? z(ge, xe) : xe;
           if ((le = fe.depth === void 0 ? 5 : fe.depth) <= (ce = ce === void 0 ? 0 : ce) && 0 < le && typeof ge == "object")
             return q(ge) ? "[Array]" : "[Object]";
-          var ke, Oe, Ce, Me, nt, Be, De, xe = ((Ze, Qe) => {
+          var ke, Oe, Ce, Me, nt, Fe, De, xe = ((Ze, Qe) => {
             var Bt;
             if (Ze.indent === "	")
               Bt = "	";
@@ -34247,8 +34271,8 @@ Error: ` + N);
           if (U(ge))
             return Oe = T ? E.call(String(ge), /^(Symbol\(.*\))_[^)]*$/, "$1") : P.call(ge), typeof ge != "object" || T ? Oe : ae(Oe);
           if (((Ze) => Ze && typeof Ze == "object" && (typeof HTMLElement < "u" && Ze instanceof HTMLElement || typeof Ze.nodeName == "string" && typeof Ze.getAttribute == "function"))(ge)) {
-            for (var je = "<" + y.call(String(ge.nodeName)), Fe = ge.attributes || [], He = 0; He < Fe.length; He++)
-              je += " " + Fe[He].name + "=" + R((ke = Fe[He].value, E.call(String(ke), /"/g, "&quot;")), "double", fe);
+            for (var je = "<" + y.call(String(ge.nodeName)), Be = ge.attributes || [], He = 0; He < Be.length; He++)
+              je += " " + Be[He].name + "=" + R((ke = Be[He].value, E.call(String(ke), /"/g, "&quot;")), "double", fe);
             return je += ">", ge.childNodes && ge.childNodes.length && (je += "..."), je + "</" + y.call(String(ge.nodeName)) + ">";
           }
           if (q(ge))
@@ -34331,7 +34355,7 @@ Error: ` + N);
                 return M.call(Ze), 1;
               } catch {
               }
-          })(ge) ? ae(Je(M.call(ge))) : X(le = ge) !== "[object Boolean]" || N && typeof le == "object" && N in le ? X(Te = ge) !== "[object String]" || N && typeof Te == "object" && N in Te ? typeof window < "u" && ge === window ? "{ [object Window] }" : typeof globalThis < "u" && ge === globalThis || r !== void 0 && ge === r ? "{ [object globalThis] }" : (X(le = ge) !== "[object Date]" || N && typeof le == "object" && N in le) && !W(ge) ? (Te = Se(ge, Je), le = A ? A(ge) === Object.prototype : ge instanceof Object || ge.constructor === Object, Be = ge instanceof Object ? "" : "null prototype", De = !le && N && Object(ge) === ge && N in ge ? w.call(X(ge), 8, -1) : Be ? "Object" : "", le = (!le && typeof ge.constructor == "function" && ge.constructor.name ? ge.constructor.name + " " : "") + (De || Be ? "[" + O.call(C.call([], De || [], Be || []), ": ") + "] " : ""), Te.length === 0 ? le + "{}" : xe ? le + "{" + ne(Te, xe) + "}" : le + "{ " + O.call(Te, ", ") + " }") : String(ge) : ae(Je(String(ge))) : ae(g.call(ge)) : ae(Je(Number(ge)));
+          })(ge) ? ae(Je(M.call(ge))) : X(le = ge) !== "[object Boolean]" || N && typeof le == "object" && N in le ? X(Te = ge) !== "[object String]" || N && typeof Te == "object" && N in Te ? typeof window < "u" && ge === window ? "{ [object Window] }" : typeof globalThis < "u" && ge === globalThis || r !== void 0 && ge === r ? "{ [object globalThis] }" : (X(le = ge) !== "[object Date]" || N && typeof le == "object" && N in le) && !W(ge) ? (Te = Se(ge, Je), le = A ? A(ge) === Object.prototype : ge instanceof Object || ge.constructor === Object, Fe = ge instanceof Object ? "" : "null prototype", De = !le && N && Object(ge) === ge && N in ge ? w.call(X(ge), 8, -1) : Fe ? "Object" : "", le = (!le && typeof ge.constructor == "function" && ge.constructor.name ? ge.constructor.name + " " : "") + (De || Fe ? "[" + O.call(C.call([], De || [], Fe || []), ": ") + "] " : ""), Te.length === 0 ? le + "{}" : xe ? le + "{" + ne(Te, xe) + "}" : le + "{ " + O.call(Te, ", ") + " }") : String(ge) : ae(Je(String(ge))) : ae(g.call(ge)) : ae(Je(Number(ge)));
         };
         var Z = Object.prototype.hasOwnProperty || function(ve) {
           return ve in this;
@@ -35030,7 +35054,7 @@ Valid keys: ` + JSON.stringify(Object.keys(S), null, "  "));
       j === k._wrapperState.initialValue && j !== "" && j !== null && (k.value = j);
     }
     var Me = "http://www.w3.org/1999/xhtml", nt = "http://www.w3.org/2000/svg";
-    function Be(k) {
+    function Fe(k) {
       switch (k) {
         case "svg":
           return "http://www.w3.org/2000/svg";
@@ -35041,7 +35065,7 @@ Valid keys: ` + JSON.stringify(Object.keys(S), null, "  "));
       }
     }
     function De(k, j) {
-      return k == null || k === "http://www.w3.org/1999/xhtml" ? Be(j) : k === "http://www.w3.org/2000/svg" && j === "foreignObject" ? "http://www.w3.org/1999/xhtml" : k;
+      return k == null || k === "http://www.w3.org/1999/xhtml" ? Fe(j) : k === "http://www.w3.org/2000/svg" && j === "foreignObject" ? "http://www.w3.org/1999/xhtml" : k;
     }
     Je = function(k, j) {
       if (k.namespaceURI !== nt || "innerHTML" in k)
@@ -35058,7 +35082,7 @@ Valid keys: ` + JSON.stringify(Object.keys(S), null, "  "));
         return Je(k, j);
       });
     } : Je;
-    function Fe(k, j) {
+    function Be(k, j) {
       if (j) {
         var V = k.firstChild;
         if (V && V === k.lastChild && V.nodeType === 3)
@@ -37530,7 +37554,7 @@ Error generating stack: ` + pe.message + `
         default:
           throw Error(i(161));
       }
-      16 & V.flags && (Fe(j, ""), V.flags &= -17);
+      16 & V.flags && (Be(j, ""), V.flags &= -17);
       e:
         t:
           for (V = k; ; ) {
@@ -37646,7 +37670,7 @@ Error generating stack: ` + pe.message + `
             if ((j.updateQueue = null) !== pe) {
               for (V[pf] = oe, k === "input" && oe.type === "radio" && oe.name != null && ve(V, oe), zt(k, ie), j = zt(k, oe), ie = 0; ie < pe.length; ie += 2) {
                 var be = pe[ie], Le = pe[ie + 1];
-                be === "style" ? Bt(V, Le) : be === "dangerouslySetInnerHTML" ? je(V, Le) : be === "children" ? Fe(V, Le) : x(V, be, Le, j);
+                be === "style" ? Bt(V, Le) : be === "dangerouslySetInnerHTML" ? je(V, Le) : be === "children" ? Be(V, Le) : x(V, be, Le, j);
               }
               switch (k) {
                 case "input":
@@ -38099,7 +38123,7 @@ Add a <Suspense fallback=...> component higher in the tree to provide a loading
                     }
                     Re = pe, (be.updateQueue = Re) !== null && (be.flags |= 4);
                   } else {
-                    switch (Ut = at.nodeType === 9 ? at : at.ownerDocument, (pe = pe === Me ? Be(Le) : pe) === Me ? Le === "script" ? ((pe = Ut.createElement("div")).innerHTML = "<script><\/script>", pe = pe.removeChild(pe.firstChild)) : typeof Re.is == "string" ? pe = Ut.createElement(Le, { is: Re.is }) : (pe = Ut.createElement(Le), Le === "select" && (Ut = pe, Re.multiple ? Ut.multiple = !0 : Re.size && (Ut.size = Re.size))) : pe = Ut.createElementNS(pe, Le), pe[ms] = be, pe[pf] = Re, JC(pe, be), be.stateNode = pe, Ut = zt(Le, Re), Le) {
+                    switch (Ut = at.nodeType === 9 ? at : at.ownerDocument, (pe = pe === Me ? Fe(Le) : pe) === Me ? Le === "script" ? ((pe = Ut.createElement("div")).innerHTML = "<script><\/script>", pe = pe.removeChild(pe.firstChild)) : typeof Re.is == "string" ? pe = Ut.createElement(Le, { is: Re.is }) : (pe = Ut.createElement(Le), Le === "select" && (Ut = pe, Re.multiple ? Ut.multiple = !0 : Re.size && (Ut.size = Re.size))) : pe = Ut.createElementNS(pe, Le), pe[ms] = be, pe[pf] = Re, JC(pe, be), be.stateNode = pe, Ut = zt(Le, Re), Le) {
                       case "dialog":
                         ot("cancel", pe), ot("close", pe), at = Re;
                         break;
@@ -38143,7 +38167,7 @@ Add a <Suspense fallback=...> component higher in the tree to provide a loading
                     Ht(Le, at);
                     var ln, Gn = at;
                     for (Ft in Gn)
-                      Gn.hasOwnProperty(Ft) && (ln = Gn[Ft], Ft === "style" ? Bt(pe, ln) : Ft === "dangerouslySetInnerHTML" ? (ln = ln ? ln.__html : void 0) != null && je(pe, ln) : Ft === "children" ? typeof ln == "string" ? Le === "textarea" && ln === "" || Fe(pe, ln) : typeof ln == "number" && Fe(pe, "" + ln) : Ft !== "suppressContentEditableWarning" && Ft !== "suppressHydrationWarning" && Ft !== "autoFocus" && (d.hasOwnProperty(Ft) ? ln != null && Ft === "onScroll" && ot("scroll", pe) : ln != null && x(pe, Ft, ln, Ut)));
+                      Gn.hasOwnProperty(Ft) && (ln = Gn[Ft], Ft === "style" ? Bt(pe, ln) : Ft === "dangerouslySetInnerHTML" ? (ln = ln ? ln.__html : void 0) != null && je(pe, ln) : Ft === "children" ? typeof ln == "string" ? Le === "textarea" && ln === "" || Be(pe, ln) : typeof ln == "number" && Be(pe, "" + ln) : Ft !== "suppressContentEditableWarning" && Ft !== "suppressHydrationWarning" && Ft !== "autoFocus" && (d.hasOwnProperty(Ft) ? ln != null && Ft === "onScroll" && ot("scroll", pe) : ln != null && x(pe, Ft, ln, Ut)));
                     switch (Le) {
                       case "input":
                         ae(pe), Te(pe, Re, !1);
@@ -38319,7 +38343,7 @@ Add a <Suspense fallback=...> component higher in the tree to provide a loading
               try {
                 for (Re = V; wn !== null; ) {
                   var En, jn, Pn = wn.flags;
-                  switch (16 & Pn && Fe(wn.stateNode, ""), 128 & Pn && (En = wn.alternate) !== null && (jn = En.ref) !== null && (typeof jn == "function" ? jn(null) : jn.current = null), 1038 & Pn) {
+                  switch (16 & Pn && Be(wn.stateNode, ""), 128 & Pn && (En = wn.alternate) !== null && (jn = En.ref) !== null && (typeof jn == "function" ? jn(null) : jn.current = null), 1038 & Pn) {
                     case 2:
                       Qb(wn), wn.flags &= -3;
                       break;
@@ -39871,9 +39895,9 @@ Has styled-components' style tag been unmounted or altered by another script?
             return Xt.name || L(15), ge(Jt, Xt.name);
           }, 5381).toString() : "", Qt;
         }
-        var Me = u.createContext(), nt = (O = Me.Consumer, u.createContext()), Be = (nt.Consumer, new G()), De = Ce();
+        var Me = u.createContext(), nt = (O = Me.Consumer, u.createContext()), Fe = (nt.Consumer, new G()), De = Ce();
         function xe() {
-          return i.useContext(Me) || Be;
+          return i.useContext(Me) || Fe;
         }
         function Je() {
           return i.useContext(nt) || De;
@@ -39892,7 +39916,7 @@ Has styled-components' style tag been unmounted or altered by another script?
         Ye.prototype.getName = function(_e) {
           return _e === void 0 && (_e = De), this.name + _e.hash;
         };
-        var Fe = Ye, He = /([A-Z])/, Ze = /([A-Z])/g, Qe = /^ms-/, Bt = function(_e) {
+        var Be = Ye, He = /([A-Z])/, Ze = /([A-Z])/g, Qe = /^ms-/, Bt = function(_e) {
           return "-" + _e.toLowerCase();
         };
         function Ye(_e, $e) {
@@ -39918,7 +39942,7 @@ Has styled-components' style tag been unmounted or altered by another script?
             return ft;
           }
           var ht;
-          return zt(_e) ? "" : y(_e) ? "." + _e.styledComponentId : E(_e) ? typeof _e != "function" || _e.prototype && _e.prototype.isReactComponent || !$e ? _e : (ht = _e($e), r.env.NODE_ENV !== "production" && l.isElement(ht) && x(_e), en(ht, $e, rt, et)) : _e instanceof Fe ? rt ? (_e.inject(rt, et), _e.getName(et)) : _e : b(_e) ? function Pt(Mt, Qt) {
+          return zt(_e) ? "" : y(_e) ? "." + _e.styledComponentId : E(_e) ? typeof _e != "function" || _e.prototype && _e.prototype.isReactComponent || !$e ? _e : (ht = _e($e), r.env.NODE_ENV !== "production" && l.isElement(ht) && x(_e), en(ht, $e, rt, et)) : _e instanceof Be ? rt ? (_e.inject(rt, et), _e.getName(et)) : _e : b(_e) ? function Pt(Mt, Qt) {
             var Jt, Xt, nn, zn = [];
             for (nn in Mt)
               Mt.hasOwnProperty(nn) && !zt(Mt[nn]) && (Array.isArray(Mt[nn]) && Mt[nn].isCss || E(Mt[nn]) ? zn.push(Ht(nn) + ":", Mt[nn], ";") : b(Mt[nn]) ? zn.push.apply(zn, Pt(Mt[nn], nn)) : zn.push(Ht(nn) + ": " + (Jt = nn, ((Xt = Mt[nn]) == null || typeof Xt == "boolean" || Xt === "" ? "" : typeof Xt != "number" || Xt === 0 || Jt in f || Jt.startsWith("--") ? String(Xt).trim() : Xt + "px") + ";")));
@@ -40044,7 +40068,7 @@ To resolve this only create new StyledComponents outside of any render method an
           return this.sealed ? L(2) : u.createElement(je, { sheet: this.instance }, _e);
         }, Zt.interleaveWithNodeStream = function(_e) {
           return L(3);
-        }, ze), Pe = { StyleSheet: G, masterSheet: Be };
+        }, ze), Pe = { StyleSheet: G, masterSheet: Fe };
         function ze() {
           var _e = this;
           this._emitSheetCSS = function() {
@@ -40093,7 +40117,7 @@ To resolve this only create new StyledComponents outside of any render method an
             rt[et - 1] = arguments[et];
           _e = yt.apply(void 0, [_e].concat(rt)).join("");
           var gt = Ie(_e);
-          return new Fe(gt, _e);
+          return new Be(gt, _e);
         }, o.useTheme = function() {
           return i.useContext(Ue);
         }, o.version = "5.3.11", o.withTheme = function(_e) {
@@ -45211,8 +45235,8 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           if (typeof q.od == "string" && typeof q.oi == "string")
             q.p[q.p.length - 1] == "cdxText" ? ((J = R + 1) < L.length && ((xe, Je) => {
               if (Je.od !== void 0 && Je.oi !== void 0 && Array.isArray(Je.od) && Array.isArray(Je.oi) && xe.p.length == Je.p.length && Je.p[Je.p.length - 1] == "cdxStyleRanges") {
-                for (var je = xe.p.length, Fe = 0; Fe < je - 1; Fe++)
-                  if (xe.p[Fe] !== Je.p[Fe])
+                for (var je = xe.p.length, Be = 0; Be < je - 1; Be++)
+                  if (xe.p[Be] !== Je.p[Be])
                     return;
                 return m(xe), m(Je), 1;
               }
@@ -45231,8 +45255,8 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
                     }
                     var an = 0;
                     return Ye !== void 0 && Ht == null ? an = Ye : Ye == null && Ht !== void 0 ? an = Ht : Ye !== void 0 && Ht !== void 0 && (an = Math.min(Ht, Ye)), { deleteBlk: Qe, insertBlk: Bt, firstPos: an };
-                  })(Je)).deleteBlk, Fe = Je.insertBlk, He = (Je = Je.firstPos, Fe = _(je = E(je), E(Fe)), m(Fe), xe);
-                  return He.cop = d(Fe.ops), 0 < (Fe = function Ze(Qe, Bt) {
+                  })(Je)).deleteBlk, Be = Je.insertBlk, He = (Je = Je.firstPos, Be = _(je = E(je), E(Be)), m(Be), xe);
+                  return He.cop = d(Be.ops), 0 < (Be = function Ze(Qe, Bt) {
                     var Ye = Bt;
                     Bt == null && (Ye = Qe.length);
                     for (var Ht = 0, zt = 0; zt < Ye; zt++) {
@@ -45240,7 +45264,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
                       Ht += en.children !== void 0 ? Ze(en.children) : en.cdxText !== void 0 ? en.cdxText.length : 1;
                     }
                     return Ht;
-                  }(He.od, Je)) && (He.cop[0] !== void 0 && He.cop[0].tg !== void 0 && He.cop[0].sx == null ? He.cop[0].tg = He.cop[0].tg + Fe : (Je = { tg: Fe }, He.cop.unshift(Je))), m(xe), je;
+                  }(He.od, Je)) && (He.cop[0] !== void 0 && He.cop[0].tg !== void 0 && He.cop[0].sx == null ? He.cop[0].tg = He.cop[0].tg + Be : (Je = { tg: Be }, He.cop.unshift(Je))), m(xe), je;
                 })(N), ge = Y = Z = W = void 0;
                 var W = N, U = function(xe) {
                   for (var Je = [], je = 0; je < xe.length; je++)
@@ -45259,8 +45283,8 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
                     return Je;
                   if (Je.length == 0)
                     return xe;
-                  for (var je = [], Fe = 0; Fe < xe.length; Fe++) {
-                    for (var He = xe[Fe], Ze = !0, Qe = 0; Qe < Je.length; Qe++)
+                  for (var je = [], Be = 0; Be < xe.length; Be++) {
+                    for (var He = xe[Be], Ze = !0, Qe = 0; Qe < Je.length; Qe++)
                       if (He == Je[Qe]) {
                         Ze = !1;
                         break;
@@ -45273,22 +45297,22 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
                 X.p.splice(-1, 1, "cdxBlk", "cdxText"), de.splice(-1, 1, "cdxBlk", "cdxText");
                 for (var ue = [], ne = 0; ne < X.cop.length; ne++) {
                   var Se = X.cop[ne];
-                  Se.sx !== void 0 && Se.sx.embedNode !== void 0 && Se.cr == null ? ((xe, Je, je, Fe, He, Ze) => {
+                  Se.sx !== void 0 && Se.sx.embedNode !== void 0 && Se.cr == null ? ((xe, Je, je, Be, He, Ze) => {
                     m(xe);
                     var Qe = xe.sx.embedNode, Bt = xe.sx.embedNode.cdxEmbed.id;
-                    if ((Fe = ((en, an) => {
+                    if ((Be = ((en, an) => {
                       for (var yt = 0; yt < en.length; yt++) {
                         var Ot = en[yt];
                         if (Ot.attributes !== void 0 && Ot.attributes.embedNode !== void 0 && Ot.attributes.embedNode.cdxEmbed !== void 0 && Ot.attributes.embedNode.cdxEmbed.id !== void 0 && Ot.attributes.embedNode.cdxEmbed.id == an)
                           return Ot.attributes.embedNode, Ot.attributes.embedNode;
                       }
                       return null;
-                    })(Fe, Bt)) == null)
+                    })(Be, Bt)) == null)
                       Je.push(xe);
                     else {
                       m(je);
                       var Ye = [];
-                      xe.sx.embedNode.cdxEmbed.type == "poll" && (Ze = new g({ keyNames: { default: "uid" }, semantics: { paths: { votes: "MERGE" }, string: "MERGE", number: "MERGE" } })), Ye = Ze.jsonDiff(Fe, Qe, !1, !0), m(Ye);
+                      xe.sx.embedNode.cdxEmbed.type == "poll" && (Ze = new g({ keyNames: { default: "uid" }, semantics: { paths: { votes: "MERGE" }, string: "MERGE", number: "MERGE" } })), Ye = Ze.jsonDiff(Be, Qe, !1, !0), m(Ye);
                       for (var Ht, zt = 0; zt < Ye.length; zt++)
                         Ye[zt].p[Ye[zt].p.length - 1] == "cdxText" && Ye[zt].od !== void 0 && Ye[zt].oi !== void 0 && Array.isArray(Ye[zt].od) && Array.isArray(Ye[zt].oi) ? (Ht = _(Ye[zt].od, Ye[zt].oi), m(Ht), Ye[zt].cop = d(Ht.ops), Ye[zt].t = "qd", (Ht = h(Ye[zt].p)).unshift("codoxVP-" + Bt), Ye[zt].p = He.concat(Ht), delete Ye[zt].od, delete Ye[zt].oi) : ((Ht = h(Ye[zt].p)).unshift("codoxVP-" + Bt), Ye[zt].p = He.concat(Ht)), m(Ye[zt]), je.push(Ye[zt]);
                       0 < Je.length && Je[Je.length - 1].tg !== void 0 ? (m(Je), Je[Je.length - 1].tg += 1) : Je.push({ tg: 1 });
@@ -45309,9 +45333,9 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
               }
               D = ge = D = A = N = void 0, N = {}, A = {}, D = (U = function(xe) {
                 m(xe);
-                for (var Je = b(xe), je = 0, Fe = 0; Fe < Je.length; Fe++) {
+                for (var Je = b(xe), je = 0, Be = 0; Be < Je.length; Be++) {
                   var He;
-                  je < (He = (He = (He = Je[Fe])[He.length - 1]).offset + He.length) && (je = He);
+                  je < (He = (He = (He = Je[Be])[He.length - 1]).offset + He.length) && (je = He);
                 }
                 return je;
               })((T = q).od), ge = U(T.oi), D = Math.max(D, ge), N.cdxText = "*".padStart(D, "0"), A.cdxText = "*".padStart(D, "0"), N.cdxStyleRanges = T.od, A.cdxStyleRanges = T.oi, T.cop = v(N, A), T.p.splice(-1, 1, "cdxText"), T.t = "qd", delete T.od, delete T.oi;
@@ -45342,7 +45366,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           var Me = h(ke);
           Me.ldLen = Oe, fe.push(Me);
         } else if (re[le].li !== void 0 && re[le].ld == null) {
-          for (var nt = 1, Be = [ke.li], De = le + 1; De < re.length && re[De].li !== void 0 && re[De].ld == null && ((xe, Je) => {
+          for (var nt = 1, Fe = [ke.li], De = le + 1; De < re.length && re[De].li !== void 0 && re[De].ld == null && ((xe, Je) => {
             if (!Array.isArray(xe) || !Array.isArray(Je))
               throw new Error("path must be an array");
             if (xe.length !== Je.length)
@@ -45352,8 +45376,8 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
                 return !1;
             return xe[xe.length - 1] + 1 == Je[Je.length - 1];
           })(re[De - 1].p, re[De].p); De++)
-            nt++, Be.push(re[De].li);
-          le = le + nt - 1, (Me = h(ke)).li = {}, Me.liObj = Be, fe.push(Me);
+            nt++, Fe.push(re[De].li);
+          le = le + nt - 1, (Me = h(ke)).li = {}, Me.liObj = Fe, fe.push(Me);
         } else
           fe.push(ke);
       }
@@ -46018,14 +46042,14 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
             return sn(he = (0, h.clone)(he)), (0, h.logClone)(he), he;
           }
           function re() {
-            return (0, h.clone)(Be);
+            return (0, h.clone)(Fe);
           }
           function fe(he) {
-            (0, h.logClone)(he), Be = le ? yt((0, h.clone)(he)) : (0, h.clone)(he), (0, h.logClone)(Be);
+            (0, h.logClone)(he), Fe = le ? yt((0, h.clone)(he)) : (0, h.clone)(he), (0, h.logClone)(Fe);
           }
           X();
-          var le = !1, ke = !1, Oe = !1, Ce = null, Me = [], nt = (ue = Se(), (0, h.logClone)(ue), ue !== void 0 ? (0, h.clone)(ue) : null), Be = null, De = null, xe = null, Je = null, je = ((0, h.logClone)(nt), (0, h.logClone)(Be), []), Fe = new p.JsonDiff(Te), He = (this.setWave = function(he) {
-            le = (Ce = he).gdft(), (ke = he.glx()) ? Fe = new p.JsonDiff({ keyNames: { default: "codoxId" }, semantics: { paths: { votes: "MERGE" }, number: "MERGE" } }) : le && (Fe = new p.JsonDiff({ keyNames: { default: "key" }, overrides: { "state.blocks.entityRanges": "$void" }, appServer: {}, semantics: { paths: { "state.blocks.type": "REPLACE", "state.blocks.cdxStyleRanges.offset": "MERGE" } } })), sn(nt), Be = yt(nt);
+          var le = !1, ke = !1, Oe = !1, Ce = null, Me = [], nt = (ue = Se(), (0, h.logClone)(ue), ue !== void 0 ? (0, h.clone)(ue) : null), Fe = null, De = null, xe = null, Je = null, je = ((0, h.logClone)(nt), (0, h.logClone)(Fe), []), Be = new p.JsonDiff(Te), He = (this.setWave = function(he) {
+            le = (Ce = he).gdft(), (ke = he.glx()) ? Be = new p.JsonDiff({ keyNames: { default: "codoxId" }, semantics: { paths: { votes: "MERGE" }, number: "MERGE" } }) : le && (Be = new p.JsonDiff({ keyNames: { default: "key" }, overrides: { "state.blocks.entityRanges": "$void" }, appServer: {}, semantics: { paths: { "state.blocks.type": "REPLACE", "state.blocks.cdxStyleRanges.offset": "MERGE" } } })), sn(nt), Fe = yt(nt);
           }, null), Ze = [];
           function Qe(he) {
             return He = he == "init" || Ce !== null && He == null ? Lt(Ce.editorInstance.getSelection()) : He;
@@ -46055,7 +46079,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
               return { state: (0, h.clone)(he), changes: null };
             if (it == b)
               return xe = (0, h.clone)(he), Je = Ie, { state: he, changes: null };
-            if (it = he, (Je = xe = null, h.logClone)(nt), (0, h.logClone)(it), he = Fe.jsonDiff(nt, it, !1, !0), (0, h.logClone)(he), he.length == 0)
+            if (it = he, (Je = xe = null, h.logClone)(nt), (0, h.logClone)(it), he = Be.jsonDiff(nt, it, !1, !0), (0, h.logClone)(he), he.length == 0)
               (le || ke) && (xt = Qe(), x(xt, it, Ce), E.now());
             else {
               he = (0, h.clone)(he), he = Ae(he), (0, h.logClone)(he);
@@ -46067,7 +46091,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
                 }
                 (0, f.ins)(st);
               }
-              (ke || le) && (De = (0, h.clone)(Be)), We(he = (0, h.clone)(st.op)), d.default.type.apply(Be, he), xt && (it = Ot(Be)), (le || ke) && (Ie = (0, h.clone)(st), he = an(Be, Ie), O(Ie, Ze, Ce, "loh"), 0 < he.length) && (it = Ot(Be)), nt = (0, h.clone)(it), xt = "lohjs", le ? xt = "lohdft" : ke && (xt = "lohlex"), Ce.gop2sm([st], xt, Ce);
+              (ke || le) && (De = (0, h.clone)(Fe)), We(he = (0, h.clone)(st.op)), d.default.type.apply(Fe, he), xt && (it = Ot(Fe)), (le || ke) && (Ie = (0, h.clone)(st), he = an(Fe, Ie), O(Ie, Ze, Ce, "loh"), 0 < he.length) && (it = Ot(Fe)), nt = (0, h.clone)(it), xt = "lohjs", le ? xt = "lohdft" : ke && (xt = "lohlex"), Ce.gop2sm([st], xt, Ce);
             }
             return { state: it, changes: null };
           }
@@ -46101,14 +46125,14 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           }
           function Ae(he) {
             var Ie;
-            return Ie = le ? K(he) : ke ? K(he, Fe) : he, Ie;
+            return Ie = le ? K(he) : ke ? K(he, Be) : he, Ie;
           }
           function We(he) {
             le ? M(he) : ke && B(he);
           }
           this.goffop = function() {
             var he;
-            xe !== null && ((0, h.logClone)(nt), (0, h.logClone)(xe), he = Fe.jsonDiff(nt, xe, !1, !0), (0, h.logClone)(he), he = Ae(he = (0, h.clone)(he)), (0, h.logClone)(he), he = { op: he, meta: Je }, (0, m.offLOHJson)(he, Ce), Be = yt(nt = xe), Je = xe = null);
+            xe !== null && ((0, h.logClone)(nt), (0, h.logClone)(xe), he = Be.jsonDiff(nt, xe, !1, !0), (0, h.logClone)(he), he = Ae(he = (0, h.clone)(he)), (0, h.logClone)(he), he = { op: he, meta: Je }, (0, m.offLOHJson)(he, Ce), Fe = yt(nt = xe), Je = xe = null);
           }, this.js = function() {
             var he = (Ie = 0 < arguments.length && arguments[0] !== void 0 ? arguments[0] : {}).state, Ie = Ie.meta;
             try {
@@ -46119,11 +46143,11 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
                 if (kt === W)
                   return zt((Oe = !1, h.clone)(nt), "init");
                 if (kt === R)
-                  return Me.shift(), Ue = Ot(Be), nt = (0, h.clone)(Ue), zt(Ue, "roh");
+                  return Me.shift(), Ue = Ot(Fe), nt = (0, h.clone)(Ue), zt(Ue, "roh");
                 if (kt === q)
-                  return Ue = Ot(Be), nt = (0, h.clone)(Ue), zt(Ue, "rcs");
+                  return Ue = Ot(Fe), nt = (0, h.clone)(Ue), zt(Ue, "rcs");
                 if (kt == U)
-                  return (Ue = je.shift()) !== void 0 ? (fe(Ue), zt(Ot(Ue), "set-val")) : zt(Ot(Be), "set-val");
+                  return (Ue = je.shift()) !== void 0 ? (fe(Ue), zt(Ot(Ue), "set-val")) : zt(Ot(Fe), "set-val");
               }
               if (Oe)
                 return { state: it };
@@ -46156,14 +46180,14 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           }, this.loh = en, this.roh = function(he) {
             (0, h.logClone)(he);
             var Ie, it = (0, h.clone)(he);
-            Me.push((0, h.clone)(he)), (0, h.logClone)(Be), De = (0, h.clone)(Be), We(he.op), d.default.type.apply(Be, he.op), (0, h.logClone)(Be), (le || ke) && (an(Be, it), he = Lt(Ce.editorInstance.getSelection()), Ie = Ze, Bt(he), C(it, he, Ce), O(it, Ie, Ce, "roh")), r.nextTick(function() {
+            Me.push((0, h.clone)(he)), (0, h.logClone)(Fe), De = (0, h.clone)(Fe), We(he.op), d.default.type.apply(Fe, he.op), (0, h.logClone)(Fe), (le || ke) && (an(Fe, it), he = Lt(Ce.editorInstance.getSelection()), Ie = Ze, Bt(he), C(it, he, Ce), O(it, Ie, Ce, "roh")), r.nextTick(function() {
               return ne({ action: R });
             }), ge && (r.nextTick(function() {
               return ne({ action: q });
             }), ge = !1);
           }, this.cbuff = function() {
             Me = [];
-          }, this.differ = Fe, this.gxs = function() {
+          }, this.differ = Be, this.gxs = function() {
             return De;
           }, this.gj = re, this.sj = fe, this.ges = ce, this.d = function() {
             return yt(ce());
@@ -46174,11 +46198,11 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           }, this.gconfig = function() {
             return Te;
           }, this.initState = function(he) {
-            (0, h.logClone)(he), Be = (0, h.clone)(he), nt = Ot(Be), (le || ke) && (Bt(he = Lt(Ce.editorInstance.getSelection())), (0, h.logClone)(he)), Oe = !0, r.nextTick(function() {
+            (0, h.logClone)(he), Fe = (0, h.clone)(he), nt = Ot(Fe), (le || ke) && (Bt(he = Lt(Ce.editorInstance.getSelection())), (0, h.logClone)(he)), Oe = !0, r.nextTick(function() {
               return ne({ action: W });
             });
           }, this.getLength = function() {
-            return Be ? JSON.stringify(Be).length : 0;
+            return Fe ? JSON.stringify(Fe).length : 0;
           }, this.dmid = 0, this.y = "json", this.c = function() {
           }, this.gss = ve, this.gsel = function() {
             return Ht;
@@ -46540,11 +46564,11 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           var ae = (ue = X[ee]).start, de = ue.end, ue = ue.update;
           return ae === -1 ? { cursor: null, selection: [], siteId: ee, update: !0 } : ae === de ? { cursor: K(ae), selection: [], siteId: ee, update: ue } : { cursor: K(ae), selection: ((ne, Se) => {
             try {
-              var ve, ge, Te, ce, re, fe, le, ke, Oe, Ce, Me, nt, Be, De, xe, Je, je, Fe = ne, He = Se - ne + 1, Ze = x.getLeaf(ne), Qe = (0, a.default)(Ze, 2), Bt = Qe[0], Ye = Qe[1], Ht = x.getLeaf(Se), zt = (0, a.default)(Ht, 2), en = zt[0], an = zt[1];
+              var ve, ge, Te, ce, re, fe, le, ke, Oe, Ce, Me, nt, Fe, De, xe, Je, je, Be = ne, He = Se - ne + 1, Ze = x.getLeaf(ne), Qe = (0, a.default)(Ze, 2), Bt = Qe[0], Ye = Qe[1], Ht = x.getLeaf(Se), zt = (0, a.default)(Ht, 2), en = zt[0], an = zt[1];
               return Bt == null || en == null ? [] : (ve = document.createRange(), ge = Bt.position(Ye, !0), ce = (Te = (0, a.default)(ge, 2))[0], re = Te[1], ve.setStart(ce, re), fe = en.position(an, !0), ke = (le = (0, a.default)(fe, 2))[0], Oe = le[1], Ce = [], Ce = ce === ke ? (ve.setEnd(ke, Oe), Array.from(ve.getClientRects())) : (ve.setEndAfter(ce.childNodes[re] || ce), Ce = Array.from(ve.getClientRects()), ve.setStartBefore(ke.childNodes[Oe] || ke), ve.setEnd(ke, Oe), Ce.concat(Array.from(ve.getClientRects()))), x.scroll.descendants(function(Ot) {
                 return Ot !== Bt && Ot !== en && Ot.statics.blotName === "text" && (ve.selectNode(Ot.domNode), Ce = Ce.concat(Array.from(ve.getClientRects())), !0);
-              }, Fe, He), Me = C.getBoundingClientRect(), yt = C, nt = { paddingLeft: parseFloat((0, p.getStyle)(yt, "padding-left")) || 0, marginLeft: parseFloat((0, p.getStyle)(yt, "margin-left")) || 0, borderLeft: parseFloat((0, p.getStyle)(yt, "border-left")) || 0, boxSizing: (0, p.getStyle)(yt, "box-sizing") }, Be = nt.boxSizing, De = nt.paddingLeft, xe = nt.marginLeft, Je = nt.borderLeft, je = C, Ce.map(function(Ot) {
-                return Ot = { left: Ot.left - Me.left + je.scrollLeft, right: Ot.right - Me.left + je.scrollLeft, top: Ot.top - Me.top + je.scrollTop, bottom: Ot.bottom - Me.top + je.scrollTop, width: Ot.width, height: Ot.height }, Be === "border-box" && (Ot.left += xe, Ot.right += xe), Be === "content-box" && (Ot.left += xe + De + Je, Ot.right += xe + De + Je), Ot;
+              }, Be, He), Me = C.getBoundingClientRect(), yt = C, nt = { paddingLeft: parseFloat((0, p.getStyle)(yt, "padding-left")) || 0, marginLeft: parseFloat((0, p.getStyle)(yt, "margin-left")) || 0, borderLeft: parseFloat((0, p.getStyle)(yt, "border-left")) || 0, boxSizing: (0, p.getStyle)(yt, "box-sizing") }, Fe = nt.boxSizing, De = nt.paddingLeft, xe = nt.marginLeft, Je = nt.borderLeft, je = C, Ce.map(function(Ot) {
+                return Ot = { left: Ot.left - Me.left + je.scrollLeft, right: Ot.right - Me.left + je.scrollLeft, top: Ot.top - Me.top + je.scrollTop, bottom: Ot.bottom - Me.top + je.scrollTop, width: Ot.width, height: Ot.height }, Fe === "border-box" && (Ot.left += xe, Ot.right += xe), Fe === "content-box" && (Ot.left += xe + De + Je, Ot.right += xe + De + Je), Ot;
               }).filter(function(Ot) {
                 return 1 < Ot.height && 1 < Ot.width;
               }));
@@ -47047,12 +47071,12 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
     }, roles: { Read: "r", Write: "w", Comment: "w", NoAccess: "n" } };
   }, { "@babel/runtime/helpers/interopRequireDefault": 593, "@babel/runtime/helpers/slicedToArray": 602 }], 562: [function(e, s, o) {
     var r, a = e("@babel/runtime/helpers/interopRequireDefault")(e("@babel/runtime/helpers/typeof")), l = Date, i = (r = e("./ver")).smVer, u = r.clientVer, d = (r = e("../env")).isProd, p = r.isClickup, f = (r = e("../../../codox-shared/src/com/log")).ins, h = ((r = e("../../../codox-shared/src/com/util")).clone, r.logClone), m = (r = e("../util/lib")).getTabId, g = r.clearTimer, v = (r = e("../logger.js")).logger, b = r.SENTRY_LEVEL_H, _ = (r = e("../../../codox-shared/src/com/constants")).JOINING, w = r.ONLINE, E = r.STOPPED, x = r.OFFLINE, y = (r = e("../../../codox-shared/src/com/constants")).STARTED_LOG, S = (r = e("../constants")).SMSUB, C = r.SMMSG, O = e("./rcs.js"), F = e("./dsm.js"), B = e("../../../codox-shared/src/gt/pt.js"), M = e("../../../codox-shared/src/gt/pu.js"), L = (r = e("./off.js")).gos, P = r.srjn, T = r.offLOH, N = (r = e("./opm")).dltmg, D = r.difmg, A = (r = e("./msg")).msg2sm, z = r.log2sm, I = (r = e("./sync")).hso, H = r.sof, J = (r = e("./difap.js")).flop, K = r.plop, R = r.glop, q = r.rss, W = r.loh, U = r.roh, Z = r.udoc, Y = e("./dltap.js"), X = e("./ext/ime.js"), G = e("./ext/uim.js"), ee = e("./ext/pvp.js"), ae = e("./soh.js"), de = e("../../../codox-shared/src/com/lib"), ue = e("../../../codox-shared/src/dtf/dtf.js"), ne = de.isop, Se = de.ipop, ve = de.idlt, ge = de.idif, Te = de.dct, ce = de.gran, re = de.csmais, fe = de.dcdcm, le = e("../../../codox-shared/src/gt/xf"), ke = (r = e("../../../codox-rt-type/src/")).sdf, Oe = r.rtf, Ce = e("../../../codox-json-ot/lib/"), Me = (e("./sapa.js"), e("./spot.js"), r = e("./access")).accessToRole, nt = r.roles;
-    e("../errors").VersionError, s.exports = function(Be, De, xe) {
-      var Je = l.now(), je = (this.START_TIME = Je, this.endpoint = Be.endpoint, this.tm = xe, ke.gop), Fe = Oe.iwop, He = Oe.cko, Ze = ue.d2c, Qe = i, Bt = (this.setSMV = function(Ve) {
+    e("../errors").VersionError, s.exports = function(Fe, De, xe) {
+      var Je = l.now(), je = (this.START_TIME = Je, this.endpoint = Fe.endpoint, this.tm = xe, ke.gop), Be = Oe.iwop, He = Oe.cko, Ze = ue.d2c, Qe = i, Bt = (this.setSMV = function(Ve) {
         Qe = Ve;
       }, u), Ye = (this.cver = Bt, null), Ht = (this.setSID = function(Ve) {
         Ye = Ve;
-      }, 1), zt = d, en = Be.codoxLogger, an = Be.startCb, yt = Be.sockOpenTimer, Ot = Be.editorInstance, un = v.reportError.bind(v), Lt = v.addBreadcrumb.bind(v), sn = v.addTag.bind(v), Ae = (this.breadCrumb = Lt, this.editorInstance = Ot, Lt("[codoxi]* ccw: t = 0; CV=" + Bt + "; seid = " + Be.sid, b), sn("clientVersion", Bt), Be.ver), We = this, he = (this.app = Be).appType, Ie = Be.sid, it = Be.domains, st = Be.cid, xt = (it.b(), it.c()), kt = (xt.sw && xt.sw(this), Be.sysInfo), Ue = Be.anyClient, Xe = Be.founder, ut = nt.Write, $t = (Be.role && (ut = Be.role), an), qt = { sid: Ye, jointime: /* @__PURE__ */ new Date(), userinfo: Object.assign({}, Be.user), role: ut, founder: Xe }, on = (this.minfo = qt, null), Zt = null, Pe = null, ze = (p || (this.rangy || (this.rangy = e("rangy/lib/rangy-selectionsaverestore")), this.rangy.initialized) || this.rangy.init(), this.rangy = e("rangy/lib/rangy-selectionsaverestore"), this.rangy.init(), 0), dt = null, _e = null, $e = [], rt = null, et = l.now(), gt = 0, ft = _, we = ee.pmod(), Ke = !1, ht = null, Pt = !1, Mt = (this.setSMC = function(Ve) {
+      }, 1), zt = d, en = Fe.codoxLogger, an = Fe.startCb, yt = Fe.sockOpenTimer, Ot = Fe.editorInstance, un = v.reportError.bind(v), Lt = v.addBreadcrumb.bind(v), sn = v.addTag.bind(v), Ae = (this.breadCrumb = Lt, this.editorInstance = Ot, Lt("[codoxi]* ccw: t = 0; CV=" + Bt + "; seid = " + Fe.sid, b), sn("clientVersion", Bt), Fe.ver), We = this, he = (this.app = Fe).appType, Ie = Fe.sid, it = Fe.domains, st = Fe.cid, xt = (it.b(), it.c()), kt = (xt.sw && xt.sw(this), Fe.sysInfo), Ue = Fe.anyClient, Xe = Fe.founder, ut = nt.Write, $t = (Fe.role && (ut = Fe.role), an), qt = { sid: Ye, jointime: /* @__PURE__ */ new Date(), userinfo: Object.assign({}, Fe.user), role: ut, founder: Xe }, on = (this.minfo = qt, null), Zt = null, Pe = null, ze = (p || (this.rangy || (this.rangy = e("rangy/lib/rangy-selectionsaverestore")), this.rangy.initialized) || this.rangy.init(), this.rangy = e("rangy/lib/rangy-selectionsaverestore"), this.rangy.init(), 0), dt = null, _e = null, $e = [], rt = null, et = l.now(), gt = 0, ft = _, we = ee.pmod(), Ke = !1, ht = null, Pt = !1, Mt = (this.setSMC = function(Ve) {
         Pt = Ve;
       }, null), Qt = null, Jt = null, Xt = null, nn = null, zn = null, Sn = null, Cn = null, Vn = null, pr = null, uo = !0, Or = !0, Ar = !0, zo = !0, hr = !0, vr = !0, Rr = !0, yi = !0, io = null, mo = null, Yo = null, ao = null, ii = null, La = null, yo = null, cr = null, Ii = null, Fn = null, Bn = null, Zo = null, $o = null, bi = null, Vi = null, Ki = null, da = null;
       function No(Ve) {
@@ -47060,7 +47084,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
       }
       function fa(Ve, vt) {
         if (Ve || console.error("Stop called without providing a stopCode"), ft != x)
-          if (bt = /* @__PURE__ */ new Date(), Tn = null, Cr && (Tn = Bn.mbs.length), On = null, On = { state: ft, connected: Pt, subr: Gr, subs: Cr, JnC: On = Fn ? 1 : On, joined: Ke, members: Tn, reason: null, error: null, wid: Be.waveId, app: he, ts: bt }, Tn = {}, On.reason = Ve || 500, Ve == 800) {
+          if (bt = /* @__PURE__ */ new Date(), Tn = null, Cr && (Tn = Bn.mbs.length), On = null, On = { state: ft, connected: Pt, subr: Gr, subs: Cr, JnC: On = Fn ? 1 : On, joined: Ke, members: Tn, reason: null, error: null, wid: Fe.waveId, app: he, ts: bt }, Tn = {}, On.reason = Ve || 500, Ve == 800) {
             Tn.reason = On.reason = 800;
             var bt = On, Vt = 13;
             if (De)
@@ -47080,7 +47104,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
       }
       function al(Ve, vt) {
         var bt;
-        ft != E && (ft = E, 0 < $e.length && (h($e), $e = []), De && (De.onclose = null, De.onmessage = null, De.onerror = null, De.onopen = null), g(rt), g(_e), g(null), g(yt), gr.clean(), bt = (l.now() - Je) / 1e3, Ke ? (Lt("[codoxi]* cdxclose: t = " + bt + "; r=" + vt + "; hbc = " + _t + "; sid = " + mo && Ye, b), Be.api.a(Ve, vt)) : ((0, a.default)(vt) !== "object" ? Lt("[codoxi]* cdxcb(n): t = " + bt + "; r=" + vt, b) : vt.message, $t(null, vt)), Be.domains = null, qt = xt = it = mo = $t = We = null, Fn && Fn.clean(), Fn = null);
+        ft != E && (ft = E, 0 < $e.length && (h($e), $e = []), De && (De.onclose = null, De.onmessage = null, De.onerror = null, De.onopen = null), g(rt), g(_e), g(null), g(yt), gr.clean(), bt = (l.now() - Je) / 1e3, Ke ? (Lt("[codoxi]* cdxclose: t = " + bt + "; r=" + vt + "; hbc = " + _t + "; sid = " + mo && Ye, b), Fe.api.a(Ve, vt)) : ((0, a.default)(vt) !== "object" ? Lt("[codoxi]* cdxcb(n): t = " + bt + "; r=" + vt, b) : vt.message, $t(null, vt)), Fe.domains = null, qt = xt = it = mo = $t = We = null, Fn && Fn.clean(), Fn = null);
       }
       function Kl() {
         return ut === nt.Read;
@@ -47167,7 +47191,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         z(Ve, vt, bt, en, We);
       }
       function Rt(Ve) {
-        xe || (Ve !== 14 && Ve != 16 || Be.a.b(st, Bn.mbs), (Ve = Ve === Ht ? ft === _ ? 20 : 21 : Ve) !== 501 && Be.a.e(st, Ve));
+        xe || (Ve !== 14 && Ve != 16 || Fe.a.b(st, Bn.mbs), (Ve = Ve === Ht ? ft === _ ? 20 : 21 : Ve) !== 501 && Fe.a.e(st, Ve));
       }
       var _t = 0, Yt = null;
       function Mn(Ve, vt) {
@@ -47220,7 +47244,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
             for (var Ve = arguments.length, vt = new Array(Ve), bt = 0; bt < Ve; bt++)
               vt[bt] = arguments[bt];
             var Vt, Tn, On = vt[0], vn = vt[1], pn = vt[2];
-            if (Vt = On, vn === "e" && No() && (ge(We) ? (Tn = (pn = it.d(pn)).d(), pn.gj() !== Tn && Be.a.i({ source: "l" })) : Vt.delta ? Be.a.i({ source: "l", delta: Vt.delta }) : Be.a.i({ source: "l", delta: Vt })), (function() {
+            if (Vt = On, vn === "e" && No() && (ge(We) ? (Tn = (pn = it.d(pn)).d(), pn.gj() !== Tn && Fe.a.i({ source: "l" })) : Vt.delta ? Fe.a.i({ source: "l", delta: Vt.delta }) : Fe.a.i({ source: "l", delta: Vt })), (function() {
               return !Kl() || (Lt("[codoxi]- rv1; sid = " + Ye, b), wu.apply(void 0, arguments), !1);
             }).apply(void 0, vt) && ft !== _ && ft !== E)
               return vn === "pt" ? Da("pt") ? void 0 : function(ar, _r) {
@@ -47236,7 +47260,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           var vn, pn;
           $e.length != 0 && (pn = l.now() - dt, we && !Ne() && ft === w && pn < 250 && On < 2e3 ? (g(_e), _e = setTimeout(function() {
             Tn(On + 250), _e = null;
-          }, 250)) : (pn = $e.shift(), uo && (hr = !hr), hr || ft === _ || !pn.context || pn.context.sid === Ye || We.bium() || Q("ROH"), pn.so ? I(pn, We) : H(pn) || (pn.hasOwnProperty("to") && mo && (mo.rto = pn.to, pn.context) && (pn.context.to = pn.to), pn.cmd ? Zo(pn) : (vn = {}, !_i || pn.t && pn.t === "sl" ? vn.op = pn.op : (vn.op = pn.op[0].po, vn.ao = pn.op[0].ao), vn.context = pn.context, pn.t && (vn.t = pn.t), hr || (Se(pn = vn) ? Be.a.j(st, { coords: pn.op, sid: pn.context.sid }) : (pn = Yo(pn)) != null && pn.op.length !== 0 && (ne(pn) ? Qn(pn) : !ye() && !me() || hr ? (pn.context.CAID = !1, vn = le.ccp, Bn.DCPRops = vn(Bn.DCPRops, pn.op, We, "ROHdmod"), Bn.DCPRopsN++, Bn.DCPRopsN, h(Bn.DCPRops)) : (ve(We) ? Y.roh(pn, We) : U(pn, We), !We.bium() && pn.context.CAID && (h(pn), Ge(tt(), pn.context.caidinfo)))))), l.now()), 0 < $e.length && Tn(1500)));
+          }, 250)) : (pn = $e.shift(), uo && (hr = !hr), hr || ft === _ || !pn.context || pn.context.sid === Ye || We.bium() || Q("ROH"), pn.so ? I(pn, We) : H(pn) || (pn.hasOwnProperty("to") && mo && (mo.rto = pn.to, pn.context) && (pn.context.to = pn.to), pn.cmd ? Zo(pn) : (vn = {}, !_i || pn.t && pn.t === "sl" ? vn.op = pn.op : (vn.op = pn.op[0].po, vn.ao = pn.op[0].ao), vn.context = pn.context, pn.t && (vn.t = pn.t), hr || (Se(pn = vn) ? Fe.a.j(st, { coords: pn.op, sid: pn.context.sid }) : (pn = Yo(pn)) != null && pn.op.length !== 0 && (ne(pn) ? Qn(pn) : !ye() && !me() || hr ? (pn.context.CAID = !1, vn = le.ccp, Bn.DCPRops = vn(Bn.DCPRops, pn.op, We, "ROHdmod"), Bn.DCPRopsN++, Bn.DCPRopsN, h(Bn.DCPRops)) : (ve(We) ? Y.roh(pn, We) : U(pn, We), !We.bium() && pn.context.CAID && (h(pn), Ge(tt(), pn.context.caidinfo)))))), l.now()), 0 < $e.length && Tn(1500)));
         }(0), l.now());
       }, this.gls = function() {
         var Ve;
@@ -47288,11 +47312,11 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
       }, this.sj = function(Ve) {
         Ke = Ve;
       }, this.ece = function() {
-        Be.a.g(st);
+        Fe.a.g(st);
         var Ve = (l.now() - Je) / 1e3;
         Lt("[codoxi]* eco: t = " + Ve + "; s=" + ft + "; ss=" + Bn.mbs.length + "; sid = " + Ye, b);
       }, this.dce = function() {
-        g(rt), Y.rss("nce"), q("nce"), ee.rss("nce"), Cr && Be.a.f(st);
+        g(rt), Y.rss("nce"), q("nce"), ee.rss("nce"), Cr && Fe.a.f(st);
         var Ve = (l.now() - Je) / 1e3;
         Lt("[codoxi]* dco: t = " + Ve + "; s=" + ft + "; ss=" + Bn.mbs.length + "; sid = " + Ye, b);
       }, this.pm = me, this.spm = ye, this.gcaid = tt, this.ccaid = Ge, this.raid = function(Ve) {
@@ -47306,10 +47330,10 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         return et;
       }, this.nu = Rt, this.nsi = function(Ve, vt) {
         if (!xe) {
-          Be.a.b(st, Bn.mbs);
+          Fe.a.b(st, Bn.mbs);
           for (var bt = [], Vt = 0; Vt < vt.length; Vt++)
             vt[Vt].sid !== Ye && bt.push(vt[Vt]);
-          0 < bt.length && Be.a.e(st, Ve, bt);
+          0 < bt.length && Fe.a.e(st, Ve, bt);
         }
       }, this.nsm = At, this.ihb = function() {
         return ++_t;
@@ -47336,7 +47360,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         }, 250), ze = 0);
       }, this.setRole = function(Ve) {
         var vt = Ve.access, bt = Ve.token;
-        Ve = Ve.encodedToken, ut = Me(vt), Be.api.updateAccess(st, { token: bt, encodedToken: Ve }), xt.setPermission && xt.setPermission(vt);
+        Ve = Ve.encodedToken, ut = Me(vt), Fe.api.updateAccess(st, { token: bt, encodedToken: Ve }), xt.setPermission && xt.setPermission(vt);
       }, this.gr = function() {
         return ut;
       }, this.udc = xt.updateContents, this.rsce = function(Ve) {
@@ -47383,7 +47407,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         var vt = it.d(Ve.context.dmid);
         if (vt) {
           var bt = vt.gj();
-          if (Fe(Ve) === "d") {
+          if (Be(Ve) === "d") {
             var Vt = Ii(Ve), Tn = (0, a.default)(Ve.op[0]) === Mt[2] ? Ve.op[0] : 0;
             if ((Vt = bt.indexOf(Vt, Tn)) !== Tn)
               return !1;
@@ -47430,9 +47454,9 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         0 < vt.length && xt.updateContents(vt), Vi(Ve);
       }, this.sjsloh = function(Ve, vt, bt) {
         var Vt;
-        vt === "e" ? (Be.a.i({ source: "l" }), ai.push(Ve), Ve.data.n < Ve.data.tn || (Vt = { op: [], ao: ai, inverse: [] }, ai = [], null(Vt) && Y.plop(Vt, "loh", We))) : vt === "c" ? Ve.type === "set_selection" && (Ve = { start: (Vt = xt.c()).anchor.offset, end: Vt.focus.offset, path: Vt.anchor.path, startpath: Vt.anchor.path, endpath: Vt.focus.path }, Vt = Ve, ft === w) && Vt.start !== null && Vt.end !== null && Vt.path !== null && (Q("SJScmv"), mo.dmid = xt.dmid, ao(Vt = { t: "sl", op: Vt }), te(Vt, tt())) : vt == "u" && cr();
+        vt === "e" ? (Fe.a.i({ source: "l" }), ai.push(Ve), Ve.data.n < Ve.data.tn || (Vt = { op: [], ao: ai, inverse: [] }, ai = [], null(Vt) && Y.plop(Vt, "loh", We))) : vt === "c" ? Ve.type === "set_selection" && (Ve = { start: (Vt = xt.c()).anchor.offset, end: Vt.focus.offset, path: Vt.anchor.path, startpath: Vt.anchor.path, endpath: Vt.focus.path }, Vt = Ve, ft === w) && Vt.start !== null && Vt.end !== null && Vt.path !== null && (Q("SJScmv"), mo.dmid = xt.dmid, ao(Vt = { t: "sl", op: Vt }), te(Vt, tt())) : vt == "u" && cr();
       }, this.subm = function() {
-        var Ve = Be.waveId, vt = Be.user, bt = ((Ve = { a: S, c: he, cx: Ot ? Ot.type : null, v: Bt, u: { memberinfo: qt, waveid: Ve, username: vt && vt.name, sysinfo: kt, f: Xe, resetter: !1, any: Ue, subid: Be.subId, mid: Be.mid, paid: Be.prevAid || "First", v: { token: Be.token }, u: Be.url, d: Be.docId, tabId: m(), jsConf: Be.jsonConfig, isBFM: !1 } }).u.jsConf, ft == x && (vt = L(), Ve.rjn = { offCaid: vt.offCaid, offTo: vt.offTo, sts: vt.sessiontimestamp }, Ve.rjn), Ve.gcs = (vt = null, he == "quilljs" ? (bt = xt.getContents(), f(bt), vt = Ze(bt.ops, ["delete", "insert", "retain", "attributes"]), f(vt)) : he == "codemirror" ? (bt = xt.getContents(), h(bt), h(vt = [{ cr: bt }])) : he == "json" && (xi || Uo) ? (vt = xt.d(), h(vt)) : (it.a(), vt = it.e()), vt), re(Ve), Ve.gcs.length);
+        var Ve = Fe.waveId, vt = Fe.user, bt = ((Ve = { a: S, c: he, cx: Ot ? Ot.type : null, v: Bt, u: { memberinfo: qt, waveid: Ve, username: vt && vt.name, sysinfo: kt, f: Xe, resetter: !1, any: Ue, subid: Fe.subId, mid: Fe.mid, paid: Fe.prevAid || "First", v: { token: Fe.token }, u: Fe.url, d: Fe.docId, tabId: m(), jsConf: Fe.jsonConfig, isBFM: !1 } }).u.jsConf, ft == x && (vt = L(), Ve.rjn = { offCaid: vt.offCaid, offTo: vt.offTo, sts: vt.sessiontimestamp }, Ve.rjn), Ve.gcs = (vt = null, he == "quilljs" ? (bt = xt.getContents(), f(bt), vt = Ze(bt.ops, ["delete", "insert", "retain", "attributes"]), f(vt)) : he == "codemirror" ? (bt = xt.getContents(), h(bt), h(vt = [{ cr: bt }])) : he == "json" && (xi || Uo) ? (vt = xt.d(), h(vt)) : (it.a(), vt = it.e()), vt), re(Ve), Ve.gcs.length);
         5e7 <= bt ? (console.error("codox_sendSubscribe2SM: oversize init GCS = " + bt), Lt("[codoxe]-- osgcs: r=10; len=" + bt + "; sid = " + Ye), fa(10)) : (Ve.cmm = ce(36), on = Ve.cmm, h(Ve), bo(Ve));
       }, this.subr = function(Ve) {
         Gr = !0;
@@ -47493,7 +47517,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
                       bt = { obf: zo, ob: zn, cb: Sn, tiny: $, tinysc: pr }, Vt = { obf: Rr, types: Mt }, ke.sdfi(bt), Oe.rtfi(Vt), We.rtf = Oe, We.sdf = ke;
                   else
                     Tn = { types: Mt, dt: Jt, obf: !1 }, ue.di(Tn), We.dtf = ue;
-                hr || (bi = new O({ cw: We, app: Be, cmd: xt, type: Mt, obfroh: hr, obfcr: Ar }), Vi = bi.urcs, Ki = bi.uc, da = bi.nuc, We.rcs = bi), bt = he == "quilljs" || he == "quilljs_clickup" ? xt.getContents() : xt.d(), Fn = new F({ cw: We, cb: $t, app: Be, cd: it, cmd: xt, mi: qt, lidoc: bt, log: en, tm: xe, obf: Or, bv: Ae }), $o = Fn.rs, Bn = Fn.se, We.se = Bn, Zo = Fn.pc, We.dsm = Fn, xi || Uo || it.a(), Ri[0] = $ ? { pos: 48 } : { pos: -1 };
+                hr || (bi = new O({ cw: We, app: Fe, cmd: xt, type: Mt, obfroh: hr, obfcr: Ar }), Vi = bi.urcs, Ki = bi.uc, da = bi.nuc, We.rcs = bi), bt = he == "quilljs" || he == "quilljs_clickup" ? xt.getContents() : xt.d(), Fn = new F({ cw: We, cb: $t, app: Fe, cd: it, cmd: xt, mi: qt, lidoc: bt, log: en, tm: xe, obf: Or, bv: Ae }), $o = Fn.rs, Bn = Fn.se, We.se = Bn, Zo = Fn.pc, We.dsm = Fn, xi || Uo || it.a(), Ri[0] = $ ? { pos: 48 } : { pos: -1 };
                 for (var On = 1; On < 5; On++)
                   Ri[On] = { pos: -1 };
                 if (Xe) {
@@ -47745,7 +47769,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
   }, { "../../../codox-shared/src/com/log": 220, "../../../codox-shared/src/com/util": 221 }], 565: [function(e, s, o) {
     var r, a = (r = e("../logger.js")).logger, l = r.SENTRY_LEVEL_H, i = e("../domains/api/qjs-util").contentToDelta, u = Date, d = e("../errors").CBError, p = (r = e("../../../codox-shared/src/com/log")).ins, f = ((r = e("../../../codox-shared/src/com/util")).clone, r.logClone), h = (r = e("../../../codox-shared/src/com/constants")).CMD_QUIT, m = r.CMD_SMM, g = r.CMD_HB, v = r.CMD_SMAGS, b = r.CMD_HBP, _ = r.CMD_SMAIS, w = r.CMD_SMNCM, E = r.CMD_RC, x = r.CMD_SMDLT, y = r.CMD_SMRJN, S = (r = e("../../../codox-shared/src/com/constants")).JOINED_LOG, C = r.ONLINE, O = r.OFFLINE, F = e("./rjm").rjm, B = (r = e("./off")).gos, M = r.srjn, L = (r = e("./opm")).dltmg, P = r.difmg, T = e("../../../codox-shared/src/com/lib"), N = e("../../../codox-shared/src/dtf/dtf.js"), D = e("../../../codox-rt-type/src/").sdf;
     s.exports = function(A) {
-      var z = A.cw, I = A.cb, H = A.cmd, J = A.cd, K = A.mi, R = A.app, q = A.tm, W = A.obf, U = A.lidoc, Z = z.pt.gct(), Y = a.addBreadcrumb.bind(a), X = (a.reportError.bind(a), A = (u.now() - z.START_TIME) / 1e3, Y("[codoxi]* dsm: t = " + A + "; sid = " + Z.sid, l), z.TZ), G = z.gs, ee = z.ss, ae = z.ece, de = z.dce, ue = z.lohl, ne = z.gcaid, Se = z.ccaid, ve = z.grtt, ge = z.nsm, Te = z.nu, ce = z.nsi, re = (z.ssm, z.dssm), fe = (z.pt.rstm, z.pt.gcotm), le = z.pt.aptm, ke = z.pt.rptm, Oe = z.pt.gstm, Ce = z.pt.gtm, Me = z.pt.stm, nt = z.pt.uct, Be = z.rcs.urcs, De = z.rcs.uc, xe = z.rcs.nuc, Je = z.rcs.grcs, je = z.rcs.srcs, Fe = z.rcs.arcs, He = z.rcs.rrcs, Ze = (this.clean = function() {
+      var z = A.cw, I = A.cb, H = A.cmd, J = A.cd, K = A.mi, R = A.app, q = A.tm, W = A.obf, U = A.lidoc, Z = z.pt.gct(), Y = a.addBreadcrumb.bind(a), X = (a.reportError.bind(a), A = (u.now() - z.START_TIME) / 1e3, Y("[codoxi]* dsm: t = " + A + "; sid = " + Z.sid, l), z.TZ), G = z.gs, ee = z.ss, ae = z.ece, de = z.dce, ue = z.lohl, ne = z.gcaid, Se = z.ccaid, ve = z.grtt, ge = z.nsm, Te = z.nu, ce = z.nsi, re = (z.ssm, z.dssm), fe = (z.pt.rstm, z.pt.gcotm), le = z.pt.aptm, ke = z.pt.rptm, Oe = z.pt.gstm, Ce = z.pt.gtm, Me = z.pt.stm, nt = z.pt.uct, Fe = z.rcs.urcs, De = z.rcs.uc, xe = z.rcs.nuc, Je = z.rcs.grcs, je = z.rcs.srcs, Be = z.rcs.arcs, He = z.rcs.rrcs, Ze = (this.clean = function() {
         K = H = J = Z = I = z = null;
       }, { mbs: [], DCPLopsN: 0, DCPRopsN: 0, DCPLops: [], DCPRops: [], sts: null, ISTo: null }), Qe = null;
       function Bt(yt) {
@@ -47839,7 +47863,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
                         return qt.context.caidinfo, qt.context.rto;
                       Se(Zt, qt.context.caidinfo), Zt = z.gdft();
                       var Pe = z.glx();
-                      (Zt || Pe) && qt.context.ks !== void 0 && qt.context.js !== void 0 && qt.context.startBlkPos !== void 0 && qt.context.endBlkPos !== void 0 ? ((Zt = { t: "sl" }).op = { start: qt.context.ks, end: qt.context.js, startBlkPos: qt.context.startBlkPos, endBlkPos: qt.context.endBlkPos }, Zt.context = qt.context, (0, z.exsl)(Zt)) : Be(qt);
+                      (Zt || Pe) && qt.context.ks !== void 0 && qt.context.js !== void 0 && qt.context.startBlkPos !== void 0 && qt.context.endBlkPos !== void 0 ? ((Zt = { t: "sl" }).op = { start: qt.context.ks, end: qt.context.js, startBlkPos: qt.context.startBlkPos, endBlkPos: qt.context.endBlkPos }, Zt.context = qt.context, (0, z.exsl)(Zt)) : Fe(qt);
                     } else
                       qt.context.sid, on.tp.length;
                 }
@@ -47855,13 +47879,13 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
               Qe = $t;
               break;
             case w:
-              st = $t, kt = G(), Qe ? (Z.sid, f(st), sn = Qe, Z.sid, f(sn), Fe(sn.cmd.gcs.mbs), Me(sn.cmd.gcs.tm), le([K]), nt(sn.cmd.gcs.ct), Ze.sts = sn.cmd.gcs.sts, Ze.ISTo = sn.cmd.gcs.to, We = G(), he = T.idlt, Ie = sn.cmd.gcs.clog, it = null, he(z) ? (it = { ops: N.c2d(Ie) }, it = i(it), We !== O && (he = it, Ae = H.getContents(), z.gcm() && (Ae = { ops: [{ insert: Ae }] }, U = i(U = { ops: [{ insert: U }] }), Ae = i(Ae)), (Ae = U.diff(Ae)).ops.length == 0 ? J.h2(he) : (he = U.diff(he), f(he), Ae = N.d2c(Ae.ops), he = N.d2c(he.ops), L(Ae, he, z)))) : (it = Ie, z.gfln() || z.gjs() || (it = Ie[0]), We !== O && (Ae = it, he = H.d(), z.glx(), f(U), f(he), 0 < (Ie = Ht(U, he)).length && H.sj(he), Ie.length == 0 ? J.h2(Ae) : (he = Ht(U, Ae), (z.gdft() || z.glx()) && (Ie = (Ae = H.toInO)(Ie), he = Ae(he)), P(Ie, he, z)))), We == O && J.h2(it), Ze.mbs = [], an([K]), an(sn.cmd.gcs.mbs), ee(C), z.sj(!0), Te(16), Ie = 1, sn.ncmn && (Ie = sn.ncmn), ge(S, Ie), he = Ze.mbs.length + Ie, We !== O && (it = G(), sn = (u.now() - z.START_TIME) / 1e3, !q) && I && (Y("[codoxi]* cdxcb(y): t = " + sn + "; s=" + it + "; ss=" + he + "; sid = " + Z.sid), I(Z.sid)), Z.sid, Qe = null) : (Z.sid, f(st)), W || (Fe(st.cmd.newcms), an(st.cmd.newcms), le(st.cmd.newcms), en(Z.sid, st.cmd.newcms) || Bt(st.cmd.newcms), zt = st.to, ae(), ce(18, Ze.mbs), z.gfln() ? (Ie = Je(), xe("smncm-f2", Ie)) : z.gjs() || De("smncm"), ue("smncm")), kt == O && M(!1, "off-NCM");
+              st = $t, kt = G(), Qe ? (Z.sid, f(st), sn = Qe, Z.sid, f(sn), Be(sn.cmd.gcs.mbs), Me(sn.cmd.gcs.tm), le([K]), nt(sn.cmd.gcs.ct), Ze.sts = sn.cmd.gcs.sts, Ze.ISTo = sn.cmd.gcs.to, We = G(), he = T.idlt, Ie = sn.cmd.gcs.clog, it = null, he(z) ? (it = { ops: N.c2d(Ie) }, it = i(it), We !== O && (he = it, Ae = H.getContents(), z.gcm() && (Ae = { ops: [{ insert: Ae }] }, U = i(U = { ops: [{ insert: U }] }), Ae = i(Ae)), (Ae = U.diff(Ae)).ops.length == 0 ? J.h2(he) : (he = U.diff(he), f(he), Ae = N.d2c(Ae.ops), he = N.d2c(he.ops), L(Ae, he, z)))) : (it = Ie, z.gfln() || z.gjs() || (it = Ie[0]), We !== O && (Ae = it, he = H.d(), z.glx(), f(U), f(he), 0 < (Ie = Ht(U, he)).length && H.sj(he), Ie.length == 0 ? J.h2(Ae) : (he = Ht(U, Ae), (z.gdft() || z.glx()) && (Ie = (Ae = H.toInO)(Ie), he = Ae(he)), P(Ie, he, z)))), We == O && J.h2(it), Ze.mbs = [], an([K]), an(sn.cmd.gcs.mbs), ee(C), z.sj(!0), Te(16), Ie = 1, sn.ncmn && (Ie = sn.ncmn), ge(S, Ie), he = Ze.mbs.length + Ie, We !== O && (it = G(), sn = (u.now() - z.START_TIME) / 1e3, !q) && I && (Y("[codoxi]* cdxcb(y): t = " + sn + "; s=" + it + "; ss=" + he + "; sid = " + Z.sid), I(Z.sid)), Z.sid, Qe = null) : (Z.sid, f(st)), W || (Be(st.cmd.newcms), an(st.cmd.newcms), le(st.cmd.newcms), en(Z.sid, st.cmd.newcms) || Bt(st.cmd.newcms), zt = st.to, ae(), ce(18, Ze.mbs), z.gfln() ? (Ie = Je(), xe("smncm-f2", Ie)) : z.gjs() || De("smncm"), ue("smncm")), kt == O && M(!1, "off-NCM");
               break;
             case x:
               Ye = $t;
               break;
             case y:
-              We = $t, Ye ? (Z.sid, f(We), Lt = Ye, Z.sid, f(Lt), Fe(Lt.cmd.dlt.mbs), f(Lt.cmd.dlt.tm), Me(Lt.cmd.dlt.tm), le([K]), f(Ce()), f(Lt.cmd.dlt.ct), f(Z), nt(Lt.cmd.dlt.ct), f(Z), z.gjs() && z.mdom.goffop(), ee(C), sn = Lt.cmd.dlt.offstate, it = B(), F(sn, it, z), Ze.ISTo = sn.offTo, Ze.ISTo, Ze.mbs = [], an([K]), f(Lt.cmd.dlt.mbs), an(Lt.cmd.dlt.mbs), z.sj(!0), Te(16), ge(S, 1), it = Ze.mbs.length + 1, sn = G(), Lt = (u.now() - z.START_TIME) / 1e3, q || Y("[codoxi]* cdxoffrjn(y): t = " + Lt + "; s=" + sn + "; ss=" + it + "; sid = " + Z.sid), Z.sid, Ye = null) : (Z.sid, f(We)), W || (Fe(We.cmd.offcm), f(Je()), an(We.cmd.offcm), Ze.mbs, le(We.cmd.offcm), en(Z.sid, We.cmd.offcm) || Bt(We.cmd.offcm), ae(), ce(18, Ze.mbs), z.gfln() ? (Lt = Je(), xe("smrjn-f2", Lt)) : De("smrjn"), ue("smrjn"), M(!1, "off-RJN"));
+              We = $t, Ye ? (Z.sid, f(We), Lt = Ye, Z.sid, f(Lt), Be(Lt.cmd.dlt.mbs), f(Lt.cmd.dlt.tm), Me(Lt.cmd.dlt.tm), le([K]), f(Ce()), f(Lt.cmd.dlt.ct), f(Z), nt(Lt.cmd.dlt.ct), f(Z), z.gjs() && z.mdom.goffop(), ee(C), sn = Lt.cmd.dlt.offstate, it = B(), F(sn, it, z), Ze.ISTo = sn.offTo, Ze.ISTo, Ze.mbs = [], an([K]), f(Lt.cmd.dlt.mbs), an(Lt.cmd.dlt.mbs), z.sj(!0), Te(16), ge(S, 1), it = Ze.mbs.length + 1, sn = G(), Lt = (u.now() - z.START_TIME) / 1e3, q || Y("[codoxi]* cdxoffrjn(y): t = " + Lt + "; s=" + sn + "; ss=" + it + "; sid = " + Z.sid), Z.sid, Ye = null) : (Z.sid, f(We)), W || (Be(We.cmd.offcm), f(Je()), an(We.cmd.offcm), Ze.mbs, le(We.cmd.offcm), en(Z.sid, We.cmd.offcm) || Bt(We.cmd.offcm), ae(), ce(18, Ze.mbs), z.gfln() ? (Lt = Je(), xe("smrjn-f2", Lt)) : De("smrjn"), ue("smrjn"), M(!1, "off-RJN"));
               break;
             case E:
               un = (un = (he = $t).cmd).access, "codox_handleRoleChange: current access = ".concat(z.gr(), ", new access = ").concat(un, ", token = "), z.setRole(he.cmd);
@@ -48112,7 +48136,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
             }
           })(O, re)) && nt.length && (Ce = O.f(Z, re), O.r(nt), nt = O.d(), d(nt));
         else {
-          for (var Me = O, nt = re, Be = Me.gj(), De = "", xe = ((Ze) => {
+          for (var Me = O, nt = re, Fe = Me.gj(), De = "", xe = ((Ze) => {
             var Qe, Bt = [];
             for (Qe in Ze) {
               var Ye = {};
@@ -48123,10 +48147,10 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
             });
             return Ht;
           })(nt), Je = 0, je = 0; je < xe.length; je++) {
-            var Fe = xe[je].pos, He = ce(Me.i(), xe[je]);
-            0 < Fe && (De = De + Be.slice(Je, Fe) + He, Je = Fe);
+            var Be = xe[je].pos, He = ce(Me.i(), xe[je]);
+            0 < Be && (De = De + Fe.slice(Je, Be) + He, Je = Be);
           }
-          De += Be.slice(Je), Me.e(De), Ce = O.f(Z, re), O.e(Oe);
+          De += Fe.slice(Je), Me.e(De), Ce = O.f(Z, re), O.e(Oe);
         }
         return ue(O, ke), (I || H) && fe && le !== O.dmid && fe.focus(), Ce;
       }
@@ -48161,8 +48185,8 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
             return _(C) || I ? void 0 : (fe = ae(re.context.dmid), fe = re.context.sid === P.sid ? ((0, a.default)(le[0]) === F[2] && le[0] !== fe && (fe = le[0], le[0]), E(fe, le, "A")) : E(fe, le, "B"), void ee(re.context.dmid, fe));
           var ke, Oe = {};
           for (ke in L) {
-            var Ce, Me, nt, Be, De = L[ke];
-            J || q ? re.context.sid !== ke ? (De.start = m(le, De.start, !0), De.end = m(le, De.end, !0)) : re.op.length !== 0 ? (d(re), le[0].tg ? (De.start = le[0].tg, De.end = le[0].tg) : (De.start = 0, De.end = 0), De.start = m(le, De.start, !1), De.end = m(le, De.end, !1)) : (De.start = re.context.ks, De.end = re.context.js, d(De)) : U ? re.context.sid !== ke ? (Me = { pos: De.start, path: De.startpath }, Ce = { pos: De.end, path: De.endpath }, T(le, Me, !0), T(le, Ce, !0), De.start = Me.pos, De.end = Ce.pos, De.path = Me.path) : (De.start = re.context.ks, De.end = re.context.js, De.path = re.context.pt, De.startpath = re.context.pt1, De.endpath = re.context.pt2) : I ? (Ce = u(De), p(Ce), ke === re.context.sid ? (De.start = re.context.ks, De.end = re.context.js, De.startid = re.context.startid, De.endid = re.context.endid, ne(Ce, De) && (Me = u(De), Oe[ke] = Me, p(Oe))) : (p(De), nt = g(De.startid, De.start), Be = g(De.endid, De.end), p(le), nt = h([nt], le, 0), Be = h([Be], le, 0), nt && 0 < nt.length && Be && 0 < Be.length ? (De.startid = b(nt[0]), De.start = v(nt[0]), De.endid = b(Be[0]), De.end = v(Be[0])) : (De.startid = -1, De.start = -1, De.endid = -1, De.end = -1), p(De), ne(Ce, De) && (nt = u(De), Oe[ke] = nt))) : (ke === re.context.sid ? (De.start = re.context.ks, De.end = re.context.js) : (De.start = E(De.start, le, "B"), De.end = E(De.end, le, "B")), Be = ae(re.context.dmid), Be = re.context.sid === P.sid ? E(Be, le, "A") : E(Be, le, "B"), ee(re.context.dmid, Be));
+            var Ce, Me, nt, Fe, De = L[ke];
+            J || q ? re.context.sid !== ke ? (De.start = m(le, De.start, !0), De.end = m(le, De.end, !0)) : re.op.length !== 0 ? (d(re), le[0].tg ? (De.start = le[0].tg, De.end = le[0].tg) : (De.start = 0, De.end = 0), De.start = m(le, De.start, !1), De.end = m(le, De.end, !1)) : (De.start = re.context.ks, De.end = re.context.js, d(De)) : U ? re.context.sid !== ke ? (Me = { pos: De.start, path: De.startpath }, Ce = { pos: De.end, path: De.endpath }, T(le, Me, !0), T(le, Ce, !0), De.start = Me.pos, De.end = Ce.pos, De.path = Me.path) : (De.start = re.context.ks, De.end = re.context.js, De.path = re.context.pt, De.startpath = re.context.pt1, De.endpath = re.context.pt2) : I ? (Ce = u(De), p(Ce), ke === re.context.sid ? (De.start = re.context.ks, De.end = re.context.js, De.startid = re.context.startid, De.endid = re.context.endid, ne(Ce, De) && (Me = u(De), Oe[ke] = Me, p(Oe))) : (p(De), nt = g(De.startid, De.start), Fe = g(De.endid, De.end), p(le), nt = h([nt], le, 0), Fe = h([Fe], le, 0), nt && 0 < nt.length && Fe && 0 < Fe.length ? (De.startid = b(nt[0]), De.start = v(nt[0]), De.endid = b(Fe[0]), De.end = v(Fe[0])) : (De.startid = -1, De.start = -1, De.endid = -1, De.end = -1), p(De), ne(Ce, De) && (nt = u(De), Oe[ke] = nt))) : (ke === re.context.sid ? (De.start = re.context.ks, De.end = re.context.js) : (De.start = E(De.start, le, "B"), De.end = E(De.end, le, "B")), Fe = ae(re.context.dmid), Fe = re.context.sid === P.sid ? E(Fe, le, "A") : E(Fe, le, "B"), ee(re.context.dmid, Fe));
           }
           re.context.sid !== P.sid ? (d(re), 0 < le.length ? I ? Se("rop", Oe, re.context.sid) : ge("rop", re.context.sid) : I ? Se("rop", Oe) : ge("rop")) : (i(ve), ve = setTimeout(I ? function() {
             Se("timer", Oe), ve = null;
@@ -48803,7 +48827,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
             switch (X.length, fe = K.do[0].type) {
               case "ins":
                 ((De, xe, Je) => {
-                  var je, Fe, He, Ze, Qe = xe.dm, Bt = De.dm, Ye = Bt.length - 1, Ht = De.do[0].ao, zt = xe.do[0].ao, en = xe.do[0].type;
+                  var je, Be, He, Ze, Qe = xe.dm, Bt = De.dm, Ye = Bt.length - 1, Ht = De.do[0].ao, zt = xe.do[0].ao, en = xe.do[0].type;
                   if (Bt[Ye] < Qe[Ye])
                     De.do[0].ao === "mvn" || (Bt[Ye] + 1 == Qe[Ye] && Ht === "sn" && xe.do[0].dmpo && en === "del" && zt === "rn" && xe.tn === 3 ? xe.nil = !0 : h(De) ? Qe[Ye] = Qe[Ye] + 2 : Qe[Ye] = Qe[Ye] + 1);
                   else if (Bt[Ye] === Qe[Ye])
@@ -48821,7 +48845,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
                                 zt != "mvn" && zt == "in" && (Bt.length !== Qe.length && De.do[0].p !== Qe[1 + Ye] ? De.do[0].p > Qe[1 + Ye] || (Qe[Ye] = Qe[Ye] + 1, Qe[1 + Ye] = Qe[1 + Ye] - De.do[0].p + 1) : (yt = De.do[0].target, De.otg && (yt = De.otg), h(xe) && (xe.do[0].pem > yt || xe.do[0].pem === yt && Je) && (Qe[Ye] = Qe[Ye] + 1, Qe[1 + Ye] = 1, xe.do[0].pem = xe.do[0].pem - yt)));
                               break;
                             case "del":
-                              N(xe) ? De.do[0].target === xe.do[0].target && (Qe[Ye] = Qe[Ye] + 1) : zt == "mvn" ? xe.do[0].pxs : zt == "rn" && 1 < xe.tn ? m(xe) ? Bt.length !== Qe.length && De.do[0].p !== Qe[1 + Ye] + 1 ? De.do[0].p > Qe[1 + Ye] + 1 || (Qe[Ye] = Qe[Ye] + 1, Qe[1 + Ye] = Qe[1 + Ye] - De.do[0].p + 1) : xe.two && (an = De.do[0].target, De.otg && (an = De.otg), xe.do[0].pem > an || xe.do[0].pem === an && Je) && (Qe[Ye] = Qe[Ye] + 1, Qe[1 + Ye] = 1, xe.do[0].pem = xe.do[0].pem - an) : (yt = xe, an = De.do[0].target, (Fe = d(yt.dm))[yt.dm.length - 1] = Fe[yt.dm.length - 1] + 1, (He = d(yt.dm))[Fe.length] = 1, (Ze = d(A.mnaotdmpo)).path = Fe, Ze.data.tn = yt.tn, Ze.data.n = yt.aon, (Fe = I(Ze)).do[0].target = an, Fe.pon = yt.pon + 1, (Ze = d(A.mnaotndmpo)).path = He, Ze.position = an, Ze.data.tn = yt.tn, Ze.data.n = yt.aon, (He = I(Ze)).pon = yt.pon + 2, yt.Xp || (yt.Xp = []), yt.Xp.push(Fe), yt.Xp.push(He)) : Qe[Ye] = Qe[Ye] + 1;
+                              N(xe) ? De.do[0].target === xe.do[0].target && (Qe[Ye] = Qe[Ye] + 1) : zt == "mvn" ? xe.do[0].pxs : zt == "rn" && 1 < xe.tn ? m(xe) ? Bt.length !== Qe.length && De.do[0].p !== Qe[1 + Ye] + 1 ? De.do[0].p > Qe[1 + Ye] + 1 || (Qe[Ye] = Qe[Ye] + 1, Qe[1 + Ye] = Qe[1 + Ye] - De.do[0].p + 1) : xe.two && (an = De.do[0].target, De.otg && (an = De.otg), xe.do[0].pem > an || xe.do[0].pem === an && Je) && (Qe[Ye] = Qe[Ye] + 1, Qe[1 + Ye] = 1, xe.do[0].pem = xe.do[0].pem - an) : (yt = xe, an = De.do[0].target, (Be = d(yt.dm))[yt.dm.length - 1] = Be[yt.dm.length - 1] + 1, (He = d(yt.dm))[Be.length] = 1, (Ze = d(A.mnaotdmpo)).path = Be, Ze.data.tn = yt.tn, Ze.data.n = yt.aon, (Be = I(Ze)).do[0].target = an, Be.pon = yt.pon + 1, (Ze = d(A.mnaotndmpo)).path = He, Ze.position = an, Ze.data.tn = yt.tn, Ze.data.n = yt.aon, (He = I(Ze)).pon = yt.pon + 2, yt.Xp || (yt.Xp = []), yt.Xp.push(Be), yt.Xp.push(He)) : Qe[Ye] = Qe[Ye] + 1;
                           }
                           break;
                         case "mvn":
@@ -48949,8 +48973,8 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           } else if (K.do[0].dmpo && K.do[0].type === "ins" && K.do[0].pxs === "x" && R.do[0].dmpo && R.do[0].type === "del" && R.do[0].ao === "mn" && C(Y, X)) {
             var Oe, Ce, Me = R, nt = (re = d(Me.dm), ((Oe = d(re)).unshift(0), Ce = d(A.mvnaot)).path = re, Ce.newPath = Oe, Ce.data.tn = Me.tn, Ce.data.n = Me.aon, H(Ce));
             Me.Xp || (Me.Xp = []);
-            for (var Be = 0; Be < nt.length; Be++)
-              nt[Be].pon = Me.pon + 1 + Be, Me.Xp.push(nt[Be]);
+            for (var Fe = 0; Fe < nt.length; Fe++)
+              nt[Fe].pon = Me.pon + 1 + Fe, Me.Xp.push(nt[Fe]);
             Y.unshift(0);
           } else
             (h(K) && R.do[0].dmpo && !h(R) && X.length === Y.length || h(K) && L(R) && X.length === Y.length) && (Y[Y.length - 1] = Y[Y.length - 1] + 2);
@@ -49383,10 +49407,10 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         if (M = ((ve, ge) => {
           var Te, ce, re, fe, le, ke = ve.length > ge.length ? ve : ge, Oe = ge.length < ve.length ? ge : ve;
           return ke.length < 4 || 2 * Oe.length < ke.length || (le = Ce(ke, Oe, Math.ceil(ke.length / 4)), Oe = Ce(ke, Oe, Math.ceil(ke.length / 2)), !le && !Oe) ? null : (ke = !Oe || le && le[4].length > Oe[4].length ? le : Oe, ve.length > ge.length ? (Te = ke[0], ce = ke[1], re = ke[2], fe = ke[3]) : (re = ke[0], fe = ke[1], Te = ke[2], ce = ke[3]), [Te, ce, re, fe, le = ke[4]]);
-          function Ce(Me, nt, Be) {
-            for (var De, xe, Je, je, Fe = Me.substring(Be, Be + Math.floor(Me.length / 4)), He = -1, Ze = ""; (He = nt.indexOf(Fe, He + 1)) !== -1; ) {
-              var Qe = i(Me.substring(Be), nt.substring(He)), Bt = u(Me.substring(0, Be), nt.substring(0, He));
-              Ze.length < Bt + Qe && (Ze = nt.substring(He - Bt, He) + nt.substring(He, He + Qe), De = Me.substring(0, Be - Bt), xe = Me.substring(Be + Qe), Je = nt.substring(0, He - Bt), je = nt.substring(He + Qe));
+          function Ce(Me, nt, Fe) {
+            for (var De, xe, Je, je, Be = Me.substring(Fe, Fe + Math.floor(Me.length / 4)), He = -1, Ze = ""; (He = nt.indexOf(Be, He + 1)) !== -1; ) {
+              var Qe = i(Me.substring(Fe), nt.substring(He)), Bt = u(Me.substring(0, Fe), nt.substring(0, He));
+              Ze.length < Bt + Qe && (Ze = nt.substring(He - Bt, He) + nt.substring(He, He + Qe), De = Me.substring(0, Fe - Bt), xe = Me.substring(Fe + Qe), Je = nt.substring(0, He - Bt), je = nt.substring(He + Qe));
             }
             return 2 * Ze.length >= Me.length ? [De, xe, Je, je, Ze] : null;
           }
@@ -49532,8 +49556,8 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           }), ut;
         }
         J = Array.prototype;
-        var G = Function.prototype, ee = Object.prototype, ae = H["__core-js_shared__"], de = (ae = /[^.]+$/.exec(ae && ae.keys && ae.keys.IE_PROTO || "")) ? "Symbol(src)_1." + ae : "", ue = G.toString, ne = ee.hasOwnProperty, Se = ee.toString, ve = RegExp("^" + ue.call(ne).replace(/[\\^$.*+?()[\]{}|]/g, "\\$&").replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g, "$1.*?") + "$"), ge = (ae = K ? H.Buffer : void 0, G = H.Symbol, H.Uint8Array), Te = Y(Object.getPrototypeOf, Object), ce = Object.create, re = ee.propertyIsEnumerable, fe = J.splice, le = (K = Object.getOwnPropertySymbols, J = ae ? ae.isBuffer : void 0, Y(Object.keys, Object)), ke = (ae = Ot(H, "DataView"), Ot(H, "Map")), Oe = Ot(H, "Promise"), Ce = Ot(H, "Set"), Me = (H = Ot(H, "WeakMap"), Ot(Object, "create")), nt = Ae(ae), Be = Ae(ke), De = Ae(Oe), xe = Ae(Ce), Je = Ae(H), je = (G = G ? G.prototype : void 0) ? G.valueOf : void 0;
-        function Fe(Ue) {
+        var G = Function.prototype, ee = Object.prototype, ae = H["__core-js_shared__"], de = (ae = /[^.]+$/.exec(ae && ae.keys && ae.keys.IE_PROTO || "")) ? "Symbol(src)_1." + ae : "", ue = G.toString, ne = ee.hasOwnProperty, Se = ee.toString, ve = RegExp("^" + ue.call(ne).replace(/[\\^$.*+?()[\]{}|]/g, "\\$&").replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g, "$1.*?") + "$"), ge = (ae = K ? H.Buffer : void 0, G = H.Symbol, H.Uint8Array), Te = Y(Object.getPrototypeOf, Object), ce = Object.create, re = ee.propertyIsEnumerable, fe = J.splice, le = (K = Object.getOwnPropertySymbols, J = ae ? ae.isBuffer : void 0, Y(Object.keys, Object)), ke = (ae = Ot(H, "DataView"), Ot(H, "Map")), Oe = Ot(H, "Promise"), Ce = Ot(H, "Set"), Me = (H = Ot(H, "WeakMap"), Ot(Object, "create")), nt = Ae(ae), Fe = Ae(ke), De = Ae(Oe), xe = Ae(Ce), Je = Ae(H), je = (G = G ? G.prototype : void 0) ? G.valueOf : void 0;
+        function Be(Ue) {
           var Xe = -1, ut = Ue ? Ue.length : 0;
           for (this.clear(); ++Xe < ut; ) {
             var $t = Ue[Xe];
@@ -49680,17 +49704,17 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
             return xt(ut) && !(de && de in ut) && (st(ut) || U(ut) ? ve : A).test(Ae(ut));
           }(Ue = Ue == null ? void 0 : Ue[Xe]) ? Ue : void 0;
         }
-        Fe.prototype.clear = function() {
+        Be.prototype.clear = function() {
           this.__data__ = Me ? Me(null) : {};
-        }, Fe.prototype.delete = function(Ue) {
+        }, Be.prototype.delete = function(Ue) {
           return this.has(Ue) && delete this.__data__[Ue];
-        }, Fe.prototype.get = function(Ue) {
+        }, Be.prototype.get = function(Ue) {
           var Xe, ut = this.__data__;
           return Me ? (Xe = ut[Ue]) === a ? void 0 : Xe : ne.call(ut, Ue) ? ut[Ue] : void 0;
-        }, Fe.prototype.has = function(Ue) {
+        }, Be.prototype.has = function(Ue) {
           var Xe = this.__data__;
           return Me ? Xe[Ue] !== void 0 : ne.call(Xe, Ue);
-        }, Fe.prototype.set = function(Ue, Xe) {
+        }, Be.prototype.set = function(Ue, Xe) {
           return this.__data__[Ue] = Me && Xe === void 0 ? a : Xe, this;
         }, He.prototype.clear = function() {
           this.__data__ = [];
@@ -49706,7 +49730,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           var ut = this.__data__, $t = Ht(ut, Ue);
           return $t < 0 ? ut.push([Ue, Xe]) : ut[$t][1] = Xe, this;
         }, Ze.prototype.clear = function() {
-          this.__data__ = { hash: new Fe(), map: new (ke || He)(), string: new Fe() };
+          this.__data__ = { hash: new Be(), map: new (ke || He)(), string: new Be() };
         }, Ze.prototype.delete = function(Ue) {
           return yt(this, Ue).delete(Ue);
         }, Ze.prototype.get = function(Ue) {
@@ -49764,7 +49788,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
             switch (Ue) {
               case nt:
                 return S;
-              case Be:
+              case Fe:
                 return h;
               case De:
                 return v;
@@ -49875,7 +49899,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
               return it;
           return -1;
         }
-        function Be(he) {
+        function Fe(he) {
           if (he == null)
             return he === void 0 ? "[object Undefined]" : "[object Null]";
           if (X && X in Object(he)) {
@@ -49890,7 +49914,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           return q.call(he);
         }
         function De(he) {
-          return Lt(he) && Be(he) == i;
+          return Lt(he) && Fe(he) == i;
         }
         function xe(he, Ie, it, st, xt) {
           if (he === Ie)
@@ -49937,8 +49961,8 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           if (!(1 & it) && (Ue = $t && K.call(he, "__wrapped__"), ut = qt && K.call(Ie, "__wrapped__"), Ue || ut))
             return kt($t = Ue ? he.value() : he, qt = ut ? Ie.value() : Ie, it, st, xt = xt || new Ce());
           if (Xe) {
-            var et = he, gt = Ie, ft = it, we = st, Ke = kt, ht = xt = xt || new Ce(), Pt = 1 & ft, Mt = Fe(et), Qt = Mt.length;
-            if (Qt != (Ue = Fe(gt).length) && !Pt)
+            var et = he, gt = Ie, ft = it, we = st, Ke = kt, ht = xt = xt || new Ce(), Pt = 1 & ft, Mt = Be(et), Qt = Mt.length;
+            if (Qt != (Ue = Be(gt).length) && !Pt)
               return !1;
             for (var Jt = Qt; Jt--; ) {
               var Xt = Mt[Jt];
@@ -50000,7 +50024,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           }
           return kt.delete(he), kt.delete(Ie), qt;
         }
-        function Fe(he) {
+        function Be(he) {
           var Ie = We, it = Qe;
           if (Ie = Ie(he), en(he))
             return Ie;
@@ -50090,7 +50114,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           return Ue;
         } : function() {
           return [];
-        }, Bt = Be;
+        }, Bt = Fe;
         function Ye(he) {
           if (he != null) {
             try {
@@ -50108,7 +50132,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           return he === Ie || he != he && Ie != Ie;
         }
         (A && Bt(new A(new ArrayBuffer(1))) != S || de && Bt(new de()) != m || H && Bt(H.resolve()) != b || ue && Bt(new ue()) != w || M && Bt(new M()) != x) && (Bt = function(he) {
-          var Ie = Be(he);
+          var Ie = Fe(he);
           if (he = (he = Ie == v ? he.constructor : void 0) ? Ye(he) : "")
             switch (he) {
               case Se:
@@ -50133,7 +50157,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         };
         function yt(he) {
           if (un(he))
-            return (he = Be(he)) == h || he == "[object GeneratorFunction]" || he == "[object AsyncFunction]" || he == "[object Proxy]";
+            return (he = Fe(he)) == h || he == "[object GeneratorFunction]" || he == "[object AsyncFunction]" || he == "[object Proxy]";
         }
         function Ot(he) {
           return typeof he == "number" && -1 < he && he % 1 == 0 && he <= l;
@@ -50148,7 +50172,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         var sn, Ae = B ? (sn = B, function(he) {
           return sn(he);
         }) : function(he) {
-          return Lt(he) && Ot(he.length) && !!F[Be(he)];
+          return Lt(he) && Ot(he.length) && !!F[Fe(he)];
         };
         function We(he) {
           return ((Ie = he) != null && Ot(Ie.length) && !yt(Ie) ? Me : Je)(he);
@@ -51403,26 +51427,26 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           return Je;
         }
         function ve(xe, Je) {
-          for (var je = [], Fe = xe; Fe; Fe = Fe.parentNode)
-            je.push(Fe);
-          for (Fe = Je; Fe; Fe = Fe.parentNode)
-            if (Y(je, Fe))
-              return Fe;
+          for (var je = [], Be = xe; Be; Be = Be.parentNode)
+            je.push(Be);
+          for (Be = Je; Be; Be = Be.parentNode)
+            if (Y(je, Be))
+              return Be;
           return null;
         }
         function ge(xe, Je, je) {
-          for (var Fe = je ? Je : Je.parentNode; Fe; ) {
-            if (Fe === xe)
+          for (var Be = je ? Je : Je.parentNode; Be; ) {
+            if (Be === xe)
               return !0;
-            Fe = Fe.parentNode;
+            Be = Be.parentNode;
           }
           return !1;
         }
         function Te(xe, Je, je) {
-          for (var Fe, He = je ? xe : xe.parentNode; He; ) {
-            if ((Fe = He.parentNode) === Je)
+          for (var Be, He = je ? xe : xe.parentNode; He; ) {
+            if ((Be = He.parentNode) === Je)
               return He;
-            He = Fe;
+            He = Be;
           }
           return null;
         }
@@ -51475,7 +51499,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         function nt(xe) {
           this.root = xe, this._next = xe;
         }
-        function Be(xe, Je) {
+        function Fe(xe, Je) {
           this.node = xe, this.offset = Je;
         }
         function De(xe) {
@@ -51500,7 +51524,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           return this._current;
         }, detach: function() {
           this._current = this._next = this.root = null;
-        } }, Be.prototype = { equals: function(xe) {
+        } }, Fe.prototype = { equals: function(xe) {
           return !!xe && this.node === xe.node && this.offset == xe.offset;
         }, inspect: function() {
           return "[DomPosition(" + Me(this.node) + ":" + this.offset + ")]";
@@ -51528,11 +51552,11 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         }, getClosestAncestorIn: Te, isCharacterDataNode: ce, isTextOrCommentNode: function(xe) {
           return !!xe && ((xe = xe.nodeType) == 3 || xe == 8);
         }, insertAfter: re, splitDataNode: function(xe, Je, je) {
-          var Fe = xe.cloneNode(!1);
-          if (Fe.deleteData(0, Je), xe.deleteData(Je, xe.length - Je), re(Fe, xe), je)
+          var Be = xe.cloneNode(!1);
+          if (Be.deleteData(0, Je), xe.deleteData(Je, xe.length - Je), re(Be, xe), je)
             for (var He, Ze = 0; He = je[Ze++]; )
-              He.node == xe && He.offset > Je ? (He.node = Fe, He.offset -= Je) : He.node == xe.parentNode && He.offset > Se(xe) && ++He.offset;
-          return Fe;
+              He.node == xe && He.offset > Je ? (He.node = Be, He.offset -= Je) : He.node == xe.parentNode && He.offset > Se(xe) && ++He.offset;
+          return Be;
         }, getDocument: fe, getWindow: le, getIframeWindow: function(xe) {
           if (typeof xe.contentWindow != ae)
             return xe.contentWindow;
@@ -51540,22 +51564,22 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
             return xe.contentDocument.defaultView;
           throw Z.createError("getIframeWindow: No Window object found for iframe element");
         }, getIframeDocument: ke, getBody: ue, isWindow: Oe, getContentDocument: function(xe, Je, je) {
-          var Fe;
-          if (xe ? de.isHostProperty(xe, "nodeType") ? Fe = (xe.nodeType == 1 && xe.tagName.toLowerCase() == "iframe" ? ke : fe)(xe) : Oe(xe) && (Fe = xe.document) : Fe = document, Fe)
-            return Fe;
+          var Be;
+          if (xe ? de.isHostProperty(xe, "nodeType") ? Be = (xe.nodeType == 1 && xe.tagName.toLowerCase() == "iframe" ? ke : fe)(xe) : Oe(xe) && (Be = xe.document) : Be = document, Be)
+            return Be;
           throw Je.createError(je + "(): Parameter must be a Window object or DOM node");
         }, getRootContainer: function(xe) {
           for (var Je; Je = xe.parentNode; )
             xe = Je;
           return xe;
-        }, comparePoints: function(xe, Je, je, Fe) {
+        }, comparePoints: function(xe, Je, je, Be) {
           var He, Ze, Qe, Bt;
           if (xe == je)
-            return Je === Fe ? 0 : Je < Fe ? -1 : 1;
+            return Je === Be ? 0 : Je < Be ? -1 : 1;
           if (He = Te(je, xe, !0))
             return Je <= Se(He) ? -1 : 1;
           if (He = Te(xe, je, !0))
-            return Se(He) < Fe ? -1 : 1;
+            return Se(He) < Be ? -1 : 1;
           if (!(Je = ve(xe, je)))
             throw new Error("comparePoints error: nodes have no common ancestor");
           if ((Ze = xe === Je ? Je : Te(xe, Je, !0)) === (Qe = je === Je ? Je : Te(je, Je, !0)))
@@ -51568,8 +51592,8 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
             Bt = Bt.nextSibling;
           }
         }, isBrokenNode: Ce, inspectNode: Me, getComputedStyleProperty: ee, createTestElement: function(xe, Je, je) {
-          var Fe = ue(xe);
-          return (xe = xe.createElement("div")).contentEditable = "" + !!je, Je && (xe.innerHTML = Je), (je = Fe.firstChild) ? Fe.insertBefore(xe, je) : Fe.appendChild(xe), xe;
+          var Be = ue(xe);
+          return (xe = xe.createElement("div")).contentEditable = "" + !!je, Je && (xe.innerHTML = Je), (je = Be.firstChild) ? Be.insertBefore(xe, je) : Be.appendChild(xe), xe;
         }, removeNode: function(xe) {
           return xe.parentNode.removeChild(xe);
         }, fragmentFromNodeChildren: function(xe) {
@@ -51578,7 +51602,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           return je;
         }, createIterator: function(xe) {
           return new nt(xe);
-        }, DomPosition: Be }, U.DOMException = De;
+        }, DomPosition: Fe }, U.DOMException = De;
       }), B.createCoreModule("DomRange", ["DomUtil"], function(U, Z) {
         var Y = U.dom, X = U.util, G = Y.DomPosition, ee = U.DOMException, ae = Y.isCharacterDataNode, de = Y.getNodeIndex, ue = Y.isOrIsAncestorOf, ne = Y.getDocument, Se = Y.comparePoints, ve = Y.splitDataNode, ge = Y.getClosestAncestorIn, Te = Y.getNodeLength, ce = Y.arrayContains, re = Y.getRootContainer, fe = U.features.crashyTextNodes, le = Y.removeNode;
         function ke(Pe, ze) {
@@ -51597,7 +51621,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           var _e = Pe.nodeType == 11 ? Pe.firstChild : Pe;
           return ae(ze) ? dt == ze.length ? Y.insertAfter(Pe, ze) : ze.parentNode.insertBefore(Pe, dt == 0 ? ze : ve(ze, dt)) : dt >= ze.childNodes.length ? ze.appendChild(Pe) : ze.insertBefore(Pe, ze.childNodes[dt]), _e;
         }
-        function Be(Pe, ze, dt) {
+        function Fe(Pe, ze, dt) {
           if (Ie(Pe), Ie(ze), Oe(ze) != Oe(Pe))
             throw new ee("WRONG_DOCUMENT_ERR");
           var _e = Se(Pe.startContainer, Pe.startOffset, ze.endContainer, ze.endOffset);
@@ -51631,10 +51655,10 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         function je(Pe) {
           return "[" + (Pe.getName === void 0 ? "Range" : Pe.getName()) + "(" + Y.inspectNode(Pe.startContainer) + ":" + Pe.startOffset + ", " + Y.inspectNode(Pe.endContainer) + ":" + Pe.endOffset + ")]";
         }
-        function Fe(Pe, ze) {
+        function Be(Pe, ze) {
           this.range = Pe, this.clonePartiallySelectedTextNodes = ze, Pe.collapsed || (this.sc = Pe.startContainer, this.so = Pe.startOffset, this.ec = Pe.endContainer, this.eo = Pe.endOffset, ze = Pe.commonAncestorContainer, this.sc === this.ec && ae(this.sc) ? (this.isSingleCharacterDataNode = !0, this._first = this._last = this._next = this.sc) : (this._first = this._next = this.sc !== ze || ae(this.sc) ? ge(this.sc, ze, !0) : this.sc.childNodes[this.so], this._last = this.ec !== ze || ae(this.ec) ? ge(this.ec, ze, !0) : this.ec.childNodes[this.eo - 1]));
         }
-        Fe.prototype = { _current: null, _next: null, _first: null, _last: null, isSingleCharacterDataNode: !1, reset: function() {
+        Be.prototype = { _current: null, _next: null, _first: null, _last: null, isSingleCharacterDataNode: !1, reset: function() {
           this._current = null, this._next = this._first;
         }, hasNext: function() {
           return !!this._next;
@@ -51648,7 +51672,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           return ke(this._current, this.range);
         }, getSubtreeIterator: function() {
           var Pe, ze, dt, _e, $e, rt;
-          return this.isSingleCharacterDataNode ? (Pe = this.range.cloneRange()).collapse(!1) : (Pe = new Zt(Oe(this.range)), ze = this._current, _e = 0, rt = Te($e = dt = ze), ue(ze, this.sc) && (dt = this.sc, _e = this.so), ue(ze, this.ec) && ($e = this.ec, rt = this.eo), on(Pe, dt, _e, $e, rt)), new Fe(Pe, this.clonePartiallySelectedTextNodes);
+          return this.isSingleCharacterDataNode ? (Pe = this.range.cloneRange()).collapse(!1) : (Pe = new Zt(Oe(this.range)), ze = this._current, _e = 0, rt = Te($e = dt = ze), ue(ze, this.sc) && (dt = this.sc, _e = this.so), ue(ze, this.ec) && ($e = this.ec, rt = this.eo), on(Pe, dt, _e, $e, rt)), new Be(Pe, this.clonePartiallySelectedTextNodes);
         }, detach: function() {
           this.range = this._current = this._next = this._first = this._last = this.sc = this.so = this.ec = this.eo = null;
         } };
@@ -51724,7 +51748,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         function $t(Pe, ze) {
           return function() {
             Ie(this);
-            var dt = this.startContainer, _e = this.startOffset, $e = this.commonAncestorContainer, rt = new Fe(this, !0);
+            var dt = this.startContainer, _e = this.startOffset, $e = this.commonAncestorContainer, rt = new Be(this, !0);
             return dt !== $e && (dt = ($e = Me(ge(dt, $e, !0))).node, _e = $e.offset), De(rt, sn), rt.reset(), $e = Pe(rt), rt.detach(), ze(this, dt, _e, dt, _e), $e;
           };
         }
@@ -51770,7 +51794,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
             et = Me(et), ze(this, gt.node, gt.offset, et.node, et.offset);
           }, extractContents: $t(Je, ze), deleteContents: $t(xe, ze), canSurroundContents: function() {
             Ie(this), sn(this.startContainer), sn(this.endContainer);
-            var et = new Fe(this, !0), gt = et._first && ke(et._first, this) || et._last && ke(et._last, this);
+            var et = new Be(this, !0), gt = et._first && ke(et._first, this) || et._last && ke(et._last, this);
             return et.detach(), !gt;
           }, splitBoundaries: function() {
             xt(this);
@@ -51817,10 +51841,10 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
               et.appendChild($e);
             }
             return et;
-          }(Pe = new Fe(this, !0)), Pe.detach(), ze);
+          }(Pe = new Be(this, !0)), Pe.detach(), ze);
         }, canSurroundContents: function() {
           Ie(this), sn(this.startContainer), sn(this.endContainer);
-          var Pe = new Fe(this, !0), ze = Pe._first && ke(Pe._first, this) || Pe._last && ke(Pe._last, this);
+          var Pe = new Be(this, !0), ze = Pe._first && ke(Pe._first, this) || Pe._last && ke(Pe._last, this);
           return Pe.detach(), !ze;
         }, surroundContents: function(Pe) {
           if (Ot(Pe, Bt), !this.canSurroundContents())
@@ -51838,7 +51862,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         }, toString: function() {
           Ie(this);
           var Pe, ze = this.startContainer;
-          return ze === this.endContainer && ae(ze) ? ze.nodeType == 3 || ze.nodeType == 4 ? ze.data.slice(this.startOffset, this.endOffset) : "" : (Pe = [], De(ze = new Fe(this, !0), function(dt) {
+          return ze === this.endContainer && ae(ze) ? ze.nodeType == 3 || ze.nodeType == 4 ? ze.data.slice(this.startOffset, this.endOffset) : "" : (Pe = [], De(ze = new Be(this, !0), function(dt) {
             dt.nodeType != 3 && dt.nodeType != 4 || Pe.push(dt.data);
           }), ze.detach(), Pe.join(""));
         }, compareNode: function(Pe) {
@@ -51865,9 +51889,9 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         }, isPointInRange: function(Pe, ze) {
           return Ie(this), Ae(Pe, "HIERARCHY_REQUEST_ERR"), Lt(Pe, this.startContainer), 0 <= Se(Pe, ze, this.startContainer, this.startOffset) && Se(Pe, ze, this.endContainer, this.endOffset) <= 0;
         }, intersectsRange: function(Pe) {
-          return Be(this, Pe, !1);
+          return Fe(this, Pe, !1);
         }, intersectsOrTouchesRange: function(Pe) {
-          return Be(this, Pe, !0);
+          return Fe(this, Pe, !0);
         }, intersection: function(Pe) {
           var ze, dt, _e;
           return this.intersectsRange(Pe) ? (ze = Se(this.startContainer, this.startOffset, Pe.startContainer, Pe.startOffset), dt = Se(this.endContainer, this.endOffset, Pe.endContainer, Pe.endOffset), _e = this.cloneRange(), ze == -1 && _e.setStart(Pe.startContainer, Pe.startOffset), dt == 1 && _e.setEnd(Pe.endContainer, Pe.endOffset), _e) : null;
@@ -51887,7 +51911,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           var ze = this.cloneRange(), dt = (ze.selectNode(Pe), ze.getNodes([3]));
           return 0 < dt.length ? (ze.setStart(dt[0], 0), dt = dt.pop(), ze.setEnd(dt, dt.length), this.containsRange(ze)) : this.containsNodeContents(Pe);
         }, getNodes: function(Pe, ze) {
-          return Ie(this), dt = this, _e = ze, rt = !(!(ze = Pe) || !ze.length), et = !!_e, rt && ($e = new RegExp("^(" + ze.join("|") + ")$")), De(new Fe(dt, !(gt = [])), function(ft) {
+          return Ie(this), dt = this, _e = ze, rt = !(!(ze = Pe) || !ze.length), et = !!_e, rt && ($e = new RegExp("^(" + ze.join("|") + ")$")), De(new Be(dt, !(gt = [])), function(ft) {
             var we;
             rt && !$e.test(ft.nodeType) || et && !_e(ft) || ft == (we = dt.startContainer) && ae(we) && dt.startOffset == we.length || ft == (we = dt.endContainer) && ae(we) && dt.endOffset == 0 || gt.push(ft);
           }), gt;
@@ -51917,15 +51941,15 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         }, inspect: function() {
           return je(this);
         }, detach: function() {
-        } }), qt(Zt, on), X.extend(Zt, { rangeProperties: Ue, RangeIterator: Fe, copyComparisonConstants: ut, createPrototypeRange: qt, inspect: je, toHtml: kt, getRangeDocument: Oe, rangesEqual: function(Pe, ze) {
+        } }), qt(Zt, on), X.extend(Zt, { rangeProperties: Ue, RangeIterator: Be, copyComparisonConstants: ut, createPrototypeRange: qt, inspect: je, toHtml: kt, getRangeDocument: Oe, rangesEqual: function(Pe, ze) {
           return Pe.startContainer === ze.startContainer && Pe.startOffset === ze.startOffset && Pe.endContainer === ze.endContainer && Pe.endOffset === ze.endOffset;
         } }), U.DomRange = Zt;
       }), B.createCoreModule("WrappedRange", ["DomRange"], function(U, Z) {
         var Y, X, G, ee, ae = U.dom, de = U.util, ue = ae.DomPosition, ne = U.DomRange, Se = ae.getBody, ve = ae.getContentDocument, ge = ae.isCharacterDataNode;
         if (U.features.implementsDomRange) {
           let Ce = function(Me) {
-            for (var nt, Be = ce.length; Be--; )
-              Me[nt = ce[Be]] = Me.nativeRange[nt];
+            for (var nt, Fe = ce.length; Fe--; )
+              Me[nt = ce[Fe]] = Me.nativeRange[nt];
             Me.collapsed = Me.startContainer === Me.endContainer && Me.startOffset === Me.endOffset;
           };
           var Te, ce = ne.rangeProperties;
@@ -51933,9 +51957,9 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
             if (!Me)
               throw Z.createError("WrappedRange: Range must be specified");
             this.nativeRange = Me, Ce(this);
-          }, function(Me, nt, Be, De, xe) {
-            var Je = Me.startContainer !== nt || Me.startOffset != Be, je = Me.endContainer !== De || Me.endOffset != xe, Fe = !Me.equals(Me.nativeRange);
-            (Je || je || Fe) && (Me.setEnd(De, xe), Me.setStart(nt, Be));
+          }, function(Me, nt, Fe, De, xe) {
+            var Je = Me.startContainer !== nt || Me.startOffset != Fe, je = Me.endContainer !== De || Me.endOffset != xe, Be = !Me.equals(Me.nativeRange);
+            (Je || je || Be) && (Me.setEnd(De, xe), Me.setStart(nt, Fe));
           }), (Te = Y.prototype).selectNode = function(Me) {
             this.nativeRange.selectNode(Me), Ce(this);
           }, Te.cloneContents = function() {
@@ -51964,26 +51988,26 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
               };
             };
           } catch {
-            Te.setStart = function(nt, Be) {
+            Te.setStart = function(nt, Fe) {
               try {
-                this.nativeRange.setStart(nt, Be);
+                this.nativeRange.setStart(nt, Fe);
               } catch {
-                this.nativeRange.setEnd(nt, Be), this.nativeRange.setStart(nt, Be);
+                this.nativeRange.setEnd(nt, Fe), this.nativeRange.setStart(nt, Fe);
               }
               Ce(this);
-            }, Te.setEnd = function(nt, Be) {
+            }, Te.setEnd = function(nt, Fe) {
               try {
-                this.nativeRange.setEnd(nt, Be);
+                this.nativeRange.setEnd(nt, Fe);
               } catch {
-                this.nativeRange.setStart(nt, Be), this.nativeRange.setEnd(nt, Be);
+                this.nativeRange.setStart(nt, Fe), this.nativeRange.setEnd(nt, Fe);
               }
               Ce(this);
-            }, le = function(nt, Be) {
+            }, le = function(nt, Fe) {
               return function(De) {
                 try {
                   this.nativeRange[nt](De);
                 } catch {
-                  this.nativeRange[Be](De), this.nativeRange[nt](De);
+                  this.nativeRange[Fe](De), this.nativeRange[nt](De);
                 }
                 Ce(this);
               };
@@ -52010,14 +52034,14 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
             return (Me = ve(Me, Z, "createNativeRange")).createRange();
           };
         }
-        U.features.implementsTextRange && (X = function(Ce, Me, nt, Be, De) {
+        U.features.implementsTextRange && (X = function(Ce, Me, nt, Fe, De) {
           var xe = Ce.duplicate(), Je = (xe.collapse(nt), xe.parentElement());
           if (!(Je = ae.isOrIsAncestorOf(Me, Je) ? Je : Me).canHaveHTML)
             return { boundaryPosition: Me = new ue(Je.parentNode, ae.getNodeIndex(Je)), nodeInfo: { nodeIndex: Me.offset, containerElement: Me.node } };
           var je = ae.getDocument(Je).createElement("span");
           je.parentNode && ae.removeNode(je);
-          for (var Fe, He, Ze = nt ? "StartToStart" : "StartToEnd", Qe = De && De.containerElement == Je ? De.nodeIndex : 0, Bt = Je.childNodes.length, Ye = Bt, Ht = Ye; Ht == Bt ? Je.appendChild(je) : Je.insertBefore(je, Je.childNodes[Ht]), xe.moveToElementText(je), (Fe = xe.compareEndPoints(Ze, Ce)) != 0 && Qe != Ye; ) {
-            if (Fe == -1) {
+          for (var Be, He, Ze = nt ? "StartToStart" : "StartToEnd", Qe = De && De.containerElement == Je ? De.nodeIndex : 0, Bt = Je.childNodes.length, Ye = Bt, Ht = Ye; Ht == Bt ? Je.appendChild(je) : Je.insertBefore(je, Je.childNodes[Ht]), xe.moveToElementText(je), (Be = xe.compareEndPoints(Ze, Ce)) != 0 && Qe != Ye; ) {
+            if (Be == -1) {
               if (Ye == Qe + 1)
                 break;
               Qe = Ht;
@@ -52025,24 +52049,24 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
               Ye = Ye == Qe + 1 ? Qe : Ht;
             Ht = Math.floor((Qe + Ye) / 2), Je.removeChild(je);
           }
-          if (Me = je.nextSibling, Fe == -1 && Me && ge(Me)) {
+          if (Me = je.nextSibling, Be == -1 && Me && ge(Me)) {
             if (xe.setEndPoint(nt ? "EndToStart" : "EndToEnd", Ce), /[\r\n]/.test(Me.data))
-              for (var zt = xe.duplicate(), en = (De = zt.text.replace(/\r\n/g, "\r").length, zt.moveStart("character", De)); (Fe = zt.compareEndPoints("StartToEnd", zt)) == -1; )
+              for (var zt = xe.duplicate(), en = (De = zt.text.replace(/\r\n/g, "\r").length, zt.moveStart("character", De)); (Be = zt.compareEndPoints("StartToEnd", zt)) == -1; )
                 en++, zt.moveStart("character", 1);
             else
               en = xe.text.length;
             He = new ue(Me, en);
           } else
-            De = (Be || !nt) && je.previousSibling, He = (Me = (Be || nt) && je.nextSibling) && ge(Me) ? new ue(Me, 0) : De && ge(De) ? new ue(De, De.data.length) : new ue(Je, ae.getNodeIndex(je));
+            De = (Fe || !nt) && je.previousSibling, He = (Me = (Fe || nt) && je.nextSibling) && ge(Me) ? new ue(Me, 0) : De && ge(De) ? new ue(De, De.data.length) : new ue(Je, ae.getNodeIndex(je));
           return ae.removeNode(je), { boundaryPosition: He, nodeInfo: { nodeIndex: Ht, containerElement: Je } };
         }, G = function(Ce, Me) {
-          var nt, Be = Ce.offset, De = ae.getDocument(Ce.node), xe = Se(De).createTextRange(), Je = ge(Ce.node), je = Je ? (nt = Ce.node).parentNode : (nt = Be < (je = Ce.node.childNodes).length ? je[Be] : null, Ce.node);
-          return (Ce = De.createElement("span")).innerHTML = "&#feff;", nt ? je.insertBefore(Ce, nt) : je.appendChild(Ce), xe.moveToElementText(Ce), xe.collapse(!Me), je.removeChild(Ce), Je && xe[Me ? "moveStart" : "moveEnd"]("character", Be), xe;
+          var nt, Fe = Ce.offset, De = ae.getDocument(Ce.node), xe = Se(De).createTextRange(), Je = ge(Ce.node), je = Je ? (nt = Ce.node).parentNode : (nt = Fe < (je = Ce.node.childNodes).length ? je[Fe] : null, Ce.node);
+          return (Ce = De.createElement("span")).innerHTML = "&#feff;", nt ? je.insertBefore(Ce, nt) : je.appendChild(Ce), xe.moveToElementText(Ce), xe.collapse(!Me), je.removeChild(Ce), Je && xe[Me ? "moveStart" : "moveEnd"]("character", Fe), xe;
         }, ((ke = function(Ce) {
           this.textRange = Ce, this.refresh();
         }).prototype = new ne(document)).refresh = function() {
-          Me = (nt = this.textRange).parentElement(), (De = nt.duplicate()).collapse(!0), Be = De.parentElement(), (De = nt.duplicate()).collapse(!1), nt = De.parentElement();
-          var Ce, Me, nt, Be = (De = Be == nt ? Be : ae.getCommonAncestor(Be, nt)) == Me ? De : ae.getCommonAncestor(Me, De), De = (nt = this.textRange).compareEndPoints("StartToEnd", nt) == 0 ? Ce = X(this.textRange, Be, !0, !0).boundaryPosition : (Ce = (Me = X(this.textRange, Be, !0, !1)).boundaryPosition, X(this.textRange, Be, !1, !1, Me.nodeInfo).boundaryPosition);
+          Me = (nt = this.textRange).parentElement(), (De = nt.duplicate()).collapse(!0), Fe = De.parentElement(), (De = nt.duplicate()).collapse(!1), nt = De.parentElement();
+          var Ce, Me, nt, Fe = (De = Fe == nt ? Fe : ae.getCommonAncestor(Fe, nt)) == Me ? De : ae.getCommonAncestor(Me, De), De = (nt = this.textRange).compareEndPoints("StartToEnd", nt) == 0 ? Ce = X(this.textRange, Fe, !0, !0).boundaryPosition : (Ce = (Me = X(this.textRange, Fe, !0, !1)).boundaryPosition, X(this.textRange, Fe, !1, !1, Me.nodeInfo).boundaryPosition);
           this.setStart(Ce.node, Ce.offset), this.setEnd(De.node, De.offset);
         }, ke.prototype.getName = function() {
           return "WrappedTextRange";
@@ -52078,8 +52102,8 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         function Ce(we) {
           return !!we.anchorNode && ee.comparePoints(we.anchorNode, we.anchorOffset, we.focusNode, we.focusOffset) == 1;
         }
-        var Me = de(window, "getSelection"), nt = ae.isHostObject(document, "selection"), Be = (ge.implementsWinGetSelection = Me, (ge.implementsDocSelection = nt) && (!Me || U.config.preferTextRange));
-        if (Be)
+        var Me = de(window, "getSelection"), nt = ae.isHostObject(document, "selection"), Fe = (ge.implementsWinGetSelection = Me, (ge.implementsDocSelection = nt) && (!Me || U.config.preferTextRange));
+        if (Fe)
           Y = Oe, U.isSelectionValid = function(we) {
             var Ke = (we = ke(we, "isSelectionValid").document).selection;
             return Ke.type != "None" || ce(Ke.createRange().parentElement()) == we;
@@ -52095,7 +52119,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         }
         if (!(Me = (U.getNativeSelection = Y)()))
           return Z.fail("Native selection was null (possibly issue 138?)"), !1;
-        var De = U.createNativeRange(document), xe = re(document), Je = ae.areHostProperties(Me, ["anchorNode", "focusNode", "anchorOffset", "focusOffset"]), je = (ge.selectionHasAnchorAndFocus = Je, de(Me, "extend")), Fe = (ge.selectionHasExtend = je, de(Me, "setBaseAndExtent")), He = (ge.selectionHasSetBaseAndExtent = Fe, typeof Me.rangeCount == G), Ze = (ge.selectionHasRangeCount = He, !1), Qe = !0, Bt = je ? function(we, Ke) {
+        var De = U.createNativeRange(document), xe = re(document), Je = ae.areHostProperties(Me, ["anchorNode", "focusNode", "anchorOffset", "focusOffset"]), je = (ge.selectionHasAnchorAndFocus = Je, de(Me, "extend")), Be = (ge.selectionHasExtend = je, de(Me, "setBaseAndExtent")), He = (ge.selectionHasSetBaseAndExtent = Be, typeof Me.rangeCount == G), Ze = (ge.selectionHasRangeCount = He, !1), Qe = !0, Bt = je ? function(we, Ke) {
           var ht = ue.getRangeDocument(Ke);
           (ht = U.createRange(ht)).collapseToPoint(Ke.endContainer, Ke.endOffset), we.addRange(Ie(ht)), we.extend(Ke.startContainer, Ke.startOffset);
         } : null;
@@ -52215,7 +52239,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           }
           Mt.select(), kt(we);
         }
-        if (!Be && Je && ae.areHostMethods(Me, ["removeAllRanges", "addRange"])) {
+        if (!Fe && Je && ae.areHostMethods(Me, ["removeAllRanges", "addRange"])) {
           ze.removeAllRanges = function() {
             this.nativeSelection.removeAllRanges(), We(this);
           };
@@ -52248,7 +52272,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
             }
           };
         } else {
-          if (!(de(Me, "empty") && de(De, "select") && sn && Be))
+          if (!(de(Me, "empty") && de(De, "select") && sn && Fe))
             return Z.fail("No means of selecting a Range or TextRange was found"), !1;
           ze.removeAllRanges = function() {
             try {
@@ -52269,7 +52293,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           if (we < 0 || we >= this.rangeCount)
             throw new Se("INDEX_SIZE_ERR");
           return this._ranges[we].cloneRange();
-        }, Be)
+        }, Fe)
           Zt = function(we) {
             var Ke;
             U.isSelectionValid(we.win) ? Ke = we.docSelection.createRange() : (Ke = re(we.win.document).createTextRange()).collapse(!0), we.docSelection.type == Te ? kt(we) : st(Ke) ? xt(we, Ke) : We(we);
@@ -52341,7 +52365,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
             $e(this, we);
         } : function(we) {
           $e(this, we);
-        }, !Be && Je && ge.implementsDomRange ? (Pe = Ce, ze.isBackward = function() {
+        }, !Fe && Je && ge.implementsDomRange ? (Pe = Ce, ze.isBackward = function() {
           return Pe(this);
         }) : Pe = ze.isBackward = function() {
           return !1;
@@ -52367,7 +52391,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           rt(this, we);
           var Ke = U.createRange(we);
           Ke.selectNodeContents(we), this.setSingleRange(Ke);
-        }, Fe ? ze.setBaseAndExtent = function(we, Ke, ht, Pt) {
+        }, Be ? ze.setBaseAndExtent = function(we, Ke, ht, Pt) {
           this.nativeSelection.setBaseAndExtent(we, Ke, ht, Pt), this.refresh();
         } : je && (ze.setBaseAndExtent = function(we, Ke, ht, Pt) {
           et(we, Ke), et(ht, Pt), rt(this, we), rt(this, ht);
@@ -65494,7 +65518,7 @@ function K4({ setEditorEditable: c, htmlString: t, isEditable: n }) {
   return Kt(() => {
     e.update(() => {
       const o = new DOMParser().parseFromString(t, "text/html"), r = hS(e, o);
-      ir().clear(), f0(r), e.setEditable(!1), setTimeout(() => {
+      ir().clear(), f0(r), console.log("EDITOR_STATE_LOEADED", r), e.setEditable(!1), setTimeout(() => {
         e.setEditable(n), c(!0), console.log("editor set to editable");
       }, 5e3);
     });
@@ -65530,8 +65554,7 @@ function o3({
   let G = () => {
     console.log(
       "[Lexical Demo][onBlacklistedInsert] blacklisted combination found"
-    ), P("Insert is forbidden", (Fe) => {
-    });
+    );
   };
   const { userName: ee, userId: ae, userEmail: de } = t || {
     userName: "aa",
@@ -65551,26 +65574,26 @@ function o3({
     // client user name - use real username here instead of demo name
     hooks: {
       fetchDocOnNetworkReconnect: X,
-      contentChanged: (Fe, He) => {
+      contentChanged: (Be, He) => {
         console.log(
           "[Lexical Demo][contentChanged hook] hook invoked by Codox: ",
-          Fe
-        ), ce(Fe);
+          Be
+        ), ce(Be);
         const Ze = kc(`.editor-autosave-${g}`).html();
         console.log("stateEditor", wl(Ze)), o === "objecive" ? r(wl(Ze), g) : a(wl(Ze), g);
       },
-      usersUpdate: (Fe) => {
-        y(Fe), renderOnlineUsers(Fe), console.log(
+      usersUpdate: (Be) => {
+        y(Be), renderOnlineUsers(Be), console.log(
           "[Lexical Demo][usersUpdate hook] hook invoked by Codox: ",
-          Fe
+          Be
         );
       }
     }
   };
   Kt(() => {
-    let Fe = [], He = [];
+    let Be = [], He = [];
     x && x.length > 0 && x.map((Ze, Qe) => {
-      He.includes(Ze.name) || (He.push(Ze.name), Fe.push(
+      He.includes(Ze.name) || (He.push(Ze.name), Be.push(
         /* @__PURE__ */ Ee.jsxs(
           "div",
           {
@@ -65585,7 +65608,7 @@ function o3({
           Qe
         )
       ));
-    }), F(Fe);
+    }), F(Be);
   }, [x]);
   const Se = () => {
     U.current && (U.current.initComments(l), ["content_changed", "error", "users_update"].forEach((He) => {
@@ -65619,10 +65642,10 @@ function o3({
       if (!S)
         return;
       B && ve();
-      let Fe = m;
-      if (Fe)
+      let Be = m;
+      if (Be)
         try {
-          x5(Fe, Mx), N(Fe);
+          x5(Be, Mx), N(Be);
         } catch (He) {
           console.error("[APP] error: ", He);
         }
@@ -65635,16 +65658,16 @@ function o3({
   const ge = $r(() => {
     if (T)
       return {
-        editorState: (Fe) => {
-          Fe.update(() => {
-            const He = new Uy(Fe);
-            l && (He.setComments(l), Fe._commentStore || (Fe._commentStore = new Uy(Fe), Fe._commentStore.getComments().length === 0 && Fe._commentStore.setComments(l)));
+        editorState: (Be) => {
+          Be.update(() => {
+            const He = new Uy(Be);
+            l && (He.setComments(l), Be._commentStore || (Be._commentStore = new Uy(Be), Be._commentStore.getComments().length === 0 && Be._commentStore.setComments(l)));
           });
         },
         namespace: "Playground",
         nodes: Mx,
-        onError: (Fe) => {
-          console.error("[Lexical Demo][Editor Error Captured]: ", Fe);
+        onError: (Be) => {
+          console.error("[Lexical Demo][Editor Error Captured]: ", Be);
         },
         theme: WS
       };
@@ -65652,28 +65675,28 @@ function o3({
   Kt(() => {
     Te.current || (Te.current = c);
   }, [c]);
-  const ce = ({ source: Fe, content: He }) => {
+  const ce = ({ source: Be, content: He }) => {
     console.log("[Lexical Demo][contentChangedHookHandler]: ", {
-      source: Fe,
+      source: Be,
       content: He
     });
-  }, re = /* @__PURE__ */ Ee.jsx(uE, { children: "Enter some plain text..." }), [fe, le] = Gt(null), [ke, Oe] = Gt(!1), [Ce, Me] = Gt(!1), [nt, Be] = Gt(!1), De = (Fe) => {
-    Fe !== null && le(Fe);
+  }, re = /* @__PURE__ */ Ee.jsx(uE, { children: "Enter some plain text..." }), [fe, le] = Gt(null), [ke, Oe] = Gt(!1), [Ce, Me] = Gt(!1), [nt, Fe] = Gt(!1), De = (Be) => {
+    Be !== null && le(Be);
   };
   Kt(() => {
-    const Fe = () => {
+    const Be = () => {
       const He = sf && window.matchMedia("(max-width: 1025px)").matches;
       He !== ke && Oe(He);
     };
-    return Fe(), window.addEventListener("resize", Fe), () => {
-      window.removeEventListener("resize", Fe);
+    return Be(), window.addEventListener("resize", Be), () => {
+      window.removeEventListener("resize", Be);
     };
   }, [ke]), Kt(() => {
-    const Fe = (He) => {
+    const Be = (He) => {
       z && !He.target.closest(".reference-toolbar") && I(null);
     };
-    return document.addEventListener("click", Fe), () => {
-      document.removeEventListener("click", Fe);
+    return document.addEventListener("click", Be), () => {
+      document.removeEventListener("click", Be);
     };
   }, [z]);
   let xe = "", Je = !1;
@@ -65681,12 +65704,12 @@ function o3({
     Je = !0;
   });
   const je = () => {
-    const Fe = kc(`.editor-autosave-${g}`).html();
+    const Be = kc(`.editor-autosave-${g}`).html();
     if (!Je) {
       console.log("No user interaction detected, ignoring automatic changes.");
       return;
     }
-    Fe !== xe ? (console.log("editorState handleEditorCollabOffChange called", Fe, g), o === "objective" ? r(wl(Fe), g) : a(wl(Fe), g), xe = wl(Fe)) : console.log("No change in editor state, no update needed."), Je = !1;
+    Be !== xe ? (console.log("editorState handleEditorCollabOffChange called", Be, g), o === "objective" ? r(wl(Be), g) : a(wl(Be), g), xe = wl(Be)) : console.log("No change in editor state, no update needed."), Je = !1;
   };
   return Wi.useEffect(() => {
     c && t && t.userName && e && i ? setTimeout(() => {
@@ -65695,7 +65718,7 @@ function o3({
   }, [c, t, i]), /* @__PURE__ */ Ee.jsx(Ee.Fragment, { children: Z ? /* @__PURE__ */ Ee.jsxs(m0, { initialConfig: ge, children: [
     /* @__PURE__ */ Ee.jsx(jT, { children: /* @__PURE__ */ Ee.jsx(yO, { children: /* @__PURE__ */ Ee.jsxs("div", { ref: w, className: "editor-shell", style: { position: "relative" }, children: [
       /* @__PURE__ */ Ee.jsxs(Ee.Fragment, { children: [
-        /* @__PURE__ */ Ee.jsx(K4, { setEditorEditable: Be, isEditable: b, htmlString: c }),
+        /* @__PURE__ */ Ee.jsx(K4, { setEditorEditable: Fe, isEditable: b, htmlString: c }),
         /* @__PURE__ */ Ee.jsx(
           J4,
           {
@@ -65752,7 +65775,7 @@ function o3({
               hasCellBackgroundColor: !0
             }
           ),
-          h && /* @__PURE__ */ Ee.jsx(lN, {}),
+          /* @__PURE__ */ Ee.jsx(lN, {}),
           /* @__PURE__ */ Ee.jsx(mA, {}),
           /* @__PURE__ */ Ee.jsx(UA, {}),
           /* @__PURE__ */ Ee.jsx(GA, {}),
@@ -65853,4 +65876,4 @@ export {
   hu as y,
   X4 as z
 };
-//# sourceMappingURL=index-492d5d70.js.map
+//# sourceMappingURL=index-486ef15c.js.map