@scbt-ecom/ui 0.91.4 → 0.93.0

package/dist/node_modules/prosemirror-schema-list/dist/index.js

@@ -0,0 +1,2 @@
+import{ReplaceAroundStep as h,findWrapping as w,liftTarget as C,canJoin as L,canSplit as R}from"../../prosemirror-transform/dist/index.js";import{Fragment as s,Slice as I,NodeRange as x}from"../../prosemirror-model/dist/index.js";function O(r,t=null){return function(e,l){let{$from:o,$to:n}=e.selection,f=o.blockRange(n);if(!f)return!1;let i=l?e.tr:null;return S(i,f,r,t)?(l&&l(i.scrollIntoView()),!0):!1}}function S(r,t,e,l=null){let o=!1,n=t,f=t.$from.doc;if(t.depth>=2&&t.$from.node(t.depth-1).type.compatibleContent(e)&&t.startIndex==0){if(t.$from.index(t.depth-1)==0)return!1;let d=f.resolve(t.start-2);n=new x(d,d,t.depth),t.endIndex<t.parent.childCount&&(t=new x(t.$from,f.resolve(t.$to.end(t.depth)),t.depth)),o=!0}let i=w(n,e,l,t);return i?(r&&v(r,t,i,o,e),!0):!1}function v(r,t,e,l,o){let n=s.empty;for(let u=e.length-1;u>=0;u--)n=s.from(e[u].type.create(e[u].attrs,n));r.step(new h(t.start-(l?2:0),t.end,t.start,t.end,new I(n,0,0),e.length,!0));let f=0;for(let u=0;u<e.length;u++)e[u].type==o&&(f=u+1);let i=e.length-f,d=t.start+e.length-(l?2:0),c=t.parent;for(let u=t.startIndex,m=t.endIndex,p=!0;u<m;u++,p=!1)!p&&R(r.doc,d,i)&&(r.split(d,i),d+=2*i),d+=c.child(u).nodeSize;return r}function V(r){return function(t,e){let{$from:l,$to:o}=t.selection,n=l.blockRange(o,f=>f.childCount>0&&f.firstChild.type==r);return n?e?l.node(n.depth-1).type==r?b(t,e,r,n):k(t,e,n):!0:!1}}function b(r,t,e,l){let o=r.tr,n=l.end,f=l.$to.end(l.depth);n<f&&(o.step(new h(n-1,f,n,f,new I(s.from(e.create(null,l.parent.copy())),1,0),1,!0)),l=new x(o.doc.resolve(l.$from.pos),o.doc.resolve(f),l.depth));const i=C(l);if(i==null)return!1;o.lift(l,i);let d=o.doc.resolve(o.mapping.map(n,-1)-1);return L(o.doc,d.pos)&&d.nodeBefore.type==d.nodeAfter.type&&o.join(d.pos),t(o.scrollIntoView()),!0}function k(r,t,e){let l=r.tr,o=e.parent;for(let a=e.end,$=e.endIndex-1,y=e.startIndex;$>y;$--)a-=o.child($).nodeSize,l.delete(a-1,a+1);let n=l.doc.resolve(e.start),f=n.nodeAfter;if(l.mapping.map(e.end)!=e.start+n.nodeAfter.nodeSize)return!1;let i=e.startIndex==0,d=e.endIndex==o.childCount,c=n.node(-1),u=n.index(-1);if(!c.canReplace(u+(i?0:1),u+1,f.content.append(d?s.empty:s.from(o))))return!1;let m=n.pos,p=m+f.nodeSize;return l.step(new h(m-(i?1:0),p+(d?1:0),m+1,p-1,new I((i?s.empty:s.from(o.copy(s.empty))).append(d?s.empty:s.from(o.copy(s.empty))),i?0:1,d?0:1),i?0:1)),t(l.scrollIntoView()),!0}function B(r){return function(t,e){let{$from:l,$to:o}=t.selection,n=l.blockRange(o,c=>c.childCount>0&&c.firstChild.type==r);if(!n)return!1;let f=n.startIndex;if(f==0)return!1;let i=n.parent,d=i.child(f-1);if(d.type!=r)return!1;if(e){let c=d.lastChild&&d.lastChild.type==i.type,u=s.from(c?r.create():null),m=new I(s.from(r.create(null,s.from(i.type.create(null,u)))),c?3:1,0),p=n.start,a=n.end;e(t.tr.step(new h(p-(c?3:1),a,p,a,m,1,!0)).scrollIntoView())}return!0}}export{V as liftListItem,B as sinkListItem,O as wrapInList,S as wrapRangeInList};
+//# sourceMappingURL=index.js.map

package/dist/node_modules/prosemirror-schema-list/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../node_modules/prosemirror-schema-list/dist/index.js"],"sourcesContent":["import { findWrapping, ReplaceAroundStep, canSplit, liftTarget, canJoin } from 'prosemirror-transform';\nimport { NodeRange, Fragment, Slice } from 'prosemirror-model';\nimport { Selection } from 'prosemirror-state';\n\nconst olDOM = [\"ol\", 0], ulDOM = [\"ul\", 0], liDOM = [\"li\", 0];\n/**\nAn ordered list [node spec](https://prosemirror.net/docs/ref/#model.NodeSpec). Has a single\nattribute, `order`, which determines the number at which the list\nstarts counting, and defaults to 1. Represented as an `<ol>`\nelement.\n*/\nconst orderedList = {\n    attrs: { order: { default: 1, validate: \"number\" } },\n    parseDOM: [{ tag: \"ol\", getAttrs(dom) {\n                return { order: dom.hasAttribute(\"start\") ? +dom.getAttribute(\"start\") : 1 };\n            } }],\n    toDOM(node) {\n        return node.attrs.order == 1 ? olDOM : [\"ol\", { start: node.attrs.order }, 0];\n    }\n};\n/**\nA bullet list node spec, represented in the DOM as `<ul>`.\n*/\nconst bulletList = {\n    parseDOM: [{ tag: \"ul\" }],\n    toDOM() { return ulDOM; }\n};\n/**\nA list item (`<li>`) spec.\n*/\nconst listItem = {\n    parseDOM: [{ tag: \"li\" }],\n    toDOM() { return liDOM; },\n    defining: true\n};\nfunction add(obj, props) {\n    let copy = {};\n    for (let prop in obj)\n        copy[prop] = obj[prop];\n    for (let prop in props)\n        copy[prop] = props[prop];\n    return copy;\n}\n/**\nConvenience function for adding list-related node types to a map\nspecifying the nodes for a schema. Adds\n[`orderedList`](https://prosemirror.net/docs/ref/#schema-list.orderedList) as `\"ordered_list\"`,\n[`bulletList`](https://prosemirror.net/docs/ref/#schema-list.bulletList) as `\"bullet_list\"`, and\n[`listItem`](https://prosemirror.net/docs/ref/#schema-list.listItem) as `\"list_item\"`.\n\n`itemContent` determines the content expression for the list items.\nIf you want the commands defined in this module to apply to your\nlist structure, it should have a shape like `\"paragraph block*\"` or\n`\"paragraph (ordered_list | bullet_list)*\"`. `listGroup` can be\ngiven to assign a group name to the list node types, for example\n`\"block\"`.\n*/\nfunction addListNodes(nodes, itemContent, listGroup) {\n    return nodes.append({\n        ordered_list: add(orderedList, { content: \"list_item+\", group: listGroup }),\n        bullet_list: add(bulletList, { content: \"list_item+\", group: listGroup }),\n        list_item: add(listItem, { content: itemContent })\n    });\n}\n/**\nReturns a command function that wraps the selection in a list with\nthe given type an attributes. If `dispatch` is null, only return a\nvalue to indicate whether this is possible, but don't actually\nperform the change.\n*/\nfunction wrapInList(listType, attrs = null) {\n    return function (state, dispatch) {\n        let { $from, $to } = state.selection;\n        let range = $from.blockRange($to);\n        if (!range)\n            return false;\n        let tr = dispatch ? state.tr : null;\n        if (!wrapRangeInList(tr, range, listType, attrs))\n            return false;\n        if (dispatch)\n            dispatch(tr.scrollIntoView());\n        return true;\n    };\n}\n/**\nTry to wrap the given node range in a list of the given type.\nReturn `true` when this is possible, `false` otherwise. When `tr`\nis non-null, the wrapping is added to that transaction. When it is\n`null`, the function only queries whether the wrapping is\npossible.\n*/\nfunction wrapRangeInList(tr, range, listType, attrs = null) {\n    let doJoin = false, outerRange = range, doc = range.$from.doc;\n    // This is at the top of an existing list item\n    if (range.depth >= 2 && range.$from.node(range.depth - 1).type.compatibleContent(listType) && range.startIndex == 0) {\n        // Don't do anything if this is the top of the list\n        if (range.$from.index(range.depth - 1) == 0)\n            return false;\n        let $insert = doc.resolve(range.start - 2);\n        outerRange = new NodeRange($insert, $insert, range.depth);\n        if (range.endIndex < range.parent.childCount)\n            range = new NodeRange(range.$from, doc.resolve(range.$to.end(range.depth)), range.depth);\n        doJoin = true;\n    }\n    let wrap = findWrapping(outerRange, listType, attrs, range);\n    if (!wrap)\n        return false;\n    if (tr)\n        doWrapInList(tr, range, wrap, doJoin, listType);\n    return true;\n}\nfunction doWrapInList(tr, range, wrappers, joinBefore, listType) {\n    let content = Fragment.empty;\n    for (let i = wrappers.length - 1; i >= 0; i--)\n        content = Fragment.from(wrappers[i].type.create(wrappers[i].attrs, content));\n    tr.step(new ReplaceAroundStep(range.start - (joinBefore ? 2 : 0), range.end, range.start, range.end, new Slice(content, 0, 0), wrappers.length, true));\n    let found = 0;\n    for (let i = 0; i < wrappers.length; i++)\n        if (wrappers[i].type == listType)\n            found = i + 1;\n    let splitDepth = wrappers.length - found;\n    let splitPos = range.start + wrappers.length - (joinBefore ? 2 : 0), parent = range.parent;\n    for (let i = range.startIndex, e = range.endIndex, first = true; i < e; i++, first = false) {\n        if (!first && canSplit(tr.doc, splitPos, splitDepth)) {\n            tr.split(splitPos, splitDepth);\n            splitPos += 2 * splitDepth;\n        }\n        splitPos += parent.child(i).nodeSize;\n    }\n    return tr;\n}\n/**\nBuild a command that splits a non-empty textblock at the top level\nof a list item by also splitting that list item.\n*/\nfunction splitListItem(itemType, itemAttrs) {\n    return function (state, dispatch) {\n        let { $from, $to, node } = state.selection;\n        if ((node && node.isBlock) || $from.depth < 2 || !$from.sameParent($to))\n            return false;\n        let grandParent = $from.node(-1);\n        if (grandParent.type != itemType)\n            return false;\n        if ($from.parent.content.size == 0 && $from.node(-1).childCount == $from.indexAfter(-1)) {\n            // In an empty block. If this is a nested list, the wrapping\n            // list item should be split. Otherwise, bail out and let next\n            // command handle lifting.\n            if ($from.depth == 3 || $from.node(-3).type != itemType ||\n                $from.index(-2) != $from.node(-2).childCount - 1)\n                return false;\n            if (dispatch) {\n                let wrap = Fragment.empty;\n                let depthBefore = $from.index(-1) ? 1 : $from.index(-2) ? 2 : 3;\n                // Build a fragment containing empty versions of the structure\n                // from the outer list item to the parent node of the cursor\n                for (let d = $from.depth - depthBefore; d >= $from.depth - 3; d--)\n                    wrap = Fragment.from($from.node(d).copy(wrap));\n                let depthAfter = $from.indexAfter(-1) < $from.node(-2).childCount ? 1\n                    : $from.indexAfter(-2) < $from.node(-3).childCount ? 2 : 3;\n                // Add a second list item with an empty default start node\n                wrap = wrap.append(Fragment.from(itemType.createAndFill()));\n                let start = $from.before($from.depth - (depthBefore - 1));\n                let tr = state.tr.replace(start, $from.after(-depthAfter), new Slice(wrap, 4 - depthBefore, 0));\n                let sel = -1;\n                tr.doc.nodesBetween(start, tr.doc.content.size, (node, pos) => {\n                    if (sel > -1)\n                        return false;\n                    if (node.isTextblock && node.content.size == 0)\n                        sel = pos + 1;\n                });\n                if (sel > -1)\n                    tr.setSelection(Selection.near(tr.doc.resolve(sel)));\n                dispatch(tr.scrollIntoView());\n            }\n            return true;\n        }\n        let nextType = $to.pos == $from.end() ? grandParent.contentMatchAt(0).defaultType : null;\n        let tr = state.tr.delete($from.pos, $to.pos);\n        let types = nextType ? [itemAttrs ? { type: itemType, attrs: itemAttrs } : null, { type: nextType }] : undefined;\n        if (!canSplit(tr.doc, $from.pos, 2, types))\n            return false;\n        if (dispatch)\n            dispatch(tr.split($from.pos, 2, types).scrollIntoView());\n        return true;\n    };\n}\n/**\nActs like [`splitListItem`](https://prosemirror.net/docs/ref/#schema-list.splitListItem), but\nwithout resetting the set of active marks at the cursor.\n*/\nfunction splitListItemKeepMarks(itemType, itemAttrs) {\n    let split = splitListItem(itemType, itemAttrs);\n    return (state, dispatch) => {\n        return split(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}\n/**\nCreate a command to lift the list item around the selection up into\na wrapping list.\n*/\nfunction liftListItem(itemType) {\n    return function (state, dispatch) {\n        let { $from, $to } = state.selection;\n        let range = $from.blockRange($to, node => node.childCount > 0 && node.firstChild.type == itemType);\n        if (!range)\n            return false;\n        if (!dispatch)\n            return true;\n        if ($from.node(range.depth - 1).type == itemType) // Inside a parent list\n            return liftToOuterList(state, dispatch, itemType, range);\n        else // Outer list node\n            return liftOutOfList(state, dispatch, range);\n    };\n}\nfunction liftToOuterList(state, dispatch, itemType, range) {\n    let tr = state.tr, end = range.end, endOfList = range.$to.end(range.depth);\n    if (end < endOfList) {\n        // There are siblings after the lifted items, which must become\n        // children of the last item\n        tr.step(new ReplaceAroundStep(end - 1, endOfList, end, endOfList, new Slice(Fragment.from(itemType.create(null, range.parent.copy())), 1, 0), 1, true));\n        range = new NodeRange(tr.doc.resolve(range.$from.pos), tr.doc.resolve(endOfList), range.depth);\n    }\n    const target = liftTarget(range);\n    if (target == null)\n        return false;\n    tr.lift(range, target);\n    let $after = tr.doc.resolve(tr.mapping.map(end, -1) - 1);\n    if (canJoin(tr.doc, $after.pos) && $after.nodeBefore.type == $after.nodeAfter.type)\n        tr.join($after.pos);\n    dispatch(tr.scrollIntoView());\n    return true;\n}\nfunction liftOutOfList(state, dispatch, range) {\n    let tr = state.tr, list = range.parent;\n    // Merge the list items into a single big item\n    for (let pos = range.end, i = range.endIndex - 1, e = range.startIndex; i > e; i--) {\n        pos -= list.child(i).nodeSize;\n        tr.delete(pos - 1, pos + 1);\n    }\n    let $start = tr.doc.resolve(range.start), item = $start.nodeAfter;\n    if (tr.mapping.map(range.end) != range.start + $start.nodeAfter.nodeSize)\n        return false;\n    let atStart = range.startIndex == 0, atEnd = range.endIndex == list.childCount;\n    let parent = $start.node(-1), indexBefore = $start.index(-1);\n    if (!parent.canReplace(indexBefore + (atStart ? 0 : 1), indexBefore + 1, item.content.append(atEnd ? Fragment.empty : Fragment.from(list))))\n        return false;\n    let start = $start.pos, end = start + item.nodeSize;\n    // Strip off the surrounding list. At the sides where we're not at\n    // the end of the list, the existing list is closed. At sides where\n    // this is the end, it is overwritten to its end.\n    tr.step(new ReplaceAroundStep(start - (atStart ? 1 : 0), end + (atEnd ? 1 : 0), start + 1, end - 1, new Slice((atStart ? Fragment.empty : Fragment.from(list.copy(Fragment.empty)))\n        .append(atEnd ? Fragment.empty : Fragment.from(list.copy(Fragment.empty))), atStart ? 0 : 1, atEnd ? 0 : 1), atStart ? 0 : 1));\n    dispatch(tr.scrollIntoView());\n    return true;\n}\n/**\nCreate a command to sink the list item around the selection down\ninto an inner list.\n*/\nfunction sinkListItem(itemType) {\n    return function (state, dispatch) {\n        let { $from, $to } = state.selection;\n        let range = $from.blockRange($to, node => node.childCount > 0 && node.firstChild.type == itemType);\n        if (!range)\n            return false;\n        let startIndex = range.startIndex;\n        if (startIndex == 0)\n            return false;\n        let parent = range.parent, nodeBefore = parent.child(startIndex - 1);\n        if (nodeBefore.type != itemType)\n            return false;\n        if (dispatch) {\n            let nestedBefore = nodeBefore.lastChild && nodeBefore.lastChild.type == parent.type;\n            let inner = Fragment.from(nestedBefore ? itemType.create() : null);\n            let slice = new Slice(Fragment.from(itemType.create(null, Fragment.from(parent.type.create(null, inner)))), nestedBefore ? 3 : 1, 0);\n            let before = range.start, after = range.end;\n            dispatch(state.tr.step(new ReplaceAroundStep(before - (nestedBefore ? 3 : 1), after, before, after, slice, 1, true))\n                .scrollIntoView());\n        }\n        return true;\n    };\n}\n\nexport { addListNodes, bulletList, liftListItem, listItem, orderedList, sinkListItem, splitListItem, splitListItemKeepMarks, wrapInList, wrapRangeInList };\n"],"names":["wrapInList","listType","attrs","state","dispatch","$from","$to","range","tr","wrapRangeInList","doJoin","outerRange","doc","$insert","NodeRange","wrap","findWrapping","doWrapInList","wrappers","joinBefore","content","Fragment","i","ReplaceAroundStep","Slice","found","splitDepth","splitPos","parent","e","first","canSplit","liftListItem","itemType","node","liftToOuterList","liftOutOfList","end","endOfList","target","liftTarget","$after","canJoin","list","pos","$start","item","atStart","atEnd","indexBefore","start","sinkListItem","startIndex","nodeBefore","nestedBefore","inner","slice","before","after"],"mappings":"sOAsEA,SAASA,EAAWC,EAAUC,EAAQ,KAAM,CACxC,OAAO,SAAUC,EAAOC,EAAU,CAC9B,GAAI,CAAE,MAAAC,EAAO,IAAAC,CAAG,EAAKH,EAAM,UACvBI,EAAQF,EAAM,WAAWC,CAAG,EAChC,GAAI,CAACC,EACD,MAAO,GACX,IAAIC,EAAKJ,EAAWD,EAAM,GAAK,KAC/B,OAAKM,EAAgBD,EAAID,EAAON,EAAUC,CAAK,GAE3CE,GACAA,EAASI,EAAG,gBAAgB,EACzB,IAHI,EAInB,CACA,CAQA,SAASC,EAAgBD,EAAID,EAAON,EAAUC,EAAQ,KAAM,CACxD,IAAIQ,EAAS,GAAOC,EAAaJ,EAAOK,EAAML,EAAM,MAAM,IAE1D,GAAIA,EAAM,OAAS,GAAKA,EAAM,MAAM,KAAKA,EAAM,MAAQ,CAAC,EAAE,KAAK,kBAAkBN,CAAQ,GAAKM,EAAM,YAAc,EAAG,CAEjH,GAAIA,EAAM,MAAM,MAAMA,EAAM,MAAQ,CAAC,GAAK,EACtC,MAAO,GACX,IAAIM,EAAUD,EAAI,QAAQL,EAAM,MAAQ,CAAC,EACzCI,EAAa,IAAIG,EAAUD,EAASA,EAASN,EAAM,KAAK,EACpDA,EAAM,SAAWA,EAAM,OAAO,aAC9BA,EAAQ,IAAIO,EAAUP,EAAM,MAAOK,EAAI,QAAQL,EAAM,IAAI,IAAIA,EAAM,KAAK,CAAC,EAAGA,EAAM,KAAK,GAC3FG,EAAS,EACjB,CACI,IAAIK,EAAOC,EAAaL,EAAYV,EAAUC,EAAOK,CAAK,EAC1D,OAAKQ,GAEDP,GACAS,EAAaT,EAAID,EAAOQ,EAAML,EAAQT,CAAQ,EAC3C,IAHI,EAIf,CACA,SAASgB,EAAaT,EAAID,EAAOW,EAAUC,EAAYlB,EAAU,CAC7D,IAAImB,EAAUC,EAAS,MACvB,QAASC,EAAIJ,EAAS,OAAS,EAAGI,GAAK,EAAGA,IACtCF,EAAUC,EAAS,KAAKH,EAASI,CAAC,EAAE,KAAK,OAAOJ,EAASI,CAAC,EAAE,MAAOF,CAAO,CAAC,EAC/EZ,EAAG,KAAK,IAAIe,EAAkBhB,EAAM,OAASY,EAAa,EAAI,GAAIZ,EAAM,IAAKA,EAAM,MAAOA,EAAM,IAAK,IAAIiB,EAAMJ,EAAS,EAAG,CAAC,EAAGF,EAAS,OAAQ,EAAI,CAAC,EACrJ,IAAIO,EAAQ,EACZ,QAASH,EAAI,EAAGA,EAAIJ,EAAS,OAAQI,IAC7BJ,EAASI,CAAC,EAAE,MAAQrB,IACpBwB,EAAQH,EAAI,GACpB,IAAII,EAAaR,EAAS,OAASO,EAC/BE,EAAWpB,EAAM,MAAQW,EAAS,QAAUC,EAAa,EAAI,GAAIS,EAASrB,EAAM,OACpF,QAASe,EAAIf,EAAM,WAAYsB,EAAItB,EAAM,SAAUuB,EAAQ,GAAMR,EAAIO,EAAGP,IAAKQ,EAAQ,GAC7E,CAACA,GAASC,EAASvB,EAAG,IAAKmB,EAAUD,CAAU,IAC/ClB,EAAG,MAAMmB,EAAUD,CAAU,EAC7BC,GAAY,EAAID,GAEpBC,GAAYC,EAAO,MAAMN,CAAC,EAAE,SAEhC,OAAOd,CACX,CA2EA,SAASwB,EAAaC,EAAU,CAC5B,OAAO,SAAU9B,EAAOC,EAAU,CAC9B,GAAI,CAAE,MAAAC,EAAO,IAAAC,CAAG,EAAKH,EAAM,UACvBI,EAAQF,EAAM,WAAWC,EAAK4B,GAAQA,EAAK,WAAa,GAAKA,EAAK,WAAW,MAAQD,CAAQ,EACjG,OAAK1B,EAEAH,EAEDC,EAAM,KAAKE,EAAM,MAAQ,CAAC,EAAE,MAAQ0B,EAC7BE,EAAgBhC,EAAOC,EAAU6B,EAAU1B,CAAK,EAEhD6B,EAAcjC,EAAOC,EAAUG,CAAK,EAJpC,GAFA,EAOnB,CACA,CACA,SAAS4B,EAAgBhC,EAAOC,EAAU6B,EAAU1B,EAAO,CACvD,IAAIC,EAAKL,EAAM,GAAIkC,EAAM9B,EAAM,IAAK+B,EAAY/B,EAAM,IAAI,IAAIA,EAAM,KAAK,EACrE8B,EAAMC,IAGN9B,EAAG,KAAK,IAAIe,EAAkBc,EAAM,EAAGC,EAAWD,EAAKC,EAAW,IAAId,EAAMH,EAAS,KAAKY,EAAS,OAAO,KAAM1B,EAAM,OAAO,KAAI,CAAE,CAAC,EAAG,EAAG,CAAC,EAAG,EAAG,EAAI,CAAC,EACtJA,EAAQ,IAAIO,EAAUN,EAAG,IAAI,QAAQD,EAAM,MAAM,GAAG,EAAGC,EAAG,IAAI,QAAQ8B,CAAS,EAAG/B,EAAM,KAAK,GAEjG,MAAMgC,EAASC,EAAWjC,CAAK,EAC/B,GAAIgC,GAAU,KACV,MAAO,GACX/B,EAAG,KAAKD,EAAOgC,CAAM,EACrB,IAAIE,EAASjC,EAAG,IAAI,QAAQA,EAAG,QAAQ,IAAI6B,EAAK,EAAE,EAAI,CAAC,EACvD,OAAIK,EAAQlC,EAAG,IAAKiC,EAAO,GAAG,GAAKA,EAAO,WAAW,MAAQA,EAAO,UAAU,MAC1EjC,EAAG,KAAKiC,EAAO,GAAG,EACtBrC,EAASI,EAAG,gBAAgB,EACrB,EACX,CACA,SAAS4B,EAAcjC,EAAOC,EAAUG,EAAO,CAC3C,IAAIC,EAAKL,EAAM,GAAIwC,EAAOpC,EAAM,OAEhC,QAASqC,EAAMrC,EAAM,IAAKe,EAAIf,EAAM,SAAW,EAAGsB,EAAItB,EAAM,WAAYe,EAAIO,EAAGP,IAC3EsB,GAAOD,EAAK,MAAMrB,CAAC,EAAE,SACrBd,EAAG,OAAOoC,EAAM,EAAGA,EAAM,CAAC,EAE9B,IAAIC,EAASrC,EAAG,IAAI,QAAQD,EAAM,KAAK,EAAGuC,EAAOD,EAAO,UACxD,GAAIrC,EAAG,QAAQ,IAAID,EAAM,GAAG,GAAKA,EAAM,MAAQsC,EAAO,UAAU,SAC5D,MAAO,GACX,IAAIE,EAAUxC,EAAM,YAAc,EAAGyC,EAAQzC,EAAM,UAAYoC,EAAK,WAChEf,EAASiB,EAAO,KAAK,EAAE,EAAGI,EAAcJ,EAAO,MAAM,EAAE,EAC3D,GAAI,CAACjB,EAAO,WAAWqB,GAAeF,EAAU,EAAI,GAAIE,EAAc,EAAGH,EAAK,QAAQ,OAAOE,EAAQ3B,EAAS,MAAQA,EAAS,KAAKsB,CAAI,CAAC,CAAC,EACtI,MAAO,GACX,IAAIO,EAAQL,EAAO,IAAKR,EAAMa,EAAQJ,EAAK,SAI3C,OAAAtC,EAAG,KAAK,IAAIe,EAAkB2B,GAASH,EAAU,EAAI,GAAIV,GAAOW,EAAQ,EAAI,GAAIE,EAAQ,EAAGb,EAAM,EAAG,IAAIb,GAAOuB,EAAU1B,EAAS,MAAQA,EAAS,KAAKsB,EAAK,KAAKtB,EAAS,KAAK,CAAC,GAC5K,OAAO2B,EAAQ3B,EAAS,MAAQA,EAAS,KAAKsB,EAAK,KAAKtB,EAAS,KAAK,CAAC,CAAC,EAAG0B,EAAU,EAAI,EAAGC,EAAQ,EAAI,CAAC,EAAGD,EAAU,EAAI,CAAC,CAAC,EACjI3C,EAASI,EAAG,gBAAgB,EACrB,EACX,CAKA,SAAS2C,EAAalB,EAAU,CAC5B,OAAO,SAAU9B,EAAOC,EAAU,CAC9B,GAAI,CAAE,MAAAC,EAAO,IAAAC,CAAG,EAAKH,EAAM,UACvBI,EAAQF,EAAM,WAAWC,EAAK4B,GAAQA,EAAK,WAAa,GAAKA,EAAK,WAAW,MAAQD,CAAQ,EACjG,GAAI,CAAC1B,EACD,MAAO,GACX,IAAI6C,EAAa7C,EAAM,WACvB,GAAI6C,GAAc,EACd,MAAO,GACX,IAAIxB,EAASrB,EAAM,OAAQ8C,EAAazB,EAAO,MAAMwB,EAAa,CAAC,EACnE,GAAIC,EAAW,MAAQpB,EACnB,MAAO,GACX,GAAI7B,EAAU,CACV,IAAIkD,EAAeD,EAAW,WAAaA,EAAW,UAAU,MAAQzB,EAAO,KAC3E2B,EAAQlC,EAAS,KAAKiC,EAAerB,EAAS,OAAM,EAAK,IAAI,EAC7DuB,EAAQ,IAAIhC,EAAMH,EAAS,KAAKY,EAAS,OAAO,KAAMZ,EAAS,KAAKO,EAAO,KAAK,OAAO,KAAM2B,CAAK,CAAC,CAAC,CAAC,EAAGD,EAAe,EAAI,EAAG,CAAC,EAC/HG,EAASlD,EAAM,MAAOmD,EAAQnD,EAAM,IACxCH,EAASD,EAAM,GAAG,KAAK,IAAIoB,EAAkBkC,GAAUH,EAAe,EAAI,GAAII,EAAOD,EAAQC,EAAOF,EAAO,EAAG,EAAI,CAAC,EAC9G,gBAAgB,CACjC,CACQ,MAAO,EACf,CACA","x_google_ignoreList":[0]}

package/dist/node_modules/prosemirror-state/dist/index.js

@@ -0,0 +1,2 @@
+import{Slice as m,Fragment as x,Node as B,Mark as R}from"../../prosemirror-model/dist/index.js";import{ReplaceStep as P,ReplaceAroundStep as K,Transform as $}from"../../prosemirror-transform/dist/index.js";const O=Object.create(null);class l{constructor(e,t,r){this.$anchor=e,this.$head=t,this.ranges=r||[new q(e.min(t),e.max(t))]}get anchor(){return this.$anchor.pos}get head(){return this.$head.pos}get from(){return this.$from.pos}get to(){return this.$to.pos}get $from(){return this.ranges[0].$from}get $to(){return this.ranges[0].$to}get empty(){let e=this.ranges;for(let t=0;t<e.length;t++)if(e[t].$from.pos!=e[t].$to.pos)return!1;return!0}content(){return this.$from.doc.slice(this.from,this.to,!0)}replace(e,t=m.empty){let r=t.content.lastChild,n=null;for(let a=0;a<t.openEnd;a++)n=r,r=r.lastChild;let s=e.steps.length,o=this.ranges;for(let a=0;a<o.length;a++){let{$from:c,$to:u}=o[a],h=e.mapping.slice(s);e.replaceRange(h.map(c.pos),h.map(u.pos),a?m.empty:t),a==0&&E(e,s,(r?r.isInline:n&&n.isTextblock)?-1:1)}}replaceWith(e,t){let r=e.steps.length,n=this.ranges;for(let s=0;s<n.length;s++){let{$from:o,$to:a}=n[s],c=e.mapping.slice(r),u=c.map(o.pos),h=c.map(a.pos);s?e.deleteRange(u,h):(e.replaceRangeWith(u,h,t),E(e,r,t.isInline?-1:1))}}static findFrom(e,t,r=!1){let n=e.parent.inlineContent?new f(e):g(e.node(0),e.parent,e.pos,e.index(),t,r);if(n)return n;for(let s=e.depth-1;s>=0;s--){let o=t<0?g(e.node(0),e.node(s),e.before(s+1),e.index(s),t,r):g(e.node(0),e.node(s),e.after(s+1),e.index(s)+1,t,r);if(o)return o}return null}static near(e,t=1){return this.findFrom(e,t)||this.findFrom(e,-t)||new d(e.node(0))}static atStart(e){return g(e,e,0,0,1)||new d(e)}static atEnd(e){return g(e,e,e.content.size,e.childCount,-1)||new d(e)}static fromJSON(e,t){if(!t||!t.type)throw new RangeError("Invalid input for Selection.fromJSON");let r=O[t.type];if(!r)throw new RangeError(`No selection type ${t.type} defined`);return r.fromJSON(e,t)}static jsonID(e,t){if(e in O)throw new RangeError("Duplicate use of selection JSON ID "+e);return O[e]=t,t.prototype.jsonID=e,t}getBookmark(){return f.between(this.$anchor,this.$head).getBookmark()}}l.prototype.visible=!0;class q{constructor(e,t){this.$from=e,this.$to=t}}let I=!1;function T(i){!I&&!i.parent.inlineContent&&(I=!0,console.warn("TextSelection endpoint not pointing into a node with inline content ("+i.parent.type.name+")"))}class f extends l{constructor(e,t=e){T(e),T(t),super(e,t)}get $cursor(){return this.$anchor.pos==this.$head.pos?this.$head:null}map(e,t){let r=e.resolve(t.map(this.head));if(!r.parent.inlineContent)return l.near(r);let n=e.resolve(t.map(this.anchor));return new f(n.parent.inlineContent?n:r,r)}replace(e,t=m.empty){if(super.replace(e,t),t==m.empty){let r=this.$from.marksAcross(this.$to);r&&e.ensureMarks(r)}}eq(e){return e instanceof f&&e.anchor==this.anchor&&e.head==this.head}getBookmark(){return new y(this.anchor,this.head)}toJSON(){return{type:"text",anchor:this.anchor,head:this.head}}static fromJSON(e,t){if(typeof t.anchor!="number"||typeof t.head!="number")throw new RangeError("Invalid input for TextSelection.fromJSON");return new f(e.resolve(t.anchor),e.resolve(t.head))}static create(e,t,r=t){let n=e.resolve(t);return new this(n,r==t?n:e.resolve(r))}static between(e,t,r){let n=e.pos-t.pos;if((!r||n)&&(r=n>=0?1:-1),!t.parent.inlineContent){let s=l.findFrom(t,r,!0)||l.findFrom(t,-r,!0);if(s)t=s.$head;else return l.near(t,r)}return e.parent.inlineContent||(n==0?e=t:(e=(l.findFrom(e,-r,!0)||l.findFrom(e,r,!0)).$anchor,e.pos<t.pos!=n<0&&(e=t))),new f(e,t)}}l.jsonID("text",f);class y{constructor(e,t){this.anchor=e,this.head=t}map(e){return new y(e.map(this.anchor),e.map(this.head))}resolve(e){return f.between(e.resolve(this.anchor),e.resolve(this.head))}}class p extends l{constructor(e){let t=e.nodeAfter,r=e.node(0).resolve(e.pos+t.nodeSize);super(e,r),this.node=t}map(e,t){let{deleted:r,pos:n}=t.mapResult(this.anchor),s=e.resolve(n);return r?l.near(s):new p(s)}content(){return new m(x.from(this.node),0,0)}eq(e){return e instanceof p&&e.anchor==this.anchor}toJSON(){return{type:"node",anchor:this.anchor}}getBookmark(){return new J(this.anchor)}static fromJSON(e,t){if(typeof t.anchor!="number")throw new RangeError("Invalid input for NodeSelection.fromJSON");return new p(e.resolve(t.anchor))}static create(e,t){return new p(e.resolve(t))}static isSelectable(e){return!e.isText&&e.type.spec.selectable!==!1}}p.prototype.visible=!1;l.jsonID("node",p);class J{constructor(e){this.anchor=e}map(e){let{deleted:t,pos:r}=e.mapResult(this.anchor);return t?new y(r,r):new J(r)}resolve(e){let t=e.resolve(this.anchor),r=t.nodeAfter;return r&&p.isSelectable(r)?new p(t):l.near(t)}}class d extends l{constructor(e){super(e.resolve(0),e.resolve(e.content.size))}replace(e,t=m.empty){if(t==m.empty){e.delete(0,e.doc.content.size);let r=l.atStart(e.doc);r.eq(e.selection)||e.setSelection(r)}else super.replace(e,t)}toJSON(){return{type:"all"}}static fromJSON(e){return new d(e)}map(e){return new d(e)}eq(e){return e instanceof d}getBookmark(){return z}}l.jsonID("all",d);const z={map(){return this},resolve(i){return new d(i)}};function g(i,e,t,r,n,s=!1){if(e.inlineContent)return f.create(i,t);for(let o=r-(n>0?0:1);n>0?o<e.childCount:o>=0;o+=n){let a=e.child(o);if(a.isAtom){if(!s&&p.isSelectable(a))return p.create(i,t-(n<0?a.nodeSize:0))}else{let c=g(i,a,t+n,n<0?a.childCount:0,n,s);if(c)return c}t+=a.nodeSize*n}return null}function E(i,e,t){let r=i.steps.length-1;if(r<e)return;let n=i.steps[r];if(!(n instanceof P||n instanceof K))return;let s=i.mapping.maps[r],o;s.forEach((a,c,u,h)=>{o==null&&(o=h)}),i.setSelection(l.near(i.doc.resolve(o),t))}const b=1,k=2,F=4;class W extends ${constructor(e){super(e.doc),this.curSelectionFor=0,this.updated=0,this.meta=Object.create(null),this.time=Date.now(),this.curSelection=e.selection,this.storedMarks=e.storedMarks}get selection(){return this.curSelectionFor<this.steps.length&&(this.curSelection=this.curSelection.map(this.doc,this.mapping.slice(this.curSelectionFor)),this.curSelectionFor=this.steps.length),this.curSelection}setSelection(e){if(e.$from.doc!=this.doc)throw new RangeError("Selection passed to setSelection must point at the current document");return this.curSelection=e,this.curSelectionFor=this.steps.length,this.updated=(this.updated|b)&~k,this.storedMarks=null,this}get selectionSet(){return(this.updated&b)>0}setStoredMarks(e){return this.storedMarks=e,this.updated|=k,this}ensureMarks(e){return R.sameSet(this.storedMarks||this.selection.$from.marks(),e)||this.setStoredMarks(e),this}addStoredMark(e){return this.ensureMarks(e.addToSet(this.storedMarks||this.selection.$head.marks()))}removeStoredMark(e){return this.ensureMarks(e.removeFromSet(this.storedMarks||this.selection.$head.marks()))}get storedMarksSet(){return(this.updated&k)>0}addStep(e,t){super.addStep(e,t),this.updated=this.updated&~k,this.storedMarks=null}setTime(e){return this.time=e,this}replaceSelection(e){return this.selection.replace(this,e),this}replaceSelectionWith(e,t=!0){let r=this.selection;return t&&(e=e.mark(this.storedMarks||(r.empty?r.$from.marks():r.$from.marksAcross(r.$to)||R.none))),r.replaceWith(this,e),this}deleteSelection(){return this.selection.replace(this),this}insertText(e,t,r){let n=this.doc.type.schema;if(t==null)return e?this.replaceSelectionWith(n.text(e),!0):this.deleteSelection();{if(r==null&&(r=t),r=r??t,!e)return this.deleteRange(t,r);let s=this.storedMarks;if(!s){let o=this.doc.resolve(t);s=r==t?o.marks():o.marksAcross(this.doc.resolve(r))}return this.replaceRangeWith(t,r,n.text(e,s)),this.selection.empty||this.setSelection(l.near(this.selection.$to)),this}}setMeta(e,t){return this.meta[typeof e=="string"?e:e.key]=t,this}getMeta(e){return this.meta[typeof e=="string"?e:e.key]}get isGeneric(){for(let e in this.meta)return!1;return!0}scrollIntoView(){return this.updated|=F,this}get scrolledIntoView(){return(this.updated&F)>0}}function D(i,e){return!e||!i?i:i.bind(e)}class S{constructor(e,t,r){this.name=e,this.init=D(t.init,r),this.apply=D(t.apply,r)}}const L=[new S("doc",{init(i){return i.doc||i.schema.topNodeType.createAndFill()},apply(i){return i.doc}}),new S("selection",{init(i,e){return i.selection||l.atStart(e.doc)},apply(i){return i.selection}}),new S("storedMarks",{init(i){return i.storedMarks||null},apply(i,e,t,r){return r.selection.$cursor?i.storedMarks:null}}),new S("scrollToSelection",{init(){return 0},apply(i,e){return i.scrolledIntoView?e+1:e}})];class v{constructor(e,t){this.schema=e,this.plugins=[],this.pluginsByKey=Object.create(null),this.fields=L.slice(),t&&t.forEach(r=>{if(this.pluginsByKey[r.key])throw new RangeError("Adding different instances of a keyed plugin ("+r.key+")");this.plugins.push(r),this.pluginsByKey[r.key]=r,r.spec.state&&this.fields.push(new S(r.key,r.spec.state,r))})}}class w{constructor(e){this.config=e}get schema(){return this.config.schema}get plugins(){return this.config.plugins}apply(e){return this.applyTransaction(e).state}filterTransaction(e,t=-1){for(let r=0;r<this.config.plugins.length;r++)if(r!=t){let n=this.config.plugins[r];if(n.spec.filterTransaction&&!n.spec.filterTransaction.call(n,e,this))return!1}return!0}applyTransaction(e){if(!this.filterTransaction(e))return{state:this,transactions:[]};let t=[e],r=this.applyInner(e),n=null;for(;;){let s=!1;for(let o=0;o<this.config.plugins.length;o++){let a=this.config.plugins[o];if(a.spec.appendTransaction){let c=n?n[o].n:0,u=n?n[o].state:this,h=c<t.length&&a.spec.appendTransaction.call(a,c?t.slice(c):t,u,r);if(h&&r.filterTransaction(h,o)){if(h.setMeta("appendedTransaction",e),!n){n=[];for(let M=0;M<this.config.plugins.length;M++)n.push(M<o?{state:r,n:t.length}:{state:this,n:0})}t.push(h),r=r.applyInner(h),s=!0}n&&(n[o]={state:r,n:t.length})}}if(!s)return{state:r,transactions:t}}}applyInner(e){if(!e.before.eq(this.doc))throw new RangeError("Applying a mismatched transaction");let t=new w(this.config),r=this.config.fields;for(let n=0;n<r.length;n++){let s=r[n];t[s.name]=s.apply(e,this[s.name],this,t)}return t}get tr(){return new W(this)}static create(e){let t=new v(e.doc?e.doc.type.schema:e.schema,e.plugins),r=new w(t);for(let n=0;n<t.fields.length;n++)r[t.fields[n].name]=t.fields[n].init(e,r);return r}reconfigure(e){let t=new v(this.schema,e.plugins),r=t.fields,n=new w(t);for(let s=0;s<r.length;s++){let o=r[s].name;n[o]=this.hasOwnProperty(o)?this[o]:r[s].init(e,n)}return n}toJSON(e){let t={doc:this.doc.toJSON(),selection:this.selection.toJSON()};if(this.storedMarks&&(t.storedMarks=this.storedMarks.map(r=>r.toJSON())),e&&typeof e=="object")for(let r in e){if(r=="doc"||r=="selection")throw new RangeError("The JSON fields `doc` and `selection` are reserved");let n=e[r],s=n.spec.state;s&&s.toJSON&&(t[r]=s.toJSON.call(n,this[n.key]))}return t}static fromJSON(e,t,r){if(!t)throw new RangeError("Invalid input for EditorState.fromJSON");if(!e.schema)throw new RangeError("Required config field 'schema' missing");let n=new v(e.schema,e.plugins),s=new w(n);return n.fields.forEach(o=>{if(o.name=="doc")s.doc=B.fromJSON(e.schema,t.doc);else if(o.name=="selection")s.selection=l.fromJSON(s.doc,t.selection);else if(o.name=="storedMarks")t.storedMarks&&(s.storedMarks=t.storedMarks.map(e.schema.markFromJSON));else{if(r)for(let a in r){let c=r[a],u=c.spec.state;if(c.key==o.name&&u&&u.fromJSON&&Object.prototype.hasOwnProperty.call(t,a)){s[o.name]=u.fromJSON.call(c,e,t[a],s);return}}s[o.name]=o.init(e,s)}}),s}}function A(i,e,t){for(let r in i){let n=i[r];n instanceof Function?n=n.bind(e):r=="handleDOMEvents"&&(n=A(n,e,{})),t[r]=n}return t}class G{constructor(e){this.spec=e,this.props={},e.props&&A(e.props,this,this.props),this.key=e.key?e.key.key:C("plugin")}getState(e){return e[this.key]}}const N=Object.create(null);function C(i){return i in N?i+"$"+ ++N[i]:(N[i]=0,i+"$")}class H{constructor(e="key"){this.key=C(e)}get(e){return e.config.pluginsByKey[this.key]}getState(e){return e[this.key]}}export{d as AllSelection,w as EditorState,p as NodeSelection,G as Plugin,H as PluginKey,l as Selection,q as SelectionRange,f as TextSelection,W as Transaction};
+//# sourceMappingURL=index.js.map

package/dist/node_modules/prosemirror-state/dist/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../node_modules/prosemirror-state/dist/index.js"],"sourcesContent":["import { Slice, Fragment, Mark, Node } from 'prosemirror-model';\nimport { ReplaceStep, ReplaceAroundStep, Transform } from 'prosemirror-transform';\n\nconst classesById = Object.create(null);\n/**\nSuperclass for editor selections. Every selection type should\nextend this. Should not be instantiated directly.\n*/\nclass Selection {\n    /**\n    Initialize a selection with the head and anchor and ranges. If no\n    ranges are given, constructs a single range across `$anchor` and\n    `$head`.\n    */\n    constructor(\n    /**\n    The resolved anchor of the selection (the side that stays in\n    place when the selection is modified).\n    */\n    $anchor, \n    /**\n    The resolved head of the selection (the side that moves when\n    the selection is modified).\n    */\n    $head, ranges) {\n        this.$anchor = $anchor;\n        this.$head = $head;\n        this.ranges = ranges || [new SelectionRange($anchor.min($head), $anchor.max($head))];\n    }\n    /**\n    The selection's anchor, as an unresolved position.\n    */\n    get anchor() { return this.$anchor.pos; }\n    /**\n    The selection's head.\n    */\n    get head() { return this.$head.pos; }\n    /**\n    The lower bound of the selection's main range.\n    */\n    get from() { return this.$from.pos; }\n    /**\n    The upper bound of the selection's main range.\n    */\n    get to() { return this.$to.pos; }\n    /**\n    The resolved lower  bound of the selection's main range.\n    */\n    get $from() {\n        return this.ranges[0].$from;\n    }\n    /**\n    The resolved upper bound of the selection's main range.\n    */\n    get $to() {\n        return this.ranges[0].$to;\n    }\n    /**\n    Indicates whether the selection contains any content.\n    */\n    get empty() {\n        let ranges = this.ranges;\n        for (let i = 0; i < ranges.length; i++)\n            if (ranges[i].$from.pos != ranges[i].$to.pos)\n                return false;\n        return true;\n    }\n    /**\n    Get the content of this selection as a slice.\n    */\n    content() {\n        return this.$from.doc.slice(this.from, this.to, true);\n    }\n    /**\n    Replace the selection with a slice or, if no slice is given,\n    delete the selection. Will append to the given transaction.\n    */\n    replace(tr, content = Slice.empty) {\n        // Put the new selection at the position after the inserted\n        // content. When that ended in an inline node, search backwards,\n        // to get the position after that node. If not, search forward.\n        let lastNode = content.content.lastChild, lastParent = null;\n        for (let i = 0; i < content.openEnd; i++) {\n            lastParent = lastNode;\n            lastNode = lastNode.lastChild;\n        }\n        let mapFrom = tr.steps.length, ranges = this.ranges;\n        for (let i = 0; i < ranges.length; i++) {\n            let { $from, $to } = ranges[i], mapping = tr.mapping.slice(mapFrom);\n            tr.replaceRange(mapping.map($from.pos), mapping.map($to.pos), i ? Slice.empty : content);\n            if (i == 0)\n                selectionToInsertionEnd(tr, mapFrom, (lastNode ? lastNode.isInline : lastParent && lastParent.isTextblock) ? -1 : 1);\n        }\n    }\n    /**\n    Replace the selection with the given node, appending the changes\n    to the given transaction.\n    */\n    replaceWith(tr, node) {\n        let mapFrom = tr.steps.length, ranges = this.ranges;\n        for (let i = 0; i < ranges.length; i++) {\n            let { $from, $to } = ranges[i], mapping = tr.mapping.slice(mapFrom);\n            let from = mapping.map($from.pos), to = mapping.map($to.pos);\n            if (i) {\n                tr.deleteRange(from, to);\n            }\n            else {\n                tr.replaceRangeWith(from, to, node);\n                selectionToInsertionEnd(tr, mapFrom, node.isInline ? -1 : 1);\n            }\n        }\n    }\n    /**\n    Find a valid cursor or leaf node selection starting at the given\n    position and searching back if `dir` is negative, and forward if\n    positive. When `textOnly` is true, only consider cursor\n    selections. Will return null when no valid selection position is\n    found.\n    */\n    static findFrom($pos, dir, textOnly = false) {\n        let inner = $pos.parent.inlineContent ? new TextSelection($pos)\n            : findSelectionIn($pos.node(0), $pos.parent, $pos.pos, $pos.index(), dir, textOnly);\n        if (inner)\n            return inner;\n        for (let depth = $pos.depth - 1; depth >= 0; depth--) {\n            let found = dir < 0\n                ? findSelectionIn($pos.node(0), $pos.node(depth), $pos.before(depth + 1), $pos.index(depth), dir, textOnly)\n                : findSelectionIn($pos.node(0), $pos.node(depth), $pos.after(depth + 1), $pos.index(depth) + 1, dir, textOnly);\n            if (found)\n                return found;\n        }\n        return null;\n    }\n    /**\n    Find a valid cursor or leaf node selection near the given\n    position. Searches forward first by default, but if `bias` is\n    negative, it will search backwards first.\n    */\n    static near($pos, bias = 1) {\n        return this.findFrom($pos, bias) || this.findFrom($pos, -bias) || new AllSelection($pos.node(0));\n    }\n    /**\n    Find the cursor or leaf node selection closest to the start of\n    the given document. Will return an\n    [`AllSelection`](https://prosemirror.net/docs/ref/#state.AllSelection) if no valid position\n    exists.\n    */\n    static atStart(doc) {\n        return findSelectionIn(doc, doc, 0, 0, 1) || new AllSelection(doc);\n    }\n    /**\n    Find the cursor or leaf node selection closest to the end of the\n    given document.\n    */\n    static atEnd(doc) {\n        return findSelectionIn(doc, doc, doc.content.size, doc.childCount, -1) || new AllSelection(doc);\n    }\n    /**\n    Deserialize the JSON representation of a selection. Must be\n    implemented for custom classes (as a static class method).\n    */\n    static fromJSON(doc, json) {\n        if (!json || !json.type)\n            throw new RangeError(\"Invalid input for Selection.fromJSON\");\n        let cls = classesById[json.type];\n        if (!cls)\n            throw new RangeError(`No selection type ${json.type} defined`);\n        return cls.fromJSON(doc, json);\n    }\n    /**\n    To be able to deserialize selections from JSON, custom selection\n    classes must register themselves with an ID string, so that they\n    can be disambiguated. Try to pick something that's unlikely to\n    clash with classes from other modules.\n    */\n    static jsonID(id, selectionClass) {\n        if (id in classesById)\n            throw new RangeError(\"Duplicate use of selection JSON ID \" + id);\n        classesById[id] = selectionClass;\n        selectionClass.prototype.jsonID = id;\n        return selectionClass;\n    }\n    /**\n    Get a [bookmark](https://prosemirror.net/docs/ref/#state.SelectionBookmark) for this selection,\n    which is a value that can be mapped without having access to a\n    current document, and later resolved to a real selection for a\n    given document again. (This is used mostly by the history to\n    track and restore old selections.) The default implementation of\n    this method just converts the selection to a text selection and\n    returns the bookmark for that.\n    */\n    getBookmark() {\n        return TextSelection.between(this.$anchor, this.$head).getBookmark();\n    }\n}\nSelection.prototype.visible = true;\n/**\nRepresents a selected range in a document.\n*/\nclass SelectionRange {\n    /**\n    Create a range.\n    */\n    constructor(\n    /**\n    The lower bound of the range.\n    */\n    $from, \n    /**\n    The upper bound of the range.\n    */\n    $to) {\n        this.$from = $from;\n        this.$to = $to;\n    }\n}\nlet warnedAboutTextSelection = false;\nfunction checkTextSelection($pos) {\n    if (!warnedAboutTextSelection && !$pos.parent.inlineContent) {\n        warnedAboutTextSelection = true;\n        console[\"warn\"](\"TextSelection endpoint not pointing into a node with inline content (\" + $pos.parent.type.name + \")\");\n    }\n}\n/**\nA text selection represents a classical editor selection, with a\nhead (the moving side) and anchor (immobile side), both of which\npoint into textblock nodes. It can be empty (a regular cursor\nposition).\n*/\nclass TextSelection extends Selection {\n    /**\n    Construct a text selection between the given points.\n    */\n    constructor($anchor, $head = $anchor) {\n        checkTextSelection($anchor);\n        checkTextSelection($head);\n        super($anchor, $head);\n    }\n    /**\n    Returns a resolved position if this is a cursor selection (an\n    empty text selection), and null otherwise.\n    */\n    get $cursor() { return this.$anchor.pos == this.$head.pos ? this.$head : null; }\n    map(doc, mapping) {\n        let $head = doc.resolve(mapping.map(this.head));\n        if (!$head.parent.inlineContent)\n            return Selection.near($head);\n        let $anchor = doc.resolve(mapping.map(this.anchor));\n        return new TextSelection($anchor.parent.inlineContent ? $anchor : $head, $head);\n    }\n    replace(tr, content = Slice.empty) {\n        super.replace(tr, content);\n        if (content == Slice.empty) {\n            let marks = this.$from.marksAcross(this.$to);\n            if (marks)\n                tr.ensureMarks(marks);\n        }\n    }\n    eq(other) {\n        return other instanceof TextSelection && other.anchor == this.anchor && other.head == this.head;\n    }\n    getBookmark() {\n        return new TextBookmark(this.anchor, this.head);\n    }\n    toJSON() {\n        return { type: \"text\", anchor: this.anchor, head: this.head };\n    }\n    /**\n    @internal\n    */\n    static fromJSON(doc, json) {\n        if (typeof json.anchor != \"number\" || typeof json.head != \"number\")\n            throw new RangeError(\"Invalid input for TextSelection.fromJSON\");\n        return new TextSelection(doc.resolve(json.anchor), doc.resolve(json.head));\n    }\n    /**\n    Create a text selection from non-resolved positions.\n    */\n    static create(doc, anchor, head = anchor) {\n        let $anchor = doc.resolve(anchor);\n        return new this($anchor, head == anchor ? $anchor : doc.resolve(head));\n    }\n    /**\n    Return a text selection that spans the given positions or, if\n    they aren't text positions, find a text selection near them.\n    `bias` determines whether the method searches forward (default)\n    or backwards (negative number) first. Will fall back to calling\n    [`Selection.near`](https://prosemirror.net/docs/ref/#state.Selection^near) when the document\n    doesn't contain a valid text position.\n    */\n    static between($anchor, $head, bias) {\n        let dPos = $anchor.pos - $head.pos;\n        if (!bias || dPos)\n            bias = dPos >= 0 ? 1 : -1;\n        if (!$head.parent.inlineContent) {\n            let found = Selection.findFrom($head, bias, true) || Selection.findFrom($head, -bias, true);\n            if (found)\n                $head = found.$head;\n            else\n                return Selection.near($head, bias);\n        }\n        if (!$anchor.parent.inlineContent) {\n            if (dPos == 0) {\n                $anchor = $head;\n            }\n            else {\n                $anchor = (Selection.findFrom($anchor, -bias, true) || Selection.findFrom($anchor, bias, true)).$anchor;\n                if (($anchor.pos < $head.pos) != (dPos < 0))\n                    $anchor = $head;\n            }\n        }\n        return new TextSelection($anchor, $head);\n    }\n}\nSelection.jsonID(\"text\", TextSelection);\nclass TextBookmark {\n    constructor(anchor, head) {\n        this.anchor = anchor;\n        this.head = head;\n    }\n    map(mapping) {\n        return new TextBookmark(mapping.map(this.anchor), mapping.map(this.head));\n    }\n    resolve(doc) {\n        return TextSelection.between(doc.resolve(this.anchor), doc.resolve(this.head));\n    }\n}\n/**\nA node selection is a selection that points at a single node. All\nnodes marked [selectable](https://prosemirror.net/docs/ref/#model.NodeSpec.selectable) can be the\ntarget of a node selection. In such a selection, `from` and `to`\npoint directly before and after the selected node, `anchor` equals\n`from`, and `head` equals `to`..\n*/\nclass NodeSelection extends Selection {\n    /**\n    Create a node selection. Does not verify the validity of its\n    argument.\n    */\n    constructor($pos) {\n        let node = $pos.nodeAfter;\n        let $end = $pos.node(0).resolve($pos.pos + node.nodeSize);\n        super($pos, $end);\n        this.node = node;\n    }\n    map(doc, mapping) {\n        let { deleted, pos } = mapping.mapResult(this.anchor);\n        let $pos = doc.resolve(pos);\n        if (deleted)\n            return Selection.near($pos);\n        return new NodeSelection($pos);\n    }\n    content() {\n        return new Slice(Fragment.from(this.node), 0, 0);\n    }\n    eq(other) {\n        return other instanceof NodeSelection && other.anchor == this.anchor;\n    }\n    toJSON() {\n        return { type: \"node\", anchor: this.anchor };\n    }\n    getBookmark() { return new NodeBookmark(this.anchor); }\n    /**\n    @internal\n    */\n    static fromJSON(doc, json) {\n        if (typeof json.anchor != \"number\")\n            throw new RangeError(\"Invalid input for NodeSelection.fromJSON\");\n        return new NodeSelection(doc.resolve(json.anchor));\n    }\n    /**\n    Create a node selection from non-resolved positions.\n    */\n    static create(doc, from) {\n        return new NodeSelection(doc.resolve(from));\n    }\n    /**\n    Determines whether the given node may be selected as a node\n    selection.\n    */\n    static isSelectable(node) {\n        return !node.isText && node.type.spec.selectable !== false;\n    }\n}\nNodeSelection.prototype.visible = false;\nSelection.jsonID(\"node\", NodeSelection);\nclass NodeBookmark {\n    constructor(anchor) {\n        this.anchor = anchor;\n    }\n    map(mapping) {\n        let { deleted, pos } = mapping.mapResult(this.anchor);\n        return deleted ? new TextBookmark(pos, pos) : new NodeBookmark(pos);\n    }\n    resolve(doc) {\n        let $pos = doc.resolve(this.anchor), node = $pos.nodeAfter;\n        if (node && NodeSelection.isSelectable(node))\n            return new NodeSelection($pos);\n        return Selection.near($pos);\n    }\n}\n/**\nA selection type that represents selecting the whole document\n(which can not necessarily be expressed with a text selection, when\nthere are for example leaf block nodes at the start or end of the\ndocument).\n*/\nclass AllSelection extends Selection {\n    /**\n    Create an all-selection over the given document.\n    */\n    constructor(doc) {\n        super(doc.resolve(0), doc.resolve(doc.content.size));\n    }\n    replace(tr, content = Slice.empty) {\n        if (content == Slice.empty) {\n            tr.delete(0, tr.doc.content.size);\n            let sel = Selection.atStart(tr.doc);\n            if (!sel.eq(tr.selection))\n                tr.setSelection(sel);\n        }\n        else {\n            super.replace(tr, content);\n        }\n    }\n    toJSON() { return { type: \"all\" }; }\n    /**\n    @internal\n    */\n    static fromJSON(doc) { return new AllSelection(doc); }\n    map(doc) { return new AllSelection(doc); }\n    eq(other) { return other instanceof AllSelection; }\n    getBookmark() { return AllBookmark; }\n}\nSelection.jsonID(\"all\", AllSelection);\nconst AllBookmark = {\n    map() { return this; },\n    resolve(doc) { return new AllSelection(doc); }\n};\n// FIXME we'll need some awareness of text direction when scanning for selections\n// Try to find a selection inside the given node. `pos` points at the\n// position where the search starts. When `text` is true, only return\n// text selections.\nfunction findSelectionIn(doc, node, pos, index, dir, text = false) {\n    if (node.inlineContent)\n        return TextSelection.create(doc, pos);\n    for (let i = index - (dir > 0 ? 0 : 1); dir > 0 ? i < node.childCount : i >= 0; i += dir) {\n        let child = node.child(i);\n        if (!child.isAtom) {\n            let inner = findSelectionIn(doc, child, pos + dir, dir < 0 ? child.childCount : 0, dir, text);\n            if (inner)\n                return inner;\n        }\n        else if (!text && NodeSelection.isSelectable(child)) {\n            return NodeSelection.create(doc, pos - (dir < 0 ? child.nodeSize : 0));\n        }\n        pos += child.nodeSize * dir;\n    }\n    return null;\n}\nfunction selectionToInsertionEnd(tr, startLen, bias) {\n    let last = tr.steps.length - 1;\n    if (last < startLen)\n        return;\n    let step = tr.steps[last];\n    if (!(step instanceof ReplaceStep || step instanceof ReplaceAroundStep))\n        return;\n    let map = tr.mapping.maps[last], end;\n    map.forEach((_from, _to, _newFrom, newTo) => { if (end == null)\n        end = newTo; });\n    tr.setSelection(Selection.near(tr.doc.resolve(end), bias));\n}\n\nconst UPDATED_SEL = 1, UPDATED_MARKS = 2, UPDATED_SCROLL = 4;\n/**\nAn editor state transaction, which can be applied to a state to\ncreate an updated state. Use\n[`EditorState.tr`](https://prosemirror.net/docs/ref/#state.EditorState.tr) to create an instance.\n\nTransactions track changes to the document (they are a subclass of\n[`Transform`](https://prosemirror.net/docs/ref/#transform.Transform)), but also other state changes,\nlike selection updates and adjustments of the set of [stored\nmarks](https://prosemirror.net/docs/ref/#state.EditorState.storedMarks). In addition, you can store\nmetadata properties in a transaction, which are extra pieces of\ninformation that client code or plugins can use to describe what a\ntransaction represents, so that they can update their [own\nstate](https://prosemirror.net/docs/ref/#state.StateField) accordingly.\n\nThe [editor view](https://prosemirror.net/docs/ref/#view.EditorView) uses a few metadata\nproperties: it will attach a property `\"pointer\"` with the value\n`true` to selection transactions directly caused by mouse or touch\ninput, a `\"composition\"` property holding an ID identifying the\ncomposition that caused it to transactions caused by composed DOM\ninput, and a `\"uiEvent\"` property of that may be `\"paste\"`,\n`\"cut\"`, or `\"drop\"`.\n*/\nclass Transaction extends Transform {\n    /**\n    @internal\n    */\n    constructor(state) {\n        super(state.doc);\n        // The step count for which the current selection is valid.\n        this.curSelectionFor = 0;\n        // Bitfield to track which aspects of the state were updated by\n        // this transaction.\n        this.updated = 0;\n        // Object used to store metadata properties for the transaction.\n        this.meta = Object.create(null);\n        this.time = Date.now();\n        this.curSelection = state.selection;\n        this.storedMarks = state.storedMarks;\n    }\n    /**\n    The transaction's current selection. This defaults to the editor\n    selection [mapped](https://prosemirror.net/docs/ref/#state.Selection.map) through the steps in the\n    transaction, but can be overwritten with\n    [`setSelection`](https://prosemirror.net/docs/ref/#state.Transaction.setSelection).\n    */\n    get selection() {\n        if (this.curSelectionFor < this.steps.length) {\n            this.curSelection = this.curSelection.map(this.doc, this.mapping.slice(this.curSelectionFor));\n            this.curSelectionFor = this.steps.length;\n        }\n        return this.curSelection;\n    }\n    /**\n    Update the transaction's current selection. Will determine the\n    selection that the editor gets when the transaction is applied.\n    */\n    setSelection(selection) {\n        if (selection.$from.doc != this.doc)\n            throw new RangeError(\"Selection passed to setSelection must point at the current document\");\n        this.curSelection = selection;\n        this.curSelectionFor = this.steps.length;\n        this.updated = (this.updated | UPDATED_SEL) & ~UPDATED_MARKS;\n        this.storedMarks = null;\n        return this;\n    }\n    /**\n    Whether the selection was explicitly updated by this transaction.\n    */\n    get selectionSet() {\n        return (this.updated & UPDATED_SEL) > 0;\n    }\n    /**\n    Set the current stored marks.\n    */\n    setStoredMarks(marks) {\n        this.storedMarks = marks;\n        this.updated |= UPDATED_MARKS;\n        return this;\n    }\n    /**\n    Make sure the current stored marks or, if that is null, the marks\n    at the selection, match the given set of marks. Does nothing if\n    this is already the case.\n    */\n    ensureMarks(marks) {\n        if (!Mark.sameSet(this.storedMarks || this.selection.$from.marks(), marks))\n            this.setStoredMarks(marks);\n        return this;\n    }\n    /**\n    Add a mark to the set of stored marks.\n    */\n    addStoredMark(mark) {\n        return this.ensureMarks(mark.addToSet(this.storedMarks || this.selection.$head.marks()));\n    }\n    /**\n    Remove a mark or mark type from the set of stored marks.\n    */\n    removeStoredMark(mark) {\n        return this.ensureMarks(mark.removeFromSet(this.storedMarks || this.selection.$head.marks()));\n    }\n    /**\n    Whether the stored marks were explicitly set for this transaction.\n    */\n    get storedMarksSet() {\n        return (this.updated & UPDATED_MARKS) > 0;\n    }\n    /**\n    @internal\n    */\n    addStep(step, doc) {\n        super.addStep(step, doc);\n        this.updated = this.updated & ~UPDATED_MARKS;\n        this.storedMarks = null;\n    }\n    /**\n    Update the timestamp for the transaction.\n    */\n    setTime(time) {\n        this.time = time;\n        return this;\n    }\n    /**\n    Replace the current selection with the given slice.\n    */\n    replaceSelection(slice) {\n        this.selection.replace(this, slice);\n        return this;\n    }\n    /**\n    Replace the selection with the given node. When `inheritMarks` is\n    true and the content is inline, it inherits the marks from the\n    place where it is inserted.\n    */\n    replaceSelectionWith(node, inheritMarks = true) {\n        let selection = this.selection;\n        if (inheritMarks)\n            node = node.mark(this.storedMarks || (selection.empty ? selection.$from.marks() : (selection.$from.marksAcross(selection.$to) || Mark.none)));\n        selection.replaceWith(this, node);\n        return this;\n    }\n    /**\n    Delete the selection.\n    */\n    deleteSelection() {\n        this.selection.replace(this);\n        return this;\n    }\n    /**\n    Replace the given range, or the selection if no range is given,\n    with a text node containing the given string.\n    */\n    insertText(text, from, to) {\n        let schema = this.doc.type.schema;\n        if (from == null) {\n            if (!text)\n                return this.deleteSelection();\n            return this.replaceSelectionWith(schema.text(text), true);\n        }\n        else {\n            if (to == null)\n                to = from;\n            to = to == null ? from : to;\n            if (!text)\n                return this.deleteRange(from, to);\n            let marks = this.storedMarks;\n            if (!marks) {\n                let $from = this.doc.resolve(from);\n                marks = to == from ? $from.marks() : $from.marksAcross(this.doc.resolve(to));\n            }\n            this.replaceRangeWith(from, to, schema.text(text, marks));\n            if (!this.selection.empty)\n                this.setSelection(Selection.near(this.selection.$to));\n            return this;\n        }\n    }\n    /**\n    Store a metadata property in this transaction, keyed either by\n    name or by plugin.\n    */\n    setMeta(key, value) {\n        this.meta[typeof key == \"string\" ? key : key.key] = value;\n        return this;\n    }\n    /**\n    Retrieve a metadata property for a given name or plugin.\n    */\n    getMeta(key) {\n        return this.meta[typeof key == \"string\" ? key : key.key];\n    }\n    /**\n    Returns true if this transaction doesn't contain any metadata,\n    and can thus safely be extended.\n    */\n    get isGeneric() {\n        for (let _ in this.meta)\n            return false;\n        return true;\n    }\n    /**\n    Indicate that the editor should scroll the selection into view\n    when updated to the state produced by this transaction.\n    */\n    scrollIntoView() {\n        this.updated |= UPDATED_SCROLL;\n        return this;\n    }\n    /**\n    True when this transaction has had `scrollIntoView` called on it.\n    */\n    get scrolledIntoView() {\n        return (this.updated & UPDATED_SCROLL) > 0;\n    }\n}\n\nfunction bind(f, self) {\n    return !self || !f ? f : f.bind(self);\n}\nclass FieldDesc {\n    constructor(name, desc, self) {\n        this.name = name;\n        this.init = bind(desc.init, self);\n        this.apply = bind(desc.apply, self);\n    }\n}\nconst baseFields = [\n    new FieldDesc(\"doc\", {\n        init(config) { return config.doc || config.schema.topNodeType.createAndFill(); },\n        apply(tr) { return tr.doc; }\n    }),\n    new FieldDesc(\"selection\", {\n        init(config, instance) { return config.selection || Selection.atStart(instance.doc); },\n        apply(tr) { return tr.selection; }\n    }),\n    new FieldDesc(\"storedMarks\", {\n        init(config) { return config.storedMarks || null; },\n        apply(tr, _marks, _old, state) { return state.selection.$cursor ? tr.storedMarks : null; }\n    }),\n    new FieldDesc(\"scrollToSelection\", {\n        init() { return 0; },\n        apply(tr, prev) { return tr.scrolledIntoView ? prev + 1 : prev; }\n    })\n];\n// Object wrapping the part of a state object that stays the same\n// across transactions. Stored in the state's `config` property.\nclass Configuration {\n    constructor(schema, plugins) {\n        this.schema = schema;\n        this.plugins = [];\n        this.pluginsByKey = Object.create(null);\n        this.fields = baseFields.slice();\n        if (plugins)\n            plugins.forEach(plugin => {\n                if (this.pluginsByKey[plugin.key])\n                    throw new RangeError(\"Adding different instances of a keyed plugin (\" + plugin.key + \")\");\n                this.plugins.push(plugin);\n                this.pluginsByKey[plugin.key] = plugin;\n                if (plugin.spec.state)\n                    this.fields.push(new FieldDesc(plugin.key, plugin.spec.state, plugin));\n            });\n    }\n}\n/**\nThe state of a ProseMirror editor is represented by an object of\nthis type. A state is a persistent data structure—it isn't\nupdated, but rather a new state value is computed from an old one\nusing the [`apply`](https://prosemirror.net/docs/ref/#state.EditorState.apply) method.\n\nA state holds a number of built-in fields, and plugins can\n[define](https://prosemirror.net/docs/ref/#state.PluginSpec.state) additional fields.\n*/\nclass EditorState {\n    /**\n    @internal\n    */\n    constructor(\n    /**\n    @internal\n    */\n    config) {\n        this.config = config;\n    }\n    /**\n    The schema of the state's document.\n    */\n    get schema() {\n        return this.config.schema;\n    }\n    /**\n    The plugins that are active in this state.\n    */\n    get plugins() {\n        return this.config.plugins;\n    }\n    /**\n    Apply the given transaction to produce a new state.\n    */\n    apply(tr) {\n        return this.applyTransaction(tr).state;\n    }\n    /**\n    @internal\n    */\n    filterTransaction(tr, ignore = -1) {\n        for (let i = 0; i < this.config.plugins.length; i++)\n            if (i != ignore) {\n                let plugin = this.config.plugins[i];\n                if (plugin.spec.filterTransaction && !plugin.spec.filterTransaction.call(plugin, tr, this))\n                    return false;\n            }\n        return true;\n    }\n    /**\n    Verbose variant of [`apply`](https://prosemirror.net/docs/ref/#state.EditorState.apply) that\n    returns the precise transactions that were applied (which might\n    be influenced by the [transaction\n    hooks](https://prosemirror.net/docs/ref/#state.PluginSpec.filterTransaction) of\n    plugins) along with the new state.\n    */\n    applyTransaction(rootTr) {\n        if (!this.filterTransaction(rootTr))\n            return { state: this, transactions: [] };\n        let trs = [rootTr], newState = this.applyInner(rootTr), seen = null;\n        // This loop repeatedly gives plugins a chance to respond to\n        // transactions as new transactions are added, making sure to only\n        // pass the transactions the plugin did not see before.\n        for (;;) {\n            let haveNew = false;\n            for (let i = 0; i < this.config.plugins.length; i++) {\n                let plugin = this.config.plugins[i];\n                if (plugin.spec.appendTransaction) {\n                    let n = seen ? seen[i].n : 0, oldState = seen ? seen[i].state : this;\n                    let tr = n < trs.length &&\n                        plugin.spec.appendTransaction.call(plugin, n ? trs.slice(n) : trs, oldState, newState);\n                    if (tr && newState.filterTransaction(tr, i)) {\n                        tr.setMeta(\"appendedTransaction\", rootTr);\n                        if (!seen) {\n                            seen = [];\n                            for (let j = 0; j < this.config.plugins.length; j++)\n                                seen.push(j < i ? { state: newState, n: trs.length } : { state: this, n: 0 });\n                        }\n                        trs.push(tr);\n                        newState = newState.applyInner(tr);\n                        haveNew = true;\n                    }\n                    if (seen)\n                        seen[i] = { state: newState, n: trs.length };\n                }\n            }\n            if (!haveNew)\n                return { state: newState, transactions: trs };\n        }\n    }\n    /**\n    @internal\n    */\n    applyInner(tr) {\n        if (!tr.before.eq(this.doc))\n            throw new RangeError(\"Applying a mismatched transaction\");\n        let newInstance = new EditorState(this.config), fields = this.config.fields;\n        for (let i = 0; i < fields.length; i++) {\n            let field = fields[i];\n            newInstance[field.name] = field.apply(tr, this[field.name], this, newInstance);\n        }\n        return newInstance;\n    }\n    /**\n    Start a [transaction](https://prosemirror.net/docs/ref/#state.Transaction) from this state.\n    */\n    get tr() { return new Transaction(this); }\n    /**\n    Create a new state.\n    */\n    static create(config) {\n        let $config = new Configuration(config.doc ? config.doc.type.schema : config.schema, config.plugins);\n        let instance = new EditorState($config);\n        for (let i = 0; i < $config.fields.length; i++)\n            instance[$config.fields[i].name] = $config.fields[i].init(config, instance);\n        return instance;\n    }\n    /**\n    Create a new state based on this one, but with an adjusted set\n    of active plugins. State fields that exist in both sets of\n    plugins are kept unchanged. Those that no longer exist are\n    dropped, and those that are new are initialized using their\n    [`init`](https://prosemirror.net/docs/ref/#state.StateField.init) method, passing in the new\n    configuration object..\n    */\n    reconfigure(config) {\n        let $config = new Configuration(this.schema, config.plugins);\n        let fields = $config.fields, instance = new EditorState($config);\n        for (let i = 0; i < fields.length; i++) {\n            let name = fields[i].name;\n            instance[name] = this.hasOwnProperty(name) ? this[name] : fields[i].init(config, instance);\n        }\n        return instance;\n    }\n    /**\n    Serialize this state to JSON. If you want to serialize the state\n    of plugins, pass an object mapping property names to use in the\n    resulting JSON object to plugin objects. The argument may also be\n    a string or number, in which case it is ignored, to support the\n    way `JSON.stringify` calls `toString` methods.\n    */\n    toJSON(pluginFields) {\n        let result = { doc: this.doc.toJSON(), selection: this.selection.toJSON() };\n        if (this.storedMarks)\n            result.storedMarks = this.storedMarks.map(m => m.toJSON());\n        if (pluginFields && typeof pluginFields == 'object')\n            for (let prop in pluginFields) {\n                if (prop == \"doc\" || prop == \"selection\")\n                    throw new RangeError(\"The JSON fields `doc` and `selection` are reserved\");\n                let plugin = pluginFields[prop], state = plugin.spec.state;\n                if (state && state.toJSON)\n                    result[prop] = state.toJSON.call(plugin, this[plugin.key]);\n            }\n        return result;\n    }\n    /**\n    Deserialize a JSON representation of a state. `config` should\n    have at least a `schema` field, and should contain array of\n    plugins to initialize the state with. `pluginFields` can be used\n    to deserialize the state of plugins, by associating plugin\n    instances with the property names they use in the JSON object.\n    */\n    static fromJSON(config, json, pluginFields) {\n        if (!json)\n            throw new RangeError(\"Invalid input for EditorState.fromJSON\");\n        if (!config.schema)\n            throw new RangeError(\"Required config field 'schema' missing\");\n        let $config = new Configuration(config.schema, config.plugins);\n        let instance = new EditorState($config);\n        $config.fields.forEach(field => {\n            if (field.name == \"doc\") {\n                instance.doc = Node.fromJSON(config.schema, json.doc);\n            }\n            else if (field.name == \"selection\") {\n                instance.selection = Selection.fromJSON(instance.doc, json.selection);\n            }\n            else if (field.name == \"storedMarks\") {\n                if (json.storedMarks)\n                    instance.storedMarks = json.storedMarks.map(config.schema.markFromJSON);\n            }\n            else {\n                if (pluginFields)\n                    for (let prop in pluginFields) {\n                        let plugin = pluginFields[prop], state = plugin.spec.state;\n                        if (plugin.key == field.name && state && state.fromJSON &&\n                            Object.prototype.hasOwnProperty.call(json, prop)) {\n                            instance[field.name] = state.fromJSON.call(plugin, config, json[prop], instance);\n                            return;\n                        }\n                    }\n                instance[field.name] = field.init(config, instance);\n            }\n        });\n        return instance;\n    }\n}\n\nfunction bindProps(obj, self, target) {\n    for (let prop in obj) {\n        let val = obj[prop];\n        if (val instanceof Function)\n            val = val.bind(self);\n        else if (prop == \"handleDOMEvents\")\n            val = bindProps(val, self, {});\n        target[prop] = val;\n    }\n    return target;\n}\n/**\nPlugins bundle functionality that can be added to an editor.\nThey are part of the [editor state](https://prosemirror.net/docs/ref/#state.EditorState) and\nmay influence that state and the view that contains it.\n*/\nclass Plugin {\n    /**\n    Create a plugin.\n    */\n    constructor(\n    /**\n    The plugin's [spec object](https://prosemirror.net/docs/ref/#state.PluginSpec).\n    */\n    spec) {\n        this.spec = spec;\n        /**\n        The [props](https://prosemirror.net/docs/ref/#view.EditorProps) exported by this plugin.\n        */\n        this.props = {};\n        if (spec.props)\n            bindProps(spec.props, this, this.props);\n        this.key = spec.key ? spec.key.key : createKey(\"plugin\");\n    }\n    /**\n    Extract the plugin's state field from an editor state.\n    */\n    getState(state) { return state[this.key]; }\n}\nconst keys = Object.create(null);\nfunction createKey(name) {\n    if (name in keys)\n        return name + \"$\" + ++keys[name];\n    keys[name] = 0;\n    return name + \"$\";\n}\n/**\nA key is used to [tag](https://prosemirror.net/docs/ref/#state.PluginSpec.key) plugins in a way\nthat makes it possible to find them, given an editor state.\nAssigning a key does mean only one plugin of that type can be\nactive in a state.\n*/\nclass PluginKey {\n    /**\n    Create a plugin key.\n    */\n    constructor(name = \"key\") { this.key = createKey(name); }\n    /**\n    Get the active plugin with this key, if any, from an editor\n    state.\n    */\n    get(state) { return state.config.pluginsByKey[this.key]; }\n    /**\n    Get the plugin's state from an editor state.\n    */\n    getState(state) { return state[this.key]; }\n}\n\nexport { AllSelection, EditorState, NodeSelection, Plugin, PluginKey, Selection, SelectionRange, TextSelection, Transaction };\n"],"names":["classesById","Selection","$anchor","$head","ranges","SelectionRange","i","tr","content","Slice","lastNode","lastParent","mapFrom","$from","$to","mapping","selectionToInsertionEnd","node","from","to","$pos","dir","textOnly","inner","TextSelection","findSelectionIn","depth","found","bias","AllSelection","doc","json","cls","id","selectionClass","warnedAboutTextSelection","checkTextSelection","marks","other","TextBookmark","anchor","head","dPos","NodeSelection","$end","deleted","pos","Fragment","NodeBookmark","sel","AllBookmark","index","text","child","startLen","last","step","ReplaceStep","ReplaceAroundStep","map","end","_from","_to","_newFrom","newTo","UPDATED_SEL","UPDATED_MARKS","UPDATED_SCROLL","Transaction","Transform","state","selection","Mark","mark","time","slice","inheritMarks","schema","key","value","_","bind","f","self","FieldDesc","name","desc","baseFields","config","instance","_marks","_old","prev","Configuration","plugins","plugin","EditorState","ignore","rootTr","trs","newState","seen","haveNew","n","oldState","j","newInstance","fields","field","$config","pluginFields","result","m","prop","Node","bindProps","obj","target","val","Plugin","spec","createKey","keys","PluginKey"],"mappings":"8MAGA,MAAMA,EAAc,OAAO,OAAO,IAAI,EAKtC,MAAMC,CAAU,CAMZ,YAKAC,EAKAC,EAAOC,EAAQ,CACX,KAAK,QAAUF,EACf,KAAK,MAAQC,EACb,KAAK,OAASC,GAAU,CAAC,IAAIC,EAAeH,EAAQ,IAAIC,CAAK,EAAGD,EAAQ,IAAIC,CAAK,CAAC,CAAC,CAC3F,CAII,IAAI,QAAS,CAAE,OAAO,KAAK,QAAQ,GAAI,CAIvC,IAAI,MAAO,CAAE,OAAO,KAAK,MAAM,GAAI,CAInC,IAAI,MAAO,CAAE,OAAO,KAAK,MAAM,GAAI,CAInC,IAAI,IAAK,CAAE,OAAO,KAAK,IAAI,GAAI,CAI/B,IAAI,OAAQ,CACR,OAAO,KAAK,OAAO,CAAC,EAAE,KAC9B,CAII,IAAI,KAAM,CACN,OAAO,KAAK,OAAO,CAAC,EAAE,GAC9B,CAII,IAAI,OAAQ,CACR,IAAIC,EAAS,KAAK,OAClB,QAASE,EAAI,EAAGA,EAAIF,EAAO,OAAQE,IAC/B,GAAIF,EAAOE,CAAC,EAAE,MAAM,KAAOF,EAAOE,CAAC,EAAE,IAAI,IACrC,MAAO,GACf,MAAO,EACf,CAII,SAAU,CACN,OAAO,KAAK,MAAM,IAAI,MAAM,KAAK,KAAM,KAAK,GAAI,EAAI,CAC5D,CAKI,QAAQC,EAAIC,EAAUC,EAAM,MAAO,CAI/B,IAAIC,EAAWF,EAAQ,QAAQ,UAAWG,EAAa,KACvD,QAASL,EAAI,EAAGA,EAAIE,EAAQ,QAASF,IACjCK,EAAaD,EACbA,EAAWA,EAAS,UAExB,IAAIE,EAAUL,EAAG,MAAM,OAAQH,EAAS,KAAK,OAC7C,QAASE,EAAI,EAAGA,EAAIF,EAAO,OAAQE,IAAK,CACpC,GAAI,CAAE,MAAAO,EAAO,IAAAC,CAAG,EAAKV,EAAOE,CAAC,EAAGS,EAAUR,EAAG,QAAQ,MAAMK,CAAO,EAClEL,EAAG,aAAaQ,EAAQ,IAAIF,EAAM,GAAG,EAAGE,EAAQ,IAAID,EAAI,GAAG,EAAGR,EAAIG,EAAM,MAAQD,CAAO,EACnFF,GAAK,GACLU,EAAwBT,EAAIK,GAAUF,EAAWA,EAAS,SAAWC,GAAcA,EAAW,aAAe,GAAK,CAAC,CACnI,CACA,CAKI,YAAYJ,EAAIU,EAAM,CAClB,IAAIL,EAAUL,EAAG,MAAM,OAAQH,EAAS,KAAK,OAC7C,QAASE,EAAI,EAAGA,EAAIF,EAAO,OAAQE,IAAK,CACpC,GAAI,CAAE,MAAAO,EAAO,IAAAC,CAAG,EAAKV,EAAOE,CAAC,EAAGS,EAAUR,EAAG,QAAQ,MAAMK,CAAO,EAC9DM,EAAOH,EAAQ,IAAIF,EAAM,GAAG,EAAGM,EAAKJ,EAAQ,IAAID,EAAI,GAAG,EACvDR,EACAC,EAAG,YAAYW,EAAMC,CAAE,GAGvBZ,EAAG,iBAAiBW,EAAMC,EAAIF,CAAI,EAClCD,EAAwBT,EAAIK,EAASK,EAAK,SAAW,GAAK,CAAC,EAE3E,CACA,CAQI,OAAO,SAASG,EAAMC,EAAKC,EAAW,GAAO,CACzC,IAAIC,EAAQH,EAAK,OAAO,cAAgB,IAAII,EAAcJ,CAAI,EACxDK,EAAgBL,EAAK,KAAK,CAAC,EAAGA,EAAK,OAAQA,EAAK,IAAKA,EAAK,MAAK,EAAIC,EAAKC,CAAQ,EACtF,GAAIC,EACA,OAAOA,EACX,QAASG,EAAQN,EAAK,MAAQ,EAAGM,GAAS,EAAGA,IAAS,CAClD,IAAIC,EAAQN,EAAM,EACZI,EAAgBL,EAAK,KAAK,CAAC,EAAGA,EAAK,KAAKM,CAAK,EAAGN,EAAK,OAAOM,EAAQ,CAAC,EAAGN,EAAK,MAAMM,CAAK,EAAGL,EAAKC,CAAQ,EACxGG,EAAgBL,EAAK,KAAK,CAAC,EAAGA,EAAK,KAAKM,CAAK,EAAGN,EAAK,MAAMM,EAAQ,CAAC,EAAGN,EAAK,MAAMM,CAAK,EAAI,EAAGL,EAAKC,CAAQ,EACjH,GAAIK,EACA,OAAOA,CACvB,CACQ,OAAO,IACf,CAMI,OAAO,KAAKP,EAAMQ,EAAO,EAAG,CACxB,OAAO,KAAK,SAASR,EAAMQ,CAAI,GAAK,KAAK,SAASR,EAAM,CAACQ,CAAI,GAAK,IAAIC,EAAaT,EAAK,KAAK,CAAC,CAAC,CACvG,CAOI,OAAO,QAAQU,EAAK,CAChB,OAAOL,EAAgBK,EAAKA,EAAK,EAAG,EAAG,CAAC,GAAK,IAAID,EAAaC,CAAG,CACzE,CAKI,OAAO,MAAMA,EAAK,CACd,OAAOL,EAAgBK,EAAKA,EAAKA,EAAI,QAAQ,KAAMA,EAAI,WAAY,EAAE,GAAK,IAAID,EAAaC,CAAG,CACtG,CAKI,OAAO,SAASA,EAAKC,EAAM,CACvB,GAAI,CAACA,GAAQ,CAACA,EAAK,KACf,MAAM,IAAI,WAAW,sCAAsC,EAC/D,IAAIC,EAAMhC,EAAY+B,EAAK,IAAI,EAC/B,GAAI,CAACC,EACD,MAAM,IAAI,WAAW,qBAAqBD,EAAK,IAAI,UAAU,EACjE,OAAOC,EAAI,SAASF,EAAKC,CAAI,CACrC,CAOI,OAAO,OAAOE,EAAIC,EAAgB,CAC9B,GAAID,KAAMjC,EACN,MAAM,IAAI,WAAW,sCAAwCiC,CAAE,EACnE,OAAAjC,EAAYiC,CAAE,EAAIC,EAClBA,EAAe,UAAU,OAASD,EAC3BC,CACf,CAUI,aAAc,CACV,OAAOV,EAAc,QAAQ,KAAK,QAAS,KAAK,KAAK,EAAE,YAAW,CAC1E,CACA,CACAvB,EAAU,UAAU,QAAU,GAI9B,MAAMI,CAAe,CAIjB,YAIAQ,EAIAC,EAAK,CACD,KAAK,MAAQD,EACb,KAAK,IAAMC,CACnB,CACA,CACA,IAAIqB,EAA2B,GAC/B,SAASC,EAAmBhB,EAAM,CAC1B,CAACe,GAA4B,CAACf,EAAK,OAAO,gBAC1Ce,EAA2B,GAC3B,QAAQ,KAAQ,wEAA0Ef,EAAK,OAAO,KAAK,KAAO,GAAG,EAE7H,CAOA,MAAMI,UAAsBvB,CAAU,CAIlC,YAAYC,EAASC,EAAQD,EAAS,CAClCkC,EAAmBlC,CAAO,EAC1BkC,EAAmBjC,CAAK,EACxB,MAAMD,EAASC,CAAK,CAC5B,CAKI,IAAI,SAAU,CAAE,OAAO,KAAK,QAAQ,KAAO,KAAK,MAAM,IAAM,KAAK,MAAQ,IAAK,CAC9E,IAAI2B,EAAKf,EAAS,CACd,IAAIZ,EAAQ2B,EAAI,QAAQf,EAAQ,IAAI,KAAK,IAAI,CAAC,EAC9C,GAAI,CAACZ,EAAM,OAAO,cACd,OAAOF,EAAU,KAAKE,CAAK,EAC/B,IAAID,EAAU4B,EAAI,QAAQf,EAAQ,IAAI,KAAK,MAAM,CAAC,EAClD,OAAO,IAAIS,EAActB,EAAQ,OAAO,cAAgBA,EAAUC,EAAOA,CAAK,CACtF,CACI,QAAQI,EAAIC,EAAUC,EAAM,MAAO,CAE/B,GADA,MAAM,QAAQF,EAAIC,CAAO,EACrBA,GAAWC,EAAM,MAAO,CACxB,IAAI4B,EAAQ,KAAK,MAAM,YAAY,KAAK,GAAG,EACvCA,GACA9B,EAAG,YAAY8B,CAAK,CACpC,CACA,CACI,GAAGC,EAAO,CACN,OAAOA,aAAiBd,GAAiBc,EAAM,QAAU,KAAK,QAAUA,EAAM,MAAQ,KAAK,IACnG,CACI,aAAc,CACV,OAAO,IAAIC,EAAa,KAAK,OAAQ,KAAK,IAAI,CACtD,CACI,QAAS,CACL,MAAO,CAAE,KAAM,OAAQ,OAAQ,KAAK,OAAQ,KAAM,KAAK,IAAI,CACnE,CAII,OAAO,SAAST,EAAKC,EAAM,CACvB,GAAI,OAAOA,EAAK,QAAU,UAAY,OAAOA,EAAK,MAAQ,SACtD,MAAM,IAAI,WAAW,0CAA0C,EACnE,OAAO,IAAIP,EAAcM,EAAI,QAAQC,EAAK,MAAM,EAAGD,EAAI,QAAQC,EAAK,IAAI,CAAC,CACjF,CAII,OAAO,OAAOD,EAAKU,EAAQC,EAAOD,EAAQ,CACtC,IAAItC,EAAU4B,EAAI,QAAQU,CAAM,EAChC,OAAO,IAAI,KAAKtC,EAASuC,GAAQD,EAAStC,EAAU4B,EAAI,QAAQW,CAAI,CAAC,CAC7E,CASI,OAAO,QAAQvC,EAASC,EAAOyB,EAAM,CACjC,IAAIc,EAAOxC,EAAQ,IAAMC,EAAM,IAG/B,IAFI,CAACyB,GAAQc,KACTd,EAAOc,GAAQ,EAAI,EAAI,IACvB,CAACvC,EAAM,OAAO,cAAe,CAC7B,IAAIwB,EAAQ1B,EAAU,SAASE,EAAOyB,EAAM,EAAI,GAAK3B,EAAU,SAASE,EAAO,CAACyB,EAAM,EAAI,EAC1F,GAAID,EACAxB,EAAQwB,EAAM,UAEd,QAAO1B,EAAU,KAAKE,EAAOyB,CAAI,CACjD,CACQ,OAAK1B,EAAQ,OAAO,gBACZwC,GAAQ,EACRxC,EAAUC,GAGVD,GAAWD,EAAU,SAASC,EAAS,CAAC0B,EAAM,EAAI,GAAK3B,EAAU,SAASC,EAAS0B,EAAM,EAAI,GAAG,QAC3F1B,EAAQ,IAAMC,EAAM,KAASuC,EAAO,IACrCxC,EAAUC,KAGf,IAAIqB,EAActB,EAASC,CAAK,CAC/C,CACA,CACAF,EAAU,OAAO,OAAQuB,CAAa,EACtC,MAAMe,CAAa,CACf,YAAYC,EAAQC,EAAM,CACtB,KAAK,OAASD,EACd,KAAK,KAAOC,CACpB,CACI,IAAI1B,EAAS,CACT,OAAO,IAAIwB,EAAaxB,EAAQ,IAAI,KAAK,MAAM,EAAGA,EAAQ,IAAI,KAAK,IAAI,CAAC,CAChF,CACI,QAAQe,EAAK,CACT,OAAON,EAAc,QAAQM,EAAI,QAAQ,KAAK,MAAM,EAAGA,EAAI,QAAQ,KAAK,IAAI,CAAC,CACrF,CACA,CAQA,MAAMa,UAAsB1C,CAAU,CAKlC,YAAYmB,EAAM,CACd,IAAIH,EAAOG,EAAK,UACZwB,EAAOxB,EAAK,KAAK,CAAC,EAAE,QAAQA,EAAK,IAAMH,EAAK,QAAQ,EACxD,MAAMG,EAAMwB,CAAI,EAChB,KAAK,KAAO3B,CACpB,CACI,IAAIa,EAAKf,EAAS,CACd,GAAI,CAAE,QAAA8B,EAAS,IAAAC,CAAG,EAAK/B,EAAQ,UAAU,KAAK,MAAM,EAChDK,EAAOU,EAAI,QAAQgB,CAAG,EAC1B,OAAID,EACO5C,EAAU,KAAKmB,CAAI,EACvB,IAAIuB,EAAcvB,CAAI,CACrC,CACI,SAAU,CACN,OAAO,IAAIX,EAAMsC,EAAS,KAAK,KAAK,IAAI,EAAG,EAAG,CAAC,CACvD,CACI,GAAGT,EAAO,CACN,OAAOA,aAAiBK,GAAiBL,EAAM,QAAU,KAAK,MACtE,CACI,QAAS,CACL,MAAO,CAAE,KAAM,OAAQ,OAAQ,KAAK,MAAM,CAClD,CACI,aAAc,CAAE,OAAO,IAAIU,EAAa,KAAK,MAAM,CAAE,CAIrD,OAAO,SAASlB,EAAKC,EAAM,CACvB,GAAI,OAAOA,EAAK,QAAU,SACtB,MAAM,IAAI,WAAW,0CAA0C,EACnE,OAAO,IAAIY,EAAcb,EAAI,QAAQC,EAAK,MAAM,CAAC,CACzD,CAII,OAAO,OAAOD,EAAKZ,EAAM,CACrB,OAAO,IAAIyB,EAAcb,EAAI,QAAQZ,CAAI,CAAC,CAClD,CAKI,OAAO,aAAaD,EAAM,CACtB,MAAO,CAACA,EAAK,QAAUA,EAAK,KAAK,KAAK,aAAe,EAC7D,CACA,CACA0B,EAAc,UAAU,QAAU,GAClC1C,EAAU,OAAO,OAAQ0C,CAAa,EACtC,MAAMK,CAAa,CACf,YAAYR,EAAQ,CAChB,KAAK,OAASA,CACtB,CACI,IAAIzB,EAAS,CACT,GAAI,CAAE,QAAA8B,EAAS,IAAAC,CAAG,EAAK/B,EAAQ,UAAU,KAAK,MAAM,EACpD,OAAO8B,EAAU,IAAIN,EAAaO,EAAKA,CAAG,EAAI,IAAIE,EAAaF,CAAG,CAC1E,CACI,QAAQhB,EAAK,CACT,IAAIV,EAAOU,EAAI,QAAQ,KAAK,MAAM,EAAGb,EAAOG,EAAK,UACjD,OAAIH,GAAQ0B,EAAc,aAAa1B,CAAI,EAChC,IAAI0B,EAAcvB,CAAI,EAC1BnB,EAAU,KAAKmB,CAAI,CAClC,CACA,CAOA,MAAMS,UAAqB5B,CAAU,CAIjC,YAAY6B,EAAK,CACb,MAAMA,EAAI,QAAQ,CAAC,EAAGA,EAAI,QAAQA,EAAI,QAAQ,IAAI,CAAC,CAC3D,CACI,QAAQvB,EAAIC,EAAUC,EAAM,MAAO,CAC/B,GAAID,GAAWC,EAAM,MAAO,CACxBF,EAAG,OAAO,EAAGA,EAAG,IAAI,QAAQ,IAAI,EAChC,IAAI0C,EAAMhD,EAAU,QAAQM,EAAG,GAAG,EAC7B0C,EAAI,GAAG1C,EAAG,SAAS,GACpBA,EAAG,aAAa0C,CAAG,CACnC,MAEY,MAAM,QAAQ1C,EAAIC,CAAO,CAErC,CACI,QAAS,CAAE,MAAO,CAAE,KAAM,KAAK,CAAG,CAIlC,OAAO,SAASsB,EAAK,CAAE,OAAO,IAAID,EAAaC,CAAG,CAAE,CACpD,IAAIA,EAAK,CAAE,OAAO,IAAID,EAAaC,CAAG,CAAE,CACxC,GAAGQ,EAAO,CAAE,OAAOA,aAAiBT,CAAa,CACjD,aAAc,CAAE,OAAOqB,CAAY,CACvC,CACAjD,EAAU,OAAO,MAAO4B,CAAY,EACpC,MAAMqB,EAAc,CAChB,KAAM,CAAE,OAAO,IAAK,EACpB,QAAQpB,EAAK,CAAE,OAAO,IAAID,EAAaC,CAAG,CAAE,CAChD,EAKA,SAASL,EAAgBK,EAAKb,EAAM6B,EAAKK,EAAO9B,EAAK+B,EAAO,GAAO,CAC/D,GAAInC,EAAK,cACL,OAAOO,EAAc,OAAOM,EAAKgB,CAAG,EACxC,QAASxC,EAAI6C,GAAS9B,EAAM,EAAI,EAAI,GAAIA,EAAM,EAAIf,EAAIW,EAAK,WAAaX,GAAK,EAAGA,GAAKe,EAAK,CACtF,IAAIgC,EAAQpC,EAAK,MAAMX,CAAC,EACxB,GAAK+C,EAAM,QAKN,GAAI,CAACD,GAAQT,EAAc,aAAaU,CAAK,EAC9C,OAAOV,EAAc,OAAOb,EAAKgB,GAAOzB,EAAM,EAAIgC,EAAM,SAAW,EAAE,MANtD,CACf,IAAI9B,EAAQE,EAAgBK,EAAKuB,EAAOP,EAAMzB,EAAKA,EAAM,EAAIgC,EAAM,WAAa,EAAGhC,EAAK+B,CAAI,EAC5F,GAAI7B,EACA,OAAOA,CACvB,CAIQuB,GAAOO,EAAM,SAAWhC,CAChC,CACI,OAAO,IACX,CACA,SAASL,EAAwBT,EAAI+C,EAAU1B,EAAM,CACjD,IAAI2B,EAAOhD,EAAG,MAAM,OAAS,EAC7B,GAAIgD,EAAOD,EACP,OACJ,IAAIE,EAAOjD,EAAG,MAAMgD,CAAI,EACxB,GAAI,EAAEC,aAAgBC,GAAeD,aAAgBE,GACjD,OACJ,IAAIC,EAAMpD,EAAG,QAAQ,KAAKgD,CAAI,EAAGK,EACjCD,EAAI,QAAQ,CAACE,EAAOC,EAAKC,EAAUC,IAAU,CAAMJ,GAAO,OACtDA,EAAMI,GAAQ,EAClBzD,EAAG,aAAaN,EAAU,KAAKM,EAAG,IAAI,QAAQqD,CAAG,EAAGhC,CAAI,CAAC,CAC7D,CAEA,MAAMqC,EAAc,EAAGC,EAAgB,EAAGC,EAAiB,EAuB3D,MAAMC,UAAoBC,CAAU,CAIhC,YAAYC,EAAO,CACf,MAAMA,EAAM,GAAG,EAEf,KAAK,gBAAkB,EAGvB,KAAK,QAAU,EAEf,KAAK,KAAO,OAAO,OAAO,IAAI,EAC9B,KAAK,KAAO,KAAK,IAAG,EACpB,KAAK,aAAeA,EAAM,UAC1B,KAAK,YAAcA,EAAM,WACjC,CAOI,IAAI,WAAY,CACZ,OAAI,KAAK,gBAAkB,KAAK,MAAM,SAClC,KAAK,aAAe,KAAK,aAAa,IAAI,KAAK,IAAK,KAAK,QAAQ,MAAM,KAAK,eAAe,CAAC,EAC5F,KAAK,gBAAkB,KAAK,MAAM,QAE/B,KAAK,YACpB,CAKI,aAAaC,EAAW,CACpB,GAAIA,EAAU,MAAM,KAAO,KAAK,IAC5B,MAAM,IAAI,WAAW,qEAAqE,EAC9F,YAAK,aAAeA,EACpB,KAAK,gBAAkB,KAAK,MAAM,OAClC,KAAK,SAAW,KAAK,QAAUN,GAAe,CAACC,EAC/C,KAAK,YAAc,KACZ,IACf,CAII,IAAI,cAAe,CACf,OAAQ,KAAK,QAAUD,GAAe,CAC9C,CAII,eAAe5B,EAAO,CAClB,YAAK,YAAcA,EACnB,KAAK,SAAW6B,EACT,IACf,CAMI,YAAY7B,EAAO,CACf,OAAKmC,EAAK,QAAQ,KAAK,aAAe,KAAK,UAAU,MAAM,MAAK,EAAInC,CAAK,GACrE,KAAK,eAAeA,CAAK,EACtB,IACf,CAII,cAAcoC,EAAM,CAChB,OAAO,KAAK,YAAYA,EAAK,SAAS,KAAK,aAAe,KAAK,UAAU,MAAM,MAAK,CAAE,CAAC,CAC/F,CAII,iBAAiBA,EAAM,CACnB,OAAO,KAAK,YAAYA,EAAK,cAAc,KAAK,aAAe,KAAK,UAAU,MAAM,MAAK,CAAE,CAAC,CACpG,CAII,IAAI,gBAAiB,CACjB,OAAQ,KAAK,QAAUP,GAAiB,CAChD,CAII,QAAQV,EAAM1B,EAAK,CACf,MAAM,QAAQ0B,EAAM1B,CAAG,EACvB,KAAK,QAAU,KAAK,QAAU,CAACoC,EAC/B,KAAK,YAAc,IAC3B,CAII,QAAQQ,EAAM,CACV,YAAK,KAAOA,EACL,IACf,CAII,iBAAiBC,EAAO,CACpB,YAAK,UAAU,QAAQ,KAAMA,CAAK,EAC3B,IACf,CAMI,qBAAqB1D,EAAM2D,EAAe,GAAM,CAC5C,IAAIL,EAAY,KAAK,UACrB,OAAIK,IACA3D,EAAOA,EAAK,KAAK,KAAK,cAAgBsD,EAAU,MAAQA,EAAU,MAAM,MAAK,EAAMA,EAAU,MAAM,YAAYA,EAAU,GAAG,GAAKC,EAAK,KAAM,GAChJD,EAAU,YAAY,KAAMtD,CAAI,EACzB,IACf,CAII,iBAAkB,CACd,YAAK,UAAU,QAAQ,IAAI,EACpB,IACf,CAKI,WAAWmC,EAAMlC,EAAMC,EAAI,CACvB,IAAI0D,EAAS,KAAK,IAAI,KAAK,OAC3B,GAAI3D,GAAQ,KACR,OAAKkC,EAEE,KAAK,qBAAqByB,EAAO,KAAKzB,CAAI,EAAG,EAAI,EAD7C,KAAK,gBAAe,EAG9B,CAID,GAHIjC,GAAM,OACNA,EAAKD,GACTC,EAAKA,GAAaD,EACd,CAACkC,EACD,OAAO,KAAK,YAAYlC,EAAMC,CAAE,EACpC,IAAIkB,EAAQ,KAAK,YACjB,GAAI,CAACA,EAAO,CACR,IAAIxB,EAAQ,KAAK,IAAI,QAAQK,CAAI,EACjCmB,EAAQlB,GAAMD,EAAOL,EAAM,MAAK,EAAKA,EAAM,YAAY,KAAK,IAAI,QAAQM,CAAE,CAAC,CAC3F,CACY,YAAK,iBAAiBD,EAAMC,EAAI0D,EAAO,KAAKzB,EAAMf,CAAK,CAAC,EACnD,KAAK,UAAU,OAChB,KAAK,aAAapC,EAAU,KAAK,KAAK,UAAU,GAAG,CAAC,EACjD,IACnB,CACA,CAKI,QAAQ6E,EAAKC,EAAO,CAChB,YAAK,KAAK,OAAOD,GAAO,SAAWA,EAAMA,EAAI,GAAG,EAAIC,EAC7C,IACf,CAII,QAAQD,EAAK,CACT,OAAO,KAAK,KAAK,OAAOA,GAAO,SAAWA,EAAMA,EAAI,GAAG,CAC/D,CAKI,IAAI,WAAY,CACZ,QAASE,KAAK,KAAK,KACf,MAAO,GACX,MAAO,EACf,CAKI,gBAAiB,CACb,YAAK,SAAWb,EACT,IACf,CAII,IAAI,kBAAmB,CACnB,OAAQ,KAAK,QAAUA,GAAkB,CACjD,CACA,CAEA,SAASc,EAAKC,EAAGC,EAAM,CACnB,MAAO,CAACA,GAAQ,CAACD,EAAIA,EAAIA,EAAE,KAAKC,CAAI,CACxC,CACA,MAAMC,CAAU,CACZ,YAAYC,EAAMC,EAAMH,EAAM,CAC1B,KAAK,KAAOE,EACZ,KAAK,KAAOJ,EAAKK,EAAK,KAAMH,CAAI,EAChC,KAAK,MAAQF,EAAKK,EAAK,MAAOH,CAAI,CAC1C,CACA,CACA,MAAMI,EAAa,CACf,IAAIH,EAAU,MAAO,CACjB,KAAKI,EAAQ,CAAE,OAAOA,EAAO,KAAOA,EAAO,OAAO,YAAY,cAAa,CAAG,EAC9E,MAAMjF,EAAI,CAAE,OAAOA,EAAG,GAAI,CAClC,CAAK,EACD,IAAI6E,EAAU,YAAa,CACvB,KAAKI,EAAQC,EAAU,CAAE,OAAOD,EAAO,WAAavF,EAAU,QAAQwF,EAAS,GAAG,CAAE,EACpF,MAAMlF,EAAI,CAAE,OAAOA,EAAG,SAAU,CACxC,CAAK,EACD,IAAI6E,EAAU,cAAe,CACzB,KAAKI,EAAQ,CAAE,OAAOA,EAAO,aAAe,IAAK,EACjD,MAAMjF,EAAImF,EAAQC,EAAMrB,EAAO,CAAE,OAAOA,EAAM,UAAU,QAAU/D,EAAG,YAAc,IAAK,CAChG,CAAK,EACD,IAAI6E,EAAU,oBAAqB,CAC/B,MAAO,CAAE,MAAO,EAAE,EAClB,MAAM7E,EAAIqF,EAAM,CAAE,OAAOrF,EAAG,iBAAmBqF,EAAO,EAAIA,CAAK,CACvE,CAAK,CACL,EAGA,MAAMC,CAAc,CAChB,YAAYhB,EAAQiB,EAAS,CACzB,KAAK,OAASjB,EACd,KAAK,QAAU,CAAA,EACf,KAAK,aAAe,OAAO,OAAO,IAAI,EACtC,KAAK,OAASU,EAAW,MAAK,EAC1BO,GACAA,EAAQ,QAAQC,GAAU,CACtB,GAAI,KAAK,aAAaA,EAAO,GAAG,EAC5B,MAAM,IAAI,WAAW,iDAAmDA,EAAO,IAAM,GAAG,EAC5F,KAAK,QAAQ,KAAKA,CAAM,EACxB,KAAK,aAAaA,EAAO,GAAG,EAAIA,EAC5BA,EAAO,KAAK,OACZ,KAAK,OAAO,KAAK,IAAIX,EAAUW,EAAO,IAAKA,EAAO,KAAK,MAAOA,CAAM,CAAC,CACzF,CAAa,CACb,CACA,CAUA,MAAMC,CAAY,CAId,YAIAR,EAAQ,CACJ,KAAK,OAASA,CACtB,CAII,IAAI,QAAS,CACT,OAAO,KAAK,OAAO,MAC3B,CAII,IAAI,SAAU,CACV,OAAO,KAAK,OAAO,OAC3B,CAII,MAAMjF,EAAI,CACN,OAAO,KAAK,iBAAiBA,CAAE,EAAE,KACzC,CAII,kBAAkBA,EAAI0F,EAAS,GAAI,CAC/B,QAAS3F,EAAI,EAAGA,EAAI,KAAK,OAAO,QAAQ,OAAQA,IAC5C,GAAIA,GAAK2F,EAAQ,CACb,IAAIF,EAAS,KAAK,OAAO,QAAQzF,CAAC,EAClC,GAAIyF,EAAO,KAAK,mBAAqB,CAACA,EAAO,KAAK,kBAAkB,KAAKA,EAAQxF,EAAI,IAAI,EACrF,MAAO,EAC3B,CACQ,MAAO,EACf,CAQI,iBAAiB2F,EAAQ,CACrB,GAAI,CAAC,KAAK,kBAAkBA,CAAM,EAC9B,MAAO,CAAE,MAAO,KAAM,aAAc,CAAA,CAAE,EAC1C,IAAIC,EAAM,CAACD,CAAM,EAAGE,EAAW,KAAK,WAAWF,CAAM,EAAGG,EAAO,KAI/D,OAAS,CACL,IAAIC,EAAU,GACd,QAAShG,EAAI,EAAGA,EAAI,KAAK,OAAO,QAAQ,OAAQA,IAAK,CACjD,IAAIyF,EAAS,KAAK,OAAO,QAAQzF,CAAC,EAClC,GAAIyF,EAAO,KAAK,kBAAmB,CAC/B,IAAIQ,EAAIF,EAAOA,EAAK/F,CAAC,EAAE,EAAI,EAAGkG,EAAWH,EAAOA,EAAK/F,CAAC,EAAE,MAAQ,KAC5DC,EAAKgG,EAAIJ,EAAI,QACbJ,EAAO,KAAK,kBAAkB,KAAKA,EAAQQ,EAAIJ,EAAI,MAAMI,CAAC,EAAIJ,EAAKK,EAAUJ,CAAQ,EACzF,GAAI7F,GAAM6F,EAAS,kBAAkB7F,EAAID,CAAC,EAAG,CAEzC,GADAC,EAAG,QAAQ,sBAAuB2F,CAAM,EACpC,CAACG,EAAM,CACPA,EAAO,CAAA,EACP,QAASI,EAAI,EAAGA,EAAI,KAAK,OAAO,QAAQ,OAAQA,IAC5CJ,EAAK,KAAKI,EAAInG,EAAI,CAAE,MAAO8F,EAAU,EAAGD,EAAI,MAAM,EAAK,CAAE,MAAO,KAAM,EAAG,EAAG,CAC5G,CACwBA,EAAI,KAAK5F,CAAE,EACX6F,EAAWA,EAAS,WAAW7F,CAAE,EACjC+F,EAAU,EAClC,CACwBD,IACAA,EAAK/F,CAAC,EAAI,CAAE,MAAO8F,EAAU,EAAGD,EAAI,MAAM,EAClE,CACA,CACY,GAAI,CAACG,EACD,MAAO,CAAE,MAAOF,EAAU,aAAcD,CAAG,CAC3D,CACA,CAII,WAAW5F,EAAI,CACX,GAAI,CAACA,EAAG,OAAO,GAAG,KAAK,GAAG,EACtB,MAAM,IAAI,WAAW,mCAAmC,EAC5D,IAAImG,EAAc,IAAIV,EAAY,KAAK,MAAM,EAAGW,EAAS,KAAK,OAAO,OACrE,QAASrG,EAAI,EAAGA,EAAIqG,EAAO,OAAQrG,IAAK,CACpC,IAAIsG,EAAQD,EAAOrG,CAAC,EACpBoG,EAAYE,EAAM,IAAI,EAAIA,EAAM,MAAMrG,EAAI,KAAKqG,EAAM,IAAI,EAAG,KAAMF,CAAW,CACzF,CACQ,OAAOA,CACf,CAII,IAAI,IAAK,CAAE,OAAO,IAAItC,EAAY,IAAI,CAAE,CAIxC,OAAO,OAAOoB,EAAQ,CAClB,IAAIqB,EAAU,IAAIhB,EAAcL,EAAO,IAAMA,EAAO,IAAI,KAAK,OAASA,EAAO,OAAQA,EAAO,OAAO,EAC/FC,EAAW,IAAIO,EAAYa,CAAO,EACtC,QAASvG,EAAI,EAAGA,EAAIuG,EAAQ,OAAO,OAAQvG,IACvCmF,EAASoB,EAAQ,OAAOvG,CAAC,EAAE,IAAI,EAAIuG,EAAQ,OAAOvG,CAAC,EAAE,KAAKkF,EAAQC,CAAQ,EAC9E,OAAOA,CACf,CASI,YAAYD,EAAQ,CAChB,IAAIqB,EAAU,IAAIhB,EAAc,KAAK,OAAQL,EAAO,OAAO,EACvDmB,EAASE,EAAQ,OAAQpB,EAAW,IAAIO,EAAYa,CAAO,EAC/D,QAASvG,EAAI,EAAGA,EAAIqG,EAAO,OAAQrG,IAAK,CACpC,IAAI+E,EAAOsB,EAAOrG,CAAC,EAAE,KACrBmF,EAASJ,CAAI,EAAI,KAAK,eAAeA,CAAI,EAAI,KAAKA,CAAI,EAAIsB,EAAOrG,CAAC,EAAE,KAAKkF,EAAQC,CAAQ,CACrG,CACQ,OAAOA,CACf,CAQI,OAAOqB,EAAc,CACjB,IAAIC,EAAS,CAAE,IAAK,KAAK,IAAI,OAAM,EAAI,UAAW,KAAK,UAAU,OAAM,CAAE,EAGzE,GAFI,KAAK,cACLA,EAAO,YAAc,KAAK,YAAY,IAAIC,GAAKA,EAAE,QAAQ,GACzDF,GAAgB,OAAOA,GAAgB,SACvC,QAASG,KAAQH,EAAc,CAC3B,GAAIG,GAAQ,OAASA,GAAQ,YACzB,MAAM,IAAI,WAAW,oDAAoD,EAC7E,IAAIlB,EAASe,EAAaG,CAAI,EAAG3C,EAAQyB,EAAO,KAAK,MACjDzB,GAASA,EAAM,SACfyC,EAAOE,CAAI,EAAI3C,EAAM,OAAO,KAAKyB,EAAQ,KAAKA,EAAO,GAAG,CAAC,EAC7E,CACQ,OAAOgB,CACf,CAQI,OAAO,SAASvB,EAAQzD,EAAM+E,EAAc,CACxC,GAAI,CAAC/E,EACD,MAAM,IAAI,WAAW,wCAAwC,EACjE,GAAI,CAACyD,EAAO,OACR,MAAM,IAAI,WAAW,wCAAwC,EACjE,IAAIqB,EAAU,IAAIhB,EAAcL,EAAO,OAAQA,EAAO,OAAO,EACzDC,EAAW,IAAIO,EAAYa,CAAO,EACtC,OAAAA,EAAQ,OAAO,QAAQD,GAAS,CAC5B,GAAIA,EAAM,MAAQ,MACdnB,EAAS,IAAMyB,EAAK,SAAS1B,EAAO,OAAQzD,EAAK,GAAG,UAE/C6E,EAAM,MAAQ,YACnBnB,EAAS,UAAYxF,EAAU,SAASwF,EAAS,IAAK1D,EAAK,SAAS,UAE/D6E,EAAM,MAAQ,cACf7E,EAAK,cACL0D,EAAS,YAAc1D,EAAK,YAAY,IAAIyD,EAAO,OAAO,YAAY,OAEzE,CACD,GAAIsB,EACA,QAASG,KAAQH,EAAc,CAC3B,IAAIf,EAASe,EAAaG,CAAI,EAAG3C,EAAQyB,EAAO,KAAK,MACrD,GAAIA,EAAO,KAAOa,EAAM,MAAQtC,GAASA,EAAM,UAC3C,OAAO,UAAU,eAAe,KAAKvC,EAAMkF,CAAI,EAAG,CAClDxB,EAASmB,EAAM,IAAI,EAAItC,EAAM,SAAS,KAAKyB,EAAQP,EAAQzD,EAAKkF,CAAI,EAAGxB,CAAQ,EAC/E,MAC5B,CACA,CACgBA,EAASmB,EAAM,IAAI,EAAIA,EAAM,KAAKpB,EAAQC,CAAQ,CAClE,CACA,CAAS,EACMA,CACf,CACA,CAEA,SAAS0B,EAAUC,EAAKjC,EAAMkC,EAAQ,CAClC,QAASJ,KAAQG,EAAK,CAClB,IAAIE,EAAMF,EAAIH,CAAI,EACdK,aAAe,SACfA,EAAMA,EAAI,KAAKnC,CAAI,EACd8B,GAAQ,oBACbK,EAAMH,EAAUG,EAAKnC,EAAM,CAAA,CAAE,GACjCkC,EAAOJ,CAAI,EAAIK,CACvB,CACI,OAAOD,CACX,CAMA,MAAME,CAAO,CAIT,YAIAC,EAAM,CACF,KAAK,KAAOA,EAIZ,KAAK,MAAQ,CAAA,EACTA,EAAK,OACLL,EAAUK,EAAK,MAAO,KAAM,KAAK,KAAK,EAC1C,KAAK,IAAMA,EAAK,IAAMA,EAAK,IAAI,IAAMC,EAAU,QAAQ,CAC/D,CAII,SAASnD,EAAO,CAAE,OAAOA,EAAM,KAAK,GAAG,CAAE,CAC7C,CACA,MAAMoD,EAAO,OAAO,OAAO,IAAI,EAC/B,SAASD,EAAUpC,EAAM,CACrB,OAAIA,KAAQqC,EACDrC,EAAO,KAAM,EAAEqC,EAAKrC,CAAI,GACnCqC,EAAKrC,CAAI,EAAI,EACNA,EAAO,IAClB,CAOA,MAAMsC,CAAU,CAIZ,YAAYtC,EAAO,MAAO,CAAE,KAAK,IAAMoC,EAAUpC,CAAI,CAAE,CAKvD,IAAIf,EAAO,CAAE,OAAOA,EAAM,OAAO,aAAa,KAAK,GAAG,CAAE,CAIxD,SAASA,EAAO,CAAE,OAAOA,EAAM,KAAK,GAAG,CAAE,CAC7C","x_google_ignoreList":[0]}

package/dist/node_modules/prosemirror-transform/dist/index.js

@@ -0,0 +1,3 @@
+import{Slice as w,Fragment as g,Mark as se,MarkType as oe,ReplaceError as le}from"../../prosemirror-model/dist/index.js";const Q=65535,U=Math.pow(2,16);function ae(s,e){return s+e*U}function H(s){return s&Q}function he(s){return(s-(s&Q))/U}const V=1,X=2,J=4,Y=8;class L{constructor(e,t,r){this.pos=e,this.delInfo=t,this.recover=r}get deleted(){return(this.delInfo&Y)>0}get deletedBefore(){return(this.delInfo&(V|J))>0}get deletedAfter(){return(this.delInfo&(X|J))>0}get deletedAcross(){return(this.delInfo&J)>0}}class S{constructor(e,t=!1){if(this.ranges=e,this.inverted=t,!e.length&&S.empty)return S.empty}recover(e){let t=0,r=H(e);if(!this.inverted)for(let n=0;n<r;n++)t+=this.ranges[n*3+2]-this.ranges[n*3+1];return this.ranges[r*3]+t+he(e)}mapResult(e,t=1){return this._map(e,t,!1)}map(e,t=1){return this._map(e,t,!0)}_map(e,t,r){let n=0,i=this.inverted?2:1,o=this.inverted?1:2;for(let l=0;l<this.ranges.length;l+=3){let a=this.ranges[l]-(this.inverted?n:0);if(a>e)break;let h=this.ranges[l+i],p=this.ranges[l+o],c=a+h;if(e<=c){let f=h?e==a?-1:e==c?1:t:t,d=a+n+(f<0?0:p);if(r)return d;let u=e==(t<0?a:c)?null:ae(l/3,e-a),m=e==a?X:e==c?V:J;return(t<0?e!=a:e!=c)&&(m|=Y),new L(d,m,u)}n+=p-h}return r?e+n:new L(e+n,0,null)}touches(e,t){let r=0,n=H(t),i=this.inverted?2:1,o=this.inverted?1:2;for(let l=0;l<this.ranges.length;l+=3){let a=this.ranges[l]-(this.inverted?r:0);if(a>e)break;let h=this.ranges[l+i],p=a+h;if(e<=p&&l==n*3)return!0;r+=this.ranges[l+o]-h}return!1}forEach(e){let t=this.inverted?2:1,r=this.inverted?1:2;for(let n=0,i=0;n<this.ranges.length;n+=3){let o=this.ranges[n],l=o-(this.inverted?i:0),a=o+(this.inverted?0:i),h=this.ranges[n+t],p=this.ranges[n+r];e(l,l+h,a,a+p),i+=p-h}}invert(){return new S(this.ranges,!this.inverted)}toString(){return(this.inverted?"-":"")+JSON.stringify(this.ranges)}static offset(e){return e==0?S.empty:new S(e<0?[0,-e,0]:[0,0,e])}}S.empty=new S([]);class A{constructor(e,t,r=0,n=e?e.length:0){this.mirror=t,this.from=r,this.to=n,this._maps=e||[],this.ownData=!(e||t)}get maps(){return this._maps}slice(e=0,t=this.maps.length){return new A(this._maps,this.mirror,e,t)}appendMap(e,t){this.ownData||(this._maps=this._maps.slice(),this.mirror=this.mirror&&this.mirror.slice(),this.ownData=!0),this.to=this._maps.push(e),t!=null&&this.setMirror(this._maps.length-1,t)}appendMapping(e){for(let t=0,r=this._maps.length;t<e._maps.length;t++){let n=e.getMirror(t);this.appendMap(e._maps[t],n!=null&&n<t?r+n:void 0)}}getMirror(e){if(this.mirror){for(let t=0;t<this.mirror.length;t++)if(this.mirror[t]==e)return this.mirror[t+(t%2?-1:1)]}}setMirror(e,t){this.mirror||(this.mirror=[]),this.mirror.push(e,t)}appendMappingInverted(e){for(let t=e.maps.length-1,r=this._maps.length+e._maps.length;t>=0;t--){let n=e.getMirror(t);this.appendMap(e._maps[t].invert(),n!=null&&n>t?r-n-1:void 0)}}invert(){let e=new A;return e.appendMappingInverted(this),e}map(e,t=1){if(this.mirror)return this._map(e,t,!0);for(let r=this.from;r<this.to;r++)e=this._maps[r].map(e,t);return e}mapResult(e,t=1){return this._map(e,t,!1)}_map(e,t,r){let n=0;for(let i=this.from;i<this.to;i++){let o=this._maps[i],l=o.mapResult(e,t);if(l.recover!=null){let a=this.getMirror(i);if(a!=null&&a>i&&a<this.to){i=a,e=this._maps[a].recover(l.recover);continue}}n|=l.delInfo,e=l.pos}return r?e:new L(e,n,null)}}const B=Object.create(null);class k{getMap(){return S.empty}merge(e){return null}static fromJSON(e,t){if(!t||!t.stepType)throw new RangeError("Invalid input for Step.fromJSON");let r=B[t.stepType];if(!r)throw new RangeError(`No step type ${t.stepType} defined`);return r.fromJSON(e,t)}static jsonID(e,t){if(e in B)throw new RangeError("Duplicate use of step JSON ID "+e);return B[e]=t,t.prototype.jsonID=e,t}}class y{constructor(e,t){this.doc=e,this.failed=t}static ok(e){return new y(e,null)}static fail(e){return new y(null,e)}static fromReplace(e,t,r,n){try{return y.ok(e.replace(t,r,n))}catch(i){if(i instanceof le)return y.fail(i.message);throw i}}}function P(s,e,t){let r=[];for(let n=0;n<s.childCount;n++){let i=s.child(n);i.content.size&&(i=i.copy(P(i.content,e,i))),i.isInline&&(i=e(i,t,n)),r.push(i)}return g.fromArray(r)}class C extends k{constructor(e,t,r){super(),this.from=e,this.to=t,this.mark=r}apply(e){let t=e.slice(this.from,this.to),r=e.resolve(this.from),n=r.node(r.sharedDepth(this.to)),i=new w(P(t.content,(o,l)=>!o.isAtom||!l.type.allowsMarkType(this.mark.type)?o:o.mark(this.mark.addToSet(o.marks)),n),t.openStart,t.openEnd);return y.fromReplace(e,this.from,this.to,i)}invert(){return new b(this.from,this.to,this.mark)}map(e){let t=e.mapResult(this.from,1),r=e.mapResult(this.to,-1);return t.deleted&&r.deleted||t.pos>=r.pos?null:new C(t.pos,r.pos,this.mark)}merge(e){return e instanceof C&&e.mark.eq(this.mark)&&this.from<=e.to&&this.to>=e.from?new C(Math.min(this.from,e.from),Math.max(this.to,e.to),this.mark):null}toJSON(){return{stepType:"addMark",mark:this.mark.toJSON(),from:this.from,to:this.to}}static fromJSON(e,t){if(typeof t.from!="number"||typeof t.to!="number")throw new RangeError("Invalid input for AddMarkStep.fromJSON");return new C(t.from,t.to,e.markFromJSON(t.mark))}}k.jsonID("addMark",C);class b extends k{constructor(e,t,r){super(),this.from=e,this.to=t,this.mark=r}apply(e){let t=e.slice(this.from,this.to),r=new w(P(t.content,n=>n.mark(this.mark.removeFromSet(n.marks)),e),t.openStart,t.openEnd);return y.fromReplace(e,this.from,this.to,r)}invert(){return new C(this.from,this.to,this.mark)}map(e){let t=e.mapResult(this.from,1),r=e.mapResult(this.to,-1);return t.deleted&&r.deleted||t.pos>=r.pos?null:new b(t.pos,r.pos,this.mark)}merge(e){return e instanceof b&&e.mark.eq(this.mark)&&this.from<=e.to&&this.to>=e.from?new b(Math.min(this.from,e.from),Math.max(this.to,e.to),this.mark):null}toJSON(){return{stepType:"removeMark",mark:this.mark.toJSON(),from:this.from,to:this.to}}static fromJSON(e,t){if(typeof t.from!="number"||typeof t.to!="number")throw new RangeError("Invalid input for RemoveMarkStep.fromJSON");return new b(t.from,t.to,e.markFromJSON(t.mark))}}k.jsonID("removeMark",b);class N extends k{constructor(e,t){super(),this.pos=e,this.mark=t}apply(e){let t=e.nodeAt(this.pos);if(!t)return y.fail("No node at mark step's position");let r=t.type.create(t.attrs,null,this.mark.addToSet(t.marks));return y.fromReplace(e,this.pos,this.pos+1,new w(g.from(r),0,t.isLeaf?0:1))}invert(e){let t=e.nodeAt(this.pos);if(t){let r=this.mark.addToSet(t.marks);if(r.length==t.marks.length){for(let n=0;n<t.marks.length;n++)if(!t.marks[n].isInSet(r))return new N(this.pos,t.marks[n]);return new N(this.pos,this.mark)}}return new R(this.pos,this.mark)}map(e){let t=e.mapResult(this.pos,1);return t.deletedAfter?null:new N(t.pos,this.mark)}toJSON(){return{stepType:"addNodeMark",pos:this.pos,mark:this.mark.toJSON()}}static fromJSON(e,t){if(typeof t.pos!="number")throw new RangeError("Invalid input for AddNodeMarkStep.fromJSON");return new N(t.pos,e.markFromJSON(t.mark))}}k.jsonID("addNodeMark",N);class R extends k{constructor(e,t){super(),this.pos=e,this.mark=t}apply(e){let t=e.nodeAt(this.pos);if(!t)return y.fail("No node at mark step's position");let r=t.type.create(t.attrs,null,this.mark.removeFromSet(t.marks));return y.fromReplace(e,this.pos,this.pos+1,new w(g.from(r),0,t.isLeaf?0:1))}invert(e){let t=e.nodeAt(this.pos);return!t||!this.mark.isInSet(t.marks)?this:new N(this.pos,this.mark)}map(e){let t=e.mapResult(this.pos,1);return t.deletedAfter?null:new R(t.pos,this.mark)}toJSON(){return{stepType:"removeNodeMark",pos:this.pos,mark:this.mark.toJSON()}}static fromJSON(e,t){if(typeof t.pos!="number")throw new RangeError("Invalid input for RemoveNodeMarkStep.fromJSON");return new R(t.pos,e.markFromJSON(t.mark))}}k.jsonID("removeNodeMark",R);class v extends k{constructor(e,t,r,n=!1){super(),this.from=e,this.to=t,this.slice=r,this.structure=n}apply(e){return this.structure&&q(e,this.from,this.to)?y.fail("Structure replace would overwrite content"):y.fromReplace(e,this.from,this.to,this.slice)}getMap(){return new S([this.from,this.to-this.from,this.slice.size])}invert(e){return new v(this.from,this.from+this.slice.size,e.slice(this.from,this.to))}map(e){let t=e.mapResult(this.from,1),r=e.mapResult(this.to,-1);return t.deletedAcross&&r.deletedAcross?null:new v(t.pos,Math.max(t.pos,r.pos),this.slice,this.structure)}merge(e){if(!(e instanceof v)||e.structure||this.structure)return null;if(this.from+this.slice.size==e.from&&!this.slice.openEnd&&!e.slice.openStart){let t=this.slice.size+e.slice.size==0?w.empty:new w(this.slice.content.append(e.slice.content),this.slice.openStart,e.slice.openEnd);return new v(this.from,this.to+(e.to-e.from),t,this.structure)}else if(e.to==this.from&&!this.slice.openStart&&!e.slice.openEnd){let t=this.slice.size+e.slice.size==0?w.empty:new w(e.slice.content.append(this.slice.content),e.slice.openStart,this.slice.openEnd);return new v(e.from,this.to,t,this.structure)}else return null}toJSON(){let e={stepType:"replace",from:this.from,to:this.to};return this.slice.size&&(e.slice=this.slice.toJSON()),this.structure&&(e.structure=!0),e}static fromJSON(e,t){if(typeof t.from!="number"||typeof t.to!="number")throw new RangeError("Invalid input for ReplaceStep.fromJSON");return new v(t.from,t.to,w.fromJSON(e,t.slice),!!t.structure)}}k.jsonID("replace",v);class M extends k{constructor(e,t,r,n,i,o,l=!1){super(),this.from=e,this.to=t,this.gapFrom=r,this.gapTo=n,this.slice=i,this.insert=o,this.structure=l}apply(e){if(this.structure&&(q(e,this.from,this.gapFrom)||q(e,this.gapTo,this.to)))return y.fail("Structure gap-replace would overwrite content");let t=e.slice(this.gapFrom,this.gapTo);if(t.openStart||t.openEnd)return y.fail("Gap is not a flat range");let r=this.slice.insertAt(this.insert,t.content);return r?y.fromReplace(e,this.from,this.to,r):y.fail("Content does not fit in gap")}getMap(){return new S([this.from,this.gapFrom-this.from,this.insert,this.gapTo,this.to-this.gapTo,this.slice.size-this.insert])}invert(e){let t=this.gapTo-this.gapFrom;return new M(this.from,this.from+this.slice.size+t,this.from+this.insert,this.from+this.insert+t,e.slice(this.from,this.to).removeBetween(this.gapFrom-this.from,this.gapTo-this.from),this.gapFrom-this.from,this.structure)}map(e){let t=e.mapResult(this.from,1),r=e.mapResult(this.to,-1),n=this.from==this.gapFrom?t.pos:e.map(this.gapFrom,-1),i=this.to==this.gapTo?r.pos:e.map(this.gapTo,1);return t.deletedAcross&&r.deletedAcross||n<t.pos||i>r.pos?null:new M(t.pos,r.pos,n,i,this.slice,this.insert,this.structure)}toJSON(){let e={stepType:"replaceAround",from:this.from,to:this.to,gapFrom:this.gapFrom,gapTo:this.gapTo,insert:this.insert};return this.slice.size&&(e.slice=this.slice.toJSON()),this.structure&&(e.structure=!0),e}static fromJSON(e,t){if(typeof t.from!="number"||typeof t.to!="number"||typeof t.gapFrom!="number"||typeof t.gapTo!="number"||typeof t.insert!="number")throw new RangeError("Invalid input for ReplaceAroundStep.fromJSON");return new M(t.from,t.to,t.gapFrom,t.gapTo,w.fromJSON(e,t.slice),t.insert,!!t.structure)}}k.jsonID("replaceAround",M);function q(s,e,t){let r=s.resolve(e),n=t-e,i=r.depth;for(;n>0&&i>0&&r.indexAfter(i)==r.node(i).childCount;)i--,n--;if(n>0){let o=r.node(i).maybeChild(r.indexAfter(i));for(;n>0;){if(!o||o.isLeaf)return!0;o=o.firstChild,n--}}return!1}function pe(s,e,t,r){let n=[],i=[],o,l;s.doc.nodesBetween(e,t,(a,h,p)=>{if(!a.isInline)return;let c=a.marks;if(!r.isInSet(c)&&p.type.allowsMarkType(r.type)){let f=Math.max(h,e),d=Math.min(h+a.nodeSize,t),u=r.addToSet(c);for(let m=0;m<c.length;m++)c[m].isInSet(u)||(o&&o.to==f&&o.mark.eq(c[m])?o.to=d:n.push(o=new b(f,d,c[m])));l&&l.to==f?l.to=d:i.push(l=new C(f,d,r))}}),n.forEach(a=>s.step(a)),i.forEach(a=>s.step(a))}function fe(s,e,t,r){let n=[],i=0;s.doc.nodesBetween(e,t,(o,l)=>{if(!o.isInline)return;i++;let a=null;if(r instanceof oe){let h=o.marks,p;for(;p=r.isInSet(h);)(a||(a=[])).push(p),h=p.removeFromSet(h)}else r?r.isInSet(o.marks)&&(a=[r]):a=o.marks;if(a&&a.length){let h=Math.min(l+o.nodeSize,t);for(let p=0;p<a.length;p++){let c=a[p],f;for(let d=0;d<n.length;d++){let u=n[d];u.step==i-1&&c.eq(n[d].style)&&(f=u)}f?(f.to=h,f.step=i):n.push({style:c,from:Math.max(l,e),to:h,step:i})}}}),n.forEach(o=>s.step(new b(o.from,o.to,o.style)))}function $(s,e,t,r=t.contentMatch,n=!0){let i=s.doc.nodeAt(e),o=[],l=e+1;for(let a=0;a<i.childCount;a++){let h=i.child(a),p=l+h.nodeSize,c=r.matchType(h.type);if(!c)o.push(new v(l,p,w.empty));else{r=c;for(let f=0;f<h.marks.length;f++)t.allowsMarkType(h.marks[f].type)||s.step(new b(l,p,h.marks[f]));if(n&&h.isText&&t.whitespace!="pre"){let f,d=/\r?\n|\r/g,u;for(;f=d.exec(h.text);)u||(u=new w(g.from(t.schema.text(" ",t.allowedMarks(h.marks))),0,0)),o.push(new v(l+f.index,l+f.index+f[0].length,u))}}l=p}if(!r.validEnd){let a=r.fillBefore(g.empty,!0);s.replace(l,l,new w(a,0,0))}for(let a=o.length-1;a>=0;a--)s.step(o[a])}function ce(s,e,t){return(e==0||s.canReplace(e,s.childCount))&&(t==s.childCount||s.canReplace(0,t))}function Fe(s){let t=s.parent.content.cutByIndex(s.startIndex,s.endIndex);for(let r=s.depth;;--r){let n=s.$from.node(r),i=s.$from.index(r),o=s.$to.indexAfter(r);if(r<s.depth&&n.canReplace(i,o,t))return r;if(r==0||n.type.spec.isolating||!ce(n,i,o))break}return null}function de(s,e,t){let{$from:r,$to:n,depth:i}=e,o=r.before(i+1),l=n.after(i+1),a=o,h=l,p=g.empty,c=0;for(let u=i,m=!1;u>t;u--)m||r.index(u)>0?(m=!0,p=g.from(r.node(u).copy(p)),c++):a--;let f=g.empty,d=0;for(let u=i,m=!1;u>t;u--)m||n.after(u+1)<n.end(u)?(m=!0,f=g.from(n.node(u).copy(f)),d++):h++;s.step(new M(a,h,o,l,new w(p.append(f),c,d),p.size-c,!0))}function ze(s,e,t=null,r=s){let n=ue(s,e),i=n&&me(r,e);return i?n.map(K).concat({type:e,attrs:t}).concat(i.map(K)):null}function K(s){return{type:s,attrs:null}}function ue(s,e){let{parent:t,startIndex:r,endIndex:n}=s,i=t.contentMatchAt(r).findWrapping(e);if(!i)return null;let o=i.length?i[0]:e;return t.canReplaceWith(r,n,o)?i:null}function me(s,e){let{parent:t,startIndex:r,endIndex:n}=s,i=t.child(r),o=e.contentMatch.findWrapping(i.type);if(!o)return null;let a=(o.length?o[o.length-1]:e).contentMatch;for(let h=r;a&&h<n;h++)a=a.matchType(t.child(h).type);return!a||!a.validEnd?null:o}function we(s,e,t){let r=g.empty;for(let o=t.length-1;o>=0;o--){if(r.size){let l=t[o].type.contentMatch.matchFragment(r);if(!l||!l.validEnd)throw new RangeError("Wrapper type given to Transform.wrap does not form valid content of its parent wrapper")}r=g.from(t[o].type.create(t[o].attrs,r))}let n=e.start,i=e.end;s.step(new M(n,i,n,i,new w(r,0,0),t.length,!0))}function ge(s,e,t,r,n){if(!r.isTextblock)throw new RangeError("Type given to setBlockType should be a textblock");let i=s.steps.length;s.doc.nodesBetween(e,t,(o,l)=>{let a=typeof n=="function"?n(o):n;if(o.isTextblock&&!o.hasMarkup(r,a)&&ye(s.doc,s.mapping.slice(i).map(l),r)){let h=null;if(r.schema.linebreakReplacement){let d=r.whitespace=="pre",u=!!r.contentMatch.matchType(r.schema.linebreakReplacement);d&&!u?h=!1:!d&&u&&(h=!0)}h===!1&&_(s,o,l,i),$(s,s.mapping.slice(i).map(l,1),r,void 0,h===null);let p=s.mapping.slice(i),c=p.map(l,1),f=p.map(l+o.nodeSize,1);return s.step(new M(c,f,c+1,f-1,new w(g.from(r.create(a,null,o.marks)),0,0),1,!0)),h===!0&&Z(s,o,l,i),!1}})}function Z(s,e,t,r){e.forEach((n,i)=>{if(n.isText){let o,l=/\r?\n|\r/g;for(;o=l.exec(n.text);){let a=s.mapping.slice(r).map(t+1+i+o.index);s.replaceWith(a,a+1,e.type.schema.linebreakReplacement.create())}}})}function _(s,e,t,r){e.forEach((n,i)=>{if(n.type==n.type.schema.linebreakReplacement){let o=s.mapping.slice(r).map(t+1+i);s.replaceWith(o,o+1,e.type.schema.text(`
+`))}})}function ye(s,e,t){let r=s.resolve(e),n=r.index();return r.parent.canReplaceWith(n,n+1,t)}function ke(s,e,t,r,n){let i=s.doc.nodeAt(e);if(!i)throw new RangeError("No node at given position");t||(t=i.type);let o=t.create(r,null,n||i.marks);if(i.isLeaf)return s.replaceWith(e,e+i.nodeSize,o);if(!t.validContent(i.content))throw new RangeError("Invalid content for node type "+t.name);s.step(new M(e,e+i.nodeSize,e+1,e+i.nodeSize-1,new w(g.from(o),0,0),1,!0))}function Je(s,e,t=1,r){let n=s.resolve(e),i=n.depth-t,o=r&&r[r.length-1]||n.parent;if(i<0||n.parent.type.spec.isolating||!n.parent.canReplace(n.index(),n.parent.childCount)||!o.type.validContent(n.parent.content.cutByIndex(n.index(),n.parent.childCount)))return!1;for(let h=n.depth-1,p=t-2;h>i;h--,p--){let c=n.node(h),f=n.index(h);if(c.type.spec.isolating)return!1;let d=c.content.cutByIndex(f,c.childCount),u=r&&r[p+1];u&&(d=d.replaceChild(0,u.type.create(u.attrs)));let m=r&&r[p]||c;if(!c.canReplace(f+1,c.childCount)||!m.type.validContent(d))return!1}let l=n.indexAfter(i),a=r&&r[0];return n.node(i).canReplaceWith(l,l,a?a.type:n.node(i+1).type)}function ve(s,e,t=1,r){let n=s.doc.resolve(e),i=g.empty,o=g.empty;for(let l=n.depth,a=n.depth-t,h=t-1;l>a;l--,h--){i=g.from(n.node(l).copy(i));let p=r&&r[h];o=g.from(p?p.type.create(p.attrs,o):n.node(l).copy(o))}s.step(new v(e,e,new w(i.append(o),t,t),!0))}function Ae(s,e){let t=s.resolve(e),r=t.index();return j(t.nodeBefore,t.nodeAfter)&&t.parent.canReplace(r,r+1)}function xe(s,e){e.content.size||s.type.compatibleContent(e.type);let t=s.contentMatchAt(s.childCount),{linebreakReplacement:r}=s.type.schema;for(let n=0;n<e.childCount;n++){let i=e.child(n),o=i.type==r?s.type.schema.nodes.text:i.type;if(t=t.matchType(o),!t||!s.type.allowsMarks(i.marks))return!1}return t.validEnd}function j(s,e){return!!(s&&e&&!s.isLeaf&&xe(s,e))}function Be(s,e,t=-1){let r=s.resolve(e);for(let n=r.depth;;n--){let i,o,l=r.index(n);if(n==r.depth?(i=r.nodeBefore,o=r.nodeAfter):t>0?(i=r.node(n+1),l++,o=r.node(n).maybeChild(l)):(i=r.node(n).maybeChild(l-1),o=r.node(n+1)),i&&!i.isTextblock&&j(i,o)&&r.node(n).canReplace(l,l+1))return e;if(n==0)break;e=t<0?r.before(n):r.after(n)}}function Se(s,e,t){let r=null,{linebreakReplacement:n}=s.doc.type.schema,i=s.doc.resolve(e-t),o=i.node().type;if(n&&o.inlineContent){let p=o.whitespace=="pre",c=!!o.contentMatch.matchType(n);p&&!c?r=!1:!p&&c&&(r=!0)}let l=s.steps.length;if(r===!1){let p=s.doc.resolve(e+t);_(s,p.node(),p.before(),l)}o.inlineContent&&$(s,e+t-1,o,i.node().contentMatchAt(i.index()),r==null);let a=s.mapping.slice(l),h=a.map(e-t);if(s.step(new v(h,a.map(e+t,-1),w.empty,!0)),r===!0){let p=s.doc.resolve(h);Z(s,p.node(),p.before(),s.steps.length)}return s}function be(s,e,t){let r=s.resolve(e);if(r.parent.canReplaceWith(r.index(),r.index(),t))return e;if(r.parentOffset==0)for(let n=r.depth-1;n>=0;n--){let i=r.index(n);if(r.node(n).canReplaceWith(i,i,t))return r.before(n+1);if(i>0)return null}if(r.parentOffset==r.parent.content.size)for(let n=r.depth-1;n>=0;n--){let i=r.indexAfter(n);if(r.node(n).canReplaceWith(i,i,t))return r.after(n+1);if(i<r.node(n).childCount)return null}return null}function We(s,e,t){let r=s.resolve(e);if(!t.content.size)return e;let n=t.content;for(let i=0;i<t.openStart;i++)n=n.firstChild.content;for(let i=1;i<=(t.openStart==0&&t.size?2:1);i++)for(let o=r.depth;o>=0;o--){let l=o==r.depth?0:r.pos<=(r.start(o+1)+r.end(o+1))/2?-1:1,a=r.index(o)+(l>0?1:0),h=r.node(o),p=!1;if(i==1)p=h.canReplace(a,a,n);else{let c=h.contentMatchAt(a).findWrapping(n.firstChild.type);p=c&&h.canReplaceWith(a,a,c[0])}if(p)return l==0?r.pos:l<0?r.before(o+1):r.after(o+1)}return null}function Me(s,e,t=e,r=w.empty){if(e==t&&!r.size)return null;let n=s.resolve(e),i=s.resolve(t);return ee(n,i,r)?new v(e,t,r):new Ce(n,i,r).fit()}function ee(s,e,t){return!t.openStart&&!t.openEnd&&s.start()==e.start()&&s.parent.canReplace(s.index(),e.index(),t.content)}class Ce{constructor(e,t,r){this.$from=e,this.$to=t,this.unplaced=r,this.frontier=[],this.placed=g.empty;for(let n=0;n<=e.depth;n++){let i=e.node(n);this.frontier.push({type:i.type,match:i.contentMatchAt(e.indexAfter(n))})}for(let n=e.depth;n>0;n--)this.placed=g.from(e.node(n).copy(this.placed))}get depth(){return this.frontier.length-1}fit(){for(;this.unplaced.size;){let h=this.findFittable();h?this.placeNodes(h):this.openMore()||this.dropNode()}let e=this.mustMoveInline(),t=this.placed.size-this.depth-this.$from.depth,r=this.$from,n=this.close(e<0?this.$to:r.doc.resolve(e));if(!n)return null;let i=this.placed,o=r.depth,l=n.depth;for(;o&&l&&i.childCount==1;)i=i.firstChild.content,o--,l--;let a=new w(i,o,l);return e>-1?new M(r.pos,e,this.$to.pos,this.$to.end(),a,t):a.size||r.pos!=this.$to.pos?new v(r.pos,n.pos,a):null}findFittable(){let e=this.unplaced.openStart;for(let t=this.unplaced.content,r=0,n=this.unplaced.openEnd;r<e;r++){let i=t.firstChild;if(t.childCount>1&&(n=0),i.type.spec.isolating&&n<=r){e=r;break}t=i.content}for(let t=1;t<=2;t++)for(let r=t==1?e:this.unplaced.openStart;r>=0;r--){let n,i=null;r?(i=W(this.unplaced.content,r-1).firstChild,n=i.content):n=this.unplaced.content;let o=n.firstChild;for(let l=this.depth;l>=0;l--){let{type:a,match:h}=this.frontier[l],p,c=null;if(t==1&&(o?h.matchType(o.type)||(c=h.fillBefore(g.from(o),!1)):i&&a.compatibleContent(i.type)))return{sliceDepth:r,frontierDepth:l,parent:i,inject:c};if(t==2&&o&&(p=h.findWrapping(o.type)))return{sliceDepth:r,frontierDepth:l,parent:i,wrap:p};if(i&&h.matchType(i.type))break}}}openMore(){let{content:e,openStart:t,openEnd:r}=this.unplaced,n=W(e,t);return!n.childCount||n.firstChild.isLeaf?!1:(this.unplaced=new w(e,t+1,Math.max(r,n.size+t>=e.size-r?t+1:0)),!0)}dropNode(){let{content:e,openStart:t,openEnd:r}=this.unplaced,n=W(e,t);if(n.childCount<=1&&t>0){let i=e.size-t<=t+n.size;this.unplaced=new w(O(e,t-1,1),t-1,i?t-1:r)}else this.unplaced=new w(O(e,t,1),t,r)}placeNodes({sliceDepth:e,frontierDepth:t,parent:r,inject:n,wrap:i}){for(;this.depth>t;)this.closeFrontierNode();if(i)for(let m=0;m<i.length;m++)this.openFrontierNode(i[m]);let o=this.unplaced,l=r?r.content:o.content,a=o.openStart-e,h=0,p=[],{match:c,type:f}=this.frontier[t];if(n){for(let m=0;m<n.childCount;m++)p.push(n.child(m));c=c.matchFragment(n)}let d=l.size+e-(o.content.size-o.openEnd);for(;h<l.childCount;){let m=l.child(h),x=c.matchType(m.type);if(!x)break;h++,(h>1||a==0||m.content.size)&&(c=x,p.push(te(m.mark(f.allowedMarks(m.marks)),h==1?a:0,h==l.childCount?d:-1)))}let u=h==l.childCount;u||(d=-1),this.placed=F(this.placed,t,g.from(p)),this.frontier[t].match=c,u&&d<0&&r&&r.type==this.frontier[this.depth].type&&this.frontier.length>1&&this.closeFrontierNode();for(let m=0,x=l;m<d;m++){let I=x.lastChild;this.frontier.push({type:I.type,match:I.contentMatchAt(I.childCount)}),x=I.content}this.unplaced=u?e==0?w.empty:new w(O(o.content,e-1,1),e-1,d<0?o.openEnd:e-1):new w(O(o.content,e,h),o.openStart,o.openEnd)}mustMoveInline(){if(!this.$to.parent.isTextblock)return-1;let e=this.frontier[this.depth],t;if(!e.type.isTextblock||!D(this.$to,this.$to.depth,e.type,e.match,!1)||this.$to.depth==this.depth&&(t=this.findCloseLevel(this.$to))&&t.depth==this.depth)return-1;let{depth:r}=this.$to,n=this.$to.after(r);for(;r>1&&n==this.$to.end(--r);)++n;return n}findCloseLevel(e){e:for(let t=Math.min(this.depth,e.depth);t>=0;t--){let{match:r,type:n}=this.frontier[t],i=t<e.depth&&e.end(t+1)==e.pos+(e.depth-(t+1)),o=D(e,t,n,r,i);if(o){for(let l=t-1;l>=0;l--){let{match:a,type:h}=this.frontier[l],p=D(e,l,h,a,!0);if(!p||p.childCount)continue e}return{depth:t,fit:o,move:i?e.doc.resolve(e.after(t+1)):e}}}}close(e){let t=this.findCloseLevel(e);if(!t)return null;for(;this.depth>t.depth;)this.closeFrontierNode();t.fit.childCount&&(this.placed=F(this.placed,t.depth,t.fit)),e=t.move;for(let r=t.depth+1;r<=e.depth;r++){let n=e.node(r),i=n.type.contentMatch.fillBefore(n.content,!0,e.index(r));this.openFrontierNode(n.type,n.attrs,i)}return e}openFrontierNode(e,t=null,r){let n=this.frontier[this.depth];n.match=n.match.matchType(e),this.placed=F(this.placed,this.depth,g.from(e.create(t,r))),this.frontier.push({type:e,match:e.contentMatch})}closeFrontierNode(){let t=this.frontier.pop().match.fillBefore(g.empty,!0);t.childCount&&(this.placed=F(this.placed,this.frontier.length,t))}}function O(s,e,t){return e==0?s.cutByIndex(t,s.childCount):s.replaceChild(0,s.firstChild.copy(O(s.firstChild.content,e-1,t)))}function F(s,e,t){return e==0?s.append(t):s.replaceChild(s.childCount-1,s.lastChild.copy(F(s.lastChild.content,e-1,t)))}function W(s,e){for(let t=0;t<e;t++)s=s.firstChild.content;return s}function te(s,e,t){if(e<=0)return s;let r=s.content;return e>1&&(r=r.replaceChild(0,te(r.firstChild,e-1,r.childCount==1?t-1:0))),e>0&&(r=s.type.contentMatch.fillBefore(r).append(r),t<=0&&(r=r.append(s.type.contentMatch.matchFragment(r).fillBefore(g.empty,!0)))),s.copy(r)}function D(s,e,t,r,n){let i=s.node(e),o=n?s.indexAfter(e):s.index(e);if(o==i.childCount&&!t.compatibleContent(i.type))return null;let l=r.fillBefore(i.content,!0,o);return l&&!Ne(t,i.content,o)?l:null}function Ne(s,e,t){for(let r=t;r<e.childCount;r++)if(!s.allowsMarks(e.child(r).marks))return!0;return!1}function Ie(s){return s.spec.defining||s.spec.definingForContent}function Re(s,e,t,r){if(!r.size)return s.deleteRange(e,t);let n=s.doc.resolve(e),i=s.doc.resolve(t);if(ee(n,i,r))return s.step(new v(e,t,r));let o=ne(n,s.doc.resolve(t));o[o.length-1]==0&&o.pop();let l=-(n.depth+1);o.unshift(l);for(let f=n.depth,d=n.pos-1;f>0;f--,d--){let u=n.node(f).type.spec;if(u.defining||u.definingAsContext||u.isolating)break;o.indexOf(f)>-1?l=f:n.before(f)==d&&o.splice(1,0,-f)}let a=o.indexOf(l),h=[],p=r.openStart;for(let f=r.content,d=0;;d++){let u=f.firstChild;if(h.push(u),d==r.openStart)break;f=u.content}for(let f=p-1;f>=0;f--){let d=h[f],u=Ie(d.type);if(u&&!d.sameMarkup(n.node(Math.abs(l)-1)))p=f;else if(u||!d.type.isTextblock)break}for(let f=r.openStart;f>=0;f--){let d=(f+p+1)%(r.openStart+1),u=h[d];if(u)for(let m=0;m<o.length;m++){let x=o[(m+a)%o.length],I=!0;x<0&&(I=!1,x=-x);let ie=n.node(x-1),G=n.index(x-1);if(ie.canReplaceWith(G,G,u.type,u.marks))return s.replace(n.before(x),I?i.after(x):t,new w(re(r.content,0,r.openStart,d),d,r.openEnd))}}let c=s.steps.length;for(let f=o.length-1;f>=0&&(s.replace(e,t,r),!(s.steps.length>c));f--){let d=o[f];d<0||(e=n.before(d),t=i.after(d))}}function re(s,e,t,r,n){if(e<t){let i=s.firstChild;s=s.replaceChild(0,i.copy(re(i.content,e+1,t,r,i)))}if(e>r){let i=n.contentMatchAt(0),o=i.fillBefore(s).append(s);s=o.append(i.matchFragment(o).fillBefore(g.empty,!0))}return s}function Ee(s,e,t,r){if(!r.isInline&&e==t&&s.doc.resolve(e).parent.content.size){let n=be(s.doc,e,r.type);n!=null&&(e=t=n)}s.replaceRange(e,t,new w(g.from(r),0,0))}function Te(s,e,t){let r=s.doc.resolve(e),n=s.doc.resolve(t),i=ne(r,n);for(let o=0;o<i.length;o++){let l=i[o],a=o==i.length-1;if(a&&l==0||r.node(l).type.contentMatch.validEnd)return s.delete(r.start(l),n.end(l));if(l>0&&(a||r.node(l-1).canReplace(r.index(l-1),n.indexAfter(l-1))))return s.delete(r.before(l),n.after(l))}for(let o=1;o<=r.depth&&o<=n.depth;o++)if(e-r.start(o)==r.depth-o&&t>r.end(o)&&n.end(o)-t!=n.depth-o&&r.start(o-1)==n.start(o-1)&&r.node(o-1).canReplace(r.index(o-1),n.index(o-1)))return s.delete(r.before(o),t);s.delete(e,t)}function ne(s,e){let t=[],r=Math.min(s.depth,e.depth);for(let n=r;n>=0;n--){let i=s.start(n);if(i<s.pos-(s.depth-n)||e.end(n)>e.pos+(e.depth-n)||s.node(n).type.spec.isolating||e.node(n).type.spec.isolating)break;(i==e.start(n)||n==s.depth&&n==e.depth&&s.parent.inlineContent&&e.parent.inlineContent&&n&&e.start(n-1)==i-1)&&t.push(n)}return t}class E extends k{constructor(e,t,r){super(),this.pos=e,this.attr=t,this.value=r}apply(e){let t=e.nodeAt(this.pos);if(!t)return y.fail("No node at attribute step's position");let r=Object.create(null);for(let i in t.attrs)r[i]=t.attrs[i];r[this.attr]=this.value;let n=t.type.create(r,null,t.marks);return y.fromReplace(e,this.pos,this.pos+1,new w(g.from(n),0,t.isLeaf?0:1))}getMap(){return S.empty}invert(e){return new E(this.pos,this.attr,e.nodeAt(this.pos).attrs[this.attr])}map(e){let t=e.mapResult(this.pos,1);return t.deletedAfter?null:new E(t.pos,this.attr,this.value)}toJSON(){return{stepType:"attr",pos:this.pos,attr:this.attr,value:this.value}}static fromJSON(e,t){if(typeof t.pos!="number"||typeof t.attr!="string")throw new RangeError("Invalid input for AttrStep.fromJSON");return new E(t.pos,t.attr,t.value)}}k.jsonID("attr",E);class z extends k{constructor(e,t){super(),this.attr=e,this.value=t}apply(e){let t=Object.create(null);for(let n in e.attrs)t[n]=e.attrs[n];t[this.attr]=this.value;let r=e.type.create(t,e.content,e.marks);return y.ok(r)}getMap(){return S.empty}invert(e){return new z(this.attr,e.attrs[this.attr])}map(e){return this}toJSON(){return{stepType:"docAttr",attr:this.attr,value:this.value}}static fromJSON(e,t){if(typeof t.attr!="string")throw new RangeError("Invalid input for DocAttrStep.fromJSON");return new z(t.attr,t.value)}}k.jsonID("docAttr",z);let T=class extends Error{};T=function s(e){let t=Error.call(this,e);return t.__proto__=s.prototype,t};T.prototype=Object.create(Error.prototype);T.prototype.constructor=T;T.prototype.name="TransformError";class De{constructor(e){this.doc=e,this.steps=[],this.docs=[],this.mapping=new A}get before(){return this.docs.length?this.docs[0]:this.doc}step(e){let t=this.maybeStep(e);if(t.failed)throw new T(t.failed);return this}maybeStep(e){let t=e.apply(this.doc);return t.failed||this.addStep(e,t.doc),t}get docChanged(){return this.steps.length>0}addStep(e,t){this.docs.push(this.doc),this.steps.push(e),this.mapping.appendMap(e.getMap()),this.doc=t}replace(e,t=e,r=w.empty){let n=Me(this.doc,e,t,r);return n&&this.step(n),this}replaceWith(e,t,r){return this.replace(e,t,new w(g.from(r),0,0))}delete(e,t){return this.replace(e,t,w.empty)}insert(e,t){return this.replaceWith(e,e,t)}replaceRange(e,t,r){return Re(this,e,t,r),this}replaceRangeWith(e,t,r){return Ee(this,e,t,r),this}deleteRange(e,t){return Te(this,e,t),this}lift(e,t){return de(this,e,t),this}join(e,t=1){return Se(this,e,t),this}wrap(e,t){return we(this,e,t),this}setBlockType(e,t=e,r,n=null){return ge(this,e,t,r,n),this}setNodeMarkup(e,t,r=null,n){return ke(this,e,t,r,n),this}setNodeAttribute(e,t,r){return this.step(new E(e,t,r)),this}setDocAttribute(e,t){return this.step(new z(e,t)),this}addNodeMark(e,t){return this.step(new N(e,t)),this}removeNodeMark(e,t){let r=this.doc.nodeAt(e);if(!r)throw new RangeError("No node at position "+e);if(t instanceof se)t.isInSet(r.marks)&&this.step(new R(e,t));else{let n=r.marks,i,o=[];for(;i=t.isInSet(n);)o.push(new R(e,i)),n=i.removeFromSet(n);for(let l=o.length-1;l>=0;l--)this.step(o[l])}return this}split(e,t=1,r){return ve(this,e,t,r),this}addMark(e,t,r){return pe(this,e,t,r),this}removeMark(e,t,r){return fe(this,e,t,r),this}clearIncompatible(e,t,r){return $(this,e,t,r),this}}export{C as AddMarkStep,N as AddNodeMarkStep,E as AttrStep,z as DocAttrStep,L as MapResult,A as Mapping,b as RemoveMarkStep,R as RemoveNodeMarkStep,M as ReplaceAroundStep,v as ReplaceStep,k as Step,S as StepMap,y as StepResult,De as Transform,T as TransformError,Ae as canJoin,Je as canSplit,We as dropPoint,ze as findWrapping,be as insertPoint,Be as joinPoint,Fe as liftTarget,Me as replaceStep};
+//# sourceMappingURL=index.js.map