@uva-glass/component-library 3.10.0 → 3.11.1

package/dist/{LexicalTable.prod-C6duSS2P.js → LexicalTable.prod-rZbTmo9K.js}

@@ -1,6 +1,6 @@
-import { w as T, r as Q, i as ge, _ as yt, j as Jt, N as Yt, T as Nt, S as Xt, L as qt } from "./LexicalUtils.prod-Dny9Fu94.js";
-import { f as Ve, n as ye, q as Ze, $ as jt, Y as Ce, M as it, T as I, X as Qe, p as Vt, h as xt, i as re, j as Zt, N as Be, k as Tt, c as z, o as Qt, r as be, d as D, a as B, m as Ue, s as Ke, t as Gt, v as en, x as tn, y as nn, F as De, L as on, A as rn, B as Rt, D as ln, H as V, I as sn, K as an, O as cn, P as un, Q as hn, R as dn, S as fn, V as gn, W as fe, g as ne, _ as $e, a0 as mn, b as Ft, a1 as pn, w as Ge, a2 as Cn, U as _n, a3 as Ae, a4 as Sn, a5 as wn, a6 as at, a7 as bn, a8 as ct, z as yn, a9 as ut, l as ht, Z as Re, aa as Nn, C as xn, ab as Tn, ac as Rn } from "./Lexical.prod-CWyHQUEM.js";
-import { _ as Fn, M as vn } from "./LexicalClipboard.prod-DbqSWANZ.js";
+import { w as x, r as Q, i as ge, _ as yt, j as Jt, N as Yt, T as Nt, S as Xt, L as qt } from "./LexicalUtils.prod-CpMJ4I9h.js";
+import { f as Ve, n as ye, q as Ze, $ as jt, Y as Ce, M as it, T as I, X as Qe, p as Vt, h as vt, i as re, j as Zt, N as Be, k as xt, c as z, o as Qt, r as be, d as D, a as B, m as Ue, s as Ke, t as Gt, v as en, x as tn, y as nn, F as De, L as on, A as rn, B as Tt, D as ln, H as V, I as sn, K as an, O as cn, P as un, Q as hn, R as dn, S as fn, V as gn, W as fe, g as ne, _ as $e, a0 as mn, b as Rt, a1 as pn, w as Ge, a2 as Cn, U as _n, a3 as Ae, a4 as Sn, a5 as wn, a6 as at, a7 as bn, a8 as ct, z as yn, a9 as ut, l as ht, Z as Te, aa as Nn, C as vn, ab as xn, ac as Tn } from "./Lexical.prod-D8x7Ii0F.js";
+import { _ as Rn, M as Fn } from "./LexicalClipboard.prod-D5GjiArS.js";
 const et = /^(\d+(?:\.\d+)?)px$/, W = { BOTH: 3, COLUMN: 2, NO_STATUS: 0, ROW: 1 };
 class ce extends Ve {
   static getType() {
@@ -150,18 +150,18 @@ function b(n, ...e) {
   for (const l of e) o.append("v", l);
   throw t.search = o.toString(), Error(`Minified Lexical error #${n}; visit ${t.toString()} for the full message or use the non-minified dev environment for full errors and additional helpful warnings.`);
 }
-class Te extends Ve {
+class xe extends Ve {
   static getType() {
     return "tablerow";
   }
   static clone(e) {
-    return new Te(e.__height, e.__key);
+    return new xe(e.__height, e.__key);
   }
   static importDOM() {
     return { tr: (e) => ({ conversion: Kn, priority: 0 }) };
   }
   static importJSON(e) {
-    return xe().updateFromJSON(e);
+    return ve().updateFromJSON(e);
   }
   updateFromJSON(e) {
     return super.updateFromJSON(e).setHeight(e.height);
@@ -203,19 +203,19 @@ class Te extends Ve {
 function Kn(n) {
   const e = n;
   let t;
-  return et.test(e.style.height) && (t = parseFloat(e.style.height)), { after: (o) => yt(o, w), node: xe(t) };
+  return et.test(e.style.height) && (t = parseFloat(e.style.height)), { after: (o) => yt(o, w), node: ve(t) };
 }
-function xe(n) {
-  return Ze(new Te(n));
+function ve(n) {
+  return Ze(new xe(n));
 }
 function $(n) {
-  return n instanceof Te;
+  return n instanceof xe;
 }
 const tt = typeof window < "u" && window.document !== void 0 && window.document.createElement !== void 0, An = tt && "documentMode" in document ? document.documentMode : null, ft = tt && /^(?!.*Seamonkey)(?=.*Firefox).*/i.test(navigator.userAgent);
 function En(n, e, t = !0) {
   const o = rt();
   for (let l = 0; l < n; l++) {
-    const s = xe();
+    const s = ve();
     for (let r = 0; r < e; r++) {
       let i = W.NO_STATUS;
       typeof t == "object" ? (l === 0 && t.rows && (i |= W.ROW), r === 0 && t.columns && (i |= W.COLUMN)) : t && (l === 0 && (i |= W.ROW), r === 0 && (i |= W.COLUMN));
@@ -227,25 +227,25 @@ function En(n, e, t = !0) {
   return o;
 }
 function so(n) {
-  const e = T(n, (t) => w(t));
+  const e = x(n, (t) => w(t));
   return w(e) ? e : null;
 }
-function vt(n) {
-  const e = T(n, (t) => $(t));
+function Ft(n) {
+  const e = x(n, (t) => $(t));
   if ($(e)) return e;
   throw new Error("Expected table cell to be inside of table row.");
 }
 function Ot(n) {
-  const e = T(n, (t) => k(t));
+  const e = x(n, (t) => k(t));
   if (k(e)) return e;
   throw new Error("Expected table cell to be inside of table.");
 }
 function io(n) {
-  const e = vt(n);
+  const e = Ft(n);
   return Ot(e).getChildren().findIndex((t) => t.is(e));
 }
 function ao(n) {
-  return vt(n).getChildren().findIndex((e) => e.is(n));
+  return Ft(n).getChildren().findIndex((e) => e.is(n));
 }
 tt && "InputEvent" in window && !An && new window.InputEvent("input");
 const Ye = (n, e) => n === W.BOTH || n === e ? e : W.NO_STATUS;
@@ -253,7 +253,7 @@ function kn(n, e = !0) {
   const [, , t] = G(n), [o, l] = J(t, n, n), s = o[0].length, { startRow: r } = l;
   let i = null;
   if (e) {
-    const u = r + n.__rowSpan - 1, m = o[u], h = xe();
+    const u = r + n.__rowSpan - 1, m = o[u], h = ve();
     for (let C = 0; C < s; C++) {
       const { cell: a, startRow: c } = m[C];
       if (c + a.__rowSpan - 1 <= u) {
@@ -264,7 +264,7 @@ function kn(n, e = !0) {
     const p = t.getChildAtIndex(u);
     $(p) || b(256), p.insertAfter(h), i = h;
   } else {
-    const u = r, m = o[u], h = xe();
+    const u = r, m = o[u], h = ve();
     for (let C = 0; C < s; C++) {
       const { cell: a, startRow: c } = m[C];
       if (c === u) {
@@ -298,15 +298,15 @@ function $n(n, e = !0, t = !0) {
     }
     const { cell: _, startColumn: S, startRow: N } = f[u];
     if (S + _.__colSpan - 1 <= u) {
-      let y = _, R = N, v = u;
-      for (; R !== c && y.__rowSpan > 1; ) {
-        if (v -= _.__colSpan, !(v >= 0)) {
+      let y = _, T = N, F = u;
+      for (; T !== c && y.__rowSpan > 1; ) {
+        if (F -= _.__colSpan, !(F >= 0)) {
           C.append(p(g));
           continue e;
         }
         {
-          const { cell: M, startRow: O } = f[v];
-          y = M, R = O;
+          const { cell: M, startRow: O } = f[F];
+          y = M, T = O;
         }
       }
       y.insertAfter(p(g));
@@ -437,10 +437,10 @@ function G(n) {
   let e;
   if (n instanceof ce) e = n;
   else if ("__type" in n) {
-    const l = T(n, w);
+    const l = x(n, w);
     w(l) || b(148), e = l;
   } else {
-    const l = T(n.getNode(), w);
+    const l = x(n.getNode(), w);
     w(l) || b(148), e = l;
   }
   const t = e.getParent();
@@ -482,7 +482,7 @@ function gt(n) {
 }
 function mt(n) {
   const [[e, t, o, l], [s, r, i, u]] = ["anchor", "focus"].map((m) => {
-    const h = n[m].getNode(), p = T(h, w);
+    const h = n[m].getNode(), p = x(h, w);
     w(p) || b(238, m, h.getKey(), h.getType());
     const C = p.getParent();
     $(C) || b(239, m);
@@ -535,12 +535,12 @@ class Me {
       const s = l.getFirstChild();
       Ge(s) && (t |= s.getTextFormat());
     });
-    const o = Rn[e];
+    const o = Tn[e];
     return !!(t & o);
   }
   insertNodes(e) {
     const t = this.focus.getNode();
-    D(t) || b(151), xn(t.select(0, t.getChildrenSize())).insertNodes(e);
+    D(t) || b(151), vn(t.select(0, t.getChildrenSize())).insertNodes(e);
   }
   getShape() {
     const { anchorCell: e, focusCell: t } = mt(this), o = gt(e);
@@ -574,7 +574,7 @@ class Me {
       });
     }
     const f = Array.from(a.values());
-    return Tn() || (this._cachedNodes = f), f;
+    return xn() || (this._cachedNodes = f), f;
   }
   getTextContent() {
     const e = this.getNodes().filter((o) => w(o));
@@ -606,7 +606,7 @@ function Pn(n, e) {
     l === void 0 ? t.pop() : e(l) !== !1 && D(l) && t.push(l.getChildren());
   }
 }
-function Et(n, e = xt()) {
+function Et(n, e = vt()) {
   const t = Ke(n);
   k(t) || b(231, n);
   const o = ie(t, e.getElementByKey(n));
@@ -650,7 +650,7 @@ class Bn {
     const e = this.editor;
     this.isHighlightingCells = !1, this.anchorX = -1, this.anchorY = -1, this.focusX = -1, this.focusY = -1, this.tableSelection = null, this.anchorCellNodeKey = null, this.focusCellNodeKey = null, this.anchorCell = null, this.focusCell = null, this.hasHijackedSelectionStyles = !1, this.$enableHighlightStyle();
     const { tableNode: t, tableElement: o } = this.$lookup();
-    Fe(e, me(t, o), null), B() !== null && (ne(null), e.dispatchCommand(fe, void 0));
+    Re(e, me(t, o), null), B() !== null && (ne(null), e.dispatchCommand(fe, void 0));
   }
   $enableHighlightStyle() {
     const e = this.editor, { tableElement: t } = this.$lookup();
@@ -664,7 +664,7 @@ class Bn {
     if (e !== null) {
       e.tableKey !== this.tableNodeKey && b(233, e.tableKey, this.tableNodeKey);
       const t = this.editor;
-      this.tableSelection = e, this.isHighlightingCells = !0, this.$disableHighlightStyle(), this.updateDOMSelection(), Fe(t, this.table, this.tableSelection);
+      this.tableSelection = e, this.isHighlightingCells = !0, this.$disableHighlightStyle(), this.updateDOMSelection(), Re(t, this.table, this.tableSelection);
     } else this.$clearHighlight();
   }
   setShouldCheckSelection() {
@@ -693,7 +693,7 @@ class Bn {
     } else this.isHighlightingCells = !0, this.$disableHighlightStyle();
     if (this.focusX = s, this.focusY = r, this.isHighlightingCells) {
       const i = qe(l, e.elem);
-      if (this.tableSelection != null && this.anchorCellNodeKey != null && i !== null) return this.focusCellNodeKey = i.getKey(), this.tableSelection = Hn(l, this.$getAnchorTableCellOrThrow(), i), ne(this.tableSelection), o.dispatchCommand(fe, void 0), Fe(o, this.table, this.tableSelection), !0;
+      if (this.tableSelection != null && this.anchorCellNodeKey != null && i !== null) return this.focusCellNodeKey = i.getKey(), this.tableSelection = Hn(l, this.$getAnchorTableCellOrThrow(), i), ne(this.tableSelection), o.dispatchCommand(fe, void 0), Re(o, this.table, this.tableSelection), !0;
     }
     return !1;
   }
@@ -738,7 +738,7 @@ class Bn {
     if (l.length === this.table.columns * this.table.rows) {
       t.selectPrevious();
       const s = t.getParent();
-      return t.remove(), void (Cn(s) && s.isEmpty() && e.dispatchCommand(Ft, void 0));
+      return t.remove(), void (Cn(s) && s.isEmpty() && e.dispatchCommand(Rt, void 0));
     }
     l.forEach((s) => {
       if (D(s)) {
@@ -747,7 +747,7 @@ class Bn {
           u !== r && u.remove();
         });
       }
-    }), Fe(e, this.table, null), ne(null), e.dispatchCommand(fe, void 0);
+    }), Re(e, this.table, null), ne(null), e.dispatchCommand(fe, void 0);
   }
 }
 const Xe = "__lexicalTableSelection", Dn = (n) => !(1 & ~n.buttons);
@@ -769,7 +769,7 @@ function Ne(n, e) {
   }
   return null;
 }
-const In = [[Gt, "down"], [en, "up"], [tn, "backward"], [nn, "forward"]], Un = [rn, Rt, ln], Jn = [sn, an];
+const In = [[Gt, "down"], [en, "up"], [tn, "backward"], [nn, "forward"]], Un = [rn, Tt, ln], Jn = [sn, an];
 function Yn(n, e, t, o) {
   const l = t.getRootElement(), s = nt(t);
   l !== null && s !== null || b(246);
@@ -840,9 +840,9 @@ function Yn(n, e, t, o) {
       if (!w(Ne(n, c.anchor.getNode()))) return !1;
       const f = c.anchor.getNode(), d = c.focus.getNode(), g = n.isParentOf(f), _ = n.isParentOf(d);
       if (g && !_ || _ && !g) return r.$clearText(), !0;
-      const S = T(c.anchor.getNode(), (y) => D(y)), N = S && T(S, (y) => D(y) && w(y.getParent()));
+      const S = x(c.anchor.getNode(), (y) => D(y)), N = S && x(S, (y) => D(y) && w(y.getParent()));
       if (!D(N) || !D(S)) return !1;
-      if (a === Rt && N.getPreviousSibling() === null) return !0;
+      if (a === Tt && N.getPreviousSibling() === null) return !0;
     }
     return !1;
   };
@@ -862,7 +862,7 @@ function Yn(n, e, t, o) {
     const c = B();
     if (c) {
       if (!K(c) && !z(c)) return !1;
-      Fn(t, qt(a, ClipboardEvent) ? a : null, vn(c));
+      Rn(t, qt(a, ClipboardEvent) ? a : null, Fn(c));
       const f = C(a);
       return z(c) ? (c.removeText(), !0) : f;
     }
@@ -872,7 +872,7 @@ function Yn(n, e, t, o) {
     if (!Z(c, n)) return !1;
     if (K(c)) return r.$formatCells(a), !0;
     if (z(c)) {
-      const f = T(c.anchor.getNode(), (d) => w(d));
+      const f = x(c.anchor.getNode(), (d) => w(d));
       if (!w(f)) return !1;
     }
     return !1;
@@ -883,20 +883,20 @@ function Yn(n, e, t, o) {
     if (!w(f) || !w(d)) return !1;
     if (function(O, A) {
       if (K(O)) {
-        const F = O.anchor.getNode(), E = O.focus.getNode();
-        if (A && F && E) {
-          const [L] = J(A, F, E);
-          return F.getKey() === L[0][0].cell.getKey() && E.getKey() === L[L.length - 1].at(-1).cell.getKey();
+        const R = O.anchor.getNode(), E = O.focus.getNode();
+        if (A && R && E) {
+          const [L] = J(A, R, E);
+          return R.getKey() === L[0][0].cell.getKey() && E.getKey() === L[L.length - 1].at(-1).cell.getKey();
         }
       }
       return !1;
     }(c, n)) return n.setFormat(a), !0;
-    const [g, _, S] = J(n, f, d), N = Math.max(_.startRow + _.cell.__rowSpan - 1, S.startRow + S.cell.__rowSpan - 1), y = Math.max(_.startColumn + _.cell.__colSpan - 1, S.startColumn + S.cell.__colSpan - 1), R = Math.min(_.startRow, S.startRow), v = Math.min(_.startColumn, S.startColumn), M = /* @__PURE__ */ new Set();
-    for (let O = R; O <= N; O++) for (let A = v; A <= y; A++) {
-      const F = g[O][A].cell;
-      if (M.has(F)) continue;
-      M.add(F), F.setFormat(a);
-      const E = F.getChildren();
+    const [g, _, S] = J(n, f, d), N = Math.max(_.startRow + _.cell.__rowSpan - 1, S.startRow + S.cell.__rowSpan - 1), y = Math.max(_.startColumn + _.cell.__colSpan - 1, S.startColumn + S.cell.__colSpan - 1), T = Math.min(_.startRow, S.startRow), F = Math.min(_.startColumn, S.startColumn), M = /* @__PURE__ */ new Set();
+    for (let O = T; O <= N; O++) for (let A = F; A <= y; A++) {
+      const R = g[O][A].cell;
+      if (M.has(R)) continue;
+      M.add(R), R.setFormat(a);
+      const E = R.getChildren();
       for (let L = 0; L < E.length; L++) {
         const H = E[L];
         D(H) && !H.isInline() && H.setFormat(a);
@@ -908,7 +908,7 @@ function Yn(n, e, t, o) {
     if (!Z(c, n)) return !1;
     if (K(c)) return r.$clearHighlight(), !1;
     if (z(c)) {
-      const f = T(c.anchor.getNode(), (d) => w(d));
+      const f = x(c.anchor.getNode(), (d) => w(d));
       if (!w(f)) return !1;
       if (typeof a == "string") {
         const d = wt(t, c, n);
@@ -923,60 +923,60 @@ function Yn(n, e, t, o) {
     return !(f === null || !n.is(pe(f))) && (te(a), function(d, g) {
       const _ = g === "next" ? "getNextSibling" : "getPreviousSibling", S = g === "next" ? "getFirstChild" : "getLastChild", N = d[_]();
       if (D(N)) return N.selectEnd();
-      const y = T(d, $);
+      const y = x(d, $);
       y === null && b(247);
-      for (let v = y[_](); $(v); v = v[_]()) {
-        const M = v[S]();
+      for (let F = y[_](); $(F); F = F[_]()) {
+        const M = F[S]();
         if (D(M)) return M.selectEnd();
       }
-      const R = T(y, k);
-      R === null && b(248), g === "next" ? R.selectNext() : R.selectPrevious();
+      const T = x(y, k);
+      T === null && b(248), g === "next" ? T.selectNext() : T.selectPrevious();
     }(f, a.shiftKey ? "previous" : "next"), !0);
-  }, V)), r.listenersToRemove.add(t.registerCommand(gn, (a) => n.isSelected(), De)), r.listenersToRemove.add(t.registerCommand(Tt, (a) => {
-    const { nodes: c, selection: f } = a, d = f.getStartEndPoints(), g = K(f), _ = z(f) && T(f.anchor.getNode(), (x) => w(x)) !== null && T(f.focus.getNode(), (x) => w(x)) !== null || g;
+  }, V)), r.listenersToRemove.add(t.registerCommand(gn, (a) => n.isSelected(), De)), r.listenersToRemove.add(t.registerCommand(xt, (a) => {
+    const { nodes: c, selection: f } = a, d = f.getStartEndPoints(), g = K(f), _ = z(f) && x(f.anchor.getNode(), (v) => w(v)) !== null && x(f.focus.getNode(), (v) => w(v)) !== null || g;
     if (c.length !== 1 || !k(c[0]) || !_ || d === null) return !1;
-    const [S, N] = d, [y, R, v] = G(S), M = T(N.getNode(), (x) => w(x));
-    if (!(w(y) && w(M) && $(R) && k(v))) return !1;
-    const O = c[0], [A, F, E] = J(v, y, M), [L] = oe(O, null, null), H = A.length, le = H > 0 ? A[0].length : 0;
-    let X = F.startRow, q = F.startColumn, P = L.length, ue = P > 0 ? L[0].length : 0;
+    const [S, N] = d, [y, T, F] = G(S), M = x(N.getNode(), (v) => w(v));
+    if (!(w(y) && w(M) && $(T) && k(F))) return !1;
+    const O = c[0], [A, R, E] = J(F, y, M), [L] = oe(O, null, null), H = A.length, le = H > 0 ? A[0].length : 0;
+    let X = R.startRow, q = R.startColumn, P = L.length, ue = P > 0 ? L[0].length : 0;
     if (g) {
-      const x = Ee(A, F, E), U = x.maxRow - x.minRow + 1, j = x.maxColumn - x.minColumn + 1;
-      X = x.minRow, q = x.minColumn, P = Math.min(P, U), ue = Math.min(ue, j);
+      const v = Ee(A, R, E), U = v.maxRow - v.minRow + 1, j = v.maxColumn - v.minColumn + 1;
+      X = v.minRow, q = v.minColumn, P = Math.min(P, U), ue = Math.min(ue, j);
     }
     let Le = !1;
     const zt = Math.min(H, X + P) - 1, Wt = Math.min(le, q + ue) - 1, lt = /* @__PURE__ */ new Set();
-    for (let x = X; x <= zt; x++) for (let U = q; U <= Wt; U++) {
-      const j = A[x][U];
+    for (let v = X; v <= zt; v++) for (let U = q; U <= Wt; U++) {
+      const j = A[v][U];
       lt.has(j.cell.getKey()) || j.cell.__rowSpan === 1 && j.cell.__colSpan === 1 || (Wn(j.cell), lt.add(j.cell.getKey()), Le = !0);
     }
-    let [_e] = oe(v.getWritable(), null, null);
+    let [_e] = oe(F.getWritable(), null, null);
     const Ht = P - H + X;
-    for (let x = 0; x < Ht; x++)
+    for (let v = 0; v < Ht; v++)
       kn(_e[H - 1][0].cell);
     const Pt = ue - le + q;
-    for (let x = 0; x < Pt; x++)
+    for (let v = 0; v < Pt; v++)
       $n(_e[0][le - 1].cell, !0, !1);
-    [_e] = oe(v.getWritable(), null, null);
-    for (let x = X; x < X + P; x++) for (let U = q; U < q + ue; U++) {
-      const j = x - X, st = U - q, ze = L[j][st];
+    [_e] = oe(F.getWritable(), null, null);
+    for (let v = X; v < X + P; v++) for (let U = q; U < q + ue; U++) {
+      const j = v - X, st = U - q, ze = L[j][st];
       if (ze.startRow !== j || ze.startColumn !== st) continue;
       const Se = ze.cell;
       if (Se.__rowSpan !== 1 || Se.__colSpan !== 1) {
-        const ee = [], Dt = Math.min(x + Se.__rowSpan, X + P) - 1, It = Math.min(U + Se.__colSpan, q + ue) - 1;
-        for (let He = x; He <= Dt; He++) for (let Pe = U; Pe <= It; Pe++) {
+        const ee = [], Dt = Math.min(v + Se.__rowSpan, X + P) - 1, It = Math.min(U + Se.__colSpan, q + ue) - 1;
+        for (let He = v; He <= Dt; He++) for (let Pe = U; Pe <= It; Pe++) {
           const Ut = _e[He][Pe];
           ee.push(Ut.cell);
         }
         Ln(ee), Le = !0;
       }
-      const { cell: We } = _e[x][U], Bt = We.getChildren();
+      const { cell: We } = _e[v][U], Bt = We.getChildren();
       Se.getChildren().forEach((ee) => {
         Ce(ee) && I().append(ee), We.append(ee);
       }), Bt.forEach((ee) => ee.remove());
     }
     if (g && Le) {
-      const [x] = oe(v.getWritable(), null, null);
-      x[F.startRow][F.startColumn].cell.selectEnd();
+      const [v] = oe(F.getWritable(), null, null);
+      v[R.startRow][R.startColumn].cell.selectEnd();
     }
     return !0;
   }, V)), r.listenersToRemove.add(t.registerCommand(fe, () => {
@@ -990,24 +990,24 @@ function Yn(n, e, t, o) {
       const d = a.anchor.getNode(), g = n.getFirstChild(), _ = we(d);
       if (_ !== null && $(g)) {
         const S = g.getFirstChild();
-        if (w(S) && n.is(T(_, (N) => N.is(n) || N.is(S)))) return S.selectStart(), !0;
+        if (w(S) && n.is(x(_, (N) => N.is(n) || N.is(S)))) return S.selectStart(), !0;
       }
     }
     if (z(a)) {
-      const { anchor: d, focus: g } = a, _ = d.getNode(), S = g.getNode(), N = we(_), y = we(S), R = !(!N || !n.is(pe(N))), v = !(!y || !n.is(pe(y))), M = R !== v, O = R && v, A = a.isBackward();
+      const { anchor: d, focus: g } = a, _ = d.getNode(), S = g.getNode(), N = we(_), y = we(S), T = !(!N || !n.is(pe(N))), F = !(!y || !n.is(pe(y))), M = T !== F, O = T && F, A = a.isBackward();
       if (M) {
-        const F = a.clone();
-        if (v) {
+        const R = a.clone();
+        if (F) {
           const [E] = J(n, y, y), L = E[0][0].cell, H = E[E.length - 1].at(-1).cell;
-          F.focus.set(A ? L.getKey() : H.getKey(), A ? L.getChildrenSize() : H.getChildrenSize(), "element");
-        } else if (R) {
+          R.focus.set(A ? L.getKey() : H.getKey(), A ? L.getChildrenSize() : H.getChildrenSize(), "element");
+        } else if (T) {
           const [E] = J(n, N, N), L = E[0][0].cell, H = E[E.length - 1].at(-1).cell;
-          F.anchor.set(A ? H.getKey() : L.getKey(), A ? H.getChildrenSize() : 0, "element");
+          R.anchor.set(A ? H.getKey() : L.getKey(), A ? H.getChildrenSize() : 0, "element");
         }
-        ne(F), _t(t, r);
+        ne(R), _t(t, r);
       } else if (O && (N.is(y) || (r.$setAnchorCellForSelection(se(r, N)), r.$setFocusCellForSelection(se(r, y), !0)), r.pointerType === "touch" && a.isCollapsed() && z(c) && c.isCollapsed())) {
-        const F = we(c.anchor.getNode());
-        F && !F.is(y) && (r.$setAnchorCellForSelection(se(r, F)), r.$setFocusCellForSelection(se(r, y), !0), r.pointerType = null);
+        const R = we(c.anchor.getNode());
+        R && !R.is(y) && (r.$setAnchorCellForSelection(se(r, R)), r.$setFocusCellForSelection(se(r, y), !0), r.pointerType = null);
       }
     } else if (a && K(a) && a.is(c) && a.tableKey === n.getKey()) {
       const d = $e(s);
@@ -1025,7 +1025,7 @@ function Yn(n, e, t, o) {
         _.highlighted = !1, $t(d, _), S.getAttribute("style") || S.removeAttribute("style");
       });
     }(t, r) : !r.hasHijackedSelectionStyles && n.isSelected() && _t(t, r), !1);
-  }, V)), r.listenersToRemove.add(t.registerCommand(Ft, () => {
+  }, V)), r.listenersToRemove.add(t.registerCommand(Rt, () => {
     const a = B();
     if (!z(a) || !a.isCollapsed() || !Z(a, n)) return !1;
     const c = wt(t, a, n);
@@ -1088,7 +1088,7 @@ function me(n, e) {
   }
   return o.columns = s + 1, o.rows = r + 1, o;
 }
-function Fe(n, e, t) {
+function Re(n, e, t) {
   const o = new Set(t ? t.getNodes() : []);
   ot(e, (l, s) => {
     const r = l.elem;
@@ -1140,7 +1140,7 @@ function Ie(n, e) {
   }
   return [t, o];
 }
-function ve([n, e]) {
+function Fe([n, e]) {
   return [n === "minColumn" ? "maxColumn" : "minColumn", e === "minRow" ? "maxRow" : "minRow"];
 }
 function he(n, e, [t, o]) {
@@ -1150,30 +1150,30 @@ function he(n, e, [t, o]) {
   return i === void 0 && b(250, t, String(r)), i;
 }
 function qn(n, e, t, o, l) {
-  const s = Ee(e, t, o), r = function(R, v) {
-    const { minColumn: M, maxColumn: O, minRow: A, maxRow: F } = v;
+  const s = Ee(e, t, o), r = function(T, F) {
+    const { minColumn: M, maxColumn: O, minRow: A, maxRow: R } = F;
     let E = 1, L = 1, H = 1, le = 1;
-    const X = R[A], q = R[F];
+    const X = T[A], q = T[R];
     for (let P = M; P <= O; P++) E = Math.max(E, X[P].cell.__rowSpan), le = Math.max(le, q[P].cell.__rowSpan);
-    for (let P = A; P <= F; P++) L = Math.max(L, R[P][M].cell.__colSpan), H = Math.max(H, R[P][O].cell.__colSpan);
+    for (let P = A; P <= R; P++) L = Math.max(L, T[P][M].cell.__colSpan), H = Math.max(H, T[P][O].cell.__colSpan);
     return { bottomSpan: le, leftSpan: L, rightSpan: H, topSpan: E };
-  }(e, s), { topSpan: i, leftSpan: u, bottomSpan: m, rightSpan: h } = r, p = function(R, v) {
-    const M = Ie(R, v);
-    return M === null && b(249, v.cell.getKey()), M;
-  }(s, t), [C, a] = ve(p);
+  }(e, s), { topSpan: i, leftSpan: u, bottomSpan: m, rightSpan: h } = r, p = function(T, F) {
+    const M = Ie(T, F);
+    return M === null && b(249, F.cell.getKey()), M;
+  }(s, t), [C, a] = Fe(p);
   let c = s[C], f = s[a];
   l === "forward" ? c += C === "maxColumn" ? 1 : u : l === "backward" ? c -= C === "minColumn" ? 1 : h : l === "down" ? f += a === "maxRow" ? 1 : i : l === "up" && (f -= a === "minRow" ? 1 : m);
   const d = e[f];
   if (d === void 0) return !1;
   const g = d[c];
   if (g === void 0) return !1;
-  const [_, S] = function(R, v, M) {
-    const O = Ee(R, v, M), A = Ie(O, v);
-    if (A) return [he(R, O, A), he(R, O, ve(A))];
-    const F = Ie(O, M);
-    if (F) return [he(R, O, ve(F)), he(R, O, F)];
+  const [_, S] = function(T, F, M) {
+    const O = Ee(T, F, M), A = Ie(O, F);
+    if (A) return [he(T, O, A), he(T, O, Fe(A))];
+    const R = Ie(O, M);
+    if (R) return [he(T, O, Fe(R)), he(T, O, R)];
     const E = ["minColumn", "minRow"];
-    return [he(R, O, E), he(R, O, ve(E))];
+    return [he(T, O, E), he(T, O, Fe(E))];
   }(e, t, g), N = se(n, _.cell), y = se(n, S.cell);
   return n.$setAnchorCellForSelection(N), n.$setFocusCellForSelection(y, !0), !0;
 }
@@ -1198,11 +1198,11 @@ function $t(n, e) {
   ge(t, o.tableCellSelected);
 }
 function we(n) {
-  const e = T(n, w);
+  const e = x(n, w);
   return w(e) ? e : null;
 }
 function pe(n) {
-  const e = T(n, k);
+  const e = x(n, k);
   return k(e) ? e : null;
 }
 function jn(n, e, t, o, l, s, r) {
@@ -1223,7 +1223,7 @@ function jn(n, e, t, o, l, s, r) {
       } else if (!$(_)) break;
     }
     return null;
-  }(ut(h, u.direction)), C = T(h, k);
+  }(ut(h, u.direction)), C = x(h, k);
   if (!C || !C.is(s)) return !1;
   const a = n.getElementByKey(h.getKey()), c = ke(a);
   if (!a || !c) return !1;
@@ -1234,7 +1234,7 @@ function jn(n, e, t, o, l, s, r) {
     r.$setAnchorCellForSelection(c), r.$setFocusCellForSelection(d, !0);
   } else {
     const d = ht(p);
-    Re(t.anchor, d), Re(t.focus, d);
+    Te(t.anchor, d), Te(t.focus, d);
   }
   else if (o === "extend") r.$setAnchorCellForSelection(c), r.$setFocusCellForSelection(c, !0);
   else {
@@ -1242,7 +1242,7 @@ function jn(n, e, t, o, l, s, r) {
       const _ = Nn(g);
       return ct(_) ? ht(_) : g;
     }(ut(C, i.direction));
-    Re(t.anchor, d), Re(t.focus, d);
+    Te(t.anchor, d), Te(t.focus, d);
   }
   return te(e), !0;
 }
@@ -1270,8 +1270,8 @@ function Mt(n, e, t, o, l) {
       if (e.shiftKey && (t === "up" || t === "down")) {
         const r = s.focus.getNode();
         if (!s.isCollapsed() && (t === "up" && !s.isBackward() || t === "down" && s.isBackward())) {
-          let i = T(r, (C) => k(C));
-          if (w(i) && (i = T(i, k)), i !== o || !i) return !1;
+          let i = x(r, (C) => k(C));
+          if (w(i) && (i = x(i, k)), i !== o || !i) return !1;
           const u = t === "down" ? i.getNextSibling() : i.getPreviousSibling();
           if (!u) return !1;
           let m = 0;
@@ -1292,8 +1292,8 @@ function Mt(n, e, t, o, l) {
           return !1;
         }
         {
-          let i = T(r, (m) => D(m) && !m.isInline());
-          if (w(i) && (i = T(i, k)), !i) return !1;
+          let i = x(r, (m) => D(m) && !m.isInline());
+          if (w(i) && (i = x(i, k)), !i) return !1;
           const u = t === "down" ? i.getNextSibling() : i.getPreviousSibling();
           if (k(u) && l.tableNodeKey === u.getKey()) {
             const m = u.getFirstDescendant(), h = u.getLastDescendant();
@@ -1310,7 +1310,7 @@ function Mt(n, e, t, o, l) {
     if (t === "backward" || t === "forward")
       return jn(n, e, s, e.shiftKey ? "extend" : "move", t === "backward", o, l);
     if (s.isCollapsed()) {
-      const { anchor: r, focus: i } = s, u = T(r.getNode(), w), m = T(i.getNode(), w);
+      const { anchor: r, focus: i } = s, u = x(r.getNode(), w), m = x(i.getNode(), w);
       if (!w(u) || !u.is(m)) return !1;
       const h = pe(u);
       if (h !== o && h != null) {
@@ -1343,7 +1343,7 @@ function Mt(n, e, t, o, l) {
       }
     }
   } else if (K(s)) {
-    const { anchor: r, focus: i } = s, u = T(r.getNode(), w), m = T(i.getNode(), w), [h] = s.getNodes();
+    const { anchor: r, focus: i } = s, u = x(r.getNode(), w), m = x(i.getNode(), w), [h] = s.getNodes();
     k(h) || b(251);
     const p = ie(h, n.getElementByKey(h.getKey()));
     if (!w(u) || !w(m) || !k(h) || p == null) return !1;
@@ -1371,9 +1371,9 @@ function wt(n, e, t) {
   if (!l) return;
   const s = l.anchorNode, r = n.getElementByKey(o.getKey()), i = ie(t, n.getElementByKey(t.getKey()));
   if (!s || !r || !i || !r.contains(s) || i.contains(s)) return;
-  const u = T(e.anchor.getNode(), (_) => w(_));
+  const u = x(e.anchor.getNode(), (_) => w(_));
   if (!u) return;
-  const m = T(u, (_) => k(_));
+  const m = x(u, (_) => k(_));
   if (!k(m) || !m.is(t)) return;
   const [h, p] = J(t, u, u), C = h[0][0], a = h[h.length - 1][h[0].length - 1], { startRow: c, startColumn: f } = p, d = c === C.startRow && f === C.startColumn, g = c === a.startRow && f === a.startColumn;
   return d ? "first" : g ? "last" : void 0;
@@ -1395,7 +1395,7 @@ function bt(n, e, t) {
   ge(n, ...o), Q(n, ...l);
 }
 const je = /* @__PURE__ */ new WeakSet();
-function Lt(n = xt()) {
+function Lt(n = vt()) {
   return je.has(n);
 }
 function uo(n, e) {
@@ -1648,7 +1648,7 @@ function no(n) {
   if (n.detail < 3 || !be(n.target)) return !1;
   const e = re(n.target);
   if (e === null) return !1;
-  const t = T(e, (o) => D(o) && !o.isInline());
+  const t = x(e, (o) => D(o) && !o.isInline());
   return t === null ? !1 : !!w(t.getParent()) && (t.select(0), !0);
 }
 function ho(n) {
@@ -1696,14 +1696,14 @@ function fo(n, e = !0) {
   };
 }
 function go(n) {
-  return n.hasNodes([ae]) || b(255), Jt(n.registerCommand(On, Qn, Be), n.registerCommand(Tt, ({ nodes: e, selection: t }) => z(t) ? pe(t.anchor.getNode()) !== null && e.some(k) : !1, Be), n.registerCommand(Zt, no, Be), n.registerNodeTransform(ae, to), n.registerNodeTransform(Te, eo), n.registerNodeTransform(ce, Gn));
+  return n.hasNodes([ae]) || b(255), Jt(n.registerCommand(On, Qn, Be), n.registerCommand(xt, ({ nodes: e, selection: t }) => z(t) ? pe(t.anchor.getNode()) !== null && e.some(k) : !1, Be), n.registerCommand(Zt, no, Be), n.registerNodeTransform(ae, to), n.registerNodeTransform(xe, eo), n.registerNodeTransform(ce, Gn));
 }
 export {
   ao as B,
-  vt as H,
-  xe as K,
+  Ft as H,
+  ve as K,
   so as L,
-  Te as O,
+  xe as O,
   io as P,
   w as R,
   ho as S,
@@ -1717,4 +1717,4 @@ export {
   ce as y,
   Ot as z
 };
-//# sourceMappingURL=LexicalTable.prod-C6duSS2P.js.map
+//# sourceMappingURL=LexicalTable.prod-rZbTmo9K.js.map