@fewangsit/wangsvue-fats 1.0.1-rc.9 → 2.0.0-alpha.1

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

@@ -1,6 +1,6 @@
-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";
+import { f as J, c as h, l as T, b as A, j as v, r as B, R as U, a as O } from "../../prosemirror-transform/dist/index.es.js";
+import { S as y, F as S } from "../../prosemirror-model/dist/index.es.js";
+import { N as d, S as I, A as P, T as V } 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;
@@ -24,7 +24,7 @@ const G = (t, e, r) => {
       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());
+          s.setSelection(x(l, "end") ? I.findFrom(s.doc.resolve(s.mapping.map(o.pos, -1)), -1) : d.create(s.doc, o.pos - l.nodeSize)), e(s.scrollIntoView());
         }
         return !0;
       }
@@ -69,7 +69,7 @@ function E(t, e, r) {
     return !1;
   if (r) {
     let c = t.tr.step(p);
-    c.setSelection(I.create(c.doc, l)), r(c.scrollIntoView());
+    c.setSelection(V.create(c.doc, l)), r(c.scrollIntoView());
   }
   return !0;
 }
@@ -123,7 +123,7 @@ const K = (t, e, r) => {
     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());
+        f.setSelection(x(l, "start") ? I.findFrom(f.doc.resolve(f.mapping.map(o.pos)), 1) : d.create(f.doc, f.mapping.map(o.pos))), e(f.scrollIntoView());
       }
       return !0;
     }
@@ -199,7 +199,7 @@ const ce = (t, e) => {
     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());
+    s.setSelection(I.near(s.doc.resolve(f), 1)), e(s.scrollIntoView());
   }
   return !0;
 }, X = (t, e) => {
@@ -211,7 +211,7 @@ const ce = (t, e) => {
     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());
+    f.setSelection(V.create(f.doc, i + 1)), e(f.scrollIntoView());
   }
   return !0;
 }, Y = (t, e) => {
@@ -244,9 +244,11 @@ function Z(t) {
         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) {
+    (e.selection instanceof V || e.selection instanceof P) && c.deleteSelection();
+    let m = c.mapping.map(n.pos), k = h(c.doc, m, l.length, l);
+    if (k || (l[0] = f ? { type: f } : null, k = h(c.doc, m, l.length, l)), !k)
+      return !1;
+    if (c.split(m, 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);
     }
@@ -269,30 +271,30 @@ function D(t, e, r, n) {
   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));
+      for (let w = i.length - 1; w >= 0; w--)
+        u = S.from(i[w].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());
+      let b = t.tr.step(new O(e.pos - 1, a, e.pos, a, new y(u, 1, 0), i.length, !0)), g = b.doc.resolve(a + 2 * i.length);
+      g.nodeAfter && g.nodeAfter.type == o.type && A(b.doc, g.pos) && b.join(g.pos), r(b.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;
+  let c = l.type.spec.isolating || n > 0 && s ? null : I.findFrom(e, 1), m = c && c.$from.blockRange(c.$to), k = m && T(m);
+  if (k != null && k >= e.depth)
+    return r && r(t.tr.lift(m, k).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)
+    let b = l, g = 1;
+    for (; !b.isTextblock; b = b.firstChild)
       g++;
-    if (a.canReplace(a.childCount, a.childCount, m.content)) {
+    if (a.canReplace(a.childCount, a.childCount, b.content)) {
       if (r) {
-        let k = S.empty;
+        let w = 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));
+          w = S.from(u[C].copy(w));
+        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(w, u.length, 0), 0, !0));
         r(q.scrollIntoView());
       }
       return !0;
@@ -308,7 +310,7 @@ function $(t) {
         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;
+    return o.node(l).isTextblock ? (r && r(e.tr.setSelection(V.create(e.doc, t < 0 ? o.start(l) : o.end(l)))), !0) : !1;
   };
 }
 const ue = $(-1), pe = $(1);
@@ -318,7 +320,7 @@ function de(t, e = null) {
     return f ? (n && n(r.tr.wrap(i, f).scrollIntoView()), !0) : !1;
   };
 }
-function be(t, e = null) {
+function me(t, e = null) {
   return function(r, n) {
     let o = !1;
     for (let l = 0; l < r.selection.ranges.length && !o; l++) {
@@ -330,8 +332,8 @@ function be(t, e = null) {
           if (s.type == t)
             o = !0;
           else {
-            let c = r.doc.resolve(p), b = c.index();
-            o = c.parent.canReplaceWith(b, b + 1, t);
+            let c = r.doc.resolve(p), m = c.index();
+            o = c.parent.canReplaceWith(m, m + 1, t);
           }
       });
     }
@@ -378,6 +380,7 @@ export {
   ce as o,
   M as p,
   X as q,
-  be as s,
+  me as s,
   de as w
 };
+//# sourceMappingURL=index.es.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.es.js","sources":["../../../../../../node_modules/.pnpm/prosemirror-commands@1.7.1/node_modules/prosemirror-commands/dist/index.js"],"sourcesContent":["import { liftTarget, replaceStep, ReplaceStep, canJoin, joinPoint, canSplit, ReplaceAroundStep, findWrapping } from 'prosemirror-transform';\nimport { Slice, Fragment } from 'prosemirror-model';\nimport { NodeSelection, Selection, TextSelection, AllSelection, SelectionRange } from 'prosemirror-state';\n\n/**\nDelete the selection, if there is one.\n*/\nconst deleteSelection = (state, dispatch) => {\n    if (state.selection.empty)\n        return false;\n    if (dispatch)\n        dispatch(state.tr.deleteSelection().scrollIntoView());\n    return true;\n};\nfunction atBlockStart(state, view) {\n    let { $cursor } = state.selection;\n    if (!$cursor || (view ? !view.endOfTextblock(\"backward\", state)\n        : $cursor.parentOffset > 0))\n        return null;\n    return $cursor;\n}\n/**\nIf the selection is empty and at the start of a textblock, try to\nreduce the distance between that block and the one before it—if\nthere's a block directly before it that can be joined, join them.\nIf not, try to move the selected block closer to the next one in\nthe document structure by lifting it out of its parent or moving it\ninto a parent of the previous block. Will use the view for accurate\n(bidi-aware) start-of-textblock detection if given.\n*/\nconst joinBackward = (state, dispatch, view) => {\n    let $cursor = atBlockStart(state, view);\n    if (!$cursor)\n        return false;\n    let $cut = findCutBefore($cursor);\n    // If there is no node before this, try to lift\n    if (!$cut) {\n        let range = $cursor.blockRange(), target = range && liftTarget(range);\n        if (target == null)\n            return false;\n        if (dispatch)\n            dispatch(state.tr.lift(range, target).scrollIntoView());\n        return true;\n    }\n    let before = $cut.nodeBefore;\n    // Apply the joining algorithm\n    if (deleteBarrier(state, $cut, dispatch, -1))\n        return true;\n    // If the node below has no content and the node above is\n    // selectable, delete the node below and select the one above.\n    if ($cursor.parent.content.size == 0 &&\n        (textblockAt(before, \"end\") || NodeSelection.isSelectable(before))) {\n        for (let depth = $cursor.depth;; depth--) {\n            let delStep = replaceStep(state.doc, $cursor.before(depth), $cursor.after(depth), Slice.empty);\n            if (delStep && delStep.slice.size < delStep.to - delStep.from) {\n                if (dispatch) {\n                    let tr = state.tr.step(delStep);\n                    tr.setSelection(textblockAt(before, \"end\")\n                        ? Selection.findFrom(tr.doc.resolve(tr.mapping.map($cut.pos, -1)), -1)\n                        : NodeSelection.create(tr.doc, $cut.pos - before.nodeSize));\n                    dispatch(tr.scrollIntoView());\n                }\n                return true;\n            }\n            if (depth == 1 || $cursor.node(depth - 1).childCount > 1)\n                break;\n        }\n    }\n    // If the node before is an atom, delete it\n    if (before.isAtom && $cut.depth == $cursor.depth - 1) {\n        if (dispatch)\n            dispatch(state.tr.delete($cut.pos - before.nodeSize, $cut.pos).scrollIntoView());\n        return true;\n    }\n    return false;\n};\n/**\nA more limited form of [`joinBackward`](https://prosemirror.net/docs/ref/#commands.joinBackward)\nthat only tries to join the current textblock to the one before\nit, if the cursor is at the start of a textblock.\n*/\nconst joinTextblockBackward = (state, dispatch, view) => {\n    let $cursor = atBlockStart(state, view);\n    if (!$cursor)\n        return false;\n    let $cut = findCutBefore($cursor);\n    return $cut ? joinTextblocksAround(state, $cut, dispatch) : false;\n};\n/**\nA more limited form of [`joinForward`](https://prosemirror.net/docs/ref/#commands.joinForward)\nthat only tries to join the current textblock to the one after\nit, if the cursor is at the end of a textblock.\n*/\nconst joinTextblockForward = (state, dispatch, view) => {\n    let $cursor = atBlockEnd(state, view);\n    if (!$cursor)\n        return false;\n    let $cut = findCutAfter($cursor);\n    return $cut ? joinTextblocksAround(state, $cut, dispatch) : false;\n};\nfunction joinTextblocksAround(state, $cut, dispatch) {\n    let before = $cut.nodeBefore, beforeText = before, beforePos = $cut.pos - 1;\n    for (; !beforeText.isTextblock; beforePos--) {\n        if (beforeText.type.spec.isolating)\n            return false;\n        let child = beforeText.lastChild;\n        if (!child)\n            return false;\n        beforeText = child;\n    }\n    let after = $cut.nodeAfter, afterText = after, afterPos = $cut.pos + 1;\n    for (; !afterText.isTextblock; afterPos++) {\n        if (afterText.type.spec.isolating)\n            return false;\n        let child = afterText.firstChild;\n        if (!child)\n            return false;\n        afterText = child;\n    }\n    let step = replaceStep(state.doc, beforePos, afterPos, Slice.empty);\n    if (!step || step.from != beforePos ||\n        step instanceof ReplaceStep && step.slice.size >= afterPos - beforePos)\n        return false;\n    if (dispatch) {\n        let tr = state.tr.step(step);\n        tr.setSelection(TextSelection.create(tr.doc, beforePos));\n        dispatch(tr.scrollIntoView());\n    }\n    return true;\n}\nfunction textblockAt(node, side, only = false) {\n    for (let scan = node; scan; scan = (side == \"start\" ? scan.firstChild : scan.lastChild)) {\n        if (scan.isTextblock)\n            return true;\n        if (only && scan.childCount != 1)\n            return false;\n    }\n    return false;\n}\n/**\nWhen the selection is empty and at the start of a textblock, select\nthe node before that textblock, if possible. This is intended to be\nbound to keys like backspace, after\n[`joinBackward`](https://prosemirror.net/docs/ref/#commands.joinBackward) or other deleting\ncommands, as a fall-back behavior when the schema doesn't allow\ndeletion at the selected point.\n*/\nconst selectNodeBackward = (state, dispatch, view) => {\n    let { $head, empty } = state.selection, $cut = $head;\n    if (!empty)\n        return false;\n    if ($head.parent.isTextblock) {\n        if (view ? !view.endOfTextblock(\"backward\", state) : $head.parentOffset > 0)\n            return false;\n        $cut = findCutBefore($head);\n    }\n    let node = $cut && $cut.nodeBefore;\n    if (!node || !NodeSelection.isSelectable(node))\n        return false;\n    if (dispatch)\n        dispatch(state.tr.setSelection(NodeSelection.create(state.doc, $cut.pos - node.nodeSize)).scrollIntoView());\n    return true;\n};\nfunction findCutBefore($pos) {\n    if (!$pos.parent.type.spec.isolating)\n        for (let i = $pos.depth - 1; i >= 0; i--) {\n            if ($pos.index(i) > 0)\n                return $pos.doc.resolve($pos.before(i + 1));\n            if ($pos.node(i).type.spec.isolating)\n                break;\n        }\n    return null;\n}\nfunction atBlockEnd(state, view) {\n    let { $cursor } = state.selection;\n    if (!$cursor || (view ? !view.endOfTextblock(\"forward\", state)\n        : $cursor.parentOffset < $cursor.parent.content.size))\n        return null;\n    return $cursor;\n}\n/**\nIf the selection is empty and the cursor is at the end of a\ntextblock, try to reduce or remove the boundary between that block\nand the one after it, either by joining them or by moving the other\nblock closer to this one in the tree structure. Will use the view\nfor accurate start-of-textblock detection if given.\n*/\nconst joinForward = (state, dispatch, view) => {\n    let $cursor = atBlockEnd(state, view);\n    if (!$cursor)\n        return false;\n    let $cut = findCutAfter($cursor);\n    // If there is no node after this, there's nothing to do\n    if (!$cut)\n        return false;\n    let after = $cut.nodeAfter;\n    // Try the joining algorithm\n    if (deleteBarrier(state, $cut, dispatch, 1))\n        return true;\n    // If the node above has no content and the node below is\n    // selectable, delete the node above and select the one below.\n    if ($cursor.parent.content.size == 0 &&\n        (textblockAt(after, \"start\") || NodeSelection.isSelectable(after))) {\n        let delStep = replaceStep(state.doc, $cursor.before(), $cursor.after(), Slice.empty);\n        if (delStep && delStep.slice.size < delStep.to - delStep.from) {\n            if (dispatch) {\n                let tr = state.tr.step(delStep);\n                tr.setSelection(textblockAt(after, \"start\") ? Selection.findFrom(tr.doc.resolve(tr.mapping.map($cut.pos)), 1)\n                    : NodeSelection.create(tr.doc, tr.mapping.map($cut.pos)));\n                dispatch(tr.scrollIntoView());\n            }\n            return true;\n        }\n    }\n    // If the next node is an atom, delete it\n    if (after.isAtom && $cut.depth == $cursor.depth - 1) {\n        if (dispatch)\n            dispatch(state.tr.delete($cut.pos, $cut.pos + after.nodeSize).scrollIntoView());\n        return true;\n    }\n    return false;\n};\n/**\nWhen the selection is empty and at the end of a textblock, select\nthe node coming after that textblock, if possible. This is intended\nto be bound to keys like delete, after\n[`joinForward`](https://prosemirror.net/docs/ref/#commands.joinForward) and similar deleting\ncommands, to provide a fall-back behavior when the schema doesn't\nallow deletion at the selected point.\n*/\nconst selectNodeForward = (state, dispatch, view) => {\n    let { $head, empty } = state.selection, $cut = $head;\n    if (!empty)\n        return false;\n    if ($head.parent.isTextblock) {\n        if (view ? !view.endOfTextblock(\"forward\", state) : $head.parentOffset < $head.parent.content.size)\n            return false;\n        $cut = findCutAfter($head);\n    }\n    let node = $cut && $cut.nodeAfter;\n    if (!node || !NodeSelection.isSelectable(node))\n        return false;\n    if (dispatch)\n        dispatch(state.tr.setSelection(NodeSelection.create(state.doc, $cut.pos)).scrollIntoView());\n    return true;\n};\nfunction findCutAfter($pos) {\n    if (!$pos.parent.type.spec.isolating)\n        for (let i = $pos.depth - 1; i >= 0; i--) {\n            let parent = $pos.node(i);\n            if ($pos.index(i) + 1 < parent.childCount)\n                return $pos.doc.resolve($pos.after(i + 1));\n            if (parent.type.spec.isolating)\n                break;\n        }\n    return null;\n}\n/**\nJoin the selected block or, if there is a text selection, the\nclosest ancestor block of the selection that can be joined, with\nthe sibling above it.\n*/\nconst joinUp = (state, dispatch) => {\n    let sel = state.selection, nodeSel = sel instanceof NodeSelection, point;\n    if (nodeSel) {\n        if (sel.node.isTextblock || !canJoin(state.doc, sel.from))\n            return false;\n        point = sel.from;\n    }\n    else {\n        point = joinPoint(state.doc, sel.from, -1);\n        if (point == null)\n            return false;\n    }\n    if (dispatch) {\n        let tr = state.tr.join(point);\n        if (nodeSel)\n            tr.setSelection(NodeSelection.create(tr.doc, point - state.doc.resolve(point).nodeBefore.nodeSize));\n        dispatch(tr.scrollIntoView());\n    }\n    return true;\n};\n/**\nJoin the selected block, or the closest ancestor of the selection\nthat can be joined, with the sibling after it.\n*/\nconst joinDown = (state, dispatch) => {\n    let sel = state.selection, point;\n    if (sel instanceof NodeSelection) {\n        if (sel.node.isTextblock || !canJoin(state.doc, sel.to))\n            return false;\n        point = sel.to;\n    }\n    else {\n        point = joinPoint(state.doc, sel.to, 1);\n        if (point == null)\n            return false;\n    }\n    if (dispatch)\n        dispatch(state.tr.join(point).scrollIntoView());\n    return true;\n};\n/**\nLift the selected block, or the closest ancestor block of the\nselection that can be lifted, out of its parent node.\n*/\nconst lift = (state, dispatch) => {\n    let { $from, $to } = state.selection;\n    let range = $from.blockRange($to), target = range && liftTarget(range);\n    if (target == null)\n        return false;\n    if (dispatch)\n        dispatch(state.tr.lift(range, target).scrollIntoView());\n    return true;\n};\n/**\nIf the selection is in a node whose type has a truthy\n[`code`](https://prosemirror.net/docs/ref/#model.NodeSpec.code) property in its spec, replace the\nselection with a newline character.\n*/\nconst newlineInCode = (state, dispatch) => {\n    let { $head, $anchor } = state.selection;\n    if (!$head.parent.type.spec.code || !$head.sameParent($anchor))\n        return false;\n    if (dispatch)\n        dispatch(state.tr.insertText(\"\\n\").scrollIntoView());\n    return true;\n};\nfunction defaultBlockAt(match) {\n    for (let i = 0; i < match.edgeCount; i++) {\n        let { type } = match.edge(i);\n        if (type.isTextblock && !type.hasRequiredAttrs())\n            return type;\n    }\n    return null;\n}\n/**\nWhen the selection is in a node with a truthy\n[`code`](https://prosemirror.net/docs/ref/#model.NodeSpec.code) property in its spec, create a\ndefault block after the code block, and move the cursor there.\n*/\nconst exitCode = (state, dispatch) => {\n    let { $head, $anchor } = state.selection;\n    if (!$head.parent.type.spec.code || !$head.sameParent($anchor))\n        return false;\n    let above = $head.node(-1), after = $head.indexAfter(-1), type = defaultBlockAt(above.contentMatchAt(after));\n    if (!type || !above.canReplaceWith(after, after, type))\n        return false;\n    if (dispatch) {\n        let pos = $head.after(), tr = state.tr.replaceWith(pos, pos, type.createAndFill());\n        tr.setSelection(Selection.near(tr.doc.resolve(pos), 1));\n        dispatch(tr.scrollIntoView());\n    }\n    return true;\n};\n/**\nIf a block node is selected, create an empty paragraph before (if\nit is its parent's first child) or after it.\n*/\nconst createParagraphNear = (state, dispatch) => {\n    let sel = state.selection, { $from, $to } = sel;\n    if (sel instanceof AllSelection || $from.parent.inlineContent || $to.parent.inlineContent)\n        return false;\n    let type = defaultBlockAt($to.parent.contentMatchAt($to.indexAfter()));\n    if (!type || !type.isTextblock)\n        return false;\n    if (dispatch) {\n        let side = (!$from.parentOffset && $to.index() < $to.parent.childCount ? $from : $to).pos;\n        let tr = state.tr.insert(side, type.createAndFill());\n        tr.setSelection(TextSelection.create(tr.doc, side + 1));\n        dispatch(tr.scrollIntoView());\n    }\n    return true;\n};\n/**\nIf the cursor is in an empty textblock that can be lifted, lift the\nblock.\n*/\nconst liftEmptyBlock = (state, dispatch) => {\n    let { $cursor } = state.selection;\n    if (!$cursor || $cursor.parent.content.size)\n        return false;\n    if ($cursor.depth > 1 && $cursor.after() != $cursor.end(-1)) {\n        let before = $cursor.before();\n        if (canSplit(state.doc, before)) {\n            if (dispatch)\n                dispatch(state.tr.split(before).scrollIntoView());\n            return true;\n        }\n    }\n    let range = $cursor.blockRange(), target = range && liftTarget(range);\n    if (target == null)\n        return false;\n    if (dispatch)\n        dispatch(state.tr.lift(range, target).scrollIntoView());\n    return true;\n};\n/**\nCreate a variant of [`splitBlock`](https://prosemirror.net/docs/ref/#commands.splitBlock) that uses\na custom function to determine the type of the newly split off block.\n*/\nfunction splitBlockAs(splitNode) {\n    return (state, dispatch) => {\n        let { $from, $to } = state.selection;\n        if (state.selection instanceof NodeSelection && state.selection.node.isBlock) {\n            if (!$from.parentOffset || !canSplit(state.doc, $from.pos))\n                return false;\n            if (dispatch)\n                dispatch(state.tr.split($from.pos).scrollIntoView());\n            return true;\n        }\n        if (!$from.depth)\n            return false;\n        let types = [];\n        let splitDepth, deflt, atEnd = false, atStart = false;\n        for (let d = $from.depth;; d--) {\n            let node = $from.node(d);\n            if (node.isBlock) {\n                atEnd = $from.end(d) == $from.pos + ($from.depth - d);\n                atStart = $from.start(d) == $from.pos - ($from.depth - d);\n                deflt = defaultBlockAt($from.node(d - 1).contentMatchAt($from.indexAfter(d - 1)));\n                let splitType = splitNode && splitNode($to.parent, atEnd, $from);\n                types.unshift(splitType || (atEnd && deflt ? { type: deflt } : null));\n                splitDepth = d;\n                break;\n            }\n            else {\n                if (d == 1)\n                    return false;\n                types.unshift(null);\n            }\n        }\n        let tr = state.tr;\n        if (state.selection instanceof TextSelection || state.selection instanceof AllSelection)\n            tr.deleteSelection();\n        let splitPos = tr.mapping.map($from.pos);\n        let can = canSplit(tr.doc, splitPos, types.length, types);\n        if (!can) {\n            types[0] = deflt ? { type: deflt } : null;\n            can = canSplit(tr.doc, splitPos, types.length, types);\n        }\n        if (!can)\n            return false;\n        tr.split(splitPos, types.length, types);\n        if (!atEnd && atStart && $from.node(splitDepth).type != deflt) {\n            let first = tr.mapping.map($from.before(splitDepth)), $first = tr.doc.resolve(first);\n            if (deflt && $from.node(splitDepth - 1).canReplaceWith($first.index(), $first.index() + 1, deflt))\n                tr.setNodeMarkup(tr.mapping.map($from.before(splitDepth)), deflt);\n        }\n        if (dispatch)\n            dispatch(tr.scrollIntoView());\n        return true;\n    };\n}\n/**\nSplit the parent block of the selection. If the selection is a text\nselection, also delete its content.\n*/\nconst splitBlock = splitBlockAs();\n/**\nActs like [`splitBlock`](https://prosemirror.net/docs/ref/#commands.splitBlock), but without\nresetting the set of active marks at the cursor.\n*/\nconst splitBlockKeepMarks = (state, dispatch) => {\n    return splitBlock(state, dispatch && (tr => {\n        let marks = state.storedMarks || (state.selection.$to.parentOffset && state.selection.$from.marks());\n        if (marks)\n            tr.ensureMarks(marks);\n        dispatch(tr);\n    }));\n};\n/**\nMove the selection to the node wrapping the current selection, if\nany. (Will not select the document node.)\n*/\nconst selectParentNode = (state, dispatch) => {\n    let { $from, to } = state.selection, pos;\n    let same = $from.sharedDepth(to);\n    if (same == 0)\n        return false;\n    pos = $from.before(same);\n    if (dispatch)\n        dispatch(state.tr.setSelection(NodeSelection.create(state.doc, pos)));\n    return true;\n};\n/**\nSelect the whole document.\n*/\nconst selectAll = (state, dispatch) => {\n    if (dispatch)\n        dispatch(state.tr.setSelection(new AllSelection(state.doc)));\n    return true;\n};\nfunction joinMaybeClear(state, $pos, dispatch) {\n    let before = $pos.nodeBefore, after = $pos.nodeAfter, index = $pos.index();\n    if (!before || !after || !before.type.compatibleContent(after.type))\n        return false;\n    if (!before.content.size && $pos.parent.canReplace(index - 1, index)) {\n        if (dispatch)\n            dispatch(state.tr.delete($pos.pos - before.nodeSize, $pos.pos).scrollIntoView());\n        return true;\n    }\n    if (!$pos.parent.canReplace(index, index + 1) || !(after.isTextblock || canJoin(state.doc, $pos.pos)))\n        return false;\n    if (dispatch)\n        dispatch(state.tr.join($pos.pos).scrollIntoView());\n    return true;\n}\nfunction deleteBarrier(state, $cut, dispatch, dir) {\n    let before = $cut.nodeBefore, after = $cut.nodeAfter, conn, match;\n    let isolated = before.type.spec.isolating || after.type.spec.isolating;\n    if (!isolated && joinMaybeClear(state, $cut, dispatch))\n        return true;\n    let canDelAfter = !isolated && $cut.parent.canReplace($cut.index(), $cut.index() + 1);\n    if (canDelAfter &&\n        (conn = (match = before.contentMatchAt(before.childCount)).findWrapping(after.type)) &&\n        match.matchType(conn[0] || after.type).validEnd) {\n        if (dispatch) {\n            let end = $cut.pos + after.nodeSize, wrap = Fragment.empty;\n            for (let i = conn.length - 1; i >= 0; i--)\n                wrap = Fragment.from(conn[i].create(null, wrap));\n            wrap = Fragment.from(before.copy(wrap));\n            let tr = state.tr.step(new ReplaceAroundStep($cut.pos - 1, end, $cut.pos, end, new Slice(wrap, 1, 0), conn.length, true));\n            let $joinAt = tr.doc.resolve(end + 2 * conn.length);\n            if ($joinAt.nodeAfter && $joinAt.nodeAfter.type == before.type &&\n                canJoin(tr.doc, $joinAt.pos))\n                tr.join($joinAt.pos);\n            dispatch(tr.scrollIntoView());\n        }\n        return true;\n    }\n    let selAfter = after.type.spec.isolating || (dir > 0 && isolated) ? null : Selection.findFrom($cut, 1);\n    let range = selAfter && selAfter.$from.blockRange(selAfter.$to), target = range && liftTarget(range);\n    if (target != null && target >= $cut.depth) {\n        if (dispatch)\n            dispatch(state.tr.lift(range, target).scrollIntoView());\n        return true;\n    }\n    if (canDelAfter && textblockAt(after, \"start\", true) && textblockAt(before, \"end\")) {\n        let at = before, wrap = [];\n        for (;;) {\n            wrap.push(at);\n            if (at.isTextblock)\n                break;\n            at = at.lastChild;\n        }\n        let afterText = after, afterDepth = 1;\n        for (; !afterText.isTextblock; afterText = afterText.firstChild)\n            afterDepth++;\n        if (at.canReplace(at.childCount, at.childCount, afterText.content)) {\n            if (dispatch) {\n                let end = Fragment.empty;\n                for (let i = wrap.length - 1; i >= 0; i--)\n                    end = Fragment.from(wrap[i].copy(end));\n                let tr = state.tr.step(new ReplaceAroundStep($cut.pos - wrap.length, $cut.pos + after.nodeSize, $cut.pos + afterDepth, $cut.pos + after.nodeSize - afterDepth, new Slice(end, wrap.length, 0), 0, true));\n                dispatch(tr.scrollIntoView());\n            }\n            return true;\n        }\n    }\n    return false;\n}\nfunction selectTextblockSide(side) {\n    return function (state, dispatch) {\n        let sel = state.selection, $pos = side < 0 ? sel.$from : sel.$to;\n        let depth = $pos.depth;\n        while ($pos.node(depth).isInline) {\n            if (!depth)\n                return false;\n            depth--;\n        }\n        if (!$pos.node(depth).isTextblock)\n            return false;\n        if (dispatch)\n            dispatch(state.tr.setSelection(TextSelection.create(state.doc, side < 0 ? $pos.start(depth) : $pos.end(depth))));\n        return true;\n    };\n}\n/**\nMoves the cursor to the start of current text block.\n*/\nconst selectTextblockStart = selectTextblockSide(-1);\n/**\nMoves the cursor to the end of current text block.\n*/\nconst selectTextblockEnd = selectTextblockSide(1);\n// Parameterized commands\n/**\nWrap the selection in a node of the given type with the given\nattributes.\n*/\nfunction wrapIn(nodeType, attrs = null) {\n    return function (state, dispatch) {\n        let { $from, $to } = state.selection;\n        let range = $from.blockRange($to), wrapping = range && findWrapping(range, nodeType, attrs);\n        if (!wrapping)\n            return false;\n        if (dispatch)\n            dispatch(state.tr.wrap(range, wrapping).scrollIntoView());\n        return true;\n    };\n}\n/**\nReturns a command that tries to set the selected textblocks to the\ngiven node type with the given attributes.\n*/\nfunction setBlockType(nodeType, attrs = null) {\n    return function (state, dispatch) {\n        let applicable = false;\n        for (let i = 0; i < state.selection.ranges.length && !applicable; i++) {\n            let { $from: { pos: from }, $to: { pos: to } } = state.selection.ranges[i];\n            state.doc.nodesBetween(from, to, (node, pos) => {\n                if (applicable)\n                    return false;\n                if (!node.isTextblock || node.hasMarkup(nodeType, attrs))\n                    return;\n                if (node.type == nodeType) {\n                    applicable = true;\n                }\n                else {\n                    let $pos = state.doc.resolve(pos), index = $pos.index();\n                    applicable = $pos.parent.canReplaceWith(index, index + 1, nodeType);\n                }\n            });\n        }\n        if (!applicable)\n            return false;\n        if (dispatch) {\n            let tr = state.tr;\n            for (let i = 0; i < state.selection.ranges.length; i++) {\n                let { $from: { pos: from }, $to: { pos: to } } = state.selection.ranges[i];\n                tr.setBlockType(from, to, nodeType, attrs);\n            }\n            dispatch(tr.scrollIntoView());\n        }\n        return true;\n    };\n}\nfunction markApplies(doc, ranges, type, enterAtoms) {\n    for (let i = 0; i < ranges.length; i++) {\n        let { $from, $to } = ranges[i];\n        let can = $from.depth == 0 ? doc.inlineContent && doc.type.allowsMarkType(type) : false;\n        doc.nodesBetween($from.pos, $to.pos, (node, pos) => {\n            if (can || !enterAtoms && node.isAtom && node.isInline && pos >= $from.pos && pos + node.nodeSize <= $to.pos)\n                return false;\n            can = node.inlineContent && node.type.allowsMarkType(type);\n        });\n        if (can)\n            return true;\n    }\n    return false;\n}\nfunction removeInlineAtoms(ranges) {\n    let result = [];\n    for (let i = 0; i < ranges.length; i++) {\n        let { $from, $to } = ranges[i];\n        $from.doc.nodesBetween($from.pos, $to.pos, (node, pos) => {\n            if (node.isAtom && node.content.size && node.isInline && pos >= $from.pos && pos + node.nodeSize <= $to.pos) {\n                if (pos + 1 > $from.pos)\n                    result.push(new SelectionRange($from, $from.doc.resolve(pos + 1)));\n                $from = $from.doc.resolve(pos + 1 + node.content.size);\n                return false;\n            }\n        });\n        if ($from.pos < $to.pos)\n            result.push(new SelectionRange($from, $to));\n    }\n    return result;\n}\n/**\nCreate a command function that toggles the given mark with the\ngiven attributes. Will return `false` when the current selection\ndoesn't support that mark. This will remove the mark if any marks\nof that type exist in the selection, or add it otherwise. If the\nselection is empty, this applies to the [stored\nmarks](https://prosemirror.net/docs/ref/#state.EditorState.storedMarks) instead of a range of the\ndocument.\n*/\nfunction toggleMark(markType, attrs = null, options) {\n    let removeWhenPresent = (options && options.removeWhenPresent) !== false;\n    let enterAtoms = (options && options.enterInlineAtoms) !== false;\n    let dropSpace = !(options && options.includeWhitespace);\n    return function (state, dispatch) {\n        let { empty, $cursor, ranges } = state.selection;\n        if ((empty && !$cursor) || !markApplies(state.doc, ranges, markType, enterAtoms))\n            return false;\n        if (dispatch) {\n            if ($cursor) {\n                if (markType.isInSet(state.storedMarks || $cursor.marks()))\n                    dispatch(state.tr.removeStoredMark(markType));\n                else\n                    dispatch(state.tr.addStoredMark(markType.create(attrs)));\n            }\n            else {\n                let add, tr = state.tr;\n                if (!enterAtoms)\n                    ranges = removeInlineAtoms(ranges);\n                if (removeWhenPresent) {\n                    add = !ranges.some(r => state.doc.rangeHasMark(r.$from.pos, r.$to.pos, markType));\n                }\n                else {\n                    add = !ranges.every(r => {\n                        let missing = false;\n                        tr.doc.nodesBetween(r.$from.pos, r.$to.pos, (node, pos, parent) => {\n                            if (missing)\n                                return false;\n                            missing = !markType.isInSet(node.marks) && !!parent && parent.type.allowsMarkType(markType) &&\n                                !(node.isText && /^\\s*$/.test(node.textBetween(Math.max(0, r.$from.pos - pos), Math.min(node.nodeSize, r.$to.pos - pos))));\n                        });\n                        return !missing;\n                    });\n                }\n                for (let i = 0; i < ranges.length; i++) {\n                    let { $from, $to } = ranges[i];\n                    if (!add) {\n                        tr.removeMark($from.pos, $to.pos, markType);\n                    }\n                    else {\n                        let from = $from.pos, to = $to.pos, start = $from.nodeAfter, end = $to.nodeBefore;\n                        let spaceStart = dropSpace && start && start.isText ? /^\\s*/.exec(start.text)[0].length : 0;\n                        let spaceEnd = dropSpace && end && end.isText ? /\\s*$/.exec(end.text)[0].length : 0;\n                        if (from + spaceStart < to) {\n                            from += spaceStart;\n                            to -= spaceEnd;\n                        }\n                        tr.addMark(from, to, markType.create(attrs));\n                    }\n                }\n                dispatch(tr.scrollIntoView());\n            }\n        }\n        return true;\n    };\n}\nfunction wrapDispatchForJoin(dispatch, isJoinable) {\n    return (tr) => {\n        if (!tr.isGeneric)\n            return dispatch(tr);\n        let ranges = [];\n        for (let i = 0; i < tr.mapping.maps.length; i++) {\n            let map = tr.mapping.maps[i];\n            for (let j = 0; j < ranges.length; j++)\n                ranges[j] = map.map(ranges[j]);\n            map.forEach((_s, _e, from, to) => ranges.push(from, to));\n        }\n        // Figure out which joinable points exist inside those ranges,\n        // by checking all node boundaries in their parent nodes.\n        let joinable = [];\n        for (let i = 0; i < ranges.length; i += 2) {\n            let from = ranges[i], to = ranges[i + 1];\n            let $from = tr.doc.resolve(from), depth = $from.sharedDepth(to), parent = $from.node(depth);\n            for (let index = $from.indexAfter(depth), pos = $from.after(depth + 1); pos <= to; ++index) {\n                let after = parent.maybeChild(index);\n                if (!after)\n                    break;\n                if (index && joinable.indexOf(pos) == -1) {\n                    let before = parent.child(index - 1);\n                    if (before.type == after.type && isJoinable(before, after))\n                        joinable.push(pos);\n                }\n                pos += after.nodeSize;\n            }\n        }\n        // Join the joinable points\n        joinable.sort((a, b) => a - b);\n        for (let i = joinable.length - 1; i >= 0; i--) {\n            if (canJoin(tr.doc, joinable[i]))\n                tr.join(joinable[i]);\n        }\n        dispatch(tr);\n    };\n}\n/**\nWrap a command so that, when it produces a transform that causes\ntwo joinable nodes to end up next to each other, those are joined.\nNodes are considered joinable when they are of the same type and\nwhen the `isJoinable` predicate returns true for them or, if an\narray of strings was passed, if their node type name is in that\narray.\n*/\nfunction autoJoin(command, isJoinable) {\n    let canJoin = Array.isArray(isJoinable) ? (node) => isJoinable.indexOf(node.type.name) > -1\n        : isJoinable;\n    return (state, dispatch, view) => command(state, dispatch && wrapDispatchForJoin(dispatch, canJoin), view);\n}\n/**\nCombine a number of command functions into a single function (which\ncalls them one by one until one returns true).\n*/\nfunction chainCommands(...commands) {\n    return function (state, dispatch, view) {\n        for (let i = 0; i < commands.length; i++)\n            if (commands[i](state, dispatch, view))\n                return true;\n        return false;\n    };\n}\nlet backspace = chainCommands(deleteSelection, joinBackward, selectNodeBackward);\nlet del = chainCommands(deleteSelection, joinForward, selectNodeForward);\n/**\nA basic keymap containing bindings not specific to any schema.\nBinds the following keys (when multiple commands are listed, they\nare chained with [`chainCommands`](https://prosemirror.net/docs/ref/#commands.chainCommands)):\n\n* **Enter** to `newlineInCode`, `createParagraphNear`, `liftEmptyBlock`, `splitBlock`\n* **Mod-Enter** to `exitCode`\n* **Backspace** and **Mod-Backspace** to `deleteSelection`, `joinBackward`, `selectNodeBackward`\n* **Delete** and **Mod-Delete** to `deleteSelection`, `joinForward`, `selectNodeForward`\n* **Mod-Delete** to `deleteSelection`, `joinForward`, `selectNodeForward`\n* **Mod-a** to `selectAll`\n*/\nconst pcBaseKeymap = {\n    \"Enter\": chainCommands(newlineInCode, createParagraphNear, liftEmptyBlock, splitBlock),\n    \"Mod-Enter\": exitCode,\n    \"Backspace\": backspace,\n    \"Mod-Backspace\": backspace,\n    \"Shift-Backspace\": backspace,\n    \"Delete\": del,\n    \"Mod-Delete\": del,\n    \"Mod-a\": selectAll\n};\n/**\nA copy of `pcBaseKeymap` that also binds **Ctrl-h** like Backspace,\n**Ctrl-d** like Delete, **Alt-Backspace** like Ctrl-Backspace, and\n**Ctrl-Alt-Backspace**, **Alt-Delete**, and **Alt-d** like\nCtrl-Delete.\n*/\nconst macBaseKeymap = {\n    \"Ctrl-h\": pcBaseKeymap[\"Backspace\"],\n    \"Alt-Backspace\": pcBaseKeymap[\"Mod-Backspace\"],\n    \"Ctrl-d\": pcBaseKeymap[\"Delete\"],\n    \"Ctrl-Alt-Backspace\": pcBaseKeymap[\"Mod-Delete\"],\n    \"Alt-Delete\": pcBaseKeymap[\"Mod-Delete\"],\n    \"Alt-d\": pcBaseKeymap[\"Mod-Delete\"],\n    \"Ctrl-a\": selectTextblockStart,\n    \"Ctrl-e\": selectTextblockEnd\n};\nfor (let key in pcBaseKeymap)\n    macBaseKeymap[key] = pcBaseKeymap[key];\nconst mac = typeof navigator != \"undefined\" ? /Mac|iP(hone|[oa]d)/.test(navigator.platform)\n    // @ts-ignore\n    : typeof os != \"undefined\" && os.platform ? os.platform() == \"darwin\" : false;\n/**\nDepending on the detected platform, this will hold\n[`pcBasekeymap`](https://prosemirror.net/docs/ref/#commands.pcBaseKeymap) or\n[`macBaseKeymap`](https://prosemirror.net/docs/ref/#commands.macBaseKeymap).\n*/\nconst baseKeymap = mac ? macBaseKeymap : pcBaseKeymap;\n\nexport { autoJoin, baseKeymap, chainCommands, createParagraphNear, deleteSelection, exitCode, joinBackward, joinDown, joinForward, joinTextblockBackward, joinTextblockForward, joinUp, lift, liftEmptyBlock, macBaseKeymap, newlineInCode, pcBaseKeymap, selectAll, selectNodeBackward, selectNodeForward, selectParentNode, selectTextblockEnd, selectTextblockStart, setBlockType, splitBlock, splitBlockAs, splitBlockKeepMarks, toggleMark, wrapIn };\n"],"names":["deleteSelection","state","dispatch","atBlockStart","view","$cursor","joinBackward","$cut","findCutBefore","range","target","liftTarget","before","deleteBarrier","textblockAt","NodeSelection","depth","delStep","replaceStep","Slice","tr","Selection","joinTextblockBackward","joinTextblocksAround","joinTextblockForward","atBlockEnd","findCutAfter","beforeText","beforePos","child","after","afterText","afterPos","step","ReplaceStep","TextSelection","node","side","only","scan","selectNodeBackward","$head","empty","$pos","i","joinForward","selectNodeForward","parent","joinUp","sel","nodeSel","point","canJoin","joinPoint","joinDown","lift","$from","$to","newlineInCode","$anchor","defaultBlockAt","match","type","exitCode","above","pos","createParagraphNear","AllSelection","liftEmptyBlock","canSplit","splitBlockAs","splitNode","types","splitDepth","deflt","atEnd","atStart","d","splitPos","can","first","$first","splitBlock","selectParentNode","to","same","joinMaybeClear","index","dir","conn","isolated","canDelAfter","end","wrap","Fragment","ReplaceAroundStep","$joinAt","selAfter","at","afterDepth","selectTextblockSide","selectTextblockStart","selectTextblockEnd","wrapIn","nodeType","attrs","wrapping","findWrapping","setBlockType","applicable","from","chainCommands","commands"],"mappings":";;;AAOK,MAACA,IAAkB,CAACC,GAAOC,MACxBD,EAAM,UAAU,QACT,MACPC,KACAA,EAASD,EAAM,GAAG,gBAAe,EAAG,eAAc,CAAE,GACjD;AAEX,SAASE,EAAaF,GAAOG,GAAM;AAC/B,MAAI,EAAE,SAAAC,MAAYJ,EAAM;AACxB,SAAI,CAACI,MAAYD,IAAO,CAACA,EAAK,eAAe,YAAYH,CAAK,IACxDI,EAAQ,eAAe,KAClB,OACJA;AACX;AAUK,MAACC,IAAe,CAACL,GAAOC,GAAUE,MAAS;AAC5C,MAAIC,IAAUF,EAAaF,GAAOG,CAAI;AACtC,MAAI,CAACC;AACD,WAAO;AACX,MAAIE,IAAOC,EAAcH,CAAO;AAEhC,MAAI,CAACE,GAAM;AACP,QAAIE,IAAQJ,EAAQ,WAAU,GAAIK,IAASD,KAASE,EAAWF,CAAK;AACpE,WAAIC,KAAU,OACH,MACPR,KACAA,EAASD,EAAM,GAAG,KAAKQ,GAAOC,CAAM,EAAE,gBAAgB,GACnD;AAAA,EACX;AACA,MAAIE,IAASL,EAAK;AAElB,MAAIM,EAAcZ,GAAOM,GAAML,GAAU,EAAE;AACvC,WAAO;AAGX,MAAIG,EAAQ,OAAO,QAAQ,QAAQ,MAC9BS,EAAYF,GAAQ,KAAK,KAAKG,EAAc,aAAaH,CAAM;AAChE,aAASI,IAAQX,EAAQ,SAAQW,KAAS;AACtC,UAAIC,IAAUC,EAAYjB,EAAM,KAAKI,EAAQ,OAAOW,CAAK,GAAGX,EAAQ,MAAMW,CAAK,GAAGG,EAAM,KAAK;AAC7F,UAAIF,KAAWA,EAAQ,MAAM,OAAOA,EAAQ,KAAKA,EAAQ,MAAM;AAC3D,YAAIf,GAAU;AACV,cAAIkB,IAAKnB,EAAM,GAAG,KAAKgB,CAAO;AAC9B,UAAAG,EAAG,aAAaN,EAAYF,GAAQ,KAAK,IACnCS,EAAU,SAASD,EAAG,IAAI,QAAQA,EAAG,QAAQ,IAAIb,EAAK,KAAK,EAAE,CAAC,GAAG,EAAE,IACnEQ,EAAc,OAAOK,EAAG,KAAKb,EAAK,MAAMK,EAAO,QAAQ,CAAC,GAC9DV,EAASkB,EAAG,gBAAgB;AAAA,QAChC;AACA,eAAO;AAAA,MACX;AACA,UAAIJ,KAAS,KAAKX,EAAQ,KAAKW,IAAQ,CAAC,EAAE,aAAa;AACnD;AAAA,IACR;AAGJ,SAAIJ,EAAO,UAAUL,EAAK,SAASF,EAAQ,QAAQ,KAC3CH,KACAA,EAASD,EAAM,GAAG,OAAOM,EAAK,MAAMK,EAAO,UAAUL,EAAK,GAAG,EAAE,eAAc,CAAE,GAC5E,MAEJ;AACX,GAMMe,KAAwB,CAACrB,GAAOC,GAAUE,MAAS;AACrD,MAAIC,IAAUF,EAAaF,GAAOG,CAAI;AACtC,MAAI,CAACC;AACD,WAAO;AACX,MAAIE,IAAOC,EAAcH,CAAO;AAChC,SAAOE,IAAOgB,EAAqBtB,GAAOM,GAAML,CAAQ,IAAI;AAChE,GAMMsB,KAAuB,CAACvB,GAAOC,GAAUE,MAAS;AACpD,MAAIC,IAAUoB,EAAWxB,GAAOG,CAAI;AACpC,MAAI,CAACC;AACD,WAAO;AACX,MAAIE,IAAOmB,EAAarB,CAAO;AAC/B,SAAOE,IAAOgB,EAAqBtB,GAAOM,GAAML,CAAQ,IAAI;AAChE;AACA,SAASqB,EAAqBtB,GAAOM,GAAML,GAAU;AACjD,MAAIU,IAASL,EAAK,YAAYoB,IAAaf,GAAQgB,IAAYrB,EAAK,MAAM;AAC1E,SAAO,CAACoB,EAAW,aAAaC,KAAa;AACzC,QAAID,EAAW,KAAK,KAAK;AACrB,aAAO;AACX,QAAIE,IAAQF,EAAW;AACvB,QAAI,CAACE;AACD,aAAO;AACX,IAAAF,IAAaE;AAAA,EACjB;AACA,MAAIC,IAAQvB,EAAK,WAAWwB,IAAYD,GAAOE,IAAWzB,EAAK,MAAM;AACrE,SAAO,CAACwB,EAAU,aAAaC,KAAY;AACvC,QAAID,EAAU,KAAK,KAAK;AACpB,aAAO;AACX,QAAIF,IAAQE,EAAU;AACtB,QAAI,CAACF;AACD,aAAO;AACX,IAAAE,IAAYF;AAAA,EAChB;AACA,MAAII,IAAOf,EAAYjB,EAAM,KAAK2B,GAAWI,GAAUb,EAAM,KAAK;AAClE,MAAI,CAACc,KAAQA,EAAK,QAAQL,KACtBK,aAAgBC,KAAeD,EAAK,MAAM,QAAQD,IAAWJ;AAC7D,WAAO;AACX,MAAI1B,GAAU;AACV,QAAIkB,IAAKnB,EAAM,GAAG,KAAKgC,CAAI;AAC3B,IAAAb,EAAG,aAAae,EAAc,OAAOf,EAAG,KAAKQ,CAAS,CAAC,GACvD1B,EAASkB,EAAG,gBAAgB;AAAA,EAChC;AACA,SAAO;AACX;AACA,SAASN,EAAYsB,GAAMC,GAAMC,IAAO,IAAO;AAC3C,WAASC,IAAOH,GAAMG,GAAMA,IAAQF,KAAQ,UAAUE,EAAK,aAAaA,EAAK,WAAY;AACrF,QAAIA,EAAK;AACL,aAAO;AACX,QAAID,KAAQC,EAAK,cAAc;AAC3B,aAAO;AAAA,EACf;AACA,SAAO;AACX;AASK,MAACC,IAAqB,CAACvC,GAAOC,GAAUE,MAAS;AAClD,MAAI,EAAE,OAAAqC,GAAO,OAAAC,EAAK,IAAKzC,EAAM,WAAWM,IAAOkC;AAC/C,MAAI,CAACC;AACD,WAAO;AACX,MAAID,EAAM,OAAO,aAAa;AAC1B,QAAIrC,IAAO,CAACA,EAAK,eAAe,YAAYH,CAAK,IAAIwC,EAAM,eAAe;AACtE,aAAO;AACX,IAAAlC,IAAOC,EAAciC,CAAK;AAAA,EAC9B;AACA,MAAIL,IAAO7B,KAAQA,EAAK;AACxB,SAAI,CAAC6B,KAAQ,CAACrB,EAAc,aAAaqB,CAAI,IAClC,MACPlC,KACAA,EAASD,EAAM,GAAG,aAAac,EAAc,OAAOd,EAAM,KAAKM,EAAK,MAAM6B,EAAK,QAAQ,CAAC,EAAE,eAAc,CAAE,GACvG;AACX;AACA,SAAS5B,EAAcmC,GAAM;AACzB,MAAI,CAACA,EAAK,OAAO,KAAK,KAAK;AACvB,aAASC,IAAID,EAAK,QAAQ,GAAGC,KAAK,GAAGA,KAAK;AACtC,UAAID,EAAK,MAAMC,CAAC,IAAI;AAChB,eAAOD,EAAK,IAAI,QAAQA,EAAK,OAAOC,IAAI,CAAC,CAAC;AAC9C,UAAID,EAAK,KAAKC,CAAC,EAAE,KAAK,KAAK;AACvB;AAAA,IACR;AACJ,SAAO;AACX;AACA,SAASnB,EAAWxB,GAAOG,GAAM;AAC7B,MAAI,EAAE,SAAAC,MAAYJ,EAAM;AACxB,SAAI,CAACI,MAAYD,IAAO,CAACA,EAAK,eAAe,WAAWH,CAAK,IACvDI,EAAQ,eAAeA,EAAQ,OAAO,QAAQ,QACzC,OACJA;AACX;AAQK,MAACwC,IAAc,CAAC5C,GAAOC,GAAUE,MAAS;AAC3C,MAAIC,IAAUoB,EAAWxB,GAAOG,CAAI;AACpC,MAAI,CAACC;AACD,WAAO;AACX,MAAIE,IAAOmB,EAAarB,CAAO;AAE/B,MAAI,CAACE;AACD,WAAO;AACX,MAAIuB,IAAQvB,EAAK;AAEjB,MAAIM,EAAcZ,GAAOM,GAAML,GAAU,CAAC;AACtC,WAAO;AAGX,MAAIG,EAAQ,OAAO,QAAQ,QAAQ,MAC9BS,EAAYgB,GAAO,OAAO,KAAKf,EAAc,aAAae,CAAK,IAAI;AACpE,QAAIb,IAAUC,EAAYjB,EAAM,KAAKI,EAAQ,OAAM,GAAIA,EAAQ,SAASc,EAAM,KAAK;AACnF,QAAIF,KAAWA,EAAQ,MAAM,OAAOA,EAAQ,KAAKA,EAAQ,MAAM;AAC3D,UAAIf,GAAU;AACV,YAAIkB,IAAKnB,EAAM,GAAG,KAAKgB,CAAO;AAC9B,QAAAG,EAAG,aAAaN,EAAYgB,GAAO,OAAO,IAAIT,EAAU,SAASD,EAAG,IAAI,QAAQA,EAAG,QAAQ,IAAIb,EAAK,GAAG,CAAC,GAAG,CAAC,IACtGQ,EAAc,OAAOK,EAAG,KAAKA,EAAG,QAAQ,IAAIb,EAAK,GAAG,CAAC,CAAC,GAC5DL,EAASkB,EAAG,gBAAgB;AAAA,MAChC;AACA,aAAO;AAAA,IACX;AAAA,EACJ;AAEA,SAAIU,EAAM,UAAUvB,EAAK,SAASF,EAAQ,QAAQ,KAC1CH,KACAA,EAASD,EAAM,GAAG,OAAOM,EAAK,KAAKA,EAAK,MAAMuB,EAAM,QAAQ,EAAE,eAAc,CAAE,GAC3E,MAEJ;AACX,GASMgB,IAAoB,CAAC7C,GAAOC,GAAUE,MAAS;AACjD,MAAI,EAAE,OAAAqC,GAAO,OAAAC,EAAK,IAAKzC,EAAM,WAAWM,IAAOkC;AAC/C,MAAI,CAACC;AACD,WAAO;AACX,MAAID,EAAM,OAAO,aAAa;AAC1B,QAAIrC,IAAO,CAACA,EAAK,eAAe,WAAWH,CAAK,IAAIwC,EAAM,eAAeA,EAAM,OAAO,QAAQ;AAC1F,aAAO;AACX,IAAAlC,IAAOmB,EAAae,CAAK;AAAA,EAC7B;AACA,MAAIL,IAAO7B,KAAQA,EAAK;AACxB,SAAI,CAAC6B,KAAQ,CAACrB,EAAc,aAAaqB,CAAI,IAClC,MACPlC,KACAA,EAASD,EAAM,GAAG,aAAac,EAAc,OAAOd,EAAM,KAAKM,EAAK,GAAG,CAAC,EAAE,eAAc,CAAE,GACvF;AACX;AACA,SAASmB,EAAaiB,GAAM;AACxB,MAAI,CAACA,EAAK,OAAO,KAAK,KAAK;AACvB,aAASC,IAAID,EAAK,QAAQ,GAAGC,KAAK,GAAGA,KAAK;AACtC,UAAIG,IAASJ,EAAK,KAAKC,CAAC;AACxB,UAAID,EAAK,MAAMC,CAAC,IAAI,IAAIG,EAAO;AAC3B,eAAOJ,EAAK,IAAI,QAAQA,EAAK,MAAMC,IAAI,CAAC,CAAC;AAC7C,UAAIG,EAAO,KAAK,KAAK;AACjB;AAAA,IACR;AACJ,SAAO;AACX;AAMK,MAACC,KAAS,CAAC/C,GAAOC,MAAa;AAChC,MAAI+C,IAAMhD,EAAM,WAAWiD,IAAUD,aAAelC,GAAeoC;AACnE,MAAID,GAAS;AACT,QAAID,EAAI,KAAK,eAAe,CAACG,EAAQnD,EAAM,KAAKgD,EAAI,IAAI;AACpD,aAAO;AACX,IAAAE,IAAQF,EAAI;AAAA,EAChB,WAEIE,IAAQE,EAAUpD,EAAM,KAAKgD,EAAI,MAAM,EAAE,GACrCE,KAAS;AACT,WAAO;AAEf,MAAIjD,GAAU;AACV,QAAIkB,IAAKnB,EAAM,GAAG,KAAKkD,CAAK;AAC5B,IAAID,KACA9B,EAAG,aAAaL,EAAc,OAAOK,EAAG,KAAK+B,IAAQlD,EAAM,IAAI,QAAQkD,CAAK,EAAE,WAAW,QAAQ,CAAC,GACtGjD,EAASkB,EAAG,gBAAgB;AAAA,EAChC;AACA,SAAO;AACX,GAKMkC,KAAW,CAACrD,GAAOC,MAAa;AAClC,MAAI+C,IAAMhD,EAAM,WAAWkD;AAC3B,MAAIF,aAAelC,GAAe;AAC9B,QAAIkC,EAAI,KAAK,eAAe,CAACG,EAAQnD,EAAM,KAAKgD,EAAI,EAAE;AAClD,aAAO;AACX,IAAAE,IAAQF,EAAI;AAAA,EAChB,WAEIE,IAAQE,EAAUpD,EAAM,KAAKgD,EAAI,IAAI,CAAC,GAClCE,KAAS;AACT,WAAO;AAEf,SAAIjD,KACAA,EAASD,EAAM,GAAG,KAAKkD,CAAK,EAAE,gBAAgB,GAC3C;AACX,GAKMI,KAAO,CAACtD,GAAOC,MAAa;AAC9B,MAAI,EAAE,OAAAsD,GAAO,KAAAC,EAAG,IAAKxD,EAAM,WACvBQ,IAAQ+C,EAAM,WAAWC,CAAG,GAAG/C,IAASD,KAASE,EAAWF,CAAK;AACrE,SAAIC,KAAU,OACH,MACPR,KACAA,EAASD,EAAM,GAAG,KAAKQ,GAAOC,CAAM,EAAE,gBAAgB,GACnD;AACX,GAMMgD,IAAgB,CAACzD,GAAOC,MAAa;AACvC,MAAI,EAAE,OAAAuC,GAAO,SAAAkB,EAAO,IAAK1D,EAAM;AAC/B,SAAI,CAACwC,EAAM,OAAO,KAAK,KAAK,QAAQ,CAACA,EAAM,WAAWkB,CAAO,IAClD,MACPzD,KACAA,EAASD,EAAM,GAAG,WAAW;AAAA,CAAI,EAAE,gBAAgB,GAChD;AACX;AACA,SAAS2D,EAAeC,GAAO;AAC3B,WAASjB,IAAI,GAAGA,IAAIiB,EAAM,WAAWjB,KAAK;AACtC,QAAI,EAAE,MAAAkB,EAAI,IAAKD,EAAM,KAAKjB,CAAC;AAC3B,QAAIkB,EAAK,eAAe,CAACA,EAAK,iBAAgB;AAC1C,aAAOA;AAAA,EACf;AACA,SAAO;AACX;AAMK,MAACC,KAAW,CAAC9D,GAAOC,MAAa;AAClC,MAAI,EAAE,OAAAuC,GAAO,SAAAkB,EAAO,IAAK1D,EAAM;AAC/B,MAAI,CAACwC,EAAM,OAAO,KAAK,KAAK,QAAQ,CAACA,EAAM,WAAWkB,CAAO;AACzD,WAAO;AACX,MAAIK,IAAQvB,EAAM,KAAK,EAAE,GAAGX,IAAQW,EAAM,WAAW,EAAE,GAAGqB,IAAOF,EAAeI,EAAM,eAAelC,CAAK,CAAC;AAC3G,MAAI,CAACgC,KAAQ,CAACE,EAAM,eAAelC,GAAOA,GAAOgC,CAAI;AACjD,WAAO;AACX,MAAI5D,GAAU;AACV,QAAI+D,IAAMxB,EAAM,MAAK,GAAIrB,IAAKnB,EAAM,GAAG,YAAYgE,GAAKA,GAAKH,EAAK,cAAa,CAAE;AACjF,IAAA1C,EAAG,aAAaC,EAAU,KAAKD,EAAG,IAAI,QAAQ6C,CAAG,GAAG,CAAC,CAAC,GACtD/D,EAASkB,EAAG,gBAAgB;AAAA,EAChC;AACA,SAAO;AACX,GAKM8C,IAAsB,CAACjE,GAAOC,MAAa;AAC7C,MAAI+C,IAAMhD,EAAM,WAAW,EAAE,OAAAuD,GAAO,KAAAC,EAAG,IAAKR;AAC5C,MAAIA,aAAekB,KAAgBX,EAAM,OAAO,iBAAiBC,EAAI,OAAO;AACxE,WAAO;AACX,MAAIK,IAAOF,EAAeH,EAAI,OAAO,eAAeA,EAAI,WAAU,CAAE,CAAC;AACrE,MAAI,CAACK,KAAQ,CAACA,EAAK;AACf,WAAO;AACX,MAAI5D,GAAU;AACV,QAAImC,KAAQ,CAACmB,EAAM,gBAAgBC,EAAI,UAAUA,EAAI,OAAO,aAAaD,IAAQC,GAAK,KAClFrC,IAAKnB,EAAM,GAAG,OAAOoC,GAAMyB,EAAK,eAAe;AACnD,IAAA1C,EAAG,aAAae,EAAc,OAAOf,EAAG,KAAKiB,IAAO,CAAC,CAAC,GACtDnC,EAASkB,EAAG,gBAAgB;AAAA,EAChC;AACA,SAAO;AACX,GAKMgD,IAAiB,CAACnE,GAAOC,MAAa;AACxC,MAAI,EAAE,SAAAG,MAAYJ,EAAM;AACxB,MAAI,CAACI,KAAWA,EAAQ,OAAO,QAAQ;AACnC,WAAO;AACX,MAAIA,EAAQ,QAAQ,KAAKA,EAAQ,MAAK,KAAMA,EAAQ,IAAI,EAAE,GAAG;AACzD,QAAIO,IAASP,EAAQ,OAAM;AAC3B,QAAIgE,EAASpE,EAAM,KAAKW,CAAM;AAC1B,aAAIV,KACAA,EAASD,EAAM,GAAG,MAAMW,CAAM,EAAE,gBAAgB,GAC7C;AAAA,EAEf;AACA,MAAIH,IAAQJ,EAAQ,WAAU,GAAIK,IAASD,KAASE,EAAWF,CAAK;AACpE,SAAIC,KAAU,OACH,MACPR,KACAA,EAASD,EAAM,GAAG,KAAKQ,GAAOC,CAAM,EAAE,gBAAgB,GACnD;AACX;AAKA,SAAS4D,EAAaC,GAAW;AAC7B,SAAO,CAACtE,GAAOC,MAAa;AACxB,QAAI,EAAE,OAAAsD,GAAO,KAAAC,EAAG,IAAKxD,EAAM;AAC3B,QAAIA,EAAM,qBAAqBc,KAAiBd,EAAM,UAAU,KAAK;AACjE,aAAI,CAACuD,EAAM,gBAAgB,CAACa,EAASpE,EAAM,KAAKuD,EAAM,GAAG,IAC9C,MACPtD,KACAA,EAASD,EAAM,GAAG,MAAMuD,EAAM,GAAG,EAAE,gBAAgB,GAChD;AAEX,QAAI,CAACA,EAAM;AACP,aAAO;AACX,QAAIgB,IAAQ,CAAA,GACRC,GAAYC,GAAOC,IAAQ,IAAOC,IAAU;AAChD,aAASC,IAAIrB,EAAM,SAAQqB;AAEvB,UADWrB,EAAM,KAAKqB,CAAC,EACd,SAAS;AACd,QAAAF,IAAQnB,EAAM,IAAIqB,CAAC,KAAKrB,EAAM,OAAOA,EAAM,QAAQqB,IACnDD,IAAUpB,EAAM,MAAMqB,CAAC,KAAKrB,EAAM,OAAOA,EAAM,QAAQqB,IACvDH,IAAQd,EAAeJ,EAAM,KAAKqB,IAAI,CAAC,EAAE,eAAerB,EAAM,WAAWqB,IAAI,CAAC,CAAC,CAAC,GAEhFL,EAAM,QAAsBG,KAASD,IAAQ,EAAE,MAAMA,MAAU,IAAK,GACpED,IAAaI;AACb;AAAA,MACJ,OACK;AACD,YAAIA,KAAK;AACL,iBAAO;AACX,QAAAL,EAAM,QAAQ,IAAI;AAAA,MACtB;AAEJ,QAAIpD,IAAKnB,EAAM;AACf,KAAIA,EAAM,qBAAqBkC,KAAiBlC,EAAM,qBAAqBkE,MACvE/C,EAAG,gBAAe;AACtB,QAAI0D,IAAW1D,EAAG,QAAQ,IAAIoC,EAAM,GAAG,GACnCuB,IAAMV,EAASjD,EAAG,KAAK0D,GAAUN,EAAM,QAAQA,CAAK;AAKxD,QAJKO,MACDP,EAAM,CAAC,IAAIE,IAAQ,EAAE,MAAMA,EAAK,IAAK,MACrCK,IAAMV,EAASjD,EAAG,KAAK0D,GAAUN,EAAM,QAAQA,CAAK,IAEpD,CAACO;AACD,aAAO;AAEX,QADA3D,EAAG,MAAM0D,GAAUN,EAAM,QAAQA,CAAK,GAClC,CAACG,KAASC,KAAWpB,EAAM,KAAKiB,CAAU,EAAE,QAAQC,GAAO;AAC3D,UAAIM,IAAQ5D,EAAG,QAAQ,IAAIoC,EAAM,OAAOiB,CAAU,CAAC,GAAGQ,IAAS7D,EAAG,IAAI,QAAQ4D,CAAK;AACnF,MAAIN,KAASlB,EAAM,KAAKiB,IAAa,CAAC,EAAE,eAAeQ,EAAO,MAAK,GAAIA,EAAO,MAAK,IAAK,GAAGP,CAAK,KAC5FtD,EAAG,cAAcA,EAAG,QAAQ,IAAIoC,EAAM,OAAOiB,CAAU,CAAC,GAAGC,CAAK;AAAA,IACxE;AACA,WAAIxE,KACAA,EAASkB,EAAG,gBAAgB,GACzB;AAAA,EACX;AACJ;AAKA,MAAM8D,IAAaZ,EAAY,GAiBzBa,KAAmB,CAAClF,GAAOC,MAAa;AAC1C,MAAI,EAAE,OAAAsD,GAAO,IAAA4B,EAAE,IAAKnF,EAAM,WAAWgE,GACjCoB,IAAO7B,EAAM,YAAY4B,CAAE;AAC/B,SAAIC,KAAQ,IACD,MACXpB,IAAMT,EAAM,OAAO6B,CAAI,GACnBnF,KACAA,EAASD,EAAM,GAAG,aAAac,EAAc,OAAOd,EAAM,KAAKgE,CAAG,CAAC,CAAC,GACjE;AACX;AASA,SAASqB,GAAerF,GAAO0C,GAAMzC,GAAU;AAC3C,MAAIU,IAAS+B,EAAK,YAAYb,IAAQa,EAAK,WAAW4C,IAAQ5C,EAAK,MAAK;AACxE,SAAI,CAAC/B,KAAU,CAACkB,KAAS,CAAClB,EAAO,KAAK,kBAAkBkB,EAAM,IAAI,IACvD,KACP,CAAClB,EAAO,QAAQ,QAAQ+B,EAAK,OAAO,WAAW4C,IAAQ,GAAGA,CAAK,KAC3DrF,KACAA,EAASD,EAAM,GAAG,OAAO0C,EAAK,MAAM/B,EAAO,UAAU+B,EAAK,GAAG,EAAE,eAAc,CAAE,GAC5E,MAEP,CAACA,EAAK,OAAO,WAAW4C,GAAOA,IAAQ,CAAC,KAAK,EAAEzD,EAAM,eAAesB,EAAQnD,EAAM,KAAK0C,EAAK,GAAG,KACxF,MACPzC,KACAA,EAASD,EAAM,GAAG,KAAK0C,EAAK,GAAG,EAAE,gBAAgB,GAC9C;AACX;AACA,SAAS9B,EAAcZ,GAAOM,GAAML,GAAUsF,GAAK;AAC/C,MAAI5E,IAASL,EAAK,YAAYuB,IAAQvB,EAAK,WAAWkF,GAAM5B,GACxD6B,IAAW9E,EAAO,KAAK,KAAK,aAAakB,EAAM,KAAK,KAAK;AAC7D,MAAI,CAAC4D,KAAYJ,GAAerF,GAAOM,GAAML,CAAQ;AACjD,WAAO;AACX,MAAIyF,IAAc,CAACD,KAAYnF,EAAK,OAAO,WAAWA,EAAK,MAAK,GAAIA,EAAK,MAAK,IAAK,CAAC;AACpF,MAAIoF,MACCF,KAAQ5B,IAAQjD,EAAO,eAAeA,EAAO,UAAU,GAAG,aAAakB,EAAM,IAAI,MAClF+B,EAAM,UAAU4B,EAAK,CAAC,KAAK3D,EAAM,IAAI,EAAE,UAAU;AACjD,QAAI5B,GAAU;AACV,UAAI0F,IAAMrF,EAAK,MAAMuB,EAAM,UAAU+D,IAAOC,EAAS;AACrD,eAASlD,IAAI6C,EAAK,SAAS,GAAG7C,KAAK,GAAGA;AAClC,QAAAiD,IAAOC,EAAS,KAAKL,EAAK7C,CAAC,EAAE,OAAO,MAAMiD,CAAI,CAAC;AACnD,MAAAA,IAAOC,EAAS,KAAKlF,EAAO,KAAKiF,CAAI,CAAC;AACtC,UAAIzE,IAAKnB,EAAM,GAAG,KAAK,IAAI8F,EAAkBxF,EAAK,MAAM,GAAGqF,GAAKrF,EAAK,KAAKqF,GAAK,IAAIzE,EAAM0E,GAAM,GAAG,CAAC,GAAGJ,EAAK,QAAQ,EAAI,CAAC,GACpHO,IAAU5E,EAAG,IAAI,QAAQwE,IAAM,IAAIH,EAAK,MAAM;AAClD,MAAIO,EAAQ,aAAaA,EAAQ,UAAU,QAAQpF,EAAO,QACtDwC,EAAQhC,EAAG,KAAK4E,EAAQ,GAAG,KAC3B5E,EAAG,KAAK4E,EAAQ,GAAG,GACvB9F,EAASkB,EAAG,gBAAgB;AAAA,IAChC;AACA,WAAO;AAAA,EACX;AACA,MAAI6E,IAAWnE,EAAM,KAAK,KAAK,aAAc0D,IAAM,KAAKE,IAAY,OAAOrE,EAAU,SAASd,GAAM,CAAC,GACjGE,IAAQwF,KAAYA,EAAS,MAAM,WAAWA,EAAS,GAAG,GAAGvF,IAASD,KAASE,EAAWF,CAAK;AACnG,MAAIC,KAAU,QAAQA,KAAUH,EAAK;AACjC,WAAIL,KACAA,EAASD,EAAM,GAAG,KAAKQ,GAAOC,CAAM,EAAE,gBAAgB,GACnD;AAEX,MAAIiF,KAAe7E,EAAYgB,GAAO,SAAS,EAAI,KAAKhB,EAAYF,GAAQ,KAAK,GAAG;AAChF,QAAIsF,IAAKtF,GAAQiF,IAAO,CAAA;AACxB,WACIA,EAAK,KAAKK,CAAE,GACR,CAAAA,EAAG;AAEP,MAAAA,IAAKA,EAAG;AAEZ,QAAInE,IAAYD,GAAOqE,IAAa;AACpC,WAAO,CAACpE,EAAU,aAAaA,IAAYA,EAAU;AACjD,MAAAoE;AACJ,QAAID,EAAG,WAAWA,EAAG,YAAYA,EAAG,YAAYnE,EAAU,OAAO,GAAG;AAChE,UAAI7B,GAAU;AACV,YAAI0F,IAAME,EAAS;AACnB,iBAASlD,IAAIiD,EAAK,SAAS,GAAGjD,KAAK,GAAGA;AAClC,UAAAgD,IAAME,EAAS,KAAKD,EAAKjD,CAAC,EAAE,KAAKgD,CAAG,CAAC;AACzC,YAAIxE,IAAKnB,EAAM,GAAG,KAAK,IAAI8F,EAAkBxF,EAAK,MAAMsF,EAAK,QAAQtF,EAAK,MAAMuB,EAAM,UAAUvB,EAAK,MAAM4F,GAAY5F,EAAK,MAAMuB,EAAM,WAAWqE,GAAY,IAAIhF,EAAMyE,GAAKC,EAAK,QAAQ,CAAC,GAAG,GAAG,EAAI,CAAC;AACvM,QAAA3F,EAASkB,EAAG,gBAAgB;AAAA,MAChC;AACA,aAAO;AAAA,IACX;AAAA,EACJ;AACA,SAAO;AACX;AACA,SAASgF,EAAoB/D,GAAM;AAC/B,SAAO,SAAUpC,GAAOC,GAAU;AAC9B,QAAI+C,IAAMhD,EAAM,WAAW0C,IAAON,IAAO,IAAIY,EAAI,QAAQA,EAAI,KACzDjC,IAAQ2B,EAAK;AACjB,WAAOA,EAAK,KAAK3B,CAAK,EAAE,YAAU;AAC9B,UAAI,CAACA;AACD,eAAO;AACX,MAAAA;AAAA,IACJ;AACA,WAAK2B,EAAK,KAAK3B,CAAK,EAAE,eAElBd,KACAA,EAASD,EAAM,GAAG,aAAakC,EAAc,OAAOlC,EAAM,KAAKoC,IAAO,IAAIM,EAAK,MAAM3B,CAAK,IAAI2B,EAAK,IAAI3B,CAAK,CAAC,CAAC,CAAC,GAC5G,MAHI;AAAA,EAIf;AACJ;AAIK,MAACqF,KAAuBD,EAAoB,EAAE,GAI7CE,KAAqBF,EAAoB,CAAC;AAMhD,SAASG,GAAOC,GAAUC,IAAQ,MAAM;AACpC,SAAO,SAAUxG,GAAOC,GAAU;AAC9B,QAAI,EAAE,OAAAsD,GAAO,KAAAC,EAAG,IAAKxD,EAAM,WACvBQ,IAAQ+C,EAAM,WAAWC,CAAG,GAAGiD,IAAWjG,KAASkG,EAAalG,GAAO+F,GAAUC,CAAK;AAC1F,WAAKC,KAEDxG,KACAA,EAASD,EAAM,GAAG,KAAKQ,GAAOiG,CAAQ,EAAE,gBAAgB,GACrD,MAHI;AAAA,EAIf;AACJ;AAKA,SAASE,GAAaJ,GAAUC,IAAQ,MAAM;AAC1C,SAAO,SAAUxG,GAAOC,GAAU;AAC9B,QAAI2G,IAAa;AACjB,aAASjE,IAAI,GAAGA,IAAI3C,EAAM,UAAU,OAAO,UAAU,CAAC4G,GAAYjE,KAAK;AACnE,UAAI,EAAE,OAAO,EAAE,KAAKkE,EAAI,GAAI,KAAK,EAAE,KAAK1B,EAAE,EAAE,IAAKnF,EAAM,UAAU,OAAO2C,CAAC;AACzE,MAAA3C,EAAM,IAAI,aAAa6G,GAAM1B,GAAI,CAAChD,GAAM6B,MAAQ;AAC5C,YAAI4C;AACA,iBAAO;AACX,YAAI,GAACzE,EAAK,eAAeA,EAAK,UAAUoE,GAAUC,CAAK;AAEvD,cAAIrE,EAAK,QAAQoE;AACb,YAAAK,IAAa;AAAA,eAEZ;AACD,gBAAIlE,IAAO1C,EAAM,IAAI,QAAQgE,CAAG,GAAGsB,IAAQ5C,EAAK,MAAK;AACrD,YAAAkE,IAAalE,EAAK,OAAO,eAAe4C,GAAOA,IAAQ,GAAGiB,CAAQ;AAAA,UACtE;AAAA,MACJ,CAAC;AAAA,IACL;AACA,QAAI,CAACK;AACD,aAAO;AACX,QAAI3G,GAAU;AACV,UAAIkB,IAAKnB,EAAM;AACf,eAAS,IAAI,GAAG,IAAIA,EAAM,UAAU,OAAO,QAAQ,KAAK;AACpD,YAAI,EAAE,OAAO,EAAE,KAAK6G,EAAI,GAAI,KAAK,EAAE,KAAK1B,EAAE,EAAE,IAAKnF,EAAM,UAAU,OAAO,CAAC;AACzE,QAAAmB,EAAG,aAAa0F,GAAM1B,GAAIoB,GAAUC,CAAK;AAAA,MAC7C;AACA,MAAAvG,EAASkB,EAAG,gBAAgB;AAAA,IAChC;AACA,WAAO;AAAA,EACX;AACJ;AAwJA,SAAS2F,KAAiBC,GAAU;AAChC,SAAO,SAAU/G,GAAOC,GAAUE,GAAM;AACpC,aAASwC,IAAI,GAAGA,IAAIoE,EAAS,QAAQpE;AACjC,UAAIoE,EAASpE,CAAC,EAAE3C,GAAOC,GAAUE,CAAI;AACjC,eAAO;AACf,WAAO;AAAA,EACX;AACJ;AACgB2G,EAAc/G,GAAiBM,GAAckC,CAAkB;AACrEuE,EAAc/G,GAAiB6C,GAAaC,CAAiB;AAc1DiE,EAAcrD,GAAeQ,GAAqBE,GAAgBc,CAAU;AA2B7E,OAAO,YAAa,MAAc,qBAAqB,KAAK,UAAU,QAAQ,IAEpF,OAAO,KAAM,OAAe,GAAG,YAAW,GAAG,SAAQ,KAAM;","x_google_ignoreList":[0]}

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

@@ -222,7 +222,7 @@ function W(n = {}) {
       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;
+          return !s || !t.editable ? !1 : (e.preventDefault(), s(t.state, t.dispatch));
         }
       }
     }
@@ -246,3 +246,4 @@ export {
   U as r,
   A as u
 };
+//# sourceMappingURL=index.es.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.es.js","sources":["../../../../../../node_modules/.pnpm/prosemirror-history@1.5.0/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/vendor/prosemirror-keymap/dist/index.es.js

@@ -1,6 +1,6 @@
-import { k as n, b as c } from "../../w3c-keyname/index.es.js";
+import { k as u, 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;
+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 = " ");
@@ -16,38 +16,39 @@ function m(e) {
     else if (/^s(hift)?$/i.test(s))
       o = !0;
     else if (/^mod$/i.test(s))
-      h ? a = !0 : f = !0;
+      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 p(e) {
+function h(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) {
+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 k(e) {
-  return new d({ props: { handleKeyDown: y(e) } });
+function $(e) {
+  return new d({ props: { handleKeyDown: K(e) } });
 }
-function y(e) {
-  let r = p(e);
+function K(e) {
+  let r = h(e);
   return function(t, i) {
-    let f = n(i), o, a = r[u(f, 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[u(f, i, !1)];
+        let l = r[n(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 ((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;
       }
@@ -56,5 +57,6 @@ function y(e) {
   };
 }
 export {
-  k
+  $ as k
 };
+//# sourceMappingURL=index.es.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.es.js","sources":["../../../../../../node_modules/.pnpm/prosemirror-keymap@1.2.3/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]}