lt-ppt 1.0.26 → 1.0.28

package/dist/{screen-CacUF2YF.js → screen-Brvtzttu.js}

@@ -1,22 +1,6 @@
 import { defineStore as Js } from "./pinia-CVat9nJz.js";
-import { c as Uy } from "./lib-B0z78_t3.js";
-const Jy = "useandom-26T198340PX75pxJACKVERYMINDBUSHWOLF_GQZbfghjklqvwyzrict";
-let Gy = (u) => crypto.getRandomValues(new Uint8Array(u)), Hy = (u, t, n) => {
-  let i = (2 << Math.log2(u.length - 1)) - 1, a = -~(1.6 * i * t / u.length);
-  return (f = t) => {
-    let h = "";
-    for (; ; ) {
-      let y = n(a), b = a | 0;
-      for (; b--; )
-        if (h += u[y[b] & i] || "", h.length >= f) return h;
-    }
-  };
-}, $y = (u, t = 21) => Hy(u, t | 0, Gy), A0 = (u = 21) => {
-  let t = "", n = crypto.getRandomValues(new Uint8Array(u |= 0));
-  for (; u--; )
-    t += Jy[n[u] & 63];
-  return t;
-};
+import { customAlphabet as Uy } from "./index.browser-Wq18ov6h.js";
+import { c as Jy } from "./lib-9k4fJaGf.js";
 var Yf = /* @__PURE__ */ ((u) => (u.EL_ANIMATION = "elAnimation", u.EL_STYLE = "elStyle", u.EL_POSITION = "elPosition", u.SLIDE_DESIGN = "slideDesign", u.SLIDE_ANIMATION = "slideAnimation", u.MULTI_STYLE = "multiStyle", u.MULTI_POSITION = "multiPosition", u))(Yf || {});
 function it(u) {
   this.content = u;
@@ -154,8 +138,8 @@ function Zf(u, t, n, i) {
     if (!h.sameMarkup(y))
       return { a: n, b: i };
     if (h.isText && h.text != y.text) {
-      let M = 0, K = Math.min(h.text.length, y.text.length);
-      for (; M < K && h.text[h.text.length - M - 1] == y.text[y.text.length - M - 1]; )
+      let M = 0, z = Math.min(h.text.length, y.text.length);
+      for (; M < z && h.text[h.text.length - M - 1] == y.text[y.text.length - M - 1]; )
         M++, n--, i--;
       return { a: n, b: i };
     }
@@ -185,8 +169,8 @@ class ie {
     for (let h = 0, y = 0; y < n; h++) {
       let b = this.content[h], M = y + b.nodeSize;
       if (M > t && i(b, a + y, f || null, h) !== !1 && b.content.size) {
-        let K = y + 1;
-        b.nodesBetween(Math.max(0, t - K), Math.min(b.content.size, n - K), i, a + K);
+        let z = y + 1;
+        b.nodesBetween(Math.max(0, t - z), Math.min(b.content.size, n - z), i, a + z);
       }
       y = M;
     }
@@ -655,7 +639,7 @@ function ec(u, t, n, i) {
   let y = ec(h.content, t - f - 1, n, h);
   return y && u.replaceChild(a, h.copy(y));
 }
-function jy(u, t, n) {
+function Gy(u, t, n) {
   if (n.openStart > u.depth)
     throw new ta("Inserted content deeper than insertion position");
   if (u.depth - n.openStart != t.depth - n.openEnd)
@@ -672,7 +656,7 @@ function tc(u, t, n, i) {
       let h = u.parent, y = h.content;
       return ai(h, y.cut(0, u.parentOffset).append(n.content).append(y.cut(t.parentOffset)));
     } else {
-      let { start: h, end: y } = Vy(n, u);
+      let { start: h, end: y } = Hy(n, u);
       return ai(f, rc(u, h, y, t, i));
     }
   else return ai(f, na(u, t, i));
@@ -689,7 +673,7 @@ function oi(u, t) {
   let n = t.length - 1;
   n >= 0 && u.isText && u.sameMarkup(t[n]) ? t[n] = u.withText(t[n].text + u.text) : t.push(u);
 }
-function Ks(u, t, n, i) {
+function zs(u, t, n, i) {
   let a = (t || u).node(n), f = 0, h = t ? t.index(n) : a.childCount;
   u && (f = u.index(n), u.depth > n ? f++ : u.textOffset && (oi(u.nodeAfter, i), f++));
   for (let y = f; y < h; y++)
@@ -701,17 +685,17 @@ function ai(u, t) {
 }
 function rc(u, t, n, i, a) {
   let f = u.depth > a && Tu(u, t, a + 1), h = i.depth > a && Tu(n, i, a + 1), y = [];
-  return Ks(null, u, a, y), f && h && t.index(a) == n.index(a) ? (nc(f, h), oi(ai(f, rc(u, t, n, i, a + 1)), y)) : (f && oi(ai(f, na(u, t, a + 1)), y), Ks(t, n, a, y), h && oi(ai(h, na(n, i, a + 1)), y)), Ks(i, null, a, y), new ie(y);
+  return zs(null, u, a, y), f && h && t.index(a) == n.index(a) ? (nc(f, h), oi(ai(f, rc(u, t, n, i, a + 1)), y)) : (f && oi(ai(f, na(u, t, a + 1)), y), zs(t, n, a, y), h && oi(ai(h, na(n, i, a + 1)), y)), zs(i, null, a, y), new ie(y);
 }
 function na(u, t, n) {
   let i = [];
-  if (Ks(null, u, n, i), u.depth > n) {
+  if (zs(null, u, n, i), u.depth > n) {
     let a = Tu(u, t, n + 1);
     oi(ai(a, na(u, t, n + 1)), i);
   }
-  return Ks(t, null, n, i), new ie(i);
+  return zs(t, null, n, i), new ie(i);
 }
-function Vy(u, t) {
+function Hy(u, t) {
   let n = t.depth - u.openStart, a = t.node(n).copy(u.content);
   for (let f = n - 1; f >= 0; f--)
     a = t.node(f).copy(ie.from(a));
@@ -905,7 +889,7 @@ class qs {
       return t.blockRange(this);
     for (let i = this.depth - (this.parent.inlineContent || this.pos == t.pos ? 1 : 0); i >= 0; i--)
       if (t.pos <= this.end(i) && (!n || n(this.node(i))))
-        return new Zy(this, t, i);
+        return new Vy(this, t, i);
     return null;
   }
   /**
@@ -962,18 +946,18 @@ class qs {
           return h;
       }
     else
-      If.set(t, i = new Yy());
+      If.set(t, i = new $y());
     let a = i.elts[i.i] = qs.resolve(t, n);
-    return i.i = (i.i + 1) % Xy, a;
+    return i.i = (i.i + 1) % jy, a;
   }
 }
-class Yy {
+class $y {
   constructor() {
     this.elts = [], this.i = 0;
   }
 }
-const Xy = 12, If = /* @__PURE__ */ new WeakMap();
-class Zy {
+const jy = 12, If = /* @__PURE__ */ new WeakMap();
+class Vy {
   /**
   Construct a node range. `$from` and `$to` should point into the
   same node until at least the given `depth`, since a node range
@@ -1013,7 +997,7 @@ class Zy {
     return this.$to.indexAfter(this.depth);
   }
 }
-const Qy = /* @__PURE__ */ Object.create(null);
+const Yy = /* @__PURE__ */ Object.create(null);
 class En {
   /**
   @internal
@@ -1132,7 +1116,7 @@ class En {
   attributes, and marks.
   */
   hasMarkup(t, n, i) {
-    return this.type == t && ea(this.attrs, n || t.defaultAttrs || Qy) && Pe.sameSet(this.marks, i || Pe.none);
+    return this.type == t && ea(this.attrs, n || t.defaultAttrs || Yy) && Pe.sameSet(this.marks, i || Pe.none);
   }
   /**
   Create a new node with the same markup as this node, containing
@@ -1175,7 +1159,7 @@ class En {
   [`ReplaceError`](https://prosemirror.net/docs/ref/#model.ReplaceError) is thrown.
   */
   replace(t, n, i) {
-    return jy(this.resolve(t), this.resolve(n), i);
+    return Gy(this.resolve(t), this.resolve(n), i);
   }
   /**
   Find the node directly after the given position.
@@ -1438,13 +1422,13 @@ class ui {
   @internal
   */
   static parse(t, n) {
-    let i = new ev(t, n);
+    let i = new Xy(t, n);
     if (i.next == null)
       return ui.empty;
     let a = sc(i);
     i.next && i.err("Unexpected trailing text");
-    let f = av(ov(a));
-    return uv(f, i), f;
+    let f = iv(rv(a));
+    return sv(f, i), f;
   }
   /**
   Match a node type, returning a match after that node if
@@ -1509,10 +1493,10 @@ class ui {
       if (b && (!n || b.validEnd))
         return ie.from(y.map((M) => M.createAndFill()));
       for (let M = 0; M < h.next.length; M++) {
-        let { type: K, next: W } = h.next[M];
-        if (!(K.isText || K.hasRequiredAttrs()) && a.indexOf(W) == -1) {
+        let { type: z, next: W } = h.next[M];
+        if (!(z.isText || z.hasRequiredAttrs()) && a.indexOf(W) == -1) {
           a.push(W);
-          let G = f(W, y.concat(K));
+          let G = f(W, y.concat(z));
           if (G)
             return G;
         }
@@ -1590,7 +1574,7 @@ class ui {
   }
 }
 ui.empty = new ui(!0);
-class ev {
+class Xy {
   constructor(t, n) {
     this.string = t, this.nodeTypes = n, this.inline = null, this.pos = 0, this.tokens = t.split(/\s*(?=\b|\W|$)/), this.tokens[this.tokens.length - 1] == "" && this.tokens.pop(), this.tokens[0] == "" && this.tokens.shift();
   }
@@ -1607,19 +1591,19 @@ class ev {
 function sc(u) {
   let t = [];
   do
-    t.push(tv(u));
+    t.push(Zy(u));
   while (u.eat("|"));
   return t.length == 1 ? t[0] : { type: "choice", exprs: t };
 }
-function tv(u) {
+function Zy(u) {
   let t = [];
   do
-    t.push(nv(u));
+    t.push(Qy(u));
   while (u.next && u.next != ")" && u.next != "|");
   return t.length == 1 ? t[0] : { type: "seq", exprs: t };
 }
-function nv(u) {
-  let t = sv(u);
+function Qy(u) {
+  let t = nv(u);
   for (; ; )
     if (u.eat("+"))
       t = { type: "plus", expr: t };
@@ -1628,7 +1612,7 @@ function nv(u) {
     else if (u.eat("?"))
       t = { type: "opt", expr: t };
     else if (u.eat("{"))
-      t = rv(u, t);
+      t = ev(u, t);
     else
       break;
   return t;
@@ -1638,11 +1622,11 @@ function Cf(u) {
   let t = Number(u.next);
   return u.pos++, t;
 }
-function rv(u, t) {
+function ev(u, t) {
   let n = Cf(u), i = n;
   return u.eat(",") && (u.next != "}" ? i = Cf(u) : i = -1), u.eat("}") || u.err("Unclosed braced range"), { type: "range", min: n, max: i, expr: t };
 }
-function iv(u, t) {
+function tv(u, t) {
   let n = u.nodeTypes, i = n[t];
   if (i)
     return [i];
@@ -1653,18 +1637,18 @@ function iv(u, t) {
   }
   return a.length == 0 && u.err("No node type or group '" + t + "' found"), a;
 }
-function sv(u) {
+function nv(u) {
   if (u.eat("(")) {
     let t = sc(u);
     return u.eat(")") || u.err("Missing closing paren"), t;
   } else if (/\W/.test(u.next))
     u.err("Unexpected token '" + u.next + "'");
   else {
-    let t = iv(u, u.next).map((n) => (u.inline == null ? u.inline = n.isInline : u.inline != n.isInline && u.err("Mixing inline and block content"), { type: "name", value: n }));
+    let t = tv(u, u.next).map((n) => (u.inline == null ? u.inline = n.isInline : u.inline != n.isInline && u.err("Mixing inline and block content"), { type: "name", value: n }));
     return u.pos++, t.length == 1 ? t[0] : { type: "choice", exprs: t };
   }
 }
-function ov(u) {
+function rv(u) {
   let t = [[]];
   return a(f(u, 0), n()), t;
   function n() {
@@ -1699,15 +1683,15 @@ function ov(u) {
       if (h.type == "range") {
         let b = y;
         for (let M = 0; M < h.min; M++) {
-          let K = n();
-          a(f(h.expr, b), K), b = K;
+          let z = n();
+          a(f(h.expr, b), z), b = z;
         }
         if (h.max == -1)
           a(f(h.expr, b), b);
         else
           for (let M = h.min; M < h.max; M++) {
-            let K = n();
-            i(b, K), a(f(h.expr, b), K), b = K;
+            let z = n();
+            i(b, z), a(f(h.expr, b), z), b = z;
           }
         return [i(b)];
       } else {
@@ -1735,7 +1719,7 @@ function Tf(u, t) {
     }
   }
 }
-function av(u) {
+function iv(u) {
   let t = /* @__PURE__ */ Object.create(null);
   return n(Tf(u, 0));
   function n(i) {
@@ -1745,10 +1729,10 @@ function av(u) {
         if (!y)
           return;
         let M;
-        for (let K = 0; K < a.length; K++)
-          a[K][0] == y && (M = a[K][1]);
-        Tf(u, b).forEach((K) => {
-          M || a.push([y, M = []]), M.indexOf(K) == -1 && M.push(K);
+        for (let z = 0; z < a.length; z++)
+          a[z][0] == y && (M = a[z][1]);
+        Tf(u, b).forEach((z) => {
+          M || a.push([y, M = []]), M.indexOf(z) == -1 && M.push(z);
         });
       });
     });
@@ -1760,7 +1744,7 @@ function av(u) {
     return f;
   }
 }
-function uv(u, t) {
+function sv(u, t) {
   for (let n = 0, i = [u]; n < i.length; n++) {
     let a = i[n], f = !a.validEnd, h = [];
     for (let y = 0; y < a.next.length; y++) {
@@ -1808,7 +1792,7 @@ function fc(u, t) {
   let n = /* @__PURE__ */ Object.create(null);
   if (t)
     for (let i in t)
-      n[i] = new fv(u, i, t[i]);
+      n[i] = new av(u, i, t[i]);
   return n;
 }
 class ia {
@@ -1990,7 +1974,7 @@ class ia {
     return i;
   }
 }
-function lv(u, t, n) {
+function ov(u, t, n) {
   let i = n.split("|");
   return (a) => {
     let f = a === null ? "null" : typeof a;
@@ -1998,9 +1982,9 @@ function lv(u, t, n) {
       throw new RangeError(`Expected value of type ${i} for attribute ${t} on type ${u}, got ${f}`);
   };
 }
-class fv {
+class av {
   constructor(t, n, i) {
-    this.hasDefault = Object.prototype.hasOwnProperty.call(i, "default"), this.default = i.default, this.validate = typeof i.validate == "string" ? lv(t, n, i.validate) : i.validate;
+    this.hasDefault = Object.prototype.hasOwnProperty.call(i, "default"), this.default = i.default, this.validate = typeof i.validate == "string" ? ov(t, n, i.validate) : i.validate;
   }
   get isRequired() {
     return !this.hasDefault;
@@ -2061,7 +2045,7 @@ class ua {
     return this.excluded.indexOf(t) > -1;
   }
 }
-class O0 {
+class k0 {
   /**
   Construct a schema from a schema [specification](https://prosemirror.net/docs/ref/#model.SchemaSpec).
   */
@@ -2146,10 +2130,10 @@ function Rf(u, t) {
   }
   return n;
 }
-function cv(u) {
+function uv(u) {
   return u.tag != null;
 }
-function hv(u) {
+function lv(u) {
   return u.style != null;
 }
 class Ru {
@@ -2161,9 +2145,9 @@ class Ru {
     this.schema = t, this.rules = n, this.tags = [], this.styles = [];
     let i = this.matchedStyles = [];
     n.forEach((a) => {
-      if (cv(a))
+      if (uv(a))
         this.tags.push(a);
-      else if (hv(a)) {
+      else if (lv(a)) {
         let f = /[^=]*/.exec(a.style)[0];
         i.indexOf(f) < 0 && i.push(f), this.styles.push(a);
       }
@@ -2199,7 +2183,7 @@ class Ru {
   matchTag(t, n, i) {
     for (let a = i ? this.tags.indexOf(i) + 1 : 0; a < this.tags.length; a++) {
       let f = this.tags[a];
-      if (gv(t, f.tag) && (f.namespace === void 0 || t.namespaceURI == f.namespace) && (!f.context || n.matchesContext(f.context))) {
+      if (hv(t, f.tag) && (f.namespace === void 0 || t.namespaceURI == f.namespace) && (!f.context || n.matchesContext(f.context))) {
         if (f.getAttrs) {
           let h = f.getAttrs(t);
           if (h === !1)
@@ -2300,20 +2284,20 @@ const cc = {
   table: !0,
   tfoot: !0,
   ul: !0
-}, pv = {
+}, fv = {
   head: !0,
   noscript: !0,
   object: !0,
   script: !0,
   style: !0,
   title: !0
-}, hc = { ol: !0, ul: !0 }, Ws = 1, Mu = 2, zs = 4;
+}, hc = { ol: !0, ul: !0 }, Ws = 1, Mu = 2, Ks = 4;
 function Mf(u, t, n) {
-  return t != null ? (t ? Ws : 0) | (t === "full" ? Mu : 0) : u && u.whitespace == "pre" ? Ws | Mu : n & ~zs;
+  return t != null ? (t ? Ws : 0) | (t === "full" ? Mu : 0) : u && u.whitespace == "pre" ? Ws | Mu : n & ~Ks;
 }
 class Vo {
   constructor(t, n, i, a, f, h) {
-    this.type = t, this.attrs = n, this.marks = i, this.solid = a, this.options = h, this.content = [], this.activeMarks = Pe.none, this.match = f || (h & zs ? null : t.contentMatch);
+    this.type = t, this.attrs = n, this.marks = i, this.solid = a, this.options = h, this.content = [], this.activeMarks = Pe.none, this.match = f || (h & Ks ? null : t.contentMatch);
   }
   findWrapping(t) {
     if (!this.match) {
@@ -2347,7 +2331,7 @@ class Vo {
 class Pf {
   constructor(t, n, i) {
     this.parser = t, this.options = n, this.isOpen = i, this.open = 0, this.localPreserveWS = !1;
-    let a = n.topNode, f, h = Mf(null, n.preserveWhitespace, 0) | (i ? zs : 0);
+    let a = n.topNode, f, h = Mf(null, n.preserveWhitespace, 0) | (i ? Ks : 0);
     a ? f = new Vo(a.type, a.attrs, Pe.none, !0, n.topMatch || a.type.contentMatch, h) : i ? f = new Vo(null, null, Pe.none, !0, null, h) : f = new Vo(t.schema.topNodeType, null, Pe.none, !0, null, h), this.nodes = [f], this.find = n.findPositions, this.needsBlock = !1;
   }
   get top() {
@@ -2387,13 +2371,13 @@ class Pf {
     let a = this.localPreserveWS, f = this.top;
     (t.tagName == "PRE" || /pre/.test(t.style && t.style.whiteSpace)) && (this.localPreserveWS = !0);
     let h = t.nodeName.toLowerCase(), y;
-    hc.hasOwnProperty(h) && this.parser.normalizeLists && dv(t);
+    hc.hasOwnProperty(h) && this.parser.normalizeLists && cv(t);
     let b = this.options.ruleFromNode && this.options.ruleFromNode(t) || (y = this.parser.matchTag(t, this, i));
-    e: if (b ? b.ignore : pv.hasOwnProperty(h))
+    e: if (b ? b.ignore : fv.hasOwnProperty(h))
       this.findInside(t), this.ignoreFallback(t, n);
     else if (!b || b.skip || b.closeParent) {
       b && b.closeParent ? this.open = Math.max(0, this.open - 1) : b && b.skip.nodeType && (t = b.skip);
-      let M, K = this.needsBlock;
+      let M, z = this.needsBlock;
       if (cc.hasOwnProperty(h))
         f.content.length && f.content[0].isInline && this.open && (this.open--, f = this.top), M = !0, f.type || (this.needsBlock = !0);
       else if (!t.firstChild) {
@@ -2401,7 +2385,7 @@ class Pf {
         break e;
       }
       let W = b && b.skip ? n : this.readStyles(t, n);
-      W && this.addAll(t, W), M && this.sync(f), this.needsBlock = K;
+      W && this.addAll(t, W), M && this.sync(f), this.needsBlock = z;
     } else {
       let M = this.readStyles(t, n);
       M && this.addElementByRule(t, b, M, b.consuming === !1 ? y : void 0);
@@ -2530,7 +2514,7 @@ class Pf {
     let h = this.top;
     h.match = h.match && h.match.matchType(t);
     let y = Mf(t, f, h.options);
-    h.options & zs && h.content.length == 0 && (y |= zs);
+    h.options & Ks && h.content.length == 0 && (y |= Ks);
     let b = Pe.none;
     return i = i.filter((M) => (h.type ? h.type.allowsMarkType(M.type) : Df(M.type, t)) ? (b = M.addToSet(b), !1) : !0), this.nodes.push(new Vo(t, n, b, a, null, y)), this.open++, i;
   }
@@ -2601,8 +2585,8 @@ class Pf {
               return !0;
           return !1;
         } else {
-          let K = b > 0 || b == 0 && a ? this.nodes[b].type : i && b >= f ? i.node(b - f).type : null;
-          if (!K || K.name != M && !K.isInGroup(M))
+          let z = b > 0 || b == 0 && a ? this.nodes[b].type : i && b >= f ? i.node(b - f).type : null;
+          if (!z || z.name != M && !z.isInGroup(M))
             return !1;
           b--;
         }
@@ -2626,13 +2610,13 @@ class Pf {
     }
   }
 }
-function dv(u) {
+function cv(u) {
   for (let t = u.firstChild, n = null; t; t = t.nextSibling) {
     let i = t.nodeType == 1 ? t.nodeName.toLowerCase() : null;
     i && hc.hasOwnProperty(i) && n ? (n.appendChild(t), t = n) : i == "li" ? n = t : i && (n = null);
   }
 }
-function gv(u, t) {
+function hv(u, t) {
   return (u.matches || u.msMatchesSelector || u.webkitMatchesSelector || u.mozMatchesSelector).call(u, t);
 }
 function Nf(u) {
@@ -2650,8 +2634,8 @@ function Df(u, t) {
     let f = [], h = (y) => {
       f.push(y);
       for (let b = 0; b < y.edgeCount; b++) {
-        let { type: M, next: K } = y.edge(b);
-        if (M == t || f.indexOf(K) < 0 && h(K))
+        let { type: M, next: z } = y.edge(b);
+        if (M == t || f.indexOf(z) < 0 && h(z))
           return !0;
       }
     };
@@ -2697,8 +2681,8 @@ class pc {
         for (; y < f.length; )
           a = f.pop()[1];
         for (; b < h.marks.length; ) {
-          let M = h.marks[b++], K = this.serializeMark(M, h.isInline, n);
-          K && (f.push([M, a]), a.appendChild(K.dom), a = K.contentDOM || K.dom);
+          let M = h.marks[b++], z = this.serializeMark(M, h.isInline, n);
+          z && (f.push([M, a]), a.appendChild(z.dom), a = z.contentDOM || z.dom);
         }
       }
       a.appendChild(this.serializeNodeInner(h, n));
@@ -2775,11 +2759,11 @@ function xu(u) {
   return u.document || window.document;
 }
 const Ff = /* @__PURE__ */ new WeakMap();
-function mv(u) {
+function pv(u) {
   let t = Ff.get(u);
-  return t === void 0 && Ff.set(u, t = yv(u)), t;
+  return t === void 0 && Ff.set(u, t = dv(u)), t;
 }
-function yv(u) {
+function dv(u) {
   let t = null;
   function n(i) {
     if (i && typeof i == "object")
@@ -2805,23 +2789,23 @@ function Xo(u, t, n, i) {
   let a = t[0], f;
   if (typeof a != "string")
     throw new RangeError("Invalid array passed to renderSpec");
-  if (i && (f = mv(i)) && f.indexOf(t) > -1)
+  if (i && (f = pv(i)) && f.indexOf(t) > -1)
     throw new RangeError("Using an array from an attribute object as a DOM spec. This may be an attempted cross site scripting attack.");
   let h = a.indexOf(" ");
   h > 0 && (n = a.slice(0, h), a = a.slice(h + 1));
-  let y, b = n ? u.createElementNS(n, a) : u.createElement(a), M = t[1], K = 1;
+  let y, b = n ? u.createElementNS(n, a) : u.createElement(a), M = t[1], z = 1;
   if (M && typeof M == "object" && M.nodeType == null && !Array.isArray(M)) {
-    K = 2;
+    z = 2;
     for (let W in M)
       if (M[W] != null) {
         let G = W.indexOf(" ");
         G > 0 ? b.setAttributeNS(W.slice(0, G), W.slice(G + 1), M[W]) : W == "style" && b.style ? b.style.cssText = M[W] : b.setAttribute(W, M[W]);
       }
   }
-  for (let W = K; W < t.length; W++) {
+  for (let W = z; W < t.length; W++) {
     let G = t[W];
     if (G === 0) {
-      if (W < t.length - 1 || W > K)
+      if (W < t.length - 1 || W > z)
         throw new RangeError("Content hole must be the only child of its parent node");
       return { dom: b, contentDOM: b };
     } else {
@@ -2836,13 +2820,13 @@ function Xo(u, t, n, i) {
   return { dom: b, contentDOM: y };
 }
 const dc = 65535, gc = Math.pow(2, 16);
-function vv(u, t) {
+function gv(u, t) {
   return u + t * gc;
 }
 function Lf(u) {
   return u & dc;
 }
-function wv(u) {
+function mv(u) {
   return (u - (u & dc)) / gc;
 }
 const mc = 1, yc = 2, Zo = 4, vc = 8;
@@ -2882,15 +2866,15 @@ class Pu {
     return (this.delInfo & Zo) > 0;
   }
 }
-class Kt {
+class zt {
   /**
   Create a position map. The modifications to the document are
   represented as an array of numbers, in which each group of three
   represents a modified chunk as `[start, oldSize, newSize]`.
   */
   constructor(t, n = !1) {
-    if (this.ranges = t, this.inverted = n, !t.length && Kt.empty)
-      return Kt.empty;
+    if (this.ranges = t, this.inverted = n, !t.length && zt.empty)
+      return zt.empty;
   }
   /**
   @internal
@@ -2900,7 +2884,7 @@ class Kt {
     if (!this.inverted)
       for (let a = 0; a < i; a++)
         n += this.ranges[a * 3 + 2] - this.ranges[a * 3 + 1];
-    return this.ranges[i * 3] + n + wv(t);
+    return this.ranges[i * 3] + n + mv(t);
   }
   mapResult(t, n = 1) {
     return this._map(t, n, !1);
@@ -2917,15 +2901,15 @@ class Kt {
       let b = this.ranges[y] - (this.inverted ? a : 0);
       if (b > t)
         break;
-      let M = this.ranges[y + f], K = this.ranges[y + h], W = b + M;
+      let M = this.ranges[y + f], z = this.ranges[y + h], W = b + M;
       if (t <= W) {
-        let G = M ? t == b ? -1 : t == W ? 1 : n : n, j = b + a + (G < 0 ? 0 : K);
+        let G = M ? t == b ? -1 : t == W ? 1 : n : n, j = b + a + (G < 0 ? 0 : z);
         if (i)
           return j;
-        let Y = t == (n < 0 ? b : W) ? null : vv(y / 3, t - b), se = t == b ? yc : t == W ? mc : Zo;
+        let Y = t == (n < 0 ? b : W) ? null : gv(y / 3, t - b), se = t == b ? yc : t == W ? mc : Zo;
         return (n < 0 ? t != b : t != W) && (se |= vc), new Pu(j, se, Y);
       }
-      a += K - M;
+      a += z - M;
     }
     return i ? t + a : new Pu(t + a, 0, null);
   }
@@ -2938,8 +2922,8 @@ class Kt {
       let b = this.ranges[y] - (this.inverted ? i : 0);
       if (b > t)
         break;
-      let M = this.ranges[y + f], K = b + M;
-      if (t <= K && y == a * 3)
+      let M = this.ranges[y + f], z = b + M;
+      if (t <= z && y == a * 3)
         return !0;
       i += this.ranges[y + h] - M;
     }
@@ -2952,8 +2936,8 @@ class Kt {
   forEach(t) {
     let n = this.inverted ? 2 : 1, i = this.inverted ? 1 : 2;
     for (let a = 0, f = 0; a < this.ranges.length; a += 3) {
-      let h = this.ranges[a], y = h - (this.inverted ? f : 0), b = h + (this.inverted ? 0 : f), M = this.ranges[a + n], K = this.ranges[a + i];
-      t(y, y + M, b, b + K), f += K - M;
+      let h = this.ranges[a], y = h - (this.inverted ? f : 0), b = h + (this.inverted ? 0 : f), M = this.ranges[a + n], z = this.ranges[a + i];
+      t(y, y + M, b, b + z), f += z - M;
     }
   }
   /**
@@ -2961,7 +2945,7 @@ class Kt {
   map positions in the post-step document to the pre-step document.
   */
   invert() {
-    return new Kt(this.ranges, !this.inverted);
+    return new zt(this.ranges, !this.inverted);
   }
   /**
   @internal
@@ -2975,10 +2959,10 @@ class Kt {
   sub-document to a larger document, or vice-versa.
   */
   static offset(t) {
-    return t == 0 ? Kt.empty : new Kt(t < 0 ? [0, -t, 0] : [0, 0, t]);
+    return t == 0 ? zt.empty : new zt(t < 0 ? [0, -t, 0] : [0, 0, t]);
   }
 }
-Kt.empty = new Kt([]);
+zt.empty = new zt([]);
 class sa {
   /**
   Create a new mapping with the given position maps.
@@ -3094,7 +3078,7 @@ class dt {
   and the new document.
   */
   getMap() {
-    return Kt.empty;
+    return zt.empty;
   }
   /**
   Try to merge this step with another one, to be applied directly
@@ -3344,7 +3328,7 @@ class pt extends dt {
     return this.structure && Nu(t, this.from, this.to) ? et.fail("Structure replace would overwrite content") : et.fromReplace(t, this.from, this.to, this.slice);
   }
   getMap() {
-    return new Kt([this.from, this.to - this.from, this.slice.size]);
+    return new zt([this.from, this.to - this.from, this.slice.size]);
   }
   invert(t) {
     return new pt(this.from, this.from + this.slice.size, t.slice(this.from, this.to));
@@ -3399,7 +3383,7 @@ class qt extends dt {
     return i ? et.fromReplace(t, this.from, this.to, i) : et.fail("Content does not fit in gap");
   }
   getMap() {
-    return new Kt([
+    return new zt([
       this.from,
       this.gapFrom - this.from,
       this.insert,
@@ -3451,13 +3435,13 @@ function Nu(u, t, n) {
   }
   return !1;
 }
-function bv(u, t, n, i) {
+function yv(u, t, n, i) {
   let a = [], f = [], h, y;
-  u.doc.nodesBetween(t, n, (b, M, K) => {
+  u.doc.nodesBetween(t, n, (b, M, z) => {
     if (!b.isInline)
       return;
     let W = b.marks;
-    if (!i.isInSet(W) && K.type.allowsMarkType(i.type)) {
+    if (!i.isInSet(W) && z.type.allowsMarkType(i.type)) {
       let G = Math.max(M, t), j = Math.min(M + b.nodeSize, n), Y = i.addToSet(W);
       for (let se = 0; se < W.length; se++)
         W[se].isInSet(Y) || (h && h.to == G && h.mark.eq(W[se]) ? h.to = j : a.push(h = new kn(G, j, W[se])));
@@ -3465,7 +3449,7 @@ function bv(u, t, n, i) {
     }
   }), a.forEach((b) => u.step(b)), f.forEach((b) => u.step(b));
 }
-function xv(u, t, n, i) {
+function vv(u, t, n, i) {
   let a = [], f = 0;
   u.doc.nodesBetween(t, n, (h, y) => {
     if (!h.isInline)
@@ -3473,14 +3457,14 @@ function xv(u, t, n, i) {
     f++;
     let b = null;
     if (i instanceof ua) {
-      let M = h.marks, K;
-      for (; K = i.isInSet(M); )
-        (b || (b = [])).push(K), M = K.removeFromSet(M);
+      let M = h.marks, z;
+      for (; z = i.isInSet(M); )
+        (b || (b = [])).push(z), M = z.removeFromSet(M);
     } else i ? i.isInSet(h.marks) && (b = [i]) : b = h.marks;
     if (b && b.length) {
       let M = Math.min(y + h.nodeSize, n);
-      for (let K = 0; K < b.length; K++) {
-        let W = b[K], G;
+      for (let z = 0; z < b.length; z++) {
+        let W = b[z], G;
         for (let j = 0; j < a.length; j++) {
           let Y = a[j];
           Y.step == f - 1 && W.eq(a[j].style) && (G = Y);
@@ -3493,20 +3477,20 @@ function xv(u, t, n, i) {
 function Fu(u, t, n, i = n.contentMatch, a = !0) {
   let f = u.doc.nodeAt(t), h = [], y = t + 1;
   for (let b = 0; b < f.childCount; b++) {
-    let M = f.child(b), K = y + M.nodeSize, W = i.matchType(M.type);
+    let M = f.child(b), z = y + M.nodeSize, W = i.matchType(M.type);
     if (!W)
-      h.push(new pt(y, K, fe.empty));
+      h.push(new pt(y, z, fe.empty));
     else {
       i = W;
       for (let G = 0; G < M.marks.length; G++)
-        n.allowsMarkType(M.marks[G].type) || u.step(new kn(y, K, M.marks[G]));
+        n.allowsMarkType(M.marks[G].type) || u.step(new kn(y, z, M.marks[G]));
       if (a && M.isText && n.whitespace != "pre") {
         let G, j = /\r?\n|\r/g, Y;
         for (; G = j.exec(M.text); )
           Y || (Y = new fe(ie.from(n.schema.text(" ", n.allowedMarks(M.marks))), 0, 0)), h.push(new pt(y + G.index, y + G.index + G[0].length, Y));
       }
     }
-    y = K;
+    y = z;
   }
   if (!i.validEnd) {
     let b = i.fillBefore(ie.empty, !0);
@@ -3515,7 +3499,7 @@ function Fu(u, t, n, i = n.contentMatch, a = !0) {
   for (let b = h.length - 1; b >= 0; b--)
     u.step(h[b]);
 }
-function _v(u, t, n) {
+function wv(u, t, n) {
   return (t == 0 || u.canReplace(t, u.childCount)) && (n == u.childCount || u.canReplace(0, n));
 }
 function la(u) {
@@ -3524,36 +3508,36 @@ function la(u) {
     let h = u.$from.node(i), y = u.$from.index(i) + a, b = u.$to.indexAfter(i) - f;
     if (i < u.depth && h.canReplace(y, b, n))
       return i;
-    if (i == 0 || h.type.spec.isolating || !_v(h, y, b))
+    if (i == 0 || h.type.spec.isolating || !wv(h, y, b))
       break;
     y && (a = 1), b < h.childCount && (f = 1);
   }
   return null;
 }
-function Sv(u, t, n) {
-  let { $from: i, $to: a, depth: f } = t, h = i.before(f + 1), y = a.after(f + 1), b = h, M = y, K = ie.empty, W = 0;
+function bv(u, t, n) {
+  let { $from: i, $to: a, depth: f } = t, h = i.before(f + 1), y = a.after(f + 1), b = h, M = y, z = ie.empty, W = 0;
   for (let Y = f, se = !1; Y > n; Y--)
-    se || i.index(Y) > 0 ? (se = !0, K = ie.from(i.node(Y).copy(K)), W++) : b--;
+    se || i.index(Y) > 0 ? (se = !0, z = ie.from(i.node(Y).copy(z)), W++) : b--;
   let G = ie.empty, j = 0;
   for (let Y = f, se = !1; Y > n; Y--)
     se || a.after(Y + 1) < a.end(Y) ? (se = !0, G = ie.from(a.node(Y).copy(G)), j++) : M++;
-  u.step(new qt(b, M, h, y, new fe(K.append(G), W, j), K.size - W, !0));
+  u.step(new qt(b, M, h, y, new fe(z.append(G), W, j), z.size - W, !0));
 }
-function kv(u, t, n = null, i = u) {
-  let a = Ev(u, t), f = a && Av(i, t);
-  return f ? a.map(Kf).concat({ type: t, attrs: n }).concat(f.map(Kf)) : null;
+function xv(u, t, n = null, i = u) {
+  let a = _v(u, t), f = a && Sv(i, t);
+  return f ? a.map(zf).concat({ type: t, attrs: n }).concat(f.map(zf)) : null;
 }
-function Kf(u) {
+function zf(u) {
   return { type: u, attrs: null };
 }
-function Ev(u, t) {
+function _v(u, t) {
   let { parent: n, startIndex: i, endIndex: a } = u, f = n.contentMatchAt(i).findWrapping(t);
   if (!f)
     return null;
   let h = f.length ? f[0] : t;
   return n.canReplaceWith(i, a, h) ? f : null;
 }
-function Av(u, t) {
+function Sv(u, t) {
   let { parent: n, startIndex: i, endIndex: a } = u, f = n.child(i), h = t.contentMatch.findWrapping(f.type);
   if (!h)
     return null;
@@ -3562,7 +3546,7 @@ function Av(u, t) {
     b = b.matchType(n.child(M).type);
   return !b || !b.validEnd ? null : h;
 }
-function Ov(u, t, n) {
+function kv(u, t, n) {
   let i = ie.empty;
   for (let h = n.length - 1; h >= 0; h--) {
     if (i.size) {
@@ -3575,20 +3559,20 @@ function Ov(u, t, n) {
   let a = t.start, f = t.end;
   u.step(new qt(a, f, a, f, new fe(i, 0, 0), n.length, !0));
 }
-function Iv(u, t, n, i, a) {
+function Ev(u, t, n, i, a) {
   if (!i.isTextblock)
     throw new RangeError("Type given to setBlockType should be a textblock");
   let f = u.steps.length;
   u.doc.nodesBetween(t, n, (h, y) => {
     let b = typeof a == "function" ? a(h) : a;
-    if (h.isTextblock && !h.hasMarkup(i, b) && Cv(u.doc, u.mapping.slice(f).map(y), i)) {
+    if (h.isTextblock && !h.hasMarkup(i, b) && Av(u.doc, u.mapping.slice(f).map(y), i)) {
       let M = null;
       if (i.schema.linebreakReplacement) {
         let j = i.whitespace == "pre", Y = !!i.contentMatch.matchType(i.schema.linebreakReplacement);
         j && !Y ? M = !1 : !j && Y && (M = !0);
       }
       M === !1 && bc(u, h, y, f), Fu(u, u.mapping.slice(f).map(y, 1), i, void 0, M === null);
-      let K = u.mapping.slice(f), W = K.map(y, 1), G = K.map(y + h.nodeSize, 1);
+      let z = u.mapping.slice(f), W = z.map(y, 1), G = z.map(y + h.nodeSize, 1);
       return u.step(new qt(W, G, W + 1, G - 1, new fe(ie.from(i.create(b, null, h.marks)), 0, 0), 1, !0)), M === !0 && wc(u, h, y, f), !1;
     }
   });
@@ -3613,11 +3597,11 @@ function bc(u, t, n, i) {
     }
   });
 }
-function Cv(u, t, n) {
+function Av(u, t, n) {
   let i = u.resolve(t), a = i.index();
   return i.parent.canReplaceWith(a, a + 1, n);
 }
-function Tv(u, t, n, i, a) {
+function Ov(u, t, n, i, a) {
   let f = u.doc.nodeAt(t);
   if (!f)
     throw new RangeError("No node at given position");
@@ -3633,25 +3617,25 @@ function Qo(u, t, n = 1, i) {
   let a = u.resolve(t), f = a.depth - n, h = i && i[i.length - 1] || a.parent;
   if (f < 0 || a.parent.type.spec.isolating || !a.parent.canReplace(a.index(), a.parent.childCount) || !h.type.validContent(a.parent.content.cutByIndex(a.index(), a.parent.childCount)))
     return !1;
-  for (let M = a.depth - 1, K = n - 2; M > f; M--, K--) {
+  for (let M = a.depth - 1, z = n - 2; M > f; M--, z--) {
     let W = a.node(M), G = a.index(M);
     if (W.type.spec.isolating)
       return !1;
-    let j = W.content.cutByIndex(G, W.childCount), Y = i && i[K + 1];
+    let j = W.content.cutByIndex(G, W.childCount), Y = i && i[z + 1];
     Y && (j = j.replaceChild(0, Y.type.create(Y.attrs)));
-    let se = i && i[K] || W;
+    let se = i && i[z] || W;
     if (!W.canReplace(G + 1, W.childCount) || !se.type.validContent(j))
       return !1;
   }
   let y = a.indexAfter(f), b = i && i[0];
   return a.node(f).canReplaceWith(y, y, b ? b.type : a.node(f + 1).type);
 }
-function Rv(u, t, n = 1, i) {
+function Iv(u, t, n = 1, i) {
   let a = u.doc.resolve(t), f = ie.empty, h = ie.empty;
   for (let y = a.depth, b = a.depth - n, M = n - 1; y > b; y--, M--) {
     f = ie.from(a.node(y).copy(f));
-    let K = i && i[M];
-    h = ie.from(K ? K.type.create(K.attrs, h) : a.node(y).copy(h));
+    let z = i && i[M];
+    h = ie.from(z ? z.type.create(z.attrs, h) : a.node(y).copy(h));
   }
   u.step(new pt(t, t, new fe(f.append(h), n, n), !0));
 }
@@ -3659,7 +3643,7 @@ function fa(u, t) {
   let n = u.resolve(t), i = n.index();
   return xc(n.nodeBefore, n.nodeAfter) && n.parent.canReplace(i, i + 1);
 }
-function Mv(u, t) {
+function Cv(u, t) {
   t.content.size || u.type.compatibleContent(t.type);
   let n = u.contentMatchAt(u.childCount), { linebreakReplacement: i } = u.type.schema;
   for (let a = 0; a < t.childCount; a++) {
@@ -3670,7 +3654,7 @@ function Mv(u, t) {
   return n.validEnd;
 }
 function xc(u, t) {
-  return !!(u && t && !u.isLeaf && Mv(u, t));
+  return !!(u && t && !u.isLeaf && Cv(u, t));
 }
 function _c(u, t, n = -1) {
   let i = u.resolve(t);
@@ -3683,26 +3667,26 @@ function _c(u, t, n = -1) {
     t = n < 0 ? i.before(a) : i.after(a);
   }
 }
-function Pv(u, t, n) {
+function Tv(u, t, n) {
   let i = null, { linebreakReplacement: a } = u.doc.type.schema, f = u.doc.resolve(t - n), h = f.node().type;
   if (a && h.inlineContent) {
-    let K = h.whitespace == "pre", W = !!h.contentMatch.matchType(a);
-    K && !W ? i = !1 : !K && W && (i = !0);
+    let z = h.whitespace == "pre", W = !!h.contentMatch.matchType(a);
+    z && !W ? i = !1 : !z && W && (i = !0);
   }
   let y = u.steps.length;
   if (i === !1) {
-    let K = u.doc.resolve(t + n);
-    bc(u, K.node(), K.before(), y);
+    let z = u.doc.resolve(t + n);
+    bc(u, z.node(), z.before(), y);
   }
   h.inlineContent && Fu(u, t + n - 1, h, f.node().contentMatchAt(f.index()), i == null);
   let b = u.mapping.slice(y), M = b.map(t - n);
   if (u.step(new pt(M, b.map(t + n, -1), fe.empty, !0)), i === !0) {
-    let K = u.doc.resolve(M);
-    wc(u, K.node(), K.before(), u.steps.length);
+    let z = u.doc.resolve(M);
+    wc(u, z.node(), z.before(), u.steps.length);
   }
   return u;
 }
-function Nv(u, t, n) {
+function Rv(u, t, n) {
   let i = u.resolve(t);
   if (i.parent.canReplaceWith(i.index(), i.index(), n))
     return t;
@@ -3724,7 +3708,7 @@ function Nv(u, t, n) {
     }
   return null;
 }
-function I0(u, t, n) {
+function E0(u, t, n) {
   let i = u.resolve(t);
   if (!n.content.size)
     return t;
@@ -3733,14 +3717,14 @@ function I0(u, t, n) {
     a = a.firstChild.content;
   for (let f = 1; f <= (n.openStart == 0 && n.size ? 2 : 1); f++)
     for (let h = i.depth; h >= 0; h--) {
-      let y = h == i.depth ? 0 : i.pos <= (i.start(h + 1) + i.end(h + 1)) / 2 ? -1 : 1, b = i.index(h) + (y > 0 ? 1 : 0), M = i.node(h), K = !1;
+      let y = h == i.depth ? 0 : i.pos <= (i.start(h + 1) + i.end(h + 1)) / 2 ? -1 : 1, b = i.index(h) + (y > 0 ? 1 : 0), M = i.node(h), z = !1;
       if (f == 1)
-        K = M.canReplace(b, b, a);
+        z = M.canReplace(b, b, a);
       else {
         let W = M.contentMatchAt(b).findWrapping(a.firstChild.type);
-        K = W && M.canReplaceWith(b, b, W[0]);
+        z = W && M.canReplaceWith(b, b, W[0]);
       }
-      if (K)
+      if (z)
         return y == 0 ? i.pos : y < 0 ? i.before(h + 1) : i.after(h + 1);
     }
   return null;
@@ -3749,12 +3733,12 @@ function Lu(u, t, n = t, i = fe.empty) {
   if (t == n && !i.size)
     return null;
   let a = u.resolve(t), f = u.resolve(n);
-  return Sc(a, f, i) ? new pt(t, n, i) : new Dv(a, f, i).fit();
+  return Sc(a, f, i) ? new pt(t, n, i) : new Mv(a, f, i).fit();
 }
 function Sc(u, t, n) {
   return !n.openStart && !n.openEnd && u.start() == t.start() && u.parent.canReplace(u.index(), t.index(), n.content);
 }
-class Dv {
+class Mv {
   constructor(t, n, i) {
     this.$from = t, this.$to = n, this.unplaced = i, this.frontier = [], this.placed = ie.empty;
     for (let a = 0; a <= t.depth; a++) {
@@ -3803,11 +3787,11 @@ class Dv {
         i ? (f = Su(this.unplaced.content, i - 1).firstChild, a = f.content) : a = this.unplaced.content;
         let h = a.firstChild;
         for (let y = this.depth; y >= 0; y--) {
-          let { type: b, match: M } = this.frontier[y], K, W = null;
+          let { type: b, match: M } = this.frontier[y], z, W = null;
           if (n == 1 && (h ? M.matchType(h.type) || (W = M.fillBefore(ie.from(h), !1)) : f && b.compatibleContent(f.type)))
             return { sliceDepth: i, frontierDepth: y, parent: f, inject: W };
-          if (n == 2 && h && (K = M.findWrapping(h.type)))
-            return { sliceDepth: i, frontierDepth: y, parent: f, wrap: K };
+          if (n == 2 && h && (z = M.findWrapping(h.type)))
+            return { sliceDepth: i, frontierDepth: y, parent: f, wrap: z };
           if (f && M.matchType(f.type))
             break;
         }
@@ -3834,10 +3818,10 @@ class Dv {
     if (f)
       for (let se = 0; se < f.length; se++)
         this.openFrontierNode(f[se]);
-    let h = this.unplaced, y = i ? i.content : h.content, b = h.openStart - t, M = 0, K = [], { match: W, type: G } = this.frontier[n];
+    let h = this.unplaced, y = i ? i.content : h.content, b = h.openStart - t, M = 0, z = [], { match: W, type: G } = this.frontier[n];
     if (a) {
       for (let se = 0; se < a.childCount; se++)
-        K.push(a.child(se));
+        z.push(a.child(se));
       W = W.matchFragment(a);
     }
     let j = y.size + t - (h.content.size - h.openEnd);
@@ -3845,10 +3829,10 @@ class Dv {
       let se = y.child(M), me = W.matchType(se.type);
       if (!me)
         break;
-      M++, (M > 1 || b == 0 || se.content.size) && (W = me, K.push(kc(se.mark(G.allowedMarks(se.marks)), M == 1 ? b : 0, M == y.childCount ? j : -1)));
+      M++, (M > 1 || b == 0 || se.content.size) && (W = me, z.push(kc(se.mark(G.allowedMarks(se.marks)), M == 1 ? b : 0, M == y.childCount ? j : -1)));
     }
     let Y = M == y.childCount;
-    Y || (j = -1), this.placed = Bs(this.placed, n, ie.from(K)), this.frontier[n].match = W, Y && j < 0 && i && i.type == this.frontier[this.depth].type && this.frontier.length > 1 && this.closeFrontierNode();
+    Y || (j = -1), this.placed = Bs(this.placed, n, ie.from(z)), this.frontier[n].match = W, Y && j < 0 && i && i.type == this.frontier[this.depth].type && this.frontier.length > 1 && this.closeFrontierNode();
     for (let se = 0, me = y; se < j; se++) {
       let Te = me.lastChild;
       this.frontier.push({ type: Te.type, match: Te.contentMatchAt(Te.childCount) }), me = Te.content;
@@ -3871,8 +3855,8 @@ class Dv {
       let { match: i, type: a } = this.frontier[n], f = n < t.depth && t.end(n + 1) == t.pos + (t.depth - (n + 1)), h = ku(t, n, a, i, f);
       if (h) {
         for (let y = n - 1; y >= 0; y--) {
-          let { match: b, type: M } = this.frontier[y], K = ku(t, y, M, b, !0);
-          if (!K || K.childCount)
+          let { match: b, type: M } = this.frontier[y], z = ku(t, y, M, b, !0);
+          if (!z || z.childCount)
             continue e;
         }
         return { depth: n, fit: h, move: f ? t.doc.resolve(t.after(n + 1)) : t };
@@ -3923,18 +3907,18 @@ function ku(u, t, n, i, a) {
   if (h == f.childCount && !n.compatibleContent(f.type))
     return null;
   let y = i.fillBefore(f.content, !0, h);
-  return y && !Bv(n, f.content, h) ? y : null;
+  return y && !Pv(n, f.content, h) ? y : null;
 }
-function Bv(u, t, n) {
+function Pv(u, t, n) {
   for (let i = n; i < t.childCount; i++)
     if (!u.allowsMarks(t.child(i).marks))
       return !0;
   return !1;
 }
-function Fv(u) {
+function Nv(u) {
   return u.spec.defining || u.spec.definingForContent;
 }
-function Lv(u, t, n, i) {
+function Dv(u, t, n, i) {
   if (!i.size)
     return u.deleteRange(t, n);
   let a = u.doc.resolve(t), f = u.doc.resolve(n);
@@ -3950,22 +3934,22 @@ function Lv(u, t, n, i) {
       break;
     h.indexOf(G) > -1 ? y = G : a.before(G) == j && h.splice(1, 0, -G);
   }
-  let b = h.indexOf(y), M = [], K = i.openStart;
+  let b = h.indexOf(y), M = [], z = i.openStart;
   for (let G = i.content, j = 0; ; j++) {
     let Y = G.firstChild;
     if (M.push(Y), j == i.openStart)
       break;
     G = Y.content;
   }
-  for (let G = K - 1; G >= 0; G--) {
-    let j = M[G], Y = Fv(j.type);
+  for (let G = z - 1; G >= 0; G--) {
+    let j = M[G], Y = Nv(j.type);
     if (Y && !j.sameMarkup(a.node(Math.abs(y) - 1)))
-      K = G;
+      z = G;
     else if (Y || !j.type.isTextblock)
       break;
   }
   for (let G = i.openStart; G >= 0; G--) {
-    let j = (G + K + 1) % (i.openStart + 1), Y = M[j];
+    let j = (G + z + 1) % (i.openStart + 1), Y = M[j];
     if (Y)
       for (let se = 0; se < h.length; se++) {
         let me = h[(se + b) % h.length], Te = !0;
@@ -3992,14 +3976,14 @@ function Ec(u, t, n, i, a) {
   }
   return u;
 }
-function Kv(u, t, n, i) {
+function Bv(u, t, n, i) {
   if (!i.isInline && t == n && u.doc.resolve(t).parent.content.size) {
-    let a = Nv(u.doc, t, i.type);
+    let a = Rv(u.doc, t, i.type);
     a != null && (t = n = a);
   }
   u.replaceRange(t, n, new fe(ie.from(i), 0, 0));
 }
-function zv(u, t, n) {
+function Fv(u, t, n) {
   let i = u.doc.resolve(t), a = u.doc.resolve(n), f = Ac(i, a);
   for (let h = 0; h < f.length; h++) {
     let y = f[h], b = h == f.length - 1;
@@ -4042,7 +4026,7 @@ class Wi extends dt {
     return et.fromReplace(t, this.pos, this.pos + 1, new fe(ie.from(a), 0, n.isLeaf ? 0 : 1));
   }
   getMap() {
-    return Kt.empty;
+    return zt.empty;
   }
   invert(t) {
     return new Wi(this.pos, this.attr, t.nodeAt(this.pos).attrs[this.attr]);
@@ -4077,7 +4061,7 @@ class Us extends dt {
     return et.ok(i);
   }
   getMap() {
-    return Kt.empty;
+    return zt.empty;
   }
   invert(t) {
     return new Us(this.attr, t.attrs[this.attr]);
@@ -4104,7 +4088,7 @@ Ui = function u(t) {
 Ui.prototype = Object.create(Error.prototype);
 Ui.prototype.constructor = Ui;
 Ui.prototype.name = "TransformError";
-class qv {
+class Lv {
   /**
   Create a transform that starts with the given document.
   */
@@ -4211,7 +4195,7 @@ class qv {
   control over what happens.
   */
   replaceRange(t, n, i) {
-    return Lv(this, t, n, i), this;
+    return Dv(this, t, n, i), this;
   }
   /**
   Replace the given range with a node, but use `from` and `to` as
@@ -4223,14 +4207,14 @@ class qv {
   that parent node.
   */
   replaceRangeWith(t, n, i) {
-    return Kv(this, t, n, i), this;
+    return Bv(this, t, n, i), this;
   }
   /**
   Delete the given range, expanding it to cover fully covered
   parent nodes until a valid replace is found.
   */
   deleteRange(t, n) {
-    return zv(this, t, n), this;
+    return Fv(this, t, n), this;
   }
   /**
   Split the content in the given range off from its parent, if there
@@ -4240,14 +4224,14 @@ class qv {
   sure the lift is valid.
   */
   lift(t, n) {
-    return Sv(this, t, n), this;
+    return bv(this, t, n), this;
   }
   /**
   Join the blocks around the given position. If depth is 2, their
   last and first siblings are also joined, and so on.
   */
   join(t, n = 1) {
-    return Pv(this, t, n), this;
+    return Tv(this, t, n), this;
   }
   /**
   Wrap the given [range](https://prosemirror.net/docs/ref/#model.NodeRange) in the given set of wrappers.
@@ -4255,21 +4239,21 @@ class qv {
   probably be computed with [`findWrapping`](https://prosemirror.net/docs/ref/#transform.findWrapping).
   */
   wrap(t, n) {
-    return Ov(this, t, n), this;
+    return kv(this, t, n), this;
   }
   /**
   Set the type of all textblocks (partly) between `from` and `to` to
   the given node type with the given attributes.
   */
   setBlockType(t, n = t, i, a = null) {
-    return Iv(this, t, n, i, a), this;
+    return Ev(this, t, n, i, a), this;
   }
   /**
   Change the type, attributes, and/or marks of the node at `pos`.
   When `type` isn't given, the existing node type is preserved,
   */
   setNodeMarkup(t, n, i = null, a) {
-    return Tv(this, t, n, i, a), this;
+    return Ov(this, t, n, i, a), this;
   }
   /**
   Set a single attribute on a given node to a new value.
@@ -4318,13 +4302,13 @@ class qv {
   use after the split (with the outermost nodes coming first).
   */
   split(t, n = 1, i) {
-    return Rv(this, t, n, i), this;
+    return Iv(this, t, n, i), this;
   }
   /**
   Add the given mark to the inline content between `from` and `to`.
   */
   addMark(t, n, i) {
-    return bv(this, t, n, i), this;
+    return yv(this, t, n, i), this;
   }
   /**
   Remove marks from inline nodes between `from` and `to`. When
@@ -4333,7 +4317,7 @@ class qv {
   remove all marks of any type.
   */
   removeMark(t, n, i) {
-    return xv(this, t, n, i), this;
+    return vv(this, t, n, i), this;
   }
   /**
   Removes all marks and nodes from the content of the node at
@@ -4353,7 +4337,7 @@ class qe {
   `$head`.
   */
   constructor(t, n, i) {
-    this.$anchor = t, this.$head = n, this.ranges = i || [new Wv(t.min(n), t.max(n))];
+    this.$anchor = t, this.$head = n, this.ranges = i || [new zv(t.min(n), t.max(n))];
   }
   /**
   The selection's anchor, as an unresolved position.
@@ -4417,8 +4401,8 @@ class qe {
       a = i, i = i.lastChild;
     let f = t.steps.length, h = this.ranges;
     for (let y = 0; y < h.length; y++) {
-      let { $from: b, $to: M } = h[y], K = t.mapping.slice(f);
-      t.replaceRange(K.map(b.pos), K.map(M.pos), y ? fe.empty : n), y == 0 && Wf(t, f, (i ? i.isInline : a && a.isTextblock) ? -1 : 1);
+      let { $from: b, $to: M } = h[y], z = t.mapping.slice(f);
+      t.replaceRange(z.map(b.pos), z.map(M.pos), y ? fe.empty : n), y == 0 && Wf(t, f, (i ? i.isInline : a && a.isTextblock) ? -1 : 1);
     }
   }
   /**
@@ -4428,8 +4412,8 @@ class qe {
   replaceWith(t, n) {
     let i = t.steps.length, a = this.ranges;
     for (let f = 0; f < a.length; f++) {
-      let { $from: h, $to: y } = a[f], b = t.mapping.slice(i), M = b.map(h.pos), K = b.map(y.pos);
-      f ? t.deleteRange(M, K) : (t.replaceRangeWith(M, K, n), Wf(t, i, n.isInline ? -1 : 1));
+      let { $from: h, $to: y } = a[f], b = t.mapping.slice(i), M = b.map(h.pos), z = b.map(y.pos);
+      f ? t.deleteRange(M, z) : (t.replaceRangeWith(M, z, n), Wf(t, i, n.isInline ? -1 : 1));
     }
   }
   /**
@@ -4440,11 +4424,11 @@ class qe {
   found.
   */
   static findFrom(t, n, i = !1) {
-    let a = t.parent.inlineContent ? new zt(t) : zi(t.node(0), t.parent, t.pos, t.index(), n, i);
+    let a = t.parent.inlineContent ? new Kt(t) : Ki(t.node(0), t.parent, t.pos, t.index(), n, i);
     if (a)
       return a;
     for (let f = t.depth - 1; f >= 0; f--) {
-      let h = n < 0 ? zi(t.node(0), t.node(f), t.before(f + 1), t.index(f), n, i) : zi(t.node(0), t.node(f), t.after(f + 1), t.index(f) + 1, n, i);
+      let h = n < 0 ? Ki(t.node(0), t.node(f), t.before(f + 1), t.index(f), n, i) : Ki(t.node(0), t.node(f), t.after(f + 1), t.index(f) + 1, n, i);
       if (h)
         return h;
     }
@@ -4465,14 +4449,14 @@ class qe {
   exists.
   */
   static atStart(t) {
-    return zi(t, t, 0, 0, 1) || new Zt(t);
+    return Ki(t, t, 0, 0, 1) || new Zt(t);
   }
   /**
   Find the cursor or leaf node selection closest to the end of the
   given document.
   */
   static atEnd(t) {
-    return zi(t, t, t.content.size, t.childCount, -1) || new Zt(t);
+    return Ki(t, t, t.content.size, t.childCount, -1) || new Zt(t);
   }
   /**
   Deserialize the JSON representation of a selection. Must be
@@ -4507,11 +4491,11 @@ class qe {
   returns the bookmark for that.
   */
   getBookmark() {
-    return zt.between(this.$anchor, this.$head).getBookmark();
+    return Kt.between(this.$anchor, this.$head).getBookmark();
   }
 }
 qe.prototype.visible = !0;
-class Wv {
+class zv {
   /**
   Create a range.
   */
@@ -4519,11 +4503,11 @@ class Wv {
     this.$from = t, this.$to = n;
   }
 }
-let zf = !1;
+let Kf = !1;
 function qf(u) {
-  !zf && !u.parent.inlineContent && (zf = !0, console.warn("TextSelection endpoint not pointing into a node with inline content (" + u.parent.type.name + ")"));
+  !Kf && !u.parent.inlineContent && (Kf = !0, console.warn("TextSelection endpoint not pointing into a node with inline content (" + u.parent.type.name + ")"));
 }
-class zt extends qe {
+class Kt extends qe {
   /**
   Construct a text selection between the given points.
   */
@@ -4542,7 +4526,7 @@ class zt extends qe {
     if (!i.parent.inlineContent)
       return qe.near(i);
     let a = t.resolve(n.map(this.anchor));
-    return new zt(a.parent.inlineContent ? a : i, i);
+    return new Kt(a.parent.inlineContent ? a : i, i);
   }
   replace(t, n = fe.empty) {
     if (super.replace(t, n), n == fe.empty) {
@@ -4551,7 +4535,7 @@ class zt extends qe {
     }
   }
   eq(t) {
-    return t instanceof zt && t.anchor == this.anchor && t.head == this.head;
+    return t instanceof Kt && t.anchor == this.anchor && t.head == this.head;
   }
   getBookmark() {
     return new ca(this.anchor, this.head);
@@ -4565,7 +4549,7 @@ class zt extends qe {
   static fromJSON(t, n) {
     if (typeof n.anchor != "number" || typeof n.head != "number")
       throw new RangeError("Invalid input for TextSelection.fromJSON");
-    return new zt(t.resolve(n.anchor), t.resolve(n.head));
+    return new Kt(t.resolve(n.anchor), t.resolve(n.head));
   }
   /**
   Create a text selection from non-resolved positions.
@@ -4591,10 +4575,10 @@ class zt extends qe {
       else
         return qe.near(n, i);
     }
-    return t.parent.inlineContent || (a == 0 ? t = n : (t = (qe.findFrom(t, -i, !0) || qe.findFrom(t, i, !0)).$anchor, t.pos < n.pos != a < 0 && (t = n))), new zt(t, n);
+    return t.parent.inlineContent || (a == 0 ? t = n : (t = (qe.findFrom(t, -i, !0) || qe.findFrom(t, i, !0)).$anchor, t.pos < n.pos != a < 0 && (t = n))), new Kt(t, n);
   }
 }
-qe.jsonID("text", zt);
+qe.jsonID("text", Kt);
 class ca {
   constructor(t, n) {
     this.anchor = t, this.head = n;
@@ -4603,7 +4587,7 @@ class ca {
     return new ca(t.map(this.anchor), t.map(this.head));
   }
   resolve(t) {
-    return zt.between(t.resolve(this.anchor), t.resolve(this.head));
+    return Kt.between(t.resolve(this.anchor), t.resolve(this.head));
   }
 }
 class We extends qe {
@@ -4629,7 +4613,7 @@ class We extends qe {
     return { type: "node", anchor: this.anchor };
   }
   getBookmark() {
-    return new Ku(this.anchor);
+    return new zu(this.anchor);
   }
   /**
   @internal
@@ -4655,13 +4639,13 @@ class We extends qe {
 }
 We.prototype.visible = !1;
 qe.jsonID("node", We);
-class Ku {
+class zu {
   constructor(t) {
     this.anchor = t;
   }
   map(t) {
     let { deleted: n, pos: i } = t.mapResult(this.anchor);
-    return n ? new ca(i, i) : new Ku(i);
+    return n ? new ca(i, i) : new zu(i);
   }
   resolve(t) {
     let n = t.resolve(this.anchor), i = n.nodeAfter;
@@ -4699,11 +4683,11 @@ class Zt extends qe {
     return t instanceof Zt;
   }
   getBookmark() {
-    return Uv;
+    return Kv;
   }
 }
 qe.jsonID("all", Zt);
-const Uv = {
+const Kv = {
   map() {
     return this;
   },
@@ -4711,16 +4695,16 @@ const Uv = {
     return new Zt(u);
   }
 };
-function zi(u, t, n, i, a, f = !1) {
+function Ki(u, t, n, i, a, f = !1) {
   if (t.inlineContent)
-    return zt.create(u, n);
+    return Kt.create(u, n);
   for (let h = i - (a > 0 ? 0 : 1); a > 0 ? h < t.childCount : h >= 0; h += a) {
     let y = t.child(h);
     if (y.isAtom) {
       if (!f && We.isSelectable(y))
         return We.create(u, n - (a < 0 ? y.nodeSize : 0));
     } else {
-      let b = zi(u, y, n + a, a < 0 ? y.childCount : 0, a, f);
+      let b = Ki(u, y, n + a, a < 0 ? y.childCount : 0, a, f);
       if (b)
         return b;
     }
@@ -4736,12 +4720,12 @@ function Wf(u, t, n) {
   if (!(a instanceof pt || a instanceof qt))
     return;
   let f = u.mapping.maps[i], h;
-  f.forEach((y, b, M, K) => {
-    h == null && (h = K);
+  f.forEach((y, b, M, z) => {
+    h == null && (h = z);
   }), u.setSelection(qe.near(u.doc.resolve(h), n));
 }
 const Uf = 1, Yo = 2, Jf = 4;
-class Jv extends qv {
+class qv extends Lv {
   /**
   @internal
   */
@@ -4900,7 +4884,7 @@ class Fs {
     this.name = t, this.init = Gf(n.init, i), this.apply = Gf(n.apply, i);
   }
 }
-const Gv = [
+const Wv = [
   new Fs("doc", {
     init(u) {
       return u.doc || u.schema.topNodeType.createAndFill();
@@ -4936,7 +4920,7 @@ const Gv = [
 ];
 class Au {
   constructor(t, n) {
-    this.schema = t, this.plugins = [], this.pluginsByKey = /* @__PURE__ */ Object.create(null), this.fields = Gv.slice(), n && n.forEach((i) => {
+    this.schema = t, this.plugins = [], this.pluginsByKey = /* @__PURE__ */ Object.create(null), this.fields = Wv.slice(), n && n.forEach((i) => {
       if (this.pluginsByKey[i.key])
         throw new RangeError("Adding different instances of a keyed plugin (" + i.key + ")");
       this.plugins.push(i), this.pluginsByKey[i.key] = i, i.spec.state && this.fields.push(new Fs(i.key, i.spec.state, i));
@@ -4996,14 +4980,14 @@ class Ls {
       for (let h = 0; h < this.config.plugins.length; h++) {
         let y = this.config.plugins[h];
         if (y.spec.appendTransaction) {
-          let b = a ? a[h].n : 0, M = a ? a[h].state : this, K = b < n.length && y.spec.appendTransaction.call(y, b ? n.slice(b) : n, M, i);
-          if (K && i.filterTransaction(K, h)) {
-            if (K.setMeta("appendedTransaction", t), !a) {
+          let b = a ? a[h].n : 0, M = a ? a[h].state : this, z = b < n.length && y.spec.appendTransaction.call(y, b ? n.slice(b) : n, M, i);
+          if (z && i.filterTransaction(z, h)) {
+            if (z.setMeta("appendedTransaction", t), !a) {
               a = [];
               for (let W = 0; W < this.config.plugins.length; W++)
                 a.push(W < h ? { state: i, n: n.length } : { state: this, n: 0 });
             }
-            n.push(K), i = i.applyInner(K), f = !0;
+            n.push(z), i = i.applyInner(z), f = !0;
           }
           a && (a[h] = { state: i, n: n.length });
         }
@@ -5029,7 +5013,7 @@ class Ls {
   Accessor that constructs and returns a new [transaction](https://prosemirror.net/docs/ref/#state.Transaction) from this state.
   */
   get tr() {
-    return new Jv(this);
+    return new qv(this);
   }
   /**
   Create a new state.
@@ -5115,7 +5099,7 @@ function Oc(u, t, n) {
   }
   return n;
 }
-class C0 {
+class A0 {
   /**
   Create a plugin.
   */
@@ -5133,7 +5117,7 @@ const Ou = /* @__PURE__ */ Object.create(null);
 function Ic(u) {
   return u in Ou ? u + "$" + ++Ou[u] : (Ou[u] = 0, u + "$");
 }
-class T0 {
+class O0 {
   /**
   Create a plugin key.
   */
@@ -5155,12 +5139,12 @@ class T0 {
   }
 }
 const Cc = (u, t) => u.selection.empty ? !1 : (t && t(u.tr.deleteSelection().scrollIntoView()), !0);
-function Hv(u, t) {
+function Uv(u, t) {
   let { $cursor: n } = u.selection;
   return !n || (t ? !t.endOfTextblock("backward", u) : n.parentOffset > 0) ? null : n;
 }
-const $v = (u, t, n) => {
-  let i = Hv(u, n);
+const Jv = (u, t, n) => {
+  let i = Uv(u, n);
   if (!i)
     return !1;
   let a = Tc(i);
@@ -5195,7 +5179,7 @@ function Ji(u, t, n = !1) {
   }
   return !1;
 }
-const jv = (u, t, n) => {
+const Gv = (u, t, n) => {
   let { $head: i, empty: a } = u.selection, f = i;
   if (!a)
     return !1;
@@ -5217,12 +5201,12 @@ function Tc(u) {
     }
   return null;
 }
-function Vv(u, t) {
+function Hv(u, t) {
   let { $cursor: n } = u.selection;
   return !n || (t ? !t.endOfTextblock("forward", u) : n.parentOffset < n.parent.content.size) ? null : n;
 }
-const Yv = (u, t, n) => {
-  let i = Vv(u, n);
+const $v = (u, t, n) => {
+  let i = Hv(u, n);
   if (!i)
     return !1;
   let a = Rc(i);
@@ -5242,7 +5226,7 @@ const Yv = (u, t, n) => {
     }
   }
   return f.isAtom && a.depth == i.depth - 1 ? (t && t(u.tr.delete(a.pos, a.pos + f.nodeSize).scrollIntoView()), !0) : !1;
-}, Xv = (u, t, n) => {
+}, jv = (u, t, n) => {
   let { $head: i, empty: a } = u.selection, f = i;
   if (!a)
     return !1;
@@ -5265,7 +5249,7 @@ function Rc(u) {
     }
   return null;
 }
-const R0 = (u, t) => {
+const I0 = (u, t) => {
   let n = u.selection, i = n instanceof We, a;
   if (i) {
     if (n.node.isTextblock || !fa(u.doc, n.from))
@@ -5278,7 +5262,7 @@ const R0 = (u, t) => {
     i && f.setSelection(We.create(f.doc, a - u.doc.resolve(a).nodeBefore.nodeSize)), t(f.scrollIntoView());
   }
   return !0;
-}, M0 = (u, t) => {
+}, C0 = (u, t) => {
   let n = u.selection, i;
   if (n instanceof We) {
     if (n.node.isTextblock || !fa(u.doc, n.to))
@@ -5287,15 +5271,15 @@ const R0 = (u, t) => {
   } else if (i = _c(u.doc, n.to, 1), i == null)
     return !1;
   return t && t(u.tr.join(i).scrollIntoView()), !0;
-}, P0 = (u, t) => {
+}, T0 = (u, t) => {
   let { $from: n, $to: i } = u.selection, a = n.blockRange(i), f = a && la(a);
   return f == null ? !1 : (t && t(u.tr.lift(a, f).scrollIntoView()), !0);
-}, Zv = (u, t) => {
+}, Vv = (u, t) => {
   let { $head: n, $anchor: i } = u.selection;
   return !n.parent.type.spec.code || !n.sameParent(i) ? !1 : (t && t(u.tr.insertText(`
 `).scrollIntoView()), !0);
 };
-function zu(u) {
+function Ku(u) {
   for (let t = 0; t < u.edgeCount; t++) {
     let { type: n } = u.edge(t);
     if (n.isTextblock && !n.hasRequiredAttrs())
@@ -5303,11 +5287,11 @@ function zu(u) {
   }
   return null;
 }
-const Qv = (u, t) => {
+const Yv = (u, t) => {
   let { $head: n, $anchor: i } = u.selection;
   if (!n.parent.type.spec.code || !n.sameParent(i))
     return !1;
-  let a = n.node(-1), f = n.indexAfter(-1), h = zu(a.contentMatchAt(f));
+  let a = n.node(-1), f = n.indexAfter(-1), h = Ku(a.contentMatchAt(f));
   if (!h || !a.canReplaceWith(f, f, h))
     return !1;
   if (t) {
@@ -5315,19 +5299,19 @@ const Qv = (u, t) => {
     b.setSelection(qe.near(b.doc.resolve(y), 1)), t(b.scrollIntoView());
   }
   return !0;
-}, e0 = (u, t) => {
+}, Xv = (u, t) => {
   let n = u.selection, { $from: i, $to: a } = n;
   if (n instanceof Zt || i.parent.inlineContent || a.parent.inlineContent)
     return !1;
-  let f = zu(a.parent.contentMatchAt(a.indexAfter()));
+  let f = Ku(a.parent.contentMatchAt(a.indexAfter()));
   if (!f || !f.isTextblock)
     return !1;
   if (t) {
     let h = (!i.parentOffset && a.index() < a.parent.childCount ? i : a).pos, y = u.tr.insert(h, f.createAndFill());
-    y.setSelection(zt.create(y.doc, h + 1)), t(y.scrollIntoView());
+    y.setSelection(Kt.create(y.doc, h + 1)), t(y.scrollIntoView());
   }
   return !0;
-}, t0 = (u, t) => {
+}, Zv = (u, t) => {
   let { $cursor: n } = u.selection;
   if (!n || n.parent.content.size)
     return !1;
@@ -5339,7 +5323,7 @@ const Qv = (u, t) => {
   let i = n.blockRange(), a = i && la(i);
   return a == null ? !1 : (t && t(u.tr.lift(i, a).scrollIntoView()), !0);
 };
-function n0(u) {
+function Qv(u) {
   return (t, n) => {
     let { $from: i, $to: a } = t.selection;
     if (t.selection instanceof We && t.selection.node.isBlock)
@@ -5349,39 +5333,39 @@ function n0(u) {
     let f = [], h, y, b = !1, M = !1;
     for (let j = i.depth; ; j--)
       if (i.node(j).isBlock) {
-        b = i.end(j) == i.pos + (i.depth - j), M = i.start(j) == i.pos - (i.depth - j), y = zu(i.node(j - 1).contentMatchAt(i.indexAfter(j - 1))), f.unshift(b && y ? { type: y } : null), h = j;
+        b = i.end(j) == i.pos + (i.depth - j), M = i.start(j) == i.pos - (i.depth - j), y = Ku(i.node(j - 1).contentMatchAt(i.indexAfter(j - 1))), f.unshift(b && y ? { type: y } : null), h = j;
         break;
       } else {
         if (j == 1)
           return !1;
         f.unshift(null);
       }
-    let K = t.tr;
-    (t.selection instanceof zt || t.selection instanceof Zt) && K.deleteSelection();
-    let W = K.mapping.map(i.pos), G = Qo(K.doc, W, f.length, f);
-    if (G || (f[0] = y ? { type: y } : null, G = Qo(K.doc, W, f.length, f)), !G)
+    let z = t.tr;
+    (t.selection instanceof Kt || t.selection instanceof Zt) && z.deleteSelection();
+    let W = z.mapping.map(i.pos), G = Qo(z.doc, W, f.length, f);
+    if (G || (f[0] = y ? { type: y } : null, G = Qo(z.doc, W, f.length, f)), !G)
       return !1;
-    if (K.split(W, f.length, f), !b && M && i.node(h).type != y) {
-      let j = K.mapping.map(i.before(h)), Y = K.doc.resolve(j);
-      y && i.node(h - 1).canReplaceWith(Y.index(), Y.index() + 1, y) && K.setNodeMarkup(K.mapping.map(i.before(h)), y);
+    if (z.split(W, f.length, f), !b && M && i.node(h).type != y) {
+      let j = z.mapping.map(i.before(h)), Y = z.doc.resolve(j);
+      y && i.node(h - 1).canReplaceWith(Y.index(), Y.index() + 1, y) && z.setNodeMarkup(z.mapping.map(i.before(h)), y);
     }
-    return n && n(K.scrollIntoView()), !0;
+    return n && n(z.scrollIntoView()), !0;
   };
 }
-const Mc = n0(), N0 = (u, t) => Mc(u, t && ((n) => {
+const Mc = Qv(), R0 = (u, t) => Mc(u, t && ((n) => {
   let i = u.storedMarks || u.selection.$to.parentOffset && u.selection.$from.marks();
   i && n.ensureMarks(i), t(n);
-})), D0 = (u, t) => {
+})), M0 = (u, t) => {
   let { $from: n, to: i } = u.selection, a, f = n.sharedDepth(i);
   return f == 0 ? !1 : (a = n.before(f), t && t(u.tr.setSelection(We.create(u.doc, a))), !0);
 }, Pc = (u, t) => (t && t(u.tr.setSelection(new Zt(u.doc))), !0);
-function r0(u, t, n) {
+function e0(u, t, n) {
   let i = t.nodeBefore, a = t.nodeAfter, f = t.index();
   return !i || !a || !i.type.compatibleContent(a.type) ? !1 : !i.content.size && t.parent.canReplace(f - 1, f) ? (n && n(u.tr.delete(t.pos - i.nodeSize, t.pos).scrollIntoView()), !0) : !t.parent.canReplace(f, f + 1) || !(a.isTextblock || fa(u.doc, t.pos)) ? !1 : (n && n(u.tr.join(t.pos).scrollIntoView()), !0);
 }
 function Nc(u, t, n, i) {
   let a = t.nodeBefore, f = t.nodeAfter, h, y, b = a.type.spec.isolating || f.type.spec.isolating;
-  if (!b && r0(u, t, n))
+  if (!b && e0(u, t, n))
     return !0;
   let M = !b && t.parent.canReplace(t.index(), t.index() + 1);
   if (M && (h = (y = a.contentMatchAt(a.childCount)).findWrapping(f.type)) && y.matchType(h[0] || f.type).validEnd) {
@@ -5395,7 +5379,7 @@ function Nc(u, t, n, i) {
     }
     return !0;
   }
-  let K = f.type.spec.isolating || i > 0 && b ? null : qe.findFrom(t, 1), W = K && K.$from.blockRange(K.$to), G = W && la(W);
+  let z = f.type.spec.isolating || i > 0 && b ? null : qe.findFrom(t, 1), W = z && z.$from.blockRange(z.$to), G = W && la(W);
   if (G != null && G >= t.depth)
     return n && n(u.tr.lift(W, G).scrollIntoView()), !0;
   if (M && Ji(f, "start", !0) && Ji(a, "end")) {
@@ -5426,17 +5410,17 @@ function Dc(u) {
         return !1;
       f--;
     }
-    return a.node(f).isTextblock ? (n && n(t.tr.setSelection(zt.create(t.doc, u < 0 ? a.start(f) : a.end(f)))), !0) : !1;
+    return a.node(f).isTextblock ? (n && n(t.tr.setSelection(Kt.create(t.doc, u < 0 ? a.start(f) : a.end(f)))), !0) : !1;
   };
 }
-const i0 = Dc(-1), s0 = Dc(1);
-function B0(u, t = null) {
+const t0 = Dc(-1), n0 = Dc(1);
+function P0(u, t = null) {
   return function(n, i) {
-    let { $from: a, $to: f } = n.selection, h = a.blockRange(f), y = h && kv(h, u, t);
+    let { $from: a, $to: f } = n.selection, h = a.blockRange(f), y = h && xv(h, u, t);
     return y ? (i && i(n.tr.wrap(h, y).scrollIntoView()), !0) : !1;
   };
 }
-function o0(u, t, n, i) {
+function r0(u, t, n, i) {
   for (let a = 0; a < t.length; a++) {
     let { $from: f, $to: h } = t[a], y = f.depth == 0 ? u.inlineContent && u.type.allowsMarkType(n) : !1;
     if (u.nodesBetween(f.pos, h.pos, (b, M) => {
@@ -5448,19 +5432,19 @@ function o0(u, t, n, i) {
   }
   return !1;
 }
-function F0(u, t = null, n) {
+function N0(u, t = null, n) {
   return function(i, a) {
     let { empty: f, $cursor: h, ranges: y } = i.selection;
-    if (f && !h || !o0(i.doc, y, u))
+    if (f && !h || !r0(i.doc, y, u))
       return !1;
     if (a)
       if (h)
         u.isInSet(i.storedMarks || h.marks()) ? a(i.tr.removeStoredMark(u)) : a(i.tr.addStoredMark(u.create(t)));
       else {
         let b, M = i.tr;
-        b = !y.some((K) => i.doc.rangeHasMark(K.$from.pos, K.$to.pos, u));
-        for (let K = 0; K < y.length; K++) {
-          let { $from: W, $to: G } = y[K];
+        b = !y.some((z) => i.doc.rangeHasMark(z.$from.pos, z.$to.pos, u));
+        for (let z = 0; z < y.length; z++) {
+          let { $from: W, $to: G } = y[z];
           if (!b)
             M.removeMark(W.pos, G.pos, u);
           else {
@@ -5481,10 +5465,10 @@ function qu(...u) {
     return !1;
   };
 }
-let Iu = qu(Cc, $v, jv), Hf = qu(Cc, Yv, Xv);
+let Iu = qu(Cc, Jv, Gv), Hf = qu(Cc, $v, jv);
 const tr = {
-  Enter: qu(Zv, e0, t0, Mc),
-  "Mod-Enter": Qv,
+  Enter: qu(Vv, Xv, Zv, Mc),
+  "Mod-Enter": Yv,
   Backspace: Iu,
   "Mod-Backspace": Iu,
   "Shift-Backspace": Iu,
@@ -5498,22 +5482,22 @@ const tr = {
   "Ctrl-Alt-Backspace": tr["Mod-Delete"],
   "Alt-Delete": tr["Mod-Delete"],
   "Alt-d": tr["Mod-Delete"],
-  "Ctrl-a": i0,
-  "Ctrl-e": s0
+  "Ctrl-a": t0,
+  "Ctrl-e": n0
 };
 for (let u in tr)
   Bc[u] = tr[u];
-const a0 = typeof navigator < "u" ? /Mac|iP(hone|[oa]d)/.test(navigator.platform) : typeof os < "u" && os.platform ? os.platform() == "darwin" : !1, L0 = a0 ? Bc : tr, K0 = (u, t) => u.type === t.nodes.bullet_list || u.type === t.nodes.ordered_list, z0 = (u) => {
+const i0 = typeof navigator < "u" ? /Mac|iP(hone|[oa]d)/.test(navigator.platform) : typeof os < "u" && os.platform ? os.platform() == "darwin" : !1, D0 = i0 ? Bc : tr, B0 = (u, t) => u.type === t.nodes.bullet_list || u.type === t.nodes.ordered_list, F0 = (u) => {
   const { empty: t } = u.state.selection;
   t && Pc(u.state, u.dispatch);
-}, q0 = (u, t, n) => {
+}, L0 = (u, t, n) => {
   if (n)
     u.dispatch(u.state.tr.addMark(n.from, n.to, t));
   else {
     const { $from: i, $to: a } = u.state.selection;
     u.dispatch(u.state.tr.addMark(i.pos, a.pos, t));
   }
-}, W0 = (u, t, n, i) => {
+}, z0 = (u, t, n, i) => {
   let a = t;
   const f = (G) => G.type === i;
   let h = null, y = null, b = null;
@@ -5524,7 +5508,7 @@ const a0 = typeof navigator < "u" ? /Mac|iP(hone|[oa]d)/.test(navigator.platform
     if (!j || h && j !== h) return null;
     y = y || G, h = h || j, b = G, a++;
   }
-  let M = t, K = n, W = 0;
+  let M = t, z = n, W = 0;
   for (a = t - 1; a > W; ) {
     const G = u.nodeAt(a), j = G && G.marks.find(f);
     if (!j || j !== h) break;
@@ -5533,7 +5517,7 @@ const a0 = typeof navigator < "u" ? /Mac|iP(hone|[oa]d)/.test(navigator.platform
   for (a = n + 1, W = u.nodeSize - 2; a < W; ) {
     const G = u.nodeAt(a), j = G && G.marks.find(f);
     if (!j || j !== h) break;
-    K = a, b = G, a++;
+    z = a, b = G, a++;
   }
   return {
     mark: h,
@@ -5543,10 +5527,10 @@ const a0 = typeof navigator < "u" ? /Mac|iP(hone|[oa]d)/.test(navigator.platform
     },
     to: {
       node: b,
-      pos: K
+      pos: z
     }
   };
-}, u0 = (u, t) => Array.isArray(u) && u.indexOf(t.type) > -1 || t.type === u, l0 = (u, t) => {
+}, s0 = (u, t) => Array.isArray(u) && u.indexOf(t.type) > -1 || t.type === u, o0 = (u, t) => {
   for (let n = u.depth; n > 0; n--) {
     const i = u.node(n);
     if (t(i))
@@ -5557,9 +5541,9 @@ const a0 = typeof navigator < "u" ? /Mac|iP(hone|[oa]d)/.test(navigator.platform
         node: i
       };
   }
-}, f0 = (u) => (t) => l0(t.$from, u), c0 = (u) => (t) => f0((n) => u0(u, n))(t), Cu = (u, t) => {
+}, a0 = (u) => (t) => o0(t.$from, u), u0 = (u) => (t) => a0((n) => s0(u, n))(t), Cu = (u, t) => {
   const n = t.schema.nodes[u];
-  return !!c0(n)(t.selection);
+  return !!u0(n)(t.selection);
 }, Fc = (u) => u ? u.type.name === "text" ? u : u.lastChild ? Fc(u.lastChild) : null : null, Lc = (u) => {
   const { selection: t, doc: n } = u.state, { from: i } = t;
   let a = n.nodeAt(i) || n.nodeAt(i - 1);
@@ -5572,21 +5556,21 @@ const a0 = typeof navigator < "u" ? /Mac|iP(hone|[oa]d)/.test(navigator.platform
   for (const n of u)
     if (n.type.name === t) return !0;
   return !1;
-}, U0 = (u, t) => {
+}, K0 = (u, t) => {
   const { from: n, $from: i, to: a, empty: f } = u.selection;
   return f ? t.isInSet(u.storedMarks || i.marks()) : u.doc.rangeHasMark(n, a, t);
-}, h0 = (u, t) => {
+}, l0 = (u, t) => {
   const { selection: n, doc: i } = u.state, { from: a, to: f } = n;
   let h = !0, y = "";
   return i.nodesBetween(a, f, (b) => (h && b.attrs[t] && (h = !1, y = b.attrs[t]), h)), y;
-}, Kc = {
+}, zc = {
   color: "#000000",
   backcolor: "",
   fontsize: "16px",
   fontname: "",
   align: "left"
-}, J0 = (u, t = {}) => {
-  const n = { ...Kc, ...t }, i = Lc(u), a = ri(i, "strong"), f = ri(i, "em"), h = ri(i, "underline"), y = ri(i, "strikethrough"), b = ri(i, "superscript"), M = ri(i, "subscript"), K = ri(i, "code"), W = qi(i, "forecolor", "color") || n.color, G = qi(i, "backcolor", "backcolor") || n.backcolor, j = qi(i, "fontsize", "fontsize") || n.fontsize, Y = qi(i, "fontname", "fontname") || n.fontname, se = qi(i, "link", "href") || "", me = h0(u, "align") || n.align, Te = Cu("bullet_list", u.state), gt = Cu("ordered_list", u.state), je = Cu("blockquote", u.state);
+}, q0 = (u, t = {}) => {
+  const n = { ...zc, ...t }, i = Lc(u), a = ri(i, "strong"), f = ri(i, "em"), h = ri(i, "underline"), y = ri(i, "strikethrough"), b = ri(i, "superscript"), M = ri(i, "subscript"), z = ri(i, "code"), W = qi(i, "forecolor", "color") || n.color, G = qi(i, "backcolor", "backcolor") || n.backcolor, j = qi(i, "fontsize", "fontsize") || n.fontsize, Y = qi(i, "fontname", "fontname") || n.fontname, se = qi(i, "link", "href") || "", me = l0(u, "align") || n.align, Te = Cu("bullet_list", u.state), gt = Cu("ordered_list", u.state), je = Cu("blockquote", u.state);
   return {
     bold: a,
     em: f,
@@ -5594,7 +5578,7 @@ const a0 = typeof navigator < "u" ? /Mac|iP(hone|[oa]d)/.test(navigator.platform
     strikethrough: y,
     superscript: b,
     subscript: M,
-    code: K,
+    code: z,
     color: W,
     backcolor: G,
     fontsize: j,
@@ -5605,10 +5589,10 @@ const a0 = typeof navigator < "u" ? /Mac|iP(hone|[oa]d)/.test(navigator.platform
     orderedList: gt,
     blockquote: je
   };
-}, G0 = (u) => {
-  const t = Lc(u), n = qi(t, "fontsize", "fontsize") || Kc.fontsize;
+}, W0 = (u) => {
+  const t = Lc(u), n = qi(t, "fontsize", "fontsize") || zc.fontsize;
   return parseInt(n);
-}, p0 = {
+}, f0 = {
   bold: !1,
   em: !1,
   underline: !1,
@@ -5627,10 +5611,10 @@ const a0 = typeof navigator < "u" ? /Mac|iP(hone|[oa]d)/.test(navigator.platform
   blockquote: !1
 };
 var ii = typeof globalThis < "u" ? globalThis : typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {};
-function d0(u) {
+function c0(u) {
   return u && u.__esModule && Object.prototype.hasOwnProperty.call(u, "default") ? u.default : u;
 }
-function H0(u) {
+function U0(u) {
   if (u.__esModule) return u;
   var t = u.default;
   if (typeof t == "function") {
@@ -5661,8 +5645,8 @@ var oa = { exports: {} };
 oa.exports;
 (function(u, t) {
   (function() {
-    var n, i = "4.17.23", a = 200, f = "Unsupported core-js use. Try https://npms.io/search?q=ponyfill.", h = "Expected a function", y = "Invalid `variable` option passed into `_.template`", b = "__lodash_hash_undefined__", M = 500, K = "__lodash_placeholder__", W = 1, G = 2, j = 4, Y = 1, se = 2, me = 1, Te = 2, gt = 4, je = 8, Qt = 16, Wt = 32, mt = 64, ze = 128, nr = 256, Gi = 512, Gs = 30, Hs = "...", Ir = 800, An = 16, $s = 1, Hi = 2, $i = 3, On = 1 / 0, st = 9007199254740991, rr = 17976931348623157e292, St = NaN, kt = 4294967295, en = kt - 1, ha = kt >>> 1, ir = [
-      ["ary", ze],
+    var n, i = "4.17.23", a = 200, f = "Unsupported core-js use. Try https://npms.io/search?q=ponyfill.", h = "Expected a function", y = "Invalid `variable` option passed into `_.template`", b = "__lodash_hash_undefined__", M = 500, z = "__lodash_placeholder__", W = 1, G = 2, j = 4, Y = 1, se = 2, me = 1, Te = 2, gt = 4, je = 8, Qt = 16, Wt = 32, mt = 64, Ke = 128, nr = 256, Gi = 512, Gs = 30, Hs = "...", Ir = 800, An = 16, $s = 1, Hi = 2, $i = 3, On = 1 / 0, st = 9007199254740991, rr = 17976931348623157e292, St = NaN, kt = 4294967295, en = kt - 1, ha = kt >>> 1, ir = [
+      ["ary", Ke],
       ["bind", me],
       ["bindKey", Te],
       ["curry", je],
@@ -5671,11 +5655,11 @@ oa.exports;
       ["partial", Wt],
       ["partialRight", mt],
       ["rearg", nr]
-    ], In = "[object Arguments]", Cn = "[object Array]", sr = "[object AsyncFunction]", Tn = "[object Boolean]", Cr = "[object Date]", le = "[object DOMException]", Tr = "[object Error]", Oe = "[object Function]", or = "[object GeneratorFunction]", Rt = "[object Map]", Mt = "[object Number]", pa = "[object Null]", tn = "[object Object]", js = "[object Promise]", da = "[object Proxy]", Rn = "[object RegExp]", Ge = "[object Set]", ar = "[object String]", un = "[object Symbol]", Vs = "[object Undefined]", nn = "[object WeakMap]", yt = "[object WeakSet]", Pt = "[object ArrayBuffer]", ln = "[object DataView]", Mn = "[object Float32Array]", Rr = "[object Float64Array]", ur = "[object Int8Array]", rn = "[object Int16Array]", lr = "[object Int32Array]", Mr = "[object Uint8Array]", Ut = "[object Uint8ClampedArray]", oe = "[object Uint16Array]", Pn = "[object Uint32Array]", Nn = /\b__p \+= '';/g, fi = /\b(__p \+=) '' \+/g, Q = /(__e\(.*?\)|\b__t\)) \+\n'';/g, ci = /&(?:amp|lt|gt|quot|#39);/g, ji = /[&<>"']/g, Vi = RegExp(ci.source), Ys = RegExp(ji.source), Yi = /<%-([\s\S]+?)%>/g, ga = /<%([\s\S]+?)%>/g, Xs = /<%=([\s\S]+?)%>/g, fr = /\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/, cr = /^\w*$/, Xi = /[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]|(?=(?:\.|\[\])(?:\.|\[\]|$))/g, hr = /[\\^$.*+?()[\]{}|]/g, Fe = RegExp(hr.source), He = /^\s+/, ma = /\s/, hi = /\{(?:\n\/\* \[wrapped with .+\] \*\/)?\n?/, pi = /\{\n\/\* \[wrapped with (.+)\] \*/, di = /,? & /, ya = /[^\x00-\x2f\x3a-\x40\x5b-\x60\x7b-\x7f]+/g, fn = /[()=,{}\[\]\/\s]/, pr = /\\(\\)?/g, cn = /\$\{([^\\}]*(?:\\.[^\\}]*)*)\}/g, Pr = /\w*$/, va = /^[-+]0x[0-9a-f]+$/i, hn = /^0b[01]+$/i, Zs = /^\[object .+?Constructor\]$/, Dn = /^0o[0-7]+$/i, Qs = /^(?:0|[1-9]\d*)$/, Zi = /[\xc0-\xd6\xd8-\xf6\xf8-\xff\u0100-\u017f]/g, Le = /($^)/, Bn = /['\n\r\u2028\u2029\\]/g, Et = "\\ud800-\\udfff", eo = "\\u0300-\\u036f", dr = "\\ufe20-\\ufe2f", gi = "\\u20d0-\\u20ff", mi = eo + dr + gi, yi = "\\u2700-\\u27bf", pn = "a-z\\xdf-\\xf6\\xf8-\\xff", to = "\\xac\\xb1\\xd7\\xf7", vi = "\\x00-\\x2f\\x3a-\\x40\\x5b-\\x60\\x7b-\\xbf", no = "\\u2000-\\u206f", be = " \\t\\x0b\\f\\xa0\\ufeff\\n\\r\\u2028\\u2029\\u1680\\u180e\\u2000\\u2001\\u2002\\u2003\\u2004\\u2005\\u2006\\u2007\\u2008\\u2009\\u200a\\u202f\\u205f\\u3000", Qi = "A-Z\\xc0-\\xd6\\xd8-\\xde", es = "\\ufe0e\\ufe0f", Nr = to + vi + no + be, Fn = "['’]", ro = "[" + Et + "]", ts = "[" + Nr + "]", Dr = "[" + mi + "]", Re = "\\d+", Br = "[" + yi + "]", gr = "[" + pn + "]", Ln = "[^" + Et + Nr + Re + yi + pn + Qi + "]", Fr = "\\ud83c[\\udffb-\\udfff]", ns = "(?:" + Dr + "|" + Fr + ")", Lr = "[^" + Et + "]", wi = "(?:\\ud83c[\\udde6-\\uddff]){2}", mr = "[\\ud800-\\udbff][\\udc00-\\udfff]", Kn = "[" + Qi + "]", io = "\\u200d", ke = "(?:" + gr + "|" + Ln + ")", so = "(?:" + Kn + "|" + Ln + ")", oo = "(?:" + Fn + "(?:d|ll|m|re|s|t|ve))?", ao = "(?:" + Fn + "(?:D|LL|M|RE|S|T|VE))?", ot = ns + "?", zn = "[" + es + "]?", bi = "(?:" + io + "(?:" + [Lr, wi, mr].join("|") + ")" + zn + ot + ")*", dn = "\\d*(?:1st|2nd|3rd|(?![123])\\dth)(?=\\b|[A-Z_])", uo = "\\d*(?:1ST|2ND|3RD|(?![123])\\dTH)(?=\\b|[a-z_])", rs = zn + ot + bi, Ze = "(?:" + [Br, wi, mr].join("|") + ")" + rs, Jt = "(?:" + [Lr + Dr + "?", Dr, wi, mr, ro].join("|") + ")", Kr = RegExp(Fn, "g"), zr = RegExp(Dr, "g"), qr = RegExp(Fr + "(?=" + Fr + ")|" + Jt + rs, "g"), gn = RegExp([
-      Kn + "?" + gr + "+" + oo + "(?=" + [ts, Kn, "$"].join("|") + ")",
-      so + "+" + ao + "(?=" + [ts, Kn + ke, "$"].join("|") + ")",
-      Kn + "?" + ke + "+" + oo,
-      Kn + "+" + ao,
+    ], In = "[object Arguments]", Cn = "[object Array]", sr = "[object AsyncFunction]", Tn = "[object Boolean]", Cr = "[object Date]", le = "[object DOMException]", Tr = "[object Error]", Oe = "[object Function]", or = "[object GeneratorFunction]", Rt = "[object Map]", Mt = "[object Number]", pa = "[object Null]", tn = "[object Object]", js = "[object Promise]", da = "[object Proxy]", Rn = "[object RegExp]", Ge = "[object Set]", ar = "[object String]", un = "[object Symbol]", Vs = "[object Undefined]", nn = "[object WeakMap]", yt = "[object WeakSet]", Pt = "[object ArrayBuffer]", ln = "[object DataView]", Mn = "[object Float32Array]", Rr = "[object Float64Array]", ur = "[object Int8Array]", rn = "[object Int16Array]", lr = "[object Int32Array]", Mr = "[object Uint8Array]", Ut = "[object Uint8ClampedArray]", oe = "[object Uint16Array]", Pn = "[object Uint32Array]", Nn = /\b__p \+= '';/g, fi = /\b(__p \+=) '' \+/g, Q = /(__e\(.*?\)|\b__t\)) \+\n'';/g, ci = /&(?:amp|lt|gt|quot|#39);/g, ji = /[&<>"']/g, Vi = RegExp(ci.source), Ys = RegExp(ji.source), Yi = /<%-([\s\S]+?)%>/g, ga = /<%([\s\S]+?)%>/g, Xs = /<%=([\s\S]+?)%>/g, fr = /\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/, cr = /^\w*$/, Xi = /[^.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]|(?=(?:\.|\[\])(?:\.|\[\]|$))/g, hr = /[\\^$.*+?()[\]{}|]/g, Fe = RegExp(hr.source), He = /^\s+/, ma = /\s/, hi = /\{(?:\n\/\* \[wrapped with .+\] \*\/)?\n?/, pi = /\{\n\/\* \[wrapped with (.+)\] \*/, di = /,? & /, ya = /[^\x00-\x2f\x3a-\x40\x5b-\x60\x7b-\x7f]+/g, fn = /[()=,{}\[\]\/\s]/, pr = /\\(\\)?/g, cn = /\$\{([^\\}]*(?:\\.[^\\}]*)*)\}/g, Pr = /\w*$/, va = /^[-+]0x[0-9a-f]+$/i, hn = /^0b[01]+$/i, Zs = /^\[object .+?Constructor\]$/, Dn = /^0o[0-7]+$/i, Qs = /^(?:0|[1-9]\d*)$/, Zi = /[\xc0-\xd6\xd8-\xf6\xf8-\xff\u0100-\u017f]/g, Le = /($^)/, Bn = /['\n\r\u2028\u2029\\]/g, Et = "\\ud800-\\udfff", eo = "\\u0300-\\u036f", dr = "\\ufe20-\\ufe2f", gi = "\\u20d0-\\u20ff", mi = eo + dr + gi, yi = "\\u2700-\\u27bf", pn = "a-z\\xdf-\\xf6\\xf8-\\xff", to = "\\xac\\xb1\\xd7\\xf7", vi = "\\x00-\\x2f\\x3a-\\x40\\x5b-\\x60\\x7b-\\xbf", no = "\\u2000-\\u206f", be = " \\t\\x0b\\f\\xa0\\ufeff\\n\\r\\u2028\\u2029\\u1680\\u180e\\u2000\\u2001\\u2002\\u2003\\u2004\\u2005\\u2006\\u2007\\u2008\\u2009\\u200a\\u202f\\u205f\\u3000", Qi = "A-Z\\xc0-\\xd6\\xd8-\\xde", es = "\\ufe0e\\ufe0f", Nr = to + vi + no + be, Fn = "['’]", ro = "[" + Et + "]", ts = "[" + Nr + "]", Dr = "[" + mi + "]", Re = "\\d+", Br = "[" + yi + "]", gr = "[" + pn + "]", Ln = "[^" + Et + Nr + Re + yi + pn + Qi + "]", Fr = "\\ud83c[\\udffb-\\udfff]", ns = "(?:" + Dr + "|" + Fr + ")", Lr = "[^" + Et + "]", wi = "(?:\\ud83c[\\udde6-\\uddff]){2}", mr = "[\\ud800-\\udbff][\\udc00-\\udfff]", zn = "[" + Qi + "]", io = "\\u200d", ke = "(?:" + gr + "|" + Ln + ")", so = "(?:" + zn + "|" + Ln + ")", oo = "(?:" + Fn + "(?:d|ll|m|re|s|t|ve))?", ao = "(?:" + Fn + "(?:D|LL|M|RE|S|T|VE))?", ot = ns + "?", Kn = "[" + es + "]?", bi = "(?:" + io + "(?:" + [Lr, wi, mr].join("|") + ")" + Kn + ot + ")*", dn = "\\d*(?:1st|2nd|3rd|(?![123])\\dth)(?=\\b|[A-Z_])", uo = "\\d*(?:1ST|2ND|3RD|(?![123])\\dTH)(?=\\b|[a-z_])", rs = Kn + ot + bi, Ze = "(?:" + [Br, wi, mr].join("|") + ")" + rs, Jt = "(?:" + [Lr + Dr + "?", Dr, wi, mr, ro].join("|") + ")", zr = RegExp(Fn, "g"), Kr = RegExp(Dr, "g"), qr = RegExp(Fr + "(?=" + Fr + ")|" + Jt + rs, "g"), gn = RegExp([
+      zn + "?" + gr + "+" + oo + "(?=" + [ts, zn, "$"].join("|") + ")",
+      so + "+" + ao + "(?=" + [ts, zn + ke, "$"].join("|") + ")",
+      zn + "?" + ke + "+" + oo,
+      zn + "+" + ao,
       uo,
       dn,
       Re,
@@ -5970,7 +5954,7 @@ oa.exports;
           return !1;
       return !0;
     }
-    function Ke(g, _) {
+    function ze(g, _) {
       for (var E = -1, A = g == null ? 0 : g.length, O = 0, T = []; ++E < A; ) {
         var R = g[E];
         _(R, E, g) && (T[O++] = R);
@@ -6152,7 +6136,7 @@ oa.exports;
     function Ht(g, _) {
       for (var E = -1, A = g.length, O = 0, T = []; ++E < A; ) {
         var R = g[E];
-        (R === _ || R === K) && (g[E] = K, T[O++] = E);
+        (R === _ || R === z) && (g[E] = z, T[O++] = E);
       }
       return T;
     }
@@ -6205,11 +6189,11 @@ oa.exports;
     }
     var w = function g(_) {
       _ = _ == null ? Ve : k.defaults(Ve.Object(), _, k.pick(Ve, is));
-      var E = _.Array, A = _.Date, O = _.Error, T = _.Function, R = _.Math, C = _.Object, N = _.RegExp, L = _.String, F = _.TypeError, B = E.prototype, q = T.prototype, H = C.prototype, X = _["__core-js_shared__"], Z = q.toString, z = H.hasOwnProperty, ne = 0, ee = function() {
+      var E = _.Array, A = _.Date, O = _.Error, T = _.Function, R = _.Math, C = _.Object, N = _.RegExp, L = _.String, F = _.TypeError, B = E.prototype, q = T.prototype, H = C.prototype, X = _["__core-js_shared__"], Z = q.toString, K = H.hasOwnProperty, ne = 0, ee = function() {
         var e = /[^.]+$/.exec(X && X.keys && X.keys.IE_PROTO || "");
         return e ? "Symbol(src)_1." + e : "";
       }(), V = H.toString, re = Z.call(C), _e = Ve._, Ae = N(
-        "^" + Z.call(z).replace(hr, "\\$&").replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g, "$1.*?") + "$"
+        "^" + Z.call(K).replace(hr, "\\$&").replace(/hasOwnProperty|(function).*?(?=\\\()| for .+?(?=\\\])/g, "$1.*?") + "$"
       ), ue = co ? _.Buffer : n, de = _.Symbol, Ne = _.Uint8Array, wt = ue ? ue.allocUnsafe : n, Be = vo(C.getPrototypeOf, C), wn = C.create, Ri = H.propertyIsEnumerable, wo = B.splice, Wu = de ? de.isConcatSpreadable : n, xs = de ? de.iterator : n, Vr = de ? de.toStringTag : n, bo = function() {
         try {
           var e = ei(C, "defineProperty");
@@ -6221,7 +6205,7 @@ oa.exports;
         if ($e(e) && !ge(e) && !(e instanceof Se)) {
           if (e instanceof $t)
             return e;
-          if (z.call(e, "__wrapped__"))
+          if (K.call(e, "__wrapped__"))
             return Hl(e);
         }
         return new $t(e);
@@ -6347,11 +6331,11 @@ oa.exports;
           var o = r[e];
           return o === b ? n : o;
         }
-        return z.call(r, e) ? r[e] : n;
+        return K.call(r, e) ? r[e] : n;
       }
       function uh(e) {
         var r = this.__data__;
-        return ks ? r[e] !== n : z.call(r, e);
+        return ks ? r[e] !== n : K.call(r, e);
       }
       function lh(e, r) {
         var o = this.__data__;
@@ -6459,7 +6443,7 @@ oa.exports;
       function Hu(e, r) {
         var o = ge(e), p = !o && ni(e), v = !o && !p && Er(e), S = !o && !p && !v && Li(e), I = o || p || v || S, P = I ? Oi(e.length, L) : [], D = P.length;
         for (var U in e)
-          (r || z.call(e, U)) && !(I && // Safari 9 has enumerable `arguments.length` in strict mode.
+          (r || K.call(e, U)) && !(I && // Safari 9 has enumerable `arguments.length` in strict mode.
           (U == "length" || // Node.js 0.10 has enumerable non-index properties on buffers.
           v && (U == "offset" || U == "parent") || // PhantomJS 2 has enumerable non-index properties on typed arrays.
           S && (U == "buffer" || U == "byteLength" || U == "byteOffset") || // Skip index properties.
@@ -6468,20 +6452,20 @@ oa.exports;
       }
       function $u(e) {
         var r = e.length;
-        return r ? e[za(0, r - 1)] : n;
+        return r ? e[Ka(0, r - 1)] : n;
       }
       function Oh(e, r) {
-        return Ko(Ot(e), Zr(r, 0, e.length));
+        return zo(Ot(e), Zr(r, 0, e.length));
       }
       function Ih(e) {
-        return Ko(Ot(e));
+        return zo(Ot(e));
       }
       function Ta(e, r, o) {
         (o !== n && !on(e[r], o) || o === n && !(r in e)) && jn(e, r, o);
       }
       function As(e, r, o) {
         var p = e[r];
-        (!(z.call(e, r) && on(p, o)) || o === n && !(r in e)) && jn(e, r, o);
+        (!(K.call(e, r) && on(p, o)) || o === n && !(r in e)) && jn(e, r, o);
       }
       function Ao(e, r) {
         for (var o = e.length; o--; )
@@ -6637,7 +6621,7 @@ oa.exports;
         return e && Qu(e, r, nt);
       }
       function Io(e, r) {
-        return Ke(r, function(o) {
+        return ze(r, function(o) {
           return Zn(e[o]);
         });
       }
@@ -6658,7 +6642,7 @@ oa.exports;
         return e > r;
       }
       function Nh(e, r) {
-        return e != null && z.call(e, r);
+        return e != null && K.call(e, r);
       }
       function Dh(e, r) {
         return e != null && r in C(e);
@@ -6703,13 +6687,13 @@ oa.exports;
       function Lh(e) {
         return $e(e) && bt(e) == Pt;
       }
-      function Kh(e) {
+      function zh(e) {
         return $e(e) && bt(e) == Cr;
       }
       function Cs(e, r, o, p, v) {
-        return e === r ? !0 : e == null || r == null || !$e(e) && !$e(r) ? e !== e && r !== r : zh(e, r, o, p, Cs, v);
+        return e === r ? !0 : e == null || r == null || !$e(e) && !$e(r) ? e !== e && r !== r : Kh(e, r, o, p, Cs, v);
       }
-      function zh(e, r, o, p, v, S) {
+      function Kh(e, r, o, p, v, S) {
         var I = ge(e), P = ge(r), D = I ? Cn : ht(e), U = P ? Cn : ht(r);
         D = D == In ? tn : D, U = U == In ? tn : U;
         var J = D == tn, $ = U == tn, te = D == U;
@@ -6721,7 +6705,7 @@ oa.exports;
         if (te && !J)
           return S || (S = new sn()), I || Li(e) ? Nl(e, r, o, p, v, S) : pp(e, r, D, o, p, v, S);
         if (!(o & Y)) {
-          var ae = J && z.call(e, "__wrapped__"), he = $ && z.call(r, "__wrapped__");
+          var ae = J && K.call(e, "__wrapped__"), he = $ && K.call(r, "__wrapped__");
           if (ae || he) {
             var ve = ae ? e.value() : e, pe = he ? r.value() : r;
             return S || (S = new sn()), v(ve, pe, o, p, S);
@@ -6780,7 +6764,7 @@ oa.exports;
           return $c(e);
         var r = [];
         for (var o in C(e))
-          z.call(e, o) && o != "constructor" && r.push(o);
+          K.call(e, o) && o != "constructor" && r.push(o);
         return r;
       }
       function Gh(e) {
@@ -6788,7 +6772,7 @@ oa.exports;
           return Op(e);
         var r = Ms(e), o = [];
         for (var p in e)
-          p == "constructor" && (r || !z.call(e, p)) || o.push(p);
+          p == "constructor" && (r || !K.call(e, p)) || o.push(p);
         return o;
       }
       function La(e, r) {
@@ -6802,12 +6786,12 @@ oa.exports;
       }
       function sl(e) {
         var r = Qa(e);
-        return r.length == 1 && r[0][2] ? Kl(r[0][0], r[0][1]) : function(o) {
+        return r.length == 1 && r[0][2] ? zl(r[0][0], r[0][1]) : function(o) {
           return o === e || Ba(o, e, r);
         };
       }
       function ol(e, r) {
-        return tu(e) && Ll(r) ? Kl(_n(e), r) : function(o) {
+        return tu(e) && Ll(r) ? zl(_n(e), r) : function(o) {
           var p = cu(o, e);
           return p === n && p === r ? hu(o, e) : Cs(r, p, Y | se);
         };
@@ -6875,7 +6859,7 @@ oa.exports;
           return Qr(r, e);
         };
       }
-      function Ka(e, r, o, p) {
+      function za(e, r, o, p) {
         var v = p ? go : yn, S = -1, I = r.length, P = e;
         for (e === r && (r = Ot(r)), o && (P = De(e, lt(o))); ++S < I; )
           for (var D = 0, U = r[S], J = o ? o(U) : U; (D = v(P, J, D, p)) > -1; )
@@ -6892,7 +6876,7 @@ oa.exports;
         }
         return e;
       }
-      function za(e, r) {
+      function Ka(e, r) {
         return e + _o(Ju() * (r - e + 1));
       }
       function Vh(e, r, o, p) {
@@ -6910,14 +6894,14 @@ oa.exports;
         return o;
       }
       function we(e, r) {
-        return iu(zl(e, r, Tt), e + "");
+        return iu(Kl(e, r, Tt), e + "");
       }
       function Yh(e) {
-        return $u(Ki(e));
+        return $u(zi(e));
       }
       function Xh(e, r) {
-        var o = Ki(e);
-        return Ko(o, Zr(r, 0, o.length));
+        var o = zi(e);
+        return zo(o, Zr(r, 0, o.length));
       }
       function Ts(e, r, o, p) {
         if (!Je(e))
@@ -6946,7 +6930,7 @@ oa.exports;
         });
       } : Tt;
       function Qh(e) {
-        return Ko(Ki(e));
+        return zo(zi(e));
       }
       function Vt(e, r, o) {
         var p = -1, v = e.length;
@@ -7040,7 +7024,7 @@ oa.exports;
         for (var v = e == null || typeof e != "object" && typeof e != "function"; ++o < p; ) {
           var S = r[o];
           if (typeof S == "string") {
-            if (S === "__proto__" && !z.call(e, "__proto__"))
+            if (S === "__proto__" && !K.call(e, "__proto__"))
               return !1;
             if (S === "constructor" && o + 1 < p && typeof r[o + 1] == "string" && r[o + 1] === "prototype") {
               if (v && o === 0)
@@ -7239,7 +7223,7 @@ oa.exports;
       }
       function Bi(e) {
         return function(r) {
-          return Si(kf(Sf(r).replace(Kr, "")), e, "");
+          return Si(kf(Sf(r).replace(zr, "")), e, "");
         };
       }
       function Rs(e) {
@@ -7317,7 +7301,7 @@ oa.exports;
           for (p = I ? p : o; ++p < o; ) {
             S = r[p];
             var P = Fo(S), D = P == "wrapper" ? Za(S) : n;
-            D && nu(D[0]) && D[1] == (ze | je | Wt | nr) && !D[4].length && D[9] == 1 ? I = I[Fo(D[0])].apply(I, D[3]) : I = S.length == 1 && nu(S) ? I[P]() : I.thru(S);
+            D && nu(D[0]) && D[1] == (Ke | je | Wt | nr) && !D[4].length && D[9] == 1 ? I = I[Fo(D[0])].apply(I, D[3]) : I = S.length == 1 && nu(S) ? I[P]() : I.thru(S);
           }
           return function() {
             var U = arguments, J = U[0];
@@ -7330,7 +7314,7 @@ oa.exports;
         });
       }
       function Po(e, r, o, p, v, S, I, P, D, U) {
-        var J = r & ze, $ = r & me, te = r & Te, ae = r & (je | Qt), he = r & Gi, ve = te ? n : Rs(e);
+        var J = r & Ke, $ = r & me, te = r & Te, ae = r & (je | Qt), he = r & Gi, ve = te ? n : Rs(e);
         function pe() {
           for (var xe = arguments.length, Ee = E(xe), Ft = xe; Ft--; )
             Ee[Ft] = arguments[Ft];
@@ -7477,7 +7461,7 @@ oa.exports;
         return Ul(ve(he, ae), e, r);
       }
       function Ml(e, r, o, p) {
-        return e === n || on(e, H[o]) && !z.call(p, o) ? r : e;
+        return e === n || on(e, H[o]) && !K.call(p, o) ? r : e;
       }
       function Pl(e, r, o, p, v, S) {
         return Je(e) && Je(r) && (S.set(r, e), Co(e, r, n, Pl, S), S.delete(r)), e;
@@ -7559,7 +7543,7 @@ oa.exports;
           return !1;
         for (var $ = D; $--; ) {
           var te = P[$];
-          if (!(I ? te in r : z.call(r, te)))
+          if (!(I ? te in r : K.call(r, te)))
             return !1;
         }
         var ae = S.get(e), he = S.get(r);
@@ -7585,7 +7569,7 @@ oa.exports;
         return S.delete(e), S.delete(r), ve;
       }
       function Yn(e) {
-        return iu(zl(e, n, Vl), e + "");
+        return iu(Kl(e, n, Vl), e + "");
       }
       function Ya(e) {
         return el(e, nt, eu);
@@ -7597,7 +7581,7 @@ oa.exports;
         return So.get(e);
       } : yu;
       function Fo(e) {
-        for (var r = e.name + "", o = Pi[r], p = z.call(Pi, r) ? o.length : 0; p--; ) {
+        for (var r = e.name + "", o = Pi[r], p = K.call(Pi, r) ? o.length : 0; p--; ) {
           var v = o[p], S = v.func;
           if (S == null || S == e)
             return v.name;
@@ -7605,7 +7589,7 @@ oa.exports;
         return r;
       }
       function Fi(e) {
-        var r = z.call(x, "placeholder") ? x : e;
+        var r = K.call(x, "placeholder") ? x : e;
         return r.placeholder;
       }
       function ce() {
@@ -7628,7 +7612,7 @@ oa.exports;
         return nl(o) ? o : n;
       }
       function gp(e) {
-        var r = z.call(e, Vr), o = e[Vr];
+        var r = K.call(e, Vr), o = e[Vr];
         try {
           e[Vr] = n;
           var p = !0;
@@ -7638,7 +7622,7 @@ oa.exports;
         return p && (r ? e[Vr] = o : delete e[Vr]), v;
       }
       var eu = Oa ? function(e) {
-        return e == null ? [] : (e = C(e), Ke(Oa(e), function(r) {
+        return e == null ? [] : (e = C(e), ze(Oa(e), function(r) {
           return Ri.call(e, r);
         }));
       } : vu, Dl = Oa ? function(e) {
@@ -7699,7 +7683,7 @@ oa.exports;
       }
       function vp(e) {
         var r = e.length, o = new e.constructor(r);
-        return r && typeof e[0] == "string" && z.call(e, "index") && (o.index = e.index, o.input = e.input), o;
+        return r && typeof e[0] == "string" && K.call(e, "index") && (o.index = e.index, o.input = e.input), o;
       }
       function Fl(e) {
         return typeof e.constructor == "function" && !Ms(e) ? Ni(Be(e)) : {};
@@ -7789,7 +7773,7 @@ oa.exports;
       function Ll(e) {
         return e === e && !Je(e);
       }
-      function Kl(e, r) {
+      function zl(e, r) {
         return function(o) {
           return o == null ? !1 : o[e] === r && (r !== n || e in C(o));
         };
@@ -7801,16 +7785,16 @@ oa.exports;
         return r;
       }
       function Ap(e, r) {
-        var o = e[1], p = r[1], v = o | p, S = v < (me | Te | ze), I = p == ze && o == je || p == ze && o == nr && e[7].length <= r[8] || p == (ze | nr) && r[7].length <= r[8] && o == je;
+        var o = e[1], p = r[1], v = o | p, S = v < (me | Te | Ke), I = p == Ke && o == je || p == Ke && o == nr && e[7].length <= r[8] || p == (Ke | nr) && r[7].length <= r[8] && o == je;
         if (!(S || I))
           return e;
         p & me && (e[2] = r[2], v |= o & me ? 0 : gt);
         var P = r[3];
         if (P) {
           var D = e[3];
-          e[3] = D ? xl(D, P, r[4]) : P, e[4] = D ? Ht(e[3], K) : r[4];
+          e[3] = D ? xl(D, P, r[4]) : P, e[4] = D ? Ht(e[3], z) : r[4];
         }
-        return P = r[5], P && (D = e[5], e[5] = D ? _l(D, P, r[6]) : P, e[6] = D ? Ht(e[5], K) : r[6]), P = r[7], P && (e[7] = P), p & ze && (e[8] = e[8] == null ? r[8] : ct(e[8], r[8])), e[9] == null && (e[9] = r[9]), e[0] = r[0], e[1] = v, e;
+        return P = r[5], P && (D = e[5], e[5] = D ? _l(D, P, r[6]) : P, e[6] = D ? Ht(e[5], z) : r[6]), P = r[7], P && (e[7] = P), p & Ke && (e[8] = e[8] == null ? r[8] : ct(e[8], r[8])), e[9] == null && (e[9] = r[9]), e[0] = r[0], e[1] = v, e;
       }
       function Op(e) {
         var r = [];
@@ -7822,7 +7806,7 @@ oa.exports;
       function Ip(e) {
         return V.call(e);
       }
-      function zl(e, r, o) {
+      function Kl(e, r, o) {
         return r = tt(r === n ? e.length - 1 : r, 0), function() {
           for (var p = arguments, v = -1, S = tt(p.length - r, 0), I = E(S); ++v < S; )
             I[v] = p[r + v];
@@ -7865,10 +7849,10 @@ oa.exports;
           return e.apply(n, arguments);
         };
       }
-      function Ko(e, r) {
+      function zo(e, r) {
         var o = -1, p = e.length, v = p - 1;
         for (r = r === n ? p : r; ++o < r; ) {
-          var S = za(o, v), I = e[S];
+          var S = Ka(o, v), I = e[S];
           e[S] = e[o], e[o] = I;
         }
         return e.length = r, e;
@@ -7951,10 +7935,10 @@ oa.exports;
         var p = e == null ? 0 : e.length;
         return p ? (r = o || r === n ? 1 : ye(r), r = p - r, Vt(e, 0, r < 0 ? 0 : r)) : [];
       }
-      function Kp(e, r) {
+      function zp(e, r) {
         return e && e.length ? Ro(e, ce(r, 3), !0, !0) : [];
       }
-      function zp(e, r) {
+      function Kp(e, r) {
         return e && e.length ? Ro(e, ce(r, 3), !0) : [];
       }
       function qp(e, r, o, p) {
@@ -8037,13 +8021,13 @@ oa.exports;
       }
       var Qp = we(Xl);
       function Xl(e, r) {
-        return e && e.length && r && r.length ? Ka(e, r) : e;
+        return e && e.length && r && r.length ? za(e, r) : e;
       }
       function ed(e, r, o) {
-        return e && e.length && r && r.length ? Ka(e, r, ce(o, 2)) : e;
+        return e && e.length && r && r.length ? za(e, r, ce(o, 2)) : e;
       }
       function td(e, r, o) {
-        return e && e.length && r && r.length ? Ka(e, r, n, o) : e;
+        return e && e.length && r && r.length ? za(e, r, n, o) : e;
       }
       var nd = Yn(function(e, r) {
         var o = e == null ? 0 : e.length, p = Ra(e, r);
@@ -8144,7 +8128,7 @@ oa.exports;
         if (!(e && e.length))
           return [];
         var r = 0;
-        return e = Ke(e, function(o) {
+        return e = ze(e, function(o) {
           if (Ye(o))
             return r = tt(o.length, r), !0;
         }), Oi(r, function(o) {
@@ -8162,13 +8146,13 @@ oa.exports;
       var kd = we(function(e, r) {
         return Ye(e) ? Os(e, r) : [];
       }), Ed = we(function(e) {
-        return Ja(Ke(e, Ye));
+        return Ja(ze(e, Ye));
       }), Ad = we(function(e) {
         var r = Yt(e);
-        return Ye(r) && (r = n), Ja(Ke(e, Ye), ce(r, 2));
+        return Ye(r) && (r = n), Ja(ze(e, Ye), ce(r, 2));
       }), Od = we(function(e) {
         var r = Yt(e);
-        return r = typeof r == "function" ? r : n, Ja(Ke(e, Ye), n, r);
+        return r = typeof r == "function" ? r : n, Ja(ze(e, Ye), n, r);
       }), Id = we(ou);
       function Cd(e, r) {
         return ml(e || [], r || [], As);
@@ -8187,7 +8171,7 @@ oa.exports;
       function Md(e, r) {
         return r(e), e;
       }
-      function zo(e, r) {
+      function Ko(e, r) {
         return r(e);
       }
       var Pd = Yn(function(e) {
@@ -8195,7 +8179,7 @@ oa.exports;
           return Ra(S, e);
         };
         return r > 1 || this.__actions__.length || !(p instanceof Se) || !Xn(o) ? this.thru(v) : (p = p.slice(o, +o + (r ? 1 : 0)), p.__actions__.push({
-          func: zo,
+          func: Ko,
           args: [v],
           thisArg: n
         }), new $t(p, this.__chain__).thru(function(S) {
@@ -8225,30 +8209,30 @@ oa.exports;
         }
         return v.__wrapped__ = e, r;
       }
-      function Kd() {
+      function zd() {
         var e = this.__wrapped__;
         if (e instanceof Se) {
           var r = e;
           return this.__actions__.length && (r = new Se(this)), r = r.reverse(), r.__actions__.push({
-            func: zo,
+            func: Ko,
             args: [su],
             thisArg: n
           }), new $t(r, this.__chain__);
         }
         return this.thru(su);
       }
-      function zd() {
+      function Kd() {
         return gl(this.__wrapped__, this.__actions__);
       }
       var qd = Mo(function(e, r, o) {
-        z.call(e, o) ? ++e[o] : jn(e, o, 1);
+        K.call(e, o) ? ++e[o] : jn(e, o, 1);
       });
       function Wd(e, r, o) {
         var p = ge(e) ? _i : Mh;
         return o && xt(e, r, o) && (r = n), p(e, ce(r, 3));
       }
       function Ud(e, r) {
-        var o = ge(e) ? Ke : Zu;
+        var o = ge(e) ? ze : Zu;
         return o(e, ce(r, 3));
       }
       var Jd = Al($l), Gd = Al(jl);
@@ -8270,10 +8254,10 @@ oa.exports;
         return o(e, ce(r, 3));
       }
       var Vd = Mo(function(e, r, o) {
-        z.call(e, o) ? e[o].push(r) : jn(e, o, [r]);
+        K.call(e, o) ? e[o].push(r) : jn(e, o, [r]);
       });
       function Yd(e, r, o, p) {
-        e = It(e) ? e : Ki(e), o = o && !p ? ye(o) : 0;
+        e = It(e) ? e : zi(e), o = o && !p ? ye(o) : 0;
         var v = e.length;
         return o < 0 && (o = tt(v + o, 0)), Ho(e) ? o <= v && e.indexOf(r, o) > -1 : !!v && yn(e, r, o) > -1;
       }
@@ -8306,7 +8290,7 @@ oa.exports;
         return p(e, ce(r, 4), o, v, Xu);
       }
       function rg(e, r) {
-        var o = ge(e) ? Ke : Zu;
+        var o = ge(e) ? ze : Zu;
         return o(e, Jo(ce(r, 3)));
       }
       function ig(e) {
@@ -8351,7 +8335,7 @@ oa.exports;
         };
       }
       function nf(e, r, o) {
-        return r = o ? n : r, r = e && r == null ? e.length : r, Vn(e, ze, n, n, n, n, r);
+        return r = o ? n : r, r = e && r == null ? e.length : r, Vn(e, Ke, n, n, n, n, r);
       }
       function rf(e, r) {
         var o;
@@ -8550,7 +8534,7 @@ oa.exports;
       }), ni = tl(/* @__PURE__ */ function() {
         return arguments;
       }()) ? tl : function(e) {
-        return $e(e) && z.call(e, "callee") && !Ri.call(e, "callee");
+        return $e(e) && K.call(e, "callee") && !Ri.call(e, "callee");
       }, ge = E.isArray, Tg = us ? lt(us) : Lh;
       function It(e) {
         return e != null && Go(e.length) && !Zn(e);
@@ -8561,7 +8545,7 @@ oa.exports;
       function Rg(e) {
         return e === !0 || e === !1 || $e(e) && bt(e) == Tn;
       }
-      var Er = Gc || wu, Mg = Gr ? lt(Gr) : Kh;
+      var Er = Gc || wu, Mg = Gr ? lt(Gr) : zh;
       function Pg(e) {
         return $e(e) && e.nodeType === 1 && !Ns(e);
       }
@@ -8576,7 +8560,7 @@ oa.exports;
         if (Ms(e))
           return !Fa(e).length;
         for (var o in e)
-          if (z.call(e, o))
+          if (K.call(e, o))
             return !1;
         return !0;
       }
@@ -8620,10 +8604,10 @@ oa.exports;
       function Lg(e, r) {
         return e === r || Ba(e, r, Qa(r));
       }
-      function Kg(e, r, o) {
+      function zg(e, r, o) {
         return o = typeof o == "function" ? o : n, Ba(e, r, Qa(r), o);
       }
-      function zg(e) {
+      function Kg(e) {
         return hf(e) && e != +e;
       }
       function qg(e) {
@@ -8646,7 +8630,7 @@ oa.exports;
         var r = Be(e);
         if (r === null)
           return !0;
-        var o = z.call(r, "constructor") && r.constructor;
+        var o = K.call(r, "constructor") && r.constructor;
         return typeof o == "function" && o instanceof o && Z.call(o) == re;
       }
       var fu = $r ? lt($r) : Wh;
@@ -8680,7 +8664,7 @@ oa.exports;
           return Ho(e) ? At(e) : Ot(e);
         if (xs && e[xs])
           return Ti(e[xs]());
-        var r = ht(e), o = r == Rt ? vn : r == Ge ? jr : Ki;
+        var r = ht(e), o = r == Rt ? vn : r == Ge ? jr : zi;
         return o(e);
       }
       function Qn(e) {
@@ -8729,7 +8713,7 @@ oa.exports;
           return;
         }
         for (var o in r)
-          z.call(r, o) && As(e, o, r[o]);
+          K.call(r, o) && As(e, o, r[o]);
       }), yf = Di(function(e, r) {
         xn(r, Ct(r), e);
       }), $o = Di(function(e, r, o, p) {
@@ -8747,7 +8731,7 @@ oa.exports;
         for (v && xt(r[0], r[1], v) && (p = 1); ++o < p; )
           for (var S = r[o], I = Ct(S), P = -1, D = I.length; ++P < D; ) {
             var U = I[P], J = e[U];
-            (J === n || on(J, H[U]) && !z.call(e, U)) && (e[U] = S[U]);
+            (J === n || on(J, H[U]) && !K.call(e, U)) && (e[U] = S[U]);
           }
         return e;
       }), nm = we(function(e) {
@@ -8790,7 +8774,7 @@ oa.exports;
       var hm = Il(function(e, r, o) {
         r != null && typeof r.toString != "function" && (r = V.call(r)), e[r] = o;
       }, du(Tt)), pm = Il(function(e, r, o) {
-        r != null && typeof r.toString != "function" && (r = V.call(r)), z.call(e, r) ? e[r].push(o) : e[r] = [o];
+        r != null && typeof r.toString != "function" && (r = V.call(r)), K.call(e, r) ? e[r].push(o) : e[r] = [o];
       }, ce), dm = we(Is);
       function nt(e) {
         return It(e) ? Hu(e) : Fa(e);
@@ -8877,7 +8861,7 @@ oa.exports;
       function Om(e, r, o, p) {
         return p = typeof p == "function" ? p : n, e == null ? e : dl(e, r, Ha(o), p);
       }
-      function Ki(e) {
+      function zi(e) {
         return e == null ? [] : vs(e, nt(e));
       }
       function Im(e) {
@@ -8898,7 +8882,7 @@ oa.exports;
           var v = Ju();
           return ct(e + v * (r - e + xa("1e-" + ((v + "").length - 1))), r);
         }
-        return za(e, r);
+        return Ka(e, r);
       }
       var Mm = Bi(function(e, r, o) {
         return r = r.toLowerCase(), e + (o ? _f(r) : r);
@@ -8907,7 +8891,7 @@ oa.exports;
         return pu(Ce(e).toLowerCase());
       }
       function Sf(e) {
-        return e = Ce(e), e && e.replace(Zi, ka).replace(zr, "");
+        return e = Ce(e), e && e.replace(Zi, ka).replace(Kr, "");
       }
       function Pm(e, r, o) {
         e = Ce(e), r = Dt(r);
@@ -8927,7 +8911,7 @@ oa.exports;
       }), Fm = Bi(function(e, r, o) {
         return e + (o ? " " : "") + r.toLowerCase();
       }), Lm = El("toLowerCase");
-      function Km(e, r, o) {
+      function zm(e, r, o) {
         e = Ce(e), r = ye(r);
         var p = r ? vt(e) : 0;
         if (!r || p >= r)
@@ -8935,7 +8919,7 @@ oa.exports;
         var v = (r - p) / 2;
         return Do(_o(v), o) + e + Do(xo(v), o);
       }
-      function zm(e, r, o) {
+      function Km(e, r, o) {
         e = Ce(e), r = ye(r);
         var p = r ? vt(e) : 0;
         return r && p < r ? e + Do(r - p, o) : e;
@@ -8973,7 +8957,7 @@ oa.exports;
         var v = $o({}, r.imports, p.imports, Ml), S = nt(v), I = vs(v, S), P, D, U = 0, J = r.interpolate || Le, $ = "__p += '", te = N(
           (r.escape || Le).source + "|" + J.source + "|" + (J === Xs ? cn : Le).source + "|" + (r.evaluate || Le).source + "|$",
           "g"
-        ), ae = "//# sourceURL=" + (z.call(r, "sourceURL") ? (r.sourceURL + "").replace(/\s/g, " ") : "lodash.templateSources[" + ++lo + "]") + `
+        ), ae = "//# sourceURL=" + (K.call(r, "sourceURL") ? (r.sourceURL + "").replace(/\s/g, " ") : "lodash.templateSources[" + ++lo + "]") + `
 `;
         e.replace(te, function(pe, xe, Ee, Ft, _t, Lt) {
           return Ee || (Ee = Ft), $ += e.slice(U, Lt).replace(Bn, Aa), xe && (P = !0, $ += `' +
@@ -8985,7 +8969,7 @@ __p += '`), Ee && ($ += `' +
 '`), U = Lt + pe.length, pe;
         }), $ += `';
 `;
-        var he = z.call(r, "variable") && r.variable;
+        var he = K.call(r, "variable") && r.variable;
         if (!he)
           $ = `with (obj) {
 ` + $ + `
@@ -9229,7 +9213,7 @@ function print() { __p += __j.call(arguments, '') }
       }
       var Ly = No(function(e, r) {
         return e * r;
-      }, 1), Ky = Va("round"), zy = No(function(e, r) {
+      }, 1), zy = Va("round"), Ky = No(function(e, r) {
         return e - r;
       }, 0);
       function qy(e) {
@@ -9238,10 +9222,10 @@ function print() { __p += __j.call(arguments, '') }
       function Wy(e, r) {
         return e && e.length ? ms(e, ce(r, 2)) : 0;
       }
-      return x.after = fg, x.ary = nf, x.assign = Xg, x.assignIn = yf, x.assignInWith = $o, x.assignWith = Zg, x.at = Qg, x.before = rf, x.bind = au, x.bindAll = iy, x.bindKey = sf, x.castArray = _g, x.chain = Ql, x.chunk = Rp, x.compact = Mp, x.concat = Pp, x.cond = sy, x.conforms = oy, x.constant = du, x.countBy = qd, x.create = em, x.curry = of, x.curryRight = af, x.debounce = uf, x.defaults = tm, x.defaultsDeep = nm, x.defer = cg, x.delay = hg, x.difference = Np, x.differenceBy = Dp, x.differenceWith = Bp, x.drop = Fp, x.dropRight = Lp, x.dropRightWhile = Kp, x.dropWhile = zp, x.fill = qp, x.filter = Ud, x.flatMap = Hd, x.flatMapDeep = $d, x.flatMapDepth = jd, x.flatten = Vl, x.flattenDeep = Wp, x.flattenDepth = Up, x.flip = pg, x.flow = uy, x.flowRight = ly, x.fromPairs = Jp, x.functions = lm, x.functionsIn = fm, x.groupBy = Vd, x.initial = Hp, x.intersection = $p, x.intersectionBy = jp, x.intersectionWith = Vp, x.invert = hm, x.invertBy = pm, x.invokeMap = Xd, x.iteratee = gu, x.keyBy = Zd, x.keys = nt, x.keysIn = Ct, x.map = qo, x.mapKeys = gm, x.mapValues = mm, x.matches = fy, x.matchesProperty = cy, x.memoize = Uo, x.merge = ym, x.mergeWith = vf, x.method = hy, x.methodOf = py, x.mixin = mu, x.negate = Jo, x.nthArg = gy, x.omit = vm, x.omitBy = wm, x.once = dg, x.orderBy = Qd, x.over = my, x.overArgs = gg, x.overEvery = yy, x.overSome = vy, x.partial = uu, x.partialRight = lf, x.partition = eg, x.pick = bm, x.pickBy = wf, x.property = Af, x.propertyOf = wy, x.pull = Qp, x.pullAll = Xl, x.pullAllBy = ed, x.pullAllWith = td, x.pullAt = nd, x.range = by, x.rangeRight = xy, x.rearg = mg, x.reject = rg, x.remove = rd, x.rest = yg, x.reverse = su, x.sampleSize = sg, x.set = _m, x.setWith = Sm, x.shuffle = og, x.slice = id, x.sortBy = lg, x.sortedUniq = cd, x.sortedUniqBy = hd, x.split = Hm, x.spread = vg, x.tail = pd, x.take = dd, x.takeRight = gd, x.takeRightWhile = md, x.takeWhile = yd, x.tap = Md, x.throttle = wg, x.thru = zo, x.toArray = df, x.toPairs = bf, x.toPairsIn = xf, x.toPath = Ay, x.toPlainObject = mf, x.transform = km, x.unary = bg, x.union = vd, x.unionBy = wd, x.unionWith = bd, x.uniq = xd, x.uniqBy = _d, x.uniqWith = Sd, x.unset = Em, x.unzip = ou, x.unzipWith = Zl, x.update = Am, x.updateWith = Om, x.values = Ki, x.valuesIn = Im, x.without = kd, x.words = kf, x.wrap = xg, x.xor = Ed, x.xorBy = Ad, x.xorWith = Od, x.zip = Id, x.zipObject = Cd, x.zipObjectDeep = Td, x.zipWith = Rd, x.entries = bf, x.entriesIn = xf, x.extend = yf, x.extendWith = $o, mu(x, x), x.add = Iy, x.attempt = Ef, x.camelCase = Mm, x.capitalize = _f, x.ceil = Cy, x.clamp = Cm, x.clone = Sg, x.cloneDeep = Eg, x.cloneDeepWith = Ag, x.cloneWith = kg, x.conformsTo = Og, x.deburr = Sf, x.defaultTo = ay, x.divide = Ty, x.endsWith = Pm, x.eq = on, x.escape = Nm, x.escapeRegExp = Dm, x.every = Wd, x.find = Jd, x.findIndex = $l, x.findKey = rm, x.findLast = Gd, x.findLastIndex = jl, x.findLastKey = im, x.floor = Ry, x.forEach = ef, x.forEachRight = tf, x.forIn = sm, x.forInRight = om, x.forOwn = am, x.forOwnRight = um, x.get = cu, x.gt = Ig, x.gte = Cg, x.has = cm, x.hasIn = hu, x.head = Yl, x.identity = Tt, x.includes = Yd, x.indexOf = Gp, x.inRange = Tm, x.invoke = dm, x.isArguments = ni, x.isArray = ge, x.isArrayBuffer = Tg, x.isArrayLike = It, x.isArrayLikeObject = Ye, x.isBoolean = Rg, x.isBuffer = Er, x.isDate = Mg, x.isElement = Pg, x.isEmpty = Ng, x.isEqual = Dg, x.isEqualWith = Bg, x.isError = lu, x.isFinite = Fg, x.isFunction = Zn, x.isInteger = ff, x.isLength = Go, x.isMap = cf, x.isMatch = Lg, x.isMatchWith = Kg, x.isNaN = zg, x.isNative = qg, x.isNil = Ug, x.isNull = Wg, x.isNumber = hf, x.isObject = Je, x.isObjectLike = $e, x.isPlainObject = Ns, x.isRegExp = fu, x.isSafeInteger = Jg, x.isSet = pf, x.isString = Ho, x.isSymbol = Bt, x.isTypedArray = Li, x.isUndefined = Gg, x.isWeakMap = Hg, x.isWeakSet = $g, x.join = Yp, x.kebabCase = Bm, x.last = Yt, x.lastIndexOf = Xp, x.lowerCase = Fm, x.lowerFirst = Lm, x.lt = jg, x.lte = Vg, x.max = My, x.maxBy = Py, x.mean = Ny, x.meanBy = Dy, x.min = By, x.minBy = Fy, x.stubArray = vu, x.stubFalse = wu, x.stubObject = _y, x.stubString = Sy, x.stubTrue = ky, x.multiply = Ly, x.nth = Zp, x.noConflict = dy, x.noop = yu, x.now = Wo, x.pad = Km, x.padEnd = zm, x.padStart = qm, x.parseInt = Wm, x.random = Rm, x.reduce = tg, x.reduceRight = ng, x.repeat = Um, x.replace = Jm, x.result = xm, x.round = Ky, x.runInContext = g, x.sample = ig, x.size = ag, x.snakeCase = Gm, x.some = ug, x.sortedIndex = sd, x.sortedIndexBy = od, x.sortedIndexOf = ad, x.sortedLastIndex = ud, x.sortedLastIndexBy = ld, x.sortedLastIndexOf = fd, x.startCase = $m, x.startsWith = jm, x.subtract = zy, x.sum = qy, x.sumBy = Wy, x.template = Vm, x.times = Ey, x.toFinite = Qn, x.toInteger = ye, x.toLength = gf, x.toLower = Ym, x.toNumber = Xt, x.toSafeInteger = Yg, x.toString = Ce, x.toUpper = Xm, x.trim = Zm, x.trimEnd = Qm, x.trimStart = ey, x.truncate = ty, x.unescape = ny, x.uniqueId = Oy, x.upperCase = ry, x.upperFirst = pu, x.each = ef, x.eachRight = tf, x.first = Yl, mu(x, function() {
+      return x.after = fg, x.ary = nf, x.assign = Xg, x.assignIn = yf, x.assignInWith = $o, x.assignWith = Zg, x.at = Qg, x.before = rf, x.bind = au, x.bindAll = iy, x.bindKey = sf, x.castArray = _g, x.chain = Ql, x.chunk = Rp, x.compact = Mp, x.concat = Pp, x.cond = sy, x.conforms = oy, x.constant = du, x.countBy = qd, x.create = em, x.curry = of, x.curryRight = af, x.debounce = uf, x.defaults = tm, x.defaultsDeep = nm, x.defer = cg, x.delay = hg, x.difference = Np, x.differenceBy = Dp, x.differenceWith = Bp, x.drop = Fp, x.dropRight = Lp, x.dropRightWhile = zp, x.dropWhile = Kp, x.fill = qp, x.filter = Ud, x.flatMap = Hd, x.flatMapDeep = $d, x.flatMapDepth = jd, x.flatten = Vl, x.flattenDeep = Wp, x.flattenDepth = Up, x.flip = pg, x.flow = uy, x.flowRight = ly, x.fromPairs = Jp, x.functions = lm, x.functionsIn = fm, x.groupBy = Vd, x.initial = Hp, x.intersection = $p, x.intersectionBy = jp, x.intersectionWith = Vp, x.invert = hm, x.invertBy = pm, x.invokeMap = Xd, x.iteratee = gu, x.keyBy = Zd, x.keys = nt, x.keysIn = Ct, x.map = qo, x.mapKeys = gm, x.mapValues = mm, x.matches = fy, x.matchesProperty = cy, x.memoize = Uo, x.merge = ym, x.mergeWith = vf, x.method = hy, x.methodOf = py, x.mixin = mu, x.negate = Jo, x.nthArg = gy, x.omit = vm, x.omitBy = wm, x.once = dg, x.orderBy = Qd, x.over = my, x.overArgs = gg, x.overEvery = yy, x.overSome = vy, x.partial = uu, x.partialRight = lf, x.partition = eg, x.pick = bm, x.pickBy = wf, x.property = Af, x.propertyOf = wy, x.pull = Qp, x.pullAll = Xl, x.pullAllBy = ed, x.pullAllWith = td, x.pullAt = nd, x.range = by, x.rangeRight = xy, x.rearg = mg, x.reject = rg, x.remove = rd, x.rest = yg, x.reverse = su, x.sampleSize = sg, x.set = _m, x.setWith = Sm, x.shuffle = og, x.slice = id, x.sortBy = lg, x.sortedUniq = cd, x.sortedUniqBy = hd, x.split = Hm, x.spread = vg, x.tail = pd, x.take = dd, x.takeRight = gd, x.takeRightWhile = md, x.takeWhile = yd, x.tap = Md, x.throttle = wg, x.thru = Ko, x.toArray = df, x.toPairs = bf, x.toPairsIn = xf, x.toPath = Ay, x.toPlainObject = mf, x.transform = km, x.unary = bg, x.union = vd, x.unionBy = wd, x.unionWith = bd, x.uniq = xd, x.uniqBy = _d, x.uniqWith = Sd, x.unset = Em, x.unzip = ou, x.unzipWith = Zl, x.update = Am, x.updateWith = Om, x.values = zi, x.valuesIn = Im, x.without = kd, x.words = kf, x.wrap = xg, x.xor = Ed, x.xorBy = Ad, x.xorWith = Od, x.zip = Id, x.zipObject = Cd, x.zipObjectDeep = Td, x.zipWith = Rd, x.entries = bf, x.entriesIn = xf, x.extend = yf, x.extendWith = $o, mu(x, x), x.add = Iy, x.attempt = Ef, x.camelCase = Mm, x.capitalize = _f, x.ceil = Cy, x.clamp = Cm, x.clone = Sg, x.cloneDeep = Eg, x.cloneDeepWith = Ag, x.cloneWith = kg, x.conformsTo = Og, x.deburr = Sf, x.defaultTo = ay, x.divide = Ty, x.endsWith = Pm, x.eq = on, x.escape = Nm, x.escapeRegExp = Dm, x.every = Wd, x.find = Jd, x.findIndex = $l, x.findKey = rm, x.findLast = Gd, x.findLastIndex = jl, x.findLastKey = im, x.floor = Ry, x.forEach = ef, x.forEachRight = tf, x.forIn = sm, x.forInRight = om, x.forOwn = am, x.forOwnRight = um, x.get = cu, x.gt = Ig, x.gte = Cg, x.has = cm, x.hasIn = hu, x.head = Yl, x.identity = Tt, x.includes = Yd, x.indexOf = Gp, x.inRange = Tm, x.invoke = dm, x.isArguments = ni, x.isArray = ge, x.isArrayBuffer = Tg, x.isArrayLike = It, x.isArrayLikeObject = Ye, x.isBoolean = Rg, x.isBuffer = Er, x.isDate = Mg, x.isElement = Pg, x.isEmpty = Ng, x.isEqual = Dg, x.isEqualWith = Bg, x.isError = lu, x.isFinite = Fg, x.isFunction = Zn, x.isInteger = ff, x.isLength = Go, x.isMap = cf, x.isMatch = Lg, x.isMatchWith = zg, x.isNaN = Kg, x.isNative = qg, x.isNil = Ug, x.isNull = Wg, x.isNumber = hf, x.isObject = Je, x.isObjectLike = $e, x.isPlainObject = Ns, x.isRegExp = fu, x.isSafeInteger = Jg, x.isSet = pf, x.isString = Ho, x.isSymbol = Bt, x.isTypedArray = Li, x.isUndefined = Gg, x.isWeakMap = Hg, x.isWeakSet = $g, x.join = Yp, x.kebabCase = Bm, x.last = Yt, x.lastIndexOf = Xp, x.lowerCase = Fm, x.lowerFirst = Lm, x.lt = jg, x.lte = Vg, x.max = My, x.maxBy = Py, x.mean = Ny, x.meanBy = Dy, x.min = By, x.minBy = Fy, x.stubArray = vu, x.stubFalse = wu, x.stubObject = _y, x.stubString = Sy, x.stubTrue = ky, x.multiply = Ly, x.nth = Zp, x.noConflict = dy, x.noop = yu, x.now = Wo, x.pad = zm, x.padEnd = Km, x.padStart = qm, x.parseInt = Wm, x.random = Rm, x.reduce = tg, x.reduceRight = ng, x.repeat = Um, x.replace = Jm, x.result = xm, x.round = zy, x.runInContext = g, x.sample = ig, x.size = ag, x.snakeCase = Gm, x.some = ug, x.sortedIndex = sd, x.sortedIndexBy = od, x.sortedIndexOf = ad, x.sortedLastIndex = ud, x.sortedLastIndexBy = ld, x.sortedLastIndexOf = fd, x.startCase = $m, x.startsWith = jm, x.subtract = Ky, x.sum = qy, x.sumBy = Wy, x.template = Vm, x.times = Ey, x.toFinite = Qn, x.toInteger = ye, x.toLength = gf, x.toLower = Ym, x.toNumber = Xt, x.toSafeInteger = Yg, x.toString = Ce, x.toUpper = Xm, x.trim = Zm, x.trimEnd = Qm, x.trimStart = ey, x.truncate = ty, x.unescape = ny, x.uniqueId = Oy, x.upperCase = ry, x.upperFirst = pu, x.each = ef, x.eachRight = tf, x.first = Yl, mu(x, function() {
         var e = {};
         return bn(x, function(r, o) {
-          z.call(x.prototype, o) || (e[o] = r);
+          K.call(x.prototype, o) || (e[o] = r);
         }), e;
       }(), { chain: !1 }), x.VERSION = i, ut(["bind", "bindKey", "curry", "curryRight", "partial", "partialRight"], function(e) {
         x[e].placeholder = x;
@@ -9307,7 +9291,7 @@ function print() { __p += __j.call(arguments, '') }
           if (!S && J) {
             I = ve ? I : new Se(this);
             var pe = e.apply(I, P);
-            return pe.__actions__.push({ func: zo, args: [$], thisArg: n }), new $t(pe, te);
+            return pe.__actions__.push({ func: Ko, args: [$], thisArg: n }), new $t(pe, te);
           }
           return he && ve ? e.apply(this, P) : (pe = this.thru($), he ? p ? pe.value()[0] : pe.value() : pe);
         });
@@ -9327,26 +9311,26 @@ function print() { __p += __j.call(arguments, '') }
         var o = x[r];
         if (o) {
           var p = o.name + "";
-          z.call(Pi, p) || (Pi[p] = []), Pi[p].push({ name: r, func: o });
+          K.call(Pi, p) || (Pi[p] = []), Pi[p].push({ name: r, func: o });
         }
       }), Pi[Po(n, Te).name] = [{
         name: "wrapper",
         func: n
-      }], Se.prototype.clone = nh, Se.prototype.reverse = rh, Se.prototype.value = ih, x.prototype.at = Pd, x.prototype.chain = Nd, x.prototype.commit = Dd, x.prototype.next = Bd, x.prototype.plant = Ld, x.prototype.reverse = Kd, x.prototype.toJSON = x.prototype.valueOf = x.prototype.value = zd, x.prototype.first = x.prototype.head, xs && (x.prototype[xs] = Fd), x;
+      }], Se.prototype.clone = nh, Se.prototype.reverse = rh, Se.prototype.value = ih, x.prototype.at = Pd, x.prototype.chain = Nd, x.prototype.commit = Dd, x.prototype.next = Bd, x.prototype.plant = Ld, x.prototype.reverse = zd, x.prototype.toJSON = x.prototype.valueOf = x.prototype.value = Kd, x.prototype.first = x.prototype.head, xs && (x.prototype[xs] = Fd), x;
     }, k = w();
     qn ? ((qn.exports = k)._ = k, as._ = k) : Ve._ = k;
   }).call(ii);
 })(oa, oa.exports);
 var $f = oa.exports;
-const g0 = () => navigator.language.toLowerCase().startsWith("zh") ? "zh-CN" : "en", m0 = () => {
+const h0 = () => navigator.language.toLowerCase().startsWith("zh") ? "zh-CN" : "en", p0 = () => {
   const t = new URLSearchParams(window.location.search).get("lang");
   return t === "zh-CN" || t === "en" ? t : null;
-}, y0 = () => {
+}, d0 = () => {
   const u = localStorage.getItem("pptist-language");
   return u === "zh-CN" || u === "en" ? u : null;
-}, v0 = () => m0() || y0() || g0(), w0 = Uy({
-  locale: v0()
-}), b0 = (u) => w0.global.t(u), si = Js("slides", {
+}, g0 = () => p0() || d0() || h0(), m0 = Jy({
+  locale: g0()
+}), y0 = (u) => m0.global.t(u), si = Js("slides", {
   state: () => ({
     title: "",
     // 幻灯片标题
@@ -9420,7 +9404,7 @@ const g0 = () => navigator.language.toLowerCase().startsWith("zh") ? "zh-CN" : "
   },
   actions: {
     setTitle(u) {
-      u ? this.title = u : this.title = b0("common.untitledPresentation");
+      u ? this.title = u : this.title = y0("common.untitledPresentation");
     },
     setTheme(u) {
       this.theme = { ...this.theme, ...u };
@@ -9488,7 +9472,7 @@ const g0 = () => navigator.language.toLowerCase().startsWith("zh") ? "zh-CN" : "
       this.slides[a].elements = h;
     }
   }
-}), x0 = $y("0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz"), zc = x0(10), jf = Js("main", {
+}), v0 = Uy("0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz"), Kc = v0(10), jf = Js("main", {
   state: () => ({
     activeElementIdList: [],
     // 被选中的元素ID集合，包含 handleElementId
@@ -9526,7 +9510,7 @@ const g0 = () => navigator.language.toLowerCase().startsWith("zh") ? "zh-CN" : "
     // pptId
     originalPPTUrl: "",
     // 原始ppturl
-    richTextAttrs: p0,
+    richTextAttrs: f0,
     // 富文本状态
     selectedTableCells: [],
     // 选中的表格单元格
@@ -9536,7 +9520,7 @@ const g0 = () => navigator.language.toLowerCase().startsWith("zh") ? "zh-CN" : "
     // 当前被选中的页面索引集合
     dialogForExport: "",
     // 导出面板
-    databaseId: zc,
+    databaseId: Kc,
     // 标识当前应用的indexedDB数据库ID
     textFormatPainter: null,
     // 文字格式刷
@@ -9694,9 +9678,9 @@ var qc = { exports: {} };
       }), s;
     }
     typeof Promise > "u" || f.Promise || (f.Promise = Promise);
-    var M = Object.getPrototypeOf, K = {}.hasOwnProperty;
+    var M = Object.getPrototypeOf, z = {}.hasOwnProperty;
     function W(s, l) {
-      return K.call(s, l);
+      return z.call(s, l);
     }
     function G(s, l) {
       typeof l == "function" && (l = l(M(s))), (typeof Reflect > "u" ? h : Reflect.ownKeys)(l).forEach(function(c) {
@@ -9738,13 +9722,13 @@ var qc = { exports: {} };
       var k, g = l.indexOf(".");
       return g === -1 || (k = s[l.substr(0, g)]) == null ? void 0 : mt(k, l.substr(g + 1));
     }
-    function ze(s, l, c) {
+    function Ke(s, l, c) {
       if (s && l !== void 0 && !("isFrozen" in Object && Object.isFrozen(s))) if (typeof l != "string" && "length" in l) {
         Qt(typeof c != "string" && "length" in c);
-        for (var d = 0, m = l.length; d < m; ++d) ze(s, l[d], c[d]);
+        for (var d = 0, m = l.length; d < m; ++d) Ke(s, l[d], c[d]);
       } else {
         var w, k, g = l.indexOf(".");
-        g !== -1 ? (w = l.substr(0, g), (g = l.substr(g + 1)) === "" ? c === void 0 ? y(s) && !isNaN(parseInt(w)) ? s.splice(w, 1) : delete s[w] : s[w] = c : ze(k = (k = s[w]) && W(s, w) ? k : s[w] = {}, g, c)) : c === void 0 ? y(s) && !isNaN(parseInt(l)) ? s.splice(l, 1) : delete s[l] : s[l] = c;
+        g !== -1 ? (w = l.substr(0, g), (g = l.substr(g + 1)) === "" ? c === void 0 ? y(s) && !isNaN(parseInt(w)) ? s.splice(w, 1) : delete s[w] : s[w] = c : Ke(k = (k = s[w]) && W(s, w) ? k : s[w] = {}, g, c)) : c === void 0 ? y(s) && !isNaN(parseInt(l)) ? s.splice(l, 1) : delete s[l] : s[l] = c;
       }
     }
     function nr(s) {
@@ -10284,7 +10268,7 @@ var qc = { exports: {} };
     function ts(s, l) {
       for (var c = h(l), d = c.length, m = !1, w = 0; w < d; ++w) {
         var k = c[w], g = l[k], _ = mt(s, k);
-        g instanceof Fn ? (ze(s, k, g.execute(_)), m = !0) : _ !== g && (ze(s, k, g), m = !0);
+        g instanceof Fn ? (Ke(s, k, g.execute(_)), m = !0) : _ !== g && (Ke(s, k, g), m = !0);
       }
       return m;
     }
@@ -10437,7 +10421,7 @@ var qc = { exports: {} };
         return g.numFailures ? Q.reject(g.failures[0]) : g.lastResult;
       }).then(function(g) {
         if (w) try {
-          ze(s, w, g);
+          Ke(s, w, g);
         } catch {
         }
         return g;
@@ -10447,7 +10431,7 @@ var qc = { exports: {} };
       return this._trans("readwrite", function(m) {
         return c.core.get({ trans: m, key: s }).then(function(w) {
           var k = w ?? {};
-          return ts(k, l), d && ze(k, d, s), c.core.mutate({ trans: m, type: "put", values: [k], keys: [s], upsert: !0, updates: { keys: [s], changeSpecs: [l] } }).then(function(g) {
+          return ts(k, l), d && Ke(k, d, s), c.core.mutate({ trans: m, type: "put", values: [k], keys: [s], upsert: !0, updates: { keys: [s], changeSpecs: [l] } }).then(function(g) {
             return g.numFailures ? Q.reject(g.failures[0]) : !!w;
           });
         });
@@ -10462,7 +10446,7 @@ var qc = { exports: {} };
         return g.numFailures ? Q.reject(g.failures[0]) : g.lastResult;
       }).then(function(g) {
         if (w) try {
-          ze(s, w, g);
+          Ke(s, w, g);
         } catch {
         }
         return g;
@@ -10535,7 +10519,7 @@ var qc = { exports: {} };
                 var B = F[L], q = C[B];
                 if (B === l.schema.primKey.keyPath) {
                   if (be(q, R) !== 0) throw new le.Constraint("Cannot update primary key in bulkUpdate()");
-                } else ze(N, B, q);
+                } else Ke(N, B, q);
               }
               w.push(T), _.push(R), E.push(N);
             }
@@ -10638,9 +10622,9 @@ var qc = { exports: {} };
         }, function(T) {
           return _.fail(T);
         }) || ((O = "" + (A = _.primaryKey)) == "[object ArrayBuffer]" && (O = "" + new Uint8Array(A)), W(m, O)) || (m[O] = !0, l(g, _, E));
-      }, Promise.all([s.or._iterate(w, c), Kn(wi(s, d, c), s.algorithm, w, !s.keysOnly && s.valueMapper)])) : Kn(wi(s, d, c), pn(s.algorithm, k), l, !s.keysOnly && s.valueMapper);
+      }, Promise.all([s.or._iterate(w, c), zn(wi(s, d, c), s.algorithm, w, !s.keysOnly && s.valueMapper)])) : zn(wi(s, d, c), pn(s.algorithm, k), l, !s.keysOnly && s.valueMapper);
     }
-    function Kn(s, l, c, d) {
+    function zn(s, l, c, d) {
       var m = Fe(d ? function(w, k, g) {
         return c(d(w), k, g);
       } : c);
@@ -10829,17 +10813,17 @@ var qc = { exports: {} };
           function L(B) {
             var q = Math.min(E, N.length - B), H = N.slice(B, B + q);
             return (C ? Promise.resolve([]) : k.getMany({ trans: d, keys: H, cache: "immutable" })).then(function(X) {
-              var Z = [], z = [], ne = g ? [] : null, ee = C ? H : [];
+              var Z = [], K = [], ne = g ? [] : null, ee = C ? H : [];
               if (!C) for (var V = 0; V < q; ++V) {
                 var re = X[V], _e = { value: An(re), primKey: N[B + V] };
-                w.call(_e, _e.value, _e) !== !1 && (_e.value == null ? ee.push(N[B + V]) : g || be(_(re), _(_e.value)) === 0 ? (z.push(_e.value), g && ne.push(N[B + V])) : (ee.push(N[B + V]), Z.push(_e.value)));
+                w.call(_e, _e.value, _e) !== !1 && (_e.value == null ? ee.push(N[B + V]) : g || be(_(re), _(_e.value)) === 0 ? (K.push(_e.value), g && ne.push(N[B + V])) : (ee.push(N[B + V]), Z.push(_e.value)));
               }
               return Promise.resolve(0 < Z.length && k.mutate({ trans: d, type: "add", values: Z }).then(function(Ae) {
                 for (var ue in Ae.failures) ee.splice(parseInt(ue), 1);
                 m(Z.length, Ae);
               })).then(function() {
-                return (0 < z.length || F && typeof s == "object") && k.mutate({ trans: d, type: "put", keys: ne, values: z, criteria: F, changeSpec: typeof s != "function" && s, isAdditionalChunk: 0 < B }).then(function(Ae) {
-                  return m(z.length, Ae);
+                return (0 < K.length || F && typeof s == "object") && k.mutate({ trans: d, type: "put", keys: ne, values: K, criteria: F, changeSpec: typeof s != "function" && s, isAdditionalChunk: 0 < B }).then(function(Ae) {
+                  return m(K.length, Ae);
                 });
               }).then(function() {
                 return (0 < ee.length || F && C) && k.mutate({ trans: d, type: "delete", keys: ee, criteria: F, isAdditionalChunk: 0 < B }).then(function(Ae) {
@@ -10889,7 +10873,7 @@ var qc = { exports: {} };
     function ot(s, l, c) {
       return s = s instanceof rs ? new s.Collection(s) : s, s._ctx.error = new (c || TypeError)(l), s;
     }
-    function zn(s) {
+    function Kn(s) {
       return new s.Collection(s, function() {
         return uo("");
       }).limit(0);
@@ -10932,13 +10916,13 @@ var qc = { exports: {} };
           var q = w(B);
           if (l(q, _, C)) return !0;
           for (var H = null, X = C; X < O; ++X) {
-            var Z = ((z, ne, ee, V, re, _e) => {
-              for (var Ae = Math.min(z.length, V.length), ue = -1, de = 0; de < Ae; ++de) {
+            var Z = ((K, ne, ee, V, re, _e) => {
+              for (var Ae = Math.min(K.length, V.length), ue = -1, de = 0; de < Ae; ++de) {
                 var Ne = ne[de];
-                if (Ne !== V[de]) return re(z[de], ee[de]) < 0 ? z.substr(0, de) + ee[de] + ee.substr(de + 1) : re(z[de], V[de]) < 0 ? z.substr(0, de) + V[de] + ee.substr(de + 1) : 0 <= ue ? z.substr(0, ue) + ne[ue] + ee.substr(ue + 1) : null;
-                re(z[de], Ne) < 0 && (ue = de);
+                if (Ne !== V[de]) return re(K[de], ee[de]) < 0 ? K.substr(0, de) + ee[de] + ee.substr(de + 1) : re(K[de], V[de]) < 0 ? K.substr(0, de) + V[de] + ee.substr(de + 1) : 0 <= ue ? K.substr(0, ue) + ne[ue] + ee.substr(ue + 1) : null;
+                re(K[de], Ne) < 0 && (ue = de);
               }
-              return Ae < V.length && _e === "next" ? z + ee.substr(z.length) : Ae < z.length && _e === "prev" ? z.substr(0, ee.length) : ue < 0 ? null : z.substr(0, ue) + V[ue] + ee.substr(ue + 1);
+              return Ae < V.length && _e === "next" ? K + ee.substr(K.length) : Ae < K.length && _e === "prev" ? K.substr(0, ee.length) : ue < 0 ? null : K.substr(0, ue) + V[ue] + ee.substr(ue + 1);
             })(B, q, g[X], _[X], k, E);
             Z === null && H === null ? C = X + 1 : (H === null || 0 < k(H, Z)) && (H = Z);
           }
@@ -10960,7 +10944,7 @@ var qc = { exports: {} };
     }, enumerable: !1, configurable: !0 }), Ze.prototype.between = function(s, l, c, d) {
       c = c !== !1, d = d === !0;
       try {
-        return 0 < this._cmp(s, l) || this._cmp(s, l) === 0 && (c || d) && (!c || !d) ? zn(this) : new this.Collection(this, function() {
+        return 0 < this._cmp(s, l) || this._cmp(s, l) === 0 && (c || d) && (!c || !d) ? Kn(this) : new this.Collection(this, function() {
           return dn(s, l, !c, !d);
         });
       } catch {
@@ -10998,12 +10982,12 @@ var qc = { exports: {} };
       }, [s], "");
     }, Ze.prototype.anyOfIgnoreCase = function() {
       var s = St.apply(rr, arguments);
-      return s.length === 0 ? zn(this) : bi(this, function(l, c) {
+      return s.length === 0 ? Kn(this) : bi(this, function(l, c) {
         return c.indexOf(l) !== -1;
       }, s, "");
     }, Ze.prototype.startsWithAnyOfIgnoreCase = function() {
       var s = St.apply(rr, arguments);
-      return s.length === 0 ? zn(this) : bi(this, function(l, c) {
+      return s.length === 0 ? Kn(this) : bi(this, function(l, c) {
         return c.some(function(d) {
           return l.indexOf(d) === 0;
         });
@@ -11015,7 +10999,7 @@ var qc = { exports: {} };
       } catch {
         return ot(this, Et);
       }
-      return d.length === 0 ? zn(this) : ((s = new this.Collection(this, function() {
+      return d.length === 0 ? Kn(this) : ((s = new this.Collection(this, function() {
         return dn(d[0], d[d.length - 1]);
       }))._ondirectionchange = function(w) {
         m = w === "next" ? c._ascending : c._descending, d.sort(m);
@@ -11041,7 +11025,7 @@ var qc = { exports: {} };
       return l.push([s[s.length - 1], this.db._maxKey]), this.inAnyRange(l, { includeLowers: !1, includeUppers: !1 });
     }, Ze.prototype.inAnyRange = function(s, F) {
       var c = this, d = this._cmp, m = this._ascending, w = this._descending, k = this._min, g = this._max;
-      if (s.length === 0) return zn(this);
+      if (s.length === 0) return Kn(this);
       if (!s.every(function(B) {
         return B[0] !== void 0 && B[1] !== void 0 && m(B[0], B[1]) <= 0;
       })) return ot(this, "First argument to inAnyRange() must be an Array of two-value Arrays [lower,upper] where upper must not be lower than lower", le.InvalidArgument);
@@ -11086,7 +11070,7 @@ var qc = { exports: {} };
       var s = St.apply(rr, arguments);
       return s.every(function(l) {
         return typeof l == "string";
-      }) ? s.length === 0 ? zn(this) : this.inAnyRange(s.map(function(l) {
+      }) ? s.length === 0 ? Kn(this) : this.inAnyRange(s.map(function(l) {
         return [l, l + Bn];
       })) : ot(this, "startsWithAnyOf() only works with strings");
     };
@@ -11095,13 +11079,13 @@ var qc = { exports: {} };
     }
     function Jt(s) {
       return Fe(function(l) {
-        return Kr(l), s(l.target.error), !1;
+        return zr(l), s(l.target.error), !1;
       });
     }
-    function Kr(s) {
+    function zr(s) {
       s.stopPropagation && s.stopPropagation(), s.preventDefault && s.preventDefault();
     }
-    var zr = "storagemutated", qr = "x-storagemutated-1", gn = Br(null, zr), wa = (Gt.prototype._lock = function() {
+    var Kr = "storagemutated", qr = "x-storagemutated-1", gn = Br(null, Kr), wa = (Gt.prototype._lock = function() {
       return Qt(!oe.global), ++this._reculock, this._reculock !== 1 || oe.global || (oe.lockOwnerFor = this), this;
     }, Gt.prototype._unlock = function() {
       if (Qt(!oe.global), --this._reculock == 0) for (oe.global || (oe.lockOwnerFor = null); 0 < this._blockedFuncs.length && !this._locked(); ) {
@@ -11128,9 +11112,9 @@ var qc = { exports: {} };
         }
         if (!this.active) throw new le.TransactionInactive();
         Qt(this._completion._state === null), (s = this.idbtrans = s || (this.db.core || c).transaction(this.storeNames, this.mode, { durability: this.chromeTransactionDurability })).onerror = Fe(function(m) {
-          Kr(m), l._reject(s.error);
+          zr(m), l._reject(s.error);
         }), s.onabort = Fe(function(m) {
-          Kr(m), l.active && l._reject(new le.Abort(s.error)), l.active = !1, l.on("abort").fire(m);
+          zr(m), l.active && l._reject(new le.Abort(s.error)), l.active = !1, l.on("abort").fire(m);
         }), s.oncomplete = Fe(function() {
           l.active = !1, l._resolve(), "mutatedParts" in s && gn.storagemutated.fire(s.mutatedParts);
         });
@@ -11240,21 +11224,21 @@ var qc = { exports: {} };
           var C = R.trans, N = R.type, L = R.keys, F = R.values, B = R.range;
           return new Promise(function(q, H) {
             q = Fe(q);
-            var X = C.objectStore(T), Z = X.keyPath == null, z = N === "put" || N === "add";
-            if (!z && N !== "delete" && N !== "deleteRange") throw new Error("Invalid operation type: " + N);
+            var X = C.objectStore(T), Z = X.keyPath == null, K = N === "put" || N === "add";
+            if (!K && N !== "delete" && N !== "deleteRange") throw new Error("Invalid operation type: " + N);
             var ne, ee = (L || F || { length: 1 }).length;
             if (L && F && L.length !== F.length) throw new Error("Given keys array must have same length as given values array.");
             if (ee === 0) return q({ numFailures: 0, failures: {}, results: [], lastResult: void 0 });
             function V(Be) {
-              ++Ae, Kr(Be);
+              ++Ae, zr(Be);
             }
             var re = [], _e = [], Ae = 0;
             if (N === "deleteRange") {
               if (B.type === 4) return q({ numFailures: Ae, failures: _e, results: [], lastResult: void 0 });
               B.type === 3 ? re.push(ne = X.clear()) : re.push(ne = X.delete(d(B)));
             } else {
-              var Z = z ? Z ? [F, L] : [F, null] : [L, null], ue = Z[0], de = Z[1];
-              if (z) for (var Ne = 0; Ne < ee; ++Ne) re.push(ne = de && de[Ne] !== void 0 ? X[N](ue[Ne], de[Ne]) : X[N](ue[Ne])), ne.onerror = V;
+              var Z = K ? Z ? [F, L] : [F, null] : [L, null], ue = Z[0], de = Z[1];
+              if (K) for (var Ne = 0; Ne < ee; ++Ne) re.push(ne = de && de[Ne] !== void 0 ? X[N](ue[Ne], de[Ne]) : X[N](ue[Ne])), ne.onerror = V;
               else for (Ne = 0; Ne < ee; ++Ne) re.push(ne = X[N](ue[Ne])), ne.onerror = V;
             }
             function wt(Be) {
@@ -11272,8 +11256,8 @@ var qc = { exports: {} };
           var C = R.trans, N = R.keys;
           return new Promise(function(L, F) {
             L = Fe(L);
-            for (var B, q = C.objectStore(T), H = N.length, X = new Array(H), Z = 0, z = 0, ne = function(re) {
-              re = re.target, X[re._pos] = re.result, ++z === Z && L(X);
+            for (var B, q = C.objectStore(T), H = N.length, X = new Array(H), Z = 0, K = 0, ne = function(re) {
+              re = re.target, X[re._pos] = re.result, ++K === Z && L(X);
             }, ee = Jt(F), V = 0; V < H; ++V) N[V] != null && ((B = q.get(N[V]))._pos = V, B.onsuccess = ne, B.onerror = ee, ++Z);
             Z === 0 && L(X);
           });
@@ -11289,11 +11273,11 @@ var qc = { exports: {} };
         }, query: (O = g, function(R) {
           return new Promise(function(C, N) {
             C = Fe(C);
-            var L, F, B, z = R.trans, q = R.values, H = R.limit, Z = R.query, X = H === 1 / 0 ? void 0 : H, ne = Z.index, Z = Z.range, z = z.objectStore(T), z = ne.isPrimaryKey ? z : z.index(ne.name), ne = d(Z);
+            var L, F, B, K = R.trans, q = R.values, H = R.limit, Z = R.query, X = H === 1 / 0 ? void 0 : H, ne = Z.index, Z = Z.range, K = K.objectStore(T), K = ne.isPrimaryKey ? K : K.index(ne.name), ne = d(Z);
             if (H === 0) return C({ result: [] });
-            O ? ((Z = q ? z.getAll(ne, X) : z.getAllKeys(ne, X)).onsuccess = function(ee) {
+            O ? ((Z = q ? K.getAll(ne, X) : K.getAllKeys(ne, X)).onsuccess = function(ee) {
               return C({ result: ee.target.result });
-            }, Z.onerror = Jt(N)) : (L = 0, F = !q && "openKeyCursor" in z ? z.openKeyCursor(ne) : z.openCursor(ne), B = [], F.onsuccess = function(ee) {
+            }, Z.onerror = Jt(N)) : (L = 0, F = !q && "openKeyCursor" in K ? K.openKeyCursor(ne) : K.openCursor(ne), B = [], F.onsuccess = function(ee) {
               var V = F.result;
               return !V || (B.push(q ? V.value : V.primaryKey), ++L === H) ? C({ result: B }) : void V.continue();
             }, F.onerror = Jt(N));
@@ -11302,7 +11286,7 @@ var qc = { exports: {} };
           var C = R.trans, N = R.values, L = R.query, F = R.reverse, B = R.unique;
           return new Promise(function(q, H) {
             q = Fe(q);
-            var z = L.index, X = L.range, Z = C.objectStore(T), Z = z.isPrimaryKey ? Z : Z.index(z.name), z = F ? B ? "prevunique" : "prev" : B ? "nextunique" : "next", ne = !N && "openKeyCursor" in Z ? Z.openKeyCursor(d(X), z) : Z.openCursor(d(X), z);
+            var K = L.index, X = L.range, Z = C.objectStore(T), Z = K.isPrimaryKey ? Z : Z.index(K.name), K = F ? B ? "prevunique" : "prev" : B ? "nextunique" : "next", ne = !N && "openKeyCursor" in Z ? Z.openKeyCursor(d(X), K) : Z.openCursor(d(X), K);
             ne.onerror = Jt(H), ne.onsuccess = Fe(function(ee) {
               var V, re, _e, Ae, ue = ne.result;
               ue ? (ue.___id = ++ba, ue.done = !1, V = ue.continue.bind(ue), re = (re = ue.continuePrimaryKey) && re.bind(ue), _e = ue.advance.bind(ue), Ae = function() {
@@ -11417,7 +11401,7 @@ var qc = { exports: {} };
             return B._cfg.version >= T;
           })).length === 0 ? Q.resolve() : (L.forEach(function(B) {
             N.push(function() {
-              var q, H, X, Z = F, z = B._cfg.dbschema, ne = ($r(O, Z, C), $r(O, z, C), F = O._dbSchema = z, Jr(Z, z)), ee = (ne.add.forEach(function(V) {
+              var q, H, X, Z = F, K = B._cfg.dbschema, ne = ($r(O, Z, C), $r(O, K, C), F = O._dbSchema = K, Jr(Z, K)), ee = (ne.add.forEach(function(V) {
                 at(C, V[0], V[1].primKey, V[1].indexes);
               }), ne.change.forEach(function(V) {
                 if (V.recreate) throw new le.Upgrade("Not yet support for changing primary key");
@@ -11430,18 +11414,18 @@ var qc = { exports: {} };
                   return re.deleteIndex(_e);
                 });
               }), B._cfg.contentUpgrade);
-              if (ee && B._cfg.version > T) return Ur(O, C), R._memoizedTables = {}, q = nr(z), ne.del.forEach(function(V) {
+              if (ee && B._cfg.version > T) return Ur(O, C), R._memoizedTables = {}, q = nr(K), ne.del.forEach(function(V) {
                 q[V] = Z[V];
-              }), Ve(O, [O.Transaction.prototype]), xi(O, [O.Transaction.prototype], h(q), q), R.schema = q, (H = kt(ee)) && pr(), z = Q.follow(function() {
+              }), Ve(O, [O.Transaction.prototype]), xi(O, [O.Transaction.prototype], h(q), q), R.schema = q, (H = kt(ee)) && pr(), K = Q.follow(function() {
                 var V;
                 (X = ee(R)) && H && (V = cn.bind(null, null), X.then(V, V));
-              }), X && typeof X.then == "function" ? Q.resolve(X) : z.then(function() {
+              }), X && typeof X.then == "function" ? Q.resolve(X) : K.then(function() {
                 return X;
               });
             }), N.push(function(q) {
               var H, X, Z = B._cfg.dbschema;
-              H = Z, X = q, [].slice.call(X.db.objectStoreNames).forEach(function(z) {
-                return H[z] == null && X.db.deleteObjectStore(z);
+              H = Z, X = q, [].slice.call(X.db.objectStoreNames).forEach(function(K) {
+                return H[K] == null && X.db.deleteObjectStore(K);
               }), Ve(O, [O.Transaction.prototype]), xi(O, [O.Transaction.prototype], O._storeNames, O._dbSchema), R.schema = O._dbSchema;
             }), N.push(function(q) {
               O.idbdb.objectStoreNames.contains("$meta") && (Math.ceil(O.idbdb.version / 10) === B._cfg.version ? (O.idbdb.deleteObjectStore("$meta"), delete O._dbSchema.$meta, O._storeNames = O._storeNames.filter(function(H) {
@@ -11578,9 +11562,9 @@ var qc = { exports: {} };
     function _i(s) {
       return !("from" in s);
     }
-    var Ke = function(s, l) {
+    var ze = function(s, l) {
       var c;
-      if (!this) return c = new Ke(), s && "d" in s && b(c, s), c;
+      if (!this) return c = new ze(), s && "d" in s && b(c, s), c;
       b(this, arguments.length ? { d: 1, from: s, to: 1 < arguments.length ? l : s } : { d: 0 });
     };
     function mn(s, l, c) {
@@ -11650,7 +11634,7 @@ var qc = { exports: {} };
         return l[c] && De(l[c], s[c]);
       });
     }
-    G(Ke.prototype, ((yt = { add: function(s) {
+    G(ze.prototype, ((yt = { add: function(s) {
       return Wn(this, s), this;
     }, addKey: function(s) {
       return mn(this, s, s), this;
@@ -11715,14 +11699,14 @@ var qc = { exports: {} };
           if (!N) throw new le.MissingAPI();
           N.onerror = Jt(R), N.onblocked = Fe(s._fireOnBlocked), N.onupgradeneeded = Fe(function(L) {
             var F;
-            A = N.transaction, l.autoSchema && !s._options.allowEmptyDB ? (N.onerror = Kr, A.abort(), N.result.close(), (F = c.deleteDatabase(C)).onsuccess = F.onerror = Fe(function() {
+            A = N.transaction, l.autoSchema && !s._options.allowEmptyDB ? (N.onerror = zr, A.abort(), N.result.close(), (F = c.deleteDatabase(C)).onsuccess = F.onerror = Fe(function() {
               R(new le.NoSuchDatabase("Database ".concat(C, " doesnt exist")));
             })) : (A.onerror = Jt(R), F = L.oldVersion > Math.pow(2, 62) ? 0 : L.oldVersion, O = F < 1, s.idbdb = N.result, w && co(s, A), qn(s, F / 10, A, R));
           }, R), N.onsuccess = Fe(function() {
             A = null;
-            var L, F, B, q, H, X, Z = s.idbdb = N.result, z = gt(Z.objectStoreNames);
-            if (0 < z.length) try {
-              var ne = Z.transaction((H = z).length === 1 ? H[0] : H, "readonly");
+            var L, F, B, q, H, X, Z = s.idbdb = N.result, K = gt(Z.objectStoreNames);
+            if (0 < K.length) try {
+              var ne = Z.transaction((H = K).length === 1 ? H[0] : H, "readonly");
               if (l.autoSchema) X = Z, q = ne, (B = s).verno = X.version / 10, q = B._dbSchema = Hr(0, X, q), B._storeNames = gt(X.objectStoreNames, 0), xi(B, [B._allTables], h(q), q);
               else if ($r(s, s._dbSchema, ne), F = ne, ((F = Jr(Hr(0, (L = s).idbdb, F), L._dbSchema)).add.length || F.change.some(function(ee) {
                 return ee.add.length || ee.change.length;
@@ -11734,7 +11718,7 @@ var qc = { exports: {} };
               l.vcFired = !0, s.on("versionchange").fire(ee);
             }), Z.onclose = Fe(function() {
               s.close({ disableAutoOpen: !1 });
-            }), O && (z = s._deps, H = C, ut(X = z.indexedDB) || H === gi || fs(X, z.IDBKeyRange).put({ name: H }).catch(Oe)), T();
+            }), O && (K = s._deps, H = C, ut(X = K.indexedDB) || H === gi || fs(X, K.IDBKeyRange).put({ name: H }).catch(Oe)), T();
           }, R);
         }).catch(function(T) {
           switch (T == null ? void 0 : T.name) {
@@ -11779,9 +11763,9 @@ var qc = { exports: {} };
         var T;
         return O && (T = {}, s.tables.forEach(function(R) {
           R.schema.indexes.forEach(function(C) {
-            C.name && (T["idb://".concat(s.name, "/").concat(R.name, "/").concat(C.name)] = new Ke(-1 / 0, [[[]]]));
-          }), T["idb://".concat(s.name, "/").concat(R.name, "/")] = T["idb://".concat(s.name, "/").concat(R.name, "/:dels")] = new Ke(-1 / 0, [[[]]]);
-        }), gn(zr).fire(T), yn(T, !0)), s;
+            C.name && (T["idb://".concat(s.name, "/").concat(R.name, "/").concat(C.name)] = new ze(-1 / 0, [[[]]]));
+          }), T["idb://".concat(s.name, "/").concat(R.name, "/")] = T["idb://".concat(s.name, "/").concat(R.name, "/:dels")] = new ze(-1 / 0, [[[]]]);
+        }), gn(Kr).fire(T), yn(T, !0)), s;
       });
     }
     function Ei(s) {
@@ -11900,15 +11884,15 @@ var qc = { exports: {} };
             var T, R, C, N = oe.trans, L = O.keys || gs(d, O);
             if (L) return (O = O.type === "add" || O.type === "put" ? i(i({}, O), { keys: L }) : i({}, O)).type !== "delete" && (O.values = a([], O.values)), O.keys && (O.keys = a([], O.keys)), T = c, C = L, ((R = O).type === "add" ? Promise.resolve([]) : T.getMany({ trans: R.trans, keys: C, cache: "immutable" })).then(function(F) {
               var B = L.map(function(q, H) {
-                var X, Z, z, ne = F[H], ee = { onerror: null, onsuccess: null };
-                return O.type === "delete" ? g.fire.call(ee, q, ne, N) : O.type === "add" || ne === void 0 ? (X = _.fire.call(ee, q, O.values[H], N), q == null && X != null && (O.keys[H] = q = X, d.outbound || ze(O.values[H], d.keyPath, q))) : (X = Ai(ne, O.values[H]), (Z = E.fire.call(ee, X, q, ne, N)) && (z = O.values[H], Object.keys(Z).forEach(function(V) {
-                  W(z, V) ? z[V] = Z[V] : ze(z, V, Z[V]);
+                var X, Z, K, ne = F[H], ee = { onerror: null, onsuccess: null };
+                return O.type === "delete" ? g.fire.call(ee, q, ne, N) : O.type === "add" || ne === void 0 ? (X = _.fire.call(ee, q, O.values[H], N), q == null && X != null && (O.keys[H] = q = X, d.outbound || Ke(O.values[H], d.keyPath, q))) : (X = Ai(ne, O.values[H]), (Z = E.fire.call(ee, X, q, ne, N)) && (K = O.values[H], Object.keys(Z).forEach(function(V) {
+                  W(K, V) ? K[V] = Z[V] : Ke(K, V, Z[V]);
                 }))), ee;
               });
               return c.mutate(O).then(function(q) {
-                for (var H = q.failures, X = q.results, Z = q.numFailures, q = q.lastResult, z = 0; z < L.length; ++z) {
-                  var ne = (X || L)[z], ee = B[z];
-                  ne == null ? ee.onerror && ee.onerror(H[z]) : ee.onsuccess && ee.onsuccess(O.type === "put" && F[z] ? O.values[z] : ne);
+                for (var H = q.failures, X = q.results, Z = q.numFailures, q = q.lastResult, K = 0; K < L.length; ++K) {
+                  var ne = (X || L)[K], ee = B[K];
+                  ne == null ? ee.onerror && ee.onerror(H[K]) : ee.onsuccess && ee.onsuccess(O.type === "put" && F[K] ? O.values[K] : ne);
                 }
                 return { failures: H, results: X, numFailures: Z, lastResult: q };
               }).catch(function(q) {
@@ -11959,25 +11943,25 @@ var qc = { exports: {} };
       }
     }
     var vs = { stack: "dbcore", level: 0, name: "Observability", create: function(s) {
-      var l = s.schema.name, c = new Ke(s.MIN_KEY, s.MAX_KEY);
+      var l = s.schema.name, c = new ze(s.MIN_KEY, s.MAX_KEY);
       return i(i({}, s), { transaction: function(d, m, w) {
         if (oe.subscr && m !== "readonly") throw new le.ReadOnly("Readwrite transaction in liveQuery context. Querier source: ".concat(oe.querier));
         return s.transaction(d, m, w);
       }, table: function(d) {
         function m(L) {
           var N, L = L.query;
-          return [N = L.index, new Ke((N = (L = L.range).lower) != null ? N : s.MIN_KEY, (N = L.upper) != null ? N : s.MAX_KEY)];
+          return [N = L.index, new ze((N = (L = L.range).lower) != null ? N : s.MIN_KEY, (N = L.upper) != null ? N : s.MAX_KEY)];
         }
         var w = s.table(d), k = w.schema, g = k.primaryKey, _ = k.indexes, E = g.extractKey, A = g.outbound, O = g.autoIncrement && _.filter(function(C) {
           return C.compound && C.keyPath.includes(g.keyPath);
         }), T = i(i({}, w), { mutate: function(C) {
           function N(re) {
-            return re = "idb://".concat(l, "/").concat(d, "/").concat(re), H[re] || (H[re] = new Ke());
+            return re = "idb://".concat(l, "/").concat(d, "/").concat(re), H[re] || (H[re] = new ze());
           }
-          var L, F, B, q = C.trans, H = C.mutatedParts || (C.mutatedParts = {}), X = N(""), Z = N(":dels"), z = C.type, ee = C.type === "deleteRange" ? [C.range] : C.type === "delete" ? [C.keys] : C.values.length < 50 ? [gs(g, C).filter(function(re) {
+          var L, F, B, q = C.trans, H = C.mutatedParts || (C.mutatedParts = {}), X = N(""), Z = N(":dels"), K = C.type, ee = C.type === "deleteRange" ? [C.range] : C.type === "delete" ? [C.keys] : C.values.length < 50 ? [gs(g, C).filter(function(re) {
             return re;
           }), C.values] : [], ne = ee[0], ee = ee[1], V = C.trans._cache;
-          return y(ne) ? (X.addKeys(ne), (z = z === "delete" || ne.length === ee.length ? Oi(ne, V) : null) || Z.addKeys(ne), (z || ee) && (L = N, F = z, B = ee, k.indexes.forEach(function(re) {
+          return y(ne) ? (X.addKeys(ne), (K = K === "delete" || ne.length === ee.length ? Oi(ne, V) : null) || Z.addKeys(ne), (K || ee) && (L = N, F = K, B = ee, k.indexes.forEach(function(re) {
             var _e = L(re.name || "");
             function Ae(de) {
               return de != null ? re.extractKey(de) : null;
@@ -11991,7 +11975,7 @@ var qc = { exports: {} };
               var wt = F && Ae(F[Be]), Be = B && Ae(B[Be]);
               be(wt, Be) !== 0 && (wt != null && ue(wt), Be != null) && ue(Be);
             });
-          }))) : ne ? (ee = { from: (V = ne.lower) != null ? V : s.MIN_KEY, to: (z = ne.upper) != null ? z : s.MAX_KEY }, Z.add(ee), X.add(ee)) : (X.add(c), Z.add(c), k.indexes.forEach(function(re) {
+          }))) : ne ? (ee = { from: (V = ne.lower) != null ? V : s.MIN_KEY, to: (K = ne.upper) != null ? K : s.MAX_KEY }, Z.add(ee), X.add(ee)) : (X.add(c), Z.add(c), k.indexes.forEach(function(re) {
             return N(re.name).add(c);
           })), w.mutate(C).then(function(re) {
             return !ne || C.type !== "add" && C.type !== "put" || (X.addKeys(re.results), O && O.forEach(function(_e) {
@@ -12004,16 +11988,16 @@ var qc = { exports: {} };
             })), q.mutatedParts = yr(q.mutatedParts || {}, H), re;
           });
         } }), R = { get: function(C) {
-          return [g, new Ke(C.key)];
+          return [g, new ze(C.key)];
         }, getMany: function(C) {
-          return [g, new Ke().addKeys(C.keys)];
+          return [g, new ze().addKeys(C.keys)];
         }, count: m, query: m, openCursor: m };
         return h(R).forEach(function(C) {
           T[C] = function(N) {
             var L = oe.subscr, F = !!L, B = ys(oe, w) && lt(C, N) ? N.obsSet = {} : L;
             if (F) {
               var q, L = function(ee) {
-                return ee = "idb://".concat(l, "/").concat(d, "/").concat(ee), B[ee] || (B[ee] = new Ke());
+                return ee = "idb://".concat(l, "/").concat(d, "/").concat(ee), B[ee] || (B[ee] = new ze());
               }, H = L(""), X = L(":dels"), F = R[C](N), Z = F[0], F = F[1];
               if ((C === "query" && Z.isPrimaryKey && !N.values ? X : L(Z.name || "")).add(F), !Z.isPrimaryKey) {
                 if (C !== "count") return q = C === "query" && A && N.values && w.query(i(i({}, N), { values: !1 })), w[C].apply(this, arguments).then(function(ee) {
@@ -12060,7 +12044,7 @@ var qc = { exports: {} };
       var k, g, _, E, A, O;
       return !c || c.length === 0 || (k = l.query.index, g = k.multiEntry, _ = l.query.range, E = d.schema.primaryKey.extractKey, A = k.extractKey, O = (k.lowLevelIndex || k).extractKey, (d = c.reduce(function(T, R) {
         var C = T, N = [];
-        if (R.type === "add" || R.type === "put") for (var L = new Ke(), F = R.values.length - 1; 0 <= F; --F) {
+        if (R.type === "add" || R.type === "put") for (var L = new ze(), F = R.values.length - 1; 0 <= F; --F) {
           var B, q = R.values[F], H = E(q);
           !L.hasKey(H) && (B = A(q), g && y(B) ? B.some(function(ee) {
             return Ii(ee, _);
@@ -12068,7 +12052,7 @@ var qc = { exports: {} };
         }
         switch (R.type) {
           case "add":
-            var X = new Ke().addKeys(l.values ? T.map(function(V) {
+            var X = new ze().addKeys(l.values ? T.map(function(V) {
               return E(V);
             }) : T), C = T.concat(l.values ? N.filter(function(V) {
               return V = E(V), !X.hasKey(V) && (X.addKey(V), !0);
@@ -12079,7 +12063,7 @@ var qc = { exports: {} };
             }));
             break;
           case "put":
-            var Z = new Ke().addKeys(R.values.map(function(V) {
+            var Z = new ze().addKeys(R.values.map(function(V) {
               return E(V);
             }));
             C = T.filter(function(V) {
@@ -12089,9 +12073,9 @@ var qc = { exports: {} };
             }));
             break;
           case "delete":
-            var z = new Ke().addKeys(R.keys);
+            var K = new ze().addKeys(R.keys);
             C = T.filter(function(V) {
-              return !z.hasKey(l.values ? E(V) : V);
+              return !K.hasKey(l.values ? E(V) : V);
             });
             break;
           case "deleteRange":
@@ -12150,16 +12134,16 @@ var qc = { exports: {} };
                   var C = s.table(T), N = R.optimisticOps.filter(function(re) {
                     return re.trans === g;
                   });
-                  if (g._explicit && _ && g.mutatedParts) for (var L = 0, F = Object.values(R.queries.query); L < F.length; L++) for (var B = 0, q = (Z = F[L]).slice(); B < q.length; B++) hs((z = q[B]).obsSet, g.mutatedParts) && (st(Z, z), z.subscribers.forEach(function(re) {
+                  if (g._explicit && _ && g.mutatedParts) for (var L = 0, F = Object.values(R.queries.query); L < F.length; L++) for (var B = 0, q = (Z = F[L]).slice(); B < q.length; B++) hs((K = q[B]).obsSet, g.mutatedParts) && (st(Z, K), K.subscribers.forEach(function(re) {
                     return E.add(re);
                   }));
                   else if (0 < N.length) {
                     R.optimisticOps = R.optimisticOps.filter(function(re) {
                       return re.trans !== g;
                     });
-                    for (var H = 0, X = Object.values(R.queries.query); H < X.length; H++) for (var Z, z, ne, ee = 0, V = (Z = X[H]).slice(); ee < V.length; ee++) (z = V[ee]).res != null && g.mutatedParts && (_ && !z.dirty ? (ne = Object.isFrozen(z.res), ne = ws(z.res, z.req, N, C, z, ne), z.dirty ? (st(Z, z), z.subscribers.forEach(function(re) {
+                    for (var H = 0, X = Object.values(R.queries.query); H < X.length; H++) for (var Z, K, ne, ee = 0, V = (Z = X[H]).slice(); ee < V.length; ee++) (K = V[ee]).res != null && g.mutatedParts && (_ && !K.dirty ? (ne = Object.isFrozen(K.res), ne = ws(K.res, K.req, N, C, K, ne), K.dirty ? (st(Z, K), K.subscribers.forEach(function(re) {
                       return E.add(re);
-                    })) : ne !== z.res && (z.res = ne, z.promise = Q.resolve({ result: ne }))) : (z.dirty && st(Z, z), z.subscribers.forEach(function(re) {
+                    })) : ne !== K.res && (K.res = ne, K.promise = Q.resolve({ result: ne }))) : (K.dirty && st(Z, K), K.subscribers.forEach(function(re) {
                       return E.add(re);
                     })));
                   }
@@ -12184,7 +12168,7 @@ var qc = { exports: {} };
           })) : g.then(function(_) {
             var E = wr(0, i(i({}, w), { values: w.values.map(function(A, O) {
               var T;
-              return _.failures[O] ? A : (ze(T = (T = m.keyPath) != null && T.includes(".") ? An(A) : i({}, A), m.keyPath, _.results[O]), T);
+              return _.failures[O] ? A : (Ke(T = (T = m.keyPath) != null && T.includes(".") ? An(A) : i({}, A), m.keyPath, _.results[O]), T);
             }) }), _);
             k.optimisticOps.push(E), queueMicrotask(function() {
               return w.mutatedParts && Jn(w.mutatedParts);
@@ -12505,7 +12489,7 @@ var qc = { exports: {} };
             c = !0, l = B, g || L.signal.aborted || (_ = {}, ((q) => {
               for (var H in q) if (W(q, H)) return;
               return 1;
-            })(E = N) || O || (gn(zr, R), O = !0), Zi(function() {
+            })(E = N) || O || (gn(Kr, R), O = !0), Zi(function() {
               return !g && m.next && m.next(B);
             }));
           }, function(B) {
@@ -12582,15 +12566,15 @@ var qc = { exports: {} };
       return Ge;
     }, set: function(s) {
       ar(s);
-    } }, derive: se, extend: b, props: G, override: je, Events: Br, on: gn, liveQuery: jr, extendObservabilitySet: yr, getByKeyPath: mt, setByKeyPath: ze, delByKeyPath: function(s, l) {
-      typeof l == "string" ? ze(s, l, void 0) : "length" in l && [].map.call(l, function(c) {
-        ze(s, c, void 0);
+    } }, derive: se, extend: b, props: G, override: je, Events: Br, on: gn, liveQuery: jr, extendObservabilitySet: yr, getByKeyPath: mt, setByKeyPath: Ke, delByKeyPath: function(s, l) {
+      typeof l == "string" ? Ke(s, l, void 0) : "length" in l && [].map.call(l, function(c) {
+        Ke(s, c, void 0);
       });
     }, shallowClone: nr, deepClone: An, getObjectDiff: Ai, cmp: be, asap: Wt, minKey: -1 / 0, addons: [], connections: dr, errnames: Tn, dependencies: Ti, cache: Un, semVer: "4.3.0", version: "4.3.0".split(".").map(function(s) {
       return parseInt(s);
     }).reduce(function(s, l, c) {
       return s + l / Math.pow(10, 2 * c);
-    }) })), Gn.maxKey = Ie(Gn.dependencies.IDBKeyRange), typeof dispatchEvent < "u" && typeof addEventListener < "u" && (gn(zr, function(s) {
+    }) })), Gn.maxKey = Ie(Gn.dependencies.IDBKeyRange), typeof dispatchEvent < "u" && typeof addEventListener < "u" && (gn(Kr, function(s) {
       vt || (s = new CustomEvent(qr, { detail: s }), vt = !0, dispatchEvent(s), vt = !1);
     }), addEventListener(qr, function(s) {
       s = s.detail, vt || bs(s);
@@ -12601,7 +12585,7 @@ var qc = { exports: {} };
       (br = new BroadcastChannel(qr)).onmessage = function(s) {
         return s.data && bs(s.data);
       };
-    })(), typeof br.unref == "function" && br.unref(), gn(zr, function(s) {
+    })(), typeof br.unref == "function" && br.unref(), gn(Kr, function(s) {
       vt || br.postMessage(s);
     })), typeof addEventListener < "u" && (addEventListener("pagehide", function(s) {
       if (!ft.disableBfCache && s.persisted) {
@@ -12609,12 +12593,12 @@ var qc = { exports: {} };
         for (var l = 0, c = dr; l < c.length; l++) c[l].close({ disableAutoOpen: !1 });
       }
     }), addEventListener("pageshow", function(s) {
-      !ft.disableBfCache && s.persisted && (Ge && console.debug("Dexie: handling persisted pageshow"), At(), bs({ all: new Ke(-1 / 0, [[]]) }));
+      !ft.disableBfCache && s.persisted && (Ge && console.debug("Dexie: handling persisted pageshow"), At(), bs({ all: new ze(-1 / 0, [[]]) }));
     })), Q.rejectionMapper = function(s, l) {
       return !s || s instanceof ir || s instanceof TypeError || s instanceof SyntaxError || !s.name || !Tr[s.name] ? s : (l = new Tr[s.name](l || s.message, s), "stack" in s && Y(l, "stack", { get: function() {
         return this.inner.stack;
       } }), l);
-    }, ar(Ge), i(ft, Object.freeze({ __proto__: null, Dexie: ft, Entity: no, PropModification: Fn, RangeSet: Ke, add: function(s) {
+    }, ar(Ge), i(ft, Object.freeze({ __proto__: null, Dexie: ft, Entity: no, PropModification: Fn, RangeSet: ze, add: function(s) {
       return new Fn({ add: s });
     }, cmp: be, default: ft, liveQuery: jr, mergeRanges: Wn, rangesOverlap: De, remove: function(s) {
       return new Fn({ remove: s });
@@ -12623,28 +12607,28 @@ var qc = { exports: {} };
     } }), { default: ft }), ft;
   });
 })(qc);
-var _0 = qc.exports;
-const Du = /* @__PURE__ */ d0(_0), Vf = Symbol.for("Dexie"), aa = globalThis[Vf] || (globalThis[Vf] = Du);
+var w0 = qc.exports;
+const Du = /* @__PURE__ */ c0(w0), Vf = Symbol.for("Dexie"), aa = globalThis[Vf] || (globalThis[Vf] = Du);
 if (Du.semVer !== aa.semVer)
   throw new Error(`Two different versions of Dexie loaded in the same app: ${Du.semVer} and ${aa.semVer}`);
 const {
-  liveQuery: $0,
-  mergeRanges: j0,
-  rangesOverlap: V0,
-  RangeSet: Y0,
-  cmp: X0,
-  Entity: Z0,
-  PropModification: Q0,
-  replacePrefix: ew,
-  add: tw,
-  remove: nw,
-  DexieYProvider: rw
-} = aa, S0 = "PPTist", Sn = new aa(`${S0}_${zc}_${(/* @__PURE__ */ new Date()).getTime()}`);
+  liveQuery: J0,
+  mergeRanges: G0,
+  rangesOverlap: H0,
+  RangeSet: $0,
+  cmp: j0,
+  Entity: V0,
+  PropModification: Y0,
+  replacePrefix: X0,
+  add: Z0,
+  remove: Q0,
+  DexieYProvider: ew
+} = aa, b0 = "PPTist", Sn = new aa(`${b0}_${Kc}_${(/* @__PURE__ */ new Date()).getTime()}`);
 Sn.version(1).stores({
   snapshots: "++id",
   writingBoardImgs: "id"
 });
-const iw = Js("snapshot", {
+const tw = Js("snapshot", {
   state: () => ({
     snapshotCursor: -1,
     // 历史快照指针
@@ -12705,7 +12689,7 @@ const iw = Js("snapshot", {
       u.setSlides(h), u.updateSlideIndex(y), this.setSnapshotCursor(n), t.setActiveElementIdList([]);
     }
   }
-}), sw = Js("keyboard", {
+}), nw = Js("keyboard", {
   state: () => ({
     ctrlKeyState: !1,
     // ctrl键按下状态
@@ -12730,7 +12714,7 @@ const iw = Js("snapshot", {
       this.spaceKeyState = u;
     }
   }
-}), ow = Js("screen", {
+}), rw = Js("screen", {
   state: () => ({
     screening: !1
     // 是否进入放映状态
@@ -12742,58 +12726,57 @@ const iw = Js("snapshot", {
   }
 });
 export {
-  Sn as $,
   Zt as A,
-  t0 as B,
-  e0 as C,
+  Xv as B,
+  Vv as C,
   pc as D,
-  Zv as E,
+  D0 as E,
   ie as F,
-  L0 as G,
-  O0 as H,
-  Ls as I,
-  K0 as J,
-  f0 as K,
-  J0 as L,
+  k0 as G,
+  Ls as H,
+  B0 as I,
+  a0 as J,
+  q0 as K,
+  F0 as L,
   Pe as M,
   We as N,
-  z0 as O,
-  C0 as P,
-  q0 as Q,
+  L0 as O,
+  A0 as P,
+  W0 as Q,
   qt as R,
   qe as S,
-  zt as T,
-  G0 as U,
-  Cu as V,
+  Kt as T,
+  Cu as U,
+  T0 as V,
   P0 as W,
-  B0 as X,
-  W0 as Y,
-  U0 as Z,
-  Yf as _,
+  z0 as X,
+  K0 as Y,
+  Yf as Z,
+  Sn as _,
   jf as a,
-  ow as b,
+  rw as b,
   si as c,
-  iw as d,
+  tw as d,
   ii as e,
-  d0 as f,
-  H0 as g,
+  c0 as f,
+  U0 as g,
   fe as h,
   Ru as i,
-  I0 as j,
-  T0 as k,
+  E0 as j,
+  O0 as k,
   $f as l,
   sa as m,
-  A0 as n,
-  Zy as o,
-  la as p,
-  fa as q,
-  kv as r,
-  Qo as s,
-  F0 as t,
-  sw as u,
-  qu as v,
-  R0 as w,
+  Vy as n,
+  la as o,
+  fa as p,
+  xv as q,
+  Qo as r,
+  qu as s,
+  N0 as t,
+  nw as u,
+  I0 as v,
+  C0 as w,
   M0 as x,
-  D0 as y,
-  N0 as z
+  R0 as y,
+  Zv as z
 };