@fewangsit/wangsvue-fats 1.0.1-rc.5 → 1.0.1-rc.7

package/vendor/prosemirror-commands/dist/index.es.js

@@ -0,0 +1,383 @@
+import { f as J, a as h, l as T, c as A, j as v, r as B, R as U, b as O } from "../../prosemirror-transform/dist/index.es.js";
+import { b as y, F as S } from "../../prosemirror-model/dist/index.es.js";
+import { T as I, N as d, S as V, A as P } from "../../prosemirror-state/dist/index.es.js";
+const M = (t, e) => t.selection.empty ? !1 : (e && e(t.tr.deleteSelection().scrollIntoView()), !0);
+function N(t, e) {
+  let { $cursor: r } = t.selection;
+  return !r || (e ? !e.endOfTextblock("backward", t) : r.parentOffset > 0) ? null : r;
+}
+const G = (t, e, r) => {
+  let n = N(t, r);
+  if (!n)
+    return !1;
+  let o = z(n);
+  if (!o) {
+    let i = n.blockRange(), f = i && T(i);
+    return f == null ? !1 : (e && e(t.tr.lift(i, f).scrollIntoView()), !0);
+  }
+  let l = o.nodeBefore;
+  if (D(t, o, e, -1))
+    return !0;
+  if (n.parent.content.size == 0 && (x(l, "end") || d.isSelectable(l)))
+    for (let i = n.depth; ; i--) {
+      let f = B(t.doc, n.before(i), n.after(i), y.empty);
+      if (f && f.slice.size < f.to - f.from) {
+        if (e) {
+          let s = t.tr.step(f);
+          s.setSelection(x(l, "end") ? V.findFrom(s.doc.resolve(s.mapping.map(o.pos, -1)), -1) : d.create(s.doc, o.pos - l.nodeSize)), e(s.scrollIntoView());
+        }
+        return !0;
+      }
+      if (i == 1 || n.node(i - 1).childCount > 1)
+        break;
+    }
+  return l.isAtom && o.depth == n.depth - 1 ? (e && e(t.tr.delete(o.pos - l.nodeSize, o.pos).scrollIntoView()), !0) : !1;
+}, oe = (t, e, r) => {
+  let n = N(t, r);
+  if (!n)
+    return !1;
+  let o = z(n);
+  return o ? E(t, o, e) : !1;
+}, le = (t, e, r) => {
+  let n = W(t, r);
+  if (!n)
+    return !1;
+  let o = j(n);
+  return o ? E(t, o, e) : !1;
+};
+function E(t, e, r) {
+  let n = e.nodeBefore, o = n, l = e.pos - 1;
+  for (; !o.isTextblock; l--) {
+    if (o.type.spec.isolating)
+      return !1;
+    let c = o.lastChild;
+    if (!c)
+      return !1;
+    o = c;
+  }
+  let i = e.nodeAfter, f = i, s = e.pos + 1;
+  for (; !f.isTextblock; s++) {
+    if (f.type.spec.isolating)
+      return !1;
+    let c = f.firstChild;
+    if (!c)
+      return !1;
+    f = c;
+  }
+  let p = B(t.doc, l, s, y.empty);
+  if (!p || p.from != l || p instanceof U && p.slice.size >= s - l)
+    return !1;
+  if (r) {
+    let c = t.tr.step(p);
+    c.setSelection(I.create(c.doc, l)), r(c.scrollIntoView());
+  }
+  return !0;
+}
+function x(t, e, r = !1) {
+  for (let n = t; n; n = e == "start" ? n.firstChild : n.lastChild) {
+    if (n.isTextblock)
+      return !0;
+    if (r && n.childCount != 1)
+      return !1;
+  }
+  return !1;
+}
+const H = (t, e, r) => {
+  let { $head: n, empty: o } = t.selection, l = n;
+  if (!o)
+    return !1;
+  if (n.parent.isTextblock) {
+    if (r ? !r.endOfTextblock("backward", t) : n.parentOffset > 0)
+      return !1;
+    l = z(n);
+  }
+  let i = l && l.nodeBefore;
+  return !i || !d.isSelectable(i) ? !1 : (e && e(t.tr.setSelection(d.create(t.doc, l.pos - i.nodeSize)).scrollIntoView()), !0);
+};
+function z(t) {
+  if (!t.parent.type.spec.isolating)
+    for (let e = t.depth - 1; e >= 0; e--) {
+      if (t.index(e) > 0)
+        return t.doc.resolve(t.before(e + 1));
+      if (t.node(e).type.spec.isolating)
+        break;
+    }
+  return null;
+}
+function W(t, e) {
+  let { $cursor: r } = t.selection;
+  return !r || (e ? !e.endOfTextblock("forward", t) : r.parentOffset < r.parent.content.size) ? null : r;
+}
+const K = (t, e, r) => {
+  let n = W(t, r);
+  if (!n)
+    return !1;
+  let o = j(n);
+  if (!o)
+    return !1;
+  let l = o.nodeAfter;
+  if (D(t, o, e, 1))
+    return !0;
+  if (n.parent.content.size == 0 && (x(l, "start") || d.isSelectable(l))) {
+    let i = B(t.doc, n.before(), n.after(), y.empty);
+    if (i && i.slice.size < i.to - i.from) {
+      if (e) {
+        let f = t.tr.step(i);
+        f.setSelection(x(l, "start") ? V.findFrom(f.doc.resolve(f.mapping.map(o.pos)), 1) : d.create(f.doc, f.mapping.map(o.pos))), e(f.scrollIntoView());
+      }
+      return !0;
+    }
+  }
+  return l.isAtom && o.depth == n.depth - 1 ? (e && e(t.tr.delete(o.pos, o.pos + l.nodeSize).scrollIntoView()), !0) : !1;
+}, L = (t, e, r) => {
+  let { $head: n, empty: o } = t.selection, l = n;
+  if (!o)
+    return !1;
+  if (n.parent.isTextblock) {
+    if (r ? !r.endOfTextblock("forward", t) : n.parentOffset < n.parent.content.size)
+      return !1;
+    l = j(n);
+  }
+  let i = l && l.nodeAfter;
+  return !i || !d.isSelectable(i) ? !1 : (e && e(t.tr.setSelection(d.create(t.doc, l.pos)).scrollIntoView()), !0);
+};
+function j(t) {
+  if (!t.parent.type.spec.isolating)
+    for (let e = t.depth - 1; e >= 0; e--) {
+      let r = t.node(e);
+      if (t.index(e) + 1 < r.childCount)
+        return t.doc.resolve(t.after(e + 1));
+      if (r.type.spec.isolating)
+        break;
+    }
+  return null;
+}
+const ie = (t, e) => {
+  let r = t.selection, n = r instanceof d, o;
+  if (n) {
+    if (r.node.isTextblock || !A(t.doc, r.from))
+      return !1;
+    o = r.from;
+  } else if (o = v(t.doc, r.from, -1), o == null)
+    return !1;
+  if (e) {
+    let l = t.tr.join(o);
+    n && l.setSelection(d.create(l.doc, o - t.doc.resolve(o).nodeBefore.nodeSize)), e(l.scrollIntoView());
+  }
+  return !0;
+}, fe = (t, e) => {
+  let r = t.selection, n;
+  if (r instanceof d) {
+    if (r.node.isTextblock || !A(t.doc, r.to))
+      return !1;
+    n = r.to;
+  } else if (n = v(t.doc, r.to, 1), n == null)
+    return !1;
+  return e && e(t.tr.join(n).scrollIntoView()), !0;
+}, se = (t, e) => {
+  let { $from: r, $to: n } = t.selection, o = r.blockRange(n), l = o && T(o);
+  return l == null ? !1 : (e && e(t.tr.lift(o, l).scrollIntoView()), !0);
+}, Q = (t, e) => {
+  let { $head: r, $anchor: n } = t.selection;
+  return !r.parent.type.spec.code || !r.sameParent(n) ? !1 : (e && e(t.tr.insertText(`
+`).scrollIntoView()), !0);
+};
+function R(t) {
+  for (let e = 0; e < t.edgeCount; e++) {
+    let { type: r } = t.edge(e);
+    if (r.isTextblock && !r.hasRequiredAttrs())
+      return r;
+  }
+  return null;
+}
+const ce = (t, e) => {
+  let { $head: r, $anchor: n } = t.selection;
+  if (!r.parent.type.spec.code || !r.sameParent(n))
+    return !1;
+  let o = r.node(-1), l = r.indexAfter(-1), i = R(o.contentMatchAt(l));
+  if (!i || !o.canReplaceWith(l, l, i))
+    return !1;
+  if (e) {
+    let f = r.after(), s = t.tr.replaceWith(f, f, i.createAndFill());
+    s.setSelection(V.near(s.doc.resolve(f), 1)), e(s.scrollIntoView());
+  }
+  return !0;
+}, X = (t, e) => {
+  let r = t.selection, { $from: n, $to: o } = r;
+  if (r instanceof P || n.parent.inlineContent || o.parent.inlineContent)
+    return !1;
+  let l = R(o.parent.contentMatchAt(o.indexAfter()));
+  if (!l || !l.isTextblock)
+    return !1;
+  if (e) {
+    let i = (!n.parentOffset && o.index() < o.parent.childCount ? n : o).pos, f = t.tr.insert(i, l.createAndFill());
+    f.setSelection(I.create(f.doc, i + 1)), e(f.scrollIntoView());
+  }
+  return !0;
+}, Y = (t, e) => {
+  let { $cursor: r } = t.selection;
+  if (!r || r.parent.content.size)
+    return !1;
+  if (r.depth > 1 && r.after() != r.end(-1)) {
+    let l = r.before();
+    if (h(t.doc, l))
+      return e && e(t.tr.split(l).scrollIntoView()), !0;
+  }
+  let n = r.blockRange(), o = n && T(n);
+  return o == null ? !1 : (e && e(t.tr.lift(n, o).scrollIntoView()), !0);
+};
+function Z(t) {
+  return (e, r) => {
+    let { $from: n, $to: o } = e.selection;
+    if (e.selection instanceof d && e.selection.node.isBlock)
+      return !n.parentOffset || !h(e.doc, n.pos) ? !1 : (r && r(e.tr.split(n.pos).scrollIntoView()), !0);
+    if (!n.depth)
+      return !1;
+    let l = [], i, f, s = !1, p = !1;
+    for (let a = n.depth; ; a--)
+      if (n.node(a).isBlock) {
+        s = n.end(a) == n.pos + (n.depth - a), p = n.start(a) == n.pos - (n.depth - a), f = R(n.node(a - 1).contentMatchAt(n.indexAfter(a - 1))), l.unshift(s && f ? { type: f } : null), i = a;
+        break;
+      } else {
+        if (a == 1)
+          return !1;
+        l.unshift(null);
+      }
+    let c = e.tr;
+    (e.selection instanceof I || e.selection instanceof P) && c.deleteSelection();
+    let b = c.mapping.map(n.pos), w = h(c.doc, b, l.length, l);
+    if (w || (l[0] = f ? { type: f } : null, w = h(c.doc, b, l.length, l)), c.split(b, l.length, l), !s && p && n.node(i).type != f) {
+      let a = c.mapping.map(n.before(i)), u = c.doc.resolve(a);
+      f && n.node(i - 1).canReplaceWith(u.index(), u.index() + 1, f) && c.setNodeMarkup(c.mapping.map(n.before(i)), f);
+    }
+    return r && r(c.scrollIntoView()), !0;
+  };
+}
+const _ = Z(), ae = (t, e) => {
+  let { $from: r, to: n } = t.selection, o, l = r.sharedDepth(n);
+  return l == 0 ? !1 : (o = r.before(l), e && e(t.tr.setSelection(d.create(t.doc, o))), !0);
+};
+function ee(t, e, r) {
+  let n = e.nodeBefore, o = e.nodeAfter, l = e.index();
+  return !n || !o || !n.type.compatibleContent(o.type) ? !1 : !n.content.size && e.parent.canReplace(l - 1, l) ? (r && r(t.tr.delete(e.pos - n.nodeSize, e.pos).scrollIntoView()), !0) : !e.parent.canReplace(l, l + 1) || !(o.isTextblock || A(t.doc, e.pos)) ? !1 : (r && r(t.tr.join(e.pos).scrollIntoView()), !0);
+}
+function D(t, e, r, n) {
+  let o = e.nodeBefore, l = e.nodeAfter, i, f, s = o.type.spec.isolating || l.type.spec.isolating;
+  if (!s && ee(t, e, r))
+    return !0;
+  let p = !s && e.parent.canReplace(e.index(), e.index() + 1);
+  if (p && (i = (f = o.contentMatchAt(o.childCount)).findWrapping(l.type)) && f.matchType(i[0] || l.type).validEnd) {
+    if (r) {
+      let a = e.pos + l.nodeSize, u = S.empty;
+      for (let k = i.length - 1; k >= 0; k--)
+        u = S.from(i[k].create(null, u));
+      u = S.from(o.copy(u));
+      let m = t.tr.step(new O(e.pos - 1, a, e.pos, a, new y(u, 1, 0), i.length, !0)), g = m.doc.resolve(a + 2 * i.length);
+      g.nodeAfter && g.nodeAfter.type == o.type && A(m.doc, g.pos) && m.join(g.pos), r(m.scrollIntoView());
+    }
+    return !0;
+  }
+  let c = l.type.spec.isolating || n > 0 && s ? null : V.findFrom(e, 1), b = c && c.$from.blockRange(c.$to), w = b && T(b);
+  if (w != null && w >= e.depth)
+    return r && r(t.tr.lift(b, w).scrollIntoView()), !0;
+  if (p && x(l, "start", !0) && x(o, "end")) {
+    let a = o, u = [];
+    for (; u.push(a), !a.isTextblock; )
+      a = a.lastChild;
+    let m = l, g = 1;
+    for (; !m.isTextblock; m = m.firstChild)
+      g++;
+    if (a.canReplace(a.childCount, a.childCount, m.content)) {
+      if (r) {
+        let k = S.empty;
+        for (let C = u.length - 1; C >= 0; C--)
+          k = S.from(u[C].copy(k));
+        let q = t.tr.step(new O(e.pos - u.length, e.pos + l.nodeSize, e.pos + g, e.pos + l.nodeSize - g, new y(k, u.length, 0), 0, !0));
+        r(q.scrollIntoView());
+      }
+      return !0;
+    }
+  }
+  return !1;
+}
+function $(t) {
+  return function(e, r) {
+    let n = e.selection, o = t < 0 ? n.$from : n.$to, l = o.depth;
+    for (; o.node(l).isInline; ) {
+      if (!l)
+        return !1;
+      l--;
+    }
+    return o.node(l).isTextblock ? (r && r(e.tr.setSelection(I.create(e.doc, t < 0 ? o.start(l) : o.end(l)))), !0) : !1;
+  };
+}
+const ue = $(-1), pe = $(1);
+function de(t, e = null) {
+  return function(r, n) {
+    let { $from: o, $to: l } = r.selection, i = o.blockRange(l), f = i && J(i, t, e);
+    return f ? (n && n(r.tr.wrap(i, f).scrollIntoView()), !0) : !1;
+  };
+}
+function be(t, e = null) {
+  return function(r, n) {
+    let o = !1;
+    for (let l = 0; l < r.selection.ranges.length && !o; l++) {
+      let { $from: { pos: i }, $to: { pos: f } } = r.selection.ranges[l];
+      r.doc.nodesBetween(i, f, (s, p) => {
+        if (o)
+          return !1;
+        if (!(!s.isTextblock || s.hasMarkup(t, e)))
+          if (s.type == t)
+            o = !0;
+          else {
+            let c = r.doc.resolve(p), b = c.index();
+            o = c.parent.canReplaceWith(b, b + 1, t);
+          }
+      });
+    }
+    if (!o)
+      return !1;
+    if (n) {
+      let l = r.tr;
+      for (let i = 0; i < r.selection.ranges.length; i++) {
+        let { $from: { pos: f }, $to: { pos: s } } = r.selection.ranges[i];
+        l.setBlockType(f, s, t, e);
+      }
+      n(l.scrollIntoView());
+    }
+    return !0;
+  };
+}
+function F(...t) {
+  return function(e, r, n) {
+    for (let o = 0; o < t.length; o++)
+      if (t[o](e, r, n))
+        return !0;
+    return !1;
+  };
+}
+F(M, G, H);
+F(M, K, L);
+F(Q, X, Y, _);
+typeof navigator < "u" ? /Mac|iP(hone|[oa]d)/.test(navigator.platform) : typeof os < "u" && os.platform && os.platform() == "darwin";
+export {
+  ue as a,
+  pe as b,
+  ae as c,
+  L as d,
+  H as e,
+  se as f,
+  le as g,
+  oe as h,
+  K as i,
+  ie as j,
+  fe as k,
+  Y as l,
+  G as m,
+  Q as n,
+  ce as o,
+  M as p,
+  X as q,
+  be as s,
+  de as w
+};

package/vendor/prosemirror-history/dist/index.es.js

@@ -0,0 +1,248 @@
+import { R as b } from "../../rope-sequence/dist/index.es.js";
+import { M as k } from "../../prosemirror-transform/dist/index.es.js";
+import { P as H, a as O } from "../../prosemirror-state/dist/index.es.js";
+const D = 500;
+class c {
+  constructor(t, e) {
+    this.items = t, this.eventCount = e;
+  }
+  // Pop the latest event off the branch's history and apply it
+  // to a document transform.
+  popEvent(t, e) {
+    if (this.eventCount == 0)
+      return null;
+    let i = this.items.length;
+    for (; ; i--)
+      if (this.items.get(i - 1).selection) {
+        --i;
+        break;
+      }
+    let s, p;
+    e && (s = this.remapping(i, this.items.length), p = s.maps.length);
+    let l = t.tr, r, m, u = [], f = [];
+    return this.items.forEach((a, o) => {
+      if (!a.step) {
+        s || (s = this.remapping(i, o + 1), p = s.maps.length), p--, f.push(a);
+        return;
+      }
+      if (s) {
+        f.push(new g(a.map));
+        let d = a.step.map(s.slice(p)), v;
+        d && l.maybeStep(d).doc && (v = l.mapping.maps[l.mapping.maps.length - 1], u.push(new g(v, void 0, void 0, u.length + f.length))), p--, v && s.appendMap(v, p);
+      } else
+        l.maybeStep(a.step);
+      if (a.selection)
+        return r = s ? a.selection.map(s.slice(p)) : a.selection, m = new c(this.items.slice(0, i).append(f.reverse().concat(u)), this.eventCount - 1), !1;
+    }, this.items.length, 0), { remaining: m, transform: l, selection: r };
+  }
+  // Create a new branch with the given transform added.
+  addTransform(t, e, i, s) {
+    let p = [], l = this.eventCount, r = this.items, m = !s && r.length ? r.get(r.length - 1) : null;
+    for (let f = 0; f < t.steps.length; f++) {
+      let a = t.steps[f].invert(t.docs[f]), o = new g(t.mapping.maps[f], a, e), d;
+      (d = m && m.merge(o)) && (o = d, f ? p.pop() : r = r.slice(0, r.length - 1)), p.push(o), e && (l++, e = void 0), s || (m = o);
+    }
+    let u = l - i.depth;
+    return u > y && (r = x(r, u), l -= u), new c(r.append(p), l);
+  }
+  remapping(t, e) {
+    let i = new k();
+    return this.items.forEach((s, p) => {
+      let l = s.mirrorOffset != null && p - s.mirrorOffset >= t ? i.maps.length - s.mirrorOffset : void 0;
+      i.appendMap(s.map, l);
+    }, t, e), i;
+  }
+  addMaps(t) {
+    return this.eventCount == 0 ? this : new c(this.items.append(t.map((e) => new g(e))), this.eventCount);
+  }
+  // When the collab module receives remote changes, the history has
+  // to know about those, so that it can adjust the steps that were
+  // rebased on top of the remote changes, and include the position
+  // maps for the remote changes in its array of items.
+  rebased(t, e) {
+    if (!this.eventCount)
+      return this;
+    let i = [], s = Math.max(0, this.items.length - e), p = t.mapping, l = t.steps.length, r = this.eventCount;
+    this.items.forEach((o) => {
+      o.selection && r--;
+    }, s);
+    let m = e;
+    this.items.forEach((o) => {
+      let d = p.getMirror(--m);
+      if (d == null)
+        return;
+      l = Math.min(l, d);
+      let v = p.maps[d];
+      if (o.step) {
+        let S = t.steps[d].invert(t.docs[d]), E = o.selection && o.selection.map(p.slice(m + 1, d));
+        E && r++, i.push(new g(v, S, E));
+      } else
+        i.push(new g(v));
+    }, s);
+    let u = [];
+    for (let o = e; o < l; o++)
+      u.push(new g(p.maps[o]));
+    let f = this.items.slice(0, s).append(u).append(i), a = new c(f, r);
+    return a.emptyItemCount() > D && (a = a.compress(this.items.length - i.length)), a;
+  }
+  emptyItemCount() {
+    let t = 0;
+    return this.items.forEach((e) => {
+      e.step || t++;
+    }), t;
+  }
+  // Compressing a branch means rewriting it to push the air (map-only
+  // items) out. During collaboration, these naturally accumulate
+  // because each remote change adds one. The `upto` argument is used
+  // to ensure that only the items below a given level are compressed,
+  // because `rebased` relies on a clean, untouched set of items in
+  // order to associate old items with rebased steps.
+  compress(t = this.items.length) {
+    let e = this.remapping(0, t), i = e.maps.length, s = [], p = 0;
+    return this.items.forEach((l, r) => {
+      if (r >= t)
+        s.push(l), l.selection && p++;
+      else if (l.step) {
+        let m = l.step.map(e.slice(i)), u = m && m.getMap();
+        if (i--, u && e.appendMap(u, i), m) {
+          let f = l.selection && l.selection.map(e.slice(i));
+          f && p++;
+          let a = new g(u.invert(), m, f), o, d = s.length - 1;
+          (o = s.length && s[d].merge(a)) ? s[d] = o : s.push(a);
+        }
+      } else l.map && i--;
+    }, this.items.length, 0), new c(b.from(s.reverse()), p);
+  }
+}
+c.empty = new c(b.empty, 0);
+function x(n, t) {
+  let e;
+  return n.forEach((i, s) => {
+    if (i.selection && t-- == 0)
+      return e = s, !1;
+  }), n.slice(e);
+}
+class g {
+  constructor(t, e, i, s) {
+    this.map = t, this.step = e, this.selection = i, this.mirrorOffset = s;
+  }
+  merge(t) {
+    if (this.step && t.step && !t.selection) {
+      let e = t.step.merge(this.step);
+      if (e)
+        return new g(e.getMap().invert(), e, this.selection);
+    }
+  }
+}
+class h {
+  constructor(t, e, i, s, p) {
+    this.done = t, this.undone = e, this.prevRanges = i, this.prevTime = s, this.prevComposition = p;
+  }
+}
+const y = 20;
+function F(n, t, e, i) {
+  let s = e.getMeta(w), p;
+  if (s)
+    return s.historyState;
+  e.getMeta(j) && (n = new h(n.done, n.undone, null, 0, -1));
+  let l = e.getMeta("appendedTransaction");
+  if (e.steps.length == 0)
+    return n;
+  if (l && l.getMeta(w))
+    return l.getMeta(w).redo ? new h(n.done.addTransform(e, void 0, i, M(t)), n.undone, I(e.mapping.maps), n.prevTime, n.prevComposition) : new h(n.done, n.undone.addTransform(e, void 0, i, M(t)), null, n.prevTime, n.prevComposition);
+  if (e.getMeta("addToHistory") !== !1 && !(l && l.getMeta("addToHistory") === !1)) {
+    let r = e.getMeta("composition"), m = n.prevTime == 0 || !l && n.prevComposition != r && (n.prevTime < (e.time || 0) - i.newGroupDelay || !G(e, n.prevRanges)), u = l ? C(n.prevRanges, e.mapping) : I(e.mapping.maps);
+    return new h(n.done.addTransform(e, m ? t.selection.getBookmark() : void 0, i, M(t)), c.empty, u, e.time, r ?? n.prevComposition);
+  } else return (p = e.getMeta("rebased")) ? new h(n.done.rebased(e, p), n.undone.rebased(e, p), C(n.prevRanges, e.mapping), n.prevTime, n.prevComposition) : new h(n.done.addMaps(e.mapping.maps), n.undone.addMaps(e.mapping.maps), C(n.prevRanges, e.mapping), n.prevTime, n.prevComposition);
+}
+function G(n, t) {
+  if (!t)
+    return !1;
+  if (!n.docChanged)
+    return !0;
+  let e = !1;
+  return n.mapping.maps[0].forEach((i, s) => {
+    for (let p = 0; p < t.length; p += 2)
+      i <= t[p + 1] && s >= t[p] && (e = !0);
+  }), e;
+}
+function I(n) {
+  let t = [];
+  for (let e = n.length - 1; e >= 0 && t.length == 0; e--)
+    n[e].forEach((i, s, p, l) => t.push(p, l));
+  return t;
+}
+function C(n, t) {
+  if (!n)
+    return null;
+  let e = [];
+  for (let i = 0; i < n.length; i += 2) {
+    let s = t.map(n[i], 1), p = t.map(n[i + 1], -1);
+    s <= p && e.push(s, p);
+  }
+  return e;
+}
+function K(n, t, e) {
+  let i = M(t), s = w.get(t).spec.config, p = (e ? n.undone : n.done).popEvent(t, i);
+  if (!p)
+    return null;
+  let l = p.selection.resolve(p.transform.doc), r = (e ? n.done : n.undone).addTransform(p.transform, t.selection.getBookmark(), s, i), m = new h(e ? r : p.remaining, e ? p.remaining : r, null, 0, -1);
+  return p.transform.setSelection(l).setMeta(w, { redo: e, historyState: m });
+}
+let T = !1, P = null;
+function M(n) {
+  let t = n.plugins;
+  if (P != t) {
+    T = !1, P = t;
+    for (let e = 0; e < t.length; e++)
+      if (t[e].spec.historyPreserveItems) {
+        T = !0;
+        break;
+      }
+  }
+  return T;
+}
+const w = new O("history"), j = new O("closeHistory");
+function W(n = {}) {
+  return n = {
+    depth: n.depth || 100,
+    newGroupDelay: n.newGroupDelay || 500
+  }, new H({
+    key: w,
+    state: {
+      init() {
+        return new h(c.empty, c.empty, null, 0, -1);
+      },
+      apply(t, e, i) {
+        return F(e, i, t, n);
+      }
+    },
+    config: n,
+    props: {
+      handleDOMEvents: {
+        beforeinput(t, e) {
+          let i = e.inputType, s = i == "historyUndo" ? A : i == "historyRedo" ? U : null;
+          return s ? (e.preventDefault(), s(t.state, t.dispatch)) : !1;
+        }
+      }
+    }
+  });
+}
+function R(n, t) {
+  return (e, i) => {
+    let s = w.getState(e);
+    if (!s || (n ? s.undone : s.done).eventCount == 0)
+      return !1;
+    if (i) {
+      let p = K(s, e, n);
+      p && i(t ? p.scrollIntoView() : p);
+    }
+    return !0;
+  };
+}
+const A = R(!1, !0), U = R(!0, !0);
+export {
+  W as h,
+  U as r,
+  A as u
+};

package/vendor/prosemirror-keymap/dist/index.es.js

@@ -0,0 +1,60 @@
+import { k as n, b as c } from "../../w3c-keyname/index.es.js";
+import { P as d } from "../../prosemirror-state/dist/index.es.js";
+const h = typeof navigator < "u" ? /Mac|iP(hone|[oa]d)/.test(navigator.platform) : !1;
+function m(e) {
+  let r = e.split(/-(?!$)/), t = r[r.length - 1];
+  t == "Space" && (t = " ");
+  let i, f, o, a;
+  for (let l = 0; l < r.length - 1; l++) {
+    let s = r[l];
+    if (/^(cmd|meta|m)$/i.test(s))
+      a = !0;
+    else if (/^a(lt)?$/i.test(s))
+      i = !0;
+    else if (/^(c|ctrl|control)$/i.test(s))
+      f = !0;
+    else if (/^s(hift)?$/i.test(s))
+      o = !0;
+    else if (/^mod$/i.test(s))
+      h ? a = !0 : f = !0;
+    else
+      throw new Error("Unrecognized modifier name: " + s);
+  }
+  return i && (t = "Alt-" + t), f && (t = "Ctrl-" + t), a && (t = "Meta-" + t), o && (t = "Shift-" + t), t;
+}
+function p(e) {
+  let r = /* @__PURE__ */ Object.create(null);
+  for (let t in e)
+    r[m(t)] = e[t];
+  return r;
+}
+function u(e, r, t = !0) {
+  return r.altKey && (e = "Alt-" + e), r.ctrlKey && (e = "Ctrl-" + e), r.metaKey && (e = "Meta-" + e), t && r.shiftKey && (e = "Shift-" + e), e;
+}
+function k(e) {
+  return new d({ props: { handleKeyDown: y(e) } });
+}
+function y(e) {
+  let r = p(e);
+  return function(t, i) {
+    let f = n(i), o, a = r[u(f, i)];
+    if (a && a(t.state, t.dispatch, t))
+      return !0;
+    if (f.length == 1 && f != " ") {
+      if (i.shiftKey) {
+        let l = r[u(f, i, !1)];
+        if (l && l(t.state, t.dispatch, t))
+          return !0;
+      }
+      if ((i.shiftKey || i.altKey || i.metaKey || f.charCodeAt(0) > 127) && (o = c[i.keyCode]) && o != f) {
+        let l = r[u(o, i)];
+        if (l && l(t.state, t.dispatch, t))
+          return !0;
+      }
+    }
+    return !1;
+  };
+}
+export {
+  k
+};