@vc-shell/framework 2.0.0-alpha.8 → 2.0.0-pr221.637b802

package/dist/chunks/vendor-prosemirror-gapcursor-C7MEx13L.js

@@ -0,0 +1,203 @@
+import { a as S } from "./vendor-prosemirror-keymap-tvZqK1zZ.js";
+import { P as v, T as m, N as g, S as u } from "./vendor-prosemirror-state-BvFA7AjG.js";
+import { F as h, S as x } from "./vendor-prosemirror-model-DAA3avbR.js";
+import { D as w, a as A } from "./vendor-prosemirror-view-BW4UqvjQ.js";
+class i extends u {
+  /**
+  Create a gap cursor.
+  */
+  constructor(e) {
+    super(e, e);
+  }
+  map(e, t) {
+    let o = e.resolve(t.map(this.head));
+    return i.valid(o) ? new i(o) : u.near(o);
+  }
+  content() {
+    return x.empty;
+  }
+  eq(e) {
+    return e instanceof i && e.head == this.head;
+  }
+  toJSON() {
+    return { type: "gapcursor", pos: this.head };
+  }
+  /**
+  @internal
+  */
+  static fromJSON(e, t) {
+    if (typeof t.pos != "number")
+      throw new RangeError("Invalid input for GapCursor.fromJSON");
+    return new i(e.resolve(t.pos));
+  }
+  /**
+  @internal
+  */
+  getBookmark() {
+    return new d(this.anchor);
+  }
+  /**
+  @internal
+  */
+  static valid(e) {
+    let t = e.parent;
+    if (t.inlineContent || !y(e) || !b(e))
+      return !1;
+    let o = t.type.spec.allowGapCursor;
+    if (o != null)
+      return o;
+    let r = t.contentMatchAt(e.index()).defaultType;
+    return r && r.isTextblock;
+  }
+  /**
+  @internal
+  */
+  static findGapCursorFrom(e, t, o = !1) {
+    e: for (; ; ) {
+      if (!o && i.valid(e))
+        return e;
+      let r = e.pos, s = null;
+      for (let l = e.depth; ; l--) {
+        let a = e.node(l);
+        if (t > 0 ? e.indexAfter(l) < a.childCount : e.index(l) > 0) {
+          s = a.child(t > 0 ? e.indexAfter(l) : e.index(l) - 1);
+          break;
+        } else if (l == 0)
+          return null;
+        r += t;
+        let f = e.doc.resolve(r);
+        if (i.valid(f))
+          return f;
+      }
+      for (; ; ) {
+        let l = t > 0 ? s.firstChild : s.lastChild;
+        if (!l) {
+          if (s.isAtom && !s.isText && !g.isSelectable(s)) {
+            e = e.doc.resolve(r + s.nodeSize * t), o = !1;
+            continue e;
+          }
+          break;
+        }
+        s = l, r += t;
+        let a = e.doc.resolve(r);
+        if (i.valid(a))
+          return a;
+      }
+      return null;
+    }
+  }
+}
+i.prototype.visible = !1;
+i.findFrom = i.findGapCursorFrom;
+u.jsonID("gapcursor", i);
+class d {
+  constructor(e) {
+    this.pos = e;
+  }
+  map(e) {
+    return new d(e.map(this.pos));
+  }
+  resolve(e) {
+    let t = e.resolve(this.pos);
+    return i.valid(t) ? new i(t) : u.near(t);
+  }
+}
+function C(n) {
+  return n.isAtom || n.spec.isolating || n.spec.createGapCursor;
+}
+function y(n) {
+  for (let e = n.depth; e >= 0; e--) {
+    let t = n.index(e), o = n.node(e);
+    if (t == 0) {
+      if (o.type.spec.isolating)
+        return !0;
+      continue;
+    }
+    for (let r = o.child(t - 1); ; r = r.lastChild) {
+      if (r.childCount == 0 && !r.inlineContent || C(r.type))
+        return !0;
+      if (r.inlineContent)
+        return !1;
+    }
+  }
+  return !0;
+}
+function b(n) {
+  for (let e = n.depth; e >= 0; e--) {
+    let t = n.indexAfter(e), o = n.node(e);
+    if (t == o.childCount) {
+      if (o.type.spec.isolating)
+        return !0;
+      continue;
+    }
+    for (let r = o.child(t); ; r = r.firstChild) {
+      if (r.childCount == 0 && !r.inlineContent || C(r.type))
+        return !0;
+      if (r.inlineContent)
+        return !1;
+    }
+  }
+  return !0;
+}
+function z() {
+  return new v({
+    props: {
+      decorations: F,
+      createSelectionBetween(n, e, t) {
+        return e.pos == t.pos && i.valid(t) ? new i(t) : null;
+      },
+      handleClick: T,
+      handleKeyDown: k,
+      handleDOMEvents: { beforeinput: D }
+    }
+  });
+}
+const k = S({
+  ArrowLeft: c("horiz", -1),
+  ArrowRight: c("horiz", 1),
+  ArrowUp: c("vert", -1),
+  ArrowDown: c("vert", 1)
+});
+function c(n, e) {
+  const t = n == "vert" ? e > 0 ? "down" : "up" : e > 0 ? "right" : "left";
+  return function(o, r, s) {
+    let l = o.selection, a = e > 0 ? l.$to : l.$from, f = l.empty;
+    if (l instanceof m) {
+      if (!s.endOfTextblock(t) || a.depth == 0)
+        return !1;
+      f = !1, a = o.doc.resolve(e > 0 ? a.after() : a.before());
+    }
+    let p = i.findGapCursorFrom(a, e, f);
+    return p ? (r && r(o.tr.setSelection(new i(p))), !0) : !1;
+  };
+}
+function T(n, e, t) {
+  if (!n || !n.editable)
+    return !1;
+  let o = n.state.doc.resolve(e);
+  if (!i.valid(o))
+    return !1;
+  let r = n.posAtCoords({ left: t.clientX, top: t.clientY });
+  return r && r.inside > -1 && g.isSelectable(n.state.doc.nodeAt(r.inside)) ? !1 : (n.dispatch(n.state.tr.setSelection(new i(o))), !0);
+}
+function D(n, e) {
+  if (e.inputType != "insertCompositionText" || !(n.state.selection instanceof i))
+    return !1;
+  let { $from: t } = n.state.selection, o = t.parent.contentMatchAt(t.index()).findWrapping(n.state.schema.nodes.text);
+  if (!o)
+    return !1;
+  let r = h.empty;
+  for (let l = o.length - 1; l >= 0; l--)
+    r = h.from(o[l].createAndFill(null, r));
+  let s = n.state.tr.replace(t.pos, t.pos, new x(r, 0, 0));
+  return s.setSelection(m.near(s.doc.resolve(t.pos + 1))), n.dispatch(s), !1;
+}
+function F(n) {
+  if (!(n.selection instanceof i))
+    return null;
+  let e = document.createElement("div");
+  return e.className = "ProseMirror-gapcursor", w.create(n.doc, [A.widget(n.selection.head, e, { key: "gapcursor" })]);
+}
+export {
+  z as g
+};

package/dist/chunks/vendor-prosemirror-gapcursor-C7MEx13L.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"vendor-prosemirror-gapcursor-C7MEx13L.js","sources":["../../../node_modules/prosemirror-gapcursor/dist/index.js"],"sourcesContent":["import { keydownHandler } from 'prosemirror-keymap';\nimport { Selection, NodeSelection, TextSelection, Plugin } from 'prosemirror-state';\nimport { Slice, Fragment } from 'prosemirror-model';\nimport { DecorationSet, Decoration } from 'prosemirror-view';\n\n/**\nGap cursor selections are represented using this class. Its\n`$anchor` and `$head` properties both point at the cursor position.\n*/\nclass GapCursor extends Selection {\n    /**\n    Create a gap cursor.\n    */\n    constructor($pos) {\n        super($pos, $pos);\n    }\n    map(doc, mapping) {\n        let $pos = doc.resolve(mapping.map(this.head));\n        return GapCursor.valid($pos) ? new GapCursor($pos) : Selection.near($pos);\n    }\n    content() { return Slice.empty; }\n    eq(other) {\n        return other instanceof GapCursor && other.head == this.head;\n    }\n    toJSON() {\n        return { type: \"gapcursor\", pos: this.head };\n    }\n    /**\n    @internal\n    */\n    static fromJSON(doc, json) {\n        if (typeof json.pos != \"number\")\n            throw new RangeError(\"Invalid input for GapCursor.fromJSON\");\n        return new GapCursor(doc.resolve(json.pos));\n    }\n    /**\n    @internal\n    */\n    getBookmark() { return new GapBookmark(this.anchor); }\n    /**\n    @internal\n    */\n    static valid($pos) {\n        let parent = $pos.parent;\n        if (parent.inlineContent || !closedBefore($pos) || !closedAfter($pos))\n            return false;\n        let override = parent.type.spec.allowGapCursor;\n        if (override != null)\n            return override;\n        let deflt = parent.contentMatchAt($pos.index()).defaultType;\n        return deflt && deflt.isTextblock;\n    }\n    /**\n    @internal\n    */\n    static findGapCursorFrom($pos, dir, mustMove = false) {\n        search: for (;;) {\n            if (!mustMove && GapCursor.valid($pos))\n                return $pos;\n            let pos = $pos.pos, next = null;\n            // Scan up from this position\n            for (let d = $pos.depth;; d--) {\n                let parent = $pos.node(d);\n                if (dir > 0 ? $pos.indexAfter(d) < parent.childCount : $pos.index(d) > 0) {\n                    next = parent.child(dir > 0 ? $pos.indexAfter(d) : $pos.index(d) - 1);\n                    break;\n                }\n                else if (d == 0) {\n                    return null;\n                }\n                pos += dir;\n                let $cur = $pos.doc.resolve(pos);\n                if (GapCursor.valid($cur))\n                    return $cur;\n            }\n            // And then down into the next node\n            for (;;) {\n                let inside = dir > 0 ? next.firstChild : next.lastChild;\n                if (!inside) {\n                    if (next.isAtom && !next.isText && !NodeSelection.isSelectable(next)) {\n                        $pos = $pos.doc.resolve(pos + next.nodeSize * dir);\n                        mustMove = false;\n                        continue search;\n                    }\n                    break;\n                }\n                next = inside;\n                pos += dir;\n                let $cur = $pos.doc.resolve(pos);\n                if (GapCursor.valid($cur))\n                    return $cur;\n            }\n            return null;\n        }\n    }\n}\nGapCursor.prototype.visible = false;\nGapCursor.findFrom = GapCursor.findGapCursorFrom;\nSelection.jsonID(\"gapcursor\", GapCursor);\nclass GapBookmark {\n    constructor(pos) {\n        this.pos = pos;\n    }\n    map(mapping) {\n        return new GapBookmark(mapping.map(this.pos));\n    }\n    resolve(doc) {\n        let $pos = doc.resolve(this.pos);\n        return GapCursor.valid($pos) ? new GapCursor($pos) : Selection.near($pos);\n    }\n}\nfunction needsGap(type) {\n    return type.isAtom || type.spec.isolating || type.spec.createGapCursor;\n}\nfunction closedBefore($pos) {\n    for (let d = $pos.depth; d >= 0; d--) {\n        let index = $pos.index(d), parent = $pos.node(d);\n        // At the start of this parent, look at next one\n        if (index == 0) {\n            if (parent.type.spec.isolating)\n                return true;\n            continue;\n        }\n        // See if the node before (or its first ancestor) is closed\n        for (let before = parent.child(index - 1);; before = before.lastChild) {\n            if ((before.childCount == 0 && !before.inlineContent) || needsGap(before.type))\n                return true;\n            if (before.inlineContent)\n                return false;\n        }\n    }\n    // Hit start of document\n    return true;\n}\nfunction closedAfter($pos) {\n    for (let d = $pos.depth; d >= 0; d--) {\n        let index = $pos.indexAfter(d), parent = $pos.node(d);\n        if (index == parent.childCount) {\n            if (parent.type.spec.isolating)\n                return true;\n            continue;\n        }\n        for (let after = parent.child(index);; after = after.firstChild) {\n            if ((after.childCount == 0 && !after.inlineContent) || needsGap(after.type))\n                return true;\n            if (after.inlineContent)\n                return false;\n        }\n    }\n    return true;\n}\n\n/**\nCreate a gap cursor plugin. When enabled, this will capture clicks\nnear and arrow-key-motion past places that don't have a normally\nselectable position nearby, and create a gap cursor selection for\nthem. The cursor is drawn as an element with class\n`ProseMirror-gapcursor`. You can either include\n`style/gapcursor.css` from the package's directory or add your own\nstyles to make it visible.\n*/\nfunction gapCursor() {\n    return new Plugin({\n        props: {\n            decorations: drawGapCursor,\n            createSelectionBetween(_view, $anchor, $head) {\n                return $anchor.pos == $head.pos && GapCursor.valid($head) ? new GapCursor($head) : null;\n            },\n            handleClick,\n            handleKeyDown,\n            handleDOMEvents: { beforeinput: beforeinput }\n        }\n    });\n}\nconst handleKeyDown = keydownHandler({\n    \"ArrowLeft\": arrow(\"horiz\", -1),\n    \"ArrowRight\": arrow(\"horiz\", 1),\n    \"ArrowUp\": arrow(\"vert\", -1),\n    \"ArrowDown\": arrow(\"vert\", 1)\n});\nfunction arrow(axis, dir) {\n    const dirStr = axis == \"vert\" ? (dir > 0 ? \"down\" : \"up\") : (dir > 0 ? \"right\" : \"left\");\n    return function (state, dispatch, view) {\n        let sel = state.selection;\n        let $start = dir > 0 ? sel.$to : sel.$from, mustMove = sel.empty;\n        if (sel instanceof TextSelection) {\n            if (!view.endOfTextblock(dirStr) || $start.depth == 0)\n                return false;\n            mustMove = false;\n            $start = state.doc.resolve(dir > 0 ? $start.after() : $start.before());\n        }\n        let $found = GapCursor.findGapCursorFrom($start, dir, mustMove);\n        if (!$found)\n            return false;\n        if (dispatch)\n            dispatch(state.tr.setSelection(new GapCursor($found)));\n        return true;\n    };\n}\nfunction handleClick(view, pos, event) {\n    if (!view || !view.editable)\n        return false;\n    let $pos = view.state.doc.resolve(pos);\n    if (!GapCursor.valid($pos))\n        return false;\n    let clickPos = view.posAtCoords({ left: event.clientX, top: event.clientY });\n    if (clickPos && clickPos.inside > -1 && NodeSelection.isSelectable(view.state.doc.nodeAt(clickPos.inside)))\n        return false;\n    view.dispatch(view.state.tr.setSelection(new GapCursor($pos)));\n    return true;\n}\n// This is a hack that, when a composition starts while a gap cursor\n// is active, quickly creates an inline context for the composition to\n// happen in, to avoid it being aborted by the DOM selection being\n// moved into a valid position.\nfunction beforeinput(view, event) {\n    if (event.inputType != \"insertCompositionText\" || !(view.state.selection instanceof GapCursor))\n        return false;\n    let { $from } = view.state.selection;\n    let insert = $from.parent.contentMatchAt($from.index()).findWrapping(view.state.schema.nodes.text);\n    if (!insert)\n        return false;\n    let frag = Fragment.empty;\n    for (let i = insert.length - 1; i >= 0; i--)\n        frag = Fragment.from(insert[i].createAndFill(null, frag));\n    let tr = view.state.tr.replace($from.pos, $from.pos, new Slice(frag, 0, 0));\n    tr.setSelection(TextSelection.near(tr.doc.resolve($from.pos + 1)));\n    view.dispatch(tr);\n    return false;\n}\nfunction drawGapCursor(state) {\n    if (!(state.selection instanceof GapCursor))\n        return null;\n    let node = document.createElement(\"div\");\n    node.className = \"ProseMirror-gapcursor\";\n    return DecorationSet.create(state.doc, [Decoration.widget(state.selection.head, node, { key: \"gapcursor\" })]);\n}\n\nexport { GapCursor, gapCursor };\n"],"names":["GapCursor","Selection","$pos","doc","mapping","Slice","other","json","GapBookmark","parent","closedBefore","closedAfter","override","deflt","dir","mustMove","search","pos","next","d","$cur","inside","NodeSelection","needsGap","type","index","before","after","gapCursor","Plugin","drawGapCursor","_view","$anchor","$head","handleClick","handleKeyDown","beforeinput","keydownHandler","arrow","axis","dirStr","state","dispatch","view","sel","$start","TextSelection","$found","event","clickPos","$from","insert","frag","Fragment","i","tr","node","DecorationSet","Decoration"],"mappings":";;;;AASA,MAAMA,UAAkBC,EAAU;AAAA;AAAA;AAAA;AAAA,EAI9B,YAAYC,GAAM;AACd,UAAMA,GAAMA,CAAI;AAAA,EACpB;AAAA,EACA,IAAIC,GAAKC,GAAS;AACd,QAAIF,IAAOC,EAAI,QAAQC,EAAQ,IAAI,KAAK,IAAI,CAAC;AAC7C,WAAOJ,EAAU,MAAME,CAAI,IAAI,IAAIF,EAAUE,CAAI,IAAID,EAAU,KAAKC,CAAI;AAAA,EAC5E;AAAA,EACA,UAAU;AAAE,WAAOG,EAAM;AAAA,EAAO;AAAA,EAChC,GAAGC,GAAO;AACN,WAAOA,aAAiBN,KAAaM,EAAM,QAAQ,KAAK;AAAA,EAC5D;AAAA,EACA,SAAS;AACL,WAAO,EAAE,MAAM,aAAa,KAAK,KAAK,KAAI;AAAA,EAC9C;AAAA;AAAA;AAAA;AAAA,EAIA,OAAO,SAASH,GAAKI,GAAM;AACvB,QAAI,OAAOA,EAAK,OAAO;AACnB,YAAM,IAAI,WAAW,sCAAsC;AAC/D,WAAO,IAAIP,EAAUG,EAAI,QAAQI,EAAK,GAAG,CAAC;AAAA,EAC9C;AAAA;AAAA;AAAA;AAAA,EAIA,cAAc;AAAE,WAAO,IAAIC,EAAY,KAAK,MAAM;AAAA,EAAG;AAAA;AAAA;AAAA;AAAA,EAIrD,OAAO,MAAMN,GAAM;AACf,QAAIO,IAASP,EAAK;AAClB,QAAIO,EAAO,iBAAiB,CAACC,EAAaR,CAAI,KAAK,CAACS,EAAYT,CAAI;AAChE,aAAO;AACX,QAAIU,IAAWH,EAAO,KAAK,KAAK;AAChC,QAAIG,KAAY;AACZ,aAAOA;AACX,QAAIC,IAAQJ,EAAO,eAAeP,EAAK,MAAK,CAAE,EAAE;AAChD,WAAOW,KAASA,EAAM;AAAA,EAC1B;AAAA;AAAA;AAAA;AAAA,EAIA,OAAO,kBAAkBX,GAAMY,GAAKC,IAAW,IAAO;AAClD,IAAAC,EAAQ,YAAS;AACb,UAAI,CAACD,KAAYf,EAAU,MAAME,CAAI;AACjC,eAAOA;AACX,UAAIe,IAAMf,EAAK,KAAKgB,IAAO;AAE3B,eAASC,IAAIjB,EAAK,SAAQiB,KAAK;AAC3B,YAAIV,IAASP,EAAK,KAAKiB,CAAC;AACxB,YAAIL,IAAM,IAAIZ,EAAK,WAAWiB,CAAC,IAAIV,EAAO,aAAaP,EAAK,MAAMiB,CAAC,IAAI,GAAG;AACtE,UAAAD,IAAOT,EAAO,MAAMK,IAAM,IAAIZ,EAAK,WAAWiB,CAAC,IAAIjB,EAAK,MAAMiB,CAAC,IAAI,CAAC;AACpE;AAAA,QACJ,WACSA,KAAK;AACV,iBAAO;AAEX,QAAAF,KAAOH;AACP,YAAIM,IAAOlB,EAAK,IAAI,QAAQe,CAAG;AAC/B,YAAIjB,EAAU,MAAMoB,CAAI;AACpB,iBAAOA;AAAA,MACf;AAEA,iBAAS;AACL,YAAIC,IAASP,IAAM,IAAII,EAAK,aAAaA,EAAK;AAC9C,YAAI,CAACG,GAAQ;AACT,cAAIH,EAAK,UAAU,CAACA,EAAK,UAAU,CAACI,EAAc,aAAaJ,CAAI,GAAG;AAClE,YAAAhB,IAAOA,EAAK,IAAI,QAAQe,IAAMC,EAAK,WAAWJ,CAAG,GACjDC,IAAW;AACX,qBAASC;AAAA,UACb;AACA;AAAA,QACJ;AACA,QAAAE,IAAOG,GACPJ,KAAOH;AACP,YAAIM,IAAOlB,EAAK,IAAI,QAAQe,CAAG;AAC/B,YAAIjB,EAAU,MAAMoB,CAAI;AACpB,iBAAOA;AAAA,MACf;AACA,aAAO;AAAA,IACX;AAAA,EACJ;AACJ;AACApB,EAAU,UAAU,UAAU;AAC9BA,EAAU,WAAWA,EAAU;AAC/BC,EAAU,OAAO,aAAaD,CAAS;AACvC,MAAMQ,EAAY;AAAA,EACd,YAAYS,GAAK;AACb,SAAK,MAAMA;AAAA,EACf;AAAA,EACA,IAAIb,GAAS;AACT,WAAO,IAAII,EAAYJ,EAAQ,IAAI,KAAK,GAAG,CAAC;AAAA,EAChD;AAAA,EACA,QAAQD,GAAK;AACT,QAAID,IAAOC,EAAI,QAAQ,KAAK,GAAG;AAC/B,WAAOH,EAAU,MAAME,CAAI,IAAI,IAAIF,EAAUE,CAAI,IAAID,EAAU,KAAKC,CAAI;AAAA,EAC5E;AACJ;AACA,SAASqB,EAASC,GAAM;AACpB,SAAOA,EAAK,UAAUA,EAAK,KAAK,aAAaA,EAAK,KAAK;AAC3D;AACA,SAASd,EAAaR,GAAM;AACxB,WAASiB,IAAIjB,EAAK,OAAOiB,KAAK,GAAGA,KAAK;AAClC,QAAIM,IAAQvB,EAAK,MAAMiB,CAAC,GAAGV,IAASP,EAAK,KAAKiB,CAAC;AAE/C,QAAIM,KAAS,GAAG;AACZ,UAAIhB,EAAO,KAAK,KAAK;AACjB,eAAO;AACX;AAAA,IACJ;AAEA,aAASiB,IAASjB,EAAO,MAAMgB,IAAQ,CAAC,KAAIC,IAASA,EAAO,WAAW;AACnE,UAAKA,EAAO,cAAc,KAAK,CAACA,EAAO,iBAAkBH,EAASG,EAAO,IAAI;AACzE,eAAO;AACX,UAAIA,EAAO;AACP,eAAO;AAAA,IACf;AAAA,EACJ;AAEA,SAAO;AACX;AACA,SAASf,EAAYT,GAAM;AACvB,WAASiB,IAAIjB,EAAK,OAAOiB,KAAK,GAAGA,KAAK;AAClC,QAAIM,IAAQvB,EAAK,WAAWiB,CAAC,GAAGV,IAASP,EAAK,KAAKiB,CAAC;AACpD,QAAIM,KAAShB,EAAO,YAAY;AAC5B,UAAIA,EAAO,KAAK,KAAK;AACjB,eAAO;AACX;AAAA,IACJ;AACA,aAASkB,IAAQlB,EAAO,MAAMgB,CAAK,KAAIE,IAAQA,EAAM,YAAY;AAC7D,UAAKA,EAAM,cAAc,KAAK,CAACA,EAAM,iBAAkBJ,EAASI,EAAM,IAAI;AACtE,eAAO;AACX,UAAIA,EAAM;AACN,eAAO;AAAA,IACf;AAAA,EACJ;AACA,SAAO;AACX;AAWA,SAASC,IAAY;AACjB,SAAO,IAAIC,EAAO;AAAA,IACd,OAAO;AAAA,MACH,aAAaC;AAAA,MACb,uBAAuBC,GAAOC,GAASC,GAAO;AAC1C,eAAOD,EAAQ,OAAOC,EAAM,OAAOjC,EAAU,MAAMiC,CAAK,IAAI,IAAIjC,EAAUiC,CAAK,IAAI;AAAA,MACvF;AAAA,MACA,aAAAC;AAAA,MACA,eAAAC;AAAA,MACA,iBAAiB,EAAE,aAAaC,EAAW;AAAA,IACvD;AAAA,EACA,CAAK;AACL;AACA,MAAMD,IAAgBE,EAAe;AAAA,EACjC,WAAaC,EAAM,SAAS,EAAE;AAAA,EAC9B,YAAcA,EAAM,SAAS,CAAC;AAAA,EAC9B,SAAWA,EAAM,QAAQ,EAAE;AAAA,EAC3B,WAAaA,EAAM,QAAQ,CAAC;AAChC,CAAC;AACD,SAASA,EAAMC,GAAMzB,GAAK;AACtB,QAAM0B,IAASD,KAAQ,SAAUzB,IAAM,IAAI,SAAS,OAASA,IAAM,IAAI,UAAU;AACjF,SAAO,SAAU2B,GAAOC,GAAUC,GAAM;AACpC,QAAIC,IAAMH,EAAM,WACZI,IAAS/B,IAAM,IAAI8B,EAAI,MAAMA,EAAI,OAAO7B,IAAW6B,EAAI;AAC3D,QAAIA,aAAeE,GAAe;AAC9B,UAAI,CAACH,EAAK,eAAeH,CAAM,KAAKK,EAAO,SAAS;AAChD,eAAO;AACX,MAAA9B,IAAW,IACX8B,IAASJ,EAAM,IAAI,QAAQ3B,IAAM,IAAI+B,EAAO,MAAK,IAAKA,EAAO,OAAM,CAAE;AAAA,IACzE;AACA,QAAIE,IAAS/C,EAAU,kBAAkB6C,GAAQ/B,GAAKC,CAAQ;AAC9D,WAAKgC,KAEDL,KACAA,EAASD,EAAM,GAAG,aAAa,IAAIzC,EAAU+C,CAAM,CAAC,CAAC,GAClD,MAHI;AAAA,EAIf;AACJ;AACA,SAASb,EAAYS,GAAM1B,GAAK+B,GAAO;AACnC,MAAI,CAACL,KAAQ,CAACA,EAAK;AACf,WAAO;AACX,MAAIzC,IAAOyC,EAAK,MAAM,IAAI,QAAQ1B,CAAG;AACrC,MAAI,CAACjB,EAAU,MAAME,CAAI;AACrB,WAAO;AACX,MAAI+C,IAAWN,EAAK,YAAY,EAAE,MAAMK,EAAM,SAAS,KAAKA,EAAM,SAAS;AAC3E,SAAIC,KAAYA,EAAS,SAAS,MAAM3B,EAAc,aAAaqB,EAAK,MAAM,IAAI,OAAOM,EAAS,MAAM,CAAC,IAC9F,MACXN,EAAK,SAASA,EAAK,MAAM,GAAG,aAAa,IAAI3C,EAAUE,CAAI,CAAC,CAAC,GACtD;AACX;AAKA,SAASkC,EAAYO,GAAMK,GAAO;AAC9B,MAAIA,EAAM,aAAa,2BAA2B,EAAEL,EAAK,MAAM,qBAAqB3C;AAChF,WAAO;AACX,MAAI,EAAE,OAAAkD,EAAK,IAAKP,EAAK,MAAM,WACvBQ,IAASD,EAAM,OAAO,eAAeA,EAAM,MAAK,CAAE,EAAE,aAAaP,EAAK,MAAM,OAAO,MAAM,IAAI;AACjG,MAAI,CAACQ;AACD,WAAO;AACX,MAAIC,IAAOC,EAAS;AACpB,WAASC,IAAIH,EAAO,SAAS,GAAGG,KAAK,GAAGA;AACpC,IAAAF,IAAOC,EAAS,KAAKF,EAAOG,CAAC,EAAE,cAAc,MAAMF,CAAI,CAAC;AAC5D,MAAIG,IAAKZ,EAAK,MAAM,GAAG,QAAQO,EAAM,KAAKA,EAAM,KAAK,IAAI7C,EAAM+C,GAAM,GAAG,CAAC,CAAC;AAC1E,SAAAG,EAAG,aAAaT,EAAc,KAAKS,EAAG,IAAI,QAAQL,EAAM,MAAM,CAAC,CAAC,CAAC,GACjEP,EAAK,SAASY,CAAE,GACT;AACX;AACA,SAASzB,EAAcW,GAAO;AAC1B,MAAI,EAAEA,EAAM,qBAAqBzC;AAC7B,WAAO;AACX,MAAIwD,IAAO,SAAS,cAAc,KAAK;AACvC,SAAAA,EAAK,YAAY,yBACVC,EAAc,OAAOhB,EAAM,KAAK,CAACiB,EAAW,OAAOjB,EAAM,UAAU,MAAMe,GAAM,EAAE,KAAK,YAAW,CAAE,CAAC,CAAC;AAChH;","x_google_ignoreList":[0]}

package/dist/chunks/vendor-prosemirror-history-_AfZxoMt.js

@@ -0,0 +1,248 @@
+import { R as b } from "./vendor-rope-sequence-BWC2FSrq.js";
+import { M as k } from "./vendor-prosemirror-transform-DVGD47fI.js";
+import { P as H, a as O } from "./vendor-prosemirror-state-BvFA7AjG.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 || !t.editable ? !1 : (e.preventDefault(), s(t.state, t.dispatch));
+        }
+      }
+    }
+  });
+}
+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/dist/chunks/vendor-prosemirror-history-_AfZxoMt.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"vendor-prosemirror-history-_AfZxoMt.js","sources":["../../../node_modules/prosemirror-history/dist/index.js"],"sourcesContent":["import RopeSequence from 'rope-sequence';\nimport { Mapping } from 'prosemirror-transform';\nimport { PluginKey, Plugin } from 'prosemirror-state';\n\n// ProseMirror's history isn't simply a way to roll back to a previous\n// state, because ProseMirror supports applying changes without adding\n// them to the history (for example during collaboration).\n//\n// To this end, each 'Branch' (one for the undo history and one for\n// the redo history) keeps an array of 'Items', which can optionally\n// hold a step (an actual undoable change), and always hold a position\n// map (which is needed to move changes below them to apply to the\n// current document).\n//\n// An item that has both a step and a selection bookmark is the start\n// of an 'event' — a group of changes that will be undone or redone at\n// once. (It stores only the bookmark, since that way we don't have to\n// provide a document until the selection is actually applied, which\n// is useful when compressing.)\n// Used to schedule history compression\nconst max_empty_items = 500;\nclass Branch {\n    constructor(items, eventCount) {\n        this.items = items;\n        this.eventCount = eventCount;\n    }\n    // Pop the latest event off the branch's history and apply it\n    // to a document transform.\n    popEvent(state, preserveItems) {\n        if (this.eventCount == 0)\n            return null;\n        let end = this.items.length;\n        for (;; end--) {\n            let next = this.items.get(end - 1);\n            if (next.selection) {\n                --end;\n                break;\n            }\n        }\n        let remap, mapFrom;\n        if (preserveItems) {\n            remap = this.remapping(end, this.items.length);\n            mapFrom = remap.maps.length;\n        }\n        let transform = state.tr;\n        let selection, remaining;\n        let addAfter = [], addBefore = [];\n        this.items.forEach((item, i) => {\n            if (!item.step) {\n                if (!remap) {\n                    remap = this.remapping(end, i + 1);\n                    mapFrom = remap.maps.length;\n                }\n                mapFrom--;\n                addBefore.push(item);\n                return;\n            }\n            if (remap) {\n                addBefore.push(new Item(item.map));\n                let step = item.step.map(remap.slice(mapFrom)), map;\n                if (step && transform.maybeStep(step).doc) {\n                    map = transform.mapping.maps[transform.mapping.maps.length - 1];\n                    addAfter.push(new Item(map, undefined, undefined, addAfter.length + addBefore.length));\n                }\n                mapFrom--;\n                if (map)\n                    remap.appendMap(map, mapFrom);\n            }\n            else {\n                transform.maybeStep(item.step);\n            }\n            if (item.selection) {\n                selection = remap ? item.selection.map(remap.slice(mapFrom)) : item.selection;\n                remaining = new Branch(this.items.slice(0, end).append(addBefore.reverse().concat(addAfter)), this.eventCount - 1);\n                return false;\n            }\n        }, this.items.length, 0);\n        return { remaining: remaining, transform, selection: selection };\n    }\n    // Create a new branch with the given transform added.\n    addTransform(transform, selection, histOptions, preserveItems) {\n        let newItems = [], eventCount = this.eventCount;\n        let oldItems = this.items, lastItem = !preserveItems && oldItems.length ? oldItems.get(oldItems.length - 1) : null;\n        for (let i = 0; i < transform.steps.length; i++) {\n            let step = transform.steps[i].invert(transform.docs[i]);\n            let item = new Item(transform.mapping.maps[i], step, selection), merged;\n            if (merged = lastItem && lastItem.merge(item)) {\n                item = merged;\n                if (i)\n                    newItems.pop();\n                else\n                    oldItems = oldItems.slice(0, oldItems.length - 1);\n            }\n            newItems.push(item);\n            if (selection) {\n                eventCount++;\n                selection = undefined;\n            }\n            if (!preserveItems)\n                lastItem = item;\n        }\n        let overflow = eventCount - histOptions.depth;\n        if (overflow > DEPTH_OVERFLOW) {\n            oldItems = cutOffEvents(oldItems, overflow);\n            eventCount -= overflow;\n        }\n        return new Branch(oldItems.append(newItems), eventCount);\n    }\n    remapping(from, to) {\n        let maps = new Mapping;\n        this.items.forEach((item, i) => {\n            let mirrorPos = item.mirrorOffset != null && i - item.mirrorOffset >= from\n                ? maps.maps.length - item.mirrorOffset : undefined;\n            maps.appendMap(item.map, mirrorPos);\n        }, from, to);\n        return maps;\n    }\n    addMaps(array) {\n        if (this.eventCount == 0)\n            return this;\n        return new Branch(this.items.append(array.map(map => new Item(map))), this.eventCount);\n    }\n    // When the collab module receives remote changes, the history has\n    // to know about those, so that it can adjust the steps that were\n    // rebased on top of the remote changes, and include the position\n    // maps for the remote changes in its array of items.\n    rebased(rebasedTransform, rebasedCount) {\n        if (!this.eventCount)\n            return this;\n        let rebasedItems = [], start = Math.max(0, this.items.length - rebasedCount);\n        let mapping = rebasedTransform.mapping;\n        let newUntil = rebasedTransform.steps.length;\n        let eventCount = this.eventCount;\n        this.items.forEach(item => { if (item.selection)\n            eventCount--; }, start);\n        let iRebased = rebasedCount;\n        this.items.forEach(item => {\n            let pos = mapping.getMirror(--iRebased);\n            if (pos == null)\n                return;\n            newUntil = Math.min(newUntil, pos);\n            let map = mapping.maps[pos];\n            if (item.step) {\n                let step = rebasedTransform.steps[pos].invert(rebasedTransform.docs[pos]);\n                let selection = item.selection && item.selection.map(mapping.slice(iRebased + 1, pos));\n                if (selection)\n                    eventCount++;\n                rebasedItems.push(new Item(map, step, selection));\n            }\n            else {\n                rebasedItems.push(new Item(map));\n            }\n        }, start);\n        let newMaps = [];\n        for (let i = rebasedCount; i < newUntil; i++)\n            newMaps.push(new Item(mapping.maps[i]));\n        let items = this.items.slice(0, start).append(newMaps).append(rebasedItems);\n        let branch = new Branch(items, eventCount);\n        if (branch.emptyItemCount() > max_empty_items)\n            branch = branch.compress(this.items.length - rebasedItems.length);\n        return branch;\n    }\n    emptyItemCount() {\n        let count = 0;\n        this.items.forEach(item => { if (!item.step)\n            count++; });\n        return count;\n    }\n    // Compressing a branch means rewriting it to push the air (map-only\n    // items) out. During collaboration, these naturally accumulate\n    // because each remote change adds one. The `upto` argument is used\n    // to ensure that only the items below a given level are compressed,\n    // because `rebased` relies on a clean, untouched set of items in\n    // order to associate old items with rebased steps.\n    compress(upto = this.items.length) {\n        let remap = this.remapping(0, upto), mapFrom = remap.maps.length;\n        let items = [], events = 0;\n        this.items.forEach((item, i) => {\n            if (i >= upto) {\n                items.push(item);\n                if (item.selection)\n                    events++;\n            }\n            else if (item.step) {\n                let step = item.step.map(remap.slice(mapFrom)), map = step && step.getMap();\n                mapFrom--;\n                if (map)\n                    remap.appendMap(map, mapFrom);\n                if (step) {\n                    let selection = item.selection && item.selection.map(remap.slice(mapFrom));\n                    if (selection)\n                        events++;\n                    let newItem = new Item(map.invert(), step, selection), merged, last = items.length - 1;\n                    if (merged = items.length && items[last].merge(newItem))\n                        items[last] = merged;\n                    else\n                        items.push(newItem);\n                }\n            }\n            else if (item.map) {\n                mapFrom--;\n            }\n        }, this.items.length, 0);\n        return new Branch(RopeSequence.from(items.reverse()), events);\n    }\n}\nBranch.empty = new Branch(RopeSequence.empty, 0);\nfunction cutOffEvents(items, n) {\n    let cutPoint;\n    items.forEach((item, i) => {\n        if (item.selection && (n-- == 0)) {\n            cutPoint = i;\n            return false;\n        }\n    });\n    return items.slice(cutPoint);\n}\nclass Item {\n    constructor(\n    // The (forward) step map for this item.\n    map, \n    // The inverted step\n    step, \n    // If this is non-null, this item is the start of a group, and\n    // this selection is the starting selection for the group (the one\n    // that was active before the first step was applied)\n    selection, \n    // If this item is the inverse of a previous mapping on the stack,\n    // this points at the inverse's offset\n    mirrorOffset) {\n        this.map = map;\n        this.step = step;\n        this.selection = selection;\n        this.mirrorOffset = mirrorOffset;\n    }\n    merge(other) {\n        if (this.step && other.step && !other.selection) {\n            let step = other.step.merge(this.step);\n            if (step)\n                return new Item(step.getMap().invert(), step, this.selection);\n        }\n    }\n}\n// The value of the state field that tracks undo/redo history for that\n// state. Will be stored in the plugin state when the history plugin\n// is active.\nclass HistoryState {\n    constructor(done, undone, prevRanges, prevTime, prevComposition) {\n        this.done = done;\n        this.undone = undone;\n        this.prevRanges = prevRanges;\n        this.prevTime = prevTime;\n        this.prevComposition = prevComposition;\n    }\n}\nconst DEPTH_OVERFLOW = 20;\n// Record a transformation in undo history.\nfunction applyTransaction(history, state, tr, options) {\n    let historyTr = tr.getMeta(historyKey), rebased;\n    if (historyTr)\n        return historyTr.historyState;\n    if (tr.getMeta(closeHistoryKey))\n        history = new HistoryState(history.done, history.undone, null, 0, -1);\n    let appended = tr.getMeta(\"appendedTransaction\");\n    if (tr.steps.length == 0) {\n        return history;\n    }\n    else if (appended && appended.getMeta(historyKey)) {\n        if (appended.getMeta(historyKey).redo)\n            return new HistoryState(history.done.addTransform(tr, undefined, options, mustPreserveItems(state)), history.undone, rangesFor(tr.mapping.maps), history.prevTime, history.prevComposition);\n        else\n            return new HistoryState(history.done, history.undone.addTransform(tr, undefined, options, mustPreserveItems(state)), null, history.prevTime, history.prevComposition);\n    }\n    else if (tr.getMeta(\"addToHistory\") !== false && !(appended && appended.getMeta(\"addToHistory\") === false)) {\n        // Group transforms that occur in quick succession into one event.\n        let composition = tr.getMeta(\"composition\");\n        let newGroup = history.prevTime == 0 ||\n            (!appended && history.prevComposition != composition &&\n                (history.prevTime < (tr.time || 0) - options.newGroupDelay || !isAdjacentTo(tr, history.prevRanges)));\n        let prevRanges = appended ? mapRanges(history.prevRanges, tr.mapping) : rangesFor(tr.mapping.maps);\n        return new HistoryState(history.done.addTransform(tr, newGroup ? state.selection.getBookmark() : undefined, options, mustPreserveItems(state)), Branch.empty, prevRanges, tr.time, composition == null ? history.prevComposition : composition);\n    }\n    else if (rebased = tr.getMeta(\"rebased\")) {\n        // Used by the collab module to tell the history that some of its\n        // content has been rebased.\n        return new HistoryState(history.done.rebased(tr, rebased), history.undone.rebased(tr, rebased), mapRanges(history.prevRanges, tr.mapping), history.prevTime, history.prevComposition);\n    }\n    else {\n        return new HistoryState(history.done.addMaps(tr.mapping.maps), history.undone.addMaps(tr.mapping.maps), mapRanges(history.prevRanges, tr.mapping), history.prevTime, history.prevComposition);\n    }\n}\nfunction isAdjacentTo(transform, prevRanges) {\n    if (!prevRanges)\n        return false;\n    if (!transform.docChanged)\n        return true;\n    let adjacent = false;\n    transform.mapping.maps[0].forEach((start, end) => {\n        for (let i = 0; i < prevRanges.length; i += 2)\n            if (start <= prevRanges[i + 1] && end >= prevRanges[i])\n                adjacent = true;\n    });\n    return adjacent;\n}\nfunction rangesFor(maps) {\n    let result = [];\n    for (let i = maps.length - 1; i >= 0 && result.length == 0; i--)\n        maps[i].forEach((_from, _to, from, to) => result.push(from, to));\n    return result;\n}\nfunction mapRanges(ranges, mapping) {\n    if (!ranges)\n        return null;\n    let result = [];\n    for (let i = 0; i < ranges.length; i += 2) {\n        let from = mapping.map(ranges[i], 1), to = mapping.map(ranges[i + 1], -1);\n        if (from <= to)\n            result.push(from, to);\n    }\n    return result;\n}\n// Apply the latest event from one branch to the document and shift the event\n// onto the other branch.\nfunction histTransaction(history, state, redo) {\n    let preserveItems = mustPreserveItems(state);\n    let histOptions = historyKey.get(state).spec.config;\n    let pop = (redo ? history.undone : history.done).popEvent(state, preserveItems);\n    if (!pop)\n        return null;\n    let selection = pop.selection.resolve(pop.transform.doc);\n    let added = (redo ? history.done : history.undone).addTransform(pop.transform, state.selection.getBookmark(), histOptions, preserveItems);\n    let newHist = new HistoryState(redo ? added : pop.remaining, redo ? pop.remaining : added, null, 0, -1);\n    return pop.transform.setSelection(selection).setMeta(historyKey, { redo, historyState: newHist });\n}\nlet cachedPreserveItems = false, cachedPreserveItemsPlugins = null;\n// Check whether any plugin in the given state has a\n// `historyPreserveItems` property in its spec, in which case we must\n// preserve steps exactly as they came in, so that they can be\n// rebased.\nfunction mustPreserveItems(state) {\n    let plugins = state.plugins;\n    if (cachedPreserveItemsPlugins != plugins) {\n        cachedPreserveItems = false;\n        cachedPreserveItemsPlugins = plugins;\n        for (let i = 0; i < plugins.length; i++)\n            if (plugins[i].spec.historyPreserveItems) {\n                cachedPreserveItems = true;\n                break;\n            }\n    }\n    return cachedPreserveItems;\n}\n/**\nSet a flag on the given transaction that will prevent further steps\nfrom being appended to an existing history event (so that they\nrequire a separate undo command to undo).\n*/\nfunction closeHistory(tr) {\n    return tr.setMeta(closeHistoryKey, true);\n}\nconst historyKey = new PluginKey(\"history\");\nconst closeHistoryKey = new PluginKey(\"closeHistory\");\n/**\nReturns a plugin that enables the undo history for an editor. The\nplugin will track undo and redo stacks, which can be used with the\n[`undo`](https://prosemirror.net/docs/ref/#history.undo) and [`redo`](https://prosemirror.net/docs/ref/#history.redo) commands.\n\nYou can set an `\"addToHistory\"` [metadata\nproperty](https://prosemirror.net/docs/ref/#state.Transaction.setMeta) of `false` on a transaction\nto prevent it from being rolled back by undo.\n*/\nfunction history(config = {}) {\n    config = { depth: config.depth || 100,\n        newGroupDelay: config.newGroupDelay || 500 };\n    return new Plugin({\n        key: historyKey,\n        state: {\n            init() {\n                return new HistoryState(Branch.empty, Branch.empty, null, 0, -1);\n            },\n            apply(tr, hist, state) {\n                return applyTransaction(hist, state, tr, config);\n            }\n        },\n        config,\n        props: {\n            handleDOMEvents: {\n                beforeinput(view, e) {\n                    let inputType = e.inputType;\n                    let command = inputType == \"historyUndo\" ? undo : inputType == \"historyRedo\" ? redo : null;\n                    if (!command || !view.editable)\n                        return false;\n                    e.preventDefault();\n                    return command(view.state, view.dispatch);\n                }\n            }\n        }\n    });\n}\nfunction buildCommand(redo, scroll) {\n    return (state, dispatch) => {\n        let hist = historyKey.getState(state);\n        if (!hist || (redo ? hist.undone : hist.done).eventCount == 0)\n            return false;\n        if (dispatch) {\n            let tr = histTransaction(hist, state, redo);\n            if (tr)\n                dispatch(scroll ? tr.scrollIntoView() : tr);\n        }\n        return true;\n    };\n}\n/**\nA command function that undoes the last change, if any.\n*/\nconst undo = buildCommand(false, true);\n/**\nA command function that redoes the last undone change, if any.\n*/\nconst redo = buildCommand(true, true);\n/**\nA command function that undoes the last change. Don't scroll the\nselection into view.\n*/\nconst undoNoScroll = buildCommand(false, false);\n/**\nA command function that redoes the last undone change. Don't\nscroll the selection into view.\n*/\nconst redoNoScroll = buildCommand(true, false);\n/**\nThe amount of undoable events available in a given state.\n*/\nfunction undoDepth(state) {\n    let hist = historyKey.getState(state);\n    return hist ? hist.done.eventCount : 0;\n}\n/**\nThe amount of redoable events available in a given editor state.\n*/\nfunction redoDepth(state) {\n    let hist = historyKey.getState(state);\n    return hist ? hist.undone.eventCount : 0;\n}\n/**\nReturns true if the given transaction was generated by the history\nplugin.\n*/\nfunction isHistoryTransaction(tr) {\n    return tr.getMeta(historyKey) != null;\n}\n\nexport { closeHistory, history, isHistoryTransaction, redo, redoDepth, redoNoScroll, undo, undoDepth, undoNoScroll };\n"],"names":["max_empty_items","Branch","items","eventCount","state","preserveItems","end","remap","mapFrom","transform","selection","remaining","addAfter","addBefore","item","i","Item","step","map","histOptions","newItems","oldItems","lastItem","merged","overflow","DEPTH_OVERFLOW","cutOffEvents","from","to","maps","Mapping","mirrorPos","array","rebasedTransform","rebasedCount","rebasedItems","start","mapping","newUntil","iRebased","pos","newMaps","branch","count","upto","events","newItem","last","RopeSequence","n","cutPoint","mirrorOffset","other","HistoryState","done","undone","prevRanges","prevTime","prevComposition","applyTransaction","history","tr","options","historyTr","historyKey","rebased","closeHistoryKey","appended","mustPreserveItems","rangesFor","composition","newGroup","isAdjacentTo","mapRanges","adjacent","result","_from","_to","ranges","histTransaction","redo","pop","added","newHist","cachedPreserveItems","cachedPreserveItemsPlugins","plugins","PluginKey","config","Plugin","hist","view","inputType","command","undo","buildCommand","scroll","dispatch"],"mappings":";;;AAoBA,MAAMA,IAAkB;AACxB,MAAMC,EAAO;AAAA,EACT,YAAYC,GAAOC,GAAY;AAC3B,SAAK,QAAQD,GACb,KAAK,aAAaC;AAAA,EACtB;AAAA;AAAA;AAAA,EAGA,SAASC,GAAOC,GAAe;AAC3B,QAAI,KAAK,cAAc;AACnB,aAAO;AACX,QAAIC,IAAM,KAAK,MAAM;AACrB,aAAQA;AAEJ,UADW,KAAK,MAAM,IAAIA,IAAM,CAAC,EACxB,WAAW;AAChB,UAAEA;AACF;AAAA,MACJ;AAEJ,QAAIC,GAAOC;AACX,IAAIH,MACAE,IAAQ,KAAK,UAAUD,GAAK,KAAK,MAAM,MAAM,GAC7CE,IAAUD,EAAM,KAAK;AAEzB,QAAIE,IAAYL,EAAM,IAClBM,GAAWC,GACXC,IAAW,IAAIC,IAAY,CAAA;AAC/B,gBAAK,MAAM,QAAQ,CAACC,GAAMC,MAAM;AAC5B,UAAI,CAACD,EAAK,MAAM;AACZ,QAAKP,MACDA,IAAQ,KAAK,UAAUD,GAAKS,IAAI,CAAC,GACjCP,IAAUD,EAAM,KAAK,SAEzBC,KACAK,EAAU,KAAKC,CAAI;AACnB;AAAA,MACJ;AACA,UAAIP,GAAO;AACP,QAAAM,EAAU,KAAK,IAAIG,EAAKF,EAAK,GAAG,CAAC;AACjC,YAAIG,IAAOH,EAAK,KAAK,IAAIP,EAAM,MAAMC,CAAO,CAAC,GAAGU;AAChD,QAAID,KAAQR,EAAU,UAAUQ,CAAI,EAAE,QAClCC,IAAMT,EAAU,QAAQ,KAAKA,EAAU,QAAQ,KAAK,SAAS,CAAC,GAC9DG,EAAS,KAAK,IAAII,EAAKE,GAAK,QAAW,QAAWN,EAAS,SAASC,EAAU,MAAM,CAAC,IAEzFL,KACIU,KACAX,EAAM,UAAUW,GAAKV,CAAO;AAAA,MACpC;AAEI,QAAAC,EAAU,UAAUK,EAAK,IAAI;AAEjC,UAAIA,EAAK;AACL,eAAAJ,IAAYH,IAAQO,EAAK,UAAU,IAAIP,EAAM,MAAMC,CAAO,CAAC,IAAIM,EAAK,WACpEH,IAAY,IAAIV,EAAO,KAAK,MAAM,MAAM,GAAGK,CAAG,EAAE,OAAOO,EAAU,QAAO,EAAG,OAAOD,CAAQ,CAAC,GAAG,KAAK,aAAa,CAAC,GAC1G;AAAA,IAEf,GAAG,KAAK,MAAM,QAAQ,CAAC,GAChB,EAAE,WAAWD,GAAW,WAAAF,GAAW,WAAWC,EAAS;AAAA,EAClE;AAAA;AAAA,EAEA,aAAaD,GAAWC,GAAWS,GAAad,GAAe;AAC3D,QAAIe,IAAW,CAAA,GAAIjB,IAAa,KAAK,YACjCkB,IAAW,KAAK,OAAOC,IAAW,CAACjB,KAAiBgB,EAAS,SAASA,EAAS,IAAIA,EAAS,SAAS,CAAC,IAAI;AAC9G,aAASN,IAAI,GAAGA,IAAIN,EAAU,MAAM,QAAQM,KAAK;AAC7C,UAAIE,IAAOR,EAAU,MAAMM,CAAC,EAAE,OAAON,EAAU,KAAKM,CAAC,CAAC,GAClDD,IAAO,IAAIE,EAAKP,EAAU,QAAQ,KAAKM,CAAC,GAAGE,GAAMP,CAAS,GAAGa;AACjE,OAAIA,IAASD,KAAYA,EAAS,MAAMR,CAAI,OACxCA,IAAOS,GACHR,IACAK,EAAS,IAAG,IAEZC,IAAWA,EAAS,MAAM,GAAGA,EAAS,SAAS,CAAC,IAExDD,EAAS,KAAKN,CAAI,GACdJ,MACAP,KACAO,IAAY,SAEXL,MACDiB,IAAWR;AAAA,IACnB;AACA,QAAIU,IAAWrB,IAAagB,EAAY;AACxC,WAAIK,IAAWC,MACXJ,IAAWK,EAAaL,GAAUG,CAAQ,GAC1CrB,KAAcqB,IAEX,IAAIvB,EAAOoB,EAAS,OAAOD,CAAQ,GAAGjB,CAAU;AAAA,EAC3D;AAAA,EACA,UAAUwB,GAAMC,GAAI;AAChB,QAAIC,IAAO,IAAIC;AACf,gBAAK,MAAM,QAAQ,CAAChB,GAAMC,MAAM;AAC5B,UAAIgB,IAAYjB,EAAK,gBAAgB,QAAQC,IAAID,EAAK,gBAAgBa,IAChEE,EAAK,KAAK,SAASf,EAAK,eAAe;AAC7C,MAAAe,EAAK,UAAUf,EAAK,KAAKiB,CAAS;AAAA,IACtC,GAAGJ,GAAMC,CAAE,GACJC;AAAA,EACX;AAAA,EACA,QAAQG,GAAO;AACX,WAAI,KAAK,cAAc,IACZ,OACJ,IAAI/B,EAAO,KAAK,MAAM,OAAO+B,EAAM,IAAI,CAAAd,MAAO,IAAIF,EAAKE,CAAG,CAAC,CAAC,GAAG,KAAK,UAAU;AAAA,EACzF;AAAA;AAAA;AAAA;AAAA;AAAA,EAKA,QAAQe,GAAkBC,GAAc;AACpC,QAAI,CAAC,KAAK;AACN,aAAO;AACX,QAAIC,IAAe,CAAA,GAAIC,IAAQ,KAAK,IAAI,GAAG,KAAK,MAAM,SAASF,CAAY,GACvEG,IAAUJ,EAAiB,SAC3BK,IAAWL,EAAiB,MAAM,QAClC9B,IAAa,KAAK;AACtB,SAAK,MAAM,QAAQ,CAAAW,MAAQ;AAAE,MAAIA,EAAK,aAClCX;AAAA,IAAc,GAAGiC,CAAK;AAC1B,QAAIG,IAAWL;AACf,SAAK,MAAM,QAAQ,CAAApB,MAAQ;AACvB,UAAI0B,IAAMH,EAAQ,UAAU,EAAEE,CAAQ;AACtC,UAAIC,KAAO;AACP;AACJ,MAAAF,IAAW,KAAK,IAAIA,GAAUE,CAAG;AACjC,UAAItB,IAAMmB,EAAQ,KAAKG,CAAG;AAC1B,UAAI1B,EAAK,MAAM;AACX,YAAIG,IAAOgB,EAAiB,MAAMO,CAAG,EAAE,OAAOP,EAAiB,KAAKO,CAAG,CAAC,GACpE9B,IAAYI,EAAK,aAAaA,EAAK,UAAU,IAAIuB,EAAQ,MAAME,IAAW,GAAGC,CAAG,CAAC;AACrF,QAAI9B,KACAP,KACJgC,EAAa,KAAK,IAAInB,EAAKE,GAAKD,GAAMP,CAAS,CAAC;AAAA,MACpD;AAEI,QAAAyB,EAAa,KAAK,IAAInB,EAAKE,CAAG,CAAC;AAAA,IAEvC,GAAGkB,CAAK;AACR,QAAIK,IAAU,CAAA;AACd,aAAS1B,IAAImB,GAAcnB,IAAIuB,GAAUvB;AACrC,MAAA0B,EAAQ,KAAK,IAAIzB,EAAKqB,EAAQ,KAAKtB,CAAC,CAAC,CAAC;AAC1C,QAAIb,IAAQ,KAAK,MAAM,MAAM,GAAGkC,CAAK,EAAE,OAAOK,CAAO,EAAE,OAAON,CAAY,GACtEO,IAAS,IAAIzC,EAAOC,GAAOC,CAAU;AACzC,WAAIuC,EAAO,eAAc,IAAK1C,MAC1B0C,IAASA,EAAO,SAAS,KAAK,MAAM,SAASP,EAAa,MAAM,IAC7DO;AAAA,EACX;AAAA,EACA,iBAAiB;AACb,QAAIC,IAAQ;AACZ,gBAAK,MAAM,QAAQ,CAAA7B,MAAQ;AAAE,MAAKA,EAAK,QACnC6B;AAAA,IAAS,CAAC,GACPA;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAOA,SAASC,IAAO,KAAK,MAAM,QAAQ;AAC/B,QAAIrC,IAAQ,KAAK,UAAU,GAAGqC,CAAI,GAAGpC,IAAUD,EAAM,KAAK,QACtDL,IAAQ,IAAI2C,IAAS;AACzB,gBAAK,MAAM,QAAQ,CAAC/B,GAAMC,MAAM;AAC5B,UAAIA,KAAK6B;AACL,QAAA1C,EAAM,KAAKY,CAAI,GACXA,EAAK,aACL+B;AAAA,eAEC/B,EAAK,MAAM;AAChB,YAAIG,IAAOH,EAAK,KAAK,IAAIP,EAAM,MAAMC,CAAO,CAAC,GAAGU,IAAMD,KAAQA,EAAK,OAAM;AAIzE,YAHAT,KACIU,KACAX,EAAM,UAAUW,GAAKV,CAAO,GAC5BS,GAAM;AACN,cAAIP,IAAYI,EAAK,aAAaA,EAAK,UAAU,IAAIP,EAAM,MAAMC,CAAO,CAAC;AACzE,UAAIE,KACAmC;AACJ,cAAIC,IAAU,IAAI9B,EAAKE,EAAI,OAAM,GAAID,GAAMP,CAAS,GAAGa,GAAQwB,IAAO7C,EAAM,SAAS;AACrF,WAAIqB,IAASrB,EAAM,UAAUA,EAAM6C,CAAI,EAAE,MAAMD,CAAO,KAClD5C,EAAM6C,CAAI,IAAIxB,IAEdrB,EAAM,KAAK4C,CAAO;AAAA,QAC1B;AAAA,MACJ,MACK,CAAIhC,EAAK,OACVN;AAAA,IAER,GAAG,KAAK,MAAM,QAAQ,CAAC,GAChB,IAAIP,EAAO+C,EAAa,KAAK9C,EAAM,QAAO,CAAE,GAAG2C,CAAM;AAAA,EAChE;AACJ;AACA5C,EAAO,QAAQ,IAAIA,EAAO+C,EAAa,OAAO,CAAC;AAC/C,SAAStB,EAAaxB,GAAO+C,GAAG;AAC5B,MAAIC;AACJ,SAAAhD,EAAM,QAAQ,CAACY,GAAMC,MAAM;AACvB,QAAID,EAAK,aAAcmC,OAAO;AAC1B,aAAAC,IAAWnC,GACJ;AAAA,EAEf,CAAC,GACMb,EAAM,MAAMgD,CAAQ;AAC/B;AACA,MAAMlC,EAAK;AAAA,EACP,YAEAE,GAEAD,GAIAP,GAGAyC,GAAc;AACV,SAAK,MAAMjC,GACX,KAAK,OAAOD,GACZ,KAAK,YAAYP,GACjB,KAAK,eAAeyC;AAAA,EACxB;AAAA,EACA,MAAMC,GAAO;AACT,QAAI,KAAK,QAAQA,EAAM,QAAQ,CAACA,EAAM,WAAW;AAC7C,UAAInC,IAAOmC,EAAM,KAAK,MAAM,KAAK,IAAI;AACrC,UAAInC;AACA,eAAO,IAAID,EAAKC,EAAK,OAAM,EAAG,UAAUA,GAAM,KAAK,SAAS;AAAA,IACpE;AAAA,EACJ;AACJ;AAIA,MAAMoC,EAAa;AAAA,EACf,YAAYC,GAAMC,GAAQC,GAAYC,GAAUC,GAAiB;AAC7D,SAAK,OAAOJ,GACZ,KAAK,SAASC,GACd,KAAK,aAAaC,GAClB,KAAK,WAAWC,GAChB,KAAK,kBAAkBC;AAAA,EAC3B;AACJ;AACA,MAAMjC,IAAiB;AAEvB,SAASkC,EAAiBC,GAASxD,GAAOyD,GAAIC,GAAS;AACnD,MAAIC,IAAYF,EAAG,QAAQG,CAAU,GAAGC;AACxC,MAAIF;AACA,WAAOA,EAAU;AACrB,EAAIF,EAAG,QAAQK,CAAe,MAC1BN,IAAU,IAAIP,EAAaO,EAAQ,MAAMA,EAAQ,QAAQ,MAAM,GAAG,EAAE;AACxE,MAAIO,IAAWN,EAAG,QAAQ,qBAAqB;AAC/C,MAAIA,EAAG,MAAM,UAAU;AACnB,WAAOD;AAEN,MAAIO,KAAYA,EAAS,QAAQH,CAAU;AAC5C,WAAIG,EAAS,QAAQH,CAAU,EAAE,OACtB,IAAIX,EAAaO,EAAQ,KAAK,aAAaC,GAAI,QAAWC,GAASM,EAAkBhE,CAAK,CAAC,GAAGwD,EAAQ,QAAQS,EAAUR,EAAG,QAAQ,IAAI,GAAGD,EAAQ,UAAUA,EAAQ,eAAe,IAEnL,IAAIP,EAAaO,EAAQ,MAAMA,EAAQ,OAAO,aAAaC,GAAI,QAAWC,GAASM,EAAkBhE,CAAK,CAAC,GAAG,MAAMwD,EAAQ,UAAUA,EAAQ,eAAe;AAEvK,MAAIC,EAAG,QAAQ,cAAc,MAAM,MAAS,EAAEM,KAAYA,EAAS,QAAQ,cAAc,MAAM,KAAQ;AAExG,QAAIG,IAAcT,EAAG,QAAQ,aAAa,GACtCU,IAAWX,EAAQ,YAAY,KAC9B,CAACO,KAAYP,EAAQ,mBAAmBU,MACpCV,EAAQ,YAAYC,EAAG,QAAQ,KAAKC,EAAQ,iBAAiB,CAACU,EAAaX,GAAID,EAAQ,UAAU,IACtGJ,IAAaW,IAAWM,EAAUb,EAAQ,YAAYC,EAAG,OAAO,IAAIQ,EAAUR,EAAG,QAAQ,IAAI;AACjG,WAAO,IAAIR,EAAaO,EAAQ,KAAK,aAAaC,GAAIU,IAAWnE,EAAM,UAAU,YAAW,IAAK,QAAW0D,GAASM,EAAkBhE,CAAK,CAAC,GAAGH,EAAO,OAAOuD,GAAYK,EAAG,MAAMS,KAAsBV,EAAQ,eAA6B;AAAA,EAClP,MACK,SAAIK,IAAUJ,EAAG,QAAQ,SAAS,KAG5B,IAAIR,EAAaO,EAAQ,KAAK,QAAQC,GAAII,CAAO,GAAGL,EAAQ,OAAO,QAAQC,GAAII,CAAO,GAAGQ,EAAUb,EAAQ,YAAYC,EAAG,OAAO,GAAGD,EAAQ,UAAUA,EAAQ,eAAe,IAG7K,IAAIP,EAAaO,EAAQ,KAAK,QAAQC,EAAG,QAAQ,IAAI,GAAGD,EAAQ,OAAO,QAAQC,EAAG,QAAQ,IAAI,GAAGY,EAAUb,EAAQ,YAAYC,EAAG,OAAO,GAAGD,EAAQ,UAAUA,EAAQ,eAAe;AAEpM;AACA,SAASY,EAAa/D,GAAW+C,GAAY;AACzC,MAAI,CAACA;AACD,WAAO;AACX,MAAI,CAAC/C,EAAU;AACX,WAAO;AACX,MAAIiE,IAAW;AACf,SAAAjE,EAAU,QAAQ,KAAK,CAAC,EAAE,QAAQ,CAAC2B,GAAO9B,MAAQ;AAC9C,aAASS,IAAI,GAAGA,IAAIyC,EAAW,QAAQzC,KAAK;AACxC,MAAIqB,KAASoB,EAAWzC,IAAI,CAAC,KAAKT,KAAOkD,EAAWzC,CAAC,MACjD2D,IAAW;AAAA,EACvB,CAAC,GACMA;AACX;AACA,SAASL,EAAUxC,GAAM;AACrB,MAAI8C,IAAS,CAAA;AACb,WAAS5D,IAAIc,EAAK,SAAS,GAAGd,KAAK,KAAK4D,EAAO,UAAU,GAAG5D;AACxD,IAAAc,EAAKd,CAAC,EAAE,QAAQ,CAAC6D,GAAOC,GAAKlD,GAAMC,MAAO+C,EAAO,KAAKhD,GAAMC,CAAE,CAAC;AACnE,SAAO+C;AACX;AACA,SAASF,EAAUK,GAAQzC,GAAS;AAChC,MAAI,CAACyC;AACD,WAAO;AACX,MAAIH,IAAS,CAAA;AACb,WAAS,IAAI,GAAG,IAAIG,EAAO,QAAQ,KAAK,GAAG;AACvC,QAAInD,IAAOU,EAAQ,IAAIyC,EAAO,CAAC,GAAG,CAAC,GAAGlD,IAAKS,EAAQ,IAAIyC,EAAO,IAAI,CAAC,GAAG,EAAE;AACxE,IAAInD,KAAQC,KACR+C,EAAO,KAAKhD,GAAMC,CAAE;AAAA,EAC5B;AACA,SAAO+C;AACX;AAGA,SAASI,EAAgBnB,GAASxD,GAAO4E,GAAM;AAC3C,MAAI3E,IAAgB+D,EAAkBhE,CAAK,GACvCe,IAAc6C,EAAW,IAAI5D,CAAK,EAAE,KAAK,QACzC6E,KAAOD,IAAOpB,EAAQ,SAASA,EAAQ,MAAM,SAASxD,GAAOC,CAAa;AAC9E,MAAI,CAAC4E;AACD,WAAO;AACX,MAAIvE,IAAYuE,EAAI,UAAU,QAAQA,EAAI,UAAU,GAAG,GACnDC,KAASF,IAAOpB,EAAQ,OAAOA,EAAQ,QAAQ,aAAaqB,EAAI,WAAW7E,EAAM,UAAU,YAAW,GAAIe,GAAad,CAAa,GACpI8E,IAAU,IAAI9B,EAAa2B,IAAOE,IAAQD,EAAI,WAAWD,IAAOC,EAAI,YAAYC,GAAO,MAAM,GAAG,EAAE;AACtG,SAAOD,EAAI,UAAU,aAAavE,CAAS,EAAE,QAAQsD,GAAY,EAAE,MAAAgB,GAAM,cAAcG,EAAO,CAAE;AACpG;AACA,IAAIC,IAAsB,IAAOC,IAA6B;AAK9D,SAASjB,EAAkBhE,GAAO;AAC9B,MAAIkF,IAAUlF,EAAM;AACpB,MAAIiF,KAA8BC,GAAS;AACvC,IAAAF,IAAsB,IACtBC,IAA6BC;AAC7B,aAASvE,IAAI,GAAGA,IAAIuE,EAAQ,QAAQvE;AAChC,UAAIuE,EAAQvE,CAAC,EAAE,KAAK,sBAAsB;AACtC,QAAAqE,IAAsB;AACtB;AAAA,MACJ;AAAA,EACR;AACA,SAAOA;AACX;AASA,MAAMpB,IAAa,IAAIuB,EAAU,SAAS,GACpCrB,IAAkB,IAAIqB,EAAU,cAAc;AAUpD,SAAS3B,EAAQ4B,IAAS,IAAI;AAC1B,SAAAA,IAAS;AAAA,IAAE,OAAOA,EAAO,SAAS;AAAA,IAC9B,eAAeA,EAAO,iBAAiB;AAAA,EAAG,GACvC,IAAIC,EAAO;AAAA,IACd,KAAKzB;AAAA,IACL,OAAO;AAAA,MACH,OAAO;AACH,eAAO,IAAIX,EAAapD,EAAO,OAAOA,EAAO,OAAO,MAAM,GAAG,EAAE;AAAA,MACnE;AAAA,MACA,MAAM4D,GAAI6B,GAAMtF,GAAO;AACnB,eAAOuD,EAAiB+B,GAAMtF,GAAOyD,GAAI2B,CAAM;AAAA,MACnD;AAAA,IACZ;AAAA,IACQ,QAAAA;AAAA,IACA,OAAO;AAAA,MACH,iBAAiB;AAAA,QACb,YAAYG,GAAM,GAAG;AACjB,cAAIC,IAAY,EAAE,WACdC,IAAUD,KAAa,gBAAgBE,IAAOF,KAAa,gBAAgBZ,IAAO;AACtF,iBAAI,CAACa,KAAW,CAACF,EAAK,WACX,MACX,EAAE,eAAc,GACTE,EAAQF,EAAK,OAAOA,EAAK,QAAQ;AAAA,QAC5C;AAAA,MAChB;AAAA,IACA;AAAA,EACA,CAAK;AACL;AACA,SAASI,EAAaf,GAAMgB,GAAQ;AAChC,SAAO,CAAC5F,GAAO6F,MAAa;AACxB,QAAIP,IAAO1B,EAAW,SAAS5D,CAAK;AACpC,QAAI,CAACsF,MAASV,IAAOU,EAAK,SAASA,EAAK,MAAM,cAAc;AACxD,aAAO;AACX,QAAIO,GAAU;AACV,UAAIpC,IAAKkB,EAAgBW,GAAMtF,GAAO4E,CAAI;AAC1C,MAAInB,KACAoC,EAASD,IAASnC,EAAG,eAAc,IAAKA,CAAE;AAAA,IAClD;AACA,WAAO;AAAA,EACX;AACJ;AAIK,MAACiC,IAAOC,EAAa,IAAO,EAAI,GAI/Bf,IAAOe,EAAa,IAAM,EAAI;","x_google_ignoreList":[0]}

package/dist/chunks/vendor-prosemirror-keymap-tvZqK1zZ.js

@@ -0,0 +1,62 @@
+import { k as u, b as c } from "./vendor-w3c-keyname-CLxH8j-f.js";
+import { P as d } from "./vendor-prosemirror-state-BvFA7AjG.js";
+const p = typeof navigator < "u" && /Mac|iP(hone|[oa]d)/.test(navigator.platform), y = typeof navigator < "u" && /Win/.test(navigator.platform);
+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))
+      p ? 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 h(e) {
+  let r = /* @__PURE__ */ Object.create(null);
+  for (let t in e)
+    r[m(t)] = e[t];
+  return r;
+}
+function n(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 $(e) {
+  return new d({ props: { handleKeyDown: K(e) } });
+}
+function K(e) {
+  let r = h(e);
+  return function(t, i) {
+    let f = u(i), o, a = r[n(f, i)];
+    if (a && a(t.state, t.dispatch, t))
+      return !0;
+    if (f.length == 1 && f != " ") {
+      if (i.shiftKey) {
+        let l = r[n(f, i, !1)];
+        if (l && l(t.state, t.dispatch, t))
+          return !0;
+      }
+      if ((i.altKey || i.metaKey || i.ctrlKey) && // Ctrl-Alt may be used for AltGr on Windows
+      !(y && i.ctrlKey && i.altKey) && (o = c[i.keyCode]) && o != f) {
+        let l = r[n(o, i)];
+        if (l && l(t.state, t.dispatch, t))
+          return !0;
+      }
+    }
+    return !1;
+  };
+}
+export {
+  K as a,
+  $ as k
+};

package/dist/chunks/vendor-prosemirror-keymap-tvZqK1zZ.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"vendor-prosemirror-keymap-tvZqK1zZ.js","sources":["../../../node_modules/prosemirror-keymap/dist/index.js"],"sourcesContent":["import { keyName, base } from 'w3c-keyname';\nimport { Plugin } from 'prosemirror-state';\n\nconst mac = typeof navigator != \"undefined\" && /Mac|iP(hone|[oa]d)/.test(navigator.platform);\nconst windows = typeof navigator != \"undefined\" && /Win/.test(navigator.platform);\nfunction normalizeKeyName(name) {\n    let parts = name.split(/-(?!$)/), result = parts[parts.length - 1];\n    if (result == \"Space\")\n        result = \" \";\n    let alt, ctrl, shift, meta;\n    for (let i = 0; i < parts.length - 1; i++) {\n        let mod = parts[i];\n        if (/^(cmd|meta|m)$/i.test(mod))\n            meta = true;\n        else if (/^a(lt)?$/i.test(mod))\n            alt = true;\n        else if (/^(c|ctrl|control)$/i.test(mod))\n            ctrl = true;\n        else if (/^s(hift)?$/i.test(mod))\n            shift = true;\n        else if (/^mod$/i.test(mod)) {\n            if (mac)\n                meta = true;\n            else\n                ctrl = true;\n        }\n        else\n            throw new Error(\"Unrecognized modifier name: \" + mod);\n    }\n    if (alt)\n        result = \"Alt-\" + result;\n    if (ctrl)\n        result = \"Ctrl-\" + result;\n    if (meta)\n        result = \"Meta-\" + result;\n    if (shift)\n        result = \"Shift-\" + result;\n    return result;\n}\nfunction normalize(map) {\n    let copy = Object.create(null);\n    for (let prop in map)\n        copy[normalizeKeyName(prop)] = map[prop];\n    return copy;\n}\nfunction modifiers(name, event, shift = true) {\n    if (event.altKey)\n        name = \"Alt-\" + name;\n    if (event.ctrlKey)\n        name = \"Ctrl-\" + name;\n    if (event.metaKey)\n        name = \"Meta-\" + name;\n    if (shift && event.shiftKey)\n        name = \"Shift-\" + name;\n    return name;\n}\n/**\nCreate a keymap plugin for the given set of bindings.\n\nBindings should map key names to [command](https://prosemirror.net/docs/ref/#commands)-style\nfunctions, which will be called with `(EditorState, dispatch,\nEditorView)` arguments, and should return true when they've handled\nthe key. Note that the view argument isn't part of the command\nprotocol, but can be used as an escape hatch if a binding needs to\ndirectly interact with the UI.\n\nKey names may be strings like `\"Shift-Ctrl-Enter\"`—a key\nidentifier prefixed with zero or more modifiers. Key identifiers\nare based on the strings that can appear in\n[`KeyEvent.key`](https:developer.mozilla.org/en-US/docs/Web/API/KeyboardEvent/key).\nUse lowercase letters to refer to letter keys (or uppercase letters\nif you want shift to be held). You may use `\"Space\"` as an alias\nfor the `\" \"` name.\n\nModifiers can be given in any order. `Shift-` (or `s-`), `Alt-` (or\n`a-`), `Ctrl-` (or `c-` or `Control-`) and `Cmd-` (or `m-` or\n`Meta-`) are recognized. For characters that are created by holding\nshift, the `Shift-` prefix is implied, and should not be added\nexplicitly.\n\nYou can use `Mod-` as a shorthand for `Cmd-` on Mac and `Ctrl-` on\nother platforms.\n\nYou can add multiple keymap plugins to an editor. The order in\nwhich they appear determines their precedence (the ones early in\nthe array get to dispatch first).\n*/\nfunction keymap(bindings) {\n    return new Plugin({ props: { handleKeyDown: keydownHandler(bindings) } });\n}\n/**\nGiven a set of bindings (using the same format as\n[`keymap`](https://prosemirror.net/docs/ref/#keymap.keymap)), return a [keydown\nhandler](https://prosemirror.net/docs/ref/#view.EditorProps.handleKeyDown) that handles them.\n*/\nfunction keydownHandler(bindings) {\n    let map = normalize(bindings);\n    return function (view, event) {\n        let name = keyName(event), baseName, direct = map[modifiers(name, event)];\n        if (direct && direct(view.state, view.dispatch, view))\n            return true;\n        // A character key\n        if (name.length == 1 && name != \" \") {\n            if (event.shiftKey) {\n                // In case the name was already modified by shift, try looking\n                // it up without its shift modifier\n                let noShift = map[modifiers(name, event, false)];\n                if (noShift && noShift(view.state, view.dispatch, view))\n                    return true;\n            }\n            if ((event.altKey || event.metaKey || event.ctrlKey) &&\n                // Ctrl-Alt may be used for AltGr on Windows\n                !(windows && event.ctrlKey && event.altKey) &&\n                (baseName = base[event.keyCode]) && baseName != name) {\n                // Try falling back to the keyCode when there's a modifier\n                // active or the character produced isn't ASCII, and our table\n                // produces a different name from the the keyCode. See #668,\n                // #1060, #1529.\n                let fromCode = map[modifiers(baseName, event)];\n                if (fromCode && fromCode(view.state, view.dispatch, view))\n                    return true;\n            }\n        }\n        return false;\n    };\n}\n\nexport { keydownHandler, keymap };\n"],"names":["mac","windows","normalizeKeyName","name","parts","result","alt","ctrl","shift","meta","i","mod","normalize","map","copy","prop","modifiers","event","keymap","bindings","Plugin","keydownHandler","view","keyName","baseName","direct","noShift","base","fromCode"],"mappings":";;AAGA,MAAMA,IAAM,OAAO,YAAa,OAAe,qBAAqB,KAAK,UAAU,QAAQ,GACrFC,IAAU,OAAO,YAAa,OAAe,MAAM,KAAK,UAAU,QAAQ;AAChF,SAASC,EAAiBC,GAAM;AAC5B,MAAIC,IAAQD,EAAK,MAAM,QAAQ,GAAGE,IAASD,EAAMA,EAAM,SAAS,CAAC;AACjE,EAAIC,KAAU,YACVA,IAAS;AACb,MAAIC,GAAKC,GAAMC,GAAOC;AACtB,WAASC,IAAI,GAAGA,IAAIN,EAAM,SAAS,GAAGM,KAAK;AACvC,QAAIC,IAAMP,EAAMM,CAAC;AACjB,QAAI,kBAAkB,KAAKC,CAAG;AAC1B,MAAAF,IAAO;AAAA,aACF,YAAY,KAAKE,CAAG;AACzB,MAAAL,IAAM;AAAA,aACD,sBAAsB,KAAKK,CAAG;AACnC,MAAAJ,IAAO;AAAA,aACF,cAAc,KAAKI,CAAG;AAC3B,MAAAH,IAAQ;AAAA,aACH,SAAS,KAAKG,CAAG;AACtB,MAAIX,IACAS,IAAO,KAEPF,IAAO;AAAA;AAGX,YAAM,IAAI,MAAM,iCAAiCI,CAAG;AAAA,EAC5D;AACA,SAAIL,MACAD,IAAS,SAASA,IAClBE,MACAF,IAAS,UAAUA,IACnBI,MACAJ,IAAS,UAAUA,IACnBG,MACAH,IAAS,WAAWA,IACjBA;AACX;AACA,SAASO,EAAUC,GAAK;AACpB,MAAIC,IAAO,uBAAO,OAAO,IAAI;AAC7B,WAASC,KAAQF;AACb,IAAAC,EAAKZ,EAAiBa,CAAI,CAAC,IAAIF,EAAIE,CAAI;AAC3C,SAAOD;AACX;AACA,SAASE,EAAUb,GAAMc,GAAOT,IAAQ,IAAM;AAC1C,SAAIS,EAAM,WACNd,IAAO,SAASA,IAChBc,EAAM,YACNd,IAAO,UAAUA,IACjBc,EAAM,YACNd,IAAO,UAAUA,IACjBK,KAASS,EAAM,aACfd,IAAO,WAAWA,IACfA;AACX;AAgCA,SAASe,EAAOC,GAAU;AACtB,SAAO,IAAIC,EAAO,EAAE,OAAO,EAAE,eAAeC,EAAeF,CAAQ,EAAC,GAAI;AAC5E;AAMA,SAASE,EAAeF,GAAU;AAC9B,MAAIN,IAAMD,EAAUO,CAAQ;AAC5B,SAAO,SAAUG,GAAML,GAAO;AAC1B,QAAId,IAAOoB,EAAQN,CAAK,GAAGO,GAAUC,IAASZ,EAAIG,EAAUb,GAAMc,CAAK,CAAC;AACxE,QAAIQ,KAAUA,EAAOH,EAAK,OAAOA,EAAK,UAAUA,CAAI;AAChD,aAAO;AAEX,QAAInB,EAAK,UAAU,KAAKA,KAAQ,KAAK;AACjC,UAAIc,EAAM,UAAU;AAGhB,YAAIS,IAAUb,EAAIG,EAAUb,GAAMc,GAAO,EAAK,CAAC;AAC/C,YAAIS,KAAWA,EAAQJ,EAAK,OAAOA,EAAK,UAAUA,CAAI;AAClD,iBAAO;AAAA,MACf;AACA,WAAKL,EAAM,UAAUA,EAAM,WAAWA,EAAM;AAAA,MAExC,EAAEhB,KAAWgB,EAAM,WAAWA,EAAM,YACnCO,IAAWG,EAAKV,EAAM,OAAO,MAAMO,KAAYrB,GAAM;AAKtD,YAAIyB,IAAWf,EAAIG,EAAUQ,GAAUP,CAAK,CAAC;AAC7C,YAAIW,KAAYA,EAASN,EAAK,OAAOA,EAAK,UAAUA,CAAI;AACpD,iBAAO;AAAA,MACf;AAAA,IACJ;AACA,WAAO;AAAA,EACX;AACJ;","x_google_ignoreList":[0]}