@limetech/lime-elements 39.34.0 → 39.34.2

package/dist/esm/limel-prosemirror-adapter.entry.js

@@ -1,8 +1,8 @@
-import { r as registerInstance, c as createEvent, h, H as Host, a as getElement } from './index-DBTJNfo7.js';
+import { r as registerInstance, c as createEvent, h, H as Host, a as getElement } from './index-VCOjLfyP.js';
 import { E as EditorMenuTypes, L as LevelMapping, M as MouseButtons, e as editorMenuTypesArray } from './types-BWYo6dLf.js';
-import { g as getLinkAttributes, m as markdownToHTML, s as sanitizeHTML } from './markdown-parser-D7vLKElE.js';
+import { g as getLinkAttributes, m as markdownToHTML, s as sanitizeHTML } from './markdown-parser-Blt6ZFY0.js';
 import { h as cloneDeep } from './cloneDeep-CL7UD3mR.js';
-import { c as decodeHTML } from './index-t4DgGbWS.js';
+import { c as decodeHTML, e as decodeHTMLStrict } from './index-CbciMfiU.js';
 import { t as translate } from './translations-EPnIW0K5.js';
 import { c as createRandomString } from './random-string-JbKhhoXs.js';
 import { i as isItem } from './is-item-CrvUOVvg.js';
@@ -233,7 +233,7 @@ class Fragment {
     */
     constructor(
     /**
-    @internal
+    The child nodes in this fragment.
     */
     content, size) {
         this.content = content;
@@ -437,7 +437,7 @@ class Fragment {
     position in this fragment. The result object will be reused
     (overwritten) the next time the function is called. @internal
     */
-    findIndex(pos, round = -1) {
+    findIndex(pos) {
         if (pos == 0)
             return retIndex(0, pos);
         if (pos == this.size)
@@ -447,7 +447,7 @@ class Fragment {
         for (let i = 0, curPos = 0;; i++) {
             let cur = this.child(i), end = curPos + cur.nodeSize;
             if (end >= pos) {
-                if (end == pos || round > 0)
+                if (end == pos)
                     return retIndex(i + 1, end);
                 return retIndex(i, curPos);
             }
@@ -476,7 +476,7 @@ class Fragment {
             return Fragment.empty;
         if (!Array.isArray(value))
             throw new RangeError("Invalid input for Fragment.fromJSON");
-        return new Fragment(value.map(schema.nodeFromJSON));
+        return Fragment.fromArray(value.map(schema.nodeFromJSON));
     }
     /**
     Build a fragment from an array of nodes. Ensures that adjacent
@@ -710,17 +710,6 @@ given an invalid replacement.
 */
 class ReplaceError extends Error {
 }
-/*
-ReplaceError = function(this: any, message: string) {
-  let err = Error.call(this, message)
-  ;(err as any).__proto__ = ReplaceError.prototype
-  return err
-} as any
-
-ReplaceError.prototype = Object.create(Error.prototype)
-ReplaceError.prototype.constructor = ReplaceError
-ReplaceError.prototype.name = "ReplaceError"
-*/
 /**
 A slice represents a piece cut out of a larger document. It
 stores not only a fragment, but also the depth up to which nodes on
@@ -766,7 +755,7 @@ class Slice {
     @internal
     */
     insertAt(pos, fragment) {
-        let content = insertInto(this.content, pos + this.openStart, fragment);
+        let content = insertInto(this.content, pos + this.openStart, fragment, this.openStart + 1, this.openEnd + 1);
         return content && new Slice(content, this.openStart, this.openEnd);
     }
     /**
@@ -840,12 +829,14 @@ function removeRange(content, from, to) {
         throw new RangeError("Removing non-flat range");
     return content.replaceChild(index, child.copy(removeRange(child.content, from - offset - 1, to - offset - 1)));
 }
-function insertInto(content, dist, insert, parent) {
+function insertInto(content, dist, insert, openStart, openEnd, parent) {
     let { index, offset } = content.findIndex(dist), child = content.maybeChild(index);
     if (offset == dist || child.isText) {
+        if (parent && openStart <= 0 && openEnd <= 0 && !parent.canReplace(index, index, insert))
+            return null;
         return content.cut(0, dist).append(insert).append(content.cut(dist));
     }
-    let inner = insertInto(child.content, dist - offset - 1, insert);
+    let inner = insertInto(child.content, dist - offset - 1, insert, index == 0 ? openStart - 1 : 0, index == content.childCount - 1 ? openEnd - 1 : 0, child);
     return inner && content.replaceChild(index, child.copy(inner));
 }
 function replace$1($from, $to, slice) {
@@ -1315,7 +1306,7 @@ structure between the old and new data as much as possible, which a
 tree shape like this (without back pointers) makes easy.
 
 **Do not** directly mutate the properties of a `Node` object. See
-[the guide](/docs/guide/#doc) for more information.
+[the guide](https://prosemirror.net/docs/guide/#doc) for more information.
 */
 class Node {
     /**
@@ -1345,8 +1336,12 @@ class Node {
         this.content = content || Fragment.empty;
     }
     /**
+    The array of this node's child nodes.
+    */
+    get children() { return this.content.content; }
+    /**
     The size of this node, as defined by the integer-based [indexing
-    scheme](/docs/guide/#doc.indexing). For text nodes, this is the
+    scheme](https://prosemirror.net/docs/guide/#doc.indexing). For text nodes, this is the
     amount of characters. For other leaf nodes, it is one. For
     non-leaf nodes, it is the size of the content plus two (the
     start and end token).
@@ -1371,10 +1366,11 @@ class Node {
     */
     forEach(f) { this.content.forEach(f); }
     /**
-    Invoke a callback for all descendant nodes recursively between
+    Invoke a callback for all descendant nodes recursively overlapping
     the given two positions that are relative to start of this
-    node's content. The callback is invoked with the node, its
-    position relative to the original node (method receiver),
+    node's content. This includes all ancestors of the nodes
+    containing the two positions. The callback is invoked with the
+    node, its position relative to the original node (method receiver),
     its parent node, and its child index. When the callback returns
     false for a given node, that node's children will not be
     recursed over. The last parameter can be used to specify a
@@ -1404,7 +1400,7 @@ class Node {
     `blockSeparator` is given, it will be inserted to separate text
     from different block nodes. If `leafText` is given, it'll be
     inserted for every non-text leaf node encountered, otherwise
-    [`leafText`](https://prosemirror.net/docs/ref/#model.NodeSpec^leafText) will be used.
+    [`leafText`](https://prosemirror.net/docs/ref/#model.NodeSpec.leafText) will be used.
     */
     textBetween(from, to, blockSeparator, leafText) {
         return this.content.textBetween(from, to, blockSeparator, leafText);
@@ -2011,7 +2007,7 @@ function resolveName(stream, name) {
     let result = [];
     for (let typeName in types) {
         let type = types[typeName];
-        if (type.groups.indexOf(name) > -1)
+        if (type.isInGroup(name))
             result.push(type);
     }
     if (result.length == 0)
@@ -2040,16 +2036,14 @@ function parseExprAtom(stream) {
         stream.err("Unexpected token '" + stream.next + "'");
     }
 }
-/**
-Construct an NFA from an expression as returned by the parser. The
-NFA is represented as an array of states, which are themselves
-arrays of edges, which are `{term, to}` objects. The first state is
-the entry state and the last node is the success state.
-
-Note that unlike typical NFAs, the edge ordering in this one is
-significant, in that it is used to contruct filler content when
-necessary.
-*/
+// Construct an NFA from an expression as returned by the parser. The
+// NFA is represented as an array of states, which are themselves
+// arrays of edges, which are `{term, to}` objects. The first state is
+// the entry state and the last node is the success state.
+//
+// Note that unlike typical NFAs, the edge ordering in this one is
+// significant, in that it is used to contruct filler content when
+// necessary.
 function nfa(expr) {
     let nfa = [[]];
     connect(compile(expr, 0), node());
@@ -2290,6 +2284,13 @@ let NodeType$1 = class NodeType {
     */
     get isAtom() { return this.isLeaf || !!this.spec.atom; }
     /**
+    Return true when this node type is part of the given
+    [group](https://prosemirror.net/docs/ref/#model.NodeSpec.group).
+    */
+    isInGroup(group) {
+        return this.groups.indexOf(group) > -1;
+    }
+    /**
     The node type's [whitespace](https://prosemirror.net/docs/ref/#model.NodeSpec.whitespace) option.
     */
     get whitespace() {
@@ -2609,8 +2610,8 @@ class Schema {
             let type = this.marks[prop], excl = type.spec.excludes;
             type.excluded = excl == null ? [type] : excl == "" ? [] : gatherMarks(this, excl.split(" "));
         }
-        this.nodeFromJSON = this.nodeFromJSON.bind(this);
-        this.markFromJSON = this.markFromJSON.bind(this);
+        this.nodeFromJSON = json => Node.fromJSON(this, json);
+        this.markFromJSON = json => Mark.fromJSON(this, json);
         this.topNodeType = this.nodes[this.spec.topNode || "doc"];
         this.cached.wrappings = Object.create(null);
     }
@@ -2646,20 +2647,6 @@ class Schema {
         return type.create(attrs);
     }
     /**
-    Deserialize a node from its JSON representation. This method is
-    bound.
-    */
-    nodeFromJSON(json) {
-        return Node.fromJSON(this, json);
-    }
-    /**
-    Deserialize a mark from its JSON representation. This method is
-    bound.
-    */
-    markFromJSON(json) {
-        return Mark.fromJSON(this, json);
-    }
-    /**
     @internal
     */
     nodeType(name) {
@@ -2841,7 +2828,7 @@ class DOMParser {
     /**
     Construct a DOM parser using the parsing rules listed in a
     schema's [node specs](https://prosemirror.net/docs/ref/#model.NodeSpec.parseDOM), reordered by
-    [priority](https://prosemirror.net/docs/ref/#model.ParseRule.priority).
+    [priority](https://prosemirror.net/docs/ref/#model.GenericParseRule.priority).
     */
     static fromSchema(schema) {
         return schema.cached.domParser ||
@@ -2934,6 +2921,7 @@ class ParseContext {
         this.options = options;
         this.isOpen = isOpen;
         this.open = 0;
+        this.localPreserveWS = false;
         let topNode = options.topNode, topContext;
         let topOptions = wsOptionsFor(null, options.preserveWhitespace, 0) | (isOpen ? OPT_OPEN_LEFT : 0);
         if (topNode)
@@ -2960,11 +2948,13 @@ class ParseContext {
     }
     addTextNode(dom, marks) {
         let value = dom.nodeValue;
-        let top = this.top;
-        if (top.options & OPT_PRESERVE_WS_FULL ||
+        let top = this.top, preserveWS = (top.options & OPT_PRESERVE_WS_FULL) ? "full"
+            : this.localPreserveWS || (top.options & OPT_PRESERVE_WS) > 0;
+        let { schema } = this.parser;
+        if (preserveWS === "full" ||
             top.inlineContext(dom) ||
             /[^ \t\r\n\u000c]/.test(value)) {
-            if (!(top.options & OPT_PRESERVE_WS)) {
+            if (!preserveWS) {
                 value = value.replace(/[ \t\r\n\u000c]+/g, " ");
                 // If this starts with whitespace, and there is no node before it, or
                 // a hard break, or a text node that ends with whitespace, strip the
@@ -2978,14 +2968,24 @@ class ParseContext {
                         value = value.slice(1);
                 }
             }
-            else if (!(top.options & OPT_PRESERVE_WS_FULL)) {
-                value = value.replace(/\r?\n|\r/g, " ");
+            else if (preserveWS === "full") {
+                value = value.replace(/\r\n?/g, "\n");
+            }
+            else if (schema.linebreakReplacement && /[\r\n]/.test(value) && this.top.findWrapping(schema.linebreakReplacement.create())) {
+                let lines = value.split(/\r?\n|\r/);
+                for (let i = 0; i < lines.length; i++) {
+                    if (i)
+                        this.insertNode(schema.linebreakReplacement.create(), marks, true);
+                    if (lines[i])
+                        this.insertNode(schema.text(lines[i]), marks, !/\S/.test(lines[i]));
+                }
+                value = "";
             }
             else {
-                value = value.replace(/\r\n?/g, "\n");
+                value = value.replace(/\r?\n|\r/g, " ");
             }
             if (value)
-                this.insertNode(this.parser.schema.text(value), marks);
+                this.insertNode(schema.text(value), marks, !/\S/.test(value));
             this.findInText(dom);
         }
         else {
@@ -2995,12 +2995,15 @@ class ParseContext {
     // Try to find a handler for the given tag and use that to parse. If
     // none is found, the element's content nodes are added directly.
     addElement(dom, marks, matchAfter) {
+        let outerWS = this.localPreserveWS, top = this.top;
+        if (dom.tagName == "PRE" || /pre/.test(dom.style && dom.style.whiteSpace))
+            this.localPreserveWS = true;
         let name = dom.nodeName.toLowerCase(), ruleID;
         if (listTags.hasOwnProperty(name) && this.parser.normalizeLists)
             normalizeList(dom);
         let rule = (this.options.ruleFromNode && this.options.ruleFromNode(dom)) ||
             (ruleID = this.parser.matchTag(dom, this, matchAfter));
-        if (rule ? rule.ignore : ignoreTags.hasOwnProperty(name)) {
+        out: if (rule ? rule.ignore : ignoreTags.hasOwnProperty(name)) {
             this.findInside(dom);
             this.ignoreFallback(dom, marks);
         }
@@ -3009,7 +3012,7 @@ class ParseContext {
                 this.open = Math.max(0, this.open - 1);
             else if (rule && rule.skip.nodeType)
                 dom = rule.skip;
-            let sync, top = this.top, oldNeedsBlock = this.needsBlock;
+            let sync, oldNeedsBlock = this.needsBlock;
             if (blockTags.hasOwnProperty(name)) {
                 if (top.content.length && top.content[0].isInline && this.open) {
                     this.open--;
@@ -3021,7 +3024,7 @@ class ParseContext {
             }
             else if (!dom.firstChild) {
                 this.leafFallback(dom, marks);
-                return;
+                break out;
             }
             let innerMarks = rule && rule.skip ? marks : this.readStyles(dom, marks);
             if (innerMarks)
@@ -3035,6 +3038,7 @@ class ParseContext {
             if (innerMarks)
                 this.addElementByRule(dom, rule, innerMarks, rule.consuming === false ? ruleID : undefined);
         }
+        this.localPreserveWS = outerWS;
     }
     // Called for leaf DOM nodes that would otherwise be ignored
     leafFallback(dom, marks) {
@@ -3045,7 +3049,7 @@ class ParseContext {
     ignoreFallback(dom, marks) {
         // Ignored BR nodes should at least create an inline context
         if (dom.nodeName == "BR" && (!this.top.type || !this.top.type.inlineContent))
-            this.findPlace(this.parser.schema.text("-"), marks);
+            this.findPlace(this.parser.schema.text("-"), marks, true);
     }
     // Run any style parser associated with the node's styles. Either
     // return an updated array of marks, or null to indicate some of the
@@ -3093,7 +3097,7 @@ class ParseContext {
                     marks = inner;
                 }
             }
-            else if (!this.insertNode(nodeType.create(rule.attrs), marks)) {
+            else if (!this.insertNode(nodeType.create(rule.attrs), marks, dom.nodeName == "BR")) {
                 this.leafFallback(dom, marks);
             }
         }
@@ -3110,7 +3114,7 @@ class ParseContext {
         }
         else if (rule.getContent) {
             this.findInside(dom);
-            rule.getContent(dom, this.parser.schema).forEach(node => this.insertNode(node, marks));
+            rule.getContent(dom, this.parser.schema).forEach(node => this.insertNode(node, marks, false));
         }
         else {
             let contentDOM = dom;
@@ -3122,6 +3126,7 @@ class ParseContext {
                 contentDOM = rule.contentElement;
             this.findAround(dom, contentDOM, true);
             this.addAll(contentDOM, marks);
+            this.findAround(dom, contentDOM, false);
         }
         if (sync && this.sync(startIn))
             this.open--;
@@ -3140,19 +3145,22 @@ class ParseContext {
     // Try to find a way to fit the given node type into the current
     // context. May add intermediate wrappers and/or leave non-solid
     // nodes that we're in.
-    findPlace(node, marks) {
+    findPlace(node, marks, cautious) {
         let route, sync;
-        for (let depth = this.open; depth >= 0; depth--) {
+        for (let depth = this.open, penalty = 0; depth >= 0; depth--) {
             let cx = this.nodes[depth];
             let found = cx.findWrapping(node);
-            if (found && (!route || route.length > found.length)) {
+            if (found && (!route || route.length > found.length + penalty)) {
                 route = found;
                 sync = cx;
                 if (!found.length)
                     break;
             }
-            if (cx.solid)
-                break;
+            if (cx.solid) {
+                if (cautious)
+                    break;
+                penalty += 2;
+            }
         }
         if (!route)
             return null;
@@ -3162,13 +3170,13 @@ class ParseContext {
         return marks;
     }
     // Try to insert the given node, adjusting the context when needed.
-    insertNode(node, marks) {
+    insertNode(node, marks, cautious) {
         if (node.isInline && this.needsBlock && !this.top.type) {
             let block = this.textblockFromContext();
             if (block)
                 marks = this.enterInner(block, null, marks);
         }
-        let innerMarks = this.findPlace(node, marks);
+        let innerMarks = this.findPlace(node, marks, cautious);
         if (innerMarks) {
             this.closeExtra();
             let top = this.top;
@@ -3186,7 +3194,7 @@ class ParseContext {
     // Try to start a node of the given type, adjusting the context when
     // necessary.
     enter(type, attrs, marks, preserveWS) {
-        let innerMarks = this.findPlace(type.create(attrs), marks);
+        let innerMarks = this.findPlace(type.create(attrs), marks, false);
         if (innerMarks)
             innerMarks = this.enterInner(type, attrs, marks, true, preserveWS);
         return innerMarks;
@@ -3224,14 +3232,18 @@ class ParseContext {
     finish() {
         this.open = 0;
         this.closeExtra(this.isOpen);
-        return this.nodes[0].finish(this.isOpen || this.options.topOpen);
+        return this.nodes[0].finish(!!(this.isOpen || this.options.topOpen));
     }
     sync(to) {
-        for (let i = this.open; i >= 0; i--)
+        for (let i = this.open; i >= 0; i--) {
             if (this.nodes[i] == to) {
                 this.open = i;
                 return true;
             }
+            else if (this.localPreserveWS) {
+                this.nodes[i].options |= OPT_PRESERVE_WS;
+            }
+        }
         return false;
     }
     get currentPos() {
@@ -3300,7 +3312,7 @@ class ParseContext {
                     let next = depth > 0 || (depth == 0 && useRoot) ? this.nodes[depth].type
                         : option && depth >= minDepth ? option.node(depth - minDepth).type
                             : null;
-                    if (!next || (next.name != part && next.groups.indexOf(part) == -1))
+                    if (!next || (next.name != part && !next.isInGroup(part)))
                         return false;
                     depth--;
                 }
@@ -3446,6 +3458,8 @@ class DOMSerializer {
     @internal
     */
     serializeNodeInner(node, options) {
+        if (node.isText)
+            return doc$1(options).createTextNode(node.text);
         let { dom, contentDOM } = renderSpec(doc$1(options), this.nodes[node.type.name](node), null, node.attrs);
         if (contentDOM) {
             if (node.isLeaf)
@@ -3480,6 +3494,9 @@ class DOMSerializer {
         return toDOM && renderSpec(doc$1(options), toDOM(mark, inline), null, mark.attrs);
     }
     static renderSpec(doc, structure, xmlNS = null, blockArraysIn) {
+        // Kludge for backwards-compatibility with accidental original behavious
+        if (typeof structure == "string")
+            return { dom: doc.createTextNode(structure) };
         return renderSpec(doc, structure, xmlNS, blockArraysIn);
     }
     /**
@@ -3551,11 +3568,9 @@ function suspiciousAttributesInner(attrs) {
     return result;
 }
 function renderSpec(doc, structure, xmlNS, blockArraysIn) {
-    if (typeof structure == "string")
-        return { dom: doc.createTextNode(structure) };
-    if (structure.nodeType != null)
+    if (structure.nodeType == 1)
         return { dom: structure };
-    if (structure.dom && structure.dom.nodeType != null)
+    if (structure.dom && structure.dom.nodeType == 1)
         return structure;
     let tagName = structure[0], suspicious;
     if (typeof tagName != "string")
@@ -3578,6 +3593,8 @@ function renderSpec(doc, structure, xmlNS, blockArraysIn) {
                 let space = name.indexOf(" ");
                 if (space > 0)
                     dom.setAttributeNS(name.slice(0, space), name.slice(space + 1), attrs[name]);
+                else if (name == "style" && dom.style)
+                    dom.style.cssText = attrs[name];
                 else
                     dom.setAttribute(name, attrs[name]);
             }
@@ -3589,6 +3606,9 @@ function renderSpec(doc, structure, xmlNS, blockArraysIn) {
                 throw new RangeError("Content hole must be the only child of its parent node");
             return { dom, contentDOM: dom };
         }
+        else if (typeof child == "string") {
+            dom.appendChild(doc.createTextNode(child));
+        }
         else {
             let { dom: inner, contentDOM: innerContent } = renderSpec(doc, child, xmlNS, blockArraysIn);
             dom.appendChild(inner);
@@ -3787,18 +3807,14 @@ A mapping represents a pipeline of zero or more [step
 maps](https://prosemirror.net/docs/ref/#transform.StepMap). It has special provisions for losslessly
 handling mapping positions through a series of steps in which some
 steps are inverted versions of earlier steps. (This comes up when
-‘[rebasing](/docs/guide/#transform.rebasing)’ steps for
+‘[rebasing](https://prosemirror.net/docs/guide/#transform.rebasing)’ steps for
 collaboration or history management.)
 */
 class Mapping {
     /**
     Create a new mapping with the given position maps.
     */
-    constructor(
-    /**
-    The step maps in this mapping.
-    */
-    maps = [], 
+    constructor(maps, 
     /**
     @internal
     */
@@ -3811,23 +3827,22 @@ class Mapping {
     /**
     The end position in the `maps` array.
     */
-    to = maps.length) {
-        this.maps = maps;
+    to = maps ? maps.length : 0) {
         this.mirror = mirror;
         this.from = from;
         this.to = to;
+        this._maps = maps || [];
+        this.ownData = !(maps || mirror);
     }
     /**
-    Create a mapping that maps only through a part of this one.
+    The step maps in this mapping.
     */
-    slice(from = 0, to = this.maps.length) {
-        return new Mapping(this.maps, this.mirror, from, to);
-    }
+    get maps() { return this._maps; }
     /**
-    @internal
+    Create a mapping that maps only through a part of this one.
     */
-    copy() {
-        return new Mapping(this.maps.slice(), this.mirror && this.mirror.slice(), this.from, this.to);
+    slice(from = 0, to = this.maps.length) {
+        return new Mapping(this._maps, this.mirror, from, to);
     }
     /**
     Add a step map to the end of this mapping. If `mirrors` is
@@ -3835,18 +3850,23 @@ class Mapping {
     image of this one.
     */
     appendMap(map, mirrors) {
-        this.to = this.maps.push(map);
+        if (!this.ownData) {
+            this._maps = this._maps.slice();
+            this.mirror = this.mirror && this.mirror.slice();
+            this.ownData = true;
+        }
+        this.to = this._maps.push(map);
         if (mirrors != null)
-            this.setMirror(this.maps.length - 1, mirrors);
+            this.setMirror(this._maps.length - 1, mirrors);
     }
     /**
     Add all the step maps in a given mapping to this one (preserving
     mirroring information).
     */
     appendMapping(mapping) {
-        for (let i = 0, startSize = this.maps.length; i < mapping.maps.length; i++) {
+        for (let i = 0, startSize = this._maps.length; i < mapping._maps.length; i++) {
             let mirr = mapping.getMirror(i);
-            this.appendMap(mapping.maps[i], mirr != null && mirr < i ? startSize + mirr : undefined);
+            this.appendMap(mapping._maps[i], mirr != null && mirr < i ? startSize + mirr : undefined);
         }
     }
     /**
@@ -3872,9 +3892,9 @@ class Mapping {
     Append the inverse of the given mapping to this one.
     */
     appendMappingInverted(mapping) {
-        for (let i = mapping.maps.length - 1, totalSize = this.maps.length + mapping.maps.length; i >= 0; i--) {
+        for (let i = mapping.maps.length - 1, totalSize = this._maps.length + mapping._maps.length; i >= 0; i--) {
             let mirr = mapping.getMirror(i);
-            this.appendMap(mapping.maps[i].invert(), mirr != null && mirr > i ? totalSize - mirr - 1 : undefined);
+            this.appendMap(mapping._maps[i].invert(), mirr != null && mirr > i ? totalSize - mirr - 1 : undefined);
         }
     }
     /**
@@ -3892,7 +3912,7 @@ class Mapping {
         if (this.mirror)
             return this._map(pos, assoc, true);
         for (let i = this.from; i < this.to; i++)
-            pos = this.maps[i].map(pos, assoc);
+            pos = this._maps[i].map(pos, assoc);
         return pos;
     }
     /**
@@ -3906,12 +3926,12 @@ class Mapping {
     _map(pos, assoc, simple) {
         let delInfo = 0;
         for (let i = this.from; i < this.to; i++) {
-            let map = this.maps[i], result = map.mapResult(pos, assoc);
+            let map = this._maps[i], result = map.mapResult(pos, assoc);
             if (result.recover != null) {
                 let corr = this.getMirror(i);
                 if (corr != null && corr > i && corr < this.to) {
                     i = corr;
-                    pos = this.maps[corr].recover(result.recover);
+                    pos = this._maps[corr].recover(result.recover);
                     continue;
                 }
             }
@@ -4313,10 +4333,11 @@ class ReplaceStep extends Step {
         return new ReplaceStep(this.from, this.from + this.slice.size, doc.slice(this.from, this.to));
     }
     map(mapping) {
-        let from = mapping.mapResult(this.from, 1), to = mapping.mapResult(this.to, -1);
+        let to = mapping.mapResult(this.to, -1);
+        let from = this.from == this.to && ReplaceStep.MAP_BIAS < 0 ? to : mapping.mapResult(this.from, 1);
         if (from.deletedAcross && to.deletedAcross)
             return null;
-        return new ReplaceStep(from.pos, Math.max(from.pos, to.pos), this.slice);
+        return new ReplaceStep(from.pos, Math.max(from.pos, to.pos), this.slice, this.structure);
     }
     merge(other) {
         if (!(other instanceof ReplaceStep) || other.structure || this.structure)
@@ -4352,6 +4373,15 @@ class ReplaceStep extends Step {
         return new ReplaceStep(json.from, json.to, Slice.fromJSON(schema, json.slice), !!json.structure);
     }
 }
+/**
+By default, for backwards compatibility, an inserting step
+mapped over an insertion at that same position fill move after
+the inserted content. In a collaborative editing situation, that
+can make redone insertions appear in unexpected places. You can
+set this to -1 to make such mapping keep the step before the
+insertion instead.
+*/
+ReplaceStep.MAP_BIAS = 1;
 Step.jsonID("replace", ReplaceStep);
 /**
 Replace a part of the document with a slice of content, but
@@ -4584,13 +4614,17 @@ can be lifted. Will not go across
 function liftTarget(range) {
     let parent = range.parent;
     let content = parent.content.cutByIndex(range.startIndex, range.endIndex);
-    for (let depth = range.depth;; --depth) {
+    for (let depth = range.depth, contentBefore = 0, contentAfter = 0;; --depth) {
         let node = range.$from.node(depth);
-        let index = range.$from.index(depth), endIndex = range.$to.indexAfter(depth);
+        let index = range.$from.index(depth) + contentBefore, endIndex = range.$to.indexAfter(depth) - contentAfter;
         if (depth < range.depth && node.canReplace(index, endIndex, content))
             return depth;
         if (depth == 0 || node.type.spec.isolating || !canCut(node, index, endIndex))
             break;
+        if (index)
+            contentBefore = 1;
+        if (endIndex < node.childCount)
+            contentAfter = 1;
     }
     return null;
 }
@@ -5241,7 +5275,7 @@ function replaceRange(tr, from, to, slice) {
     let $from = tr.doc.resolve(from), $to = tr.doc.resolve(to);
     if (fitsTrivially($from, $to, slice))
         return tr.step(new ReplaceStep(from, to, slice));
-    let targetDepths = coveredDepths($from, tr.doc.resolve(to));
+    let targetDepths = coveredDepths($from, $to);
     // Can't replace the whole document, so remove 0 if it's present
     if (targetDepths[targetDepths.length - 1] == 0)
         targetDepths.pop();
@@ -5334,6 +5368,26 @@ function replaceRangeWith(tr, from, to, node) {
 }
 function deleteRange(tr, from, to) {
     let $from = tr.doc.resolve(from), $to = tr.doc.resolve(to);
+    // When the deleted range spans from the start of one textblock to
+    // the start of another one, move out of the start of both blocks.
+    if ($from.parent.isTextblock && $to.parent.isTextblock && $from.start() != $to.start() &&
+        $from.parentOffset == 0 && $to.parentOffset == 0) {
+        let shared = $from.sharedDepth(to), isolated = false;
+        for (let d = $from.depth; d > shared; d--)
+            if ($from.node(d).type.spec.isolating)
+                isolated = true;
+        for (let d = $to.depth; d > shared; d--)
+            if ($to.node(d).type.spec.isolating)
+                isolated = true;
+        if (!isolated) {
+            for (let d = $from.depth; d > 0 && from == $from.start(d); d--)
+                from = $from.before(d);
+            for (let d = $to.depth; d > 0 && to == $to.start(d); d--)
+                to = $to.before(d);
+            $from = tr.doc.resolve(from);
+            $to = tr.doc.resolve(to);
+        }
+    }
     let covered = coveredDepths($from, $to);
     for (let i = 0; i < covered.length; i++) {
         let depth = covered[i], last = i == covered.length - 1;
@@ -5544,6 +5598,27 @@ class Transform {
         return this.steps.length > 0;
     }
     /**
+    Return a single range, in post-transform document positions,
+    that covers all content changed by this transform. Returns null
+    if no replacements are made. Note that this will ignore changes
+    that add/remove marks without replacing the underlying content.
+    */
+    changedRange() {
+        let from = 1e9, to = -1e9;
+        for (let i = 0; i < this.mapping.maps.length; i++) {
+            let map = this.mapping.maps[i];
+            if (i) {
+                from = map.map(from, 1);
+                to = map.map(to, -1);
+            }
+            map.forEach((_f, _t, fromB, toB) => {
+                from = Math.min(from, fromB);
+                to = Math.max(to, toB);
+            });
+        }
+        return from == 1e9 ? null : { from, to };
+    }
+    /**
     @internal
     */
     addStep(step, doc) {
@@ -5693,19 +5768,26 @@ class Transform {
         return this;
     }
     /**
-    Remove a mark (or a mark of the given type) from the node at
+    Remove a mark (or all marks of the given type) from the node at
     position `pos`.
     */
     removeNodeMark(pos, mark) {
-        if (!(mark instanceof Mark)) {
-            let node = this.doc.nodeAt(pos);
-            if (!node)
-                throw new RangeError("No node at position " + pos);
-            mark = mark.isInSet(node.marks);
-            if (!mark)
-                return this;
+        let node = this.doc.nodeAt(pos);
+        if (!node)
+            throw new RangeError("No node at position " + pos);
+        if (mark instanceof Mark) {
+            if (mark.isInSet(node.marks))
+                this.step(new RemoveNodeMarkStep(pos, mark));
+        }
+        else {
+            let set = node.marks, found, steps = [];
+            while (found = mark.isInSet(set)) {
+                steps.push(new RemoveNodeMarkStep(pos, found));
+                set = found.removeFromSet(set);
+            }
+            for (let i = steps.length - 1; i >= 0; i--)
+                this.step(steps[i]);
         }
-        this.step(new RemoveNodeMarkStep(pos, mark));
         return this;
     }
     /**
@@ -5713,7 +5795,7 @@ class Transform {
     greater than one, any number of nodes above that. By default, the
     parts split off will inherit the node type of the original node.
     This can be changed by passing an array of types and attributes to
-    use after the split.
+    use after the split (with the outermost nodes coming first).
     */
     split(pos, depth = 1, typesAfter) {
         split(this, pos, depth, typesAfter);
@@ -6381,7 +6463,6 @@ class Transaction extends Transform {
         else {
             if (to == null)
                 to = from;
-            to = to == null ? from : to;
             if (!text)
                 return this.deleteRange(from, to);
             let marks = this.storedMarks;
@@ -6390,7 +6471,7 @@ class Transaction extends Transform {
                 marks = to == from ? $from.marks() : $from.marksAcross(this.doc.resolve(to));
             }
             this.replaceRangeWith(from, to, schema.text(text, marks));
-            if (!this.selection.empty)
+            if (!this.selection.empty && this.selection.to == from + text.length)
                 this.setSelection(Selection.near(this.selection.$to));
             return this;
         }
@@ -6586,7 +6667,7 @@ class EditorState {
         return newInstance;
     }
     /**
-    Start a [transaction](https://prosemirror.net/docs/ref/#state.Transaction) from this state.
+    Accessor that constructs and returns a new [transaction](https://prosemirror.net/docs/ref/#state.Transaction) from this state.
     */
     get tr() { return new Transaction(this); }
     /**
@@ -6780,6 +6861,7 @@ const isEquivalentPosition = function (node, off, targetNode, targetOff) {
 };
 const atomElements = /^(img|br|input|textarea|hr)$/i;
 function scanFor(node, off, targetNode, targetOff, dir) {
+    var _a;
     for (;;) {
         if (node == targetNode && off == targetOff)
             return true;
@@ -6792,10 +6874,17 @@ function scanFor(node, off, targetNode, targetOff, dir) {
             node = parent;
         }
         else if (node.nodeType == 1) {
-            node = node.childNodes[off + (dir < 0 ? -1 : 0)];
-            if (node.contentEditable == "false")
-                return false;
-            off = dir < 0 ? nodeSize(node) : 0;
+            let child = node.childNodes[off + (dir < 0 ? -1 : 0)];
+            if (child.nodeType == 1 && child.contentEditable == "false") {
+                if ((_a = child.pmViewDesc) === null || _a === void 0 ? void 0 : _a.ignoreForSelection)
+                    off += dir;
+                else
+                    return false;
+            }
+            else {
+                node = child;
+                off = dir < 0 ? nodeSize(node) : 0;
+            }
         }
         else {
             return false;
@@ -6915,7 +7004,7 @@ const safari = !ie$1 && !!nav && /Apple Computer/.test(nav.vendor);
 // Is true for both iOS and iPadOS for convenience
 const ios = safari && (/Mobile\/\w+/.test(agent) || !!nav && nav.maxTouchPoints > 2);
 const mac$4 = ios || (nav ? /Mac/.test(nav.platform) : false);
-const windows = nav ? /Win/.test(nav.platform) : false;
+const windows$1 = nav ? /Win/.test(nav.platform) : false;
 const android = /Android \d/.test(agent);
 const webkit = !!doc && "webkitFontSmoothing" in doc.documentElement.style;
 const webkit_version = webkit ? +(/\bAppleWebKit\/(\d+)/.exec(navigator.userAgent) || [0, 0])[1] : 0;
@@ -6945,11 +7034,13 @@ function clientRect(node) {
 function scrollRectIntoView(view, rect, startDOM) {
     let scrollThreshold = view.someProp("scrollThreshold") || 0, scrollMargin = view.someProp("scrollMargin") || 5;
     let doc = view.dom.ownerDocument;
-    for (let parent = startDOM || view.dom;; parent = parentNode(parent)) {
+    for (let parent = startDOM || view.dom;;) {
         if (!parent)
             break;
-        if (parent.nodeType != 1)
+        if (parent.nodeType != 1) {
+            parent = parentNode(parent);
             continue;
+        }
         let elt = parent;
         let atTop = elt == doc.body;
         let bounding = atTop ? windowRect(doc) : clientRect(elt);
@@ -6978,8 +7069,10 @@ function scrollRectIntoView(view, rect, startDOM) {
                 rect = { left: rect.left - dX, top: rect.top - dY, right: rect.right - dX, bottom: rect.bottom - dY };
             }
         }
-        if (atTop || /^(fixed|sticky)$/.test(getComputedStyle(parent).position))
+        let pos = atTop ? "fixed" : getComputedStyle(parent).position;
+        if (/^(fixed|sticky)$/.test(pos))
             break;
+        parent = pos == "absolute" ? parent.offsetParent : parentNode(parent);
     }
 }
 // Store the scroll position of the editor's parent nodes, along with
@@ -7099,17 +7192,20 @@ function findOffsetInNode(node, coords) {
 }
 function findOffsetInText(node, coords) {
     let len = node.nodeValue.length;
-    let range = document.createRange();
+    let range = document.createRange(), result;
     for (let i = 0; i < len; i++) {
         range.setEnd(node, i + 1);
         range.setStart(node, i);
         let rect = singleRect(range, 1);
         if (rect.top == rect.bottom)
             continue;
-        if (inRect(coords, rect))
-            return { node, offset: i + (coords.left >= (rect.left + rect.right) / 2 ? 1 : 0) };
+        if (inRect(coords, rect)) {
+            result = { node, offset: i + (coords.left >= (rect.left + rect.right) / 2 ? 1 : 0) };
+            break;
+        }
     }
-    return { node, offset: 0 };
+    range.detach();
+    return result || { node, offset: 0 };
 }
 function inRect(coords, rect) {
     return coords.left >= rect.left - 1 && coords.left <= rect.right + 1 &&
@@ -7146,7 +7242,7 @@ function posFromCaret(view, node, offset, coords) {
         if (desc.dom.nodeType == 1 && (desc.node.isBlock && desc.parent || !desc.contentDOM) &&
             // Ignore elements with zero-size bounding rectangles
             ((rect = desc.dom.getBoundingClientRect()).width || rect.height)) {
-            if (desc.node.isBlock && desc.parent) {
+            if (desc.node.isBlock && desc.parent && !/^T(R|BODY|HEAD|FOOT)$/.test(desc.dom.nodeName)) {
                 // Only apply the horizontal test to the innermost block. Vertical for any parent.
                 if (!sawBlock && rect.left > coords.left || rect.top > coords.top)
                     outsideBlock = desc.posBefore;
@@ -7804,7 +7900,7 @@ class ViewDesc {
         // (one where the focus is before the anchor), but not all
         // browsers support it yet.
         let domSelExtended = false;
-        if ((domSel.extend || anchor == head) && !brKludge) {
+        if ((domSel.extend || anchor == head) && !(brKludge && gecko)) {
             domSel.collapse(anchorDOM.node, anchorDOM.offset);
             try {
                 if (anchor != head)
@@ -7874,6 +7970,7 @@ class ViewDesc {
     }
     get domAtom() { return false; }
     get ignoreForCoords() { return false; }
+    get ignoreForSelection() { return false; }
     isText(text) { return false; }
 }
 // A widget desc represents a widget decoration, which is a DOM node
@@ -7918,6 +8015,7 @@ class WidgetViewDesc extends ViewDesc {
         super.destroy();
     }
     get domAtom() { return true; }
+    get ignoreForSelection() { return !!this.widget.type.spec.relaxedSide; }
     get side() { return this.widget.type.side; }
 }
 class CompositionViewDesc extends ViewDesc {
@@ -8103,15 +8201,15 @@ class NodeViewDesc extends ViewDesc {
         let updater = new ViewTreeUpdater(this, localComposition && localComposition.node, view);
         iterDeco(this.node, this.innerDeco, (widget, i, insideNode) => {
             if (widget.spec.marks)
-                updater.syncToMarks(widget.spec.marks, inline, view);
+                updater.syncToMarks(widget.spec.marks, inline, view, i);
             else if (widget.type.side >= 0 && !insideNode)
-                updater.syncToMarks(i == this.node.childCount ? Mark.none : this.node.child(i).marks, inline, view);
+                updater.syncToMarks(i == this.node.childCount ? Mark.none : this.node.child(i).marks, inline, view, i);
             // If the next node is a desc matching this widget, reuse it,
             // otherwise insert the widget as a new view desc.
             updater.placeWidget(widget, view, off);
         }, (child, outerDeco, innerDeco, i) => {
             // Make sure the wrapping mark descs match the node's marks.
-            updater.syncToMarks(child.marks, inline, view);
+            updater.syncToMarks(child.marks, inline, view, i);
             // Try several strategies for drawing this node
             let compIndex;
             if (updater.findNodeMatch(child, outerDeco, innerDeco, i)) ;
@@ -8127,7 +8225,7 @@ class NodeViewDesc extends ViewDesc {
             off += child.nodeSize;
         });
         // Drop all remaining descs after the current position.
-        updater.syncToMarks([], inline, view);
+        updater.syncToMarks([], inline, view, 0);
         if (this.node.isTextblock)
             updater.addTextblockHacks();
         updater.destroyRest();
@@ -8214,17 +8312,18 @@ class NodeViewDesc extends ViewDesc {
     }
     // Mark this node as being the selected node.
     selectNode() {
-        if (this.nodeDOM.nodeType == 1)
+        if (this.nodeDOM.nodeType == 1) {
             this.nodeDOM.classList.add("ProseMirror-selectednode");
-        if (this.contentDOM || !this.node.type.spec.draggable)
-            this.dom.draggable = true;
+            if (this.contentDOM || !this.node.type.spec.draggable)
+                this.nodeDOM.draggable = true;
+        }
     }
     // Remove selected node marking from this node.
     deselectNode() {
         if (this.nodeDOM.nodeType == 1) {
             this.nodeDOM.classList.remove("ProseMirror-selectednode");
             if (this.contentDOM || !this.node.type.spec.draggable)
-                this.dom.removeAttribute("draggable");
+                this.nodeDOM.removeAttribute("draggable");
         }
     }
     get domAtom() { return this.node.isAtom; }
@@ -8516,7 +8615,7 @@ class ViewTreeUpdater {
     }
     // Sync the current stack of mark descs with the given array of
     // marks, reusing existing mark descs when possible.
-    syncToMarks(marks, inline, view) {
+    syncToMarks(marks, inline, view, parentIndex) {
         let keep = 0, depth = this.stack.length >> 1;
         let maxKeep = Math.min(depth, marks.length);
         while (keep < maxKeep &&
@@ -8532,8 +8631,10 @@ class ViewTreeUpdater {
         }
         while (depth < marks.length) {
             this.stack.push(this.top, this.index + 1);
-            let found = -1;
-            for (let i = this.index; i < Math.min(this.index + 3, this.top.children.length); i++) {
+            let found = -1, scanTo = this.top.children.length;
+            if (parentIndex < this.preMatch.index)
+                scanTo = Math.min(this.index + 3, scanTo);
+            for (let i = this.index; i < scanTo; i++) {
                 let next = this.top.children[i];
                 if (next.matchesMark(marks[depth]) && !this.isLocked(next.dom)) {
                     found = i;
@@ -8729,9 +8830,7 @@ class ViewTreeUpdater {
 }
 // Iterate from the end of the fragment and array of descs to find
 // directly matching ones, in order to avoid overeagerly reusing those
-// for other nodes. Returns the fragment index of the first node that
-// is part of the sequence of matched nodes at the end of the
-// fragment.
+// for other nodes.
 function preMatch(frag, parentDesc) {
     let curDesc = parentDesc, descI = curDesc.children.length;
     let fI = frag.childCount, matched = new Map, matches = [];
@@ -8754,7 +8853,6 @@ function preMatch(frag, parentDesc) {
                 break outer;
             }
             else {
-                // FIXME
                 descI = curDesc.parent.children.indexOf(curDesc);
                 curDesc = curDesc.parent;
             }
@@ -9063,17 +9161,14 @@ function removeClassOnSelectionChange(view) {
     });
 }
 function selectCursorWrapper(view) {
-    let domSel = view.domSelection(), range = document.createRange();
+    let domSel = view.domSelection();
     if (!domSel)
         return;
     let node = view.cursorWrapper.dom, img = node.nodeName == "IMG";
     if (img)
-        range.setStart(node.parentNode, domIndex(node) + 1);
+        domSel.collapse(node.parentNode, domIndex(node) + 1);
     else
-        range.setStart(node, 0);
-    range.collapse(true);
-    domSel.removeAllRanges();
-    domSel.addRange(range);
+        domSel.collapse(node, 0);
     // Kludge to kill 'control selection' in IE11 when selecting an
     // invisible cursor wrapper, since that would result in those weird
     // resize handles and a selection that considers the absolutely
@@ -9381,7 +9476,7 @@ function setSelFocus(view, node, offset) {
 }
 function findDirection(view, pos) {
     let $pos = view.state.doc.resolve(pos);
-    if (!(chrome || windows) && $pos.parent.inlineContent) {
+    if (!(chrome || windows$1) && $pos.parent.inlineContent) {
         let coords = view.coordsAtPos(pos);
         if (pos > $pos.start()) {
             let before = view.coordsAtPos(pos - 1);
@@ -9551,11 +9646,14 @@ function parseFromClipboard(view, text, html, plainText, $context) {
     let dom, slice;
     if (!html && !text)
         return null;
-    let asText = text && (plainText || inCode || !html);
+    let asText = !!text && (plainText || inCode || !html);
     if (asText) {
         view.someProp("transformPastedText", f => { text = f(text, inCode || plainText, view); });
-        if (inCode)
-            return text ? new Slice(Fragment.from(view.state.schema.text(text.replace(/\r\n?/g, "\n"))), 0, 0) : Slice.empty;
+        if (inCode) {
+            slice = new Slice(Fragment.from(view.state.schema.text(text.replace(/\r\n?/g, "\n"))), 0, 0);
+            view.someProp("transformPasted", f => { slice = f(slice, view, true); });
+            return slice;
+        }
         let parsed = view.someProp("clipboardTextParser", f => f(text, $context, plainText, view));
         if (parsed) {
             slice = parsed;
@@ -9613,7 +9711,7 @@ function parseFromClipboard(view, text, html, plainText, $context) {
             slice = closeSlice(slice, openStart, openEnd);
         }
     }
-    view.someProp("transformPasted", f => { slice = f(slice, view); });
+    view.someProp("transformPasted", f => { slice = f(slice, view, asText); });
     return slice;
 }
 const inlineParents = /^(a|abbr|acronym|b|cite|code|del|em|i|ins|kbd|label|output|q|ruby|s|samp|span|strong|sub|sup|time|u|tt|var)$/i;
@@ -9724,7 +9822,7 @@ function maybeWrapTrusted(html) {
     // innerHTML, even on a detached document. This wraps the string in
     // a way that makes the browser allow us to use its parser again.
     if (!_policy)
-        _policy = trustedTypes.createPolicy("ProseMirrorClipboard", { createHTML: (s) => s });
+        _policy = trustedTypes.defaultPolicy || trustedTypes.createPolicy("ProseMirrorClipboard", { createHTML: (s) => s });
     return _policy.createHTML(html);
 }
 function readHTML(html) {
@@ -9787,7 +9885,7 @@ class InputState {
         this.mouseDown = null;
         this.lastKeyCode = null;
         this.lastKeyCodeTime = 0;
-        this.lastClick = { time: 0, x: 0, y: 0, type: "" };
+        this.lastClick = { time: 0, x: 0, y: 0, type: "", button: 0 };
         this.lastSelectionOrigin = null;
         this.lastSelectionTime = 0;
         this.lastIOSEnter = 0;
@@ -9801,6 +9899,7 @@ class InputState {
         this.compositionNodes = [];
         this.compositionEndedAt = -2e8;
         this.compositionID = 1;
+        this.badSafariComposition = false;
         // Set to a composition ID when there are pending changes at compositionend
         this.compositionPendingChanges = 0;
         this.domChangeCount = 0;
@@ -9915,8 +10014,9 @@ editHandlers.keypress = (view, _event) => {
     let sel = view.state.selection;
     if (!(sel instanceof TextSelection) || !sel.$from.sameParent(sel.$to)) {
         let text = String.fromCharCode(event.charCode);
-        if (!/[\r\n]/.test(text) && !view.someProp("handleTextInput", f => f(view, sel.$from.pos, sel.$to.pos, text)))
-            view.dispatch(view.state.tr.insertText(text).scrollIntoView());
+        let deflt = () => view.state.tr.insertText(text).scrollIntoView();
+        if (!/[\r\n]/.test(text) && !view.someProp("handleTextInput", f => f(view, sel.$from.pos, sel.$to.pos, text, deflt)))
+            view.dispatch(deflt());
         event.preventDefault();
     }
 };
@@ -10028,13 +10128,14 @@ handlers.mousedown = (view, _event) => {
     view.input.shiftKey = event.shiftKey;
     let flushed = forceDOMFlush(view);
     let now = Date.now(), type = "singleClick";
-    if (now - view.input.lastClick.time < 500 && isNear(event, view.input.lastClick) && !event[selectNodeModifier]) {
+    if (now - view.input.lastClick.time < 500 && isNear(event, view.input.lastClick) && !event[selectNodeModifier] &&
+        view.input.lastClick.button == event.button) {
         if (view.input.lastClick.type == "singleClick")
             type = "doubleClick";
         else if (view.input.lastClick.type == "doubleClick")
             type = "tripleClick";
     }
-    view.input.lastClick = { time: now, x: event.clientX, y: event.clientY, type };
+    view.input.lastClick = { time: now, x: event.clientX, y: event.clientY, type, button: event.button };
     let pos = view.posAtCoords(eventCoords(event));
     if (!pos)
         return;
@@ -10073,11 +10174,11 @@ class MouseDown {
         }
         const target = flushed ? null : event.target;
         const targetDesc = target ? view.docView.nearestDesc(target, true) : null;
-        this.target = targetDesc && targetDesc.dom.nodeType == 1 ? targetDesc.dom : null;
+        this.target = targetDesc && targetDesc.nodeDOM.nodeType == 1 ? targetDesc.nodeDOM : null;
         let { selection } = view.state;
         if (event.button == 0 &&
-            targetNode.type.spec.draggable && targetNode.type.spec.selectable !== false ||
-            selection instanceof NodeSelection && selection.from <= targetPos && selection.to > targetPos)
+            (targetNode.type.spec.draggable && targetNode.type.spec.selectable !== false ||
+                selection instanceof NodeSelection && selection.from <= targetPos && selection.to > targetPos))
             this.mightDrag = {
                 node: targetNode,
                 pos: targetPos,
@@ -10197,7 +10298,8 @@ editHandlers.compositionstart = editHandlers.compositionupdate = view => {
         let { state } = view, $pos = state.selection.$to;
         if (state.selection instanceof TextSelection &&
             (state.storedMarks ||
-                (!$pos.textOffset && $pos.parentOffset && $pos.nodeBefore.marks.some(m => m.type.spec.inclusive === false)))) {
+                (!$pos.textOffset && $pos.parentOffset && $pos.nodeBefore.marks.some(m => m.type.spec.inclusive === false)) ||
+                chrome && windows$1 && selectionBeforeUneditable(view))) { // Issue #1500
             // Need to wrap the cursor in mark nodes different from the ones in the DOM context
             view.markCursor = view.state.storedMarks || $pos.marks();
             endComposition(view, true);
@@ -10231,13 +10333,22 @@ editHandlers.compositionstart = editHandlers.compositionupdate = view => {
     }
     scheduleComposeEnd(view, timeoutComposition);
 };
+function selectionBeforeUneditable(view) {
+    let { focusNode, focusOffset } = view.domSelectionRange();
+    if (!focusNode || focusNode.nodeType != 1 || focusOffset >= focusNode.childNodes.length)
+        return false;
+    let next = focusNode.childNodes[focusOffset];
+    return next.nodeType == 1 && next.contentEditable == "false";
+}
 editHandlers.compositionend = (view, event) => {
     if (view.composing) {
         view.input.composing = false;
         view.input.compositionEndedAt = event.timeStamp;
         view.input.compositionPendingChanges = view.domObserver.pendingRecords().length ? view.input.compositionID : 0;
         view.input.compositionNode = null;
-        if (view.input.compositionPendingChanges)
+        if (view.input.badSafariComposition)
+            view.domObserver.forceFlush();
+        else if (view.input.compositionPendingChanges)
             Promise.resolve().then(() => view.domObserver.flush());
         view.input.compositionID++;
         scheduleComposeEnd(view, 20);
@@ -10291,10 +10402,10 @@ function endComposition(view, restarting = false) {
     view.domObserver.forceFlush();
     clearComposition(view);
     if (restarting || view.docView && view.docView.dirty) {
-        let sel = selectionFromDOM(view);
-        if (sel && !sel.eq(view.state.selection))
+        let sel = selectionFromDOM(view), cur = view.state.selection;
+        if (sel && !sel.eq(cur))
             view.dispatch(view.state.tr.setSelection(sel));
-        else if ((view.markCursor || restarting) && !view.state.selection.empty)
+        else if ((view.markCursor || restarting) && !cur.$from.node(cur.$from.sharedDepth(cur.to)).inlineContent)
             view.dispatch(view.state.tr.deleteSelection());
         else
             view.updateState(view.state);
@@ -10415,6 +10526,11 @@ class Dragging {
     }
 }
 const dragCopyModifier = mac$4 ? "altKey" : "ctrlKey";
+function dragMoves(view, event) {
+    let copy;
+    view.someProp("dragCopies", test => { copy = copy || test(event); });
+    return copy != null ? !copy : !event[dragCopyModifier];
+}
 handlers.dragstart = (view, _event) => {
     let event = _event;
     let mouseDown = view.input.mouseDown;
@@ -10440,11 +10556,11 @@ handlers.dragstart = (view, _event) => {
     if (!event.dataTransfer.files.length || !chrome || chrome_version > 120)
         event.dataTransfer.clearData();
     event.dataTransfer.setData(brokenClipboardAPI ? "Text" : "text/html", dom.innerHTML);
-    // See https://github.com/ProseMirror/prosemirror/issues/1156
+    // See https://code.haverbeke.berlin/prosemirror/prosemirror/issues/1156
     event.dataTransfer.effectAllowed = "copyMove";
     if (!brokenClipboardAPI)
         event.dataTransfer.setData("text/plain", text);
-    view.dragging = new Dragging(slice, !event[dragCopyModifier], node);
+    view.dragging = new Dragging(slice, dragMoves(view, event), node);
 };
 handlers.dragend = view => {
     let dragging = view.dragging;
@@ -10454,10 +10570,15 @@ handlers.dragend = view => {
     }, 50);
 };
 editHandlers.dragover = editHandlers.dragenter = (_, e) => e.preventDefault();
-editHandlers.drop = (view, _event) => {
-    let event = _event;
-    let dragging = view.dragging;
-    view.dragging = null;
+editHandlers.drop = (view, event) => {
+    try {
+        handleDrop(view, event, view.dragging);
+    }
+    finally {
+        view.dragging = null;
+    }
+};
+function handleDrop(view, event, dragging) {
     if (!event.dataTransfer)
         return;
     let eventPos = view.posAtCoords(eventCoords(event));
@@ -10466,12 +10587,12 @@ editHandlers.drop = (view, _event) => {
     let $mouse = view.state.doc.resolve(eventPos.pos);
     let slice = dragging && dragging.slice;
     if (slice) {
-        view.someProp("transformPasted", f => { slice = f(slice, view); });
+        view.someProp("transformPasted", f => { slice = f(slice, view, false); });
     }
     else {
         slice = parseFromClipboard(view, getText(event.dataTransfer), brokenClipboardAPI ? null : event.dataTransfer.getData("text/html"), false, $mouse);
     }
-    let move = !!(dragging && !event[dragCopyModifier]);
+    let move = !!(dragging && dragMoves(view, event));
     if (view.someProp("handleDrop", f => f(view, event, slice || Slice.empty, move))) {
         event.preventDefault();
         return;
@@ -10511,7 +10632,7 @@ editHandlers.drop = (view, _event) => {
     }
     view.focus();
     view.dispatch(tr.setMeta("uiEvent", "drop"));
-};
+}
 handlers.focus = view => {
     view.input.lastFocus = Date.now();
     if (!view.focused) {
@@ -11291,15 +11412,24 @@ class DOMObserver {
             new window.MutationObserver(mutations => {
                 for (let i = 0; i < mutations.length; i++)
                     this.queue.push(mutations[i]);
-                // IE11 will sometimes (on backspacing out a single character
-                // text node after a BR node) call the observer callback
-                // before actually updating the DOM, which will cause
-                // ProseMirror to miss the change (see #930)
                 if (ie$1 && ie_version <= 11 && mutations.some(m => m.type == "childList" && m.removedNodes.length ||
-                    m.type == "characterData" && m.oldValue.length > m.target.nodeValue.length))
+                    m.type == "characterData" && m.oldValue.length > m.target.nodeValue.length)) {
+                    // IE11 will sometimes (on backspacing out a single character
+                    // text node after a BR node) call the observer callback
+                    // before actually updating the DOM, which will cause
+                    // ProseMirror to miss the change (see #930)
                     this.flushSoon();
-                else
+                }
+                else if (safari && view.composing && mutations.some(m => m.type == "childList" && m.target.nodeName == "TR")) {
+                    // Safari does weird stuff when finishing a composition in a
+                    // table cell, which tends to involve inserting inappropriate
+                    // nodes in the table row.
+                    view.input.badSafariComposition = true;
+                    this.flushSoon();
+                }
+                else {
                     this.flush();
+                }
             });
         if (useCharData) {
             this.onCharData = e => {
@@ -11419,7 +11549,22 @@ class DOMObserver {
                 }
             }
         }
-        if (gecko && added.length) {
+        if (added.some(n => n.nodeName == "BR") && (view.input.lastKeyCode == 8 || view.input.lastKeyCode == 46)) {
+            // Browsers sometimes insert a bogus break node if you
+            // backspace out the last bit of text before an inline-flex node (#1552)
+            for (let node of added)
+                if (node.nodeName == "BR" && node.parentNode) {
+                    let after = node.nextSibling;
+                    while (after && after.nodeType == 1) {
+                        if (after.contentEditable == "false") {
+                            node.parentNode.removeChild(node);
+                            break;
+                        }
+                        after = after.firstChild;
+                    }
+                }
+        }
+        else if (gecko && added.length) {
             let brs = added.filter(n => n.nodeName == "BR");
             if (brs.length == 2) {
                 let [a, b] = brs;
@@ -11455,6 +11600,10 @@ class DOMObserver {
                 view.docView.markDirty(from, to);
                 checkCSS(view);
             }
+            if (view.input.badSafariComposition) {
+                view.input.badSafariComposition = false;
+                fixUpBadSafariComposition(view, added);
+            }
             this.handleDOMChange(from, to, typeOver, added);
             if (view.docView && view.docView.dirty)
                 view.updateState(view.state);
@@ -11578,6 +11727,37 @@ function blockParent(view, node) {
     }
     return null;
 }
+// Kludge for a Safari bug where, on ending a composition in an
+// otherwise empty table cell, it randomly moves the composed text
+// into the table row around that cell, greatly confusing everything
+// (#188).
+function fixUpBadSafariComposition(view, addedNodes) {
+    var _a;
+    let { focusNode, focusOffset } = view.domSelectionRange();
+    for (let node of addedNodes) {
+        if (((_a = node.parentNode) === null || _a === void 0 ? void 0 : _a.nodeName) == "TR") {
+            let nextCell = node.nextSibling;
+            while (nextCell && (nextCell.nodeName != "TD" && nextCell.nodeName != "TH"))
+                nextCell = nextCell.nextSibling;
+            if (nextCell) {
+                let parent = nextCell;
+                for (;;) {
+                    let first = parent.firstChild;
+                    if (!first || first.nodeType != 1 || first.contentEditable == "false" ||
+                        /^(BR|IMG)$/.test(first.nodeName))
+                        break;
+                    parent = first;
+                }
+                parent.insertBefore(node, parent.firstChild);
+                if (focusNode == node)
+                    view.domSelection().collapse(node, focusOffset);
+            }
+            else {
+                node.parentNode.removeChild(node);
+            }
+        }
+    }
+}
 
 // Note that all referencing and parsing is done with the
 // start-of-operation selection and document, since that's the one
@@ -11652,7 +11832,7 @@ function ruleFromNode(dom) {
     }
     return null;
 }
-const isInline = /^(a|abbr|acronym|b|bd[io]|big|br|button|cite|code|data(list)?|del|dfn|em|i|ins|kbd|label|map|mark|meter|output|q|ruby|s|samp|small|span|strong|su[bp]|time|u|tt|var)$/i;
+const isInline = /^(a|abbr|acronym|b|bd[io]|big|br|button|cite|code|data(list)?|del|dfn|em|i|img|ins|kbd|label|map|mark|meter|output|q|ruby|s|samp|small|span|strong|su[bp]|time|u|tt|var)$/i;
 function readDOMChange(view, from, to, typeOver, addedNodes) {
     let compositionID = view.input.compositionPendingChanges || (view.composing ? view.input.compositionID : 0);
     view.input.compositionPendingChanges = 0;
@@ -11751,14 +11931,13 @@ function readDOMChange(view, from, to, typeOver, addedNodes) {
     let $to = parse.doc.resolveNoCache(change.endB - parse.from);
     let $fromA = doc.resolve(change.start);
     let inlineChange = $from.sameParent($to) && $from.parent.inlineContent && $fromA.end() >= change.endA;
-    let nextSel;
     // If this looks like the effect of pressing Enter (or was recorded
     // as being an iOS enter press), just dispatch an Enter key instead.
     if (((ios && view.input.lastIOSEnter > Date.now() - 225 &&
         (!inlineChange || addedNodes.some(n => n.nodeName == "DIV" || n.nodeName == "P"))) ||
-        (!inlineChange && $from.pos < parse.doc.content.size && !$from.sameParent($to) &&
-            (nextSel = Selection.findFrom(parse.doc.resolve($from.pos + 1), 1, true)) &&
-            nextSel.head == $to.pos)) &&
+        (!inlineChange && $from.pos < parse.doc.content.size &&
+            (!$from.sameParent($to) || !$from.parent.inlineContent) &&
+            $from.pos < $to.pos && !/\S/.test(parse.doc.textBetween($from.pos, $to.pos, "", "")))) &&
         view.someProp("handleKeyDown", f => f(view, keyEvent(13, "Enter")))) {
         view.input.lastIOSEnter = 0;
         return;
@@ -11793,7 +11972,26 @@ function readDOMChange(view, from, to, typeOver, addedNodes) {
         }, 20);
     }
     let chFrom = change.start, chTo = change.endA;
-    let tr, storedMarks, markChange;
+    let mkTr = (base) => {
+        let tr = base || view.state.tr.replace(chFrom, chTo, parse.doc.slice(change.start - parse.from, change.endB - parse.from));
+        if (parse.sel) {
+            let sel = resolveSelection(view, tr.doc, parse.sel);
+            // Chrome will sometimes, during composition, report the
+            // selection in the wrong place. If it looks like that is
+            // happening, don't update the selection.
+            // Edge just doesn't move the cursor forward when you start typing
+            // in an empty block or between br nodes.
+            if (sel && !(chrome && view.composing && sel.empty &&
+                (change.start != change.endB || view.input.lastChromeDelete < Date.now() - 100) &&
+                (sel.head == chFrom || sel.head == tr.mapping.map(chTo) - 1) ||
+                ie$1 && sel.empty && sel.head == chFrom))
+                tr.setSelection(sel);
+        }
+        if (compositionID)
+            tr.setMeta("composition", compositionID);
+        return tr.scrollIntoView();
+    };
+    let markChange;
     if (inlineChange) {
         if ($from.pos == $to.pos) { // Deletion
             // IE11 sometimes weirdly moves the DOM selection around after
@@ -11802,46 +12000,36 @@ function readDOMChange(view, from, to, typeOver, addedNodes) {
                 view.domObserver.suppressSelectionUpdates();
                 setTimeout(() => selectionToDOM(view), 20);
             }
-            tr = view.state.tr.delete(chFrom, chTo);
-            storedMarks = doc.resolve(change.start).marksAcross(doc.resolve(change.endA));
+            let tr = mkTr(view.state.tr.delete(chFrom, chTo));
+            let marks = doc.resolve(change.start).marksAcross(doc.resolve(change.endA));
+            if (marks)
+                tr.ensureMarks(marks);
+            view.dispatch(tr);
         }
         else if ( // Adding or removing a mark
         change.endA == change.endB &&
             (markChange = isMarkChange($from.parent.content.cut($from.parentOffset, $to.parentOffset), $fromA.parent.content.cut($fromA.parentOffset, change.endA - $fromA.start())))) {
-            tr = view.state.tr;
+            let tr = mkTr(view.state.tr);
             if (markChange.type == "add")
                 tr.addMark(chFrom, chTo, markChange.mark);
             else
                 tr.removeMark(chFrom, chTo, markChange.mark);
+            view.dispatch(tr);
         }
         else if ($from.parent.child($from.index()).isText && $from.index() == $to.index() - ($to.textOffset ? 0 : 1)) {
             // Both positions in the same text node -- simply insert text
             let text = $from.parent.textBetween($from.parentOffset, $to.parentOffset);
-            if (view.someProp("handleTextInput", f => f(view, chFrom, chTo, text)))
-                return;
-            tr = view.state.tr.insertText(text, chFrom, chTo);
-        }
-    }
-    if (!tr)
-        tr = view.state.tr.replace(chFrom, chTo, parse.doc.slice(change.start - parse.from, change.endB - parse.from));
-    if (parse.sel) {
-        let sel = resolveSelection(view, tr.doc, parse.sel);
-        // Chrome will sometimes, during composition, report the
-        // selection in the wrong place. If it looks like that is
-        // happening, don't update the selection.
-        // Edge just doesn't move the cursor forward when you start typing
-        // in an empty block or between br nodes.
-        if (sel && !(chrome && view.composing && sel.empty &&
-            (change.start != change.endB || view.input.lastChromeDelete < Date.now() - 100) &&
-            (sel.head == chFrom || sel.head == tr.mapping.map(chTo) - 1) ||
-            ie$1 && sel.empty && sel.head == chFrom))
-            tr.setSelection(sel);
-    }
-    if (storedMarks)
-        tr.ensureMarks(storedMarks);
-    if (compositionID)
-        tr.setMeta("composition", compositionID);
-    view.dispatch(tr.scrollIntoView());
+            let deflt = () => mkTr(view.state.tr.insertText(text, chFrom, chTo));
+            if (!view.someProp("handleTextInput", f => f(view, chFrom, chTo, text, deflt)))
+                view.dispatch(deflt());
+        }
+        else {
+            view.dispatch(mkTr());
+        }
+    }
+    else {
+        view.dispatch(mkTr());
+    }
 }
 function resolveSelection(view, doc, parsedSel) {
     if (Math.max(parsedSel.anchor, parsedSel.head) > doc.content.size)
@@ -11993,7 +12181,7 @@ class EditorView {
         this.pluginViews = [];
         /**
         Holds `true` when a hack node is needed in Firefox to prevent the
-        [space is eaten issue](https://github.com/ProseMirror/prosemirror/issues/651)
+        [space is eaten issue](https://code.haverbeke.berlin/prosemirror/prosemirror/issues/651)
         @internal
         */
         this.requiresGeckoHackNode = false;
@@ -12133,7 +12321,7 @@ class EditorView {
                     this.docView.destroy();
                     this.docView = docViewDesc(state.doc, outerDeco, innerDeco, this.dom, this);
                 }
-                if (chromeKludge && !this.trackWrites)
+                if (chromeKludge && (!this.trackWrites || !this.dom.contains(this.trackWrites)))
                     forceSelUpdate = true;
             }
             // Work around for an issue where an update arriving right between
@@ -12211,12 +12399,12 @@ class EditorView {
     }
     updateDraggedNode(dragging, prev) {
         let sel = dragging.node, found = -1;
-        if (this.state.doc.nodeAt(sel.from) == sel.node) {
+        if (sel.from < this.state.doc.content.size && this.state.doc.nodeAt(sel.from) == sel.node) {
             found = sel.from;
         }
         else {
             let movedPos = sel.from + (this.state.doc.content.size - prev.doc.content.size);
-            let moved = movedPos > 0 && this.state.doc.nodeAt(movedPos);
+            let moved = movedPos > 0 && movedPos < this.state.doc.content.size && this.state.doc.nodeAt(movedPos);
             if (moved == sel.node)
                 found = movedPos;
         }
@@ -12390,6 +12578,17 @@ class EditorView {
         return doPaste(this, text, null, true, event || new ClipboardEvent("paste"));
     }
     /**
+    Serialize the given slice as it would be if it was copied from
+    this editor. Returns a DOM element that contains a
+    representation of the slice as its children, a textual
+    representation, and the transformed slice (which can be
+    different from the given input due to hooks like
+    [`transformCopied`](https://prosemirror.net/docs/ref/#view.EditorProps.transformCopied)).
+    */
+    serializeForClipboard(slice) {
+        return serializeForClipboard(this, slice);
+    }
+    /**
     Removes the editor from the DOM and destroys all [node
     views](https://prosemirror.net/docs/ref/#view.NodeView).
     */
@@ -12424,22 +12623,6 @@ class EditorView {
         return dispatchEvent(this, event);
     }
     /**
-    Dispatch a transaction. Will call
-    [`dispatchTransaction`](https://prosemirror.net/docs/ref/#view.DirectEditorProps.dispatchTransaction)
-    when given, and otherwise defaults to applying the transaction to
-    the current state and calling
-    [`updateState`](https://prosemirror.net/docs/ref/#view.EditorView.updateState) with the result.
-    This method is bound to the view instance, so that it can be
-    easily passed around.
-    */
-    dispatch(tr) {
-        let dispatchTransaction = this._props.dispatchTransaction;
-        if (dispatchTransaction)
-            dispatchTransaction.call(this, tr);
-        else
-            this.updateState(this.state.apply(tr));
-    }
-    /**
     @internal
     */
     domSelectionRange() {
@@ -12456,6 +12639,13 @@ class EditorView {
         return this.root.getSelection();
     }
 }
+EditorView.prototype.dispatch = function (tr) {
+    let dispatchTransaction = this._props.dispatchTransaction;
+    if (dispatchTransaction)
+        dispatchTransaction.call(this, tr);
+    else
+        this.updateState(this.state.apply(tr));
+};
 function computeDocDeco(view) {
     let attrs = Object.create(null);
     attrs.class = "ProseMirror";
@@ -13076,7 +13266,8 @@ function keyName(event) {
   return name
 }
 
-const mac$2 = typeof navigator != "undefined" ? /Mac|iP(hone|[oa]d)/.test(navigator.platform) : false;
+const mac$2 = typeof navigator != "undefined" && /Mac|iP(hone|[oa]d)/.test(navigator.platform);
+const windows = typeof navigator != "undefined" && /Win/.test(navigator.platform);
 function normalizeKeyName(name) {
     let parts = name.split(/-(?!$)/), result = parts[parts.length - 1];
     if (result == "Space")
@@ -13182,12 +13373,14 @@ function keydownHandler(bindings) {
                 if (noShift && noShift(view.state, view.dispatch, view))
                     return true;
             }
-            if ((event.shiftKey || event.altKey || event.metaKey || name.charCodeAt(0) > 127) &&
+            if ((event.altKey || event.metaKey || event.ctrlKey) &&
+                // Ctrl-Alt may be used for AltGr on Windows
+                !(windows && event.ctrlKey && event.altKey) &&
                 (baseName = base$1[event.keyCode]) && baseName != name) {
                 // Try falling back to the keyCode when there's a modifier
                 // active or the character produced isn't ASCII, and our table
                 // produces a different name from the the keyCode. See #668,
-                // #1060
+                // #1060, #1529.
                 let fromCode = map[modifiers(baseName, event)];
                 if (fromCode && fromCode(view.state, view.dispatch, view))
                     return true;
@@ -16420,6 +16613,10 @@ function isPunctChar (ch) {
   return P.test(ch) || regex.test(ch)
 }
 
+function isPunctCharCode (code) {
+  return isPunctChar(fromCodePoint(code))
+}
+
 // Markdown ASCII punctuation characters.
 //
 // !, ", #, $, %, &, ', (, ), *, +, ,, -, ., /, :, ;, <, =, >, ?, @, [, \, ], ^, _, `, {, |, }, or ~
@@ -16481,6 +16678,7 @@ function normalizeReference (str) {
   // (remove this when node v10 is no longer supported).
   //
   if ('ẞ'.toLowerCase() === 'Ṿ') {
+    /* c8 ignore next 2 */
     str = str.replace(/ẞ/g, 'ß');
   }
 
@@ -16519,6 +16717,28 @@ function normalizeReference (str) {
   return str.toLowerCase().toUpperCase()
 }
 
+function isAsciiTrimmable (c) {
+  return c === 0x20 || c === 0x09 || c === 0x0a || c === 0x0d
+}
+
+// "Light" .trim() for blocks (headers, paragraphs), where unicode spaces
+// should be preserved.
+function asciiTrim (str) {
+  let start = 0;
+  for (; start < str.length; start++) {
+    if (!isAsciiTrimmable(str.charCodeAt(start))) {
+      break
+    }
+  }
+  let end = str.length - 1;
+  for (; end >= start; end--) {
+    if (!isAsciiTrimmable(str.charCodeAt(end))) {
+      break
+    }
+  }
+  return str.slice(start, end + 1)
+}
+
 // Re-export libraries commonly used in both markdown-it and its plugins,
 // so plugins won't have to depend on them explicitly, which reduces their
 // bundled size (e.g. a browser build).
@@ -16528,6 +16748,7 @@ const lib = { mdurl, ucmicro };
 var utils = /*#__PURE__*/Object.freeze({
   __proto__: null,
   arrayReplaceAt: arrayReplaceAt,
+  asciiTrim: asciiTrim,
   assign: assign$1,
   escapeHtml: escapeHtml,
   escapeRE: escapeRE$1,
@@ -16535,6 +16756,7 @@ var utils = /*#__PURE__*/Object.freeze({
   has: has,
   isMdAsciiPunct: isMdAsciiPunct,
   isPunctChar: isPunctChar,
+  isPunctCharCode: isPunctCharCode,
   isSpace: isSpace,
   isString: isString$1,
   isValidEntityCode: isValidEntityCode,
@@ -17898,14 +18120,36 @@ const QUOTE_TEST_RE = /['"]/;
 const QUOTE_RE = /['"]/g;
 const APOSTROPHE = '\u2019'; /* ’ */
 
-function replaceAt (str, index, ch) {
-  return str.slice(0, index) + ch + str.slice(index + 1)
+function addReplacement (replacements, tokenIdx, pos, ch) {
+  if (!replacements[tokenIdx]) {
+    replacements[tokenIdx] = [];
+  }
+
+  replacements[tokenIdx].push({ pos, ch });
+}
+
+function applyReplacements (str, replacements) {
+  let result = '';
+  let lastPos = 0;
+
+  replacements.sort((a, b) => a.pos - b.pos);
+
+  for (let i = 0; i < replacements.length; i++) {
+    const replacement = replacements[i];
+
+    result += str.slice(lastPos, replacement.pos) + replacement.ch;
+    lastPos = replacement.pos + 1;
+  }
+
+  return result + str.slice(lastPos)
 }
 
 function process_inlines (tokens, state) {
   let j;
 
   const stack = [];
+  // token index -> list of replacements in the original token content
+  const replacements = {};
 
   for (let i = 0; i < tokens.length; i++) {
     const token = tokens[i];
@@ -17919,9 +18163,9 @@ function process_inlines (tokens, state) {
 
     if (token.type !== 'text') { continue }
 
-    let text = token.content;
+    const text = token.content;
     let pos = 0;
-    let max = text.length;
+    const max = text.length;
 
     /* eslint no-labels:0,block-scoped-var:0 */
     OUTER:
@@ -17969,8 +18213,8 @@ function process_inlines (tokens, state) {
         }
       }
 
-      const isLastPunctChar = isMdAsciiPunct(lastChar) || isPunctChar(String.fromCharCode(lastChar));
-      const isNextPunctChar = isMdAsciiPunct(nextChar) || isPunctChar(String.fromCharCode(nextChar));
+      const isLastPunctChar = isMdAsciiPunct(lastChar) || isPunctCharCode(lastChar);
+      const isNextPunctChar = isMdAsciiPunct(nextChar) || isPunctCharCode(nextChar);
 
       const isLastWhiteSpace = isWhiteSpace(lastChar);
       const isNextWhiteSpace = isWhiteSpace(nextChar);
@@ -18013,7 +18257,7 @@ function process_inlines (tokens, state) {
       if (!canOpen && !canClose) {
         // middle of word
         if (isSingle) {
-          token.content = replaceAt(token.content, t.index, APOSTROPHE);
+          addReplacement(replacements, i, t.index, APOSTROPHE);
         }
         continue
       }
@@ -18036,18 +18280,8 @@ function process_inlines (tokens, state) {
               closeQuote = state.md.options.quotes[1];
             }
 
-            // replace token.content *before* tokens[item.token].content,
-            // because, if they are pointing at the same token, replaceAt
-            // could mess up indices when quote length != 1
-            token.content = replaceAt(token.content, t.index, closeQuote);
-            tokens[item.token].content = replaceAt(
-              tokens[item.token].content, item.pos, openQuote);
-
-            pos += closeQuote.length - 1;
-            if (item.token === i) { pos += openQuote.length - 1; }
-
-            text = token.content;
-            max = text.length;
+            addReplacement(replacements, i, t.index, closeQuote);
+            addReplacement(replacements, item.token, item.pos, openQuote);
 
             stack.length = j;
             continue OUTER
@@ -18063,10 +18297,14 @@ function process_inlines (tokens, state) {
           level: thisLevel
         });
       } else if (canClose && isSingle) {
-        token.content = replaceAt(token.content, t.index, APOSTROPHE);
+        addReplacement(replacements, i, t.index, APOSTROPHE);
       }
     }
   }
+
+  Object.keys(replacements).forEach(function (tokenIdx) {
+    tokens[tokenIdx].content = applyReplacements(tokens[tokenIdx].content, replacements[tokenIdx]);
+  });
 }
 
 function smartquotes (state) {
@@ -19670,11 +19908,22 @@ function html_block (state, startLine, endLine, silent) {
 
   let nextLine = startLine + 1;
 
+  // Block types 6 and 7 (the only ones whose end condition is a blank line)
+  // have `/^$/` as their closing regexp. For all other types (1-5, e.g.
+  // `<!--` comments), a blank line is regular content and must not terminate
+  // the block - it ends only when its closing sequence is found.
+  const endsOnBlankLine = HTML_SEQUENCES[i][1].test('');
+
   // If we are here - we detected HTML block.
   // Let's roll down till block end.
   if (!HTML_SEQUENCES[i][1].test(lineText)) {
     for (; nextLine < endLine; nextLine++) {
-      if (state.sCount[nextLine] < state.blkIndent) { break }
+      if (state.sCount[nextLine] < state.blkIndent) {
+        // An outdented blank line shouldn't end a block that doesn't end on a
+        // blank line (e.g. a `<!--` comment inside a list item). Such blocks
+        // must continue until their closing sequence regardless of indent.
+        if (endsOnBlankLine || !state.isEmpty(nextLine)) { break }
+      }
 
       pos = state.bMarks[nextLine] + state.tShift[nextLine];
       max = state.eMarks[nextLine];
@@ -19737,7 +19986,7 @@ function heading (state, startLine, endLine, silent) {
   token_o.map    = [startLine, state.line];
 
   const token_i    = state.push('inline', '', 0);
-  token_i.content  = state.src.slice(pos, max).trim();
+  token_i.content  = asciiTrim(state.src.slice(pos, max));
   token_i.map      = [startLine, state.line];
   token_i.children = [];
 
@@ -19749,6 +19998,7 @@ function heading (state, startLine, endLine, silent) {
 
 // lheading (---, ===)
 
+
 function lheading (state, startLine, endLine/*, silent */) {
   const terminatorRules = state.md.block.ruler.getRules('paragraph');
 
@@ -19806,10 +20056,11 @@ function lheading (state, startLine, endLine/*, silent */) {
 
   if (!level) {
     // Didn't find valid underline
+    state.parentType = oldParentType;
     return false
   }
 
-  const content = state.getLines(startLine, nextLine, state.blkIndent, false).trim();
+  const content = asciiTrim(state.getLines(startLine, nextLine, state.blkIndent, false));
 
   state.line = nextLine + 1;
 
@@ -19832,6 +20083,7 @@ function lheading (state, startLine, endLine/*, silent */) {
 
 // Paragraph
 
+
 function paragraph (state, startLine, endLine) {
   const terminatorRules = state.md.block.ruler.getRules('paragraph');
   const oldParentType = state.parentType;
@@ -19858,7 +20110,7 @@ function paragraph (state, startLine, endLine) {
     if (terminate) { break }
   }
 
-  const content = state.getLines(startLine, nextLine, state.blkIndent, false).trim();
+  const content = asciiTrim(state.getLines(startLine, nextLine, state.blkIndent, false));
 
   state.line = nextLine;
 
@@ -20085,8 +20337,30 @@ StateInline.prototype.scanDelims = function (start, canSplitWord) {
   const max = this.posMax;
   const marker = this.src.charCodeAt(start);
 
-  // treat beginning of the line as a whitespace
-  const lastChar = start > 0 ? this.src.charCodeAt(start - 1) : 0x20;
+  // Astral characters below are combined manually, because .codePointAt()
+  // does not guarantee numeric type output. And we don't wish JIT cache issues.
+  // The broken surrogate pairs are evaluated as U+FFFD to prevent possible
+  // crashes.
+
+  let lastChar;
+  if (start === 0) {
+    // treat beginning of the line as a whitespace
+    lastChar = 0x20;
+  } else if (start === 1) {
+    lastChar = this.src.charCodeAt(0);
+    if ((lastChar & 0xF800) === 0xD800) { lastChar = 0xFFFD; }
+  } else {
+    lastChar = this.src.charCodeAt(start - 1);
+    if ((lastChar & 0xFC00) === 0xDC00) {
+      // low surrogate => add high one, replace broken pair with U+FFFD
+      const highSurr = this.src.charCodeAt(start - 2);
+      lastChar = (highSurr & 0xFC00) === 0xD800
+        ? 0x10000 + ((highSurr - 0xD800) << 10) + (lastChar - 0xDC00)
+        : 0xFFFD;
+    } else if ((lastChar & 0xFC00) === 0xD800) {
+      lastChar = 0xFFFD;
+    }
+  }
 
   let pos = start;
   while (pos < max && this.src.charCodeAt(pos) === marker) { pos++; }
@@ -20094,10 +20368,19 @@ StateInline.prototype.scanDelims = function (start, canSplitWord) {
   const count = pos - start;
 
   // treat end of the line as a whitespace
-  const nextChar = pos < max ? this.src.charCodeAt(pos) : 0x20;
+  let nextChar = pos < max ? this.src.charCodeAt(pos) : 0x20;
+  if ((nextChar & 0xFC00) === 0xD800) {
+    // high surrogate => add low one, replace broken pair with U+FFFD
+    const lowSurr = this.src.charCodeAt(pos + 1);
+    nextChar = (lowSurr & 0xFC00) === 0xDC00
+      ? 0x10000 + ((nextChar - 0xD800) << 10) + (lowSurr - 0xDC00)
+      : 0xFFFD;
+  } else if ((nextChar & 0xFC00) === 0xDC00) {
+    nextChar = 0xFFFD;
+  }
 
-  const isLastPunctChar = isMdAsciiPunct(lastChar) || isPunctChar(String.fromCharCode(lastChar));
-  const isNextPunctChar = isMdAsciiPunct(nextChar) || isPunctChar(String.fromCharCode(nextChar));
+  const isLastPunctChar = isMdAsciiPunct(lastChar) || isPunctCharCode(lastChar);
+  const isNextPunctChar = isMdAsciiPunct(nextChar) || isPunctCharCode(nextChar);
 
   const isLastWhiteSpace = isWhiteSpace(lastChar);
   const isNextWhiteSpace = isWhiteSpace(nextChar);
@@ -21124,7 +21407,7 @@ function entity (state, silent) {
   } else {
     const match = state.src.slice(pos).match(NAMED_RE);
     if (match) {
-      const decoded = decodeHTML(match[0]);
+      const decoded = decodeHTMLStrict(match[0]);
       if (decoded !== match[0]) {
         if (!silent) {
           const token   = state.push('text_special', '', 0);
@@ -21786,11 +22069,6 @@ const tlds_2ch_src_re = 'a[cdefgilmnoqrstuwxz]|b[abdefghijmnorstvwyz]|c[acdfghik
 // DON'T try to make PRs with changes. Extend TLDs with LinkifyIt.tlds() instead
 const tlds_default = 'biz|com|edu|gov|net|org|pro|web|xxx|aero|asia|coop|info|museum|name|shop|рф'.split('|');
 
-function resetScanCache (self) {
-  self.__index__ = -1;
-  self.__text_cache__ = '';
-}
-
 function createValidator (re) {
   return function (text, pos) {
     const tail = text.slice(pos);
@@ -21829,8 +22107,11 @@ function compile (self) {
   function untpl (tpl) { return tpl.replace('%TLDS%', re.src_tlds) }
 
   re.email_fuzzy = RegExp(untpl(re.tpl_email_fuzzy), 'i');
+  re.email_fuzzy_global = RegExp(untpl(re.tpl_email_fuzzy), 'ig');
   re.link_fuzzy = RegExp(untpl(re.tpl_link_fuzzy), 'i');
+  re.link_fuzzy_global = RegExp(untpl(re.tpl_link_fuzzy), 'ig');
   re.link_no_ip_fuzzy = RegExp(untpl(re.tpl_link_no_ip_fuzzy), 'i');
+  re.link_no_ip_fuzzy_global = RegExp(untpl(re.tpl_link_no_ip_fuzzy), 'ig');
   re.host_fuzzy_test = RegExp(untpl(re.tpl_host_fuzzy_test), 'i');
 
   //
@@ -21924,12 +22205,6 @@ function compile (self) {
     '(' + self.re.schema_test.source + ')|(' + self.re.host_fuzzy_test.source + ')|@',
     'i'
   );
-
-  //
-  // Cleanup
-  //
-
-  resetScanCache(self);
 }
 
 /**
@@ -21937,55 +22212,45 @@ function compile (self) {
  *
  * Match result. Single element of array, returned by [[LinkifyIt#match]]
  **/
-function Match (self, shift) {
-  const start = self.__index__;
-  const end = self.__last_index__;
-  const text = self.__text_cache__.slice(start, end);
+function Match (text, schema, index, lastIndex) {
+  const raw = text.slice(index, lastIndex);
 
   /**
    * Match#schema -> String
    *
    * Prefix (protocol) for matched string.
    **/
-  this.schema = self.__schema__.toLowerCase();
+  this.schema = schema.toLowerCase();
   /**
    * Match#index -> Number
    *
    * First position of matched string.
    **/
-  this.index = start + shift;
+  this.index = index;
   /**
    * Match#lastIndex -> Number
    *
    * Next position after matched string.
    **/
-  this.lastIndex = end + shift;
+  this.lastIndex = lastIndex;
   /**
    * Match#raw -> String
    *
    * Matched string.
    **/
-  this.raw = text;
+  this.raw = raw;
   /**
    * Match#text -> String
    *
    * Notmalized text of matched string.
    **/
-  this.text = text;
+  this.text = raw;
   /**
    * Match#url -> String
    *
    * Normalized url of matched string.
    **/
-  this.url = text;
-}
-
-function createMatch (self, shift) {
-  const match = new Match(self, shift);
-
-  self.__compiled__[match.schema].normalize(match, self);
-
-  return match
+  this.url = raw;
 }
 
 /**
@@ -22040,12 +22305,6 @@ function LinkifyIt (schemas, options) {
 
   this.__opts__ = assign({}, defaultOptions, options);
 
-  // Cache last tested result. Used to skip repeating steps on next `match` call.
-  this.__index__ = -1;
-  this.__last_index__ = -1; // Next scan position
-  this.__schema__ = '';
-  this.__text_cache__ = '';
-
   this.__schemas__ = assign({}, defaultSchemas, schemas);
   this.__compiled__ = {};
 
@@ -22087,69 +22346,38 @@ LinkifyIt.prototype.set = function set (options) {
  * Searches linkifiable pattern and returns `true` on success or `false` on fail.
  **/
 LinkifyIt.prototype.test = function test (text) {
-  // Reset scan cache
-  this.__text_cache__ = text;
-  this.__index__ = -1;
-
   if (!text.length) { return false }
 
-  let m, ml, me, len, shift, next, re, tld_pos, at_pos;
+  let m, re;
 
   // try to scan for link with schema - that's the most simple rule
   if (this.re.schema_test.test(text)) {
     re = this.re.schema_search;
     re.lastIndex = 0;
     while ((m = re.exec(text)) !== null) {
-      len = this.testSchemaAt(text, m[2], re.lastIndex);
-      if (len) {
-        this.__schema__ = m[2];
-        this.__index__ = m.index + m[1].length;
-        this.__last_index__ = m.index + m[0].length + len;
-        break
-      }
+      if (this.testSchemaAt(text, m[2], re.lastIndex)) { return true }
     }
   }
 
   if (this.__opts__.fuzzyLink && this.__compiled__['http:']) {
     // guess schemaless links
-    tld_pos = text.search(this.re.host_fuzzy_test);
-    if (tld_pos >= 0) {
-      // if tld is located after found link - no need to check fuzzy pattern
-      if (this.__index__ < 0 || tld_pos < this.__index__) {
-        if ((ml = text.match(this.__opts__.fuzzyIP ? this.re.link_fuzzy : this.re.link_no_ip_fuzzy)) !== null) {
-          shift = ml.index + ml[1].length;
-
-          if (this.__index__ < 0 || shift < this.__index__) {
-            this.__schema__ = '';
-            this.__index__ = shift;
-            this.__last_index__ = ml.index + ml[0].length;
-          }
-        }
+    if (text.search(this.re.host_fuzzy_test) >= 0) {
+      if (text.match(this.__opts__.fuzzyIP ? this.re.link_fuzzy : this.re.link_no_ip_fuzzy) !== null) {
+        return true
       }
     }
   }
 
   if (this.__opts__.fuzzyEmail && this.__compiled__['mailto:']) {
     // guess schemaless emails
-    at_pos = text.indexOf('@');
-    if (at_pos >= 0) {
+    if (text.indexOf('@') >= 0) {
       // We can't skip this check, because this cases are possible:
       // 192.168.1.1@gmail.com, my.in@example.com
-      if ((me = text.match(this.re.email_fuzzy)) !== null) {
-        shift = me.index + me[1].length;
-        next = me.index + me[0].length;
-
-        if (this.__index__ < 0 || shift < this.__index__ ||
-            (shift === this.__index__ && next > this.__last_index__)) {
-          this.__schema__ = 'mailto:';
-          this.__index__ = shift;
-          this.__last_index__ = next;
-        }
-      }
+      if (text.match(this.re.email_fuzzy) !== null) { return true }
     }
   }
 
-  return this.__index__ >= 0
+  return false
 };
 
 /**
@@ -22198,23 +22426,88 @@ LinkifyIt.prototype.testSchemaAt = function testSchemaAt (text, schema, pos) {
  **/
 LinkifyIt.prototype.match = function match (text) {
   const result = [];
-  let shift = 0;
+  const type_schemed = [];
+  const type_fuzzy_link = [];
+  const type_fuzzy_email = [];
+  let m, len, re;
+
+  function choose (a, b) {
+    if (!a) { return b }
+    if (!b) { return a }
+    if (a.index !== b.index) { return a.index < b.index ? a : b }
+    return a.lastIndex >= b.lastIndex ? a : b
+  }
+
+  if (!text.length) { return null }
+
+  // scan for links with schema
+  if (this.re.schema_test.test(text)) {
+    re = this.re.schema_search;
+    re.lastIndex = 0;
+    while ((m = re.exec(text)) !== null) {
+      len = this.testSchemaAt(text, m[2], re.lastIndex);
+      if (len) {
+        type_schemed.push({
+          schema: m[2],
+          index: m.index + m[1].length,
+          lastIndex: m.index + m[0].length + len
+        });
+      }
+    }
+  }
+
+  if (this.__opts__.fuzzyLink && this.__compiled__['http:']) {
+    re = this.__opts__.fuzzyIP ? this.re.link_fuzzy_global : this.re.link_no_ip_fuzzy_global;
+    re.lastIndex = 0;
+    while ((m = re.exec(text)) !== null) {
+      type_fuzzy_link.push({
+        schema: '',
+        index: m.index + m[1].length,
+        lastIndex: m.index + m[0].length
+      });
+    }
+  }
 
-  // Try to take previous element from cache, if .test() called before
-  if (this.__index__ >= 0 && this.__text_cache__ === text) {
-    result.push(createMatch(this, shift));
-    shift = this.__last_index__;
+  if (this.__opts__.fuzzyEmail && this.__compiled__['mailto:']) {
+    re = this.re.email_fuzzy_global;
+    re.lastIndex = 0;
+    while ((m = re.exec(text)) !== null) {
+      type_fuzzy_email.push({
+        schema: 'mailto:',
+        index: m.index + m[1].length,
+        lastIndex: m.index + m[0].length
+      });
+    }
   }
 
-  // Cut head if cache was used
-  let tail = shift ? text.slice(shift) : text;
+  const indexes = [0, 0, 0];
+  let lastIndex = 0;
 
-  // Scan string until end reached
-  while (this.test(tail)) {
-    result.push(createMatch(this, shift));
+  for (;;) {
+    const candidates = [
+      type_schemed[indexes[0]],
+      type_fuzzy_email[indexes[1]],
+      type_fuzzy_link[indexes[2]]
+    ];
+
+    const candidate = choose(choose(candidates[0], candidates[1]), candidates[2]);
+
+    if (!candidate) { break }
+
+    if (candidate === candidates[0]) {
+      indexes[0]++;
+    } else if (candidate === candidates[1]) {
+      indexes[1]++;
+    } else {
+      indexes[2]++;
+    }
+
+    if (candidate.index < lastIndex) { continue }
 
-    tail = tail.slice(this.__last_index__);
-    shift += this.__last_index__;
+    const match = new Match(text, candidate.schema, candidate.index, candidate.lastIndex);
+    this.__compiled__[match.schema].normalize(match, this);
+    result.push(match);
+    lastIndex = candidate.lastIndex;
   }
 
   if (result.length) {
@@ -22231,10 +22524,6 @@ LinkifyIt.prototype.match = function match (text) {
  * of the string, and null otherwise.
  **/
 LinkifyIt.prototype.matchAtStart = function matchAtStart (text) {
-  // Reset scan cache
-  this.__text_cache__ = text;
-  this.__index__ = -1;
-
   if (!text.length) return null
 
   const m = this.re.schema_at_start.exec(text);
@@ -22243,11 +22532,10 @@ LinkifyIt.prototype.matchAtStart = function matchAtStart (text) {
   const len = this.testSchemaAt(text, m[2], m[0].length);
   if (!len) return null
 
-  this.__schema__ = m[2];
-  this.__index__ = m.index + m[1].length;
-  this.__last_index__ = m.index + m[0].length + len;
+  const match = new Match(text, m[2], m.index + m[1].length, m.index + m[0].length + len);
 
-  return createMatch(this, 0)
+  this.__compiled__[match.schema].normalize(match, this);
+  return match
 };
 
 /** chainable
@@ -23299,7 +23587,7 @@ function MarkdownIt (presetName, options) {
  * ```javascript
  * var md = require('markdown-it')()
  *             .set({ html: true, breaks: true })
- *             .set({ typographer, true });
+ *             .set({ typographer: true });
  * ```
  *
  * __Note:__ To achieve the best possible performance, don't modify a
@@ -24224,8 +24512,7 @@ class MarkdownSerializerState {
             }
             if (node && node.isText && marks.some(mark => {
                 let info = this.getMark(mark.type.name);
-                return info && info.expelEnclosingWhitespace &&
-                    (index == parent.childCount - 1 || !mark.isInSet(parent.child(index + 1).marks));
+                return info && info.expelEnclosingWhitespace && !this.isMarkAhead(parent, index + 1, mark);
             })) {
                 let [_, rest, trail] = /^(.*?)(\s*)$/m.exec(node.text);
                 if (trail) {
@@ -24369,6 +24656,19 @@ class MarkdownSerializerState {
             trailing: (text.match(/(\s+)$/) || [undefined])[0]
         };
     }
+    /**
+    @internal
+    */
+    isMarkAhead(parent, index, mark) {
+        for (;; index++) {
+            if (index >= parent.childCount)
+                return false;
+            let next = parent.child(index);
+            if (next.type.name != this.options.hardBreakNodeName)
+                return mark.isInSet(next.marks);
+            index++;
+        }
+    }
 }
 
 const imageCache = new Map();
@@ -25695,1354 +25995,1248 @@ const createTriggerPlugin = (triggerCharacters, contentConverter) => {
     });
 };
 
-// src/index.ts
-
-// src/tablemap.ts
-var readFromCache;
-var addToCache;
+//#region src/tablemap.ts
+let readFromCache;
+let addToCache;
 if (typeof WeakMap != "undefined") {
-  let cache = /* @__PURE__ */ new WeakMap();
-  readFromCache = (key) => cache.get(key);
-  addToCache = (key, value) => {
-    cache.set(key, value);
-    return value;
-  };
+	let cache = /* @__PURE__ */ new WeakMap();
+	readFromCache = (key) => cache.get(key);
+	addToCache = (key, value) => {
+		cache.set(key, value);
+		return value;
+	};
 } else {
-  const cache = [];
-  const cacheSize = 10;
-  let cachePos = 0;
-  readFromCache = (key) => {
-    for (let i = 0; i < cache.length; i += 2)
-      if (cache[i] == key) return cache[i + 1];
-  };
-  addToCache = (key, value) => {
-    if (cachePos == cacheSize) cachePos = 0;
-    cache[cachePos++] = key;
-    return cache[cachePos++] = value;
-  };
+	const cache = [];
+	const cacheSize = 10;
+	let cachePos = 0;
+	readFromCache = (key) => {
+		for (let i = 0; i < cache.length; i += 2) if (cache[i] == key) return cache[i + 1];
+	};
+	addToCache = (key, value) => {
+		if (cachePos == cacheSize) cachePos = 0;
+		cache[cachePos++] = key;
+		return cache[cachePos++] = value;
+	};
 }
+/**
+* A table map describes the structure of a given table. To avoid
+* recomputing them all the time, they are cached per table node. To
+* be able to do that, positions saved in the map are relative to the
+* start of the table, rather than the start of the document.
+*
+* @public
+*/
 var TableMap = class {
-  constructor(width, height, map, problems) {
-    this.width = width;
-    this.height = height;
-    this.map = map;
-    this.problems = problems;
-  }
-  // Find the dimensions of the cell at the given position.
-  findCell(pos) {
-    for (let i = 0; i < this.map.length; i++) {
-      const curPos = this.map[i];
-      if (curPos != pos) continue;
-      const left = i % this.width;
-      const top = i / this.width | 0;
-      let right = left + 1;
-      let bottom = top + 1;
-      for (let j = 1; right < this.width && this.map[i + j] == curPos; j++) {
-        right++;
-      }
-      for (let j = 1; bottom < this.height && this.map[i + this.width * j] == curPos; j++) {
-        bottom++;
-      }
-      return { left, top, right, bottom };
-    }
-    throw new RangeError(`No cell with offset ${pos} found`);
-  }
-  // Find the left side of the cell at the given position.
-  colCount(pos) {
-    for (let i = 0; i < this.map.length; i++) {
-      if (this.map[i] == pos) {
-        return i % this.width;
-      }
-    }
-    throw new RangeError(`No cell with offset ${pos} found`);
-  }
-  // Find the next cell in the given direction, starting from the cell
-  // at `pos`, if any.
-  nextCell(pos, axis, dir) {
-    const { left, right, top, bottom } = this.findCell(pos);
-    if (axis == "horiz") {
-      if (dir < 0 ? left == 0 : right == this.width) return null;
-      return this.map[top * this.width + (dir < 0 ? left - 1 : right)];
-    } else {
-      if (dir < 0 ? top == 0 : bottom == this.height) return null;
-      return this.map[left + this.width * (dir < 0 ? top - 1 : bottom)];
-    }
-  }
-  // Get the rectangle spanning the two given cells.
-  rectBetween(a, b) {
-    const {
-      left: leftA,
-      right: rightA,
-      top: topA,
-      bottom: bottomA
-    } = this.findCell(a);
-    const {
-      left: leftB,
-      right: rightB,
-      top: topB,
-      bottom: bottomB
-    } = this.findCell(b);
-    return {
-      left: Math.min(leftA, leftB),
-      top: Math.min(topA, topB),
-      right: Math.max(rightA, rightB),
-      bottom: Math.max(bottomA, bottomB)
-    };
-  }
-  // Return the position of all cells that have the top left corner in
-  // the given rectangle.
-  cellsInRect(rect) {
-    const result = [];
-    const seen = {};
-    for (let row = rect.top; row < rect.bottom; row++) {
-      for (let col = rect.left; col < rect.right; col++) {
-        const index = row * this.width + col;
-        const pos = this.map[index];
-        if (seen[pos]) continue;
-        seen[pos] = true;
-        if (col == rect.left && col && this.map[index - 1] == pos || row == rect.top && row && this.map[index - this.width] == pos) {
-          continue;
-        }
-        result.push(pos);
-      }
-    }
-    return result;
-  }
-  // Return the position at which the cell at the given row and column
-  // starts, or would start, if a cell started there.
-  positionAt(row, col, table) {
-    for (let i = 0, rowStart = 0; ; i++) {
-      const rowEnd = rowStart + table.child(i).nodeSize;
-      if (i == row) {
-        let index = col + row * this.width;
-        const rowEndIndex = (row + 1) * this.width;
-        while (index < rowEndIndex && this.map[index] < rowStart) index++;
-        return index == rowEndIndex ? rowEnd - 1 : this.map[index];
-      }
-      rowStart = rowEnd;
-    }
-  }
-  // Find the table map for the given table node.
-  static get(table) {
-    return readFromCache(table) || addToCache(table, computeMap(table));
-  }
+	constructor(width, height, map, problems) {
+		this.width = width;
+		this.height = height;
+		this.map = map;
+		this.problems = problems;
+	}
+	findCell(pos) {
+		for (let i = 0; i < this.map.length; i++) {
+			const curPos = this.map[i];
+			if (curPos != pos) continue;
+			const left = i % this.width;
+			const top = i / this.width | 0;
+			let right = left + 1;
+			let bottom = top + 1;
+			for (let j = 1; right < this.width && this.map[i + j] == curPos; j++) right++;
+			for (let j = 1; bottom < this.height && this.map[i + this.width * j] == curPos; j++) bottom++;
+			return {
+				left,
+				top,
+				right,
+				bottom
+			};
+		}
+		throw new RangeError(`No cell with offset ${pos} found`);
+	}
+	colCount(pos) {
+		for (let i = 0; i < this.map.length; i++) if (this.map[i] == pos) return i % this.width;
+		throw new RangeError(`No cell with offset ${pos} found`);
+	}
+	nextCell(pos, axis, dir) {
+		const { left, right, top, bottom } = this.findCell(pos);
+		if (axis == "horiz") {
+			if (dir < 0 ? left == 0 : right == this.width) return null;
+			return this.map[top * this.width + (dir < 0 ? left - 1 : right)];
+		} else {
+			if (dir < 0 ? top == 0 : bottom == this.height) return null;
+			return this.map[left + this.width * (dir < 0 ? top - 1 : bottom)];
+		}
+	}
+	rectBetween(a, b) {
+		const { left: leftA, right: rightA, top: topA, bottom: bottomA } = this.findCell(a);
+		const { left: leftB, right: rightB, top: topB, bottom: bottomB } = this.findCell(b);
+		return {
+			left: Math.min(leftA, leftB),
+			top: Math.min(topA, topB),
+			right: Math.max(rightA, rightB),
+			bottom: Math.max(bottomA, bottomB)
+		};
+	}
+	cellsInRect(rect) {
+		const result = [];
+		const seen = {};
+		for (let row = rect.top; row < rect.bottom; row++) for (let col = rect.left; col < rect.right; col++) {
+			const index = row * this.width + col;
+			const pos = this.map[index];
+			if (seen[pos]) continue;
+			seen[pos] = true;
+			if (col == rect.left && col && this.map[index - 1] == pos || row == rect.top && row && this.map[index - this.width] == pos) continue;
+			result.push(pos);
+		}
+		return result;
+	}
+	positionAt(row, col, table) {
+		for (let i = 0, rowStart = 0;; i++) {
+			const rowEnd = rowStart + table.child(i).nodeSize;
+			if (i == row) {
+				let index = col + row * this.width;
+				const rowEndIndex = (row + 1) * this.width;
+				while (index < rowEndIndex && this.map[index] < rowStart) index++;
+				return index == rowEndIndex ? rowEnd - 1 : this.map[index];
+			}
+			rowStart = rowEnd;
+		}
+	}
+	static get(table) {
+		return readFromCache(table) || addToCache(table, computeMap(table));
+	}
 };
 function computeMap(table) {
-  if (table.type.spec.tableRole != "table")
-    throw new RangeError("Not a table node: " + table.type.name);
-  const width = findWidth(table), height = table.childCount;
-  const map = [];
-  let mapPos = 0;
-  let problems = null;
-  const colWidths = [];
-  for (let i = 0, e = width * height; i < e; i++) map[i] = 0;
-  for (let row = 0, pos = 0; row < height; row++) {
-    const rowNode = table.child(row);
-    pos++;
-    for (let i = 0; ; i++) {
-      while (mapPos < map.length && map[mapPos] != 0) mapPos++;
-      if (i == rowNode.childCount) break;
-      const cellNode = rowNode.child(i);
-      const { colspan, rowspan, colwidth } = cellNode.attrs;
-      for (let h = 0; h < rowspan; h++) {
-        if (h + row >= height) {
-          (problems || (problems = [])).push({
-            type: "overlong_rowspan",
-            pos,
-            n: rowspan - h
-          });
-          break;
-        }
-        const start = mapPos + h * width;
-        for (let w = 0; w < colspan; w++) {
-          if (map[start + w] == 0) map[start + w] = pos;
-          else
-            (problems || (problems = [])).push({
-              type: "collision",
-              row,
-              pos,
-              n: colspan - w
-            });
-          const colW = colwidth && colwidth[w];
-          if (colW) {
-            const widthIndex = (start + w) % width * 2, prev = colWidths[widthIndex];
-            if (prev == null || prev != colW && colWidths[widthIndex + 1] == 1) {
-              colWidths[widthIndex] = colW;
-              colWidths[widthIndex + 1] = 1;
-            } else if (prev == colW) {
-              colWidths[widthIndex + 1]++;
-            }
-          }
-        }
-      }
-      mapPos += colspan;
-      pos += cellNode.nodeSize;
-    }
-    const expectedPos = (row + 1) * width;
-    let missing = 0;
-    while (mapPos < expectedPos) if (map[mapPos++] == 0) missing++;
-    if (missing)
-      (problems || (problems = [])).push({ type: "missing", row, n: missing });
-    pos++;
-  }
-  if (width === 0 || height === 0)
-    (problems || (problems = [])).push({ type: "zero_sized" });
-  const tableMap = new TableMap(width, height, map, problems);
-  let badWidths = false;
-  for (let i = 0; !badWidths && i < colWidths.length; i += 2)
-    if (colWidths[i] != null && colWidths[i + 1] < height) badWidths = true;
-  if (badWidths) findBadColWidths(tableMap, colWidths, table);
-  return tableMap;
+	if (table.type.spec.tableRole != "table") throw new RangeError("Not a table node: " + table.type.name);
+	const width = findWidth(table), height = table.childCount;
+	const map = [];
+	let mapPos = 0;
+	let problems = null;
+	const colWidths = [];
+	for (let i = 0, e = width * height; i < e; i++) map[i] = 0;
+	for (let row = 0, pos = 0; row < height; row++) {
+		const rowNode = table.child(row);
+		pos++;
+		for (let i = 0;; i++) {
+			while (mapPos < map.length && map[mapPos] != 0) mapPos++;
+			if (i == rowNode.childCount) break;
+			const cellNode = rowNode.child(i);
+			const { colspan, rowspan, colwidth } = cellNode.attrs;
+			for (let h = 0; h < rowspan; h++) {
+				if (h + row >= height) {
+					(problems || (problems = [])).push({
+						type: "overlong_rowspan",
+						pos,
+						n: rowspan - h
+					});
+					break;
+				}
+				const start = mapPos + h * width;
+				for (let w = 0; w < colspan; w++) {
+					if (map[start + w] == 0) map[start + w] = pos;
+					else (problems || (problems = [])).push({
+						type: "collision",
+						row,
+						pos,
+						n: colspan - w
+					});
+					const colW = colwidth && colwidth[w];
+					if (colW) {
+						const widthIndex = (start + w) % width * 2, prev = colWidths[widthIndex];
+						if (prev == null || prev != colW && colWidths[widthIndex + 1] == 1) {
+							colWidths[widthIndex] = colW;
+							colWidths[widthIndex + 1] = 1;
+						} else if (prev == colW) colWidths[widthIndex + 1]++;
+					}
+				}
+			}
+			mapPos += colspan;
+			pos += cellNode.nodeSize;
+		}
+		const expectedPos = (row + 1) * width;
+		let missing = 0;
+		while (mapPos < expectedPos) if (map[mapPos++] == 0) missing++;
+		if (missing) (problems || (problems = [])).push({
+			type: "missing",
+			row,
+			n: missing
+		});
+		pos++;
+	}
+	if (width === 0 || height === 0) (problems || (problems = [])).push({ type: "zero_sized" });
+	const tableMap = new TableMap(width, height, map, problems);
+	let badWidths = false;
+	for (let i = 0; !badWidths && i < colWidths.length; i += 2) if (colWidths[i] != null && colWidths[i + 1] < height) badWidths = true;
+	if (badWidths) findBadColWidths(tableMap, colWidths, table);
+	return tableMap;
 }
 function findWidth(table) {
-  let width = -1;
-  let hasRowSpan = false;
-  for (let row = 0; row < table.childCount; row++) {
-    const rowNode = table.child(row);
-    let rowWidth = 0;
-    if (hasRowSpan)
-      for (let j = 0; j < row; j++) {
-        const prevRow = table.child(j);
-        for (let i = 0; i < prevRow.childCount; i++) {
-          const cell = prevRow.child(i);
-          if (j + cell.attrs.rowspan > row) rowWidth += cell.attrs.colspan;
-        }
-      }
-    for (let i = 0; i < rowNode.childCount; i++) {
-      const cell = rowNode.child(i);
-      rowWidth += cell.attrs.colspan;
-      if (cell.attrs.rowspan > 1) hasRowSpan = true;
-    }
-    if (width == -1) width = rowWidth;
-    else if (width != rowWidth) width = Math.max(width, rowWidth);
-  }
-  return width;
+	let width = -1;
+	let hasRowSpan = false;
+	for (let row = 0; row < table.childCount; row++) {
+		const rowNode = table.child(row);
+		let rowWidth = 0;
+		if (hasRowSpan) for (let j = 0; j < row; j++) {
+			const prevRow = table.child(j);
+			for (let i = 0; i < prevRow.childCount; i++) {
+				const cell = prevRow.child(i);
+				if (j + cell.attrs.rowspan > row) rowWidth += cell.attrs.colspan;
+			}
+		}
+		for (let i = 0; i < rowNode.childCount; i++) {
+			const cell = rowNode.child(i);
+			rowWidth += cell.attrs.colspan;
+			if (cell.attrs.rowspan > 1) hasRowSpan = true;
+		}
+		if (width == -1) width = rowWidth;
+		else if (width != rowWidth) width = Math.max(width, rowWidth);
+	}
+	return width;
 }
 function findBadColWidths(map, colWidths, table) {
-  if (!map.problems) map.problems = [];
-  const seen = {};
-  for (let i = 0; i < map.map.length; i++) {
-    const pos = map.map[i];
-    if (seen[pos]) continue;
-    seen[pos] = true;
-    const node = table.nodeAt(pos);
-    if (!node) {
-      throw new RangeError(`No cell with offset ${pos} found`);
-    }
-    let updated = null;
-    const attrs = node.attrs;
-    for (let j = 0; j < attrs.colspan; j++) {
-      const col = (i + j) % map.width;
-      const colWidth = colWidths[col * 2];
-      if (colWidth != null && (!attrs.colwidth || attrs.colwidth[j] != colWidth))
-        (updated || (updated = freshColWidth(attrs)))[j] = colWidth;
-    }
-    if (updated)
-      map.problems.unshift({
-        type: "colwidth mismatch",
-        pos,
-        colwidth: updated
-      });
-  }
+	if (!map.problems) map.problems = [];
+	const seen = {};
+	for (let i = 0; i < map.map.length; i++) {
+		const pos = map.map[i];
+		if (seen[pos]) continue;
+		seen[pos] = true;
+		const node = table.nodeAt(pos);
+		if (!node) throw new RangeError(`No cell with offset ${pos} found`);
+		let updated = null;
+		const attrs = node.attrs;
+		for (let j = 0; j < attrs.colspan; j++) {
+			const colWidth = colWidths[(i + j) % map.width * 2];
+			if (colWidth != null && (!attrs.colwidth || attrs.colwidth[j] != colWidth)) (updated || (updated = freshColWidth(attrs)))[j] = colWidth;
+		}
+		if (updated) map.problems.unshift({
+			type: "colwidth mismatch",
+			pos,
+			colwidth: updated
+		});
+	}
 }
 function freshColWidth(attrs) {
-  if (attrs.colwidth) return attrs.colwidth.slice();
-  const result = [];
-  for (let i = 0; i < attrs.colspan; i++) result.push(0);
-  return result;
+	if (attrs.colwidth) return attrs.colwidth.slice();
+	const result = [];
+	for (let i = 0; i < attrs.colspan; i++) result.push(0);
+	return result;
 }
 
-// src/schema.ts
+//#endregion
+//#region src/schema.ts
 function getCellAttrs(dom, extraAttrs) {
-  if (typeof dom === "string") {
-    return {};
-  }
-  const widthAttr = dom.getAttribute("data-colwidth");
-  const widths = widthAttr && /^\d+(,\d+)*$/.test(widthAttr) ? widthAttr.split(",").map((s) => Number(s)) : null;
-  const colspan = Number(dom.getAttribute("colspan") || 1);
-  const result = {
-    colspan,
-    rowspan: Number(dom.getAttribute("rowspan") || 1),
-    colwidth: widths && widths.length == colspan ? widths : null
-  };
-  for (const prop in extraAttrs) {
-    const getter = extraAttrs[prop].getFromDOM;
-    const value = getter && getter(dom);
-    if (value != null) {
-      result[prop] = value;
-    }
-  }
-  return result;
+	if (typeof dom === "string") return {};
+	const widthAttr = dom.getAttribute("data-colwidth");
+	const widths = widthAttr && /^\d+(,\d+)*$/.test(widthAttr) ? widthAttr.split(",").map((s) => Number(s)) : null;
+	const colspan = Number(dom.getAttribute("colspan") || 1);
+	const result = {
+		colspan,
+		rowspan: Number(dom.getAttribute("rowspan") || 1),
+		colwidth: widths && widths.length == colspan ? widths : null
+	};
+	for (const prop in extraAttrs) {
+		const getter = extraAttrs[prop].getFromDOM;
+		const value = getter && getter(dom);
+		if (value != null) result[prop] = value;
+	}
+	return result;
 }
 function setCellAttrs(node, extraAttrs) {
-  const attrs = {};
-  if (node.attrs.colspan != 1) attrs.colspan = node.attrs.colspan;
-  if (node.attrs.rowspan != 1) attrs.rowspan = node.attrs.rowspan;
-  if (node.attrs.colwidth)
-    attrs["data-colwidth"] = node.attrs.colwidth.join(",");
-  for (const prop in extraAttrs) {
-    const setter = extraAttrs[prop].setDOMAttr;
-    if (setter) setter(node.attrs[prop], attrs);
-  }
-  return attrs;
+	const attrs = {};
+	if (node.attrs.colspan != 1) attrs.colspan = node.attrs.colspan;
+	if (node.attrs.rowspan != 1) attrs.rowspan = node.attrs.rowspan;
+	if (node.attrs.colwidth) attrs["data-colwidth"] = node.attrs.colwidth.join(",");
+	for (const prop in extraAttrs) {
+		const setter = extraAttrs[prop].setDOMAttr;
+		if (setter) setter(node.attrs[prop], attrs);
+	}
+	return attrs;
 }
+function validateColwidth(value) {
+	if (value === null) return;
+	if (!Array.isArray(value)) throw new TypeError("colwidth must be null or an array");
+	for (const item of value) if (typeof item !== "number") throw new TypeError("colwidth must be null or an array of numbers");
+}
+/**
+* This function creates a set of [node
+* specs](http://prosemirror.net/docs/ref/#model.SchemaSpec.nodes) for
+* `table`, `table_row`, and `table_cell` nodes types as used by this
+* module. The result can then be added to the set of nodes when
+* creating a schema.
+*
+* @public
+*/
 function tableNodes(options) {
-  const extraAttrs = options.cellAttributes || {};
-  const cellAttrs = {
-    colspan: { default: 1 },
-    rowspan: { default: 1 },
-    colwidth: { default: null }
-  };
-  for (const prop in extraAttrs)
-    cellAttrs[prop] = { default: extraAttrs[prop].default };
-  return {
-    table: {
-      content: "table_row+",
-      tableRole: "table",
-      isolating: true,
-      group: options.tableGroup,
-      parseDOM: [{ tag: "table" }],
-      toDOM() {
-        return ["table", ["tbody", 0]];
-      }
-    },
-    table_row: {
-      content: "(table_cell | table_header)*",
-      tableRole: "row",
-      parseDOM: [{ tag: "tr" }],
-      toDOM() {
-        return ["tr", 0];
-      }
-    },
-    table_cell: {
-      content: options.cellContent,
-      attrs: cellAttrs,
-      tableRole: "cell",
-      isolating: true,
-      parseDOM: [
-        { tag: "td", getAttrs: (dom) => getCellAttrs(dom, extraAttrs) }
-      ],
-      toDOM(node) {
-        return ["td", setCellAttrs(node, extraAttrs), 0];
-      }
-    },
-    table_header: {
-      content: options.cellContent,
-      attrs: cellAttrs,
-      tableRole: "header_cell",
-      isolating: true,
-      parseDOM: [
-        { tag: "th", getAttrs: (dom) => getCellAttrs(dom, extraAttrs) }
-      ],
-      toDOM(node) {
-        return ["th", setCellAttrs(node, extraAttrs), 0];
-      }
-    }
-  };
+	const extraAttrs = options.cellAttributes || {};
+	const cellAttrs = {
+		colspan: {
+			default: 1,
+			validate: "number"
+		},
+		rowspan: {
+			default: 1,
+			validate: "number"
+		},
+		colwidth: {
+			default: null,
+			validate: validateColwidth
+		}
+	};
+	for (const prop in extraAttrs) cellAttrs[prop] = {
+		default: extraAttrs[prop].default,
+		validate: extraAttrs[prop].validate
+	};
+	return {
+		table: {
+			content: "table_row+",
+			tableRole: "table",
+			isolating: true,
+			group: options.tableGroup,
+			parseDOM: [{ tag: "table" }],
+			toDOM() {
+				return ["table", ["tbody", 0]];
+			}
+		},
+		table_row: {
+			content: "(table_cell | table_header)*",
+			tableRole: "row",
+			parseDOM: [{ tag: "tr" }],
+			toDOM() {
+				return ["tr", 0];
+			}
+		},
+		table_cell: {
+			content: options.cellContent,
+			attrs: cellAttrs,
+			tableRole: "cell",
+			isolating: true,
+			parseDOM: [{
+				tag: "td",
+				getAttrs: (dom) => getCellAttrs(dom, extraAttrs)
+			}],
+			toDOM(node) {
+				return [
+					"td",
+					setCellAttrs(node, extraAttrs),
+					0
+				];
+			}
+		},
+		table_header: {
+			content: options.cellContent,
+			attrs: cellAttrs,
+			tableRole: "header_cell",
+			isolating: true,
+			parseDOM: [{
+				tag: "th",
+				getAttrs: (dom) => getCellAttrs(dom, extraAttrs)
+			}],
+			toDOM(node) {
+				return [
+					"th",
+					setCellAttrs(node, extraAttrs),
+					0
+				];
+			}
+		}
+	};
 }
+/**
+* @public
+*/
 function tableNodeTypes(schema) {
-  let result = schema.cached.tableNodeTypes;
-  if (!result) {
-    result = schema.cached.tableNodeTypes = {};
-    for (const name in schema.nodes) {
-      const type = schema.nodes[name], role = type.spec.tableRole;
-      if (role) result[role] = type;
-    }
-  }
-  return result;
+	let result = schema.cached.tableNodeTypes;
+	if (!result) {
+		result = schema.cached.tableNodeTypes = {};
+		for (const name in schema.nodes) {
+			const type = schema.nodes[name], role = type.spec.tableRole;
+			if (role) result[role] = type;
+		}
+	}
+	return result;
 }
 
-// src/util.ts
-var tableEditingKey = new PluginKey("selectingCells");
+//#endregion
+//#region src/util.ts
+/**
+* @public
+*/
+const tableEditingKey = new PluginKey("selectingCells");
+/**
+* @public
+*/
 function cellAround($pos) {
-  for (let d = $pos.depth - 1; d > 0; d--)
-    if ($pos.node(d).type.spec.tableRole == "row")
-      return $pos.node(0).resolve($pos.before(d + 1));
-  return null;
+	for (let d = $pos.depth - 1; d > 0; d--) if ($pos.node(d).type.spec.tableRole == "row") return $pos.node(0).resolve($pos.before(d + 1));
+	return null;
 }
+/**
+* @public
+*/
 function isInTable(state) {
-  const $head = state.selection.$head;
-  for (let d = $head.depth; d > 0; d--)
-    if ($head.node(d).type.spec.tableRole == "row") return true;
-  return false;
+	const $head = state.selection.$head;
+	for (let d = $head.depth; d > 0; d--) if ($head.node(d).type.spec.tableRole == "row") return true;
+	return false;
 }
+/**
+* @internal
+*/
 function selectionCell(state) {
-  const sel = state.selection;
-  if ("$anchorCell" in sel && sel.$anchorCell) {
-    return sel.$anchorCell.pos > sel.$headCell.pos ? sel.$anchorCell : sel.$headCell;
-  } else if ("node" in sel && sel.node && sel.node.type.spec.tableRole == "cell") {
-    return sel.$anchor;
-  }
-  const $cell = cellAround(sel.$head) || cellNear(sel.$head);
-  if ($cell) {
-    return $cell;
-  }
-  throw new RangeError(`No cell found around position ${sel.head}`);
+	const sel = state.selection;
+	if ("$anchorCell" in sel && sel.$anchorCell) return sel.$anchorCell.pos > sel.$headCell.pos ? sel.$anchorCell : sel.$headCell;
+	else if ("node" in sel && sel.node && sel.node.type.spec.tableRole == "cell") return sel.$anchor;
+	const $cell = cellAround(sel.$head) || cellNear(sel.$head);
+	if ($cell) return $cell;
+	throw new RangeError(`No cell found around position ${sel.head}`);
 }
+/**
+* @public
+*/
 function cellNear($pos) {
-  for (let after = $pos.nodeAfter, pos = $pos.pos; after; after = after.firstChild, pos++) {
-    const role = after.type.spec.tableRole;
-    if (role == "cell" || role == "header_cell") return $pos.doc.resolve(pos);
-  }
-  for (let before = $pos.nodeBefore, pos = $pos.pos; before; before = before.lastChild, pos--) {
-    const role = before.type.spec.tableRole;
-    if (role == "cell" || role == "header_cell")
-      return $pos.doc.resolve(pos - before.nodeSize);
-  }
+	for (let after = $pos.nodeAfter, pos = $pos.pos; after; after = after.firstChild, pos++) {
+		const role = after.type.spec.tableRole;
+		if (role == "cell" || role == "header_cell") return $pos.doc.resolve(pos);
+	}
+	for (let before = $pos.nodeBefore, pos = $pos.pos; before; before = before.lastChild, pos--) {
+		const role = before.type.spec.tableRole;
+		if (role == "cell" || role == "header_cell") return $pos.doc.resolve(pos - before.nodeSize);
+	}
 }
+/**
+* @public
+*/
 function pointsAtCell($pos) {
-  return $pos.parent.type.spec.tableRole == "row" && !!$pos.nodeAfter;
+	return $pos.parent.type.spec.tableRole == "row" && !!$pos.nodeAfter;
 }
+/**
+* @internal
+*/
 function inSameTable($cellA, $cellB) {
-  return $cellA.depth == $cellB.depth && $cellA.pos >= $cellB.start(-1) && $cellA.pos <= $cellB.end(-1);
+	return $cellA.depth == $cellB.depth && $cellA.pos >= $cellB.start(-1) && $cellA.pos <= $cellB.end(-1);
 }
+/**
+* @public
+*/
 function nextCell($pos, axis, dir) {
-  const table = $pos.node(-1);
-  const map = TableMap.get(table);
-  const tableStart = $pos.start(-1);
-  const moved = map.nextCell($pos.pos - tableStart, axis, dir);
-  return moved == null ? null : $pos.node(0).resolve(tableStart + moved);
+	const table = $pos.node(-1);
+	const map = TableMap.get(table);
+	const tableStart = $pos.start(-1);
+	const moved = map.nextCell($pos.pos - tableStart, axis, dir);
+	return moved == null ? null : $pos.node(0).resolve(tableStart + moved);
 }
+/**
+* @public
+*/
 function removeColSpan(attrs, pos, n = 1) {
-  const result = { ...attrs, colspan: attrs.colspan - n };
-  if (result.colwidth) {
-    result.colwidth = result.colwidth.slice();
-    result.colwidth.splice(pos, n);
-    if (!result.colwidth.some((w) => w > 0)) result.colwidth = null;
-  }
-  return result;
-}
-
-// src/cellselection.ts
-var CellSelection = class _CellSelection extends Selection {
-  // A table selection is identified by its anchor and head cells. The
-  // positions given to this constructor should point _before_ two
-  // cells in the same table. They may be the same, to select a single
-  // cell.
-  constructor($anchorCell, $headCell = $anchorCell) {
-    const table = $anchorCell.node(-1);
-    const map = TableMap.get(table);
-    const tableStart = $anchorCell.start(-1);
-    const rect = map.rectBetween(
-      $anchorCell.pos - tableStart,
-      $headCell.pos - tableStart
-    );
-    const doc = $anchorCell.node(0);
-    const cells = map.cellsInRect(rect).filter((p) => p != $headCell.pos - tableStart);
-    cells.unshift($headCell.pos - tableStart);
-    const ranges = cells.map((pos) => {
-      const cell = table.nodeAt(pos);
-      if (!cell) {
-        throw RangeError(`No cell with offset ${pos} found`);
-      }
-      const from = tableStart + pos + 1;
-      return new SelectionRange(
-        doc.resolve(from),
-        doc.resolve(from + cell.content.size)
-      );
-    });
-    super(ranges[0].$from, ranges[0].$to, ranges);
-    this.$anchorCell = $anchorCell;
-    this.$headCell = $headCell;
-  }
-  map(doc, mapping) {
-    const $anchorCell = doc.resolve(mapping.map(this.$anchorCell.pos));
-    const $headCell = doc.resolve(mapping.map(this.$headCell.pos));
-    if (pointsAtCell($anchorCell) && pointsAtCell($headCell) && inSameTable($anchorCell, $headCell)) {
-      const tableChanged = this.$anchorCell.node(-1) != $anchorCell.node(-1);
-      if (tableChanged && this.isRowSelection())
-        return _CellSelection.rowSelection($anchorCell, $headCell);
-      else if (tableChanged && this.isColSelection())
-        return _CellSelection.colSelection($anchorCell, $headCell);
-      else return new _CellSelection($anchorCell, $headCell);
-    }
-    return TextSelection.between($anchorCell, $headCell);
-  }
-  // Returns a rectangular slice of table rows containing the selected
-  // cells.
-  content() {
-    const table = this.$anchorCell.node(-1);
-    const map = TableMap.get(table);
-    const tableStart = this.$anchorCell.start(-1);
-    const rect = map.rectBetween(
-      this.$anchorCell.pos - tableStart,
-      this.$headCell.pos - tableStart
-    );
-    const seen = {};
-    const rows = [];
-    for (let row = rect.top; row < rect.bottom; row++) {
-      const rowContent = [];
-      for (let index = row * map.width + rect.left, col = rect.left; col < rect.right; col++, index++) {
-        const pos = map.map[index];
-        if (seen[pos]) continue;
-        seen[pos] = true;
-        const cellRect = map.findCell(pos);
-        let cell = table.nodeAt(pos);
-        if (!cell) {
-          throw RangeError(`No cell with offset ${pos} found`);
-        }
-        const extraLeft = rect.left - cellRect.left;
-        const extraRight = cellRect.right - rect.right;
-        if (extraLeft > 0 || extraRight > 0) {
-          let attrs = cell.attrs;
-          if (extraLeft > 0) {
-            attrs = removeColSpan(attrs, 0, extraLeft);
-          }
-          if (extraRight > 0) {
-            attrs = removeColSpan(
-              attrs,
-              attrs.colspan - extraRight,
-              extraRight
-            );
-          }
-          if (cellRect.left < rect.left) {
-            cell = cell.type.createAndFill(attrs);
-            if (!cell) {
-              throw RangeError(
-                `Could not create cell with attrs ${JSON.stringify(attrs)}`
-              );
-            }
-          } else {
-            cell = cell.type.create(attrs, cell.content);
-          }
-        }
-        if (cellRect.top < rect.top || cellRect.bottom > rect.bottom) {
-          const attrs = {
-            ...cell.attrs,
-            rowspan: Math.min(cellRect.bottom, rect.bottom) - Math.max(cellRect.top, rect.top)
-          };
-          if (cellRect.top < rect.top) {
-            cell = cell.type.createAndFill(attrs);
-          } else {
-            cell = cell.type.create(attrs, cell.content);
-          }
-        }
-        rowContent.push(cell);
-      }
-      rows.push(table.child(row).copy(Fragment.from(rowContent)));
-    }
-    const fragment = this.isColSelection() && this.isRowSelection() ? table : rows;
-    return new Slice(Fragment.from(fragment), 1, 1);
-  }
-  replace(tr, content = Slice.empty) {
-    const mapFrom = tr.steps.length, ranges = this.ranges;
-    for (let i = 0; i < ranges.length; i++) {
-      const { $from, $to } = ranges[i], mapping = tr.mapping.slice(mapFrom);
-      tr.replace(
-        mapping.map($from.pos),
-        mapping.map($to.pos),
-        i ? Slice.empty : content
-      );
-    }
-    const sel = Selection.findFrom(
-      tr.doc.resolve(tr.mapping.slice(mapFrom).map(this.to)),
-      -1
-    );
-    if (sel) tr.setSelection(sel);
-  }
-  replaceWith(tr, node) {
-    this.replace(tr, new Slice(Fragment.from(node), 0, 0));
-  }
-  forEachCell(f) {
-    const table = this.$anchorCell.node(-1);
-    const map = TableMap.get(table);
-    const tableStart = this.$anchorCell.start(-1);
-    const cells = map.cellsInRect(
-      map.rectBetween(
-        this.$anchorCell.pos - tableStart,
-        this.$headCell.pos - tableStart
-      )
-    );
-    for (let i = 0; i < cells.length; i++) {
-      f(table.nodeAt(cells[i]), tableStart + cells[i]);
-    }
-  }
-  // True if this selection goes all the way from the top to the
-  // bottom of the table.
-  isColSelection() {
-    const anchorTop = this.$anchorCell.index(-1);
-    const headTop = this.$headCell.index(-1);
-    if (Math.min(anchorTop, headTop) > 0) return false;
-    const anchorBottom = anchorTop + this.$anchorCell.nodeAfter.attrs.rowspan;
-    const headBottom = headTop + this.$headCell.nodeAfter.attrs.rowspan;
-    return Math.max(anchorBottom, headBottom) == this.$headCell.node(-1).childCount;
-  }
-  // Returns the smallest column selection that covers the given anchor
-  // and head cell.
-  static colSelection($anchorCell, $headCell = $anchorCell) {
-    const table = $anchorCell.node(-1);
-    const map = TableMap.get(table);
-    const tableStart = $anchorCell.start(-1);
-    const anchorRect = map.findCell($anchorCell.pos - tableStart);
-    const headRect = map.findCell($headCell.pos - tableStart);
-    const doc = $anchorCell.node(0);
-    if (anchorRect.top <= headRect.top) {
-      if (anchorRect.top > 0)
-        $anchorCell = doc.resolve(tableStart + map.map[anchorRect.left]);
-      if (headRect.bottom < map.height)
-        $headCell = doc.resolve(
-          tableStart + map.map[map.width * (map.height - 1) + headRect.right - 1]
-        );
-    } else {
-      if (headRect.top > 0)
-        $headCell = doc.resolve(tableStart + map.map[headRect.left]);
-      if (anchorRect.bottom < map.height)
-        $anchorCell = doc.resolve(
-          tableStart + map.map[map.width * (map.height - 1) + anchorRect.right - 1]
-        );
-    }
-    return new _CellSelection($anchorCell, $headCell);
-  }
-  // True if this selection goes all the way from the left to the
-  // right of the table.
-  isRowSelection() {
-    const table = this.$anchorCell.node(-1);
-    const map = TableMap.get(table);
-    const tableStart = this.$anchorCell.start(-1);
-    const anchorLeft = map.colCount(this.$anchorCell.pos - tableStart);
-    const headLeft = map.colCount(this.$headCell.pos - tableStart);
-    if (Math.min(anchorLeft, headLeft) > 0) return false;
-    const anchorRight = anchorLeft + this.$anchorCell.nodeAfter.attrs.colspan;
-    const headRight = headLeft + this.$headCell.nodeAfter.attrs.colspan;
-    return Math.max(anchorRight, headRight) == map.width;
-  }
-  eq(other) {
-    return other instanceof _CellSelection && other.$anchorCell.pos == this.$anchorCell.pos && other.$headCell.pos == this.$headCell.pos;
-  }
-  // Returns the smallest row selection that covers the given anchor
-  // and head cell.
-  static rowSelection($anchorCell, $headCell = $anchorCell) {
-    const table = $anchorCell.node(-1);
-    const map = TableMap.get(table);
-    const tableStart = $anchorCell.start(-1);
-    const anchorRect = map.findCell($anchorCell.pos - tableStart);
-    const headRect = map.findCell($headCell.pos - tableStart);
-    const doc = $anchorCell.node(0);
-    if (anchorRect.left <= headRect.left) {
-      if (anchorRect.left > 0)
-        $anchorCell = doc.resolve(
-          tableStart + map.map[anchorRect.top * map.width]
-        );
-      if (headRect.right < map.width)
-        $headCell = doc.resolve(
-          tableStart + map.map[map.width * (headRect.top + 1) - 1]
-        );
-    } else {
-      if (headRect.left > 0)
-        $headCell = doc.resolve(tableStart + map.map[headRect.top * map.width]);
-      if (anchorRect.right < map.width)
-        $anchorCell = doc.resolve(
-          tableStart + map.map[map.width * (anchorRect.top + 1) - 1]
-        );
-    }
-    return new _CellSelection($anchorCell, $headCell);
-  }
-  toJSON() {
-    return {
-      type: "cell",
-      anchor: this.$anchorCell.pos,
-      head: this.$headCell.pos
-    };
-  }
-  static fromJSON(doc, json) {
-    return new _CellSelection(doc.resolve(json.anchor), doc.resolve(json.head));
-  }
-  static create(doc, anchorCell, headCell = anchorCell) {
-    return new _CellSelection(doc.resolve(anchorCell), doc.resolve(headCell));
-  }
-  getBookmark() {
-    return new CellBookmark(this.$anchorCell.pos, this.$headCell.pos);
-  }
+	const result = {
+		...attrs,
+		colspan: attrs.colspan - n
+	};
+	if (result.colwidth) {
+		result.colwidth = result.colwidth.slice();
+		result.colwidth.splice(pos, n);
+		if (!result.colwidth.some((w) => w > 0)) result.colwidth = null;
+	}
+	return result;
+}
+
+//#endregion
+//#region src/cellselection.ts
+/**
+* A [`Selection`](http://prosemirror.net/docs/ref/#state.Selection)
+* subclass that represents a cell selection spanning part of a table.
+* With the plugin enabled, these will be created when the user
+* selects across cells, and will be drawn by giving selected cells a
+* `selectedCell` CSS class.
+*
+* @public
+*/
+var CellSelection = class CellSelection extends Selection {
+	constructor($anchorCell, $headCell = $anchorCell) {
+		const table = $anchorCell.node(-1);
+		const map = TableMap.get(table);
+		const tableStart = $anchorCell.start(-1);
+		const rect = map.rectBetween($anchorCell.pos - tableStart, $headCell.pos - tableStart);
+		const doc = $anchorCell.node(0);
+		const cells = map.cellsInRect(rect).filter((p) => p != $headCell.pos - tableStart);
+		cells.unshift($headCell.pos - tableStart);
+		const ranges = cells.map((pos) => {
+			const cell = table.nodeAt(pos);
+			if (!cell) throw new RangeError(`No cell with offset ${pos} found`);
+			const from = tableStart + pos + 1;
+			return new SelectionRange(doc.resolve(from), doc.resolve(from + cell.content.size));
+		});
+		super(ranges[0].$from, ranges[0].$to, ranges);
+		this.$anchorCell = $anchorCell;
+		this.$headCell = $headCell;
+	}
+	map(doc, mapping) {
+		const $anchorCell = doc.resolve(mapping.map(this.$anchorCell.pos));
+		const $headCell = doc.resolve(mapping.map(this.$headCell.pos));
+		if (pointsAtCell($anchorCell) && pointsAtCell($headCell) && inSameTable($anchorCell, $headCell)) {
+			const tableChanged = this.$anchorCell.node(-1) != $anchorCell.node(-1);
+			if (tableChanged && this.isRowSelection()) return CellSelection.rowSelection($anchorCell, $headCell);
+			else if (tableChanged && this.isColSelection()) return CellSelection.colSelection($anchorCell, $headCell);
+			else return new CellSelection($anchorCell, $headCell);
+		}
+		return TextSelection.between($anchorCell, $headCell);
+	}
+	content() {
+		const table = this.$anchorCell.node(-1);
+		const map = TableMap.get(table);
+		const tableStart = this.$anchorCell.start(-1);
+		const rect = map.rectBetween(this.$anchorCell.pos - tableStart, this.$headCell.pos - tableStart);
+		const seen = {};
+		const rows = [];
+		for (let row = rect.top; row < rect.bottom; row++) {
+			const rowContent = [];
+			for (let index = row * map.width + rect.left, col = rect.left; col < rect.right; col++, index++) {
+				const pos = map.map[index];
+				if (seen[pos]) continue;
+				seen[pos] = true;
+				const cellRect = map.findCell(pos);
+				let cell = table.nodeAt(pos);
+				if (!cell) throw new RangeError(`No cell with offset ${pos} found`);
+				const extraLeft = rect.left - cellRect.left;
+				const extraRight = cellRect.right - rect.right;
+				if (extraLeft > 0 || extraRight > 0) {
+					let attrs = cell.attrs;
+					if (extraLeft > 0) attrs = removeColSpan(attrs, 0, extraLeft);
+					if (extraRight > 0) attrs = removeColSpan(attrs, attrs.colspan - extraRight, extraRight);
+					if (cellRect.left < rect.left) {
+						cell = cell.type.createAndFill(attrs);
+						if (!cell) throw new RangeError(`Could not create cell with attrs ${JSON.stringify(attrs)}`);
+					} else cell = cell.type.create(attrs, cell.content);
+				}
+				if (cellRect.top < rect.top || cellRect.bottom > rect.bottom) {
+					const attrs = {
+						...cell.attrs,
+						rowspan: Math.min(cellRect.bottom, rect.bottom) - Math.max(cellRect.top, rect.top)
+					};
+					if (cellRect.top < rect.top) cell = cell.type.createAndFill(attrs);
+					else cell = cell.type.create(attrs, cell.content);
+				}
+				rowContent.push(cell);
+			}
+			rows.push(table.child(row).copy(Fragment.from(rowContent)));
+		}
+		const fragment = this.isColSelection() && this.isRowSelection() ? table : rows;
+		return new Slice(Fragment.from(fragment), 1, 1);
+	}
+	replace(tr, content = Slice.empty) {
+		const mapFrom = tr.steps.length, ranges = this.ranges;
+		for (let i = 0; i < ranges.length; i++) {
+			const { $from, $to } = ranges[i], mapping = tr.mapping.slice(mapFrom);
+			tr.replace(mapping.map($from.pos), mapping.map($to.pos), i ? Slice.empty : content);
+		}
+		const sel = Selection.findFrom(tr.doc.resolve(tr.mapping.slice(mapFrom).map(this.to)), -1);
+		if (sel) tr.setSelection(sel);
+	}
+	replaceWith(tr, node) {
+		this.replace(tr, new Slice(Fragment.from(node), 0, 0));
+	}
+	forEachCell(f) {
+		const table = this.$anchorCell.node(-1);
+		const map = TableMap.get(table);
+		const tableStart = this.$anchorCell.start(-1);
+		const cells = map.cellsInRect(map.rectBetween(this.$anchorCell.pos - tableStart, this.$headCell.pos - tableStart));
+		for (let i = 0; i < cells.length; i++) f(table.nodeAt(cells[i]), tableStart + cells[i]);
+	}
+	isColSelection() {
+		const anchorTop = this.$anchorCell.index(-1);
+		const headTop = this.$headCell.index(-1);
+		if (Math.min(anchorTop, headTop) > 0) return false;
+		const anchorBottom = anchorTop + this.$anchorCell.nodeAfter.attrs.rowspan;
+		const headBottom = headTop + this.$headCell.nodeAfter.attrs.rowspan;
+		return Math.max(anchorBottom, headBottom) == this.$headCell.node(-1).childCount;
+	}
+	static colSelection($anchorCell, $headCell = $anchorCell) {
+		const table = $anchorCell.node(-1);
+		const map = TableMap.get(table);
+		const tableStart = $anchorCell.start(-1);
+		const anchorRect = map.findCell($anchorCell.pos - tableStart);
+		const headRect = map.findCell($headCell.pos - tableStart);
+		const doc = $anchorCell.node(0);
+		if (anchorRect.top <= headRect.top) {
+			if (anchorRect.top > 0) $anchorCell = doc.resolve(tableStart + map.map[anchorRect.left]);
+			if (headRect.bottom < map.height) $headCell = doc.resolve(tableStart + map.map[map.width * (map.height - 1) + headRect.right - 1]);
+		} else {
+			if (headRect.top > 0) $headCell = doc.resolve(tableStart + map.map[headRect.left]);
+			if (anchorRect.bottom < map.height) $anchorCell = doc.resolve(tableStart + map.map[map.width * (map.height - 1) + anchorRect.right - 1]);
+		}
+		return new CellSelection($anchorCell, $headCell);
+	}
+	isRowSelection() {
+		const table = this.$anchorCell.node(-1);
+		const map = TableMap.get(table);
+		const tableStart = this.$anchorCell.start(-1);
+		const anchorLeft = map.colCount(this.$anchorCell.pos - tableStart);
+		const headLeft = map.colCount(this.$headCell.pos - tableStart);
+		if (Math.min(anchorLeft, headLeft) > 0) return false;
+		const anchorRight = anchorLeft + this.$anchorCell.nodeAfter.attrs.colspan;
+		const headRight = headLeft + this.$headCell.nodeAfter.attrs.colspan;
+		return Math.max(anchorRight, headRight) == map.width;
+	}
+	eq(other) {
+		return other instanceof CellSelection && other.$anchorCell.pos == this.$anchorCell.pos && other.$headCell.pos == this.$headCell.pos;
+	}
+	static rowSelection($anchorCell, $headCell = $anchorCell) {
+		const table = $anchorCell.node(-1);
+		const map = TableMap.get(table);
+		const tableStart = $anchorCell.start(-1);
+		const anchorRect = map.findCell($anchorCell.pos - tableStart);
+		const headRect = map.findCell($headCell.pos - tableStart);
+		const doc = $anchorCell.node(0);
+		if (anchorRect.left <= headRect.left) {
+			if (anchorRect.left > 0) $anchorCell = doc.resolve(tableStart + map.map[anchorRect.top * map.width]);
+			if (headRect.right < map.width) $headCell = doc.resolve(tableStart + map.map[map.width * (headRect.top + 1) - 1]);
+		} else {
+			if (headRect.left > 0) $headCell = doc.resolve(tableStart + map.map[headRect.top * map.width]);
+			if (anchorRect.right < map.width) $anchorCell = doc.resolve(tableStart + map.map[map.width * (anchorRect.top + 1) - 1]);
+		}
+		return new CellSelection($anchorCell, $headCell);
+	}
+	toJSON() {
+		return {
+			type: "cell",
+			anchor: this.$anchorCell.pos,
+			head: this.$headCell.pos
+		};
+	}
+	static fromJSON(doc, json) {
+		return new CellSelection(doc.resolve(json.anchor), doc.resolve(json.head));
+	}
+	static create(doc, anchorCell, headCell = anchorCell) {
+		return new CellSelection(doc.resolve(anchorCell), doc.resolve(headCell));
+	}
+	getBookmark() {
+		return new CellBookmark(this.$anchorCell.pos, this.$headCell.pos);
+	}
 };
 CellSelection.prototype.visible = false;
 Selection.jsonID("cell", CellSelection);
-var CellBookmark = class _CellBookmark {
-  constructor(anchor, head) {
-    this.anchor = anchor;
-    this.head = head;
-  }
-  map(mapping) {
-    return new _CellBookmark(mapping.map(this.anchor), mapping.map(this.head));
-  }
-  resolve(doc) {
-    const $anchorCell = doc.resolve(this.anchor), $headCell = doc.resolve(this.head);
-    if ($anchorCell.parent.type.spec.tableRole == "row" && $headCell.parent.type.spec.tableRole == "row" && $anchorCell.index() < $anchorCell.parent.childCount && $headCell.index() < $headCell.parent.childCount && inSameTable($anchorCell, $headCell))
-      return new CellSelection($anchorCell, $headCell);
-    else return Selection.near($headCell, 1);
-  }
+/**
+* @public
+*/
+var CellBookmark = class CellBookmark {
+	constructor(anchor, head) {
+		this.anchor = anchor;
+		this.head = head;
+	}
+	map(mapping) {
+		return new CellBookmark(mapping.map(this.anchor), mapping.map(this.head));
+	}
+	resolve(doc) {
+		const $anchorCell = doc.resolve(this.anchor), $headCell = doc.resolve(this.head);
+		if ($anchorCell.parent.type.spec.tableRole == "row" && $headCell.parent.type.spec.tableRole == "row" && $anchorCell.index() < $anchorCell.parent.childCount && $headCell.index() < $headCell.parent.childCount && inSameTable($anchorCell, $headCell)) return new CellSelection($anchorCell, $headCell);
+		else return Selection.near($headCell, 1);
+	}
 };
 function drawCellSelection(state) {
-  if (!(state.selection instanceof CellSelection)) return null;
-  const cells = [];
-  state.selection.forEachCell((node, pos) => {
-    cells.push(
-      Decoration.node(pos, pos + node.nodeSize, { class: "selectedCell" })
-    );
-  });
-  return DecorationSet.create(state.doc, cells);
+	if (!(state.selection instanceof CellSelection)) return null;
+	const cells = [];
+	state.selection.forEachCell((node, pos) => {
+		cells.push(Decoration.node(pos, pos + node.nodeSize, { class: "selectedCell" }));
+	});
+	return DecorationSet.create(state.doc, cells);
 }
 function isCellBoundarySelection({ $from, $to }) {
-  if ($from.pos == $to.pos || $from.pos < $to.pos - 6) return false;
-  let afterFrom = $from.pos;
-  let beforeTo = $to.pos;
-  let depth = $from.depth;
-  for (; depth >= 0; depth--, afterFrom++)
-    if ($from.after(depth + 1) < $from.end(depth)) break;
-  for (let d = $to.depth; d >= 0; d--, beforeTo--)
-    if ($to.before(d + 1) > $to.start(d)) break;
-  return afterFrom == beforeTo && /row|table/.test($from.node(depth).type.spec.tableRole);
+	if ($from.pos == $to.pos || $from.pos < $to.pos - 6) return false;
+	let afterFrom = $from.pos;
+	let beforeTo = $to.pos;
+	let depth = $from.depth;
+	for (; depth >= 0; depth--, afterFrom++) if ($from.after(depth + 1) < $from.end(depth)) break;
+	for (let d = $to.depth; d >= 0; d--, beforeTo--) if ($to.before(d + 1) > $to.start(d)) break;
+	return afterFrom == beforeTo && /row|table/.test($from.node(depth).type.spec.tableRole);
 }
 function isTextSelectionAcrossCells({ $from, $to }) {
-  let fromCellBoundaryNode;
-  let toCellBoundaryNode;
-  for (let i = $from.depth; i > 0; i--) {
-    const node = $from.node(i);
-    if (node.type.spec.tableRole === "cell" || node.type.spec.tableRole === "header_cell") {
-      fromCellBoundaryNode = node;
-      break;
-    }
-  }
-  for (let i = $to.depth; i > 0; i--) {
-    const node = $to.node(i);
-    if (node.type.spec.tableRole === "cell" || node.type.spec.tableRole === "header_cell") {
-      toCellBoundaryNode = node;
-      break;
-    }
-  }
-  return fromCellBoundaryNode !== toCellBoundaryNode && $to.parentOffset === 0;
+	let fromCellBoundaryNode;
+	let toCellBoundaryNode;
+	for (let i = $from.depth; i > 0; i--) {
+		const node = $from.node(i);
+		if (node.type.spec.tableRole === "cell" || node.type.spec.tableRole === "header_cell") {
+			fromCellBoundaryNode = node;
+			break;
+		}
+	}
+	for (let i = $to.depth; i > 0; i--) {
+		const node = $to.node(i);
+		if (node.type.spec.tableRole === "cell" || node.type.spec.tableRole === "header_cell") {
+			toCellBoundaryNode = node;
+			break;
+		}
+	}
+	return fromCellBoundaryNode !== toCellBoundaryNode && $to.parentOffset === 0;
 }
 function normalizeSelection(state, tr, allowTableNodeSelection) {
-  const sel = (tr || state).selection;
-  const doc = (tr || state).doc;
-  let normalize;
-  let role;
-  if (sel instanceof NodeSelection && (role = sel.node.type.spec.tableRole)) {
-    if (role == "cell" || role == "header_cell") {
-      normalize = CellSelection.create(doc, sel.from);
-    } else if (role == "row") {
-      const $cell = doc.resolve(sel.from + 1);
-      normalize = CellSelection.rowSelection($cell, $cell);
-    } else if (!allowTableNodeSelection) {
-      const map = TableMap.get(sel.node);
-      const start = sel.from + 1;
-      const lastCell = start + map.map[map.width * map.height - 1];
-      normalize = CellSelection.create(doc, start + 1, lastCell);
-    }
-  } else if (sel instanceof TextSelection && isCellBoundarySelection(sel)) {
-    normalize = TextSelection.create(doc, sel.from);
-  } else if (sel instanceof TextSelection && isTextSelectionAcrossCells(sel)) {
-    normalize = TextSelection.create(doc, sel.$from.start(), sel.$from.end());
-  }
-  if (normalize) (tr || (tr = state.tr)).setSelection(normalize);
-  return tr;
+	const sel = (tr || state).selection;
+	const doc = (tr || state).doc;
+	let normalize;
+	let role;
+	if (sel instanceof NodeSelection && (role = sel.node.type.spec.tableRole)) {
+		if (role == "cell" || role == "header_cell") normalize = CellSelection.create(doc, sel.from);
+		else if (role == "row") {
+			const $cell = doc.resolve(sel.from + 1);
+			normalize = CellSelection.rowSelection($cell, $cell);
+		} else if (!allowTableNodeSelection) {
+			const map = TableMap.get(sel.node);
+			const start = sel.from + 1;
+			const lastCell = start + map.map[map.width * map.height - 1];
+			normalize = CellSelection.create(doc, start + 1, lastCell);
+		}
+	} else if (sel instanceof TextSelection && isCellBoundarySelection(sel)) normalize = TextSelection.create(doc, sel.from);
+	else if (sel instanceof TextSelection && isTextSelectionAcrossCells(sel)) normalize = TextSelection.create(doc, sel.$from.start(), sel.$from.end());
+	if (normalize) (tr || (tr = state.tr)).setSelection(normalize);
+	return tr;
 }
-var fixTablesKey = new PluginKey("fix-tables");
+
+//#endregion
+//#region src/fixtables.ts
+/**
+* @public
+*/
+const fixTablesKey = new PluginKey("fix-tables");
+/**
+* Helper for iterating through the nodes in a document that changed
+* compared to the given previous document. Useful for avoiding
+* duplicate work on each transaction.
+*
+* @public
+*/
 function changedDescendants(old, cur, offset, f) {
-  const oldSize = old.childCount, curSize = cur.childCount;
-  outer: for (let i = 0, j = 0; i < curSize; i++) {
-    const child = cur.child(i);
-    for (let scan = j, e = Math.min(oldSize, i + 3); scan < e; scan++) {
-      if (old.child(scan) == child) {
-        j = scan + 1;
-        offset += child.nodeSize;
-        continue outer;
-      }
-    }
-    f(child, offset);
-    if (j < oldSize && old.child(j).sameMarkup(child))
-      changedDescendants(old.child(j), child, offset + 1, f);
-    else child.nodesBetween(0, child.content.size, f, offset + 1);
-    offset += child.nodeSize;
-  }
+	const oldSize = old.childCount, curSize = cur.childCount;
+	outer: for (let i = 0, j = 0; i < curSize; i++) {
+		const child = cur.child(i);
+		for (let scan = j, e = Math.min(oldSize, i + 3); scan < e; scan++) if (old.child(scan) == child) {
+			j = scan + 1;
+			offset += child.nodeSize;
+			continue outer;
+		}
+		f(child, offset);
+		if (j < oldSize && old.child(j).sameMarkup(child)) changedDescendants(old.child(j), child, offset + 1, f);
+		else child.nodesBetween(0, child.content.size, f, offset + 1);
+		offset += child.nodeSize;
+	}
 }
+/**
+* Inspect all tables in the given state's document and return a
+* transaction that fixes them, if necessary. If `oldState` was
+* provided, that is assumed to hold a previous, known-good state,
+* which will be used to avoid re-scanning unchanged parts of the
+* document.
+*
+* @public
+*/
 function fixTables(state, oldState) {
-  let tr;
-  const check = (node, pos) => {
-    if (node.type.spec.tableRole == "table")
-      tr = fixTable(state, node, pos, tr);
-  };
-  if (!oldState) state.doc.descendants(check);
-  else if (oldState.doc != state.doc)
-    changedDescendants(oldState.doc, state.doc, 0, check);
-  return tr;
+	let tr;
+	const check = (node, pos) => {
+		if (node.type.spec.tableRole == "table") tr = fixTable(state, node, pos, tr);
+	};
+	if (!oldState) state.doc.descendants(check);
+	else if (oldState.doc != state.doc) changedDescendants(oldState.doc, state.doc, 0, check);
+	return tr;
 }
 function fixTable(state, table, tablePos, tr) {
-  const map = TableMap.get(table);
-  if (!map.problems) return tr;
-  if (!tr) tr = state.tr;
-  const mustAdd = [];
-  for (let i = 0; i < map.height; i++) mustAdd.push(0);
-  for (let i = 0; i < map.problems.length; i++) {
-    const prob = map.problems[i];
-    if (prob.type == "collision") {
-      const cell = table.nodeAt(prob.pos);
-      if (!cell) continue;
-      const attrs = cell.attrs;
-      for (let j = 0; j < attrs.rowspan; j++) mustAdd[prob.row + j] += prob.n;
-      tr.setNodeMarkup(
-        tr.mapping.map(tablePos + 1 + prob.pos),
-        null,
-        removeColSpan(attrs, attrs.colspan - prob.n, prob.n)
-      );
-    } else if (prob.type == "missing") {
-      mustAdd[prob.row] += prob.n;
-    } else if (prob.type == "overlong_rowspan") {
-      const cell = table.nodeAt(prob.pos);
-      if (!cell) continue;
-      tr.setNodeMarkup(tr.mapping.map(tablePos + 1 + prob.pos), null, {
-        ...cell.attrs,
-        rowspan: cell.attrs.rowspan - prob.n
-      });
-    } else if (prob.type == "colwidth mismatch") {
-      const cell = table.nodeAt(prob.pos);
-      if (!cell) continue;
-      tr.setNodeMarkup(tr.mapping.map(tablePos + 1 + prob.pos), null, {
-        ...cell.attrs,
-        colwidth: prob.colwidth
-      });
-    } else if (prob.type == "zero_sized") {
-      const pos = tr.mapping.map(tablePos);
-      tr.delete(pos, pos + table.nodeSize);
-    }
-  }
-  let first, last;
-  for (let i = 0; i < mustAdd.length; i++)
-    if (mustAdd[i]) {
-      if (first == null) first = i;
-      last = i;
-    }
-  for (let i = 0, pos = tablePos + 1; i < map.height; i++) {
-    const row = table.child(i);
-    const end = pos + row.nodeSize;
-    const add = mustAdd[i];
-    if (add > 0) {
-      let role = "cell";
-      if (row.firstChild) {
-        role = row.firstChild.type.spec.tableRole;
-      }
-      const nodes = [];
-      for (let j = 0; j < add; j++) {
-        const node = tableNodeTypes(state.schema)[role].createAndFill();
-        if (node) nodes.push(node);
-      }
-      const side = (i == 0 || first == i - 1) && last == i ? pos + 1 : end - 1;
-      tr.insert(tr.mapping.map(side), nodes);
-    }
-    pos = end;
-  }
-  return tr.setMeta(fixTablesKey, { fixTables: true });
+	const map = TableMap.get(table);
+	if (!map.problems) return tr;
+	if (!tr) tr = state.tr;
+	const mustAdd = [];
+	for (let i = 0; i < map.height; i++) mustAdd.push(0);
+	for (let i = 0; i < map.problems.length; i++) {
+		const prob = map.problems[i];
+		if (prob.type == "collision") {
+			const cell = table.nodeAt(prob.pos);
+			if (!cell) continue;
+			const attrs = cell.attrs;
+			for (let j = 0; j < attrs.rowspan; j++) mustAdd[prob.row + j] += prob.n;
+			tr.setNodeMarkup(tr.mapping.map(tablePos + 1 + prob.pos), null, removeColSpan(attrs, attrs.colspan - prob.n, prob.n));
+		} else if (prob.type == "missing") mustAdd[prob.row] += prob.n;
+		else if (prob.type == "overlong_rowspan") {
+			const cell = table.nodeAt(prob.pos);
+			if (!cell) continue;
+			tr.setNodeMarkup(tr.mapping.map(tablePos + 1 + prob.pos), null, {
+				...cell.attrs,
+				rowspan: cell.attrs.rowspan - prob.n
+			});
+		} else if (prob.type == "colwidth mismatch") {
+			const cell = table.nodeAt(prob.pos);
+			if (!cell) continue;
+			tr.setNodeMarkup(tr.mapping.map(tablePos + 1 + prob.pos), null, {
+				...cell.attrs,
+				colwidth: prob.colwidth
+			});
+		} else if (prob.type == "zero_sized") {
+			const pos = tr.mapping.map(tablePos);
+			tr.delete(pos, pos + table.nodeSize);
+		}
+	}
+	let first, last;
+	for (let i = 0; i < mustAdd.length; i++) if (mustAdd[i]) {
+		if (first == null) first = i;
+		last = i;
+	}
+	for (let i = 0, pos = tablePos + 1; i < map.height; i++) {
+		const row = table.child(i);
+		const end = pos + row.nodeSize;
+		const add = mustAdd[i];
+		if (add > 0) {
+			let role = "cell";
+			if (row.firstChild) role = row.firstChild.type.spec.tableRole;
+			const nodes = [];
+			for (let j = 0; j < add; j++) {
+				const node = tableNodeTypes(state.schema)[role].createAndFill();
+				if (node) nodes.push(node);
+			}
+			const side = (i == 0 || first == i - 1) && last == i ? pos + 1 : end - 1;
+			tr.insert(tr.mapping.map(side), nodes);
+		}
+		pos = end;
+	}
+	return tr.setMeta(fixTablesKey, { fixTables: true });
 }
+/**
+* Deletes the content of the selected cells, if they are not empty.
+*
+* @public
+*/
 function deleteCellSelection(state, dispatch) {
-  const sel = state.selection;
-  if (!(sel instanceof CellSelection)) return false;
-  if (dispatch) {
-    const tr = state.tr;
-    const baseContent = tableNodeTypes(state.schema).cell.createAndFill().content;
-    sel.forEachCell((cell, pos) => {
-      if (!cell.content.eq(baseContent))
-        tr.replace(
-          tr.mapping.map(pos + 1),
-          tr.mapping.map(pos + cell.nodeSize - 1),
-          new Slice(baseContent, 0, 0)
-        );
-    });
-    if (tr.docChanged) dispatch(tr);
-  }
-  return true;
+	const sel = state.selection;
+	if (!(sel instanceof CellSelection)) return false;
+	if (dispatch) {
+		const tr = state.tr;
+		const baseContent = tableNodeTypes(state.schema).cell.createAndFill().content;
+		sel.forEachCell((cell, pos) => {
+			if (!cell.content.eq(baseContent)) tr.replace(tr.mapping.map(pos + 1), tr.mapping.map(pos + cell.nodeSize - 1), new Slice(baseContent, 0, 0));
+		});
+		if (tr.docChanged) dispatch(tr);
+	}
+	return true;
 }
+
+//#endregion
+//#region src/copypaste.ts
+/**
+* Get a rectangular area of cells from a slice, or null if the outer
+* nodes of the slice aren't table cells or rows.
+*
+* @internal
+*/
 function pastedCells(slice) {
-  if (!slice.size) return null;
-  let { content, openStart, openEnd } = slice;
-  while (content.childCount == 1 && (openStart > 0 && openEnd > 0 || content.child(0).type.spec.tableRole == "table")) {
-    openStart--;
-    openEnd--;
-    content = content.child(0).content;
-  }
-  const first = content.child(0);
-  const role = first.type.spec.tableRole;
-  const schema = first.type.schema, rows = [];
-  if (role == "row") {
-    for (let i = 0; i < content.childCount; i++) {
-      let cells = content.child(i).content;
-      const left = i ? 0 : Math.max(0, openStart - 1);
-      const right = i < content.childCount - 1 ? 0 : Math.max(0, openEnd - 1);
-      if (left || right)
-        cells = fitSlice(
-          tableNodeTypes(schema).row,
-          new Slice(cells, left, right)
-        ).content;
-      rows.push(cells);
-    }
-  } else if (role == "cell" || role == "header_cell") {
-    rows.push(
-      openStart || openEnd ? fitSlice(
-        tableNodeTypes(schema).row,
-        new Slice(content, openStart, openEnd)
-      ).content : content
-    );
-  } else {
-    return null;
-  }
-  return ensureRectangular(schema, rows);
+	if (slice.size === 0) return null;
+	let { content, openStart, openEnd } = slice;
+	while (content.childCount == 1 && (openStart > 0 && openEnd > 0 || content.child(0).type.spec.tableRole == "table")) {
+		openStart--;
+		openEnd--;
+		content = content.child(0).content;
+	}
+	const first = content.child(0);
+	const role = first.type.spec.tableRole;
+	const schema = first.type.schema, rows = [];
+	if (role == "row") for (let i = 0; i < content.childCount; i++) {
+		let cells = content.child(i).content;
+		const left = i ? 0 : Math.max(0, openStart - 1);
+		const right = i < content.childCount - 1 ? 0 : Math.max(0, openEnd - 1);
+		if (left || right) cells = fitSlice(tableNodeTypes(schema).row, new Slice(cells, left, right)).content;
+		rows.push(cells);
+	}
+	else if (role == "cell" || role == "header_cell") rows.push(openStart || openEnd ? fitSlice(tableNodeTypes(schema).row, new Slice(content, openStart, openEnd)).content : content);
+	else return null;
+	return ensureRectangular(schema, rows);
 }
 function ensureRectangular(schema, rows) {
-  const widths = [];
-  for (let i = 0; i < rows.length; i++) {
-    const row = rows[i];
-    for (let j = row.childCount - 1; j >= 0; j--) {
-      const { rowspan, colspan } = row.child(j).attrs;
-      for (let r = i; r < i + rowspan; r++)
-        widths[r] = (widths[r] || 0) + colspan;
-    }
-  }
-  let width = 0;
-  for (let r = 0; r < widths.length; r++) width = Math.max(width, widths[r]);
-  for (let r = 0; r < widths.length; r++) {
-    if (r >= rows.length) rows.push(Fragment.empty);
-    if (widths[r] < width) {
-      const empty = tableNodeTypes(schema).cell.createAndFill();
-      const cells = [];
-      for (let i = widths[r]; i < width; i++) {
-        cells.push(empty);
-      }
-      rows[r] = rows[r].append(Fragment.from(cells));
-    }
-  }
-  return { height: rows.length, width, rows };
+	const widths = [];
+	for (let i = 0; i < rows.length; i++) {
+		const row = rows[i];
+		for (let j = row.childCount - 1; j >= 0; j--) {
+			const { rowspan, colspan } = row.child(j).attrs;
+			for (let r = i; r < i + rowspan; r++) widths[r] = (widths[r] || 0) + colspan;
+		}
+	}
+	let width = 0;
+	for (let r = 0; r < widths.length; r++) width = Math.max(width, widths[r]);
+	for (let r = 0; r < widths.length; r++) {
+		if (r >= rows.length) rows.push(Fragment.empty);
+		if (widths[r] < width) {
+			const empty = tableNodeTypes(schema).cell.createAndFill();
+			const cells = [];
+			for (let i = widths[r]; i < width; i++) cells.push(empty);
+			rows[r] = rows[r].append(Fragment.from(cells));
+		}
+	}
+	return {
+		height: rows.length,
+		width,
+		rows
+	};
 }
 function fitSlice(nodeType, slice) {
-  const node = nodeType.createAndFill();
-  const tr = new Transform(node).replace(0, node.content.size, slice);
-  return tr.doc;
+	const node = nodeType.createAndFill();
+	return new Transform(node).replace(0, node.content.size, slice).doc;
 }
+/**
+* Clip or extend (repeat) the given set of cells to cover the given
+* width and height. Will clip rowspan/colspan cells at the edges when
+* they stick out.
+*
+* @internal
+*/
 function clipCells({ width, height, rows }, newWidth, newHeight) {
-  if (width != newWidth) {
-    const added = [];
-    const newRows = [];
-    for (let row = 0; row < rows.length; row++) {
-      const frag = rows[row], cells = [];
-      for (let col = added[row] || 0, i = 0; col < newWidth; i++) {
-        let cell = frag.child(i % frag.childCount);
-        if (col + cell.attrs.colspan > newWidth)
-          cell = cell.type.createChecked(
-            removeColSpan(
-              cell.attrs,
-              cell.attrs.colspan,
-              col + cell.attrs.colspan - newWidth
-            ),
-            cell.content
-          );
-        cells.push(cell);
-        col += cell.attrs.colspan;
-        for (let j = 1; j < cell.attrs.rowspan; j++)
-          added[row + j] = (added[row + j] || 0) + cell.attrs.colspan;
-      }
-      newRows.push(Fragment.from(cells));
-    }
-    rows = newRows;
-    width = newWidth;
-  }
-  if (height != newHeight) {
-    const newRows = [];
-    for (let row = 0, i = 0; row < newHeight; row++, i++) {
-      const cells = [], source = rows[i % height];
-      for (let j = 0; j < source.childCount; j++) {
-        let cell = source.child(j);
-        if (row + cell.attrs.rowspan > newHeight)
-          cell = cell.type.create(
-            {
-              ...cell.attrs,
-              rowspan: Math.max(1, newHeight - cell.attrs.rowspan)
-            },
-            cell.content
-          );
-        cells.push(cell);
-      }
-      newRows.push(Fragment.from(cells));
-    }
-    rows = newRows;
-    height = newHeight;
-  }
-  return { width, height, rows };
+	if (width != newWidth) {
+		const added = [];
+		const newRows = [];
+		for (let row = 0; row < rows.length; row++) {
+			const frag = rows[row], cells = [];
+			for (let col = added[row] || 0, i = 0; col < newWidth; i++) {
+				let cell = frag.child(i % frag.childCount);
+				if (col + cell.attrs.colspan > newWidth) cell = cell.type.createChecked(removeColSpan(cell.attrs, cell.attrs.colspan, col + cell.attrs.colspan - newWidth), cell.content);
+				cells.push(cell);
+				col += cell.attrs.colspan;
+				for (let j = 1; j < cell.attrs.rowspan; j++) added[row + j] = (added[row + j] || 0) + cell.attrs.colspan;
+			}
+			newRows.push(Fragment.from(cells));
+		}
+		rows = newRows;
+		width = newWidth;
+	}
+	if (height != newHeight) {
+		const newRows = [];
+		for (let row = 0, i = 0; row < newHeight; row++, i++) {
+			const cells = [], source = rows[i % height];
+			for (let j = 0; j < source.childCount; j++) {
+				let cell = source.child(j);
+				if (row + cell.attrs.rowspan > newHeight) cell = cell.type.create({
+					...cell.attrs,
+					rowspan: Math.max(1, newHeight - cell.attrs.rowspan)
+				}, cell.content);
+				cells.push(cell);
+			}
+			newRows.push(Fragment.from(cells));
+		}
+		rows = newRows;
+		height = newHeight;
+	}
+	return {
+		width,
+		height,
+		rows
+	};
 }
 function growTable(tr, map, table, start, width, height, mapFrom) {
-  const schema = tr.doc.type.schema;
-  const types = tableNodeTypes(schema);
-  let empty;
-  let emptyHead;
-  if (width > map.width) {
-    for (let row = 0, rowEnd = 0; row < map.height; row++) {
-      const rowNode = table.child(row);
-      rowEnd += rowNode.nodeSize;
-      const cells = [];
-      let add;
-      if (rowNode.lastChild == null || rowNode.lastChild.type == types.cell)
-        add = empty || (empty = types.cell.createAndFill());
-      else add = emptyHead || (emptyHead = types.header_cell.createAndFill());
-      for (let i = map.width; i < width; i++) cells.push(add);
-      tr.insert(tr.mapping.slice(mapFrom).map(rowEnd - 1 + start), cells);
-    }
-  }
-  if (height > map.height) {
-    const cells = [];
-    for (let i = 0, start2 = (map.height - 1) * map.width; i < Math.max(map.width, width); i++) {
-      const header = i >= map.width ? false : table.nodeAt(map.map[start2 + i]).type == types.header_cell;
-      cells.push(
-        header ? emptyHead || (emptyHead = types.header_cell.createAndFill()) : empty || (empty = types.cell.createAndFill())
-      );
-    }
-    const emptyRow = types.row.create(null, Fragment.from(cells)), rows = [];
-    for (let i = map.height; i < height; i++) rows.push(emptyRow);
-    tr.insert(tr.mapping.slice(mapFrom).map(start + table.nodeSize - 2), rows);
-  }
-  return !!(empty || emptyHead);
+	const schema = tr.doc.type.schema;
+	const types = tableNodeTypes(schema);
+	let empty;
+	let emptyHead;
+	if (width > map.width) for (let row = 0, rowEnd = 0; row < map.height; row++) {
+		const rowNode = table.child(row);
+		rowEnd += rowNode.nodeSize;
+		const cells = [];
+		let add;
+		if (rowNode.lastChild == null || rowNode.lastChild.type == types.cell) add = empty || (empty = types.cell.createAndFill());
+		else add = emptyHead || (emptyHead = types.header_cell.createAndFill());
+		for (let i = map.width; i < width; i++) cells.push(add);
+		tr.insert(tr.mapping.slice(mapFrom).map(rowEnd - 1 + start), cells);
+	}
+	if (height > map.height) {
+		const cells = [];
+		for (let i = 0, start$1 = (map.height - 1) * map.width; i < Math.max(map.width, width); i++) {
+			const header = i >= map.width ? false : table.nodeAt(map.map[start$1 + i]).type == types.header_cell;
+			cells.push(header ? emptyHead || (emptyHead = types.header_cell.createAndFill()) : empty || (empty = types.cell.createAndFill()));
+		}
+		const emptyRow = types.row.create(null, Fragment.from(cells)), rows = [];
+		for (let i = map.height; i < height; i++) rows.push(emptyRow);
+		tr.insert(tr.mapping.slice(mapFrom).map(start + table.nodeSize - 2), rows);
+	}
+	return !!(empty || emptyHead);
 }
 function isolateHorizontal(tr, map, table, start, left, right, top, mapFrom) {
-  if (top == 0 || top == map.height) return false;
-  let found = false;
-  for (let col = left; col < right; col++) {
-    const index = top * map.width + col, pos = map.map[index];
-    if (map.map[index - map.width] == pos) {
-      found = true;
-      const cell = table.nodeAt(pos);
-      const { top: cellTop, left: cellLeft } = map.findCell(pos);
-      tr.setNodeMarkup(tr.mapping.slice(mapFrom).map(pos + start), null, {
-        ...cell.attrs,
-        rowspan: top - cellTop
-      });
-      tr.insert(
-        tr.mapping.slice(mapFrom).map(map.positionAt(top, cellLeft, table)),
-        cell.type.createAndFill({
-          ...cell.attrs,
-          rowspan: cellTop + cell.attrs.rowspan - top
-        })
-      );
-      col += cell.attrs.colspan - 1;
-    }
-  }
-  return found;
+	if (top == 0 || top == map.height) return false;
+	let found = false;
+	for (let col = left; col < right; col++) {
+		const index = top * map.width + col, pos = map.map[index];
+		if (map.map[index - map.width] == pos) {
+			found = true;
+			const cell = table.nodeAt(pos);
+			const { top: cellTop, left: cellLeft } = map.findCell(pos);
+			tr.setNodeMarkup(tr.mapping.slice(mapFrom).map(pos + start), null, {
+				...cell.attrs,
+				rowspan: top - cellTop
+			});
+			tr.insert(tr.mapping.slice(mapFrom).map(map.positionAt(top, cellLeft, table)), cell.type.createAndFill({
+				...cell.attrs,
+				rowspan: cellTop + cell.attrs.rowspan - top
+			}));
+			col += cell.attrs.colspan - 1;
+		}
+	}
+	return found;
 }
 function isolateVertical(tr, map, table, start, top, bottom, left, mapFrom) {
-  if (left == 0 || left == map.width) return false;
-  let found = false;
-  for (let row = top; row < bottom; row++) {
-    const index = row * map.width + left, pos = map.map[index];
-    if (map.map[index - 1] == pos) {
-      found = true;
-      const cell = table.nodeAt(pos);
-      const cellLeft = map.colCount(pos);
-      const updatePos = tr.mapping.slice(mapFrom).map(pos + start);
-      tr.setNodeMarkup(
-        updatePos,
-        null,
-        removeColSpan(
-          cell.attrs,
-          left - cellLeft,
-          cell.attrs.colspan - (left - cellLeft)
-        )
-      );
-      tr.insert(
-        updatePos + cell.nodeSize,
-        cell.type.createAndFill(
-          removeColSpan(cell.attrs, 0, left - cellLeft)
-        )
-      );
-      row += cell.attrs.rowspan - 1;
-    }
-  }
-  return found;
+	if (left == 0 || left == map.width) return false;
+	let found = false;
+	for (let row = top; row < bottom; row++) {
+		const index = row * map.width + left, pos = map.map[index];
+		if (map.map[index - 1] == pos) {
+			found = true;
+			const cell = table.nodeAt(pos);
+			const cellLeft = map.colCount(pos);
+			const updatePos = tr.mapping.slice(mapFrom).map(pos + start);
+			tr.setNodeMarkup(updatePos, null, removeColSpan(cell.attrs, left - cellLeft, cell.attrs.colspan - (left - cellLeft)));
+			tr.insert(updatePos + cell.nodeSize, cell.type.createAndFill(removeColSpan(cell.attrs, 0, left - cellLeft)));
+			row += cell.attrs.rowspan - 1;
+		}
+	}
+	return found;
 }
+/**
+* Insert the given set of cells (as returned by `pastedCells`) into a
+* table, at the position pointed at by rect.
+*
+* @internal
+*/
 function insertCells(state, dispatch, tableStart, rect, cells) {
-  let table = tableStart ? state.doc.nodeAt(tableStart - 1) : state.doc;
-  if (!table) {
-    throw new Error("No table found");
-  }
-  let map = TableMap.get(table);
-  const { top, left } = rect;
-  const right = left + cells.width, bottom = top + cells.height;
-  const tr = state.tr;
-  let mapFrom = 0;
-  function recomp() {
-    table = tableStart ? tr.doc.nodeAt(tableStart - 1) : tr.doc;
-    if (!table) {
-      throw new Error("No table found");
-    }
-    map = TableMap.get(table);
-    mapFrom = tr.mapping.maps.length;
-  }
-  if (growTable(tr, map, table, tableStart, right, bottom, mapFrom)) recomp();
-  if (isolateHorizontal(tr, map, table, tableStart, left, right, top, mapFrom))
-    recomp();
-  if (isolateHorizontal(tr, map, table, tableStart, left, right, bottom, mapFrom))
-    recomp();
-  if (isolateVertical(tr, map, table, tableStart, top, bottom, left, mapFrom))
-    recomp();
-  if (isolateVertical(tr, map, table, tableStart, top, bottom, right, mapFrom))
-    recomp();
-  for (let row = top; row < bottom; row++) {
-    const from = map.positionAt(row, left, table), to = map.positionAt(row, right, table);
-    tr.replace(
-      tr.mapping.slice(mapFrom).map(from + tableStart),
-      tr.mapping.slice(mapFrom).map(to + tableStart),
-      new Slice(cells.rows[row - top], 0, 0)
-    );
-  }
-  recomp();
-  tr.setSelection(
-    new CellSelection(
-      tr.doc.resolve(tableStart + map.positionAt(top, left, table)),
-      tr.doc.resolve(tableStart + map.positionAt(bottom - 1, right - 1, table))
-    )
-  );
-  dispatch(tr);
-}
-
-// src/input.ts
-var handleKeyDown = keydownHandler({
-  ArrowLeft: arrow("horiz", -1),
-  ArrowRight: arrow("horiz", 1),
-  ArrowUp: arrow("vert", -1),
-  ArrowDown: arrow("vert", 1),
-  "Shift-ArrowLeft": shiftArrow("horiz", -1),
-  "Shift-ArrowRight": shiftArrow("horiz", 1),
-  "Shift-ArrowUp": shiftArrow("vert", -1),
-  "Shift-ArrowDown": shiftArrow("vert", 1),
-  Backspace: deleteCellSelection,
-  "Mod-Backspace": deleteCellSelection,
-  Delete: deleteCellSelection,
-  "Mod-Delete": deleteCellSelection
+	let table = tableStart ? state.doc.nodeAt(tableStart - 1) : state.doc;
+	if (!table) throw new Error("No table found");
+	let map = TableMap.get(table);
+	const { top, left } = rect;
+	const right = left + cells.width, bottom = top + cells.height;
+	const tr = state.tr;
+	let mapFrom = 0;
+	function recomp() {
+		table = tableStart ? tr.doc.nodeAt(tableStart - 1) : tr.doc;
+		if (!table) throw new Error("No table found");
+		map = TableMap.get(table);
+		mapFrom = tr.mapping.maps.length;
+	}
+	if (growTable(tr, map, table, tableStart, right, bottom, mapFrom)) recomp();
+	if (isolateHorizontal(tr, map, table, tableStart, left, right, top, mapFrom)) recomp();
+	if (isolateHorizontal(tr, map, table, tableStart, left, right, bottom, mapFrom)) recomp();
+	if (isolateVertical(tr, map, table, tableStart, top, bottom, left, mapFrom)) recomp();
+	if (isolateVertical(tr, map, table, tableStart, top, bottom, right, mapFrom)) recomp();
+	for (let row = top; row < bottom; row++) {
+		const from = map.positionAt(row, left, table), to = map.positionAt(row, right, table);
+		tr.replace(tr.mapping.slice(mapFrom).map(from + tableStart), tr.mapping.slice(mapFrom).map(to + tableStart), new Slice(cells.rows[row - top], 0, 0));
+	}
+	recomp();
+	tr.setSelection(new CellSelection(tr.doc.resolve(tableStart + map.positionAt(top, left, table)), tr.doc.resolve(tableStart + map.positionAt(bottom - 1, right - 1, table))));
+	dispatch(tr);
+}
+
+//#endregion
+//#region src/input.ts
+const handleKeyDown = keydownHandler({
+	ArrowLeft: arrow("horiz", -1),
+	ArrowRight: arrow("horiz", 1),
+	ArrowUp: arrow("vert", -1),
+	ArrowDown: arrow("vert", 1),
+	"Shift-ArrowLeft": shiftArrow("horiz", -1),
+	"Shift-ArrowRight": shiftArrow("horiz", 1),
+	"Shift-ArrowUp": shiftArrow("vert", -1),
+	"Shift-ArrowDown": shiftArrow("vert", 1),
+	Backspace: deleteCellSelection,
+	"Mod-Backspace": deleteCellSelection,
+	Delete: deleteCellSelection,
+	"Mod-Delete": deleteCellSelection
 });
 function maybeSetSelection(state, dispatch, selection) {
-  if (selection.eq(state.selection)) return false;
-  if (dispatch) dispatch(state.tr.setSelection(selection).scrollIntoView());
-  return true;
+	if (selection.eq(state.selection)) return false;
+	if (dispatch) dispatch(state.tr.setSelection(selection).scrollIntoView());
+	return true;
 }
+/**
+* @internal
+*/
 function arrow(axis, dir) {
-  return (state, dispatch, view) => {
-    if (!view) return false;
-    const sel = state.selection;
-    if (sel instanceof CellSelection) {
-      return maybeSetSelection(
-        state,
-        dispatch,
-        Selection.near(sel.$headCell, dir)
-      );
-    }
-    if (axis != "horiz" && !sel.empty) return false;
-    const end = atEndOfCell(view, axis, dir);
-    if (end == null) return false;
-    if (axis == "horiz") {
-      return maybeSetSelection(
-        state,
-        dispatch,
-        Selection.near(state.doc.resolve(sel.head + dir), dir)
-      );
-    } else {
-      const $cell = state.doc.resolve(end);
-      const $next = nextCell($cell, axis, dir);
-      let newSel;
-      if ($next) newSel = Selection.near($next, 1);
-      else if (dir < 0)
-        newSel = Selection.near(state.doc.resolve($cell.before(-1)), -1);
-      else newSel = Selection.near(state.doc.resolve($cell.after(-1)), 1);
-      return maybeSetSelection(state, dispatch, newSel);
-    }
-  };
+	return (state, dispatch, view) => {
+		if (!view) return false;
+		const sel = state.selection;
+		if (sel instanceof CellSelection) return maybeSetSelection(state, dispatch, Selection.near(sel.$headCell, dir));
+		if (axis != "horiz" && !sel.empty) return false;
+		const end = atEndOfCell(view, axis, dir);
+		if (end == null) return false;
+		if (axis == "horiz") return maybeSetSelection(state, dispatch, Selection.near(state.doc.resolve(sel.head + dir), dir));
+		else {
+			const $cell = state.doc.resolve(end);
+			const $next = nextCell($cell, axis, dir);
+			let newSel;
+			if ($next) newSel = Selection.near($next, 1);
+			else if (dir < 0) newSel = Selection.near(state.doc.resolve($cell.before(-1)), -1);
+			else newSel = Selection.near(state.doc.resolve($cell.after(-1)), 1);
+			return maybeSetSelection(state, dispatch, newSel);
+		}
+	};
 }
 function shiftArrow(axis, dir) {
-  return (state, dispatch, view) => {
-    if (!view) return false;
-    const sel = state.selection;
-    let cellSel;
-    if (sel instanceof CellSelection) {
-      cellSel = sel;
-    } else {
-      const end = atEndOfCell(view, axis, dir);
-      if (end == null) return false;
-      cellSel = new CellSelection(state.doc.resolve(end));
-    }
-    const $head = nextCell(cellSel.$headCell, axis, dir);
-    if (!$head) return false;
-    return maybeSetSelection(
-      state,
-      dispatch,
-      new CellSelection(cellSel.$anchorCell, $head)
-    );
-  };
+	return (state, dispatch, view) => {
+		if (!view) return false;
+		const sel = state.selection;
+		let cellSel;
+		if (sel instanceof CellSelection) cellSel = sel;
+		else {
+			const end = atEndOfCell(view, axis, dir);
+			if (end == null) return false;
+			cellSel = new CellSelection(state.doc.resolve(end));
+		}
+		const $head = nextCell(cellSel.$headCell, axis, dir);
+		if (!$head) return false;
+		return maybeSetSelection(state, dispatch, new CellSelection(cellSel.$anchorCell, $head));
+	};
 }
 function handleTripleClick(view, pos) {
-  const doc = view.state.doc, $cell = cellAround(doc.resolve(pos));
-  if (!$cell) return false;
-  view.dispatch(view.state.tr.setSelection(new CellSelection($cell)));
-  return true;
+	const doc = view.state.doc, $cell = cellAround(doc.resolve(pos));
+	if (!$cell) return false;
+	view.dispatch(view.state.tr.setSelection(new CellSelection($cell)));
+	return true;
 }
+/**
+* @public
+*/
 function handlePaste(view, _, slice) {
-  if (!isInTable(view.state)) return false;
-  let cells = pastedCells(slice);
-  const sel = view.state.selection;
-  if (sel instanceof CellSelection) {
-    if (!cells)
-      cells = {
-        width: 1,
-        height: 1,
-        rows: [
-          Fragment.from(
-            fitSlice(tableNodeTypes(view.state.schema).cell, slice)
-          )
-        ]
-      };
-    const table = sel.$anchorCell.node(-1);
-    const start = sel.$anchorCell.start(-1);
-    const rect = TableMap.get(table).rectBetween(
-      sel.$anchorCell.pos - start,
-      sel.$headCell.pos - start
-    );
-    cells = clipCells(cells, rect.right - rect.left, rect.bottom - rect.top);
-    insertCells(view.state, view.dispatch, start, rect, cells);
-    return true;
-  } else if (cells) {
-    const $cell = selectionCell(view.state);
-    const start = $cell.start(-1);
-    insertCells(
-      view.state,
-      view.dispatch,
-      start,
-      TableMap.get($cell.node(-1)).findCell($cell.pos - start),
-      cells
-    );
-    return true;
-  } else {
-    return false;
-  }
-}
-function handleMouseDown(view, startEvent) {
-  var _a;
-  if (startEvent.ctrlKey || startEvent.metaKey) return;
-  const startDOMCell = domInCell(view, startEvent.target);
-  let $anchor;
-  if (startEvent.shiftKey && view.state.selection instanceof CellSelection) {
-    setCellSelection(view.state.selection.$anchorCell, startEvent);
-    startEvent.preventDefault();
-  } else if (startEvent.shiftKey && startDOMCell && ($anchor = cellAround(view.state.selection.$anchor)) != null && ((_a = cellUnderMouse(view, startEvent)) == null ? void 0 : _a.pos) != $anchor.pos) {
-    setCellSelection($anchor, startEvent);
-    startEvent.preventDefault();
-  } else if (!startDOMCell) {
-    return;
-  }
-  function setCellSelection($anchor2, event) {
-    let $head = cellUnderMouse(view, event);
-    const starting = tableEditingKey.getState(view.state) == null;
-    if (!$head || !inSameTable($anchor2, $head)) {
-      if (starting) $head = $anchor2;
-      else return;
-    }
-    const selection = new CellSelection($anchor2, $head);
-    if (starting || !view.state.selection.eq(selection)) {
-      const tr = view.state.tr.setSelection(selection);
-      if (starting) tr.setMeta(tableEditingKey, $anchor2.pos);
-      view.dispatch(tr);
-    }
-  }
-  function stop() {
-    view.root.removeEventListener("mouseup", stop);
-    view.root.removeEventListener("dragstart", stop);
-    view.root.removeEventListener("mousemove", move);
-    if (tableEditingKey.getState(view.state) != null)
-      view.dispatch(view.state.tr.setMeta(tableEditingKey, -1));
-  }
-  function move(_event) {
-    const event = _event;
-    const anchor = tableEditingKey.getState(view.state);
-    let $anchor2;
-    if (anchor != null) {
-      $anchor2 = view.state.doc.resolve(anchor);
-    } else if (domInCell(view, event.target) != startDOMCell) {
-      $anchor2 = cellUnderMouse(view, startEvent);
-      if (!$anchor2) return stop();
-    }
-    if ($anchor2) setCellSelection($anchor2, event);
-  }
-  view.root.addEventListener("mouseup", stop);
-  view.root.addEventListener("dragstart", stop);
-  view.root.addEventListener("mousemove", move);
+	if (!isInTable(view.state)) return false;
+	let cells = pastedCells(slice);
+	const sel = view.state.selection;
+	if (sel instanceof CellSelection) {
+		if (!cells) cells = {
+			width: 1,
+			height: 1,
+			rows: [Fragment.from(fitSlice(tableNodeTypes(view.state.schema).cell, slice))]
+		};
+		const table = sel.$anchorCell.node(-1);
+		const start = sel.$anchorCell.start(-1);
+		const rect = TableMap.get(table).rectBetween(sel.$anchorCell.pos - start, sel.$headCell.pos - start);
+		cells = clipCells(cells, rect.right - rect.left, rect.bottom - rect.top);
+		insertCells(view.state, view.dispatch, start, rect, cells);
+		return true;
+	} else if (cells) {
+		const $cell = selectionCell(view.state);
+		const start = $cell.start(-1);
+		insertCells(view.state, view.dispatch, start, TableMap.get($cell.node(-1)).findCell($cell.pos - start), cells);
+		return true;
+	} else return false;
+}
+function handleMouseDown$1(view, startEvent) {
+	var _cellUnderMouse;
+	if (startEvent.button != 0) return;
+	if (startEvent.ctrlKey || startEvent.metaKey) return;
+	const startDOMCell = domInCell(view, startEvent.target);
+	let $anchor;
+	if (startEvent.shiftKey && view.state.selection instanceof CellSelection) {
+		setCellSelection(view.state.selection.$anchorCell, startEvent);
+		startEvent.preventDefault();
+	} else if (startEvent.shiftKey && startDOMCell && ($anchor = cellAround(view.state.selection.$anchor)) != null && ((_cellUnderMouse = cellUnderMouse(view, startEvent)) === null || _cellUnderMouse === void 0 ? void 0 : _cellUnderMouse.pos) != $anchor.pos) {
+		setCellSelection($anchor, startEvent);
+		startEvent.preventDefault();
+	} else if (!startDOMCell) return;
+	function setCellSelection($anchor$1, event) {
+		let $head = cellUnderMouse(view, event);
+		const starting = tableEditingKey.getState(view.state) == null;
+		if (!$head || !inSameTable($anchor$1, $head)) if (starting) $head = $anchor$1;
+		else return;
+		const selection = new CellSelection($anchor$1, $head);
+		if (starting || !view.state.selection.eq(selection)) {
+			const tr = view.state.tr.setSelection(selection);
+			if (starting) tr.setMeta(tableEditingKey, $anchor$1.pos);
+			view.dispatch(tr);
+		}
+	}
+	function stop() {
+		view.root.removeEventListener("mouseup", stop);
+		view.root.removeEventListener("dragstart", stop);
+		view.root.removeEventListener("mousemove", move);
+		if (tableEditingKey.getState(view.state) != null) view.dispatch(view.state.tr.setMeta(tableEditingKey, -1));
+	}
+	function move(_event) {
+		const event = _event;
+		const anchor = tableEditingKey.getState(view.state);
+		let $anchor$1;
+		if (anchor != null) $anchor$1 = view.state.doc.resolve(anchor);
+		else if (domInCell(view, event.target) != startDOMCell) {
+			$anchor$1 = cellUnderMouse(view, startEvent);
+			if (!$anchor$1) return stop();
+		}
+		if ($anchor$1) setCellSelection($anchor$1, event);
+	}
+	view.root.addEventListener("mouseup", stop);
+	view.root.addEventListener("dragstart", stop);
+	view.root.addEventListener("mousemove", move);
 }
 function atEndOfCell(view, axis, dir) {
-  if (!(view.state.selection instanceof TextSelection)) return null;
-  const { $head } = view.state.selection;
-  for (let d = $head.depth - 1; d >= 0; d--) {
-    const parent = $head.node(d), index = dir < 0 ? $head.index(d) : $head.indexAfter(d);
-    if (index != (dir < 0 ? 0 : parent.childCount)) return null;
-    if (parent.type.spec.tableRole == "cell" || parent.type.spec.tableRole == "header_cell") {
-      const cellPos = $head.before(d);
-      const dirStr = axis == "vert" ? dir > 0 ? "down" : "up" : dir > 0 ? "right" : "left";
-      return view.endOfTextblock(dirStr) ? cellPos : null;
-    }
-  }
-  return null;
+	if (!(view.state.selection instanceof TextSelection)) return null;
+	const { $head } = view.state.selection;
+	for (let d = $head.depth - 1; d >= 0; d--) {
+		const parent = $head.node(d);
+		if ((dir < 0 ? $head.index(d) : $head.indexAfter(d)) != (dir < 0 ? 0 : parent.childCount)) return null;
+		if (parent.type.spec.tableRole == "cell" || parent.type.spec.tableRole == "header_cell") {
+			const cellPos = $head.before(d);
+			const dirStr = axis == "vert" ? dir > 0 ? "down" : "up" : dir > 0 ? "right" : "left";
+			return view.endOfTextblock(dirStr) ? cellPos : null;
+		}
+	}
+	return null;
 }
 function domInCell(view, dom) {
-  for (; dom && dom != view.dom; dom = dom.parentNode) {
-    if (dom.nodeName == "TD" || dom.nodeName == "TH") {
-      return dom;
-    }
-  }
-  return null;
+	for (; dom && dom != view.dom; dom = dom.parentNode) if (dom.nodeName == "TD" || dom.nodeName == "TH") return dom;
+	return null;
 }
 function cellUnderMouse(view, event) {
-  const mousePos = view.posAtCoords({
-    left: event.clientX,
-    top: event.clientY
-  });
-  if (!mousePos) return null;
-  return mousePos ? cellAround(view.state.doc.resolve(mousePos.pos)) : null;
-}
-
-// src/columnresizing.ts
-new PluginKey(
-  "tableColumnResizing"
-);
-
-// src/index.ts
-function tableEditing({
-  allowTableNodeSelection = false
-} = {}) {
-  return new Plugin({
-    key: tableEditingKey,
-    // This piece of state is used to remember when a mouse-drag
-    // cell-selection is happening, so that it can continue even as
-    // transactions (which might move its anchor cell) come in.
-    state: {
-      init() {
-        return null;
-      },
-      apply(tr, cur) {
-        const set = tr.getMeta(tableEditingKey);
-        if (set != null) return set == -1 ? null : set;
-        if (cur == null || !tr.docChanged) return cur;
-        const { deleted, pos } = tr.mapping.mapResult(cur);
-        return deleted ? null : pos;
-      }
-    },
-    props: {
-      decorations: drawCellSelection,
-      handleDOMEvents: {
-        mousedown: handleMouseDown
-      },
-      createSelectionBetween(view) {
-        return tableEditingKey.getState(view.state) != null ? view.state.selection : null;
-      },
-      handleTripleClick,
-      handleKeyDown,
-      handlePaste
-    },
-    appendTransaction(_, oldState, state) {
-      return normalizeSelection(
-        state,
-        fixTables(state, oldState),
-        allowTableNodeSelection
-      );
-    }
-  });
+	const mousePos = view.posAtCoords({
+		left: event.clientX,
+		top: event.clientY
+	});
+	if (!mousePos) return null;
+	let { inside, pos } = mousePos;
+	return inside >= 0 && cellAround(view.state.doc.resolve(inside)) || cellAround(view.state.doc.resolve(pos));
+}
+
+//#endregion
+//#region src/columnresizing.ts
+/**
+* @public
+*/
+new PluginKey("tableColumnResizing");
+
+//#endregion
+//#region src/index.ts
+/**
+* Creates a [plugin](http://prosemirror.net/docs/ref/#state.Plugin)
+* that, when added to an editor, enables cell-selection, handles
+* cell-based copy/paste, and makes sure tables stay well-formed (each
+* row has the same width, and cells don't overlap).
+*
+* You should probably put this plugin near the end of your array of
+* plugins, since it handles mouse and arrow key events in tables
+* rather broadly, and other plugins, like the gap cursor or the
+* column-width dragging plugin, might want to get a turn first to
+* perform more specific behavior.
+*
+* @public
+*/
+function tableEditing({ allowTableNodeSelection = false } = {}) {
+	return new Plugin({
+		key: tableEditingKey,
+		state: {
+			init() {
+				return null;
+			},
+			apply(tr, cur) {
+				const set = tr.getMeta(tableEditingKey);
+				if (set != null) return set == -1 ? null : set;
+				if (cur == null || !tr.docChanged) return cur;
+				const { deleted, pos } = tr.mapping.mapResult(cur);
+				return deleted ? null : pos;
+			}
+		},
+		props: {
+			decorations: drawCellSelection,
+			handleDOMEvents: { mousedown: handleMouseDown$1 },
+			createSelectionBetween(view) {
+				return tableEditingKey.getState(view.state) != null ? view.state.selection : null;
+			},
+			handleTripleClick,
+			handleKeyDown,
+			handlePaste
+		},
+		appendTransaction(_, oldState, state) {
+			return normalizeSelection(state, fixTables(state, oldState), allowTableNodeSelection);
+		}
+	});
 }
 
 const getTableEditingPlugins = (tablesEnabled) => {
@@ -27419,7 +27613,7 @@ const ProsemirrorAdapter = class {
         (_e = this.view) === null || _e === void 0 ? void 0 : _e.destroy();
     }
     render() {
-        return (h(Host, { key: '96595c30eb3786d8bd8caf69b323545cb5312bbe', onFocus: this.handleFocus }, h("div", { key: '10f3cc5a289efb6c70f91771264188309143acb3', id: "editor" }), this.renderToolbar(), this.renderLinkMenu()));
+        return (h(Host, { key: '23d1370fa319f2cca982c72d09a01d69ac26008e', onFocus: this.handleFocus }, h("div", { key: 'f3be546259d31156dde04c4f6e4e8b9bdacd68aa', id: "editor" }), this.renderToolbar(), this.renderLinkMenu()));
     }
     renderToolbar() {
         if (this.actionBarItems.length === 0 || this.ui === 'no-toolbar') {