sykpcomposer 1.19.60 → 1.19.62

package/dist/{index-486ef15c.js → index-801f1f4b.js}

@@ -354,7 +354,7 @@ function a2() {
         var We = Ae.prototype;
         return !!(We && We.isReactComponent);
       }
-      function de(Ae, We, he) {
+      function ue(Ae, We, he) {
         if (Ae == null)
           return "";
         if (typeof Ae == "function")
@@ -372,23 +372,23 @@ function a2() {
             case i:
               return ee(Ae.render);
             case p:
-              return de(Ae.type, We, he);
+              return ue(Ae.type, We, he);
             case h:
               return ee(Ae._render);
             case f: {
               var Ie = Ae, it = Ie._payload, st = Ie._init;
               try {
-                return de(st(it), We, he);
+                return ue(st(it), We, he);
               } catch {
               }
             }
           }
         return "";
       }
-      var ue = {}, ne = y.ReactDebugCurrentFrame;
+      var de = {}, ne = y.ReactDebugCurrentFrame;
       function Se(Ae) {
         if (Ae) {
-          var We = Ae._owner, he = de(Ae.type, Ae._source, We ? We.type : null);
+          var We = Ae._owner, he = ue(Ae.type, Ae._source, We ? We.type : null);
           ne.setExtraStackFrame(he);
         } else
           ne.setExtraStackFrame(null);
@@ -408,7 +408,7 @@ function a2() {
               } catch (Xe) {
                 kt = Xe;
               }
-              kt && !(kt instanceof Error) && (Se(it), S("%s: type specification of %s `%s` is invalid; the type checker function must return `null` or an `Error` but returned a %s. You may have forgotten to pass an argument to the type checker creator (arrayOf, instanceOf, objectOf, oneOf, oneOfType, and shape all require an argument).", Ie || "React class", he, xt, typeof kt), Se(null)), kt instanceof Error && !(kt.message in ue) && (ue[kt.message] = !0, Se(it), S("Failed %s type: %s", he, kt.message), Se(null));
+              kt && !(kt instanceof Error) && (Se(it), S("%s: type specification of %s `%s` is invalid; the type checker function must return `null` or an `Error` but returned a %s. You may have forgotten to pass an argument to the type checker creator (arrayOf, instanceOf, objectOf, oneOf, oneOfType, and shape all require an argument).", Ie || "React class", he, xt, typeof kt), Se(null)), kt instanceof Error && !(kt.message in de) && (de[kt.message] = !0, Se(it), S("Failed %s type: %s", he, kt.message), Se(null));
             }
         }
       }
@@ -513,7 +513,7 @@ function a2() {
       var xe = y.ReactCurrentOwner, Je = y.ReactDebugCurrentFrame;
       function je(Ae) {
         if (Ae) {
-          var We = Ae._owner, he = de(Ae.type, Ae._source, We ? We.type : null);
+          var We = Ae._owner, he = ue(Ae.type, Ae._source, We ? We.type : null);
           Je.setExtraStackFrame(he);
         } else
           Je.setExtraStackFrame(null);
@@ -11620,7 +11620,7 @@ class Uh extends $h {
 function Hk(c) {
   return new Uh(c);
 }
-const qk = or.lazy(() => import("./ImageComponent-061e4488.js"));
+const qk = or.lazy(() => import("./ImageComponent-e412b140.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-b52ddf63.js"));
+const Vk = or.lazy(() => import("./InlineImageComponent-18bfa435.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-70fe1ed9.js"));
+const nO = or.lazy(() => import("./PollComponent-8ef4c864.js"));
 function rO() {
   return Math.random().toString(36).replace(/[^a-z]+/g, "").substr(0, 5);
 }
@@ -15590,12 +15590,10 @@ function sN({ editor: c }) {
           S && a !== S ? c.update(() => {
             const C = go(S.elem);
             if (!C)
-              return;
+              throw new Error("TableCellResizer: Table cell node not found.");
             const O = $s(C), F = c.getElementByKey(O.getKey());
-            if (!F) {
-              console.error("TableCellResizer: Table element not found.");
-              return;
-            }
+            if (!F)
+              throw new Error("TableCellResizer: Table element not found.");
             t.current = y, e.current = F.getBoundingClientRect(), l(S);
           }) : S == null && f();
         }
@@ -15607,49 +15605,35 @@ function sN({ editor: c }) {
   }, [a, d, c, f]);
   const h = (E) => E === "bottom", m = bn(
     (E) => {
-      if (!a) {
-        console.error("TableCellResizer: Expected active cell.");
-        return;
-      }
+      if (!a)
+        throw new Error("TableCellResizer: Expected active cell.");
       c.update(() => {
         const x = go(a.elem);
-        if (!xn(x)) {
-          console.error("TableCellResizer: Table cell node not found.");
-          return;
-        }
+        if (!xn(x))
+          throw new Error("TableCellResizer: Table cell node not found.");
         const y = $s(x), S = CS(x), C = y.getChildren();
-        if (S >= C.length || S < 0) {
-          console.error("Expected table cell to be inside of table row.");
-          return;
-        }
+        if (S >= C.length || S < 0)
+          throw new Error("Expected table cell to be inside of table row.");
         const O = C[S];
-        if (!Mr(O)) {
-          console.error("Expected table row");
-          return;
-        }
+        if (!Mr(O))
+          throw new Error("Expected table row");
         O.setHeight(E);
       });
     },
     [a, c]
   ), g = bn(
     (E) => {
-      if (!a) {
-        console.error("TableCellResizer: Expected active cell.");
-        return;
-      }
+      if (!a)
+        throw new Error("TableCellResizer: Expected active cell.");
       c.update(() => {
         const x = go(a.elem);
-        if (!xn(x)) {
-          console.error("TableCellResizer: Table cell node not found.");
-          return;
-        }
+        if (!xn(x))
+          throw new Error("TableCellResizer: Table cell node not found.");
         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)) {
-            console.error("Expected table row");
-            return;
-          }
+          if (!Mr(F))
+            throw new Error("Expected table row");
           const B = F.getChildren(), P = B.map((N) => N.getColSpan()).reduce(
             (N, D) => {
               const A = N[N.length - 1] ?? 0;
@@ -15659,15 +15643,11 @@ function sN({ editor: c }) {
           ).findIndex(
             (N) => N > S
           );
-          if (P >= B.length || P < 0) {
-            console.error("Expected table cell to be inside of table row.");
-            return;
-          }
+          if (P >= B.length || P < 0)
+            throw new Error("Expected table cell to be inside of table row.");
           const T = B[P];
-          if (!xn(T)) {
-            console.error("Expected table cell");
-            return;
-          }
+          if (!xn(T))
+            throw new Error("Expected table cell");
           T.setWidth(E);
         }
       });
@@ -15676,10 +15656,8 @@ function sN({ editor: c }) {
   ), v = bn(
     (E) => {
       const x = (y) => {
-        if (y.preventDefault(), y.stopPropagation(), !a) {
-          console.error("TableCellResizer: Expected active cell.");
-          return;
-        }
+        if (y.preventDefault(), y.stopPropagation(), !a)
+          throw new Error("TableCellResizer: Expected active cell.");
         if (s.current) {
           const { x: S, y: C } = s.current;
           if (a === null)
@@ -15712,10 +15690,8 @@ function sN({ editor: c }) {
     [a, f, g, m]
   ), b = bn(
     (E) => (x) => {
-      if (x.preventDefault(), x.stopPropagation(), !a) {
-        console.error("TableCellResizer: Expected active cell.");
-        return;
-      }
+      if (x.preventDefault(), x.stopPropagation(), !a)
+        throw new Error("TableCellResizer: Expected active cell.");
       s.current = {
         x: x.clientX,
         y: x.clientY
@@ -17649,9 +17625,9 @@ var sE = { exports: {} };
         return ye.promise();
       }
     });
-    var de = /^(Eval|Internal|Range|Reference|Syntax|Type|URI)Error$/;
+    var ue = /^(Eval|Internal|Range|Reference|Syntax|Type|URI)Error$/;
     y.Deferred.exceptionHook = function($, Q) {
-      t.console && t.console.warn && $ && de.test($.name) && t.console.warn(
+      t.console && t.console.warn && $ && ue.test($.name) && t.console.warn(
         "jQuery.Deferred exception: " + $.message,
         $.stack,
         Q
@@ -17661,9 +17637,9 @@ var sE = { exports: {} };
         throw $;
       });
     };
-    var ue = y.Deferred();
+    var de = y.Deferred();
     y.fn.ready = function($) {
-      return ue.then($).catch(function(Q) {
+      return de.then($).catch(function(Q) {
         y.readyException(Q);
       }), this;
     }, y.extend({
@@ -17674,9 +17650,9 @@ var sE = { exports: {} };
       readyWait: 1,
       // Handle when the DOM is ready
       ready: function($) {
-        ($ === !0 ? --y.readyWait : y.isReady) || (y.isReady = !0, !($ !== !0 && --y.readyWait > 0) && ue.resolveWith(v, [y]));
+        ($ === !0 ? --y.readyWait : y.isReady) || (y.isReady = !0, !($ !== !0 && --y.readyWait > 0) && de.resolveWith(v, [y]));
       }
-    }), y.ready.then = ue.then;
+    }), y.ready.then = de.then;
     function ne() {
       v.removeEventListener("DOMContentLoaded", ne), t.removeEventListener("load", ne), y.ready();
     }
@@ -20092,12 +20068,12 @@ const kc = /* @__PURE__ */ Md(mN), yN = (c, t, n) => {
         d.update(() => {
           const K = Go("ol"), R = oi(), q = br(`${z.textContent}`);
           let Z = Array.from(z.querySelectorAll("span")).map((ae) => {
-            const de = ae.getAttribute("style") || "";
+            const ue = ae.getAttribute("style") || "";
             return {
               text: ae.innerText.trim(),
-              style: de
+              style: ue
             };
-          }).map((ae) => ae.style).filter((ae) => ae).map((ae) => ae.split(";").map((de) => de.trim()).filter((de) => !de.startsWith("font-family")).filter((de) => !de.startsWith("font-size")).filter((de) => !de.startsWith("border")).filter((de) => !de.startsWith("width")).join("; ")).join("; ");
+          }).map((ae) => ae.style).filter((ae) => ae).map((ae) => ae.split(";").map((ue) => ue.trim()).filter((ue) => !ue.startsWith("font-family")).filter((ue) => !ue.startsWith("font-size")).filter((ue) => !ue.startsWith("border")).filter((ue) => !ue.startsWith("width")).join("; ")).join("; ");
           const Y = b(Z, "font-weight"), X = b(Z, "font-style"), G = b(Z, "text-decoration");
           Z = `${Z}; font-weight: ${Y}`, Z = `${Z}; font-style: ${X}`, Z = `${Z}; color: black`, Z = `${Z}; text-decoration: ${G}`;
           let ee = E(X, Y, G);
@@ -20290,7 +20266,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), Fe = 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), [ue, de] = 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,
@@ -20331,7 +20307,7 @@ function kN({
           const yt = nh(Qe) ? Qe.getTag() : Qe.getType();
           if (yt in wN && p(yt), ly(Qe)) {
             const Ot = Qe.getLanguage();
-            ue(
+            de(
               Ot ? Jw[Ot] || Ot : ""
             );
             return;
@@ -20499,13 +20475,13 @@ function kN({
       {
         disabled: !ne,
         buttonClassName: "toolbar-item code-language",
-        buttonLabel: FT(de),
+        buttonLabel: FT(ue),
         buttonAriaLabel: "Select language",
         children: EN.map(([He, Ze]) => /* @__PURE__ */ Ee.jsx(
           Eo,
           {
             className: `item ${ep(
-              He === de
+              He === ue
             )}`,
             onClick: () => Je(He),
             children: /* @__PURE__ */ Ee.jsx("span", { className: "text", children: Ze })
@@ -21857,7 +21833,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
     }
     var u, d = e("./lib").rtType, p = e("./richText"), f = e("./array"), h = (u = e("./path")).samePath, m = u.pathLast, g = u.isParentArray, v = (u = e("./diffSpec")).semantics, b = u.stringTypes, _ = u.rtfArgs, w = u.sdfArgs, E = (u = e("./type")).getType, x = u.sameType, y = u.isRealObject, S = u.isPrimitive, C = u.isObjectArray, O = u.isPrimitiveArray, F = u.isArrayOfArray, B = u.doMatchType, M = e("./validations/DataValidator"), L = (u = e("./utils")).stringifyPath, P = u.equal, T = u.deLabel, N = u.clone, D = e("./configDepUtils"), A = (u = e("./logger")).log4, z = u.log3, I = u.logInfo, H = (u = e("./validations/validationErrors")).outputWarnMessage, J = u.VALIDATION_WARN_TYPES, K = e("./transpose").lTranspose, R = e("./config"), q = e("./errors").OperationError, W = (u = e("./deltaToAO")).translateAO, U = u.JOP2AO, Z = e("./deltaToValidation").translateDeltasToValidations;
     s.exports = i(i({ translateDeltasToValidations: Z, JsonDiff: function() {
-      var Y = 0 < arguments.length && arguments[0] !== void 0 ? arguments[0] : {}, X = new R(), G = (X.init(Y), new f(X)), ee = new p(), ae = new M(X), de = new D(X), ue = (A("[JSON Diff] config = ", Y, !0), d.init(_, w), X.keyNames, A("[JSON Diff] combined config = ", X, !0), function(ge, Te) {
+      var Y = 0 < arguments.length && arguments[0] !== void 0 ? arguments[0] : {}, X = new R(), G = (X.init(Y), new f(X)), ee = new p(), ae = new M(X), ue = new D(X), de = (A("[JSON Diff] config = ", Y, !0), d.init(_, w), X.keyNames, A("[JSON Diff] combined config = ", X, !0), function(ge, Te) {
         I("reverse", ge, Te);
         var ce = [].concat(ge), re = (ce.splice(ge.length - 1, 1, Te[Te.length - 1]), [].concat(Te));
         return re.splice(Te.length - 1, 1, ge[ge.length - 1]), { pathUpdate: ce, targetUpdate: re };
@@ -21897,7 +21873,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
             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 })) : (Fe = Object.keys(le), De = Object.keys(ke), new Set([].concat(Fe, De)).forEach(function(Je) {
+              return Oe = [], Ce = g(xe), Me = ue.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, !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;
@@ -21906,7 +21882,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         if (E(ge) === "array")
           return C(Te) && C(ge) ? function(le, ke) {
             var Oe = 2 < arguments.length && arguments[2] !== void 0 ? arguments[2] : [];
-            if (z("[diffObjectArray] Case: Obj array vs Obj array"), A("input =  ", le, !0), A("output = ", ke, !0), I("diffObjectArray conf = ", Y), !(X.keyNames && de.ensureInputOutputHaveKeyNames({ input: le, output: ke }) || Y.caller != null && Y.caller === "coengine"))
+            if (z("[diffObjectArray] Case: Obj array vs Obj array"), A("input =  ", le, !0), A("output = ", ke, !0), I("diffObjectArray conf = ", Y), !(X.keyNames && ue.ensureInputOutputHaveKeyNames({ input: le, output: ke }) || Y.caller != null && Y.caller === "coengine"))
               return I("No keyname in input and/or output (and caller is not coengine): use replace "), Me = (Ce = g(Oe)) ? "li" : "oi", [(0, r.default)((0, r.default)({ p: Oe }, Ce ? "ld" : "od", le), Me, ke)];
             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;
@@ -21940,9 +21916,9 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         })(Te), A("[JSON Diff] Start opsCompression = ", Te, !0), Te = ((fe) => {
           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));
+            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 = ue.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 = [], 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));
+            A("opsCompression: examine i = " + Fe + ";  compressedOps[i] = ", Oe[Fe], Oe[Fe + 1]), G.isReplace(Oe[Fe], Oe[Fe + 1]) ? (Me = ue.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 = ue.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++) {
@@ -21962,7 +21938,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
                 }
                 A("Move compress: op2 is a run; op2 = ", Je, !0), Be++;
               }
-              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;
+              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 = de(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;
@@ -21974,15 +21950,15 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           return fe.forEach(function(Me) {
             T(Me);
           }), fe;
-        })(Te), I("[JSON DIFF] final result = ", N(re)), ce ? { deltas: re, translated: U({ currentState: ge, jsonDeltas: re, config: X, utils: de }) } : re);
+        })(Te), I("[JSON DIFF] final result = ", N(re)), ce ? { deltas: re, translated: U({ currentState: ge, jsonDeltas: re, config: X, utils: ue }) } : re);
       }, this.init = function(ge, Te) {
         d.init(ge, Te);
       }, this.translateAO = function() {
         for (var ge = arguments.length, Te = new Array(ge), ce = 0; ce < ge; ce++)
           Te[ce] = arguments[ce];
-        return W(i(i({}, Te), {}, { utils: de }));
+        return W(i(i({}, Te), {}, { utils: ue }));
       }, this.JOP2AO = function(ge, Te) {
-        return U({ currentState: ge, jsonDeltas: Te, config: X, utils: de });
+        return U({ currentState: ge, jsonDeltas: Te, config: X, utils: ue });
       }, this.translateDeltasToValidations = function(ge, Te) {
         return Z(ge, Te);
       };
@@ -22675,21 +22651,21 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         else if (J.ld !== void 0)
           w.checkList(q), J.ldLen !== void 0 ? q.splice(W, J.ldLen) : q.splice(W, 1);
         else if (J.lm !== void 0)
-          w.checkList(q), _(J.lm) ? (K = q[W], q.splice(W, 1), R = [{ p: J.lm, li: K }], z.data = N(z.data, R)) : J.lm != W && (de = q[W], q.splice(W, 1), q.splice(J.lm, 0, de));
+          w.checkList(q), _(J.lm) ? (K = q[W], q.splice(W, 1), R = [{ p: J.lm, li: K }], z.data = N(z.data, R)) : J.lm != W && (ue = q[W], q.splice(W, 1), q.splice(J.lm, 0, ue));
         else if (J.od !== void 0 && J.oi !== void 0) {
           if (w.checkObj(q), (0, l.default)(J.od) != "object" || (0, l.default)(J.oi) != "object" || J.od === null || J.oi === null || Array.isArray(J.od) || Array.isArray(J.oi)) {
             if (((0, l.default)(J.od) != "object" || (0, l.default)(J.oi) != "object" || !Array.isArray(J.od) && !Array.isArray(J.oi)) && (0, l.default)(J.od) === "object" && (0, l.default)(J.oi) === "object" && J.od !== null && J.oi !== null)
               throw new Error("codox_apply (or): invalid or:  " + g(J));
             q[W] = J.oi;
           } else {
-            var de = Object.keys(J.od), ue = (0, a.default)(de, 1)[0], ne = Object.keys(J.oi);
-            ue !== (ne = (0, a.default)(ne, 1)[0]) && delete q[W][ue], q[W]["".concat(ne)] = J.oi[ne];
+            var ue = Object.keys(J.od), de = (0, a.default)(ue, 1)[0], ne = Object.keys(J.oi);
+            de !== (ne = (0, a.default)(ne, 1)[0]) && delete q[W][de], q[W]["".concat(ne)] = J.oi[ne];
           }
           m(W), b(q), I(q[W]);
         } else if (J.oi !== void 0) {
           if (w.checkObj(q), (0, l.default)(J.oi) != "object")
             throw new Error("invalid instruction in op oi: " + g(J));
-          ue = Object.keys(J.oi), ne = (0, a.default)(ue, 1)[0], q[W]["".concat(ne)] = J.oi[ne];
+          de = Object.keys(J.oi), ne = (0, a.default)(de, 1)[0], q[W]["".concat(ne)] = J.oi[ne];
         } else {
           if (J.od === void 0)
             throw new Error("invalid / missing instruction in op: " + g(J));
@@ -22768,7 +22744,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
       if (A == null)
         return D;
       D = v(D);
-      var I, H, J, K, R, q, W, U, Z, Y, X, G, ee, ae, de, ue, ne = w.commonLengthForOps(A, D), Se = w.commonLengthForOps(D, A), ve = D.p.length, ge = A.p.length, Te = (D.na == null && !D.t || ve++, A.na == null && !A.t || ge++, ne !== null), ce = Te && ge < ve;
+      var I, H, J, K, R, q, W, U, Z, Y, X, G, ee, ae, ue, de, ne = w.commonLengthForOps(A, D), Se = w.commonLengthForOps(D, A), ve = D.p.length, ge = A.p.length, Te = (D.na == null && !D.t || ve++, A.na == null && !A.t || ge++, ne !== null), ce = Te && ge < ve;
       if (D.lmld == null && Se != null && ve < ge && (D.p[Se], A.p[Se]), !Te)
         return g(D), g(A), D;
       g(D), g(A);
@@ -22800,7 +22776,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         })(A);
         switch (re) {
           case C:
-            return ue = A, g(de = D), g(ue), de;
+            return de = A, g(ue = D), g(de), ue;
           case 5:
             return X = A, G = z, ee = ne, ae = ce, g(Y = D), g(X), ae ? Y.p[ee] == X.p[ee] ? (g(Y), g(X), null) : (g(Y), g(X), Y) : Y.p[ee] == X.p[ee] ? Y.oi === void 0 || G == 1 ? (g(Y), g(X), null) : (Y.od = X.oi, Y) : (g(Y), g(X), Y);
           case 6:
@@ -23019,8 +22995,8 @@ otherCic = `).concat(A, "; type = ").concat(z, "; common = ").concat(I);
     }
     w.transformComponent = function(N, D, A, z) {
       var I = D.lm !== void 0 && _(D.lm) || A.lm !== void 0 && _(A.lm) ? function(J, K, R, q) {
-        var W, U, Z, Y, X, G, ee, ae, de;
-        return g(K), g(R), K.lm !== void 0 && _(K.lm) && R.lm !== void 0 && _(R.lm) ? (W = J, Z = R, Y = q, g(U = K), g(Z), X = { p: U.p.slice(), ld: 0, lmld: !0 }, G = { p: U.lm.slice(), li: 0, lmli: !0 }, U.orglm !== void 0 && (X.orglm = U.orglm, G.orglm = U.orglm), U.ic !== void 0 && (G.ic = U.ic), (ae = ee = null) == (de = B(0, X, Z, Y)) ? U.p.length == Z.p.length && Y == 0 ? ((ee = v(U)).p = Z.lm.slice(), g(ee), ee) : L(Z, U) ? (g(Z), g(U), (de = {}).p = Z.lm.slice(), de.ld = 0, g(de), de.p = de.p.concat(U.p.slice(Z.p.length)), g(de), ae = B(0, G, Z, Y), g(ae), ee = T(de, ae), g(ee), ee) : (g(de), null) : (g(Z), U = M(0, Z, X, P(Y)), g(U), g(G), g(U), U != null ? (ae = (U.lm !== void 0 ? (g(U), B) : (g(U), O))(W, G, U, Y)) == null ? (g(de), de) : (ee = T(de, ae), g(ee), ee) : (ee = L(X, Z) ? (U = { p: Z.lm.slice(), li: 0, lmli: !0 }, Z.ic !== void 0 && (U.ic = Z.ic), g(U), U = O(0, U, X, P(Y)), g(U), T(de, ae = O(0, G, U, Y))) : T(de, G), g(ee), ee))) : R.lm !== void 0 && _(R.lm) ? B(0, K, R, q) : K.lm !== void 0 && _(K.lm) ? M(0, K, R, q) : (g(K), void g(R));
+        var W, U, Z, Y, X, G, ee, ae, ue;
+        return g(K), g(R), K.lm !== void 0 && _(K.lm) && R.lm !== void 0 && _(R.lm) ? (W = J, Z = R, Y = q, g(U = K), g(Z), X = { p: U.p.slice(), ld: 0, lmld: !0 }, G = { p: U.lm.slice(), li: 0, lmli: !0 }, U.orglm !== void 0 && (X.orglm = U.orglm, G.orglm = U.orglm), U.ic !== void 0 && (G.ic = U.ic), (ae = ee = null) == (ue = B(0, X, Z, Y)) ? U.p.length == Z.p.length && Y == 0 ? ((ee = v(U)).p = Z.lm.slice(), g(ee), ee) : L(Z, U) ? (g(Z), g(U), (ue = {}).p = Z.lm.slice(), ue.ld = 0, g(ue), ue.p = ue.p.concat(U.p.slice(Z.p.length)), g(ue), ae = B(0, G, Z, Y), g(ae), ee = T(ue, ae), g(ee), ee) : (g(ue), null) : (g(Z), U = M(0, Z, X, P(Y)), g(U), g(G), g(U), U != null ? (ae = (U.lm !== void 0 ? (g(U), B) : (g(U), O))(W, G, U, Y)) == null ? (g(ue), ue) : (ee = T(ue, ae), g(ee), ee) : (ee = L(X, Z) ? (U = { p: Z.lm.slice(), li: 0, lmli: !0 }, Z.ic !== void 0 && (U.ic = Z.ic), g(U), U = O(0, U, X, P(Y)), g(U), T(ue, ae = O(0, G, U, Y))) : T(ue, G), g(ee), ee))) : R.lm !== void 0 && _(R.lm) ? B(0, K, R, q) : K.lm !== void 0 && _(K.lm) ? M(0, K, R, q) : (g(K), void g(R));
       }(N, D, A, z) : O(0, D, A, z);
       if (_(I))
         for (var H = 0; H < I.length; H++)
@@ -23236,38 +23212,38 @@ otherCic = `).concat(A, "; type = ").concat(z, "; common = ").concat(I);
         } else
           Z = {};
         G || U.set(R, Z), ee || U.set(q, Z);
-        var ae = R, de = q, ue = W, ne = U;
-        if (typeof ae == typeof de && ae != null && de != null && F(ae) === F(de) && f(ae) === f(de) && (G = h(ae)) === (ee = h(de)) && (G = ae instanceof Error) == (ee = de instanceof Error)) {
-          if ((G || ee) && (ae.name !== de.name || ae.message !== de.message))
+        var ae = R, ue = q, de = W, ne = U;
+        if (typeof ae == typeof ue && ae != null && ue != null && F(ae) === F(ue) && f(ae) === f(ue) && (G = h(ae)) === (ee = h(ue)) && (G = ae instanceof Error) == (ee = ue instanceof Error)) {
+          if ((G || ee) && (ae.name !== ue.name || ae.message !== ue.message))
             return !1;
-          if ((G = v(ae)) === (ee = v(de)) && (!G && !ee || ae.source === de.source && l(ae) === l(de)) && (G = g(ae)) === (ee = g(de))) {
-            if ((G || ee) && C(ae) !== C(de))
+          if ((G = v(ae)) === (ee = v(ue)) && (!G && !ee || ae.source === ue.source && l(ae) === l(ue)) && (G = g(ae)) === (ee = g(ue))) {
+            if ((G || ee) && C(ae) !== C(ue))
               return !1;
-            if (!(ue.strict && O && O(ae) !== O(de) || (G = x(ae), ee = x(de), (G || ee) && G !== ee || (G = K(ae)) !== (ee = K(de))))) {
+            if (!(de.strict && O && O(ae) !== O(ue) || (G = x(ae), ee = x(ue), (G || ee) && G !== ee || (G = K(ae)) !== (ee = K(ue))))) {
               if (G || ee) {
-                if (ae.length !== de.length)
+                if (ae.length !== ue.length)
                   return !1;
                 for (Y = 0; Y < ae.length; Y++)
-                  if (ae[Y] !== de[Y])
+                  if (ae[Y] !== ue[Y])
                     return !1;
                 return !0;
               }
-              if ((G = m(ae)) === (ee = m(de))) {
+              if ((G = m(ae)) === (ee = m(ue))) {
                 if (G || ee)
-                  return y(ae) === y(de) && typeof Uint8Array == "function" && J(new Uint8Array(ae), new Uint8Array(de), ue, ne);
-                if ((G = b(ae)) === (ee = b(de))) {
+                  return y(ae) === y(ue) && typeof Uint8Array == "function" && J(new Uint8Array(ae), new Uint8Array(ue), de, ne);
+                if ((G = b(ae)) === (ee = b(ue))) {
                   if (G || ee)
-                    return S(ae) === S(de) && typeof Uint8Array == "function" && J(new Uint8Array(ae), new Uint8Array(de), ue, ne);
-                  if (typeof ae == typeof de) {
-                    var Se = _(ae), ve = _(de);
+                    return S(ae) === S(ue) && typeof Uint8Array == "function" && J(new Uint8Array(ae), new Uint8Array(ue), de, ne);
+                  if (typeof ae == typeof ue) {
+                    var Se = _(ae), ve = _(ue);
                     if (Se.length === ve.length) {
                       for (Se.sort(), ve.sort(), Y = Se.length - 1; 0 <= Y; Y--)
                         if (Se[Y] != ve[Y])
                           return !1;
                       for (Y = Se.length - 1; 0 <= Y; Y--)
-                        if (!J(ae[X = Se[Y]], de[X], ue, ne))
+                        if (!J(ae[X = Se[Y]], ue[X], de, ne))
                           return !1;
-                      if ((G = E(ae)) === (ee = E(de))) {
+                      if ((G = E(ae)) === (ee = E(ue))) {
                         if (G !== "Set" && ee !== "Set")
                           return G !== "Map" || ((Me, nt, Fe, De) => {
                             if (P(Me) !== P(nt))
@@ -23293,8 +23269,8 @@ otherCic = `).concat(A, "; type = ").concat(z, "; common = ").concat(I);
                               return A(Je) === 0;
                             }
                             return !0;
-                          })(ae, de, ue, ne);
-                        var ge = ae, Te = de, ce = ue, re = ne;
+                          })(ae, ue, de, ne);
+                        var ge = ae, Te = ue, ce = de, re = ne;
                         if (A(ge) !== A(Te))
                           return !1;
                         for (var fe, le, ke, Oe = u(ge), Ce = u(Te); (fe = Oe.next()) && !fe.done; )
@@ -23946,42 +23922,42 @@ otherCic = `).concat(A, "; type = ").concat(z, "; common = ").concat(I);
       return !1;
     };
   }, { "call-bind/callBound": 82, "get-intrinsic": 93 }], 119: [function(e, s, o) {
-    var r = typeof Map == "function" && Map.prototype, a = Object.getOwnPropertyDescriptor && r ? Object.getOwnPropertyDescriptor(Map.prototype, "size") : null, l = r && a && typeof a.get == "function" ? a.get : null, i = r && Map.prototype.forEach, u = (a = typeof Set == "function" && Set.prototype, r = Object.getOwnPropertyDescriptor && a ? Object.getOwnPropertyDescriptor(Set.prototype, "size") : null, a && r && typeof r.get == "function" ? r.get : null), d = a && Set.prototype.forEach, p = typeof WeakMap == "function" && WeakMap.prototype ? WeakMap.prototype.has : null, f = typeof WeakSet == "function" && WeakSet.prototype ? WeakSet.prototype.has : null, h = typeof WeakRef == "function" && WeakRef.prototype ? WeakRef.prototype.deref : null, m = Boolean.prototype.valueOf, g = Object.prototype.toString, v = Function.prototype.toString, b = String.prototype.match, _ = String.prototype.slice, w = String.prototype.replace, E = String.prototype.toUpperCase, x = String.prototype.toLowerCase, y = RegExp.prototype.test, S = Array.prototype.concat, C = Array.prototype.join, O = Array.prototype.slice, F = Math.floor, B = typeof BigInt == "function" ? BigInt.prototype.valueOf : null, M = Object.getOwnPropertySymbols, L = typeof Symbol == "function" && typeof Symbol.iterator == "symbol" ? Symbol.prototype.toString : null, P = typeof Symbol == "function" && typeof Symbol.iterator == "object", T = typeof Symbol == "function" && Symbol.toStringTag ? Symbol.toStringTag : null, N = Object.prototype.propertyIsEnumerable, D = (typeof Reflect == "function" ? Reflect : Object).getPrototypeOf || ([].__proto__ === Array.prototype ? function(ue) {
-      return ue.__proto__;
+    var r = typeof Map == "function" && Map.prototype, a = Object.getOwnPropertyDescriptor && r ? Object.getOwnPropertyDescriptor(Map.prototype, "size") : null, l = r && a && typeof a.get == "function" ? a.get : null, i = r && Map.prototype.forEach, u = (a = typeof Set == "function" && Set.prototype, r = Object.getOwnPropertyDescriptor && a ? Object.getOwnPropertyDescriptor(Set.prototype, "size") : null, a && r && typeof r.get == "function" ? r.get : null), d = a && Set.prototype.forEach, p = typeof WeakMap == "function" && WeakMap.prototype ? WeakMap.prototype.has : null, f = typeof WeakSet == "function" && WeakSet.prototype ? WeakSet.prototype.has : null, h = typeof WeakRef == "function" && WeakRef.prototype ? WeakRef.prototype.deref : null, m = Boolean.prototype.valueOf, g = Object.prototype.toString, v = Function.prototype.toString, b = String.prototype.match, _ = String.prototype.slice, w = String.prototype.replace, E = String.prototype.toUpperCase, x = String.prototype.toLowerCase, y = RegExp.prototype.test, S = Array.prototype.concat, C = Array.prototype.join, O = Array.prototype.slice, F = Math.floor, B = typeof BigInt == "function" ? BigInt.prototype.valueOf : null, M = Object.getOwnPropertySymbols, L = typeof Symbol == "function" && typeof Symbol.iterator == "symbol" ? Symbol.prototype.toString : null, P = typeof Symbol == "function" && typeof Symbol.iterator == "object", T = typeof Symbol == "function" && Symbol.toStringTag ? Symbol.toStringTag : null, N = Object.prototype.propertyIsEnumerable, D = (typeof Reflect == "function" ? Reflect : Object).getPrototypeOf || ([].__proto__ === Array.prototype ? function(de) {
+      return de.__proto__;
     } : null);
-    function A(ue, ne) {
-      if (ue === 1 / 0 || ue === -1 / 0 || ue != ue || ue && -1e3 < ue && ue < 1e3 || y.call(/e/, ne))
+    function A(de, ne) {
+      if (de === 1 / 0 || de === -1 / 0 || de != de || de && -1e3 < de && de < 1e3 || y.call(/e/, ne))
         return ne;
       var Se = /[0-9](?=(?:[0-9]{3})+(?![0-9]))/g;
-      if (typeof ue == "number") {
-        var ve = ue < 0 ? -F(-ue) : F(ue);
-        if (ve !== ue)
-          return ue = String(ve), ve = _.call(ne, ue.length + 1), w.call(ue, Se, "$&_") + "." + w.call(w.call(ve, /([0-9]{3})/g, "$&_"), /_$/, "");
+      if (typeof de == "number") {
+        var ve = de < 0 ? -F(-de) : F(de);
+        if (ve !== de)
+          return de = String(ve), ve = _.call(ne, de.length + 1), w.call(de, Se, "$&_") + "." + w.call(w.call(ve, /([0-9]{3})/g, "$&_"), /_$/, "");
       }
       return w.call(ne, Se, "$&_");
     }
     var z = e("./util.inspect"), I = R(r = z.custom) ? r : null;
-    function H(ue, ne, Se) {
-      return (Se = (Se.quoteStyle || ne) === "double" ? '"' : "'") + ue + Se;
+    function H(de, ne, Se) {
+      return (Se = (Se.quoteStyle || ne) === "double" ? '"' : "'") + de + Se;
     }
-    function J(ue) {
-      return !(U(ue) !== "[object Array]" || T && typeof ue == "object" && T in ue);
+    function J(de) {
+      return !(U(de) !== "[object Array]" || T && typeof de == "object" && T in de);
     }
-    function K(ue) {
-      return !(U(ue) !== "[object RegExp]" || T && typeof ue == "object" && T in ue);
+    function K(de) {
+      return !(U(de) !== "[object RegExp]" || T && typeof de == "object" && T in de);
     }
-    function R(ue) {
+    function R(de) {
       if (P)
-        return ue && typeof ue == "object" && ue instanceof Symbol;
-      if (typeof ue == "symbol")
+        return de && typeof de == "object" && de instanceof Symbol;
+      if (typeof de == "symbol")
         return 1;
-      if (ue && typeof ue == "object" && L)
+      if (de && typeof de == "object" && L)
         try {
-          return L.call(ue), 1;
+          return L.call(de), 1;
         } catch {
         }
     }
-    s.exports = function ue(ne, Se, ve, ge) {
+    s.exports = function de(ne, Se, ve, ge) {
       var Te = Se || {};
       if (W(Te, "quoteStyle") && Te.quoteStyle !== "single" && Te.quoteStyle !== "double")
         throw new TypeError('option "quoteStyle" must be "single" or "double"');
@@ -24029,10 +24005,10 @@ otherCic = `).concat(A, "; type = ").concat(z, "; common = ").concat(I);
       else if (0 <= Z(ge, ne))
         return "[Circular]";
       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);
+        return Be && (ge = O.call(ge)).push(Be), He ? (Be = { depth: Te.depth }, W(Te, "quoteStyle") && (Be.quoteStyle = Te.quoteStyle), de(je, Be, ve + 1, ge)) : de(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, Fe)).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 = ue(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)) {
@@ -24041,7 +24017,7 @@ 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, Fe), nt && !((je) => {
+        return ne.length === 0 ? "[]" : (fe = ue(ne, Fe), nt && !((je) => {
           for (var Be = 0; Be < je.length; Be++)
             if (0 <= Z(je[Be], `
 `))
@@ -24049,7 +24025,7 @@ otherCic = `).concat(A, "; type = ").concat(z, "; common = ").concat(I);
           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, 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), ", ") + " }";
+        return Oe = ue(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 });
@@ -24120,60 +24096,60 @@ otherCic = `).concat(A, "; type = ").concat(z, "; common = ").concat(I);
             return B.call(je), 1;
           } catch {
           }
-      })(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)));
+      })(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 = ue(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;
+    var q = Object.prototype.hasOwnProperty || function(de) {
+      return de in this;
     };
-    function W(ue, ne) {
-      return q.call(ue, ne);
+    function W(de, ne) {
+      return q.call(de, ne);
     }
-    function U(ue) {
-      return g.call(ue);
+    function U(de) {
+      return g.call(de);
     }
-    function Z(ue, ne) {
-      if (ue.indexOf)
-        return ue.indexOf(ne);
-      for (var Se = 0, ve = ue.length; Se < ve; Se++)
-        if (ue[Se] === ne)
+    function Z(de, ne) {
+      if (de.indexOf)
+        return de.indexOf(ne);
+      for (var Se = 0, ve = de.length; Se < ve; Se++)
+        if (de[Se] === ne)
           return Se;
       return -1;
     }
-    function Y(ue) {
-      var ne = { 8: "b", 9: "t", 10: "n", 12: "f", 13: "r" }[ue = ue.charCodeAt(0)];
-      return ne ? "\\" + ne : "\\x" + (ue < 16 ? "0" : "") + E.call(ue.toString(16));
+    function Y(de) {
+      var ne = { 8: "b", 9: "t", 10: "n", 12: "f", 13: "r" }[de = de.charCodeAt(0)];
+      return ne ? "\\" + ne : "\\x" + (de < 16 ? "0" : "") + E.call(de.toString(16));
     }
-    function X(ue) {
-      return "Object(" + ue + ")";
+    function X(de) {
+      return "Object(" + de + ")";
     }
-    function G(ue) {
-      return ue + " { ? }";
+    function G(de) {
+      return de + " { ? }";
     }
-    function ee(ue, ne, Se, ve) {
-      return ue + " (" + ne + ") {" + (ve ? ae(Se, ve) : C.call(Se, ", ")) + "}";
+    function ee(de, ne, Se, ve) {
+      return de + " (" + ne + ") {" + (ve ? ae(Se, ve) : C.call(Se, ", ")) + "}";
     }
-    function ae(ue, ne) {
+    function ae(de, ne) {
       var Se;
-      return ue.length === 0 ? "" : (Se = `
-` + ne.prev + ne.base) + C.call(ue, "," + Se) + `
+      return de.length === 0 ? "" : (Se = `
+` + ne.prev + ne.base) + C.call(de, "," + Se) + `
 ` + ne.prev;
     }
-    function de(ue, ne) {
-      var Se = J(ue), ve = [];
+    function ue(de, ne) {
+      var Se = J(de), ve = [];
       if (Se) {
-        ve.length = ue.length;
-        for (var ge = 0; ge < ue.length; ge++)
-          ve[ge] = W(ue, ge) ? ne(ue[ge], ue) : "";
+        ve.length = de.length;
+        for (var ge = 0; ge < de.length; ge++)
+          ve[ge] = W(de, ge) ? ne(de[ge], de) : "";
       }
-      var Te, ce = typeof M == "function" ? M(ue) : [];
+      var Te, ce = typeof M == "function" ? M(de) : [];
       if (P)
         for (var re = {}, fe = 0; fe < ce.length; fe++)
           re["$" + ce[fe]] = ce[fe];
-      for (Te in ue)
-        !W(ue, Te) || Se && String(Number(Te)) === Te && Te < ue.length || P && re["$" + Te] instanceof Symbol || (y.call(/[^\w$]/, Te) ? ve.push(ne(Te, ue) + ": " + ne(ue[Te], ue)) : ve.push(Te + ": " + ne(ue[Te], ue)));
+      for (Te in de)
+        !W(de, Te) || Se && String(Number(Te)) === Te && Te < de.length || P && re["$" + Te] instanceof Symbol || (y.call(/[^\w$]/, Te) ? ve.push(ne(Te, de) + ": " + ne(de[Te], de)) : ve.push(Te + ": " + ne(de[Te], de)));
       if (typeof M == "function")
         for (var le = 0; le < ce.length; le++)
-          N.call(ue, ce[le]) && ve.push("[" + ne(ce[le]) + "]: " + ne(ue[ce[le]], ue));
+          N.call(de, ce[le]) && ve.push("[" + ne(ce[le]) + "]: " + ne(de[ce[le]], de));
       return ve;
     }
   }, { "./util.inspect": 374 }], 120: [function(e, s, o) {
@@ -26667,22 +26643,22 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
                     S.mode = 14;
                     break;
                   case 1:
-                    de = ue = void 0;
-                    var de, ue = S;
+                    ue = de = void 0;
+                    var ue, de = S;
                     if (w) {
-                      for (b = new r.Buf32(512), _ = new r.Buf32(32), de = 0; de < 144; )
-                        ue.lens[de++] = 8;
-                      for (; de < 256; )
-                        ue.lens[de++] = 9;
-                      for (; de < 280; )
-                        ue.lens[de++] = 7;
-                      for (; de < 288; )
-                        ue.lens[de++] = 8;
-                      for (u(1, ue.lens, 0, 288, b, 0, ue.work, { bits: 9 }), de = 0; de < 32; )
-                        ue.lens[de++] = 5;
-                      u(2, ue.lens, 0, 32, _, 0, ue.work, { bits: 5 }), w = !1;
+                      for (b = new r.Buf32(512), _ = new r.Buf32(32), ue = 0; ue < 144; )
+                        de.lens[ue++] = 8;
+                      for (; ue < 256; )
+                        de.lens[ue++] = 9;
+                      for (; ue < 280; )
+                        de.lens[ue++] = 7;
+                      for (; ue < 288; )
+                        de.lens[ue++] = 8;
+                      for (u(1, de.lens, 0, 288, b, 0, de.work, { bits: 9 }), ue = 0; ue < 32; )
+                        de.lens[ue++] = 5;
+                      u(2, de.lens, 0, 32, _, 0, de.work, { bits: 5 }), w = !1;
                     }
-                    if (ue.lencode = b, ue.lenbits = 9, ue.distcode = _, ue.distbits = 5, S.mode = 20, y !== 6)
+                    if (de.lencode = b, de.lenbits = 9, de.distcode = _, de.distbits = 5, S.mode = 20, y !== 6)
                       break;
                     P >>>= 2, T -= 2;
                     break e;
@@ -27066,14 +27042,14 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
       L(W, 256, U);
     }
     function H(W, U) {
-      var Z, Y, X, G = U.dyn_tree, ee = U.stat_desc.static_tree, ae = U.stat_desc.has_stree, de = U.stat_desc.elems, ue = -1;
-      for (W.heap_len = 0, W.heap_max = 573, Z = 0; Z < de; Z++)
-        G[2 * Z] !== 0 ? (W.heap[++W.heap_len] = ue = Z, W.depth[Z] = 0) : G[2 * Z + 1] = 0;
+      var Z, Y, X, G = U.dyn_tree, ee = U.stat_desc.static_tree, ae = U.stat_desc.has_stree, ue = U.stat_desc.elems, de = -1;
+      for (W.heap_len = 0, W.heap_max = 573, Z = 0; Z < ue; Z++)
+        G[2 * Z] !== 0 ? (W.heap[++W.heap_len] = de = Z, W.depth[Z] = 0) : G[2 * Z + 1] = 0;
       for (; W.heap_len < 2; )
-        G[2 * (X = W.heap[++W.heap_len] = ue < 2 ? ++ue : 0)] = 1, W.depth[X] = 0, W.opt_len--, ae && (W.static_len -= ee[2 * X + 1]);
-      for (U.max_code = ue, Z = W.heap_len >> 1; 1 <= Z; Z--)
+        G[2 * (X = W.heap[++W.heap_len] = de < 2 ? ++de : 0)] = 1, W.depth[X] = 0, W.opt_len--, ae && (W.static_len -= ee[2 * X + 1]);
+      for (U.max_code = de, Z = W.heap_len >> 1; 1 <= Z; Z--)
         z(W, G, Z);
-      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; )
+      for (X = ue; 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, Fe = 0; Fe <= h; Fe++)
@@ -27089,23 +27065,23 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           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);
+      T(G, de, W.bl_count);
     }
     function J(W, U, Z) {
-      var Y, X, G = -1, ee = U[1], ae = 0, de = 7, ue = 4;
-      for (ee === 0 && (de = 138, ue = 3), U[2 * (Z + 1) + 1] = 65535, Y = 0; Y <= Z; Y++)
-        X = ee, ee = U[2 * (Y + 1) + 1], ++ae < de && X === ee || (ae < ue ? W.bl_tree[2 * X] += ae : X !== 0 ? (X !== G && W.bl_tree[2 * X]++, W.bl_tree[32]++) : ae <= 10 ? W.bl_tree[34]++ : W.bl_tree[36]++, G = X, ue = (ae = 0) === ee ? (de = 138, 3) : X === ee ? (de = 6, 3) : (de = 7, 4));
+      var Y, X, G = -1, ee = U[1], ae = 0, ue = 7, de = 4;
+      for (ee === 0 && (ue = 138, de = 3), U[2 * (Z + 1) + 1] = 65535, Y = 0; Y <= Z; Y++)
+        X = ee, ee = U[2 * (Y + 1) + 1], ++ae < ue && X === ee || (ae < de ? W.bl_tree[2 * X] += ae : X !== 0 ? (X !== G && W.bl_tree[2 * X]++, W.bl_tree[32]++) : ae <= 10 ? W.bl_tree[34]++ : W.bl_tree[36]++, G = X, de = (ae = 0) === ee ? (ue = 138, 3) : X === ee ? (ue = 6, 3) : (ue = 7, 4));
     }
     function K(W, U, Z) {
-      var Y, X, G = -1, ee = U[1], ae = 0, de = 7, ue = 4;
-      for (ee === 0 && (de = 138, ue = 3), Y = 0; Y <= Z; Y++)
-        if (X = ee, ee = U[2 * (Y + 1) + 1], !(++ae < de && X === ee)) {
-          if (ae < ue)
+      var Y, X, G = -1, ee = U[1], ae = 0, ue = 7, de = 4;
+      for (ee === 0 && (ue = 138, de = 3), Y = 0; Y <= Z; Y++)
+        if (X = ee, ee = U[2 * (Y + 1) + 1], !(++ae < ue && X === ee)) {
+          if (ae < de)
             for (; L(W, X, W.bl_tree), --ae != 0; )
               ;
           else
             X !== 0 ? (X !== G && (L(W, X, W.bl_tree), ae--), L(W, 16, W.bl_tree), M(W, ae - 3, 2)) : ae <= 10 ? (L(W, 17, W.bl_tree), M(W, ae - 3, 3)) : (L(W, 18, W.bl_tree), M(W, ae - 11, 7));
-          G = X, ue = (ae = 0) === ee ? (de = 138, 3) : X === ee ? (de = 6, 3) : (de = 7, 4);
+          G = X, de = (ae = 0) === ee ? (ue = 138, 3) : X === ee ? (ue = 6, 3) : (ue = 7, 4);
         }
     }
     a(S);
@@ -27162,10 +27138,10 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         M(W, 2 + (Y ? 1 : 0), 3), I(W, _, w);
       else {
         M(W, 4 + (Y ? 1 : 0), 3);
-        var ae, de = W, ue = (U = W.l_desc.max_code + 1, Z = W.d_desc.max_code + 1, ee + 1);
-        for (M(de, U - 257, 5), M(de, Z - 1, 5), M(de, ue - 4, 4), ae = 0; ae < ue; ae++)
-          M(de, de.bl_tree[2 * b[ae] + 1], 3);
-        K(de, de.dyn_ltree, U - 1), K(de, de.dyn_dtree, Z - 1), I(W, W.dyn_ltree, W.dyn_dtree);
+        var ae, ue = W, de = (U = W.l_desc.max_code + 1, Z = W.d_desc.max_code + 1, ee + 1);
+        for (M(ue, U - 257, 5), M(ue, Z - 1, 5), M(ue, de - 4, 4), ae = 0; ae < de; ae++)
+          M(ue, ue.bl_tree[2 * b[ae] + 1], 3);
+        K(ue, ue.dyn_ltree, U - 1), K(ue, ue.dyn_dtree, Z - 1), I(W, W.dyn_ltree, W.dyn_dtree);
       }
       N(W), Y && D(W);
     }, o._tr_tally = function(W, U, Z) {
@@ -27622,10 +27598,10 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
   }, { "../com/log.js": 220, "../com/util.js": 221, "@babel/runtime/helpers/interopRequireDefault": 149, "@babel/runtime/helpers/typeof": 153, "deep-equal": 173, extend: 175 }], 223: [function(e, s, o) {
     var r, a = (r = e("@babel/runtime/helpers/interopRequireDefault"))(e("@babel/runtime/helpers/typeof")), l = r(e("@babel/runtime/helpers/toConsumableArray")), i = e("../com/log.js").ins, u = (r = e("../com/util.js")).clone, d = r.logClone, p = e("fast-deep-equal"), f = e("../../../codox-shared/src/dtf/dtf.js").cp, h = (r = e("../com/lib.js")).io2qoLex;
     function m(G) {
-      for (var ee = null, ae = null, de = 0; de < G.p.length; de++) {
-        var ue = G.p[de];
-        if (typeof ue == "string" && ue.search(/^codoxVP-/) == 0)
-          return { vpId: ee = ue.replace(/^codoxVP-/, ""), vpIndex: ae = de };
+      for (var ee = null, ae = null, ue = 0; ue < G.p.length; ue++) {
+        var de = G.p[ue];
+        if (typeof de == "string" && de.search(/^codoxVP-/) == 0)
+          return { vpId: ee = de.replace(/^codoxVP-/, ""), vpIndex: ae = ue };
       }
       return { vpId: ee, vpIndex: ae };
     }
@@ -27633,13 +27609,13 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
       var ae;
       ee.li !== void 0 && ee.ld == null ? R(ee.p, G.p) && M(G.p, ee) : ee.ld !== void 0 && ee.li == null ? q(ee.p, G.p) && P(G.p, ee) : ee.lm !== void 0 && (ae = F(ee), q(ee.p, G.p) && !R(ae, G.p) ? T(G.p, ee.p.length - 1) : R(ae, G.p) && !q(ee.p, G.p) && L(G.p, ae.length - 1));
     }
-    function v(G, ee, ae, de) {
-      var ue = m(G), ne = ue.vpId, Se = ue.vpIndex;
+    function v(G, ee, ae, ue) {
+      var de = m(G), ne = de.vpId, Se = de.vpIndex;
       if (ne !== null) {
         for (var ve = u(G), ge = ae; 0 <= ge; ge--) {
           var Te = ee[ge];
           if (Te.cop !== void 0) {
-            if (b(ve, Te, ne, Se, de))
+            if (b(ve, Te, ne, Se, ue))
               return i(ve), 1;
           } else
             g(ve, Te);
@@ -27647,7 +27623,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         return i(ve), 0;
       }
     }
-    function b(G, ee, ae, de, ue) {
+    function b(G, ee, ae, ue, de) {
       if (ee.cop != null)
         return (ee = ((ne, Se) => {
           for (var ve = 0; ve < ne.length; ve++) {
@@ -27656,43 +27632,43 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
               return ge.sx.embedNode;
           }
           return null;
-        })(ee.cop, ae)) != null && (G.p = G.p.slice(de + 1), G = h([G]), ue.jot.type.apply(ee, G), 1);
+        })(ee.cop, ae)) != null && (G.p = G.p.slice(ue + 1), G = h([G]), de.jot.type.apply(ee, G), 1);
     }
-    function _(G, ee, ae, de) {
-      for (var ue = u(G), ne = ae; 0 <= ne; ne--) {
+    function _(G, ee, ae, ue) {
+      for (var de = u(G), ne = ae; 0 <= ne; ne--) {
         var Se = ee[ne];
         if (Se.li !== void 0) {
-          if (H(Se.p, ue.p))
-            return w(ue, Se, de), i(ue), i(Se), 1;
-          Se.ld == null && R(Se.p, ue.p) && M(ue.p, Se);
+          if (H(Se.p, de.p))
+            return w(de, Se, ue), i(de), i(Se), 1;
+          Se.ld == null && R(Se.p, de.p) && M(de.p, Se);
         } else
-          g(ue, Se);
+          g(de, Se);
       }
       return i(G), 0;
     }
     function w(G, ee, ae) {
       i(G), i(ee);
-      var de = G.p[ee.p.length - 1] - ee.p[ee.p.length - 1];
-      i(de), de = ee.liObj !== void 0 ? ee.liObj[de] : ee.li, i(de), G.p.length == ee.p.length ? G.p = ["children", 0] : G.p.splice(0, ee.p.length), G = h([G]), i(G), ae.jot.type.apply(de, G), i(de);
+      var ue = G.p[ee.p.length - 1] - ee.p[ee.p.length - 1];
+      i(ue), ue = ee.liObj !== void 0 ? ee.liObj[ue] : ee.li, i(ue), G.p.length == ee.p.length ? G.p = ["children", 0] : G.p.splice(0, ee.p.length), G = h([G]), i(G), ae.jot.type.apply(ue, G), i(ue);
     }
-    function E(G, ee, ae, de, ue) {
-      A(G) ? (w(G, ee, ue), i(ee)) : (de.splice(ae + 1, 0, G), i(de));
+    function E(G, ee, ae, ue, de) {
+      A(G) ? (w(G, ee, de), i(ee)) : (ue.splice(ae + 1, 0, G), i(ue));
     }
     function x(G, ee, ae) {
-      var de, ue, ne, Se, ve;
-      i(G), i(ee), Se = G, (ve = ee).ld !== void 0 && ve.li !== void 0 || (ve.li !== void 0 && ve.ld == null ? (ue = ve, (de = Se).lm !== void 0 && (C(de), ne = F(de), q(ue.p, ne)) && (ne[ue.p.length - 1], M(ne, ue, de), B(de, ne)), q(ue.p, de.p) && (de.p[ue.p.length - 1], de.li !== void 0 ? M(de.p, ue, de) : M(de.p, ue)), de.lm !== void 0 && O(de)) : ve.ld !== void 0 && ve.li == null ? (ue = ve, (ne = Se).lm !== void 0 && (C(ne), de = F(ne), R(ue.p, de)) && (ue.ldLen !== void 0 && ue.ldLen, P(de, ue), B(ne, de)), R(ue.p, ne.p) && (ue.ldLen !== void 0 && ue.ldLen, P(ne.p, ue)), ne.lm !== void 0 && O(ne)) : ve.lm !== void 0 && (z(ve) ? i(ve) : S(Se, ve))), y(ee, G, ae), i(G), i(ee);
+      var ue, de, ne, Se, ve;
+      i(G), i(ee), Se = G, (ve = ee).ld !== void 0 && ve.li !== void 0 || (ve.li !== void 0 && ve.ld == null ? (de = ve, (ue = Se).lm !== void 0 && (C(ue), ne = F(ue), q(de.p, ne)) && (ne[de.p.length - 1], M(ne, de, ue), B(ue, ne)), q(de.p, ue.p) && (ue.p[de.p.length - 1], ue.li !== void 0 ? M(ue.p, de, ue) : M(ue.p, de)), ue.lm !== void 0 && O(ue)) : ve.ld !== void 0 && ve.li == null ? (de = ve, (ne = Se).lm !== void 0 && (C(ne), ue = F(ne), R(de.p, ue)) && (de.ldLen !== void 0 && de.ldLen, P(ue, de), B(ne, ue)), R(de.p, ne.p) && (de.ldLen !== void 0 && de.ldLen, P(ne.p, de)), ne.lm !== void 0 && O(ne)) : ve.lm !== void 0 && (z(ve) ? i(ve) : S(Se, ve))), y(ee, G, ae), i(G), i(ee);
     }
     function y(G, ee, ae) {
-      var de = [G], ue = ee = [ee];
-      ue = G.li !== void 0 && G.ld == null || G.lm !== void 0 && R(F(G), G.p) ? ae.jot.type.transform(de, ee, 0) : ae.jot.type.transform(de, ee, 1), G.lm !== void 0 ? (i(ue), G.p = ue[0].p, G.lm = ue[0].lm) : (G.cop !== void 0 || G.ld !== void 0 && G.li !== void 0 || G.ld !== void 0 && G.li == null || G.li !== void 0 && G.ld == null || G.od !== void 0 && G.oi == null || G.oi !== void 0 && G.od == null || G.oi !== void 0 && G.od !== void 0 || G.na !== void 0 || i(G), i(ue), G.p = ue[0].p);
+      var ue = [G], de = ee = [ee];
+      de = G.li !== void 0 && G.ld == null || G.lm !== void 0 && R(F(G), G.p) ? ae.jot.type.transform(ue, ee, 0) : ae.jot.type.transform(ue, ee, 1), G.lm !== void 0 ? (i(de), G.p = de[0].p, G.lm = de[0].lm) : (G.cop !== void 0 || G.ld !== void 0 && G.li !== void 0 || G.ld !== void 0 && G.li == null || G.li !== void 0 && G.ld == null || G.od !== void 0 && G.oi == null || G.oi !== void 0 && G.od == null || G.oi !== void 0 && G.od !== void 0 || G.na !== void 0 || i(G), i(de), G.p = de[0].p);
     }
     function S(G, ee) {
       function ae(ce, re, fe, le) {
         var ke = 0;
         R(ce, fe) && !q(re, fe) ? (0 < fe[ce.length - 1] && ke--, L(fe, ce.length - 1, G), "ET_LmPath (".concat(le, "-1): lmPath < path && lmopP !<= path; lmPath decremented path = ")) : !R(ce, fe) && q(re, fe) ? (ke++, T(fe, re.length - 1), "ET_LmPath (".concat(le, "-2): lmPath !< path && lmopP <= path; lmopP incremented path = ")) : "ET_LmPath (".concat(le, "-3): (lmPath < path && lmopP <= path) || (lmPath !< path && lmopP !<= path); no change to path = "), i(fe);
       }
-      var de, ue, ne, Se, ve, ge, Te = F(ee);
-      G.lm !== void 0 && (C(G), i(G), ge = (de = F(G)).slice(ee.p.length), Te.length < de.length ? H(Te, de) ? (de = ee.p.concat(ge), i(de)) : ae(Te, ee.p, de, "ET_LmLm; same-level") : (ge = Te, ue = ee.p, Se = "ET_LmLm; same-level", ve = 0, R(ge, ne = de) && !R(ue, ne) ? (0 < ne[ge.length - 1] && ve--, L(ne, ge.length - 1, G), "ET_LmPathL (".concat(Se, "-1): lmPath < path && lmopP !< path; lmPath decremented path = ")) : !R(ge, ne) && R(ue, ne) ? (ve++, T(ne, ue.length - 1), "ET_LmPathL (".concat(Se, "-2): lmPath !< path && lmopP < path; lmopP incremented path = ")) : "ET_LmPathL (".concat(Se, "-3): (lmPath < path && lmopP < path) || (lmPath !< path && lmopP !< path); no change to path = "), i(ne), "ET_LmPathL (".concat(Se, "-out): path changed by ").concat(ve)), B(G, de)), ee.p.length < G.p.length ? H(Te, G.p) ? (ge = G.p.slice(ee.p.length), G.p = ee.p.concat(ge), i(G.p)) : ae(Te, ee.p, G.p, "ET_OpLm; diff-level") : ae(Te, ee.p, G.p, "ET_OpLm; same-level"), G.lm !== void 0 && O(G), i(G);
+      var ue, de, ne, Se, ve, ge, Te = F(ee);
+      G.lm !== void 0 && (C(G), i(G), ge = (ue = F(G)).slice(ee.p.length), Te.length < ue.length ? H(Te, ue) ? (ue = ee.p.concat(ge), i(ue)) : ae(Te, ee.p, ue, "ET_LmLm; same-level") : (ge = Te, de = ee.p, Se = "ET_LmLm; same-level", ve = 0, R(ge, ne = ue) && !R(de, ne) ? (0 < ne[ge.length - 1] && ve--, L(ne, ge.length - 1, G), "ET_LmPathL (".concat(Se, "-1): lmPath < path && lmopP !< path; lmPath decremented path = ")) : !R(ge, ne) && R(de, ne) ? (ve++, T(ne, de.length - 1), "ET_LmPathL (".concat(Se, "-2): lmPath !< path && lmopP < path; lmopP incremented path = ")) : "ET_LmPathL (".concat(Se, "-3): (lmPath < path && lmopP < path) || (lmPath !< path && lmopP !< path); no change to path = "), i(ne), "ET_LmPathL (".concat(Se, "-out): path changed by ").concat(ve)), B(G, ue)), ee.p.length < G.p.length ? H(Te, G.p) ? (ge = G.p.slice(ee.p.length), G.p = ee.p.concat(ge), i(G.p)) : ae(Te, ee.p, G.p, "ET_OpLm; diff-level") : ae(Te, ee.p, G.p, "ET_OpLm; same-level"), G.lm !== void 0 && O(G), i(G);
     }
     function C(G) {
       var ee = F(G);
@@ -27718,22 +27694,22 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         throw new Error("ESTOP: path must be array");
       if ((0, a.default)(ee) !== "object" || ee.p == null || !Array.isArray(ee.p) || ee.ld == null && ee.li == null)
         throw new Error("ESTOP: op must be an op of either ld or li ");
-      var de = ee.p.length - 1;
-      if (de < 0 || de > G.length - 1)
-        throw new Error("ESTOP: invalid idx=" + de + "; plen=" + G.length);
-      var ue = (0, a.default)(G[de]);
-      if (ue !== "number")
-        throw new Error("ESTOP: invalid type=" + ue);
-      ue = 1, ee.liObj !== void 0 ? ue = ee.liObj.length : ee.ldLen !== void 0 && (ue = ee.ldLen), G[de], G[de] >= ue ? (G[de] -= ue, ae !== void 0 && U(ae, ue)) : i(G);
+      var ue = ee.p.length - 1;
+      if (ue < 0 || ue > G.length - 1)
+        throw new Error("ESTOP: invalid idx=" + ue + "; plen=" + G.length);
+      var de = (0, a.default)(G[ue]);
+      if (de !== "number")
+        throw new Error("ESTOP: invalid type=" + de);
+      de = 1, ee.liObj !== void 0 ? de = ee.liObj.length : ee.ldLen !== void 0 && (de = ee.ldLen), G[ue], G[ue] >= de ? (G[ue] -= de, ae !== void 0 && U(ae, de)) : i(G);
     }
     function L(G, ee, ae) {
       if (!Array.isArray(G))
         throw new Error("ESTOP: path must be array");
       if (ee < 0 || ee > G.length - 1)
         throw new Error("ESTOP: invalid idx=" + ee + "; plen=" + G.length);
-      var de = (0, a.default)(G[ee]);
-      if (de !== "number")
-        throw new Error("ESTOP: invalid type=" + de);
+      var ue = (0, a.default)(G[ee]);
+      if (ue !== "number")
+        throw new Error("ESTOP: invalid type=" + ue);
       0 < G[ee] ? (G[ee]--, ae !== void 0 && U(ae, 1)) : i(G);
     }
     function P(G, ee) {
@@ -27744,10 +27720,10 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
       var ae = ee.p.length - 1;
       if (ae < 0 || ae > G.length - 1)
         throw new Error("ESTOP: invalid idx=" + ae + "; plen=" + G.length);
-      var de = (0, a.default)(G[ae]);
-      if (de !== "number")
-        throw new Error("ESTOP: invalid type=" + de);
-      de = 1, ee.liObj !== void 0 ? de = ee.liObj.length : ee.ldLen !== void 0 && (de = ee.ldLen), G[ae], G[ae] += de;
+      var ue = (0, a.default)(G[ae]);
+      if (ue !== "number")
+        throw new Error("ESTOP: invalid type=" + ue);
+      ue = 1, ee.liObj !== void 0 ? ue = ee.liObj.length : ee.ldLen !== void 0 && (ue = ee.ldLen), G[ae], G[ae] += ue;
     }
     function T(G, ee) {
       if (!Array.isArray(G))
@@ -27772,8 +27748,8 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
       return G != null && (A(G) ? G.p[G.p.length - 1] == G.lm : I(G.p, G.lm)) && (G.ic == null || G.ic == 0);
     }
     function I(G, ee) {
-      var ae = Array.isArray(G), de = Array.isArray(ee);
-      return !(!ae || !de) && G.length === ee.length && J(G, ee, G.length);
+      var ae = Array.isArray(G), ue = Array.isArray(ee);
+      return !(!ae || !ue) && G.length === ee.length && J(G, ee, G.length);
     }
     function H(G, ee) {
       if (Array.isArray(G) && Array.isArray(ee))
@@ -27785,8 +27761,8 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         throw new Error("ESTOP: invalid p1/p2 in equalPrefix");
       if (ae > G.length || ae > ee.length)
         return G.length, ee.length, !1;
-      for (var de = 0; de < ae; de++)
-        if (G[de] !== ee[de])
+      for (var ue = 0; ue < ae; ue++)
+        if (G[ue] !== ee[ue])
           return !1;
       return !0;
     }
@@ -27820,16 +27796,16 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
       if (!Array.isArray(G))
         throw new Error("ESTOP: clog must be array in compressEqualLms");
       if (ae.lm != null && A(ae)) {
-        var de = ae.p.length - 1, ue = Math.abs(ae.lm - ae.p[de]);
-        if (i(ae), i(G), ue - 1 <= ee) {
+        var ue = ae.p.length - 1, de = Math.abs(ae.lm - ae.p[ue]);
+        if (i(ae), i(G), de - 1 <= ee) {
           var ne = ee;
-          for (de = ue; ue && !(ne < 0) && G[ne].lm != null && ((Se, ve) => {
+          for (ue = de; de && !(ne < 0) && G[ne].lm != null && ((Se, ve) => {
             var ge, Te;
             return Se != null && ve != null && (ge = F(Se), Te = F(ve), I(Se.p, ve.p)) && I(ge, Te);
           })(G[ne], ae); )
-            ne--, ue--;
-          if (ue == 0)
-            return G.splice(ee - de + 1, de), i(G), de;
+            ne--, de--;
+          if (de == 0)
+            return G.splice(ee - ue + 1, ue), i(G), ue;
         }
       }
       return 0;
@@ -27837,35 +27813,35 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
     function Y(G) {
       if (!Array.isArray(G))
         throw new Error("ESTOP: input must be array in compressRedundency");
-      for (var ee, ae, de, ue = G.length - 1; 0 <= ue; ue--) {
-        var ne = G[ue];
+      for (var ee, ae, ue, de = G.length - 1; 0 <= de; de--) {
+        var ne = G[de];
         if (ne.lm !== void 0)
           if (z(ne))
-            i(ne), G.splice(ue, 1), 2 <= G.length && G[ue] !== void 0 && G[ue].lm !== void 0 && G[ue - 1] !== void 0 && G[ue - 1].lm !== void 0 && X(G[ue], G[ue - 1]) && (i(G[ue]), i(G[ue - 1]), G.splice(ue - 1, 2), ue -= 2);
+            i(ne), G.splice(de, 1), 2 <= G.length && G[de] !== void 0 && G[de].lm !== void 0 && G[de - 1] !== void 0 && G[de - 1].lm !== void 0 && X(G[de], G[de - 1]) && (i(G[de]), i(G[de - 1]), G.splice(de - 1, 2), de -= 2);
           else {
-            if (0 <= ue - 1) {
-              var Se = Z(G, ue - 1, ne);
+            if (0 <= de - 1) {
+              var Se = Z(G, de - 1, ne);
               if (0 < Se) {
-                ue -= Se, G.splice(ue, 1), i(G);
+                de -= Se, G.splice(de, 1), i(G);
                 continue;
               }
             }
-            if (!(1 <= ue && G[ue - 1].lm !== void 0)) {
-              if (1 <= ue) {
-                i(G[ue - 1]), i(ne), ue--;
+            if (!(1 <= de && G[de - 1].lm !== void 0)) {
+              if (1 <= de) {
+                i(G[de - 1]), i(ne), de--;
                 continue;
               }
               return void i(G);
             }
-            X(ne, G[ue - 1]) ? (i(ne), i(G[ue - 1]), G.splice(ue - 1, 2), ue--) : (Se = G[ue - 1], de = ae = void 0, (ee = ne).lm == null || Se.lm == null || (ae = F(ee), de = F(Se), !I(ee.p, de)) || I(Se.p, ae) || (B(Se, ae), 0) || (i(ne), i(G[ue - 1]), G.splice(ue, 1)));
+            X(ne, G[de - 1]) ? (i(ne), i(G[de - 1]), G.splice(de - 1, 2), de--) : (Se = G[de - 1], ue = ae = void 0, (ee = ne).lm == null || Se.lm == null || (ae = F(ee), ue = F(Se), !I(ee.p, ue)) || I(Se.p, ae) || (B(Se, ae), 0) || (i(ne), i(G[de - 1]), G.splice(de, 1)));
           }
       }
       i(G);
     }
     function X(G, ee) {
-      var ae, de;
+      var ae, ue;
       if (G.lm != null && ee.lm != null)
-        return ae = F(G), de = F(ee), I(G.p, de) && I(ee.p, ae) || K(G.p, ae) && I(G.p, ee.p) && I(de, ae) && Math.abs(G.p[G.p.length - 1] - ae[G.p.length - 1] == 1);
+        return ae = F(G), ue = F(ee), I(G.p, ue) && I(ee.p, ae) || K(G.p, ae) && I(G.p, ee.p) && I(ue, ae) && Math.abs(G.p[G.p.length - 1] - ae[G.p.length - 1] == 1);
     }
     s.exports = { cpj: function(G, ee, ae) {
       if (!Array.isArray(G))
@@ -27873,9 +27849,9 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
       if (!Array.isArray(ee))
         throw Error("ESTOP:composeJsOps ops array required");
       i(ee), i(G);
-      for (var de = 0; de < ee.length; de++) {
-        var ue = ee[de];
-        ue.ld !== void 0 && ue.li == null ? ((ne, Se, ve) => {
+      for (var ue = 0; ue < ee.length; ue++) {
+        var de = ee[ue];
+        de.ld !== void 0 && de.li == null ? ((ne, Se, ve) => {
           ne.length;
           for (var ge = !1, Te = ne.length - 1; 0 <= Te; Te--) {
             if (ne[Te].cop !== void 0 || ne[Te].oi !== void 0 || ne[Te].od !== void 0 || ne[Te].na !== void 0) {
@@ -27969,7 +27945,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
               return i(ne);
           }
           ne.unshift(Se), ne.length, i(ne);
-        })(G, ue, ae) : ue.li !== void 0 && ue.ld == null ? ((ne, Se, ve) => {
+        })(G, de, ae) : de.li !== void 0 && de.ld == null ? ((ne, Se, ve) => {
           ne.length;
           for (var ge = !1, Te = ne.length - 1; 0 <= Te; Te--) {
             var ce = ne[Te];
@@ -28015,7 +27991,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
               return i(ne);
           }
           ne.unshift(Se), ne.length, i(ne);
-        })(G, ue, ae) : ue.ld !== void 0 && ue.li !== void 0 ? ((ne, Se, ve) => {
+        })(G, de, ae) : de.ld !== void 0 && de.li !== void 0 ? ((ne, Se, ve) => {
           ne.length;
           for (var ge = !1, Te = ne.length - 1; 0 <= Te; Te--) {
             if (ne[Te].cop !== void 0 || ne[Te].oi !== void 0 || ne[Te].od !== void 0 || ne[Te].na !== void 0) {
@@ -28043,7 +28019,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
               return i(ne);
           }
           ne.unshift(Se), ne.length, i(ne);
-        })(G, ue, ae) : ue.lm !== void 0 ? ((ne, Se, ve) => {
+        })(G, de, ae) : de.lm !== void 0 ? ((ne, Se, ve) => {
           N(Se), ne.length, i(Se);
           for (var ge, Te = !1, ce = ne.length - 1; 0 <= ce; ce--) {
             if (z(Se))
@@ -28134,7 +28110,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
               return i(ne), Y(ne);
           }
           z(Se) || (N(Se), ne.unshift(Se)), ne.length, i(ne), Y(ne);
-        })(G, ue, ae) : ue.cop !== void 0 ? ((ne, Se, ve) => {
+        })(G, de, ae) : de.cop !== void 0 ? ((ne, Se, ve) => {
           ne.length;
           for (var ge, Te = function() {
             var re = ne[ce];
@@ -28147,7 +28123,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
             if ((ge = Te()) !== 0 && ge)
               return ge.v;
           Se.merged == null && (ne.unshift(Se), i(ne));
-        })(G, ue, ae) : ue.oi !== void 0 && ue.od !== void 0 ? ((ne, Se, ve) => {
+        })(G, de, ae) : de.oi !== void 0 && de.od !== void 0 ? ((ne, Se, ve) => {
           ne.length, i(Se);
           for (var ge = ne.length, Te = ne.length - 1; 0 <= Te; Te--) {
             var ce = ne[Te];
@@ -28186,7 +28162,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
               ge = Te;
           }
           ne.splice(ge, 0, Se), i(ne);
-        })(G, ue, ae) : ue.oi !== void 0 && ue.od == null ? ((ne, Se, ve) => {
+        })(G, de, ae) : de.oi !== void 0 && de.od == null ? ((ne, Se, ve) => {
           ne.length;
           for (var ge = ne.length, Te = ne.length - 1; 0 <= Te; Te--) {
             var ce = ne[Te];
@@ -28200,7 +28176,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
               ge = Te;
           }
           ne.splice(ge, 0, Se), i(ne);
-        })(G, ue, ae) : ue.od !== void 0 && ue.oi == null ? ((ne, Se, ve) => {
+        })(G, de, ae) : de.od !== void 0 && de.oi == null ? ((ne, Se, ve) => {
           ne.length;
           for (var ge = ne.length, Te = ne.length - 1; 0 <= Te; Te--) {
             var ce = ne[Te];
@@ -28214,7 +28190,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
               ge = Te;
           }
           ne.splice(ge, 0, Se), i(ne);
-        })(G, ue, ae) : ue.na !== void 0 ? ((ne, Se, ve) => {
+        })(G, de, ae) : de.na !== void 0 ? ((ne, Se, ve) => {
           ne.length;
           for (var ge = ne.length - 1; 0 <= ge; ge--) {
             var Te = ne[ge];
@@ -28226,17 +28202,17 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
               return i(Se);
           }
           ne.push(Se), ne.length, i(ne);
-        })(G, ue, ae) : (i(ue), G.push(ue));
+        })(G, de, ae) : (i(de), G.push(de));
       }
       return G;
     }, cpdl: function(G, ee, ae) {
       d(G), d(ee);
-      var de = [];
-      if ((de = 0 < G.length ? G[0].op : de).push.apply(de, (0, l.default)(ee.op)), de.length == 0)
+      var ue = [];
+      if ((ue = 0 < G.length ? G[0].op : ue).push.apply(ue, (0, l.default)(ee.op)), ue.length == 0)
         for (; G.length; )
           G.shift();
       else
-        G.length == 0 ? G.push({ op: de }) : G[0].op = de;
+        G.length == 0 ? G.push({ op: ue }) : G[0].op = ue;
       i(G);
     } };
   }, { "../../../codox-shared/src/dtf/dtf.js": 222, "../com/lib.js": 219, "../com/log.js": 220, "../com/util.js": 221, "@babel/runtime/helpers/interopRequireDefault": 149, "@babel/runtime/helpers/toConsumableArray": 152, "@babel/runtime/helpers/typeof": 153, "fast-deep-equal": 176 }], 224: [function(e, s, o) {
@@ -28434,11 +28410,11 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
             var Y = "A", X = U.op, G = { op: [] }, ee = G.op;
             if (O && (G.op = U.inverse), p()) {
               for (var ae = 0; ae < X.length; ae++) {
-                var de = X[ae];
-                switch ((0, a.default)(de)) {
+                var ue = X[ae];
+                switch ((0, a.default)(ue)) {
                   case E[1]:
-                    var ue = de.text;
-                    if (ue.length !== 0) {
+                    var de = ue.text;
+                    if (de.length !== 0) {
                       var ne = l(U), Se = -1, ve = void 0;
                       for (ve = D + 1; ve < Z.length; ve++) {
                         if (Z[ve].context.sid === U.context.sid) {
@@ -28447,14 +28423,14 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
                         }
                         h(ne, Z[ve]);
                       }
-                      Se !== -1 && ((0, a.default)(ne.op[0]) === E[2] && ne.op[0] === Z[ve].op[0] && u(ne) === "d" || (0, a.default)(ne.op[0]) !== E[2] && u(ne) === "d") && (Z[ve], Y = "B"), ee.push(ue);
+                      Se !== -1 && ((0, a.default)(ne.op[0]) === E[2] && ne.op[0] === Z[ve].op[0] && u(ne) === "d" || (0, a.default)(ne.op[0]) !== E[2] && u(ne) === "d") && (Z[ve], Y = "B"), ee.push(de);
                     }
                     break;
                   case E[0]:
-                    ee.push({ d: de.length, text: de });
+                    ee.push({ d: ue.length, text: ue });
                     break;
                   case E[2]:
-                    0 < ee.length && (0, a.default)(ee[ee.length - 1]) === E[2] ? (ee[ee.length - 1], ee[ee.length - 1] += de) : ee.push(de);
+                    0 < ee.length && (0, a.default)(ee[ee.length - 1]) === E[2] ? (ee[ee.length - 1], ee[ee.length - 1] += ue) : ee.push(ue);
                 }
               }
               d(ee);
@@ -28471,8 +28447,8 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
                 }
                 if (X.context.nopseq)
                   for (var ae = 0; ae < Z.length; ae++) {
-                    var de = Z[ae];
-                    if (X.context.sid === de.context.sid && X.context.nopseq === de.context.seq)
+                    var ue = Z[ae];
+                    if (X.context.sid === ue.context.sid && X.context.nopseq === ue.context.seq)
                       return;
                   }
                 return 1;
@@ -28485,19 +28461,19 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
               if (Y || console.error("codox_compensateInverse: capture an error -- domainid = ", logClone(U.context.dmid)), Y)
                 switch (u(Z)) {
                   case "dd":
-                    var X, G, ee = U, ae = Z, de = Y;
-                    return u(ee) === "d" ? (X = ee.op[ee.op.length - 1].text, G = z(ae), X === ae.op[ae.op.length - 1].text ? (A(de, ae, ee) === null && (ee.op = []), logClone(ee), ee) : X === G ? (ee.op = [], logClone(ee), ee) : void 0) : void 0;
+                    var X, G, ee = U, ae = Z, ue = Y;
+                    return u(ee) === "d" ? (X = ee.op[ee.op.length - 1].text, G = z(ae), X === ae.op[ae.op.length - 1].text ? (A(ue, ae, ee) === null && (ee.op = []), logClone(ee), ee) : X === G ? (ee.op = [], logClone(ee), ee) : void 0) : void 0;
                   case "di":
-                    var ue = U, ne = Z, Se = Y;
-                    switch (de = u(ue), u(ne), de) {
+                    var de = U, ne = Z, Se = Y;
+                    switch (ue = u(de), u(ne), ue) {
                       case "di":
-                        var ve = ne.op[ne.op.length - 1], ge = ue.op[ue.op.length - 1], Te = z(ne), ce = z(ue);
+                        var ve = ne.op[ne.op.length - 1], ge = de.op[de.op.length - 1], Te = z(ne), ce = z(de);
                         if (Te = Te.indexOf(ce), ve === ge && 0 < Te)
-                          return ue.op = [], logClone(ue), ue;
+                          return de.op = [], logClone(de), de;
                         break;
                       case "i":
-                        if ((ce = z(ne)).indexOf("<") === 0 && (Se.j, (ve = ue.op[ue.op.length - 1]) === ne.op[ne.op.length - 1]))
-                          return A(Se, ne, ue) === null && (ue.op = []), logClone(ue), ue;
+                        if ((ce = z(ne)).indexOf("<") === 0 && (Se.j, (ve = de.op[de.op.length - 1]) === ne.op[ne.op.length - 1]))
+                          return A(Se, ne, de) === null && (de.op = []), logClone(de), de;
                     }
                     return;
                 }
@@ -29804,15 +29780,15 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         return W !== q + ";" ? W.replace(F, " or ($1)").substring(4) : "(" + q + ")";
       }
       function p(R, q, W, U, Z, Y, X, G, ee, ae) {
-        for (var de, ue = 0, ne = q; ue < H; ++ue)
-          switch (de = I[ue].call(h, R, ne, W, U, Z, Y, X, G, ee, ae)) {
+        for (var ue, de = 0, ne = q; de < H; ++de)
+          switch (ue = I[de].call(h, R, ne, W, U, Z, Y, X, G, ee, ae)) {
             case void 0:
             case !1:
             case !0:
             case null:
               break;
             default:
-              ne = de;
+              ne = ue;
           }
         if (ne !== q)
           return ne;
@@ -29823,10 +29799,10 @@ 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, 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) {
+          for (var ae, ue, de, ne, Se, ve = 0, ge = 0, Te = 0, ce = 0, re = 0, fe = 0, le = de = ae = 0, ke = 0, Oe = 0, Ce = 0, Me = 0, nt = X.length, Fe = nt - 1, De = "", xe = "", Je = "", je = ""; ke < nt; ) {
+            if (ue = X.charCodeAt(ke), ke === Fe && ge + ce + Te + ve !== 0 && (ge !== 0 && (ue = 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) {
+                switch (ue) {
                   case 32:
                   case 9:
                   case 59:
@@ -29836,32 +29812,32 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
                   default:
                     De += X.charAt(ke);
                 }
-                de = 59;
+                ue = 59;
               }
-              switch (de) {
+              switch (ue) {
                 case 123:
-                  for (ae = (De = De.trim()).charCodeAt(0), ue = 1, Me = ++ke; ke < nt; ) {
-                    switch (de = X.charCodeAt(ke)) {
+                  for (ae = (De = De.trim()).charCodeAt(0), de = 1, Me = ++ke; ke < nt; ) {
+                    switch (ue = X.charCodeAt(ke)) {
                       case 123:
-                        ue++;
+                        de++;
                         break;
                       case 125:
-                        ue--;
+                        de--;
                         break;
                       case 47:
-                        switch (de = X.charCodeAt(ke + 1)) {
+                        switch (ue = X.charCodeAt(ke + 1)) {
                           case 42:
                           case 47:
                             e: {
                               for (le = ke + 1; le < Fe; ++le)
                                 switch (X.charCodeAt(le)) {
                                   case 47:
-                                    if (de !== 42 || X.charCodeAt(le - 1) !== 42 || ke + 2 === le)
+                                    if (ue !== 42 || X.charCodeAt(le - 1) !== 42 || ke + 2 === le)
                                       break;
                                     ke = le + 1;
                                     break e;
                                   case 10:
-                                    if (de === 47) {
+                                    if (ue === 47) {
                                       ke = le + 1;
                                       break e;
                                     }
@@ -29871,20 +29847,20 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
                         }
                         break;
                       case 91:
-                        de++;
+                        ue++;
                       case 40:
-                        de++;
+                        ue++;
                       case 34:
                       case 39:
-                        for (; ke++ < Fe && X.charCodeAt(ke) !== de; )
+                        for (; ke++ < Fe && X.charCodeAt(ke) !== ue; )
                           ;
                     }
-                    if (ue === 0)
+                    if (de === 0)
                       break;
                     ke++;
                   }
-                  if (ue = X.substring(Me, ke), (ae = ae === 0 ? (De = De.replace(m, "").trim()).charCodeAt(0) : ae) === 64) {
-                    switch (de = (De = 0 < Oe ? De.replace(g, "") : De).charCodeAt(1)) {
+                  if (de = X.substring(Me, ke), (ae = ae === 0 ? (De = De.replace(m, "").trim()).charCodeAt(0) : ae) === 64) {
+                    switch (ue = (De = 0 < Oe ? De.replace(g, "") : De).charCodeAt(1)) {
                       case 100:
                       case 109:
                       case 115:
@@ -29894,45 +29870,45 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
                       default:
                         Oe = z;
                     }
-                    if (Me = (ue = U(Y, Oe, ue, de, ee + 1)).length, 0 < H && (Se = p(3, ue, Oe = a(z, De, Ce), Y, N, T, Me, de, ee, G), De = Oe.join(""), Se !== void 0) && (Me = (ue = Se.trim()).length) === 0 && (de = 0, ue = ""), 0 < Me)
-                      switch (de) {
+                    if (Me = (de = U(Y, Oe, de, ue, ee + 1)).length, 0 < H && (Se = p(3, de, Oe = a(z, De, Ce), Y, N, T, Me, ue, ee, G), De = Oe.join(""), Se !== void 0) && (Me = (de = Se.trim()).length) === 0 && (ue = 0, de = ""), 0 < Me)
+                      switch (ue) {
                         case 115:
                           De = De.replace(O, d);
                         case 100:
                         case 109:
                         case 45:
-                          ue = De + "{" + ue + "}";
+                          de = De + "{" + de + "}";
                           break;
                         case 107:
-                          ue = (De = De.replace(x, "$1 $2")) + "{" + ue + "}", ue = A === 1 || A === 2 && u("@" + ue, 3) ? "@-webkit-" + ue + "@" + ue : "@" + ue;
+                          de = (De = De.replace(x, "$1 $2")) + "{" + de + "}", de = A === 1 || A === 2 && u("@" + de, 3) ? "@-webkit-" + de + "@" + de : "@" + de;
                           break;
                         default:
-                          ue = De + ue, G === 112 && (xe += ue, ue = "");
+                          de = De + de, G === 112 && (xe += de, de = "");
                       }
                     else
-                      ue = "";
+                      de = "";
                   } else
-                    ue = U(Y, a(Y, De, Ce), ue, G, ee + 1);
-                  Je += ue, ue = Ce = Oe = le = ae = 0, De = "", de = X.charCodeAt(++ke);
+                    de = U(Y, a(Y, De, Ce), de, G, ee + 1);
+                  Je += de, de = Ce = Oe = le = ae = 0, De = "", ue = X.charCodeAt(++ke);
                   break;
                 case 125:
                 case 59:
                   if (1 < (Me = (De = (0 < Oe ? De.replace(g, "") : De).trim()).length))
-                    switch (le === 0 && (ae = De.charCodeAt(0), ae === 45 || 96 < ae && ae < 123) && (Me = (De = De.replace(" ", ":")).length), 0 < H && (Se = p(1, De, Y, Z, N, T, xe.length, G, ee, G)) !== void 0 && (Me = (De = Se.trim()).length) === 0 && (De = "\0\0"), ae = De.charCodeAt(0), de = De.charCodeAt(1), ae) {
+                    switch (le === 0 && (ae = De.charCodeAt(0), ae === 45 || 96 < ae && ae < 123) && (Me = (De = De.replace(" ", ":")).length), 0 < H && (Se = p(1, De, Y, Z, N, T, xe.length, G, ee, G)) !== void 0 && (Me = (De = Se.trim()).length) === 0 && (De = "\0\0"), ae = De.charCodeAt(0), ue = De.charCodeAt(1), ae) {
                       case 0:
                         break;
                       case 64:
-                        if (de === 105 || de === 99) {
+                        if (ue === 105 || ue === 99) {
                           je += De + X.charAt(ke);
                           break;
                         }
                       default:
-                        De.charCodeAt(Me - 1) !== 58 && (xe += i(De, ae, de, De.charCodeAt(2)));
+                        De.charCodeAt(Me - 1) !== 58 && (xe += i(De, ae, ue, De.charCodeAt(2)));
                     }
-                  Ce = Oe = le = ae = 0, De = "", de = X.charCodeAt(++ke);
+                  Ce = Oe = le = ae = 0, De = "", ue = X.charCodeAt(++ke);
               }
             }
-            switch (de) {
+            switch (ue) {
               case 13:
               case 10:
                 ge === 47 ? ge = 0 : 1 + ae === 0 && G !== 107 && 0 < De.length && (Oe = 1, De += "\0"), 0 < H * K && p(0, De, Y, Z, N, T, xe.length, G, ee, G), T = 1, N++;
@@ -29944,7 +29920,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
                   break;
                 }
               default:
-                switch (T++, ne = X.charAt(ke), de) {
+                switch (T++, ne = X.charAt(ke), ue) {
                   case 9:
                   case 32:
                     if (ce + ve + ge === 0)
@@ -29956,7 +29932,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
                           ne = "";
                           break;
                         default:
-                          de !== 32 && (ne = " ");
+                          ue !== 32 && (ne = " ");
                       }
                     break;
                   case 0:
@@ -29988,7 +29964,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
                     break;
                   case 34:
                   case 39:
-                    ge === 0 && (ce = ce === de ? 0 : ce === 0 ? de : ce);
+                    ge === 0 && (ce = ce === ue ? 0 : ce === 0 ? ue : ce);
                     break;
                   case 91:
                     ce + ge + Te === 0 && ve++;
@@ -30003,14 +29979,14 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
                     ce + ge + ve === 0 && (ae === 0 && 2 * re + 3 * fe != 533 && (ae = 1), Te++);
                     break;
                   case 64:
-                    ge + Te + ce + ve + le + ue === 0 && (ue = 1);
+                    ge + Te + ce + ve + le + de === 0 && (de = 1);
                     break;
                   case 42:
                   case 47:
                     if (!(0 < ce + ve + Te))
                       switch (ge) {
                         case 0:
-                          switch (2 * de + 3 * X.charCodeAt(ke + 1)) {
+                          switch (2 * ue + 3 * X.charCodeAt(ke + 1)) {
                             case 235:
                               ge = 47;
                               break;
@@ -30019,12 +29995,12 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
                           }
                           break;
                         case 42:
-                          de === 47 && re === 42 && Me + 2 !== ke && (X.charCodeAt(Me + 2) === 33 && (xe += X.substring(Me, ke + 1)), ne = "", ge = 0);
+                          ue === 47 && re === 42 && Me + 2 !== ke && (X.charCodeAt(Me + 2) === 33 && (xe += X.substring(Me, ke + 1)), ne = "", ge = 0);
                       }
                 }
                 ge === 0 && (De += ne);
             }
-            fe = re, re = de, ke++;
+            fe = re, re = ue, ke++;
           }
           if (0 < (Me = xe.length)) {
             if (Oe = Y, 0 < H && (Se = p(2, xe, Oe, Z, N, T, Me, G, ee, G)) !== void 0 && (xe = Se).length === 0)
@@ -32755,12 +32731,12 @@ Error: ` + N);
         default:
           for (y = new Array(F - 1), S = 1; S < F; S++)
             y[S - 1] = arguments[S];
-          var de = x, ue = y;
+          var ue = x, de = y;
           if (B)
-            de.apply(this, ue);
+            ue.apply(this, de);
           else
-            for (var ne = de.length, Se = _(de, ne), ve = 0; ve < ne; ++ve)
-              Se[ve].apply(this, ue);
+            for (var ne = ue.length, Se = _(ue, ne), ve = 0; ve < ne; ++ve)
+              Se[ve].apply(this, de);
       }
       return !0;
     }, i.prototype.on = i.prototype.addListener = function(w, E) {
@@ -32953,11 +32929,11 @@ Error: ` + N);
                 return G;
               case "latin1":
               case "binary":
-                var ae = (q = H, J), de = "";
+                var ae = (q = H, J), ue = "";
                 ae = Math.min(this.length, ae);
-                for (var ue = q; ue < ae; ++ue)
-                  de += String.fromCharCode(this[ue]);
-                return de;
+                for (var de = q; de < ae; ++de)
+                  ue += String.fromCharCode(this[de]);
+                return ue;
               case "base64":
                 return ne = this, K = J, (Se = H) === 0 && K === ne.length ? a.fromByteArray(ne) : a.fromByteArray(ne.slice(Se, K));
               case "ucs2":
@@ -33002,8 +32978,8 @@ Error: ` + N);
               return -1;
             W /= q = 2, U /= 2, J /= 2;
           }
-          function Z(ae, de) {
-            return q === 1 ? ae[de] : ae.readUInt16BE(de * q);
+          function Z(ae, ue) {
+            return q === 1 ? ae[ue] : ae.readUInt16BE(ue * q);
           }
           if (R)
             for (var Y = -1, X = J; X < W; X++)
@@ -33061,9 +33037,9 @@ Error: ` + N);
           var ee = K, ae = ee.length;
           if (ae <= C)
             return String.fromCharCode.apply(String, ee);
-          for (var de = "", ue = 0; ue < ae; )
-            de += String.fromCharCode.apply(String, ee.slice(ue, ue += C));
-          return de;
+          for (var ue = "", de = 0; de < ae; )
+            ue += String.fromCharCode.apply(String, ee.slice(de, de += C));
+          return ue;
         }
         o.kMaxLength = i, (d.TYPED_ARRAY_SUPPORT = (() => {
           try {
@@ -33203,10 +33179,10 @@ Error: ` + N);
                 var Y = I, X = H, G = J, ee = (X = Number(X) || 0, this.length - X);
                 (!G || ee < (G = Number(G))) && (G = ee), (ee = Y.length) / 2 < G && (G = ee / 2);
                 for (var ae = 0; ae < G; ++ae) {
-                  var de = parseInt(Y.substr(2 * ae, 2), 16);
-                  if (z(de))
+                  var ue = parseInt(Y.substr(2 * ae, 2), 16);
+                  if (z(ue))
                     return ae;
-                  this[X + ae] = de;
+                  this[X + ae] = ue;
                 }
                 return ae;
               case "utf8":
@@ -33722,19 +33698,19 @@ Error: ` + N);
         throw new f("intrinsic " + ve + " does not exist!");
       })("%" + Y + "%", U), G = (X.name, X.value), ee = !1;
       (X = X.alias) && (Y = X[0], I(Z, z([0, 1], X)));
-      for (var ae = 1, de = !0; ae < Z.length; ae += 1) {
-        var ue = Z[ae], ne = J(ue, 0, 1), Se = J(ue, -1);
+      for (var ae = 1, ue = !0; ae < Z.length; ae += 1) {
+        var de = Z[ae], ne = J(de, 0, 1), Se = J(de, -1);
         if ((ne === '"' || ne === "'" || ne === "`" || Se === '"' || Se === "'" || Se === "`") && ne !== Se)
           throw new f("property names with quotes must have matching quotes");
-        if (ue !== "constructor" && de || (ee = !0), A(T, ne = "%" + (Y += "." + ue) + "%"))
+        if (de !== "constructor" && ue || (ee = !0), A(T, ne = "%" + (Y += "." + de) + "%"))
           G = T[ne];
         else if (G != null) {
-          if (!(ue in G)) {
+          if (!(de in G)) {
             if (U)
               return;
             throw new h("base intrinsic for " + W + " exists, but the property is not available.");
           }
-          G = y && ae + 1 >= Z.length ? (de = !!(Se = y(G, ue))) && "get" in Se && !("originalValue" in Se.get) ? Se.get : G[ue] : (de = A(G, ue), G[ue]), de && !ee && (T[ne] = G);
+          G = y && ae + 1 >= Z.length ? (ue = !!(Se = y(G, de))) && "get" in Se && !("originalValue" in Se.get) ? Se.get : G[de] : (ue = A(G, de), G[de]), ue && !ee && (T[ne] = G);
         }
       }
       return G;
@@ -34305,7 +34281,7 @@ Error: ` + N);
               }
           })(ge) ? (Ce = [], u && u.call(ge, function(Ze, Qe) {
             Ce.push(Je(Qe, ge, !0) + " => " + Je(Ze, ge));
-          }), ue("Map", i.call(ge), Ce, xe)) : ((Ze) => {
+          }), de("Map", i.call(ge), Ce, xe)) : ((Ze) => {
             if (d && Ze && typeof Ze == "object")
               try {
                 d.call(Ze);
@@ -34319,7 +34295,7 @@ Error: ` + N);
               }
           })(ge) ? (Me = [], p && p.call(ge, function(Ze) {
             Me.push(Je(Ze, ge));
-          }), ue("Set", d.call(ge), Me, xe)) : ((Ze) => {
+          }), de("Set", d.call(ge), Me, xe)) : ((Ze) => {
             if (f && Ze && typeof Ze == "object")
               try {
                 f.call(Ze, f);
@@ -34331,7 +34307,7 @@ Error: ` + N);
                 return Ze instanceof WeakMap;
               } catch {
               }
-          })(ge) ? de("WeakMap") : ((Ze) => {
+          })(ge) ? ue("WeakMap") : ((Ze) => {
             if (h && Ze && typeof Ze == "object")
               try {
                 h.call(Ze, h);
@@ -34343,13 +34319,13 @@ Error: ` + N);
                 return Ze instanceof WeakSet;
               } catch {
               }
-          })(ge) ? de("WeakSet") : ((Ze) => {
+          })(ge) ? ue("WeakSet") : ((Ze) => {
             if (m && Ze && typeof Ze == "object")
               try {
                 return m.call(Ze), 1;
               } catch {
               }
-          })(ge) ? de("WeakRef") : X(nt = ge) !== "[object Number]" || N && typeof nt == "object" && N in nt ? ((Ze) => {
+          })(ge) ? ue("WeakRef") : X(nt = ge) !== "[object Number]" || N && typeof nt == "object" && N in nt ? ((Ze) => {
             if (Ze && typeof Ze == "object" && M)
               try {
                 return M.call(Ze), 1;
@@ -34381,10 +34357,10 @@ Error: ` + N);
         function ae(ve) {
           return "Object(" + ve + ")";
         }
-        function de(ve) {
+        function ue(ve) {
           return ve + " { ? }";
         }
-        function ue(ve, ge, Te, ce) {
+        function de(ve, ge, Te, ce) {
           return ve + " (" + ge + ") {" + (ce ? ne(Te, ce) : O.call(Te, ", ")) + "}";
         }
         function ne(ve, ge) {
@@ -34955,12 +34931,12 @@ Valid keys: ` + JSON.stringify(Object.keys(S), null, "  "));
           } };
       })(k));
     }
-    function de(k) {
+    function ue(k) {
       var j, V, oe;
       if (k)
         return (j = k._valueTracker) ? (V = j.getValue(), oe = "", (k = oe = k ? ee(k) ? k.checked ? "true" : "false" : k.value : oe) !== V && (j.setValue(k), 1)) : 1;
     }
-    function ue(k) {
+    function de(k) {
       if ((k = k || (typeof document < "u" ? document : void 0)) === void 0)
         return null;
       try {
@@ -34999,7 +34975,7 @@ Valid keys: ` + JSON.stringify(Object.keys(S), null, "  "));
       (V = k.name) !== "" && (k.name = ""), k.defaultChecked = !!k._wrapperState.initialChecked, V !== "" && (k.name = V);
     }
     function ce(k, j, V) {
-      j === "number" && ue(k.ownerDocument) === k || (V == null ? k.defaultValue = "" + k._wrapperState.initialValue : k.defaultValue !== "" + V && (k.defaultValue = "" + V));
+      j === "number" && de(k.ownerDocument) === k || (V == null ? k.defaultValue = "" + k._wrapperState.initialValue : k.defaultValue !== "" + V && (k.defaultValue = "" + V));
     }
     function re(k, j) {
       var V, oe;
@@ -35693,7 +35669,7 @@ Valid keys: ` + JSON.stringify(Object.keys(S), null, "  "));
       qe(k, 0);
     }
     function si(k) {
-      if (de(tc(k)))
+      if (ue(tc(k)))
         return k;
     }
     function Yi(k, j) {
@@ -35778,7 +35754,7 @@ Valid keys: ` + JSON.stringify(Object.keys(S), null, "  "));
       }
     }
     function Zi() {
-      for (var k = window, j = ue(); j instanceof k.HTMLIFrameElement; ) {
+      for (var k = window, j = de(); j instanceof k.HTMLIFrameElement; ) {
         try {
           var V = typeof j.contentWindow.location.href == "string";
         } catch {
@@ -35786,7 +35762,7 @@ Valid keys: ` + JSON.stringify(Object.keys(S), null, "  "));
         }
         if (!V)
           break;
-        j = ue((k = j.contentWindow).document);
+        j = de((k = j.contentWindow).document);
       }
       return j;
     }
@@ -35797,7 +35773,7 @@ Valid keys: ` + JSON.stringify(Object.keys(S), null, "  "));
     var sl = e && "documentMode" in document && document.documentMode <= 11, Qi = null, gs = null, za = null, Su = !1;
     function ll(k, j, V) {
       var oe = V.window === V ? V.document : V.nodeType === 9 ? V : V.ownerDocument;
-      Su || Qi == null || Qi !== ue(oe) || (oe = "selectionStart" in (oe = Qi) && Zl(oe) ? { start: oe.selectionStart, end: oe.selectionEnd } : { anchorNode: (oe = (oe.ownerDocument && oe.ownerDocument.defaultView || window).getSelection()).anchorNode, anchorOffset: oe.anchorOffset, focusNode: oe.focusNode, focusOffset: oe.focusOffset }, za && hs(za, oe)) || (za = oe, 0 < (oe = cn(gs, "onSelect")).length && (j = new Gi("onSelect", "select", null, j, V), k.push({ event: j, listeners: oe }), j.target = Qi));
+      Su || Qi == null || Qi !== de(oe) || (oe = "selectionStart" in (oe = Qi) && Zl(oe) ? { start: oe.selectionStart, end: oe.selectionEnd } : { anchorNode: (oe = (oe.ownerDocument && oe.ownerDocument.defaultView || window).getSelection()).anchorNode, anchorOffset: oe.anchorOffset, focusNode: oe.focusNode, focusOffset: oe.focusOffset }, za && hs(za, oe)) || (za = oe, 0 < (oe = cn(gs, "onSelect")).length && (j = new Gi("onSelect", "select", null, j, V), k.push({ event: j, listeners: oe }), j.target = Qi));
     }
     Ii("cancel cancel click click close close contextmenu contextMenu copy copy cut cut auxclick auxClick dblclick doubleClick dragend dragEnd dragstart dragStart drop drop focusin focus focusout blur input input invalid invalid keydown keyDown keypress keyPress keyup keyUp mousedown mouseDown mouseup mouseUp paste paste pause pause play play pointercancel pointerCancel pointerdown pointerDown pointerup pointerUp ratechange rateChange reset reset seeked seeked submit submit touchcancel touchCancel touchend touchEnd touchstart touchStart volumechange volumeChange".split(" "), 0), Ii("drag drag dragenter dragEnter dragexit dragExit dragleave dragLeave dragover dragOver mousemove mouseMove mouseout mouseOut mouseover mouseOver pointermove pointerMove pointerout pointerOut pointerover pointerOver scroll scroll toggle toggle touchmove touchMove wheel wheel".split(" "), 1), Ii(cr, 2);
     for (var Ql = "change selectionchange textInput compositionstart compositionend compositionupdate".split(" "), cl = 0; cl < Ql.length; cl++)
@@ -38852,7 +38828,7 @@ Add a <Suspense fallback=...> component higher in the tree to provide a loading
                 var ie = hf(oe);
                 if (!ie)
                   throw Error(i(90));
-                de(oe), ge(oe, ie);
+                ue(oe), ge(oe, ie);
               }
             }
           }
@@ -39732,19 +39708,19 @@ Has styled-components' style tag been unmounted or altered by another script?
           this.sheet.deleteRule(_e), this.length--;
         }, Xe.getRule = function(_e) {
           return (_e = this.sheet.cssRules[_e]) !== void 0 && typeof _e.cssText == "string" ? _e.cssText : "";
-        }, ne), U = ((Xe = ue.prototype).insertRule = function(_e, $e) {
+        }, ne), U = ((Xe = de.prototype).insertRule = function(_e, $e) {
           return _e <= this.length && 0 <= _e && ($e = document.createTextNode($e), _e = this.nodes[_e], this.element.insertBefore($e, _e || null), this.length++, !0);
         }, Xe.deleteRule = function(_e) {
           this.element.removeChild(this.nodes[_e]), this.length--;
         }, Xe.getRule = function(_e) {
           return _e < this.length ? this.nodes[_e].textContent : "";
-        }, ue), Z = ((Xe = de.prototype).insertRule = function(_e, $e) {
+        }, de), Z = ((Xe = ue.prototype).insertRule = function(_e, $e) {
           return _e <= this.length && (this.rules.splice(_e, 0, $e), this.length++, !0);
         }, Xe.deleteRule = function(_e) {
           this.rules.splice(_e, 1), this.length--;
         }, Xe.getRule = function(_e) {
           return _e < this.length ? this.rules[_e] : "";
-        }, de), Y = C, X = { isServer: !C, useCSSOMInjection: !O }, G = (ae.registerId = P, (Xe = ae.prototype).reconstructWithOptions = function(_e, $e) {
+        }, ue), Y = C, X = { isServer: !C, useCSSOMInjection: !O }, G = (ae.registerId = P, (Xe = ae.prototype).reconstructWithOptions = function(_e, $e) {
           return $e === void 0 && ($e = !0), new ae(g({}, this.options, {}, _e), this.gs, $e && this.names || void 0);
         }, Xe.allocateGSInstance = function(_e) {
           return this.gs[_e] = (this.gs[_e] || 0) + 1;
@@ -39790,10 +39766,10 @@ Has styled-components' style tag been unmounted or altered by another script?
             }
           }
         }
-        function de(_e) {
+        function ue(_e) {
           this.rules = [], this.length = 0;
         }
-        function ue(_e) {
+        function de(_e) {
           _e = this.element = T(_e), this.nodes = _e.childNodes, this.length = 0;
         }
         function ne(_e) {
@@ -42341,12 +42317,12 @@ To resolve this only create new StyledComponents outside of any render method an
           });
         } }, { key: "fetchDocWithRetry", value: (D = (0, i.default)(l.default.mark(function U() {
           var Z, Y, X, G, ee, ae;
-          return l.default.wrap(function(de) {
+          return l.default.wrap(function(ue) {
             for (; ; )
-              switch (de.prev = de.next) {
+              switch (ue.prev = ue.next) {
                 case 0:
                   if (Y = Z = null, G = this.waveConfig, X = G.app, G = (G = G.hooks) && G.fetchDocOnNetworkReconnect) {
-                    de.next = 7;
+                    ue.next = 7;
                     break;
                   }
                   throw Y = new Error("fetchDocOnNetworkReconnect is undefined");
@@ -42354,43 +42330,43 @@ To resolve this only create new StyledComponents outside of any render method an
                   ee = 0;
                 case 8:
                   if (ee < q)
-                    return ae = Y = null, de.prev = 11, de.next = 14, H(W * (ee + 1));
-                  de.next = 40;
+                    return ae = Y = null, ue.prev = 11, ue.next = 14, H(W * (ee + 1));
+                  ue.next = 40;
                   break;
                 case 14:
                   if (this.isStopped())
                     throw new _.InvalidStateError("[fetchDocWithRetry][".concat(this.currentRteId, "](").concat(this.clientState, ") Already in ").concat(this.clientState));
-                  de.next = 16;
+                  ue.next = 16;
                   break;
                 case 16:
                   if (K(X, this.waveConfig.editorInstance) || R(X, this.waveConfig.editorInstance))
-                    return de.next = 20, G();
-                  de.next = 23;
+                    return ue.next = 20, G();
+                  ue.next = 23;
                   break;
                 case 20:
-                  Z = de.sent, de.next = 27;
+                  Z = ue.sent, ue.next = 27;
                   break;
                 case 23:
-                  return de.next = 25, G();
+                  return ue.next = 25, G();
                 case 25:
-                  ae = de.sent, Z = I(X, ae);
+                  ae = ue.sent, Z = I(X, ae);
                 case 27:
-                  return de.abrupt("return", Z);
+                  return ue.abrupt("return", Z);
                 case 30:
-                  if (de.prev = 30, de.t0 = de.catch(11), (Y = de.t0) instanceof _.InvalidStateError)
+                  if (ue.prev = 30, ue.t0 = ue.catch(11), (Y = ue.t0) instanceof _.InvalidStateError)
                     throw g.default.log("[codox][".concat(this.cid, "][").concat(this.currentRteId, "](").concat(this.clientState, ")[fetchDocOnNetworkReconnect] invalid state, message = ").concat(Y.message)), Y;
-                  de.next = 36;
+                  ue.next = 36;
                   break;
                 case 36:
-                  Y instanceof _.DocValidationError ? (g.default.log("[codox][".concat(this.cid, "][").concat(this.currentRteId, "](").concat(this.clientState, ")[fetchDocOnNetworkReconnect] parse failed, doc = ").concat(Y.state)), console.error(Y)) : (g.default.log("[codox][".concat(this.cid, "][").concat(this.currentRteId, "](").concat(this.clientState, ")[fetchDocOnNetworkReconnect] fetch failed")), Y = new _.FetchError("fetchDocOnNetworkReconnect failed to return valid data, err:" + JSON.stringify(de.t0)));
+                  Y instanceof _.DocValidationError ? (g.default.log("[codox][".concat(this.cid, "][").concat(this.currentRteId, "](").concat(this.clientState, ")[fetchDocOnNetworkReconnect] parse failed, doc = ").concat(Y.state)), console.error(Y)) : (g.default.log("[codox][".concat(this.cid, "][").concat(this.currentRteId, "](").concat(this.clientState, ")[fetchDocOnNetworkReconnect] fetch failed")), Y = new _.FetchError("fetchDocOnNetworkReconnect failed to return valid data, err:" + JSON.stringify(ue.t0)));
                 case 37:
-                  ee++, de.next = 8;
+                  ee++, ue.next = 8;
                   break;
                 case 40:
                   throw Y;
                 case 41:
                 case "end":
-                  return de.stop();
+                  return ue.stop();
               }
           }, U, this, [[11, 30]]);
         })), function() {
@@ -42399,39 +42375,39 @@ To resolve this only create new StyledComponents outside of any render method an
           return !!w.default.isClickUp;
         } }, { key: "docFetch", value: (N = (0, i.default)(l.default.mark(function U() {
           var Z, Y, X, G, ee, ae;
-          return l.default.wrap(function(de) {
+          return l.default.wrap(function(ue) {
             for (; ; )
-              switch (de.prev = de.next) {
+              switch (ue.prev = ue.next) {
                 case 0:
                   if (Y = Z = null, this.isStopped())
                     throw new _.InvalidStateError("[docFetch] client in stopped state");
-                  de.next = 5;
+                  ue.next = 5;
                   break;
                 case 5:
                   if (ee = this.waveConfig, ae = ee.refetch, X = ee.docId, G = ee.permission, ee = (ee = ee.hooks) && ee.fetchDocOnNetworkReconnect, (ae || this.fetchable(X)) && ee)
-                    return this.appAdapter && this.appAdapter.disableEditor(), de.prev = 12, de.next = 15, this.fetchDocWithRetry();
-                  de.next = 26;
+                    return this.appAdapter && this.appAdapter.disableEditor(), ue.prev = 12, ue.next = 15, this.fetchDocWithRetry();
+                  ue.next = 26;
                   break;
                 case 15:
-                  (ae = de.sent) && (Z = ae.content, Y = ae.timestamp), de.next = 24;
+                  (ae = ue.sent) && (Z = ae.content, Y = ae.timestamp), ue.next = 24;
                   break;
                 case 19:
-                  throw de.prev = 19, de.t0 = de.catch(12), g.default.log("[codox][".concat(this.cid, "][").concat(this.currentRteId, "](").concat(this.clientState, ")[docFetch] failed to fetch")), this.appAdapter && this.appAdapter.enableEditor(), de.t0;
+                  throw ue.prev = 19, ue.t0 = ue.catch(12), g.default.log("[codox][".concat(this.cid, "][").concat(this.currentRteId, "](").concat(this.clientState, ")[docFetch] failed to fetch")), this.appAdapter && this.appAdapter.enableEditor(), ue.t0;
                 case 24:
-                  de.next = 29;
+                  ue.next = 29;
                   break;
                 case 26:
                   Z = this.appAdapter && this.appAdapter.getContent(), Y = this.waveConfig.timestamp;
                 case 29:
                   if (J(JSON.stringify(Z)), v.THRESHOLD, G.level !== y.PERMISSIONS_ENUM.WRITE && G.level ? this.appAdapter && this.appAdapter.disableEditor() : this.appAdapter && this.appAdapter.enableEditor(), this.isStopped())
                     throw new _.InvalidStateError("[docFetch][".concat(this.currentRteId, "](").concat(this.clientState, ") Already in ").concat(this.clientState));
-                  de.next = 33;
+                  ue.next = 33;
                   break;
                 case 33:
-                  return de.abrupt("return", { initContent: Z, timestamp: Y });
+                  return ue.abrupt("return", { initContent: Z, timestamp: Y });
                 case 34:
                 case "end":
-                  return de.stop();
+                  return ue.stop();
               }
           }, U, this, [[12, 19]]);
         })), function() {
@@ -44446,14 +44422,14 @@ To resolve this only create new StyledComponents outside of any render method an
         N = null, T && (T.editorInstance = null, T.appAPI = null, T = null), P && (P.d(), P = null), M && (M.uninit(), M = null);
       }
       this.b = function(I) {
-        var H = x.apps.tinymce, J = x.apps.quilljs, K = x.apps.froala, R = x.apps.froalaNew, q = x.apps.text, W = x.apps.json, U = x.apps.codemirror, Z = x.apps.kora, Y = (ve = T).app, X = ve.appAPI, G = ve.editorInstance, ee = ve.cid, ae = ve.initContent, de = ve.syncState, ue = ve.getState, ne = ve.getServerState, Se = ve.permission, ve = ve.INVOKE_TEST_RCS_EVENT;
+        var H = x.apps.tinymce, J = x.apps.quilljs, K = x.apps.froala, R = x.apps.froalaNew, q = x.apps.text, W = x.apps.json, U = x.apps.codemirror, Z = x.apps.kora, Y = (ve = T).app, X = ve.appAPI, G = ve.editorInstance, ee = ve.cid, ae = ve.initContent, ue = ve.syncState, de = ve.getState, ne = ve.getServerState, Se = ve.permission, ve = ve.INVOKE_TEST_RCS_EVENT;
         if (!(0, w.isValidAccess)(Se))
           throw new Error("access_error");
         if ((0, w.isNoAccess)(Se))
           throw new Error("access_error");
         X.i = X.i.bind(X, ee);
         try {
-          if (Y === H && (M = new u.default(G, X)), Y === J && (M = new f.default(G, X, ae)), Y === K && (M = new p.default(G, X)), Y === R && (M = new d.default(G, X)), Y === Z && (M = new g.default(G, X)), Y === W && (M = new v.default({ initContent: ae, syncState: de, getState: ue, getServerState: ne, INVOKE_TEST_RCS_EVENT: ve, config: T.jsonConfig })), T.app === q && (M = new h.default(T.editorInstance, T.appAPI, ae)), T.app === U && (M = new m.default(T.editorInstance, T.appAPI, ae)), !(M = Y === "testclient" ? new b.default() : M))
+          if (Y === H && (M = new u.default(G, X)), Y === J && (M = new f.default(G, X, ae)), Y === K && (M = new p.default(G, X)), Y === R && (M = new d.default(G, X)), Y === Z && (M = new g.default(G, X)), Y === W && (M = new v.default({ initContent: ae, syncState: ue, getState: de, getServerState: ne, INVOKE_TEST_RCS_EVENT: ve, config: T.jsonConfig })), T.app === q && (M = new h.default(T.editorInstance, T.appAPI, ae)), T.app === U && (M = new m.default(T.editorInstance, T.appAPI, ae)), !(M = Y === "testclient" ? new b.default() : M))
             throw new Error("Domain uninitialized: ".concat(Y));
           M.init();
           var ge, Te, ce, re, fe = (re = T.apptype === "testclient", T.session.app, { cid: T.cid, appType: T.session.app, subId: T.session.subscriptionId, mu: T.session.maxSessionSize, mid: T.session.memberId, ts: T.session.timestamp, sid: T.session.sid, waveId: T.session.waveid, founder: T.founder, user: T.user, domains: M, sysInfo: D, token: T.token, docId: T.docId, url: T.url, anyClient: T.ac, a: T.appAPI, api: T.appAPI, prevAid: T.sub.siteId, ver: T.ver, jsonConfig: T.jsonConfig, permission: T.permission, editorInstance: T.editorInstance });
@@ -44669,8 +44645,8 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
             if (!G)
               throw new Error("domain not defined");
             U = (W = G).x, typeof (X = window.MutationObserver || window.WebKitMutationObserver) == "function" && f === void 0 && (f = new X(function(ee) {
-              if (ue = W.n(), (0, i.stringify)(ue), B && ue && M.uimt("rs"), !B && ue && (B = !0, M.uim(!0)), B && !ue && (B = !1, M.uim(!1)), !F)
-                for (var ae = 0, de = ee.length; ae < de; ae++)
+              if (de = W.n(), (0, i.stringify)(de), B && de && M.uimt("rs"), !B && de && (B = !0, M.uim(!0)), B && !de && (B = !1, M.uim(!1)), !F)
+                for (var ae = 0, ue = ee.length; ae < ue; ae++)
                   (() => {
                     var ne = ee[ae];
                     if (y == m && ne.type == "childList") {
@@ -44709,7 +44685,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
                       M.LOH(ne, "e", W.dmid);
                     }, 0);
                   })();
-              var ue;
+              var de;
             })).observe(U, { subtree: !0, childList: !0, attributes: !0, attributeOldValue: !0, characterData: !0, characterDataOldValue: !0 }), I(G.x), N(X = G.x, G.dmid), _.mousedown = { handlerFn: function(ee) {
               G.elem.classList.add("codox_selecting");
             }, target: X }, _.mouseup = { handlerFn: function(ee) {
@@ -45045,8 +45021,8 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
               var K, R = W = J.shift(), q = null, W = (K = (0, l.default)(W[0].style) == "object" ? (q = Object.keys(W[0].style)[0], Object.values(W[0].style)[0]) : (q = W[0].style, !0), []);
               ((U) => {
                 for (var Z = U.restList, Y = U.attName, X = U.attValue, G = U.outputOps, ee = 0; Z.length; ) {
-                  var ae, de = Z.shift();
-                  de.length !== 0 ? (0 < de.offset && (ae = { retain: de.offset - ee }, G.push(ae), ee = de.offset), ae = { retain: de.length, attributes: (0, a.default)({}, Y, X) }, G.push(ae), ee += de.length) : m(de);
+                  var ae, ue = Z.shift();
+                  ue.length !== 0 ? (0 < ue.offset && (ae = { retain: ue.offset - ee }, G.push(ae), ee = ue.offset), ae = { retain: ue.length, attributes: (0, a.default)({}, Y, X) }, G.push(ae), ee += ue.length) : m(ue);
                 }
                 m(G);
               })({ restList: R, attName: q, attValue: K, outputOps: W }), H.push(W);
@@ -45292,10 +45268,10 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
                     Ze && je.push(He);
                   }
                   return je;
-                })(U(W.od), U(W.oi))).length && (W.delEmbedId = ge, m(W.delEmbedId)), ce = Te = ge = ve = U = Se = ne = ue = de = X = void 0;
-                var X = N, G = A, ee = J, ae = D, de = (X.t = "qd", delete X.od, delete X.oi, m(X), m(ee), h(X.p));
-                X.p.splice(-1, 1, "cdxBlk", "cdxText"), de.splice(-1, 1, "cdxBlk", "cdxText");
-                for (var ue = [], ne = 0; ne < X.cop.length; ne++) {
+                })(U(W.od), U(W.oi))).length && (W.delEmbedId = ge, m(W.delEmbedId)), ce = Te = ge = ve = U = Se = ne = de = ue = X = void 0;
+                var X = N, G = A, ee = J, ae = D, ue = (X.t = "qd", delete X.od, delete X.oi, m(X), m(ee), h(X.p));
+                X.p.splice(-1, 1, "cdxBlk", "cdxText"), ue.splice(-1, 1, "cdxBlk", "cdxText");
+                for (var de = [], 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, Be, He, Ze) => {
                     m(xe);
@@ -45318,13 +45294,13 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
                       0 < Je.length && Je[Je.length - 1].tg !== void 0 ? (m(Je), Je[Je.length - 1].tg += 1) : Je.push({ tg: 1 });
                     }
                     m(Je);
-                  })(Se, ue, ee, G, de, ae) : (0 < ue.length && ue[ue.length - 1].tg !== void 0 && Se.tg !== void 0 && Se.sx == null ? ue[ue.length - 1].tg = ue[ue.length - 1].tg + Se.tg : ue.push(Se), m(ue));
+                  })(Se, de, ee, G, ue, ae) : (0 < de.length && de[de.length - 1].tg !== void 0 && Se.tg !== void 0 && Se.sx == null ? de[de.length - 1].tg = de[de.length - 1].tg + Se.tg : de.push(Se), m(de));
                 }
                 if (X.cop.length == 0)
                   m(X);
                 else {
                   U = X;
-                  for (var ve = ue, ge = ee, Te = !1, ce = 0; ce < ve.length; ce++)
+                  for (var ve = de, ge = ee, Te = !1, ce = 0; ce < ve.length; ce++)
                     (ve[ce].cr || ve[ce].sx || ve[ce].sc) && (Te = !0);
                   Te ? (U.t = "qd", U.cop = ve, ge.push(U), m(U)) : m(ve);
                 }
@@ -46028,8 +46004,8 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           g({ types: Y, dt: Z, obf: !1 });
         };
         function G() {
-          var ae, de = 0 < arguments.length && arguments[0] !== void 0 ? arguments[0] : {}, ue = de.initContent, ne = de.syncState, Se = de.getState, ve = de.getServerState, ge = (ae = de.INVOKE_TEST_RCS_EVENT) !== void 0 && ae, Te = (ae = de.config) === void 0 ? {} : ae;
-          if ((0, f.ins)(Te), (0, h.logClone)(ue), Se == null)
+          var ae, ue = 0 < arguments.length && arguments[0] !== void 0 ? arguments[0] : {}, de = ue.initContent, ne = ue.syncState, Se = ue.getState, ve = ue.getServerState, ge = (ae = ue.INVOKE_TEST_RCS_EVENT) !== void 0 && ae, Te = (ae = ue.config) === void 0 ? {} : ae;
+          if ((0, f.ins)(Te), (0, h.logClone)(de), Se == null)
             throw new Error("JSONDomain (in): getState is undefined!!");
           if (ve == null)
             throw new Error("JSONDomain (in): getServerState is undefined!!");
@@ -46048,7 +46024,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
             (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), 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) {
+          var le = !1, ke = !1, Oe = !1, Ce = null, Me = [], nt = (de = Se(), (0, h.logClone)(de), de !== void 0 ? (0, h.clone)(de) : 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) {
@@ -46215,10 +46191,10 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           }, this.tfslop = F;
         }
         function ee() {
-          for (var ae = arguments.length, de = new Array(ae), ue = 0; ue < ae; ue++)
-            de[ue] = arguments[ue];
+          for (var ae = arguments.length, ue = new Array(ae), de = 0; de < ae; de++)
+            ue[de] = arguments[de];
           this.super(), this.init = function() {
-            this.D.json = (0, l.default)(G, de);
+            this.D.json = (0, l.default)(G, ue);
           }, this.uninit = function() {
             delete this.D.json;
           };
@@ -46394,10 +46370,10 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         try {
           x && X && (X.index + X.length < x.getLength() || ((ee) => {
             if (x && ee) {
-              var ae = ee.index, de = ee.length, ue = x.getLength();
-              if (ue < ae)
-                return ee.index = ue - 1, ee.length = 0;
-              ue < ae + de && (ee.index = ae, ee.length = ue - 1);
+              var ae = ee.index, ue = ee.length, de = x.getLength();
+              if (de < ae)
+                return ee.index = de - 1, ee.length = 0;
+              de < ae + ue && (ee.index = ae, ee.length = de - 1);
             }
           })(X), x.setSelection(X, G));
         } catch (ee) {
@@ -46426,8 +46402,8 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           f.isProd;
           var ee = D(), ae = (x.updateContents(X, "codox"), T(), x.getContents());
           y.i({ source: "r", delta: X, content: ae }), G && N(ee);
-        } catch (de) {
-          d.logger.reportError(de);
+        } catch (ue) {
+          d.logger.reportError(ue);
         }
       }
       function H() {
@@ -46457,8 +46433,8 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
       T(), this.hook = function(X) {
         try {
           if (u.default.prototype.hook.call(this, X), x) {
-            x && (O = function(ae, de, ue) {
-              if (ae.ops, ue != "codox" && ue != "undo" && !(0, m.filterDelta)(ae)) {
+            x && (O = function(ae, ue, de) {
+              if (ae.ops, de != "codox" && de != "undo" && !(0, m.filterDelta)(ae)) {
                 if (L.isWriter() || L.isCommenter() && ae.ops && ae.ops.every(function(Se) {
                   return Object.keys(Se).every(function(ve) {
                     return ["retain", "attributes"].includes(ve);
@@ -46466,16 +46442,16 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
                     return ve === "comment" || ve === "comment_draft";
                   })));
                 }))
-                  return ee({ delta: ae, oldDelta: de }, "e");
-                ue = x.getContents();
+                  return ee({ delta: ae, oldDelta: ue }, "e");
+                de = x.getContents();
                 var ne = 0;
-                ae = ae.ops[0].retain, ue = ue.diff(de, ne = ae || ne), x.updateContents(ue, "undo"), setTimeout(function() {
+                ae = ae.ops[0].retain, de = de.diff(ue, ne = ae || ne), x.updateContents(de, "undo"), setTimeout(function() {
                   x.setSelection(null, "undo");
                 }, 0);
               }
-            }, G = ee = X, F = function(ae, de, ue) {
-              if (ue !== _ && ue !== "api")
-                return G({ delta: ae, oldDelta: de }, "c");
+            }, G = ee = X, F = function(ae, ue, de) {
+              if (de !== _ && de !== "api")
+                return G({ delta: ae, oldDelta: ue }, "c");
             }, x.on("editor-change", z));
             try {
               x && (x.setContents = A);
@@ -46505,11 +46481,11 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         R = (B = X).hacm, q = B.app;
       }), U = !1, Z = 0, Y = null;
       this.loh = function(X, G) {
-        var ee, ae, de, ue = X.delta, ne = X.oldDelta;
-        return (0, v.logClone)(ue), (0, v.logClone)(ne), G === "e" ? (q.a.i({ source: "l", delta: ue }), U ? void 0 : (B.gs() != b || B.sus() || B.slotimer("lohqjs"), X = ue, ee = ne, ae = H(), Z == 0 && (Y = (0, h.contentToDelta)((0, v.clone)(ee))), Z++, de = (0, h.contentToDelta)((0, v.clone)(ae)), Z == 5 && ((0, g.ins)(Y), (0, g.ins)(de), de = Y.diff(de), (0, g.ins)(de), Z = 0), de = 0, X.ops[0].retain && (de = X.ops[0].retain), ae = ae.diff(ee, de), B.pt.gct().seq, B.pt.gct().seq, ee = { op: B.dtf.d2c(X.ops), inverse: B.dtf.d2c(ae.ops) }, B.dop2sm(ee, "lohqjs", B), void (W = !1))) : G === "c" ? B.gs() !== b || B.sus() ? void 0 : (W = !0, void setTimeout(function() {
+        var ee, ae, ue, de = X.delta, ne = X.oldDelta;
+        return (0, v.logClone)(de), (0, v.logClone)(ne), G === "e" ? (q.a.i({ source: "l", delta: de }), U ? void 0 : (B.gs() != b || B.sus() || B.slotimer("lohqjs"), X = de, ee = ne, ae = H(), Z == 0 && (Y = (0, h.contentToDelta)((0, v.clone)(ee))), Z++, ue = (0, h.contentToDelta)((0, v.clone)(ae)), Z == 5 && ((0, g.ins)(Y), (0, g.ins)(ue), ue = Y.diff(ue), (0, g.ins)(ue), Z = 0), ue = 0, X.ops[0].retain && (ue = X.ops[0].retain), ae = ae.diff(ee, ue), B.pt.gct().seq, B.pt.gct().seq, ee = { op: B.dtf.d2c(X.ops), inverse: B.dtf.d2c(ae.ops) }, B.dop2sm(ee, "lohqjs", B), void (W = !1))) : G === "c" ? B.gs() !== b || B.sus() ? void 0 : (W = !0, void setTimeout(function() {
           var Se, ve;
-          Se = ue, ve = ne, W && !U && Se !== null && (ve = { start: Se.index, end: Se.index + Se.length }, R(ve), W = !1);
-        }, 0)) : G == "u" ? void B.pu.pu() : void "QuillDomain codox_QJS_LOH: capturing an unexpected evt: delta = ".concat(ue, ", ").concat(ne, ", ").concat(G);
+          Se = de, ve = ne, W && !U && Se !== null && (ve = { start: Se.index, end: Se.index + Se.length }, R(ve), W = !1);
+        }, 0)) : G == "u" ? void B.pu.pu() : void "QuillDomain codox_QJS_LOH: capturing an unexpected evt: delta = ".concat(de, ", ").concat(ne, ", ").concat(G);
       }, this.roh = function(X) {
         (0, g.stringify)(/* @__PURE__ */ new Date()), (0, v.logClone)(X), I({ ops: B.dtf.c2d(X.op) }), X.context && B.rcs.urcs(X), (0, v.logClone)(X);
       }, this.c = function() {
@@ -46533,10 +46509,10 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
       }, this.setContents = function(X) {
         var G = !(1 < arguments.length && arguments[1] !== void 0) || arguments[1];
         try {
-          var ee, ae, de = null;
-          return x && (ee = J(), ae = (0, m.compareDelta)(ee.constructor, ee, X).change) && ae.ops && ae.ops.length && (de = D(), Object.getPrototypeOf(x).setContents.bind(x), x.updateContents(ae, "codox"), G && N(de), y.i(X), T()), de;
-        } catch (ue) {
-          d.logger.reportError(ue);
+          var ee, ae, ue = null;
+          return x && (ee = J(), ae = (0, m.compareDelta)(ee.constructor, ee, X).change) && ae.ops && ae.ops.length && (ue = D(), Object.getPrototypeOf(x).setContents.bind(x), x.updateContents(ae, "codox"), G && N(ue), y.i(X), T()), ue;
+        } catch (de) {
+          d.logger.reportError(de);
         }
       }, this.updateContents = I, this.getContents = H, this.initContents = J, this.setText = function(X) {
         try {
@@ -46561,8 +46537,8 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           return null;
         P = X;
         var G = Object.keys(X).map(function(ee) {
-          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) => {
+          var ae = (de = X[ee]).start, ue = de.end, de = de.update;
+          return ae === -1 ? { cursor: null, selection: [], siteId: ee, update: !0 } : ae === ue ? { cursor: K(ae), selection: [], siteId: ee, update: de } : { cursor: K(ae), selection: ((ne, Se) => {
             try {
               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) {
@@ -46576,7 +46552,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
               return d.logger.reportError(Ot), [];
             }
             var yt;
-          })(ae, de), siteId: ee, update: ue };
+          })(ae, ue), siteId: ee, update: de };
         });
         return G;
       }, this.n = function() {
@@ -46592,8 +46568,8 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         try {
           var ee = D(), ae = Object.getPrototypeOf(x);
           (ae && ae.setContents.bind(x))(X, G), N(ee);
-        } catch (de) {
-          d.logger.reportError(de);
+        } catch (ue) {
+          d.logger.reportError(ue);
         }
       }, this.toDelta = function(X) {
         return (0, h.contentToDelta)(X);
@@ -47070,9 +47046,9 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
       return d("NO_ACCESS", p, !(1 < arguments.length && arguments[1] !== void 0) || arguments[1]);
     }, 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;
+    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"), ue = e("../../../codox-shared/src/com/lib"), de = e("../../../codox-shared/src/dtf/dtf.js"), ne = ue.isop, Se = ue.ipop, ve = ue.idlt, ge = ue.idif, Te = ue.dct, ce = ue.gran, re = ue.csmais, fe = ue.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(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) {
+      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 = de.d2c, Qe = i, Bt = (this.setSMV = function(Ve) {
         Qe = Ve;
       }, u), Ye = (this.cver = Bt, null), Ht = (this.setSID = function(Ve) {
         Ye = Ve;
@@ -47516,7 +47492,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
                     } else
                       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;
+                    Tn = { types: Mt, dt: Jt, obf: !1 }, de.di(Tn), We.dtf = de;
                 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 };
@@ -47547,7 +47523,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         h(Bn.DCPRops), h(Bn.DCPLops), (ve(Ve) ? N : D)(Bn.DCPLops, Bn.DCPRops, Ve), $o("dcpm");
       }, X.init(We), G.init(We);
       var gr = new ae(We, De);
-      this.semsg = gr.semsg, this.lib = de, this.xf = le, this.exsl = Qn;
+      this.semsg = gr.semsg, this.lib = ue, this.xf = le, this.exsl = Qn;
     };
   }, { "../../../codox-json-ot/lib/": 60, "../../../codox-rt-type/src/": 144, "../../../codox-shared/src/com/constants": 217, "../../../codox-shared/src/com/lib": 219, "../../../codox-shared/src/com/log": 220, "../../../codox-shared/src/com/util": 221, "../../../codox-shared/src/dtf/dtf.js": 222, "../../../codox-shared/src/gt/pt.js": 224, "../../../codox-shared/src/gt/pu.js": 225, "../../../codox-shared/src/gt/xf": 226, "../constants": 538, "../env": 557, "../errors": 558, "../logger.js": 560, "../util/lib": 581, "./access": 561, "./difap.js": 563, "./dltap.js": 564, "./dsm.js": 565, "./ext/ime.js": 566, "./ext/pvp.js": 567, "./ext/uim.js": 568, "./msg": 569, "./off.js": 570, "./opm": 571, "./rcs.js": 572, "./sapa.js": 575, "./soh.js": 576, "./spot.js": 577, "./sync": 578, "./ver": 579, "@babel/runtime/helpers/interopRequireDefault": 593, "@babel/runtime/helpers/typeof": 604, "rangy/lib/rangy-selectionsaverestore": 756 }], 563: [function(e, s, o) {
     var r, a = e("@babel/runtime/helpers/interopRequireDefault")(e("@babel/runtime/helpers/typeof")), l = (r = e("../../../codox-shared/src/com/constants")).OFFLINE, i = r.ONLINE, u = e("../../../codox-shared/src/com/log").ins, d = (r = e("../../../codox-shared/src/com/util")).clone, p = r.logClone, f = e("../../../codox-shared/src/gt/cpj.js").cpdl, h = Date, m = (e("./off.js"), e("../../../codox-shared/src/gt/xf")), g = !1, v = 0, b = h.now(), _ = [];
@@ -47598,12 +47574,12 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
             J = D.gj(), D.e(J, !0);
         }
       } else if (z) {
-        var G = L, ee = P, ae = (U = (W = T).ssl, W.rsl), de = W.jot, ue = (p(ee), G.gj(), G.d(), U = U(G), Z = G.d(), q = [], U && U.rangeInfos[0] && (ve = ge = null, U.rangeInfos[0].collapsed ? M(Z, ge = G.cc(0), q, W) : (ge = G.cc(0), ve = G.cc(1), M(Z, ge, q, W) && M(Z, ve, q, W) || (q = []))), p(q), []);
+        var G = L, ee = P, ae = (U = (W = T).ssl, W.rsl), ue = W.jot, de = (p(ee), G.gj(), G.d(), U = U(G), Z = G.d(), q = [], U && U.rangeInfos[0] && (ve = ge = null, U.rangeInfos[0].collapsed ? M(Z, ge = G.cc(0), q, W) : (ge = G.cc(0), ve = G.cc(1), M(Z, ge, q, W) && M(Z, ve, q, W) || (q = []))), p(q), []);
         if (Array.isArray(ee))
           for (var ne = 0; ne < ee.length; ne++)
-            ue.push(ee[ne].op);
+            de.push(ee[ne].op);
         else
-          ue.push(ee.op);
+          de.push(ee.op);
         var Se = [];
         if (q.length) {
           var ve, ge = q[0];
@@ -47612,20 +47588,20 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
             var re = [Se[ce]];
             if (Array.isArray(ee))
               for (var fe = 0; fe < ee.length; fe++)
-                re = de.type.transform(re, ee[fe].op, 0), p(re);
+                re = ue.type.transform(re, ee[fe].op, 0), p(re);
             else
-              re = de.type.transform(re, ee.op, 0), p(re);
+              re = ue.type.transform(re, ee.op, 0), p(re);
             re.length !== 0 && (Te.push(re[0]), p(Te));
           }
           var le = d(G.gj());
           if (Se.length == Te.length)
             for (var ke = 0; ke < Te.length; ke++)
-              de.type.apply(le, [Te[ke]]), ue.push([Te[ke]]), p(ue);
+              ue.type.apply(le, [Te[ke]]), de.push([Te[ke]]), p(de);
           else
             p(Se), p(Te);
-          W.rangy.removeMarkers(U), G.d(), G.e(le, !0, ue), Se.length == Te.length ? ae(G, U) : p(Te), G.gj(), G.d();
+          W.rangy.removeMarkers(U), G.d(), G.e(le, !0, de), Se.length == Te.length ? ae(G, U) : p(Te), G.gj(), G.d();
         } else
-          U && W.rangy.removeMarkers(U), G.e(G.gj(), !0, ue);
+          U && W.rangy.removeMarkers(U), G.e(G.gj(), !0, de);
       } else {
         var Oe = L.c();
         if (L.e(L.gj(), !0), Array.isArray(P))
@@ -47698,8 +47674,8 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
               ee = JSON.stringify(Z).length;
             else
               for (var ae = 0; ae < Z.length; ae++)
-                for (var de = Z[ae], ue = 0; ue < de.op.length; ue++) {
-                  var ne = de.op[ue];
+                for (var ue = Z[ae], de = 0; de < ue.op.length; de++) {
+                  var ne = ue.op[de];
                   switch ((0, a.default)(ne)) {
                     case G[2]:
                     case G[1]:
@@ -47769,7 +47745,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, 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() {
+      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, ue = z.dce, de = 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) {
@@ -47833,7 +47809,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
                   Pe--, ze.sid !== on ? qt.push(ze) : Zt = ze;
                 }
                 return Zt;
-              })(Ze.mbs, st.context.sid), z.pt.gtms(), Xe && !q && (He([st.context.sid]), z.gfln() ? (xt = Je(), xe("quit", xt)) : De("quit", st.context.sid), ce(19, [Xe]), Ze.mbs.length, st.context.sid, Y("[codoxi] qt: t = " + Ue + "; s=" + kt + "; ss= " + Ze.mbs.length + "; lvrsid = " + st.context.sid + "; sid = " + Z.sid, l)), kt == C && Ze.mbs.length === 1 && (f(Ze.mbs), je({}), de());
+              })(Ze.mbs, st.context.sid), z.pt.gtms(), Xe && !q && (He([st.context.sid]), z.gfln() ? (xt = Je(), xe("quit", xt)) : De("quit", st.context.sid), ce(19, [Xe]), Ze.mbs.length, st.context.sid, Y("[codoxi] qt: t = " + Ue + "; s=" + kt + "; ss= " + Ze.mbs.length + "; lvrsid = " + st.context.sid + "; sid = " + Z.sid, l)), kt == C && Ze.mbs.length === 1 && (f(Ze.mbs), je({}), ue());
               break;
             case m:
               ((qt) => {
@@ -47870,7 +47846,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
               })($t);
               break;
             case b:
-              z.gs() !== C && !W || (xt = u.now(), z.ghb(), z.bium() || ue("HBP"), (Xe = { op: [], bc: !0, cmd: { t: g }, context: { sid: Z.sid, rto: Z.rto, CAID: !0, pub: z.gpm() } }).context.st = xt, Xe.context.st, Xe.rtt = ve(), z.buim() && (Xe.context.CAID = !1, Xe.context.CAID), xt = ne(), re(Xe, xt), z.ihb(), u.now());
+              z.gs() !== C && !W || (xt = u.now(), z.ghb(), z.bium() || de("HBP"), (Xe = { op: [], bc: !0, cmd: { t: g }, context: { sid: Z.sid, rto: Z.rto, CAID: !0, pub: z.gpm() } }).context.st = xt, Xe.context.st, Xe.rtt = ve(), z.buim() && (Xe.context.CAID = !1, Xe.context.CAID), xt = ne(), re(Xe, xt), z.ihb(), u.now());
               break;
             case v:
               p(Ue = $t), G() === C && (z.gqj() ? (Ue.cmd.smags.ds = { ops: N.c2d(Ue.cmd.smags.ds) }, Ue.cmd.smags.ds = i(Ue.cmd.smags.ds)) : z.gcm() && (Ue.cmd.smags.ds = Ue.cmd.smags.ds[0].cr), Ue.cmd.smags.success = !0, z.smagsr(Ue.cmd.smags));
@@ -47879,13 +47855,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), 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");
+              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"), de("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), 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"));
+              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"), de("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);
@@ -47978,7 +47954,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
       if (C() && !E.bc)
         throw l(E), l(E), new Error("ESTOP:perr=1002;RoleVio");
       E.op && 0 < E.op.length && E.context.seq, l(E), ((z, I) => {
-        var H = I.gjs(), J = I.gdft(), K = I.glx(), R = I.gfln(), q = I.gsj(), W = I.gqj(), U = I.gcm(), Z = I.pt.gct(), Y = I.tm, X = I.sus, G = I.mdom, ee = I.cdm, ae = I.ird, de = I.scp;
+        var H = I.gjs(), J = I.gdft(), K = I.glx(), R = I.gfln(), q = I.gsj(), W = I.gqj(), U = I.gcm(), Z = I.pt.gct(), Y = I.tm, X = I.sus, G = I.mdom, ee = I.cdm, ae = I.ird, ue = I.scp;
         if (!Y && (!H || J || K) && !m(z) && !X()) {
           if (h(z))
             z.context.ks = z.op.start, z.context.js = z.op.end, (J || K) && (z.context.startBlkPos = z.op.startBlkPos, z.context.endBlkPos = z.op.endBlkPos, l(z)), R && (z.context.startid = z.op.startid, z.context.endid = z.op.endid, l(z));
@@ -47989,7 +47965,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
               z.context.ks = H.start, z.context.js = H.end;
             else {
               if (!R)
-                return J || K ? H != null && (z.context.ks = H.start, z.context.js = H.end, z.context.startBlkPos = H.startBlkPos, z.context.endBlkPos = H.endBlkPos, l(z)) : (de(Z.dmid, H.start), z.context.ks = H.start, z.context.js = H.end);
+                return J || K ? H != null && (z.context.ks = H.start, z.context.js = H.end, z.context.startBlkPos = H.startBlkPos, z.context.endBlkPos = H.endBlkPos, l(z)) : (ue(Z.dmid, H.start), z.context.ks = H.start, z.context.js = H.end);
               z.context.ks = H.start, z.context.js = H.end, z.context.startid = H.startid, z.context.endid = H.endid;
             }
         }
@@ -48072,7 +48048,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
   }, { "../../../codox-shared/src/com/constants": 217, "../../../codox-shared/src/com/lib": 219, "../../../codox-shared/src/com/log": 220, "../../../codox-shared/src/com/util": 221, "./off": 570 }], 572: [function(e, s, o) {
     var r, a = (r = e("@babel/runtime/helpers/interopRequireDefault"))(e("@babel/runtime/helpers/typeof")), l = r(e("@babel/runtime/helpers/slicedToArray")), i = e("../util/lib").clearTimer, u = (r = e("../../../codox-shared/src/com/util")).clone, d = r.logClone, p = (e("../../../codox-shared/src/com/log").stringify, e("../../../codox-shared/src/com/log").ins), f = e("../../../codox-shared/src/com/constants").ONLINE, h = e("../../../codox-json-ot/lib/").type.transform, m = e("../../../codox-shared/src/dtf/dtf").tp, g = (r = e("../../../codox-shared/src/com/lib")).mfso, v = r.ppos, b = r.pid, _ = r.idlt, w = r.idif, E = e("../../../codox-shared/src/gt/xf").tfp;
     s.exports = function(x) {
-      var y = x.cw, S = x.app, C = y, O = x.cmd, F = x.type, B = x.obfroh, M = x.obfcr, L = {}, P = C.pt.gct(), T = null, N = S, D = S.cid, A = C.glx(), z = C.gdft(), I = C.gfln(), H = C.gfl(), J = C.gqj(), K = C.gtn(), R = C.gjs(), q = C.gcm(), W = C.gtx(), U = C.gsj(), Z = (y = C.gmi(), (x = (0, l.default)(y, 3))[0]), Y = x[1], X = x[2], G = C.gs, ee = C.scp, ae = C.gcp, de = C.ssl, ue = C.rsl;
+      var y = x.cw, S = x.app, C = y, O = x.cmd, F = x.type, B = x.obfroh, M = x.obfcr, L = {}, P = C.pt.gct(), T = null, N = S, D = S.cid, A = C.glx(), z = C.gdft(), I = C.gfln(), H = C.gfl(), J = C.gqj(), K = C.gtn(), R = C.gjs(), q = C.gcm(), W = C.gtx(), U = C.gsj(), Z = (y = C.gmi(), (x = (0, l.default)(y, 3))[0]), Y = x[1], X = x[2], G = C.gs, ee = C.scp, ae = C.gcp, ue = C.ssl, de = C.rsl;
       function ne(re, fe) {
         return re.startid !== fe.startid || re.start !== fe.start || re.endid !== fe.endid || re.end !== fe.end;
       }
@@ -48105,7 +48081,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
       }
       function Te(re) {
         d(re = L);
-        var fe = document.activeElement, le = P.dmid, ke = (B || !I && !H || le === O.dmid || O.x.focus(), de(O)), Oe = O.d(), Ce = [];
+        var fe = document.activeElement, le = P.dmid, ke = (B || !I && !H || le === O.dmid || O.x.focus(), ue(O)), Oe = O.d(), Ce = [];
         if (I)
           (nt = ((Ze, Qe) => {
             if (JSON.stringify(Qe) != "{}" && (Qe = ((We) => {
@@ -48152,7 +48128,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           }
           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;
+        return de(O, ke), (I || H) && fe && le !== O.dmid && fe.focus(), Ce;
       }
       function ce(re, fe) {
         var le;
@@ -48453,17 +48429,17 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         (Y = U = q).data.ne || ((R = M(R, U)) === null || R.do.length === 0 || R.nil ? U.data.ne = !0 : ((U = d(y.itaot)).path = R.dm, R.do[Z = 0].cr ? U.offset = 0 : (U.offset = R.do[0].tg, Z = 1), U.text = R.do[Z].cr, R.do[Z].sx && (U.marks = K(R.do[Z].sx)), U.data = Y.data)), q = U, W.push(q);
       }, function(R, q, W) {
         for (var U = [], Z = U, Y = q, X = L(R, q), G = 0, ee = 0; ee < X.length; ee++) {
-          var ae = d(y.rtaot), de = (ae.data = Y.data, ae.marks = Y.marks, X[ee]);
-          if (de.nil || de.do.length === 0)
+          var ae = d(y.rtaot), ue = (ae.data = Y.data, ae.marks = Y.marks, X[ee]);
+          if (ue.nil || ue.do.length === 0)
             ae.data.ne = !0, Z.push(ae);
           else {
-            ae.path = de.dm;
-            for (var ue = d(de.do), ne = 0, Se = 0, ve = 0, ge = 0; ge < ue.length; ge++)
-              ue[ge].sc && (ve += ue[ge].sc);
+            ae.path = ue.dm;
+            for (var de = d(ue.do), ne = 0, Se = 0, ve = 0, ge = 0; ge < de.length; ge++)
+              de[ge].sc && (ve += de[ge].sc);
             var Te = G;
-            for (G += ve; 0 < ue.length; ) {
-              var ce = d(ae), re = (ce.text = 0 < Te ? Y.text.slice(-G, -Te) : Y.text.slice(-G), ce.marks = Y.marks, ue.shift());
-              ce.offset = ne, re.tg && (ne += re.tg, ce.offset = ne, re = ue.shift()), re.sc && re.sc != ce.text.length && (re.sc, ce.text.length, ce.text = Y.text.slice(Se, Se + re.sc), Se += re.sc), Z.push(ce);
+            for (G += ve; 0 < de.length; ) {
+              var ce = d(ae), re = (ce.text = 0 < Te ? Y.text.slice(-G, -Te) : Y.text.slice(-G), ce.marks = Y.marks, de.shift());
+              ce.offset = ne, re.tg && (ne += re.tg, ce.offset = ne, re = de.shift()), re.sc && re.sc != ce.text.length && (re.sc, ce.text.length, ce.text = Y.text.slice(Se, Se + re.sc), Se += re.sc), Z.push(ce);
             }
           }
         }
@@ -48476,8 +48452,8 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
             ee.data.ne = !0, Y.push(ee);
           else {
             ee.path = ae.dm;
-            for (var de = d(ae.do), ue = 0; 0 < de.length; ) {
-              var ne = d(ee), Se = ((Se = de.shift()).sx ? ne.offset = 0 : (ue += Se.tg, ne.offset = ue, Se = de.shift()), ne.length = Se.tg, ue += Se.tg, K(Se.sx));
+            for (var ue = d(ae.do), de = 0; 0 < ue.length; ) {
+              var ne = d(ee), Se = ((Se = ue.shift()).sx ? ne.offset = 0 : (de += Se.tg, ne.offset = de, Se = ue.shift()), ne.length = Se.tg, de += Se.tg, K(Se.sx));
               ne.mark = Se[0], Y.push(ne);
             }
           }
@@ -48491,8 +48467,8 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
             ee.data.ne = !0, Y.push(ee);
           else {
             ee.path = ae.dm;
-            for (var de = d(ae.do), ue = 0; 0 < de.length; ) {
-              var ne = d(ee), Se = ((Se = de.shift()).sx ? ne.offset = 0 : (ue += Se.tg, ne.offset = ue, Se = de.shift()), ne.length = Se.tg, ue += Se.tg, ((ge) => {
+            for (var ue = d(ae.do), de = 0; 0 < ue.length; ) {
+              var ne = d(ee), Se = ((Se = ue.shift()).sx ? ne.offset = 0 : (de += Se.tg, ne.offset = de, Se = ue.shift()), ne.length = Se.tg, de += Se.tg, ((ge) => {
                 var Te, ce, re = [];
                 for (Te in ge)
                   ge[Te] || ((ce = d(S)).type = Te, re.push(ce));
@@ -48647,17 +48623,17 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
               if (Y.length === 3 && Y[0].data.tn === 3)
                 E[Y[0].key] == C[5] && E[Y[1].key] == C[9] && E[Y[2].key] == C[9] ? (X[1].do[0].ien = !0, X[2].do[0].ien = !0, X[1].do[0].pem = Z[0].position, X[2].do[0].pem = Z[0].position, U = X[0].do.length, X[0].do[U - 1].ien = !0) : E[Y[0].key] == C[8] && E[Y[1].key] == C[1] && E[Y[2].key] == C[6] && (X[0].do[0].den = !0, X[0].do[0].pem = Z[2].position, v(X[0].dm, Z[1].path) ? (X[0].do[0].dlen = 0, X[0].do[0].extra = Z[1].text.length) : (X[0].do[0].dlen = Z[1].text.length, X[0].do[0].extra = 0), X[0].do[0].two = !0, X[1].den = !0, X[2].den = !0);
               else if (1 < Y.length && 1 < Y[0].data.tn && E[Y[0].key] == C[8] && E[Y[Y.length - 1].key] == C[6] && (Y.length === 2 || !E[Y[Y.length - 2].key] == C[6])) {
-                var de = 0;
+                var ue = 0;
                 for (ee = 0; ee < Y.length; ee++) {
                   if (E[Y[ee].key] != C[8]) {
-                    de = ee - 1;
+                    ue = ee - 1;
                     break;
                   }
                   X[ee].do[0].den = !0, X[ee].do[0].two = !1;
                 }
-                for (var ue = 0, ne = 0, Se = de + 1; Se < Y.length - 1; Se++)
-                  v(X[de].dm, Z[Se].path) ? ne += Z[Se].text.length : ue += Z[Se].text.length;
-                X[de].do[0].pem = Z[Z.length - 1].position, X[de].do[0].dlen = ue, X[de].do[0].extra = ne, X[de].do[0].two = !0, X[X.length - 1].den = !0, 2 < Y.length && (X[X.length - 2].den = !0, X[X.length - 3].den = !0);
+                for (var de = 0, ne = 0, Se = ue + 1; Se < Y.length - 1; Se++)
+                  v(X[ue].dm, Z[Se].path) ? ne += Z[Se].text.length : de += Z[Se].text.length;
+                X[ue].do[0].pem = Z[Z.length - 1].position, X[ue].do[0].dlen = de, X[ue].do[0].extra = ne, X[ue].do[0].two = !0, X[X.length - 1].den = !0, 2 < Y.length && (X[X.length - 2].den = !0, X[X.length - 3].den = !0);
               }
               return W.ao = Y, W.op = X, W.ao, !0;
             })(R);
@@ -48668,8 +48644,8 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
               0 < U[0].position && (X.tg = U[0].position, Y.do.push(X));
               for (var G = U[1].node.leaves, ee = 0; ee < G.length; ee++) {
                 if ((X = {}).cr = G[ee].text, 0 < G[ee].marks.length) {
-                  for (var ae = {}, de = 0; de < G[ee].marks.length; de++)
-                    ae[G[ee].marks[de].type] = !0;
+                  for (var ae = {}, ue = 0; ue < G[ee].marks.length; ue++)
+                    ae[G[ee].marks[ue].type] = !0;
                   X.sx = ae;
                 }
                 Y.do.push(X);
@@ -48717,12 +48693,12 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
                 }
                 var G = 0, ee = 0, ae = (W[0].do[0].tg && (ee = W[0].do[0].tg, G = 1), U[3].position - U[0].position);
                 U[0].position = ee, U[2].position = ee, U[3].position = ee + ae, W[0].do[0].sx ? U[1].position = 0 : U[1].position = W[0].do[0].tg;
-                var de = U[1].node.leaves;
-                for (Z = 0; Z < de.length; Z++) {
-                  var ue = W[0].do[Z + G];
-                  if (de[Z].text = ue.cr, ue.sx) {
+                var ue = U[1].node.leaves;
+                for (Z = 0; Z < ue.length; Z++) {
+                  var de = W[0].do[Z + G];
+                  if (ue[Z].text = de.cr, de.sx) {
                     ge = void 0, Te = void 0, ne = void 0, Se = void 0;
-                    var ne, Se, ve = ue.sx, ge = de[Z], Te = [];
+                    var ne, Se, ve = de.sx, ge = ue[Z], Te = [];
                     for (ne in ve)
                       ve[ne] && ((Se = d(S)).type = ne, Te.push(Se));
                     ge.marks = Te;
@@ -48771,12 +48747,12 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
               if (Z = G, Y = x.ghb(), X = (E.now() - O) / 1e3, Z.a ? Z.a === K || (Z.cmd && Z.cmd.t && Z.cmd.t == "HBP" || (w || console.error("[codoxi]- nemsg:  t = " + X + "; hbc = " + Y + "; sid = " + T + "; unexpected msg = ", Z), C("[codoxi]- nemsg:   t = " + X + "; hbc = " + Y + "; sid = " + T, l)), 0) : (w || console.error("[codoxi]- ivmsg:  t = " + X + "; hbc = " + Y + "; sid = " + T + "; missing msg.a, invalidmsg = ", Z), C("[codoxi]- ivmsg:   t = " + X + "; hbc = " + Y + "; sid = " + T, l), 0))
                 switch (G.a) {
                   case v:
-                    var de = B();
+                    var ue = B();
                     if (typeof G.caid != "string")
                       throw new Error("Invalid client id");
                     L.SMSubSt = L.SMConEd = E.now(), T = G.caid, x.setSID(T), x.sid = T;
-                    var ue = G, ne = ue.ccva, Se = ne.join(" "), ve = x.cver, ge = ue.smv;
-                    if (x.setSMV(ue.smv), !ne || !ge)
+                    var de = G, ne = de.ccva, Se = ne.join(" "), ve = x.cver, ge = de.smv;
+                    if (x.setSMV(de.smv), !ne || !ge)
                       throw new h("cve2", ve, ge, Se);
                     for (var Te = !1, ce = 0; ce < ne.length; ce++)
                       if (Math.trunc(ve) == ne[ce]) {
@@ -48785,13 +48761,13 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
                       }
                     if (!Te)
                       throw new h("cve1", ve, ge, Se);
-                    (ue = x.minfo).sid = T, ue.userinfo.jointime = /* @__PURE__ */ new Date(), ge = (E.now() - O) / 1e3, C("[codoxi]* ssub, t = " + ge + "; seid = " + S.sid, l), J = E.now(), M(), clearTimeout(H), H = setTimeout(function() {
+                    (de = x.minfo).sid = T, de.userinfo.jointime = /* @__PURE__ */ new Date(), ge = (E.now() - O) / 1e3, C("[codoxi]* ssub, t = " + ge + "; seid = " + S.sid, l), J = E.now(), M(), clearTimeout(H), H = setTimeout(function() {
                       var re = (E.now() - O) / 1e3;
-                      C("[codoxe]-- subf(t), r=13; t = " + re + "; sid = " + T, l), de !== g ? F(13) : C("[codoxe]-- subf(ts), t = " + ae + "; sid = " + T, l);
+                      C("[codoxe]-- subf(t), r=13; t = " + re + "; sid = " + T, l), ue !== g ? F(13) : C("[codoxe]-- subf(ts), t = " + ae + "; sid = " + T, l);
                     }, I), K = b;
                     break;
                   case b:
-                    Se = x.subr, L.SMSubEd = E.now(), ue = E.now() - J, x.srtt(ue), ue < 0 && (w || console.error("[codoxi]-- rtt-sub:  t = " + ae + "; hbC = " + ee + "; rtt= " + ue + "; priT=" + L.SMSubSt + "; curT=" + L.SMSubEd + "; sid=" + T), 0 < A) && (C("[codoxi]-- rtt-sub:  t = " + ae + "; hbC = " + ee + "; rtt= " + ue + "; priT=" + L.SMSubSt + "; curT=" + L.SMSubEd + "; sid=" + T), N(new Error("reason RTT")), A--), clearTimeout(H), Se(G), K = _;
+                    Se = x.subr, L.SMSubEd = E.now(), de = E.now() - J, x.srtt(de), de < 0 && (w || console.error("[codoxi]-- rtt-sub:  t = " + ae + "; hbC = " + ee + "; rtt= " + de + "; priT=" + L.SMSubSt + "; curT=" + L.SMSubEd + "; sid=" + T), 0 < A) && (C("[codoxi]-- rtt-sub:  t = " + ae + "; hbC = " + ee + "; rtt= " + de + "; priT=" + L.SMSubSt + "; curT=" + L.SMSubEd + "; sid=" + T), N(new Error("reason RTT")), A--), clearTimeout(H), Se(G), K = _;
                     break;
                   case _:
                     x.ROH(G);
@@ -48929,18 +48905,18 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
                 })(K, R, q);
                 break;
               case "del":
-                var G, ee, ae, de, ue = K, ne = R, Se = ue.dm, ve = ne.dm, ge = Se.length - 1, Te = ue.do[0].ao;
-                if (ne.do[0].ao, ne.do[0].type, !ue.nil)
+                var G, ee, ae, ue, de = K, ne = R, Se = de.dm, ve = ne.dm, ge = Se.length - 1, Te = de.do[0].ao;
+                if (ne.do[0].ao, ne.do[0].type, !de.nil)
                   if (Se[ge] < ve[ge])
-                    ue.do[0].ao === "mvn" && ue.do[0].type == "del" && ue.do[0].pxs && ue.do[0].pxs === "s" ? Se[ge] + 1 === ve[ge] && ne.do[0].dmpo && ne.do[0].type == "del" && ne.do[0].ao == "mn" && ve.shift() : Se[ge] + 1 === ve[ge] && ue.do[0].type == "del" && ue.do[0].ao == "rn" && ne.do[0].dmpo && ne.do[0].type == "del" && ne.do[0].ao == "mn" ? ne.nil = !0 : m(ue) && ue.do[0].two ? (M(ne) || (G = P(ne), ee = ue.do[0].pem, Se[ge] + 1 === ve[ge] && T(ne.do, G + ee + ue.do[0].dlen - ue.do[0].extra)), ve[ge] = ve[ge] - 2) : ve[ge] = ve[ge] - 1;
+                    de.do[0].ao === "mvn" && de.do[0].type == "del" && de.do[0].pxs && de.do[0].pxs === "s" ? Se[ge] + 1 === ve[ge] && ne.do[0].dmpo && ne.do[0].type == "del" && ne.do[0].ao == "mn" && ve.shift() : Se[ge] + 1 === ve[ge] && de.do[0].type == "del" && de.do[0].ao == "rn" && ne.do[0].dmpo && ne.do[0].type == "del" && ne.do[0].ao == "mn" ? ne.nil = !0 : m(de) && de.do[0].two ? (M(ne) || (G = P(ne), ee = de.do[0].pem, Se[ge] + 1 === ve[ge] && T(ne.do, G + ee + de.do[0].dlen - de.do[0].extra)), ve[ge] = ve[ge] - 2) : ve[ge] = ve[ge] - 1;
                   else if (Se[ge] === ve[ge])
                     if (ne.do[0].dmpo)
                       switch (Te) {
                         case "mvn":
-                          ne.do[0].type == "del" && ne.do[0].ao == "mvn" ? ne.nil = !0 : ue.do[0].pxs && ue.do[0].pxs === "s" ? (ne.do[0].type == "ins" && ne.do[0].ao, ve.pop(), ne.dm = ve) : ne.do[0].type == "del" && ne.do[0].ao == "rn" ? ne.nil = !0 : 0 < ve[ge] && (ve[ge] = ve[ge] - 1);
+                          ne.do[0].type == "del" && ne.do[0].ao == "mvn" ? ne.nil = !0 : de.do[0].pxs && de.do[0].pxs === "s" ? (ne.do[0].type == "ins" && ne.do[0].ao, ve.pop(), ne.dm = ve) : ne.do[0].type == "del" && ne.do[0].ao == "rn" ? ne.nil = !0 : 0 < ve[ge] && (ve[ge] = ve[ge] - 1);
                           break;
                         case "mn":
-                          ne.do[0].type === "upd" ? 0 < ve[ge] && (ve[ge] = ve[ge] - 1) : ne.do[0].type === "del" && ne.do[0].ao === "mn" ? ne.nil = !0 : ne.do[0].type === "del" && ne.do[0].ao === "rn" ? m(ne) ? 0 < ve[ge] && (ve[ge] = ve[ge] - 1) : E(ne, ue.do[0].target, !0) : (ne.do[0].type === "ins" && ne.do[0].ao, 0 < ve[ge] && (ve[ge] = ve[ge] - 1)), Se.length !== ve.length && (F(ne) && ve[1 + ge] === 0 || ve[1 + ge] === 1) && 0 < (ae = ue.do[0].target) && (ne.do[0].tg && !ne.do[0].sx ? ne.do[0].tg = ne.do[0].tg + ae : ne.do.unshift({ tg: ae })), Se.length !== ve.length && (ve[1 + ge] = ve[1 + ge] + ue.do[0].p - 1);
+                          ne.do[0].type === "upd" ? 0 < ve[ge] && (ve[ge] = ve[ge] - 1) : ne.do[0].type === "del" && ne.do[0].ao === "mn" ? ne.nil = !0 : ne.do[0].type === "del" && ne.do[0].ao === "rn" ? m(ne) ? 0 < ve[ge] && (ve[ge] = ve[ge] - 1) : E(ne, de.do[0].target, !0) : (ne.do[0].type === "ins" && ne.do[0].ao, 0 < ve[ge] && (ve[ge] = ve[ge] - 1)), Se.length !== ve.length && (F(ne) && ve[1 + ge] === 0 || ve[1 + ge] === 1) && 0 < (ae = de.do[0].target) && (ne.do[0].tg && !ne.do[0].sx ? ne.do[0].tg = ne.do[0].tg + ae : ne.do.unshift({ tg: ae })), Se.length !== ve.length && (ve[1 + ge] = ve[1 + ge] + de.do[0].p - 1);
                           break;
                         case "rn":
                           ne.do[0].type === "del" ? ne.do[0].ao === "rn" || ne.do[0].ao === "mn" ? ne.nil = !0 : ne.do[0].ao : (ne.do[0].type !== "ins" || ne.do[0].ao === "sn" || ne.do[0].ao === "mvn") && (ne.nil = !0);
@@ -48948,16 +48924,16 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
                     else
                       switch (Te) {
                         case "mvn":
-                          ue.do[0].pxs && ue.do[0].pxs === "s" ? (ve.pop(), ne.dm = ve) : 0 < ve[ge] && (ve[ge] = ve[ge] - 1);
+                          de.do[0].pxs && de.do[0].pxs === "s" ? (ve.pop(), ne.dm = ve) : 0 < ve[ge] && (ve[ge] = ve[ge] - 1);
                           break;
                         case "mn":
-                          0 < ve[ge] && (ve[ge] = ve[ge] - 1), Se.length !== ve.length && (B(ne) && ve[1 + ge] === 0 || ve[1 + ge] === 1) && 0 < (de = ue.do[0].target) && (ne.do[0].tg && !ne.do[0].sx ? ne.do[0].tg = ne.do[0].tg + de : ne.do.unshift({ tg: de })), ve[1 + ge] = ve[1 + ge] + ue.do[0].p - 1;
+                          0 < ve[ge] && (ve[ge] = ve[ge] - 1), Se.length !== ve.length && (B(ne) && ve[1 + ge] === 0 || ve[1 + ge] === 1) && 0 < (ue = de.do[0].target) && (ne.do[0].tg && !ne.do[0].sx ? ne.do[0].tg = ne.do[0].tg + ue : ne.do.unshift({ tg: ue })), ve[1 + ge] = ve[1 + ge] + de.do[0].p - 1;
                           break;
                         case "rn":
                           D(ne) ? ne.nil = !0 : B(ne) ? ne.n2b = !0 : (x(ne), ne.nil = !0);
                       }
                   else
-                    Se[ge] === ve[ge] + 1 && ue.do[0].type == "del" && ue.do[0].ao == "mn" && ne.do[0].dmpo && ne.do[0].type == "del" && ne.do[0].ao == "rn" && !m(ne) && E(ne, ue.do[0].target, !1);
+                    Se[ge] === ve[ge] + 1 && de.do[0].type == "del" && de.do[0].ao == "mn" && ne.do[0].dmpo && ne.do[0].type == "del" && ne.do[0].ao == "rn" && !m(ne) && E(ne, de.do[0].target, !1);
                 break;
               case "upd":
                 G = R, ee = q, W = (Te = K).dm, U = G.dm, W[Z = W.length - 1] === U[Z] && W.length === U.length && G.do[0].dmpo && G.do[0].type === "upd" && ee && (G.do[0].sx && Te.do[0].sx ? G.do[0].sx.type = Te.do[0].sx.type : G.nil = !0);
@@ -49101,16 +49077,16 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
                 R.op[X];
               else {
                 R.op[X];
-                var G = K.op[Y], ee = R.op[X], ae = L(K.op[Y]), de = L(R.op[X]), ue = (ue = K.op[Y], W = R.op[X], ue === null || W === null || ue && ue.do && ue.do.length === 0 || W && W.do && W.do.length === 0 ? "wgqui" : ue.do[0].dmpo || W.do[0].dmpo ? "xgqui" : S(ue.dm, W.dm) ? "tqui" : "wgqui");
-                switch (ue) {
+                var G = K.op[Y], ee = R.op[X], ae = L(K.op[Y]), ue = L(R.op[X]), de = (de = K.op[Y], W = R.op[X], de === null || W === null || de && de.do && de.do.length === 0 || W && W.do && W.do.length === 0 ? "wgqui" : de.do[0].dmpo || W.do[0].dmpo ? "xgqui" : S(de.dm, W.dm) ? "tqui" : "wgqui");
+                switch (de) {
                   case "tqui":
                     var ne, Se = [], ve = [];
-                    ae && de ? ve = h(K.op[Y + 1]) || h(R.op[X + 1]) ? (Se = d(K.op[Y].do), d(R.op[X].do)) : (Se = i(R.op[X].do, K.op[Y].do, !0), i(K.op[Y].do, R.op[X].do, !0)) : ae && !de ? (ne = P(K.op[Y]), y(R.op[X], ne) && (K.op[Y].isInDR = ne), ne = i(R.op[X].do, ne, !1), R.op[X].do, Se = d(K.op[Y].do), ve = d(R.op[X].do), T(Se, ne)) : !ae && de ? (ne = P(R.op[X]), y(K.op[Y], ne) && (R.op[X].isInDR = ne), K.op[Y].do, ne = i(K.op[Y].do, ne, !1), ve = d(R.op[X].do), Se = d(K.op[Y].do), T(ve, ne)) : (Se = i(R.op[X].do, K.op[Y].do, Z), ve = i(K.op[Y].do, R.op[X].do, U)), G.do = Se, ee.do = ve;
+                    ae && ue ? ve = h(K.op[Y + 1]) || h(R.op[X + 1]) ? (Se = d(K.op[Y].do), d(R.op[X].do)) : (Se = i(R.op[X].do, K.op[Y].do, !0), i(K.op[Y].do, R.op[X].do, !0)) : ae && !ue ? (ne = P(K.op[Y]), y(R.op[X], ne) && (K.op[Y].isInDR = ne), ne = i(R.op[X].do, ne, !1), R.op[X].do, Se = d(K.op[Y].do), ve = d(R.op[X].do), T(Se, ne)) : !ae && ue ? (ne = P(R.op[X]), y(K.op[Y], ne) && (R.op[X].isInDR = ne), K.op[Y].do, ne = i(K.op[Y].do, ne, !1), ve = d(R.op[X].do), Se = d(K.op[Y].do), T(ve, ne)) : (Se = i(R.op[X].do, K.op[Y].do, Z), ve = i(K.op[Y].do, R.op[X].do, U)), G.do = Se, ee.do = ve;
                     break;
                   case "xgqui":
                     G = f(R.op[X], K.op[Y], Z), ee = f(K.op[Y], R.op[X], U);
                 }
-                if (K.op[Y] = G, R.op[X] = ee, K.op[Y].do.length === 0 && (K.op[Y].nil = !0), Y < K.op.length - 1 && _(K.op[Y], K.op[Y + 1], R.op[X], ae), 0 < Y && b(K.op[Y - 1], K.op[Y]), R.op[X].do.length === 0 && (R.op[X].nil = !0), X < R.op.length - 1 && _(R.op[X], R.op[X + 1], K.op[Y], de), 0 < X && b(R.op[X - 1], R.op[X]), Y < K.op.length - 1 && v(K.op[Y], K.op[Y + 1]), 0 < Y && g(K.op[Y - 1], K.op[Y]), X < R.op.length - 1 && v(R.op[X], R.op[X + 1]), 0 < X && g(R.op[X - 1], R.op[X]), K.op[Y].nil || K.op[Y].n2b || a) {
+                if (K.op[Y] = G, R.op[X] = ee, K.op[Y].do.length === 0 && (K.op[Y].nil = !0), Y < K.op.length - 1 && _(K.op[Y], K.op[Y + 1], R.op[X], ae), 0 < Y && b(K.op[Y - 1], K.op[Y]), R.op[X].do.length === 0 && (R.op[X].nil = !0), X < R.op.length - 1 && _(R.op[X], R.op[X + 1], K.op[Y], ue), 0 < X && b(R.op[X - 1], R.op[X]), Y < K.op.length - 1 && v(K.op[Y], K.op[Y + 1]), 0 < Y && g(K.op[Y - 1], K.op[Y]), X < R.op.length - 1 && v(R.op[X], R.op[X + 1]), 0 < X && g(R.op[X - 1], R.op[X]), K.op[Y].nil || K.op[Y].n2b || a) {
                   K.op[Y];
                   break;
                 }
@@ -49130,13 +49106,13 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
                 break;
               case "xglou":
                 ae = X = void 0;
-                var Y = K[U], X = R, G = q, ee = Y.dm, ae = X.path, de = ee.length - 1, ue = Y.do[0].pos;
+                var Y = K[U], X = R, G = q, ee = Y.dm, ae = X.path, ue = ee.length - 1, de = Y.do[0].pos;
                 switch (Y.do[0].type) {
                   case "ins":
-                    ue < ae[de] && !a ? Y.do[0].ao === "mvn" || (ae[de] = ae[de] + Y.do[0].len) : ue === ae[de] && (Y.do[0].ao === "sn" ? (X.pos > Y.do[0].target || X.pos == Y.do[0].target && G) && (X.pos, Y.do[0].target, ae[de] = ae[de] + 1, X.pos = X.pos - Y.do[0].target) : Y.do[0].ao === "mvn" ? ae[ae.length] = 0 : Y.do[0].ao === "in" ? ae[de] = ae[de] + 1 : Y.do[0].ao);
+                    de < ae[ue] && !a ? Y.do[0].ao === "mvn" || (ae[ue] = ae[ue] + Y.do[0].len) : de === ae[ue] && (Y.do[0].ao === "sn" ? (X.pos > Y.do[0].target || X.pos == Y.do[0].target && G) && (X.pos, Y.do[0].target, ae[ue] = ae[ue] + 1, X.pos = X.pos - Y.do[0].target) : Y.do[0].ao === "mvn" ? ae[ae.length] = 0 : Y.do[0].ao === "in" ? ae[ue] = ae[ue] + 1 : Y.do[0].ao);
                     break;
                   case "del":
-                    ue < ae[de] && !a ? Y.do[0].ao === "mvn" && Y.do[0].pxs && Y.do[0].pxs === "s" || (ae[de] = ae[de] - Y.do[0].len) : ue === ae[de] && (Y.do[0].ao === "mvn" ? Y.do[0].pxs && Y.do[0].pxs === "s" ? (ae = ae.slice(0, ae.length - 1), X.path = ae) : 0 < ae[de] && (ae[de] = ae[de] - Y.do[0].len) : Y.do[0].ao === "mn" ? 0 < ae[de] && (ae[de] = ae[de] - 1, X.pos = X.pos + Y.do[0].target) : Y.do[0].ao === "rn" ? 0 < ae[de] && (ae[de] = ae[de] - 1, X.pos = 0) : Y.do[0].ao);
+                    de < ae[ue] && !a ? Y.do[0].ao === "mvn" && Y.do[0].pxs && Y.do[0].pxs === "s" || (ae[ue] = ae[ue] - Y.do[0].len) : de === ae[ue] && (Y.do[0].ao === "mvn" ? Y.do[0].pxs && Y.do[0].pxs === "s" ? (ae = ae.slice(0, ae.length - 1), X.path = ae) : 0 < ae[ue] && (ae[ue] = ae[ue] - Y.do[0].len) : Y.do[0].ao === "mn" ? 0 < ae[ue] && (ae[ue] = ae[ue] - 1, X.pos = X.pos + Y.do[0].target) : Y.do[0].ao === "rn" ? 0 < ae[ue] && (ae[ue] = ae[ue] - 1, X.pos = 0) : Y.do[0].ao);
                     break;
                   default:
                     Y.do[0].type;
@@ -49429,18 +49405,18 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
               q += 2;
             else if (R) {
               var ae;
-              if (0 <= (ue = A + K - X) && ue < z && H[ue] !== -1 && (ae = T - H[ue]) <= Se)
+              if (0 <= (de = A + K - X) && de < z && H[de] !== -1 && (ae = T - H[de]) <= Se)
                 return l(L, P, Se, ee);
             }
           }
-          for (var de = -Y + U; de <= Y - Z; de += 2) {
-            for (var ue = A + de, ne = (ae = de === -Y || de !== Y && H[ue - 1] < H[ue + 1] ? H[ue + 1] : H[ue - 1] + 1) - de; ae < T && ne < N && L.charAt(T - ae - 1) === P.charAt(N - ne - 1); )
+          for (var ue = -Y + U; ue <= Y - Z; ue += 2) {
+            for (var de = A + ue, ne = (ae = ue === -Y || ue !== Y && H[de - 1] < H[de + 1] ? H[de + 1] : H[de - 1] + 1) - ue; ae < T && ne < N && L.charAt(T - ae - 1) === P.charAt(N - ne - 1); )
               ae++, ne++;
-            if (H[ue] = ae, T < ae)
+            if (H[de] = ae, T < ae)
               Z += 2;
             else if (N < ne)
               U += 2;
-            else if (!R && 0 <= (G = A + K - de) && G < z && I[G] !== -1) {
+            else if (!R && 0 <= (G = A + K - ue) && G < z && I[G] !== -1) {
               var Se = I[G];
               if (ee = A + Se - G, (ae = T - ae) <= Se)
                 return l(L, P, Se, ee);
@@ -49556,7 +49532,7 @@ 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), Fe = Ae(ke), De = Ae(Oe), xe = Ae(Ce), Je = Ae(H), je = (G = G ? G.prototype : void 0) ? G.valueOf : void 0;
+        var G = Function.prototype, ee = Object.prototype, ae = H["__core-js_shared__"], ue = (ae = /[^.]+$/.exec(ae && ae.keys && ae.keys.IE_PROTO || "")) ? "Symbol(src)_1." + ae : "", de = G.toString, ne = ee.hasOwnProperty, Se = ee.toString, ve = RegExp("^" + de.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; ) {
@@ -49701,7 +49677,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         }
         function Ot(Ue, Xe) {
           return function(ut) {
-            return xt(ut) && !(de && de in ut) && (st(ut) || U(ut) ? ve : A).test(Ae(ut));
+            return xt(ut) && !(ue && ue in ut) && (st(ut) || U(ut) ? ve : A).test(Ae(ut));
           }(Ue = Ue == null ? void 0 : Ue[Xe]) ? Ue : void 0;
         }
         Be.prototype.clear = function() {
@@ -49769,7 +49745,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         function Ae(Ue) {
           if (Ue != null) {
             try {
-              return ue.call(Ue);
+              return de.call(Ue);
             } catch {
             }
             try {
@@ -49853,7 +49829,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         })()) && A.isTypedArray;
         var N, D, A = Array.prototype, z = Function.prototype, I = Object.prototype, H = M["__core-js_shared__"], J = z.toString, K = I.hasOwnProperty, R = (z = /[^.]+$/.exec(H && H.keys && H.keys.IE_PROTO || "")) ? "Symbol(src)_1." + z : "", q = I.toString, W = RegExp("^" + J.call(K).replace(/[\\^$.*+?()[\]{}|]/g, "\\$&").replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g, "$1.*?") + "$"), U = (H = ee ? M.Buffer : void 0, z = M.Symbol, M.Uint8Array), Z = I.propertyIsEnumerable, Y = A.splice, X = z ? z.toStringTag : void 0, G = Object.getOwnPropertySymbols, ee = H ? H.isBuffer : void 0, ae = (N = Object.keys, D = Object, function(he) {
           return N(D(he));
-        }), de = (A = Ze(M, "DataView"), Ze(M, "Map")), ue = (H = Ze(M, "Promise"), Ze(M, "Set")), ne = (M = Ze(M, "WeakMap"), Ze(Object, "create")), Se = Ye(A), ve = Ye(de), ge = Ye(H), Te = Ye(ue), ce = Ye(M), re = (z = z ? z.prototype : void 0) ? z.valueOf : void 0;
+        }), ue = (A = Ze(M, "DataView"), Ze(M, "Map")), de = (H = Ze(M, "Promise"), Ze(M, "Set")), ne = (M = Ze(M, "WeakMap"), Ze(Object, "create")), Se = Ye(A), ve = Ye(ue), ge = Ye(H), Te = Ye(de), ce = Ye(M), re = (z = z ? z.prototype : void 0) ? z.valueOf : void 0;
         function fe(he) {
           var Ie = -1, it = he == null ? 0 : he.length;
           for (this.clear(); ++Ie < it; ) {
@@ -50068,7 +50044,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           var it = this.__data__, st = nt(it, he);
           return st < 0 ? (++this.size, it.push([he, Ie])) : it[st][1] = Ie, this;
         }, ke.prototype.clear = function() {
-          this.size = 0, this.__data__ = { hash: new fe(), map: new (de || le)(), string: new fe() };
+          this.size = 0, this.__data__ = { hash: new fe(), map: new (ue || le)(), string: new fe() };
         }, ke.prototype.delete = function(he) {
           return he = He(this, he).delete(he), this.size -= he ? 1 : 0, he;
         }, ke.prototype.get = function(he) {
@@ -50095,7 +50071,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           var it = this.__data__;
           if (it instanceof le) {
             var st = it.__data__;
-            if (!de || st.length < 199)
+            if (!ue || st.length < 199)
               return st.push([he, Ie]), this.size = ++it.size, this;
             it = this.__data__ = new ke(st);
           }
@@ -50131,7 +50107,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         function Ht(he, Ie) {
           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) {
+        (A && Bt(new A(new ArrayBuffer(1))) != S || ue && Bt(new ue()) != m || H && Bt(H.resolve()) != b || de && Bt(new de()) != w || M && Bt(new M()) != x) && (Bt = function(he) {
           var Ie = Fe(he);
           if (he = (he = Ie == v ? he.constructor : void 0) ? Ye(he) : "")
             switch (he) {
@@ -51341,11 +51317,11 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
             if (ee && f(ee, "createTextRange") && w(U = ee.createTextRange()) && (G = !0), X || G) {
               for (Y in B.initialized = !0, B.features = { implementsDomRange: X, implementsTextRange: G }, C)
                 (Z = C[Y]) instanceof J && Z.init(Z, B);
-              for (var ae = 0, de = N.length; ae < de; ++ae)
+              for (var ae = 0, ue = N.length; ae < ue; ++ae)
                 try {
                   N[ae](B);
-                } catch (ue) {
-                  M("Rangy init listener threw an exception. Continuing. Detail: " + D(ue));
+                } catch (de) {
+                  M("Rangy init listener threw an exception. Continuing. Detail: " + D(de));
                 }
             } else
               P("Neither Range nor TextRange are available");
@@ -51420,7 +51396,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
               return !0;
           return !1;
         }
-        var X, G, ee, ae = "undefined", de = U.util, ue = de.getBody, ne = (de.areHostMethods(document, ["createDocumentFragment", "createElement", "createTextNode"]) || Z.fail("document missing a Node creation method"), de.isHostMethod(document, "getElementsByTagName") || Z.fail("document missing getElementsByTagName method"), document.createElement("div"));
+        var X, G, ee, ae = "undefined", ue = U.util, de = ue.getBody, ne = (ue.areHostMethods(document, ["createDocumentFragment", "createElement", "createTextNode"]) || Z.fail("document missing a Node creation method"), ue.isHostMethod(document, "getElementsByTagName") || Z.fail("document missing getElementsByTagName method"), document.createElement("div"));
         function Se(xe) {
           for (var Je = 0; xe = xe.previousSibling; )
             ++Je;
@@ -51483,7 +51459,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           throw Z.createError("getIframeDocument: No Document object found for iframe element");
         }
         function Oe(xe) {
-          return xe && de.isHostMethod(xe, "setTimeout") && de.isHostObject(xe, "document");
+          return xe && ue.isHostMethod(xe, "setTimeout") && ue.isHostObject(xe, "document");
         }
         function Ce(xe) {
           try {
@@ -51505,7 +51481,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         function De(xe) {
           this.code = this[xe], this.codeName = xe, this.message = "DOMException: " + this.codeName;
         }
-        de.areHostMethods(ne, ["insertBefore", "appendChild", "cloneNode"]) || Z.fail("Incomplete Element implementation"), de.isHostProperty(ne, "innerHTML") || Z.fail("Element is missing innerHTML property"), ne = document.createTextNode("test"), de.areHostMethods(ne, ["splitText", "deleteData", "insertData", "appendData", "cloneNode"]) || Z.fail("Incomplete Text Node implementation"), (ne = document.createElement("b")).innerHTML = "1", G = ne.firstChild, ne.innerHTML = "<br />", X = Ce(G), U.features.crashyTextNodes = X, typeof window.getComputedStyle != ae ? ee = function(xe, Je) {
+        ue.areHostMethods(ne, ["insertBefore", "appendChild", "cloneNode"]) || Z.fail("Incomplete Element implementation"), ue.isHostProperty(ne, "innerHTML") || Z.fail("Element is missing innerHTML property"), ne = document.createTextNode("test"), ue.areHostMethods(ne, ["splitText", "deleteData", "insertData", "appendData", "cloneNode"]) || Z.fail("Incomplete Text Node implementation"), (ne = document.createElement("b")).innerHTML = "1", G = ne.firstChild, ne.innerHTML = "<br />", X = Ce(G), U.features.crashyTextNodes = X, typeof window.getComputedStyle != ae ? ee = function(xe, Je) {
           return le(xe).getComputedStyle(xe, null)[Je];
         } : typeof document.documentElement.currentStyle != ae ? ee = function(xe, Je) {
           return xe.currentStyle ? xe.currentStyle[Je] : "";
@@ -51563,9 +51539,9 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           if (typeof xe.contentDocument != ae)
             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) {
+        }, getIframeDocument: ke, getBody: de, isWindow: Oe, getContentDocument: function(xe, Je, je) {
           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)
+          if (xe ? ue.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) {
@@ -51592,7 +51568,7 @@ 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 Be = ue(xe);
+          var Be = de(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);
@@ -51604,18 +51580,18 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           return new nt(xe);
         }, 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;
+        var Y = U.dom, X = U.util, G = Y.DomPosition, ee = U.DOMException, ae = Y.isCharacterDataNode, ue = Y.getNodeIndex, de = 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) {
-          return Pe.nodeType != 3 && (ue(Pe, ze.startContainer) || ue(Pe, ze.endContainer));
+          return Pe.nodeType != 3 && (de(Pe, ze.startContainer) || de(Pe, ze.endContainer));
         }
         function Oe(Pe) {
           return Pe.document || ne(Pe.startContainer);
         }
         function Ce(Pe) {
-          return new G(Pe.parentNode, de(Pe));
+          return new G(Pe.parentNode, ue(Pe));
         }
         function Me(Pe) {
-          return new G(Pe.parentNode, de(Pe) + 1);
+          return new G(Pe.parentNode, ue(Pe) + 1);
         }
         function nt(Pe, ze, dt) {
           var _e = Pe.nodeType == 11 ? Pe.firstChild : Pe;
@@ -51672,7 +51648,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 Be(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), de(ze, this.sc) && (dt = this.sc, _e = this.so), de(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;
         } };
@@ -51730,7 +51706,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         function xt(Pe, ze) {
           Ie(Pe);
           var dt = Pe.startContainer, _e = Pe.startOffset, $e = Pe.endContainer, rt = Pe.endOffset, et = dt === $e;
-          ae($e) && 0 < rt && rt < $e.length && ve($e, rt, ze), ae(dt) && 0 < _e && _e < dt.length && (dt = ve(dt, _e, ze), et ? (rt -= _e, $e = dt) : $e == dt.parentNode && rt >= de(dt) && rt++, _e = 0), Pe.setStartAndEnd(dt, _e, $e, rt);
+          ae($e) && 0 < rt && rt < $e.length && ve($e, rt, ze), ae(dt) && 0 < _e && _e < dt.length && (dt = ve(dt, _e, ze), et ? (rt -= _e, $e = dt) : $e == dt.parentNode && rt >= ue(dt) && rt++, _e = 0), Pe.setStartAndEnd(dt, _e, $e, rt);
         }
         function kt(Pe) {
           Ie(Pe);
@@ -51807,7 +51783,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
             }
             function gt(Jt) {
               var Xt, nn = Jt.previousSibling;
-              nn && nn.nodeType == Jt.nodeType && (Xt = (Ke = Jt).length, ht = nn.length, Jt.insertData(0, nn.data), le(nn), Ke == Pt ? (Mt += ht, Pt = Ke) : Pt == Jt.parentNode && (nn = de(Jt), Mt == nn ? (Pt = Jt, Mt = Xt) : nn < Mt && Mt--));
+              nn && nn.nodeType == Jt.nodeType && (Xt = (Ke = Jt).length, ht = nn.length, Jt.insertData(0, nn.data), le(nn), Ke == Pt ? (Mt += ht, Pt = Ke) : Pt == Jt.parentNode && (nn = ue(Jt), Mt == nn ? (Pt = Jt, Mt = Xt) : nn < Mt && Mt--));
             }
             Ie(this);
             var ft, we, Ke = this.startContainer, ht = this.startOffset, Pt = this.endContainer, Mt = this.endOffset, Qt = !0;
@@ -51829,7 +51805,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           var dt = Pe == 3 || Pe == 0 ? "start" : "end", _e = (Pe = Pe == 1 || Pe == 0 ? "start" : "end", this[dt + "Container"]);
           return dt = this[dt + "Offset"], Se(_e, dt, ze[Pe + "Container"], ze[Pe + "Offset"]);
         }, insertNode: function(Pe) {
-          if (Ie(this), Ot(Pe, Qe), sn(this.startContainer), ue(Pe, this.startContainer))
+          if (Ie(this), Ot(Pe, Qe), sn(this.startContainer), de(Pe, this.startContainer))
             throw new ee("HIERARCHY_REQUEST_ERR");
           Pe = nt(Pe, this.startContainer, this.startOffset), this.setStartBefore(Pe);
         }, cloneContents: function() {
@@ -51868,7 +51844,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         }, compareNode: function(Pe) {
           Ie(this);
           var ze, dt = Pe.parentNode;
-          if (Pe = de(Pe), dt)
+          if (Pe = ue(Pe), dt)
             return ze = this.comparePoint(dt, Pe), dt = this.comparePoint(dt, Pe + 1), ze < 0 ? 0 < dt ? 2 : 0 : 0 < dt ? 1 : 3;
           throw new ee("NOT_FOUND_ERR");
         }, comparePoint: function(Pe, ze) {
@@ -51885,7 +51861,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           return kt(this);
         }, intersectsNode: function(Pe, ze) {
           var dt, _e;
-          return Ie(this), re(Pe) == re(this.startContainer) && (_e = Pe.parentNode, Pe = de(Pe), !_e || (dt = Se(_e, Pe, this.endContainer, this.endOffset), _e = Se(_e, Pe + 1, this.startContainer, this.startOffset), ze ? dt <= 0 && 0 <= _e : dt < 0 && 0 < _e));
+          return Ie(this), re(Pe) == re(this.startContainer) && (_e = Pe.parentNode, Pe = ue(Pe), !_e || (dt = Se(_e, Pe, this.endContainer, this.endOffset), _e = Se(_e, Pe + 1, this.startContainer, this.startOffset), ze ? dt <= 0 && 0 <= _e : dt < 0 && 0 < _e));
         }, 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) {
@@ -51945,7 +51921,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           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;
+        var Y, X, G, ee, ae = U.dom, ue = U.util, de = 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, Fe = ce.length; Fe--; )
@@ -52026,7 +52002,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           }, Te.extractContents = function() {
             var Me = this.nativeRange.extractContents();
             return Ce(this), Me;
-          }), Oe.removeChild(le), Oe = null, de.isHostMethod(fe, "createContextualFragment") && (Te.createContextualFragment = function(Me) {
+          }), Oe.removeChild(le), Oe = null, ue.isHostMethod(fe, "createContextualFragment") && (Te.createContextualFragment = function(Me) {
             return this.nativeRange.createContextualFragment(Me);
           }), Se(document).removeChild(re), Te.getName = function() {
             return "WrappedRange";
@@ -52037,7 +52013,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         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 } };
+            return { boundaryPosition: Me = new de(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 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; ) {
@@ -52055,9 +52031,9 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
                 en++, zt.moveStart("character", 1);
             else
               en = xe.text.length;
-            He = new ue(Me, en);
+            He = new de(Me, en);
           } else
-            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));
+            De = (Fe || !nt) && je.previousSibling, He = (Me = (Fe || nt) && je.nextSibling) && ge(Me) ? new de(Me, 0) : De && ge(De) ? new de(De, De.data.length) : new de(Je, ae.getNodeIndex(je));
           return ae.removeNode(je), { boundaryPosition: He, nodeInfo: { nodeIndex: Ht, containerElement: Je } };
         }, G = function(Ce, Me) {
           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);
@@ -52072,7 +52048,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           return "WrappedTextRange";
         }, ne.copyComparisonConstants(ke), ke.rangeToTextRange = ee = function(Ce) {
           var Me, nt;
-          return Ce.collapsed ? G(new ue(Ce.startContainer, Ce.startOffset), !0) : (Me = G(new ue(Ce.startContainer, Ce.startOffset), !0), nt = G(new ue(Ce.endContainer, Ce.endOffset), !1), (Ce = Se(ne.getRangeDocument(Ce)).createTextRange()).setEndPoint("StartToStart", Me), Ce.setEndPoint("EndToEnd", nt), Ce);
+          return Ce.collapsed ? G(new de(Ce.startContainer, Ce.startOffset), !0) : (Me = G(new de(Ce.startContainer, Ce.startOffset), !0), nt = G(new de(Ce.endContainer, Ce.endOffset), !1), (Ce = Se(ne.getRangeDocument(Ce)).createTextRange()).setEndPoint("StartToStart", Me), Ce.setEndPoint("EndToEnd", nt), Ce);
         }, ke.prototype.toTextRange = function() {
           return ee(this);
         }, U.WrappedTextRange = ke, U.features.implementsDomRange && !U.config.preferTextRange || ((le = Function("return this;")()).Range === void 0 && (le.Range = ke), U.createNativeRange = function(Ce) {
@@ -52081,7 +52057,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           return Ce = ve(Ce, Z, "createRange"), new U.WrappedRange(U.createNativeRange(Ce));
         }, U.createRangyRange = function(Ce) {
           return Ce = ve(Ce, Z, "createRangyRange"), new ne(Ce);
-        }, de.createAliasForDeprecatedMethod(U, "createIframeRange", "createRange"), de.createAliasForDeprecatedMethod(U, "createIframeRangyRange", "createRangyRange"), U.addShimListener(function(Ce) {
+        }, ue.createAliasForDeprecatedMethod(U, "createIframeRange", "createRange"), ue.createAliasForDeprecatedMethod(U, "createIframeRangyRange", "createRangyRange"), U.addShimListener(function(Ce) {
           var Me = Ce.document;
           Me.createRange === void 0 && (Me.createRange = function() {
             return U.createRange(Me);
@@ -52089,7 +52065,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         });
       }), B.createCoreModule("WrappedSelection", ["DomRange", "WrappedRange"], function(U, Z) {
         U.config.checkSelectionRanges = !0;
-        var Y, X, G = "number", ee = U.dom, ae = U.util, de = ae.isHostMethod, ue = U.DomRange, ne = U.WrappedRange, Se = U.DOMException, ve = ee.DomPosition, ge = U.features, Te = "Control", ce = ee.getDocument, re = ee.getBody, fe = ue.rangesEqual;
+        var Y, X, G = "number", ee = U.dom, ae = U.util, ue = ae.isHostMethod, de = U.DomRange, ne = U.WrappedRange, Se = U.DOMException, ve = ee.DomPosition, ge = U.features, Te = "Control", ce = ee.getDocument, re = ee.getBody, fe = de.rangesEqual;
         function le(we) {
           return typeof we == "string" ? /^backward(s)?$/i.test(we) : !!we;
         }
@@ -52102,7 +52078,7 @@ 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"), Fe = (ge.implementsWinGetSelection = Me, (ge.implementsDocSelection = nt) && (!Me || U.config.preferTextRange));
+        var Me = ue(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;
@@ -52119,8 +52095,8 @@ 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")), 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);
+        var De = U.createNativeRange(document), xe = re(document), Je = ae.areHostProperties(Me, ["anchorNode", "focusNode", "anchorOffset", "focusOffset"]), je = (ge.selectionHasAnchorAndFocus = Je, ue(Me, "extend")), Be = (ge.selectionHasExtend = je, ue(Me, "setBaseAndExtent")), He = (ge.selectionHasSetBaseAndExtent = Be, typeof Me.rangeCount == G), Ze = (ge.selectionHasRangeCount = He, !1), Qe = !0, Bt = je ? function(we, Ke) {
+          var ht = de.getRangeDocument(Ke);
           (ht = U.createRange(ht)).collapseToPoint(Ke.endContainer, Ke.endOffset), we.addRange(Ie(ht)), we.extend(Ke.startContainer, Ke.startOffset);
         } : null;
         if (ae.areHostMethods(Me, ["addRange", "getRangeAt", "removeAllRanges"]) && typeof Me.rangeCount == G && ge.implementsDomRange) {
@@ -52147,7 +52123,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         }
         function Ie(we) {
           var Ke;
-          return we instanceof ue ? ((Ke = U.createNativeRange(we.getDocument())).setEnd(we.endContainer, we.endOffset), Ke.setStart(we.startContainer, we.startOffset)) : we instanceof ne ? Ke = we.nativeRange : ge.implementsDomRange && we instanceof ee.getWindow(we.startContainer).Range && (Ke = we), Ke;
+          return we instanceof de ? ((Ke = U.createNativeRange(we.getDocument())).setEnd(we.endContainer, we.endOffset), Ke.setStart(we.startContainer, we.startOffset)) : we instanceof ne ? Ke = we.nativeRange : ge.implementsDomRange && we instanceof ee.getWindow(we.startContainer).Range && (Ke = we), Ke;
         }
         function it(we) {
           var Ke = we.getNodes();
@@ -52199,11 +52175,11 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         function ut(we) {
           we.win = we.anchorNode = we.focusNode = we._ranges = null, we.rangeCount = we.anchorOffset = we.focusOffset = 0, we.detached = !0, he(we);
         }
-        xe && de(xe, "createControlRange") && (un = xe.createControlRange(), ae.areHostProperties(un, ["item", "add"])) && (sn = !0), ge.implementsControlRange = sn, X = Je ? function(we) {
+        xe && ue(xe, "createControlRange") && (un = xe.createControlRange(), ae.areHostProperties(un, ["item", "add"])) && (sn = !0), ge.implementsControlRange = sn, X = Je ? function(we) {
           return we.anchorNode === we.focusNode && we.anchorOffset === we.focusOffset;
         } : function(we) {
           return !!we.rangeCount && we.getRangeAt(we.rangeCount - 1).collapsed;
-        }, de(Me, "getRangeAt") ? Lt = function(we, Ke) {
+        }, ue(Me, "getRangeAt") ? Lt = function(we, Ke) {
           try {
             return we.getRangeAt(Ke);
           } catch {
@@ -52272,7 +52248,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
             }
           };
         } else {
-          if (!(de(Me, "empty") && de(De, "select") && sn && Fe))
+          if (!(ue(Me, "empty") && ue(De, "select") && sn && Fe))
             return Z.fail("No means of selecting a Range or TextRange was found"), !1;
           ze.removeAllRanges = function() {
             try {
@@ -52298,7 +52274,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
             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);
           };
-        else if (de(Me, "getRangeAt") && typeof Me.rangeCount == G)
+        else if (ue(Me, "getRangeAt") && typeof Me.rangeCount == G)
           Zt = function(we) {
             if (sn && nt && we.docSelection.type == Te)
               kt(we);
@@ -52342,7 +52318,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
           var Ke = [], ht = new ve(we.anchorNode, we.anchorOffset), Pt = new ve(we.focusNode, we.focusOffset), Mt = typeof we.getName == "function" ? we.getName() : "Selection";
           if (we.rangeCount !== void 0)
             for (var Qt = 0, Jt = we.rangeCount; Qt < Jt; ++Qt)
-              Ke[Qt] = ue.inspect(we.getRangeAt(Qt));
+              Ke[Qt] = de.inspect(we.getRangeAt(Qt));
           return "[" + Mt + "(Ranges: " + Ke.join(", ") + ")(anchor: " + ht.inspect() + ", focus: " + Pt.inspect() + "]";
         }
         ze.refresh = function(we) {
@@ -52453,7 +52429,7 @@ In order to be iterable, non-array objects must have a [Symbol.iterator]() metho
         }, ze.toHtml = function() {
           var we = [];
           return this.eachRange(function(Ke) {
-            we.push(ue.toHtml(Ke));
+            we.push(de.toHtml(Ke));
           }), we.join("");
         }, ge.implementsTextRange && (ze.getNativeTextRange = function() {
           if (we = this.docSelection) {
@@ -56000,8 +55976,8 @@ const kP = (0, ct.forwardRef)((c, t) => {
       const { state: X, timestamp: G } = await U();
       if (!f.isValidJSONState(X))
         throw new Error("Invalid state received from fetchDocOnNetworkReconnect hook");
-      const { commentThreads: ee, root: ae } = X, de = { content: { comments: ee, root: ae }, timestamp: G };
-      return pt.default.info("[decorateFetchOnReconnctHook] hook invoked: ", { returnObj: de }), de;
+      const { commentThreads: ee, root: ae } = X, ue = { content: { comments: ee, root: ae }, timestamp: G };
+      return pt.default.info("[decorateFetchOnReconnctHook] hook invoked: ", { returnObj: ue }), ue;
     }));
     const { contentChanged: Z } = q, Y = R_(q, xP);
     nr.setContentChangedHookClientCallback(r, Z), await l.start(l.createConfig(op(op({}, T), {}, { docId: z, username: I, apiKey: H, domain: K, hooks: op({ syncState: (X) => {
@@ -56046,15 +56022,15 @@ const kP = (0, ct.forwardRef)((c, t) => {
     if (H && !N && K)
       return ((U) => {
         let { newSelectionJSON: Z, finalUseTag: Y = !0, finalUpdateTagsToApply: X = [], segmentedDeltas: G, newContentStateJSON: ee } = U;
-        pt.default.debug("[updateLexicalEditorWithSegmentalDeltas] update lexical with segmented deltas invoked. segments count: ", G.length), G.forEach((ae, de) => {
-          let ue = de === G.length - 1;
-          pt.default.debug(`[updateLexicalEditorWithSegmentalDeltas] segment ${de} update started: `, { deltaSegment: ae }), o.update(() => {
-            if (rp.applyDeltasToLexicalState({ newStateJSON: ee, deltas: ae, editor: o }), ue) {
+        pt.default.debug("[updateLexicalEditorWithSegmentalDeltas] update lexical with segmented deltas invoked. segments count: ", G.length), G.forEach((ae, ue) => {
+          let de = ue === G.length - 1;
+          pt.default.debug(`[updateLexicalEditorWithSegmentalDeltas] segment ${ue} update started: `, { deltaSegment: ae }), o.update(() => {
+            if (rp.applyDeltasToLexicalState({ newStateJSON: ee, deltas: ae, editor: o }), de) {
               const ne = gn.JSONToLexical(Z, h);
               (0, It.$setSelection)(ne), Y && wy({ updateTags: X, isSameState: !1 });
             } else
               (0, It.$addUpdateTag)("codox_segmental_sync_state_changes");
-          }, { discrete: !0 }), pt.default.debug(`[updateLexicalEditorWithSegmentalDeltas] segment ${de} update ended `);
+          }, { discrete: !0 }), pt.default.debug(`[updateLexicalEditorWithSegmentalDeltas] segment ${ue} update ended `);
         });
       })({ newSelectionJSON: D, finalUseTag: z, finalUpdateTagsToApply: A, segmentedDeltas: K, newContentStateJSON: T });
     o.update(() => {
@@ -58271,14 +58247,14 @@ function S5() {
               case d:
                 return ae;
               default:
-                var de = ae && ae.$$typeof;
-                switch (de) {
+                var ue = ae && ae.$$typeof;
+                switch (ue) {
                   case a:
                   case u:
                   case h:
                   case f:
                   case r:
-                    return de;
+                    return ue;
                   default:
                     return ee;
                 }
@@ -65341,11 +65317,7 @@ function J4({
       const O = Nt();
       O !== null && (O.dirty = !0);
     }), _(!1);
-  }, [u]);
-  Kt(() => {
-    p && (p == null ? void 0 : p.length) > 0 && t(p);
-  }, [p]);
-  const x = bn(
+  }, [u]), x = bn(
     (O, F) => {
       var B;
       if (O.type === "comment") {
@@ -65375,7 +65347,7 @@ function J4({
     [d, u, f, t]
   ), y = bn(
     (O, F, B, M) => {
-      d.addComment(O, B), F && (u.update(() => {
+      d.addComment(O, B), t(d.getComments()), F && (u.update(() => {
         if (Et(M)) {
           const L = M.isBackward(), P = O.id;
           lS(M, L, P);
@@ -65518,7 +65490,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), console.log("EDITOR_STATE_LOEADED", r), e.setEditable(!1), setTimeout(() => {
+      ir().clear(), f0(r), e.setEditable(!1), setTimeout(() => {
         e.setEditable(n), c(!0), console.log("editor set to editable");
       }, 5e3);
     });
@@ -65556,21 +65528,19 @@ function o3({
       "[Lexical Demo][onBlacklistedInsert] blacklisted combination found"
     );
   };
-  const { userName: ee, userId: ae, userEmail: de } = t || {
+  const { userName: ee, userId: ae, userEmail: ue } = t || {
     userName: "aa",
     userId: "aa",
     userEmail: "aa@sample.com"
-  }, ue = {
-    name: ee,
-    id: ae,
-    email: de
-  };
-  console.log("docId + editId", e + g);
-  const ne = {
-    docId: e + "_" + g,
+  }, ne = {
+    docId: e,
     apiKey: n,
     // demo api key provided by codox. Must use your own
-    user: ue,
+    user: {
+      name: ee,
+      id: ae,
+      email: ue
+    },
     // client user name - use real username here instead of demo name
     hooks: {
       fetchDocOnNetworkReconnect: X,
@@ -65726,7 +65696,7 @@ function o3({
             setShowComments: J,
             handleSaveComments: u,
             userName: ee,
-            userEmail: de,
+            userEmail: ue,
             mentionItems: s,
             mentionedEmails: q,
             setmentionedEmails: W
@@ -65775,7 +65745,7 @@ function o3({
               hasCellBackgroundColor: !0
             }
           ),
-          /* @__PURE__ */ Ee.jsx(lN, {}),
+          h && /* @__PURE__ */ Ee.jsx(lN, {}),
           /* @__PURE__ */ Ee.jsx(mA, {}),
           /* @__PURE__ */ Ee.jsx(UA, {}),
           /* @__PURE__ */ Ee.jsx(GA, {}),
@@ -65876,4 +65846,4 @@ export {
   hu as y,
   X4 as z
 };
-//# sourceMappingURL=index-486ef15c.js.map
+//# sourceMappingURL=index-801f1f4b.js.map