@mxmweb/rtext 1.6.6 → 1.6.7

package/index.js

@@ -198,18 +198,18 @@ function Kh() {
         Y < 0 && q("disabledDepth fell below zero. This is a bug in React. Please file an issue.");
       }
     }
-    var P = I.ReactCurrentDispatcher, U;
+    var P = I.ReactCurrentDispatcher, W;
     function re(w, we, se) {
       {
-        if (U === void 0)
+        if (W === void 0)
           try {
             throw Error();
           } catch (bt) {
             var Xe = bt.stack.trim().match(/\n( *(at )?)/);
-            U = Xe && Xe[1] || "";
+            W = Xe && Xe[1] || "";
           }
         return `
-` + U + w;
+` + W + w;
       }
     }
     var Q = !1, ue;
@@ -1154,7 +1154,7 @@ var Ja = new ip(), O0 = Ja.produce, Fu = /* @__PURE__ */ Ja.createDraft.bind(Ja)
       affinity: n
     } = e;
     if (r != null) {
-      var a = W.transform(r, t, {
+      var a = U.transform(r, t, {
         affinity: n
       });
       e.current = a, a == null && e.unref();
@@ -1186,11 +1186,11 @@ var Ja = new ip(), O0 = Ja.produce, Fu = /* @__PURE__ */ Ja.createDraft.bind(Ja)
       e.current = a, a == null && e.unref();
     }
   }
-}, li = /* @__PURE__ */ new WeakMap(), ui = /* @__PURE__ */ new WeakMap(), qa = /* @__PURE__ */ new WeakMap(), tf = /* @__PURE__ */ new WeakMap(), Ou = /* @__PURE__ */ new WeakMap(), Nu = /* @__PURE__ */ new WeakMap(), Mu = /* @__PURE__ */ new WeakMap(), W = {
+}, li = /* @__PURE__ */ new WeakMap(), ui = /* @__PURE__ */ new WeakMap(), qa = /* @__PURE__ */ new WeakMap(), tf = /* @__PURE__ */ new WeakMap(), Ou = /* @__PURE__ */ new WeakMap(), Nu = /* @__PURE__ */ new WeakMap(), Mu = /* @__PURE__ */ new WeakMap(), U = {
   ancestors(e) {
     var t = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {}, {
       reverse: r = !1
-    } = t, n = W.levels(e, t);
+    } = t, n = U.levels(e, t);
     return r ? n = n.slice(1) : n = n.slice(0, -1), n;
   },
   common(e, t) {
@@ -1211,15 +1211,15 @@ var Ja = new ip(), O0 = Ja.produce, Fu = /* @__PURE__ */ Ja.createDraft.bind(Ja)
   },
   endsAfter(e, t) {
     var r = e.length - 1, n = e.slice(0, r), a = t.slice(0, r), l = e[r], c = t[r];
-    return W.equals(n, a) && l > c;
+    return U.equals(n, a) && l > c;
   },
   endsAt(e, t) {
     var r = e.length, n = e.slice(0, r), a = t.slice(0, r);
-    return W.equals(n, a);
+    return U.equals(n, a);
   },
   endsBefore(e, t) {
     var r = e.length - 1, n = e.slice(0, r), a = t.slice(0, r), l = e[r], c = t[r];
-    return W.equals(n, a) && l < c;
+    return U.equals(n, a) && l < c;
   },
   equals(e, t) {
     return e.length === t.length && e.every((r, n) => r === t[n]);
@@ -1228,25 +1228,25 @@ var Ja = new ip(), O0 = Ja.produce, Fu = /* @__PURE__ */ Ja.createDraft.bind(Ja)
     return e[e.length - 1] > 0;
   },
   isAfter(e, t) {
-    return W.compare(e, t) === 1;
+    return U.compare(e, t) === 1;
   },
   isAncestor(e, t) {
-    return e.length < t.length && W.compare(e, t) === 0;
+    return e.length < t.length && U.compare(e, t) === 0;
   },
   isBefore(e, t) {
-    return W.compare(e, t) === -1;
+    return U.compare(e, t) === -1;
   },
   isChild(e, t) {
-    return e.length === t.length + 1 && W.compare(e, t) === 0;
+    return e.length === t.length + 1 && U.compare(e, t) === 0;
   },
   isCommon(e, t) {
-    return e.length <= t.length && W.compare(e, t) === 0;
+    return e.length <= t.length && U.compare(e, t) === 0;
   },
   isDescendant(e, t) {
-    return e.length > t.length && W.compare(e, t) === 0;
+    return e.length > t.length && U.compare(e, t) === 0;
   },
   isParent(e, t) {
-    return e.length + 1 === t.length && W.compare(e, t) === 0;
+    return e.length + 1 === t.length && U.compare(e, t) === 0;
   },
   isPath(e) {
     return Array.isArray(e) && (e.length === 0 || typeof e[0] == "number");
@@ -1255,7 +1255,7 @@ var Ja = new ip(), O0 = Ja.produce, Fu = /* @__PURE__ */ Ja.createDraft.bind(Ja)
     if (e.length !== t.length)
       return !1;
     var r = e.slice(0, -1), n = t.slice(0, -1), a = e[e.length - 1], l = t[t.length - 1];
-    return a !== l && W.equals(r, n);
+    return a !== l && U.equals(r, n);
   },
   levels(e) {
     for (var t = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : {}, {
@@ -1296,7 +1296,7 @@ var Ja = new ip(), O0 = Ja.produce, Fu = /* @__PURE__ */ Ja.createDraft.bind(Ja)
     return e.slice(0, -1).concat(t - 1);
   },
   relative(e, t) {
-    if (!W.isAncestor(t, e) && !W.equals(e, t))
+    if (!U.isAncestor(t, e) && !U.equals(e, t))
       throw new Error("Cannot get the relative path of [".concat(e, "] inside ancestor [").concat(t, "], because it is not above or equal to the path."));
     return e.slice(t.length);
   },
@@ -1313,16 +1313,16 @@ var Ja = new ip(), O0 = Ja.produce, Fu = /* @__PURE__ */ Ja.createDraft.bind(Ja)
         var {
           path: l
         } = t;
-        (W.equals(l, n) || W.endsBefore(l, n) || W.isAncestor(l, n)) && (n[l.length - 1] += 1);
+        (U.equals(l, n) || U.endsBefore(l, n) || U.isAncestor(l, n)) && (n[l.length - 1] += 1);
         break;
       }
       case "remove_node": {
         var {
           path: c
         } = t;
-        if (W.equals(c, n) || W.isAncestor(c, n))
+        if (U.equals(c, n) || U.isAncestor(c, n))
           return null;
-        W.endsBefore(c, n) && (n[c.length - 1] -= 1);
+        U.endsBefore(c, n) && (n[c.length - 1] -= 1);
         break;
       }
       case "merge_node": {
@@ -1330,7 +1330,7 @@ var Ja = new ip(), O0 = Ja.produce, Fu = /* @__PURE__ */ Ja.createDraft.bind(Ja)
           path: d,
           position: m
         } = t;
-        W.equals(d, n) || W.endsBefore(d, n) ? n[d.length - 1] -= 1 : W.isAncestor(d, n) && (n[d.length - 1] -= 1, n[d.length] += m);
+        U.equals(d, n) || U.endsBefore(d, n) ? n[d.length - 1] -= 1 : U.isAncestor(d, n) && (n[d.length - 1] -= 1, n[d.length] += m);
         break;
       }
       case "split_node": {
@@ -1338,11 +1338,11 @@ var Ja = new ip(), O0 = Ja.produce, Fu = /* @__PURE__ */ Ja.createDraft.bind(Ja)
           path: p,
           position: y
         } = t;
-        if (W.equals(p, n)) {
+        if (U.equals(p, n)) {
           if (a === "forward")
             n[n.length - 1] += 1;
           else if (a !== "backward") return null;
-        } else W.endsBefore(p, n) ? n[p.length - 1] += 1 : W.isAncestor(p, n) && e[p.length] >= y && (n[p.length - 1] += 1, n[p.length] -= y);
+        } else U.endsBefore(p, n) ? n[p.length - 1] += 1 : U.isAncestor(p, n) && e[p.length] >= y && (n[p.length - 1] += 1, n[p.length] -= y);
         break;
       }
       case "move_node": {
@@ -1350,12 +1350,12 @@ var Ja = new ip(), O0 = Ja.produce, Fu = /* @__PURE__ */ Ja.createDraft.bind(Ja)
           path: C,
           newPath: A
         } = t;
-        if (W.equals(C, A))
+        if (U.equals(C, A))
           return n;
-        if (W.isAncestor(C, n) || W.equals(C, n)) {
+        if (U.isAncestor(C, n) || U.equals(C, n)) {
           var T = A.slice();
-          return W.endsBefore(C, A) && C.length < A.length && (T[C.length - 1] -= 1), T.concat(n.slice(C.length));
-        } else W.isSibling(C, A) && (W.isAncestor(A, n) || W.equals(A, n)) ? W.endsBefore(C, n) ? n[C.length - 1] -= 1 : n[C.length - 1] += 1 : W.endsBefore(A, n) || W.equals(A, n) || W.isAncestor(A, n) ? (W.endsBefore(C, n) && (n[C.length - 1] -= 1), n[A.length - 1] += 1) : W.endsBefore(C, n) && (W.equals(A, n) && (n[A.length - 1] += 1), n[C.length - 1] -= 1);
+          return U.endsBefore(C, A) && C.length < A.length && (T[C.length - 1] -= 1), T.concat(n.slice(C.length));
+        } else U.isSibling(C, A) && (U.isAncestor(A, n) || U.equals(A, n)) ? U.endsBefore(C, n) ? n[C.length - 1] -= 1 : n[C.length - 1] += 1 : U.endsBefore(A, n) || U.equals(A, n) || U.isAncestor(A, n) ? (U.endsBefore(C, n) && (n[C.length - 1] -= 1), n[A.length - 1] += 1) : U.endsBefore(C, n) && (U.equals(A, n) && (n[A.length - 1] += 1), n[C.length - 1] -= 1);
         break;
       }
     }
@@ -1443,7 +1443,7 @@ var hp = (e, t, r) => {
     case "merge_node": {
       var {
         path: I
-      } = r, q = $e.get(e, I), H = W.previous(I), L = $e.get(e, H), z = $e.parent(e, I), V = I[I.length - 1];
+      } = r, q = $e.get(e, I), H = U.previous(I), L = $e.get(e, H), z = $e.parent(e, I), V = I[I.length - 1];
       if (Ke.isText(q) && Ke.isText(L))
         L.text += q.text;
       else if (!Ke.isText(q) && !Ke.isText(L))
@@ -1460,11 +1460,11 @@ var hp = (e, t, r) => {
         path: xe,
         newPath: oe
       } = r;
-      if (W.isAncestor(xe, oe))
+      if (U.isAncestor(xe, oe))
         throw new Error("Cannot move a path [".concat(xe, "] to new path [").concat(oe, "] because the destination is inside itself."));
       var he = $e.get(e, xe), ee = $e.parent(e, xe), R = xe[xe.length - 1];
       ee.children.splice(R, 1);
-      var J = W.transform(xe, r), Y = $e.get(e, W.parent(J)), le = J[J.length - 1];
+      var J = U.transform(xe, r), Y = $e.get(e, U.parent(J)), le = J[J.length - 1];
       if (Y.children.splice(le, 0, he), t)
         for (var [ne, ye] of ge.points(t))
           t[ye] = yt.transform(ne, r);
@@ -1481,15 +1481,15 @@ var hp = (e, t, r) => {
             t[Ee] = ie;
           else {
             var me = void 0, P = void 0;
-            for (var [U, re] of $e.texts(e))
-              if (W.compare(re, pe) === -1)
-                me = [U, re];
+            for (var [W, re] of $e.texts(e))
+              if (U.compare(re, pe) === -1)
+                me = [W, re];
               else {
-                P = [U, re];
+                P = [W, re];
                 break;
               }
             var Q = !1;
-            me && P && (W.equals(P[1], pe) ? Q = !W.hasPrevious(P[1]) : Q = W.common(me[1], pe).length < W.common(P[1], pe).length), me && !Q ? (Ae.path = me[1], Ae.offset = me[0].text.length) : P ? (Ae.path = P[1], Ae.offset = 0) : t = null;
+            me && P && (U.equals(P[1], pe) ? Q = !U.hasPrevious(P[1]) : Q = U.common(me[1], pe).length < U.common(P[1], pe).length), me && !Q ? (Ae.path = me[1], Ae.offset = me[0].text.length) : P ? (Ae.path = P[1], Ae.offset = 0) : t = null;
           }
         }
       break;
@@ -1718,7 +1718,7 @@ var ge = {
       return yt.isBefore(r, a) && yt.isAfter(n, l);
     }
     var [c, d] = ge.edges(e), m = !1, p = !1;
-    return yt.isPoint(t) ? (m = yt.compare(t, c) >= 0, p = yt.compare(t, d) <= 0) : (m = W.compare(t, c.path) >= 0, p = W.compare(t, d.path) <= 0), m && p;
+    return yt.isPoint(t) ? (m = yt.compare(t, c) >= 0, p = yt.compare(t, d) <= 0) : (m = U.compare(t, c.path) >= 0, p = U.compare(t, d.path) <= 0), m && p;
   },
   intersection(e, t) {
     var r = vn(e, bp), [n, a] = ge.edges(e), [l, c] = ge.edges(t), d = yt.isBefore(n, l) ? l : n, m = yt.isBefore(a, c) ? a : c;
@@ -1810,7 +1810,7 @@ var ge = {
   ancestors(e, t) {
     var r = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {};
     return (function* () {
-      for (var n of W.ancestors(t, r)) {
+      for (var n of U.ancestors(t, r)) {
         var a = $e.ancestor(e, n), l = [a, n];
         yield l;
       }
@@ -1838,7 +1838,7 @@ var ge = {
     })();
   },
   common(e, t, r) {
-    var n = W.common(t, r), a = $e.get(e, n);
+    var n = U.common(t, r), a = $e.get(e, n);
     return [a, n];
   },
   descendant(e, t) {
@@ -1893,11 +1893,11 @@ var ge = {
           var m = $e.parent(n, d), p = d[d.length - 1];
           m.children.splice(p, 1);
         }
-        if (W.equals(d, l.path)) {
+        if (U.equals(d, l.path)) {
           var y = $e.leaf(n, d);
           y.text = y.text.slice(0, l.offset);
         }
-        if (W.equals(d, a.path)) {
+        if (U.equals(d, a.path)) {
           var C = $e.leaf(n, d);
           C.text = C.text.slice(a.offset);
         }
@@ -1952,7 +1952,7 @@ var ge = {
   levels(e, t) {
     var r = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {};
     return (function* () {
-      for (var n of W.levels(t, r)) {
+      for (var n of U.levels(t, r)) {
         var a = $e.get(e, n);
         yield [a, n];
       }
@@ -1970,33 +1970,33 @@ var ge = {
       } = t, {
         from: a = [],
         to: l
-      } = t, c = /* @__PURE__ */ new Set(), d = [], m = e; !(l && (n ? W.isBefore(d, l) : W.isAfter(d, l))); ) {
+      } = t, c = /* @__PURE__ */ new Set(), d = [], m = e; !(l && (n ? U.isBefore(d, l) : U.isAfter(d, l))); ) {
         if (c.has(m) || (yield [m, d]), !c.has(m) && !Ke.isText(m) && m.children.length !== 0 && (r == null || r([m, d]) === !1)) {
           c.add(m);
           var p = n ? m.children.length - 1 : 0;
-          W.isAncestor(d, a) && (p = a[d.length]), d = d.concat(p), m = $e.get(e, d);
+          U.isAncestor(d, a) && (p = a[d.length]), d = d.concat(p), m = $e.get(e, d);
           continue;
         }
         if (d.length === 0)
           break;
         if (!n) {
-          var y = W.next(d);
+          var y = U.next(d);
           if ($e.has(e, y)) {
             d = y, m = $e.get(e, d);
             continue;
           }
         }
         if (n && d[d.length - 1] !== 0) {
-          var C = W.previous(d);
+          var C = U.previous(d);
           d = C, m = $e.get(e, d);
           continue;
         }
-        d = W.parent(d), m = $e.get(e, d), c.add(m);
+        d = U.parent(d), m = $e.get(e, d), c.add(m);
       }
     })();
   },
   parent(e, t) {
-    var r = W.parent(t), n = $e.get(e, r);
+    var r = U.parent(t), n = $e.get(e, r);
     if (Ke.isText(n))
       throw new Error("Cannot get the parent of path [".concat(t, "] because it does not exist in the root."));
     return n;
@@ -2042,23 +2042,23 @@ var $a = {
       return !1;
     switch (e.type) {
       case "insert_node":
-        return W.isPath(e.path) && $e.isNode(e.node);
+        return U.isPath(e.path) && $e.isNode(e.node);
       case "insert_text":
-        return typeof e.offset == "number" && typeof e.text == "string" && W.isPath(e.path);
+        return typeof e.offset == "number" && typeof e.text == "string" && U.isPath(e.path);
       case "merge_node":
-        return typeof e.position == "number" && W.isPath(e.path) && xr(e.properties);
+        return typeof e.position == "number" && U.isPath(e.path) && xr(e.properties);
       case "move_node":
-        return W.isPath(e.path) && W.isPath(e.newPath);
+        return U.isPath(e.path) && U.isPath(e.newPath);
       case "remove_node":
-        return W.isPath(e.path) && $e.isNode(e.node);
+        return U.isPath(e.path) && $e.isNode(e.node);
       case "remove_text":
-        return typeof e.offset == "number" && typeof e.text == "string" && W.isPath(e.path);
+        return typeof e.offset == "number" && typeof e.text == "string" && U.isPath(e.path);
       case "set_node":
-        return W.isPath(e.path) && xr(e.properties) && xr(e.newProperties);
+        return U.isPath(e.path) && xr(e.properties) && xr(e.newProperties);
       case "set_selection":
         return e.properties === null && ge.isRange(e.newProperties) || e.newProperties === null && ge.isRange(e.properties) || xr(e.properties) && xr(e.newProperties);
       case "split_node":
-        return W.isPath(e.path) && typeof e.position == "number" && xr(e.properties);
+        return U.isPath(e.path) && typeof e.position == "number" && xr(e.properties);
       default:
         return !1;
     }
@@ -2085,21 +2085,21 @@ var $a = {
       case "merge_node":
         return Qt(Qt({}, e), {}, {
           type: "split_node",
-          path: W.previous(e.path)
+          path: U.previous(e.path)
         });
       case "move_node": {
         var {
           newPath: t,
           path: r
         } = e;
-        if (W.equals(t, r))
+        if (U.equals(t, r))
           return e;
-        if (W.isSibling(r, t))
+        if (U.isSibling(r, t))
           return Qt(Qt({}, e), {}, {
             path: t,
             newPath: r
           });
-        var n = W.transform(r, e), a = W.transform(W.next(r), e);
+        var n = U.transform(r, e), a = U.transform(U.next(r), e);
         return Qt(Qt({}, e), {}, {
           path: n,
           newPath: a
@@ -2142,7 +2142,7 @@ var $a = {
       case "split_node":
         return Qt(Qt({}, e), {}, {
           type: "merge_node",
-          path: W.next(e.path)
+          path: U.next(e.path)
         });
     }
   }
@@ -2342,7 +2342,7 @@ var $a = {
   shouldMergeNodesRemovePrevNode: (e, t, r) => e.shouldMergeNodesRemovePrevNode(t, r)
 }, Cp = {
   isSpan(e) {
-    return Array.isArray(e) && e.length === 2 && e.every(W.isPath);
+    return Array.isArray(e) && e.length === 2 && e.every(U.isPath);
   }
 };
 function Lu(e, t) {
@@ -2368,7 +2368,7 @@ function _u(e) {
 }
 var yt = {
   compare(e, t) {
-    var r = W.compare(e.path, t.path);
+    var r = U.compare(e.path, t.path);
     return r === 0 ? e.offset < t.offset ? -1 : e.offset > t.offset ? 1 : 0 : r;
   },
   isAfter(e, t) {
@@ -2378,10 +2378,10 @@ var yt = {
     return yt.compare(e, t) === -1;
   },
   equals(e, t) {
-    return e.offset === t.offset && W.equals(e.path, t.path);
+    return e.offset === t.offset && U.equals(e.path, t.path);
   },
   isPoint(e) {
-    return xr(e) && typeof e.offset == "number" && W.isPath(e.path);
+    return xr(e) && typeof e.offset == "number" && U.isPath(e.path);
   },
   transform(e, t) {
     var r = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {};
@@ -2397,36 +2397,36 @@ var yt = {
       switch (t.type) {
         case "insert_node":
         case "move_node": {
-          n.path = W.transform(l, t, r);
+          n.path = U.transform(l, t, r);
           break;
         }
         case "insert_text": {
-          W.equals(t.path, l) && (t.offset < c || t.offset === c && a === "forward") && (n.offset += t.text.length);
+          U.equals(t.path, l) && (t.offset < c || t.offset === c && a === "forward") && (n.offset += t.text.length);
           break;
         }
         case "merge_node": {
-          W.equals(t.path, l) && (n.offset += t.position), n.path = W.transform(l, t, r);
+          U.equals(t.path, l) && (n.offset += t.position), n.path = U.transform(l, t, r);
           break;
         }
         case "remove_text": {
-          W.equals(t.path, l) && t.offset <= c && (n.offset -= Math.min(c - t.offset, t.text.length));
+          U.equals(t.path, l) && t.offset <= c && (n.offset -= Math.min(c - t.offset, t.text.length));
           break;
         }
         case "remove_node": {
-          if (W.equals(t.path, l) || W.isAncestor(t.path, l))
+          if (U.equals(t.path, l) || U.isAncestor(t.path, l))
             return null;
-          n.path = W.transform(l, t, r);
+          n.path = U.transform(l, t, r);
           break;
         }
         case "split_node": {
-          if (W.equals(t.path, l)) {
+          if (U.equals(t.path, l)) {
             if (t.position === c && a == null)
               return null;
-            (t.position < c || t.position === c && a === "forward") && (n.offset -= t.position, n.path = W.transform(l, t, _u(_u({}, r), {}, {
+            (t.position < c || t.position === c && a === "forward") && (n.offset -= t.position, n.path = U.transform(l, t, _u(_u({}, r), {}, {
               affinity: "forward"
             })));
           } else
-            n.path = W.transform(l, t, r);
+            n.path = U.transform(l, t, r);
           break;
         }
       }
@@ -2633,7 +2633,7 @@ var Vp = /(?:[\xA9\xAE\u203C\u2049\u2122\u2139\u2194-\u2199\u21A9\u21AA\u231A\u2
       } = r, {
         at: a = N0(e)
       } = r;
-      if (W.isPath(a) && (a = E.range(e, a)), ge.isRange(a))
+      if (U.isPath(a) && (a = E.range(e, a)), ge.isRange(a))
         if (ge.isCollapsed(a))
           a = a.anchor;
         else {
@@ -2729,7 +2729,7 @@ var Zp = (e, t) => {
   for (var a of E.rangeRefs(e))
     cp.transform(a, t);
   if (!Xp(e)) {
-    var l = W.operationCanTransformPath(t) ? (c) => W.transform(c, t) : void 0;
+    var l = U.operationCanTransformPath(t) ? (c) => U.transform(c, t) : void 0;
     nf(e, e.getDirtyPaths(t), l);
   }
   Oe.transform(e, t), e.operations.push(t), E.normalize(e, {
@@ -2747,13 +2747,13 @@ var Zp = (e, t) => {
       var {
         path: r
       } = t;
-      return W.levels(r);
+      return U.levels(r);
     }
     case "insert_node": {
       var {
         node: n,
         path: a
-      } = t, l = W.levels(a), c = Ke.isText(n) ? [] : Array.from($e.nodes(n), (oe) => {
+      } = t, l = U.levels(a), c = Ke.isText(n) ? [] : Array.from($e.nodes(n), (oe) => {
         var [, he] = oe;
         return a.concat(he);
       });
@@ -2762,7 +2762,7 @@ var Zp = (e, t) => {
     case "merge_node": {
       var {
         path: d
-      } = t, m = W.ancestors(d), p = W.previous(d);
+      } = t, m = U.ancestors(d), p = U.previous(d);
       return [...m, p];
     }
     case "move_node": {
@@ -2770,15 +2770,15 @@ var Zp = (e, t) => {
         path: y,
         newPath: C
       } = t;
-      if (W.equals(y, C))
+      if (U.equals(y, C))
         return [];
       var A = [], T = [];
-      for (var N of W.ancestors(y)) {
-        var O = W.transform(N, t);
+      for (var N of U.ancestors(y)) {
+        var O = U.transform(N, t);
         A.push(O);
       }
-      for (var g of W.ancestors(C)) {
-        var I = W.transform(g, t);
+      for (var g of U.ancestors(C)) {
+        var I = U.transform(g, t);
         T.push(I);
       }
       var q = T[T.length - 1], H = C[C.length - 1], L = q.concat(H);
@@ -2787,13 +2787,13 @@ var Zp = (e, t) => {
     case "remove_node": {
       var {
         path: z
-      } = t, V = W.ancestors(z);
+      } = t, V = U.ancestors(z);
       return [...V];
     }
     case "split_node": {
       var {
         path: G
-      } = t, ve = W.levels(G), xe = W.next(G);
+      } = t, ve = U.levels(G), xe = U.next(G);
       return [...ve, xe];
     }
     default:
@@ -2892,9 +2892,9 @@ var Zp = (e, t) => {
     }))
       if (!Ke.isText(p)) {
         if (ge.isRange(l)) {
-          if (W.isAncestor(y, l.anchor.path) && W.isAncestor(y, l.focus.path))
+          if (U.isAncestor(y, l.anchor.path) && U.isAncestor(y, l.focus.path))
             return [p, y];
-        } else if (!W.equals(d, y))
+        } else if (!U.equals(d, y))
           return [p, y];
       }
   }
@@ -3262,7 +3262,7 @@ var Rm = ["text"], jm = ["text"], Pm = function(t) {
       });
       if (T && O) {
         var [g, I] = T, [, q] = O;
-        W.isAncestor(q, I) && (A = g);
+        U.isAncestor(q, I) && (A = g);
       }
     }
   }
@@ -3282,10 +3282,10 @@ var Rm = ["text"], jm = ["text"], Pm = function(t) {
     });
     if (d) {
       var [, m] = E.last(t, []), p = [d.path, m];
-      if (W.isPath(c) && c.length === 0)
+      if (U.isPath(c) && c.length === 0)
         throw new Error("Cannot get the next node from the root node!");
       if (l == null)
-        if (W.isPath(c)) {
+        if (U.isPath(c)) {
           var [y] = E.parent(t, c);
           l = (A) => y.children.includes(A);
         } else
@@ -3339,7 +3339,7 @@ function Im(e) {
       }), N = [], O;
       for (var [g, I] of T)
         if (!(d && Ze.isElement(g) && !E.isSelectable(e, g))) {
-          var q = O && W.compare(I, O[1]) === 0;
+          var q = O && U.compare(I, O[1]) === 0;
           if (!(n === "highest" && q)) {
             if (!m(g, I)) {
               if (a && !q && Ke.isText(g))
@@ -3402,7 +3402,7 @@ var Lm = function(t) {
     });
   }
 }, _m = function(t, r) {
-  var n = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {}, a = E.path(t, r, n), l = W.parent(a), c = E.node(t, l);
+  var n = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {}, a = E.path(t, r, n), l = U.parent(a), c = E.node(t, l);
   return c;
 }, qm = function(t, r) {
   var n = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {}, {
@@ -3426,7 +3426,7 @@ var Lm = function(t) {
     depth: a,
     edge: l
   } = n;
-  if (W.isPath(r)) {
+  if (U.isPath(r)) {
     if (l === "start") {
       var [, c] = $e.first(t, r);
       r = c;
@@ -3435,7 +3435,7 @@ var Lm = function(t) {
       r = d;
     }
   }
-  return ge.isRange(r) && (l === "start" ? r = ge.start(r) : l === "end" ? r = ge.end(r) : r = W.common(r.anchor.path, r.focus.path)), yt.isPoint(r) && (r = r.path), a != null && (r = r.slice(0, a)), r;
+  return ge.isRange(r) && (l === "start" ? r = ge.start(r) : l === "end" ? r = ge.end(r) : r = U.common(r.anchor.path, r.focus.path)), yt.isPoint(r) && (r = r.path), a != null && (r = r.slice(0, a)), r;
 }, Um = function(t, r) {
   var n = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {}, {
     affinity: a = "forward"
@@ -3457,7 +3457,7 @@ var Lm = function(t) {
   var n = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {}, {
     edge: a = "start"
   } = n;
-  if (W.isPath(r)) {
+  if (U.isPath(r)) {
     var l;
     if (a === "end") {
       var [, c] = $e.last(t, r);
@@ -3506,7 +3506,7 @@ function Ym(e) {
         }
         if (e.isInline(g)) continue;
         if (E.hasInlines(e, g)) {
-          var q = W.isAncestor(I, p.path) ? p : E.end(e, I), H = W.isAncestor(I, m.path) ? m : E.start(e, I);
+          var q = U.isAncestor(I, p.path) ? p : E.end(e, I), H = U.isAncestor(I, m.path) ? m : E.start(e, I);
           A = E.string(e, {
             anchor: H,
             focus: q
@@ -3516,7 +3516,7 @@ function Ym(e) {
         }
       }
       if (Ke.isText(g)) {
-        var L = W.equals(I, y.path);
+        var L = U.equals(I, y.path);
         for (L ? (N = a ? y.offset : g.text.length - y.offset, O = y.offset) : (N = g.text.length, O = a ? N : 0), (L || C || n === "offset") && (yield {
           path: I,
           offset: O
@@ -3555,10 +3555,10 @@ var Km = function(t) {
     });
     if (d) {
       var [, m] = E.first(t, []), p = [d.path, m];
-      if (W.isPath(c) && c.length === 0)
+      if (U.isPath(c) && c.length === 0)
         throw new Error("Cannot get the previous node from the root node!");
       if (l == null)
-        if (W.isPath(c)) {
+        if (U.isPath(c)) {
           var [y] = E.parent(t, c);
           l = (A) => y.children.includes(A);
         } else
@@ -3663,14 +3663,14 @@ var e4 = (e, t) => {
     voids: a
   })) {
     var C = p.text;
-    W.equals(y, d.path) && (C = C.slice(0, d.offset)), W.equals(y, c.path) && (C = C.slice(c.offset)), m += C;
+    U.equals(y, d.path) && (C = C.slice(0, d.offset)), U.equals(y, c.path) && (C = C.slice(c.offset)), m += C;
   }
   return m;
 }, a4 = function(t, r) {
   var n = arguments.length > 2 && arguments[2] !== void 0 ? arguments[2] : {}, {
     voids: a = !1
   } = n, [l, c] = ge.edges(r);
-  if (l.offset !== 0 || c.offset !== 0 || ge.isCollapsed(r) || W.hasPrevious(c.path))
+  if (l.offset !== 0 || c.offset !== 0 || ge.isCollapsed(r) || U.hasPrevious(c.path))
     return r;
   var d = E.above(t, {
     at: c,
@@ -3690,7 +3690,7 @@ var e4 = (e, t) => {
       C = !1;
       continue;
     }
-    if (A.text !== "" || W.isBefore(T, m)) {
+    if (A.text !== "" || U.isBefore(T, m)) {
       c = {
         path: T,
         offset: A.text.length
@@ -3747,7 +3747,7 @@ var e4 = (e, t) => {
           }, y = !0;
         }
       }
-      if (W.isPath(p)) {
+      if (U.isPath(p)) {
         Oe.removeNodes(t, {
           at: p,
           voids: m
@@ -3769,7 +3769,7 @@ var e4 = (e, t) => {
           match: (K) => Ze.isElement(K) && E.isBlock(t, K),
           at: H,
           voids: m
-        }), V = L && z && !W.equals(L[1], z[1]), G = W.equals(q.path, H.path), ve = m ? null : (n = E.void(t, {
+        }), V = L && z && !U.equals(L[1], z[1]), G = U.equals(q.path, H.path), ve = m ? null : (n = E.void(t, {
           at: q,
           mode: "highest"
         })) !== null && n !== void 0 ? n : E.elementReadOnly(t, {
@@ -3784,11 +3784,11 @@ var e4 = (e, t) => {
         });
         if (ve) {
           var oe = E.before(t, q);
-          oe && L && W.isAncestor(L[1], oe.path) && (q = oe);
+          oe && L && U.isAncestor(L[1], oe.path) && (q = oe);
         }
         if (xe) {
           var he = E.after(t, H);
-          he && z && W.isAncestor(z[1], he.path) && (H = he);
+          he && z && U.isAncestor(z[1], he.path) && (H = he);
         }
         var ee = [], R;
         for (var J of E.nodes(t, {
@@ -3796,7 +3796,7 @@ var e4 = (e, t) => {
           voids: m
         })) {
           var [Y, le] = J;
-          R && W.compare(le, R) === 0 || (!m && Ze.isElement(Y) && (E.isVoid(t, Y) || E.isElementReadOnly(t, Y)) || !W.isCommon(le, q.path) && !W.isCommon(le, H.path)) && (ee.push(J), R = le);
+          R && U.compare(le, R) === 0 || (!m && Ze.isElement(Y) && (E.isVoid(t, Y) || E.isElementReadOnly(t, Y)) || !U.isCommon(le, q.path) && !U.isCommon(le, H.path)) && (ee.push(J), R = le);
         }
         var ne = Array.from(ee, (K) => {
           var [, je] = K;
@@ -3819,9 +3819,9 @@ var e4 = (e, t) => {
           at: K,
           voids: m
         })), !xe) {
-          var P = pe.current, [U] = E.leaf(t, P), {
+          var P = pe.current, [W] = E.leaf(t, P), {
             path: re
-          } = P, Q = G ? q.offset : 0, ue = U.text.slice(Q, H.offset);
+          } = P, Q = G ? q.offset : 0, ue = W.text.slice(Q, H.offset);
           ue.length > 0 && (t.apply({
             type: "remove_text",
             path: re,
@@ -3866,7 +3866,7 @@ var e4 = (e, t) => {
             at: c
           }), c = p.unref();
         }
-      else W.isPath(c) && (c = E.start(t, c));
+      else U.isPath(c) && (c = E.start(t, c));
       if (!(!l && E.void(t, {
         at: c
       }))) {
@@ -3895,8 +3895,8 @@ var e4 = (e, t) => {
         }, []), [, V] = $e.last({
           children: r
         }, []), G = [], ve = (me) => {
-          var [P, U] = me, re = U.length === 0;
-          return re ? !1 : q ? !0 : !(H && W.isAncestor(U, z) && Ze.isElement(P) && !t.isVoid(P) && !t.isInline(P) || L && W.isAncestor(U, V) && Ze.isElement(P) && !t.isVoid(P) && !t.isInline(P));
+          var [P, W] = me, re = W.length === 0;
+          return re ? !1 : q ? !0 : !(H && U.isAncestor(W, z) && Ze.isElement(P) && !t.isVoid(P) && !t.isInline(P) || L && U.isAncestor(W, V) && Ze.isElement(P) && !t.isVoid(P) && !t.isInline(P));
         };
         for (var xe of $e.nodes({
           children: r
@@ -3912,7 +3912,7 @@ var e4 = (e, t) => {
           match: (me) => Ke.isText(me) || E.isInline(t, me),
           mode: "highest",
           voids: l
-        }), [, ne] = le, ye = E.isStart(t, c, ne), pe = E.isEnd(t, c, ne), $ = E.pathRef(t, I && !ee.length ? W.next(O) : O), de = E.pathRef(t, pe ? W.next(ne) : ne);
+        }), [, ne] = le, ye = E.isStart(t, c, ne), pe = E.isEnd(t, c, ne), $ = E.pathRef(t, I && !ee.length ? U.next(O) : O), de = E.pathRef(t, pe ? U.next(ne) : ne);
         Oe.splitNodes(t, {
           at: c,
           match: (me) => J ? Ze.isElement(me) && E.isBlock(t, me) : Ke.isText(me) || E.isInline(t, me),
@@ -3920,7 +3920,7 @@ var e4 = (e, t) => {
           always: J && (!g || oe.length > 0) && (!I || ee.length > 0),
           voids: l
         });
-        var Ae = E.pathRef(t, !ye || ye && pe ? W.next(ne) : ne);
+        var Ae = E.pathRef(t, !ye || ye && pe ? U.next(ne) : ne);
         if (Oe.insertNodes(t, oe, {
           at: Ae.current,
           match: (me) => Ke.isText(me) || E.isInline(t, me),
@@ -3944,7 +3944,7 @@ var e4 = (e, t) => {
           batchDirty: d
         }), !n.at) {
           var Ee;
-          if (ee.length > 0 && de.current ? Ee = W.previous(de.current) : he.length > 0 && $.current ? Ee = W.previous($.current) : Ae.current && (Ee = W.previous(Ae.current)), Ee) {
+          if (ee.length > 0 && de.current ? Ee = U.previous(de.current) : he.length > 0 && $.current ? Ee = U.previous($.current) : Ae.current && (Ee = U.previous(Ae.current)), Ee) {
             var ie = E.end(t, Ee);
             Oe.select(t, ie);
           }
@@ -4120,16 +4120,16 @@ var h4 = function(t, r) {
             voids: l
           });
           var q = g.unref();
-          m = I ? W.next(q) : q;
+          m = I ? U.next(q) : q;
         } else
           return;
       }
-      var H = W.parent(m), L = m[m.length - 1];
+      var H = U.parent(m), L = m[m.length - 1];
       if (!(!l && E.void(t, {
         at: H
       }))) {
         if (d) {
-          var z = [], V = W.levels(H);
+          var z = [], V = U.levels(H);
           Jp(t, () => {
             var oe = function() {
               var R = H.concat(L);
@@ -4139,7 +4139,7 @@ var h4 = function(t, r) {
                 path: R,
                 node: he
               };
-              t.apply(J), m = W.next(m), z.push(J), Ke.isText ? V.push(...Array.from($e.nodes(he), (Y) => {
+              t.apply(J), m = U.next(m), z.push(J), Ke.isText ? V.push(...Array.from($e.nodes(he), (Y) => {
                 var [, le] = Y;
                 return R.concat(le);
               })) : V.push(R);
@@ -4150,7 +4150,7 @@ var h4 = function(t, r) {
             nf(t, V, (oe) => {
               var he = oe;
               for (var ee of z)
-                if (W.operationCanTransformPath(ee) && (he = W.transform(he, ee), !he))
+                if (U.operationCanTransformPath(ee) && (he = U.transform(he, ee), !he))
                   return null;
               return he;
             });
@@ -4162,9 +4162,9 @@ var h4 = function(t, r) {
               type: "insert_node",
               path: ve,
               node: G
-            }), m = W.next(m);
+            }), m = U.next(m);
           }
-        if (m = W.previous(m), y) {
+        if (m = U.previous(m), y) {
           var xe = E.end(t, m);
           xe && Oe.select(t, xe);
         }
@@ -4181,7 +4181,7 @@ var h4 = function(t, r) {
     } = r, {
       match: c
     } = r;
-    if (c == null && (c = W.isPath(n) ? Ca(t, n) : (L) => Ze.isElement(L) && E.isBlock(t, L)), !!n) {
+    if (c == null && (c = U.isPath(n) ? Ca(t, n) : (L) => Ze.isElement(L) && E.isBlock(t, L)), !!n) {
       var d = E.nodes(t, {
         at: n,
         match: c,
@@ -4195,11 +4195,11 @@ var h4 = function(t, r) {
         var y = p.unref();
         if (y.length < 2)
           throw new Error("Cannot lift node at a path [".concat(y, "] because it has a depth of less than `2`."));
-        var C = E.node(t, W.parent(y)), [A, T] = C, N = y[y.length - 1], {
+        var C = E.node(t, U.parent(y)), [A, T] = C, N = y[y.length - 1], {
           length: O
         } = A.children;
         if (O === 1) {
-          var g = W.next(T);
+          var g = U.next(T);
           Oe.moveNodes(t, {
             at: y,
             to: g,
@@ -4215,14 +4215,14 @@ var h4 = function(t, r) {
             voids: l
           });
         else if (N === O - 1) {
-          var I = W.next(T);
+          var I = U.next(T);
           Oe.moveNodes(t, {
             at: y,
             to: I,
             voids: l
           });
         } else {
-          var q = W.next(y), H = W.next(T);
+          var q = U.next(y), H = U.next(T);
           Oe.splitNodes(t, {
             at: q,
             voids: l
@@ -4253,7 +4253,7 @@ var h4 = function(t, r) {
     } = r;
     if (a) {
       if (n == null)
-        if (W.isPath(a)) {
+        if (U.isPath(a)) {
           var [m] = E.parent(t, a);
           n = (oe) => m.children.includes(oe);
         } else
@@ -4283,7 +4283,7 @@ var h4 = function(t, r) {
       if (!(!C || !A)) {
         var [T, N] = C, [O, g] = A;
         if (!(N.length === 0 || g.length === 0)) {
-          var I = W.next(g), q = W.common(N, g), H = W.isSibling(N, g), L = Array.from(E.levels(t, {
+          var I = U.next(g), q = U.common(N, g), H = U.isSibling(N, g), L = Array.from(E.levels(t, {
             at: N
           }), (oe) => {
             var [he] = oe;
@@ -4332,7 +4332,7 @@ var h4 = function(t, r) {
       match: c
     } = t;
     if (n) {
-      c == null && (c = W.isPath(n) ? Ca(e, n) : (T) => Ze.isElement(T) && E.isBlock(e, T));
+      c == null && (c = U.isPath(n) ? Ca(e, n) : (T) => Ze.isElement(T) && E.isBlock(e, T));
       var d = E.pathRef(e, r), m = E.nodes(e, {
         at: n,
         match: c,
@@ -4348,7 +4348,7 @@ var h4 = function(t, r) {
           type: "move_node",
           path: C,
           newPath: A
-        }), d.current && W.isSibling(A, C) && W.isAfter(A, C) && (d.current = W.next(d.current));
+        }), d.current && U.isSibling(A, C) && U.isAfter(A, C) && (d.current = U.next(d.current));
       }
       d.unref();
     }
@@ -4365,7 +4365,7 @@ var h4 = function(t, r) {
       match: d
     } = r;
     if (c) {
-      d == null && (d = W.isPath(c) ? Ca(t, c) : (T) => Ze.isElement(T) && E.isBlock(t, T)), !n && ge.isRange(c) && (c = E.unhangRange(t, c, {
+      d == null && (d = U.isPath(c) ? Ca(t, c) : (T) => Ze.isElement(T) && E.isBlock(t, T)), !n && ge.isRange(c) && (c = E.unhangRange(t, c, {
         voids: a
       }));
       var m = E.nodes(t, {
@@ -4405,7 +4405,7 @@ var h4 = function(t, r) {
       voids: C = !1
     } = n;
     if (l) {
-      if (a == null && (a = W.isPath(l) ? Ca(t, l) : (ve) => Ze.isElement(ve) && E.isBlock(t, ve)), !m && ge.isRange(l) && (l = E.unhangRange(t, l, {
+      if (a == null && (a = U.isPath(l) ? Ca(t, l) : (ve) => Ze.isElement(ve) && E.isBlock(t, ve)), !m && ge.isRange(l) && (l = E.unhangRange(t, l, {
         voids: C
       })), y && ge.isRange(l)) {
         if (ge.isCollapsed(l) && E.leaf(t, l.anchor)[0].text.length > 0)
@@ -4470,7 +4470,7 @@ var h4 = function(t, r) {
       height: d = 0,
       always: m = !1
     } = r;
-    if (l == null && (l = (pe) => Ze.isElement(pe) && E.isBlock(t, pe)), ge.isRange(c) && (c = C4(t, c)), W.isPath(c)) {
+    if (l == null && (l = (pe) => Ze.isElement(pe) && E.isBlock(t, pe)), ge.isRange(c) && (c = C4(t, c)), U.isPath(c)) {
       var p = c, y = E.point(t, p), [C] = E.parent(t, p);
       l = (pe) => pe === C, d = y.path.length - p.length + 1, c = y, m = !0;
     }
@@ -4498,7 +4498,7 @@ var h4 = function(t, r) {
             if (!H) {
               var L = {
                 text: ""
-              }, z = W.next(q);
+              }, z = U.next(q);
               Oe.insertNodes(t, L, {
                 at: z,
                 voids: a
@@ -4561,7 +4561,7 @@ var h4 = function(t, r) {
       match: d
     } = r;
     if (c) {
-      d == null && (d = W.isPath(c) ? Ca(t, c) : (T) => Ze.isElement(T) && E.isBlock(t, T)), W.isPath(c) && (c = E.range(t, c));
+      d == null && (d = U.isPath(c) ? Ca(t, c) : (T) => Ze.isElement(T) && E.isBlock(t, T)), U.isPath(c) && (c = E.range(t, c));
       var m = ge.isRange(c) ? E.rangeRef(t, c) : null, p = E.nodes(t, {
         at: c,
         match: d,
@@ -4623,7 +4623,7 @@ var B4 = function(t, r) {
       at: m = t.selection
     } = n;
     if (m) {
-      if (d == null && (W.isPath(m) ? d = Ca(t, m) : t.isInline(r) ? d = (g) => Ze.isElement(g) && E.isInline(t, g) || Ke.isText(g) : d = (g) => Ze.isElement(g) && E.isBlock(t, g)), l && ge.isRange(m)) {
+      if (d == null && (U.isPath(m) ? d = Ca(t, m) : t.isInline(r) ? d = (g) => Ze.isElement(g) && E.isInline(t, g) || Ke.isText(g) : d = (g) => Ze.isElement(g) && E.isBlock(t, g)), l && ge.isRange(m)) {
         var [p, y] = ge.edges(m), C = E.rangeRef(t, m, {
           affinity: "inward"
         });
@@ -4656,7 +4656,7 @@ var B4 = function(t, r) {
           var [H] = q, L = q[q.length - 1], [, z] = H, [, V] = L;
           if (z.length === 0 && V.length === 0)
             return 0;
-          var G = W.equals(z, V) ? W.parent(z) : W.common(z, V), ve = E.range(t, z, V), xe = E.node(t, G), [oe] = xe, he = G.length + 1, ee = W.next(V.slice(0, he)), R = oc(oc({}, r), {}, {
+          var G = U.equals(z, V) ? U.parent(z) : U.common(z, V), ve = E.range(t, z, V), xe = E.node(t, G), [oe] = xe, he = G.length + 1, ee = U.next(V.slice(0, he)), R = oc(oc({}, r), {}, {
             children: []
           });
           Oe.insertNodes(t, R, {
@@ -5345,12 +5345,12 @@ const U4 = /* @__PURE__ */ bi(W4), kc = (e) => typeof e == "object" && e != null
   for (let le = 0; le < T.length; le++) {
     const ne = T[le], { height: ye, width: pe, top: $, right: de, bottom: Ae, left: Ee } = ne.getBoundingClientRect();
     if (c === "if-needed" && z >= 0 && ve >= 0 && G <= g && V <= O && (ne === A && !Es(ne) || z >= $ && G <= Ae && ve >= Ee && V <= de)) return Y;
-    const ie = getComputedStyle(ne), me = parseInt(ie.borderLeftWidth, 10), P = parseInt(ie.borderTopWidth, 10), U = parseInt(ie.borderRightWidth, 10), re = parseInt(ie.borderBottomWidth, 10);
+    const ie = getComputedStyle(ne), me = parseInt(ie.borderLeftWidth, 10), P = parseInt(ie.borderTopWidth, 10), W = parseInt(ie.borderRightWidth, 10), re = parseInt(ie.borderBottomWidth, 10);
     let Q = 0, ue = 0;
-    const Be = "offsetWidth" in ne ? ne.offsetWidth - ne.clientWidth - me - U : 0, Le = "offsetHeight" in ne ? ne.offsetHeight - ne.clientHeight - P - re : 0, Je = "offsetWidth" in ne ? ne.offsetWidth === 0 ? 0 : pe / ne.offsetWidth : 0, K = "offsetHeight" in ne ? ne.offsetHeight === 0 ? 0 : ye / ne.offsetHeight : 0;
-    if (A === ne) Q = d === "start" ? R : d === "end" ? R - g : d === "nearest" ? Bs(q, q + g, g, P, re, q + R, q + R + H, H) : R - g / 2, ue = m === "start" ? J : m === "center" ? J - O / 2 : m === "end" ? J - O : Bs(I, I + O, O, me, U, I + J, I + J + L, L), Q = Math.max(0, Q + q), ue = Math.max(0, ue + I);
+    const Be = "offsetWidth" in ne ? ne.offsetWidth - ne.clientWidth - me - W : 0, Le = "offsetHeight" in ne ? ne.offsetHeight - ne.clientHeight - P - re : 0, Je = "offsetWidth" in ne ? ne.offsetWidth === 0 ? 0 : pe / ne.offsetWidth : 0, K = "offsetHeight" in ne ? ne.offsetHeight === 0 ? 0 : ye / ne.offsetHeight : 0;
+    if (A === ne) Q = d === "start" ? R : d === "end" ? R - g : d === "nearest" ? Bs(q, q + g, g, P, re, q + R, q + R + H, H) : R - g / 2, ue = m === "start" ? J : m === "center" ? J - O / 2 : m === "end" ? J - O : Bs(I, I + O, O, me, W, I + J, I + J + L, L), Q = Math.max(0, Q + q), ue = Math.max(0, ue + I);
     else {
-      Q = d === "start" ? R - $ - P : d === "end" ? R - Ae + re + Le : d === "nearest" ? Bs($, Ae, ye, P, re + Le, R, R + H, H) : R - ($ + ye / 2) + Le / 2, ue = m === "start" ? J - Ee - me : m === "center" ? J - (Ee + pe / 2) + Be / 2 : m === "end" ? J - de + U + Be : Bs(Ee, de, pe, me, U + Be, J, J + L, L);
+      Q = d === "start" ? R - $ - P : d === "end" ? R - Ae + re + Le : d === "nearest" ? Bs($, Ae, ye, P, re + Le, R, R + H, H) : R - ($ + ye / 2) + Le / 2, ue = m === "start" ? J - Ee - me : m === "center" ? J - (Ee + pe / 2) + Be / 2 : m === "end" ? J - de + W + Be : Bs(Ee, de, pe, me, W + Be, J, J + L, L);
       const { scrollLeft: je, scrollTop: Ie } = ne;
       Q = K === 0 ? 0 : Math.max(0, Math.min(Ie + Q / K, ne.scrollHeight - ye / K + Le)), ue = Je === 0 ? 0 : Math.max(0, Math.min(je + ue / Je, ne.scrollWidth - pe / Je + Be)), R += Ie - Q, J += je - ue;
     }
@@ -6306,7 +6306,7 @@ function $g(e, t) {
     return !1;
   if (n.start !== a.text.length || n.text.length === 0)
     return a.text.slice(n.start, n.start + n.text.length) === n.text;
-  var l = W.next(r);
+  var l = U.next(r);
   if (!E.hasPath(e, l))
     return !1;
   var c = $e.get(e, l);
@@ -6386,7 +6386,7 @@ function h0(e, t) {
       at: r,
       match: Ke.isText
     });
-    if (!c || !W.isDescendant(c[1], l[1]))
+    if (!c || !U.isDescendant(c[1], l[1]))
       return null;
     n -= a.text.length, a = c[0], r = c[1];
   }
@@ -6415,7 +6415,7 @@ function p0(e, t, r) {
     var {
       path: C
     } = y;
-    return W.equals(C, t.path);
+    return U.equals(C, t.path);
   });
   if (!a || t.offset <= a.diff.start)
     return yt.transform(t, r, {
@@ -6442,7 +6442,7 @@ function p0(e, t, r) {
   }, p = yt.transform(m, r, {
     affinity: "backward"
   });
-  return p ? r.type === "split_node" && W.equals(r.path, t.path) && m.offset < r.position && l.start < r.position ? p : {
+  return p ? r.type === "split_node" && U.equals(r.path, t.path) && m.offset < r.position && l.start < r.position ? p : {
     path: p.path,
     offset: p.offset + l.text.length - l.end + l.start
   } : null;
@@ -6470,7 +6470,7 @@ function Hg(e, t) {
   } = e;
   switch (t.type) {
     case "insert_text":
-      return !W.equals(t.path, r) || t.offset >= n.end ? e : t.offset <= n.start ? {
+      return !U.equals(t.path, r) || t.offset >= n.end ? e : t.offset <= n.start ? {
         diff: {
           start: t.text.length + n.start,
           end: t.text.length + n.end,
@@ -6488,7 +6488,7 @@ function Hg(e, t) {
         path: r
       };
     case "remove_text":
-      return !W.equals(t.path, r) || t.offset >= n.end ? e : t.offset + t.text.length <= n.start ? {
+      return !U.equals(t.path, r) || t.offset >= n.end ? e : t.offset + t.text.length <= n.start ? {
         diff: {
           start: n.start - t.text.length,
           end: n.end - t.text.length,
@@ -6506,10 +6506,10 @@ function Hg(e, t) {
         path: r
       };
     case "split_node":
-      return !W.equals(t.path, r) || t.position >= n.end ? {
+      return !U.equals(t.path, r) || t.position >= n.end ? {
         diff: n,
         id: a,
-        path: W.transform(r, t, {
+        path: U.transform(r, t, {
           affinity: "backward"
         })
       } : t.position > n.start ? {
@@ -6527,26 +6527,26 @@ function Hg(e, t) {
           text: n.text
         },
         id: a,
-        path: W.transform(r, t, {
+        path: U.transform(r, t, {
           affinity: "forward"
         })
       };
     case "merge_node":
-      return W.equals(t.path, r) ? {
+      return U.equals(t.path, r) ? {
         diff: {
           start: n.start + t.position,
           end: n.end + t.position,
           text: n.text
         },
         id: a,
-        path: W.transform(r, t)
+        path: U.transform(r, t)
       } : {
         diff: n,
         id: a,
-        path: W.transform(r, t)
+        path: U.transform(r, t)
       };
   }
-  var l = W.transform(r, t);
+  var l = U.transform(r, t);
   return l ? {
     diff: n,
     path: l,
@@ -6648,7 +6648,7 @@ function Yg(e) {
   }, g = (ee, R) => {
     var J, Y = (J = Nr.get(t)) !== null && J !== void 0 ? J : [];
     Nr.set(t, Y);
-    var le = $e.leaf(t, ee), ne = Y.findIndex(($) => W.equals($.path, ee));
+    var le = $e.leaf(t, ee), ne = Y.findIndex(($) => U.equals($.path, ee));
     if (ne < 0) {
       var ye = Bf(le.text, R);
       ye && Y.push({
@@ -6700,26 +6700,26 @@ function Yg(e) {
                 at: de.path,
                 match: Ke.isText
               });
-              ie && W.equals(ie[1], Ae.path) && (Y = {
+              ie && U.equals(ie[1], Ae.path) && (Y = {
                 anchor: Ae,
                 focus: Ae
               });
             }
           }
-          var me = J.endsWith("Backward") ? "backward" : "forward", [P, U] = ge.edges(Y), [re, Q] = E.leaf(t, P.path), ue = {
+          var me = J.endsWith("Backward") ? "backward" : "forward", [P, W] = ge.edges(Y), [re, Q] = E.leaf(t, P.path), ue = {
             text: "",
             start: P.offset,
-            end: U.offset
-          }, Be = Nr.get(t), Le = Be?.find((ot) => W.equals(ot.path, Q)), Je = Le ? [Le.diff, ue] : [ue], K = Ef(re.text, ...Je);
+            end: W.offset
+          }, Be = Nr.get(t), Le = Be?.find((ot) => U.equals(ot.path, Q)), Je = Le ? [Le.diff, ue] : [ue], K = Ef(re.text, ...Je);
           if (K.length === 0 && ($ = !1), ge.isExpanded(Y)) {
-            if ($ && W.equals(Y.anchor.path, Y.focus.path)) {
+            if ($ && U.equals(Y.anchor.path, Y.focus.path)) {
               var je = {
                 path: Y.anchor.path,
                 offset: P.offset
               }, Ie = E.range(t, je, je);
               return G(Ie), g(Y.anchor.path, {
                 text: "",
-                end: U.offset,
+                end: W.offset,
                 start: P.offset
               });
             }
@@ -6845,7 +6845,7 @@ function Yg(e) {
               }, {
                 at: Y
               });
-            if (W.equals(Y.anchor.path, Y.focus.path)) {
+            if (U.equals(Y.anchor.path, Y.focus.path)) {
               var [mt, kt] = ge.edges(Y), ut = {
                 start: mt.offset,
                 end: kt.offset,
@@ -6878,7 +6878,7 @@ function Yg(e) {
       selection: R
     } = t;
     if (ee) {
-      var J = !R || !W.equals(R.anchor.path, ee.anchor.path), Y = !R || !W.equals(R.anchor.path.slice(0, -1), ee.anchor.path.slice(0, -1));
+      var J = !R || !U.equals(R.anchor.path, ee.anchor.path), Y = !R || !U.equals(R.anchor.path.slice(0, -1), ee.anchor.path.slice(0, -1));
       (J && p || Y) && (p = !1), (J || L()) && (c = setTimeout(A, Ug));
     }
   }, ve = () => {
@@ -7011,7 +7011,7 @@ var o2 = (e) => {
     leaf: r,
     parent: n,
     text: a
-  } = e, l = Rn(), c = De.findPath(l, a), d = W.parent(c), m = !!r[wf];
+  } = e, l = Rn(), c = De.findPath(l, a), d = U.parent(c), m = !!r[wf];
   return l.isVoid(n) ? /* @__PURE__ */ rt.createElement(Ro, {
     length: $e.string(n).length
   }) : r.text === "" && n.children[n.children.length - 1] === a && !l.isInline(n) && E.string(l, d) === "" ? /* @__PURE__ */ rt.createElement(Ro, {
@@ -7512,8 +7512,8 @@ var N2 = (e) => /* @__PURE__ */ rt.createElement(rt.Fragment, null, Nf(e)), jo =
       R();
       return;
     }
-    var P = De.toDOMNode(g, g), U = P.getRootNode();
-    if (!G.current && In && U instanceof ShadowRoot) {
+    var P = De.toDOMNode(g, g), W = P.getRootNode();
+    if (!G.current && In && W instanceof ShadowRoot) {
       G.current = !0;
       var re = Rg();
       re ? document.execCommand("indent") : Oe.deselect(g), G.current = !1;
@@ -7545,7 +7545,7 @@ var N2 = (e) => /* @__PURE__ */ rt.createElement(rt.Fragment, null, Nf(e)), jo =
     onDOMSelectionChange: R,
     scheduleOnDOMSelectionChange: J
   }), rs(() => {
-    var P, U, re;
+    var P, W, re;
     H.current && (re = _0(H.current)) ? (yf.set(g, re), Ks.set(g, H.current), Un.set(g, H.current), ts.set(H.current, g)) : Un.delete(g);
     var {
       selection: Q
@@ -7587,7 +7587,7 @@ var N2 = (e) => /* @__PURE__ */ rt.createElement(rt.Fragment, null, Nf(e)), jo =
         }
       };
       Be.rangeCount <= 1 && Le();
-      var Je = ((U = ee.current) === null || U === void 0 ? void 0 : U.isFlushing()) === "action";
+      var Je = ((W = ee.current) === null || W === void 0 ? void 0 : W.isFlushing()) === "action";
       if (!Ar || !Je) {
         setTimeout(() => {
           he.isUpdatingSelection = !1;
@@ -7614,7 +7614,7 @@ var N2 = (e) => /* @__PURE__ */ rt.createElement(rt.Fragment, null, Nf(e)), jo =
     }
   });
   var Y = ct((P) => {
-    var U = De.toDOMNode(g, g), re = U.getRootNode();
+    var W = De.toDOMNode(g, g), re = W.getRootNode();
     if (G != null && G.current && In && re instanceof ShadowRoot) {
       var Q = P.getTargetRanges(), ue = Q[0], Be = new window.Range();
       Be.setStart(ue.startContainer, ue.startOffset), Be.setEnd(ue.endContainer, ue.endOffset);
@@ -7769,17 +7769,17 @@ var N2 = (e) => /* @__PURE__ */ rt.createElement(rt.Fragment, null, Nf(e)), jo =
   rs(() => {
     var P = De.getWindow(g);
     P.document.addEventListener("selectionchange", J);
-    var U = () => {
+    var W = () => {
       he.isDraggingInternally = !1;
     };
-    return P.document.addEventListener("dragend", U), P.document.addEventListener("drop", U), () => {
-      P.document.removeEventListener("selectionchange", J), P.document.removeEventListener("dragend", U), P.document.removeEventListener("drop", U);
+    return P.document.addEventListener("dragend", W), P.document.addEventListener("drop", W), () => {
+      P.document.removeEventListener("selectionchange", J), P.document.removeEventListener("dragend", W), P.document.removeEventListener("drop", W);
     };
   }, [J, he]);
   var ne = a([g, []]), ye = c && g.children.length === 1 && Array.from($e.texts(g)).length === 1 && $e.string(g) === "" && !I, pe = ct((P) => {
     if (P && ye) {
-      var U;
-      V((U = P.getBoundingClientRect()) === null || U === void 0 ? void 0 : U.height);
+      var W;
+      V((W = P.getBoundingClientRect()) === null || W === void 0 ? void 0 : W.height);
     } else
       V(void 0);
   }, [ye]);
@@ -7820,8 +7820,8 @@ var N2 = (e) => /* @__PURE__ */ rt.createElement(rt.Fragment, null, Nf(e)), jo =
       } = g;
       if (P) {
         var {
-          anchor: U
-        } = P, re = $e.leaf(g, U.path);
+          anchor: W
+        } = P, re = $e.leaf(g, W.path);
         if (de && !Ke.equals(re, de, {
           loose: !0
         })) {
@@ -7874,8 +7874,8 @@ var N2 = (e) => /* @__PURE__ */ rt.createElement(rt.Fragment, null, Nf(e)), jo =
     } : {})), A),
     onBeforeInput: ct((P) => {
       if (!Bn && !d && !Cr(P, O.onBeforeInput) && De.hasSelectableTarget(g, P.target) && (P.preventDefault(), !De.isComposing(g))) {
-        var U = P.data;
-        E.insertText(g, U);
+        var W = P.data;
+        E.insertText(g, W);
       }
     }, [O.onBeforeInput, g, d]),
     onInput: ct((P) => {
@@ -7884,8 +7884,8 @@ var N2 = (e) => /* @__PURE__ */ rt.createElement(rt.Fragment, null, Nf(e)), jo =
           ee.current.handleInput();
           return;
         }
-        for (var U of L.current)
-          U();
+        for (var W of L.current)
+          W();
         if (L.current = [], !De.isFocused(g)) {
           var re = P.nativeEvent, Q = g;
           if (re.inputType === "historyUndo" && typeof Q.undo == "function") {
@@ -7901,8 +7901,8 @@ var N2 = (e) => /* @__PURE__ */ rt.createElement(rt.Fragment, null, Nf(e)), jo =
     }, [O.onInput, g]),
     onBlur: ct((P) => {
       if (!(d || he.isUpdatingSelection || !De.hasSelectableTarget(g, P.target) || Cr(P, O.onBlur))) {
-        var U = De.findDocumentOrShadowRoot(g);
-        if (he.latestElement !== U.activeElement) {
+        var W = De.findDocumentOrShadowRoot(g);
+        if (he.latestElement !== W.activeElement) {
           var {
             relatedTarget: re
           } = P, Q = De.toDOMNode(g, g);
@@ -7913,7 +7913,7 @@ var N2 = (e) => /* @__PURE__ */ rt.createElement(rt.Fragment, null, Nf(e)), jo =
                 return;
             }
             if (In) {
-              var Be = Ua(U);
+              var Be = Ua(W);
               Be?.removeAllRanges();
             }
             On.delete(g);
@@ -7923,12 +7923,12 @@ var N2 = (e) => /* @__PURE__ */ rt.createElement(rt.Fragment, null, Nf(e)), jo =
     }, [d, he.isUpdatingSelection, he.latestElement, g, O.onBlur]),
     onClick: ct((P) => {
       if (De.hasTarget(g, P.target) && !Cr(P, O.onClick) && Nn(P.target)) {
-        var U = De.toSlateNode(g, P.target), re = De.findPath(g, U);
-        if (!E.hasPath(g, re) || $e.get(g, re) !== U)
+        var W = De.toSlateNode(g, P.target), re = De.findPath(g, W);
+        if (!E.hasPath(g, re) || $e.get(g, re) !== W)
           return;
         if (P.detail === D2 && re.length >= 1) {
           var Q = re;
-          if (!(Ze.isElement(U) && E.isBlock(g, U))) {
+          if (!(Ze.isElement(W) && E.isBlock(g, W))) {
             var ue, Be = E.above(g, {
               match: (at) => Ze.isElement(at) && E.isBlock(g, at),
               at: re
@@ -7946,7 +7946,7 @@ var N2 = (e) => /* @__PURE__ */ rt.createElement(rt.Fragment, null, Nf(e)), jo =
         }), Ie = E.void(g, {
           at: K
         });
-        if (je && Ie && W.equals(je[1], Ie[1])) {
+        if (je && Ie && U.equals(je[1], Ie[1])) {
           var Ye = E.range(g, Je);
           Oe.select(g, Ye);
         }
@@ -7954,10 +7954,10 @@ var N2 = (e) => /* @__PURE__ */ rt.createElement(rt.Fragment, null, Nf(e)), jo =
     }, [g, O.onClick, d]),
     onCompositionEnd: ct((P) => {
       if (De.hasSelectableTarget(g, P.target)) {
-        var U;
+        var W;
         if (De.isComposing(g) && Promise.resolve().then(() => {
           q(!1), _n.set(g, !1);
-        }), (U = ee.current) === null || U === void 0 || U.handleCompositionEnd(P), Cr(P, O.onCompositionEnd) || Ar)
+        }), (W = ee.current) === null || W === void 0 || W.handleCompositionEnd(P), Cr(P, O.onCompositionEnd) || Ar)
           return;
         if (!In && !Cg && !vf && !Ag && !kg && P.data) {
           var re = Vr.get(g);
@@ -7972,8 +7972,8 @@ var N2 = (e) => /* @__PURE__ */ rt.createElement(rt.Fragment, null, Nf(e)), jo =
     }, [O.onCompositionUpdate, g]),
     onCompositionStart: ct((P) => {
       if (De.hasSelectableTarget(g, P.target)) {
-        var U;
-        if ((U = ee.current) === null || U === void 0 || U.handleCompositionStart(P), Cr(P, O.onCompositionStart) || Ar)
+        var W;
+        if ((W = ee.current) === null || W === void 0 || W.handleCompositionStart(P), Cr(P, O.onCompositionStart) || Ar)
           return;
         q(!0);
         var {
@@ -7992,26 +7992,26 @@ var N2 = (e) => /* @__PURE__ */ rt.createElement(rt.Fragment, null, Nf(e)), jo =
       if (!d && De.hasSelectableTarget(g, P.target) && !Cr(P, O.onCut) && !Kc(P)) {
         P.preventDefault(), De.setFragmentData(g, P.clipboardData, "cut");
         var {
-          selection: U
+          selection: W
         } = g;
-        if (U)
-          if (ge.isExpanded(U))
+        if (W)
+          if (ge.isExpanded(W))
             E.deleteFragment(g);
           else {
-            var re = $e.parent(g, U.anchor.path);
+            var re = $e.parent(g, W.anchor.path);
             E.isVoid(g, re) && Oe.delete(g);
           }
       }
     }, [d, g, O.onCut]),
     onDragOver: ct((P) => {
       if (De.hasTarget(g, P.target) && !Cr(P, O.onDragOver)) {
-        var U = De.toSlateNode(g, P.target);
-        Ze.isElement(U) && E.isVoid(g, U) && P.preventDefault();
+        var W = De.toSlateNode(g, P.target);
+        Ze.isElement(W) && E.isVoid(g, W) && P.preventDefault();
       }
     }, [O.onDragOver, g]),
     onDragStart: ct((P) => {
       if (!d && De.hasTarget(g, P.target) && !Cr(P, O.onDragStart)) {
-        var U = De.toSlateNode(g, P.target), re = De.findPath(g, U), Q = Ze.isElement(U) && E.isVoid(g, U) || E.void(g, {
+        var W = De.toSlateNode(g, P.target), re = De.findPath(g, W), Q = Ze.isElement(W) && E.isVoid(g, W) || E.void(g, {
           at: re,
           voids: !0
         });
@@ -8025,12 +8025,12 @@ var N2 = (e) => /* @__PURE__ */ rt.createElement(rt.Fragment, null, Nf(e)), jo =
     onDrop: ct((P) => {
       if (!d && De.hasTarget(g, P.target) && !Cr(P, O.onDrop)) {
         P.preventDefault();
-        var U = g.selection, re = De.findEventRange(g, P), Q = P.dataTransfer;
-        Oe.select(g, re), he.isDraggingInternally && U && !ge.equals(U, re) && !E.void(g, {
+        var W = g.selection, re = De.findEventRange(g, P), Q = P.dataTransfer;
+        Oe.select(g, re), he.isDraggingInternally && W && !ge.equals(W, re) && !E.void(g, {
           at: re,
           voids: !0
         }) && Oe.delete(g, {
-          at: U
+          at: W
         }), De.insertData(g, Q), De.isFocused(g) || De.focus(g);
       }
     }, [d, g, O.onDrop, he]),
@@ -8039,9 +8039,9 @@ var N2 = (e) => /* @__PURE__ */ rt.createElement(rt.Fragment, null, Nf(e)), jo =
     }, [d, he, O, g]),
     onFocus: ct((P) => {
       if (!d && !he.isUpdatingSelection && De.hasEditableTarget(g, P.target) && !Cr(P, O.onFocus)) {
-        var U = De.toDOMNode(g, g), re = De.findDocumentOrShadowRoot(g);
-        if (he.latestElement = re.activeElement, ca && P.target !== U) {
-          U.focus();
+        var W = De.toDOMNode(g, g), re = De.findDocumentOrShadowRoot(g);
+        if (he.latestElement = re.activeElement, ca && P.target !== W) {
+          W.focus();
           return;
         }
         On.set(g, !0);
@@ -8049,8 +8049,8 @@ var N2 = (e) => /* @__PURE__ */ rt.createElement(rt.Fragment, null, Nf(e)), jo =
     }, [d, he, g, O.onFocus]),
     onKeyDown: ct((P) => {
       if (!d && De.hasEditableTarget(g, P.target)) {
-        var U;
-        (U = ee.current) === null || U === void 0 || U.handleKeyDown(P);
+        var W;
+        (W = ee.current) === null || W === void 0 || W.handleKeyDown(P);
         var {
           nativeEvent: re
         } = P;
@@ -8413,20 +8413,20 @@ var q2 = function(t) {
       }
       case "insert_node":
       case "remove_node": {
-        y.push(...aa(n, W.parent(p.path)));
+        y.push(...aa(n, U.parent(p.path)));
         break;
       }
       case "merge_node": {
-        var q = W.previous(p.path);
+        var q = U.previous(p.path);
         y.push(...aa(n, q));
         break;
       }
       case "move_node": {
-        var H = W.common(W.parent(p.path), W.parent(p.newPath));
+        var H = U.common(U.parent(p.path), U.parent(p.newPath));
         y.push(...aa(n, H));
         var L;
-        W.isBefore(p.path, p.newPath) ? (y.push(...aa(n, W.parent(p.path))), L = p.newPath) : (y.push(...aa(n, W.parent(p.newPath))), L = p.path);
-        var z = $e.get(t, W.parent(L)), V = De.findKey(n, z), G = E.pathRef(n, W.parent(L));
+        U.isBefore(p.path, p.newPath) ? (y.push(...aa(n, U.parent(p.path))), L = p.newPath) : (y.push(...aa(n, U.parent(p.newPath))), L = p.path);
+        var z = $e.get(t, U.parent(L)), V = De.findKey(n, z), G = E.pathRef(n, U.parent(L));
         C.push([G, V]);
         break;
       }
@@ -11133,8 +11133,8 @@ function F3(e, t, r) {
     return (function(V, G, ve) {
       var xe = V.attrs, oe = V.componentStyle, he = V.defaultProps, ee = V.foldedComponentIds, R = V.styledComponentId, J = V.target, Y = rt.useContext(v1), le = gd(), ne = V.shouldForwardProp || le.shouldForwardProp;
       process.env.NODE_ENV !== "production" && bu(R);
-      var ye = K5(G, Y, he) || ya, pe = (function(me, P, U) {
-        for (var re, Q = Rr(Rr({}, P), { className: void 0, theme: U }), ue = 0; ue < me.length; ue += 1) {
+      var ye = K5(G, Y, he) || ya, pe = (function(me, P, W) {
+        for (var re, Q = Rr(Rr({}, P), { className: void 0, theme: W }), ue = 0; ue < me.length; ue += 1) {
           var Be = xa(re = me[ue]) ? re(Q) : re;
           for (var Le in Be) Q[Le] = Le === "className" ? qn(Q[Le], Be[Le]) : Le === "style" ? Rr(Rr({}, Q[Le]), Be[Le]) : Be[Le];
         }
@@ -11142,7 +11142,7 @@ function F3(e, t, r) {
       })(xe, G, ye), $ = pe.as || J, de = {};
       for (var Ae in pe) pe[Ae] === void 0 || Ae[0] === "$" || Ae === "as" || Ae === "theme" && pe.theme === ye || (Ae === "forwardedAs" ? de.as = pe.forwardedAs : ne && !ne(Ae, $) || (de[Ae] = pe[Ae], ne || process.env.NODE_ENV !== "development" || B5(Ae) || bd.has(Ae) || !D0.has($) || (bd.add(Ae), console.warn('styled-components: it looks like an unknown prop "'.concat(Ae, '" is being sent through to the DOM, which will likely trigger a React console error. If you would like automatic filtering of unknown props, you can opt-into that behavior via `<StyleSheetManager shouldForwardProp={...}>` (connect an API like `@emotion/is-prop-valid`) or consider using transient props (`$` prefix for automatic filtering.)')))));
       var Ee = (function(me, P) {
-        var U = gd(), re = me.generateAndInjectStyles(P, U.styleSheet, U.stylis);
+        var W = gd(), re = me.generateAndInjectStyles(P, W.styleSheet, W.stylis);
         return process.env.NODE_ENV !== "production" && bu(re), re;
       })(oe, pe);
       process.env.NODE_ENV !== "production" && V.warnTooManyClasses && V.warnTooManyClasses(Ee);
@@ -11926,7 +11926,7 @@ function R3() {
     function P(K) {
       return z(K) === r;
     }
-    function U(K) {
+    function W(K) {
       return z(K) === A;
     }
     function re(K) {
@@ -11947,7 +11947,7 @@ function R3() {
     function Je(K) {
       return z(K) === y;
     }
-    Pt.ContextConsumer = V, Pt.ContextProvider = G, Pt.Element = ve, Pt.ForwardRef = xe, Pt.Fragment = oe, Pt.Lazy = he, Pt.Memo = ee, Pt.Portal = R, Pt.Profiler = J, Pt.StrictMode = Y, Pt.Suspense = le, Pt.SuspenseList = ne, Pt.isAsyncMode = $, Pt.isConcurrentMode = de, Pt.isContextConsumer = Ae, Pt.isContextProvider = Ee, Pt.isElement = ie, Pt.isForwardRef = me, Pt.isFragment = P, Pt.isLazy = U, Pt.isMemo = re, Pt.isPortal = Q, Pt.isProfiler = ue, Pt.isStrictMode = Be, Pt.isSuspense = Le, Pt.isSuspenseList = Je, Pt.isValidElementType = L, Pt.typeOf = z;
+    Pt.ContextConsumer = V, Pt.ContextProvider = G, Pt.Element = ve, Pt.ForwardRef = xe, Pt.Fragment = oe, Pt.Lazy = he, Pt.Memo = ee, Pt.Portal = R, Pt.Profiler = J, Pt.StrictMode = Y, Pt.Suspense = le, Pt.SuspenseList = ne, Pt.isAsyncMode = $, Pt.isConcurrentMode = de, Pt.isContextConsumer = Ae, Pt.isContextProvider = Ee, Pt.isElement = ie, Pt.isForwardRef = me, Pt.isFragment = P, Pt.isLazy = W, Pt.isMemo = re, Pt.isPortal = Q, Pt.isProfiler = ue, Pt.isStrictMode = Be, Pt.isSuspense = Le, Pt.isSuspenseList = Je, Pt.isValidElementType = L, Pt.typeOf = z;
   })()), Pt;
 }
 var Cd;
@@ -12120,28 +12120,28 @@ function z3() {
     function g($) {
       if (process.env.NODE_ENV !== "production")
         var de = {}, Ae = 0;
-      function Ee(me, P, U, re, Q, ue, Be) {
-        if (re = re || A, ue = ue || U, Be !== r) {
+      function Ee(me, P, W, re, Q, ue, Be) {
+        if (re = re || A, ue = ue || W, Be !== r) {
           if (m) {
             var Le = new Error(
               "Calling PropTypes validators directly is not supported by the `prop-types` package. Use `PropTypes.checkPropTypes()` to call them. Read more at http://fb.me/use-check-prop-types"
             );
             throw Le.name = "Invariant Violation", Le;
           } else if (process.env.NODE_ENV !== "production" && typeof console < "u") {
-            var Je = re + ":" + U;
+            var Je = re + ":" + W;
             !de[Je] && // Avoid spamming the console because they are often not actionable except for lib authors
             Ae < 3 && (l(
               "You are manually calling a React.PropTypes validation function for the `" + ue + "` prop on `" + re + "`. This is deprecated and will throw in the standalone `prop-types` package. You may be seeing this warning due to a third-party PropTypes library. See https://fb.me/react-warning-dont-call-proptypes for details."
             ), de[Je] = !0, Ae++);
           }
         }
-        return P[U] == null ? me ? P[U] === null ? new O("The " + Q + " `" + ue + "` is marked as required " + ("in `" + re + "`, but its value is `null`.")) : new O("The " + Q + " `" + ue + "` is marked as required in " + ("`" + re + "`, but its value is `undefined`.")) : null : $(P, U, re, Q, ue);
+        return P[W] == null ? me ? P[W] === null ? new O("The " + Q + " `" + ue + "` is marked as required " + ("in `" + re + "`, but its value is `null`.")) : new O("The " + Q + " `" + ue + "` is marked as required in " + ("`" + re + "`, but its value is `undefined`.")) : null : $(P, W, re, Q, ue);
       }
       var ie = Ee.bind(null, !1);
       return ie.isRequired = Ee.bind(null, !0), ie;
     }
     function I($) {
-      function de(Ae, Ee, ie, me, P, U) {
+      function de(Ae, Ee, ie, me, P, W) {
         var re = Ae[Ee], Q = le(re);
         if (Q !== $) {
           var ue = ne(re);
@@ -12161,13 +12161,13 @@ function z3() {
       function de(Ae, Ee, ie, me, P) {
         if (typeof $ != "function")
           return new O("Property `" + P + "` of component `" + ie + "` has invalid PropType notation inside arrayOf.");
-        var U = Ae[Ee];
-        if (!Array.isArray(U)) {
-          var re = le(U);
+        var W = Ae[Ee];
+        if (!Array.isArray(W)) {
+          var re = le(W);
           return new O("Invalid " + me + " `" + P + "` of type " + ("`" + re + "` supplied to `" + ie + "`, expected an array."));
         }
-        for (var Q = 0; Q < U.length; Q++) {
-          var ue = $(U, Q, ie, me, P + "[" + Q + "]", r);
+        for (var Q = 0; Q < W.length; Q++) {
+          var ue = $(W, Q, ie, me, P + "[" + Q + "]", r);
           if (ue instanceof Error)
             return ue;
         }
@@ -12179,8 +12179,8 @@ function z3() {
       function $(de, Ae, Ee, ie, me) {
         var P = de[Ae];
         if (!d(P)) {
-          var U = le(P);
-          return new O("Invalid " + ie + " `" + me + "` of type " + ("`" + U + "` supplied to `" + Ee + "`, expected a single ReactElement."));
+          var W = le(P);
+          return new O("Invalid " + ie + " `" + me + "` of type " + ("`" + W + "` supplied to `" + Ee + "`, expected a single ReactElement."));
         }
         return null;
       }
@@ -12190,8 +12190,8 @@ function z3() {
       function $(de, Ae, Ee, ie, me) {
         var P = de[Ae];
         if (!e.isValidElementType(P)) {
-          var U = le(P);
-          return new O("Invalid " + ie + " `" + me + "` of type " + ("`" + U + "` supplied to `" + Ee + "`, expected a single ReactElement type."));
+          var W = le(P);
+          return new O("Invalid " + ie + " `" + me + "` of type " + ("`" + W + "` supplied to `" + Ee + "`, expected a single ReactElement type."));
         }
         return null;
       }
@@ -12200,8 +12200,8 @@ function z3() {
     function V($) {
       function de(Ae, Ee, ie, me, P) {
         if (!(Ae[Ee] instanceof $)) {
-          var U = $.name || A, re = pe(Ae[Ee]);
-          return new O("Invalid " + me + " `" + P + "` of type " + ("`" + re + "` supplied to `" + ie + "`, expected ") + ("instance of `" + U + "`."));
+          var W = $.name || A, re = pe(Ae[Ee]);
+          return new O("Invalid " + me + " `" + P + "` of type " + ("`" + re + "` supplied to `" + ie + "`, expected ") + ("instance of `" + W + "`."));
         }
         return null;
       }
@@ -12213,14 +12213,14 @@ function z3() {
           "Invalid arguments supplied to oneOf, expected an array, got " + arguments.length + " arguments. A common mistake is to write oneOf(x, y, z) instead of oneOf([x, y, z])."
         ) : l("Invalid argument supplied to oneOf, expected an array.")), c;
       function de(Ae, Ee, ie, me, P) {
-        for (var U = Ae[Ee], re = 0; re < $.length; re++)
-          if (N(U, $[re]))
+        for (var W = Ae[Ee], re = 0; re < $.length; re++)
+          if (N(W, $[re]))
             return null;
         var Q = JSON.stringify($, function(Be, Le) {
           var Je = ne(Le);
           return Je === "symbol" ? String(Le) : Le;
         });
-        return new O("Invalid " + me + " `" + P + "` of value `" + String(U) + "` " + ("supplied to `" + ie + "`, expected one of " + Q + "."));
+        return new O("Invalid " + me + " `" + P + "` of value `" + String(W) + "` " + ("supplied to `" + ie + "`, expected one of " + Q + "."));
       }
       return g(de);
     }
@@ -12228,12 +12228,12 @@ function z3() {
       function de(Ae, Ee, ie, me, P) {
         if (typeof $ != "function")
           return new O("Property `" + P + "` of component `" + ie + "` has invalid PropType notation inside objectOf.");
-        var U = Ae[Ee], re = le(U);
+        var W = Ae[Ee], re = le(W);
         if (re !== "object")
           return new O("Invalid " + me + " `" + P + "` of type " + ("`" + re + "` supplied to `" + ie + "`, expected an object."));
-        for (var Q in U)
-          if (n(U, Q)) {
-            var ue = $(U, Q, ie, me, P + "." + Q, r);
+        for (var Q in W)
+          if (n(W, Q)) {
+            var ue = $(W, Q, ie, me, P + "." + Q, r);
             if (ue instanceof Error)
               return ue;
           }
@@ -12251,15 +12251,15 @@ function z3() {
             "Invalid argument supplied to oneOfType. Expected an array of check functions, but received " + ye(Ae) + " at index " + de + "."
           ), c;
       }
-      function Ee(ie, me, P, U, re) {
+      function Ee(ie, me, P, W, re) {
         for (var Q = [], ue = 0; ue < $.length; ue++) {
-          var Be = $[ue], Le = Be(ie, me, P, U, re, r);
+          var Be = $[ue], Le = Be(ie, me, P, W, re, r);
           if (Le == null)
             return null;
           Le.data && n(Le.data, "expectedType") && Q.push(Le.data.expectedType);
         }
         var Je = Q.length > 0 ? ", expected one of type [" + Q.join(", ") + "]" : "";
-        return new O("Invalid " + U + " `" + re + "` supplied to " + ("`" + P + "`" + Je + "."));
+        return new O("Invalid " + W + " `" + re + "` supplied to " + ("`" + P + "`" + Je + "."));
       }
       return g(Ee);
     }
@@ -12276,14 +12276,14 @@ function z3() {
     }
     function ee($) {
       function de(Ae, Ee, ie, me, P) {
-        var U = Ae[Ee], re = le(U);
+        var W = Ae[Ee], re = le(W);
         if (re !== "object")
           return new O("Invalid " + me + " `" + P + "` of type `" + re + "` " + ("supplied to `" + ie + "`, expected `object`."));
         for (var Q in $) {
           var ue = $[Q];
           if (typeof ue != "function")
             return he(ie, me, P, Q, ne(ue));
-          var Be = ue(U, Q, ie, me, P + "." + Q, r);
+          var Be = ue(W, Q, ie, me, P + "." + Q, r);
           if (Be)
             return Be;
         }
@@ -12293,7 +12293,7 @@ function z3() {
     }
     function R($) {
       function de(Ae, Ee, ie, me, P) {
-        var U = Ae[Ee], re = le(U);
+        var W = Ae[Ee], re = le(W);
         if (re !== "object")
           return new O("Invalid " + me + " `" + P + "` of type `" + re + "` " + ("supplied to `" + ie + "`, expected `object`."));
         var Q = t({}, Ae[Ee], $);
@@ -12306,7 +12306,7 @@ function z3() {
               "Invalid " + me + " `" + P + "` key `" + ue + "` supplied to `" + ie + "`.\nBad object: " + JSON.stringify(Ae[Ee], null, "  ") + `
 Valid keys: ` + JSON.stringify(Object.keys($), null, "  ")
             );
-          var Le = Be(U, ue, ie, me, P + "." + ue, r);
+          var Le = Be(W, ue, ie, me, P + "." + ue, r);
           if (Le)
             return Le;
         }
@@ -12840,7 +12840,7 @@ H400000v` + (40 + i) + `H845.2724
 s-225.272,467,-225.272,467s-235,486,-235,486c-2.7,4.7,-9,7,-19,7
 c-6,0,-10,-1,-12,-3s-194,-422,-194,-422s-65,47,-65,47z
 M` + (834 + i) + " " + s + "h400000v" + (40 + i) + "h-400000z";
-          }, U = function(i, s) {
+          }, W = function(i, s) {
             return "M263," + (601 + i + s) + `c0.7,0,18,39.7,52,119
 c34,79.3,68.167,158.7,102.5,238c34.3,79.3,51.8,119.3,52.5,120
 c340,-704.7,510.7,-1060.3,512,-1067
@@ -12902,7 +12902,7 @@ c-4-3.333-8.333-7.667-13 -13l-13-13l77-155 77-156c66 199.333 139 419.667
                 u = P(s, me);
                 break;
               case "sqrtSize1":
-                u = U(s, me);
+                u = W(s, me);
                 break;
               case "sqrtSize2":
                 u = re(s, me);
@@ -24671,8 +24671,8 @@ const Da = ({
   if (!V.current) {
     const ie = S4(), me = q2(ie), { isInline: P } = me;
     me.isInline = (Q) => !H.includes("template") && Q.type === "template" ? !0 : P(Q);
-    const { isVoid: U } = me;
-    me.isVoid = (Q) => !H.includes("template") && Q.type === "template" ? !0 : U(Q);
+    const { isVoid: W } = me;
+    me.isVoid = (Q) => !H.includes("template") && Q.type === "template" ? !0 : W(Q);
     const re = (Q) => {
       if (!(q && !H.includes("template"))) return Q;
       const { insertText: Be, insertData: Le } = Q, Je = () => {
@@ -24783,12 +24783,12 @@ const Da = ({
     const P = me.replace(/\\n/g, `
 `).replace(/\\r/g, "\r").replace(/\\t/g, "	").replace(/\\'/g, "'").replace(/\\\\/g, "\\").replace(/&quot;/g, '"');
     navigator.clipboard.writeText(P).then(() => {
-      const U = ie.innerHTML;
+      const W = ie.innerHTML;
       ie.innerHTML = '<svg width="16" height="16" viewBox="0 0 24 24" fill="none" stroke="#2da44e" stroke-width="2" stroke-linecap="round" stroke-linejoin="round"><polyline points="20,6 9,17 4,12"></polyline></svg>', ie.classList.add("copied"), setTimeout(() => {
-        ie.innerHTML = U, ie.classList.remove("copied");
+        ie.innerHTML = W, ie.classList.remove("copied");
       }, 2e3);
-    }).catch((U) => {
-      console.error("\u590D\u5236\u5931\u8D25:", U);
+    }).catch((W) => {
+      console.error("\u590D\u5236\u5931\u8D25:", W);
       const re = ie.innerHTML;
       ie.innerHTML = '<svg width="12" height="12" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="2" stroke-linecap="round" stroke-linejoin="round"><line x1="18" y1="6" x2="6" y2="18"></line><line x1="6" y1="6" x2="18" y2="18"></line></svg>', ie.style.background = "#d73a49", ie.style.borderColor = "#d73a49", ie.style.color = "white", setTimeout(() => {
         ie.innerHTML = re, ie.style.background = "", ie.style.borderColor = "", ie.style.color = "";
@@ -24860,14 +24860,14 @@ const Da = ({
           return `<pre><code${Be}>${Le}</code><button class="code-copy-btn" data-code="${Je}" onclick="copyCodeFromData(this)" title="\u590D\u5236\u4EE3\u7801"><svg width="12" height="12" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="2" stroke-linecap="round" stroke-linejoin="round"><rect width="14" height="14" x="8" y="8" rx="2" ry="2"></rect><path d="M4 16c-1.1 0-2-.9-2-2V4c0-1.1.9-2 2-2h10c1.1 0 2 .9 2 2"></path></svg></button></pre>`;
         }
       );
-      const U = z?.disabledBackground || z?.backgroundColor || "#ffffff", re = (ue, Be) => ue.startsWith("#") ? `${ue}${Math.round(Be * 255).toString(16).padStart(2, "0")}` : ue, Q = `
+      const W = z?.disabledBackground || z?.backgroundColor || "#ffffff", re = (ue, Be) => ue.startsWith("#") ? `${ue}${Math.round(Be * 255).toString(16).padStart(2, "0")}` : ue, Q = `
         <style>
           .table-container{ overflow:auto; border:1px solid ${z?.borderColor || "#e5e7eb"}; border-radius: 6px; background:${z?.backgroundColor || "transparent"} !important; }
           .table-container table{ background:${z?.backgroundColor || "transparent"} !important; color:${z?.textColor || "#24292f"} !important; }
           .table-container th{ background:${z?.disabledBackground || "#f6f8fa"} !important; color:${z?.textColor || "#24292f"} !important; }
           .table-container td{ color:${z?.textColor || "#24292f"} !important; background:${z?.backgroundColor || "transparent"} !important; }
           .table-container tr:nth-child(even) td{ background:${z?.disabledBackground || "#f6f8fa"} !important; }
-          pre{ position:relative; background:${U}; border:1px solid ${z?.borderColor || "#e5e7eb"}; border-radius:6px; padding:12px 36px 12px 12px; color:${z?.textColor || "#e5e7eb"}; }
+          pre{ position:relative; background:${W}; border:1px solid ${z?.borderColor || "#e5e7eb"}; border-radius:6px; padding:12px 36px 12px 12px; color:${z?.textColor || "#e5e7eb"}; }
           pre::before{ content:''; position:absolute; inset:0; border-radius:6px; pointer-events:none; background: linear-gradient(90deg, ${re("#22c55e", 0.25)}, ${re("#f59e0b", 0.25)}, ${re("#ef4444", 0.25)}); opacity: .45; mix-blend-mode: overlay; }
           pre .code-copy-btn{ position:absolute; top:8px; right:8px; background:transparent; border:1px solid ${z?.borderColor || "#e5e7eb"}; color:${z?.textColor || "#24292f"}; border-radius:6px; padding:2px 6px; cursor:pointer; }
           pre .code-copy-btn:hover{ background:${z?.hoverBackground || "rgba(0,0,0,0.06)"}; }
@@ -25198,7 +25198,7 @@ function c6() {
             case C:
               return pe ? de(1, ie) : de(0, ie + 1);
             case y:
-              var U = this.$locale().weekStart || 0, re = (Ee < U ? Ee + 7 : Ee) - U;
+              var W = this.$locale().weekStart || 0, re = (Ee < W ? Ee + 7 : Ee) - W;
               return de(pe ? me - re : me + (6 - re), ie);
             case p:
             case N:
@@ -25243,7 +25243,7 @@ function c6() {
         }, Y.format = function(le) {
           var ne = this, ye = this.$locale();
           if (!this.isValid()) return ye.invalidDate || O;
-          var pe = le || "YYYY-MM-DDTHH:mm:ssZ", $ = he.z(this), de = this.$H, Ae = this.$m, Ee = this.$M, ie = ye.weekdays, me = ye.months, P = ye.meridiem, U = function(ue, Be, Le, Je) {
+          var pe = le || "YYYY-MM-DDTHH:mm:ssZ", $ = he.z(this), de = this.$H, Ae = this.$m, Ee = this.$M, ie = ye.weekdays, me = ye.months, P = ye.meridiem, W = function(ue, Be, Le, Je) {
             return ue && (ue[Be] || ue(ne, pe)) || Le[Be].slice(0, Je);
           }, re = function(ue) {
             return he.s(de % 12 || 12, ue, "0");
@@ -25263,9 +25263,9 @@ function c6() {
                 case "MM":
                   return he.s(Ee + 1, 2, "0");
                 case "MMM":
-                  return U(ye.monthsShort, Ee, me, 3);
+                  return W(ye.monthsShort, Ee, me, 3);
                 case "MMMM":
-                  return U(me, Ee);
+                  return W(me, Ee);
                 case "D":
                   return ne.$D;
                 case "DD":
@@ -25273,9 +25273,9 @@ function c6() {
                 case "d":
                   return String(ne.$W);
                 case "dd":
-                  return U(ye.weekdaysMin, ne.$W, ie, 2);
+                  return W(ye.weekdaysMin, ne.$W, ie, 2);
                 case "ddd":
-                  return U(ye.weekdaysShort, ne.$W, ie, 3);
+                  return W(ye.weekdaysShort, ne.$W, ie, 3);
                 case "dddd":
                   return ie[ne.$W];
                 case "H":
@@ -26683,7 +26683,7 @@ const m7 = Ne.div.attrs({
   thoughtChainNodes: ie,
   knowledgeBases: me,
   enableCot: P,
-  chainRespTime: U,
+  chainRespTime: W,
   thoughtChainStatus: re
 }) => {
   Yt(() => {
@@ -26782,7 +26782,7 @@ const m7 = Ne.div.attrs({
         nodes: Kt,
         status: B,
         simpleThinkOnly: Se,
-        chainRespTime: U
+        chainRespTime: W
       }
     ) });
   }, [Ot, Ht] = wt([]), [Bt, Re] = wt(null), ur = it(() => {
@@ -28989,7 +28989,7 @@ const M7 = Ne.div.attrs({
         }
     },
     [ie]
-  ), U = it(() => {
+  ), W = it(() => {
     if (!N) return null;
     try {
       const K = typeof N == "string" ? N : N.configJson || N.searchConfigDTO?.configJson;
@@ -29240,7 +29240,7 @@ const M7 = Ne.div.attrs({
               t === "stream" && r === "processing" && /* @__PURE__ */ x.jsx("span", { className: "animate-pulse inline-block ml-1", children: "\u258A" })
             ] }) : /* @__PURE__ */ x.jsx(Hs, { theme: R, children: "\u6682\u65E0\u8BED\u4E49\u56DE\u7B54\u5185\u5BB9" })
           ] }),
-          Y === "prompt" && /* @__PURE__ */ x.jsx(x.Fragment, { children: A || U?.prompt ? /* @__PURE__ */ x.jsx(M7, { theme: R, children: A || U?.prompt }) : /* @__PURE__ */ x.jsx(Hs, { theme: R, children: "\u6682\u65E0 Prompt \u5185\u5BB9" }) }),
+          Y === "prompt" && /* @__PURE__ */ x.jsx(x.Fragment, { children: A || W?.prompt ? /* @__PURE__ */ x.jsx(M7, { theme: R, children: A || W?.prompt }) : /* @__PURE__ */ x.jsx(Hs, { theme: R, children: "\u6682\u65E0 Prompt \u5185\u5BB9" }) }),
           Y === "retrieve" && /* @__PURE__ */ x.jsx(j7, { theme: R, children: re && re.length > 0 ? re.map((K, je) => {
             const Ie = K.metadata || {}, Ye = K.score ?? Ie.score ?? 0, at = K.rerank_score_rank ?? Ie.rerank_score_rank ?? "-", lt = K.rrf_score ?? Ie.rrf_score ?? 0, dt = Ie.search_type && Array.isArray(Ie.search_type) ? Ie.search_type.join(", ") : Ie.search_type || "es", Dt = K.page_content || "", We = K.sourceFileName || Ie.sourceFileName || Ie.source?.split("/").pop() || "\u672A\u77E5\u6587\u4EF6", mt = K.order_num || je, kt = ne.has(mt);
             return /* @__PURE__ */ x.jsxs(P7, { theme: R, children: [
@@ -29334,75 +29334,75 @@ const M7 = Ne.div.attrs({
               ] })
             ] }, mt);
           }) : /* @__PURE__ */ x.jsx(Hs, { theme: R, children: "\u6682\u65E0\u53EC\u56DE\u4FE1\u606F" }) }),
-          Y === "config" && /* @__PURE__ */ x.jsx(R7, { theme: R, children: U ? /* @__PURE__ */ x.jsxs(x.Fragment, { children: [
+          Y === "config" && /* @__PURE__ */ x.jsx(R7, { theme: R, children: W ? /* @__PURE__ */ x.jsxs(x.Fragment, { children: [
             /* @__PURE__ */ x.jsxs(Wd, { theme: R, children: [
               /* @__PURE__ */ x.jsxs(Ud, { theme: R, children: [
                 /* @__PURE__ */ x.jsx("span", { className: "dot" }),
                 /* @__PURE__ */ x.jsx("span", { children: "\u53EC\u56DE\u914D\u7F6E" })
               ] }),
               /* @__PURE__ */ x.jsxs(Vd, { theme: R, children: [
-                (U.textChunks !== void 0 || U.top_k !== void 0) && /* @__PURE__ */ x.jsxs(mr, { theme: R, children: [
+                (W.top_k !== void 0 || W.textChunks !== void 0) && /* @__PURE__ */ x.jsxs(mr, { theme: R, children: [
                   /* @__PURE__ */ x.jsx(gr, { theme: R, children: "\u8FD4\u56DE\u6587\u672C\u7247\u6570\u91CF" }),
-                  /* @__PURE__ */ x.jsx(kr, { theme: R, children: U.textChunks ?? U.top_k })
+                  /* @__PURE__ */ x.jsx(kr, { theme: R, children: W.top_k ?? W.textChunks })
                 ] }),
-                (U.topP !== void 0 || U.score_threshold !== void 0) && /* @__PURE__ */ x.jsxs(mr, { theme: R, children: [
+                (W.score_threshold !== void 0 || W.topP !== void 0) && /* @__PURE__ */ x.jsxs(mr, { theme: R, children: [
                   /* @__PURE__ */ x.jsx(gr, { theme: R, children: "\u76F8\u4F3C\u5EA6\u9608\u503C" }),
-                  /* @__PURE__ */ x.jsx(kr, { theme: R, children: U.topP ?? U.score_threshold })
+                  /* @__PURE__ */ x.jsx(kr, { theme: R, children: W.score_threshold ?? W.topP })
                 ] }),
-                (U.topN !== void 0 || U.top_k !== void 0) && /* @__PURE__ */ x.jsxs(mr, { theme: R, children: [
+                (W.top_n !== void 0 || W.topN !== void 0 || W.top_k !== void 0) && /* @__PURE__ */ x.jsxs(mr, { theme: R, children: [
                   /* @__PURE__ */ x.jsx(gr, { theme: R, children: "\u53EC\u56DE\u6570\u91CF" }),
-                  /* @__PURE__ */ x.jsx(kr, { theme: R, children: U.topN ?? U.top_k })
+                  /* @__PURE__ */ x.jsx(kr, { theme: R, children: W.top_n ?? W.topN ?? W.top_k })
                 ] }),
-                (U.denseWeight !== void 0 || U.dense_weight !== void 0) && /* @__PURE__ */ x.jsxs(mr, { theme: R, children: [
+                (W.dense_weight !== void 0 || W.denseWeight !== void 0) && /* @__PURE__ */ x.jsxs(mr, { theme: R, children: [
                   /* @__PURE__ */ x.jsx(gr, { theme: R, children: "\u5411\u91CF\u6743\u91CD" }),
-                  /* @__PURE__ */ x.jsx(kr, { theme: R, children: U.denseWeight ?? U.dense_weight })
+                  /* @__PURE__ */ x.jsx(kr, { theme: R, children: W.dense_weight ?? W.denseWeight })
                 ] }),
-                (U["search policy"] !== void 0 || U.search_policy !== void 0) && /* @__PURE__ */ x.jsxs(mr, { theme: R, children: [
+                (W["search policy"] !== void 0 || W.search_policy !== void 0) && /* @__PURE__ */ x.jsxs(mr, { theme: R, children: [
                   /* @__PURE__ */ x.jsx(gr, { theme: R, children: "\u68C0\u7D22\u7B56\u7565" }),
                   /* @__PURE__ */ x.jsx(kr, { theme: R, children: (() => {
-                    const K = U["search policy"] ?? U.search_policy;
+                    const K = W["search policy"] ?? W.search_policy;
                     return K === 1 ? "\u6DF7\u5408\u68C0\u7D22" : K === 2 ? "\u5411\u91CF\u68C0\u7D22" : K === 3 ? "\u5173\u952E\u8BCD\u68C0\u7D22" : K;
                   })() })
                 ] }),
-                U.diversity !== void 0 && /* @__PURE__ */ x.jsxs(mr, { theme: R, children: [
+                W.diversity !== void 0 && /* @__PURE__ */ x.jsxs(mr, { theme: R, children: [
                   /* @__PURE__ */ x.jsx(gr, { theme: R, children: "\u591A\u6837\u6027" }),
-                  /* @__PURE__ */ x.jsx(kr, { theme: R, children: U.diversity })
+                  /* @__PURE__ */ x.jsx(kr, { theme: R, children: W.diversity })
                 ] }),
-                U.temperature !== void 0 && /* @__PURE__ */ x.jsxs(mr, { theme: R, children: [
+                W.temperature !== void 0 && /* @__PURE__ */ x.jsxs(mr, { theme: R, children: [
                   /* @__PURE__ */ x.jsx(gr, { theme: R, children: "\u6E29\u5EA6" }),
-                  /* @__PURE__ */ x.jsx(kr, { theme: R, children: U.temperature })
+                  /* @__PURE__ */ x.jsx(kr, { theme: R, children: W.temperature })
                 ] }),
-                (U.top_p !== void 0 || U.topP !== void 0) && /* @__PURE__ */ x.jsxs(mr, { theme: R, children: [
+                (W.top_p !== void 0 || W.topP !== void 0) && /* @__PURE__ */ x.jsxs(mr, { theme: R, children: [
                   /* @__PURE__ */ x.jsx(gr, { theme: R, children: "Top P" }),
-                  /* @__PURE__ */ x.jsx(kr, { theme: R, children: U.top_p ?? U.topP })
+                  /* @__PURE__ */ x.jsx(kr, { theme: R, children: W.top_p ?? W.topP })
                 ] }),
-                (U.maxTokens !== void 0 || U.max_tokens !== void 0) && /* @__PURE__ */ x.jsxs(mr, { theme: R, children: [
+                (W.max_tokens !== void 0 || W.maxTokens !== void 0) && /* @__PURE__ */ x.jsxs(mr, { theme: R, children: [
                   /* @__PURE__ */ x.jsx(gr, { theme: R, children: "\u6700\u5927\u4EE4\u724C\u6570" }),
-                  /* @__PURE__ */ x.jsx(kr, { theme: R, children: U.maxTokens ?? U.max_tokens })
+                  /* @__PURE__ */ x.jsx(kr, { theme: R, children: W.max_tokens ?? W.maxTokens })
                 ] }),
-                (U.model_name !== void 0 || U["1lmModel"] !== void 0) && /* @__PURE__ */ x.jsxs(mr, { theme: R, children: [
+                (W.model_name !== void 0 || W["1lmModel"] !== void 0) && /* @__PURE__ */ x.jsxs(mr, { theme: R, children: [
                   /* @__PURE__ */ x.jsx(gr, { theme: R, children: "\u95EE\u7B54\u6A21\u578B" }),
-                  /* @__PURE__ */ x.jsx(kr, { theme: R, children: U.model_name ?? U["1lmModel"] })
+                  /* @__PURE__ */ x.jsx(kr, { theme: R, children: W.model_name ?? W["1lmModel"] })
                 ] }),
-                U.plan_model_name !== void 0 && /* @__PURE__ */ x.jsxs(mr, { theme: R, children: [
+                W.plan_model_name !== void 0 && /* @__PURE__ */ x.jsxs(mr, { theme: R, children: [
                   /* @__PURE__ */ x.jsx(gr, { theme: R, children: "\u89C4\u5212\u6A21\u578B" }),
-                  /* @__PURE__ */ x.jsx(kr, { theme: R, children: U.plan_model_name })
+                  /* @__PURE__ */ x.jsx(kr, { theme: R, children: W.plan_model_name })
                 ] }),
-                U.recallModel !== void 0 && /* @__PURE__ */ x.jsxs(mr, { theme: R, children: [
+                W.recallModel !== void 0 && /* @__PURE__ */ x.jsxs(mr, { theme: R, children: [
                   /* @__PURE__ */ x.jsx(gr, { theme: R, children: "\u6392\u5E8F\u6A21\u578B" }),
-                  /* @__PURE__ */ x.jsx(kr, { theme: R, children: U.recallModel })
+                  /* @__PURE__ */ x.jsx(kr, { theme: R, children: W.recallModel })
                 ] }),
-                U.rerank_model_name !== void 0 && /* @__PURE__ */ x.jsxs(mr, { theme: R, children: [
+                W.rerank_model_name !== void 0 && /* @__PURE__ */ x.jsxs(mr, { theme: R, children: [
                   /* @__PURE__ */ x.jsx(gr, { theme: R, children: "\u91CD\u6392\u6A21\u578B" }),
-                  /* @__PURE__ */ x.jsx(kr, { theme: R, children: U.rerank_model_name })
+                  /* @__PURE__ */ x.jsx(kr, { theme: R, children: W.rerank_model_name })
                 ] }),
-                U.knowledge_base_name !== void 0 && /* @__PURE__ */ x.jsxs(mr, { theme: R, children: [
+                W.knowledge_base_name !== void 0 && /* @__PURE__ */ x.jsxs(mr, { theme: R, children: [
                   /* @__PURE__ */ x.jsx(gr, { theme: R, children: "\u77E5\u8BC6\u5E93\u540D\u79F0" }),
-                  /* @__PURE__ */ x.jsx(kr, { theme: R, children: U.knowledge_base_name })
+                  /* @__PURE__ */ x.jsx(kr, { theme: R, children: W.knowledge_base_name })
                 ] }),
-                U.search_type !== void 0 && /* @__PURE__ */ x.jsxs(mr, { theme: R, children: [
+                W.search_type !== void 0 && /* @__PURE__ */ x.jsxs(mr, { theme: R, children: [
                   /* @__PURE__ */ x.jsx(gr, { theme: R, children: "\u7D22\u5F15\u6765\u6E90" }),
-                  /* @__PURE__ */ x.jsx(kr, { theme: R, children: U.search_type ?? "undefined" })
+                  /* @__PURE__ */ x.jsx(kr, { theme: R, children: W.search_type ?? "undefined" })
                 ] })
               ] })
             ] }),
@@ -29412,36 +29412,36 @@ const M7 = Ne.div.attrs({
                 /* @__PURE__ */ x.jsx("span", { children: "\u529F\u80FD\u5F00\u5173" })
               ] }),
               /* @__PURE__ */ x.jsxs(Vd, { theme: R, children: [
-                (U.enableKG !== void 0 || U.enabled_graph !== void 0) && /* @__PURE__ */ x.jsxs(mr, { theme: R, children: [
+                (W.enabled_graph !== void 0 || W.enableKG !== void 0) && /* @__PURE__ */ x.jsxs(mr, { theme: R, children: [
                   /* @__PURE__ */ x.jsx(gr, { theme: R, children: "\u56FE\u8C31\u589E\u5F3A" }),
                   /* @__PURE__ */ x.jsx(
                     Qo,
                     {
                       theme: R,
-                      enabled: U.enableKG === !0 || U.enabled_graph === !0,
-                      children: U.enableKG === !0 || U.enabled_graph === !0 ? "\u5F00\u542F" : "\u5173\u95ED"
+                      enabled: W.enabled_graph === !0 || W.enableKG === !0,
+                      children: W.enabled_graph === !0 || W.enableKG === !0 ? "\u5F00\u542F" : "\u5173\u95ED"
                     }
                   )
                 ] }),
-                U.enableThinking !== void 0 && /* @__PURE__ */ x.jsxs(mr, { theme: R, children: [
+                W.enableThinking !== void 0 && /* @__PURE__ */ x.jsxs(mr, { theme: R, children: [
                   /* @__PURE__ */ x.jsx(gr, { theme: R, children: "\u6DF1\u5EA6\u601D\u8003" }),
                   /* @__PURE__ */ x.jsx(
                     Qo,
                     {
                       theme: R,
-                      enabled: U.enableThinking === !0,
-                      children: U.enableThinking === !0 ? "\u5F00\u542F" : "\u5173\u95ED"
+                      enabled: W.enableThinking === !0,
+                      children: W.enableThinking === !0 ? "\u5F00\u542F" : "\u5173\u95ED"
                     }
                   )
                 ] }),
-                (U.enabled_llm !== void 0 || U.enableLLM !== void 0) && /* @__PURE__ */ x.jsxs(mr, { theme: R, children: [
+                (W.enabled_llm !== void 0 || W.enableLLM !== void 0) && /* @__PURE__ */ x.jsxs(mr, { theme: R, children: [
                   /* @__PURE__ */ x.jsx(gr, { theme: R, children: "\u542F\u7528LLM" }),
                   /* @__PURE__ */ x.jsx(
                     Qo,
                     {
                       theme: R,
-                      enabled: U.enabled_llm === !0 || U.enableLLM === !0,
-                      children: U.enabled_llm === !0 || U.enableLLM === !0 ? "\u5F00\u542F" : "\u5173\u95ED"
+                      enabled: W.enabled_llm === !0 || W.enabled_llm === "true" || W.enableLLM === !0,
+                      children: W.enabled_llm === !0 || W.enabled_llm === "true" || W.enableLLM === !0 ? "\u5F00\u542F" : "\u5173\u95ED"
                     }
                   )
                 ] })
@@ -29718,7 +29718,7 @@ const M7 = Ne.div.attrs({
     };
     return ue(), window.addEventListener("resize", ue), () => window.removeEventListener("resize", ue);
   }, []);
-  const U = ct((ue, Be) => {
+  const W = ct((ue, Be) => {
     const Le = {
       type: ue.type,
       content: ue.content
@@ -29758,7 +29758,7 @@ const M7 = Ne.div.attrs({
   }, [t, r, H, y, N]), re = () => (console.log("[Markdownit] renderContent segments.len:", z.length, "enableVirtualScroll:", t), z.length === 0 ? /* @__PURE__ */ x.jsxs(X7, { theme: H, children: [
     /* @__PURE__ */ x.jsx("h3", { children: "\u6682\u65E0\u5185\u5BB9" }),
     /* @__PURE__ */ x.jsx("p", { children: "\u8BF7\u6DFB\u52A0\u4E00\u4E9B\u5185\u5BB9\u6765\u5F00\u59CB" })
-  ] }) : t ? /* @__PURE__ */ x.jsx("div", { ref: de, style: { height: Ee, position: "relative" }, children: ie.map(U) }) : /* @__PURE__ */ x.jsx("div", { ref: de, children: z.map(U) })), Q = () => !R && !c ? null : /* @__PURE__ */ x.jsx(K7, { theme: H, children: c ? "\u52A0\u8F7D\u66F4\u591A\u5185\u5BB9..." : "\u52A0\u8F7D\u4E2D..." });
+  ] }) : t ? /* @__PURE__ */ x.jsx("div", { ref: de, style: { height: Ee, position: "relative" }, children: ie.map(W) }) : /* @__PURE__ */ x.jsx("div", { ref: de, children: z.map(W) })), Q = () => !R && !c ? null : /* @__PURE__ */ x.jsx(K7, { theme: H, children: c ? "\u52A0\u8F7D\u66F4\u591A\u5185\u5BB9..." : "\u52A0\u8F7D\u4E2D..." });
   return /* @__PURE__ */ x.jsx(
     G7,
     {