import { r as requireReact } from "./index-DQGM2Mpm.js";

// ::- Persistent data structure representing an ordered mapping from
// strings to values, with some convenient update methods.
function OrderedMap(content) {
	this.content = content;
}

OrderedMap.prototype = {
	constructor: OrderedMap,

	find: function (key) {
		for (var i = 0; i < this.content.length; i += 2) if (this.content[i] === key) return i;
		return -1;
	},

	// :: (string) → ?any
	// Retrieve the value stored under `key`, or return undefined when
	// no such key exists.
	get: function (key) {
		var found = this.find(key);
		return found == -1 ? undefined : this.content[found + 1];
	},

	// :: (string, any, ?string) → OrderedMap
	// Create a new map by replacing the value of `key` with a new
	// value, or adding a binding to the end of the map. If `newKey` is
	// given, the key of the binding will be replaced with that key.
	update: function (key, value, newKey) {
		var self = newKey && newKey != key ? this.remove(newKey) : this;
		var found = self.find(key),
			content = self.content.slice();
		if (found == -1) {
			content.push(newKey || key, value);
		} else {
			content[found + 1] = value;
			if (newKey) content[found] = newKey;
		}
		return new OrderedMap(content);
	},

	// :: (string) → OrderedMap
	// Return a map with the given key removed, if it existed.
	remove: function (key) {
		var found = this.find(key);
		if (found == -1) return this;
		var content = this.content.slice();
		content.splice(found, 2);
		return new OrderedMap(content);
	},

	// :: (string, any) → OrderedMap
	// Add a new key to the start of the map.
	addToStart: function (key, value) {
		return new OrderedMap([key, value].concat(this.remove(key).content));
	},

	// :: (string, any) → OrderedMap
	// Add a new key to the end of the map.
	addToEnd: function (key, value) {
		var content = this.remove(key).content.slice();
		content.push(key, value);
		return new OrderedMap(content);
	},

	// :: (string, string, any) → OrderedMap
	// Add a key after the given key. If `place` is not found, the new
	// key is added to the end.
	addBefore: function (place, key, value) {
		var without = this.remove(key),
			content = without.content.slice();
		var found = without.find(place);
		content.splice(found == -1 ? content.length : found, 0, key, value);
		return new OrderedMap(content);
	},

	// :: ((key: string, value: any))
	// Call the given function for each key/value pair in the map, in
	// order.
	forEach: function (f) {
		for (var i = 0; i < this.content.length; i += 2) f(this.content[i], this.content[i + 1]);
	},

	// :: (union<Object, OrderedMap>) → OrderedMap
	// Create a new map by prepending the keys in this map that don't
	// appear in `map` before the keys in `map`.
	prepend: function (map) {
		map = OrderedMap.from(map);
		if (!map.size) return this;
		return new OrderedMap(map.content.concat(this.subtract(map).content));
	},

	// :: (union<Object, OrderedMap>) → OrderedMap
	// Create a new map by appending the keys in this map that don't
	// appear in `map` after the keys in `map`.
	append: function (map) {
		map = OrderedMap.from(map);
		if (!map.size) return this;
		return new OrderedMap(this.subtract(map).content.concat(map.content));
	},

	// :: (union<Object, OrderedMap>) → OrderedMap
	// Create a map containing all the keys in this map that don't
	// appear in `map`.
	subtract: function (map) {
		var result = this;
		map = OrderedMap.from(map);
		for (var i = 0; i < map.content.length; i += 2) result = result.remove(map.content[i]);
		return result;
	},

	// :: () → Object
	// Turn ordered map into a plain object.
	toObject: function () {
		var result = {};
		this.forEach(function (key, value) {
			result[key] = value;
		});
		return result;
	},

	// :: number
	// The amount of keys in this map.
	get size() {
		return this.content.length >> 1;
	},
};

// :: (?union<Object, OrderedMap>) → OrderedMap
// Return a map with the given content. If null, create an empty
// map. If given an ordered map, return that map itself. If given an
// object, create a map from the object's properties.
OrderedMap.from = function (value) {
	if (value instanceof OrderedMap) return value;
	var content = [];
	if (value) for (var prop in value) content.push(prop, value[prop]);
	return new OrderedMap(content);
};

function findDiffStart(a, b, pos) {
	for (let i = 0; ; i++) {
		if (i == a.childCount || i == b.childCount) return a.childCount == b.childCount ? null : pos;
		let childA = a.child(i),
			childB = b.child(i);
		if (childA == childB) {
			pos += childA.nodeSize;
			continue;
		}
		if (!childA.sameMarkup(childB)) return pos;
		if (childA.isText && childA.text != childB.text) {
			let tA = childA.text,
				tB = childB.text,
				j = 0;
			for (; tA[j] == tB[j]; j++) pos++;
			if (j && j < tA.length && j < tB.length && surrogateHigh(tA.charCodeAt(j - 1)) && surrogateLow(tA.charCodeAt(j))) pos--;
			return pos;
		}
		if (childA.content.size || childB.content.size) {
			let inner = findDiffStart(childA.content, childB.content, pos + 1);
			if (inner != null) return inner;
		}
		pos += childA.nodeSize;
	}
}
function findDiffEnd(a, b, posA, posB) {
	for (let iA = a.childCount, iB = b.childCount; ; ) {
		if (iA == 0 || iB == 0) return iA == iB ? null : { a: posA, b: posB };
		let childA = a.child(--iA),
			childB = b.child(--iB),
			size = childA.nodeSize;
		if (childA == childB) {
			posA -= size;
			posB -= size;
			continue;
		}
		if (!childA.sameMarkup(childB)) return { a: posA, b: posB };
		if (childA.isText && childA.text != childB.text) {
			let tA = childA.text,
				tB = childB.text,
				iA = tA.length,
				iB = tB.length;
			while (iA > 0 && iB > 0 && tA[iA - 1] == tB[iB - 1]) {
				iA--;
				iB--;
				posA--;
				posB--;
			}
			if (iA && iB && iA < tA.length && surrogateHigh(tA.charCodeAt(iA - 1)) && surrogateLow(tA.charCodeAt(iA))) {
				posA++;
				posB++;
			}
			return { a: posA, b: posB };
		}
		if (childA.content.size || childB.content.size) {
			let inner = findDiffEnd(childA.content, childB.content, posA - 1, posB - 1);
			if (inner) return inner;
		}
		posA -= size;
		posB -= size;
	}
}
function surrogateLow(ch) {
	return ch >= 0xdc00 && ch < 0xe000;
}
function surrogateHigh(ch) {
	return ch >= 0xd800 && ch < 0xdc00;
}

/**
A fragment represents a node's collection of child nodes.

Like nodes, fragments are persistent data structures, and you
should not mutate them or their content. Rather, you create new
instances whenever needed. The API tries to make this easy.
*/
class Fragment {
	/**
    @internal
    */
	constructor(
		/**
    The child nodes in this fragment.
    */
		content,
		size,
	) {
		this.content = content;
		this.size = size || 0;
		if (size == null) for (let i = 0; i < content.length; i++) this.size += content[i].nodeSize;
	}
	/**
    Invoke a callback for all descendant nodes between the given two
    positions (relative to start of this fragment). Doesn't descend
    into a node when the callback returns `false`.
    */
	nodesBetween(from, to, f, nodeStart = 0, parent) {
		for (let i = 0, pos = 0; pos < to; i++) {
			let child = this.content[i],
				end = pos + child.nodeSize;
			if (end > from && f(child, nodeStart + pos, parent || null, i) !== false && child.content.size) {
				let start = pos + 1;
				child.nodesBetween(Math.max(0, from - start), Math.min(child.content.size, to - start), f, nodeStart + start);
			}
			pos = end;
		}
	}
	/**
    Call the given callback for every descendant node. `pos` will be
    relative to the start of the fragment. The callback may return
    `false` to prevent traversal of a given node's children.
    */
	descendants(f) {
		this.nodesBetween(0, this.size, f);
	}
	/**
    Extract the text between `from` and `to`. See the same method on
    [`Node`](https://prosemirror.net/docs/ref/#model.Node.textBetween).
    */
	textBetween(from, to, blockSeparator, leafText) {
		let text = "",
			first = true;
		this.nodesBetween(
			from,
			to,
			(node, pos) => {
				let nodeText =
					node.isText ? node.text.slice(Math.max(from, pos) - pos, to - pos)
					: !node.isLeaf ? ""
					: leafText ?
						typeof leafText === "function" ?
							leafText(node)
						:	leafText
					: node.type.spec.leafText ? node.type.spec.leafText(node)
					: "";
				if (node.isBlock && ((node.isLeaf && nodeText) || node.isTextblock) && blockSeparator) {
					if (first) first = false;
					else text += blockSeparator;
				}
				text += nodeText;
			},
			0,
		);
		return text;
	}
	/**
    Create a new fragment containing the combined content of this
    fragment and the other.
    */
	append(other) {
		if (!other.size) return this;
		if (!this.size) return other;
		let last = this.lastChild,
			first = other.firstChild,
			content = this.content.slice(),
			i = 0;
		if (last.isText && last.sameMarkup(first)) {
			content[content.length - 1] = last.withText(last.text + first.text);
			i = 1;
		}
		for (; i < other.content.length; i++) content.push(other.content[i]);
		return new Fragment(content, this.size + other.size);
	}
	/**
    Cut out the sub-fragment between the two given positions.
    */
	cut(from, to = this.size) {
		if (from == 0 && to == this.size) return this;
		let result = [],
			size = 0;
		if (to > from)
			for (let i = 0, pos = 0; pos < to; i++) {
				let child = this.content[i],
					end = pos + child.nodeSize;
				if (end > from) {
					if (pos < from || end > to) {
						if (child.isText) child = child.cut(Math.max(0, from - pos), Math.min(child.text.length, to - pos));
						else child = child.cut(Math.max(0, from - pos - 1), Math.min(child.content.size, to - pos - 1));
					}
					result.push(child);
					size += child.nodeSize;
				}
				pos = end;
			}
		return new Fragment(result, size);
	}
	/**
    @internal
    */
	cutByIndex(from, to) {
		if (from == to) return Fragment.empty;
		if (from == 0 && to == this.content.length) return this;
		return new Fragment(this.content.slice(from, to));
	}
	/**
    Create a new fragment in which the node at the given index is
    replaced by the given node.
    */
	replaceChild(index, node) {
		let current = this.content[index];
		if (current == node) return this;
		let copy = this.content.slice();
		let size = this.size + node.nodeSize - current.nodeSize;
		copy[index] = node;
		return new Fragment(copy, size);
	}
	/**
    Create a new fragment by prepending the given node to this
    fragment.
    */
	addToStart(node) {
		return new Fragment([node].concat(this.content), this.size + node.nodeSize);
	}
	/**
    Create a new fragment by appending the given node to this
    fragment.
    */
	addToEnd(node) {
		return new Fragment(this.content.concat(node), this.size + node.nodeSize);
	}
	/**
    Compare this fragment to another one.
    */
	eq(other) {
		if (this.content.length != other.content.length) return false;
		for (let i = 0; i < this.content.length; i++) if (!this.content[i].eq(other.content[i])) return false;
		return true;
	}
	/**
    The first child of the fragment, or `null` if it is empty.
    */
	get firstChild() {
		return this.content.length ? this.content[0] : null;
	}
	/**
    The last child of the fragment, or `null` if it is empty.
    */
	get lastChild() {
		return this.content.length ? this.content[this.content.length - 1] : null;
	}
	/**
    The number of child nodes in this fragment.
    */
	get childCount() {
		return this.content.length;
	}
	/**
    Get the child node at the given index. Raise an error when the
    index is out of range.
    */
	child(index) {
		let found = this.content[index];
		if (!found) throw new RangeError("Index " + index + " out of range for " + this);
		return found;
	}
	/**
    Get the child node at the given index, if it exists.
    */
	maybeChild(index) {
		return this.content[index] || null;
	}
	/**
    Call `f` for every child node, passing the node, its offset
    into this parent node, and its index.
    */
	forEach(f) {
		for (let i = 0, p = 0; i < this.content.length; i++) {
			let child = this.content[i];
			f(child, p, i);
			p += child.nodeSize;
		}
	}
	/**
    Find the first position at which this fragment and another
    fragment differ, or `null` if they are the same.
    */
	findDiffStart(other, pos = 0) {
		return findDiffStart(this, other, pos);
	}
	/**
    Find the first position, searching from the end, at which this
    fragment and the given fragment differ, or `null` if they are
    the same. Since this position will not be the same in both
    nodes, an object with two separate positions is returned.
    */
	findDiffEnd(other, pos = this.size, otherPos = other.size) {
		return findDiffEnd(this, other, pos, otherPos);
	}
	/**
    Find the index and inner offset corresponding to a given relative
    position in this fragment. The result object will be reused
    (overwritten) the next time the function is called. @internal
    */
	findIndex(pos) {
		if (pos == 0) return retIndex(0, pos);
		if (pos == this.size) return retIndex(this.content.length, pos);
		if (pos > this.size || pos < 0) throw new RangeError(`Position ${pos} outside of fragment (${this})`);
		for (let i = 0, curPos = 0; ; i++) {
			let cur = this.child(i),
				end = curPos + cur.nodeSize;
			if (end >= pos) {
				if (end == pos) return retIndex(i + 1, end);
				return retIndex(i, curPos);
			}
			curPos = end;
		}
	}
	/**
    Return a debugging string that describes this fragment.
    */
	toString() {
		return "<" + this.toStringInner() + ">";
	}
	/**
    @internal
    */
	toStringInner() {
		return this.content.join(", ");
	}
	/**
    Create a JSON-serializeable representation of this fragment.
    */
	toJSON() {
		return this.content.length ? this.content.map((n) => n.toJSON()) : null;
	}
	/**
    Deserialize a fragment from its JSON representation.
    */
	static fromJSON(schema, value) {
		if (!value) return Fragment.empty;
		if (!Array.isArray(value)) throw new RangeError("Invalid input for Fragment.fromJSON");
		return Fragment.fromArray(value.map(schema.nodeFromJSON));
	}
	/**
    Build a fragment from an array of nodes. Ensures that adjacent
    text nodes with the same marks are joined together.
    */
	static fromArray(array) {
		if (!array.length) return Fragment.empty;
		let joined,
			size = 0;
		for (let i = 0; i < array.length; i++) {
			let node = array[i];
			size += node.nodeSize;
			if (i && node.isText && array[i - 1].sameMarkup(node)) {
				if (!joined) joined = array.slice(0, i);
				joined[joined.length - 1] = node.withText(joined[joined.length - 1].text + node.text);
			} else if (joined) {
				joined.push(node);
			}
		}
		return new Fragment(joined || array, size);
	}
	/**
    Create a fragment from something that can be interpreted as a
    set of nodes. For `null`, it returns the empty fragment. For a
    fragment, the fragment itself. For a node or array of nodes, a
    fragment containing those nodes.
    */
	static from(nodes) {
		if (!nodes) return Fragment.empty;
		if (nodes instanceof Fragment) return nodes;
		if (Array.isArray(nodes)) return this.fromArray(nodes);
		if (nodes.attrs) return new Fragment([nodes], nodes.nodeSize);
		throw new RangeError("Can not convert " + nodes + " to a Fragment" + (nodes.nodesBetween ? " (looks like multiple versions of prosemirror-model were loaded)" : ""));
	}
}
/**
An empty fragment. Intended to be reused whenever a node doesn't
contain anything (rather than allocating a new empty fragment for
each leaf node).
*/
Fragment.empty = new Fragment([], 0);
const found = { index: 0, offset: 0 };
function retIndex(index, offset) {
	found.index = index;
	found.offset = offset;
	return found;
}

function compareDeep(a, b) {
	if (a === b) return true;
	if (!(a && typeof a == "object") || !(b && typeof b == "object")) return false;
	let array = Array.isArray(a);
	if (Array.isArray(b) != array) return false;
	if (array) {
		if (a.length != b.length) return false;
		for (let i = 0; i < a.length; i++) if (!compareDeep(a[i], b[i])) return false;
	} else {
		for (let p in a) if (!(p in b) || !compareDeep(a[p], b[p])) return false;
		for (let p in b) if (!(p in a)) return false;
	}
	return true;
}

/**
A mark is a piece of information that can be attached to a node,
such as it being emphasized, in code font, or a link. It has a
type and optionally a set of attributes that provide further
information (such as the target of the link). Marks are created
through a `Schema`, which controls which types exist and which
attributes they have.
*/
let Mark$1 = class Mark {
	/**
    @internal
    */
	constructor(
		/**
    The type of this mark.
    */
		type,
		/**
    The attributes associated with this mark.
    */
		attrs,
	) {
		this.type = type;
		this.attrs = attrs;
	}
	/**
    Given a set of marks, create a new set which contains this one as
    well, in the right position. If this mark is already in the set,
    the set itself is returned. If any marks that are set to be
    [exclusive](https://prosemirror.net/docs/ref/#model.MarkSpec.excludes) with this mark are present,
    those are replaced by this one.
    */
	addToSet(set) {
		let copy,
			placed = false;
		for (let i = 0; i < set.length; i++) {
			let other = set[i];
			if (this.eq(other)) return set;
			if (this.type.excludes(other.type)) {
				if (!copy) copy = set.slice(0, i);
			} else if (other.type.excludes(this.type)) {
				return set;
			} else {
				if (!placed && other.type.rank > this.type.rank) {
					if (!copy) copy = set.slice(0, i);
					copy.push(this);
					placed = true;
				}
				if (copy) copy.push(other);
			}
		}
		if (!copy) copy = set.slice();
		if (!placed) copy.push(this);
		return copy;
	}
	/**
    Remove this mark from the given set, returning a new set. If this
    mark is not in the set, the set itself is returned.
    */
	removeFromSet(set) {
		for (let i = 0; i < set.length; i++) if (this.eq(set[i])) return set.slice(0, i).concat(set.slice(i + 1));
		return set;
	}
	/**
    Test whether this mark is in the given set of marks.
    */
	isInSet(set) {
		for (let i = 0; i < set.length; i++) if (this.eq(set[i])) return true;
		return false;
	}
	/**
    Test whether this mark has the same type and attributes as
    another mark.
    */
	eq(other) {
		return this == other || (this.type == other.type && compareDeep(this.attrs, other.attrs));
	}
	/**
    Convert this mark to a JSON-serializeable representation.
    */
	toJSON() {
		let obj = { type: this.type.name };
		for (let _ in this.attrs) {
			obj.attrs = this.attrs;
			break;
		}
		return obj;
	}
	/**
    Deserialize a mark from JSON.
    */
	static fromJSON(schema, json) {
		if (!json) throw new RangeError("Invalid input for Mark.fromJSON");
		let type = schema.marks[json.type];
		if (!type) throw new RangeError(`There is no mark type ${json.type} in this schema`);
		let mark = type.create(json.attrs);
		type.checkAttrs(mark.attrs);
		return mark;
	}
	/**
    Test whether two sets of marks are identical.
    */
	static sameSet(a, b) {
		if (a == b) return true;
		if (a.length != b.length) return false;
		for (let i = 0; i < a.length; i++) if (!a[i].eq(b[i])) return false;
		return true;
	}
	/**
    Create a properly sorted mark set from null, a single mark, or an
    unsorted array of marks.
    */
	static setFrom(marks) {
		if (!marks || (Array.isArray(marks) && marks.length == 0)) return Mark.none;
		if (marks instanceof Mark) return [marks];
		let copy = marks.slice();
		copy.sort((a, b) => a.type.rank - b.type.rank);
		return copy;
	}
};
/**
The empty set of marks.
*/
Mark$1.none = [];

/**
Error type raised by [`Node.replace`](https://prosemirror.net/docs/ref/#model.Node.replace) when
given an invalid replacement.
*/
class ReplaceError extends Error {}
/**
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
both side are ‘open’ (cut through).
*/
class Slice {
	/**
    Create a slice. When specifying a non-zero open depth, you must
    make sure that there are nodes of at least that depth at the
    appropriate side of the fragment—i.e. if the fragment is an
    empty paragraph node, `openStart` and `openEnd` can't be greater
    than 1.
    
    It is not necessary for the content of open nodes to conform to
    the schema's content constraints, though it should be a valid
    start/end/middle for such a node, depending on which sides are
    open.
    */
	constructor(
		/**
    The slice's content.
    */
		content,
		/**
    The open depth at the start of the fragment.
    */
		openStart,
		/**
    The open depth at the end.
    */
		openEnd,
	) {
		this.content = content;
		this.openStart = openStart;
		this.openEnd = openEnd;
	}
	/**
    The size this slice would add when inserted into a document.
    */
	get size() {
		return this.content.size - this.openStart - this.openEnd;
	}
	/**
    @internal
    */
	insertAt(pos, 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);
	}
	/**
    @internal
    */
	removeBetween(from, to) {
		return new Slice(removeRange(this.content, from + this.openStart, to + this.openStart), this.openStart, this.openEnd);
	}
	/**
    Tests whether this slice is equal to another slice.
    */
	eq(other) {
		return this.content.eq(other.content) && this.openStart == other.openStart && this.openEnd == other.openEnd;
	}
	/**
    @internal
    */
	toString() {
		return this.content + "(" + this.openStart + "," + this.openEnd + ")";
	}
	/**
    Convert a slice to a JSON-serializable representation.
    */
	toJSON() {
		if (!this.content.size) return null;
		let json = { content: this.content.toJSON() };
		if (this.openStart > 0) json.openStart = this.openStart;
		if (this.openEnd > 0) json.openEnd = this.openEnd;
		return json;
	}
	/**
    Deserialize a slice from its JSON representation.
    */
	static fromJSON(schema, json) {
		if (!json) return Slice.empty;
		let openStart = json.openStart || 0,
			openEnd = json.openEnd || 0;
		if (typeof openStart != "number" || typeof openEnd != "number") throw new RangeError("Invalid input for Slice.fromJSON");
		return new Slice(Fragment.fromJSON(schema, json.content), openStart, openEnd);
	}
	/**
    Create a slice from a fragment by taking the maximum possible
    open value on both side of the fragment.
    */
	static maxOpen(fragment, openIsolating = true) {
		let openStart = 0,
			openEnd = 0;
		for (let n = fragment.firstChild; n && !n.isLeaf && (openIsolating || !n.type.spec.isolating); n = n.firstChild) openStart++;
		for (let n = fragment.lastChild; n && !n.isLeaf && (openIsolating || !n.type.spec.isolating); n = n.lastChild) openEnd++;
		return new Slice(fragment, openStart, openEnd);
	}
}
/**
The empty slice.
*/
Slice.empty = new Slice(Fragment.empty, 0, 0);
function removeRange(content, from, to) {
	let { index, offset } = content.findIndex(from),
		child = content.maybeChild(index);
	let { index: indexTo, offset: offsetTo } = content.findIndex(to);
	if (offset == from || child.isText) {
		if (offsetTo != to && !content.child(indexTo).isText) throw new RangeError("Removing non-flat range");
		return content.cut(0, from).append(content.cut(to));
	}
	if (index != indexTo) 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, 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, index == 0 ? openStart - 1 : 0, index == content.childCount - 1 ? openEnd - 1 : 0, child);
	return inner && content.replaceChild(index, child.copy(inner));
}
function replace($from, $to, slice) {
	if (slice.openStart > $from.depth) throw new ReplaceError("Inserted content deeper than insertion position");
	if ($from.depth - slice.openStart != $to.depth - slice.openEnd) throw new ReplaceError("Inconsistent open depths");
	return replaceOuter($from, $to, slice, 0);
}
function replaceOuter($from, $to, slice, depth) {
	let index = $from.index(depth),
		node = $from.node(depth);
	if (index == $to.index(depth) && depth < $from.depth - slice.openStart) {
		let inner = replaceOuter($from, $to, slice, depth + 1);
		return node.copy(node.content.replaceChild(index, inner));
	} else if (!slice.content.size) {
		return close(node, replaceTwoWay($from, $to, depth));
	} else if (!slice.openStart && !slice.openEnd && $from.depth == depth && $to.depth == depth) {
		// Simple, flat case
		let parent = $from.parent,
			content = parent.content;
		return close(parent, content.cut(0, $from.parentOffset).append(slice.content).append(content.cut($to.parentOffset)));
	} else {
		let { start, end } = prepareSliceForReplace(slice, $from);
		return close(node, replaceThreeWay($from, start, end, $to, depth));
	}
}
function checkJoin(main, sub) {
	if (!sub.type.compatibleContent(main.type)) throw new ReplaceError("Cannot join " + sub.type.name + " onto " + main.type.name);
}
function joinable$1($before, $after, depth) {
	let node = $before.node(depth);
	checkJoin(node, $after.node(depth));
	return node;
}
function addNode(child, target) {
	let last = target.length - 1;
	if (last >= 0 && child.isText && child.sameMarkup(target[last])) target[last] = child.withText(target[last].text + child.text);
	else target.push(child);
}
function addRange($start, $end, depth, target) {
	let node = ($end || $start).node(depth);
	let startIndex = 0,
		endIndex = $end ? $end.index(depth) : node.childCount;
	if ($start) {
		startIndex = $start.index(depth);
		if ($start.depth > depth) {
			startIndex++;
		} else if ($start.textOffset) {
			addNode($start.nodeAfter, target);
			startIndex++;
		}
	}
	for (let i = startIndex; i < endIndex; i++) addNode(node.child(i), target);
	if ($end && $end.depth == depth && $end.textOffset) addNode($end.nodeBefore, target);
}
function close(node, content) {
	if (!node.type.validContent(content)) throw new ReplaceError("Invalid content for node " + node.type.name);
	return node.copy(content);
}
function replaceThreeWay($from, $start, $end, $to, depth) {
	let openStart = $from.depth > depth && joinable$1($from, $start, depth + 1);
	let openEnd = $to.depth > depth && joinable$1($end, $to, depth + 1);
	let content = [];
	addRange(null, $from, depth, content);
	if (openStart && openEnd && $start.index(depth) == $end.index(depth)) {
		checkJoin(openStart, openEnd);
		addNode(close(openStart, replaceThreeWay($from, $start, $end, $to, depth + 1)), content);
	} else {
		if (openStart) addNode(close(openStart, replaceTwoWay($from, $start, depth + 1)), content);
		addRange($start, $end, depth, content);
		if (openEnd) addNode(close(openEnd, replaceTwoWay($end, $to, depth + 1)), content);
	}
	addRange($to, null, depth, content);
	return new Fragment(content);
}
function replaceTwoWay($from, $to, depth) {
	let content = [];
	addRange(null, $from, depth, content);
	if ($from.depth > depth) {
		let type = joinable$1($from, $to, depth + 1);
		addNode(close(type, replaceTwoWay($from, $to, depth + 1)), content);
	}
	addRange($to, null, depth, content);
	return new Fragment(content);
}
function prepareSliceForReplace(slice, $along) {
	let extra = $along.depth - slice.openStart,
		parent = $along.node(extra);
	let node = parent.copy(slice.content);
	for (let i = extra - 1; i >= 0; i--) node = $along.node(i).copy(Fragment.from(node));
	return { start: node.resolveNoCache(slice.openStart + extra), end: node.resolveNoCache(node.content.size - slice.openEnd - extra) };
}

/**
You can [_resolve_](https://prosemirror.net/docs/ref/#model.Node.resolve) a position to get more
information about it. Objects of this class represent such a
resolved position, providing various pieces of context
information, and some helper methods.

Throughout this interface, methods that take an optional `depth`
parameter will interpret undefined as `this.depth` and negative
numbers as `this.depth + value`.
*/
class ResolvedPos {
	/**
    @internal
    */
	constructor(
		/**
    The position that was resolved.
    */
		pos,
		/**
    @internal
    */
		path,
		/**
    The offset this position has into its parent node.
    */
		parentOffset,
	) {
		this.pos = pos;
		this.path = path;
		this.parentOffset = parentOffset;
		this.depth = path.length / 3 - 1;
	}
	/**
    @internal
    */
	resolveDepth(val) {
		if (val == null) return this.depth;
		if (val < 0) return this.depth + val;
		return val;
	}
	/**
    The parent node that the position points into. Note that even if
    a position points into a text node, that node is not considered
    the parent—text nodes are ‘flat’ in this model, and have no content.
    */
	get parent() {
		return this.node(this.depth);
	}
	/**
    The root node in which the position was resolved.
    */
	get doc() {
		return this.node(0);
	}
	/**
    The ancestor node at the given level. `p.node(p.depth)` is the
    same as `p.parent`.
    */
	node(depth) {
		return this.path[this.resolveDepth(depth) * 3];
	}
	/**
    The index into the ancestor at the given level. If this points
    at the 3rd node in the 2nd paragraph on the top level, for
    example, `p.index(0)` is 1 and `p.index(1)` is 2.
    */
	index(depth) {
		return this.path[this.resolveDepth(depth) * 3 + 1];
	}
	/**
    The index pointing after this position into the ancestor at the
    given level.
    */
	indexAfter(depth) {
		depth = this.resolveDepth(depth);
		return this.index(depth) + (depth == this.depth && !this.textOffset ? 0 : 1);
	}
	/**
    The (absolute) position at the start of the node at the given
    level.
    */
	start(depth) {
		depth = this.resolveDepth(depth);
		return depth == 0 ? 0 : this.path[depth * 3 - 1] + 1;
	}
	/**
    The (absolute) position at the end of the node at the given
    level.
    */
	end(depth) {
		depth = this.resolveDepth(depth);
		return this.start(depth) + this.node(depth).content.size;
	}
	/**
    The (absolute) position directly before the wrapping node at the
    given level, or, when `depth` is `this.depth + 1`, the original
    position.
    */
	before(depth) {
		depth = this.resolveDepth(depth);
		if (!depth) throw new RangeError("There is no position before the top-level node");
		return depth == this.depth + 1 ? this.pos : this.path[depth * 3 - 1];
	}
	/**
    The (absolute) position directly after the wrapping node at the
    given level, or the original position when `depth` is `this.depth + 1`.
    */
	after(depth) {
		depth = this.resolveDepth(depth);
		if (!depth) throw new RangeError("There is no position after the top-level node");
		return depth == this.depth + 1 ? this.pos : this.path[depth * 3 - 1] + this.path[depth * 3].nodeSize;
	}
	/**
    When this position points into a text node, this returns the
    distance between the position and the start of the text node.
    Will be zero for positions that point between nodes.
    */
	get textOffset() {
		return this.pos - this.path[this.path.length - 1];
	}
	/**
    Get the node directly after the position, if any. If the position
    points into a text node, only the part of that node after the
    position is returned.
    */
	get nodeAfter() {
		let parent = this.parent,
			index = this.index(this.depth);
		if (index == parent.childCount) return null;
		let dOff = this.pos - this.path[this.path.length - 1],
			child = parent.child(index);
		return dOff ? parent.child(index).cut(dOff) : child;
	}
	/**
    Get the node directly before the position, if any. If the
    position points into a text node, only the part of that node
    before the position is returned.
    */
	get nodeBefore() {
		let index = this.index(this.depth);
		let dOff = this.pos - this.path[this.path.length - 1];
		if (dOff) return this.parent.child(index).cut(0, dOff);
		return index == 0 ? null : this.parent.child(index - 1);
	}
	/**
    Get the position at the given index in the parent node at the
    given depth (which defaults to `this.depth`).
    */
	posAtIndex(index, depth) {
		depth = this.resolveDepth(depth);
		let node = this.path[depth * 3],
			pos = depth == 0 ? 0 : this.path[depth * 3 - 1] + 1;
		for (let i = 0; i < index; i++) pos += node.child(i).nodeSize;
		return pos;
	}
	/**
    Get the marks at this position, factoring in the surrounding
    marks' [`inclusive`](https://prosemirror.net/docs/ref/#model.MarkSpec.inclusive) property. If the
    position is at the start of a non-empty node, the marks of the
    node after it (if any) are returned.
    */
	marks() {
		let parent = this.parent,
			index = this.index();
		// In an empty parent, return the empty array
		if (parent.content.size == 0) return Mark$1.none;
		// When inside a text node, just return the text node's marks
		if (this.textOffset) return parent.child(index).marks;
		let main = parent.maybeChild(index - 1),
			other = parent.maybeChild(index);
		// If the `after` flag is true of there is no node before, make
		// the node after this position the main reference.
		if (!main) {
			let tmp = main;
			main = other;
			other = tmp;
		}
		// Use all marks in the main node, except those that have
		// `inclusive` set to false and are not present in the other node.
		let marks = main.marks;
		for (var i = 0; i < marks.length; i++) if (marks[i].type.spec.inclusive === false && (!other || !marks[i].isInSet(other.marks))) marks = marks[i--].removeFromSet(marks);
		return marks;
	}
	/**
    Get the marks after the current position, if any, except those
    that are non-inclusive and not present at position `$end`. This
    is mostly useful for getting the set of marks to preserve after a
    deletion. Will return `null` if this position is at the end of
    its parent node or its parent node isn't a textblock (in which
    case no marks should be preserved).
    */
	marksAcross($end) {
		let after = this.parent.maybeChild(this.index());
		if (!after || !after.isInline) return null;
		let marks = after.marks,
			next = $end.parent.maybeChild($end.index());
		for (var i = 0; i < marks.length; i++) if (marks[i].type.spec.inclusive === false && (!next || !marks[i].isInSet(next.marks))) marks = marks[i--].removeFromSet(marks);
		return marks;
	}
	/**
    The depth up to which this position and the given (non-resolved)
    position share the same parent nodes.
    */
	sharedDepth(pos) {
		for (let depth = this.depth; depth > 0; depth--) if (this.start(depth) <= pos && this.end(depth) >= pos) return depth;
		return 0;
	}
	/**
    Returns a range based on the place where this position and the
    given position diverge around block content. If both point into
    the same textblock, for example, a range around that textblock
    will be returned. If they point into different blocks, the range
    around those blocks in their shared ancestor is returned. You can
    pass in an optional predicate that will be called with a parent
    node to see if a range into that parent is acceptable.
    */
	blockRange(other = this, pred) {
		if (other.pos < this.pos) return other.blockRange(this);
		for (let d = this.depth - (this.parent.inlineContent || this.pos == other.pos ? 1 : 0); d >= 0; d--)
			if (other.pos <= this.end(d) && (!pred || pred(this.node(d)))) return new NodeRange(this, other, d);
		return null;
	}
	/**
    Query whether the given position shares the same parent node.
    */
	sameParent(other) {
		return this.pos - this.parentOffset == other.pos - other.parentOffset;
	}
	/**
    Return the greater of this and the given position.
    */
	max(other) {
		return other.pos > this.pos ? other : this;
	}
	/**
    Return the smaller of this and the given position.
    */
	min(other) {
		return other.pos < this.pos ? other : this;
	}
	/**
    @internal
    */
	toString() {
		let str = "";
		for (let i = 1; i <= this.depth; i++) str += (str ? "/" : "") + this.node(i).type.name + "_" + this.index(i - 1);
		return str + ":" + this.parentOffset;
	}
	/**
    @internal
    */
	static resolve(doc, pos) {
		if (!(pos >= 0 && pos <= doc.content.size)) throw new RangeError("Position " + pos + " out of range");
		let path = [];
		let start = 0,
			parentOffset = pos;
		for (let node = doc; ; ) {
			let { index, offset } = node.content.findIndex(parentOffset);
			let rem = parentOffset - offset;
			path.push(node, index, start + offset);
			if (!rem) break;
			node = node.child(index);
			if (node.isText) break;
			parentOffset = rem - 1;
			start += offset + 1;
		}
		return new ResolvedPos(pos, path, parentOffset);
	}
	/**
    @internal
    */
	static resolveCached(doc, pos) {
		let cache = resolveCache.get(doc);
		if (cache) {
			for (let i = 0; i < cache.elts.length; i++) {
				let elt = cache.elts[i];
				if (elt.pos == pos) return elt;
			}
		} else {
			resolveCache.set(doc, (cache = new ResolveCache()));
		}
		let result = (cache.elts[cache.i] = ResolvedPos.resolve(doc, pos));
		cache.i = (cache.i + 1) % resolveCacheSize;
		return result;
	}
}
class ResolveCache {
	constructor() {
		this.elts = [];
		this.i = 0;
	}
}
const resolveCacheSize = 12,
	resolveCache = new WeakMap();
/**
Represents a flat range of content, i.e. one that starts and
ends in the same node.
*/
class NodeRange {
	/**
    Construct a node range. `$from` and `$to` should point into the
    same node until at least the given `depth`, since a node range
    denotes an adjacent set of nodes in a single parent node.
    */
	constructor(
		/**
    A resolved position along the start of the content. May have a
    `depth` greater than this object's `depth` property, since
    these are the positions that were used to compute the range,
    not re-resolved positions directly at its boundaries.
    */
		$from,
		/**
    A position along the end of the content. See
    caveat for [`$from`](https://prosemirror.net/docs/ref/#model.NodeRange.$from).
    */
		$to,
		/**
    The depth of the node that this range points into.
    */
		depth,
	) {
		this.$from = $from;
		this.$to = $to;
		this.depth = depth;
	}
	/**
    The position at the start of the range.
    */
	get start() {
		return this.$from.before(this.depth + 1);
	}
	/**
    The position at the end of the range.
    */
	get end() {
		return this.$to.after(this.depth + 1);
	}
	/**
    The parent node that the range points into.
    */
	get parent() {
		return this.$from.node(this.depth);
	}
	/**
    The start index of the range in the parent node.
    */
	get startIndex() {
		return this.$from.index(this.depth);
	}
	/**
    The end index of the range in the parent node.
    */
	get endIndex() {
		return this.$to.indexAfter(this.depth);
	}
}

const emptyAttrs = Object.create(null);
/**
This class represents a node in the tree that makes up a
ProseMirror document. So a document is an instance of `Node`, with
children that are also instances of `Node`.

Nodes are persistent data structures. Instead of changing them, you
create new ones with the content you want. Old ones keep pointing
at the old document shape. This is made cheaper by sharing
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](https://prosemirror.net/docs/guide/#doc) for more information.
*/
class Node {
	/**
    @internal
    */
	constructor(
		/**
    The type of node that this is.
    */
		type,
		/**
    An object mapping attribute names to values. The kind of
    attributes allowed and required are
    [determined](https://prosemirror.net/docs/ref/#model.NodeSpec.attrs) by the node type.
    */
		attrs,
		// A fragment holding the node's children.
		content,
		/**
    The marks (things like whether it is emphasized or part of a
    link) applied to this node.
    */
		marks = Mark$1.none,
	) {
		this.type = type;
		this.attrs = attrs;
		this.marks = marks;
		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](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).
    */
	get nodeSize() {
		return this.isLeaf ? 1 : 2 + this.content.size;
	}
	/**
    The number of children that the node has.
    */
	get childCount() {
		return this.content.childCount;
	}
	/**
    Get the child node at the given index. Raises an error when the
    index is out of range.
    */
	child(index) {
		return this.content.child(index);
	}
	/**
    Get the child node at the given index, if it exists.
    */
	maybeChild(index) {
		return this.content.maybeChild(index);
	}
	/**
    Call `f` for every child node, passing the node, its offset
    into this parent node, and its index.
    */
	forEach(f) {
		this.content.forEach(f);
	}
	/**
    Invoke a callback for all descendant nodes recursively overlapping
    the given two positions that are relative to start of this
    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
    starting position to count from.
    */
	nodesBetween(from, to, f, startPos = 0) {
		this.content.nodesBetween(from, to, f, startPos, this);
	}
	/**
    Call the given callback for every descendant node. Doesn't
    descend into a node when the callback returns `false`.
    */
	descendants(f) {
		this.nodesBetween(0, this.content.size, f);
	}
	/**
    Concatenates all the text nodes found in this fragment and its
    children.
    */
	get textContent() {
		return this.isLeaf && this.type.spec.leafText ? this.type.spec.leafText(this) : this.textBetween(0, this.content.size, "");
	}
	/**
    Get all text between positions `from` and `to`. When
    `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.
    */
	textBetween(from, to, blockSeparator, leafText) {
		return this.content.textBetween(from, to, blockSeparator, leafText);
	}
	/**
    Returns this node's first child, or `null` if there are no
    children.
    */
	get firstChild() {
		return this.content.firstChild;
	}
	/**
    Returns this node's last child, or `null` if there are no
    children.
    */
	get lastChild() {
		return this.content.lastChild;
	}
	/**
    Test whether two nodes represent the same piece of document.
    */
	eq(other) {
		return this == other || (this.sameMarkup(other) && this.content.eq(other.content));
	}
	/**
    Compare the markup (type, attributes, and marks) of this node to
    those of another. Returns `true` if both have the same markup.
    */
	sameMarkup(other) {
		return this.hasMarkup(other.type, other.attrs, other.marks);
	}
	/**
    Check whether this node's markup correspond to the given type,
    attributes, and marks.
    */
	hasMarkup(type, attrs, marks) {
		return this.type == type && compareDeep(this.attrs, attrs || type.defaultAttrs || emptyAttrs) && Mark$1.sameSet(this.marks, marks || Mark$1.none);
	}
	/**
    Create a new node with the same markup as this node, containing
    the given content (or empty, if no content is given).
    */
	copy(content = null) {
		if (content == this.content) return this;
		return new Node(this.type, this.attrs, content, this.marks);
	}
	/**
    Create a copy of this node, with the given set of marks instead
    of the node's own marks.
    */
	mark(marks) {
		return marks == this.marks ? this : new Node(this.type, this.attrs, this.content, marks);
	}
	/**
    Create a copy of this node with only the content between the
    given positions. If `to` is not given, it defaults to the end of
    the node.
    */
	cut(from, to = this.content.size) {
		if (from == 0 && to == this.content.size) return this;
		return this.copy(this.content.cut(from, to));
	}
	/**
    Cut out the part of the document between the given positions, and
    return it as a `Slice` object.
    */
	slice(from, to = this.content.size, includeParents = false) {
		if (from == to) return Slice.empty;
		let $from = this.resolve(from),
			$to = this.resolve(to);
		let depth = includeParents ? 0 : $from.sharedDepth(to);
		let start = $from.start(depth),
			node = $from.node(depth);
		let content = node.content.cut($from.pos - start, $to.pos - start);
		return new Slice(content, $from.depth - depth, $to.depth - depth);
	}
	/**
    Replace the part of the document between the given positions with
    the given slice. The slice must 'fit', meaning its open sides
    must be able to connect to the surrounding content, and its
    content nodes must be valid children for the node they are placed
    into. If any of this is violated, an error of type
    [`ReplaceError`](https://prosemirror.net/docs/ref/#model.ReplaceError) is thrown.
    */
	replace(from, to, slice) {
		return replace(this.resolve(from), this.resolve(to), slice);
	}
	/**
    Find the node directly after the given position.
    */
	nodeAt(pos) {
		for (let node = this; ; ) {
			let { index, offset } = node.content.findIndex(pos);
			node = node.maybeChild(index);
			if (!node) return null;
			if (offset == pos || node.isText) return node;
			pos -= offset + 1;
		}
	}
	/**
    Find the (direct) child node after the given offset, if any,
    and return it along with its index and offset relative to this
    node.
    */
	childAfter(pos) {
		let { index, offset } = this.content.findIndex(pos);
		return { node: this.content.maybeChild(index), index, offset };
	}
	/**
    Find the (direct) child node before the given offset, if any,
    and return it along with its index and offset relative to this
    node.
    */
	childBefore(pos) {
		if (pos == 0) return { node: null, index: 0, offset: 0 };
		let { index, offset } = this.content.findIndex(pos);
		if (offset < pos) return { node: this.content.child(index), index, offset };
		let node = this.content.child(index - 1);
		return { node, index: index - 1, offset: offset - node.nodeSize };
	}
	/**
    Resolve the given position in the document, returning an
    [object](https://prosemirror.net/docs/ref/#model.ResolvedPos) with information about its context.
    */
	resolve(pos) {
		return ResolvedPos.resolveCached(this, pos);
	}
	/**
    @internal
    */
	resolveNoCache(pos) {
		return ResolvedPos.resolve(this, pos);
	}
	/**
    Test whether a given mark or mark type occurs in this document
    between the two given positions.
    */
	rangeHasMark(from, to, type) {
		let found = false;
		if (to > from)
			this.nodesBetween(from, to, (node) => {
				if (type.isInSet(node.marks)) found = true;
				return !found;
			});
		return found;
	}
	/**
    True when this is a block (non-inline node)
    */
	get isBlock() {
		return this.type.isBlock;
	}
	/**
    True when this is a textblock node, a block node with inline
    content.
    */
	get isTextblock() {
		return this.type.isTextblock;
	}
	/**
    True when this node allows inline content.
    */
	get inlineContent() {
		return this.type.inlineContent;
	}
	/**
    True when this is an inline node (a text node or a node that can
    appear among text).
    */
	get isInline() {
		return this.type.isInline;
	}
	/**
    True when this is a text node.
    */
	get isText() {
		return this.type.isText;
	}
	/**
    True when this is a leaf node.
    */
	get isLeaf() {
		return this.type.isLeaf;
	}
	/**
    True when this is an atom, i.e. when it does not have directly
    editable content. This is usually the same as `isLeaf`, but can
    be configured with the [`atom` property](https://prosemirror.net/docs/ref/#model.NodeSpec.atom)
    on a node's spec (typically used when the node is displayed as
    an uneditable [node view](https://prosemirror.net/docs/ref/#view.NodeView)).
    */
	get isAtom() {
		return this.type.isAtom;
	}
	/**
    Return a string representation of this node for debugging
    purposes.
    */
	toString() {
		if (this.type.spec.toDebugString) return this.type.spec.toDebugString(this);
		let name = this.type.name;
		if (this.content.size) name += "(" + this.content.toStringInner() + ")";
		return wrapMarks(this.marks, name);
	}
	/**
    Get the content match in this node at the given index.
    */
	contentMatchAt(index) {
		let match = this.type.contentMatch.matchFragment(this.content, 0, index);
		if (!match) throw new Error("Called contentMatchAt on a node with invalid content");
		return match;
	}
	/**
    Test whether replacing the range between `from` and `to` (by
    child index) with the given replacement fragment (which defaults
    to the empty fragment) would leave the node's content valid. You
    can optionally pass `start` and `end` indices into the
    replacement fragment.
    */
	canReplace(from, to, replacement = Fragment.empty, start = 0, end = replacement.childCount) {
		let one = this.contentMatchAt(from).matchFragment(replacement, start, end);
		let two = one && one.matchFragment(this.content, to);
		if (!two || !two.validEnd) return false;
		for (let i = start; i < end; i++) if (!this.type.allowsMarks(replacement.child(i).marks)) return false;
		return true;
	}
	/**
    Test whether replacing the range `from` to `to` (by index) with
    a node of the given type would leave the node's content valid.
    */
	canReplaceWith(from, to, type, marks) {
		if (marks && !this.type.allowsMarks(marks)) return false;
		let start = this.contentMatchAt(from).matchType(type);
		let end = start && start.matchFragment(this.content, to);
		return end ? end.validEnd : false;
	}
	/**
    Test whether the given node's content could be appended to this
    node. If that node is empty, this will only return true if there
    is at least one node type that can appear in both nodes (to avoid
    merging completely incompatible nodes).
    */
	canAppend(other) {
		if (other.content.size) return this.canReplace(this.childCount, this.childCount, other.content);
		else return this.type.compatibleContent(other.type);
	}
	/**
    Check whether this node and its descendants conform to the
    schema, and raise an exception when they do not.
    */
	check() {
		this.type.checkContent(this.content);
		this.type.checkAttrs(this.attrs);
		let copy = Mark$1.none;
		for (let i = 0; i < this.marks.length; i++) {
			let mark = this.marks[i];
			mark.type.checkAttrs(mark.attrs);
			copy = mark.addToSet(copy);
		}
		if (!Mark$1.sameSet(copy, this.marks)) throw new RangeError(`Invalid collection of marks for node ${this.type.name}: ${this.marks.map((m) => m.type.name)}`);
		this.content.forEach((node) => node.check());
	}
	/**
    Return a JSON-serializeable representation of this node.
    */
	toJSON() {
		let obj = { type: this.type.name };
		for (let _ in this.attrs) {
			obj.attrs = this.attrs;
			break;
		}
		if (this.content.size) obj.content = this.content.toJSON();
		if (this.marks.length) obj.marks = this.marks.map((n) => n.toJSON());
		return obj;
	}
	/**
    Deserialize a node from its JSON representation.
    */
	static fromJSON(schema, json) {
		if (!json) throw new RangeError("Invalid input for Node.fromJSON");
		let marks = undefined;
		if (json.marks) {
			if (!Array.isArray(json.marks)) throw new RangeError("Invalid mark data for Node.fromJSON");
			marks = json.marks.map(schema.markFromJSON);
		}
		if (json.type == "text") {
			if (typeof json.text != "string") throw new RangeError("Invalid text node in JSON");
			return schema.text(json.text, marks);
		}
		let content = Fragment.fromJSON(schema, json.content);
		let node = schema.nodeType(json.type).create(json.attrs, content, marks);
		node.type.checkAttrs(node.attrs);
		return node;
	}
}
Node.prototype.text = undefined;
class TextNode extends Node {
	/**
    @internal
    */
	constructor(type, attrs, content, marks) {
		super(type, attrs, null, marks);
		if (!content) throw new RangeError("Empty text nodes are not allowed");
		this.text = content;
	}
	toString() {
		if (this.type.spec.toDebugString) return this.type.spec.toDebugString(this);
		return wrapMarks(this.marks, JSON.stringify(this.text));
	}
	get textContent() {
		return this.text;
	}
	textBetween(from, to) {
		return this.text.slice(from, to);
	}
	get nodeSize() {
		return this.text.length;
	}
	mark(marks) {
		return marks == this.marks ? this : new TextNode(this.type, this.attrs, this.text, marks);
	}
	withText(text) {
		if (text == this.text) return this;
		return new TextNode(this.type, this.attrs, text, this.marks);
	}
	cut(from = 0, to = this.text.length) {
		if (from == 0 && to == this.text.length) return this;
		return this.withText(this.text.slice(from, to));
	}
	eq(other) {
		return this.sameMarkup(other) && this.text == other.text;
	}
	toJSON() {
		let base = super.toJSON();
		base.text = this.text;
		return base;
	}
}
function wrapMarks(marks, str) {
	for (let i = marks.length - 1; i >= 0; i--) str = marks[i].type.name + "(" + str + ")";
	return str;
}

/**
Instances of this class represent a match state of a node type's
[content expression](https://prosemirror.net/docs/ref/#model.NodeSpec.content), and can be used to
find out whether further content matches here, and whether a given
position is a valid end of the node.
*/
class ContentMatch {
	/**
    @internal
    */
	constructor(
		/**
    True when this match state represents a valid end of the node.
    */
		validEnd,
	) {
		this.validEnd = validEnd;
		/**
        @internal
        */
		this.next = [];
		/**
        @internal
        */
		this.wrapCache = [];
	}
	/**
    @internal
    */
	static parse(string, nodeTypes) {
		let stream = new TokenStream(string, nodeTypes);
		if (stream.next == null) return ContentMatch.empty;
		let expr = parseExpr(stream);
		if (stream.next) stream.err("Unexpected trailing text");
		let match = dfa(nfa(expr));
		checkForDeadEnds(match, stream);
		return match;
	}
	/**
    Match a node type, returning a match after that node if
    successful.
    */
	matchType(type) {
		for (let i = 0; i < this.next.length; i++) if (this.next[i].type == type) return this.next[i].next;
		return null;
	}
	/**
    Try to match a fragment. Returns the resulting match when
    successful.
    */
	matchFragment(frag, start = 0, end = frag.childCount) {
		let cur = this;
		for (let i = start; cur && i < end; i++) cur = cur.matchType(frag.child(i).type);
		return cur;
	}
	/**
    @internal
    */
	get inlineContent() {
		return this.next.length != 0 && this.next[0].type.isInline;
	}
	/**
    Get the first matching node type at this match position that can
    be generated.
    */
	get defaultType() {
		for (let i = 0; i < this.next.length; i++) {
			let { type } = this.next[i];
			if (!(type.isText || type.hasRequiredAttrs())) return type;
		}
		return null;
	}
	/**
    @internal
    */
	compatible(other) {
		for (let i = 0; i < this.next.length; i++) for (let j = 0; j < other.next.length; j++) if (this.next[i].type == other.next[j].type) return true;
		return false;
	}
	/**
    Try to match the given fragment, and if that fails, see if it can
    be made to match by inserting nodes in front of it. When
    successful, return a fragment of inserted nodes (which may be
    empty if nothing had to be inserted). When `toEnd` is true, only
    return a fragment if the resulting match goes to the end of the
    content expression.
    */
	fillBefore(after, toEnd = false, startIndex = 0) {
		let seen = [this];
		function search(match, types) {
			let finished = match.matchFragment(after, startIndex);
			if (finished && (!toEnd || finished.validEnd)) return Fragment.from(types.map((tp) => tp.createAndFill()));
			for (let i = 0; i < match.next.length; i++) {
				let { type, next } = match.next[i];
				if (!(type.isText || type.hasRequiredAttrs()) && seen.indexOf(next) == -1) {
					seen.push(next);
					let found = search(next, types.concat(type));
					if (found) return found;
				}
			}
			return null;
		}
		return search(this, []);
	}
	/**
    Find a set of wrapping node types that would allow a node of the
    given type to appear at this position. The result may be empty
    (when it fits directly) and will be null when no such wrapping
    exists.
    */
	findWrapping(target) {
		for (let i = 0; i < this.wrapCache.length; i += 2) if (this.wrapCache[i] == target) return this.wrapCache[i + 1];
		let computed = this.computeWrapping(target);
		this.wrapCache.push(target, computed);
		return computed;
	}
	/**
    @internal
    */
	computeWrapping(target) {
		let seen = Object.create(null),
			active = [{ match: this, type: null, via: null }];
		while (active.length) {
			let current = active.shift(),
				match = current.match;
			if (match.matchType(target)) {
				let result = [];
				for (let obj = current; obj.type; obj = obj.via) result.push(obj.type);
				return result.reverse();
			}
			for (let i = 0; i < match.next.length; i++) {
				let { type, next } = match.next[i];
				if (!type.isLeaf && !type.hasRequiredAttrs() && !(type.name in seen) && (!current.type || next.validEnd)) {
					active.push({ match: type.contentMatch, type, via: current });
					seen[type.name] = true;
				}
			}
		}
		return null;
	}
	/**
    The number of outgoing edges this node has in the finite
    automaton that describes the content expression.
    */
	get edgeCount() {
		return this.next.length;
	}
	/**
    Get the _n_​th outgoing edge from this node in the finite
    automaton that describes the content expression.
    */
	edge(n) {
		if (n >= this.next.length) throw new RangeError(`There's no ${n}th edge in this content match`);
		return this.next[n];
	}
	/**
    @internal
    */
	toString() {
		let seen = [];
		function scan(m) {
			seen.push(m);
			for (let i = 0; i < m.next.length; i++) if (seen.indexOf(m.next[i].next) == -1) scan(m.next[i].next);
		}
		scan(this);
		return seen
			.map((m, i) => {
				let out = i + (m.validEnd ? "*" : " ") + " ";
				for (let i = 0; i < m.next.length; i++) out += (i ? ", " : "") + m.next[i].type.name + "->" + seen.indexOf(m.next[i].next);
				return out;
			})
			.join("\n");
	}
}
/**
@internal
*/
ContentMatch.empty = new ContentMatch(true);
class TokenStream {
	constructor(string, nodeTypes) {
		this.string = string;
		this.nodeTypes = nodeTypes;
		this.inline = null;
		this.pos = 0;
		this.tokens = string.split(/\s*(?=\b|\W|$)/);
		if (this.tokens[this.tokens.length - 1] == "") this.tokens.pop();
		if (this.tokens[0] == "") this.tokens.shift();
	}
	get next() {
		return this.tokens[this.pos];
	}
	eat(tok) {
		return this.next == tok && (this.pos++ || true);
	}
	err(str) {
		throw new SyntaxError(str + " (in content expression '" + this.string + "')");
	}
}
function parseExpr(stream) {
	let exprs = [];
	do {
		exprs.push(parseExprSeq(stream));
	} while (stream.eat("|"));
	return exprs.length == 1 ? exprs[0] : { type: "choice", exprs };
}
function parseExprSeq(stream) {
	let exprs = [];
	do {
		exprs.push(parseExprSubscript(stream));
	} while (stream.next && stream.next != ")" && stream.next != "|");
	return exprs.length == 1 ? exprs[0] : { type: "seq", exprs };
}
function parseExprSubscript(stream) {
	let expr = parseExprAtom(stream);
	for (;;) {
		if (stream.eat("+")) expr = { type: "plus", expr };
		else if (stream.eat("*")) expr = { type: "star", expr };
		else if (stream.eat("?")) expr = { type: "opt", expr };
		else if (stream.eat("{")) expr = parseExprRange(stream, expr);
		else break;
	}
	return expr;
}
function parseNum(stream) {
	if (/\D/.test(stream.next)) stream.err("Expected number, got '" + stream.next + "'");
	let result = Number(stream.next);
	stream.pos++;
	return result;
}
function parseExprRange(stream, expr) {
	let min = parseNum(stream),
		max = min;
	if (stream.eat(",")) {
		if (stream.next != "}") max = parseNum(stream);
		else max = -1;
	}
	if (!stream.eat("}")) stream.err("Unclosed braced range");
	return { type: "range", min, max, expr };
}
function resolveName(stream, name) {
	let types = stream.nodeTypes,
		type = types[name];
	if (type) return [type];
	let result = [];
	for (let typeName in types) {
		let type = types[typeName];
		if (type.isInGroup(name)) result.push(type);
	}
	if (result.length == 0) stream.err("No node type or group '" + name + "' found");
	return result;
}
function parseExprAtom(stream) {
	if (stream.eat("(")) {
		let expr = parseExpr(stream);
		if (!stream.eat(")")) stream.err("Missing closing paren");
		return expr;
	} else if (!/\W/.test(stream.next)) {
		let exprs = resolveName(stream, stream.next).map((type) => {
			if (stream.inline == null) stream.inline = type.isInline;
			else if (stream.inline != type.isInline) stream.err("Mixing inline and block content");
			return { type: "name", value: type };
		});
		stream.pos++;
		return exprs.length == 1 ? exprs[0] : { type: "choice", exprs };
	} else {
		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.
function nfa(expr) {
	let nfa = [[]];
	connect(compile(expr, 0), node());
	return nfa;
	function node() {
		return nfa.push([]) - 1;
	}
	function edge(from, to, term) {
		let edge = { term, to };
		nfa[from].push(edge);
		return edge;
	}
	function connect(edges, to) {
		edges.forEach((edge) => (edge.to = to));
	}
	function compile(expr, from) {
		if (expr.type == "choice") {
			return expr.exprs.reduce((out, expr) => out.concat(compile(expr, from)), []);
		} else if (expr.type == "seq") {
			for (let i = 0; ; i++) {
				let next = compile(expr.exprs[i], from);
				if (i == expr.exprs.length - 1) return next;
				connect(next, (from = node()));
			}
		} else if (expr.type == "star") {
			let loop = node();
			edge(from, loop);
			connect(compile(expr.expr, loop), loop);
			return [edge(loop)];
		} else if (expr.type == "plus") {
			let loop = node();
			connect(compile(expr.expr, from), loop);
			connect(compile(expr.expr, loop), loop);
			return [edge(loop)];
		} else if (expr.type == "opt") {
			return [edge(from)].concat(compile(expr.expr, from));
		} else if (expr.type == "range") {
			let cur = from;
			for (let i = 0; i < expr.min; i++) {
				let next = node();
				connect(compile(expr.expr, cur), next);
				cur = next;
			}
			if (expr.max == -1) {
				connect(compile(expr.expr, cur), cur);
			} else {
				for (let i = expr.min; i < expr.max; i++) {
					let next = node();
					edge(cur, next);
					connect(compile(expr.expr, cur), next);
					cur = next;
				}
			}
			return [edge(cur)];
		} else if (expr.type == "name") {
			return [edge(from, undefined, expr.value)];
		} else {
			throw new Error("Unknown expr type");
		}
	}
}
function cmp(a, b) {
	return b - a;
}
// Get the set of nodes reachable by null edges from `node`. Omit
// nodes with only a single null-out-edge, since they may lead to
// needless duplicated nodes.
function nullFrom(nfa, node) {
	let result = [];
	scan(node);
	return result.sort(cmp);
	function scan(node) {
		let edges = nfa[node];
		if (edges.length == 1 && !edges[0].term) return scan(edges[0].to);
		result.push(node);
		for (let i = 0; i < edges.length; i++) {
			let { term, to } = edges[i];
			if (!term && result.indexOf(to) == -1) scan(to);
		}
	}
}
// Compiles an NFA as produced by `nfa` into a DFA, modeled as a set
// of state objects (`ContentMatch` instances) with transitions
// between them.
function dfa(nfa) {
	let labeled = Object.create(null);
	return explore(nullFrom(nfa, 0));
	function explore(states) {
		let out = [];
		states.forEach((node) => {
			nfa[node].forEach(({ term, to }) => {
				if (!term) return;
				let set;
				for (let i = 0; i < out.length; i++) if (out[i][0] == term) set = out[i][1];
				nullFrom(nfa, to).forEach((node) => {
					if (!set) out.push([term, (set = [])]);
					if (set.indexOf(node) == -1) set.push(node);
				});
			});
		});
		let state = (labeled[states.join(",")] = new ContentMatch(states.indexOf(nfa.length - 1) > -1));
		for (let i = 0; i < out.length; i++) {
			let states = out[i][1].sort(cmp);
			state.next.push({ type: out[i][0], next: labeled[states.join(",")] || explore(states) });
		}
		return state;
	}
}
function checkForDeadEnds(match, stream) {
	for (let i = 0, work = [match]; i < work.length; i++) {
		let state = work[i],
			dead = !state.validEnd,
			nodes = [];
		for (let j = 0; j < state.next.length; j++) {
			let { type, next } = state.next[j];
			nodes.push(type.name);
			if (dead && !(type.isText || type.hasRequiredAttrs())) dead = false;
			if (work.indexOf(next) == -1) work.push(next);
		}
		if (dead) stream.err("Only non-generatable nodes (" + nodes.join(", ") + ") in a required position (see https://prosemirror.net/docs/guide/#generatable)");
	}
}

// For node types where all attrs have a default value (or which don't
// have any attributes), build up a single reusable default attribute
// object, and use it for all nodes that don't specify specific
// attributes.
function defaultAttrs(attrs) {
	let defaults = Object.create(null);
	for (let attrName in attrs) {
		let attr = attrs[attrName];
		if (!attr.hasDefault) return null;
		defaults[attrName] = attr.default;
	}
	return defaults;
}
function computeAttrs(attrs, value) {
	let built = Object.create(null);
	for (let name in attrs) {
		let given = value && value[name];
		if (given === undefined) {
			let attr = attrs[name];
			if (attr.hasDefault) given = attr.default;
			else throw new RangeError("No value supplied for attribute " + name);
		}
		built[name] = given;
	}
	return built;
}
function checkAttrs(attrs, values, type, name) {
	for (let attr in values) if (!(attr in attrs)) throw new RangeError(`Unsupported attribute ${attr} for ${type} of type ${name}`);
	for (let attr in attrs) {
		if (attrs[attr].validate) attrs[attr].validate(values[attr]);
	}
}
function initAttrs(typeName, attrs) {
	let result = Object.create(null);
	if (attrs) for (let name in attrs) result[name] = new Attribute(typeName, name, attrs[name]);
	return result;
}
/**
Node types are objects allocated once per `Schema` and used to
[tag](https://prosemirror.net/docs/ref/#model.Node.type) `Node` instances. They contain information
about the node type, such as its name and what kind of node it
represents.
*/
let NodeType$1 = class NodeType {
	/**
    @internal
    */
	constructor(
		/**
    The name the node type has in this schema.
    */
		name,
		/**
    A link back to the `Schema` the node type belongs to.
    */
		schema,
		/**
    The spec that this type is based on
    */
		spec,
	) {
		this.name = name;
		this.schema = schema;
		this.spec = spec;
		/**
        The set of marks allowed in this node. `null` means all marks
        are allowed.
        */
		this.markSet = null;
		this.groups = spec.group ? spec.group.split(" ") : [];
		this.attrs = initAttrs(name, spec.attrs);
		this.defaultAttrs = defaultAttrs(this.attrs);
		this.contentMatch = null;
		this.inlineContent = null;
		this.isBlock = !(spec.inline || name == "text");
		this.isText = name == "text";
	}
	/**
    True if this is an inline type.
    */
	get isInline() {
		return !this.isBlock;
	}
	/**
    True if this is a textblock type, a block that contains inline
    content.
    */
	get isTextblock() {
		return this.isBlock && this.inlineContent;
	}
	/**
    True for node types that allow no content.
    */
	get isLeaf() {
		return this.contentMatch == ContentMatch.empty;
	}
	/**
    True when this node is an atom, i.e. when it does not have
    directly editable content.
    */
	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() {
		return this.spec.whitespace || (this.spec.code ? "pre" : "normal");
	}
	/**
    Tells you whether this node type has any required attributes.
    */
	hasRequiredAttrs() {
		for (let n in this.attrs) if (this.attrs[n].isRequired) return true;
		return false;
	}
	/**
    Indicates whether this node allows some of the same content as
    the given node type.
    */
	compatibleContent(other) {
		return this == other || this.contentMatch.compatible(other.contentMatch);
	}
	/**
    @internal
    */
	computeAttrs(attrs) {
		if (!attrs && this.defaultAttrs) return this.defaultAttrs;
		else return computeAttrs(this.attrs, attrs);
	}
	/**
    Create a `Node` of this type. The given attributes are
    checked and defaulted (you can pass `null` to use the type's
    defaults entirely, if no required attributes exist). `content`
    may be a `Fragment`, a node, an array of nodes, or
    `null`. Similarly `marks` may be `null` to default to the empty
    set of marks.
    */
	create(attrs = null, content, marks) {
		if (this.isText) throw new Error("NodeType.create can't construct text nodes");
		return new Node(this, this.computeAttrs(attrs), Fragment.from(content), Mark$1.setFrom(marks));
	}
	/**
    Like [`create`](https://prosemirror.net/docs/ref/#model.NodeType.create), but check the given content
    against the node type's content restrictions, and throw an error
    if it doesn't match.
    */
	createChecked(attrs = null, content, marks) {
		content = Fragment.from(content);
		this.checkContent(content);
		return new Node(this, this.computeAttrs(attrs), content, Mark$1.setFrom(marks));
	}
	/**
    Like [`create`](https://prosemirror.net/docs/ref/#model.NodeType.create), but see if it is
    necessary to add nodes to the start or end of the given fragment
    to make it fit the node. If no fitting wrapping can be found,
    return null. Note that, due to the fact that required nodes can
    always be created, this will always succeed if you pass null or
    `Fragment.empty` as content.
    */
	createAndFill(attrs = null, content, marks) {
		attrs = this.computeAttrs(attrs);
		content = Fragment.from(content);
		if (content.size) {
			let before = this.contentMatch.fillBefore(content);
			if (!before) return null;
			content = before.append(content);
		}
		let matched = this.contentMatch.matchFragment(content);
		let after = matched && matched.fillBefore(Fragment.empty, true);
		if (!after) return null;
		return new Node(this, attrs, content.append(after), Mark$1.setFrom(marks));
	}
	/**
    Returns true if the given fragment is valid content for this node
    type.
    */
	validContent(content) {
		let result = this.contentMatch.matchFragment(content);
		if (!result || !result.validEnd) return false;
		for (let i = 0; i < content.childCount; i++) if (!this.allowsMarks(content.child(i).marks)) return false;
		return true;
	}
	/**
    Throws a RangeError if the given fragment is not valid content for this
    node type.
    @internal
    */
	checkContent(content) {
		if (!this.validContent(content)) throw new RangeError(`Invalid content for node ${this.name}: ${content.toString().slice(0, 50)}`);
	}
	/**
    @internal
    */
	checkAttrs(attrs) {
		checkAttrs(this.attrs, attrs, "node", this.name);
	}
	/**
    Check whether the given mark type is allowed in this node.
    */
	allowsMarkType(markType) {
		return this.markSet == null || this.markSet.indexOf(markType) > -1;
	}
	/**
    Test whether the given set of marks are allowed in this node.
    */
	allowsMarks(marks) {
		if (this.markSet == null) return true;
		for (let i = 0; i < marks.length; i++) if (!this.allowsMarkType(marks[i].type)) return false;
		return true;
	}
	/**
    Removes the marks that are not allowed in this node from the given set.
    */
	allowedMarks(marks) {
		if (this.markSet == null) return marks;
		let copy;
		for (let i = 0; i < marks.length; i++) {
			if (!this.allowsMarkType(marks[i].type)) {
				if (!copy) copy = marks.slice(0, i);
			} else if (copy) {
				copy.push(marks[i]);
			}
		}
		return (
			!copy ? marks
			: copy.length ? copy
			: Mark$1.none
		);
	}
	/**
    @internal
    */
	static compile(nodes, schema) {
		let result = Object.create(null);
		nodes.forEach((name, spec) => (result[name] = new NodeType(name, schema, spec)));
		let topType = schema.spec.topNode || "doc";
		if (!result[topType]) throw new RangeError("Schema is missing its top node type ('" + topType + "')");
		if (!result.text) throw new RangeError("Every schema needs a 'text' type");
		for (let _ in result.text.attrs) throw new RangeError("The text node type should not have attributes");
		return result;
	}
};
function validateType(typeName, attrName, type) {
	let types = type.split("|");
	return (value) => {
		let name = value === null ? "null" : typeof value;
		if (types.indexOf(name) < 0) throw new RangeError(`Expected value of type ${types} for attribute ${attrName} on type ${typeName}, got ${name}`);
	};
}
// Attribute descriptors
class Attribute {
	constructor(typeName, attrName, options) {
		this.hasDefault = Object.prototype.hasOwnProperty.call(options, "default");
		this.default = options.default;
		this.validate = typeof options.validate == "string" ? validateType(typeName, attrName, options.validate) : options.validate;
	}
	get isRequired() {
		return !this.hasDefault;
	}
}
// Marks
/**
Like nodes, marks (which are associated with nodes to signify
things like emphasis or being part of a link) are
[tagged](https://prosemirror.net/docs/ref/#model.Mark.type) with type objects, which are
instantiated once per `Schema`.
*/
class MarkType {
	/**
    @internal
    */
	constructor(
		/**
    The name of the mark type.
    */
		name,
		/**
    @internal
    */
		rank,
		/**
    The schema that this mark type instance is part of.
    */
		schema,
		/**
    The spec on which the type is based.
    */
		spec,
	) {
		this.name = name;
		this.rank = rank;
		this.schema = schema;
		this.spec = spec;
		this.attrs = initAttrs(name, spec.attrs);
		this.excluded = null;
		let defaults = defaultAttrs(this.attrs);
		this.instance = defaults ? new Mark$1(this, defaults) : null;
	}
	/**
    Create a mark of this type. `attrs` may be `null` or an object
    containing only some of the mark's attributes. The others, if
    they have defaults, will be added.
    */
	create(attrs = null) {
		if (!attrs && this.instance) return this.instance;
		return new Mark$1(this, computeAttrs(this.attrs, attrs));
	}
	/**
    @internal
    */
	static compile(marks, schema) {
		let result = Object.create(null),
			rank = 0;
		marks.forEach((name, spec) => (result[name] = new MarkType(name, rank++, schema, spec)));
		return result;
	}
	/**
    When there is a mark of this type in the given set, a new set
    without it is returned. Otherwise, the input set is returned.
    */
	removeFromSet(set) {
		for (var i = 0; i < set.length; i++)
			if (set[i].type == this) {
				set = set.slice(0, i).concat(set.slice(i + 1));
				i--;
			}
		return set;
	}
	/**
    Tests whether there is a mark of this type in the given set.
    */
	isInSet(set) {
		for (let i = 0; i < set.length; i++) if (set[i].type == this) return set[i];
	}
	/**
    @internal
    */
	checkAttrs(attrs) {
		checkAttrs(this.attrs, attrs, "mark", this.name);
	}
	/**
    Queries whether a given mark type is
    [excluded](https://prosemirror.net/docs/ref/#model.MarkSpec.excludes) by this one.
    */
	excludes(other) {
		return this.excluded.indexOf(other) > -1;
	}
}
/**
A document schema. Holds [node](https://prosemirror.net/docs/ref/#model.NodeType) and [mark
type](https://prosemirror.net/docs/ref/#model.MarkType) objects for the nodes and marks that may
occur in conforming documents, and provides functionality for
creating and deserializing such documents.

When given, the type parameters provide the names of the nodes and
marks in this schema.
*/
class Schema {
	/**
    Construct a schema from a schema [specification](https://prosemirror.net/docs/ref/#model.SchemaSpec).
    */
	constructor(spec) {
		/**
        The [linebreak
        replacement](https://prosemirror.net/docs/ref/#model.NodeSpec.linebreakReplacement) node defined
        in this schema, if any.
        */
		this.linebreakReplacement = null;
		/**
        An object for storing whatever values modules may want to
        compute and cache per schema. (If you want to store something
        in it, try to use property names unlikely to clash.)
        */
		this.cached = Object.create(null);
		let instanceSpec = (this.spec = {});
		for (let prop in spec) instanceSpec[prop] = spec[prop];
		((instanceSpec.nodes = OrderedMap.from(spec.nodes)), (instanceSpec.marks = OrderedMap.from(spec.marks || {})), (this.nodes = NodeType$1.compile(this.spec.nodes, this)));
		this.marks = MarkType.compile(this.spec.marks, this);
		let contentExprCache = Object.create(null);
		for (let prop in this.nodes) {
			if (prop in this.marks) throw new RangeError(prop + " can not be both a node and a mark");
			let type = this.nodes[prop],
				contentExpr = type.spec.content || "",
				markExpr = type.spec.marks;
			type.contentMatch = contentExprCache[contentExpr] || (contentExprCache[contentExpr] = ContentMatch.parse(contentExpr, this.nodes));
			type.inlineContent = type.contentMatch.inlineContent;
			if (type.spec.linebreakReplacement) {
				if (this.linebreakReplacement) throw new RangeError("Multiple linebreak nodes defined");
				if (!type.isInline || !type.isLeaf) throw new RangeError("Linebreak replacement nodes must be inline leaf nodes");
				this.linebreakReplacement = type;
			}
			type.markSet =
				markExpr == "_" ? null
				: markExpr ? gatherMarks(this, markExpr.split(" "))
				: markExpr == "" || !type.inlineContent ? []
				: null;
		}
		for (let prop in this.marks) {
			let type = this.marks[prop],
				excl = type.spec.excludes;
			type.excluded =
				excl == null ? [type]
				: excl == "" ? []
				: gatherMarks(this, excl.split(" "));
		}
		this.nodeFromJSON = (json) => Node.fromJSON(this, json);
		this.markFromJSON = (json) => Mark$1.fromJSON(this, json);
		this.topNodeType = this.nodes[this.spec.topNode || "doc"];
		this.cached.wrappings = Object.create(null);
	}
	/**
    Create a node in this schema. The `type` may be a string or a
    `NodeType` instance. Attributes will be extended with defaults,
    `content` may be a `Fragment`, `null`, a `Node`, or an array of
    nodes.
    */
	node(type, attrs = null, content, marks) {
		if (typeof type == "string") type = this.nodeType(type);
		else if (!(type instanceof NodeType$1)) throw new RangeError("Invalid node type: " + type);
		else if (type.schema != this) throw new RangeError("Node type from different schema used (" + type.name + ")");
		return type.createChecked(attrs, content, marks);
	}
	/**
    Create a text node in the schema. Empty text nodes are not
    allowed.
    */
	text(text, marks) {
		let type = this.nodes.text;
		return new TextNode(type, type.defaultAttrs, text, Mark$1.setFrom(marks));
	}
	/**
    Create a mark with the given type and attributes.
    */
	mark(type, attrs) {
		if (typeof type == "string") type = this.marks[type];
		return type.create(attrs);
	}
	/**
    @internal
    */
	nodeType(name) {
		let found = this.nodes[name];
		if (!found) throw new RangeError("Unknown node type: " + name);
		return found;
	}
}
function gatherMarks(schema, marks) {
	let found = [];
	for (let i = 0; i < marks.length; i++) {
		let name = marks[i],
			mark = schema.marks[name],
			ok = mark;
		if (mark) {
			found.push(mark);
		} else {
			for (let prop in schema.marks) {
				let mark = schema.marks[prop];
				if (name == "_" || (mark.spec.group && mark.spec.group.split(" ").indexOf(name) > -1)) found.push((ok = mark));
			}
		}
		if (!ok) throw new SyntaxError("Unknown mark type: '" + marks[i] + "'");
	}
	return found;
}

function isTagRule(rule) {
	return rule.tag != null;
}
function isStyleRule(rule) {
	return rule.style != null;
}
/**
A DOM parser represents a strategy for parsing DOM content into a
ProseMirror document conforming to a given schema. Its behavior is
defined by an array of [rules](https://prosemirror.net/docs/ref/#model.ParseRule).
*/
class DOMParser {
	/**
    Create a parser that targets the given schema, using the given
    parsing rules.
    */
	constructor(
		/**
    The schema into which the parser parses.
    */
		schema,
		/**
    The set of [parse rules](https://prosemirror.net/docs/ref/#model.ParseRule) that the parser
    uses, in order of precedence.
    */
		rules,
	) {
		this.schema = schema;
		this.rules = rules;
		/**
        @internal
        */
		this.tags = [];
		/**
        @internal
        */
		this.styles = [];
		let matchedStyles = (this.matchedStyles = []);
		rules.forEach((rule) => {
			if (isTagRule(rule)) {
				this.tags.push(rule);
			} else if (isStyleRule(rule)) {
				let prop = /[^=]*/.exec(rule.style)[0];
				if (matchedStyles.indexOf(prop) < 0) matchedStyles.push(prop);
				this.styles.push(rule);
			}
		});
		// Only normalize list elements when lists in the schema can't directly contain themselves
		this.normalizeLists = !this.tags.some((r) => {
			if (!/^(ul|ol)\b/.test(r.tag) || !r.node) return false;
			let node = schema.nodes[r.node];
			return node.contentMatch.matchType(node);
		});
	}
	/**
    Parse a document from the content of a DOM node.
    */
	parse(dom, options = {}) {
		let context = new ParseContext(this, options, false);
		context.addAll(dom, Mark$1.none, options.from, options.to);
		return context.finish();
	}
	/**
    Parses the content of the given DOM node, like
    [`parse`](https://prosemirror.net/docs/ref/#model.DOMParser.parse), and takes the same set of
    options. But unlike that method, which produces a whole node,
    this one returns a slice that is open at the sides, meaning that
    the schema constraints aren't applied to the start of nodes to
    the left of the input and the end of nodes at the end.
    */
	parseSlice(dom, options = {}) {
		let context = new ParseContext(this, options, true);
		context.addAll(dom, Mark$1.none, options.from, options.to);
		return Slice.maxOpen(context.finish());
	}
	/**
    @internal
    */
	matchTag(dom, context, after) {
		for (let i = after ? this.tags.indexOf(after) + 1 : 0; i < this.tags.length; i++) {
			let rule = this.tags[i];
			if (matches(dom, rule.tag) && (rule.namespace === undefined || dom.namespaceURI == rule.namespace) && (!rule.context || context.matchesContext(rule.context))) {
				if (rule.getAttrs) {
					let result = rule.getAttrs(dom);
					if (result === false) continue;
					rule.attrs = result || undefined;
				}
				return rule;
			}
		}
	}
	/**
    @internal
    */
	matchStyle(prop, value, context, after) {
		for (let i = after ? this.styles.indexOf(after) + 1 : 0; i < this.styles.length; i++) {
			let rule = this.styles[i],
				style = rule.style;
			if (
				style.indexOf(prop) != 0 ||
				(rule.context && !context.matchesContext(rule.context)) ||
				// Test that the style string either precisely matches the prop,
				// or has an '=' sign after the prop, followed by the given
				// value.
				(style.length > prop.length && (style.charCodeAt(prop.length) != 61 || style.slice(prop.length + 1) != value))
			)
				continue;
			if (rule.getAttrs) {
				let result = rule.getAttrs(value);
				if (result === false) continue;
				rule.attrs = result || undefined;
			}
			return rule;
		}
	}
	/**
    @internal
    */
	static schemaRules(schema) {
		let result = [];
		function insert(rule) {
			let priority = rule.priority == null ? 50 : rule.priority,
				i = 0;
			for (; i < result.length; i++) {
				let next = result[i],
					nextPriority = next.priority == null ? 50 : next.priority;
				if (nextPriority < priority) break;
			}
			result.splice(i, 0, rule);
		}
		for (let name in schema.marks) {
			let rules = schema.marks[name].spec.parseDOM;
			if (rules)
				rules.forEach((rule) => {
					insert((rule = copy(rule)));
					if (!(rule.mark || rule.ignore || rule.clearMark)) rule.mark = name;
				});
		}
		for (let name in schema.nodes) {
			let rules = schema.nodes[name].spec.parseDOM;
			if (rules)
				rules.forEach((rule) => {
					insert((rule = copy(rule)));
					if (!(rule.node || rule.ignore || rule.mark)) rule.node = name;
				});
		}
		return result;
	}
	/**
    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.GenericParseRule.priority).
    */
	static fromSchema(schema) {
		return schema.cached.domParser || (schema.cached.domParser = new DOMParser(schema, DOMParser.schemaRules(schema)));
	}
}
const blockTags = {
	address: true,
	article: true,
	aside: true,
	blockquote: true,
	canvas: true,
	dd: true,
	div: true,
	dl: true,
	fieldset: true,
	figcaption: true,
	figure: true,
	footer: true,
	form: true,
	h1: true,
	h2: true,
	h3: true,
	h4: true,
	h5: true,
	h6: true,
	header: true,
	hgroup: true,
	hr: true,
	li: true,
	noscript: true,
	ol: true,
	output: true,
	p: true,
	pre: true,
	section: true,
	table: true,
	tfoot: true,
	ul: true,
};
const ignoreTags = {
	head: true,
	noscript: true,
	object: true,
	script: true,
	style: true,
	title: true,
};
const listTags = { ol: true, ul: true };
// Using a bitfield for node context options
const OPT_PRESERVE_WS = 1,
	OPT_PRESERVE_WS_FULL = 2,
	OPT_OPEN_LEFT = 4;
function wsOptionsFor(type, preserveWhitespace, base) {
	if (preserveWhitespace != null) return (preserveWhitespace ? OPT_PRESERVE_WS : 0) | (preserveWhitespace === "full" ? OPT_PRESERVE_WS_FULL : 0);
	return type && type.whitespace == "pre" ? OPT_PRESERVE_WS | OPT_PRESERVE_WS_FULL : base & ~OPT_OPEN_LEFT;
}
class NodeContext {
	constructor(type, attrs, marks, solid, match, options) {
		this.type = type;
		this.attrs = attrs;
		this.marks = marks;
		this.solid = solid;
		this.options = options;
		this.content = [];
		// Marks applied to the node's children
		this.activeMarks = Mark$1.none;
		this.match = match || (options & OPT_OPEN_LEFT ? null : type.contentMatch);
	}
	findWrapping(node) {
		if (!this.match) {
			if (!this.type) return [];
			let fill = this.type.contentMatch.fillBefore(Fragment.from(node));
			if (fill) {
				this.match = this.type.contentMatch.matchFragment(fill);
			} else {
				let start = this.type.contentMatch,
					wrap;
				if ((wrap = start.findWrapping(node.type))) {
					this.match = start;
					return wrap;
				} else {
					return null;
				}
			}
		}
		return this.match.findWrapping(node.type);
	}
	finish(openEnd) {
		if (!(this.options & OPT_PRESERVE_WS)) {
			// Strip trailing whitespace
			let last = this.content[this.content.length - 1],
				m;
			if (last && last.isText && (m = /[ \t\r\n\u000c]+$/.exec(last.text))) {
				let text = last;
				if (last.text.length == m[0].length) this.content.pop();
				else this.content[this.content.length - 1] = text.withText(text.text.slice(0, text.text.length - m[0].length));
			}
		}
		let content = Fragment.from(this.content);
		if (!openEnd && this.match) content = content.append(this.match.fillBefore(Fragment.empty, true));
		return this.type ? this.type.create(this.attrs, content, this.marks) : content;
	}
	inlineContext(node) {
		if (this.type) return this.type.inlineContent;
		if (this.content.length) return this.content[0].isInline;
		return node.parentNode && !blockTags.hasOwnProperty(node.parentNode.nodeName.toLowerCase());
	}
}
class ParseContext {
	constructor(
		// The parser we are using.
		parser,
		// The options passed to this parse.
		options,
		isOpen,
	) {
		this.parser = parser;
		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) topContext = new NodeContext(topNode.type, topNode.attrs, Mark$1.none, true, options.topMatch || topNode.type.contentMatch, topOptions);
		else if (isOpen) topContext = new NodeContext(null, null, Mark$1.none, true, null, topOptions);
		else topContext = new NodeContext(parser.schema.topNodeType, null, Mark$1.none, true, null, topOptions);
		this.nodes = [topContext];
		this.find = options.findPositions;
		this.needsBlock = false;
	}
	get top() {
		return this.nodes[this.open];
	}
	// Add a DOM node to the content. Text is inserted as text node,
	// otherwise, the node is passed to `addElement` or, if it has a
	// `style` attribute, `addElementWithStyles`.
	addDOM(dom, marks) {
		if (dom.nodeType == 3) this.addTextNode(dom, marks);
		else if (dom.nodeType == 1) this.addElement(dom, marks);
	}
	addTextNode(dom, marks) {
		let value = dom.nodeValue;
		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 (!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
				// leading space.
				if (/^[ \t\r\n\u000c]/.test(value) && this.open == this.nodes.length - 1) {
					let nodeBefore = top.content[top.content.length - 1];
					let domNodeBefore = dom.previousSibling;
					if (!nodeBefore || (domNodeBefore && domNodeBefore.nodeName == "BR") || (nodeBefore.isText && /[ \t\r\n\u000c]$/.test(nodeBefore.text))) value = value.slice(1);
				}
			} 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|\r/g, " ");
			}
			if (value) this.insertNode(schema.text(value), marks, !/\S/.test(value));
			this.findInText(dom);
		} else {
			this.findInside(dom);
		}
	}
	// 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));
		out: if (rule ? rule.ignore : ignoreTags.hasOwnProperty(name)) {
			this.findInside(dom);
			this.ignoreFallback(dom, marks);
		} else if (!rule || rule.skip || rule.closeParent) {
			if (rule && rule.closeParent) this.open = Math.max(0, this.open - 1);
			else if (rule && rule.skip.nodeType) dom = rule.skip;
			let sync,
				oldNeedsBlock = this.needsBlock;
			if (blockTags.hasOwnProperty(name)) {
				if (top.content.length && top.content[0].isInline && this.open) {
					this.open--;
					top = this.top;
				}
				sync = true;
				if (!top.type) this.needsBlock = true;
			} else if (!dom.firstChild) {
				this.leafFallback(dom, marks);
				break out;
			}
			let innerMarks = rule && rule.skip ? marks : this.readStyles(dom, marks);
			if (innerMarks) this.addAll(dom, innerMarks);
			if (sync) this.sync(top);
			this.needsBlock = oldNeedsBlock;
		} else {
			let innerMarks = this.readStyles(dom, marks);
			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) {
		if (dom.nodeName == "BR" && this.top.type && this.top.type.inlineContent) this.addTextNode(dom.ownerDocument.createTextNode("\n"), marks);
	}
	// Called for ignored nodes
	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, 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
	// styles had a rule with `ignore` set.
	readStyles(dom, marks) {
		let styles = dom.style;
		// Because many properties will only show up in 'normalized' form
		// in `style.item` (i.e. text-decoration becomes
		// text-decoration-line, text-decoration-color, etc), we directly
		// query the styles mentioned in our rules instead of iterating
		// over the items.
		if (styles && styles.length)
			for (let i = 0; i < this.parser.matchedStyles.length; i++) {
				let name = this.parser.matchedStyles[i],
					value = styles.getPropertyValue(name);
				if (value)
					for (let after = undefined; ; ) {
						let rule = this.parser.matchStyle(name, value, this, after);
						if (!rule) break;
						if (rule.ignore) return null;
						if (rule.clearMark) marks = marks.filter((m) => !rule.clearMark(m));
						else marks = marks.concat(this.parser.schema.marks[rule.mark].create(rule.attrs));
						if (rule.consuming === false) after = rule;
						else break;
					}
			}
		return marks;
	}
	// Look up a handler for the given node. If none are found, return
	// false. Otherwise, apply it, use its return value to drive the way
	// the node's content is wrapped, and return true.
	addElementByRule(dom, rule, marks, continueAfter) {
		let sync, nodeType;
		if (rule.node) {
			nodeType = this.parser.schema.nodes[rule.node];
			if (!nodeType.isLeaf) {
				let inner = this.enter(nodeType, rule.attrs || null, marks, rule.preserveWhitespace);
				if (inner) {
					sync = true;
					marks = inner;
				}
			} else if (!this.insertNode(nodeType.create(rule.attrs), marks, dom.nodeName == "BR")) {
				this.leafFallback(dom, marks);
			}
		} else {
			let markType = this.parser.schema.marks[rule.mark];
			marks = marks.concat(markType.create(rule.attrs));
		}
		let startIn = this.top;
		if (nodeType && nodeType.isLeaf) {
			this.findInside(dom);
		} else if (continueAfter) {
			this.addElement(dom, marks, continueAfter);
		} else if (rule.getContent) {
			this.findInside(dom);
			rule.getContent(dom, this.parser.schema).forEach((node) => this.insertNode(node, marks, false));
		} else {
			let contentDOM = dom;
			if (typeof rule.contentElement == "string") contentDOM = dom.querySelector(rule.contentElement);
			else if (typeof rule.contentElement == "function") contentDOM = rule.contentElement(dom);
			else if (rule.contentElement) contentDOM = rule.contentElement;
			this.findAround(dom, contentDOM, true);
			this.addAll(contentDOM, marks);
			this.findAround(dom, contentDOM, false);
		}
		if (sync && this.sync(startIn)) this.open--;
	}
	// Add all child nodes between `startIndex` and `endIndex` (or the
	// whole node, if not given). If `sync` is passed, use it to
	// synchronize after every block element.
	addAll(parent, marks, startIndex, endIndex) {
		let index = startIndex || 0;
		for (let dom = startIndex ? parent.childNodes[startIndex] : parent.firstChild, end = endIndex == null ? null : parent.childNodes[endIndex]; dom != end; dom = dom.nextSibling, ++index) {
			this.findAtPoint(parent, index);
			this.addDOM(dom, marks);
		}
		this.findAtPoint(parent, index);
	}
	// 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, cautious) {
		let route, sync;
		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 + penalty)) {
				route = found;
				sync = cx;
				if (!found.length) break;
			}
			if (cx.solid) {
				if (cautious) break;
				penalty += 2;
			}
		}
		if (!route) return null;
		this.sync(sync);
		for (let i = 0; i < route.length; i++) marks = this.enterInner(route[i], null, marks, false);
		return marks;
	}
	// Try to insert the given node, adjusting the context when needed.
	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, cautious);
		if (innerMarks) {
			this.closeExtra();
			let top = this.top;
			if (top.match) top.match = top.match.matchType(node.type);
			let nodeMarks = Mark$1.none;
			for (let m of innerMarks.concat(node.marks)) if (top.type ? top.type.allowsMarkType(m.type) : markMayApply(m.type, node.type)) nodeMarks = m.addToSet(nodeMarks);
			top.content.push(node.mark(nodeMarks));
			return true;
		}
		return false;
	}
	// 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, false);
		if (innerMarks) innerMarks = this.enterInner(type, attrs, marks, true, preserveWS);
		return innerMarks;
	}
	// Open a node of the given type
	enterInner(type, attrs, marks, solid = false, preserveWS) {
		this.closeExtra();
		let top = this.top;
		top.match = top.match && top.match.matchType(type);
		let options = wsOptionsFor(type, preserveWS, top.options);
		if (top.options & OPT_OPEN_LEFT && top.content.length == 0) options |= OPT_OPEN_LEFT;
		let applyMarks = Mark$1.none;
		marks = marks.filter((m) => {
			if (top.type ? top.type.allowsMarkType(m.type) : markMayApply(m.type, type)) {
				applyMarks = m.addToSet(applyMarks);
				return false;
			}
			return true;
		});
		this.nodes.push(new NodeContext(type, attrs, applyMarks, solid, null, options));
		this.open++;
		return marks;
	}
	// Make sure all nodes above this.open are finished and added to
	// their parents
	closeExtra(openEnd = false) {
		let i = this.nodes.length - 1;
		if (i > this.open) {
			for (; i > this.open; i--) this.nodes[i - 1].content.push(this.nodes[i].finish(openEnd));
			this.nodes.length = this.open + 1;
		}
	}
	finish() {
		this.open = 0;
		this.closeExtra(this.isOpen);
		return this.nodes[0].finish(!!(this.isOpen || this.options.topOpen));
	}
	sync(to) {
		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() {
		this.closeExtra();
		let pos = 0;
		for (let i = this.open; i >= 0; i--) {
			let content = this.nodes[i].content;
			for (let j = content.length - 1; j >= 0; j--) pos += content[j].nodeSize;
			if (i) pos++;
		}
		return pos;
	}
	findAtPoint(parent, offset) {
		if (this.find)
			for (let i = 0; i < this.find.length; i++) {
				if (this.find[i].node == parent && this.find[i].offset == offset) this.find[i].pos = this.currentPos;
			}
	}
	findInside(parent) {
		if (this.find)
			for (let i = 0; i < this.find.length; i++) {
				if (this.find[i].pos == null && parent.nodeType == 1 && parent.contains(this.find[i].node)) this.find[i].pos = this.currentPos;
			}
	}
	findAround(parent, content, before) {
		if (parent != content && this.find)
			for (let i = 0; i < this.find.length; i++) {
				if (this.find[i].pos == null && parent.nodeType == 1 && parent.contains(this.find[i].node)) {
					let pos = content.compareDocumentPosition(this.find[i].node);
					if (pos & (before ? 2 : 4)) this.find[i].pos = this.currentPos;
				}
			}
	}
	findInText(textNode) {
		if (this.find)
			for (let i = 0; i < this.find.length; i++) {
				if (this.find[i].node == textNode) this.find[i].pos = this.currentPos - (textNode.nodeValue.length - this.find[i].offset);
			}
	}
	// Determines whether the given context string matches this context.
	matchesContext(context) {
		if (context.indexOf("|") > -1) return context.split(/\s*\|\s*/).some(this.matchesContext, this);
		let parts = context.split("/");
		let option = this.options.context;
		let useRoot = !this.isOpen && (!option || option.parent.type == this.nodes[0].type);
		let minDepth = -(option ? option.depth + 1 : 0) + (useRoot ? 0 : 1);
		let match = (i, depth) => {
			for (; i >= 0; i--) {
				let part = parts[i];
				if (part == "") {
					if (i == parts.length - 1 || i == 0) continue;
					for (; depth >= minDepth; depth--) if (match(i - 1, depth)) return true;
					return false;
				} else {
					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.isInGroup(part))) return false;
					depth--;
				}
			}
			return true;
		};
		return match(parts.length - 1, this.open);
	}
	textblockFromContext() {
		let $context = this.options.context;
		if ($context)
			for (let d = $context.depth; d >= 0; d--) {
				let deflt = $context.node(d).contentMatchAt($context.indexAfter(d)).defaultType;
				if (deflt && deflt.isTextblock && deflt.defaultAttrs) return deflt;
			}
		for (let name in this.parser.schema.nodes) {
			let type = this.parser.schema.nodes[name];
			if (type.isTextblock && type.defaultAttrs) return type;
		}
	}
}
// Kludge to work around directly nested list nodes produced by some
// tools and allowed by browsers to mean that the nested list is
// actually part of the list item above it.
function normalizeList(dom) {
	for (let child = dom.firstChild, prevItem = null; child; child = child.nextSibling) {
		let name = child.nodeType == 1 ? child.nodeName.toLowerCase() : null;
		if (name && listTags.hasOwnProperty(name) && prevItem) {
			prevItem.appendChild(child);
			child = prevItem;
		} else if (name == "li") {
			prevItem = child;
		} else if (name) {
			prevItem = null;
		}
	}
}
// Apply a CSS selector.
function matches(dom, selector) {
	return (dom.matches || dom.msMatchesSelector || dom.webkitMatchesSelector || dom.mozMatchesSelector).call(dom, selector);
}
function copy(obj) {
	let copy = {};
	for (let prop in obj) copy[prop] = obj[prop];
	return copy;
}
// Used when finding a mark at the top level of a fragment parse.
// Checks whether it would be reasonable to apply a given mark type to
// a given node, by looking at the way the mark occurs in the schema.
function markMayApply(markType, nodeType) {
	let nodes = nodeType.schema.nodes;
	for (let name in nodes) {
		let parent = nodes[name];
		if (!parent.allowsMarkType(markType)) continue;
		let seen = [],
			scan = (match) => {
				seen.push(match);
				for (let i = 0; i < match.edgeCount; i++) {
					let { type, next } = match.edge(i);
					if (type == nodeType) return true;
					if (seen.indexOf(next) < 0 && scan(next)) return true;
				}
			};
		if (scan(parent.contentMatch)) return true;
	}
}

/**
A DOM serializer knows how to convert ProseMirror nodes and
marks of various types to DOM nodes.
*/
class DOMSerializer {
	/**
    Create a serializer. `nodes` should map node names to functions
    that take a node and return a description of the corresponding
    DOM. `marks` does the same for mark names, but also gets an
    argument that tells it whether the mark's content is block or
    inline content (for typical use, it'll always be inline). A mark
    serializer may be `null` to indicate that marks of that type
    should not be serialized.
    */
	constructor(
		/**
    The node serialization functions.
    */
		nodes,
		/**
    The mark serialization functions.
    */
		marks,
	) {
		this.nodes = nodes;
		this.marks = marks;
	}
	/**
    Serialize the content of this fragment to a DOM fragment. When
    not in the browser, the `document` option, containing a DOM
    document, should be passed so that the serializer can create
    nodes.
    */
	serializeFragment(fragment, options = {}, target) {
		if (!target) target = doc$1(options).createDocumentFragment();
		let top = target,
			active = [];
		fragment.forEach((node) => {
			if (active.length || node.marks.length) {
				let keep = 0,
					rendered = 0;
				while (keep < active.length && rendered < node.marks.length) {
					let next = node.marks[rendered];
					if (!this.marks[next.type.name]) {
						rendered++;
						continue;
					}
					if (!next.eq(active[keep][0]) || next.type.spec.spanning === false) break;
					keep++;
					rendered++;
				}
				while (keep < active.length) top = active.pop()[1];
				while (rendered < node.marks.length) {
					let add = node.marks[rendered++];
					let markDOM = this.serializeMark(add, node.isInline, options);
					if (markDOM) {
						active.push([add, top]);
						top.appendChild(markDOM.dom);
						top = markDOM.contentDOM || markDOM.dom;
					}
				}
			}
			top.appendChild(this.serializeNodeInner(node, options));
		});
		return target;
	}
	/**
    @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) throw new RangeError("Content hole not allowed in a leaf node spec");
			this.serializeFragment(node.content, options, contentDOM);
		}
		return dom;
	}
	/**
    Serialize this node to a DOM node. This can be useful when you
    need to serialize a part of a document, as opposed to the whole
    document. To serialize a whole document, use
    [`serializeFragment`](https://prosemirror.net/docs/ref/#model.DOMSerializer.serializeFragment) on
    its [content](https://prosemirror.net/docs/ref/#model.Node.content).
    */
	serializeNode(node, options = {}) {
		let dom = this.serializeNodeInner(node, options);
		for (let i = node.marks.length - 1; i >= 0; i--) {
			let wrap = this.serializeMark(node.marks[i], node.isInline, options);
			if (wrap) {
				(wrap.contentDOM || wrap.dom).appendChild(dom);
				dom = wrap.dom;
			}
		}
		return dom;
	}
	/**
    @internal
    */
	serializeMark(mark, inline, options = {}) {
		let toDOM = this.marks[mark.type.name];
		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);
	}
	/**
    Build a serializer using the [`toDOM`](https://prosemirror.net/docs/ref/#model.NodeSpec.toDOM)
    properties in a schema's node and mark specs.
    */
	static fromSchema(schema) {
		return schema.cached.domSerializer || (schema.cached.domSerializer = new DOMSerializer(this.nodesFromSchema(schema), this.marksFromSchema(schema)));
	}
	/**
    Gather the serializers in a schema's node specs into an object.
    This can be useful as a base to build a custom serializer from.
    */
	static nodesFromSchema(schema) {
		let result = gatherToDOM(schema.nodes);
		if (!result.text) result.text = (node) => node.text;
		return result;
	}
	/**
    Gather the serializers in a schema's mark specs into an object.
    */
	static marksFromSchema(schema) {
		return gatherToDOM(schema.marks);
	}
}
function gatherToDOM(obj) {
	let result = {};
	for (let name in obj) {
		let toDOM = obj[name].spec.toDOM;
		if (toDOM) result[name] = toDOM;
	}
	return result;
}
function doc$1(options) {
	return options.document || window.document;
}
const suspiciousAttributeCache = new WeakMap();
function suspiciousAttributes(attrs) {
	let value = suspiciousAttributeCache.get(attrs);
	if (value === undefined) suspiciousAttributeCache.set(attrs, (value = suspiciousAttributesInner(attrs)));
	return value;
}
function suspiciousAttributesInner(attrs) {
	let result = null;
	function scan(value) {
		if (value && typeof value == "object") {
			if (Array.isArray(value)) {
				if (typeof value[0] == "string") {
					if (!result) result = [];
					result.push(value);
				} else {
					for (let i = 0; i < value.length; i++) scan(value[i]);
				}
			} else {
				for (let prop in value) scan(value[prop]);
			}
		}
	}
	scan(attrs);
	return result;
}
function renderSpec(doc, structure, xmlNS, blockArraysIn) {
	if (structure.nodeType == 1) return { dom: structure };
	if (structure.dom && structure.dom.nodeType == 1) return structure;
	let tagName = structure[0],
		suspicious;
	if (typeof tagName != "string") throw new RangeError("Invalid array passed to renderSpec");
	if (blockArraysIn && (suspicious = suspiciousAttributes(blockArraysIn)) && suspicious.indexOf(structure) > -1)
		throw new RangeError("Using an array from an attribute object as a DOM spec. This may be an attempted cross site scripting attack.");
	let space = tagName.indexOf(" ");
	if (space > 0) {
		xmlNS = tagName.slice(0, space);
		tagName = tagName.slice(space + 1);
	}
	let contentDOM;
	let dom = xmlNS ? doc.createElementNS(xmlNS, tagName) : doc.createElement(tagName);
	let attrs = structure[1],
		start = 1;
	if (attrs && typeof attrs == "object" && attrs.nodeType == null && !Array.isArray(attrs)) {
		start = 2;
		for (let name in attrs)
			if (attrs[name] != null) {
				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]);
			}
	}
	for (let i = start; i < structure.length; i++) {
		let child = structure[i];
		if (child === 0) {
			if (i < structure.length - 1 || i > start) 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);
			if (innerContent) {
				if (contentDOM) throw new RangeError("Multiple content holes");
				contentDOM = innerContent;
			}
		}
	}
	return { dom, contentDOM };
}

// Recovery values encode a range index and an offset. They are
// represented as numbers, because tons of them will be created when
// mapping, for example, a large number of decorations. The number's
// lower 16 bits provide the index, the remaining bits the offset.
//
// Note: We intentionally don't use bit shift operators to en- and
// decode these, since those clip to 32 bits, which we might in rare
// cases want to overflow. A 64-bit float can represent 48-bit
// integers precisely.
const lower16 = 0xffff;
const factor16 = Math.pow(2, 16);
function makeRecover(index, offset) {
	return index + offset * factor16;
}
function recoverIndex(value) {
	return value & lower16;
}
function recoverOffset(value) {
	return (value - (value & lower16)) / factor16;
}
const DEL_BEFORE = 1,
	DEL_AFTER = 2,
	DEL_ACROSS = 4,
	DEL_SIDE = 8;
/**
An object representing a mapped position with extra
information.
*/
class MapResult {
	/**
    @internal
    */
	constructor(
		/**
    The mapped version of the position.
    */
		pos,
		/**
    @internal
    */
		delInfo,
		/**
    @internal
    */
		recover,
	) {
		this.pos = pos;
		this.delInfo = delInfo;
		this.recover = recover;
	}
	/**
    Tells you whether the position was deleted, that is, whether the
    step removed the token on the side queried (via the `assoc`)
    argument from the document.
    */
	get deleted() {
		return (this.delInfo & DEL_SIDE) > 0;
	}
	/**
    Tells you whether the token before the mapped position was deleted.
    */
	get deletedBefore() {
		return (this.delInfo & (DEL_BEFORE | DEL_ACROSS)) > 0;
	}
	/**
    True when the token after the mapped position was deleted.
    */
	get deletedAfter() {
		return (this.delInfo & (DEL_AFTER | DEL_ACROSS)) > 0;
	}
	/**
    Tells whether any of the steps mapped through deletes across the
    position (including both the token before and after the
    position).
    */
	get deletedAcross() {
		return (this.delInfo & DEL_ACROSS) > 0;
	}
}
/**
A map describing the deletions and insertions made by a step, which
can be used to find the correspondence between positions in the
pre-step version of a document and the same position in the
post-step version.
*/
class StepMap {
	/**
    Create a position map. The modifications to the document are
    represented as an array of numbers, in which each group of three
    represents a modified chunk as `[start, oldSize, newSize]`.
    */
	constructor(
		/**
    @internal
    */
		ranges,
		/**
    @internal
    */
		inverted = false,
	) {
		this.ranges = ranges;
		this.inverted = inverted;
		if (!ranges.length && StepMap.empty) return StepMap.empty;
	}
	/**
    @internal
    */
	recover(value) {
		let diff = 0,
			index = recoverIndex(value);
		if (!this.inverted) for (let i = 0; i < index; i++) diff += this.ranges[i * 3 + 2] - this.ranges[i * 3 + 1];
		return this.ranges[index * 3] + diff + recoverOffset(value);
	}
	mapResult(pos, assoc = 1) {
		return this._map(pos, assoc, false);
	}
	map(pos, assoc = 1) {
		return this._map(pos, assoc, true);
	}
	/**
    @internal
    */
	_map(pos, assoc, simple) {
		let diff = 0,
			oldIndex = this.inverted ? 2 : 1,
			newIndex = this.inverted ? 1 : 2;
		for (let i = 0; i < this.ranges.length; i += 3) {
			let start = this.ranges[i] - (this.inverted ? diff : 0);
			if (start > pos) break;
			let oldSize = this.ranges[i + oldIndex],
				newSize = this.ranges[i + newIndex],
				end = start + oldSize;
			if (pos <= end) {
				let side =
					!oldSize ? assoc
					: pos == start ? -1
					: pos == end ? 1
					: assoc;
				let result = start + diff + (side < 0 ? 0 : newSize);
				if (simple) return result;
				let recover = pos == (assoc < 0 ? start : end) ? null : makeRecover(i / 3, pos - start);
				let del =
					pos == start ? DEL_AFTER
					: pos == end ? DEL_BEFORE
					: DEL_ACROSS;
				if (assoc < 0 ? pos != start : pos != end) del |= DEL_SIDE;
				return new MapResult(result, del, recover);
			}
			diff += newSize - oldSize;
		}
		return simple ? pos + diff : new MapResult(pos + diff, 0, null);
	}
	/**
    @internal
    */
	touches(pos, recover) {
		let diff = 0,
			index = recoverIndex(recover);
		let oldIndex = this.inverted ? 2 : 1,
			newIndex = this.inverted ? 1 : 2;
		for (let i = 0; i < this.ranges.length; i += 3) {
			let start = this.ranges[i] - (this.inverted ? diff : 0);
			if (start > pos) break;
			let oldSize = this.ranges[i + oldIndex],
				end = start + oldSize;
			if (pos <= end && i == index * 3) return true;
			diff += this.ranges[i + newIndex] - oldSize;
		}
		return false;
	}
	/**
    Calls the given function on each of the changed ranges included in
    this map.
    */
	forEach(f) {
		let oldIndex = this.inverted ? 2 : 1,
			newIndex = this.inverted ? 1 : 2;
		for (let i = 0, diff = 0; i < this.ranges.length; i += 3) {
			let start = this.ranges[i],
				oldStart = start - (this.inverted ? diff : 0),
				newStart = start + (this.inverted ? 0 : diff);
			let oldSize = this.ranges[i + oldIndex],
				newSize = this.ranges[i + newIndex];
			f(oldStart, oldStart + oldSize, newStart, newStart + newSize);
			diff += newSize - oldSize;
		}
	}
	/**
    Create an inverted version of this map. The result can be used to
    map positions in the post-step document to the pre-step document.
    */
	invert() {
		return new StepMap(this.ranges, !this.inverted);
	}
	/**
    @internal
    */
	toString() {
		return (this.inverted ? "-" : "") + JSON.stringify(this.ranges);
	}
	/**
    Create a map that moves all positions by offset `n` (which may be
    negative). This can be useful when applying steps meant for a
    sub-document to a larger document, or vice-versa.
    */
	static offset(n) {
		return n == 0 ? StepMap.empty : new StepMap(n < 0 ? [0, -n, 0] : [0, 0, n]);
	}
}
/**
A StepMap that contains no changed ranges.
*/
StepMap.empty = new StepMap([]);
/**
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](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(
		maps,
		/**
    @internal
    */
		mirror,
		/**
    The starting position in the `maps` array, used when `map` or
    `mapResult` is called.
    */
		from = 0,
		/**
    The end position in the `maps` array.
    */
		to = maps ? maps.length : 0,
	) {
		this.mirror = mirror;
		this.from = from;
		this.to = to;
		this._maps = maps || [];
		this.ownData = !(maps || mirror);
	}
	/**
    The step maps in this mapping.
    */
	get maps() {
		return this._maps;
	}
	/**
    Create a mapping that maps only through a part of this one.
    */
	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
    given, it should be the index of the step map that is the mirror
    image of this one.
    */
	appendMap(map, mirrors) {
		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);
	}
	/**
    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++) {
			let mirr = mapping.getMirror(i);
			this.appendMap(mapping._maps[i], mirr != null && mirr < i ? startSize + mirr : undefined);
		}
	}
	/**
    Finds the offset of the step map that mirrors the map at the
    given offset, in this mapping (as per the second argument to
    `appendMap`).
    */
	getMirror(n) {
		if (this.mirror) for (let i = 0; i < this.mirror.length; i++) if (this.mirror[i] == n) return this.mirror[i + (i % 2 ? -1 : 1)];
	}
	/**
    @internal
    */
	setMirror(n, m) {
		if (!this.mirror) this.mirror = [];
		this.mirror.push(n, m);
	}
	/**
    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--) {
			let mirr = mapping.getMirror(i);
			this.appendMap(mapping._maps[i].invert(), mirr != null && mirr > i ? totalSize - mirr - 1 : undefined);
		}
	}
	/**
    Create an inverted version of this mapping.
    */
	invert() {
		let inverse = new Mapping();
		inverse.appendMappingInverted(this);
		return inverse;
	}
	/**
    Map a position through this mapping.
    */
	map(pos, assoc = 1) {
		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);
		return pos;
	}
	/**
    Map a position through this mapping, returning a mapping
    result.
    */
	mapResult(pos, assoc = 1) {
		return this._map(pos, assoc, false);
	}
	/**
    @internal
    */
	_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);
			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);
					continue;
				}
			}
			delInfo |= result.delInfo;
			pos = result.pos;
		}
		return simple ? pos : new MapResult(pos, delInfo, null);
	}
}

const stepsByID = Object.create(null);
/**
A step object represents an atomic change. It generally applies
only to the document it was created for, since the positions
stored in it will only make sense for that document.

New steps are defined by creating classes that extend `Step`,
overriding the `apply`, `invert`, `map`, `getMap` and `fromJSON`
methods, and registering your class with a unique
JSON-serialization identifier using
[`Step.jsonID`](https://prosemirror.net/docs/ref/#transform.Step^jsonID).
*/
class Step {
	/**
    Get the step map that represents the changes made by this step,
    and which can be used to transform between positions in the old
    and the new document.
    */
	getMap() {
		return StepMap.empty;
	}
	/**
    Try to merge this step with another one, to be applied directly
    after it. Returns the merged step when possible, null if the
    steps can't be merged.
    */
	merge(other) {
		return null;
	}
	/**
    Deserialize a step from its JSON representation. Will call
    through to the step class' own implementation of this method.
    */
	static fromJSON(schema, json) {
		if (!json || !json.stepType) throw new RangeError("Invalid input for Step.fromJSON");
		let type = stepsByID[json.stepType];
		if (!type) throw new RangeError(`No step type ${json.stepType} defined`);
		return type.fromJSON(schema, json);
	}
	/**
    To be able to serialize steps to JSON, each step needs a string
    ID to attach to its JSON representation. Use this method to
    register an ID for your step classes. Try to pick something
    that's unlikely to clash with steps from other modules.
    */
	static jsonID(id, stepClass) {
		if (id in stepsByID) throw new RangeError("Duplicate use of step JSON ID " + id);
		stepsByID[id] = stepClass;
		stepClass.prototype.jsonID = id;
		return stepClass;
	}
}
/**
The result of [applying](https://prosemirror.net/docs/ref/#transform.Step.apply) a step. Contains either a
new document or a failure value.
*/
class StepResult {
	/**
    @internal
    */
	constructor(
		/**
    The transformed document, if successful.
    */
		doc,
		/**
    The failure message, if unsuccessful.
    */
		failed,
	) {
		this.doc = doc;
		this.failed = failed;
	}
	/**
    Create a successful step result.
    */
	static ok(doc) {
		return new StepResult(doc, null);
	}
	/**
    Create a failed step result.
    */
	static fail(message) {
		return new StepResult(null, message);
	}
	/**
    Call [`Node.replace`](https://prosemirror.net/docs/ref/#model.Node.replace) with the given
    arguments. Create a successful result if it succeeds, and a
    failed one if it throws a `ReplaceError`.
    */
	static fromReplace(doc, from, to, slice) {
		try {
			return StepResult.ok(doc.replace(from, to, slice));
		} catch (e) {
			if (e instanceof ReplaceError) return StepResult.fail(e.message);
			throw e;
		}
	}
}

function mapFragment(fragment, f, parent) {
	let mapped = [];
	for (let i = 0; i < fragment.childCount; i++) {
		let child = fragment.child(i);
		if (child.content.size) child = child.copy(mapFragment(child.content, f, child));
		if (child.isInline) child = f(child, parent, i);
		mapped.push(child);
	}
	return Fragment.fromArray(mapped);
}
/**
Add a mark to all inline content between two positions.
*/
class AddMarkStep extends Step {
	/**
    Create a mark step.
    */
	constructor(
		/**
    The start of the marked range.
    */
		from,
		/**
    The end of the marked range.
    */
		to,
		/**
    The mark to add.
    */
		mark,
	) {
		super();
		this.from = from;
		this.to = to;
		this.mark = mark;
	}
	apply(doc) {
		let oldSlice = doc.slice(this.from, this.to),
			$from = doc.resolve(this.from);
		let parent = $from.node($from.sharedDepth(this.to));
		let slice = new Slice(
			mapFragment(
				oldSlice.content,
				(node, parent) => {
					if (!node.isAtom || !parent.type.allowsMarkType(this.mark.type)) return node;
					return node.mark(this.mark.addToSet(node.marks));
				},
				parent,
			),
			oldSlice.openStart,
			oldSlice.openEnd,
		);
		return StepResult.fromReplace(doc, this.from, this.to, slice);
	}
	invert() {
		return new RemoveMarkStep(this.from, this.to, this.mark);
	}
	map(mapping) {
		let from = mapping.mapResult(this.from, 1),
			to = mapping.mapResult(this.to, -1);
		if ((from.deleted && to.deleted) || from.pos >= to.pos) return null;
		return new AddMarkStep(from.pos, to.pos, this.mark);
	}
	merge(other) {
		if (other instanceof AddMarkStep && other.mark.eq(this.mark) && this.from <= other.to && this.to >= other.from)
			return new AddMarkStep(Math.min(this.from, other.from), Math.max(this.to, other.to), this.mark);
		return null;
	}
	toJSON() {
		return { stepType: "addMark", mark: this.mark.toJSON(), from: this.from, to: this.to };
	}
	/**
    @internal
    */
	static fromJSON(schema, json) {
		if (typeof json.from != "number" || typeof json.to != "number") throw new RangeError("Invalid input for AddMarkStep.fromJSON");
		return new AddMarkStep(json.from, json.to, schema.markFromJSON(json.mark));
	}
}
Step.jsonID("addMark", AddMarkStep);
/**
Remove a mark from all inline content between two positions.
*/
class RemoveMarkStep extends Step {
	/**
    Create a mark-removing step.
    */
	constructor(
		/**
    The start of the unmarked range.
    */
		from,
		/**
    The end of the unmarked range.
    */
		to,
		/**
    The mark to remove.
    */
		mark,
	) {
		super();
		this.from = from;
		this.to = to;
		this.mark = mark;
	}
	apply(doc) {
		let oldSlice = doc.slice(this.from, this.to);
		let slice = new Slice(
			mapFragment(
				oldSlice.content,
				(node) => {
					return node.mark(this.mark.removeFromSet(node.marks));
				},
				doc,
			),
			oldSlice.openStart,
			oldSlice.openEnd,
		);
		return StepResult.fromReplace(doc, this.from, this.to, slice);
	}
	invert() {
		return new AddMarkStep(this.from, this.to, this.mark);
	}
	map(mapping) {
		let from = mapping.mapResult(this.from, 1),
			to = mapping.mapResult(this.to, -1);
		if ((from.deleted && to.deleted) || from.pos >= to.pos) return null;
		return new RemoveMarkStep(from.pos, to.pos, this.mark);
	}
	merge(other) {
		if (other instanceof RemoveMarkStep && other.mark.eq(this.mark) && this.from <= other.to && this.to >= other.from)
			return new RemoveMarkStep(Math.min(this.from, other.from), Math.max(this.to, other.to), this.mark);
		return null;
	}
	toJSON() {
		return { stepType: "removeMark", mark: this.mark.toJSON(), from: this.from, to: this.to };
	}
	/**
    @internal
    */
	static fromJSON(schema, json) {
		if (typeof json.from != "number" || typeof json.to != "number") throw new RangeError("Invalid input for RemoveMarkStep.fromJSON");
		return new RemoveMarkStep(json.from, json.to, schema.markFromJSON(json.mark));
	}
}
Step.jsonID("removeMark", RemoveMarkStep);
/**
Add a mark to a specific node.
*/
class AddNodeMarkStep extends Step {
	/**
    Create a node mark step.
    */
	constructor(
		/**
    The position of the target node.
    */
		pos,
		/**
    The mark to add.
    */
		mark,
	) {
		super();
		this.pos = pos;
		this.mark = mark;
	}
	apply(doc) {
		let node = doc.nodeAt(this.pos);
		if (!node) return StepResult.fail("No node at mark step's position");
		let updated = node.type.create(node.attrs, null, this.mark.addToSet(node.marks));
		return StepResult.fromReplace(doc, this.pos, this.pos + 1, new Slice(Fragment.from(updated), 0, node.isLeaf ? 0 : 1));
	}
	invert(doc) {
		let node = doc.nodeAt(this.pos);
		if (node) {
			let newSet = this.mark.addToSet(node.marks);
			if (newSet.length == node.marks.length) {
				for (let i = 0; i < node.marks.length; i++) if (!node.marks[i].isInSet(newSet)) return new AddNodeMarkStep(this.pos, node.marks[i]);
				return new AddNodeMarkStep(this.pos, this.mark);
			}
		}
		return new RemoveNodeMarkStep(this.pos, this.mark);
	}
	map(mapping) {
		let pos = mapping.mapResult(this.pos, 1);
		return pos.deletedAfter ? null : new AddNodeMarkStep(pos.pos, this.mark);
	}
	toJSON() {
		return { stepType: "addNodeMark", pos: this.pos, mark: this.mark.toJSON() };
	}
	/**
    @internal
    */
	static fromJSON(schema, json) {
		if (typeof json.pos != "number") throw new RangeError("Invalid input for AddNodeMarkStep.fromJSON");
		return new AddNodeMarkStep(json.pos, schema.markFromJSON(json.mark));
	}
}
Step.jsonID("addNodeMark", AddNodeMarkStep);
/**
Remove a mark from a specific node.
*/
class RemoveNodeMarkStep extends Step {
	/**
    Create a mark-removing step.
    */
	constructor(
		/**
    The position of the target node.
    */
		pos,
		/**
    The mark to remove.
    */
		mark,
	) {
		super();
		this.pos = pos;
		this.mark = mark;
	}
	apply(doc) {
		let node = doc.nodeAt(this.pos);
		if (!node) return StepResult.fail("No node at mark step's position");
		let updated = node.type.create(node.attrs, null, this.mark.removeFromSet(node.marks));
		return StepResult.fromReplace(doc, this.pos, this.pos + 1, new Slice(Fragment.from(updated), 0, node.isLeaf ? 0 : 1));
	}
	invert(doc) {
		let node = doc.nodeAt(this.pos);
		if (!node || !this.mark.isInSet(node.marks)) return this;
		return new AddNodeMarkStep(this.pos, this.mark);
	}
	map(mapping) {
		let pos = mapping.mapResult(this.pos, 1);
		return pos.deletedAfter ? null : new RemoveNodeMarkStep(pos.pos, this.mark);
	}
	toJSON() {
		return { stepType: "removeNodeMark", pos: this.pos, mark: this.mark.toJSON() };
	}
	/**
    @internal
    */
	static fromJSON(schema, json) {
		if (typeof json.pos != "number") throw new RangeError("Invalid input for RemoveNodeMarkStep.fromJSON");
		return new RemoveNodeMarkStep(json.pos, schema.markFromJSON(json.mark));
	}
}
Step.jsonID("removeNodeMark", RemoveNodeMarkStep);

/**
Replace a part of the document with a slice of new content.
*/
class ReplaceStep extends Step {
	/**
    The given `slice` should fit the 'gap' between `from` and
    `to`—the depths must line up, and the surrounding nodes must be
    able to be joined with the open sides of the slice. When
    `structure` is true, the step will fail if the content between
    from and to is not just a sequence of closing and then opening
    tokens (this is to guard against rebased replace steps
    overwriting something they weren't supposed to).
    */
	constructor(
		/**
    The start position of the replaced range.
    */
		from,
		/**
    The end position of the replaced range.
    */
		to,
		/**
    The slice to insert.
    */
		slice,
		/**
    @internal
    */
		structure = false,
	) {
		super();
		this.from = from;
		this.to = to;
		this.slice = slice;
		this.structure = structure;
	}
	apply(doc) {
		if (this.structure && contentBetween(doc, this.from, this.to)) return StepResult.fail("Structure replace would overwrite content");
		return StepResult.fromReplace(doc, this.from, this.to, this.slice);
	}
	getMap() {
		return new StepMap([this.from, this.to - this.from, this.slice.size]);
	}
	invert(doc) {
		return new ReplaceStep(this.from, this.from + this.slice.size, doc.slice(this.from, this.to));
	}
	map(mapping) {
		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, this.structure);
	}
	merge(other) {
		if (!(other instanceof ReplaceStep) || other.structure || this.structure) return null;
		if (this.from + this.slice.size == other.from && !this.slice.openEnd && !other.slice.openStart) {
			let slice = this.slice.size + other.slice.size == 0 ? Slice.empty : new Slice(this.slice.content.append(other.slice.content), this.slice.openStart, other.slice.openEnd);
			return new ReplaceStep(this.from, this.to + (other.to - other.from), slice, this.structure);
		} else if (other.to == this.from && !this.slice.openStart && !other.slice.openEnd) {
			let slice = this.slice.size + other.slice.size == 0 ? Slice.empty : new Slice(other.slice.content.append(this.slice.content), other.slice.openStart, this.slice.openEnd);
			return new ReplaceStep(other.from, this.to, slice, this.structure);
		} else {
			return null;
		}
	}
	toJSON() {
		let json = { stepType: "replace", from: this.from, to: this.to };
		if (this.slice.size) json.slice = this.slice.toJSON();
		if (this.structure) json.structure = true;
		return json;
	}
	/**
    @internal
    */
	static fromJSON(schema, json) {
		if (typeof json.from != "number" || typeof json.to != "number") throw new RangeError("Invalid input for ReplaceStep.fromJSON");
		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
preserve a range of the replaced content by moving it into the
slice.
*/
class ReplaceAroundStep extends Step {
	/**
    Create a replace-around step with the given range and gap.
    `insert` should be the point in the slice into which the content
    of the gap should be moved. `structure` has the same meaning as
    it has in the [`ReplaceStep`](https://prosemirror.net/docs/ref/#transform.ReplaceStep) class.
    */
	constructor(
		/**
    The start position of the replaced range.
    */
		from,
		/**
    The end position of the replaced range.
    */
		to,
		/**
    The start of preserved range.
    */
		gapFrom,
		/**
    The end of preserved range.
    */
		gapTo,
		/**
    The slice to insert.
    */
		slice,
		/**
    The position in the slice where the preserved range should be
    inserted.
    */
		insert,
		/**
    @internal
    */
		structure = false,
	) {
		super();
		this.from = from;
		this.to = to;
		this.gapFrom = gapFrom;
		this.gapTo = gapTo;
		this.slice = slice;
		this.insert = insert;
		this.structure = structure;
	}
	apply(doc) {
		if (this.structure && (contentBetween(doc, this.from, this.gapFrom) || contentBetween(doc, this.gapTo, this.to))) return StepResult.fail("Structure gap-replace would overwrite content");
		let gap = doc.slice(this.gapFrom, this.gapTo);
		if (gap.openStart || gap.openEnd) return StepResult.fail("Gap is not a flat range");
		let inserted = this.slice.insertAt(this.insert, gap.content);
		if (!inserted) return StepResult.fail("Content does not fit in gap");
		return StepResult.fromReplace(doc, this.from, this.to, inserted);
	}
	getMap() {
		return new StepMap([this.from, this.gapFrom - this.from, this.insert, this.gapTo, this.to - this.gapTo, this.slice.size - this.insert]);
	}
	invert(doc) {
		let gap = this.gapTo - this.gapFrom;
		return new ReplaceAroundStep(
			this.from,
			this.from + this.slice.size + gap,
			this.from + this.insert,
			this.from + this.insert + gap,
			doc.slice(this.from, this.to).removeBetween(this.gapFrom - this.from, this.gapTo - this.from),
			this.gapFrom - this.from,
			this.structure,
		);
	}
	map(mapping) {
		let from = mapping.mapResult(this.from, 1),
			to = mapping.mapResult(this.to, -1);
		let gapFrom = this.from == this.gapFrom ? from.pos : mapping.map(this.gapFrom, -1);
		let gapTo = this.to == this.gapTo ? to.pos : mapping.map(this.gapTo, 1);
		if ((from.deletedAcross && to.deletedAcross) || gapFrom < from.pos || gapTo > to.pos) return null;
		return new ReplaceAroundStep(from.pos, to.pos, gapFrom, gapTo, this.slice, this.insert, this.structure);
	}
	toJSON() {
		let json = { stepType: "replaceAround", from: this.from, to: this.to, gapFrom: this.gapFrom, gapTo: this.gapTo, insert: this.insert };
		if (this.slice.size) json.slice = this.slice.toJSON();
		if (this.structure) json.structure = true;
		return json;
	}
	/**
    @internal
    */
	static fromJSON(schema, json) {
		if (typeof json.from != "number" || typeof json.to != "number" || typeof json.gapFrom != "number" || typeof json.gapTo != "number" || typeof json.insert != "number")
			throw new RangeError("Invalid input for ReplaceAroundStep.fromJSON");
		return new ReplaceAroundStep(json.from, json.to, json.gapFrom, json.gapTo, Slice.fromJSON(schema, json.slice), json.insert, !!json.structure);
	}
}
Step.jsonID("replaceAround", ReplaceAroundStep);
function contentBetween(doc, from, to) {
	let $from = doc.resolve(from),
		dist = to - from,
		depth = $from.depth;
	while (dist > 0 && depth > 0 && $from.indexAfter(depth) == $from.node(depth).childCount) {
		depth--;
		dist--;
	}
	if (dist > 0) {
		let next = $from.node(depth).maybeChild($from.indexAfter(depth));
		while (dist > 0) {
			if (!next || next.isLeaf) return true;
			next = next.firstChild;
			dist--;
		}
	}
	return false;
}

function addMark(tr, from, to, mark) {
	let removed = [],
		added = [];
	let removing, adding;
	tr.doc.nodesBetween(from, to, (node, pos, parent) => {
		if (!node.isInline) return;
		let marks = node.marks;
		if (!mark.isInSet(marks) && parent.type.allowsMarkType(mark.type)) {
			let start = Math.max(pos, from),
				end = Math.min(pos + node.nodeSize, to);
			let newSet = mark.addToSet(marks);
			for (let i = 0; i < marks.length; i++) {
				if (!marks[i].isInSet(newSet)) {
					if (removing && removing.to == start && removing.mark.eq(marks[i])) removing.to = end;
					else removed.push((removing = new RemoveMarkStep(start, end, marks[i])));
				}
			}
			if (adding && adding.to == start) adding.to = end;
			else added.push((adding = new AddMarkStep(start, end, mark)));
		}
	});
	removed.forEach((s) => tr.step(s));
	added.forEach((s) => tr.step(s));
}
function removeMark(tr, from, to, mark) {
	let matched = [],
		step = 0;
	tr.doc.nodesBetween(from, to, (node, pos) => {
		if (!node.isInline) return;
		step++;
		let toRemove = null;
		if (mark instanceof MarkType) {
			let set = node.marks,
				found;
			while ((found = mark.isInSet(set))) {
				(toRemove || (toRemove = [])).push(found);
				set = found.removeFromSet(set);
			}
		} else if (mark) {
			if (mark.isInSet(node.marks)) toRemove = [mark];
		} else {
			toRemove = node.marks;
		}
		if (toRemove && toRemove.length) {
			let end = Math.min(pos + node.nodeSize, to);
			for (let i = 0; i < toRemove.length; i++) {
				let style = toRemove[i],
					found;
				for (let j = 0; j < matched.length; j++) {
					let m = matched[j];
					if (m.step == step - 1 && style.eq(matched[j].style)) found = m;
				}
				if (found) {
					found.to = end;
					found.step = step;
				} else {
					matched.push({ style, from: Math.max(pos, from), to: end, step });
				}
			}
		}
	});
	matched.forEach((m) => tr.step(new RemoveMarkStep(m.from, m.to, m.style)));
}
function clearIncompatible(tr, pos, parentType, match = parentType.contentMatch, clearNewlines = true) {
	let node = tr.doc.nodeAt(pos);
	let replSteps = [],
		cur = pos + 1;
	for (let i = 0; i < node.childCount; i++) {
		let child = node.child(i),
			end = cur + child.nodeSize;
		let allowed = match.matchType(child.type);
		if (!allowed) {
			replSteps.push(new ReplaceStep(cur, end, Slice.empty));
		} else {
			match = allowed;
			for (let j = 0; j < child.marks.length; j++) if (!parentType.allowsMarkType(child.marks[j].type)) tr.step(new RemoveMarkStep(cur, end, child.marks[j]));
			if (clearNewlines && child.isText && parentType.whitespace != "pre") {
				let m,
					newline = /\r?\n|\r/g,
					slice;
				while ((m = newline.exec(child.text))) {
					if (!slice) slice = new Slice(Fragment.from(parentType.schema.text(" ", parentType.allowedMarks(child.marks))), 0, 0);
					replSteps.push(new ReplaceStep(cur + m.index, cur + m.index + m[0].length, slice));
				}
			}
		}
		cur = end;
	}
	if (!match.validEnd) {
		let fill = match.fillBefore(Fragment.empty, true);
		tr.replace(cur, cur, new Slice(fill, 0, 0));
	}
	for (let i = replSteps.length - 1; i >= 0; i--) tr.step(replSteps[i]);
}

function canCut(node, start, end) {
	return (start == 0 || node.canReplace(start, node.childCount)) && (end == node.childCount || node.canReplace(0, end));
}
/**
Try to find a target depth to which the content in the given range
can be lifted. Will not go across
[isolating](https://prosemirror.net/docs/ref/#model.NodeSpec.isolating) parent nodes.
*/
function liftTarget(range) {
	let parent = range.parent;
	let content = parent.content.cutByIndex(range.startIndex, range.endIndex);
	for (let depth = range.depth, contentBefore = 0, contentAfter = 0; ; --depth) {
		let node = range.$from.node(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;
}
function lift$2(tr, range, target) {
	let { $from, $to, depth } = range;
	let gapStart = $from.before(depth + 1),
		gapEnd = $to.after(depth + 1);
	let start = gapStart,
		end = gapEnd;
	let before = Fragment.empty,
		openStart = 0;
	for (let d = depth, splitting = false; d > target; d--)
		if (splitting || $from.index(d) > 0) {
			splitting = true;
			before = Fragment.from($from.node(d).copy(before));
			openStart++;
		} else {
			start--;
		}
	let after = Fragment.empty,
		openEnd = 0;
	for (let d = depth, splitting = false; d > target; d--)
		if (splitting || $to.after(d + 1) < $to.end(d)) {
			splitting = true;
			after = Fragment.from($to.node(d).copy(after));
			openEnd++;
		} else {
			end++;
		}
	tr.step(new ReplaceAroundStep(start, end, gapStart, gapEnd, new Slice(before.append(after), openStart, openEnd), before.size - openStart, true));
}
/**
Try to find a valid way to wrap the content in the given range in a
node of the given type. May introduce extra nodes around and inside
the wrapper node, if necessary. Returns null if no valid wrapping
could be found. When `innerRange` is given, that range's content is
used as the content to fit into the wrapping, instead of the
content of `range`.
*/
function findWrapping(range, nodeType, attrs = null, innerRange = range) {
	let around = findWrappingOutside(range, nodeType);
	let inner = around && findWrappingInside(innerRange, nodeType);
	if (!inner) return null;
	return around.map(withAttrs).concat({ type: nodeType, attrs }).concat(inner.map(withAttrs));
}
function withAttrs(type) {
	return { type, attrs: null };
}
function findWrappingOutside(range, type) {
	let { parent, startIndex, endIndex } = range;
	let around = parent.contentMatchAt(startIndex).findWrapping(type);
	if (!around) return null;
	let outer = around.length ? around[0] : type;
	return parent.canReplaceWith(startIndex, endIndex, outer) ? around : null;
}
function findWrappingInside(range, type) {
	let { parent, startIndex, endIndex } = range;
	let inner = parent.child(startIndex);
	let inside = type.contentMatch.findWrapping(inner.type);
	if (!inside) return null;
	let lastType = inside.length ? inside[inside.length - 1] : type;
	let innerMatch = lastType.contentMatch;
	for (let i = startIndex; innerMatch && i < endIndex; i++) innerMatch = innerMatch.matchType(parent.child(i).type);
	if (!innerMatch || !innerMatch.validEnd) return null;
	return inside;
}
function wrap(tr, range, wrappers) {
	let content = Fragment.empty;
	for (let i = wrappers.length - 1; i >= 0; i--) {
		if (content.size) {
			let match = wrappers[i].type.contentMatch.matchFragment(content);
			if (!match || !match.validEnd) throw new RangeError("Wrapper type given to Transform.wrap does not form valid content of its parent wrapper");
		}
		content = Fragment.from(wrappers[i].type.create(wrappers[i].attrs, content));
	}
	let start = range.start,
		end = range.end;
	tr.step(new ReplaceAroundStep(start, end, start, end, new Slice(content, 0, 0), wrappers.length, true));
}
function setBlockType$1(tr, from, to, type, attrs) {
	if (!type.isTextblock) throw new RangeError("Type given to setBlockType should be a textblock");
	let mapFrom = tr.steps.length;
	tr.doc.nodesBetween(from, to, (node, pos) => {
		let attrsHere = typeof attrs == "function" ? attrs(node) : attrs;
		if (node.isTextblock && !node.hasMarkup(type, attrsHere) && canChangeType(tr.doc, tr.mapping.slice(mapFrom).map(pos), type)) {
			let convertNewlines = null;
			if (type.schema.linebreakReplacement) {
				let pre = type.whitespace == "pre",
					supportLinebreak = !!type.contentMatch.matchType(type.schema.linebreakReplacement);
				if (pre && !supportLinebreak) convertNewlines = false;
				else if (!pre && supportLinebreak) convertNewlines = true;
			}
			// Ensure all markup that isn't allowed in the new node type is cleared
			if (convertNewlines === false) replaceLinebreaks(tr, node, pos, mapFrom);
			clearIncompatible(tr, tr.mapping.slice(mapFrom).map(pos, 1), type, undefined, convertNewlines === null);
			let mapping = tr.mapping.slice(mapFrom);
			let startM = mapping.map(pos, 1),
				endM = mapping.map(pos + node.nodeSize, 1);
			tr.step(new ReplaceAroundStep(startM, endM, startM + 1, endM - 1, new Slice(Fragment.from(type.create(attrsHere, null, node.marks)), 0, 0), 1, true));
			if (convertNewlines === true) replaceNewlines(tr, node, pos, mapFrom);
			return false;
		}
	});
}
function replaceNewlines(tr, node, pos, mapFrom) {
	node.forEach((child, offset) => {
		if (child.isText) {
			let m,
				newline = /\r?\n|\r/g;
			while ((m = newline.exec(child.text))) {
				let start = tr.mapping.slice(mapFrom).map(pos + 1 + offset + m.index);
				tr.replaceWith(start, start + 1, node.type.schema.linebreakReplacement.create());
			}
		}
	});
}
function replaceLinebreaks(tr, node, pos, mapFrom) {
	node.forEach((child, offset) => {
		if (child.type == child.type.schema.linebreakReplacement) {
			let start = tr.mapping.slice(mapFrom).map(pos + 1 + offset);
			tr.replaceWith(start, start + 1, node.type.schema.text("\n"));
		}
	});
}
function canChangeType(doc, pos, type) {
	let $pos = doc.resolve(pos),
		index = $pos.index();
	return $pos.parent.canReplaceWith(index, index + 1, type);
}
/**
Change the type, attributes, and/or marks of the node at `pos`.
When `type` isn't given, the existing node type is preserved,
*/
function setNodeMarkup(tr, pos, type, attrs, marks) {
	let node = tr.doc.nodeAt(pos);
	if (!node) throw new RangeError("No node at given position");
	if (!type) type = node.type;
	let newNode = type.create(attrs, null, marks || node.marks);
	if (node.isLeaf) return tr.replaceWith(pos, pos + node.nodeSize, newNode);
	if (!type.validContent(node.content)) throw new RangeError("Invalid content for node type " + type.name);
	tr.step(new ReplaceAroundStep(pos, pos + node.nodeSize, pos + 1, pos + node.nodeSize - 1, new Slice(Fragment.from(newNode), 0, 0), 1, true));
}
/**
Check whether splitting at the given position is allowed.
*/
function canSplit(doc, pos, depth = 1, typesAfter) {
	let $pos = doc.resolve(pos),
		base = $pos.depth - depth;
	let innerType = (typesAfter && typesAfter[typesAfter.length - 1]) || $pos.parent;
	if (
		base < 0 ||
		$pos.parent.type.spec.isolating ||
		!$pos.parent.canReplace($pos.index(), $pos.parent.childCount) ||
		!innerType.type.validContent($pos.parent.content.cutByIndex($pos.index(), $pos.parent.childCount))
	)
		return false;
	for (let d = $pos.depth - 1, i = depth - 2; d > base; d--, i--) {
		let node = $pos.node(d),
			index = $pos.index(d);
		if (node.type.spec.isolating) return false;
		let rest = node.content.cutByIndex(index, node.childCount);
		let overrideChild = typesAfter && typesAfter[i + 1];
		if (overrideChild) rest = rest.replaceChild(0, overrideChild.type.create(overrideChild.attrs));
		let after = (typesAfter && typesAfter[i]) || node;
		if (!node.canReplace(index + 1, node.childCount) || !after.type.validContent(rest)) return false;
	}
	let index = $pos.indexAfter(base);
	let baseType = typesAfter && typesAfter[0];
	return $pos.node(base).canReplaceWith(index, index, baseType ? baseType.type : $pos.node(base + 1).type);
}
function split(tr, pos, depth = 1, typesAfter) {
	let $pos = tr.doc.resolve(pos),
		before = Fragment.empty,
		after = Fragment.empty;
	for (let d = $pos.depth, e = $pos.depth - depth, i = depth - 1; d > e; d--, i--) {
		before = Fragment.from($pos.node(d).copy(before));
		let typeAfter = typesAfter && typesAfter[i];
		after = Fragment.from(typeAfter ? typeAfter.type.create(typeAfter.attrs, after) : $pos.node(d).copy(after));
	}
	tr.step(new ReplaceStep(pos, pos, new Slice(before.append(after), depth, depth), true));
}
/**
Test whether the blocks before and after a given position can be
joined.
*/
function canJoin(doc, pos) {
	let $pos = doc.resolve(pos),
		index = $pos.index();
	return joinable($pos.nodeBefore, $pos.nodeAfter) && $pos.parent.canReplace(index, index + 1);
}
function canAppendWithSubstitutedLinebreaks(a, b) {
	if (!b.content.size) a.type.compatibleContent(b.type);
	let match = a.contentMatchAt(a.childCount);
	let { linebreakReplacement } = a.type.schema;
	for (let i = 0; i < b.childCount; i++) {
		let child = b.child(i);
		let type = child.type == linebreakReplacement ? a.type.schema.nodes.text : child.type;
		match = match.matchType(type);
		if (!match) return false;
		if (!a.type.allowsMarks(child.marks)) return false;
	}
	return match.validEnd;
}
function joinable(a, b) {
	return !!(a && b && !a.isLeaf && canAppendWithSubstitutedLinebreaks(a, b));
}
/**
Find an ancestor of the given position that can be joined to the
block before (or after if `dir` is positive). Returns the joinable
point, if any.
*/
function joinPoint(doc, pos, dir = -1) {
	let $pos = doc.resolve(pos);
	for (let d = $pos.depth; ; d--) {
		let before,
			after,
			index = $pos.index(d);
		if (d == $pos.depth) {
			before = $pos.nodeBefore;
			after = $pos.nodeAfter;
		} else if (dir > 0) {
			before = $pos.node(d + 1);
			index++;
			after = $pos.node(d).maybeChild(index);
		} else {
			before = $pos.node(d).maybeChild(index - 1);
			after = $pos.node(d + 1);
		}
		if (before && !before.isTextblock && joinable(before, after) && $pos.node(d).canReplace(index, index + 1)) return pos;
		if (d == 0) break;
		pos = dir < 0 ? $pos.before(d) : $pos.after(d);
	}
}
function join(tr, pos, depth) {
	let convertNewlines = null;
	let { linebreakReplacement } = tr.doc.type.schema;
	let $before = tr.doc.resolve(pos - depth),
		beforeType = $before.node().type;
	if (linebreakReplacement && beforeType.inlineContent) {
		let pre = beforeType.whitespace == "pre";
		let supportLinebreak = !!beforeType.contentMatch.matchType(linebreakReplacement);
		if (pre && !supportLinebreak) convertNewlines = false;
		else if (!pre && supportLinebreak) convertNewlines = true;
	}
	let mapFrom = tr.steps.length;
	if (convertNewlines === false) {
		let $after = tr.doc.resolve(pos + depth);
		replaceLinebreaks(tr, $after.node(), $after.before(), mapFrom);
	}
	if (beforeType.inlineContent) clearIncompatible(tr, pos + depth - 1, beforeType, $before.node().contentMatchAt($before.index()), convertNewlines == null);
	let mapping = tr.mapping.slice(mapFrom),
		start = mapping.map(pos - depth);
	tr.step(new ReplaceStep(start, mapping.map(pos + depth, -1), Slice.empty, true));
	if (convertNewlines === true) {
		let $full = tr.doc.resolve(start);
		replaceNewlines(tr, $full.node(), $full.before(), tr.steps.length);
	}
	return tr;
}
/**
Try to find a point where a node of the given type can be inserted
near `pos`, by searching up the node hierarchy when `pos` itself
isn't a valid place but is at the start or end of a node. Return
null if no position was found.
*/
function insertPoint(doc, pos, nodeType) {
	let $pos = doc.resolve(pos);
	if ($pos.parent.canReplaceWith($pos.index(), $pos.index(), nodeType)) return pos;
	if ($pos.parentOffset == 0)
		for (let d = $pos.depth - 1; d >= 0; d--) {
			let index = $pos.index(d);
			if ($pos.node(d).canReplaceWith(index, index, nodeType)) return $pos.before(d + 1);
			if (index > 0) return null;
		}
	if ($pos.parentOffset == $pos.parent.content.size)
		for (let d = $pos.depth - 1; d >= 0; d--) {
			let index = $pos.indexAfter(d);
			if ($pos.node(d).canReplaceWith(index, index, nodeType)) return $pos.after(d + 1);
			if (index < $pos.node(d).childCount) return null;
		}
	return null;
}
/**
Finds a position at or around the given position where the given
slice can be inserted. Will look at parent nodes' nearest boundary
and try there, even if the original position wasn't directly at the
start or end of that node. Returns null when no position was found.
*/
function dropPoint(doc, pos, slice) {
	let $pos = doc.resolve(pos);
	if (!slice.content.size) return pos;
	let content = slice.content;
	for (let i = 0; i < slice.openStart; i++) content = content.firstChild.content;
	for (let pass = 1; pass <= (slice.openStart == 0 && slice.size ? 2 : 1); pass++) {
		for (let d = $pos.depth; d >= 0; d--) {
			let bias =
				d == $pos.depth ? 0
				: $pos.pos <= ($pos.start(d + 1) + $pos.end(d + 1)) / 2 ? -1
				: 1;
			let insertPos = $pos.index(d) + (bias > 0 ? 1 : 0);
			let parent = $pos.node(d),
				fits = false;
			if (pass == 1) {
				fits = parent.canReplace(insertPos, insertPos, content);
			} else {
				let wrapping = parent.contentMatchAt(insertPos).findWrapping(content.firstChild.type);
				fits = wrapping && parent.canReplaceWith(insertPos, insertPos, wrapping[0]);
			}
			if (fits)
				return (
					bias == 0 ? $pos.pos
					: bias < 0 ? $pos.before(d + 1)
					: $pos.after(d + 1)
				);
		}
	}
	return null;
}

/**
‘Fit’ a slice into a given position in the document, producing a
[step](https://prosemirror.net/docs/ref/#transform.Step) that inserts it. Will return null if
there's no meaningful way to insert the slice here, or inserting it
would be a no-op (an empty slice over an empty range).
*/
function replaceStep(doc, from, to = from, slice = Slice.empty) {
	if (from == to && !slice.size) return null;
	let $from = doc.resolve(from),
		$to = doc.resolve(to);
	// Optimization -- avoid work if it's obvious that it's not needed.
	if (fitsTrivially($from, $to, slice)) return new ReplaceStep(from, to, slice);
	return new Fitter($from, $to, slice).fit();
}
function fitsTrivially($from, $to, slice) {
	return !slice.openStart && !slice.openEnd && $from.start() == $to.start() && $from.parent.canReplace($from.index(), $to.index(), slice.content);
}
// Algorithm for 'placing' the elements of a slice into a gap:
//
// We consider the content of each node that is open to the left to be
// independently placeable. I.e. in <p("foo"), p("bar")>, when the
// paragraph on the left is open, "foo" can be placed (somewhere on
// the left side of the replacement gap) independently from p("bar").
//
// This class tracks the state of the placement progress in the
// following properties:
//
//  - `frontier` holds a stack of `{type, match}` objects that
//    represent the open side of the replacement. It starts at
//    `$from`, then moves forward as content is placed, and is finally
//    reconciled with `$to`.
//
//  - `unplaced` is a slice that represents the content that hasn't
//    been placed yet.
//
//  - `placed` is a fragment of placed content. Its open-start value
//    is implicit in `$from`, and its open-end value in `frontier`.
class Fitter {
	constructor($from, $to, unplaced) {
		this.$from = $from;
		this.$to = $to;
		this.unplaced = unplaced;
		this.frontier = [];
		this.placed = Fragment.empty;
		for (let i = 0; i <= $from.depth; i++) {
			let node = $from.node(i);
			this.frontier.push({
				type: node.type,
				match: node.contentMatchAt($from.indexAfter(i)),
			});
		}
		for (let i = $from.depth; i > 0; i--) this.placed = Fragment.from($from.node(i).copy(this.placed));
	}
	get depth() {
		return this.frontier.length - 1;
	}
	fit() {
		// As long as there's unplaced content, try to place some of it.
		// If that fails, either increase the open score of the unplaced
		// slice, or drop nodes from it, and then try again.
		while (this.unplaced.size) {
			let fit = this.findFittable();
			if (fit) this.placeNodes(fit);
			else this.openMore() || this.dropNode();
		}
		// When there's inline content directly after the frontier _and_
		// directly after `this.$to`, we must generate a `ReplaceAround`
		// step that pulls that content into the node after the frontier.
		// That means the fitting must be done to the end of the textblock
		// node after `this.$to`, not `this.$to` itself.
		let moveInline = this.mustMoveInline(),
			placedSize = this.placed.size - this.depth - this.$from.depth;
		let $from = this.$from,
			$to = this.close(moveInline < 0 ? this.$to : $from.doc.resolve(moveInline));
		if (!$to) return null;
		// If closing to `$to` succeeded, create a step
		let content = this.placed,
			openStart = $from.depth,
			openEnd = $to.depth;
		while (openStart && openEnd && content.childCount == 1) {
			// Normalize by dropping open parent nodes
			content = content.firstChild.content;
			openStart--;
			openEnd--;
		}
		let slice = new Slice(content, openStart, openEnd);
		if (moveInline > -1) return new ReplaceAroundStep($from.pos, moveInline, this.$to.pos, this.$to.end(), slice, placedSize);
		if (slice.size || $from.pos != this.$to.pos)
			// Don't generate no-op steps
			return new ReplaceStep($from.pos, $to.pos, slice);
		return null;
	}
	// Find a position on the start spine of `this.unplaced` that has
	// content that can be moved somewhere on the frontier. Returns two
	// depths, one for the slice and one for the frontier.
	findFittable() {
		let startDepth = this.unplaced.openStart;
		for (let cur = this.unplaced.content, d = 0, openEnd = this.unplaced.openEnd; d < startDepth; d++) {
			let node = cur.firstChild;
			if (cur.childCount > 1) openEnd = 0;
			if (node.type.spec.isolating && openEnd <= d) {
				startDepth = d;
				break;
			}
			cur = node.content;
		}
		// Only try wrapping nodes (pass 2) after finding a place without
		// wrapping failed.
		for (let pass = 1; pass <= 2; pass++) {
			for (let sliceDepth = pass == 1 ? startDepth : this.unplaced.openStart; sliceDepth >= 0; sliceDepth--) {
				let fragment,
					parent = null;
				if (sliceDepth) {
					parent = contentAt(this.unplaced.content, sliceDepth - 1).firstChild;
					fragment = parent.content;
				} else {
					fragment = this.unplaced.content;
				}
				let first = fragment.firstChild;
				for (let frontierDepth = this.depth; frontierDepth >= 0; frontierDepth--) {
					let { type, match } = this.frontier[frontierDepth],
						wrap,
						inject = null;
					// In pass 1, if the next node matches, or there is no next
					// node but the parents look compatible, we've found a
					// place.
					if (pass == 1 && (first ? match.matchType(first.type) || (inject = match.fillBefore(Fragment.from(first), false)) : parent && type.compatibleContent(parent.type)))
						return { sliceDepth, frontierDepth, parent, inject };
					// In pass 2, look for a set of wrapping nodes that make
					// `first` fit here.
					else if (pass == 2 && first && (wrap = match.findWrapping(first.type))) return { sliceDepth, frontierDepth, parent, wrap };
					// Don't continue looking further up if the parent node
					// would fit here.
					if (parent && match.matchType(parent.type)) break;
				}
			}
		}
	}
	openMore() {
		let { content, openStart, openEnd } = this.unplaced;
		let inner = contentAt(content, openStart);
		if (!inner.childCount || inner.firstChild.isLeaf) return false;
		this.unplaced = new Slice(content, openStart + 1, Math.max(openEnd, inner.size + openStart >= content.size - openEnd ? openStart + 1 : 0));
		return true;
	}
	dropNode() {
		let { content, openStart, openEnd } = this.unplaced;
		let inner = contentAt(content, openStart);
		if (inner.childCount <= 1 && openStart > 0) {
			let openAtEnd = content.size - openStart <= openStart + inner.size;
			this.unplaced = new Slice(dropFromFragment(content, openStart - 1, 1), openStart - 1, openAtEnd ? openStart - 1 : openEnd);
		} else {
			this.unplaced = new Slice(dropFromFragment(content, openStart, 1), openStart, openEnd);
		}
	}
	// Move content from the unplaced slice at `sliceDepth` to the
	// frontier node at `frontierDepth`. Close that frontier node when
	// applicable.
	placeNodes({ sliceDepth, frontierDepth, parent, inject, wrap }) {
		while (this.depth > frontierDepth) this.closeFrontierNode();
		if (wrap) for (let i = 0; i < wrap.length; i++) this.openFrontierNode(wrap[i]);
		let slice = this.unplaced,
			fragment = parent ? parent.content : slice.content;
		let openStart = slice.openStart - sliceDepth;
		let taken = 0,
			add = [];
		let { match, type } = this.frontier[frontierDepth];
		if (inject) {
			for (let i = 0; i < inject.childCount; i++) add.push(inject.child(i));
			match = match.matchFragment(inject);
		}
		// Computes the amount of (end) open nodes at the end of the
		// fragment. When 0, the parent is open, but no more. When
		// negative, nothing is open.
		let openEndCount = fragment.size + sliceDepth - (slice.content.size - slice.openEnd);
		// Scan over the fragment, fitting as many child nodes as
		// possible.
		while (taken < fragment.childCount) {
			let next = fragment.child(taken),
				matches = match.matchType(next.type);
			if (!matches) break;
			taken++;
			if (taken > 1 || openStart == 0 || next.content.size) {
				// Drop empty open nodes
				match = matches;
				add.push(closeNodeStart(next.mark(type.allowedMarks(next.marks)), taken == 1 ? openStart : 0, taken == fragment.childCount ? openEndCount : -1));
			}
		}
		let toEnd = taken == fragment.childCount;
		if (!toEnd) openEndCount = -1;
		this.placed = addToFragment(this.placed, frontierDepth, Fragment.from(add));
		this.frontier[frontierDepth].match = match;
		// If the parent types match, and the entire node was moved, and
		// it's not open, close this frontier node right away.
		if (toEnd && openEndCount < 0 && parent && parent.type == this.frontier[this.depth].type && this.frontier.length > 1) this.closeFrontierNode();
		// Add new frontier nodes for any open nodes at the end.
		for (let i = 0, cur = fragment; i < openEndCount; i++) {
			let node = cur.lastChild;
			this.frontier.push({ type: node.type, match: node.contentMatchAt(node.childCount) });
			cur = node.content;
		}
		// Update `this.unplaced`. Drop the entire node from which we
		// placed it we got to its end, otherwise just drop the placed
		// nodes.
		this.unplaced =
			!toEnd ? new Slice(dropFromFragment(slice.content, sliceDepth, taken), slice.openStart, slice.openEnd)
			: sliceDepth == 0 ? Slice.empty
			: new Slice(dropFromFragment(slice.content, sliceDepth - 1, 1), sliceDepth - 1, openEndCount < 0 ? slice.openEnd : sliceDepth - 1);
	}
	mustMoveInline() {
		if (!this.$to.parent.isTextblock) return -1;
		let top = this.frontier[this.depth],
			level;
		if (
			!top.type.isTextblock ||
			!contentAfterFits(this.$to, this.$to.depth, top.type, top.match, false) ||
			(this.$to.depth == this.depth && (level = this.findCloseLevel(this.$to)) && level.depth == this.depth)
		)
			return -1;
		let { depth } = this.$to,
			after = this.$to.after(depth);
		while (depth > 1 && after == this.$to.end(--depth)) ++after;
		return after;
	}
	findCloseLevel($to) {
		scan: for (let i = Math.min(this.depth, $to.depth); i >= 0; i--) {
			let { match, type } = this.frontier[i];
			let dropInner = i < $to.depth && $to.end(i + 1) == $to.pos + ($to.depth - (i + 1));
			let fit = contentAfterFits($to, i, type, match, dropInner);
			if (!fit) continue;
			for (let d = i - 1; d >= 0; d--) {
				let { match, type } = this.frontier[d];
				let matches = contentAfterFits($to, d, type, match, true);
				if (!matches || matches.childCount) continue scan;
			}
			return { depth: i, fit, move: dropInner ? $to.doc.resolve($to.after(i + 1)) : $to };
		}
	}
	close($to) {
		let close = this.findCloseLevel($to);
		if (!close) return null;
		while (this.depth > close.depth) this.closeFrontierNode();
		if (close.fit.childCount) this.placed = addToFragment(this.placed, close.depth, close.fit);
		$to = close.move;
		for (let d = close.depth + 1; d <= $to.depth; d++) {
			let node = $to.node(d),
				add = node.type.contentMatch.fillBefore(node.content, true, $to.index(d));
			this.openFrontierNode(node.type, node.attrs, add);
		}
		return $to;
	}
	openFrontierNode(type, attrs = null, content) {
		let top = this.frontier[this.depth];
		top.match = top.match.matchType(type);
		this.placed = addToFragment(this.placed, this.depth, Fragment.from(type.create(attrs, content)));
		this.frontier.push({ type, match: type.contentMatch });
	}
	closeFrontierNode() {
		let open = this.frontier.pop();
		let add = open.match.fillBefore(Fragment.empty, true);
		if (add.childCount) this.placed = addToFragment(this.placed, this.frontier.length, add);
	}
}
function dropFromFragment(fragment, depth, count) {
	if (depth == 0) return fragment.cutByIndex(count, fragment.childCount);
	return fragment.replaceChild(0, fragment.firstChild.copy(dropFromFragment(fragment.firstChild.content, depth - 1, count)));
}
function addToFragment(fragment, depth, content) {
	if (depth == 0) return fragment.append(content);
	return fragment.replaceChild(fragment.childCount - 1, fragment.lastChild.copy(addToFragment(fragment.lastChild.content, depth - 1, content)));
}
function contentAt(fragment, depth) {
	for (let i = 0; i < depth; i++) fragment = fragment.firstChild.content;
	return fragment;
}
function closeNodeStart(node, openStart, openEnd) {
	if (openStart <= 0) return node;
	let frag = node.content;
	if (openStart > 1) frag = frag.replaceChild(0, closeNodeStart(frag.firstChild, openStart - 1, frag.childCount == 1 ? openEnd - 1 : 0));
	if (openStart > 0) {
		frag = node.type.contentMatch.fillBefore(frag).append(frag);
		if (openEnd <= 0) frag = frag.append(node.type.contentMatch.matchFragment(frag).fillBefore(Fragment.empty, true));
	}
	return node.copy(frag);
}
function contentAfterFits($to, depth, type, match, open) {
	let node = $to.node(depth),
		index = open ? $to.indexAfter(depth) : $to.index(depth);
	if (index == node.childCount && !type.compatibleContent(node.type)) return null;
	let fit = match.fillBefore(node.content, true, index);
	return fit && !invalidMarks(type, node.content, index) ? fit : null;
}
function invalidMarks(type, fragment, start) {
	for (let i = start; i < fragment.childCount; i++) if (!type.allowsMarks(fragment.child(i).marks)) return true;
	return false;
}
function definesContent(type) {
	return type.spec.defining || type.spec.definingForContent;
}
function replaceRange(tr, from, to, slice) {
	if (!slice.size) return tr.deleteRange(from, to);
	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, $to);
	// Can't replace the whole document, so remove 0 if it's present
	if (targetDepths[targetDepths.length - 1] == 0) targetDepths.pop();
	// Negative numbers represent not expansion over the whole node at
	// that depth, but replacing from $from.before(-D) to $to.pos.
	let preferredTarget = -($from.depth + 1);
	targetDepths.unshift(preferredTarget);
	// This loop picks a preferred target depth, if one of the covering
	// depths is not outside of a defining node, and adds negative
	// depths for any depth that has $from at its start and does not
	// cross a defining node.
	for (let d = $from.depth, pos = $from.pos - 1; d > 0; d--, pos--) {
		let spec = $from.node(d).type.spec;
		if (spec.defining || spec.definingAsContext || spec.isolating) break;
		if (targetDepths.indexOf(d) > -1) preferredTarget = d;
		else if ($from.before(d) == pos) targetDepths.splice(1, 0, -d);
	}
	// Try to fit each possible depth of the slice into each possible
	// target depth, starting with the preferred depths.
	let preferredTargetIndex = targetDepths.indexOf(preferredTarget);
	let leftNodes = [],
		preferredDepth = slice.openStart;
	for (let content = slice.content, i = 0; ; i++) {
		let node = content.firstChild;
		leftNodes.push(node);
		if (i == slice.openStart) break;
		content = node.content;
	}
	// Back up preferredDepth to cover defining textblocks directly
	// above it, possibly skipping a non-defining textblock.
	for (let d = preferredDepth - 1; d >= 0; d--) {
		let leftNode = leftNodes[d],
			def = definesContent(leftNode.type);
		if (def && !leftNode.sameMarkup($from.node(Math.abs(preferredTarget) - 1))) preferredDepth = d;
		else if (def || !leftNode.type.isTextblock) break;
	}
	for (let j = slice.openStart; j >= 0; j--) {
		let openDepth = (j + preferredDepth + 1) % (slice.openStart + 1);
		let insert = leftNodes[openDepth];
		if (!insert) continue;
		for (let i = 0; i < targetDepths.length; i++) {
			// Loop over possible expansion levels, starting with the
			// preferred one
			let targetDepth = targetDepths[(i + preferredTargetIndex) % targetDepths.length],
				expand = true;
			if (targetDepth < 0) {
				expand = false;
				targetDepth = -targetDepth;
			}
			let parent = $from.node(targetDepth - 1),
				index = $from.index(targetDepth - 1);
			if (parent.canReplaceWith(index, index, insert.type, insert.marks))
				return tr.replace($from.before(targetDepth), expand ? $to.after(targetDepth) : to, new Slice(closeFragment(slice.content, 0, slice.openStart, openDepth), openDepth, slice.openEnd));
		}
	}
	let startSteps = tr.steps.length;
	for (let i = targetDepths.length - 1; i >= 0; i--) {
		tr.replace(from, to, slice);
		if (tr.steps.length > startSteps) break;
		let depth = targetDepths[i];
		if (depth < 0) continue;
		from = $from.before(depth);
		to = $to.after(depth);
	}
}
function closeFragment(fragment, depth, oldOpen, newOpen, parent) {
	if (depth < oldOpen) {
		let first = fragment.firstChild;
		fragment = fragment.replaceChild(0, first.copy(closeFragment(first.content, depth + 1, oldOpen, newOpen, first)));
	}
	if (depth > newOpen) {
		let match = parent.contentMatchAt(0);
		let start = match.fillBefore(fragment).append(fragment);
		fragment = start.append(match.matchFragment(start).fillBefore(Fragment.empty, true));
	}
	return fragment;
}
function replaceRangeWith(tr, from, to, node) {
	if (!node.isInline && from == to && tr.doc.resolve(from).parent.content.size) {
		let point = insertPoint(tr.doc, from, node.type);
		if (point != null) from = to = point;
	}
	tr.replaceRange(from, to, new Slice(Fragment.from(node), 0, 0));
}
function deleteRange$1(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;
		if ((last && depth == 0) || $from.node(depth).type.contentMatch.validEnd) return tr.delete($from.start(depth), $to.end(depth));
		if (depth > 0 && (last || $from.node(depth - 1).canReplace($from.index(depth - 1), $to.indexAfter(depth - 1)))) return tr.delete($from.before(depth), $to.after(depth));
	}
	for (let d = 1; d <= $from.depth && d <= $to.depth; d++) {
		if (
			from - $from.start(d) == $from.depth - d &&
			to > $from.end(d) &&
			$to.end(d) - to != $to.depth - d &&
			$from.start(d - 1) == $to.start(d - 1) &&
			$from.node(d - 1).canReplace($from.index(d - 1), $to.index(d - 1))
		)
			return tr.delete($from.before(d), to);
	}
	tr.delete(from, to);
}
// Returns an array of all depths for which $from - $to spans the
// whole content of the nodes at that depth.
function coveredDepths($from, $to) {
	let result = [],
		minDepth = Math.min($from.depth, $to.depth);
	for (let d = minDepth; d >= 0; d--) {
		let start = $from.start(d);
		if (start < $from.pos - ($from.depth - d) || $to.end(d) > $to.pos + ($to.depth - d) || $from.node(d).type.spec.isolating || $to.node(d).type.spec.isolating) break;
		if (start == $to.start(d) || (d == $from.depth && d == $to.depth && $from.parent.inlineContent && $to.parent.inlineContent && d && $to.start(d - 1) == start - 1)) result.push(d);
	}
	return result;
}

/**
Update an attribute in a specific node.
*/
class AttrStep extends Step {
	/**
    Construct an attribute step.
    */
	constructor(
		/**
    The position of the target node.
    */
		pos,
		/**
    The attribute to set.
    */
		attr,
		// The attribute's new value.
		value,
	) {
		super();
		this.pos = pos;
		this.attr = attr;
		this.value = value;
	}
	apply(doc) {
		let node = doc.nodeAt(this.pos);
		if (!node) return StepResult.fail("No node at attribute step's position");
		let attrs = Object.create(null);
		for (let name in node.attrs) attrs[name] = node.attrs[name];
		attrs[this.attr] = this.value;
		let updated = node.type.create(attrs, null, node.marks);
		return StepResult.fromReplace(doc, this.pos, this.pos + 1, new Slice(Fragment.from(updated), 0, node.isLeaf ? 0 : 1));
	}
	getMap() {
		return StepMap.empty;
	}
	invert(doc) {
		return new AttrStep(this.pos, this.attr, doc.nodeAt(this.pos).attrs[this.attr]);
	}
	map(mapping) {
		let pos = mapping.mapResult(this.pos, 1);
		return pos.deletedAfter ? null : new AttrStep(pos.pos, this.attr, this.value);
	}
	toJSON() {
		return { stepType: "attr", pos: this.pos, attr: this.attr, value: this.value };
	}
	static fromJSON(schema, json) {
		if (typeof json.pos != "number" || typeof json.attr != "string") throw new RangeError("Invalid input for AttrStep.fromJSON");
		return new AttrStep(json.pos, json.attr, json.value);
	}
}
Step.jsonID("attr", AttrStep);
/**
Update an attribute in the doc node.
*/
class DocAttrStep extends Step {
	/**
    Construct an attribute step.
    */
	constructor(
		/**
    The attribute to set.
    */
		attr,
		// The attribute's new value.
		value,
	) {
		super();
		this.attr = attr;
		this.value = value;
	}
	apply(doc) {
		let attrs = Object.create(null);
		for (let name in doc.attrs) attrs[name] = doc.attrs[name];
		attrs[this.attr] = this.value;
		let updated = doc.type.create(attrs, doc.content, doc.marks);
		return StepResult.ok(updated);
	}
	getMap() {
		return StepMap.empty;
	}
	invert(doc) {
		return new DocAttrStep(this.attr, doc.attrs[this.attr]);
	}
	map(mapping) {
		return this;
	}
	toJSON() {
		return { stepType: "docAttr", attr: this.attr, value: this.value };
	}
	static fromJSON(schema, json) {
		if (typeof json.attr != "string") throw new RangeError("Invalid input for DocAttrStep.fromJSON");
		return new DocAttrStep(json.attr, json.value);
	}
}
Step.jsonID("docAttr", DocAttrStep);

/**
@internal
*/
let TransformError = class extends Error {};
TransformError = function TransformError(message) {
	let err = Error.call(this, message);
	err.__proto__ = TransformError.prototype;
	return err;
};
TransformError.prototype = Object.create(Error.prototype);
TransformError.prototype.constructor = TransformError;
TransformError.prototype.name = "TransformError";
/**
Abstraction to build up and track an array of
[steps](https://prosemirror.net/docs/ref/#transform.Step) representing a document transformation.

Most transforming methods return the `Transform` object itself, so
that they can be chained.
*/
class Transform {
	/**
    Create a transform that starts with the given document.
    */
	constructor(
		/**
    The current document (the result of applying the steps in the
    transform).
    */
		doc,
	) {
		this.doc = doc;
		/**
        The steps in this transform.
        */
		this.steps = [];
		/**
        The documents before each of the steps.
        */
		this.docs = [];
		/**
        A mapping with the maps for each of the steps in this transform.
        */
		this.mapping = new Mapping();
	}
	/**
    The starting document.
    */
	get before() {
		return this.docs.length ? this.docs[0] : this.doc;
	}
	/**
    Apply a new step in this transform, saving the result. Throws an
    error when the step fails.
    */
	step(step) {
		let result = this.maybeStep(step);
		if (result.failed) throw new TransformError(result.failed);
		return this;
	}
	/**
    Try to apply a step in this transformation, ignoring it if it
    fails. Returns the step result.
    */
	maybeStep(step) {
		let result = step.apply(this.doc);
		if (!result.failed) this.addStep(step, result.doc);
		return result;
	}
	/**
    True when the document has been changed (when there are any
    steps).
    */
	get docChanged() {
		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) {
		this.docs.push(this.doc);
		this.steps.push(step);
		this.mapping.appendMap(step.getMap());
		this.doc = doc;
	}
	/**
    Replace the part of the document between `from` and `to` with the
    given `slice`.
    */
	replace(from, to = from, slice = Slice.empty) {
		let step = replaceStep(this.doc, from, to, slice);
		if (step) this.step(step);
		return this;
	}
	/**
    Replace the given range with the given content, which may be a
    fragment, node, or array of nodes.
    */
	replaceWith(from, to, content) {
		return this.replace(from, to, new Slice(Fragment.from(content), 0, 0));
	}
	/**
    Delete the content between the given positions.
    */
	delete(from, to) {
		return this.replace(from, to, Slice.empty);
	}
	/**
    Insert the given content at the given position.
    */
	insert(pos, content) {
		return this.replaceWith(pos, pos, content);
	}
	/**
    Replace a range of the document with a given slice, using
    `from`, `to`, and the slice's
    [`openStart`](https://prosemirror.net/docs/ref/#model.Slice.openStart) property as hints, rather
    than fixed start and end points. This method may grow the
    replaced area or close open nodes in the slice in order to get a
    fit that is more in line with WYSIWYG expectations, by dropping
    fully covered parent nodes of the replaced region when they are
    marked [non-defining as
    context](https://prosemirror.net/docs/ref/#model.NodeSpec.definingAsContext), or including an
    open parent node from the slice that _is_ marked as [defining
    its content](https://prosemirror.net/docs/ref/#model.NodeSpec.definingForContent).
    
    This is the method, for example, to handle paste. The similar
    [`replace`](https://prosemirror.net/docs/ref/#transform.Transform.replace) method is a more
    primitive tool which will _not_ move the start and end of its given
    range, and is useful in situations where you need more precise
    control over what happens.
    */
	replaceRange(from, to, slice) {
		replaceRange(this, from, to, slice);
		return this;
	}
	/**
    Replace the given range with a node, but use `from` and `to` as
    hints, rather than precise positions. When from and to are the same
    and are at the start or end of a parent node in which the given
    node doesn't fit, this method may _move_ them out towards a parent
    that does allow the given node to be placed. When the given range
    completely covers a parent node, this method may completely replace
    that parent node.
    */
	replaceRangeWith(from, to, node) {
		replaceRangeWith(this, from, to, node);
		return this;
	}
	/**
    Delete the given range, expanding it to cover fully covered
    parent nodes until a valid replace is found.
    */
	deleteRange(from, to) {
		deleteRange$1(this, from, to);
		return this;
	}
	/**
    Split the content in the given range off from its parent, if there
    is sibling content before or after it, and move it up the tree to
    the depth specified by `target`. You'll probably want to use
    [`liftTarget`](https://prosemirror.net/docs/ref/#transform.liftTarget) to compute `target`, to make
    sure the lift is valid.
    */
	lift(range, target) {
		lift$2(this, range, target);
		return this;
	}
	/**
    Join the blocks around the given position. If depth is 2, their
    last and first siblings are also joined, and so on.
    */
	join(pos, depth = 1) {
		join(this, pos, depth);
		return this;
	}
	/**
    Wrap the given [range](https://prosemirror.net/docs/ref/#model.NodeRange) in the given set of wrappers.
    The wrappers are assumed to be valid in this position, and should
    probably be computed with [`findWrapping`](https://prosemirror.net/docs/ref/#transform.findWrapping).
    */
	wrap(range, wrappers) {
		wrap(this, range, wrappers);
		return this;
	}
	/**
    Set the type of all textblocks (partly) between `from` and `to` to
    the given node type with the given attributes.
    */
	setBlockType(from, to = from, type, attrs = null) {
		setBlockType$1(this, from, to, type, attrs);
		return this;
	}
	/**
    Change the type, attributes, and/or marks of the node at `pos`.
    When `type` isn't given, the existing node type is preserved,
    */
	setNodeMarkup(pos, type, attrs = null, marks) {
		setNodeMarkup(this, pos, type, attrs, marks);
		return this;
	}
	/**
    Set a single attribute on a given node to a new value.
    The `pos` addresses the document content. Use `setDocAttribute`
    to set attributes on the document itself.
    */
	setNodeAttribute(pos, attr, value) {
		this.step(new AttrStep(pos, attr, value));
		return this;
	}
	/**
    Set a single attribute on the document to a new value.
    */
	setDocAttribute(attr, value) {
		this.step(new DocAttrStep(attr, value));
		return this;
	}
	/**
    Add a mark to the node at position `pos`.
    */
	addNodeMark(pos, mark) {
		this.step(new AddNodeMarkStep(pos, mark));
		return this;
	}
	/**
    Remove a mark (or all marks of the given type) from the node at
    position `pos`.
    */
	removeNodeMark(pos, mark) {
		let node = this.doc.nodeAt(pos);
		if (!node) throw new RangeError("No node at position " + pos);
		if (mark instanceof Mark$1) {
			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]);
		}
		return this;
	}
	/**
    Split the node at the given position, and optionally, if `depth` is
    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 (with the outermost nodes coming first).
    */
	split(pos, depth = 1, typesAfter) {
		split(this, pos, depth, typesAfter);
		return this;
	}
	/**
    Add the given mark to the inline content between `from` and `to`.
    */
	addMark(from, to, mark) {
		addMark(this, from, to, mark);
		return this;
	}
	/**
    Remove marks from inline nodes between `from` and `to`. When
    `mark` is a single mark, remove precisely that mark. When it is
    a mark type, remove all marks of that type. When it is null,
    remove all marks of any type.
    */
	removeMark(from, to, mark) {
		removeMark(this, from, to, mark);
		return this;
	}
	/**
    Removes all marks and nodes from the content of the node at
    `pos` that don't match the given new parent node type. Accepts
    an optional starting [content match](https://prosemirror.net/docs/ref/#model.ContentMatch) as
    third argument.
    */
	clearIncompatible(pos, parentType, match) {
		clearIncompatible(this, pos, parentType, match);
		return this;
	}
}

const classesById = Object.create(null);
/**
Superclass for editor selections. Every selection type should
extend this. Should not be instantiated directly.
*/
class Selection {
	/**
    Initialize a selection with the head and anchor and ranges. If no
    ranges are given, constructs a single range across `$anchor` and
    `$head`.
    */
	constructor(
		/**
    The resolved anchor of the selection (the side that stays in
    place when the selection is modified).
    */
		$anchor,
		/**
    The resolved head of the selection (the side that moves when
    the selection is modified).
    */
		$head,
		ranges,
	) {
		this.$anchor = $anchor;
		this.$head = $head;
		this.ranges = ranges || [new SelectionRange($anchor.min($head), $anchor.max($head))];
	}
	/**
    The selection's anchor, as an unresolved position.
    */
	get anchor() {
		return this.$anchor.pos;
	}
	/**
    The selection's head.
    */
	get head() {
		return this.$head.pos;
	}
	/**
    The lower bound of the selection's main range.
    */
	get from() {
		return this.$from.pos;
	}
	/**
    The upper bound of the selection's main range.
    */
	get to() {
		return this.$to.pos;
	}
	/**
    The resolved lower  bound of the selection's main range.
    */
	get $from() {
		return this.ranges[0].$from;
	}
	/**
    The resolved upper bound of the selection's main range.
    */
	get $to() {
		return this.ranges[0].$to;
	}
	/**
    Indicates whether the selection contains any content.
    */
	get empty() {
		let ranges = this.ranges;
		for (let i = 0; i < ranges.length; i++) if (ranges[i].$from.pos != ranges[i].$to.pos) return false;
		return true;
	}
	/**
    Get the content of this selection as a slice.
    */
	content() {
		return this.$from.doc.slice(this.from, this.to, true);
	}
	/**
    Replace the selection with a slice or, if no slice is given,
    delete the selection. Will append to the given transaction.
    */
	replace(tr, content = Slice.empty) {
		// Put the new selection at the position after the inserted
		// content. When that ended in an inline node, search backwards,
		// to get the position after that node. If not, search forward.
		let lastNode = content.content.lastChild,
			lastParent = null;
		for (let i = 0; i < content.openEnd; i++) {
			lastParent = lastNode;
			lastNode = lastNode.lastChild;
		}
		let mapFrom = tr.steps.length,
			ranges = this.ranges;
		for (let i = 0; i < ranges.length; i++) {
			let { $from, $to } = ranges[i],
				mapping = tr.mapping.slice(mapFrom);
			tr.replaceRange(mapping.map($from.pos), mapping.map($to.pos), i ? Slice.empty : content);
			if (i == 0)
				selectionToInsertionEnd$1(
					tr,
					mapFrom,
					(
						lastNode ? lastNode.isInline : lastParent && lastParent.isTextblock
					) ?
						-1
					:	1,
				);
		}
	}
	/**
    Replace the selection with the given node, appending the changes
    to the given transaction.
    */
	replaceWith(tr, node) {
		let mapFrom = tr.steps.length,
			ranges = this.ranges;
		for (let i = 0; i < ranges.length; i++) {
			let { $from, $to } = ranges[i],
				mapping = tr.mapping.slice(mapFrom);
			let from = mapping.map($from.pos),
				to = mapping.map($to.pos);
			if (i) {
				tr.deleteRange(from, to);
			} else {
				tr.replaceRangeWith(from, to, node);
				selectionToInsertionEnd$1(tr, mapFrom, node.isInline ? -1 : 1);
			}
		}
	}
	/**
    Find a valid cursor or leaf node selection starting at the given
    position and searching back if `dir` is negative, and forward if
    positive. When `textOnly` is true, only consider cursor
    selections. Will return null when no valid selection position is
    found.
    */
	static findFrom($pos, dir, textOnly = false) {
		let inner = $pos.parent.inlineContent ? new TextSelection($pos) : findSelectionIn($pos.node(0), $pos.parent, $pos.pos, $pos.index(), dir, textOnly);
		if (inner) return inner;
		for (let depth = $pos.depth - 1; depth >= 0; depth--) {
			let found =
				dir < 0 ?
					findSelectionIn($pos.node(0), $pos.node(depth), $pos.before(depth + 1), $pos.index(depth), dir, textOnly)
				:	findSelectionIn($pos.node(0), $pos.node(depth), $pos.after(depth + 1), $pos.index(depth) + 1, dir, textOnly);
			if (found) return found;
		}
		return null;
	}
	/**
    Find a valid cursor or leaf node selection near the given
    position. Searches forward first by default, but if `bias` is
    negative, it will search backwards first.
    */
	static near($pos, bias = 1) {
		return this.findFrom($pos, bias) || this.findFrom($pos, -bias) || new AllSelection($pos.node(0));
	}
	/**
    Find the cursor or leaf node selection closest to the start of
    the given document. Will return an
    [`AllSelection`](https://prosemirror.net/docs/ref/#state.AllSelection) if no valid position
    exists.
    */
	static atStart(doc) {
		return findSelectionIn(doc, doc, 0, 0, 1) || new AllSelection(doc);
	}
	/**
    Find the cursor or leaf node selection closest to the end of the
    given document.
    */
	static atEnd(doc) {
		return findSelectionIn(doc, doc, doc.content.size, doc.childCount, -1) || new AllSelection(doc);
	}
	/**
    Deserialize the JSON representation of a selection. Must be
    implemented for custom classes (as a static class method).
    */
	static fromJSON(doc, json) {
		if (!json || !json.type) throw new RangeError("Invalid input for Selection.fromJSON");
		let cls = classesById[json.type];
		if (!cls) throw new RangeError(`No selection type ${json.type} defined`);
		return cls.fromJSON(doc, json);
	}
	/**
    To be able to deserialize selections from JSON, custom selection
    classes must register themselves with an ID string, so that they
    can be disambiguated. Try to pick something that's unlikely to
    clash with classes from other modules.
    */
	static jsonID(id, selectionClass) {
		if (id in classesById) throw new RangeError("Duplicate use of selection JSON ID " + id);
		classesById[id] = selectionClass;
		selectionClass.prototype.jsonID = id;
		return selectionClass;
	}
	/**
    Get a [bookmark](https://prosemirror.net/docs/ref/#state.SelectionBookmark) for this selection,
    which is a value that can be mapped without having access to a
    current document, and later resolved to a real selection for a
    given document again. (This is used mostly by the history to
    track and restore old selections.) The default implementation of
    this method just converts the selection to a text selection and
    returns the bookmark for that.
    */
	getBookmark() {
		return TextSelection.between(this.$anchor, this.$head).getBookmark();
	}
}
Selection.prototype.visible = true;
/**
Represents a selected range in a document.
*/
class SelectionRange {
	/**
    Create a range.
    */
	constructor(
		/**
    The lower bound of the range.
    */
		$from,
		/**
    The upper bound of the range.
    */
		$to,
	) {
		this.$from = $from;
		this.$to = $to;
	}
}
let warnedAboutTextSelection = false;
function checkTextSelection($pos) {
	if (!warnedAboutTextSelection && !$pos.parent.inlineContent) {
		warnedAboutTextSelection = true;
		console["warn"]("TextSelection endpoint not pointing into a node with inline content (" + $pos.parent.type.name + ")");
	}
}
/**
A text selection represents a classical editor selection, with a
head (the moving side) and anchor (immobile side), both of which
point into textblock nodes. It can be empty (a regular cursor
position).
*/
class TextSelection extends Selection {
	/**
    Construct a text selection between the given points.
    */
	constructor($anchor, $head = $anchor) {
		checkTextSelection($anchor);
		checkTextSelection($head);
		super($anchor, $head);
	}
	/**
    Returns a resolved position if this is a cursor selection (an
    empty text selection), and null otherwise.
    */
	get $cursor() {
		return this.$anchor.pos == this.$head.pos ? this.$head : null;
	}
	map(doc, mapping) {
		let $head = doc.resolve(mapping.map(this.head));
		if (!$head.parent.inlineContent) return Selection.near($head);
		let $anchor = doc.resolve(mapping.map(this.anchor));
		return new TextSelection($anchor.parent.inlineContent ? $anchor : $head, $head);
	}
	replace(tr, content = Slice.empty) {
		super.replace(tr, content);
		if (content == Slice.empty) {
			let marks = this.$from.marksAcross(this.$to);
			if (marks) tr.ensureMarks(marks);
		}
	}
	eq(other) {
		return other instanceof TextSelection && other.anchor == this.anchor && other.head == this.head;
	}
	getBookmark() {
		return new TextBookmark(this.anchor, this.head);
	}
	toJSON() {
		return { type: "text", anchor: this.anchor, head: this.head };
	}
	/**
    @internal
    */
	static fromJSON(doc, json) {
		if (typeof json.anchor != "number" || typeof json.head != "number") throw new RangeError("Invalid input for TextSelection.fromJSON");
		return new TextSelection(doc.resolve(json.anchor), doc.resolve(json.head));
	}
	/**
    Create a text selection from non-resolved positions.
    */
	static create(doc, anchor, head = anchor) {
		let $anchor = doc.resolve(anchor);
		return new this($anchor, head == anchor ? $anchor : doc.resolve(head));
	}
	/**
    Return a text selection that spans the given positions or, if
    they aren't text positions, find a text selection near them.
    `bias` determines whether the method searches forward (default)
    or backwards (negative number) first. Will fall back to calling
    [`Selection.near`](https://prosemirror.net/docs/ref/#state.Selection^near) when the document
    doesn't contain a valid text position.
    */
	static between($anchor, $head, bias) {
		let dPos = $anchor.pos - $head.pos;
		if (!bias || dPos) bias = dPos >= 0 ? 1 : -1;
		if (!$head.parent.inlineContent) {
			let found = Selection.findFrom($head, bias, true) || Selection.findFrom($head, -bias, true);
			if (found) $head = found.$head;
			else return Selection.near($head, bias);
		}
		if (!$anchor.parent.inlineContent) {
			if (dPos == 0) {
				$anchor = $head;
			} else {
				$anchor = (Selection.findFrom($anchor, -bias, true) || Selection.findFrom($anchor, bias, true)).$anchor;
				if ($anchor.pos < $head.pos != dPos < 0) $anchor = $head;
			}
		}
		return new TextSelection($anchor, $head);
	}
}
Selection.jsonID("text", TextSelection);
class TextBookmark {
	constructor(anchor, head) {
		this.anchor = anchor;
		this.head = head;
	}
	map(mapping) {
		return new TextBookmark(mapping.map(this.anchor), mapping.map(this.head));
	}
	resolve(doc) {
		return TextSelection.between(doc.resolve(this.anchor), doc.resolve(this.head));
	}
}
/**
A node selection is a selection that points at a single node. All
nodes marked [selectable](https://prosemirror.net/docs/ref/#model.NodeSpec.selectable) can be the
target of a node selection. In such a selection, `from` and `to`
point directly before and after the selected node, `anchor` equals
`from`, and `head` equals `to`..
*/
class NodeSelection extends Selection {
	/**
    Create a node selection. Does not verify the validity of its
    argument.
    */
	constructor($pos) {
		let node = $pos.nodeAfter;
		let $end = $pos.node(0).resolve($pos.pos + node.nodeSize);
		super($pos, $end);
		this.node = node;
	}
	map(doc, mapping) {
		let { deleted, pos } = mapping.mapResult(this.anchor);
		let $pos = doc.resolve(pos);
		if (deleted) return Selection.near($pos);
		return new NodeSelection($pos);
	}
	content() {
		return new Slice(Fragment.from(this.node), 0, 0);
	}
	eq(other) {
		return other instanceof NodeSelection && other.anchor == this.anchor;
	}
	toJSON() {
		return { type: "node", anchor: this.anchor };
	}
	getBookmark() {
		return new NodeBookmark(this.anchor);
	}
	/**
    @internal
    */
	static fromJSON(doc, json) {
		if (typeof json.anchor != "number") throw new RangeError("Invalid input for NodeSelection.fromJSON");
		return new NodeSelection(doc.resolve(json.anchor));
	}
	/**
    Create a node selection from non-resolved positions.
    */
	static create(doc, from) {
		return new NodeSelection(doc.resolve(from));
	}
	/**
    Determines whether the given node may be selected as a node
    selection.
    */
	static isSelectable(node) {
		return !node.isText && node.type.spec.selectable !== false;
	}
}
NodeSelection.prototype.visible = false;
Selection.jsonID("node", NodeSelection);
class NodeBookmark {
	constructor(anchor) {
		this.anchor = anchor;
	}
	map(mapping) {
		let { deleted, pos } = mapping.mapResult(this.anchor);
		return deleted ? new TextBookmark(pos, pos) : new NodeBookmark(pos);
	}
	resolve(doc) {
		let $pos = doc.resolve(this.anchor),
			node = $pos.nodeAfter;
		if (node && NodeSelection.isSelectable(node)) return new NodeSelection($pos);
		return Selection.near($pos);
	}
}
/**
A selection type that represents selecting the whole document
(which can not necessarily be expressed with a text selection, when
there are for example leaf block nodes at the start or end of the
document).
*/
class AllSelection extends Selection {
	/**
    Create an all-selection over the given document.
    */
	constructor(doc) {
		super(doc.resolve(0), doc.resolve(doc.content.size));
	}
	replace(tr, content = Slice.empty) {
		if (content == Slice.empty) {
			tr.delete(0, tr.doc.content.size);
			let sel = Selection.atStart(tr.doc);
			if (!sel.eq(tr.selection)) tr.setSelection(sel);
		} else {
			super.replace(tr, content);
		}
	}
	toJSON() {
		return { type: "all" };
	}
	/**
    @internal
    */
	static fromJSON(doc) {
		return new AllSelection(doc);
	}
	map(doc) {
		return new AllSelection(doc);
	}
	eq(other) {
		return other instanceof AllSelection;
	}
	getBookmark() {
		return AllBookmark;
	}
}
Selection.jsonID("all", AllSelection);
const AllBookmark = {
	map() {
		return this;
	},
	resolve(doc) {
		return new AllSelection(doc);
	},
};
// FIXME we'll need some awareness of text direction when scanning for selections
// Try to find a selection inside the given node. `pos` points at the
// position where the search starts. When `text` is true, only return
// text selections.
function findSelectionIn(doc, node, pos, index, dir, text = false) {
	if (node.inlineContent) return TextSelection.create(doc, pos);
	for (let i = index - (dir > 0 ? 0 : 1); dir > 0 ? i < node.childCount : i >= 0; i += dir) {
		let child = node.child(i);
		if (!child.isAtom) {
			let inner = findSelectionIn(doc, child, pos + dir, dir < 0 ? child.childCount : 0, dir, text);
			if (inner) return inner;
		} else if (!text && NodeSelection.isSelectable(child)) {
			return NodeSelection.create(doc, pos - (dir < 0 ? child.nodeSize : 0));
		}
		pos += child.nodeSize * dir;
	}
	return null;
}
function selectionToInsertionEnd$1(tr, startLen, bias) {
	let last = tr.steps.length - 1;
	if (last < startLen) return;
	let step = tr.steps[last];
	if (!(step instanceof ReplaceStep || step instanceof ReplaceAroundStep)) return;
	let map = tr.mapping.maps[last],
		end;
	map.forEach((_from, _to, _newFrom, newTo) => {
		if (end == null) end = newTo;
	});
	tr.setSelection(Selection.near(tr.doc.resolve(end), bias));
}

const UPDATED_SEL = 1,
	UPDATED_MARKS = 2,
	UPDATED_SCROLL = 4;
/**
An editor state transaction, which can be applied to a state to
create an updated state. Use
[`EditorState.tr`](https://prosemirror.net/docs/ref/#state.EditorState.tr) to create an instance.

Transactions track changes to the document (they are a subclass of
[`Transform`](https://prosemirror.net/docs/ref/#transform.Transform)), but also other state changes,
like selection updates and adjustments of the set of [stored
marks](https://prosemirror.net/docs/ref/#state.EditorState.storedMarks). In addition, you can store
metadata properties in a transaction, which are extra pieces of
information that client code or plugins can use to describe what a
transaction represents, so that they can update their [own
state](https://prosemirror.net/docs/ref/#state.StateField) accordingly.

The [editor view](https://prosemirror.net/docs/ref/#view.EditorView) uses a few metadata
properties: it will attach a property `"pointer"` with the value
`true` to selection transactions directly caused by mouse or touch
input, a `"composition"` property holding an ID identifying the
composition that caused it to transactions caused by composed DOM
input, and a `"uiEvent"` property of that may be `"paste"`,
`"cut"`, or `"drop"`.
*/
class Transaction extends Transform {
	/**
    @internal
    */
	constructor(state) {
		super(state.doc);
		// The step count for which the current selection is valid.
		this.curSelectionFor = 0;
		// Bitfield to track which aspects of the state were updated by
		// this transaction.
		this.updated = 0;
		// Object used to store metadata properties for the transaction.
		this.meta = Object.create(null);
		this.time = Date.now();
		this.curSelection = state.selection;
		this.storedMarks = state.storedMarks;
	}
	/**
    The transaction's current selection. This defaults to the editor
    selection [mapped](https://prosemirror.net/docs/ref/#state.Selection.map) through the steps in the
    transaction, but can be overwritten with
    [`setSelection`](https://prosemirror.net/docs/ref/#state.Transaction.setSelection).
    */
	get selection() {
		if (this.curSelectionFor < this.steps.length) {
			this.curSelection = this.curSelection.map(this.doc, this.mapping.slice(this.curSelectionFor));
			this.curSelectionFor = this.steps.length;
		}
		return this.curSelection;
	}
	/**
    Update the transaction's current selection. Will determine the
    selection that the editor gets when the transaction is applied.
    */
	setSelection(selection) {
		if (selection.$from.doc != this.doc) throw new RangeError("Selection passed to setSelection must point at the current document");
		this.curSelection = selection;
		this.curSelectionFor = this.steps.length;
		this.updated = (this.updated | UPDATED_SEL) & ~UPDATED_MARKS;
		this.storedMarks = null;
		return this;
	}
	/**
    Whether the selection was explicitly updated by this transaction.
    */
	get selectionSet() {
		return (this.updated & UPDATED_SEL) > 0;
	}
	/**
    Set the current stored marks.
    */
	setStoredMarks(marks) {
		this.storedMarks = marks;
		this.updated |= UPDATED_MARKS;
		return this;
	}
	/**
    Make sure the current stored marks or, if that is null, the marks
    at the selection, match the given set of marks. Does nothing if
    this is already the case.
    */
	ensureMarks(marks) {
		if (!Mark$1.sameSet(this.storedMarks || this.selection.$from.marks(), marks)) this.setStoredMarks(marks);
		return this;
	}
	/**
    Add a mark to the set of stored marks.
    */
	addStoredMark(mark) {
		return this.ensureMarks(mark.addToSet(this.storedMarks || this.selection.$head.marks()));
	}
	/**
    Remove a mark or mark type from the set of stored marks.
    */
	removeStoredMark(mark) {
		return this.ensureMarks(mark.removeFromSet(this.storedMarks || this.selection.$head.marks()));
	}
	/**
    Whether the stored marks were explicitly set for this transaction.
    */
	get storedMarksSet() {
		return (this.updated & UPDATED_MARKS) > 0;
	}
	/**
    @internal
    */
	addStep(step, doc) {
		super.addStep(step, doc);
		this.updated = this.updated & ~UPDATED_MARKS;
		this.storedMarks = null;
	}
	/**
    Update the timestamp for the transaction.
    */
	setTime(time) {
		this.time = time;
		return this;
	}
	/**
    Replace the current selection with the given slice.
    */
	replaceSelection(slice) {
		this.selection.replace(this, slice);
		return this;
	}
	/**
    Replace the selection with the given node. When `inheritMarks` is
    true and the content is inline, it inherits the marks from the
    place where it is inserted.
    */
	replaceSelectionWith(node, inheritMarks = true) {
		let selection = this.selection;
		if (inheritMarks) node = node.mark(this.storedMarks || (selection.empty ? selection.$from.marks() : selection.$from.marksAcross(selection.$to) || Mark$1.none));
		selection.replaceWith(this, node);
		return this;
	}
	/**
    Delete the selection.
    */
	deleteSelection() {
		this.selection.replace(this);
		return this;
	}
	/**
    Replace the given range, or the selection if no range is given,
    with a text node containing the given string.
    */
	insertText(text, from, to) {
		let schema = this.doc.type.schema;
		if (from == null) {
			if (!text) return this.deleteSelection();
			return this.replaceSelectionWith(schema.text(text), true);
		} else {
			if (to == null) to = from;
			if (!text) return this.deleteRange(from, to);
			let marks = this.storedMarks;
			if (!marks) {
				let $from = this.doc.resolve(from);
				marks = to == from ? $from.marks() : $from.marksAcross(this.doc.resolve(to));
			}
			this.replaceRangeWith(from, to, schema.text(text, marks));
			if (!this.selection.empty && this.selection.to == from + text.length) this.setSelection(Selection.near(this.selection.$to));
			return this;
		}
	}
	/**
    Store a metadata property in this transaction, keyed either by
    name or by plugin.
    */
	setMeta(key, value) {
		this.meta[typeof key == "string" ? key : key.key] = value;
		return this;
	}
	/**
    Retrieve a metadata property for a given name or plugin.
    */
	getMeta(key) {
		return this.meta[typeof key == "string" ? key : key.key];
	}
	/**
    Returns true if this transaction doesn't contain any metadata,
    and can thus safely be extended.
    */
	get isGeneric() {
		for (let _ in this.meta) return false;
		return true;
	}
	/**
    Indicate that the editor should scroll the selection into view
    when updated to the state produced by this transaction.
    */
	scrollIntoView() {
		this.updated |= UPDATED_SCROLL;
		return this;
	}
	/**
    True when this transaction has had `scrollIntoView` called on it.
    */
	get scrolledIntoView() {
		return (this.updated & UPDATED_SCROLL) > 0;
	}
}

function bind(f, self) {
	return !self || !f ? f : f.bind(self);
}
class FieldDesc {
	constructor(name, desc, self) {
		this.name = name;
		this.init = bind(desc.init, self);
		this.apply = bind(desc.apply, self);
	}
}
const baseFields = [
	new FieldDesc("doc", {
		init(config) {
			return config.doc || config.schema.topNodeType.createAndFill();
		},
		apply(tr) {
			return tr.doc;
		},
	}),
	new FieldDesc("selection", {
		init(config, instance) {
			return config.selection || Selection.atStart(instance.doc);
		},
		apply(tr) {
			return tr.selection;
		},
	}),
	new FieldDesc("storedMarks", {
		init(config) {
			return config.storedMarks || null;
		},
		apply(tr, _marks, _old, state) {
			return state.selection.$cursor ? tr.storedMarks : null;
		},
	}),
	new FieldDesc("scrollToSelection", {
		init() {
			return 0;
		},
		apply(tr, prev) {
			return tr.scrolledIntoView ? prev + 1 : prev;
		},
	}),
];
// Object wrapping the part of a state object that stays the same
// across transactions. Stored in the state's `config` property.
class Configuration {
	constructor(schema, plugins) {
		this.schema = schema;
		this.plugins = [];
		this.pluginsByKey = Object.create(null);
		this.fields = baseFields.slice();
		if (plugins)
			plugins.forEach((plugin) => {
				if (this.pluginsByKey[plugin.key]) throw new RangeError("Adding different instances of a keyed plugin (" + plugin.key + ")");
				this.plugins.push(plugin);
				this.pluginsByKey[plugin.key] = plugin;
				if (plugin.spec.state) this.fields.push(new FieldDesc(plugin.key, plugin.spec.state, plugin));
			});
	}
}
/**
The state of a ProseMirror editor is represented by an object of
this type. A state is a persistent data structure—it isn't
updated, but rather a new state value is computed from an old one
using the [`apply`](https://prosemirror.net/docs/ref/#state.EditorState.apply) method.

A state holds a number of built-in fields, and plugins can
[define](https://prosemirror.net/docs/ref/#state.PluginSpec.state) additional fields.
*/
class EditorState {
	/**
    @internal
    */
	constructor(
		/**
    @internal
    */
		config,
	) {
		this.config = config;
	}
	/**
    The schema of the state's document.
    */
	get schema() {
		return this.config.schema;
	}
	/**
    The plugins that are active in this state.
    */
	get plugins() {
		return this.config.plugins;
	}
	/**
    Apply the given transaction to produce a new state.
    */
	apply(tr) {
		return this.applyTransaction(tr).state;
	}
	/**
    @internal
    */
	filterTransaction(tr, ignore = -1) {
		for (let i = 0; i < this.config.plugins.length; i++)
			if (i != ignore) {
				let plugin = this.config.plugins[i];
				if (plugin.spec.filterTransaction && !plugin.spec.filterTransaction.call(plugin, tr, this)) return false;
			}
		return true;
	}
	/**
    Verbose variant of [`apply`](https://prosemirror.net/docs/ref/#state.EditorState.apply) that
    returns the precise transactions that were applied (which might
    be influenced by the [transaction
    hooks](https://prosemirror.net/docs/ref/#state.PluginSpec.filterTransaction) of
    plugins) along with the new state.
    */
	applyTransaction(rootTr) {
		if (!this.filterTransaction(rootTr)) return { state: this, transactions: [] };
		let trs = [rootTr],
			newState = this.applyInner(rootTr),
			seen = null;
		// This loop repeatedly gives plugins a chance to respond to
		// transactions as new transactions are added, making sure to only
		// pass the transactions the plugin did not see before.
		for (;;) {
			let haveNew = false;
			for (let i = 0; i < this.config.plugins.length; i++) {
				let plugin = this.config.plugins[i];
				if (plugin.spec.appendTransaction) {
					let n = seen ? seen[i].n : 0,
						oldState = seen ? seen[i].state : this;
					let tr = n < trs.length && plugin.spec.appendTransaction.call(plugin, n ? trs.slice(n) : trs, oldState, newState);
					if (tr && newState.filterTransaction(tr, i)) {
						tr.setMeta("appendedTransaction", rootTr);
						if (!seen) {
							seen = [];
							for (let j = 0; j < this.config.plugins.length; j++) seen.push(j < i ? { state: newState, n: trs.length } : { state: this, n: 0 });
						}
						trs.push(tr);
						newState = newState.applyInner(tr);
						haveNew = true;
					}
					if (seen) seen[i] = { state: newState, n: trs.length };
				}
			}
			if (!haveNew) return { state: newState, transactions: trs };
		}
	}
	/**
    @internal
    */
	applyInner(tr) {
		if (!tr.before.eq(this.doc)) throw new RangeError("Applying a mismatched transaction");
		let newInstance = new EditorState(this.config),
			fields = this.config.fields;
		for (let i = 0; i < fields.length; i++) {
			let field = fields[i];
			newInstance[field.name] = field.apply(tr, this[field.name], this, newInstance);
		}
		return newInstance;
	}
	/**
    Accessor that constructs and returns a new [transaction](https://prosemirror.net/docs/ref/#state.Transaction) from this state.
    */
	get tr() {
		return new Transaction(this);
	}
	/**
    Create a new state.
    */
	static create(config) {
		let $config = new Configuration(config.doc ? config.doc.type.schema : config.schema, config.plugins);
		let instance = new EditorState($config);
		for (let i = 0; i < $config.fields.length; i++) instance[$config.fields[i].name] = $config.fields[i].init(config, instance);
		return instance;
	}
	/**
    Create a new state based on this one, but with an adjusted set
    of active plugins. State fields that exist in both sets of
    plugins are kept unchanged. Those that no longer exist are
    dropped, and those that are new are initialized using their
    [`init`](https://prosemirror.net/docs/ref/#state.StateField.init) method, passing in the new
    configuration object..
    */
	reconfigure(config) {
		let $config = new Configuration(this.schema, config.plugins);
		let fields = $config.fields,
			instance = new EditorState($config);
		for (let i = 0; i < fields.length; i++) {
			let name = fields[i].name;
			instance[name] = this.hasOwnProperty(name) ? this[name] : fields[i].init(config, instance);
		}
		return instance;
	}
	/**
    Serialize this state to JSON. If you want to serialize the state
    of plugins, pass an object mapping property names to use in the
    resulting JSON object to plugin objects. The argument may also be
    a string or number, in which case it is ignored, to support the
    way `JSON.stringify` calls `toString` methods.
    */
	toJSON(pluginFields) {
		let result = { doc: this.doc.toJSON(), selection: this.selection.toJSON() };
		if (this.storedMarks) result.storedMarks = this.storedMarks.map((m) => m.toJSON());
		if (pluginFields && typeof pluginFields == "object")
			for (let prop in pluginFields) {
				if (prop == "doc" || prop == "selection") throw new RangeError("The JSON fields `doc` and `selection` are reserved");
				let plugin = pluginFields[prop],
					state = plugin.spec.state;
				if (state && state.toJSON) result[prop] = state.toJSON.call(plugin, this[plugin.key]);
			}
		return result;
	}
	/**
    Deserialize a JSON representation of a state. `config` should
    have at least a `schema` field, and should contain array of
    plugins to initialize the state with. `pluginFields` can be used
    to deserialize the state of plugins, by associating plugin
    instances with the property names they use in the JSON object.
    */
	static fromJSON(config, json, pluginFields) {
		if (!json) throw new RangeError("Invalid input for EditorState.fromJSON");
		if (!config.schema) throw new RangeError("Required config field 'schema' missing");
		let $config = new Configuration(config.schema, config.plugins);
		let instance = new EditorState($config);
		$config.fields.forEach((field) => {
			if (field.name == "doc") {
				instance.doc = Node.fromJSON(config.schema, json.doc);
			} else if (field.name == "selection") {
				instance.selection = Selection.fromJSON(instance.doc, json.selection);
			} else if (field.name == "storedMarks") {
				if (json.storedMarks) instance.storedMarks = json.storedMarks.map(config.schema.markFromJSON);
			} else {
				if (pluginFields)
					for (let prop in pluginFields) {
						let plugin = pluginFields[prop],
							state = plugin.spec.state;
						if (plugin.key == field.name && state && state.fromJSON && Object.prototype.hasOwnProperty.call(json, prop)) {
							instance[field.name] = state.fromJSON.call(plugin, config, json[prop], instance);
							return;
						}
					}
				instance[field.name] = field.init(config, instance);
			}
		});
		return instance;
	}
}

function bindProps(obj, self, target) {
	for (let prop in obj) {
		let val = obj[prop];
		if (val instanceof Function) val = val.bind(self);
		else if (prop == "handleDOMEvents") val = bindProps(val, self, {});
		target[prop] = val;
	}
	return target;
}
/**
Plugins bundle functionality that can be added to an editor.
They are part of the [editor state](https://prosemirror.net/docs/ref/#state.EditorState) and
may influence that state and the view that contains it.
*/
class Plugin {
	/**
    Create a plugin.
    */
	constructor(
		/**
    The plugin's [spec object](https://prosemirror.net/docs/ref/#state.PluginSpec).
    */
		spec,
	) {
		this.spec = spec;
		/**
        The [props](https://prosemirror.net/docs/ref/#view.EditorProps) exported by this plugin.
        */
		this.props = {};
		if (spec.props) bindProps(spec.props, this, this.props);
		this.key = spec.key ? spec.key.key : createKey("plugin");
	}
	/**
    Extract the plugin's state field from an editor state.
    */
	getState(state) {
		return state[this.key];
	}
}
const keys = Object.create(null);
function createKey(name) {
	if (name in keys) return name + "$" + ++keys[name];
	keys[name] = 0;
	return name + "$";
}
/**
A key is used to [tag](https://prosemirror.net/docs/ref/#state.PluginSpec.key) plugins in a way
that makes it possible to find them, given an editor state.
Assigning a key does mean only one plugin of that type can be
active in a state.
*/
class PluginKey {
	/**
    Create a plugin key.
    */
	constructor(name = "key") {
		this.key = createKey(name);
	}
	/**
    Get the active plugin with this key, if any, from an editor
    state.
    */
	get(state) {
		return state.config.pluginsByKey[this.key];
	}
	/**
    Get the plugin's state from an editor state.
    */
	getState(state) {
		return state[this.key];
	}
}

/**
Delete the selection, if there is one.
*/
const deleteSelection$1 = (state, dispatch) => {
	if (state.selection.empty) return false;
	if (dispatch) dispatch(state.tr.deleteSelection().scrollIntoView());
	return true;
};
function atBlockStart(state, view) {
	let { $cursor } = state.selection;
	if (!$cursor || (view ? !view.endOfTextblock("backward", state) : $cursor.parentOffset > 0)) return null;
	return $cursor;
}
/**
If the selection is empty and at the start of a textblock, try to
reduce the distance between that block and the one before it—if
there's a block directly before it that can be joined, join them.
If not, try to move the selected block closer to the next one in
the document structure by lifting it out of its parent or moving it
into a parent of the previous block. Will use the view for accurate
(bidi-aware) start-of-textblock detection if given.
*/
const joinBackward$1 = (state, dispatch, view) => {
	let $cursor = atBlockStart(state, view);
	if (!$cursor) return false;
	let $cut = findCutBefore($cursor);
	// If there is no node before this, try to lift
	if (!$cut) {
		let range = $cursor.blockRange(),
			target = range && liftTarget(range);
		if (target == null) return false;
		if (dispatch) dispatch(state.tr.lift(range, target).scrollIntoView());
		return true;
	}
	let before = $cut.nodeBefore;
	// Apply the joining algorithm
	if (deleteBarrier(state, $cut, dispatch, -1)) return true;
	// If the node below has no content and the node above is
	// selectable, delete the node below and select the one above.
	if ($cursor.parent.content.size == 0 && (textblockAt(before, "end") || NodeSelection.isSelectable(before))) {
		for (let depth = $cursor.depth; ; depth--) {
			let delStep = replaceStep(state.doc, $cursor.before(depth), $cursor.after(depth), Slice.empty);
			if (delStep && delStep.slice.size < delStep.to - delStep.from) {
				if (dispatch) {
					let tr = state.tr.step(delStep);
					tr.setSelection(textblockAt(before, "end") ? Selection.findFrom(tr.doc.resolve(tr.mapping.map($cut.pos, -1)), -1) : NodeSelection.create(tr.doc, $cut.pos - before.nodeSize));
					dispatch(tr.scrollIntoView());
				}
				return true;
			}
			if (depth == 1 || $cursor.node(depth - 1).childCount > 1) break;
		}
	}
	// If the node before is an atom, delete it
	if (before.isAtom && $cut.depth == $cursor.depth - 1) {
		if (dispatch) dispatch(state.tr.delete($cut.pos - before.nodeSize, $cut.pos).scrollIntoView());
		return true;
	}
	return false;
};
/**
A more limited form of [`joinBackward`](https://prosemirror.net/docs/ref/#commands.joinBackward)
that only tries to join the current textblock to the one before
it, if the cursor is at the start of a textblock.
*/
const joinTextblockBackward$1 = (state, dispatch, view) => {
	let $cursor = atBlockStart(state, view);
	if (!$cursor) return false;
	let $cut = findCutBefore($cursor);
	return $cut ? joinTextblocksAround(state, $cut, dispatch) : false;
};
/**
A more limited form of [`joinForward`](https://prosemirror.net/docs/ref/#commands.joinForward)
that only tries to join the current textblock to the one after
it, if the cursor is at the end of a textblock.
*/
const joinTextblockForward$1 = (state, dispatch, view) => {
	let $cursor = atBlockEnd(state, view);
	if (!$cursor) return false;
	let $cut = findCutAfter($cursor);
	return $cut ? joinTextblocksAround(state, $cut, dispatch) : false;
};
function joinTextblocksAround(state, $cut, dispatch) {
	let before = $cut.nodeBefore,
		beforeText = before,
		beforePos = $cut.pos - 1;
	for (; !beforeText.isTextblock; beforePos--) {
		if (beforeText.type.spec.isolating) return false;
		let child = beforeText.lastChild;
		if (!child) return false;
		beforeText = child;
	}
	let after = $cut.nodeAfter,
		afterText = after,
		afterPos = $cut.pos + 1;
	for (; !afterText.isTextblock; afterPos++) {
		if (afterText.type.spec.isolating) return false;
		let child = afterText.firstChild;
		if (!child) return false;
		afterText = child;
	}
	let step = replaceStep(state.doc, beforePos, afterPos, Slice.empty);
	if (!step || step.from != beforePos || (step instanceof ReplaceStep && step.slice.size >= afterPos - beforePos)) return false;
	if (dispatch) {
		let tr = state.tr.step(step);
		tr.setSelection(TextSelection.create(tr.doc, beforePos));
		dispatch(tr.scrollIntoView());
	}
	return true;
}
function textblockAt(node, side, only = false) {
	for (let scan = node; scan; scan = side == "start" ? scan.firstChild : scan.lastChild) {
		if (scan.isTextblock) return true;
		if (only && scan.childCount != 1) return false;
	}
	return false;
}
/**
When the selection is empty and at the start of a textblock, select
the node before that textblock, if possible. This is intended to be
bound to keys like backspace, after
[`joinBackward`](https://prosemirror.net/docs/ref/#commands.joinBackward) or other deleting
commands, as a fall-back behavior when the schema doesn't allow
deletion at the selected point.
*/
const selectNodeBackward$1 = (state, dispatch, view) => {
	let { $head, empty } = state.selection,
		$cut = $head;
	if (!empty) return false;
	if ($head.parent.isTextblock) {
		if (view ? !view.endOfTextblock("backward", state) : $head.parentOffset > 0) return false;
		$cut = findCutBefore($head);
	}
	let node = $cut && $cut.nodeBefore;
	if (!node || !NodeSelection.isSelectable(node)) return false;
	if (dispatch) dispatch(state.tr.setSelection(NodeSelection.create(state.doc, $cut.pos - node.nodeSize)).scrollIntoView());
	return true;
};
function findCutBefore($pos) {
	if (!$pos.parent.type.spec.isolating)
		for (let i = $pos.depth - 1; i >= 0; i--) {
			if ($pos.index(i) > 0) return $pos.doc.resolve($pos.before(i + 1));
			if ($pos.node(i).type.spec.isolating) break;
		}
	return null;
}
function atBlockEnd(state, view) {
	let { $cursor } = state.selection;
	if (!$cursor || (view ? !view.endOfTextblock("forward", state) : $cursor.parentOffset < $cursor.parent.content.size)) return null;
	return $cursor;
}
/**
If the selection is empty and the cursor is at the end of a
textblock, try to reduce or remove the boundary between that block
and the one after it, either by joining them or by moving the other
block closer to this one in the tree structure. Will use the view
for accurate start-of-textblock detection if given.
*/
const joinForward$1 = (state, dispatch, view) => {
	let $cursor = atBlockEnd(state, view);
	if (!$cursor) return false;
	let $cut = findCutAfter($cursor);
	// If there is no node after this, there's nothing to do
	if (!$cut) return false;
	let after = $cut.nodeAfter;
	// Try the joining algorithm
	if (deleteBarrier(state, $cut, dispatch, 1)) return true;
	// If the node above has no content and the node below is
	// selectable, delete the node above and select the one below.
	if ($cursor.parent.content.size == 0 && (textblockAt(after, "start") || NodeSelection.isSelectable(after))) {
		let delStep = replaceStep(state.doc, $cursor.before(), $cursor.after(), Slice.empty);
		if (delStep && delStep.slice.size < delStep.to - delStep.from) {
			if (dispatch) {
				let tr = state.tr.step(delStep);
				tr.setSelection(textblockAt(after, "start") ? Selection.findFrom(tr.doc.resolve(tr.mapping.map($cut.pos)), 1) : NodeSelection.create(tr.doc, tr.mapping.map($cut.pos)));
				dispatch(tr.scrollIntoView());
			}
			return true;
		}
	}
	// If the next node is an atom, delete it
	if (after.isAtom && $cut.depth == $cursor.depth - 1) {
		if (dispatch) dispatch(state.tr.delete($cut.pos, $cut.pos + after.nodeSize).scrollIntoView());
		return true;
	}
	return false;
};
/**
When the selection is empty and at the end of a textblock, select
the node coming after that textblock, if possible. This is intended
to be bound to keys like delete, after
[`joinForward`](https://prosemirror.net/docs/ref/#commands.joinForward) and similar deleting
commands, to provide a fall-back behavior when the schema doesn't
allow deletion at the selected point.
*/
const selectNodeForward$1 = (state, dispatch, view) => {
	let { $head, empty } = state.selection,
		$cut = $head;
	if (!empty) return false;
	if ($head.parent.isTextblock) {
		if (view ? !view.endOfTextblock("forward", state) : $head.parentOffset < $head.parent.content.size) return false;
		$cut = findCutAfter($head);
	}
	let node = $cut && $cut.nodeAfter;
	if (!node || !NodeSelection.isSelectable(node)) return false;
	if (dispatch) dispatch(state.tr.setSelection(NodeSelection.create(state.doc, $cut.pos)).scrollIntoView());
	return true;
};
function findCutAfter($pos) {
	if (!$pos.parent.type.spec.isolating)
		for (let i = $pos.depth - 1; i >= 0; i--) {
			let parent = $pos.node(i);
			if ($pos.index(i) + 1 < parent.childCount) return $pos.doc.resolve($pos.after(i + 1));
			if (parent.type.spec.isolating) break;
		}
	return null;
}
/**
Join the selected block or, if there is a text selection, the
closest ancestor block of the selection that can be joined, with
the sibling above it.
*/
const joinUp$1 = (state, dispatch) => {
	let sel = state.selection,
		nodeSel = sel instanceof NodeSelection,
		point;
	if (nodeSel) {
		if (sel.node.isTextblock || !canJoin(state.doc, sel.from)) return false;
		point = sel.from;
	} else {
		point = joinPoint(state.doc, sel.from, -1);
		if (point == null) return false;
	}
	if (dispatch) {
		let tr = state.tr.join(point);
		if (nodeSel) tr.setSelection(NodeSelection.create(tr.doc, point - state.doc.resolve(point).nodeBefore.nodeSize));
		dispatch(tr.scrollIntoView());
	}
	return true;
};
/**
Join the selected block, or the closest ancestor of the selection
that can be joined, with the sibling after it.
*/
const joinDown$1 = (state, dispatch) => {
	let sel = state.selection,
		point;
	if (sel instanceof NodeSelection) {
		if (sel.node.isTextblock || !canJoin(state.doc, sel.to)) return false;
		point = sel.to;
	} else {
		point = joinPoint(state.doc, sel.to, 1);
		if (point == null) return false;
	}
	if (dispatch) dispatch(state.tr.join(point).scrollIntoView());
	return true;
};
/**
Lift the selected block, or the closest ancestor block of the
selection that can be lifted, out of its parent node.
*/
const lift$1 = (state, dispatch) => {
	let { $from, $to } = state.selection;
	let range = $from.blockRange($to),
		target = range && liftTarget(range);
	if (target == null) return false;
	if (dispatch) dispatch(state.tr.lift(range, target).scrollIntoView());
	return true;
};
/**
If the selection is in a node whose type has a truthy
[`code`](https://prosemirror.net/docs/ref/#model.NodeSpec.code) property in its spec, replace the
selection with a newline character.
*/
const newlineInCode$1 = (state, dispatch) => {
	let { $head, $anchor } = state.selection;
	if (!$head.parent.type.spec.code || !$head.sameParent($anchor)) return false;
	if (dispatch) dispatch(state.tr.insertText("\n").scrollIntoView());
	return true;
};
function defaultBlockAt$1(match) {
	for (let i = 0; i < match.edgeCount; i++) {
		let { type } = match.edge(i);
		if (type.isTextblock && !type.hasRequiredAttrs()) return type;
	}
	return null;
}
/**
When the selection is in a node with a truthy
[`code`](https://prosemirror.net/docs/ref/#model.NodeSpec.code) property in its spec, create a
default block after the code block, and move the cursor there.
*/
const exitCode$1 = (state, dispatch) => {
	let { $head, $anchor } = state.selection;
	if (!$head.parent.type.spec.code || !$head.sameParent($anchor)) return false;
	let above = $head.node(-1),
		after = $head.indexAfter(-1),
		type = defaultBlockAt$1(above.contentMatchAt(after));
	if (!type || !above.canReplaceWith(after, after, type)) return false;
	if (dispatch) {
		let pos = $head.after(),
			tr = state.tr.replaceWith(pos, pos, type.createAndFill());
		tr.setSelection(Selection.near(tr.doc.resolve(pos), 1));
		dispatch(tr.scrollIntoView());
	}
	return true;
};
/**
If a block node is selected, create an empty paragraph before (if
it is its parent's first child) or after it.
*/
const createParagraphNear$1 = (state, dispatch) => {
	let sel = state.selection,
		{ $from, $to } = sel;
	if (sel instanceof AllSelection || $from.parent.inlineContent || $to.parent.inlineContent) return false;
	let type = defaultBlockAt$1($to.parent.contentMatchAt($to.indexAfter()));
	if (!type || !type.isTextblock) return false;
	if (dispatch) {
		let side = (!$from.parentOffset && $to.index() < $to.parent.childCount ? $from : $to).pos;
		let tr = state.tr.insert(side, type.createAndFill());
		tr.setSelection(TextSelection.create(tr.doc, side + 1));
		dispatch(tr.scrollIntoView());
	}
	return true;
};
/**
If the cursor is in an empty textblock that can be lifted, lift the
block.
*/
const liftEmptyBlock$1 = (state, dispatch) => {
	let { $cursor } = state.selection;
	if (!$cursor || $cursor.parent.content.size) return false;
	if ($cursor.depth > 1 && $cursor.after() != $cursor.end(-1)) {
		let before = $cursor.before();
		if (canSplit(state.doc, before)) {
			if (dispatch) dispatch(state.tr.split(before).scrollIntoView());
			return true;
		}
	}
	let range = $cursor.blockRange(),
		target = range && liftTarget(range);
	if (target == null) return false;
	if (dispatch) dispatch(state.tr.lift(range, target).scrollIntoView());
	return true;
};
/**
Create a variant of [`splitBlock`](https://prosemirror.net/docs/ref/#commands.splitBlock) that uses
a custom function to determine the type of the newly split off block.
*/
function splitBlockAs(splitNode) {
	return (state, dispatch) => {
		let { $from, $to } = state.selection;
		if (state.selection instanceof NodeSelection && state.selection.node.isBlock) {
			if (!$from.parentOffset || !canSplit(state.doc, $from.pos)) return false;
			if (dispatch) dispatch(state.tr.split($from.pos).scrollIntoView());
			return true;
		}
		if (!$from.depth) return false;
		let types = [];
		let splitDepth,
			deflt,
			atEnd = false,
			atStart = false;
		for (let d = $from.depth; ; d--) {
			let node = $from.node(d);
			if (node.isBlock) {
				atEnd = $from.end(d) == $from.pos + ($from.depth - d);
				atStart = $from.start(d) == $from.pos - ($from.depth - d);
				deflt = defaultBlockAt$1($from.node(d - 1).contentMatchAt($from.indexAfter(d - 1)));
				types.unshift(atEnd && deflt ? { type: deflt } : null);
				splitDepth = d;
				break;
			} else {
				if (d == 1) return false;
				types.unshift(null);
			}
		}
		let tr = state.tr;
		if (state.selection instanceof TextSelection || state.selection instanceof AllSelection) tr.deleteSelection();
		let splitPos = tr.mapping.map($from.pos);
		let can = canSplit(tr.doc, splitPos, types.length, types);
		if (!can) {
			types[0] = deflt ? { type: deflt } : null;
			can = canSplit(tr.doc, splitPos, types.length, types);
		}
		if (!can) return false;
		tr.split(splitPos, types.length, types);
		if (!atEnd && atStart && $from.node(splitDepth).type != deflt) {
			let first = tr.mapping.map($from.before(splitDepth)),
				$first = tr.doc.resolve(first);
			if (deflt && $from.node(splitDepth - 1).canReplaceWith($first.index(), $first.index() + 1, deflt)) tr.setNodeMarkup(tr.mapping.map($from.before(splitDepth)), deflt);
		}
		if (dispatch) dispatch(tr.scrollIntoView());
		return true;
	};
}
/**
Split the parent block of the selection. If the selection is a text
selection, also delete its content.
*/
const splitBlock$1 = splitBlockAs();
/**
Move the selection to the node wrapping the current selection, if
any. (Will not select the document node.)
*/
const selectParentNode$1 = (state, dispatch) => {
	let { $from, to } = state.selection,
		pos;
	let same = $from.sharedDepth(to);
	if (same == 0) return false;
	pos = $from.before(same);
	if (dispatch) dispatch(state.tr.setSelection(NodeSelection.create(state.doc, pos)));
	return true;
};
function joinMaybeClear(state, $pos, dispatch) {
	let before = $pos.nodeBefore,
		after = $pos.nodeAfter,
		index = $pos.index();
	if (!before || !after || !before.type.compatibleContent(after.type)) return false;
	if (!before.content.size && $pos.parent.canReplace(index - 1, index)) {
		if (dispatch) dispatch(state.tr.delete($pos.pos - before.nodeSize, $pos.pos).scrollIntoView());
		return true;
	}
	if (!$pos.parent.canReplace(index, index + 1) || !(after.isTextblock || canJoin(state.doc, $pos.pos))) return false;
	if (dispatch) dispatch(state.tr.join($pos.pos).scrollIntoView());
	return true;
}
function deleteBarrier(state, $cut, dispatch, dir) {
	let before = $cut.nodeBefore,
		after = $cut.nodeAfter,
		conn,
		match;
	let isolated = before.type.spec.isolating || after.type.spec.isolating;
	if (!isolated && joinMaybeClear(state, $cut, dispatch)) return true;
	let canDelAfter = !isolated && $cut.parent.canReplace($cut.index(), $cut.index() + 1);
	if (canDelAfter && (conn = (match = before.contentMatchAt(before.childCount)).findWrapping(after.type)) && match.matchType(conn[0] || after.type).validEnd) {
		if (dispatch) {
			let end = $cut.pos + after.nodeSize,
				wrap = Fragment.empty;
			for (let i = conn.length - 1; i >= 0; i--) wrap = Fragment.from(conn[i].create(null, wrap));
			wrap = Fragment.from(before.copy(wrap));
			let tr = state.tr.step(new ReplaceAroundStep($cut.pos - 1, end, $cut.pos, end, new Slice(wrap, 1, 0), conn.length, true));
			let $joinAt = tr.doc.resolve(end + 2 * conn.length);
			if ($joinAt.nodeAfter && $joinAt.nodeAfter.type == before.type && canJoin(tr.doc, $joinAt.pos)) tr.join($joinAt.pos);
			dispatch(tr.scrollIntoView());
		}
		return true;
	}
	let selAfter = after.type.spec.isolating || (dir > 0 && isolated) ? null : Selection.findFrom($cut, 1);
	let range = selAfter && selAfter.$from.blockRange(selAfter.$to),
		target = range && liftTarget(range);
	if (target != null && target >= $cut.depth) {
		if (dispatch) dispatch(state.tr.lift(range, target).scrollIntoView());
		return true;
	}
	if (canDelAfter && textblockAt(after, "start", true) && textblockAt(before, "end")) {
		let at = before,
			wrap = [];
		for (;;) {
			wrap.push(at);
			if (at.isTextblock) break;
			at = at.lastChild;
		}
		let afterText = after,
			afterDepth = 1;
		for (; !afterText.isTextblock; afterText = afterText.firstChild) afterDepth++;
		if (at.canReplace(at.childCount, at.childCount, afterText.content)) {
			if (dispatch) {
				let end = Fragment.empty;
				for (let i = wrap.length - 1; i >= 0; i--) end = Fragment.from(wrap[i].copy(end));
				let tr = state.tr.step(
					new ReplaceAroundStep($cut.pos - wrap.length, $cut.pos + after.nodeSize, $cut.pos + afterDepth, $cut.pos + after.nodeSize - afterDepth, new Slice(end, wrap.length, 0), 0, true),
				);
				dispatch(tr.scrollIntoView());
			}
			return true;
		}
	}
	return false;
}
function selectTextblockSide(side) {
	return function (state, dispatch) {
		let sel = state.selection,
			$pos = side < 0 ? sel.$from : sel.$to;
		let depth = $pos.depth;
		while ($pos.node(depth).isInline) {
			if (!depth) return false;
			depth--;
		}
		if (!$pos.node(depth).isTextblock) return false;
		if (dispatch) dispatch(state.tr.setSelection(TextSelection.create(state.doc, side < 0 ? $pos.start(depth) : $pos.end(depth))));
		return true;
	};
}
/**
Moves the cursor to the start of current text block.
*/
const selectTextblockStart$1 = selectTextblockSide(-1);
/**
Moves the cursor to the end of current text block.
*/
const selectTextblockEnd$1 = selectTextblockSide(1);
// Parameterized commands
/**
Wrap the selection in a node of the given type with the given
attributes.
*/
function wrapIn$1(nodeType, attrs = null) {
	return function (state, dispatch) {
		let { $from, $to } = state.selection;
		let range = $from.blockRange($to),
			wrapping = range && findWrapping(range, nodeType, attrs);
		if (!wrapping) return false;
		if (dispatch) dispatch(state.tr.wrap(range, wrapping).scrollIntoView());
		return true;
	};
}
/**
Returns a command that tries to set the selected textblocks to the
given node type with the given attributes.
*/
function setBlockType(nodeType, attrs = null) {
	return function (state, dispatch) {
		let applicable = false;
		for (let i = 0; i < state.selection.ranges.length && !applicable; i++) {
			let {
				$from: { pos: from },
				$to: { pos: to },
			} = state.selection.ranges[i];
			state.doc.nodesBetween(from, to, (node, pos) => {
				if (applicable) return false;
				if (!node.isTextblock || node.hasMarkup(nodeType, attrs)) return;
				if (node.type == nodeType) {
					applicable = true;
				} else {
					let $pos = state.doc.resolve(pos),
						index = $pos.index();
					applicable = $pos.parent.canReplaceWith(index, index + 1, nodeType);
				}
			});
		}
		if (!applicable) return false;
		if (dispatch) {
			let tr = state.tr;
			for (let i = 0; i < state.selection.ranges.length; i++) {
				let {
					$from: { pos: from },
					$to: { pos: to },
				} = state.selection.ranges[i];
				tr.setBlockType(from, to, nodeType, attrs);
			}
			dispatch(tr.scrollIntoView());
		}
		return true;
	};
}
/**
Combine a number of command functions into a single function (which
calls them one by one until one returns true).
*/
function chainCommands(...commands) {
	return function (state, dispatch, view) {
		for (let i = 0; i < commands.length; i++) if (commands[i](state, dispatch, view)) return true;
		return false;
	};
}
chainCommands(deleteSelection$1, joinBackward$1, selectNodeBackward$1);
chainCommands(deleteSelection$1, joinForward$1, selectNodeForward$1);
/**
A basic keymap containing bindings not specific to any schema.
Binds the following keys (when multiple commands are listed, they
are chained with [`chainCommands`](https://prosemirror.net/docs/ref/#commands.chainCommands)):

* **Enter** to `newlineInCode`, `createParagraphNear`, `liftEmptyBlock`, `splitBlock`
* **Mod-Enter** to `exitCode`
* **Backspace** and **Mod-Backspace** to `deleteSelection`, `joinBackward`, `selectNodeBackward`
* **Delete** and **Mod-Delete** to `deleteSelection`, `joinForward`, `selectNodeForward`
* **Mod-Delete** to `deleteSelection`, `joinForward`, `selectNodeForward`
* **Mod-a** to `selectAll`
*/
({
	Enter: chainCommands(newlineInCode$1, createParagraphNear$1, liftEmptyBlock$1, splitBlock$1),
});
typeof navigator != "undefined" ? /Mac|iP(hone|[oa]d)/.test(navigator.platform)
	// @ts-ignore
: typeof os != "undefined" && os.platform ? os.platform() == "darwin"
: false;

/**
Returns a command function that wraps the selection in a list with
the given type an attributes. If `dispatch` is null, only return a
value to indicate whether this is possible, but don't actually
perform the change.
*/
function wrapInList$1(listType, attrs = null) {
	return function (state, dispatch) {
		let { $from, $to } = state.selection;
		let range = $from.blockRange($to);
		if (!range) return false;
		let tr = dispatch ? state.tr : null;
		if (!wrapRangeInList(tr, range, listType, attrs)) return false;
		if (dispatch) dispatch(tr.scrollIntoView());
		return true;
	};
}
/**
Try to wrap the given node range in a list of the given type.
Return `true` when this is possible, `false` otherwise. When `tr`
is non-null, the wrapping is added to that transaction. When it is
`null`, the function only queries whether the wrapping is
possible.
*/
function wrapRangeInList(tr, range, listType, attrs = null) {
	let doJoin = false,
		outerRange = range,
		doc = range.$from.doc;
	// This is at the top of an existing list item
	if (range.depth >= 2 && range.$from.node(range.depth - 1).type.compatibleContent(listType) && range.startIndex == 0) {
		// Don't do anything if this is the top of the list
		if (range.$from.index(range.depth - 1) == 0) return false;
		let $insert = doc.resolve(range.start - 2);
		outerRange = new NodeRange($insert, $insert, range.depth);
		if (range.endIndex < range.parent.childCount) range = new NodeRange(range.$from, doc.resolve(range.$to.end(range.depth)), range.depth);
		doJoin = true;
	}
	let wrap = findWrapping(outerRange, listType, attrs, range);
	if (!wrap) return false;
	if (tr) doWrapInList(tr, range, wrap, doJoin, listType);
	return true;
}
function doWrapInList(tr, range, wrappers, joinBefore, listType) {
	let content = Fragment.empty;
	for (let i = wrappers.length - 1; i >= 0; i--) content = Fragment.from(wrappers[i].type.create(wrappers[i].attrs, content));
	tr.step(new ReplaceAroundStep(range.start - (joinBefore ? 2 : 0), range.end, range.start, range.end, new Slice(content, 0, 0), wrappers.length, true));
	let found = 0;
	for (let i = 0; i < wrappers.length; i++) if (wrappers[i].type == listType) found = i + 1;
	let splitDepth = wrappers.length - found;
	let splitPos = range.start + wrappers.length - (joinBefore ? 2 : 0),
		parent = range.parent;
	for (let i = range.startIndex, e = range.endIndex, first = true; i < e; i++, first = false) {
		if (!first && canSplit(tr.doc, splitPos, splitDepth)) {
			tr.split(splitPos, splitDepth);
			splitPos += 2 * splitDepth;
		}
		splitPos += parent.child(i).nodeSize;
	}
	return tr;
}
/**
Create a command to lift the list item around the selection up into
a wrapping list.
*/
function liftListItem$1(itemType) {
	return function (state, dispatch) {
		let { $from, $to } = state.selection;
		let range = $from.blockRange($to, (node) => node.childCount > 0 && node.firstChild.type == itemType);
		if (!range) return false;
		if (!dispatch) return true;
		if ($from.node(range.depth - 1).type == itemType)
			// Inside a parent list
			return liftToOuterList(state, dispatch, itemType, range); // Outer list node
		else return liftOutOfList(state, dispatch, range);
	};
}
function liftToOuterList(state, dispatch, itemType, range) {
	let tr = state.tr,
		end = range.end,
		endOfList = range.$to.end(range.depth);
	if (end < endOfList) {
		// There are siblings after the lifted items, which must become
		// children of the last item
		tr.step(new ReplaceAroundStep(end - 1, endOfList, end, endOfList, new Slice(Fragment.from(itemType.create(null, range.parent.copy())), 1, 0), 1, true));
		range = new NodeRange(tr.doc.resolve(range.$from.pos), tr.doc.resolve(endOfList), range.depth);
	}
	const target = liftTarget(range);
	if (target == null) return false;
	tr.lift(range, target);
	let $after = tr.doc.resolve(tr.mapping.map(end, -1) - 1);
	if (canJoin(tr.doc, $after.pos) && $after.nodeBefore.type == $after.nodeAfter.type) tr.join($after.pos);
	dispatch(tr.scrollIntoView());
	return true;
}
function liftOutOfList(state, dispatch, range) {
	let tr = state.tr,
		list = range.parent;
	// Merge the list items into a single big item
	for (let pos = range.end, i = range.endIndex - 1, e = range.startIndex; i > e; i--) {
		pos -= list.child(i).nodeSize;
		tr.delete(pos - 1, pos + 1);
	}
	let $start = tr.doc.resolve(range.start),
		item = $start.nodeAfter;
	if (tr.mapping.map(range.end) != range.start + $start.nodeAfter.nodeSize) return false;
	let atStart = range.startIndex == 0,
		atEnd = range.endIndex == list.childCount;
	let parent = $start.node(-1),
		indexBefore = $start.index(-1);
	if (!parent.canReplace(indexBefore + (atStart ? 0 : 1), indexBefore + 1, item.content.append(atEnd ? Fragment.empty : Fragment.from(list)))) return false;
	let start = $start.pos,
		end = start + item.nodeSize;
	// Strip off the surrounding list. At the sides where we're not at
	// the end of the list, the existing list is closed. At sides where
	// this is the end, it is overwritten to its end.
	tr.step(
		new ReplaceAroundStep(
			start - (atStart ? 1 : 0),
			end + (atEnd ? 1 : 0),
			start + 1,
			end - 1,
			new Slice((atStart ? Fragment.empty : Fragment.from(list.copy(Fragment.empty))).append(atEnd ? Fragment.empty : Fragment.from(list.copy(Fragment.empty))), atStart ? 0 : 1, atEnd ? 0 : 1),
			atStart ? 0 : 1,
		),
	);
	dispatch(tr.scrollIntoView());
	return true;
}
/**
Create a command to sink the list item around the selection down
into an inner list.
*/
function sinkListItem$1(itemType) {
	return function (state, dispatch) {
		let { $from, $to } = state.selection;
		let range = $from.blockRange($to, (node) => node.childCount > 0 && node.firstChild.type == itemType);
		if (!range) return false;
		let startIndex = range.startIndex;
		if (startIndex == 0) return false;
		let parent = range.parent,
			nodeBefore = parent.child(startIndex - 1);
		if (nodeBefore.type != itemType) return false;
		if (dispatch) {
			let nestedBefore = nodeBefore.lastChild && nodeBefore.lastChild.type == parent.type;
			let inner = Fragment.from(nestedBefore ? itemType.create() : null);
			let slice = new Slice(Fragment.from(itemType.create(null, Fragment.from(parent.type.create(null, inner)))), nestedBefore ? 3 : 1, 0);
			let before = range.start,
				after = range.end;
			dispatch(state.tr.step(new ReplaceAroundStep(before - (nestedBefore ? 3 : 1), after, before, after, slice, 1, true)).scrollIntoView());
		}
		return true;
	};
}

const domIndex = function (node) {
	for (var index = 0; ; index++) {
		node = node.previousSibling;
		if (!node) return index;
	}
};
const parentNode = function (node) {
	let parent = node.assignedSlot || node.parentNode;
	return parent && parent.nodeType == 11 ? parent.host : parent;
};
let reusedRange = null;
// Note that this will always return the same range, because DOM range
// objects are every expensive, and keep slowing down subsequent DOM
// updates, for some reason.
const textRange = function (node, from, to) {
	let range = reusedRange || (reusedRange = document.createRange());
	range.setEnd(node, to == null ? node.nodeValue.length : to);
	range.setStart(node, from || 0);
	return range;
};
const clearReusedRange = function () {
	reusedRange = null;
};
// Scans forward and backward through DOM positions equivalent to the
// given one to see if the two are in the same place (i.e. after a
// text node vs at the end of that text node)
const isEquivalentPosition = function (node, off, targetNode, targetOff) {
	return targetNode && (scanFor(node, off, targetNode, targetOff, -1) || scanFor(node, off, targetNode, targetOff, 1));
};
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;
		if (off == (dir < 0 ? 0 : nodeSize(node))) {
			let parent = node.parentNode;
			if (!parent || parent.nodeType != 1 || hasBlockDesc(node) || atomElements.test(node.nodeName) || node.contentEditable == "false") return false;
			off = domIndex(node) + (dir < 0 ? 0 : 1);
			node = parent;
		} else if (node.nodeType == 1) {
			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;
		}
	}
}
function nodeSize(node) {
	return node.nodeType == 3 ? node.nodeValue.length : node.childNodes.length;
}
function textNodeBefore$1(node, offset) {
	for (;;) {
		if (node.nodeType == 3 && offset) return node;
		if (node.nodeType == 1 && offset > 0) {
			if (node.contentEditable == "false") return null;
			node = node.childNodes[offset - 1];
			offset = nodeSize(node);
		} else if (node.parentNode && !hasBlockDesc(node)) {
			offset = domIndex(node);
			node = node.parentNode;
		} else {
			return null;
		}
	}
}
function textNodeAfter$1(node, offset) {
	for (;;) {
		if (node.nodeType == 3 && offset < node.nodeValue.length) return node;
		if (node.nodeType == 1 && offset < node.childNodes.length) {
			if (node.contentEditable == "false") return null;
			node = node.childNodes[offset];
			offset = 0;
		} else if (node.parentNode && !hasBlockDesc(node)) {
			offset = domIndex(node) + 1;
			node = node.parentNode;
		} else {
			return null;
		}
	}
}
function isOnEdge(node, offset, parent) {
	for (let atStart = offset == 0, atEnd = offset == nodeSize(node); atStart || atEnd; ) {
		if (node == parent) return true;
		let index = domIndex(node);
		node = node.parentNode;
		if (!node) return false;
		atStart = atStart && index == 0;
		atEnd = atEnd && index == nodeSize(node);
	}
}
function hasBlockDesc(dom) {
	let desc;
	for (let cur = dom; cur; cur = cur.parentNode) if ((desc = cur.pmViewDesc)) break;
	return desc && desc.node && desc.node.isBlock && (desc.dom == dom || desc.contentDOM == dom);
}
// Work around Chrome issue https://bugs.chromium.org/p/chromium/issues/detail?id=447523
// (isCollapsed inappropriately returns true in shadow dom)
const selectionCollapsed = function (domSel) {
	return domSel.focusNode && isEquivalentPosition(domSel.focusNode, domSel.focusOffset, domSel.anchorNode, domSel.anchorOffset);
};
function keyEvent(keyCode, key) {
	let event = document.createEvent("Event");
	event.initEvent("keydown", true, true);
	event.keyCode = keyCode;
	event.key = event.code = key;
	return event;
}
function deepActiveElement(doc) {
	let elt = doc.activeElement;
	while (elt && elt.shadowRoot) elt = elt.shadowRoot.activeElement;
	return elt;
}
function caretFromPoint(doc, x, y) {
	if (doc.caretPositionFromPoint) {
		try {
			// Firefox throws for this call in hard-to-predict circumstances (#994)
			let pos = doc.caretPositionFromPoint(x, y);
			// Clip the offset, because Chrome will return a text offset
			// into <input> nodes, which can't be treated as a regular DOM
			// offset
			if (pos) return { node: pos.offsetNode, offset: Math.min(nodeSize(pos.offsetNode), pos.offset) };
		} catch (_) {}
	}
	if (doc.caretRangeFromPoint) {
		let range = doc.caretRangeFromPoint(x, y);
		if (range) return { node: range.startContainer, offset: Math.min(nodeSize(range.startContainer), range.startOffset) };
	}
}

const nav = typeof navigator != "undefined" ? navigator : null;
const doc = typeof document != "undefined" ? document : null;
const agent = (nav && nav.userAgent) || "";
const ie_edge = /Edge\/(\d+)/.exec(agent);
const ie_upto10 = /MSIE \d/.exec(agent);
const ie_11up = /Trident\/(?:[7-9]|\d{2,})\..*rv:(\d+)/.exec(agent);
const ie$1 = !!(ie_upto10 || ie_11up || ie_edge);
const ie_version =
	ie_upto10 ? document.documentMode
	: ie_11up ? +ie_11up[1]
	: ie_edge ? +ie_edge[1]
	: 0;
const gecko = !ie$1 && /gecko\/(\d+)/i.test(agent);
gecko && +(/Firefox\/(\d+)/.exec(agent) || [0, 0])[1];
const _chrome = !ie$1 && /Chrome\/(\d+)/.exec(agent);
const chrome = !!_chrome;
const chrome_version = _chrome ? +_chrome[1] : 0;
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$2 = ios || (nav ? /Mac/.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;

function windowRect(doc) {
	let vp = doc.defaultView && doc.defaultView.visualViewport;
	if (vp)
		return {
			left: 0,
			right: vp.width,
			top: 0,
			bottom: vp.height,
		};
	return { left: 0, right: doc.documentElement.clientWidth, top: 0, bottom: doc.documentElement.clientHeight };
}
function getSide(value, side) {
	return typeof value == "number" ? value : value[side];
}
function clientRect(node) {
	let rect = node.getBoundingClientRect();
	// Adjust for elements with style "transform: scale()"
	let scaleX = rect.width / node.offsetWidth || 1;
	let scaleY = rect.height / node.offsetHeight || 1;
	// Make sure scrollbar width isn't included in the rectangle
	return { left: rect.left, right: rect.left + node.clientWidth * scaleX, top: rect.top, bottom: rect.top + node.clientHeight * scaleY };
}
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; ; ) {
		if (!parent) break;
		if (parent.nodeType != 1) {
			parent = parentNode(parent);
			continue;
		}
		let elt = parent;
		let atTop = elt == doc.body;
		let bounding = atTop ? windowRect(doc) : clientRect(elt);
		let moveX = 0,
			moveY = 0;
		if (rect.top < bounding.top + getSide(scrollThreshold, "top")) moveY = -(bounding.top - rect.top + getSide(scrollMargin, "top"));
		else if (rect.bottom > bounding.bottom - getSide(scrollThreshold, "bottom"))
			moveY = rect.bottom - rect.top > bounding.bottom - bounding.top ? rect.top + getSide(scrollMargin, "top") - bounding.top : rect.bottom - bounding.bottom + getSide(scrollMargin, "bottom");
		if (rect.left < bounding.left + getSide(scrollThreshold, "left")) moveX = -(bounding.left - rect.left + getSide(scrollMargin, "left"));
		else if (rect.right > bounding.right - getSide(scrollThreshold, "right")) moveX = rect.right - bounding.right + getSide(scrollMargin, "right");
		if (moveX || moveY) {
			if (atTop) {
				doc.defaultView.scrollBy(moveX, moveY);
			} else {
				let startX = elt.scrollLeft,
					startY = elt.scrollTop;
				if (moveY) elt.scrollTop += moveY;
				if (moveX) elt.scrollLeft += moveX;
				let dX = elt.scrollLeft - startX,
					dY = elt.scrollTop - startY;
				rect = { left: rect.left - dX, top: rect.top - dY, right: rect.right - dX, bottom: rect.bottom - dY };
			}
		}
		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
// the top position of an element near the top of the editor, which
// will be used to make sure the visible viewport remains stable even
// when the size of the content above changes.
function storeScrollPos(view) {
	let rect = view.dom.getBoundingClientRect(),
		startY = Math.max(0, rect.top);
	let refDOM, refTop;
	for (let x = (rect.left + rect.right) / 2, y = startY + 1; y < Math.min(innerHeight, rect.bottom); y += 5) {
		let dom = view.root.elementFromPoint(x, y);
		if (!dom || dom == view.dom || !view.dom.contains(dom)) continue;
		let localRect = dom.getBoundingClientRect();
		if (localRect.top >= startY - 20) {
			refDOM = dom;
			refTop = localRect.top;
			break;
		}
	}
	return { refDOM: refDOM, refTop: refTop, stack: scrollStack(view.dom) };
}
function scrollStack(dom) {
	let stack = [],
		doc = dom.ownerDocument;
	for (let cur = dom; cur; cur = parentNode(cur)) {
		stack.push({ dom: cur, top: cur.scrollTop, left: cur.scrollLeft });
		if (dom == doc) break;
	}
	return stack;
}
// Reset the scroll position of the editor's parent nodes to that what
// it was before, when storeScrollPos was called.
function resetScrollPos({ refDOM, refTop, stack }) {
	let newRefTop = refDOM ? refDOM.getBoundingClientRect().top : 0;
	restoreScrollStack(stack, newRefTop == 0 ? 0 : newRefTop - refTop);
}
function restoreScrollStack(stack, dTop) {
	for (let i = 0; i < stack.length; i++) {
		let { dom, top, left } = stack[i];
		if (dom.scrollTop != top + dTop) dom.scrollTop = top + dTop;
		if (dom.scrollLeft != left) dom.scrollLeft = left;
	}
}
let preventScrollSupported = null;
// Feature-detects support for .focus({preventScroll: true}), and uses
// a fallback kludge when not supported.
function focusPreventScroll(dom) {
	if (dom.setActive) return dom.setActive(); // in IE
	if (preventScrollSupported) return dom.focus(preventScrollSupported);
	let stored = scrollStack(dom);
	dom.focus(
		preventScrollSupported == null ?
			{
				get preventScroll() {
					preventScrollSupported = { preventScroll: true };
					return true;
				},
			}
		:	undefined,
	);
	if (!preventScrollSupported) {
		preventScrollSupported = false;
		restoreScrollStack(stored, 0);
	}
}
function findOffsetInNode(node, coords) {
	let closest,
		dxClosest = 2e8,
		coordsClosest,
		offset = 0;
	let rowBot = coords.top,
		rowTop = coords.top;
	let firstBelow, coordsBelow;
	for (let child = node.firstChild, childIndex = 0; child; child = child.nextSibling, childIndex++) {
		let rects;
		if (child.nodeType == 1) rects = child.getClientRects();
		else if (child.nodeType == 3) rects = textRange(child).getClientRects();
		else continue;
		for (let i = 0; i < rects.length; i++) {
			let rect = rects[i];
			if (rect.top <= rowBot && rect.bottom >= rowTop) {
				rowBot = Math.max(rect.bottom, rowBot);
				rowTop = Math.min(rect.top, rowTop);
				let dx =
					rect.left > coords.left ? rect.left - coords.left
					: rect.right < coords.left ? coords.left - rect.right
					: 0;
				if (dx < dxClosest) {
					closest = child;
					dxClosest = dx;
					coordsClosest =
						dx && closest.nodeType == 3 ?
							{
								left: rect.right < coords.left ? rect.right : rect.left,
								top: coords.top,
							}
						:	coords;
					if (child.nodeType == 1 && dx) offset = childIndex + (coords.left >= (rect.left + rect.right) / 2 ? 1 : 0);
					continue;
				}
			} else if (rect.top > coords.top && !firstBelow && rect.left <= coords.left && rect.right >= coords.left) {
				firstBelow = child;
				coordsBelow = { left: Math.max(rect.left, Math.min(rect.right, coords.left)), top: rect.top };
			}
			if (!closest && ((coords.left >= rect.right && coords.top >= rect.top) || (coords.left >= rect.left && coords.top >= rect.bottom))) offset = childIndex + 1;
		}
	}
	if (!closest && firstBelow) {
		closest = firstBelow;
		coordsClosest = coordsBelow;
		dxClosest = 0;
	}
	if (closest && closest.nodeType == 3) return findOffsetInText(closest, coordsClosest);
	if (!closest || (dxClosest && closest.nodeType == 1)) return { node, offset };
	return findOffsetInNode(closest, coordsClosest);
}
function findOffsetInText(node, coords) {
	let len = node.nodeValue.length;
	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)) {
			result = { node, offset: i + (coords.left >= (rect.left + rect.right) / 2 ? 1 : 0) };
			break;
		}
	}
	range.detach();
	return result || { node, offset: 0 };
}
function inRect(coords, rect) {
	return coords.left >= rect.left - 1 && coords.left <= rect.right + 1 && coords.top >= rect.top - 1 && coords.top <= rect.bottom + 1;
}
function targetKludge(dom, coords) {
	let parent = dom.parentNode;
	if (parent && /^li$/i.test(parent.nodeName) && coords.left < dom.getBoundingClientRect().left) return parent;
	return dom;
}
function posFromElement(view, elt, coords) {
	let { node, offset } = findOffsetInNode(elt, coords),
		bias = -1;
	if (node.nodeType == 1 && !node.firstChild) {
		let rect = node.getBoundingClientRect();
		bias = rect.left != rect.right && coords.left > (rect.left + rect.right) / 2 ? 1 : -1;
	}
	return view.docView.posFromDOM(node, offset, bias);
}
function posFromCaret(view, node, offset, coords) {
	// Browser (in caretPosition/RangeFromPoint) will agressively
	// normalize towards nearby inline nodes. Since we are interested in
	// positions between block nodes too, we first walk up the hierarchy
	// of nodes to see if there are block nodes that the coordinates
	// fall outside of. If so, we take the position before/after that
	// block. If not, we call `posFromDOM` on the raw node/offset.
	let outsideBlock = -1;
	for (let cur = node, sawBlock = false; ; ) {
		if (cur == view.dom) break;
		let desc = view.docView.nearestDesc(cur, true),
			rect;
		if (!desc) return null;
		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 && !/^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;
				else if ((!sawBlock && rect.right < coords.left) || rect.bottom < coords.top) outsideBlock = desc.posAfter;
				sawBlock = true;
			}
			if (!desc.contentDOM && outsideBlock < 0 && !desc.node.isText) {
				// If we are inside a leaf, return the side of the leaf closer to the coords
				let before = desc.node.isBlock ? coords.top < (rect.top + rect.bottom) / 2 : coords.left < (rect.left + rect.right) / 2;
				return before ? desc.posBefore : desc.posAfter;
			}
		}
		cur = desc.dom.parentNode;
	}
	return outsideBlock > -1 ? outsideBlock : view.docView.posFromDOM(node, offset, -1);
}
function elementFromPoint(element, coords, box) {
	let len = element.childNodes.length;
	if (len && box.top < box.bottom) {
		for (let startI = Math.max(0, Math.min(len - 1, Math.floor((len * (coords.top - box.top)) / (box.bottom - box.top)) - 2)), i = startI; ; ) {
			let child = element.childNodes[i];
			if (child.nodeType == 1) {
				let rects = child.getClientRects();
				for (let j = 0; j < rects.length; j++) {
					let rect = rects[j];
					if (inRect(coords, rect)) return elementFromPoint(child, coords, rect);
				}
			}
			if ((i = (i + 1) % len) == startI) break;
		}
	}
	return element;
}
// Given an x,y position on the editor, get the position in the document.
function posAtCoords(view, coords) {
	let doc = view.dom.ownerDocument,
		node,
		offset = 0;
	let caret = caretFromPoint(doc, coords.left, coords.top);
	if (caret) ({ node, offset } = caret);
	let elt = (view.root.elementFromPoint ? view.root : doc).elementFromPoint(coords.left, coords.top);
	let pos;
	if (!elt || !view.dom.contains(elt.nodeType != 1 ? elt.parentNode : elt)) {
		let box = view.dom.getBoundingClientRect();
		if (!inRect(coords, box)) return null;
		elt = elementFromPoint(view.dom, coords, box);
		if (!elt) return null;
	}
	// Safari's caretRangeFromPoint returns nonsense when on a draggable element
	if (safari) {
		for (let p = elt; node && p; p = parentNode(p)) if (p.draggable) node = undefined;
	}
	elt = targetKludge(elt, coords);
	if (node) {
		if (gecko && node.nodeType == 1) {
			// Firefox will sometimes return offsets into <input> nodes, which
			// have no actual children, from caretPositionFromPoint (#953)
			offset = Math.min(offset, node.childNodes.length);
			// It'll also move the returned position before image nodes,
			// even if those are behind it.
			if (offset < node.childNodes.length) {
				let next = node.childNodes[offset],
					box;
				if (next.nodeName == "IMG" && (box = next.getBoundingClientRect()).right <= coords.left && box.bottom > coords.top) offset++;
			}
		}
		let prev;
		// When clicking above the right side of an uneditable node, Chrome will report a cursor position after that node.
		if (webkit && offset && node.nodeType == 1 && (prev = node.childNodes[offset - 1]).nodeType == 1 && prev.contentEditable == "false" && prev.getBoundingClientRect().top >= coords.top) offset--;
		// Suspiciously specific kludge to work around caret*FromPoint
		// never returning a position at the end of the document
		if (node == view.dom && offset == node.childNodes.length - 1 && node.lastChild.nodeType == 1 && coords.top > node.lastChild.getBoundingClientRect().bottom) pos = view.state.doc.content.size;
		// Ignore positions directly after a BR, since caret*FromPoint
		// 'round up' positions that would be more accurately placed
		// before the BR node.
		else if (offset == 0 || node.nodeType != 1 || node.childNodes[offset - 1].nodeName != "BR") pos = posFromCaret(view, node, offset, coords);
	}
	if (pos == null) pos = posFromElement(view, elt, coords);
	let desc = view.docView.nearestDesc(elt, true);
	return { pos, inside: desc ? desc.posAtStart - desc.border : -1 };
}
function nonZero(rect) {
	return rect.top < rect.bottom || rect.left < rect.right;
}
function singleRect(target, bias) {
	let rects = target.getClientRects();
	if (rects.length) {
		let first = rects[bias < 0 ? 0 : rects.length - 1];
		if (nonZero(first)) return first;
	}
	return Array.prototype.find.call(rects, nonZero) || target.getBoundingClientRect();
}
const BIDI = /[\u0590-\u05f4\u0600-\u06ff\u0700-\u08ac]/;
// Given a position in the document model, get a bounding box of the
// character at that position, relative to the window.
function coordsAtPos(view, pos, side) {
	let { node, offset, atom } = view.docView.domFromPos(pos, side < 0 ? -1 : 1);
	let supportEmptyRange = webkit || gecko;
	if (node.nodeType == 3) {
		// These browsers support querying empty text ranges. Prefer that in
		// bidi context or when at the end of a node.
		if (supportEmptyRange && (BIDI.test(node.nodeValue) || (side < 0 ? !offset : offset == node.nodeValue.length))) {
			let rect = singleRect(textRange(node, offset, offset), side);
			// Firefox returns bad results (the position before the space)
			// when querying a position directly after line-broken
			// whitespace. Detect this situation and and kludge around it
			if (gecko && offset && /\s/.test(node.nodeValue[offset - 1]) && offset < node.nodeValue.length) {
				let rectBefore = singleRect(textRange(node, offset - 1, offset - 1), -1);
				if (rectBefore.top == rect.top) {
					let rectAfter = singleRect(textRange(node, offset, offset + 1), -1);
					if (rectAfter.top != rect.top) return flattenV(rectAfter, rectAfter.left < rectBefore.left);
				}
			}
			return rect;
		} else {
			let from = offset,
				to = offset,
				takeSide = side < 0 ? 1 : -1;
			if (side < 0 && !offset) {
				to++;
				takeSide = -1;
			} else if (side >= 0 && offset == node.nodeValue.length) {
				from--;
				takeSide = 1;
			} else if (side < 0) {
				from--;
			} else {
				to++;
			}
			return flattenV(singleRect(textRange(node, from, to), takeSide), takeSide < 0);
		}
	}
	let $dom = view.state.doc.resolve(pos - (atom || 0));
	// Return a horizontal line in block context
	if (!$dom.parent.inlineContent) {
		if (atom == null && offset && (side < 0 || offset == nodeSize(node))) {
			let before = node.childNodes[offset - 1];
			if (before.nodeType == 1) return flattenH(before.getBoundingClientRect(), false);
		}
		if (atom == null && offset < nodeSize(node)) {
			let after = node.childNodes[offset];
			if (after.nodeType == 1) return flattenH(after.getBoundingClientRect(), true);
		}
		return flattenH(node.getBoundingClientRect(), side >= 0);
	}
	// Inline, not in text node (this is not Bidi-safe)
	if (atom == null && offset && (side < 0 || offset == nodeSize(node))) {
		let before = node.childNodes[offset - 1];
		let target =
			before.nodeType == 3 ? textRange(before, nodeSize(before) - (supportEmptyRange ? 0 : 1))
				// BR nodes tend to only return the rectangle before them.
				// Only use them if they are the last element in their parent
			: before.nodeType == 1 && (before.nodeName != "BR" || !before.nextSibling) ? before
			: null;
		if (target) return flattenV(singleRect(target, 1), false);
	}
	if (atom == null && offset < nodeSize(node)) {
		let after = node.childNodes[offset];
		while (after.pmViewDesc && after.pmViewDesc.ignoreForCoords) after = after.nextSibling;
		let target =
			!after ? null
			: after.nodeType == 3 ? textRange(after, 0, supportEmptyRange ? 0 : 1)
			: after.nodeType == 1 ? after
			: null;
		if (target) return flattenV(singleRect(target, -1), true);
	}
	// All else failed, just try to get a rectangle for the target node
	return flattenV(singleRect(node.nodeType == 3 ? textRange(node) : node, -side), side >= 0);
}
function flattenV(rect, left) {
	if (rect.width == 0) return rect;
	let x = left ? rect.left : rect.right;
	return { top: rect.top, bottom: rect.bottom, left: x, right: x };
}
function flattenH(rect, top) {
	if (rect.height == 0) return rect;
	let y = top ? rect.top : rect.bottom;
	return { top: y, bottom: y, left: rect.left, right: rect.right };
}
function withFlushedState(view, state, f) {
	let viewState = view.state,
		active = view.root.activeElement;
	if (viewState != state) view.updateState(state);
	if (active != view.dom) view.focus();
	try {
		return f();
	} finally {
		if (viewState != state) view.updateState(viewState);
		if (active != view.dom && active) active.focus();
	}
}
// Whether vertical position motion in a given direction
// from a position would leave a text block.
function endOfTextblockVertical(view, state, dir) {
	let sel = state.selection;
	let $pos = dir == "up" ? sel.$from : sel.$to;
	return withFlushedState(view, state, () => {
		let { node: dom } = view.docView.domFromPos($pos.pos, dir == "up" ? -1 : 1);
		for (;;) {
			let nearest = view.docView.nearestDesc(dom, true);
			if (!nearest) break;
			if (nearest.node.isBlock) {
				dom = nearest.contentDOM || nearest.dom;
				break;
			}
			dom = nearest.dom.parentNode;
		}
		let coords = coordsAtPos(view, $pos.pos, 1);
		for (let child = dom.firstChild; child; child = child.nextSibling) {
			let boxes;
			if (child.nodeType == 1) boxes = child.getClientRects();
			else if (child.nodeType == 3) boxes = textRange(child, 0, child.nodeValue.length).getClientRects();
			else continue;
			for (let i = 0; i < boxes.length; i++) {
				let box = boxes[i];
				if (box.bottom > box.top + 1 && (dir == "up" ? coords.top - box.top > (box.bottom - coords.top) * 2 : box.bottom - coords.bottom > (coords.bottom - box.top) * 2)) return false;
			}
		}
		return true;
	});
}
const maybeRTL = /[\u0590-\u08ac]/;
function endOfTextblockHorizontal(view, state, dir) {
	let { $head } = state.selection;
	if (!$head.parent.isTextblock) return false;
	let offset = $head.parentOffset,
		atStart = !offset,
		atEnd = offset == $head.parent.content.size;
	let sel = view.domSelection();
	if (!sel) return $head.pos == $head.start() || $head.pos == $head.end();
	// If the textblock is all LTR, or the browser doesn't support
	// Selection.modify (Edge), fall back to a primitive approach
	if (!maybeRTL.test($head.parent.textContent) || !sel.modify) return dir == "left" || dir == "backward" ? atStart : atEnd;
	return withFlushedState(view, state, () => {
		// This is a huge hack, but appears to be the best we can
		// currently do: use `Selection.modify` to move the selection by
		// one character, and see if that moves the cursor out of the
		// textblock (or doesn't move it at all, when at the start/end of
		// the document).
		let { focusNode: oldNode, focusOffset: oldOff, anchorNode, anchorOffset } = view.domSelectionRange();
		let oldBidiLevel = sel.caretBidiLevel; // Only for Firefox
		sel.modify("move", dir, "character");
		let parentDOM = $head.depth ? view.docView.domAfterPos($head.before()) : view.dom;
		let { focusNode: newNode, focusOffset: newOff } = view.domSelectionRange();
		let result = (newNode && !parentDOM.contains(newNode.nodeType == 1 ? newNode : newNode.parentNode)) || (oldNode == newNode && oldOff == newOff);
		// Restore the previous selection
		try {
			sel.collapse(anchorNode, anchorOffset);
			if (oldNode && (oldNode != anchorNode || oldOff != anchorOffset) && sel.extend) sel.extend(oldNode, oldOff);
		} catch (_) {}
		if (oldBidiLevel != null) sel.caretBidiLevel = oldBidiLevel;
		return result;
	});
}
let cachedState = null;
let cachedDir = null;
let cachedResult = false;
function endOfTextblock(view, state, dir) {
	if (cachedState == state && cachedDir == dir) return cachedResult;
	cachedState = state;
	cachedDir = dir;
	return (cachedResult = dir == "up" || dir == "down" ? endOfTextblockVertical(view, state, dir) : endOfTextblockHorizontal(view, state, dir));
}

// View descriptions are data structures that describe the DOM that is
// used to represent the editor's content. They are used for:
//
// - Incremental redrawing when the document changes
//
// - Figuring out what part of the document a given DOM position
//   corresponds to
//
// - Wiring in custom implementations of the editing interface for a
//   given node
//
// They form a doubly-linked mutable tree, starting at `view.docView`.
const NOT_DIRTY = 0,
	CHILD_DIRTY = 1,
	CONTENT_DIRTY = 2,
	NODE_DIRTY = 3;
// Superclass for the various kinds of descriptions. Defines their
// basic structure and shared methods.
class ViewDesc {
	constructor(
		parent,
		children,
		dom,
		// This is the node that holds the child views. It may be null for
		// descs that don't have children.
		contentDOM,
	) {
		this.parent = parent;
		this.children = children;
		this.dom = dom;
		this.contentDOM = contentDOM;
		this.dirty = NOT_DIRTY;
		// An expando property on the DOM node provides a link back to its
		// description.
		dom.pmViewDesc = this;
	}
	// Used to check whether a given description corresponds to a
	// widget/mark/node.
	matchesWidget(widget) {
		return false;
	}
	matchesMark(mark) {
		return false;
	}
	matchesNode(node, outerDeco, innerDeco) {
		return false;
	}
	matchesHack(nodeName) {
		return false;
	}
	// When parsing in-editor content (in domchange.js), we allow
	// descriptions to determine the parse rules that should be used to
	// parse them.
	parseRule() {
		return null;
	}
	// Used by the editor's event handler to ignore events that come
	// from certain descs.
	stopEvent(event) {
		return false;
	}
	// The size of the content represented by this desc.
	get size() {
		let size = 0;
		for (let i = 0; i < this.children.length; i++) size += this.children[i].size;
		return size;
	}
	// For block nodes, this represents the space taken up by their
	// start/end tokens.
	get border() {
		return 0;
	}
	destroy() {
		this.parent = undefined;
		if (this.dom.pmViewDesc == this) this.dom.pmViewDesc = undefined;
		for (let i = 0; i < this.children.length; i++) this.children[i].destroy();
	}
	posBeforeChild(child) {
		for (let i = 0, pos = this.posAtStart; ; i++) {
			let cur = this.children[i];
			if (cur == child) return pos;
			pos += cur.size;
		}
	}
	get posBefore() {
		return this.parent.posBeforeChild(this);
	}
	get posAtStart() {
		return this.parent ? this.parent.posBeforeChild(this) + this.border : 0;
	}
	get posAfter() {
		return this.posBefore + this.size;
	}
	get posAtEnd() {
		return this.posAtStart + this.size - 2 * this.border;
	}
	localPosFromDOM(dom, offset, bias) {
		// If the DOM position is in the content, use the child desc after
		// it to figure out a position.
		if (this.contentDOM && this.contentDOM.contains(dom.nodeType == 1 ? dom : dom.parentNode)) {
			if (bias < 0) {
				let domBefore, desc;
				if (dom == this.contentDOM) {
					domBefore = dom.childNodes[offset - 1];
				} else {
					while (dom.parentNode != this.contentDOM) dom = dom.parentNode;
					domBefore = dom.previousSibling;
				}
				while (domBefore && !((desc = domBefore.pmViewDesc) && desc.parent == this)) domBefore = domBefore.previousSibling;
				return domBefore ? this.posBeforeChild(desc) + desc.size : this.posAtStart;
			} else {
				let domAfter, desc;
				if (dom == this.contentDOM) {
					domAfter = dom.childNodes[offset];
				} else {
					while (dom.parentNode != this.contentDOM) dom = dom.parentNode;
					domAfter = dom.nextSibling;
				}
				while (domAfter && !((desc = domAfter.pmViewDesc) && desc.parent == this)) domAfter = domAfter.nextSibling;
				return domAfter ? this.posBeforeChild(desc) : this.posAtEnd;
			}
		}
		// Otherwise, use various heuristics, falling back on the bias
		// parameter, to determine whether to return the position at the
		// start or at the end of this view desc.
		let atEnd;
		if (dom == this.dom && this.contentDOM) {
			atEnd = offset > domIndex(this.contentDOM);
		} else if (this.contentDOM && this.contentDOM != this.dom && this.dom.contains(this.contentDOM)) {
			atEnd = dom.compareDocumentPosition(this.contentDOM) & 2;
		} else if (this.dom.firstChild) {
			if (offset == 0)
				for (let search = dom; ; search = search.parentNode) {
					if (search == this.dom) {
						atEnd = false;
						break;
					}
					if (search.previousSibling) break;
				}
			if (atEnd == null && offset == dom.childNodes.length)
				for (let search = dom; ; search = search.parentNode) {
					if (search == this.dom) {
						atEnd = true;
						break;
					}
					if (search.nextSibling) break;
				}
		}
		return (
				atEnd == null ? bias > 0 : atEnd
			) ?
				this.posAtEnd
			:	this.posAtStart;
	}
	nearestDesc(dom, onlyNodes = false) {
		for (let first = true, cur = dom; cur; cur = cur.parentNode) {
			let desc = this.getDesc(cur),
				nodeDOM;
			if (desc && (!onlyNodes || desc.node)) {
				// If dom is outside of this desc's nodeDOM, don't count it.
				if (first && (nodeDOM = desc.nodeDOM) && !(nodeDOM.nodeType == 1 ? nodeDOM.contains(dom.nodeType == 1 ? dom : dom.parentNode) : nodeDOM == dom)) first = false;
				else return desc;
			}
		}
	}
	getDesc(dom) {
		let desc = dom.pmViewDesc;
		for (let cur = desc; cur; cur = cur.parent) if (cur == this) return desc;
	}
	posFromDOM(dom, offset, bias) {
		for (let scan = dom; scan; scan = scan.parentNode) {
			let desc = this.getDesc(scan);
			if (desc) return desc.localPosFromDOM(dom, offset, bias);
		}
		return -1;
	}
	// Find the desc for the node after the given pos, if any. (When a
	// parent node overrode rendering, there might not be one.)
	descAt(pos) {
		for (let i = 0, offset = 0; i < this.children.length; i++) {
			let child = this.children[i],
				end = offset + child.size;
			if (offset == pos && end != offset) {
				while (!child.border && child.children.length) {
					for (let i = 0; i < child.children.length; i++) {
						let inner = child.children[i];
						if (inner.size) {
							child = inner;
							break;
						}
					}
				}
				return child;
			}
			if (pos < end) return child.descAt(pos - offset - child.border);
			offset = end;
		}
	}
	domFromPos(pos, side) {
		if (!this.contentDOM) return { node: this.dom, offset: 0, atom: pos + 1 };
		// First find the position in the child array
		let i = 0,
			offset = 0;
		for (let curPos = 0; i < this.children.length; i++) {
			let child = this.children[i],
				end = curPos + child.size;
			if (end > pos || child instanceof TrailingHackViewDesc) {
				offset = pos - curPos;
				break;
			}
			curPos = end;
		}
		// If this points into the middle of a child, call through
		if (offset) return this.children[i].domFromPos(offset - this.children[i].border, side);
		// Go back if there were any zero-length widgets with side >= 0 before this point
		for (let prev; i && !(prev = this.children[i - 1]).size && prev instanceof WidgetViewDesc && prev.side >= 0; i--) {}
		// Scan towards the first useable node
		if (side <= 0) {
			let prev,
				enter = true;
			for (; ; i--, enter = false) {
				prev = i ? this.children[i - 1] : null;
				if (!prev || prev.dom.parentNode == this.contentDOM) break;
			}
			if (prev && side && enter && !prev.border && !prev.domAtom) return prev.domFromPos(prev.size, side);
			return { node: this.contentDOM, offset: prev ? domIndex(prev.dom) + 1 : 0 };
		} else {
			let next,
				enter = true;
			for (; ; i++, enter = false) {
				next = i < this.children.length ? this.children[i] : null;
				if (!next || next.dom.parentNode == this.contentDOM) break;
			}
			if (next && enter && !next.border && !next.domAtom) return next.domFromPos(0, side);
			return { node: this.contentDOM, offset: next ? domIndex(next.dom) : this.contentDOM.childNodes.length };
		}
	}
	// Used to find a DOM range in a single parent for a given changed
	// range.
	parseRange(from, to, base = 0) {
		if (this.children.length == 0) return { node: this.contentDOM, from, to, fromOffset: 0, toOffset: this.contentDOM.childNodes.length };
		let fromOffset = -1,
			toOffset = -1;
		for (let offset = base, i = 0; ; i++) {
			let child = this.children[i],
				end = offset + child.size;
			if (fromOffset == -1 && from <= end) {
				let childBase = offset + child.border;
				// FIXME maybe descend mark views to parse a narrower range?
				if (from >= childBase && to <= end - child.border && child.node && child.contentDOM && this.contentDOM.contains(child.contentDOM)) return child.parseRange(from, to, childBase);
				from = offset;
				for (let j = i; j > 0; j--) {
					let prev = this.children[j - 1];
					if (prev.size && prev.dom.parentNode == this.contentDOM && !prev.emptyChildAt(1)) {
						fromOffset = domIndex(prev.dom) + 1;
						break;
					}
					from -= prev.size;
				}
				if (fromOffset == -1) fromOffset = 0;
			}
			if (fromOffset > -1 && (end > to || i == this.children.length - 1)) {
				to = end;
				for (let j = i + 1; j < this.children.length; j++) {
					let next = this.children[j];
					if (next.size && next.dom.parentNode == this.contentDOM && !next.emptyChildAt(-1)) {
						toOffset = domIndex(next.dom);
						break;
					}
					to += next.size;
				}
				if (toOffset == -1) toOffset = this.contentDOM.childNodes.length;
				break;
			}
			offset = end;
		}
		return { node: this.contentDOM, from, to, fromOffset, toOffset };
	}
	emptyChildAt(side) {
		if (this.border || !this.contentDOM || !this.children.length) return false;
		let child = this.children[side < 0 ? 0 : this.children.length - 1];
		return child.size == 0 || child.emptyChildAt(side);
	}
	domAfterPos(pos) {
		let { node, offset } = this.domFromPos(pos, 0);
		if (node.nodeType != 1 || offset == node.childNodes.length) throw new RangeError("No node after pos " + pos);
		return node.childNodes[offset];
	}
	// View descs are responsible for setting any selection that falls
	// entirely inside of them, so that custom implementations can do
	// custom things with the selection. Note that this falls apart when
	// a selection starts in such a node and ends in another, in which
	// case we just use whatever domFromPos produces as a best effort.
	setSelection(anchor, head, view, force = false) {
		// If the selection falls entirely in a child, give it to that child
		let from = Math.min(anchor, head),
			to = Math.max(anchor, head);
		for (let i = 0, offset = 0; i < this.children.length; i++) {
			let child = this.children[i],
				end = offset + child.size;
			if (from > offset && to < end) return child.setSelection(anchor - offset - child.border, head - offset - child.border, view, force);
			offset = end;
		}
		let anchorDOM = this.domFromPos(anchor, anchor ? -1 : 1);
		let headDOM = head == anchor ? anchorDOM : this.domFromPos(head, head ? -1 : 1);
		let domSel = view.root.getSelection();
		let selRange = view.domSelectionRange();
		let brKludge = false;
		// On Firefox, using Selection.collapse to put the cursor after a
		// BR node for some reason doesn't always work (#1073). On Safari,
		// the cursor sometimes inexplicable visually lags behind its
		// reported position in such situations (#1092).
		if ((gecko || safari) && anchor == head) {
			let { node, offset } = anchorDOM;
			if (node.nodeType == 3) {
				brKludge = !!(offset && node.nodeValue[offset - 1] == "\n");
				// Issue #1128
				if (brKludge && offset == node.nodeValue.length) {
					for (let scan = node, after; scan; scan = scan.parentNode) {
						if ((after = scan.nextSibling)) {
							if (after.nodeName == "BR") anchorDOM = headDOM = { node: after.parentNode, offset: domIndex(after) + 1 };
							break;
						}
						let desc = scan.pmViewDesc;
						if (desc && desc.node && desc.node.isBlock) break;
					}
				}
			} else {
				let prev = node.childNodes[offset - 1];
				brKludge = prev && (prev.nodeName == "BR" || prev.contentEditable == "false");
			}
		}
		// Firefox can act strangely when the selection is in front of an
		// uneditable node. See #1163 and https://bugzilla.mozilla.org/show_bug.cgi?id=1709536
		if (gecko && selRange.focusNode && selRange.focusNode != headDOM.node && selRange.focusNode.nodeType == 1) {
			let after = selRange.focusNode.childNodes[selRange.focusOffset];
			if (after && after.contentEditable == "false") force = true;
		}
		if (
			!(force || (brKludge && safari)) &&
			isEquivalentPosition(anchorDOM.node, anchorDOM.offset, selRange.anchorNode, selRange.anchorOffset) &&
			isEquivalentPosition(headDOM.node, headDOM.offset, selRange.focusNode, selRange.focusOffset)
		)
			return;
		// Selection.extend can be used to create an 'inverted' selection
		// (one where the focus is before the anchor), but not all
		// browsers support it yet.
		let domSelExtended = false;
		if ((domSel.extend || anchor == head) && !(brKludge && gecko)) {
			domSel.collapse(anchorDOM.node, anchorDOM.offset);
			try {
				if (anchor != head) domSel.extend(headDOM.node, headDOM.offset);
				domSelExtended = true;
			} catch (_) {
				// In some cases with Chrome the selection is empty after calling
				// collapse, even when it should be valid. This appears to be a bug, but
				// it is difficult to isolate. If this happens fallback to the old path
				// without using extend.
				// Similarly, this could crash on Safari if the editor is hidden, and
				// there was no selection.
			}
		}
		if (!domSelExtended) {
			if (anchor > head) {
				let tmp = anchorDOM;
				anchorDOM = headDOM;
				headDOM = tmp;
			}
			let range = document.createRange();
			range.setEnd(headDOM.node, headDOM.offset);
			range.setStart(anchorDOM.node, anchorDOM.offset);
			domSel.removeAllRanges();
			domSel.addRange(range);
		}
	}
	ignoreMutation(mutation) {
		return !this.contentDOM && mutation.type != "selection";
	}
	get contentLost() {
		return this.contentDOM && this.contentDOM != this.dom && !this.dom.contains(this.contentDOM);
	}
	// Remove a subtree of the element tree that has been touched
	// by a DOM change, so that the next update will redraw it.
	markDirty(from, to) {
		for (let offset = 0, i = 0; i < this.children.length; i++) {
			let child = this.children[i],
				end = offset + child.size;
			if (offset == end ? from <= end && to >= offset : from < end && to > offset) {
				let startInside = offset + child.border,
					endInside = end - child.border;
				if (from >= startInside && to <= endInside) {
					this.dirty = from == offset || to == end ? CONTENT_DIRTY : CHILD_DIRTY;
					if (from == startInside && to == endInside && (child.contentLost || child.dom.parentNode != this.contentDOM)) child.dirty = NODE_DIRTY;
					else child.markDirty(from - startInside, to - startInside);
					return;
				} else {
					child.dirty = child.dom == child.contentDOM && child.dom.parentNode == this.contentDOM && !child.children.length ? CONTENT_DIRTY : NODE_DIRTY;
				}
			}
			offset = end;
		}
		this.dirty = CONTENT_DIRTY;
	}
	markParentsDirty() {
		let level = 1;
		for (let node = this.parent; node; node = node.parent, level++) {
			let dirty = level == 1 ? CONTENT_DIRTY : CHILD_DIRTY;
			if (node.dirty < dirty) node.dirty = dirty;
		}
	}
	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
// drawn between the document nodes.
class WidgetViewDesc extends ViewDesc {
	constructor(parent, widget, view, pos) {
		let self,
			dom = widget.type.toDOM;
		if (typeof dom == "function")
			dom = dom(view, () => {
				if (!self) return pos;
				if (self.parent) return self.parent.posBeforeChild(self);
			});
		if (!widget.type.spec.raw) {
			if (dom.nodeType != 1) {
				let wrap = document.createElement("span");
				wrap.appendChild(dom);
				dom = wrap;
			}
			dom.contentEditable = "false";
			dom.classList.add("ProseMirror-widget");
		}
		super(parent, [], dom, null);
		this.widget = widget;
		this.widget = widget;
		self = this;
	}
	matchesWidget(widget) {
		return this.dirty == NOT_DIRTY && widget.type.eq(this.widget.type);
	}
	parseRule() {
		return { ignore: true };
	}
	stopEvent(event) {
		let stop = this.widget.spec.stopEvent;
		return stop ? stop(event) : false;
	}
	ignoreMutation(mutation) {
		return mutation.type != "selection" || this.widget.spec.ignoreSelection;
	}
	destroy() {
		this.widget.type.destroy(this.dom);
		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 {
	constructor(parent, dom, textDOM, text) {
		super(parent, [], dom, null);
		this.textDOM = textDOM;
		this.text = text;
	}
	get size() {
		return this.text.length;
	}
	localPosFromDOM(dom, offset) {
		if (dom != this.textDOM) return this.posAtStart + (offset ? this.size : 0);
		return this.posAtStart + offset;
	}
	domFromPos(pos) {
		return { node: this.textDOM, offset: pos };
	}
	ignoreMutation(mut) {
		return mut.type === "characterData" && mut.target.nodeValue == mut.oldValue;
	}
}
// A mark desc represents a mark. May have multiple children,
// depending on how the mark is split. Note that marks are drawn using
// a fixed nesting order, for simplicity and predictability, so in
// some cases they will be split more often than would appear
// necessary.
class MarkViewDesc extends ViewDesc {
	constructor(parent, mark, dom, contentDOM, spec) {
		super(parent, [], dom, contentDOM);
		this.mark = mark;
		this.spec = spec;
	}
	static create(parent, mark, inline, view) {
		let custom = view.nodeViews[mark.type.name];
		let spec = custom && custom(mark, view, inline);
		if (!spec || !spec.dom) spec = DOMSerializer.renderSpec(document, mark.type.spec.toDOM(mark, inline), null, mark.attrs);
		return new MarkViewDesc(parent, mark, spec.dom, spec.contentDOM || spec.dom, spec);
	}
	parseRule() {
		if (this.dirty & NODE_DIRTY || this.mark.type.spec.reparseInView) return null;
		return { mark: this.mark.type.name, attrs: this.mark.attrs, contentElement: this.contentDOM };
	}
	matchesMark(mark) {
		return this.dirty != NODE_DIRTY && this.mark.eq(mark);
	}
	markDirty(from, to) {
		super.markDirty(from, to);
		// Move dirty info to nearest node view
		if (this.dirty != NOT_DIRTY) {
			let parent = this.parent;
			while (!parent.node) parent = parent.parent;
			if (parent.dirty < this.dirty) parent.dirty = this.dirty;
			this.dirty = NOT_DIRTY;
		}
	}
	slice(from, to, view) {
		let copy = MarkViewDesc.create(this.parent, this.mark, true, view);
		let nodes = this.children,
			size = this.size;
		if (to < size) nodes = replaceNodes(nodes, to, size, view);
		if (from > 0) nodes = replaceNodes(nodes, 0, from, view);
		for (let i = 0; i < nodes.length; i++) nodes[i].parent = copy;
		copy.children = nodes;
		return copy;
	}
	ignoreMutation(mutation) {
		return this.spec.ignoreMutation ? this.spec.ignoreMutation(mutation) : super.ignoreMutation(mutation);
	}
	destroy() {
		if (this.spec.destroy) this.spec.destroy();
		super.destroy();
	}
}
// Node view descs are the main, most common type of view desc, and
// correspond to an actual node in the document. Unlike mark descs,
// they populate their child array themselves.
class NodeViewDesc extends ViewDesc {
	constructor(parent, node, outerDeco, innerDeco, dom, contentDOM, nodeDOM) {
		super(parent, [], dom, contentDOM);
		this.node = node;
		this.outerDeco = outerDeco;
		this.innerDeco = innerDeco;
		this.nodeDOM = nodeDOM;
	}
	// By default, a node is rendered using the `toDOM` method from the
	// node type spec. But client code can use the `nodeViews` spec to
	// supply a custom node view, which can influence various aspects of
	// the way the node works.
	//
	// (Using subclassing for this was intentionally decided against,
	// since it'd require exposing a whole slew of finicky
	// implementation details to the user code that they probably will
	// never need.)
	static create(parent, node, outerDeco, innerDeco, view, pos) {
		let custom = view.nodeViews[node.type.name],
			descObj;
		let spec =
			custom &&
			custom(
				node,
				view,
				() => {
					// (This is a function that allows the custom view to find its
					// own position)
					if (!descObj) return pos;
					if (descObj.parent) return descObj.parent.posBeforeChild(descObj);
				},
				outerDeco,
				innerDeco,
			);
		let dom = spec && spec.dom,
			contentDOM = spec && spec.contentDOM;
		if (node.isText) {
			if (!dom) dom = document.createTextNode(node.text);
			else if (dom.nodeType != 3) throw new RangeError("Text must be rendered as a DOM text node");
		} else if (!dom) {
			let spec = DOMSerializer.renderSpec(document, node.type.spec.toDOM(node), null, node.attrs);
			({ dom, contentDOM } = spec);
		}
		if (!contentDOM && !node.isText && dom.nodeName != "BR") {
			// Chrome gets confused by <br contenteditable=false>
			if (!dom.hasAttribute("contenteditable")) dom.contentEditable = "false";
			if (node.type.spec.draggable) dom.draggable = true;
		}
		let nodeDOM = dom;
		dom = applyOuterDeco(dom, outerDeco, node);
		if (spec) return (descObj = new CustomNodeViewDesc(parent, node, outerDeco, innerDeco, dom, contentDOM || null, nodeDOM, spec));
		else if (node.isText) return new TextViewDesc(parent, node, outerDeco, innerDeco, dom, nodeDOM);
		else return new NodeViewDesc(parent, node, outerDeco, innerDeco, dom, contentDOM || null, nodeDOM);
	}
	parseRule() {
		// Experimental kludge to allow opt-in re-parsing of nodes
		if (this.node.type.spec.reparseInView) return null;
		// FIXME the assumption that this can always return the current
		// attrs means that if the user somehow manages to change the
		// attrs in the dom, that won't be picked up. Not entirely sure
		// whether this is a problem
		let rule = { node: this.node.type.name, attrs: this.node.attrs };
		if (this.node.type.whitespace == "pre") rule.preserveWhitespace = "full";
		if (!this.contentDOM) {
			rule.getContent = () => this.node.content;
		} else if (!this.contentLost) {
			rule.contentElement = this.contentDOM;
		} else {
			// Chrome likes to randomly recreate parent nodes when
			// backspacing things. When that happens, this tries to find the
			// new parent.
			for (let i = this.children.length - 1; i >= 0; i--) {
				let child = this.children[i];
				if (this.dom.contains(child.dom.parentNode)) {
					rule.contentElement = child.dom.parentNode;
					break;
				}
			}
			if (!rule.contentElement) rule.getContent = () => Fragment.empty;
		}
		return rule;
	}
	matchesNode(node, outerDeco, innerDeco) {
		return this.dirty == NOT_DIRTY && node.eq(this.node) && sameOuterDeco(outerDeco, this.outerDeco) && innerDeco.eq(this.innerDeco);
	}
	get size() {
		return this.node.nodeSize;
	}
	get border() {
		return this.node.isLeaf ? 0 : 1;
	}
	// Syncs `this.children` to match `this.node.content` and the local
	// decorations, possibly introducing nesting for marks. Then, in a
	// separate step, syncs the DOM inside `this.contentDOM` to
	// `this.children`.
	updateChildren(view, pos) {
		let inline = this.node.inlineContent,
			off = pos;
		let composition = view.composing ? this.localCompositionInfo(view, pos) : null;
		let localComposition = composition && composition.pos > -1 ? composition : null;
		let compositionInChild = composition && composition.pos < 0;
		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, i);
				else if (widget.type.side >= 0 && !insideNode) updater.syncToMarks(i == this.node.childCount ? Mark$1.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, i);
				// Try several strategies for drawing this node
				let compIndex;
				if (updater.findNodeMatch(child, outerDeco, innerDeco, i));
				else if (
					compositionInChild &&
					view.state.selection.from > off &&
					view.state.selection.to < off + child.nodeSize &&
					(compIndex = updater.findIndexWithChild(composition.node)) > -1 &&
					updater.updateNodeAt(child, outerDeco, innerDeco, compIndex, view)
				);
				else if (updater.updateNextNode(child, outerDeco, innerDeco, view, i, off));
				else {
					// Add it as a new view
					updater.addNode(child, outerDeco, innerDeco, view, off);
				}
				off += child.nodeSize;
			},
		);
		// Drop all remaining descs after the current position.
		updater.syncToMarks([], inline, view, 0);
		if (this.node.isTextblock) updater.addTextblockHacks();
		updater.destroyRest();
		// Sync the DOM if anything changed
		if (updater.changed || this.dirty == CONTENT_DIRTY) {
			// May have to protect focused DOM from being changed if a composition is active
			if (localComposition) this.protectLocalComposition(view, localComposition);
			renderDescs(this.contentDOM, this.children, view);
			if (ios) iosHacks(this.dom);
		}
	}
	localCompositionInfo(view, pos) {
		// Only do something if both the selection and a focused text node
		// are inside of this node
		let { from, to } = view.state.selection;
		if (!(view.state.selection instanceof TextSelection) || from < pos || to > pos + this.node.content.size) return null;
		let textNode = view.input.compositionNode;
		if (!textNode || !this.dom.contains(textNode.parentNode)) return null;
		if (this.node.inlineContent) {
			// Find the text in the focused node in the node, stop if it's not
			// there (may have been modified through other means, in which
			// case it should overwritten)
			let text = textNode.nodeValue;
			let textPos = findTextInFragment(this.node.content, text, from - pos, to - pos);
			return textPos < 0 ? null : { node: textNode, pos: textPos, text };
		} else {
			return { node: textNode, pos: -1, text: "" };
		}
	}
	protectLocalComposition(view, { node, pos, text }) {
		// The node is already part of a local view desc, leave it there
		if (this.getDesc(node)) return;
		// Create a composition view for the orphaned nodes
		let topNode = node;
		for (; ; topNode = topNode.parentNode) {
			if (topNode.parentNode == this.contentDOM) break;
			while (topNode.previousSibling) topNode.parentNode.removeChild(topNode.previousSibling);
			while (topNode.nextSibling) topNode.parentNode.removeChild(topNode.nextSibling);
			if (topNode.pmViewDesc) topNode.pmViewDesc = undefined;
		}
		let desc = new CompositionViewDesc(this, topNode, node, text);
		view.input.compositionNodes.push(desc);
		// Patch up this.children to contain the composition view
		this.children = replaceNodes(this.children, pos, pos + text.length, view, desc);
	}
	// If this desc must be updated to match the given node decoration,
	// do so and return true.
	update(node, outerDeco, innerDeco, view) {
		if (this.dirty == NODE_DIRTY || !node.sameMarkup(this.node)) return false;
		this.updateInner(node, outerDeco, innerDeco, view);
		return true;
	}
	updateInner(node, outerDeco, innerDeco, view) {
		this.updateOuterDeco(outerDeco);
		this.node = node;
		this.innerDeco = innerDeco;
		if (this.contentDOM) this.updateChildren(view, this.posAtStart);
		this.dirty = NOT_DIRTY;
	}
	updateOuterDeco(outerDeco) {
		if (sameOuterDeco(outerDeco, this.outerDeco)) return;
		let needsWrap = this.nodeDOM.nodeType != 1;
		let oldDOM = this.dom;
		this.dom = patchOuterDeco(this.dom, this.nodeDOM, computeOuterDeco(this.outerDeco, this.node, needsWrap), computeOuterDeco(outerDeco, this.node, needsWrap));
		if (this.dom != oldDOM) {
			oldDOM.pmViewDesc = undefined;
			this.dom.pmViewDesc = this;
		}
		this.outerDeco = outerDeco;
	}
	// Mark this node as being the selected node.
	selectNode() {
		if (this.nodeDOM.nodeType == 1) {
			this.nodeDOM.classList.add("ProseMirror-selectednode");
			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.nodeDOM.removeAttribute("draggable");
		}
	}
	get domAtom() {
		return this.node.isAtom;
	}
}
// Create a view desc for the top-level document node, to be exported
// and used by the view class.
function docViewDesc(doc, outerDeco, innerDeco, dom, view) {
	applyOuterDeco(dom, outerDeco, doc);
	let docView = new NodeViewDesc(undefined, doc, outerDeco, innerDeco, dom, dom, dom);
	if (docView.contentDOM) docView.updateChildren(view, 0);
	return docView;
}
class TextViewDesc extends NodeViewDesc {
	constructor(parent, node, outerDeco, innerDeco, dom, nodeDOM) {
		super(parent, node, outerDeco, innerDeco, dom, null, nodeDOM);
	}
	parseRule() {
		let skip = this.nodeDOM.parentNode;
		while (skip && skip != this.dom && !skip.pmIsDeco) skip = skip.parentNode;
		return { skip: skip || true };
	}
	update(node, outerDeco, innerDeco, view) {
		if (this.dirty == NODE_DIRTY || (this.dirty != NOT_DIRTY && !this.inParent()) || !node.sameMarkup(this.node)) return false;
		this.updateOuterDeco(outerDeco);
		if ((this.dirty != NOT_DIRTY || node.text != this.node.text) && node.text != this.nodeDOM.nodeValue) {
			this.nodeDOM.nodeValue = node.text;
			if (view.trackWrites == this.nodeDOM) view.trackWrites = null;
		}
		this.node = node;
		this.dirty = NOT_DIRTY;
		return true;
	}
	inParent() {
		let parentDOM = this.parent.contentDOM;
		for (let n = this.nodeDOM; n; n = n.parentNode) if (n == parentDOM) return true;
		return false;
	}
	domFromPos(pos) {
		return { node: this.nodeDOM, offset: pos };
	}
	localPosFromDOM(dom, offset, bias) {
		if (dom == this.nodeDOM) return this.posAtStart + Math.min(offset, this.node.text.length);
		return super.localPosFromDOM(dom, offset, bias);
	}
	ignoreMutation(mutation) {
		return mutation.type != "characterData" && mutation.type != "selection";
	}
	slice(from, to, _view) {
		let node = this.node.cut(from, to),
			dom = document.createTextNode(node.text);
		return new TextViewDesc(this.parent, node, this.outerDeco, this.innerDeco, dom, dom);
	}
	markDirty(from, to) {
		super.markDirty(from, to);
		if (this.dom != this.nodeDOM && (from == 0 || to == this.nodeDOM.nodeValue.length)) this.dirty = NODE_DIRTY;
	}
	get domAtom() {
		return false;
	}
	isText(text) {
		return this.node.text == text;
	}
}
// A dummy desc used to tag trailing BR or IMG nodes created to work
// around contentEditable terribleness.
class TrailingHackViewDesc extends ViewDesc {
	parseRule() {
		return { ignore: true };
	}
	matchesHack(nodeName) {
		return this.dirty == NOT_DIRTY && this.dom.nodeName == nodeName;
	}
	get domAtom() {
		return true;
	}
	get ignoreForCoords() {
		return this.dom.nodeName == "IMG";
	}
}
// A separate subclass is used for customized node views, so that the
// extra checks only have to be made for nodes that are actually
// customized.
class CustomNodeViewDesc extends NodeViewDesc {
	constructor(parent, node, outerDeco, innerDeco, dom, contentDOM, nodeDOM, spec) {
		super(parent, node, outerDeco, innerDeco, dom, contentDOM, nodeDOM);
		this.spec = spec;
	}
	// A custom `update` method gets to decide whether the update goes
	// through. If it does, and there's a `contentDOM` node, our logic
	// updates the children.
	update(node, outerDeco, innerDeco, view) {
		if (this.dirty == NODE_DIRTY) return false;
		if (this.spec.update && (this.node.type == node.type || this.spec.multiType)) {
			let result = this.spec.update(node, outerDeco, innerDeco);
			if (result) this.updateInner(node, outerDeco, innerDeco, view);
			return result;
		} else if (!this.contentDOM && !node.isLeaf) {
			return false;
		} else {
			return super.update(node, outerDeco, innerDeco, view);
		}
	}
	selectNode() {
		this.spec.selectNode ? this.spec.selectNode() : super.selectNode();
	}
	deselectNode() {
		this.spec.deselectNode ? this.spec.deselectNode() : super.deselectNode();
	}
	setSelection(anchor, head, view, force) {
		this.spec.setSelection ? this.spec.setSelection(anchor, head, view.root) : super.setSelection(anchor, head, view, force);
	}
	destroy() {
		if (this.spec.destroy) this.spec.destroy();
		super.destroy();
	}
	stopEvent(event) {
		return this.spec.stopEvent ? this.spec.stopEvent(event) : false;
	}
	ignoreMutation(mutation) {
		return this.spec.ignoreMutation ? this.spec.ignoreMutation(mutation) : super.ignoreMutation(mutation);
	}
}
// Sync the content of the given DOM node with the nodes associated
// with the given array of view descs, recursing into mark descs
// because this should sync the subtree for a whole node at a time.
function renderDescs(parentDOM, descs, view) {
	let dom = parentDOM.firstChild,
		written = false;
	for (let i = 0; i < descs.length; i++) {
		let desc = descs[i],
			childDOM = desc.dom;
		if (childDOM.parentNode == parentDOM) {
			while (childDOM != dom) {
				dom = rm(dom);
				written = true;
			}
			dom = dom.nextSibling;
		} else {
			written = true;
			parentDOM.insertBefore(childDOM, dom);
		}
		if (desc instanceof MarkViewDesc) {
			let pos = dom ? dom.previousSibling : parentDOM.lastChild;
			renderDescs(desc.contentDOM, desc.children, view);
			dom = pos ? pos.nextSibling : parentDOM.firstChild;
		}
	}
	while (dom) {
		dom = rm(dom);
		written = true;
	}
	if (written && view.trackWrites == parentDOM) view.trackWrites = null;
}
const OuterDecoLevel = function (nodeName) {
	if (nodeName) this.nodeName = nodeName;
};
OuterDecoLevel.prototype = Object.create(null);
const noDeco = [new OuterDecoLevel()];
function computeOuterDeco(outerDeco, node, needsWrap) {
	if (outerDeco.length == 0) return noDeco;
	let top = needsWrap ? noDeco[0] : new OuterDecoLevel(),
		result = [top];
	for (let i = 0; i < outerDeco.length; i++) {
		let attrs = outerDeco[i].type.attrs;
		if (!attrs) continue;
		if (attrs.nodeName) result.push((top = new OuterDecoLevel(attrs.nodeName)));
		for (let name in attrs) {
			let val = attrs[name];
			if (val == null) continue;
			if (needsWrap && result.length == 1) result.push((top = new OuterDecoLevel(node.isInline ? "span" : "div")));
			if (name == "class") top.class = (top.class ? top.class + " " : "") + val;
			else if (name == "style") top.style = (top.style ? top.style + ";" : "") + val;
			else if (name != "nodeName") top[name] = val;
		}
	}
	return result;
}
function patchOuterDeco(outerDOM, nodeDOM, prevComputed, curComputed) {
	// Shortcut for trivial case
	if (prevComputed == noDeco && curComputed == noDeco) return nodeDOM;
	let curDOM = nodeDOM;
	for (let i = 0; i < curComputed.length; i++) {
		let deco = curComputed[i],
			prev = prevComputed[i];
		if (i) {
			let parent;
			if (prev && prev.nodeName == deco.nodeName && curDOM != outerDOM && (parent = curDOM.parentNode) && parent.nodeName.toLowerCase() == deco.nodeName) {
				curDOM = parent;
			} else {
				parent = document.createElement(deco.nodeName);
				parent.pmIsDeco = true;
				parent.appendChild(curDOM);
				prev = noDeco[0];
				curDOM = parent;
			}
		}
		patchAttributes(curDOM, prev || noDeco[0], deco);
	}
	return curDOM;
}
function patchAttributes(dom, prev, cur) {
	for (let name in prev) if (name != "class" && name != "style" && name != "nodeName" && !(name in cur)) dom.removeAttribute(name);
	for (let name in cur) if (name != "class" && name != "style" && name != "nodeName" && cur[name] != prev[name]) dom.setAttribute(name, cur[name]);
	if (prev.class != cur.class) {
		let prevList = prev.class ? prev.class.split(" ").filter(Boolean) : [];
		let curList = cur.class ? cur.class.split(" ").filter(Boolean) : [];
		for (let i = 0; i < prevList.length; i++) if (curList.indexOf(prevList[i]) == -1) dom.classList.remove(prevList[i]);
		for (let i = 0; i < curList.length; i++) if (prevList.indexOf(curList[i]) == -1) dom.classList.add(curList[i]);
		if (dom.classList.length == 0) dom.removeAttribute("class");
	}
	if (prev.style != cur.style) {
		if (prev.style) {
			let prop = /\s*([\w\-\xa1-\uffff]+)\s*:(?:"(?:\\.|[^"])*"|'(?:\\.|[^'])*'|\(.*?\)|[^;])*/g,
				m;
			while ((m = prop.exec(prev.style))) dom.style.removeProperty(m[1]);
		}
		if (cur.style) dom.style.cssText += cur.style;
	}
}
function applyOuterDeco(dom, deco, node) {
	return patchOuterDeco(dom, dom, noDeco, computeOuterDeco(deco, node, dom.nodeType != 1));
}
function sameOuterDeco(a, b) {
	if (a.length != b.length) return false;
	for (let i = 0; i < a.length; i++) if (!a[i].type.eq(b[i].type)) return false;
	return true;
}
// Remove a DOM node and return its next sibling.
function rm(dom) {
	let next = dom.nextSibling;
	dom.parentNode.removeChild(dom);
	return next;
}
// Helper class for incrementally updating a tree of mark descs and
// the widget and node descs inside of them.
class ViewTreeUpdater {
	constructor(top, lock, view) {
		this.lock = lock;
		this.view = view;
		// Index into `this.top`'s child array, represents the current
		// update position.
		this.index = 0;
		// When entering a mark, the current top and index are pushed
		// onto this.
		this.stack = [];
		// Tracks whether anything was changed
		this.changed = false;
		this.top = top;
		this.preMatch = preMatch(top.node.content, top);
	}
	// Destroy and remove the children between the given indices in
	// `this.top`.
	destroyBetween(start, end) {
		if (start == end) return;
		for (let i = start; i < end; i++) this.top.children[i].destroy();
		this.top.children.splice(start, end - start);
		this.changed = true;
	}
	// Destroy all remaining children in `this.top`.
	destroyRest() {
		this.destroyBetween(this.index, this.top.children.length);
	}
	// Sync the current stack of mark descs with the given array of
	// marks, reusing existing mark descs when possible.
	syncToMarks(marks, inline, view, parentIndex) {
		let keep = 0,
			depth = this.stack.length >> 1;
		let maxKeep = Math.min(depth, marks.length);
		while (keep < maxKeep && (keep == depth - 1 ? this.top : this.stack[(keep + 1) << 1]).matchesMark(marks[keep]) && marks[keep].type.spec.spanning !== false) keep++;
		while (keep < depth) {
			this.destroyRest();
			this.top.dirty = NOT_DIRTY;
			this.index = this.stack.pop();
			this.top = this.stack.pop();
			depth--;
		}
		while (depth < marks.length) {
			this.stack.push(this.top, this.index + 1);
			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;
					break;
				}
			}
			// When nothing matches, try to update the mark view at this position
			// in place, so a custom mark view can adapt to a changed mark without
			// re-creating its DOM.
			if (found < 0 && this.index < this.top.children.length) {
				let cur = this.top.children[this.index];
				if (cur instanceof MarkViewDesc && cur.dirty != NODE_DIRTY && cur.mark.type == marks[depth].type && cur.spec.update && !this.isLocked(cur.dom) && cur.spec.update(marks[depth])) {
					cur.mark = marks[depth];
					found = this.index;
					this.changed = true;
				}
			}
			if (found > -1) {
				if (found > this.index) {
					this.changed = true;
					this.destroyBetween(this.index, found);
				}
				this.top = this.top.children[this.index];
			} else {
				let markDesc = MarkViewDesc.create(this.top, marks[depth], inline, view);
				this.top.children.splice(this.index, 0, markDesc);
				this.top = markDesc;
				this.changed = true;
			}
			this.index = 0;
			depth++;
		}
	}
	// Try to find a node desc matching the given data. Skip over it and
	// return true when successful.
	findNodeMatch(node, outerDeco, innerDeco, index) {
		let found = -1,
			targetDesc;
		if (index >= this.preMatch.index && (targetDesc = this.preMatch.matches[index - this.preMatch.index]).parent == this.top && targetDesc.matchesNode(node, outerDeco, innerDeco)) {
			found = this.top.children.indexOf(targetDesc, this.index);
		} else {
			for (let i = this.index, e = Math.min(this.top.children.length, i + 5); i < e; i++) {
				let child = this.top.children[i];
				if (child.matchesNode(node, outerDeco, innerDeco) && !this.preMatch.matched.has(child)) {
					found = i;
					break;
				}
			}
		}
		if (found < 0) return false;
		this.destroyBetween(this.index, found);
		this.index++;
		return true;
	}
	updateNodeAt(node, outerDeco, innerDeco, index, view) {
		let child = this.top.children[index];
		if (child.dirty == NODE_DIRTY && child.dom == child.contentDOM) child.dirty = CONTENT_DIRTY;
		if (!child.update(node, outerDeco, innerDeco, view)) return false;
		this.destroyBetween(this.index, index);
		this.index++;
		return true;
	}
	findIndexWithChild(domNode) {
		for (;;) {
			let parent = domNode.parentNode;
			if (!parent) return -1;
			if (parent == this.top.contentDOM) {
				let desc = domNode.pmViewDesc;
				if (desc)
					for (let i = this.index; i < this.top.children.length; i++) {
						if (this.top.children[i] == desc) return i;
					}
				return -1;
			}
			domNode = parent;
		}
	}
	// Try to update the next node, if any, to the given data. Checks
	// pre-matches to avoid overwriting nodes that could still be used.
	updateNextNode(node, outerDeco, innerDeco, view, index, pos) {
		for (let i = this.index; i < this.top.children.length; i++) {
			let next = this.top.children[i];
			if (next instanceof NodeViewDesc) {
				let preMatch = this.preMatch.matched.get(next);
				if (preMatch != null && preMatch != index) return false;
				let nextDOM = next.dom,
					updated;
				// Can't update if nextDOM is or contains this.lock, except if
				// it's a text node whose content already matches the new text
				// and whose decorations match the new ones.
				let locked =
					this.isLocked(nextDOM) &&
					!(node.isText && next.node && next.node.isText && next.nodeDOM.nodeValue == node.text && next.dirty != NODE_DIRTY && sameOuterDeco(outerDeco, next.outerDeco));
				if (!locked && next.update(node, outerDeco, innerDeco, view)) {
					this.destroyBetween(this.index, i);
					if (next.dom != nextDOM) this.changed = true;
					this.index++;
					return true;
				} else if (!locked && (updated = this.recreateWrapper(next, node, outerDeco, innerDeco, view, pos))) {
					this.destroyBetween(this.index, i);
					this.top.children[this.index] = updated;
					if (updated.contentDOM) {
						updated.dirty = CONTENT_DIRTY;
						updated.updateChildren(view, pos + 1);
						updated.dirty = NOT_DIRTY;
					}
					this.changed = true;
					this.index++;
					return true;
				}
				break;
			}
		}
		return false;
	}
	// When a node with content is replaced by a different node with
	// identical content, move over its children.
	recreateWrapper(next, node, outerDeco, innerDeco, view, pos) {
		if (next.dirty || node.isAtom || !next.children.length || !next.node.content.eq(node.content) || !sameOuterDeco(outerDeco, next.outerDeco) || !innerDeco.eq(next.innerDeco)) return null;
		let wrapper = NodeViewDesc.create(this.top, node, outerDeco, innerDeco, view, pos);
		if (wrapper.contentDOM) {
			wrapper.children = next.children;
			next.children = [];
			for (let ch of wrapper.children) ch.parent = wrapper;
		}
		next.destroy();
		return wrapper;
	}
	// Insert the node as a newly created node desc.
	addNode(node, outerDeco, innerDeco, view, pos) {
		let desc = NodeViewDesc.create(this.top, node, outerDeco, innerDeco, view, pos);
		if (desc.contentDOM) desc.updateChildren(view, pos + 1);
		this.top.children.splice(this.index++, 0, desc);
		this.changed = true;
	}
	placeWidget(widget, view, pos) {
		let next = this.index < this.top.children.length ? this.top.children[this.index] : null;
		if (next && next.matchesWidget(widget) && (widget == next.widget || !next.widget.type.toDOM.parentNode)) {
			this.index++;
		} else {
			let desc = new WidgetViewDesc(this.top, widget, view, pos);
			this.top.children.splice(this.index++, 0, desc);
			this.changed = true;
		}
	}
	// Make sure a textblock looks and behaves correctly in
	// contentEditable.
	addTextblockHacks() {
		let lastChild = this.top.children[this.index - 1],
			parent = this.top;
		while (lastChild instanceof MarkViewDesc) {
			parent = lastChild;
			lastChild = parent.children[parent.children.length - 1];
		}
		if (
			!lastChild || // Empty textblock
			!(lastChild instanceof TextViewDesc) ||
			/\n$/.test(lastChild.node.text) ||
			(this.view.requiresGeckoHackNode && /\s$/.test(lastChild.node.text))
		) {
			// Avoid bugs in Safari's cursor drawing (#1165) and Chrome's mouse selection (#1152)
			if ((safari || chrome) && lastChild && lastChild.dom.contentEditable == "false") this.addHackNode("IMG", parent);
			this.addHackNode("BR", this.top);
		}
	}
	addHackNode(nodeName, parent) {
		if (parent == this.top && this.index < parent.children.length && parent.children[this.index].matchesHack(nodeName)) {
			this.index++;
		} else {
			let dom = document.createElement(nodeName);
			if (nodeName == "IMG") {
				dom.className = "ProseMirror-separator";
				dom.alt = "";
			}
			if (nodeName == "BR") dom.className = "ProseMirror-trailingBreak";
			let hack = new TrailingHackViewDesc(this.top, [], dom, null);
			if (parent != this.top) parent.children.push(hack);
			else parent.children.splice(this.index++, 0, hack);
			this.changed = true;
		}
	}
	isLocked(node) {
		return this.lock && (node == this.lock || (node.nodeType == 1 && node.contains(this.lock.parentNode)));
	}
}
// 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.
function preMatch(frag, parentDesc) {
	let curDesc = parentDesc,
		descI = curDesc.children.length;
	let fI = frag.childCount,
		matched = new Map(),
		matches = [];
	outer: while (fI > 0) {
		let desc;
		for (;;) {
			if (descI) {
				let next = curDesc.children[descI - 1];
				if (next instanceof MarkViewDesc) {
					curDesc = next;
					descI = next.children.length;
				} else {
					desc = next;
					descI--;
					break;
				}
			} else if (curDesc == parentDesc) {
				break outer;
			} else {
				descI = curDesc.parent.children.indexOf(curDesc);
				curDesc = curDesc.parent;
			}
		}
		let node = desc.node;
		if (!node) continue;
		if (node != frag.child(fI - 1)) break;
		--fI;
		matched.set(desc, fI);
		matches.push(desc);
	}
	return { index: fI, matched, matches: matches.reverse() };
}
function compareSide(a, b) {
	return a.type.side - b.type.side;
}
// This function abstracts iterating over the nodes and decorations in
// a fragment. Calls `onNode` for each node, with its local and child
// decorations. Splits text nodes when there is a decoration starting
// or ending inside of them. Calls `onWidget` for each widget.
function iterDeco(parent, deco, onWidget, onNode) {
	let locals = deco.locals(parent),
		offset = 0;
	// Simple, cheap variant for when there are no local decorations
	if (locals.length == 0) {
		for (let i = 0; i < parent.childCount; i++) {
			let child = parent.child(i);
			onNode(child, locals, deco.forChild(offset, child), i);
			offset += child.nodeSize;
		}
		return;
	}
	let decoIndex = 0,
		active = [],
		restNode = null;
	for (let parentIndex = 0; ; ) {
		let widget, widgets;
		while (decoIndex < locals.length && locals[decoIndex].to == offset) {
			let next = locals[decoIndex++];
			if (next.widget) {
				if (!widget) widget = next;
				else (widgets || (widgets = [widget])).push(next);
			}
		}
		if (widget) {
			if (widgets) {
				widgets.sort(compareSide);
				for (let i = 0; i < widgets.length; i++) onWidget(widgets[i], parentIndex, !!restNode);
			} else {
				onWidget(widget, parentIndex, !!restNode);
			}
		}
		let child, index;
		if (restNode) {
			index = -1;
			child = restNode;
			restNode = null;
		} else if (parentIndex < parent.childCount) {
			index = parentIndex;
			child = parent.child(parentIndex++);
		} else {
			break;
		}
		for (let i = 0; i < active.length; i++) if (active[i].to <= offset) active.splice(i--, 1);
		while (decoIndex < locals.length && locals[decoIndex].from <= offset && locals[decoIndex].to > offset) active.push(locals[decoIndex++]);
		let end = offset + child.nodeSize;
		if (child.isText) {
			let cutAt = end;
			if (decoIndex < locals.length && locals[decoIndex].from < cutAt) cutAt = locals[decoIndex].from;
			for (let i = 0; i < active.length; i++) if (active[i].to < cutAt) cutAt = active[i].to;
			if (cutAt < end) {
				restNode = child.cut(cutAt - offset);
				child = child.cut(0, cutAt - offset);
				end = cutAt;
				index = -1;
			}
		} else {
			while (decoIndex < locals.length && locals[decoIndex].to < end) decoIndex++;
		}
		let outerDeco = child.isInline && !child.isLeaf ? active.filter((d) => !d.inline) : active.slice();
		onNode(child, outerDeco, deco.forChild(offset, child), index);
		offset = end;
	}
}
// List markers in Mobile Safari will mysteriously disappear
// sometimes. This works around that.
function iosHacks(dom) {
	if (dom.nodeName == "UL" || dom.nodeName == "OL") {
		let oldCSS = dom.style.cssText;
		dom.style.cssText = oldCSS + "; list-style: square !important";
		window.getComputedStyle(dom).listStyle;
		dom.style.cssText = oldCSS;
	}
}
// Find a piece of text in an inline fragment, overlapping from-to
function findTextInFragment(frag, text, from, to) {
	for (let i = 0, pos = 0; i < frag.childCount && pos <= to; ) {
		let child = frag.child(i++),
			childStart = pos;
		pos += child.nodeSize;
		if (!child.isText) continue;
		let str = child.text;
		while (i < frag.childCount) {
			let next = frag.child(i++);
			pos += next.nodeSize;
			if (!next.isText) break;
			str += next.text;
		}
		if (pos >= from) {
			if (pos >= to && str.slice(to - text.length - childStart, to - childStart) == text) return to - text.length;
			let found = childStart < to ? str.lastIndexOf(text, to - childStart - 1) : -1;
			if (found >= 0 && found + text.length + childStart >= from) return childStart + found;
			if (from == to && str.length >= to + text.length - childStart && str.slice(to - childStart, to - childStart + text.length) == text) return to;
		}
	}
	return -1;
}
// Replace range from-to in an array of view descs with replacement
// (may be null to just delete). This goes very much against the grain
// of the rest of this code, which tends to create nodes with the
// right shape in one go, rather than messing with them after
// creation, but is necessary in the composition hack.
function replaceNodes(nodes, from, to, view, replacement) {
	let result = [];
	for (let i = 0, off = 0; i < nodes.length; i++) {
		let child = nodes[i],
			start = off,
			end = (off += child.size);
		if (start >= to || end <= from) {
			result.push(child);
		} else {
			if (start < from) result.push(child.slice(0, from - start, view));
			if (replacement) {
				result.push(replacement);
				replacement = undefined;
			}
			if (end > to) result.push(child.slice(to - start, child.size, view));
		}
	}
	return result;
}

function selectionFromDOM(view, origin = null) {
	let domSel = view.domSelectionRange(),
		doc = view.state.doc;
	if (!domSel.focusNode) return null;
	let nearestDesc = view.docView.nearestDesc(domSel.focusNode),
		inWidget = nearestDesc && nearestDesc.size == 0;
	let head = view.docView.posFromDOM(domSel.focusNode, domSel.focusOffset, 1);
	if (head < 0) return null;
	let $head = doc.resolve(head),
		anchor,
		selection;
	if (selectionCollapsed(domSel)) {
		anchor = head;
		while (nearestDesc && !nearestDesc.node) nearestDesc = nearestDesc.parent;
		let nearestDescNode = nearestDesc.node;
		if (
			nearestDesc &&
			nearestDescNode.isAtom &&
			NodeSelection.isSelectable(nearestDescNode) &&
			nearestDesc.parent &&
			!(nearestDescNode.isInline && isOnEdge(domSel.focusNode, domSel.focusOffset, nearestDesc.dom))
		) {
			let pos = nearestDesc.posBefore;
			selection = new NodeSelection(head == pos ? $head : doc.resolve(pos));
		}
	} else {
		if (domSel instanceof view.dom.ownerDocument.defaultView.Selection && domSel.rangeCount > 1) {
			let min = head,
				max = head;
			for (let i = 0; i < domSel.rangeCount; i++) {
				let range = domSel.getRangeAt(i);
				min = Math.min(min, view.docView.posFromDOM(range.startContainer, range.startOffset, 1));
				max = Math.max(max, view.docView.posFromDOM(range.endContainer, range.endOffset, -1));
			}
			if (min < 0) return null;
			[anchor, head] = max == view.state.selection.anchor ? [max, min] : [min, max];
			$head = doc.resolve(head);
		} else {
			anchor = view.docView.posFromDOM(domSel.anchorNode, domSel.anchorOffset, 1);
		}
		if (anchor < 0) return null;
	}
	let $anchor = doc.resolve(anchor);
	if (!selection) {
		let bias = origin == "pointer" || (view.state.selection.head < $head.pos && !inWidget) ? 1 : -1;
		selection = selectionBetween(view, $anchor, $head, bias);
	}
	return selection;
}
function editorOwnsSelection(view) {
	return view.editable ? view.hasFocus() : hasSelection(view) && document.activeElement && document.activeElement.contains(view.dom);
}
function selectionToDOM(view, force = false) {
	let sel = view.state.selection;
	syncNodeSelection(view, sel);
	if (!editorOwnsSelection(view)) return;
	// Need to delay selection normalization during a native selection
	// drag on Chrome, or it will cause further dragging to glitch.
	let mouseDown = view.input.mouseDown;
	if (!force && chrome && mouseDown) {
		let domSel = view.domSelectionRange(),
			curSel = view.domObserver.currentSelection;
		if (domSel.anchorNode && curSel.anchorNode && isEquivalentPosition(domSel.anchorNode, domSel.anchorOffset, curSel.anchorNode, curSel.anchorOffset) && mouseDown.delaySelUpdate()) {
			view.domObserver.setCurSelection();
			return;
		}
	}
	view.domObserver.disconnectSelection();
	if (view.cursorWrapper) {
		selectCursorWrapper(view);
	} else {
		let { anchor, head } = sel,
			resetEditableFrom,
			resetEditableTo;
		if (brokenSelectBetweenUneditable && !(sel instanceof TextSelection)) {
			if (!sel.$from.parent.inlineContent) resetEditableFrom = temporarilyEditableNear(view, sel.from);
			if (!sel.empty && !sel.$from.parent.inlineContent) resetEditableTo = temporarilyEditableNear(view, sel.to);
		}
		view.docView.setSelection(anchor, head, view, force);
		if (brokenSelectBetweenUneditable) {
			if (resetEditableFrom) resetEditable(resetEditableFrom);
			if (resetEditableTo) resetEditable(resetEditableTo);
		}
		if (sel.visible) {
			view.dom.classList.remove("ProseMirror-hideselection");
		} else {
			view.dom.classList.add("ProseMirror-hideselection");
			if ("onselectionchange" in document) removeClassOnSelectionChange(view);
		}
	}
	view.domObserver.setCurSelection();
	view.domObserver.connectSelection();
}
// Kludge to work around Webkit not allowing a selection to start/end
// between non-editable block nodes. We briefly make something
// editable, set the selection, then set it uneditable again.
const brokenSelectBetweenUneditable = safari || (chrome && chrome_version < 63);
function temporarilyEditableNear(view, pos) {
	let { node, offset } = view.docView.domFromPos(pos, 0);
	let after = offset < node.childNodes.length ? node.childNodes[offset] : null;
	let before = offset ? node.childNodes[offset - 1] : null;
	if (safari && after && after.contentEditable == "false") return setEditable(after);
	if ((!after || after.contentEditable == "false") && (!before || before.contentEditable == "false")) {
		if (after) return setEditable(after);
		else if (before) return setEditable(before);
	}
}
function setEditable(element) {
	element.contentEditable = "true";
	if (safari && element.draggable) {
		element.draggable = false;
		element.wasDraggable = true;
	}
	return element;
}
function resetEditable(element) {
	element.contentEditable = "false";
	if (element.wasDraggable) {
		element.draggable = true;
		element.wasDraggable = null;
	}
}
function removeClassOnSelectionChange(view) {
	let doc = view.dom.ownerDocument;
	doc.removeEventListener("selectionchange", view.input.hideSelectionGuard);
	let domSel = view.domSelectionRange();
	let node = domSel.anchorNode,
		offset = domSel.anchorOffset;
	doc.addEventListener(
		"selectionchange",
		(view.input.hideSelectionGuard = () => {
			if (domSel.anchorNode != node || domSel.anchorOffset != offset) {
				doc.removeEventListener("selectionchange", view.input.hideSelectionGuard);
				setTimeout(() => {
					if (!editorOwnsSelection(view) || view.state.selection.visible) view.dom.classList.remove("ProseMirror-hideselection");
				}, 20);
			}
		}),
	);
}
function selectCursorWrapper(view) {
	let domSel = view.domSelection();
	if (!domSel) return;
	let node = view.cursorWrapper.dom,
		img = node.nodeName == "IMG";
	if (img) domSel.collapse(node.parentNode, domIndex(node) + 1);
	else 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
	// positioned wrapper, rather than the root editable node, the
	// focused element.
	if (!img && !view.state.selection.visible && ie$1 && ie_version <= 11) {
		node.disabled = true;
		node.disabled = false;
	}
}
function syncNodeSelection(view, sel) {
	if (sel instanceof NodeSelection) {
		let desc = view.docView.descAt(sel.from);
		if (desc != view.lastSelectedViewDesc) {
			clearNodeSelection(view);
			if (desc) desc.selectNode();
			view.lastSelectedViewDesc = desc;
		}
	} else {
		clearNodeSelection(view);
	}
}
// Clear all DOM statefulness of the last node selection.
function clearNodeSelection(view) {
	if (view.lastSelectedViewDesc) {
		if (view.lastSelectedViewDesc.parent) view.lastSelectedViewDesc.deselectNode();
		view.lastSelectedViewDesc = undefined;
	}
}
function selectionBetween(view, $anchor, $head, bias) {
	return view.someProp("createSelectionBetween", (f) => f(view, $anchor, $head)) || TextSelection.between($anchor, $head, bias);
}
function hasFocusAndSelection(view) {
	if (view.editable && !view.hasFocus()) return false;
	return hasSelection(view);
}
function hasSelection(view) {
	let sel = view.domSelectionRange();
	if (!sel.anchorNode) return false;
	try {
		// Firefox will raise 'permission denied' errors when accessing
		// properties of `sel.anchorNode` when it's in a generated CSS
		// element.
		return (
			view.dom.contains(sel.anchorNode.nodeType == 3 ? sel.anchorNode.parentNode : sel.anchorNode) &&
			(view.editable || view.dom.contains(sel.focusNode.nodeType == 3 ? sel.focusNode.parentNode : sel.focusNode))
		);
	} catch (_) {
		return false;
	}
}
function anchorInRightPlace(view) {
	let anchorDOM = view.docView.domFromPos(view.state.selection.anchor, 0);
	let domSel = view.domSelectionRange();
	return isEquivalentPosition(anchorDOM.node, anchorDOM.offset, domSel.anchorNode, domSel.anchorOffset);
}

function moveSelectionBlock(state, dir) {
	let { $anchor, $head } = state.selection;
	let $side = dir > 0 ? $anchor.max($head) : $anchor.min($head);
	let $start =
		!$side.parent.inlineContent ? $side
		: $side.depth ? state.doc.resolve(dir > 0 ? $side.after() : $side.before())
		: null;
	return $start && Selection.findFrom($start, dir);
}
function apply(view, sel) {
	view.dispatch(view.state.tr.setSelection(sel).scrollIntoView());
	return true;
}
function selectHorizontally(view, dir, mods) {
	let sel = view.state.selection;
	if (sel instanceof TextSelection) {
		if (mods.indexOf("s") > -1) {
			let { $head } = sel,
				node =
					$head.textOffset ? null
					: dir < 0 ? $head.nodeBefore
					: $head.nodeAfter;
			if (!node || node.isText || !node.isLeaf) return false;
			let $newHead = view.state.doc.resolve($head.pos + node.nodeSize * (dir < 0 ? -1 : 1));
			return apply(view, new TextSelection(sel.$anchor, $newHead));
		} else if (!sel.empty) {
			return false;
		} else if (view.endOfTextblock(dir > 0 ? "forward" : "backward")) {
			let next = moveSelectionBlock(view.state, dir);
			if (next && next instanceof NodeSelection) return apply(view, next);
			return false;
		} else if (!(mac$2 && mods.indexOf("m") > -1)) {
			let $head = sel.$head,
				node =
					$head.textOffset ? null
					: dir < 0 ? $head.nodeBefore
					: $head.nodeAfter,
				desc;
			if (!node || node.isText) return false;
			let nodePos = dir < 0 ? $head.pos - node.nodeSize : $head.pos;
			if (!(node.isAtom || ((desc = view.docView.descAt(nodePos)) && !desc.contentDOM))) return false;
			if (NodeSelection.isSelectable(node)) {
				return apply(view, new NodeSelection(dir < 0 ? view.state.doc.resolve($head.pos - node.nodeSize) : $head));
			} else if (webkit) {
				// Chrome and Safari will introduce extra pointless cursor
				// positions around inline uneditable nodes, so we have to
				// take over and move the cursor past them (#937)
				return apply(view, new TextSelection(view.state.doc.resolve(dir < 0 ? nodePos : nodePos + node.nodeSize)));
			} else {
				return false;
			}
		}
	} else if (sel instanceof NodeSelection && sel.node.isInline) {
		return apply(view, new TextSelection(dir > 0 ? sel.$to : sel.$from));
	} else {
		let next = moveSelectionBlock(view.state, dir);
		if (next) return apply(view, next);
		return false;
	}
}
function nodeLen(node) {
	return node.nodeType == 3 ? node.nodeValue.length : node.childNodes.length;
}
function isIgnorable(dom, dir) {
	let desc = dom.pmViewDesc;
	return desc && desc.size == 0 && (dir < 0 || dom.nextSibling || dom.nodeName != "BR");
}
function skipIgnoredNodes(view, dir) {
	return dir < 0 ? skipIgnoredNodesBefore(view) : skipIgnoredNodesAfter(view);
}
// Make sure the cursor isn't directly after one or more ignored
// nodes, which will confuse the browser's cursor motion logic.
function skipIgnoredNodesBefore(view) {
	let sel = view.domSelectionRange();
	let node = sel.focusNode,
		offset = sel.focusOffset;
	if (!node) return;
	let moveNode,
		moveOffset,
		force = false;
	// Gecko will do odd things when the selection is directly in front
	// of a non-editable node, so in that case, move it into the next
	// node if possible. Issue prosemirror/prosemirror#832.
	if (gecko && node.nodeType == 1 && offset < nodeLen(node) && isIgnorable(node.childNodes[offset], -1)) force = true;
	for (;;) {
		if (offset > 0) {
			if (node.nodeType != 1) {
				break;
			} else {
				let before = node.childNodes[offset - 1];
				if (isIgnorable(before, -1)) {
					moveNode = node;
					moveOffset = --offset;
				} else if (before.nodeType == 3) {
					node = before;
					offset = node.nodeValue.length;
				} else break;
			}
		} else if (isBlockNode(node)) {
			break;
		} else {
			let prev = node.previousSibling;
			while (prev && isIgnorable(prev, -1)) {
				moveNode = node.parentNode;
				moveOffset = domIndex(prev);
				prev = prev.previousSibling;
			}
			if (!prev) {
				node = node.parentNode;
				if (node == view.dom) break;
				offset = 0;
			} else {
				node = prev;
				offset = nodeLen(node);
			}
		}
	}
	if (force) setSelFocus(view, node, offset);
	else if (moveNode) setSelFocus(view, moveNode, moveOffset);
}
// Make sure the cursor isn't directly before one or more ignored
// nodes.
function skipIgnoredNodesAfter(view) {
	let sel = view.domSelectionRange();
	let node = sel.focusNode,
		offset = sel.focusOffset;
	if (!node) return;
	let len = nodeLen(node);
	let moveNode, moveOffset;
	for (;;) {
		if (offset < len) {
			if (node.nodeType != 1) break;
			let after = node.childNodes[offset];
			if (isIgnorable(after, 1)) {
				moveNode = node;
				moveOffset = ++offset;
			} else break;
		} else if (isBlockNode(node)) {
			break;
		} else {
			let next = node.nextSibling;
			while (next && isIgnorable(next, 1)) {
				moveNode = next.parentNode;
				moveOffset = domIndex(next) + 1;
				next = next.nextSibling;
			}
			if (!next) {
				node = node.parentNode;
				if (node == view.dom) break;
				offset = len = 0;
			} else {
				node = next;
				offset = 0;
				len = nodeLen(node);
			}
		}
	}
	if (moveNode) setSelFocus(view, moveNode, moveOffset);
}
function isBlockNode(dom) {
	let desc = dom.pmViewDesc;
	return desc && desc.node && desc.node.isBlock;
}
function textNodeAfter(node, offset) {
	while (node && offset == node.childNodes.length && !hasBlockDesc(node)) {
		offset = domIndex(node) + 1;
		node = node.parentNode;
	}
	while (node && offset < node.childNodes.length) {
		let next = node.childNodes[offset];
		if (next.nodeType == 3) return next;
		if (next.nodeType == 1 && next.contentEditable == "false") break;
		node = next;
		offset = 0;
	}
}
function textNodeBefore(node, offset) {
	while (node && !offset && !hasBlockDesc(node)) {
		offset = domIndex(node);
		node = node.parentNode;
	}
	while (node && offset) {
		let next = node.childNodes[offset - 1];
		if (next.nodeType == 3) return next;
		if (next.nodeType == 1 && next.contentEditable == "false") break;
		node = next;
		offset = node.childNodes.length;
	}
}
function setSelFocus(view, node, offset) {
	if (node.nodeType != 3) {
		let before, after;
		if ((after = textNodeAfter(node, offset))) {
			node = after;
			offset = 0;
		} else if ((before = textNodeBefore(node, offset))) {
			node = before;
			offset = before.nodeValue.length;
		}
	}
	let sel = view.domSelection();
	if (!sel) return;
	if (selectionCollapsed(sel)) {
		let range = document.createRange();
		range.setEnd(node, offset);
		range.setStart(node, offset);
		sel.removeAllRanges();
		sel.addRange(range);
	} else if (sel.extend) {
		sel.extend(node, offset);
	}
	view.domObserver.setCurSelection();
	let { state } = view;
	// If no state update ends up happening, reset the selection.
	setTimeout(() => {
		if (view.state == state) selectionToDOM(view);
	}, 50);
}
function findDirection(view, pos) {
	let $pos = view.state.doc.resolve(pos);
	if (!(chrome || windows$1) && $pos.parent.inlineContent) {
		let coords = view.coordsAtPos(pos);
		if (pos > $pos.start()) {
			let before = view.coordsAtPos(pos - 1);
			let mid = (before.top + before.bottom) / 2;
			if (mid > coords.top && mid < coords.bottom && Math.abs(before.left - coords.left) > 1) return before.left < coords.left ? "ltr" : "rtl";
		}
		if (pos < $pos.end()) {
			let after = view.coordsAtPos(pos + 1);
			let mid = (after.top + after.bottom) / 2;
			if (mid > coords.top && mid < coords.bottom && Math.abs(after.left - coords.left) > 1) return after.left > coords.left ? "ltr" : "rtl";
		}
	}
	let computed = getComputedStyle(view.dom).direction;
	return computed == "rtl" ? "rtl" : "ltr";
}
// Check whether vertical selection motion would involve node
// selections. If so, apply it (if not, the result is left to the
// browser)
function selectVertically(view, dir, mods) {
	let sel = view.state.selection;
	if ((sel instanceof TextSelection && !sel.empty) || mods.indexOf("s") > -1) return false;
	if (mac$2 && mods.indexOf("m") > -1) return false;
	let { $from, $to } = sel;
	if (!$from.parent.inlineContent || view.endOfTextblock(dir < 0 ? "up" : "down")) {
		let next = moveSelectionBlock(view.state, dir);
		if (next && next instanceof NodeSelection) return apply(view, next);
	}
	if (!$from.parent.inlineContent) {
		let side = dir < 0 ? $from : $to;
		let beyond = sel instanceof AllSelection ? Selection.near(side, dir) : Selection.findFrom(side, dir);
		return beyond ? apply(view, beyond) : false;
	}
	return false;
}
function stopNativeHorizontalDelete(view, dir) {
	if (!(view.state.selection instanceof TextSelection)) return true;
	let { $head, $anchor, empty } = view.state.selection;
	if (!$head.sameParent($anchor)) return true;
	if (!empty) return false;
	if (view.endOfTextblock(dir > 0 ? "forward" : "backward")) return true;
	let nextNode = !$head.textOffset && (dir < 0 ? $head.nodeBefore : $head.nodeAfter);
	if (nextNode && !nextNode.isText) {
		let tr = view.state.tr;
		if (dir < 0) tr.delete($head.pos - nextNode.nodeSize, $head.pos);
		else tr.delete($head.pos, $head.pos + nextNode.nodeSize);
		view.dispatch(tr);
		return true;
	}
	return false;
}
function switchEditable(view, node, state) {
	view.domObserver.stop();
	node.contentEditable = state;
	view.domObserver.start();
}
// Issue #867 / #1090 / https://bugs.chromium.org/p/chromium/issues/detail?id=903821
// In which Safari (and at some point in the past, Chrome) does really
// wrong things when the down arrow is pressed when the cursor is
// directly at the start of a textblock and has an uneditable node
// after it
function safariDownArrowBug(view) {
	if (!safari || view.state.selection.$head.parentOffset > 0) return false;
	let { focusNode, focusOffset } = view.domSelectionRange();
	if (focusNode && focusNode.nodeType == 1 && focusOffset == 0 && focusNode.firstChild && focusNode.firstChild.contentEditable == "false") {
		let child = focusNode.firstChild;
		switchEditable(view, child, "true");
		setTimeout(() => switchEditable(view, child, "false"), 20);
	}
	return false;
}
// A backdrop key mapping used to make sure we always suppress keys
// that have a dangerous default effect, even if the commands they are
// bound to return false, and to make sure that cursor-motion keys
// find a cursor (as opposed to a node selection) when pressed. For
// cursor-motion keys, the code in the handlers also takes care of
// block selections.
function getMods(event) {
	let result = "";
	if (event.ctrlKey) result += "c";
	if (event.metaKey) result += "m";
	if (event.altKey) result += "a";
	if (event.shiftKey) result += "s";
	return result;
}
function captureKeyDown(view, event) {
	let code = event.keyCode,
		mods = getMods(event);
	if (code == 8 || (mac$2 && code == 72 && mods == "c")) {
		// Backspace, Ctrl-h on Mac
		return stopNativeHorizontalDelete(view, -1) || skipIgnoredNodes(view, -1);
	} else if ((code == 46 && !event.shiftKey) || (mac$2 && code == 68 && mods == "c")) {
		// Delete, Ctrl-d on Mac
		return stopNativeHorizontalDelete(view, 1) || skipIgnoredNodes(view, 1);
	} else if (code == 13 || code == 27) {
		// Enter, Esc
		return true;
	} else if (code == 37 || (mac$2 && code == 66 && mods == "c")) {
		// Left arrow, Ctrl-b on Mac
		let dir =
			code == 37 ?
				findDirection(view, view.state.selection.from) == "ltr" ?
					-1
				:	1
			:	-1;
		return selectHorizontally(view, dir, mods) || skipIgnoredNodes(view, dir);
	} else if (code == 39 || (mac$2 && code == 70 && mods == "c")) {
		// Right arrow, Ctrl-f on Mac
		let dir =
			code == 39 ?
				findDirection(view, view.state.selection.from) == "ltr" ?
					1
				:	-1
			:	1;
		return selectHorizontally(view, dir, mods) || skipIgnoredNodes(view, dir);
	} else if (code == 38 || (mac$2 && code == 80 && mods == "c")) {
		// Up arrow, Ctrl-p on Mac
		return selectVertically(view, -1, mods) || skipIgnoredNodes(view, -1);
	} else if (code == 40 || (mac$2 && code == 78 && mods == "c")) {
		// Down arrow, Ctrl-n on Mac
		return safariDownArrowBug(view) || selectVertically(view, 1, mods) || skipIgnoredNodes(view, 1);
	} else if (mods == (mac$2 ? "m" : "c") && (code == 66 || code == 73 || code == 89 || code == 90)) {
		// Mod-[biyz]
		return true;
	}
	return false;
}

function serializeForClipboard(view, slice) {
	view.someProp("transformCopied", (f) => {
		slice = f(slice, view);
	});
	let context = [],
		{ content, openStart, openEnd } = slice;
	while (openStart > 1 && openEnd > 1 && content.childCount == 1 && content.firstChild.childCount == 1) {
		openStart--;
		openEnd--;
		let node = content.firstChild;
		context.push(node.type.name, node.attrs != node.type.defaultAttrs ? node.attrs : null);
		content = node.content;
	}
	let serializer = view.someProp("clipboardSerializer") || DOMSerializer.fromSchema(view.state.schema);
	let doc = detachedDoc(),
		wrap = doc.createElement("div");
	wrap.appendChild(serializer.serializeFragment(content, { document: doc }));
	let firstChild = wrap.firstChild,
		needsWrap,
		wrappers = 0;
	while (firstChild && firstChild.nodeType == 1 && (needsWrap = wrapMap[firstChild.nodeName.toLowerCase()])) {
		for (let i = needsWrap.length - 1; i >= 0; i--) {
			let wrapper = doc.createElement(needsWrap[i]);
			while (wrap.firstChild) wrapper.appendChild(wrap.firstChild);
			wrap.appendChild(wrapper);
			wrappers++;
		}
		firstChild = wrap.firstChild;
	}
	if (firstChild && firstChild.nodeType == 1) firstChild.setAttribute("data-pm-slice", `${openStart} ${openEnd}${wrappers ? ` -${wrappers}` : ""} ${JSON.stringify(context)}`);
	let text = view.someProp("clipboardTextSerializer", (f) => f(slice, view)) || slice.content.textBetween(0, slice.content.size, "\n\n");
	return { dom: wrap, text, slice };
}
// Read a slice of content from the clipboard (or drop data).
function parseFromClipboard(view, text, html, plainText, $context) {
	let inCode = $context.parent.type.spec.code;
	let dom, slice;
	if (!html && !text) return null;
	let asText = !!text && (plainText || inCode || !html);
	if (asText) {
		view.someProp("transformPastedText", (f) => {
			text = f(text, inCode || plainText, view);
		});
		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;
		} else {
			let marks = $context.marks();
			let { schema } = view.state,
				serializer = DOMSerializer.fromSchema(schema);
			dom = document.createElement("div");
			text.split(/(?:\r\n?|\n)+/).forEach((block) => {
				let p = dom.appendChild(document.createElement("p"));
				if (block) p.appendChild(serializer.serializeNode(schema.text(block, marks)));
			});
		}
	} else {
		view.someProp("transformPastedHTML", (f) => {
			html = f(html, view);
		});
		dom = readHTML(html);
		if (webkit) restoreReplacedSpaces(dom);
	}
	let contextNode = dom && dom.querySelector("[data-pm-slice]");
	let sliceData = contextNode && /^(\d+) (\d+)(?: -(\d+))? (.*)/.exec(contextNode.getAttribute("data-pm-slice") || "");
	if (sliceData && sliceData[3])
		for (let i = +sliceData[3]; i > 0; i--) {
			let child = dom.firstChild;
			while (child && child.nodeType != 1) child = child.nextSibling;
			if (!child) break;
			dom = child;
		}
	if (!slice) {
		let parser = view.someProp("clipboardParser") || view.someProp("domParser") || DOMParser.fromSchema(view.state.schema);
		slice = parser.parseSlice(dom, {
			preserveWhitespace: !!(asText || sliceData),
			context: $context,
			ruleFromNode(dom) {
				if (dom.nodeName == "BR" && !dom.nextSibling && dom.parentNode && !inlineParents.test(dom.parentNode.nodeName)) return { ignore: true };
				return null;
			},
		});
	}
	if (sliceData) {
		slice = addContext(closeSlice(slice, +sliceData[1], +sliceData[2]), sliceData[4]);
	} else {
		// HTML wasn't created by ProseMirror. Make sure top-level siblings are coherent
		slice = Slice.maxOpen(normalizeSiblings(slice.content, $context), true);
		if (slice.openStart || slice.openEnd) {
			let openStart = 0,
				openEnd = 0;
			for (let node = slice.content.firstChild; openStart < slice.openStart && !node.type.spec.isolating; openStart++, node = node.firstChild) {}
			for (let node = slice.content.lastChild; openEnd < slice.openEnd && !node.type.spec.isolating; openEnd++, node = node.lastChild) {}
			slice = closeSlice(slice, openStart, openEnd);
		}
	}
	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;
// Takes a slice parsed with parseSlice, which means there hasn't been
// any content-expression checking done on the top nodes, tries to
// find a parent node in the current context that might fit the nodes,
// and if successful, rebuilds the slice so that it fits into that parent.
//
// This addresses the problem that Transform.replace expects a
// coherent slice, and will fail to place a set of siblings that don't
// fit anywhere in the schema.
function normalizeSiblings(fragment, $context) {
	if (fragment.childCount < 2) return fragment;
	for (let d = $context.depth; d >= 0; d--) {
		let parent = $context.node(d);
		let match = parent.contentMatchAt($context.index(d));
		let lastWrap,
			result = [];
		fragment.forEach((node) => {
			if (!result) return;
			let wrap = match.findWrapping(node.type),
				inLast;
			if (!wrap) return (result = null);
			if ((inLast = result.length && lastWrap.length && addToSibling(wrap, lastWrap, node, result[result.length - 1], 0))) {
				result[result.length - 1] = inLast;
			} else {
				if (result.length) result[result.length - 1] = closeRight(result[result.length - 1], lastWrap.length);
				let wrapped = withWrappers(node, wrap);
				result.push(wrapped);
				match = match.matchType(wrapped.type);
				lastWrap = wrap;
			}
		});
		if (result) return Fragment.from(result);
	}
	return fragment;
}
function withWrappers(node, wrap, from = 0) {
	for (let i = wrap.length - 1; i >= from; i--) node = wrap[i].create(null, Fragment.from(node));
	return node;
}
// Used to group adjacent nodes wrapped in similar parents by
// normalizeSiblings into the same parent node
function addToSibling(wrap, lastWrap, node, sibling, depth) {
	if (depth < wrap.length && depth < lastWrap.length && wrap[depth] == lastWrap[depth]) {
		let inner = addToSibling(wrap, lastWrap, node, sibling.lastChild, depth + 1);
		if (inner) return sibling.copy(sibling.content.replaceChild(sibling.childCount - 1, inner));
		let match = sibling.contentMatchAt(sibling.childCount);
		if (match.matchType(depth == wrap.length - 1 ? node.type : wrap[depth + 1])) return sibling.copy(sibling.content.append(Fragment.from(withWrappers(node, wrap, depth + 1))));
	}
}
function closeRight(node, depth) {
	if (depth == 0) return node;
	let fragment = node.content.replaceChild(node.childCount - 1, closeRight(node.lastChild, depth - 1));
	let fill = node.contentMatchAt(node.childCount).fillBefore(Fragment.empty, true);
	return node.copy(fragment.append(fill));
}
function closeRange(fragment, side, from, to, depth, openEnd) {
	let node = side < 0 ? fragment.firstChild : fragment.lastChild,
		inner = node.content;
	if (fragment.childCount > 1) openEnd = 0;
	if (depth < to - 1) inner = closeRange(inner, side, from, to, depth + 1, openEnd);
	if (depth >= from)
		inner =
			side < 0 ?
				node
					.contentMatchAt(0)
					.fillBefore(inner, openEnd <= depth)
					.append(inner)
			:	inner.append(node.contentMatchAt(node.childCount).fillBefore(Fragment.empty, true));
	return fragment.replaceChild(side < 0 ? 0 : fragment.childCount - 1, node.copy(inner));
}
function closeSlice(slice, openStart, openEnd) {
	if (openStart < slice.openStart) slice = new Slice(closeRange(slice.content, -1, openStart, slice.openStart, 0, slice.openEnd), openStart, slice.openEnd);
	if (openEnd < slice.openEnd) slice = new Slice(closeRange(slice.content, 1, openEnd, slice.openEnd, 0, 0), slice.openStart, openEnd);
	return slice;
}
// Trick from jQuery -- some elements must be wrapped in other
// elements for innerHTML to work. I.e. if you do `div.innerHTML =
// "<td>..</td>"` the table cells are ignored.
const wrapMap = {
	thead: ["table"],
	tbody: ["table"],
	tfoot: ["table"],
	caption: ["table"],
	colgroup: ["table"],
	col: ["table", "colgroup"],
	tr: ["table", "tbody"],
	td: ["table", "tbody", "tr"],
	th: ["table", "tbody", "tr"],
};
function detachedDoc() {
	return document.implementation.createHTMLDocument("title");
}
let _policy = null;
function maybeWrapTrusted(html) {
	let trustedTypes = window.trustedTypes;
	if (!trustedTypes) return html;
	// With the require-trusted-types-for CSP, Chrome will block
	// 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.defaultPolicy || trustedTypes.createPolicy("ProseMirrorClipboard", { createHTML: (s) => s });
	return _policy.createHTML(html);
}
function readHTML(html) {
	let metas = /^(\s*<meta [^>]*>)*/.exec(html);
	if (metas) html = html.slice(metas[0].length);
	let doc = detachedDoc(),
		elt = doc.body;
	let firstTag = /<([a-z][^>\s]+)/i.exec(html),
		wrap;
	if ((wrap = firstTag && wrapMap[firstTag[1].toLowerCase()]))
		html =
			wrap.map((n) => "<" + n + ">").join("") +
			html +
			wrap
				.map((n) => "</" + n + ">")
				.reverse()
				.join("");
	elt.innerHTML = maybeWrapTrusted(html);
	if (wrap) for (let i = 0; i < wrap.length; i++) elt = elt.querySelector(wrap[i]) || elt;
	// Inline styles defined in the pasted content, so that parse rules pick them up
	for (let i = 0; i < doc.styleSheets.length; i++) {
		let style = doc.styleSheets[i];
		for (let j = 0; j < style.rules.length; j++) {
			let rule = style.rules[j];
			if (rule instanceof CSSStyleRule) {
				let matches = elt.querySelectorAll(rule.selectorText);
				for (let k = 0; k < matches.length; k++) matches[k].style.cssText += rule.style.cssText;
			}
		}
	}
	return elt;
}
// Webkit browsers do some hard-to-predict replacement of regular
// spaces with non-breaking spaces when putting content on the
// clipboard. This tries to convert such non-breaking spaces (which
// will be wrapped in a plain span on Chrome, a span with class
// Apple-converted-space on Safari) back to regular spaces.
function restoreReplacedSpaces(dom) {
	let nodes = dom.querySelectorAll(chrome ? "span:not([class]):not([style])" : "span.Apple-converted-space");
	for (let i = 0; i < nodes.length; i++) {
		let node = nodes[i];
		if (node.childNodes.length == 1 && node.textContent == "\u00a0" && node.parentNode) node.parentNode.replaceChild(dom.ownerDocument.createTextNode(" "), node);
	}
}
function addContext(slice, context) {
	if (!slice.size) return slice;
	let schema = slice.content.firstChild.type.schema,
		array;
	try {
		array = JSON.parse(context);
	} catch (e) {
		return slice;
	}
	let { content, openStart, openEnd } = slice;
	for (let i = array.length - 2; i >= 0; i -= 2) {
		let type = schema.nodes[array[i]];
		if (!type || type.hasRequiredAttrs()) break;
		content = Fragment.from(type.create(array[i + 1], content));
		openStart++;
		openEnd++;
	}
	return new Slice(content, openStart, openEnd);
}

// A collection of DOM events that occur within the editor, and callback functions
// to invoke when the event fires.
const handlers = {};
const editHandlers = {};
const passiveHandlers = { touchstart: true, touchmove: true };
class InputState {
	constructor() {
		this.shiftKey = false;
		this.mouseDown = null;
		this.lastKeyCode = null;
		this.lastKeyCodeTime = 0;
		this.lastClick = { time: 0, x: 0, y: 0, type: "", button: 0 };
		this.lastSelectionOrigin = null;
		this.lastSelectionTime = 0;
		this.lastIOSEnter = 0;
		this.lastIOSEnterFallbackTimeout = -1;
		this.lastFocus = 0;
		this.lastTouch = 0;
		this.lastChromeDelete = 0;
		this.composing = false;
		this.compositionNode = null;
		this.composingTimeout = -1;
		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;
		this.eventHandlers = Object.create(null);
		this.hideSelectionGuard = null;
	}
}
function initInput(view) {
	for (let event in handlers) {
		let handler = handlers[event];
		view.dom.addEventListener(
			event,
			(view.input.eventHandlers[event] = (event) => {
				if (eventBelongsToView(view, event) && !runCustomHandler(view, event) && (view.editable || !(event.type in editHandlers))) handler(view, event);
			}),
			passiveHandlers[event] ? { passive: true } : undefined,
		);
	}
	// On Safari, for reasons beyond my understanding, adding an input
	// event handler makes an issue where the composition vanishes when
	// you press enter go away.
	if (safari) view.dom.addEventListener("input", () => null);
	ensureListeners(view);
}
function setSelectionOrigin(view, origin) {
	view.input.lastSelectionOrigin = origin;
	view.input.lastSelectionTime = Date.now();
}
function destroyInput(view) {
	if (view.input.mouseDown) view.input.mouseDown.done();
	view.domObserver.stop();
	for (let type in view.input.eventHandlers) view.dom.removeEventListener(type, view.input.eventHandlers[type]);
	clearTimeout(view.input.composingTimeout);
	clearTimeout(view.input.lastIOSEnterFallbackTimeout);
}
function ensureListeners(view) {
	view.someProp("handleDOMEvents", (currentHandlers) => {
		for (let type in currentHandlers) if (!view.input.eventHandlers[type]) view.dom.addEventListener(type, (view.input.eventHandlers[type] = (event) => runCustomHandler(view, event)));
	});
}
function runCustomHandler(view, event) {
	return view.someProp("handleDOMEvents", (handlers) => {
		let handler = handlers[event.type];
		return handler ? handler(view, event) || event.defaultPrevented : false;
	});
}
function eventBelongsToView(view, event) {
	if (!event.bubbles) return true;
	if (event.defaultPrevented) return false;
	for (let node = event.target; node != view.dom; node = node.parentNode) if (!node || node.nodeType == 11 || (node.pmViewDesc && node.pmViewDesc.stopEvent(event))) return false;
	return true;
}
function dispatchEvent(view, event) {
	if (!runCustomHandler(view, event) && handlers[event.type] && (view.editable || !(event.type in editHandlers))) handlers[event.type](view, event);
}
editHandlers.keydown = (view, _event) => {
	let event = _event;
	view.input.shiftKey = event.keyCode == 16 || event.shiftKey;
	if (inOrNearComposition(view)) return;
	view.input.lastKeyCode = event.keyCode;
	view.input.lastKeyCodeTime = Date.now();
	// Suppress enter key events on Chrome Android, because those tend
	// to be part of a confused sequence of composition events fired,
	// and handling them eagerly tends to corrupt the input.
	if (android && chrome && event.keyCode == 13) return;
	if (event.keyCode != 229) view.domObserver.forceFlush();
	// On iOS, if we preventDefault enter key presses, the virtual
	// keyboard gets confused. So the hack here is to set a flag that
	// makes the DOM change code recognize that what just happens should
	// be replaced by whatever the Enter key handlers do.
	if (ios && event.keyCode == 13 && !event.ctrlKey && !event.altKey && !event.metaKey) {
		let now = Date.now();
		view.input.lastIOSEnter = now;
		view.input.lastIOSEnterFallbackTimeout = setTimeout(() => {
			if (view.input.lastIOSEnter == now) {
				view.someProp("handleKeyDown", (f) => f(view, keyEvent(13, "Enter")));
				view.input.lastIOSEnter = 0;
			}
		}, 200);
	} else if (view.someProp("handleKeyDown", (f) => f(view, event)) || captureKeyDown(view, event)) {
		event.preventDefault();
	} else {
		setSelectionOrigin(view, "key");
	}
};
editHandlers.keyup = (view, event) => {
	if (event.keyCode == 16) view.input.shiftKey = false;
};
editHandlers.keypress = (view, _event) => {
	let event = _event;
	if (inOrNearComposition(view) || !event.charCode || (event.ctrlKey && !event.altKey) || (mac$2 && event.metaKey)) return;
	if (view.someProp("handleKeyPress", (f) => f(view, event))) {
		event.preventDefault();
		return;
	}
	let sel = view.state.selection;
	if (!(sel instanceof TextSelection) || !sel.$from.sameParent(sel.$to)) {
		let text = String.fromCharCode(event.charCode);
		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();
	}
};
function eventCoords(event) {
	return { left: event.clientX, top: event.clientY };
}
function isNear(event, click) {
	let dx = click.x - event.clientX,
		dy = click.y - event.clientY;
	return dx * dx + dy * dy < 100;
}
function runHandlerOnContext(view, propName, pos, inside, event) {
	if (inside == -1) return false;
	let $pos = view.state.doc.resolve(inside);
	for (let i = $pos.depth + 1; i > 0; i--) {
		if (view.someProp(propName, (f) => (i > $pos.depth ? f(view, pos, $pos.nodeAfter, $pos.before(i), event, true) : f(view, pos, $pos.node(i), $pos.before(i), event, false)))) return true;
	}
	return false;
}
function updateSelection(view, selection, origin) {
	if (!view.focused) view.focus();
	if (view.state.selection.eq(selection)) return;
	let tr = view.state.tr.setSelection(selection);
	tr.setMeta("pointer", true);
	view.dispatch(tr);
}
function selectClickedLeaf(view, inside) {
	if (inside == -1) return false;
	let $pos = view.state.doc.resolve(inside),
		node = $pos.nodeAfter;
	if (node && node.isAtom && NodeSelection.isSelectable(node)) {
		updateSelection(view, new NodeSelection($pos));
		return true;
	}
	return false;
}
function selectClickedNode(view, inside) {
	if (inside == -1) return false;
	let sel = view.state.selection,
		selectedNode,
		selectAt;
	if (sel instanceof NodeSelection) selectedNode = sel.node;
	let $pos = view.state.doc.resolve(inside);
	for (let i = $pos.depth + 1; i > 0; i--) {
		let node = i > $pos.depth ? $pos.nodeAfter : $pos.node(i);
		if (NodeSelection.isSelectable(node)) {
			if (selectedNode && sel.$from.depth > 0 && i >= sel.$from.depth && $pos.before(sel.$from.depth + 1) == sel.$from.pos) selectAt = $pos.before(sel.$from.depth);
			else selectAt = $pos.before(i);
			break;
		}
	}
	if (selectAt != null) {
		updateSelection(view, NodeSelection.create(view.state.doc, selectAt));
		return true;
	} else {
		return false;
	}
}
function handleSingleClick(view, pos, inside, event, selectNode) {
	return (
		runHandlerOnContext(view, "handleClickOn", pos, inside, event) ||
		view.someProp("handleClick", (f) => f(view, pos, event)) ||
		(selectNode ? selectClickedNode(view, inside) : selectClickedLeaf(view, inside))
	);
}
function handleDoubleClick(view, pos, inside, event) {
	return runHandlerOnContext(view, "handleDoubleClickOn", pos, inside, event) || view.someProp("handleDoubleClick", (f) => f(view, pos, event));
}
function handleTripleClick(view, pos, inside, event) {
	return runHandlerOnContext(view, "handleTripleClickOn", pos, inside, event) || view.someProp("handleTripleClick", (f) => f(view, pos, event)) || defaultTripleClick(view, inside, event);
}
function defaultTripleClick(view, inside, event) {
	if (event.button != 0) return false;
	let selection = selectionForTripleClick(view, inside, true),
		doc = view.state.doc;
	if (!selection) return false;
	updateSelection(view, selection);
	if (selection instanceof TextSelection && doc.eq(view.state.doc)) view.input.mouseDown = new TripleClickDrag(view, selection);
	return true;
}
function selectionForTripleClick(view, inside, selectNodes) {
	let doc = view.state.doc;
	if (inside == -1) return doc.inlineContent ? TextSelection.create(doc, 0, doc.content.size) : null;
	let $pos = doc.resolve(inside);
	for (let i = $pos.depth + 1; i > 0; i--) {
		let node = i > $pos.depth ? $pos.nodeAfter : $pos.node(i);
		let nodePos = $pos.before(i);
		if (node.inlineContent) return TextSelection.create(doc, nodePos + 1, nodePos + 1 + node.content.size);
		else if (selectNodes && NodeSelection.isSelectable(node)) return NodeSelection.create(doc, nodePos);
	}
	return null;
}
function forceDOMFlush(view) {
	return endComposition(view);
}
const selectNodeModifier = mac$2 ? "metaKey" : "ctrlKey";
handlers.mousedown = (view, _event) => {
	let event = _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] && 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, button: event.button };
	if (view.input.mouseDown) view.input.mouseDown.done();
	let pos = view.posAtCoords(eventCoords(event));
	if (!pos) return;
	if (type == "singleClick") {
		view.input.mouseDown = new LeftMouseDown(view, pos, event, !!flushed);
	} else if ((type == "doubleClick" ? handleDoubleClick : handleTripleClick)(view, pos.pos, pos.inside, event)) {
		event.preventDefault();
	} else {
		setSelectionOrigin(view, "pointer");
	}
};
class MouseDown {
	constructor(view) {
		this.view = view;
		this.mightDrag = null;
		view.root.addEventListener("mouseup", (this.up = this.up.bind(this)));
		view.root.addEventListener("mousemove", (this.move = this.move.bind(this)));
	}
	up(event) {
		this.done();
	}
	move(event) {
		if (event.buttons == 0) this.done();
	}
	done() {
		this.view.root.removeEventListener("mouseup", this.up);
		this.view.root.removeEventListener("mousemove", this.move);
		if (this.view.input.mouseDown == this) this.view.input.mouseDown = null;
	}
	delaySelUpdate() {
		return false;
	}
}
class LeftMouseDown extends MouseDown {
	constructor(view, pos, event, flushed) {
		super(view);
		this.pos = pos;
		this.event = event;
		this.flushed = flushed;
		this.delayedSelectionSync = false;
		this.startDoc = view.state.doc;
		this.selectNode = !!event[selectNodeModifier];
		this.allowDefault = event.shiftKey;
		let targetNode, targetPos;
		if (pos.inside > -1) {
			targetNode = view.state.doc.nodeAt(pos.inside);
			targetPos = pos.inside;
		} else {
			let $pos = view.state.doc.resolve(pos.pos);
			targetNode = $pos.parent;
			targetPos = $pos.depth ? $pos.before() : 0;
		}
		const target = flushed ? null : event.target;
		const targetDesc = target ? view.docView.nearestDesc(target, true) : 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))
		)
			this.mightDrag = {
				node: targetNode,
				pos: targetPos,
				addAttr: !!(this.target && !this.target.draggable),
				setUneditable: !!(this.target && gecko && !this.target.hasAttribute("contentEditable")),
			};
		if (this.target && this.mightDrag && (this.mightDrag.addAttr || this.mightDrag.setUneditable)) {
			this.view.domObserver.stop();
			if (this.mightDrag.addAttr) this.target.draggable = true;
			if (this.mightDrag.setUneditable)
				setTimeout(() => {
					if (this.view.input.mouseDown == this) this.target.setAttribute("contentEditable", "false");
				}, 20);
			this.view.domObserver.start();
		}
		setSelectionOrigin(view, "pointer");
	}
	done() {
		super.done();
		if (this.mightDrag && this.target) {
			this.view.domObserver.stop();
			if (this.mightDrag.addAttr) this.target.removeAttribute("draggable");
			if (this.mightDrag.setUneditable) this.target.removeAttribute("contentEditable");
			this.view.domObserver.start();
		}
		if (this.delayedSelectionSync)
			setTimeout(() => {
				if (!this.view.isDestroyed) selectionToDOM(this.view);
			});
	}
	up(event) {
		this.done();
		if (!this.view.dom.contains(event.target)) return;
		let pos = this.pos;
		if (this.view.state.doc != this.startDoc) pos = this.view.posAtCoords(eventCoords(event));
		this.updateAllowDefault(event);
		if (this.allowDefault || !pos) {
			setSelectionOrigin(this.view, "pointer");
		} else if (handleSingleClick(this.view, pos.pos, pos.inside, event, this.selectNode)) {
			event.preventDefault();
		} else if (
			event.button == 0 &&
			(this.flushed ||
				// Safari ignores clicks on draggable elements
				(safari && this.mightDrag && !this.mightDrag.node.isAtom) ||
				// Chrome will sometimes treat a node selection as a
				// cursor, but still report that the node is selected
				// when asked through getSelection. You'll then get a
				// situation where clicking at the point where that
				// (hidden) cursor is doesn't change the selection, and
				// thus doesn't get a reaction from ProseMirror. This
				// works around that.
				(chrome && !this.view.state.selection.visible && Math.min(Math.abs(pos.pos - this.view.state.selection.from), Math.abs(pos.pos - this.view.state.selection.to)) <= 2))
		) {
			updateSelection(this.view, Selection.near(this.view.state.doc.resolve(pos.pos)));
			event.preventDefault();
		} else {
			setSelectionOrigin(this.view, "pointer");
		}
	}
	move(event) {
		this.updateAllowDefault(event);
		setSelectionOrigin(this.view, "pointer");
		super.move(event);
	}
	updateAllowDefault(event) {
		if (!this.allowDefault && (Math.abs(this.event.x - event.clientX) > 4 || Math.abs(this.event.y - event.clientY) > 4)) this.allowDefault = true;
	}
	delaySelUpdate() {
		if (!this.allowDefault) return false;
		this.delayedSelectionSync = true;
		return true;
	}
}
class TripleClickDrag extends MouseDown {
	constructor(view, startSelection) {
		super(view);
		this.startSelection = startSelection;
		this.startDoc = view.state.doc;
	}
	move(event) {
		if (event.buttons == 0 || this.view.isDestroyed || !this.view.state.doc.eq(this.startDoc)) {
			this.done();
			return;
		}
		event.preventDefault();
		setSelectionOrigin(this.view, "pointer");
		let pos = this.view.posAtCoords(eventCoords(event));
		let target = pos && selectionForTripleClick(this.view, pos.inside, false);
		if (!target) return;
		let { doc } = this.view.state,
			start = this.startSelection;
		let [anchor, head] = target.from < start.from ? [start.to, target.from] : [start.from, target.to];
		updateSelection(this.view, TextSelection.create(doc, anchor, head));
	}
}
handlers.touchstart = (view) => {
	view.input.lastTouch = Date.now();
	forceDOMFlush(view);
	setSelectionOrigin(view, "pointer");
};
handlers.touchmove = (view) => {
	view.input.lastTouch = Date.now();
	setSelectionOrigin(view, "pointer");
};
handlers.contextmenu = (view) => forceDOMFlush(view);
function inOrNearComposition(view, event) {
	if (view.composing) return true;
	// See https://www.stum.de/2016/06/24/handling-ime-events-in-javascript/.
	// On Japanese input method editors (IMEs), the Enter key is used to confirm character
	// selection. On Safari, when Enter is pressed, compositionend and keydown events are
	// emitted. The keydown event triggers newline insertion, which we don't want.
	// This method returns true if the keydown event should be ignored.
	// We only ignore it once, as pressing Enter a second time *should* insert a newline.
	// Furthermore, the keydown event timestamp must be close to the compositionEndedAt timestamp.
	// This guards against the case where compositionend is triggered without the keyboard
	// (e.g. character confirmation may be done with the mouse), and keydown is triggered
	// afterwards- we wouldn't want to ignore the keydown event in this case.
	if (safari && Math.abs(Date.now() - view.input.compositionEndedAt) < 500) {
		view.input.compositionEndedAt = -2e8;
		return true;
	}
	return false;
}
// Drop active composition after 5 seconds of inactivity on Android
const timeoutComposition = android ? 5000 : -1;
editHandlers.compositionstart = editHandlers.compositionupdate = (view) => {
	if (!view.composing) {
		view.domObserver.flush();
		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)) ||
				(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);
			view.markCursor = null;
		} else {
			endComposition(view, !state.selection.empty);
			// In firefox, if the cursor is after but outside a marked node,
			// the inserted text won't inherit the marks. So this moves it
			// inside if necessary.
			if (gecko && state.selection.empty && $pos.parentOffset && !$pos.textOffset && $pos.nodeBefore.marks.length) {
				let sel = view.domSelectionRange();
				for (let node = sel.focusNode, offset = sel.focusOffset; node && node.nodeType == 1 && offset != 0; ) {
					let before = offset < 0 ? node.lastChild : node.childNodes[offset - 1];
					if (!before) break;
					if (before.nodeType == 3) {
						let sel = view.domSelection();
						if (sel) sel.collapse(before, before.nodeValue.length);
						break;
					} else {
						node = before;
						offset = -1;
					}
				}
			}
		}
		view.input.composing = true;
	}
	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 = Date.now();
		view.input.compositionPendingChanges = view.domObserver.pendingRecords().length ? view.input.compositionID : 0;
		view.input.compositionNode = null;
		if (view.input.badSafariComposition) view.domObserver.forceFlush();
		else if (view.input.compositionPendingChanges) Promise.resolve().then(() => view.domObserver.flush());
		view.input.compositionID++;
		scheduleComposeEnd(view, 20);
	}
};
function scheduleComposeEnd(view, delay) {
	clearTimeout(view.input.composingTimeout);
	if (delay > -1) view.input.composingTimeout = setTimeout(() => endComposition(view), delay);
}
function clearComposition(view) {
	if (view.composing) {
		view.input.composing = false;
		view.input.compositionEndedAt = Date.now();
	}
	while (view.input.compositionNodes.length > 0) view.input.compositionNodes.pop().markParentsDirty();
}
function findCompositionNode(view) {
	let sel = view.domSelectionRange();
	if (!sel.focusNode) return null;
	let textBefore = textNodeBefore$1(sel.focusNode, sel.focusOffset);
	let textAfter = textNodeAfter$1(sel.focusNode, sel.focusOffset);
	if (textBefore && textAfter && textBefore != textAfter) {
		let descAfter = textAfter.pmViewDesc,
			lastChanged = view.domObserver.lastChangedTextNode;
		if (textBefore == lastChanged || textAfter == lastChanged) return lastChanged;
		if (!descAfter || !descAfter.isText(textAfter.nodeValue)) {
			return textAfter;
		} else if (view.input.compositionNode == textAfter) {
			let descBefore = textBefore.pmViewDesc;
			if (!(!descBefore || !descBefore.isText(textBefore.nodeValue))) return textAfter;
		}
	}
	return textBefore || textAfter;
}
/**
@internal
*/
function endComposition(view, restarting = false) {
	if (android && view.domObserver.flushingSoon >= 0) return;
	view.domObserver.forceFlush();
	clearComposition(view);
	if (restarting || (view.docView && view.docView.dirty)) {
		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) && !cur.$from.node(cur.$from.sharedDepth(cur.to)).inlineContent) view.dispatch(view.state.tr.deleteSelection());
		else view.updateState(view.state);
		return true;
	}
	return false;
}
function captureCopy(view, dom) {
	// The extra wrapper is somehow necessary on IE/Edge to prevent the
	// content from being mangled when it is put onto the clipboard
	if (!view.dom.parentNode) return;
	let wrap = view.dom.parentNode.appendChild(document.createElement("div"));
	wrap.appendChild(dom);
	wrap.style.cssText = "position: fixed; left: -10000px; top: 10px";
	let sel = getSelection(),
		range = document.createRange();
	range.selectNodeContents(dom);
	// Done because IE will fire a selectionchange moving the selection
	// to its start when removeAllRanges is called and the editor still
	// has focus (which will mess up the editor's selection state).
	view.dom.blur();
	sel.removeAllRanges();
	sel.addRange(range);
	setTimeout(() => {
		if (wrap.parentNode) wrap.parentNode.removeChild(wrap);
		view.focus();
	}, 50);
}
// This is very crude, but unfortunately both these browsers _pretend_
// that they have a clipboard API—all the objects and methods are
// there, they just don't work, and they are hard to test.
const brokenClipboardAPI = (ie$1 && ie_version < 15) || (ios && webkit_version < 604);
handlers.copy = editHandlers.cut = (view, _event) => {
	let event = _event;
	let sel = view.state.selection,
		cut = event.type == "cut";
	if (sel.empty) return;
	// IE and Edge's clipboard interface is completely broken
	let data = brokenClipboardAPI ? null : event.clipboardData;
	let slice = sel.content(),
		{ dom, text } = serializeForClipboard(view, slice);
	if (data) {
		event.preventDefault();
		data.clearData();
		data.setData("text/html", dom.innerHTML);
		data.setData("text/plain", text);
	} else {
		captureCopy(view, dom);
	}
	if (cut) view.dispatch(view.state.tr.deleteSelection().scrollIntoView().setMeta("uiEvent", "cut"));
};
function sliceSingleNode(slice) {
	return slice.openStart == 0 && slice.openEnd == 0 && slice.content.childCount == 1 ? slice.content.firstChild : null;
}
function capturePaste(view, event) {
	if (!view.dom.parentNode) return;
	let plainText = view.input.shiftKey || view.state.selection.$from.parent.type.spec.code;
	let target = view.dom.parentNode.appendChild(document.createElement(plainText ? "textarea" : "div"));
	if (!plainText) target.contentEditable = "true";
	target.style.cssText = "position: fixed; left: -10000px; top: 10px";
	target.focus();
	let plain = view.input.shiftKey && view.input.lastKeyCode != 45;
	setTimeout(() => {
		view.focus();
		if (target.parentNode) target.parentNode.removeChild(target);
		if (plainText) doPaste(view, target.value, null, plain, event);
		else doPaste(view, target.textContent, target.innerHTML, plain, event);
	}, 50);
}
function doPaste(view, text, html, preferPlain, event) {
	let slice = parseFromClipboard(view, text, html, preferPlain, view.state.selection.$from);
	if (view.someProp("handlePaste", (f) => f(view, event, slice || Slice.empty))) return true;
	if (!slice) return false;
	let singleNode = sliceSingleNode(slice);
	let tr = singleNode ? view.state.tr.replaceSelectionWith(singleNode, preferPlain) : view.state.tr.replaceSelection(slice);
	view.dispatch(tr.scrollIntoView().setMeta("paste", true).setMeta("uiEvent", "paste"));
	return true;
}
function getText$1(clipboardData) {
	let text = clipboardData.getData("text/plain") || clipboardData.getData("Text");
	if (text) return text;
	let uris = clipboardData.getData("text/uri-list");
	return uris ? uris.replace(/\r?\n/g, " ") : "";
}
editHandlers.paste = (view, _event) => {
	let event = _event;
	// Handling paste from JavaScript during composition is very poorly
	// handled by browsers, so as a dodgy but preferable kludge, we just
	// let the browser do its native thing there, except on Android,
	// where the editor is almost always composing.
	if (view.composing && !android) return;
	let data = brokenClipboardAPI ? null : event.clipboardData;
	let plain = view.input.shiftKey && view.input.lastKeyCode != 45;
	if (data && doPaste(view, getText$1(data), data.getData("text/html"), plain, event)) event.preventDefault();
	else capturePaste(view, event);
};
class Dragging {
	constructor(slice, move, node) {
		this.slice = slice;
		this.move = move;
		this.node = node;
	}
}
const dragCopyModifier = mac$2 ? "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;
	if (mouseDown) mouseDown.done();
	if (!event.dataTransfer) return;
	let sel = view.state.selection;
	let pos = sel.empty ? null : view.posAtCoords(eventCoords(event));
	let node;
	if (pos && pos.pos >= sel.from && pos.pos <= (sel instanceof NodeSelection ? sel.to - 1 : sel.to));
	else if (mouseDown && mouseDown.mightDrag) {
		node = NodeSelection.create(view.state.doc, mouseDown.mightDrag.pos);
	} else if (event.target && event.target.nodeType == 1) {
		let desc = view.docView.nearestDesc(event.target, true);
		if (desc && desc.node.type.spec.draggable && desc != view.docView) node = NodeSelection.create(view.state.doc, desc.posBefore);
	}
	let draggedSlice = (node || view.state.selection).content();
	let { dom, text, slice } = serializeForClipboard(view, draggedSlice);
	// Pre-120 Chrome versions clear files when calling `clearData` (#1472)
	if (!event.dataTransfer.files.length || !chrome || chrome_version > 120) event.dataTransfer.clearData();
	event.dataTransfer.setData(brokenClipboardAPI ? "Text" : "text/html", dom.innerHTML);
	// 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, dragMoves(view, event), node);
};
handlers.dragend = (view) => {
	let dragging = view.dragging;
	window.setTimeout(() => {
		if (view.dragging == dragging) view.dragging = null;
	}, 50);
};
editHandlers.dragover = editHandlers.dragenter = (_, e) => e.preventDefault();
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));
	if (!eventPos) return;
	let $mouse = view.state.doc.resolve(eventPos.pos);
	let slice = dragging && dragging.slice;
	if (slice) {
		view.someProp("transformPasted", (f) => {
			slice = f(slice, view, false);
		});
	} else {
		slice = parseFromClipboard(view, getText$1(event.dataTransfer), brokenClipboardAPI ? null : event.dataTransfer.getData("text/html"), false, $mouse);
	}
	let move = !!(dragging && dragMoves(view, event));
	if (view.someProp("handleDrop", (f) => f(view, event, slice || Slice.empty, move))) {
		event.preventDefault();
		return;
	}
	if (!slice) return;
	event.preventDefault();
	let insertPos = slice ? dropPoint(view.state.doc, $mouse.pos, slice) : $mouse.pos;
	if (insertPos == null) insertPos = $mouse.pos;
	let tr = view.state.tr;
	if (move) {
		let { node } = dragging;
		if (node) node.replace(tr);
		else tr.deleteSelection();
	}
	let pos = tr.mapping.map(insertPos);
	let isNode = slice.openStart == 0 && slice.openEnd == 0 && slice.content.childCount == 1;
	let beforeInsert = tr.doc;
	if (isNode) tr.replaceRangeWith(pos, pos, slice.content.firstChild);
	else tr.replaceRange(pos, pos, slice);
	if (tr.doc.eq(beforeInsert)) return;
	let $pos = tr.doc.resolve(pos);
	if (isNode && NodeSelection.isSelectable(slice.content.firstChild) && $pos.nodeAfter && $pos.nodeAfter.sameMarkup(slice.content.firstChild)) {
		tr.setSelection(new NodeSelection($pos));
	} else {
		let end = tr.mapping.map(insertPos);
		tr.mapping.maps[tr.mapping.maps.length - 1].forEach((_from, _to, _newFrom, newTo) => (end = newTo));
		tr.setSelection(selectionBetween(view, $pos, tr.doc.resolve(end)));
	}
	view.focus();
	view.dispatch(tr.setMeta("uiEvent", "drop"));
}
handlers.focus = (view) => {
	view.input.lastFocus = Date.now();
	if (!view.focused) {
		view.domObserver.stop();
		view.dom.classList.add("ProseMirror-focused");
		view.domObserver.start();
		view.focused = true;
		setTimeout(() => {
			if (view.docView && view.hasFocus() && !view.domObserver.currentSelection.eq(view.domSelectionRange())) selectionToDOM(view);
		}, 20);
	}
};
handlers.blur = (view, _event) => {
	let event = _event;
	if (view.focused) {
		view.domObserver.stop();
		view.dom.classList.remove("ProseMirror-focused");
		view.domObserver.start();
		if (event.relatedTarget && view.dom.contains(event.relatedTarget)) view.domObserver.currentSelection.clear();
		view.focused = false;
	}
};
handlers.beforeinput = (view, _event) => {
	let event = _event;
	// We should probably do more with beforeinput events, but support
	// is so spotty that I'm still waiting to see where they are going.
	// Very specific hack to deal with backspace sometimes failing on
	// Chrome Android when after an uneditable node.
	if (chrome && android && event.inputType == "deleteContentBackward") {
		view.domObserver.flushSoon();
		let { domChangeCount } = view.input;
		setTimeout(() => {
			if (view.input.domChangeCount != domChangeCount) return; // Event already had some effect
			// This bug tends to close the virtual keyboard, so we refocus
			view.dom.blur();
			view.focus();
			if (view.someProp("handleKeyDown", (f) => f(view, keyEvent(8, "Backspace")))) return;
			let { $cursor } = view.state.selection;
			// Crude approximation of backspace behavior when no command handled it
			if ($cursor && $cursor.pos > 0) view.dispatch(view.state.tr.delete($cursor.pos - 1, $cursor.pos).scrollIntoView());
		}, 50);
	}
};
// Make sure all handlers get registered
for (let prop in editHandlers) handlers[prop] = editHandlers[prop];

function compareObjs(a, b) {
	if (a == b) return true;
	for (let p in a) if (a[p] !== b[p]) return false;
	for (let p in b) if (!(p in a)) return false;
	return true;
}
class WidgetType {
	constructor(toDOM, spec) {
		this.toDOM = toDOM;
		this.spec = spec || noSpec;
		this.side = this.spec.side || 0;
	}
	map(mapping, span, offset, oldOffset) {
		let { pos, deleted } = mapping.mapResult(span.from + oldOffset, this.side < 0 ? -1 : 1);
		return deleted ? null : new Decoration(pos - offset, pos - offset, this);
	}
	valid() {
		return true;
	}
	eq(other) {
		return this == other || (other instanceof WidgetType && ((this.spec.key && this.spec.key == other.spec.key) || (this.toDOM == other.toDOM && compareObjs(this.spec, other.spec))));
	}
	destroy(node) {
		if (this.spec.destroy) this.spec.destroy(node);
	}
}
class InlineType {
	constructor(attrs, spec) {
		this.attrs = attrs;
		this.spec = spec || noSpec;
	}
	map(mapping, span, offset, oldOffset) {
		let from = mapping.map(span.from + oldOffset, this.spec.inclusiveStart ? -1 : 1) - offset;
		let to = mapping.map(span.to + oldOffset, this.spec.inclusiveEnd ? 1 : -1) - offset;
		return from >= to ? null : new Decoration(from, to, this);
	}
	valid(_, span) {
		return span.from < span.to;
	}
	eq(other) {
		return this == other || (other instanceof InlineType && compareObjs(this.attrs, other.attrs) && compareObjs(this.spec, other.spec));
	}
	static is(span) {
		return span.type instanceof InlineType;
	}
	destroy() {}
}
class NodeType {
	constructor(attrs, spec) {
		this.attrs = attrs;
		this.spec = spec || noSpec;
	}
	map(mapping, span, offset, oldOffset) {
		let from = mapping.mapResult(span.from + oldOffset, 1);
		if (from.deleted) return null;
		let to = mapping.mapResult(span.to + oldOffset, -1);
		if (to.deleted || to.pos <= from.pos) return null;
		return new Decoration(from.pos - offset, to.pos - offset, this);
	}
	valid(node, span) {
		let { index, offset } = node.content.findIndex(span.from),
			child;
		return offset == span.from && !(child = node.child(index)).isText && offset + child.nodeSize == span.to;
	}
	eq(other) {
		return this == other || (other instanceof NodeType && compareObjs(this.attrs, other.attrs) && compareObjs(this.spec, other.spec));
	}
	destroy() {}
}
/**
Decoration objects can be provided to the view through the
[`decorations` prop](https://prosemirror.net/docs/ref/#view.EditorProps.decorations). They come in
several variants—see the static members of this class for details.
*/
class Decoration {
	/**
    @internal
    */
	constructor(
		/**
    The start position of the decoration.
    */
		from,
		/**
    The end position. Will be the same as `from` for [widget
    decorations](https://prosemirror.net/docs/ref/#view.Decoration^widget).
    */
		to,
		/**
    @internal
    */
		type,
	) {
		this.from = from;
		this.to = to;
		this.type = type;
	}
	/**
    @internal
    */
	copy(from, to) {
		return new Decoration(from, to, this.type);
	}
	/**
    @internal
    */
	eq(other, offset = 0) {
		return this.type.eq(other.type) && this.from + offset == other.from && this.to + offset == other.to;
	}
	/**
    @internal
    */
	map(mapping, offset, oldOffset) {
		return this.type.map(mapping, this, offset, oldOffset);
	}
	/**
    Creates a widget decoration, which is a DOM node that's shown in
    the document at the given position. It is recommended that you
    delay rendering the widget by passing a function that will be
    called when the widget is actually drawn in a view, but you can
    also directly pass a DOM node. `getPos` can be used to find the
    widget's current document position.
    */
	static widget(pos, toDOM, spec) {
		return new Decoration(pos, pos, new WidgetType(toDOM, spec));
	}
	/**
    Creates an inline decoration, which adds the given attributes to
    each inline node between `from` and `to`.
    */
	static inline(from, to, attrs, spec) {
		return new Decoration(from, to, new InlineType(attrs, spec));
	}
	/**
    Creates a node decoration. `from` and `to` should point precisely
    before and after a node in the document. That node, and only that
    node, will receive the given attributes.
    */
	static node(from, to, attrs, spec) {
		return new Decoration(from, to, new NodeType(attrs, spec));
	}
	/**
    The spec provided when creating this decoration. Can be useful
    if you've stored extra information in that object.
    */
	get spec() {
		return this.type.spec;
	}
	/**
    @internal
    */
	get inline() {
		return this.type instanceof InlineType;
	}
	/**
    @internal
    */
	get widget() {
		return this.type instanceof WidgetType;
	}
}
const none = [],
	noSpec = {};
/**
A collection of [decorations](https://prosemirror.net/docs/ref/#view.Decoration), organized in such
a way that the drawing algorithm can efficiently use and compare
them. This is a persistent data structure—it is not modified,
updates create a new value.
*/
class DecorationSet {
	/**
    @internal
    */
	constructor(local, children) {
		this.local = local.length ? local : none;
		this.children = children.length ? children : none;
	}
	/**
    Create a set of decorations, using the structure of the given
    document. This will consume (modify) the `decorations` array, so
    you must make a copy if you want need to preserve that.
    */
	static create(doc, decorations) {
		return decorations.length ? buildTree(decorations, doc, 0, noSpec) : empty;
	}
	/**
    Find all decorations in this set which touch the given range
    (including decorations that start or end directly at the
    boundaries) and match the given predicate on their spec. When
    `start` and `end` are omitted, all decorations in the set are
    considered. When `predicate` isn't given, all decorations are
    assumed to match.
    */
	find(start, end, predicate) {
		let result = [];
		this.findInner(start == null ? 0 : start, end == null ? 1e9 : end, result, 0, predicate);
		return result;
	}
	findInner(start, end, result, offset, predicate) {
		for (let i = 0; i < this.local.length; i++) {
			let span = this.local[i];
			if (span.from <= end && span.to >= start && (!predicate || predicate(span.spec))) result.push(span.copy(span.from + offset, span.to + offset));
		}
		for (let i = 0; i < this.children.length; i += 3) {
			if (this.children[i] < end && this.children[i + 1] > start) {
				let childOff = this.children[i] + 1;
				this.children[i + 2].findInner(start - childOff, end - childOff, result, offset + childOff, predicate);
			}
		}
	}
	/**
    Map the set of decorations in response to a change in the
    document.
    */
	map(mapping, doc, options) {
		if (this == empty || mapping.maps.length == 0) return this;
		return this.mapInner(mapping, doc, 0, 0, options || noSpec);
	}
	/**
    @internal
    */
	mapInner(mapping, node, offset, oldOffset, options) {
		let newLocal;
		for (let i = 0; i < this.local.length; i++) {
			let mapped = this.local[i].map(mapping, offset, oldOffset);
			if (mapped && mapped.type.valid(node, mapped)) (newLocal || (newLocal = [])).push(mapped);
			else if (options.onRemove) options.onRemove(this.local[i].spec);
		}
		if (this.children.length) return mapChildren(this.children, newLocal || [], mapping, node, offset, oldOffset, options);
		else return newLocal ? new DecorationSet(newLocal.sort(byPos), none) : empty;
	}
	/**
    Add the given array of decorations to the ones in the set,
    producing a new set. Consumes the `decorations` array. Needs
    access to the current document to create the appropriate tree
    structure.
    */
	add(doc, decorations) {
		if (!decorations.length) return this;
		if (this == empty) return DecorationSet.create(doc, decorations);
		return this.addInner(doc, decorations, 0);
	}
	addInner(doc, decorations, offset) {
		let children,
			childIndex = 0;
		doc.forEach((childNode, childOffset) => {
			let baseOffset = childOffset + offset,
				found;
			if (!(found = takeSpansForNode(decorations, childNode, baseOffset))) return;
			if (!children) children = this.children.slice();
			while (childIndex < children.length && children[childIndex] < childOffset) childIndex += 3;
			if (children[childIndex] == childOffset) children[childIndex + 2] = children[childIndex + 2].addInner(childNode, found, baseOffset + 1);
			else children.splice(childIndex, 0, childOffset, childOffset + childNode.nodeSize, buildTree(found, childNode, baseOffset + 1, noSpec));
			childIndex += 3;
		});
		let local = moveSpans(childIndex ? withoutNulls(decorations) : decorations, -offset);
		for (let i = 0; i < local.length; i++) if (!local[i].type.valid(doc, local[i])) local.splice(i--, 1);
		return new DecorationSet(local.length ? this.local.concat(local).sort(byPos) : this.local, children || this.children);
	}
	/**
    Create a new set that contains the decorations in this set, minus
    the ones in the given array.
    */
	remove(decorations) {
		if (decorations.length == 0 || this == empty) return this;
		return this.removeInner(decorations, 0);
	}
	removeInner(decorations, offset) {
		let children = this.children,
			local = this.local;
		for (let i = 0; i < children.length; i += 3) {
			let found;
			let from = children[i] + offset,
				to = children[i + 1] + offset;
			for (let j = 0, span; j < decorations.length; j++)
				if ((span = decorations[j])) {
					if (span.from > from && span.to < to) {
						decorations[j] = null;
						(found || (found = [])).push(span);
					}
				}
			if (!found) continue;
			if (children == this.children) children = this.children.slice();
			let removed = children[i + 2].removeInner(found, from + 1);
			if (removed != empty) {
				children[i + 2] = removed;
			} else {
				children.splice(i, 3);
				i -= 3;
			}
		}
		if (local.length)
			for (let i = 0, span; i < decorations.length; i++)
				if ((span = decorations[i])) {
					for (let j = 0; j < local.length; j++)
						if (local[j].eq(span, offset)) {
							if (local == this.local) local = this.local.slice();
							local.splice(j--, 1);
						}
				}
		if (children == this.children && local == this.local) return this;
		return local.length || children.length ? new DecorationSet(local, children) : empty;
	}
	forChild(offset, node) {
		if (this == empty) return this;
		if (node.isLeaf) return DecorationSet.empty;
		let child, local;
		for (let i = 0; i < this.children.length; i += 3)
			if (this.children[i] >= offset) {
				if (this.children[i] == offset) child = this.children[i + 2];
				break;
			}
		let start = offset + 1,
			end = start + node.content.size;
		for (let i = 0; i < this.local.length; i++) {
			let dec = this.local[i];
			if (dec.from < end && dec.to > start && dec.type instanceof InlineType) {
				let from = Math.max(start, dec.from) - start,
					to = Math.min(end, dec.to) - start;
				if (from < to) (local || (local = [])).push(dec.copy(from, to));
			}
		}
		if (local) {
			let localSet = new DecorationSet(local.sort(byPos), none);
			return child ? new DecorationGroup([localSet, child]) : localSet;
		}
		return child || empty;
	}
	/**
    @internal
    */
	eq(other) {
		if (this == other) return true;
		if (!(other instanceof DecorationSet) || this.local.length != other.local.length || this.children.length != other.children.length) return false;
		for (let i = 0; i < this.local.length; i++) if (!this.local[i].eq(other.local[i])) return false;
		for (let i = 0; i < this.children.length; i += 3)
			if (this.children[i] != other.children[i] || this.children[i + 1] != other.children[i + 1] || !this.children[i + 2].eq(other.children[i + 2])) return false;
		return true;
	}
	/**
    @internal
    */
	locals(node) {
		return removeOverlap(this.localsInner(node));
	}
	/**
    @internal
    */
	localsInner(node) {
		if (this == empty) return none;
		if (node.inlineContent || !this.local.some(InlineType.is)) return this.local;
		let result = [];
		for (let i = 0; i < this.local.length; i++) {
			if (!(this.local[i].type instanceof InlineType)) result.push(this.local[i]);
		}
		return result;
	}
	forEachSet(f) {
		f(this);
	}
}
/**
The empty set of decorations.
*/
DecorationSet.empty = new DecorationSet([], []);
/**
@internal
*/
DecorationSet.removeOverlap = removeOverlap;
const empty = DecorationSet.empty;
// An abstraction that allows the code dealing with decorations to
// treat multiple DecorationSet objects as if it were a single object
// with (a subset of) the same interface.
class DecorationGroup {
	constructor(members) {
		this.members = members;
	}
	map(mapping, doc) {
		const mappedDecos = this.members.map((member) => member.map(mapping, doc, noSpec));
		return DecorationGroup.from(mappedDecos);
	}
	forChild(offset, child) {
		if (child.isLeaf) return DecorationSet.empty;
		let found = [];
		for (let i = 0; i < this.members.length; i++) {
			let result = this.members[i].forChild(offset, child);
			if (result == empty) continue;
			if (result instanceof DecorationGroup) found = found.concat(result.members);
			else found.push(result);
		}
		return DecorationGroup.from(found);
	}
	eq(other) {
		if (!(other instanceof DecorationGroup) || other.members.length != this.members.length) return false;
		for (let i = 0; i < this.members.length; i++) if (!this.members[i].eq(other.members[i])) return false;
		return true;
	}
	locals(node) {
		let result,
			sorted = true;
		for (let i = 0; i < this.members.length; i++) {
			let locals = this.members[i].localsInner(node);
			if (!locals.length) continue;
			if (!result) {
				result = locals;
			} else {
				if (sorted) {
					result = result.slice();
					sorted = false;
				}
				for (let j = 0; j < locals.length; j++) result.push(locals[j]);
			}
		}
		return result ? removeOverlap(sorted ? result : result.sort(byPos)) : none;
	}
	// Create a group for the given array of decoration sets, or return
	// a single set when possible.
	static from(members) {
		switch (members.length) {
			case 0:
				return empty;
			case 1:
				return members[0];
			default:
				return new DecorationGroup(members.every((m) => m instanceof DecorationSet) ? members : members.reduce((r, m) => r.concat(m instanceof DecorationSet ? m : m.members), []));
		}
	}
	forEachSet(f) {
		for (let i = 0; i < this.members.length; i++) this.members[i].forEachSet(f);
	}
}
function mapChildren(oldChildren, newLocal, mapping, node, offset, oldOffset, options) {
	let children = oldChildren.slice();
	// Mark the children that are directly touched by changes, and
	// move those that are after the changes.
	for (let i = 0, baseOffset = oldOffset; i < mapping.maps.length; i++) {
		let moved = 0;
		mapping.maps[i].forEach((oldStart, oldEnd, newStart, newEnd) => {
			let dSize = newEnd - newStart - (oldEnd - oldStart);
			for (let i = 0; i < children.length; i += 3) {
				let end = children[i + 1];
				if (end < 0 || oldStart > end + baseOffset - moved) continue;
				let start = children[i] + baseOffset - moved;
				if (oldEnd >= start) {
					children[i + 1] = oldStart <= start ? -2 : -1;
				} else if (oldStart >= baseOffset && dSize) {
					children[i] += dSize;
					children[i + 1] += dSize;
				}
			}
			moved += dSize;
		});
		baseOffset = mapping.maps[i].map(baseOffset, -1);
	}
	// Find the child nodes that still correspond to a single node,
	// recursively call mapInner on them and update their positions.
	let mustRebuild = false;
	for (let i = 0; i < children.length; i += 3)
		if (children[i + 1] < 0) {
			// Touched nodes
			if (children[i + 1] == -2) {
				mustRebuild = true;
				children[i + 1] = -1;
				continue;
			}
			let from = mapping.map(oldChildren[i] + oldOffset),
				fromLocal = from - offset;
			if (fromLocal < 0 || fromLocal >= node.content.size) {
				mustRebuild = true;
				continue;
			}
			// Must read oldChildren because children was tagged with -1
			let to = mapping.map(oldChildren[i + 1] + oldOffset, -1),
				toLocal = to - offset;
			let { index, offset: childOffset } = node.content.findIndex(fromLocal);
			let childNode = node.maybeChild(index);
			if (childNode && childOffset == fromLocal && childOffset + childNode.nodeSize == toLocal) {
				let mapped = children[i + 2].mapInner(mapping, childNode, from + 1, oldChildren[i] + oldOffset + 1, options);
				if (mapped != empty) {
					children[i] = fromLocal;
					children[i + 1] = toLocal;
					children[i + 2] = mapped;
				} else {
					children[i + 1] = -2;
					mustRebuild = true;
				}
			} else {
				mustRebuild = true;
			}
		}
	// Remaining children must be collected and rebuilt into the appropriate structure
	if (mustRebuild) {
		let decorations = mapAndGatherRemainingDecorations(children, oldChildren, newLocal, mapping, offset, oldOffset, options);
		let built = buildTree(decorations, node, 0, options);
		newLocal = built.local;
		for (let i = 0; i < children.length; i += 3)
			if (children[i + 1] < 0) {
				children.splice(i, 3);
				i -= 3;
			}
		for (let i = 0, j = 0; i < built.children.length; i += 3) {
			let from = built.children[i];
			while (j < children.length && children[j] < from) j += 3;
			children.splice(j, 0, built.children[i], built.children[i + 1], built.children[i + 2]);
		}
	}
	return new DecorationSet(newLocal.sort(byPos), children);
}
function moveSpans(spans, offset) {
	if (!offset || !spans.length) return spans;
	let result = [];
	for (let i = 0; i < spans.length; i++) {
		let span = spans[i];
		result.push(new Decoration(span.from + offset, span.to + offset, span.type));
	}
	return result;
}
function mapAndGatherRemainingDecorations(children, oldChildren, decorations, mapping, offset, oldOffset, options) {
	// Gather all decorations from the remaining marked children
	function gather(set, oldOffset) {
		for (let i = 0; i < set.local.length; i++) {
			let mapped = set.local[i].map(mapping, offset, oldOffset);
			if (mapped) decorations.push(mapped);
			else if (options.onRemove) options.onRemove(set.local[i].spec);
		}
		for (let i = 0; i < set.children.length; i += 3) gather(set.children[i + 2], set.children[i] + oldOffset + 1);
	}
	for (let i = 0; i < children.length; i += 3) if (children[i + 1] == -1) gather(children[i + 2], oldChildren[i] + oldOffset + 1);
	return decorations;
}
function takeSpansForNode(spans, node, offset) {
	if (node.isLeaf) return null;
	let end = offset + node.nodeSize,
		found = null;
	for (let i = 0, span; i < spans.length; i++) {
		if ((span = spans[i]) && span.from > offset && span.to < end) {
			(found || (found = [])).push(span);
			spans[i] = null;
		}
	}
	return found;
}
function withoutNulls(array) {
	let result = [];
	for (let i = 0; i < array.length; i++) if (array[i] != null) result.push(array[i]);
	return result;
}
// Build up a tree that corresponds to a set of decorations. `offset`
// is a base offset that should be subtracted from the `from` and `to`
// positions in the spans (so that we don't have to allocate new spans
// for recursive calls).
function buildTree(spans, node, offset, options) {
	let children = [],
		hasNulls = false;
	node.forEach((childNode, localStart) => {
		let found = takeSpansForNode(spans, childNode, localStart + offset);
		if (found) {
			hasNulls = true;
			let subtree = buildTree(found, childNode, offset + localStart + 1, options);
			if (subtree != empty) children.push(localStart, localStart + childNode.nodeSize, subtree);
		}
	});
	let locals = moveSpans(hasNulls ? withoutNulls(spans) : spans, -offset).sort(byPos);
	for (let i = 0; i < locals.length; i++)
		if (!locals[i].type.valid(node, locals[i])) {
			if (options.onRemove) options.onRemove(locals[i].spec);
			locals.splice(i--, 1);
		}
	return locals.length || children.length ? new DecorationSet(locals, children) : empty;
}
// Used to sort decorations so that ones with a low start position
// come first, and within a set with the same start position, those
// with an smaller end position come first.
function byPos(a, b) {
	return a.from - b.from || a.to - b.to;
}
// Scan a sorted array of decorations for partially overlapping spans,
// and split those so that only fully overlapping spans are left (to
// make subsequent rendering easier). Will return the input array if
// no partially overlapping spans are found (the common case).
function removeOverlap(spans) {
	let working = spans;
	for (let i = 0; i < working.length - 1; i++) {
		let span = working[i];
		if (span.from != span.to)
			for (let j = i + 1; j < working.length; j++) {
				let next = working[j];
				if (next.from == span.from) {
					if (next.to != span.to) {
						if (working == spans) working = spans.slice();
						// Followed by a partially overlapping larger span. Split that
						// span.
						working[j] = next.copy(next.from, span.to);
						insertAhead(working, j + 1, next.copy(span.to, next.to));
					}
					continue;
				} else {
					if (next.from < span.to) {
						if (working == spans) working = spans.slice();
						// The end of this one overlaps with a subsequent span. Split
						// this one.
						working[i] = span.copy(span.from, next.from);
						insertAhead(working, j, span.copy(next.from, span.to));
					}
					break;
				}
			}
	}
	return working;
}
function insertAhead(array, i, deco) {
	while (i < array.length && byPos(deco, array[i]) > 0) i++;
	array.splice(i, 0, deco);
}
// Get the decorations associated with the current props of a view.
function viewDecorations(view) {
	let found = [];
	view.someProp("decorations", (f) => {
		let result = f(view.state);
		if (result && result != empty) found.push(result);
	});
	if (view.cursorWrapper) found.push(DecorationSet.create(view.state.doc, [view.cursorWrapper.deco]));
	return DecorationGroup.from(found);
}

const observeOptions = {
	childList: true,
	characterData: true,
	characterDataOldValue: true,
	attributes: true,
	attributeOldValue: true,
	subtree: true,
};
// IE11 has very broken mutation observers, so we also listen to DOMCharacterDataModified
const useCharData = ie$1 && ie_version <= 11;
class SelectionState {
	constructor() {
		this.anchorNode = null;
		this.anchorOffset = 0;
		this.focusNode = null;
		this.focusOffset = 0;
	}
	set(sel) {
		this.anchorNode = sel.anchorNode;
		this.anchorOffset = sel.anchorOffset;
		this.focusNode = sel.focusNode;
		this.focusOffset = sel.focusOffset;
	}
	clear() {
		this.anchorNode = this.focusNode = null;
	}
	eq(sel) {
		return sel.anchorNode == this.anchorNode && sel.anchorOffset == this.anchorOffset && sel.focusNode == this.focusNode && sel.focusOffset == this.focusOffset;
	}
}
class DOMObserver {
	constructor(view, handleDOMChange) {
		this.view = view;
		this.handleDOMChange = handleDOMChange;
		this.queue = [];
		this.flushingSoon = -1;
		this.observer = null;
		this.currentSelection = new SelectionState();
		this.onCharData = null;
		this.suppressingSelectionUpdates = false;
		this.lastChangedTextNode = null;
		this.observer =
			window.MutationObserver &&
			new window.MutationObserver((mutations) => {
				for (let i = 0; i < mutations.length; i++) this.queue.push(mutations[i]);
				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))
				) {
					// 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 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) => {
				this.queue.push({ target: e.target, type: "characterData", oldValue: e.prevValue });
				this.flushSoon();
			};
		}
		this.onSelectionChange = this.onSelectionChange.bind(this);
	}
	flushSoon() {
		if (this.flushingSoon < 0)
			this.flushingSoon = window.setTimeout(() => {
				this.flushingSoon = -1;
				this.flush();
			}, 20);
	}
	forceFlush() {
		if (this.flushingSoon > -1) {
			window.clearTimeout(this.flushingSoon);
			this.flushingSoon = -1;
			this.flush();
		}
	}
	start() {
		if (this.observer) {
			this.observer.takeRecords();
			this.observer.observe(this.view.dom, observeOptions);
		}
		if (this.onCharData) this.view.dom.addEventListener("DOMCharacterDataModified", this.onCharData);
		this.connectSelection();
	}
	stop() {
		if (this.observer) {
			let take = this.observer.takeRecords();
			if (take.length) {
				for (let i = 0; i < take.length; i++) this.queue.push(take[i]);
				window.setTimeout(() => this.flush(), 20);
			}
			this.observer.disconnect();
		}
		if (this.onCharData) this.view.dom.removeEventListener("DOMCharacterDataModified", this.onCharData);
		this.disconnectSelection();
	}
	connectSelection() {
		this.view.dom.ownerDocument.addEventListener("selectionchange", this.onSelectionChange);
	}
	disconnectSelection() {
		this.view.dom.ownerDocument.removeEventListener("selectionchange", this.onSelectionChange);
	}
	suppressSelectionUpdates() {
		this.suppressingSelectionUpdates = true;
		setTimeout(() => (this.suppressingSelectionUpdates = false), 50);
	}
	onSelectionChange() {
		if (!hasFocusAndSelection(this.view)) return;
		if (this.suppressingSelectionUpdates) return selectionToDOM(this.view);
		// Deletions on IE11 fire their events in the wrong order, giving
		// us a selection change event before the DOM changes are
		// reported.
		if (ie$1 && ie_version <= 11 && !this.view.state.selection.empty) {
			let sel = this.view.domSelectionRange();
			// Selection.isCollapsed isn't reliable on IE
			if (sel.focusNode && isEquivalentPosition(sel.focusNode, sel.focusOffset, sel.anchorNode, sel.anchorOffset)) return this.flushSoon();
		}
		this.flush();
	}
	setCurSelection() {
		this.currentSelection.set(this.view.domSelectionRange());
	}
	ignoreSelectionChange(sel) {
		if (!sel.focusNode) return true;
		let ancestors = new Set(),
			container;
		for (let scan = sel.focusNode; scan; scan = parentNode(scan)) ancestors.add(scan);
		for (let scan = sel.anchorNode; scan; scan = parentNode(scan))
			if (ancestors.has(scan)) {
				container = scan;
				break;
			}
		let desc = container && this.view.docView.nearestDesc(container);
		if (
			desc &&
			desc.ignoreMutation({
				type: "selection",
				target: container.nodeType == 3 ? container.parentNode : container,
			})
		) {
			this.setCurSelection();
			return true;
		}
	}
	pendingRecords() {
		if (this.observer) for (let mut of this.observer.takeRecords()) this.queue.push(mut);
		return this.queue;
	}
	flush() {
		let { view } = this;
		if (!view.docView || this.flushingSoon > -1) return;
		let mutations = this.pendingRecords();
		if (mutations.length) this.queue = [];
		let sel = view.domSelectionRange();
		let newSel = !this.suppressingSelectionUpdates && !this.currentSelection.eq(sel) && hasFocusAndSelection(view) && !this.ignoreSelectionChange(sel);
		let from = -1,
			to = -1,
			typeOver = false,
			added = [];
		if (view.editable) {
			for (let i = 0; i < mutations.length; i++) {
				let result = this.registerMutation(mutations[i], added);
				if (result) {
					from = from < 0 ? result.from : Math.min(result.from, from);
					to = to < 0 ? result.to : Math.max(result.to, to);
					if (result.typeOver) typeOver = true;
				}
			}
		}
		if (
			added.some((n) => n.nodeName == "BR") &&
			(view.input.lastKeyCode == 8 ||
				view.input.lastKeyCode == 46 ||
				(chrome && (view.composing || view.input.compositionEndedAt > Date.now() - 50) && mutations.some((m) => m.type == "childList" && m.removedNodes.length)))
		) {
			// 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;
				if (a.parentNode && a.parentNode.parentNode == b.parentNode) b.remove();
				else a.remove();
			} else {
				let { focusNode } = this.currentSelection;
				for (let br of brs) {
					let parent = br.parentNode;
					if (parent && parent.nodeName == "LI" && (!focusNode || blockParent(view, focusNode) != parent)) br.remove();
				}
			}
		}
		let readSel = null;
		// If it looks like the browser has reset the selection to the
		// start of the document after focus, restore the selection from
		// the state
		if (
			from < 0 &&
			newSel &&
			view.input.lastFocus > Date.now() - 200 &&
			Math.max(view.input.lastTouch, view.input.lastClick.time) < Date.now() - 300 &&
			selectionCollapsed(sel) &&
			(readSel = selectionFromDOM(view)) &&
			readSel.eq(Selection.near(view.state.doc.resolve(0), 1))
		) {
			view.input.lastFocus = 0;
			selectionToDOM(view);
			this.currentSelection.set(sel);
			view.scrollToSelection();
		} else if (from > -1 || newSel) {
			if (from > -1) {
				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);
			else if (!this.currentSelection.eq(sel)) selectionToDOM(view);
			this.currentSelection.set(sel);
		}
	}
	registerMutation(mut, added) {
		// Ignore mutations inside nodes that were already noted as inserted
		if (added.indexOf(mut.target) > -1) return null;
		let desc = this.view.docView.nearestDesc(mut.target);
		if (
			mut.type == "attributes" &&
			(desc == this.view.docView ||
				mut.attributeName == "contenteditable" ||
				// Firefox sometimes fires spurious events for null/empty styles
				(mut.attributeName == "style" && !mut.oldValue && !mut.target.getAttribute("style")))
		)
			return null;
		if (!desc || desc.ignoreMutation(mut)) return null;
		if (mut.type == "childList") {
			for (let i = 0; i < mut.addedNodes.length; i++) {
				let node = mut.addedNodes[i];
				added.push(node);
				if (node.nodeType == 3) this.lastChangedTextNode = node;
			}
			if (desc.contentDOM && desc.contentDOM != desc.dom && !desc.contentDOM.contains(mut.target)) return { from: desc.posBefore, to: desc.posAfter };
			let prev = mut.previousSibling,
				next = mut.nextSibling;
			if (ie$1 && ie_version <= 11 && mut.addedNodes.length) {
				// IE11 gives us incorrect next/prev siblings for some
				// insertions, so if there are added nodes, recompute those
				for (let i = 0; i < mut.addedNodes.length; i++) {
					let { previousSibling, nextSibling } = mut.addedNodes[i];
					if (!previousSibling || Array.prototype.indexOf.call(mut.addedNodes, previousSibling) < 0) prev = previousSibling;
					if (!nextSibling || Array.prototype.indexOf.call(mut.addedNodes, nextSibling) < 0) next = nextSibling;
				}
			}
			let fromOffset = prev && prev.parentNode == mut.target ? domIndex(prev) + 1 : 0;
			let from = desc.localPosFromDOM(mut.target, fromOffset, -1);
			let toOffset = next && next.parentNode == mut.target ? domIndex(next) : mut.target.childNodes.length;
			let to = desc.localPosFromDOM(mut.target, toOffset, 1);
			return { from, to };
		} else if (mut.type == "attributes") {
			return { from: desc.posAtStart - desc.border, to: desc.posAtEnd + desc.border };
		} else {
			// "characterData"
			this.lastChangedTextNode = mut.target;
			return {
				from: desc.posAtStart,
				to: desc.posAtEnd,
				// An event was generated for a text change that didn't change
				// any text. Mark the dom change to fall back to assuming the
				// selection was typed over with an identical value if it can't
				// find another change.
				typeOver: mut.target.nodeValue == mut.oldValue,
			};
		}
	}
}
let cssChecked = new WeakMap();
let cssCheckWarned = false;
function checkCSS(view) {
	if (cssChecked.has(view)) return;
	cssChecked.set(view, null);
	if (["normal", "nowrap", "pre-line"].indexOf(getComputedStyle(view.dom).whiteSpace) !== -1) {
		view.requiresGeckoHackNode = gecko;
		if (cssCheckWarned) return;
		console["warn"]("ProseMirror expects the CSS white-space property to be set, preferably to 'pre-wrap'. It is recommended to load style/prosemirror.css from the prosemirror-view package.");
		cssCheckWarned = true;
	}
}
function rangeToSelectionRange(view, range) {
	let anchorNode = range.startContainer,
		anchorOffset = range.startOffset;
	let focusNode = range.endContainer,
		focusOffset = range.endOffset;
	let currentAnchor = view.domAtPos(view.state.selection.anchor);
	// Since such a range doesn't distinguish between anchor and head,
	// use a heuristic that flips it around if its end matches the
	// current anchor.
	if (isEquivalentPosition(currentAnchor.node, currentAnchor.offset, focusNode, focusOffset)) [anchorNode, anchorOffset, focusNode, focusOffset] = [focusNode, focusOffset, anchorNode, anchorOffset];
	return { anchorNode, anchorOffset, focusNode, focusOffset };
}
// Used to work around a Safari Selection/shadow DOM bug
// Based on https://github.com/codemirror/dev/issues/414 fix
function safariShadowSelectionRange(view, selection) {
	if (selection.getComposedRanges) {
		let range = selection.getComposedRanges(view.root)[0];
		if (range) return rangeToSelectionRange(view, range);
	}
	let found;
	function read(event) {
		event.preventDefault();
		event.stopImmediatePropagation();
		found = event.getTargetRanges()[0];
	}
	// Because Safari (at least in 2018-2022) doesn't provide regular
	// access to the selection inside a shadowRoot, we have to perform a
	// ridiculous hack to get at it—using `execCommand` to trigger a
	// `beforeInput` event so that we can read the target range from the
	// event.
	view.dom.addEventListener("beforeinput", read, true);
	document.execCommand("indent");
	view.dom.removeEventListener("beforeinput", read, true);
	return found ? rangeToSelectionRange(view, found) : null;
}
function blockParent(view, node) {
	for (let p = node.parentNode; p && p != view.dom; p = p.parentNode) {
		let desc = view.docView.nearestDesc(p, true);
		if (desc && desc.node.isBlock) return p;
	}
	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
// that the DOM represents. If any changes came in in the meantime,
// the modification is mapped over those before it is applied, in
// readDOMChange.
function parseBetween(view, from_, to_) {
	let { node: parent, fromOffset, toOffset, from, to } = view.docView.parseRange(from_, to_);
	let domSel = view.domSelectionRange();
	let find;
	let anchor = domSel.anchorNode;
	if (anchor && view.dom.contains(anchor.nodeType == 1 ? anchor : anchor.parentNode)) {
		find = [{ node: anchor, offset: domSel.anchorOffset }];
		if (!selectionCollapsed(domSel)) find.push({ node: domSel.focusNode, offset: domSel.focusOffset });
	}
	// Work around issue in Chrome where backspacing sometimes replaces
	// the deleted content with a random BR node (issues #799, #831)
	if (chrome && view.input.lastKeyCode === 8) {
		for (let off = toOffset; off > fromOffset; off--) {
			let node = parent.childNodes[off - 1],
				desc = node.pmViewDesc;
			if (node.nodeName == "BR" && !desc) {
				toOffset = off;
				break;
			}
			if (!desc || desc.size) break;
		}
	}
	let startDoc = view.state.doc;
	let parser = view.someProp("domParser") || DOMParser.fromSchema(view.state.schema);
	let $from = startDoc.resolve(from);
	let sel = null,
		doc = parser.parse(parent, {
			topNode: $from.parent,
			topMatch: $from.parent.contentMatchAt($from.index()),
			topOpen: true,
			from: fromOffset,
			to: toOffset,
			preserveWhitespace: $from.parent.type.whitespace == "pre" ? "full" : true,
			findPositions: find,
			ruleFromNode,
			context: $from,
		});
	if (find && find[0].pos != null) {
		let anchor = find[0].pos,
			head = find[1] && find[1].pos;
		if (head == null) head = anchor;
		sel = { anchor: anchor + from, head: head + from };
	}
	return { doc, sel, from, to };
}
function ruleFromNode(dom) {
	let desc = dom.pmViewDesc;
	if (desc) {
		return desc.parseRule();
	} else if (dom.nodeName == "BR" && dom.parentNode) {
		// Safari replaces the list item or table cell with a BR
		// directly in the list node (?!) if you delete the last
		// character in a list item or table cell (#708, #862)
		if (safari && /^(ul|ol)$/i.test(dom.parentNode.nodeName)) {
			let skip = document.createElement("div");
			skip.appendChild(document.createElement("li"));
			return { skip };
		} else if (dom.parentNode.lastChild == dom || (safari && /^(tr|table)$/i.test(dom.parentNode.nodeName))) {
			return { ignore: true };
		}
	} else if (dom.nodeName == "IMG" && dom.getAttribute("mark-placeholder")) {
		return { ignore: true };
	}
	return null;
}
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;
	if (from < 0) {
		let origin = view.input.lastSelectionTime > Date.now() - 50 ? view.input.lastSelectionOrigin : null;
		let newSel = selectionFromDOM(view, origin);
		if (newSel && !view.state.selection.eq(newSel)) {
			if (chrome && android && view.input.lastKeyCode === 13 && Date.now() - 100 < view.input.lastKeyCodeTime && view.someProp("handleKeyDown", (f) => f(view, keyEvent(13, "Enter")))) return;
			let tr = view.state.tr.setSelection(newSel);
			if (origin == "pointer") tr.setMeta("pointer", true);
			else if (origin == "key") tr.scrollIntoView();
			if (compositionID) tr.setMeta("composition", compositionID);
			view.dispatch(tr);
		}
		return;
	}
	let $before = view.state.doc.resolve(from);
	let shared = $before.sharedDepth(to);
	from = $before.before(shared + 1);
	to = view.state.doc.resolve(to).after(shared + 1);
	let sel = view.state.selection;
	let parse = parseBetween(view, from, to);
	let doc = view.state.doc,
		compare = doc.slice(parse.from, parse.to);
	let preferredPos, preferredSide;
	// Prefer anchoring to end when Backspace is pressed
	if (view.input.lastKeyCode === 8 && Date.now() - 100 < view.input.lastKeyCodeTime) {
		preferredPos = view.state.selection.to;
		preferredSide = "end";
	} else {
		preferredPos = view.state.selection.from;
		preferredSide = "start";
	}
	view.input.lastKeyCode = null;
	let change = findDiff(compare.content, parse.doc.content, parse.from, preferredPos, preferredSide);
	if (change) view.input.domChangeCount++;
	if (
		((ios && view.input.lastIOSEnter > Date.now() - 225) || android) &&
		addedNodes.some((n) => n.nodeType == 1 && !isInline.test(n.nodeName)) &&
		(!change || change.endA >= change.endB) &&
		view.someProp("handleKeyDown", (f) => f(view, keyEvent(13, "Enter")))
	) {
		view.input.lastIOSEnter = 0;
		return;
	}
	if (!change) {
		if (typeOver && sel instanceof TextSelection && !sel.empty && sel.$head.sameParent(sel.$anchor) && !view.composing && !(parse.sel && parse.sel.anchor != parse.sel.head)) {
			change = { start: sel.from, endA: sel.to, endB: sel.to };
		} else {
			if (parse.sel) {
				let sel = resolveSelection(view, view.state.doc, parse.sel);
				if (sel && !sel.eq(view.state.selection)) {
					let tr = view.state.tr.setSelection(sel);
					if (compositionID) tr.setMeta("composition", compositionID);
					view.dispatch(tr);
				}
			}
			return;
		}
	}
	// Handle the case where overwriting a selection by typing matches
	// the start or end of the selected content, creating a change
	// that's smaller than what was actually overwritten.
	if (view.state.selection.from < view.state.selection.to && change.start == change.endB && view.state.selection instanceof TextSelection) {
		if (change.start > view.state.selection.from && change.start <= view.state.selection.from + 2 && view.state.selection.from >= parse.from) {
			change.start = view.state.selection.from;
		} else if (change.endA < view.state.selection.to && change.endA >= view.state.selection.to - 2 && view.state.selection.to <= parse.to) {
			change.endB += view.state.selection.to - change.endA;
			change.endA = view.state.selection.to;
		}
	}
	// IE11 will insert a non-breaking space _ahead_ of the space after
	// the cursor space when adding a space before another space. When
	// that happened, adjust the change to cover the space instead.
	if (
		ie$1 &&
		ie_version <= 11 &&
		change.endB == change.start + 1 &&
		change.endA == change.start &&
		change.start > parse.from &&
		parse.doc.textBetween(change.start - parse.from - 1, change.start - parse.from + 1) == " \u00a0"
	) {
		change.start--;
		change.endA--;
		change.endB--;
	}
	let $from = parse.doc.resolveNoCache(change.start - parse.from);
	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;
	// 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) || !$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;
	}
	// Same for backspace
	if (view.state.selection.anchor > change.start && looksLikeBackspace(doc, change.start, change.endA, $from, $to) && view.someProp("handleKeyDown", (f) => f(view, keyEvent(8, "Backspace")))) {
		if (android && chrome) view.domObserver.suppressSelectionUpdates(); // #820
		return;
	}
	// Chrome will occasionally, during composition, delete the
	// entire composition and then immediately insert it again. This is
	// used to detect that situation.
	if (chrome && change.endB == change.start) view.input.lastChromeDelete = Date.now();
	// This tries to detect Android virtual keyboard
	// enter-and-pick-suggestion action. That sometimes (see issue
	// #1059) first fires a DOM mutation, before moving the selection to
	// the newly created block. And then, because ProseMirror cleans up
	// the DOM selection, it gives up moving the selection entirely,
	// leaving the cursor in the wrong place. When that happens, we drop
	// the new paragraph from the initial change, and fire a simulated
	// enter key afterwards.
	if (
		android &&
		!inlineChange &&
		$from.start() != $to.start() &&
		$to.parentOffset == 0 &&
		$from.depth == $to.depth &&
		parse.sel &&
		parse.sel.anchor == parse.sel.head &&
		parse.sel.head == change.endA
	) {
		change.endB -= 2;
		$to = parse.doc.resolveNoCache(change.endB - parse.from);
		setTimeout(() => {
			view.someProp("handleKeyDown", function (f) {
				return f(view, keyEvent(13, "Enter"));
			});
		}, 20);
	}
	let chFrom = change.start,
		chTo = change.endA;
	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
			// backspacing out the first element in a textblock
			if (ie$1 && ie_version <= 11 && $from.parentOffset == 0) {
				view.domObserver.suppressSelectionUpdates();
				setTimeout(() => selectionToDOM(view), 20);
			}
			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())))
		) {
			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);
			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) return null;
	return selectionBetween(view, doc.resolve(parsedSel.anchor), doc.resolve(parsedSel.head));
}
// Given two same-length, non-empty fragments of inline content,
// determine whether the first could be created from the second by
// removing or adding a single mark type.
function isMarkChange(cur, prev) {
	let curMarks = cur.firstChild.marks,
		prevMarks = prev.firstChild.marks;
	let added = curMarks,
		removed = prevMarks,
		type,
		mark,
		update;
	for (let i = 0; i < prevMarks.length; i++) added = prevMarks[i].removeFromSet(added);
	for (let i = 0; i < curMarks.length; i++) removed = curMarks[i].removeFromSet(removed);
	if (added.length == 1 && removed.length == 0) {
		mark = added[0];
		type = "add";
		update = (node) => node.mark(mark.addToSet(node.marks));
	} else if (added.length == 0 && removed.length == 1) {
		mark = removed[0];
		type = "remove";
		update = (node) => node.mark(mark.removeFromSet(node.marks));
	} else {
		return null;
	}
	let updated = [];
	for (let i = 0; i < prev.childCount; i++) updated.push(update(prev.child(i)));
	if (Fragment.from(updated).eq(cur)) return { mark, type };
}
function looksLikeBackspace(old, start, end, $newStart, $newEnd) {
	if (
		// The content must have shrunk
		end - start <= $newEnd.pos - $newStart.pos ||
		// newEnd must point directly at or after the end of the block that newStart points into
		skipClosingAndOpening($newStart, true, false) < $newEnd.pos
	)
		return false;
	let $start = old.resolve(start);
	// Handle the case where, rather than joining blocks, the change just removed an entire block
	if (!$newStart.parent.isTextblock) {
		let after = $start.nodeAfter;
		return after != null && end == start + after.nodeSize;
	}
	// Start must be at the end of a block
	if ($start.parentOffset < $start.parent.content.size || !$start.parent.isTextblock) return false;
	let $next = old.resolve(skipClosingAndOpening($start, true, true));
	// The next textblock must start before end and end near it
	if (!$next.parent.isTextblock || $next.pos > end || skipClosingAndOpening($next, true, false) < end) return false;
	// The fragments after the join point must match
	return $newStart.parent.content.cut($newStart.parentOffset).eq($next.parent.content);
}
function skipClosingAndOpening($pos, fromEnd, mayOpen) {
	let depth = $pos.depth,
		end = fromEnd ? $pos.end() : $pos.pos;
	while (depth > 0 && (fromEnd || $pos.indexAfter(depth) == $pos.node(depth).childCount)) {
		depth--;
		end++;
		fromEnd = false;
	}
	if (mayOpen) {
		let next = $pos.node(depth).maybeChild($pos.indexAfter(depth));
		while (next && !next.isLeaf) {
			next = next.firstChild;
			end++;
		}
	}
	return end;
}
function findDiff(a, b, pos, preferredPos, preferredSide) {
	let start = a.findDiffStart(b, pos),
		lenA = pos + a.size,
		lenB = pos + b.size;
	if (start == null) return null;
	let { a: endA, b: endB } = a.findDiffEnd(b, lenA, lenB);
	if (preferredSide == "end") {
		let adjust = Math.max(0, start - Math.min(endA, endB));
		preferredPos -= endA + adjust - start;
	}
	if (endA < start && lenA < lenB) {
		let move = preferredPos <= start && preferredPos >= endA ? start - preferredPos : 0;
		start -= move;
		endB = start + (endB - endA);
		endA = start;
	} else if (endB < start) {
		let move = preferredPos <= start && preferredPos >= endB ? start - preferredPos : 0;
		start -= move;
		endA = start + (endA - endB);
		endB = start;
	}
	return { start, endA, endB };
}
/**
An editor view manages the DOM structure that represents an
editable document. Its state and behavior are determined by its
[props](https://prosemirror.net/docs/ref/#view.DirectEditorProps).
*/
class EditorView {
	/**
    Create a view. `place` may be a DOM node that the editor should
    be appended to, a function that will place it into the document,
    or an object whose `mount` property holds the node to use as the
    document container. If it is `null`, the editor will not be
    added to the document.
    */
	constructor(place, props) {
		this._root = null;
		/**
        @internal
        */
		this.focused = false;
		/**
        Kludge used to work around a Chrome bug @internal
        */
		this.trackWrites = null;
		this.mounted = false;
		/**
        @internal
        */
		this.markCursor = null;
		/**
        @internal
        */
		this.cursorWrapper = null;
		/**
        @internal
        */
		this.lastSelectedViewDesc = undefined;
		/**
        @internal
        */
		this.input = new InputState();
		this.prevDirectPlugins = [];
		this.pluginViews = [];
		/**
        Holds `true` when a hack node is needed in Firefox to prevent the
        [space is eaten issue](https://code.haverbeke.berlin/prosemirror/prosemirror/issues/651)
        @internal
        */
		this.requiresGeckoHackNode = false;
		/**
        When editor content is being dragged, this object contains
        information about the dragged slice and whether it is being
        copied or moved. At any other time, it is null.
        */
		this.dragging = null;
		this._props = props;
		this.state = props.state;
		this.directPlugins = props.plugins || [];
		this.directPlugins.forEach(checkStateComponent);
		this.dispatch = this.dispatch.bind(this);
		this.dom = (place && place.mount) || document.createElement("div");
		if (place) {
			if (place.appendChild) place.appendChild(this.dom);
			else if (typeof place == "function") place(this.dom);
			else if (place.mount) this.mounted = true;
		}
		this.editable = getEditable(this);
		updateCursorWrapper(this);
		this.nodeViews = buildNodeViews(this);
		this.docView = docViewDesc(this.state.doc, computeDocDeco(this), viewDecorations(this), this.dom, this);
		this.domObserver = new DOMObserver(this, (from, to, typeOver, added) => readDOMChange(this, from, to, typeOver, added));
		this.domObserver.start();
		initInput(this);
		this.updatePluginViews();
	}
	/**
    Holds `true` when a
    [composition](https://w3c.github.io/uievents/#events-compositionevents)
    is active.
    */
	get composing() {
		return this.input.composing;
	}
	/**
    The view's current [props](https://prosemirror.net/docs/ref/#view.EditorProps).
    */
	get props() {
		if (this._props.state != this.state) {
			let prev = this._props;
			this._props = {};
			for (let name in prev) this._props[name] = prev[name];
			this._props.state = this.state;
		}
		return this._props;
	}
	/**
    Update the view's props. Will immediately cause an update to
    the DOM.
    */
	update(props) {
		if (props.handleDOMEvents != this._props.handleDOMEvents) ensureListeners(this);
		let prevProps = this._props;
		this._props = props;
		if (props.plugins) {
			props.plugins.forEach(checkStateComponent);
			this.directPlugins = props.plugins;
		}
		this.updateStateInner(props.state, prevProps);
	}
	/**
    Update the view by updating existing props object with the object
    given as argument. Equivalent to `view.update(Object.assign({},
    view.props, props))`.
    */
	setProps(props) {
		let updated = {};
		for (let name in this._props) updated[name] = this._props[name];
		updated.state = this.state;
		for (let name in props) updated[name] = props[name];
		this.update(updated);
	}
	/**
    Update the editor's `state` prop, without touching any of the
    other props.
    */
	updateState(state) {
		this.updateStateInner(state, this._props);
	}
	updateStateInner(state, prevProps) {
		var _a;
		let prev = this.state,
			redraw = false,
			updateSel = false;
		// When stored marks are added, stop composition, so that they can
		// be displayed.
		if (state.storedMarks && this.composing) {
			clearComposition(this);
			updateSel = true;
		}
		this.state = state;
		let pluginsChanged = prev.plugins != state.plugins || this._props.plugins != prevProps.plugins;
		if (pluginsChanged || this._props.plugins != prevProps.plugins || this._props.nodeViews != prevProps.nodeViews) {
			let nodeViews = buildNodeViews(this);
			if (changedNodeViews(nodeViews, this.nodeViews)) {
				this.nodeViews = nodeViews;
				redraw = true;
			}
		}
		if (pluginsChanged || prevProps.handleDOMEvents != this._props.handleDOMEvents) {
			ensureListeners(this);
		}
		this.editable = getEditable(this);
		updateCursorWrapper(this);
		let innerDeco = viewDecorations(this),
			outerDeco = computeDocDeco(this);
		let scroll =
			prev.plugins != state.plugins && !prev.doc.eq(state.doc) ? "reset"
			: state.scrollToSelection > prev.scrollToSelection ? "to selection"
			: "preserve";
		let updateDoc = redraw || !this.docView.matchesNode(state.doc, outerDeco, innerDeco);
		if (updateDoc || !state.selection.eq(prev.selection)) updateSel = true;
		let oldScrollPos = scroll == "preserve" && updateSel && this.dom.style.overflowAnchor == null && storeScrollPos(this);
		if (updateSel) {
			this.domObserver.stop();
			// Work around an issue in Chrome, IE, and Edge where changing
			// the DOM around an active selection puts it into a broken
			// state where the thing the user sees differs from the
			// selection reported by the Selection object (#710, #973,
			// #1011, #1013, #1035).
			let forceSelUpdate = updateDoc && (ie$1 || chrome) && !this.composing && !prev.selection.empty && !state.selection.empty && selectionContextChanged(prev.selection, state.selection);
			if (updateDoc) {
				// If the node that the selection points into is written to,
				// Chrome sometimes starts misreporting the selection, so this
				// tracks that and forces a selection reset when our update
				// did write to the node.
				let chromeKludge = chrome ? (this.trackWrites = this.domSelectionRange().focusNode) : null;
				if (this.composing) this.input.compositionNode = findCompositionNode(this);
				if (redraw || !this.docView.update(state.doc, outerDeco, innerDeco, this)) {
					this.docView.updateOuterDeco(outerDeco);
					this.docView.destroy();
					this.docView = docViewDesc(state.doc, outerDeco, innerDeco, this.dom, this);
				}
				if (chromeKludge && (!this.trackWrites || !this.dom.contains(this.trackWrites))) forceSelUpdate = true;
			}
			// Work around for an issue where an update arriving right between
			// a DOM selection change and the "selectionchange" event for it
			// can cause a spurious DOM selection update, disrupting mouse
			// drag selection.
			let mouseDown = this.input.mouseDown;
			if (forceSelUpdate || !(mouseDown && this.domObserver.currentSelection.eq(this.domSelectionRange()) && anchorInRightPlace(this) && mouseDown.delaySelUpdate())) {
				selectionToDOM(this, forceSelUpdate);
			} else {
				syncNodeSelection(this, state.selection);
				this.domObserver.setCurSelection();
			}
			this.domObserver.start();
		}
		this.updatePluginViews(prev);
		if (((_a = this.dragging) === null || _a === void 0 ? void 0 : _a.node) && !prev.doc.eq(state.doc)) this.updateDraggedNode(this.dragging, prev);
		if (scroll == "reset") {
			this.dom.scrollTop = 0;
		} else if (scroll == "to selection") {
			this.scrollToSelection();
		} else if (oldScrollPos) {
			resetScrollPos(oldScrollPos);
		}
	}
	/**
    @internal
    */
	scrollToSelection() {
		let startDOM = this.domSelectionRange().focusNode;
		if (!startDOM || !this.dom.contains(startDOM.nodeType == 1 ? startDOM : startDOM.parentNode));
		else if (this.someProp("handleScrollToSelection", (f) => f(this)));
		else if (this.state.selection instanceof NodeSelection) {
			let target = this.docView.domAfterPos(this.state.selection.from);
			if (target.nodeType == 1) scrollRectIntoView(this, target.getBoundingClientRect(), startDOM);
		} else {
			scrollRectIntoView(this, this.coordsAtPos(this.state.selection.head, 1), startDOM);
		}
	}
	destroyPluginViews() {
		let view;
		while ((view = this.pluginViews.pop())) if (view.destroy) view.destroy();
	}
	updatePluginViews(prevState) {
		if (!prevState || prevState.plugins != this.state.plugins || this.directPlugins != this.prevDirectPlugins) {
			this.prevDirectPlugins = this.directPlugins;
			this.destroyPluginViews();
			for (let i = 0; i < this.directPlugins.length; i++) {
				let plugin = this.directPlugins[i];
				if (plugin.spec.view) this.pluginViews.push(plugin.spec.view(this));
			}
			for (let i = 0; i < this.state.plugins.length; i++) {
				let plugin = this.state.plugins[i];
				if (plugin.spec.view) this.pluginViews.push(plugin.spec.view(this));
			}
		} else {
			for (let i = 0; i < this.pluginViews.length; i++) {
				let pluginView = this.pluginViews[i];
				if (pluginView.update) pluginView.update(this, prevState);
			}
		}
	}
	updateDraggedNode(dragging, prev) {
		let sel = dragging.node,
			found = -1;
		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 && movedPos < this.state.doc.content.size && this.state.doc.nodeAt(movedPos);
			if (moved == sel.node) found = movedPos;
		}
		this.dragging = new Dragging(dragging.slice, dragging.move, found < 0 ? undefined : NodeSelection.create(this.state.doc, found));
	}
	someProp(propName, f) {
		let prop = this._props && this._props[propName],
			value;
		if (prop != null && (value = f ? f(prop) : prop)) return value;
		for (let i = 0; i < this.directPlugins.length; i++) {
			let prop = this.directPlugins[i].props[propName];
			if (prop != null && (value = f ? f(prop) : prop)) return value;
		}
		let plugins = this.state.plugins;
		if (plugins)
			for (let i = 0; i < plugins.length; i++) {
				let prop = plugins[i].props[propName];
				if (prop != null && (value = f ? f(prop) : prop)) return value;
			}
	}
	/**
    Query whether the view has focus.
    */
	hasFocus() {
		// Work around IE not handling focus correctly if resize handles are shown.
		// If the cursor is inside an element with resize handles, activeElement
		// will be that element instead of this.dom.
		if (ie$1) {
			// If activeElement is within this.dom, and there are no other elements
			// setting `contenteditable` to false in between, treat it as focused.
			let node = this.root.activeElement;
			if (node == this.dom) return true;
			if (!node || !this.dom.contains(node)) return false;
			while (node && this.dom != node && this.dom.contains(node)) {
				if (node.contentEditable == "false") return false;
				node = node.parentElement;
			}
			return true;
		}
		return this.root.activeElement == this.dom;
	}
	/**
    Focus the editor.
    */
	focus() {
		this.domObserver.stop();
		if (this.editable) focusPreventScroll(this.dom);
		selectionToDOM(this);
		this.domObserver.start();
	}
	/**
    Get the document root in which the editor exists. This will
    usually be the top-level `document`, but might be a [shadow
    DOM](https://developer.mozilla.org/en-US/docs/Web/Web_Components/Shadow_DOM)
    root if the editor is inside one.
    */
	get root() {
		let cached = this._root;
		if (cached == null)
			for (let search = this.dom.parentNode; search; search = search.parentNode) {
				if (search.nodeType == 9 || (search.nodeType == 11 && search.host)) {
					if (!search.getSelection) Object.getPrototypeOf(search).getSelection = () => search.ownerDocument.getSelection();
					return (this._root = search);
				}
			}
		return cached || document;
	}
	/**
    When an existing editor view is moved to a new document or
    shadow tree, call this to make it recompute its root.
    */
	updateRoot() {
		this._root = null;
	}
	/**
    Given a pair of viewport coordinates, return the document
    position that corresponds to them. May return null if the given
    coordinates aren't inside of the editor. When an object is
    returned, its `pos` property is the position nearest to the
    coordinates, and its `inside` property holds the position of the
    inner node that the position falls inside of, or -1 if it is at
    the top level, not in any node.
    */
	posAtCoords(coords) {
		return posAtCoords(this, coords);
	}
	/**
    Returns the viewport rectangle at a given document position.
    `left` and `right` will be the same number, as this returns a
    flat cursor-ish rectangle. If the position is between two things
    that aren't directly adjacent, `side` determines which element
    is used. When < 0, the element before the position is used,
    otherwise the element after.
    */
	coordsAtPos(pos, side = 1) {
		return coordsAtPos(this, pos, side);
	}
	/**
    Find the DOM position that corresponds to the given document
    position. When `side` is negative, find the position as close as
    possible to the content before the position. When positive,
    prefer positions close to the content after the position. When
    zero, prefer as shallow a position as possible.
    
    Note that you should **not** mutate the editor's internal DOM,
    only inspect it (and even that is usually not necessary).
    */
	domAtPos(pos, side = 0) {
		return this.docView.domFromPos(pos, side);
	}
	/**
    Find the DOM node that represents the document node after the
    given position. May return `null` when the position doesn't point
    in front of a node or if the node is inside an opaque node view.
    
    This is intended to be able to call things like
    `getBoundingClientRect` on that DOM node. Do **not** mutate the
    editor DOM directly, or add styling this way, since that will be
    immediately overriden by the editor as it redraws the node.
    */
	nodeDOM(pos) {
		let desc = this.docView.descAt(pos);
		return desc ? desc.nodeDOM : null;
	}
	/**
    Find the document position that corresponds to a given DOM
    position. (Whenever possible, it is preferable to inspect the
    document structure directly, rather than poking around in the
    DOM, but sometimes—for example when interpreting an event
    target—you don't have a choice.)
    
    The `bias` parameter can be used to influence which side of a DOM
    node to use when the position is inside a leaf node.
    */
	posAtDOM(node, offset, bias = -1) {
		let pos = this.docView.posFromDOM(node, offset, bias);
		if (pos == null) throw new RangeError("DOM position not inside the editor");
		return pos;
	}
	/**
    Find out whether the selection is at the end of a textblock when
    moving in a given direction. When, for example, given `"left"`,
    it will return true if moving left from the current cursor
    position would leave that position's parent textblock. Will apply
    to the view's current state by default, but it is possible to
    pass a different state.
    */
	endOfTextblock(dir, state) {
		return endOfTextblock(this, state || this.state, dir);
	}
	/**
    Run the editor's paste logic with the given HTML string. The
    `event`, if given, will be passed to the
    [`handlePaste`](https://prosemirror.net/docs/ref/#view.EditorProps.handlePaste) hook.
    */
	pasteHTML(html, event) {
		return doPaste(this, "", html, false, event || new ClipboardEvent("paste"));
	}
	/**
    Run the editor's paste logic with the given plain-text input.
    */
	pasteText(text, event) {
		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).
    */
	destroy() {
		if (!this.docView) return;
		destroyInput(this);
		this.destroyPluginViews();
		if (this.mounted) {
			this.docView.update(this.state.doc, [], viewDecorations(this), this);
			this.dom.textContent = "";
		} else if (this.dom.parentNode) {
			this.dom.parentNode.removeChild(this.dom);
		}
		this.docView.destroy();
		this.docView = null;
		clearReusedRange();
	}
	/**
    This is true when the view has been
    [destroyed](https://prosemirror.net/docs/ref/#view.EditorView.destroy) (and thus should not be
    used anymore).
    */
	get isDestroyed() {
		return this.docView == null;
	}
	/**
    Used for testing.
    */
	dispatchEvent(event) {
		return dispatchEvent(this, event);
	}
	/**
    @internal
    */
	domSelectionRange() {
		let sel = this.domSelection();
		if (!sel) return { focusNode: null, focusOffset: 0, anchorNode: null, anchorOffset: 0 };
		return (safari && this.root.nodeType === 11 && deepActiveElement(this.dom.ownerDocument) == this.dom && safariShadowSelectionRange(this, sel)) || sel;
	}
	/**
    @internal
    */
	domSelection() {
		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";
	attrs.contenteditable = String(view.editable);
	view.someProp("attributes", (value) => {
		if (typeof value == "function") value = value(view.state);
		if (value)
			for (let attr in value) {
				if (attr == "class") attrs.class += " " + value[attr];
				else if (attr == "style") attrs.style = (attrs.style ? attrs.style + ";" : "") + value[attr];
				else if (!attrs[attr] && attr != "contenteditable" && attr != "nodeName") attrs[attr] = String(value[attr]);
			}
	});
	if (!attrs.translate) attrs.translate = "no";
	return [Decoration.node(0, view.state.doc.content.size, attrs)];
}
function updateCursorWrapper(view) {
	if (view.markCursor) {
		let dom = document.createElement("img");
		dom.className = "ProseMirror-separator";
		dom.setAttribute("mark-placeholder", "true");
		dom.setAttribute("alt", "");
		view.cursorWrapper = { dom, deco: Decoration.widget(view.state.selection.from, dom, { raw: true, marks: view.markCursor }) };
	} else {
		view.cursorWrapper = null;
	}
}
function getEditable(view) {
	return !view.someProp("editable", (value) => value(view.state) === false);
}
function selectionContextChanged(sel1, sel2) {
	let depth = Math.min(sel1.$anchor.sharedDepth(sel1.head), sel2.$anchor.sharedDepth(sel2.head));
	return sel1.$anchor.start(depth) != sel2.$anchor.start(depth);
}
function buildNodeViews(view) {
	let result = Object.create(null);
	function add(obj) {
		for (let prop in obj) if (!Object.prototype.hasOwnProperty.call(result, prop)) result[prop] = obj[prop];
	}
	view.someProp("nodeViews", add);
	view.someProp("markViews", add);
	return result;
}
function changedNodeViews(a, b) {
	let nA = 0,
		nB = 0;
	for (let prop in a) {
		if (a[prop] != b[prop]) return true;
		nA++;
	}
	for (let _ in b) nB++;
	return nA != nB;
}
function checkStateComponent(plugin) {
	if (plugin.spec.state || plugin.spec.filterTransaction || plugin.spec.appendTransaction) throw new RangeError("Plugins passed directly to the view must not have a state component");
}

var base = {
	8: "Backspace",
	9: "Tab",
	10: "Enter",
	12: "NumLock",
	13: "Enter",
	16: "Shift",
	17: "Control",
	18: "Alt",
	20: "CapsLock",
	27: "Escape",
	32: " ",
	33: "PageUp",
	34: "PageDown",
	35: "End",
	36: "Home",
	37: "ArrowLeft",
	38: "ArrowUp",
	39: "ArrowRight",
	40: "ArrowDown",
	44: "PrintScreen",
	45: "Insert",
	46: "Delete",
	59: ";",
	61: "=",
	91: "Meta",
	92: "Meta",
	106: "*",
	107: "+",
	108: ",",
	109: "-",
	110: ".",
	111: "/",
	144: "NumLock",
	145: "ScrollLock",
	160: "Shift",
	161: "Shift",
	162: "Control",
	163: "Control",
	164: "Alt",
	165: "Alt",
	173: "-",
	186: ";",
	187: "=",
	188: ",",
	189: "-",
	190: ".",
	191: "/",
	192: "`",
	219: "[",
	220: "\\",
	221: "]",
	222: "'",
};

var shift = {
	48: ")",
	49: "!",
	50: "@",
	51: "#",
	52: "$",
	53: "%",
	54: "^",
	55: "&",
	56: "*",
	57: "(",
	59: ":",
	61: "+",
	173: "_",
	186: ":",
	187: "+",
	188: "<",
	189: "_",
	190: ">",
	191: "?",
	192: "~",
	219: "{",
	220: "|",
	221: "}",
	222: '"',
};

var mac$1 = typeof navigator != "undefined" && /Mac/.test(navigator.platform);
var ie = typeof navigator != "undefined" && /MSIE \d|Trident\/(?:[7-9]|\d{2,})\..*rv:(\d+)/.exec(navigator.userAgent);

// Fill in the digit keys
for (var i = 0; i < 10; i++) base[48 + i] = base[96 + i] = String(i);

// The function keys
for (var i = 1; i <= 24; i++) base[i + 111] = "F" + i;

// And the alphabetic keys
for (var i = 65; i <= 90; i++) {
	base[i] = String.fromCharCode(i + 32);
	shift[i] = String.fromCharCode(i);
}

// For each code that doesn't have a shift-equivalent, copy the base name
for (var code in base) if (!shift.hasOwnProperty(code)) shift[code] = base[code];

function keyName(event) {
	// On macOS, keys held with Shift and Cmd don't reflect the effect of Shift in `.key`.
	// On IE, shift effect is never included in `.key`.
	var ignoreKey = (mac$1 && event.metaKey && event.shiftKey && !event.ctrlKey && !event.altKey) || (ie && event.shiftKey && event.key && event.key.length == 1) || event.key == "Unidentified";
	var name = (!ignoreKey && event.key) || (event.shiftKey ? shift : base)[event.keyCode] || event.key || "Unidentified";
	// Edge sometimes produces wrong names (Issue #3)
	if (name == "Esc") name = "Escape";
	if (name == "Del") name = "Delete";
	// https://developer.microsoft.com/en-us/microsoft-edge/platform/issues/8860571/
	if (name == "Left") name = "ArrowLeft";
	if (name == "Up") name = "ArrowUp";
	if (name == "Right") name = "ArrowRight";
	if (name == "Down") name = "ArrowDown";
	return name;
}

const mac = typeof navigator != "undefined" && /Mac|iP(hone|[oa]d)/.test(navigator.platform);
const windows = typeof navigator != "undefined" && /Win/.test(navigator.platform);
function normalizeKeyName$1(name) {
	let parts = name.split(/-(?!$)/),
		result = parts[parts.length - 1];
	if (result == "Space") result = " ";
	let alt, ctrl, shift, meta;
	for (let i = 0; i < parts.length - 1; i++) {
		let mod = parts[i];
		if (/^(cmd|meta|m)$/i.test(mod)) meta = true;
		else if (/^a(lt)?$/i.test(mod)) alt = true;
		else if (/^(c|ctrl|control)$/i.test(mod)) ctrl = true;
		else if (/^s(hift)?$/i.test(mod)) shift = true;
		else if (/^mod$/i.test(mod)) {
			if (mac) meta = true;
			else ctrl = true;
		} else throw new Error("Unrecognized modifier name: " + mod);
	}
	if (alt) result = "Alt-" + result;
	if (ctrl) result = "Ctrl-" + result;
	if (meta) result = "Meta-" + result;
	if (shift) result = "Shift-" + result;
	return result;
}
function normalize(map) {
	let copy = Object.create(null);
	for (let prop in map) copy[normalizeKeyName$1(prop)] = map[prop];
	return copy;
}
function modifiers(name, event, shift = true) {
	if (event.altKey) name = "Alt-" + name;
	if (event.ctrlKey) name = "Ctrl-" + name;
	if (event.metaKey) name = "Meta-" + name;
	if (shift && event.shiftKey) name = "Shift-" + name;
	return name;
}
/**
Create a keymap plugin for the given set of bindings.

Bindings should map key names to [command](https://prosemirror.net/docs/ref/#commands)-style
functions, which will be called with `(EditorState, dispatch,
EditorView)` arguments, and should return true when they've handled
the key. Note that the view argument isn't part of the command
protocol, but can be used as an escape hatch if a binding needs to
directly interact with the UI.

Key names may be strings like `"Shift-Ctrl-Enter"`—a key
identifier prefixed with zero or more modifiers. Key identifiers
are based on the strings that can appear in
[`KeyEvent.key`](https:developer.mozilla.org/en-US/docs/Web/API/KeyboardEvent/key).
Use lowercase letters to refer to letter keys (or uppercase letters
if you want shift to be held). You may use `"Space"` as an alias
for the `" "` name.

Modifiers can be given in any order. `Shift-` (or `s-`), `Alt-` (or
`a-`), `Ctrl-` (or `c-` or `Control-`) and `Cmd-` (or `m-` or
`Meta-`) are recognized. For characters that are created by holding
shift, the `Shift-` prefix is implied, and should not be added
explicitly.

You can use `Mod-` as a shorthand for `Cmd-` on Mac and `Ctrl-` on
other platforms.

You can add multiple keymap plugins to an editor. The order in
which they appear determines their precedence (the ones early in
the array get to dispatch first).
*/
function keymap(bindings) {
	return new Plugin({ props: { handleKeyDown: keydownHandler(bindings) } });
}
/**
Given a set of bindings (using the same format as
[`keymap`](https://prosemirror.net/docs/ref/#keymap.keymap)), return a [keydown
handler](https://prosemirror.net/docs/ref/#view.EditorProps.handleKeyDown) that handles them.
*/
function keydownHandler(bindings) {
	let map = normalize(bindings);
	return function (view, event) {
		let name = keyName(event),
			baseName,
			direct = map[modifiers(name, event)];
		if (direct && direct(view.state, view.dispatch, view)) return true;
		// A character key
		if (name.length == 1 && name != " ") {
			if (event.shiftKey) {
				// In case the name was already modified by shift, try looking
				// it up without its shift modifier
				let noShift = map[modifiers(name, event, false)];
				if (noShift && noShift(view.state, view.dispatch, view)) return true;
			}
			if (
				(event.altKey || event.metaKey || event.ctrlKey) &&
				// Ctrl-Alt may be used for AltGr on Windows
				!(windows && event.ctrlKey && event.altKey) &&
				(baseName = base[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, #1529.
				let fromCode = map[modifiers(baseName, event)];
				if (fromCode && fromCode(view.state, view.dispatch, view)) return true;
			}
		}
		return false;
	};
}

var __defProp = Object.defineProperty;
var __export = (target, all) => {
	for (var name in all) __defProp(target, name, { get: all[name], enumerable: true });
};

// src/helpers/createChainableState.ts
function createChainableState(config) {
	const { state, transaction } = config;
	let { selection } = transaction;
	let { doc } = transaction;
	let { storedMarks } = transaction;
	return {
		...state,
		apply: state.apply.bind(state),
		applyTransaction: state.applyTransaction.bind(state),
		plugins: state.plugins,
		schema: state.schema,
		reconfigure: state.reconfigure.bind(state),
		toJSON: state.toJSON.bind(state),
		get storedMarks() {
			return storedMarks;
		},
		get selection() {
			return selection;
		},
		get doc() {
			return doc;
		},
		get tr() {
			selection = transaction.selection;
			doc = transaction.doc;
			storedMarks = transaction.storedMarks;
			return transaction;
		},
	};
}

// src/CommandManager.ts
var CommandManager = class {
	constructor(props) {
		this.editor = props.editor;
		this.rawCommands = this.editor.extensionManager.commands;
		this.customState = props.state;
	}
	get hasCustomState() {
		return !!this.customState;
	}
	get state() {
		return this.customState || this.editor.state;
	}
	get commands() {
		const { rawCommands, editor, state } = this;
		const { view } = editor;
		const { tr } = state;
		const props = this.buildProps(tr);
		return Object.fromEntries(
			Object.entries(rawCommands).map(([name, command2]) => {
				const method = (...args) => {
					const callback = command2(...args)(props);
					if (!tr.getMeta("preventDispatch") && !this.hasCustomState) {
						view.dispatch(tr);
					}
					return callback;
				};
				return [name, method];
			}),
		);
	}
	get chain() {
		return () => this.createChain();
	}
	get can() {
		return () => this.createCan();
	}
	createChain(startTr, shouldDispatch = true) {
		const { rawCommands, editor, state } = this;
		const { view } = editor;
		const callbacks = [];
		const hasStartTransaction = !!startTr;
		const tr = startTr || state.tr;
		const run3 = () => {
			if (!hasStartTransaction && shouldDispatch && !tr.getMeta("preventDispatch") && !this.hasCustomState) {
				view.dispatch(tr);
			}
			return callbacks.every((callback) => callback === true);
		};
		const chain = {
			...Object.fromEntries(
				Object.entries(rawCommands).map(([name, command2]) => {
					const chainedCommand = (...args) => {
						const props = this.buildProps(tr, shouldDispatch);
						const callback = command2(...args)(props);
						callbacks.push(callback);
						return chain;
					};
					return [name, chainedCommand];
				}),
			),
			run: run3,
		};
		return chain;
	}
	createCan(startTr) {
		const { rawCommands, state } = this;
		const dispatch = false;
		const tr = startTr || state.tr;
		const props = this.buildProps(tr, dispatch);
		const formattedCommands = Object.fromEntries(
			Object.entries(rawCommands).map(([name, command2]) => {
				return [name, (...args) => command2(...args)({ ...props, dispatch: void 0 })];
			}),
		);
		return {
			...formattedCommands,
			chain: () => this.createChain(tr, dispatch),
		};
	}
	buildProps(tr, shouldDispatch = true) {
		const { rawCommands, editor, state } = this;
		const { view } = editor;
		const props = {
			tr,
			editor,
			view,
			state: createChainableState({
				state,
				transaction: tr,
			}),
			dispatch: shouldDispatch ? () => void 0 : void 0,
			chain: () => this.createChain(tr, shouldDispatch),
			can: () => this.createCan(tr),
			get commands() {
				return Object.fromEntries(
					Object.entries(rawCommands).map(([name, command2]) => {
						return [name, (...args) => command2(...args)(props)];
					}),
				);
			},
		};
		return props;
	}
};

// src/commands/index.ts
var commands_exports = {};
__export(commands_exports, {
	blur: () => blur,
	clearContent: () => clearContent,
	clearNodes: () => clearNodes,
	command: () => command,
	createParagraphNear: () => createParagraphNear,
	cut: () => cut,
	deleteCurrentNode: () => deleteCurrentNode,
	deleteNode: () => deleteNode,
	deleteRange: () => deleteRange,
	deleteSelection: () => deleteSelection,
	enter: () => enter,
	exitCode: () => exitCode,
	extendMarkRange: () => extendMarkRange,
	first: () => first,
	focus: () => focus,
	forEach: () => forEach,
	insertContent: () => insertContent,
	insertContentAt: () => insertContentAt,
	joinBackward: () => joinBackward,
	joinDown: () => joinDown,
	joinForward: () => joinForward,
	joinItemBackward: () => joinItemBackward,
	joinItemForward: () => joinItemForward,
	joinTextblockBackward: () => joinTextblockBackward,
	joinTextblockForward: () => joinTextblockForward,
	joinUp: () => joinUp,
	keyboardShortcut: () => keyboardShortcut,
	lift: () => lift,
	liftEmptyBlock: () => liftEmptyBlock,
	liftListItem: () => liftListItem,
	newlineInCode: () => newlineInCode,
	resetAttributes: () => resetAttributes,
	scrollIntoView: () => scrollIntoView,
	selectAll: () => selectAll,
	selectNodeBackward: () => selectNodeBackward,
	selectNodeForward: () => selectNodeForward,
	selectParentNode: () => selectParentNode,
	selectTextblockEnd: () => selectTextblockEnd,
	selectTextblockStart: () => selectTextblockStart,
	setContent: () => setContent,
	setMark: () => setMark,
	setMeta: () => setMeta,
	setNode: () => setNode,
	setNodeSelection: () => setNodeSelection,
	setTextDirection: () => setTextDirection,
	setTextSelection: () => setTextSelection,
	sinkListItem: () => sinkListItem,
	splitBlock: () => splitBlock,
	splitListItem: () => splitListItem,
	toggleList: () => toggleList,
	toggleMark: () => toggleMark,
	toggleNode: () => toggleNode,
	toggleWrap: () => toggleWrap,
	undoInputRule: () => undoInputRule,
	unsetAllMarks: () => unsetAllMarks,
	unsetMark: () => unsetMark,
	unsetTextDirection: () => unsetTextDirection,
	updateAttributes: () => updateAttributes,
	wrapIn: () => wrapIn,
	wrapInList: () => wrapInList,
});

// src/commands/blur.ts
var blur =
	() =>
	({ editor, view }) => {
		requestAnimationFrame(() => {
			var _a;
			if (!editor.isDestroyed) {
				view.dom.blur();
				(_a = window == null ? void 0 : window.getSelection()) == null ? void 0 : _a.removeAllRanges();
			}
		});
		return true;
	};

// src/commands/clearContent.ts
var clearContent =
	(emitUpdate = true) =>
	({ commands }) => {
		return commands.setContent("", { emitUpdate });
	};
var clearNodes =
	() =>
	({ state, tr, dispatch }) => {
		const { selection } = tr;
		const { ranges } = selection;
		if (!dispatch) {
			return true;
		}
		ranges.forEach(({ $from, $to }) => {
			state.doc.nodesBetween($from.pos, $to.pos, (node, pos) => {
				if (node.type.isText) {
					return;
				}
				const { doc, mapping } = tr;
				const $mappedFrom = doc.resolve(mapping.map(pos));
				const $mappedTo = doc.resolve(mapping.map(pos + node.nodeSize));
				const nodeRange = $mappedFrom.blockRange($mappedTo);
				if (!nodeRange) {
					return;
				}
				const targetLiftDepth = liftTarget(nodeRange);
				if (node.type.isTextblock) {
					const { defaultType } = $mappedFrom.parent.contentMatchAt($mappedFrom.index());
					tr.setNodeMarkup(nodeRange.start, defaultType);
				}
				if (targetLiftDepth || targetLiftDepth === 0) {
					tr.lift(nodeRange, targetLiftDepth);
				}
			});
		});
		return true;
	};

// src/commands/command.ts
var command = (fn) => (props) => {
	return fn(props);
};
var createParagraphNear =
	() =>
	({ state, dispatch }) => {
		return createParagraphNear$1(state, dispatch);
	};
var cut =
	(originRange, targetPos) =>
	({ editor, tr }) => {
		const { state } = editor;
		const contentSlice = state.doc.slice(originRange.from, originRange.to);
		tr.deleteRange(originRange.from, originRange.to);
		const newPos = tr.mapping.map(targetPos);
		tr.insert(newPos, contentSlice.content);
		tr.setSelection(new TextSelection(tr.doc.resolve(Math.max(newPos - 1, 0))));
		return true;
	};

// src/commands/deleteCurrentNode.ts
var deleteCurrentNode =
	() =>
	({ tr, dispatch }) => {
		const { selection } = tr;
		const currentNode = selection.$anchor.node();
		if (currentNode.content.size > 0) {
			return false;
		}
		const $pos = tr.selection.$anchor;
		for (let depth = $pos.depth; depth > 0; depth -= 1) {
			const node = $pos.node(depth);
			if (node.type === currentNode.type) {
				if (dispatch) {
					const from = $pos.before(depth);
					const to = $pos.after(depth);
					tr.delete(from, to).scrollIntoView();
				}
				return true;
			}
		}
		return false;
	};

// src/helpers/getNodeType.ts
function getNodeType(nameOrType, schema) {
	if (typeof nameOrType === "string") {
		if (!schema.nodes[nameOrType]) {
			throw Error(`There is no node type named '${nameOrType}'. Maybe you forgot to add the extension?`);
		}
		return schema.nodes[nameOrType];
	}
	return nameOrType;
}

// src/commands/deleteNode.ts
var deleteNode =
	(typeOrName) =>
	({ tr, state, dispatch }) => {
		const type = getNodeType(typeOrName, state.schema);
		const $pos = tr.selection.$anchor;
		for (let depth = $pos.depth; depth > 0; depth -= 1) {
			const node = $pos.node(depth);
			if (node.type === type) {
				if (dispatch) {
					const from = $pos.before(depth);
					const to = $pos.after(depth);
					tr.delete(from, to).scrollIntoView();
				}
				return true;
			}
		}
		return false;
	};

// src/commands/deleteRange.ts
var deleteRange =
	(range) =>
	({ tr, dispatch }) => {
		const { from, to } = range;
		if (dispatch) {
			tr.delete(from, to);
		}
		return true;
	};

// src/commands/deleteSelection.ts
var hasTextContent = (nodeSpec) => {
	if (!nodeSpec.content) {
		return false;
	}
	const textRegex = /^text(\*|\+)/;
	return textRegex.test(nodeSpec.content);
};
var expandSelectionForSide = ($pos, schema, side) => {
	if (!$pos.parent.isInline) {
		return $pos.pos;
	}
	if ((side === "left" && $pos.pos > $pos.start()) || (side === "right" && $pos.pos < $pos.end())) {
		return $pos.pos;
	}
	const parentContent = schema.nodes[$pos.parent.type.name].spec;
	if (!hasTextContent(parentContent)) {
		return $pos.pos;
	}
	return side === "left" ? $pos.start() - 1 : $pos.end() + 1;
};
var expandSelectionForInlineText = ($from, $to, schema) => {
	const from = expandSelectionForSide($from, schema, "left");
	const to = expandSelectionForSide($to, schema, "right");
	return { from, to };
};
var deleteSelection =
	() =>
	({ state, dispatch }) => {
		const { $from, $to } = state.selection;
		if (state.selection.empty) {
			return false;
		}
		const { from, to } = expandSelectionForInlineText($from, $to, state.schema);
		if (dispatch) {
			state.tr.deleteRange(from, to).scrollIntoView();
			dispatch(state.tr);
		}
		return true;
	};

// src/commands/enter.ts
var enter =
	() =>
	({ commands }) => {
		return commands.keyboardShortcut("Enter");
	};
var exitCode =
	() =>
	({ state, dispatch }) => {
		return exitCode$1(state, dispatch);
	};

// src/utilities/isRegExp.ts
function isRegExp(value) {
	return Object.prototype.toString.call(value) === "[object RegExp]";
}

// src/utilities/objectIncludes.ts
function objectIncludes(object1, object2, options = { strict: true }) {
	const keys = Object.keys(object2);
	if (!keys.length) {
		return true;
	}
	return keys.every((key) => {
		if (options.strict) {
			return object2[key] === object1[key];
		}
		if (isRegExp(object2[key])) {
			return object2[key].test(object1[key]);
		}
		return object2[key] === object1[key];
	});
}

// src/helpers/getMarkRange.ts
function findMarkInSet(marks, type, attributes = {}) {
	return marks.find((item) => {
		return (
			item.type === type &&
			objectIncludes(
				// Only check equality for the attributes that are provided
				Object.fromEntries(Object.keys(attributes).map((k) => [k, item.attrs[k]])),
				attributes,
			)
		);
	});
}
function isMarkInSet(marks, type, attributes = {}) {
	return !!findMarkInSet(marks, type, attributes);
}
function getMarkRange($pos, type, attributes) {
	if (!$pos || !type) {
		return;
	}
	let start = $pos.parent.childAfter($pos.parentOffset);
	if (!start.node || !start.node.marks.some((mark2) => mark2.type === type)) {
		start = $pos.parent.childBefore($pos.parentOffset);
	}
	if (!start.node || !start.node.marks.some((mark2) => mark2.type === type)) {
		return;
	}
	if (!attributes) {
		const firstMark = start.node.marks.find((mark2) => mark2.type === type);
		if (firstMark) {
			attributes = firstMark.attrs;
		}
	}
	const mark = findMarkInSet([...start.node.marks], type, attributes);
	if (!mark) {
		return;
	}
	let startIndex = start.index;
	let startPos = $pos.start() + start.offset;
	let endIndex = startIndex + 1;
	let endPos = startPos + start.node.nodeSize;
	while (startIndex > 0 && isMarkInSet([...$pos.parent.child(startIndex - 1).marks], type, attributes)) {
		startIndex -= 1;
		startPos -= $pos.parent.child(startIndex).nodeSize;
	}
	while (endIndex < $pos.parent.childCount && isMarkInSet([...$pos.parent.child(endIndex).marks], type, attributes)) {
		endPos += $pos.parent.child(endIndex).nodeSize;
		endIndex += 1;
	}
	return {
		from: startPos,
		to: endPos,
	};
}

// src/helpers/getMarkType.ts
function getMarkType(nameOrType, schema) {
	if (typeof nameOrType === "string") {
		if (!schema.marks[nameOrType]) {
			throw Error(`There is no mark type named '${nameOrType}'. Maybe you forgot to add the extension?`);
		}
		return schema.marks[nameOrType];
	}
	return nameOrType;
}

// src/commands/extendMarkRange.ts
var extendMarkRange =
	(typeOrName, attributes) =>
	({ tr, state, dispatch }) => {
		const type = getMarkType(typeOrName, state.schema);
		const { doc, selection } = tr;
		const { $from, from, to } = selection;
		if (dispatch) {
			const range = getMarkRange($from, type, attributes);
			if (range && range.from <= from && range.to >= to) {
				const newSelection = TextSelection.create(doc, range.from, range.to);
				tr.setSelection(newSelection);
			}
		}
		return true;
	};

// src/commands/first.ts
var first = (commands) => (props) => {
	const items = typeof commands === "function" ? commands(props) : commands;
	for (let i = 0; i < items.length; i += 1) {
		if (items[i](props)) {
			return true;
		}
	}
	return false;
};
function isTextSelection(value) {
	return value instanceof TextSelection;
}

// src/utilities/minMax.ts
function minMax(value = 0, min = 0, max = 0) {
	return Math.min(Math.max(value, min), max);
}

// src/helpers/resolveFocusPosition.ts
function resolveFocusPosition(doc, position = null) {
	if (!position) {
		return null;
	}
	const selectionAtStart = Selection.atStart(doc);
	const selectionAtEnd = Selection.atEnd(doc);
	if (position === "start" || position === true) {
		return selectionAtStart;
	}
	if (position === "end") {
		return selectionAtEnd;
	}
	const minPos = selectionAtStart.from;
	const maxPos = selectionAtEnd.to;
	if (position === "all") {
		return TextSelection.create(doc, minMax(0, minPos, maxPos), minMax(doc.content.size, minPos, maxPos));
	}
	return TextSelection.create(doc, minMax(position, minPos, maxPos), minMax(position, minPos, maxPos));
}

// src/utilities/isAndroid.ts
function isAndroid() {
	return navigator.platform === "Android" || /android/i.test(navigator.userAgent);
}

// src/utilities/isiOS.ts
function isiOS() {
	return (
		["iPad Simulator", "iPhone Simulator", "iPod Simulator", "iPad", "iPhone", "iPod"].includes(navigator.platform) || // iPad on iOS 13 detection
		(navigator.userAgent.includes("Mac") && "ontouchend" in document)
	);
}

// src/utilities/isSafari.ts
function isSafari() {
	return typeof navigator !== "undefined" ? /^((?!chrome|android).)*safari/i.test(navigator.userAgent) : false;
}

// src/commands/focus.ts
var focus =
	(position = null, options = {}) =>
	({ editor, view, tr, dispatch }) => {
		options = {
			scrollIntoView: true,
			...options,
		};
		const delayedFocus = () => {
			if (isiOS() || isAndroid()) {
				view.dom.focus();
			}
			if (isSafari() && !isiOS() && !isAndroid()) {
				view.dom.focus({ preventScroll: true });
			}
			requestAnimationFrame(() => {
				if (!editor.isDestroyed) {
					view.focus();
					if (options == null ? void 0 : options.scrollIntoView) {
						editor.commands.scrollIntoView();
					}
				}
			});
		};
		try {
			if ((view.hasFocus() && position === null) || position === false) {
				return true;
			}
		} catch {
			return false;
		}
		if (dispatch && position === null && !isTextSelection(editor.state.selection)) {
			delayedFocus();
			return true;
		}
		const selection = resolveFocusPosition(tr.doc, position) || editor.state.selection;
		const isSameSelection = editor.state.selection.eq(selection);
		if (dispatch) {
			if (!isSameSelection) {
				tr.setSelection(selection);
			}
			if (isSameSelection && tr.storedMarks) {
				tr.setStoredMarks(tr.storedMarks);
			}
			delayedFocus();
		}
		return true;
	};

// src/commands/forEach.ts
var forEach = (items, fn) => (props) => {
	return items.every((item, index) => fn(item, { ...props, index }));
};

// src/commands/insertContent.ts
var insertContent =
	(value, options) =>
	({ tr, commands }) => {
		return commands.insertContentAt({ from: tr.selection.from, to: tr.selection.to }, value, options);
	};

// src/utilities/elementFromString.ts
var removeWhitespaces = (node) => {
	const children = node.childNodes;
	for (let i = children.length - 1; i >= 0; i -= 1) {
		const child = children[i];
		if (child.nodeType === 3 && child.nodeValue && /^(\n\s\s|\n)$/.test(child.nodeValue)) {
			node.removeChild(child);
		} else if (child.nodeType === 1) {
			removeWhitespaces(child);
		}
	}
	return node;
};
function elementFromString(value) {
	if (typeof window === "undefined") {
		throw new Error("[tiptap error]: there is no window object available, so this function cannot be used");
	}
	const wrappedValue = `<body>${value}</body>`;
	const html = new window.DOMParser().parseFromString(wrappedValue, "text/html").body;
	return removeWhitespaces(html);
}

// src/helpers/createNodeFromContent.ts
function createNodeFromContent(content, schema, options) {
	if (content instanceof Node || content instanceof Fragment) {
		return content;
	}
	options = {
		slice: true,
		parseOptions: {},
		...options,
	};
	const isJSONContent = typeof content === "object" && content !== null;
	const isTextContent = typeof content === "string";
	if (isJSONContent) {
		try {
			const isArrayContent = Array.isArray(content) && content.length > 0;
			if (isArrayContent) {
				return Fragment.fromArray(content.map((item) => schema.nodeFromJSON(item)));
			}
			const node = schema.nodeFromJSON(content);
			if (options.errorOnInvalidContent) {
				node.check();
			}
			return node;
		} catch (error) {
			if (options.errorOnInvalidContent) {
				throw new Error("[tiptap error]: Invalid JSON content", { cause: error });
			}
			console.warn("[tiptap warn]: Invalid content.", "Passed value:", content, "Error:", error);
			return createNodeFromContent("", schema, options);
		}
	}
	if (isTextContent) {
		if (options.errorOnInvalidContent) {
			let hasInvalidContent = false;
			let invalidContent = "";
			const contentCheckSchema = new Schema({
				topNode: schema.spec.topNode,
				marks: schema.spec.marks,
				// Prosemirror's schemas are executed such that: the last to execute, matches last
				// This means that we can add a catch-all node at the end of the schema to catch any content that we don't know how to handle
				nodes: schema.spec.nodes.append({
					__tiptap__private__unknown__catch__all__node: {
						content: "inline*",
						group: "block",
						parseDOM: [
							{
								tag: "*",
								getAttrs: (e) => {
									hasInvalidContent = true;
									invalidContent = typeof e === "string" ? e : e.outerHTML;
									return null;
								},
							},
						],
					},
				}),
			});
			if (options.slice) {
				DOMParser.fromSchema(contentCheckSchema).parseSlice(elementFromString(content), options.parseOptions);
			} else {
				DOMParser.fromSchema(contentCheckSchema).parse(elementFromString(content), options.parseOptions);
			}
			if (options.errorOnInvalidContent && hasInvalidContent) {
				throw new Error("[tiptap error]: Invalid HTML content", {
					cause: new Error(`Invalid element found: ${invalidContent}`),
				});
			}
		}
		const parser = DOMParser.fromSchema(schema);
		if (options.slice) {
			return parser.parseSlice(elementFromString(content), options.parseOptions).content;
		}
		return parser.parse(elementFromString(content), options.parseOptions);
	}
	return createNodeFromContent("", schema, options);
}
function selectionToInsertionEnd(tr, startLen, bias) {
	const last = tr.steps.length - 1;
	if (last < startLen) {
		return;
	}
	const step = tr.steps[last];
	if (!(step instanceof ReplaceStep || step instanceof ReplaceAroundStep)) {
		return;
	}
	const map = tr.mapping.maps[last];
	let end = 0;
	map.forEach((_from, _to, _newFrom, newTo) => {
		if (end === 0) {
			end = newTo;
		}
	});
	tr.setSelection(Selection.near(tr.doc.resolve(end), bias));
}

// src/commands/insertContentAt.ts
var isFragment = (nodeOrFragment) => {
	return !("type" in nodeOrFragment);
};
var insertContentAt =
	(position, value, options) =>
	({ tr, dispatch, editor }) => {
		var _a;
		if (dispatch) {
			options = {
				parseOptions: editor.options.parseOptions,
				updateSelection: true,
				applyInputRules: false,
				applyPasteRules: false,
				...options,
			};
			let content;
			const emitContentError = (error) => {
				editor.emit("contentError", {
					editor,
					error,
					disableCollaboration: () => {
						if ("collaboration" in editor.storage && typeof editor.storage.collaboration === "object" && editor.storage.collaboration) {
							editor.storage.collaboration.isDisabled = true;
						}
					},
				});
			};
			const parseOptions = {
				preserveWhitespace: "full",
				...options.parseOptions,
			};
			if (!options.errorOnInvalidContent && !editor.options.enableContentCheck && editor.options.emitContentError) {
				try {
					createNodeFromContent(value, editor.schema, {
						parseOptions,
						errorOnInvalidContent: true,
					});
				} catch (e) {
					emitContentError(e);
				}
			}
			try {
				content = createNodeFromContent(value, editor.schema, {
					parseOptions,
					errorOnInvalidContent: (_a = options.errorOnInvalidContent) != null ? _a : editor.options.enableContentCheck,
				});
			} catch (e) {
				emitContentError(e);
				return false;
			}
			let { from, to } = typeof position === "number" ? { from: position, to: position } : { from: position.from, to: position.to };
			let isOnlyTextContent = true;
			let isOnlyBlockContent = true;
			const nodes = isFragment(content) ? content : [content];
			nodes.forEach((node) => {
				node.check();
				isOnlyTextContent = isOnlyTextContent ? node.isText && node.marks.length === 0 : false;
				isOnlyBlockContent = isOnlyBlockContent ? node.isBlock : false;
			});
			if (from === to && isOnlyBlockContent) {
				const { parent } = tr.doc.resolve(from);
				const isEmptyTextBlock = parent.isTextblock && !parent.type.spec.code && !parent.childCount;
				if (isEmptyTextBlock) {
					from -= 1;
					to += 1;
				}
			}
			let newContent;
			if (isOnlyTextContent) {
				if (Array.isArray(value)) {
					newContent = value.map((v) => v.text || "").join("");
				} else if (value instanceof Fragment) {
					let text = "";
					value.forEach((node) => {
						if (node.text) {
							text += node.text;
						}
					});
					newContent = text;
				} else if (typeof value === "object" && !!value && !!value.text) {
					newContent = value.text;
				} else {
					newContent = value;
				}
				tr.insertText(newContent, from, to);
			} else {
				newContent = content;
				const $from = tr.doc.resolve(from);
				const $fromNode = $from.node();
				const fromSelectionAtStart = $from.parentOffset === 0;
				const isTextSelection2 = $fromNode.isText || $fromNode.isTextblock;
				const hasContent = $fromNode.content.size > 0;
				if (fromSelectionAtStart && isTextSelection2 && hasContent && isOnlyBlockContent) {
					from = Math.max(0, from - 1);
				}
				tr.replaceWith(from, to, newContent);
			}
			if (options.updateSelection) {
				selectionToInsertionEnd(tr, tr.steps.length - 1, -1);
			}
			if (options.applyInputRules) {
				tr.setMeta("applyInputRules", { from, text: newContent });
			}
			if (options.applyPasteRules) {
				tr.setMeta("applyPasteRules", { from, text: newContent });
			}
		}
		return true;
	};
var joinUp =
	() =>
	({ state, dispatch }) => {
		return joinUp$1(state, dispatch);
	};
var joinDown =
	() =>
	({ state, dispatch }) => {
		return joinDown$1(state, dispatch);
	};
var joinBackward =
	() =>
	({ state, dispatch }) => {
		return joinBackward$1(state, dispatch);
	};
var joinForward =
	() =>
	({ state, dispatch }) => {
		return joinForward$1(state, dispatch);
	};
var joinItemBackward =
	() =>
	({ state, dispatch, tr }) => {
		try {
			const point = joinPoint(state.doc, state.selection.$from.pos, -1);
			if (point === null || point === void 0) {
				return false;
			}
			tr.join(point, 2);
			if (dispatch) {
				dispatch(tr);
			}
			return true;
		} catch {
			return false;
		}
	};
var joinItemForward =
	() =>
	({ state, dispatch, tr }) => {
		try {
			const point = joinPoint(state.doc, state.selection.$from.pos, 1);
			if (point === null || point === void 0) {
				return false;
			}
			tr.join(point, 2);
			if (dispatch) {
				dispatch(tr);
			}
			return true;
		} catch {
			return false;
		}
	};
var joinTextblockBackward =
	() =>
	({ state, dispatch }) => {
		return joinTextblockBackward$1(state, dispatch);
	};
var joinTextblockForward =
	() =>
	({ state, dispatch }) => {
		return joinTextblockForward$1(state, dispatch);
	};

// src/utilities/isMacOS.ts
function isMacOS() {
	return typeof navigator !== "undefined" ? /Mac/.test(navigator.platform) : false;
}

// src/commands/keyboardShortcut.ts
function normalizeKeyName(name) {
	const parts = name.split(/-(?!$)/);
	let result = parts[parts.length - 1];
	if (result === "Space") {
		result = " ";
	}
	let alt;
	let ctrl;
	let shift;
	let meta;
	for (let i = 0; i < parts.length - 1; i += 1) {
		const mod = parts[i];
		if (/^(cmd|meta|m)$/i.test(mod)) {
			meta = true;
		} else if (/^a(lt)?$/i.test(mod)) {
			alt = true;
		} else if (/^(c|ctrl|control)$/i.test(mod)) {
			ctrl = true;
		} else if (/^s(hift)?$/i.test(mod)) {
			shift = true;
		} else if (/^mod$/i.test(mod)) {
			if (isiOS() || isMacOS()) {
				meta = true;
			} else {
				ctrl = true;
			}
		} else {
			throw new Error(`Unrecognized modifier name: ${mod}`);
		}
	}
	if (alt) {
		result = `Alt-${result}`;
	}
	if (ctrl) {
		result = `Ctrl-${result}`;
	}
	if (meta) {
		result = `Meta-${result}`;
	}
	if (shift) {
		result = `Shift-${result}`;
	}
	return result;
}
var keyboardShortcut =
	(name) =>
	({ editor, view, tr, dispatch }) => {
		const keys = normalizeKeyName(name).split(/-(?!$)/);
		const key = keys.find((item) => !["Alt", "Ctrl", "Meta", "Shift"].includes(item));
		const event = new KeyboardEvent("keydown", {
			key: key === "Space" ? " " : key,
			altKey: keys.includes("Alt"),
			ctrlKey: keys.includes("Ctrl"),
			metaKey: keys.includes("Meta"),
			shiftKey: keys.includes("Shift"),
			bubbles: true,
			cancelable: true,
		});
		const capturedTransaction = editor.captureTransaction(() => {
			view.someProp("handleKeyDown", (f) => f(view, event));
		});
		capturedTransaction == null ? void 0 : (
			capturedTransaction.steps.forEach((step) => {
				const newStep = step.map(tr.mapping);
				if (newStep && dispatch) {
					tr.maybeStep(newStep);
				}
			})
		);
		return true;
	};

// src/helpers/isNodeActive.ts
function isNodeActive(state, typeOrName, attributes = {}) {
	const { from, to, empty } = state.selection;
	const type = typeOrName ? getNodeType(typeOrName, state.schema) : null;
	const nodeRanges = [];
	state.doc.nodesBetween(from, to, (node, pos) => {
		if (node.isText) {
			return;
		}
		const relativeFrom = Math.max(from, pos);
		const relativeTo = Math.min(to, pos + node.nodeSize);
		nodeRanges.push({
			node,
			from: relativeFrom,
			to: relativeTo,
		});
	});
	const selectionRange = to - from;
	const matchedNodeRanges = nodeRanges
		.filter((nodeRange) => {
			if (!type) {
				return true;
			}
			return type.name === nodeRange.node.type.name;
		})
		.filter((nodeRange) => objectIncludes(nodeRange.node.attrs, attributes, { strict: false }));
	if (empty) {
		return !!matchedNodeRanges.length;
	}
	const range = matchedNodeRanges.reduce((sum, nodeRange) => sum + nodeRange.to - nodeRange.from, 0);
	return range >= selectionRange;
}

// src/commands/lift.ts
var lift =
	(typeOrName, attributes = {}) =>
	({ state, dispatch }) => {
		const type = getNodeType(typeOrName, state.schema);
		const isActive2 = isNodeActive(state, type, attributes);
		if (!isActive2) {
			return false;
		}
		return lift$1(state, dispatch);
	};
var liftEmptyBlock =
	() =>
	({ state, dispatch }) => {
		return liftEmptyBlock$1(state, dispatch);
	};
var liftListItem =
	(typeOrName) =>
	({ state, dispatch }) => {
		const type = getNodeType(typeOrName, state.schema);
		return liftListItem$1(type)(state, dispatch);
	};
var newlineInCode =
	() =>
	({ state, dispatch }) => {
		return newlineInCode$1(state, dispatch);
	};

// src/helpers/getSchemaTypeNameByName.ts
function getSchemaTypeNameByName(name, schema) {
	if (schema.nodes[name]) {
		return "node";
	}
	if (schema.marks[name]) {
		return "mark";
	}
	return null;
}

// src/utilities/deleteProps.ts
function deleteProps(obj, propOrProps) {
	const props = typeof propOrProps === "string" ? [propOrProps] : propOrProps;
	return Object.keys(obj).reduce((newObj, prop) => {
		if (!props.includes(prop)) {
			newObj[prop] = obj[prop];
		}
		return newObj;
	}, {});
}

// src/commands/resetAttributes.ts
var resetAttributes =
	(typeOrName, attributes) =>
	({ tr, state, dispatch }) => {
		let nodeType = null;
		let markType = null;
		const schemaType = getSchemaTypeNameByName(typeof typeOrName === "string" ? typeOrName : typeOrName.name, state.schema);
		if (!schemaType) {
			return false;
		}
		if (schemaType === "node") {
			nodeType = getNodeType(typeOrName, state.schema);
		}
		if (schemaType === "mark") {
			markType = getMarkType(typeOrName, state.schema);
		}
		let canReset = false;
		tr.selection.ranges.forEach((range) => {
			state.doc.nodesBetween(range.$from.pos, range.$to.pos, (node, pos) => {
				if (nodeType && nodeType === node.type) {
					canReset = true;
					if (dispatch) {
						tr.setNodeMarkup(pos, void 0, deleteProps(node.attrs, attributes));
					}
				}
				if (markType && node.marks.length) {
					node.marks.forEach((mark) => {
						if (markType === mark.type) {
							canReset = true;
							if (dispatch) {
								tr.addMark(pos, pos + node.nodeSize, markType.create(deleteProps(mark.attrs, attributes)));
							}
						}
					});
				}
			});
		});
		return canReset;
	};

// src/commands/scrollIntoView.ts
var scrollIntoView =
	() =>
	({ tr, dispatch }) => {
		if (dispatch) {
			tr.scrollIntoView();
		}
		return true;
	};
var selectAll =
	() =>
	({ tr, dispatch }) => {
		if (dispatch) {
			const selection = new AllSelection(tr.doc);
			tr.setSelection(selection);
		}
		return true;
	};
var selectNodeBackward =
	() =>
	({ state, dispatch }) => {
		return selectNodeBackward$1(state, dispatch);
	};
var selectNodeForward =
	() =>
	({ state, dispatch }) => {
		return selectNodeForward$1(state, dispatch);
	};
var selectParentNode =
	() =>
	({ state, dispatch }) => {
		return selectParentNode$1(state, dispatch);
	};
var selectTextblockEnd =
	() =>
	({ state, dispatch }) => {
		return selectTextblockEnd$1(state, dispatch);
	};
var selectTextblockStart =
	() =>
	({ state, dispatch }) => {
		return selectTextblockStart$1(state, dispatch);
	};

// src/helpers/createDocument.ts
function createDocument(content, schema, parseOptions = {}, options = {}) {
	return createNodeFromContent(content, schema, {
		slice: false,
		parseOptions,
		errorOnInvalidContent: options.errorOnInvalidContent,
	});
}

// src/commands/setContent.ts
var setContent =
	(content, { errorOnInvalidContent, emitUpdate = true, parseOptions = {} } = {}) =>
	({ editor, tr, dispatch, commands }) => {
		const { doc } = tr;
		if (parseOptions.preserveWhitespace !== "full") {
			const document2 = createDocument(content, editor.schema, parseOptions, {
				errorOnInvalidContent: errorOnInvalidContent != null ? errorOnInvalidContent : editor.options.enableContentCheck,
			});
			if (dispatch) {
				tr.replaceWith(0, doc.content.size, document2).setMeta("preventUpdate", !emitUpdate);
			}
			return true;
		}
		if (dispatch) {
			tr.setMeta("preventUpdate", !emitUpdate);
		}
		return commands.insertContentAt({ from: 0, to: doc.content.size }, content, {
			parseOptions,
			errorOnInvalidContent: errorOnInvalidContent != null ? errorOnInvalidContent : editor.options.enableContentCheck,
		});
	};

// src/helpers/getMarkAttributes.ts
function getMarkAttributes(state, typeOrName) {
	const type = getMarkType(typeOrName, state.schema);
	const { from, to, empty } = state.selection;
	const marks = [];
	if (empty) {
		if (state.storedMarks) {
			marks.push(...state.storedMarks);
		}
		marks.push(...state.selection.$head.marks());
	} else {
		state.doc.nodesBetween(from, to, (node) => {
			marks.push(...node.marks);
		});
	}
	const mark = marks.find((markItem) => markItem.type.name === type.name);
	if (!mark) {
		return {};
	}
	return { ...mark.attrs };
}
function combineTransactionSteps(oldDoc, transactions) {
	const transform = new Transform(oldDoc);
	transactions.forEach((transaction) => {
		transaction.steps.forEach((step) => {
			transform.step(step);
		});
	});
	return transform;
}

// src/helpers/defaultBlockAt.ts
function defaultBlockAt(match) {
	for (let i = 0; i < match.edgeCount; i += 1) {
		const { type } = match.edge(i);
		if (type.isTextblock && !type.hasRequiredAttrs()) {
			return type;
		}
	}
	return null;
}

// src/helpers/findChildren.ts
function findChildren(node, predicate) {
	const nodesWithPos = [];
	node.descendants((child, pos) => {
		if (predicate(child)) {
			nodesWithPos.push({
				node: child,
				pos,
			});
		}
	});
	return nodesWithPos;
}

// src/helpers/findChildrenInRange.ts
function findChildrenInRange(node, range, predicate) {
	const nodesWithPos = [];
	node.nodesBetween(range.from, range.to, (child, pos) => {
		if (predicate(child)) {
			nodesWithPos.push({
				node: child,
				pos,
			});
		}
	});
	return nodesWithPos;
}

// src/helpers/findParentNodeClosestToPos.ts
function findParentNodeClosestToPos($pos, predicate) {
	for (let i = $pos.depth; i > 0; i -= 1) {
		const node = $pos.node(i);
		if (predicate(node)) {
			return {
				pos: i > 0 ? $pos.before(i) : 0,
				start: $pos.start(i),
				depth: i,
				node,
			};
		}
	}
}

// src/helpers/findParentNode.ts
function findParentNode(predicate) {
	return (selection) => findParentNodeClosestToPos(selection.$from, predicate);
}

// src/helpers/getExtensionField.ts
function getExtensionField(extension, field, context) {
	if (extension.config[field] === void 0 && extension.parent) {
		return getExtensionField(extension.parent, field, context);
	}
	if (typeof extension.config[field] === "function") {
		const value = extension.config[field].bind({
			...context,
			parent: extension.parent ? getExtensionField(extension.parent, field, context) : null,
		});
		return value;
	}
	return extension.config[field];
}

// src/helpers/flattenExtensions.ts
function flattenExtensions(extensions) {
	return extensions
		.map((extension) => {
			const context = {
				name: extension.name,
				options: extension.options,
				storage: extension.storage,
			};
			const addExtensions = getExtensionField(extension, "addExtensions", context);
			if (addExtensions) {
				return [extension, ...flattenExtensions(addExtensions())];
			}
			return extension;
		})
		.flat(10);
}
function getHTMLFromFragment(fragment, schema) {
	const documentFragment = DOMSerializer.fromSchema(schema).serializeFragment(fragment);
	const temporaryDocument = document.implementation.createHTMLDocument();
	const container = temporaryDocument.createElement("div");
	container.appendChild(documentFragment);
	return container.innerHTML;
}

// src/utilities/isFunction.ts
function isFunction(value) {
	return typeof value === "function";
}

// src/utilities/callOrReturn.ts
function callOrReturn(value, context = void 0, ...props) {
	if (isFunction(value)) {
		if (context) {
			return value.bind(context)(...props);
		}
		return value(...props);
	}
	return value;
}

// src/utilities/isEmptyObject.ts
function isEmptyObject(value = {}) {
	return Object.keys(value).length === 0 && value.constructor === Object;
}

// src/helpers/splitExtensions.ts
function splitExtensions(extensions) {
	const baseExtensions = extensions.filter((extension) => extension.type === "extension");
	const nodeExtensions = extensions.filter((extension) => extension.type === "node");
	const markExtensions = extensions.filter((extension) => extension.type === "mark");
	return {
		baseExtensions,
		nodeExtensions,
		markExtensions,
	};
}

// src/helpers/getAttributesFromExtensions.ts
function getAttributesFromExtensions(extensions) {
	const extensionAttributes = [];
	const { nodeExtensions, markExtensions } = splitExtensions(extensions);
	const nodeAndMarkExtensions = [...nodeExtensions, ...markExtensions];
	const defaultAttribute = {
		default: null,
		validate: void 0,
		rendered: true,
		renderHTML: null,
		parseHTML: null,
		keepOnSplit: true,
		isRequired: false,
	};
	const nodeExtensionTypes = nodeExtensions.filter((ext) => ext.name !== "text").map((ext) => ext.name);
	const markExtensionTypes = markExtensions.map((ext) => ext.name);
	const allExtensionTypes = [...nodeExtensionTypes, ...markExtensionTypes];
	extensions.forEach((extension) => {
		const context = {
			name: extension.name,
			options: extension.options,
			storage: extension.storage,
			extensions: nodeAndMarkExtensions,
		};
		const addGlobalAttributes = getExtensionField(extension, "addGlobalAttributes", context);
		if (!addGlobalAttributes) {
			return;
		}
		const globalAttributes = addGlobalAttributes();
		globalAttributes.forEach((globalAttribute) => {
			let resolvedTypes;
			if (Array.isArray(globalAttribute.types)) {
				resolvedTypes = globalAttribute.types;
			} else if (globalAttribute.types === "*") {
				resolvedTypes = allExtensionTypes;
			} else if (globalAttribute.types === "nodes") {
				resolvedTypes = nodeExtensionTypes;
			} else if (globalAttribute.types === "marks") {
				resolvedTypes = markExtensionTypes;
			} else {
				resolvedTypes = [];
			}
			resolvedTypes.forEach((type) => {
				Object.entries(globalAttribute.attributes).forEach(([name, attribute]) => {
					extensionAttributes.push({
						type,
						name,
						attribute: {
							...defaultAttribute,
							...attribute,
						},
					});
				});
			});
		});
	});
	nodeAndMarkExtensions.forEach((extension) => {
		const context = {
			name: extension.name,
			options: extension.options,
			storage: extension.storage,
		};
		const addAttributes = getExtensionField(extension, "addAttributes", context);
		if (!addAttributes) {
			return;
		}
		const attributes = addAttributes();
		Object.entries(attributes).forEach(([name, attribute]) => {
			const mergedAttr = {
				...defaultAttribute,
				...attribute,
			};
			if (typeof (mergedAttr == null ? void 0 : mergedAttr.default) === "function") {
				mergedAttr.default = mergedAttr.default();
			}
			if ((mergedAttr == null ? void 0 : mergedAttr.isRequired) && (mergedAttr == null ? void 0 : mergedAttr.default) === void 0) {
				delete mergedAttr.default;
			}
			extensionAttributes.push({
				type: extension.name,
				name,
				attribute: mergedAttr,
			});
		});
	});
	return extensionAttributes;
}

// src/utilities/mergeAttributes.ts
function splitStyleDeclarations(styles) {
	const result = [];
	let current = "";
	let inSingleQuote = false;
	let inDoubleQuote = false;
	let parenDepth = 0;
	const length = styles.length;
	for (let i = 0; i < length; i += 1) {
		const char = styles[i];
		if (char === "'" && !inDoubleQuote) {
			inSingleQuote = !inSingleQuote;
			current += char;
			continue;
		}
		if (char === '"' && !inSingleQuote) {
			inDoubleQuote = !inDoubleQuote;
			current += char;
			continue;
		}
		if (!inSingleQuote && !inDoubleQuote) {
			if (char === "(") {
				parenDepth += 1;
				current += char;
				continue;
			}
			if (char === ")" && parenDepth > 0) {
				parenDepth -= 1;
				current += char;
				continue;
			}
			if (char === ";" && parenDepth === 0) {
				result.push(current);
				current = "";
				continue;
			}
		}
		current += char;
	}
	if (current) {
		result.push(current);
	}
	return result;
}
function parseStyleEntries(styles) {
	const pairs = [];
	const declarations = splitStyleDeclarations(styles || "");
	const numDeclarations = declarations.length;
	for (let i = 0; i < numDeclarations; i += 1) {
		const declaration = declarations[i];
		const firstColonIndex = declaration.indexOf(":");
		if (firstColonIndex === -1) {
			continue;
		}
		const property = declaration.slice(0, firstColonIndex).trim();
		const value = declaration.slice(firstColonIndex + 1).trim();
		if (property && value) {
			pairs.push([property, value]);
		}
	}
	return pairs;
}
function mergeAttributes(...objects) {
	return objects
		.filter((item) => !!item)
		.reduce((items, item) => {
			const mergedAttributes = { ...items };
			Object.entries(item).forEach(([key, value]) => {
				const exists = mergedAttributes[key];
				if (!exists) {
					mergedAttributes[key] = value;
					return;
				}
				if (key === "class") {
					const valueClasses = value ? String(value).split(" ") : [];
					const existingClasses = mergedAttributes[key] ? mergedAttributes[key].split(" ") : [];
					const insertClasses = valueClasses.filter((valueClass) => !existingClasses.includes(valueClass));
					mergedAttributes[key] = [...existingClasses, ...insertClasses].join(" ");
				} else if (key === "style") {
					const styleMap = new Map([...parseStyleEntries(mergedAttributes[key]), ...parseStyleEntries(value)]);
					mergedAttributes[key] = Array.from(styleMap.entries())
						.map(([property, val]) => `${property}: ${val}`)
						.join("; ");
				} else {
					mergedAttributes[key] = value;
				}
			});
			return mergedAttributes;
		}, {});
}

// src/helpers/getRenderedAttributes.ts
function getRenderedAttributes(nodeOrMark, extensionAttributes) {
	return extensionAttributes
		.filter((attribute) => attribute.type === nodeOrMark.type.name)
		.filter((item) => item.attribute.rendered)
		.map((item) => {
			if (!item.attribute.renderHTML) {
				return {
					[item.name]: nodeOrMark.attrs[item.name],
				};
			}
			return item.attribute.renderHTML(nodeOrMark.attrs) || {};
		})
		.reduce((attributes, attribute) => mergeAttributes(attributes, attribute), {});
}

// src/utilities/fromString.ts
function fromString(value) {
	if (typeof value !== "string") {
		return value;
	}
	if (value.match(/^[+-]?(?:\d*\.)?\d+$/)) {
		return Number(value);
	}
	if (value === "true") {
		return true;
	}
	if (value === "false") {
		return false;
	}
	return value;
}

// src/helpers/injectExtensionAttributesToParseRule.ts
function injectExtensionAttributesToParseRule(parseRule, extensionAttributes) {
	if ("style" in parseRule) {
		return parseRule;
	}
	return {
		...parseRule,
		getAttrs: (node) => {
			const oldAttributes = parseRule.getAttrs ? parseRule.getAttrs(node) : parseRule.attrs;
			if (oldAttributes === false) {
				return false;
			}
			const newAttributes = extensionAttributes.reduce((items, item) => {
				const value = item.attribute.parseHTML ? item.attribute.parseHTML(node) : fromString(node.getAttribute(item.name));
				if (value === null || value === void 0) {
					return items;
				}
				return {
					...items,
					[item.name]: value,
				};
			}, {});
			return { ...oldAttributes, ...newAttributes };
		},
	};
}

// src/helpers/getSchemaByResolvedExtensions.ts
function cleanUpSchemaItem(data) {
	return Object.fromEntries(
		// @ts-ignore
		Object.entries(data).filter(([key, value]) => {
			if (key === "attrs" && isEmptyObject(value)) {
				return false;
			}
			return value !== null && value !== void 0;
		}),
	);
}
function buildAttributeSpec(extensionAttribute) {
	var _a, _b;
	const spec = {};
	if (
		!((_a = extensionAttribute == null ? void 0 : extensionAttribute.attribute) == null ? void 0 : _a.isRequired) &&
		"default" in ((extensionAttribute == null ? void 0 : extensionAttribute.attribute) || {})
	) {
		spec.default = extensionAttribute.attribute.default;
	}
	if (((_b = extensionAttribute == null ? void 0 : extensionAttribute.attribute) == null ? void 0 : _b.validate) !== void 0) {
		spec.validate = extensionAttribute.attribute.validate;
	}
	return [extensionAttribute.name, spec];
}
function getSchemaByResolvedExtensions(extensions, editor) {
	var _a;
	const allAttributes = getAttributesFromExtensions(extensions);
	const { nodeExtensions, markExtensions } = splitExtensions(extensions);
	const topNode = (_a = nodeExtensions.find((extension) => getExtensionField(extension, "topNode"))) == null ? void 0 : _a.name;
	const nodes = Object.fromEntries(
		nodeExtensions.map((extension) => {
			const extensionAttributes = allAttributes.filter((attribute) => attribute.type === extension.name);
			const context = {
				name: extension.name,
				options: extension.options,
				storage: extension.storage,
				editor,
			};
			const extraNodeFields = extensions.reduce((fields, e) => {
				const extendNodeSchema = getExtensionField(e, "extendNodeSchema", context);
				return {
					...fields,
					...(extendNodeSchema ? extendNodeSchema(extension) : {}),
				};
			}, {});
			const schema = cleanUpSchemaItem({
				...extraNodeFields,
				content: callOrReturn(getExtensionField(extension, "content", context)),
				marks: callOrReturn(getExtensionField(extension, "marks", context)),
				group: callOrReturn(getExtensionField(extension, "group", context)),
				inline: callOrReturn(getExtensionField(extension, "inline", context)),
				atom: callOrReturn(getExtensionField(extension, "atom", context)),
				selectable: callOrReturn(getExtensionField(extension, "selectable", context)),
				draggable: callOrReturn(getExtensionField(extension, "draggable", context)),
				code: callOrReturn(getExtensionField(extension, "code", context)),
				whitespace: callOrReturn(getExtensionField(extension, "whitespace", context)),
				linebreakReplacement: callOrReturn(getExtensionField(extension, "linebreakReplacement", context)),
				defining: callOrReturn(getExtensionField(extension, "defining", context)),
				isolating: callOrReturn(getExtensionField(extension, "isolating", context)),
				attrs: Object.fromEntries(extensionAttributes.map(buildAttributeSpec)),
			});
			const parseHTML = callOrReturn(getExtensionField(extension, "parseHTML", context));
			if (parseHTML) {
				schema.parseDOM = parseHTML.map((parseRule) => injectExtensionAttributesToParseRule(parseRule, extensionAttributes));
			}
			const renderHTML = getExtensionField(extension, "renderHTML", context);
			if (renderHTML) {
				schema.toDOM = (node) =>
					renderHTML({
						node,
						HTMLAttributes: getRenderedAttributes(node, extensionAttributes),
					});
			}
			const renderText = getExtensionField(extension, "renderText", context);
			if (renderText) {
				schema.toText = renderText;
			}
			return [extension.name, schema];
		}),
	);
	const marks = Object.fromEntries(
		markExtensions.map((extension) => {
			const extensionAttributes = allAttributes.filter((attribute) => attribute.type === extension.name);
			const context = {
				name: extension.name,
				options: extension.options,
				storage: extension.storage,
				editor,
			};
			const extraMarkFields = extensions.reduce((fields, e) => {
				const extendMarkSchema = getExtensionField(e, "extendMarkSchema", context);
				return {
					...fields,
					...(extendMarkSchema ? extendMarkSchema(extension) : {}),
				};
			}, {});
			const schema = cleanUpSchemaItem({
				...extraMarkFields,
				inclusive: callOrReturn(getExtensionField(extension, "inclusive", context)),
				excludes: callOrReturn(getExtensionField(extension, "excludes", context)),
				group: callOrReturn(getExtensionField(extension, "group", context)),
				spanning: callOrReturn(getExtensionField(extension, "spanning", context)),
				code: callOrReturn(getExtensionField(extension, "code", context)),
				attrs: Object.fromEntries(extensionAttributes.map(buildAttributeSpec)),
			});
			const parseHTML = callOrReturn(getExtensionField(extension, "parseHTML", context));
			if (parseHTML) {
				schema.parseDOM = parseHTML.map((parseRule) => injectExtensionAttributesToParseRule(parseRule, extensionAttributes));
			}
			const renderHTML = getExtensionField(extension, "renderHTML", context);
			if (renderHTML) {
				schema.toDOM = (mark) =>
					renderHTML({
						mark,
						HTMLAttributes: getRenderedAttributes(mark, extensionAttributes),
					});
			}
			return [extension.name, schema];
		}),
	);
	return new Schema({
		topNode,
		nodes,
		marks,
	});
}

// src/utilities/findDuplicates.ts
function findDuplicates(items) {
	const filtered = items.filter((el, index) => items.indexOf(el) !== index);
	return Array.from(new Set(filtered));
}

// src/helpers/sortExtensions.ts
function sortExtensions(extensions) {
	const defaultPriority = 100;
	return extensions.sort((a, b) => {
		const priorityA = getExtensionField(a, "priority") || defaultPriority;
		const priorityB = getExtensionField(b, "priority") || defaultPriority;
		if (priorityA > priorityB) {
			return -1;
		}
		if (priorityA < priorityB) {
			return 1;
		}
		return 0;
	});
}

// src/helpers/resolveExtensions.ts
function resolveExtensions(extensions) {
	const resolvedExtensions = sortExtensions(flattenExtensions(extensions));
	const duplicatedNames = findDuplicates(resolvedExtensions.map((extension) => extension.name));
	if (duplicatedNames.length) {
		console.warn(`[tiptap warn]: Duplicate extension names found: [${duplicatedNames.map((item) => `'${item}'`).join(", ")}]. This can lead to issues.`);
	}
	return resolvedExtensions;
}

// src/helpers/getSchema.ts
function getSchema(extensions, editor) {
	const resolvedExtensions = resolveExtensions(extensions);
	return getSchemaByResolvedExtensions(resolvedExtensions, editor);
}

// src/helpers/getTextBetween.ts
function getTextBetween(startNode, range, options) {
	const { from, to } = range;
	const { blockSeparator = "\n\n", textSerializers = {} } = options || {};
	let text = "";
	startNode.nodesBetween(from, to, (node, pos, parent, index) => {
		var _a;
		if (node.isBlock && pos > from) {
			text += blockSeparator;
		}
		const textSerializer = textSerializers == null ? void 0 : textSerializers[node.type.name];
		if (textSerializer) {
			if (parent) {
				text += textSerializer({
					node,
					pos,
					parent,
					index,
					range,
				});
			}
			return false;
		}
		if (node.isText) {
			text += (_a = node == null ? void 0 : node.text) == null ? void 0 : _a.slice(Math.max(from, pos) - pos, to - pos);
		}
	});
	return text;
}

// src/helpers/getText.ts
function getText(node, options) {
	const range = {
		from: 0,
		to: node.content.size,
	};
	return getTextBetween(node, range, options);
}

// src/helpers/getTextSerializersFromSchema.ts
function getTextSerializersFromSchema(schema) {
	return Object.fromEntries(
		Object.entries(schema.nodes)
			.filter(([, node]) => node.spec.toText)
			.map(([name, node]) => [name, node.spec.toText]),
	);
}

// src/helpers/getNodeAttributes.ts
function getNodeAttributes(state, typeOrName) {
	const type = getNodeType(typeOrName, state.schema);
	const { from, to } = state.selection;
	const nodes = [];
	state.doc.nodesBetween(from, to, (node2) => {
		nodes.push(node2);
	});
	const node = nodes.reverse().find((nodeItem) => nodeItem.type.name === type.name);
	if (!node) {
		return {};
	}
	return { ...node.attrs };
}

// src/helpers/getAttributes.ts
function getAttributes(state, typeOrName) {
	const schemaType = getSchemaTypeNameByName(typeof typeOrName === "string" ? typeOrName : typeOrName.name, state.schema);
	if (schemaType === "node") {
		return getNodeAttributes(state, typeOrName);
	}
	if (schemaType === "mark") {
		return getMarkAttributes(state, typeOrName);
	}
	return {};
}

// src/utilities/removeDuplicates.ts
function removeDuplicates(array, by = JSON.stringify) {
	const seen = {};
	return array.filter((item) => {
		const key = by(item);
		return Object.prototype.hasOwnProperty.call(seen, key) ? false : (seen[key] = true);
	});
}

// src/helpers/getChangedRanges.ts
function simplifyChangedRanges(changes) {
	const uniqueChanges = removeDuplicates(changes);
	return uniqueChanges.length === 1 ?
			uniqueChanges
		:	uniqueChanges.filter((change, index) => {
				const rest = uniqueChanges.filter((_, i) => i !== index);
				return !rest.some((otherChange) => {
					return (
						change.oldRange.from >= otherChange.oldRange.from &&
						change.oldRange.to <= otherChange.oldRange.to &&
						change.newRange.from >= otherChange.newRange.from &&
						change.newRange.to <= otherChange.newRange.to
					);
				});
			});
}
function getChangedRanges(transform) {
	const { mapping, steps } = transform;
	const changes = [];
	mapping.maps.forEach((stepMap, index) => {
		const ranges = [];
		if (!stepMap.ranges.length) {
			const { from, to } = steps[index];
			if (from === void 0 || to === void 0) {
				return;
			}
			ranges.push({ from, to });
		} else {
			stepMap.forEach((from, to) => {
				ranges.push({ from, to });
			});
		}
		ranges.forEach(({ from, to }) => {
			const newStart = mapping.slice(index).map(from, -1);
			const newEnd = mapping.slice(index).map(to);
			const oldStart = mapping.invert().map(newStart, -1);
			const oldEnd = mapping.invert().map(newEnd);
			changes.push({
				oldRange: {
					from: oldStart,
					to: oldEnd,
				},
				newRange: {
					from: newStart,
					to: newEnd,
				},
			});
		});
	});
	return simplifyChangedRanges(changes);
}

// src/helpers/getMarksBetween.ts
function getMarksBetween(from, to, doc) {
	const marks = [];
	if (from === to) {
		doc.resolve(from)
			.marks()
			.forEach((mark) => {
				const $pos = doc.resolve(from);
				const range = getMarkRange($pos, mark.type);
				if (!range) {
					return;
				}
				marks.push({
					mark,
					...range,
				});
			});
	} else {
		doc.nodesBetween(from, to, (node, pos) => {
			if (!node || (node == null ? void 0 : node.nodeSize) === void 0) {
				return;
			}
			marks.push(
				...node.marks.map((mark) => ({
					from: pos,
					to: pos + node.nodeSize,
					mark,
				})),
			);
		});
	}
	return marks;
}

// src/helpers/getNodeAtPosition.ts
var getNodeAtPosition = (state, typeOrName, pos, maxDepth = 20) => {
	const $pos = state.doc.resolve(pos);
	let currentDepth = maxDepth;
	let node = null;
	while (currentDepth > 0 && node === null) {
		const currentNode = $pos.node(currentDepth);
		if ((currentNode == null ? void 0 : currentNode.type.name) === typeOrName) {
			node = currentNode;
		} else {
			currentDepth -= 1;
		}
	}
	return [node, currentDepth];
};

// src/helpers/getSchemaTypeByName.ts
function getSchemaTypeByName(name, schema) {
	return schema.nodes[name] || schema.marks[name] || null;
}

// src/helpers/getSplittedAttributes.ts
function getSplittedAttributes(extensionAttributes, typeName, attributes) {
	return Object.fromEntries(
		Object.entries(attributes).filter(([name]) => {
			const extensionAttribute = extensionAttributes.find((item) => {
				return item.type === typeName && item.name === name;
			});
			if (!extensionAttribute) {
				return false;
			}
			return extensionAttribute.attribute.keepOnSplit;
		}),
	);
}

// src/helpers/getTextContentFromNodes.ts
var getTextContentFromNodes = ($from, maxMatch = 500) => {
	let textBefore = "";
	const sliceEndPos = $from.parentOffset;
	$from.parent.nodesBetween(Math.max(0, sliceEndPos - maxMatch), sliceEndPos, (node, pos, parent, index) => {
		var _a, _b;
		const chunk =
			((_b = (_a = node.type.spec).toText) == null ?
				void 0
			:	_b.call(_a, {
					node,
					pos,
					parent,
					index,
				})) ||
			node.textContent ||
			"%leaf%";
		textBefore += node.isAtom && !node.isText ? chunk : chunk.slice(0, Math.max(0, sliceEndPos - pos));
	});
	return textBefore;
};

// src/helpers/isMarkActive.ts
function isMarkActive(state, typeOrName, attributes = {}) {
	const { empty, ranges } = state.selection;
	const type = typeOrName ? getMarkType(typeOrName, state.schema) : null;
	if (empty) {
		return !!(state.storedMarks || state.selection.$from.marks())
			.filter((mark) => {
				if (!type) {
					return true;
				}
				return type.name === mark.type.name;
			})
			.find((mark) => objectIncludes(mark.attrs, attributes, { strict: false }));
	}
	let selectionRange = 0;
	const markRanges = [];
	ranges.forEach(({ $from, $to }) => {
		const from = $from.pos;
		const to = $to.pos;
		state.doc.nodesBetween(from, to, (node, pos) => {
			if (type && node.inlineContent && !node.type.allowsMarkType(type)) {
				return false;
			}
			if (!node.isText && !node.marks.length) {
				return;
			}
			const relativeFrom = Math.max(from, pos);
			const relativeTo = Math.min(to, pos + node.nodeSize);
			const range2 = relativeTo - relativeFrom;
			selectionRange += range2;
			markRanges.push(
				...node.marks.map((mark) => ({
					mark,
					from: relativeFrom,
					to: relativeTo,
				})),
			);
		});
	});
	if (selectionRange === 0) {
		return false;
	}
	const matchedRange = markRanges
		.filter((markRange) => {
			if (!type) {
				return true;
			}
			return type.name === markRange.mark.type.name;
		})
		.filter((markRange) => objectIncludes(markRange.mark.attrs, attributes, { strict: false }))
		.reduce((sum, markRange) => sum + markRange.to - markRange.from, 0);
	const excludedRange = markRanges
		.filter((markRange) => {
			if (!type) {
				return true;
			}
			return markRange.mark.type !== type && markRange.mark.type.excludes(type);
		})
		.reduce((sum, markRange) => sum + markRange.to - markRange.from, 0);
	const range = matchedRange > 0 ? matchedRange + excludedRange : matchedRange;
	return range >= selectionRange;
}

// src/helpers/isActive.ts
function isActive(state, name, attributes = {}) {
	if (!name) {
		return isNodeActive(state, null, attributes) || isMarkActive(state, null, attributes);
	}
	const schemaType = getSchemaTypeNameByName(name, state.schema);
	if (schemaType === "node") {
		return isNodeActive(state, name, attributes);
	}
	if (schemaType === "mark") {
		return isMarkActive(state, name, attributes);
	}
	return false;
}

// src/helpers/isAtEndOfNode.ts
var isAtEndOfNode = (state, nodeType) => {
	const { $from, $to, $anchor } = state.selection;
	if (nodeType) {
		const parentNode = findParentNode((node) => node.type.name === nodeType)(state.selection);
		if (!parentNode) {
			return false;
		}
		const $parentPos = state.doc.resolve(parentNode.pos + 1);
		if ($anchor.pos + 1 === $parentPos.end()) {
			return true;
		}
		return false;
	}
	if ($to.parentOffset < $to.parent.nodeSize - 2 || $from.pos !== $to.pos) {
		return false;
	}
	return true;
};

// src/helpers/isAtStartOfNode.ts
var isAtStartOfNode = (state) => {
	const { $from, $to } = state.selection;
	if ($from.parentOffset > 0 || $from.pos !== $to.pos) {
		return false;
	}
	return true;
};

// src/helpers/isExtensionRulesEnabled.ts
function isExtensionRulesEnabled(extension, enabled) {
	if (Array.isArray(enabled)) {
		return enabled.some((enabledExtension) => {
			const name = typeof enabledExtension === "string" ? enabledExtension : enabledExtension.name;
			return name === extension.name;
		});
	}
	return enabled;
}

// src/helpers/isList.ts
function isList(name, extensions) {
	const { nodeExtensions } = splitExtensions(extensions);
	const extension = nodeExtensions.find((item) => item.name === name);
	if (!extension) {
		return false;
	}
	const context = {
		name: extension.name,
		options: extension.options,
		storage: extension.storage,
	};
	const group = callOrReturn(getExtensionField(extension, "group", context));
	if (typeof group !== "string") {
		return false;
	}
	return group.split(" ").includes("list");
}

// src/helpers/isNodeEmpty.ts
function isNodeEmpty(node, { checkChildren = true, ignoreWhitespace = false } = {}) {
	var _a;
	if (ignoreWhitespace) {
		if (node.type.name === "hardBreak") {
			return true;
		}
		if (node.isText) {
			return !/\S/.test((_a = node.text) != null ? _a : "");
		}
	}
	if (node.isText) {
		return !node.text;
	}
	if (node.isAtom || node.isLeaf) {
		return false;
	}
	if (node.content.childCount === 0) {
		return true;
	}
	if (checkChildren) {
		let isContentEmpty = true;
		node.content.forEach((childNode) => {
			if (isContentEmpty === false) {
				return;
			}
			if (!isNodeEmpty(childNode, { ignoreWhitespace, checkChildren })) {
				isContentEmpty = false;
			}
		});
		return isContentEmpty;
	}
	return false;
}
function isNodeSelection(value) {
	return value instanceof NodeSelection;
}

// src/helpers/MappablePosition.ts
var MappablePosition = class _MappablePosition {
	constructor(position) {
		this.position = position;
	}
	/**
	 * Creates a MappablePosition from a JSON object.
	 */
	static fromJSON(json) {
		return new _MappablePosition(json.position);
	}
	/**
	 * Converts the MappablePosition to a JSON object.
	 */
	toJSON() {
		return {
			position: this.position,
		};
	}
};
function getUpdatedPosition(position, transaction) {
	const mapResult = transaction.mapping.mapResult(position.position);
	return {
		position: new MappablePosition(mapResult.pos),
		mapResult,
	};
}
function createMappablePosition(position) {
	return new MappablePosition(position);
}

// src/helpers/posToDOMRect.ts
function posToDOMRect(view, from, to) {
	const minPos = 0;
	const maxPos = view.state.doc.content.size;
	const resolvedFrom = minMax(from, minPos, maxPos);
	const resolvedEnd = minMax(to, minPos, maxPos);
	const start = view.coordsAtPos(resolvedFrom);
	const end = view.coordsAtPos(resolvedEnd, -1);
	const top = Math.min(start.top, end.top);
	const bottom = Math.max(start.bottom, end.bottom);
	const left = Math.min(start.left, end.left);
	const right = Math.max(start.right, end.right);
	const width = right - left;
	const height = bottom - top;
	const x = left;
	const y = top;
	const data = {
		top,
		bottom,
		left,
		right,
		width,
		height,
		x,
		y,
	};
	return {
		...data,
		toJSON: () => data,
	};
}

// src/commands/setMark.ts
function canSetMark(state, tr, newMarkType) {
	var _a;
	const { selection } = tr;
	let cursor = null;
	if (isTextSelection(selection)) {
		cursor = selection.$cursor;
	}
	if (cursor) {
		const currentMarks = (_a = state.storedMarks) != null ? _a : cursor.marks();
		const parentAllowsMarkType = cursor.parent.type.allowsMarkType(newMarkType);
		return parentAllowsMarkType && (!!newMarkType.isInSet(currentMarks) || !currentMarks.some((mark) => mark.type.excludes(newMarkType)));
	}
	const { ranges } = selection;
	return ranges.some(({ $from, $to }) => {
		let someNodeSupportsMark = $from.depth === 0 ? state.doc.inlineContent && state.doc.type.allowsMarkType(newMarkType) : false;
		state.doc.nodesBetween($from.pos, $to.pos, (node, _pos, parent) => {
			if (someNodeSupportsMark) {
				return false;
			}
			if (node.isInline) {
				const parentAllowsMarkType = !parent || parent.type.allowsMarkType(newMarkType);
				const currentMarksAllowMarkType = !!newMarkType.isInSet(node.marks) || !node.marks.some((otherMark) => otherMark.type.excludes(newMarkType));
				someNodeSupportsMark = parentAllowsMarkType && currentMarksAllowMarkType;
			}
			return !someNodeSupportsMark;
		});
		return someNodeSupportsMark;
	});
}
var setMark =
	(typeOrName, attributes = {}) =>
	({ tr, state, dispatch }) => {
		const { selection } = tr;
		const { empty, ranges } = selection;
		const type = getMarkType(typeOrName, state.schema);
		if (dispatch) {
			if (empty) {
				const oldAttributes = getMarkAttributes(state, type);
				tr.addStoredMark(
					type.create({
						...oldAttributes,
						...attributes,
					}),
				);
			} else {
				ranges.forEach((range) => {
					const from = range.$from.pos;
					const to = range.$to.pos;
					state.doc.nodesBetween(from, to, (node, pos) => {
						const trimmedFrom = Math.max(pos, from);
						const trimmedTo = Math.min(pos + node.nodeSize, to);
						const someHasMark = node.marks.find((mark) => mark.type === type);
						if (someHasMark) {
							node.marks.forEach((mark) => {
								if (type === mark.type) {
									tr.addMark(
										trimmedFrom,
										trimmedTo,
										type.create({
											...mark.attrs,
											...attributes,
										}),
									);
								}
							});
						} else {
							tr.addMark(trimmedFrom, trimmedTo, type.create(attributes));
						}
					});
				});
			}
		}
		return canSetMark(state, tr, type);
	};

// src/commands/setMeta.ts
var setMeta =
	(key, value) =>
	({ tr }) => {
		tr.setMeta(key, value);
		return true;
	};
var setNode =
	(typeOrName, attributes = {}) =>
	({ state, dispatch, chain }) => {
		const type = getNodeType(typeOrName, state.schema);
		let attributesToCopy;
		if (state.selection.$anchor.sameParent(state.selection.$head)) {
			attributesToCopy = state.selection.$anchor.parent.attrs;
		}
		if (!type.isTextblock) {
			console.warn('[tiptap warn]: Currently "setNode()" only supports text block nodes.');
			return false;
		}
		return chain()
			.command(({ commands }) => {
				const canSetBlock = setBlockType(type, { ...attributesToCopy, ...attributes })(state);
				if (canSetBlock) {
					return true;
				}
				return commands.clearNodes();
			})
			.command(({ state: updatedState }) => {
				return setBlockType(type, { ...attributesToCopy, ...attributes })(updatedState, dispatch);
			})
			.run();
	};
var setNodeSelection =
	(position) =>
	({ tr, dispatch }) => {
		if (dispatch) {
			const { doc } = tr;
			const from = minMax(position, 0, doc.content.size);
			const selection = NodeSelection.create(doc, from);
			tr.setSelection(selection);
		}
		return true;
	};

// src/commands/setTextDirection.ts
var setTextDirection =
	(direction, position) =>
	({ tr, state, dispatch }) => {
		const { selection } = state;
		let from;
		let to;
		if (typeof position === "number") {
			from = position;
			to = position;
		} else if (position && "from" in position && "to" in position) {
			from = position.from;
			to = position.to;
		} else {
			from = selection.from;
			to = selection.to;
		}
		if (dispatch) {
			tr.doc.nodesBetween(from, to, (node, pos) => {
				if (node.isText) {
					return;
				}
				tr.setNodeMarkup(pos, void 0, {
					...node.attrs,
					dir: direction,
				});
			});
		}
		return true;
	};
var setTextSelection =
	(position) =>
	({ tr, dispatch }) => {
		if (dispatch) {
			const { doc } = tr;
			const { from, to } = typeof position === "number" ? { from: position, to: position } : position;
			const minPos = TextSelection.atStart(doc).from;
			const maxPos = TextSelection.atEnd(doc).to;
			const resolvedFrom = minMax(from, minPos, maxPos);
			const resolvedEnd = minMax(to, minPos, maxPos);
			const selection = TextSelection.create(doc, resolvedFrom, resolvedEnd);
			tr.setSelection(selection);
		}
		return true;
	};
var sinkListItem =
	(typeOrName) =>
	({ state, dispatch }) => {
		const type = getNodeType(typeOrName, state.schema);
		return sinkListItem$1(type)(state, dispatch);
	};
function ensureMarks(state, splittableMarks) {
	const marks = state.storedMarks || (state.selection.$to.parentOffset && state.selection.$from.marks());
	if (marks) {
		const filteredMarks = marks.filter((mark) => (splittableMarks == null ? void 0 : splittableMarks.includes(mark.type.name)));
		state.tr.ensureMarks(filteredMarks);
	}
}
var splitBlock =
	({ keepMarks = true } = {}) =>
	({ tr, state, dispatch, editor }) => {
		const { selection, doc } = tr;
		const { $from, $to } = selection;
		const extensionAttributes = editor.extensionManager.attributes;
		const newAttributes = getSplittedAttributes(extensionAttributes, $from.node().type.name, $from.node().attrs);
		if (selection instanceof NodeSelection && selection.node.isBlock) {
			if (!$from.parentOffset || !canSplit(doc, $from.pos)) {
				return false;
			}
			if (dispatch) {
				if (keepMarks) {
					ensureMarks(state, editor.extensionManager.splittableMarks);
				}
				tr.split($from.pos).scrollIntoView();
			}
			return true;
		}
		if (!$from.parent.isBlock) {
			return false;
		}
		const atEnd = $to.parentOffset === $to.parent.content.size;
		const deflt = $from.depth === 0 ? void 0 : defaultBlockAt($from.node(-1).contentMatchAt($from.indexAfter(-1)));
		let types =
			atEnd && deflt ?
				[
					{
						type: deflt,
						attrs: newAttributes,
					},
				]
			:	void 0;
		let can = canSplit(tr.doc, tr.mapping.map($from.pos), 1, types);
		if (!types && !can && canSplit(tr.doc, tr.mapping.map($from.pos), 1, deflt ? [{ type: deflt }] : void 0)) {
			can = true;
			types =
				deflt ?
					[
						{
							type: deflt,
							attrs: newAttributes,
						},
					]
				:	void 0;
		}
		if (dispatch) {
			if (can) {
				if (selection instanceof TextSelection) {
					tr.deleteSelection();
				}
				tr.split(tr.mapping.map($from.pos), 1, types);
				if (deflt && !atEnd && !$from.parentOffset && $from.parent.type !== deflt) {
					const first2 = tr.mapping.map($from.before());
					const $first = tr.doc.resolve(first2);
					if ($from.node(-1).canReplaceWith($first.index(), $first.index() + 1, deflt)) {
						tr.setNodeMarkup(tr.mapping.map($from.before()), deflt);
					}
				}
			}
			if (keepMarks) {
				ensureMarks(state, editor.extensionManager.splittableMarks);
			}
			tr.scrollIntoView();
		}
		return can;
	};
var splitListItem =
	(typeOrName, overrideAttrs = {}) =>
	({ tr, state, dispatch, editor }) => {
		var _a;
		const type = getNodeType(typeOrName, state.schema);
		const { $from, $to } = state.selection;
		const node = state.selection.node;
		if ((node && node.isBlock) || $from.depth < 2 || !$from.sameParent($to)) {
			return false;
		}
		const grandParent = $from.node(-1);
		if (grandParent.type !== type) {
			return false;
		}
		const extensionAttributes = editor.extensionManager.attributes;
		if ($from.parent.content.size === 0 && $from.node(-1).childCount === $from.indexAfter(-1)) {
			if ($from.depth === 2 || $from.node(-3).type !== type || $from.index(-2) !== $from.node(-2).childCount - 1) {
				return false;
			}
			if (dispatch) {
				let wrap = Fragment.empty;
				const depthBefore =
					$from.index(-1) ? 1
					: $from.index(-2) ? 2
					: 3;
				for (let d = $from.depth - depthBefore; d >= $from.depth - 3; d -= 1) {
					wrap = Fragment.from($from.node(d).copy(wrap));
				}
				const depthAfter =
					// oxlint-disable-next-line no-nested-ternary
					$from.indexAfter(-1) < $from.node(-2).childCount ? 1
					: $from.indexAfter(-2) < $from.node(-3).childCount ? 2
					: 3;
				const newNextTypeAttributes2 = {
					...getSplittedAttributes(extensionAttributes, $from.node().type.name, $from.node().attrs),
					...overrideAttrs,
				};
				const nextType2 = ((_a = type.contentMatch.defaultType) == null ? void 0 : _a.createAndFill(newNextTypeAttributes2)) || void 0;
				wrap = wrap.append(Fragment.from(type.createAndFill(null, nextType2) || void 0));
				const start = $from.before($from.depth - (depthBefore - 1));
				tr.replace(start, $from.after(-depthAfter), new Slice(wrap, 4 - depthBefore, 0));
				let sel = -1;
				tr.doc.nodesBetween(start, tr.doc.content.size, (n, pos) => {
					if (sel > -1) {
						return false;
					}
					if (n.isTextblock && n.content.size === 0) {
						sel = pos + 1;
					}
				});
				if (sel > -1) {
					tr.setSelection(TextSelection.near(tr.doc.resolve(sel)));
				}
				tr.scrollIntoView();
			}
			return true;
		}
		const nextType = $to.pos === $from.end() ? grandParent.contentMatchAt(0).defaultType : null;
		const newTypeAttributes = {
			...getSplittedAttributes(extensionAttributes, grandParent.type.name, grandParent.attrs),
			...overrideAttrs,
		};
		const newNextTypeAttributes = {
			...getSplittedAttributes(extensionAttributes, $from.node().type.name, $from.node().attrs),
			...overrideAttrs,
		};
		tr.delete($from.pos, $to.pos);
		const types =
			nextType ?
				[
					{ type, attrs: newTypeAttributes },
					{ type: nextType, attrs: newNextTypeAttributes },
				]
			:	[{ type, attrs: newTypeAttributes }];
		if (!canSplit(tr.doc, $from.pos, 2)) {
			return false;
		}
		if (dispatch) {
			const { selection, storedMarks } = state;
			const { splittableMarks } = editor.extensionManager;
			const marks = storedMarks || (selection.$to.parentOffset && selection.$from.marks());
			tr.split($from.pos, 2, types).scrollIntoView();
			if (!marks || !dispatch) {
				return true;
			}
			const filteredMarks = marks.filter((mark) => splittableMarks.includes(mark.type.name));
			tr.ensureMarks(filteredMarks);
		}
		return true;
	};
function normalizeListType(type) {
	return !type || type === "1" ? null : type;
}
function areListTypesCompatible(typeA, typeB) {
	return normalizeListType(typeA) === normalizeListType(typeB);
}
var joinListBackwards = (tr, listType) => {
	const list = findParentNode((node) => node.type === listType)(tr.selection);
	if (!list) {
		return true;
	}
	const before = tr.doc.resolve(Math.max(0, list.pos - 1)).before(list.depth);
	if (before === void 0) {
		return true;
	}
	const nodeBefore = tr.doc.nodeAt(before);
	const canJoinBackwards = list.node.type === (nodeBefore == null ? void 0 : nodeBefore.type) && canJoin(tr.doc, list.pos);
	if (!canJoinBackwards) {
		return true;
	}
	if (!areListTypesCompatible(list.node.attrs.type, nodeBefore == null ? void 0 : nodeBefore.attrs.type)) {
		return true;
	}
	tr.join(list.pos);
	return true;
};
var joinListForwards = (tr, listType) => {
	const list = findParentNode((node) => node.type === listType)(tr.selection);
	if (!list) {
		return true;
	}
	const after = tr.doc.resolve(list.start).after(list.depth);
	if (after === void 0) {
		return true;
	}
	const nodeAfter = tr.doc.nodeAt(after);
	const canJoinForwards = list.node.type === (nodeAfter == null ? void 0 : nodeAfter.type) && canJoin(tr.doc, after);
	if (!canJoinForwards) {
		return true;
	}
	if (!areListTypesCompatible(list.node.attrs.type, nodeAfter == null ? void 0 : nodeAfter.attrs.type)) {
		return true;
	}
	tr.join(after);
	return true;
};
function createInnerSelectionForWholeDocList(tr) {
	const doc = tr.doc;
	const list = doc.firstChild;
	if (!list) {
		return null;
	}
	const $start = doc.resolve(1);
	const $end = doc.resolve(list.nodeSize - 1);
	return TextSelection.between($start, $end);
}
var toggleList =
	(listTypeOrName, itemTypeOrName, keepMarks, attributes = {}) =>
	({ editor, tr, state, dispatch, chain, commands, can }) => {
		const { extensions, splittableMarks } = editor.extensionManager;
		const listType = getNodeType(listTypeOrName, state.schema);
		const itemType = getNodeType(itemTypeOrName, state.schema);
		const { selection, storedMarks } = state;
		const { $from, $to } = selection;
		const range = $from.blockRange($to);
		const marks = storedMarks || (selection.$to.parentOffset && selection.$from.marks());
		if (!range) {
			return false;
		}
		const parentList = findParentNode((node) => isList(node.type.name, extensions))(selection);
		const isAllSelection = selection.from === 0 && selection.to === state.doc.content.size;
		const topLevelNodes = state.doc.content.content;
		const soleTopLevelNode = topLevelNodes.length === 1 ? topLevelNodes[0] : null;
		const allSelectionList =
			isAllSelection && soleTopLevelNode && isList(soleTopLevelNode.type.name, extensions) ?
				{
					node: soleTopLevelNode,
					pos: 0,
				}
			:	null;
		const currentList = parentList != null ? parentList : allSelectionList;
		const isInsideExistingList = !!parentList && range.depth >= 1 && range.depth - parentList.depth <= 1;
		const hasWholeDocSelectedList = !!allSelectionList;
		if ((isInsideExistingList || hasWholeDocSelectedList) && currentList) {
			if (currentList.node.type === listType) {
				if (isAllSelection && hasWholeDocSelectedList) {
					return chain()
						.command(({ tr: trx, dispatch: disp }) => {
							const nextSelection = createInnerSelectionForWholeDocList(trx);
							if (!nextSelection) {
								return false;
							}
							trx.setSelection(nextSelection);
							if (disp) {
								disp(trx);
							}
							return true;
						})
						.liftListItem(itemType)
						.run();
				}
				return commands.liftListItem(itemType);
			}
			if (isList(currentList.node.type.name, extensions) && listType.validContent(currentList.node.content)) {
				return chain()
					.command(() => {
						tr.setNodeMarkup(currentList.pos, listType);
						return true;
					})
					.command(() => joinListBackwards(tr, listType))
					.command(() => joinListForwards(tr, listType))
					.run();
			}
		}
		if (!keepMarks || !marks || !dispatch) {
			return chain()
				.command(() => {
					const canWrapInList = can().wrapInList(listType, attributes);
					if (canWrapInList) {
						return true;
					}
					return commands.clearNodes();
				})
				.wrapInList(listType, attributes)
				.command(() => joinListBackwards(tr, listType))
				.command(() => joinListForwards(tr, listType))
				.run();
		}
		return chain()
			.command(() => {
				const canWrapInList = can().wrapInList(listType, attributes);
				const filteredMarks = marks.filter((mark) => splittableMarks.includes(mark.type.name));
				tr.ensureMarks(filteredMarks);
				if (canWrapInList) {
					return true;
				}
				return commands.clearNodes();
			})
			.wrapInList(listType, attributes)
			.command(() => joinListBackwards(tr, listType))
			.command(() => joinListForwards(tr, listType))
			.run();
	};

// src/commands/toggleMark.ts
var toggleMark =
	(typeOrName, attributes = {}, options = {}) =>
	({ state, commands }) => {
		const { extendEmptyMarkRange = false } = options;
		const type = getMarkType(typeOrName, state.schema);
		const isActive2 = isMarkActive(state, type, attributes);
		if (isActive2) {
			return commands.unsetMark(type, { extendEmptyMarkRange });
		}
		return commands.setMark(type, attributes);
	};

// src/commands/toggleNode.ts
var toggleNode =
	(typeOrName, toggleTypeOrName, attributes = {}) =>
	({ state, commands }) => {
		const type = getNodeType(typeOrName, state.schema);
		const toggleType = getNodeType(toggleTypeOrName, state.schema);
		const isActive2 = isNodeActive(state, type, attributes);
		let attributesToCopy;
		if (state.selection.$anchor.sameParent(state.selection.$head)) {
			attributesToCopy = state.selection.$anchor.parent.attrs;
		}
		if (isActive2) {
			return commands.setNode(toggleType, attributesToCopy);
		}
		return commands.setNode(type, { ...attributesToCopy, ...attributes });
	};

// src/commands/toggleWrap.ts
var toggleWrap =
	(typeOrName, attributes = {}) =>
	({ state, commands }) => {
		const type = getNodeType(typeOrName, state.schema);
		const isActive2 = isNodeActive(state, type, attributes);
		if (isActive2) {
			return commands.lift(type);
		}
		return commands.wrapIn(type, attributes);
	};

// src/commands/undoInputRule.ts
var undoInputRule =
	() =>
	({ state, dispatch }) => {
		const plugins = state.plugins;
		for (let i = 0; i < plugins.length; i += 1) {
			const plugin = plugins[i];
			let undoable;
			if (plugin.spec.isInputRules && (undoable = plugin.getState(state))) {
				if (dispatch) {
					const tr = state.tr;
					const toUndo = undoable.transform;
					for (let j = toUndo.steps.length - 1; j >= 0; j -= 1) {
						tr.step(toUndo.steps[j].invert(toUndo.docs[j]));
					}
					if (undoable.text) {
						const marks = tr.doc.resolve(undoable.from).marks();
						tr.replaceWith(undoable.from, undoable.to, state.schema.text(undoable.text, marks));
					} else {
						tr.delete(undoable.from, undoable.to);
					}
				}
				return true;
			}
		}
		return false;
	};

// src/commands/unsetAllMarks.ts
var unsetAllMarks =
	(options = {}) =>
	({ tr, dispatch, editor }) => {
		const { ignoreClearable = false } = options;
		const { selection } = tr;
		const { empty, ranges } = selection;
		if (empty) {
			return true;
		}
		const { nonClearableMarks } = editor.extensionManager;
		if (dispatch) {
			const clearableMarkTypes = Object.values(editor.schema.marks).filter((markType) => ignoreClearable || !nonClearableMarks.includes(markType.name));
			ranges.forEach((range) => {
				for (const markType of clearableMarkTypes) {
					tr.removeMark(range.$from.pos, range.$to.pos, markType);
				}
			});
		}
		return true;
	};

// src/commands/unsetMark.ts
var unsetMark =
	(typeOrName, options = {}) =>
	({ tr, state, dispatch }) => {
		var _a;
		const { extendEmptyMarkRange = false } = options;
		const { selection } = tr;
		const type = getMarkType(typeOrName, state.schema);
		const { $from, empty, ranges } = selection;
		if (!dispatch) {
			return true;
		}
		if (empty && extendEmptyMarkRange) {
			let { from, to } = selection;
			const attrs = (_a = $from.marks().find((mark) => mark.type === type)) == null ? void 0 : _a.attrs;
			const range = getMarkRange($from, type, attrs);
			if (range) {
				from = range.from;
				to = range.to;
			}
			tr.removeMark(from, to, type);
		} else {
			ranges.forEach((range) => {
				tr.removeMark(range.$from.pos, range.$to.pos, type);
			});
		}
		tr.removeStoredMark(type);
		return true;
	};

// src/commands/unsetTextDirection.ts
var unsetTextDirection =
	(position) =>
	({ tr, state, dispatch }) => {
		const { selection } = state;
		let from;
		let to;
		if (typeof position === "number") {
			from = position;
			to = position;
		} else if (position && "from" in position && "to" in position) {
			from = position.from;
			to = position.to;
		} else {
			from = selection.from;
			to = selection.to;
		}
		if (dispatch) {
			tr.doc.nodesBetween(from, to, (node, pos) => {
				if (node.isText) {
					return;
				}
				const newAttrs = { ...node.attrs };
				delete newAttrs.dir;
				tr.setNodeMarkup(pos, void 0, newAttrs);
			});
		}
		return true;
	};

// src/commands/updateAttributes.ts
var updateAttributes =
	(typeOrName, attributes = {}) =>
	({ tr, state, dispatch }) => {
		let nodeType = null;
		let markType = null;
		const schemaType = getSchemaTypeNameByName(typeof typeOrName === "string" ? typeOrName : typeOrName.name, state.schema);
		if (!schemaType) {
			return false;
		}
		if (schemaType === "node") {
			nodeType = getNodeType(typeOrName, state.schema);
		}
		if (schemaType === "mark") {
			markType = getMarkType(typeOrName, state.schema);
		}
		let canUpdate = false;
		tr.selection.ranges.forEach((range) => {
			const from = range.$from.pos;
			const to = range.$to.pos;
			let lastPos;
			let lastNode;
			let trimmedFrom;
			let trimmedTo;
			if (tr.selection.empty) {
				state.doc.nodesBetween(from, to, (node, pos) => {
					if (nodeType && nodeType === node.type) {
						canUpdate = true;
						trimmedFrom = Math.max(pos, from);
						trimmedTo = Math.min(pos + node.nodeSize, to);
						lastPos = pos;
						lastNode = node;
					}
				});
			} else {
				state.doc.nodesBetween(from, to, (node, pos) => {
					if (pos < from && nodeType && nodeType === node.type) {
						canUpdate = true;
						trimmedFrom = Math.max(pos, from);
						trimmedTo = Math.min(pos + node.nodeSize, to);
						lastPos = pos;
						lastNode = node;
					}
					if (pos >= from && pos <= to) {
						if (nodeType && nodeType === node.type) {
							canUpdate = true;
							if (dispatch) {
								tr.setNodeMarkup(pos, void 0, {
									...node.attrs,
									...attributes,
								});
							}
						}
						if (markType && node.marks.length) {
							node.marks.forEach((mark) => {
								if (markType === mark.type) {
									canUpdate = true;
									if (dispatch) {
										const trimmedFrom2 = Math.max(pos, from);
										const trimmedTo2 = Math.min(pos + node.nodeSize, to);
										tr.addMark(
											trimmedFrom2,
											trimmedTo2,
											markType.create({
												...mark.attrs,
												...attributes,
											}),
										);
									}
								}
							});
						}
					}
				});
			}
			if (lastNode) {
				if (lastPos !== void 0 && dispatch) {
					tr.setNodeMarkup(lastPos, void 0, {
						...lastNode.attrs,
						...attributes,
					});
				}
				if (markType && lastNode.marks.length) {
					lastNode.marks.forEach((mark) => {
						if (markType === mark.type && dispatch) {
							tr.addMark(
								trimmedFrom,
								trimmedTo,
								markType.create({
									...mark.attrs,
									...attributes,
								}),
							);
						}
					});
				}
			}
		});
		return canUpdate;
	};
var wrapIn =
	(typeOrName, attributes = {}) =>
	({ state, dispatch }) => {
		const type = getNodeType(typeOrName, state.schema);
		return wrapIn$1(type, attributes)(state, dispatch);
	};
var wrapInList =
	(typeOrName, attributes = {}) =>
	({ state, dispatch }) => {
		const type = getNodeType(typeOrName, state.schema);
		return wrapInList$1(type, attributes)(state, dispatch);
	};

// src/EventEmitter.ts
var EventEmitter = class {
	constructor() {
		this.callbacks = {};
	}
	on(event, fn) {
		if (!this.callbacks[event]) {
			this.callbacks[event] = [];
		}
		this.callbacks[event].push(fn);
		return this;
	}
	emit(event, ...args) {
		const callbacks = this.callbacks[event];
		if (callbacks) {
			callbacks.forEach((callback) => callback.apply(this, args));
		}
		return this;
	}
	off(event, fn) {
		const callbacks = this.callbacks[event];
		if (callbacks) {
			if (fn) {
				this.callbacks[event] = callbacks.filter((callback) => callback !== fn);
			} else {
				delete this.callbacks[event];
			}
		}
		return this;
	}
	once(event, fn) {
		const onceFn = (...args) => {
			this.off(event, onceFn);
			fn.apply(this, args);
		};
		return this.on(event, onceFn);
	}
	removeAllListeners() {
		this.callbacks = {};
	}
};
function canInsertNode(state, nodeType) {
	const { selection } = state;
	const { $from } = selection;
	if (selection instanceof NodeSelection) {
		const index = $from.index();
		const parent = $from.parent;
		return parent.canReplaceWith(index, index + 1, nodeType);
	}
	let depth = $from.depth;
	while (depth >= 0) {
		const index = $from.index(depth);
		const parent = $from.node(depth);
		const match = parent.contentMatchAt(index);
		if (match.matchType(nodeType)) {
			return true;
		}
		depth -= 1;
	}
	return false;
}

// src/utilities/createStyleTag.ts
function createStyleTag(style2, nonce, suffix) {
	const tiptapStyleTag = document.querySelector(`style[data-tiptap-style${suffix ? `-${suffix}` : ""}]`);
	if (tiptapStyleTag !== null) {
		return tiptapStyleTag;
	}
	const styleNode = document.createElement("style");
	if (nonce) {
		styleNode.setAttribute("nonce", nonce);
	}
	styleNode.setAttribute(`data-tiptap-style${suffix ? `-${suffix}` : ""}`, "");
	styleNode.innerHTML = style2;
	document.getElementsByTagName("head")[0].appendChild(styleNode);
	return styleNode;
}

// src/utilities/isNumber.ts
function isNumber(value) {
	return typeof value === "number";
}

// src/utilities/isPlainObject.ts
function getType(value) {
	return Object.prototype.toString.call(value).slice(8, -1);
}
function isPlainObject(value) {
	if (getType(value) !== "Object") {
		return false;
	}
	return value.constructor === Object && Object.getPrototypeOf(value) === Object.prototype;
}

// src/utilities/markdown/index.ts
var markdown_exports = {};
__export(markdown_exports, {
	createAtomBlockMarkdownSpec: () => createAtomBlockMarkdownSpec,
	createBlockMarkdownSpec: () => createBlockMarkdownSpec,
	createInlineMarkdownSpec: () => createInlineMarkdownSpec,
	parseAttributes: () => parseAttributes,
	parseIndentedBlocks: () => parseIndentedBlocks,
	renderNestedMarkdownContent: () => renderNestedMarkdownContent,
	serializeAttributes: () => serializeAttributes,
});

// src/utilities/markdown/attributeUtils.ts
function parseAttributes(attrString) {
	if (!(attrString == null ? void 0 : attrString.trim())) {
		return {};
	}
	const attributes = {};
	const quotedStrings = [];
	const tempString = attrString.replace(/["']([^"']*)["']/g, (match) => {
		quotedStrings.push(match);
		return `__QUOTED_${quotedStrings.length - 1}__`;
	});
	const classMatches = tempString.match(/(?:^|\s)\.([\w-]+)/g);
	if (classMatches) {
		const classes = classMatches.map((match) => match.trim().slice(1));
		attributes.class = classes.join(" ");
	}
	const idMatch = tempString.match(/(?:^|\s)#([\w-]+)/);
	if (idMatch) {
		attributes.id = idMatch[1];
	}
	const kvRegex = /([a-zA-Z][\w-]*)\s*=\s*(__QUOTED_\d+__)/g;
	const kvMatches = Array.from(tempString.matchAll(kvRegex));
	kvMatches.forEach(([, key, quotedRef]) => {
		var _a;
		const quotedIndex = parseInt(((_a = quotedRef.match(/__QUOTED_(\d+)__/)) == null ? void 0 : _a[1]) || "0", 10);
		const quotedValue = quotedStrings[quotedIndex];
		if (quotedValue) {
			attributes[key] = quotedValue.slice(1, -1);
		}
	});
	const cleanString = tempString
		.replace(/(?:^|\s)\.([\w-]+)/g, "")
		.replace(/(?:^|\s)#([\w-]+)/g, "")
		.replace(/([a-zA-Z][\w-]*)\s*=\s*__QUOTED_\d+__/g, "")
		.trim();
	if (cleanString) {
		const booleanAttrs = cleanString.split(/\s+/).filter(Boolean);
		booleanAttrs.forEach((attr) => {
			if (attr.match(/^[a-zA-Z][\w-]*$/)) {
				attributes[attr] = true;
			}
		});
	}
	return attributes;
}
function serializeAttributes(attributes) {
	if (!attributes || Object.keys(attributes).length === 0) {
		return "";
	}
	const parts = [];
	if (attributes.class) {
		const classes = String(attributes.class).split(/\s+/).filter(Boolean);
		classes.forEach((cls) => parts.push(`.${cls}`));
	}
	if (attributes.id) {
		parts.push(`#${attributes.id}`);
	}
	Object.entries(attributes).forEach(([key, value]) => {
		if (key === "class" || key === "id") {
			return;
		}
		if (value === true) {
			parts.push(key);
		} else if (value !== false && value != null) {
			parts.push(`${key}="${String(value)}"`);
		}
	});
	return parts.join(" ");
}

// src/utilities/markdown/createAtomBlockMarkdownSpec.ts
function createAtomBlockMarkdownSpec(options) {
	const {
		nodeName,
		name: markdownName,
		parseAttributes: parseAttributes2 = parseAttributes,
		serializeAttributes: serializeAttributes2 = serializeAttributes,
		defaultAttributes = {},
		requiredAttributes = [],
		allowedAttributes,
	} = options;
	const blockName = markdownName || nodeName;
	const filterAttributes = (attrs) => {
		if (!allowedAttributes) {
			return attrs;
		}
		const filtered = {};
		allowedAttributes.forEach((key) => {
			if (key in attrs) {
				filtered[key] = attrs[key];
			}
		});
		return filtered;
	};
	return {
		parseMarkdown: (token, h2) => {
			const attrs = { ...defaultAttributes, ...token.attributes };
			return h2.createNode(nodeName, attrs, []);
		},
		markdownTokenizer: {
			name: nodeName,
			level: "block",
			start(src) {
				var _a;
				const regex = new RegExp(`^:::${blockName}(?:\\s|$)`, "m");
				const index = (_a = src.match(regex)) == null ? void 0 : _a.index;
				return index !== void 0 ? index : -1;
			},
			tokenize(src, _tokens, _lexer) {
				const regex = new RegExp(`^:::${blockName}(?:\\s+\\{([^}]*)\\})?\\s*:::(?:\\n|$)`);
				const match = src.match(regex);
				if (!match) {
					return void 0;
				}
				const attrString = match[1] || "";
				const attributes = parseAttributes2(attrString);
				const missingRequired = requiredAttributes.find((required) => !(required in attributes));
				if (missingRequired) {
					return void 0;
				}
				return {
					type: nodeName,
					raw: match[0],
					attributes,
				};
			},
		},
		renderMarkdown: (node) => {
			const filteredAttrs = filterAttributes(node.attrs || {});
			const attrs = serializeAttributes2(filteredAttrs);
			const attrString = attrs ? ` {${attrs}}` : "";
			return `:::${blockName}${attrString} :::`;
		},
	};
}

// src/utilities/markdown/createBlockMarkdownSpec.ts
function createBlockMarkdownSpec(options) {
	const {
		nodeName,
		name: markdownName,
		getContent,
		parseAttributes: parseAttributes2 = parseAttributes,
		serializeAttributes: serializeAttributes2 = serializeAttributes,
		defaultAttributes = {},
		content = "block",
		allowedAttributes,
	} = options;
	const blockName = markdownName || nodeName;
	const filterAttributes = (attrs) => {
		if (!allowedAttributes) {
			return attrs;
		}
		const filtered = {};
		allowedAttributes.forEach((key) => {
			if (key in attrs) {
				filtered[key] = attrs[key];
			}
		});
		return filtered;
	};
	return {
		parseMarkdown: (token, h2) => {
			let nodeContent;
			if (getContent) {
				const contentResult = getContent(token);
				nodeContent = typeof contentResult === "string" ? [{ type: "text", text: contentResult }] : contentResult;
			} else if (content === "block") {
				nodeContent = h2.parseChildren(token.tokens || []);
			} else {
				nodeContent = h2.parseInline(token.tokens || []);
			}
			const attrs = { ...defaultAttributes, ...token.attributes };
			return h2.createNode(nodeName, attrs, nodeContent);
		},
		markdownTokenizer: {
			name: nodeName,
			level: "block",
			start(src) {
				var _a;
				const regex = new RegExp(`^:::${blockName}`, "m");
				const index = (_a = src.match(regex)) == null ? void 0 : _a.index;
				return index !== void 0 ? index : -1;
			},
			tokenize(src, _tokens, lexer) {
				var _a;
				const openingRegex = new RegExp(`^:::${blockName}(?:\\s+\\{([^}]*)\\})?\\s*\\n`);
				const openingMatch = src.match(openingRegex);
				if (!openingMatch) {
					return void 0;
				}
				const [openingTag, attrString = ""] = openingMatch;
				const attributes = parseAttributes2(attrString);
				let level = 1;
				const position = openingTag.length;
				let matchedContent = "";
				const blockPattern = /^:::([\w-]*)(\s.*)?/gm;
				const remaining = src.slice(position);
				blockPattern.lastIndex = 0;
				for (;;) {
					const match = blockPattern.exec(remaining);
					if (match === null) {
						break;
					}
					const matchPos = match.index;
					const blockType = match[1];
					if ((_a = match[2]) == null ? void 0 : _a.endsWith(":::")) {
						continue;
					}
					if (blockType) {
						level += 1;
					} else {
						level -= 1;
						if (level === 0) {
							const rawContent = remaining.slice(0, matchPos);
							matchedContent = rawContent.trim();
							const fullMatch = src.slice(0, position + matchPos + match[0].length);
							let contentTokens = [];
							if (matchedContent) {
								if (content === "block") {
									contentTokens = lexer.blockTokens(rawContent);
									contentTokens.forEach((token) => {
										if (token.text && (!token.tokens || token.tokens.length === 0)) {
											token.tokens = lexer.inlineTokens(token.text);
										}
									});
									while (contentTokens.length > 0) {
										const lastToken = contentTokens[contentTokens.length - 1];
										if (lastToken.type === "paragraph" && (!lastToken.text || lastToken.text.trim() === "")) {
											contentTokens.pop();
										} else {
											break;
										}
									}
								} else {
									contentTokens = lexer.inlineTokens(matchedContent);
								}
							}
							return {
								type: nodeName,
								raw: fullMatch,
								attributes,
								content: matchedContent,
								tokens: contentTokens,
							};
						}
					}
				}
				return void 0;
			},
		},
		renderMarkdown: (node, h2) => {
			const filteredAttrs = filterAttributes(node.attrs || {});
			const attrs = serializeAttributes2(filteredAttrs);
			const attrString = attrs ? ` {${attrs}}` : "";
			const renderedContent = h2.renderChildren(node.content || [], "\n\n");
			return `:::${blockName}${attrString}

${renderedContent}

:::`;
		},
	};
}

// src/utilities/markdown/createInlineMarkdownSpec.ts
function parseShortcodeAttributes(attrString) {
	if (!attrString.trim()) {
		return {};
	}
	const attributes = {};
	const regex = /(\w+)=(?:"([^"]*)"|'([^']*)')/g;
	let match = regex.exec(attrString);
	while (match !== null) {
		const [, key, doubleQuoted, singleQuoted] = match;
		attributes[key] = doubleQuoted || singleQuoted;
		match = regex.exec(attrString);
	}
	return attributes;
}
function serializeShortcodeAttributes(attrs) {
	return Object.entries(attrs)
		.filter(([, value]) => value !== void 0 && value !== null)
		.map(([key, value]) => `${key}="${value}"`)
		.join(" ");
}
function createInlineMarkdownSpec(options) {
	const {
		nodeName,
		name: shortcodeName,
		getContent,
		parseAttributes: parseAttributes2 = parseShortcodeAttributes,
		serializeAttributes: serializeAttributes2 = serializeShortcodeAttributes,
		defaultAttributes = {},
		selfClosing = false,
		allowedAttributes,
	} = options;
	const shortcode = shortcodeName || nodeName;
	const filterAttributes = (attrs) => {
		if (!allowedAttributes) {
			return attrs;
		}
		const filtered = {};
		allowedAttributes.forEach((attr) => {
			const attrName = typeof attr === "string" ? attr : attr.name;
			const skipIfDefault = typeof attr === "string" ? void 0 : attr.skipIfDefault;
			if (attrName in attrs) {
				const value = attrs[attrName];
				if (skipIfDefault !== void 0 && value === skipIfDefault) {
					return;
				}
				filtered[attrName] = value;
			}
		});
		return filtered;
	};
	const escapedShortcode = shortcode.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
	return {
		parseMarkdown: (token, h2) => {
			const attrs = { ...defaultAttributes, ...token.attributes };
			if (selfClosing) {
				return h2.createNode(nodeName, attrs);
			}
			const content = getContent ? getContent(token) : token.content || "";
			if (content) {
				return h2.createNode(nodeName, attrs, [h2.createTextNode(content)]);
			}
			return h2.createNode(nodeName, attrs, []);
		},
		markdownTokenizer: {
			name: nodeName,
			level: "inline",
			start(src) {
				const startPattern = selfClosing ? new RegExp(`\\[${escapedShortcode}\\s*[^\\]]*\\]`) : new RegExp(`\\[${escapedShortcode}\\s*[^\\]]*\\][\\s\\S]*?\\[\\/${escapedShortcode}\\]`);
				const match = src.match(startPattern);
				const index = match == null ? void 0 : match.index;
				return index !== void 0 ? index : -1;
			},
			tokenize(src, _tokens, _lexer) {
				const tokenPattern =
					selfClosing ? new RegExp(`^\\[${escapedShortcode}\\s*([^\\]]*)\\]`) : new RegExp(`^\\[${escapedShortcode}\\s*([^\\]]*)\\]([\\s\\S]*?)\\[\\/${escapedShortcode}\\]`);
				const match = src.match(tokenPattern);
				if (!match) {
					return void 0;
				}
				let content = "";
				let attrString = "";
				if (selfClosing) {
					const [, attrs] = match;
					attrString = attrs;
				} else {
					const [, attrs, contentMatch] = match;
					attrString = attrs;
					content = contentMatch || "";
				}
				const attributes = parseAttributes2(attrString.trim());
				return {
					type: nodeName,
					raw: match[0],
					content: content.trim(),
					attributes,
				};
			},
		},
		renderMarkdown: (node) => {
			let content = "";
			if (getContent) {
				content = getContent(node);
			} else if (node.content && node.content.length > 0) {
				content = node.content
					.filter((child) => child.type === "text")
					.map((child) => child.text)
					.join("");
			}
			const filteredAttrs = filterAttributes(node.attrs || {});
			const attrs = serializeAttributes2(filteredAttrs);
			const attrString = attrs ? ` ${attrs}` : "";
			if (selfClosing) {
				return `[${shortcode}${attrString}]`;
			}
			return `[${shortcode}${attrString}]${content}[/${shortcode}]`;
		},
	};
}

// src/utilities/markdown/parseIndentedBlocks.ts
function parseIndentedBlocks(src, config, lexer) {
	var _a, _b, _c, _d;
	const lines = src.split("\n");
	const items = [];
	let totalRaw = "";
	let i = 0;
	const baseIndentSize = config.baseIndentSize || 2;
	while (i < lines.length) {
		const currentLine = lines[i];
		const itemMatch = currentLine.match(config.itemPattern);
		if (!itemMatch) {
			if (items.length > 0) {
				break;
			} else if (currentLine.trim() === "") {
				i += 1;
				totalRaw = `${totalRaw}${currentLine}
`;
				continue;
			} else {
				return void 0;
			}
		}
		const itemData = config.extractItemData(itemMatch);
		const { indentLevel, mainContent } = itemData;
		totalRaw = `${totalRaw}${currentLine}
`;
		const itemContent = [mainContent];
		i += 1;
		while (i < lines.length) {
			const nextLine = lines[i];
			if (nextLine.trim() === "") {
				const nextNonEmptyIndex = lines.slice(i + 1).findIndex((l) => l.trim() !== "");
				if (nextNonEmptyIndex === -1) {
					break;
				}
				const nextNonEmpty = lines[i + 1 + nextNonEmptyIndex];
				const nextIndent2 = ((_b = (_a = nextNonEmpty.match(/^(\s*)/)) == null ? void 0 : _a[1]) == null ? void 0 : _b.length) || 0;
				if (nextIndent2 > indentLevel) {
					itemContent.push(nextLine);
					totalRaw = `${totalRaw}${nextLine}
`;
					i += 1;
					continue;
				} else {
					break;
				}
			}
			const nextIndent = ((_d = (_c = nextLine.match(/^(\s*)/)) == null ? void 0 : _c[1]) == null ? void 0 : _d.length) || 0;
			if (nextIndent > indentLevel) {
				itemContent.push(nextLine);
				totalRaw = `${totalRaw}${nextLine}
`;
				i += 1;
			} else {
				break;
			}
		}
		let nestedTokens;
		const nestedContent = itemContent.slice(1);
		if (nestedContent.length > 0) {
			const dedentedNested = nestedContent.map((nestedLine) => nestedLine.slice(indentLevel + baseIndentSize)).join("\n");
			if (dedentedNested.trim()) {
				if (config.customNestedParser) {
					nestedTokens = config.customNestedParser(dedentedNested);
				} else {
					nestedTokens = lexer.blockTokens(dedentedNested);
				}
			}
		}
		const token = config.createToken(itemData, nestedTokens);
		items.push(token);
	}
	if (items.length === 0) {
		return void 0;
	}
	return {
		items,
		raw: totalRaw,
	};
}

// src/utilities/markdown/renderNestedMarkdownContent.ts
function renderNestedMarkdownContent(node, h2, prefixOrGenerator, ctx) {
	if (!node || !Array.isArray(node.content)) {
		return "";
	}
	const prefix = typeof prefixOrGenerator === "function" ? prefixOrGenerator(ctx) : prefixOrGenerator;
	const [content, ...children] = node.content;
	const mainContent = h2.renderChildren([content]);
	let output = `${prefix}${mainContent}`;
	if (children && children.length > 0) {
		children.forEach((child, index) => {
			var _a, _b;
			const childContent = (_b = (_a = h2.renderChild) == null ? void 0 : _a.call(h2, child, index + 1)) != null ? _b : h2.renderChildren([child]);
			if (childContent !== void 0 && childContent !== null) {
				const indentedChild = childContent
					.split("\n")
					.map((line) => (line ? h2.indent(line) : h2.indent("")))
					.join("\n");
				output +=
					child.type === "paragraph" ?
						`

${indentedChild}`
					:	`
${indentedChild}`;
			}
		});
	}
	return output;
}

// src/utilities/mergeDeep.ts
function mergeDeep(target, source) {
	const output = { ...target };
	if (isPlainObject(target) && isPlainObject(source)) {
		Object.keys(source).forEach((key) => {
			if (isPlainObject(source[key]) && isPlainObject(target[key])) {
				output[key] = mergeDeep(target[key], source[key]);
			} else {
				output[key] = source[key];
			}
		});
	}
	return output;
}

// src/MarkView.ts
function updateMarkViewAttributes(checkMark, editor, attrs = {}) {
	const { state } = editor;
	const { doc, tr } = state;
	const thisMark = checkMark;
	doc.descendants((node, pos) => {
		const from = tr.mapping.map(pos);
		const to = tr.mapping.map(pos) + node.nodeSize;
		let foundMark = null;
		node.marks.forEach((mark) => {
			if (mark !== thisMark) {
				return false;
			}
			foundMark = mark;
		});
		if (!foundMark) {
			return;
		}
		let needsUpdate = false;
		Object.keys(attrs).forEach((k) => {
			if (attrs[k] !== foundMark.attrs[k]) {
				needsUpdate = true;
			}
		});
		if (needsUpdate) {
			const updatedMark = checkMark.type.create({
				...checkMark.attrs,
				...attrs,
			});
			tr.removeMark(from, to, checkMark.type);
			tr.addMark(from, to, updatedMark);
		}
	});
	if (tr.docChanged) {
		editor.view.dispatch(tr);
	}
}
var InputRule = class {
	constructor(config) {
		var _a;
		this.find = config.find;
		this.handler = config.handler;
		this.undoable = (_a = config.undoable) != null ? _a : true;
	}
};
var inputRuleMatcherHandler = (text, find) => {
	if (isRegExp(find)) {
		return find.exec(text);
	}
	const inputRuleMatch = find(text);
	if (!inputRuleMatch) {
		return null;
	}
	const result = [inputRuleMatch.text];
	result.index = inputRuleMatch.index;
	result.input = text;
	result.data = inputRuleMatch.data;
	if (inputRuleMatch.replaceWith) {
		if (!inputRuleMatch.text.includes(inputRuleMatch.replaceWith)) {
			console.warn('[tiptap warn]: "inputRuleMatch.replaceWith" must be part of "inputRuleMatch.text".');
		}
		result.push(inputRuleMatch.replaceWith);
	}
	return result;
};
function run$2(config) {
	var _a;
	const { editor, from, to, text, rules, plugin } = config;
	const { view } = editor;
	if (view.composing) {
		return false;
	}
	const $from = view.state.doc.resolve(from);
	if (
		// check for code node
		$from.parent.type.spec.code || // check for code mark
		!!((_a = $from.nodeBefore || $from.nodeAfter) == null ? void 0 : _a.marks.find((mark) => mark.type.spec.code))
	) {
		return false;
	}
	let matched = false;
	const textBefore = getTextContentFromNodes($from) + text;
	rules.forEach((rule) => {
		if (matched) {
			return;
		}
		const match = inputRuleMatcherHandler(textBefore, rule.find);
		if (!match) {
			return;
		}
		const tr = view.state.tr;
		const state = createChainableState({
			state: view.state,
			transaction: tr,
		});
		const range = {
			from: from - (match[0].length - text.length),
			to,
		};
		const { commands, chain, can } = new CommandManager({
			editor,
			state,
		});
		const handler = rule.handler({
			state,
			range,
			match,
			commands,
			chain,
			can,
		});
		if (handler === null || !tr.steps.length) {
			return;
		}
		if (rule.undoable) {
			tr.setMeta(plugin, {
				transform: tr,
				from,
				to,
				text,
			});
		}
		view.dispatch(tr);
		matched = true;
	});
	return matched;
}
function inputRulesPlugin(props) {
	const { editor, rules } = props;
	const plugin = new Plugin({
		state: {
			init() {
				return null;
			},
			apply(tr, prev, state) {
				const stored = tr.getMeta(plugin);
				if (stored) {
					return stored;
				}
				const simulatedInputMeta = tr.getMeta("applyInputRules");
				const isSimulatedInput = !!simulatedInputMeta;
				if (isSimulatedInput) {
					setTimeout(() => {
						let { text } = simulatedInputMeta;
						if (typeof text === "string") {
							text = text;
						} else {
							text = getHTMLFromFragment(Fragment.from(text), state.schema);
						}
						const { from } = simulatedInputMeta;
						const to = from + text.length;
						run$2({
							editor,
							from,
							to,
							text,
							rules,
							plugin,
						});
					});
				}
				return tr.selectionSet || tr.docChanged ? null : prev;
			},
		},
		props: {
			handleTextInput(view, from, to, text) {
				return run$2({
					editor,
					from,
					to,
					text,
					rules,
					plugin,
				});
			},
			handleDOMEvents: {
				compositionend: (view) => {
					setTimeout(() => {
						const { $cursor } = view.state.selection;
						if ($cursor) {
							run$2({
								editor,
								from: $cursor.pos,
								to: $cursor.pos,
								text: "",
								rules,
								plugin,
							});
						}
					});
					return false;
				},
			},
			// add support for input rules to trigger on enter
			// this is useful for example for code blocks
			handleKeyDown(view, event) {
				if (event.key !== "Enter") {
					return false;
				}
				const { $cursor } = view.state.selection;
				if ($cursor) {
					return run$2({
						editor,
						from: $cursor.pos,
						to: $cursor.pos,
						text: "\n",
						rules,
						plugin,
					});
				}
				return false;
			},
		},
		// @ts-ignore
		isInputRules: true,
	});
	return plugin;
}

// src/Extendable.ts
var Extendable = class {
	constructor(config = {}) {
		this.type = "extendable";
		this.parent = null;
		this.child = null;
		this.name = "";
		this.config = {
			name: this.name,
		};
		this.config = {
			...this.config,
			...config,
		};
		this.name = this.config.name;
	}
	get options() {
		return {
			...callOrReturn(
				getExtensionField(this, "addOptions", {
					name: this.name,
				}),
			),
		};
	}
	get storage() {
		return {
			...callOrReturn(
				getExtensionField(this, "addStorage", {
					name: this.name,
					options: this.options,
				}),
			),
		};
	}
	configure(options = {}) {
		const extension = this.extend({
			...this.config,
			addOptions: () => {
				return mergeDeep(this.options, options);
			},
		});
		extension.name = this.name;
		extension.parent = this.parent;
		this.child = null;
		return extension;
	}
	extend(extendedConfig = {}) {
		const extension = new this.constructor({ ...this.config, ...extendedConfig });
		extension.parent = this;
		this.child = extension;
		extension.name = "name" in extendedConfig ? extendedConfig.name : extension.parent.name;
		return extension;
	}
};

// src/Mark.ts
var Mark = class _Mark extends Extendable {
	constructor() {
		super(...arguments);
		this.type = "mark";
	}
	/**
	 * Create a new Mark instance
	 * @param config - Mark configuration object or a function that returns a configuration object
	 */
	static create(config = {}) {
		const resolvedConfig = typeof config === "function" ? config() : config;
		return new _Mark(resolvedConfig);
	}
	static handleExit({ editor, mark }) {
		const { tr } = editor.state;
		const currentPos = editor.state.selection.$from;
		const isAtEnd = currentPos.pos === currentPos.end();
		if (isAtEnd) {
			const currentMarks = currentPos.marks();
			const isInMark = !!currentMarks.find((m) => (m == null ? void 0 : m.type.name) === mark.name);
			if (!isInMark) {
				return false;
			}
			const removeMark = currentMarks.find((m) => (m == null ? void 0 : m.type.name) === mark.name);
			if (removeMark) {
				tr.removeStoredMark(removeMark);
			}
			tr.insertText(" ", currentPos.pos);
			editor.view.dispatch(tr);
			return true;
		}
		return false;
	}
	configure(options) {
		return super.configure(options);
	}
	extend(extendedConfig) {
		const resolvedConfig = typeof extendedConfig === "function" ? extendedConfig() : extendedConfig;
		return super.extend(resolvedConfig);
	}
};
var PasteRule = class {
	constructor(config) {
		this.find = config.find;
		this.handler = config.handler;
	}
};
var pasteRuleMatcherHandler = (text, find, event) => {
	if (isRegExp(find)) {
		return [...text.matchAll(find)];
	}
	const matches = find(text, event);
	if (!matches) {
		return [];
	}
	return matches.map((pasteRuleMatch) => {
		const result = [pasteRuleMatch.text];
		result.index = pasteRuleMatch.index;
		result.input = text;
		result.data = pasteRuleMatch.data;
		if (pasteRuleMatch.replaceWith) {
			if (!pasteRuleMatch.text.includes(pasteRuleMatch.replaceWith)) {
				console.warn('[tiptap warn]: "pasteRuleMatch.replaceWith" must be part of "pasteRuleMatch.text".');
			}
			result.push(pasteRuleMatch.replaceWith);
		}
		return result;
	});
};
function run2(config) {
	const { editor, state, from, to, rule, pasteEvent, dropEvent } = config;
	const { commands, chain, can } = new CommandManager({
		editor,
		state,
	});
	const handlers = [];
	state.doc.nodesBetween(from, to, (node, pos) => {
		var _a, _b, _c, _d, _e;
		if (((_b = (_a = node.type) == null ? void 0 : _a.spec) == null ? void 0 : _b.code) || !(node.isText || node.isTextblock || node.isInline)) {
			return;
		}
		const contentSize = (_e = (_d = (_c = node.content) == null ? void 0 : _c.size) != null ? _d : node.nodeSize) != null ? _e : 0;
		const resolvedFrom = Math.max(from, pos);
		const resolvedTo = Math.min(to, pos + contentSize);
		if (resolvedFrom >= resolvedTo) {
			return;
		}
		const textToMatch = node.isText ? node.text || "" : node.textBetween(resolvedFrom - pos, resolvedTo - pos, void 0, "\uFFFC");
		const matches = pasteRuleMatcherHandler(textToMatch, rule.find, pasteEvent);
		matches.forEach((match) => {
			if (match.index === void 0) {
				return;
			}
			const start = resolvedFrom + match.index + 1;
			const end = start + match[0].length;
			const range = {
				from: state.tr.mapping.map(start),
				to: state.tr.mapping.map(end),
			};
			const handler = rule.handler({
				state,
				range,
				match,
				commands,
				chain,
				can,
				pasteEvent,
				dropEvent,
			});
			handlers.push(handler);
		});
	});
	const success = handlers.every((handler) => handler !== null);
	return success;
}
var tiptapDragFromOtherEditor = null;
var createClipboardPasteEvent = (text) => {
	var _a;
	const event = new ClipboardEvent("paste", {
		clipboardData: new DataTransfer(),
	});
	(_a = event.clipboardData) == null ? void 0 : _a.setData("text/html", text);
	return event;
};
function pasteRulesPlugin(props) {
	const { editor, rules } = props;
	let dragSourceElement = null;
	let isPastedFromProseMirror = false;
	let isDroppedFromProseMirror = false;
	let pasteEvent = typeof ClipboardEvent !== "undefined" ? new ClipboardEvent("paste") : null;
	let dropEvent;
	try {
		dropEvent = typeof DragEvent !== "undefined" ? new DragEvent("drop") : null;
	} catch {
		dropEvent = null;
	}
	const processEvent = ({ state, from, to, rule, pasteEvt }) => {
		const tr = state.tr;
		const chainableState = createChainableState({
			state,
			transaction: tr,
		});
		const handler = run2({
			editor,
			state: chainableState,
			from: Math.max(from - 1, 0),
			to: to.b - 1,
			rule,
			pasteEvent: pasteEvt,
			dropEvent,
		});
		if (!handler || !tr.steps.length) {
			return;
		}
		try {
			dropEvent = typeof DragEvent !== "undefined" ? new DragEvent("drop") : null;
		} catch {
			dropEvent = null;
		}
		pasteEvent = typeof ClipboardEvent !== "undefined" ? new ClipboardEvent("paste") : null;
		return tr;
	};
	const plugins = rules.map((rule) => {
		return new Plugin({
			// we register a global drag handler to track the current drag source element
			view(view) {
				const handleDragstart = (event) => {
					var _a;
					dragSourceElement =
						(
							(_a = view.dom.parentElement) == null ? void 0 : _a.contains(event.target)
						) ?
							view.dom.parentElement
						:	null;
					if (dragSourceElement) {
						tiptapDragFromOtherEditor = editor;
					}
				};
				const handleDragend = () => {
					if (tiptapDragFromOtherEditor) {
						tiptapDragFromOtherEditor = null;
					}
				};
				window.addEventListener("dragstart", handleDragstart);
				window.addEventListener("dragend", handleDragend);
				return {
					destroy() {
						window.removeEventListener("dragstart", handleDragstart);
						window.removeEventListener("dragend", handleDragend);
					},
				};
			},
			props: {
				handleDOMEvents: {
					drop: (view, event) => {
						isDroppedFromProseMirror = dragSourceElement === view.dom.parentElement;
						dropEvent = event;
						if (!isDroppedFromProseMirror) {
							const dragFromOtherEditor = tiptapDragFromOtherEditor;
							if (dragFromOtherEditor == null ? void 0 : dragFromOtherEditor.isEditable) {
								setTimeout(() => {
									const selection = dragFromOtherEditor.state.selection;
									if (selection) {
										dragFromOtherEditor.commands.deleteRange({
											from: selection.from,
											to: selection.to,
										});
									}
								}, 10);
							}
						}
						return false;
					},
					paste: (_view, event) => {
						var _a;
						const html = (_a = event.clipboardData) == null ? void 0 : _a.getData("text/html");
						pasteEvent = event;
						isPastedFromProseMirror = !!(html == null ? void 0 : html.includes("data-pm-slice"));
						return false;
					},
				},
			},
			appendTransaction: (transactions, oldState, state) => {
				const transaction = transactions[0];
				const isPaste = transaction.getMeta("uiEvent") === "paste" && !isPastedFromProseMirror;
				const isDrop = transaction.getMeta("uiEvent") === "drop" && !isDroppedFromProseMirror;
				const simulatedPasteMeta = transaction.getMeta("applyPasteRules");
				const isSimulatedPaste = !!simulatedPasteMeta;
				if (!isPaste && !isDrop && !isSimulatedPaste) {
					return;
				}
				if (isSimulatedPaste) {
					let { text } = simulatedPasteMeta;
					if (typeof text === "string") {
						text = text;
					} else {
						text = getHTMLFromFragment(Fragment.from(text), state.schema);
					}
					const { from: from2 } = simulatedPasteMeta;
					const to2 = from2 + text.length;
					const pasteEvt = createClipboardPasteEvent(text);
					return processEvent({
						rule,
						state,
						from: from2,
						to: { b: to2 },
						pasteEvt,
					});
				}
				const from = oldState.doc.content.findDiffStart(state.doc.content);
				const to = oldState.doc.content.findDiffEnd(state.doc.content);
				if (!isNumber(from) || !to || from === to.b) {
					return;
				}
				return processEvent({
					rule,
					state,
					from,
					to,
					pasteEvt: pasteEvent,
				});
			},
		});
	});
	return plugins;
}

// src/ExtensionManager.ts
var ExtensionManager = class {
	constructor(extensions, editor) {
		this.splittableMarks = [];
		this.nonClearableMarks = [];
		this.editor = editor;
		this.baseExtensions = extensions;
		this.extensions = resolveExtensions(extensions);
		this.schema = getSchemaByResolvedExtensions(this.extensions, editor);
		this.setupExtensions();
	}
	/**
	 * Get all commands from the extensions.
	 * @returns An object with all commands where the key is the command name and the value is the command function
	 */
	get commands() {
		return this.extensions.reduce((commands, extension) => {
			const context = {
				name: extension.name,
				options: extension.options,
				storage: this.editor.extensionStorage[extension.name],
				editor: this.editor,
				type: getSchemaTypeByName(extension.name, this.schema),
			};
			const addCommands = getExtensionField(extension, "addCommands", context);
			if (!addCommands) {
				return commands;
			}
			return {
				...commands,
				...addCommands(),
			};
		}, {});
	}
	/**
	 * Get all registered Prosemirror plugins from the extensions.
	 * @returns An array of Prosemirror plugins
	 */
	get plugins() {
		const { editor } = this;
		const extensions = sortExtensions([...this.extensions].reverse());
		const allPlugins = extensions.flatMap((extension) => {
			const context = {
				name: extension.name,
				options: extension.options,
				storage: this.editor.extensionStorage[extension.name],
				editor,
				type: getSchemaTypeByName(extension.name, this.schema),
			};
			const plugins = [];
			const addKeyboardShortcuts = getExtensionField(extension, "addKeyboardShortcuts", context);
			let defaultBindings = {};
			if (extension.type === "mark" && getExtensionField(extension, "exitable", context)) {
				defaultBindings.ArrowRight = () => Mark.handleExit({ editor, mark: extension });
			}
			if (addKeyboardShortcuts) {
				const bindings = Object.fromEntries(
					Object.entries(addKeyboardShortcuts()).map(([shortcut, method]) => {
						return [shortcut, () => method({ editor })];
					}),
				);
				defaultBindings = { ...defaultBindings, ...bindings };
			}
			const keyMapPlugin = keymap(defaultBindings);
			plugins.push(keyMapPlugin);
			const addInputRules = getExtensionField(extension, "addInputRules", context);
			if (isExtensionRulesEnabled(extension, editor.options.enableInputRules) && addInputRules) {
				const rules = addInputRules();
				if (rules && rules.length) {
					const inputResult = inputRulesPlugin({
						editor,
						rules,
					});
					const inputPlugins = Array.isArray(inputResult) ? inputResult : [inputResult];
					plugins.push(...inputPlugins);
				}
			}
			const addPasteRules = getExtensionField(extension, "addPasteRules", context);
			if (isExtensionRulesEnabled(extension, editor.options.enablePasteRules) && addPasteRules) {
				const rules = addPasteRules();
				if (rules && rules.length) {
					const pasteRules = pasteRulesPlugin({ editor, rules });
					plugins.push(...pasteRules);
				}
			}
			const addProseMirrorPlugins = getExtensionField(extension, "addProseMirrorPlugins", context);
			if (addProseMirrorPlugins) {
				const proseMirrorPlugins = addProseMirrorPlugins();
				plugins.push(...proseMirrorPlugins);
			}
			return plugins;
		});
		return allPlugins;
	}
	/**
	 * Get all attributes from the extensions.
	 * @returns An array of attributes
	 */
	get attributes() {
		return getAttributesFromExtensions(this.extensions);
	}
	/**
	 * Get all node views from the extensions.
	 * @returns An object with all node views where the key is the node name and the value is the node view function
	 */
	get nodeViews() {
		const { editor } = this;
		const { nodeExtensions } = splitExtensions(this.extensions);
		return Object.fromEntries(
			nodeExtensions
				.filter((extension) => !!getExtensionField(extension, "addNodeView"))
				.map((extension) => {
					const extensionAttributes = this.attributes.filter((attribute) => attribute.type === extension.name);
					const context = {
						name: extension.name,
						options: extension.options,
						storage: this.editor.extensionStorage[extension.name],
						editor,
						type: getNodeType(extension.name, this.schema),
					};
					const addNodeView = getExtensionField(extension, "addNodeView", context);
					if (!addNodeView) {
						return [];
					}
					const nodeViewResult = addNodeView();
					if (!nodeViewResult) {
						return [];
					}
					const nodeview = (node, view, getPos, decorations, innerDecorations) => {
						const HTMLAttributes = getRenderedAttributes(node, extensionAttributes);
						return nodeViewResult({
							// pass-through
							node,
							view,
							getPos,
							decorations,
							innerDecorations,
							// tiptap-specific
							editor,
							extension,
							HTMLAttributes,
						});
					};
					return [extension.name, nodeview];
				}),
		);
	}
	/**
	 * Get the composed dispatchTransaction function from all extensions.
	 * @param baseDispatch The base dispatch function (e.g. from the editor or user props)
	 * @returns A composed dispatch function
	 */
	dispatchTransaction(baseDispatch) {
		const { editor } = this;
		const extensions = sortExtensions([...this.extensions].reverse());
		return extensions.reduceRight((next, extension) => {
			const context = {
				name: extension.name,
				options: extension.options,
				storage: this.editor.extensionStorage[extension.name],
				editor,
				type: getSchemaTypeByName(extension.name, this.schema),
			};
			const dispatchTransaction = getExtensionField(extension, "dispatchTransaction", context);
			if (!dispatchTransaction) {
				return next;
			}
			return (transaction) => {
				dispatchTransaction.call(context, { transaction, next });
			};
		}, baseDispatch);
	}
	/**
	 * Get the composed transformPastedHTML function from all extensions.
	 * @param baseTransform The base transform function (e.g. from the editor props)
	 * @returns A composed transform function that chains all extension transforms
	 */
	transformPastedHTML(baseTransform) {
		const { editor } = this;
		const extensions = sortExtensions([...this.extensions]);
		return extensions.reduce(
			(transform, extension) => {
				const context = {
					name: extension.name,
					options: extension.options,
					storage: this.editor.extensionStorage[extension.name],
					editor,
					type: getSchemaTypeByName(extension.name, this.schema),
				};
				const extensionTransform = getExtensionField(extension, "transformPastedHTML", context);
				if (!extensionTransform) {
					return transform;
				}
				return (html, view) => {
					const transformedHtml = transform(html, view);
					return extensionTransform.call(context, transformedHtml);
				};
			},
			baseTransform || ((html) => html),
		);
	}
	get markViews() {
		const { editor } = this;
		const { markExtensions } = splitExtensions(this.extensions);
		return Object.fromEntries(
			markExtensions
				.filter((extension) => !!getExtensionField(extension, "addMarkView"))
				.map((extension) => {
					const extensionAttributes = this.attributes.filter((attribute) => attribute.type === extension.name);
					const context = {
						name: extension.name,
						options: extension.options,
						storage: this.editor.extensionStorage[extension.name],
						editor,
						type: getMarkType(extension.name, this.schema),
					};
					const addMarkView = getExtensionField(extension, "addMarkView", context);
					if (!addMarkView) {
						return [];
					}
					const markView = (mark, view, inline) => {
						const HTMLAttributes = getRenderedAttributes(mark, extensionAttributes);
						return addMarkView()({
							// pass-through
							mark,
							view,
							inline,
							// tiptap-specific
							editor,
							extension,
							HTMLAttributes,
							updateAttributes: (attrs) => {
								updateMarkViewAttributes(mark, editor, attrs);
							},
						});
					};
					return [extension.name, markView];
				}),
		);
	}
	/**
	 * Destroy the extension manager and clean up all extension references
	 * to prevent memory leaks through parent/child extension chains.
	 *
	 * Walks each extension's full parent chain and nulls every forward
	 * `parent.child → current` link where the parent still points to the
	 * current node. This breaks the retention path from module-scope
	 * singleton roots through deep extend() chains.
	 *
	 * Only ancestor `.child` links matching the current chain are cleared.
	 * The `.parent` pointer on ancestors is never touched — extensions
	 * may be shared across live editors, so their own backward references
	 * and non-matching forward links must remain intact.
	 */
	destroy() {
		this.extensions.forEach((extension) => {
			let current = extension;
			while (current.parent) {
				const parent = current.parent;
				if (parent.child === current) {
					parent.child = null;
				}
				current = parent;
			}
		});
		this.extensions = [];
		this.baseExtensions = [];
		this.schema = null;
		this.editor = null;
	}
	/**
	 * Go through all extensions, create extension storages & setup marks
	 * & bind editor event listener.
	 */
	setupExtensions() {
		const extensions = this.extensions;
		this.editor.extensionStorage = Object.fromEntries(extensions.map((extension) => [extension.name, extension.storage]));
		extensions.forEach((extension) => {
			var _a, _b;
			const context = {
				name: extension.name,
				options: extension.options,
				storage: this.editor.extensionStorage[extension.name],
				editor: this.editor,
				type: getSchemaTypeByName(extension.name, this.schema),
			};
			if (extension.type === "mark") {
				const keepOnSplit = (_a = callOrReturn(getExtensionField(extension, "keepOnSplit", context))) != null ? _a : true;
				if (keepOnSplit) {
					this.splittableMarks.push(extension.name);
				}
				const clearable = (_b = callOrReturn(getExtensionField(extension, "clearable", context))) != null ? _b : true;
				if (!clearable) {
					this.nonClearableMarks.push(extension.name);
				}
			}
			const onBeforeCreate = getExtensionField(extension, "onBeforeCreate", context);
			const onCreate = getExtensionField(extension, "onCreate", context);
			const onUpdate = getExtensionField(extension, "onUpdate", context);
			const onSelectionUpdate = getExtensionField(extension, "onSelectionUpdate", context);
			const onTransaction = getExtensionField(extension, "onTransaction", context);
			const onFocus = getExtensionField(extension, "onFocus", context);
			const onBlur = getExtensionField(extension, "onBlur", context);
			const onDestroy = getExtensionField(extension, "onDestroy", context);
			if (onBeforeCreate) {
				this.editor.on("beforeCreate", onBeforeCreate);
			}
			if (onCreate) {
				this.editor.on("create", onCreate);
			}
			if (onUpdate) {
				this.editor.on("update", onUpdate);
			}
			if (onSelectionUpdate) {
				this.editor.on("selectionUpdate", onSelectionUpdate);
			}
			if (onTransaction) {
				this.editor.on("transaction", onTransaction);
			}
			if (onFocus) {
				this.editor.on("focus", onFocus);
			}
			if (onBlur) {
				this.editor.on("blur", onBlur);
			}
			if (onDestroy) {
				this.editor.on("destroy", onDestroy);
			}
		});
	}
};
ExtensionManager.resolve = resolveExtensions;
ExtensionManager.sort = sortExtensions;
ExtensionManager.flatten = flattenExtensions;

// src/extensions/index.ts
var extensions_exports = {};
__export(extensions_exports, {
	ClipboardTextSerializer: () => ClipboardTextSerializer,
	Commands: () => Commands,
	Delete: () => Delete,
	Drop: () => Drop,
	Editable: () => Editable,
	FocusEvents: () => FocusEvents,
	Keymap: () => Keymap,
	Paste: () => Paste,
	Tabindex: () => Tabindex,
	TextDirection: () => TextDirection,
	focusEventsPluginKey: () => focusEventsPluginKey,
});

// src/Extension.ts
var Extension = class _Extension extends Extendable {
	constructor() {
		super(...arguments);
		this.type = "extension";
	}
	/**
	 * Create a new Extension instance
	 * @param config - Extension configuration object or a function that returns a configuration object
	 */
	static create(config = {}) {
		const resolvedConfig = typeof config === "function" ? config() : config;
		return new _Extension(resolvedConfig);
	}
	configure(options) {
		return super.configure(options);
	}
	extend(extendedConfig) {
		const resolvedConfig = typeof extendedConfig === "function" ? extendedConfig() : extendedConfig;
		return super.extend(resolvedConfig);
	}
};

// src/extensions/clipboardTextSerializer.ts
var ClipboardTextSerializer = Extension.create({
	name: "clipboardTextSerializer",
	addOptions() {
		return {
			blockSeparator: void 0,
		};
	},
	addProseMirrorPlugins() {
		return [
			new Plugin({
				key: new PluginKey("clipboardTextSerializer"),
				props: {
					clipboardTextSerializer: () => {
						const { editor } = this;
						const { state, schema } = editor;
						const { doc, selection } = state;
						const textSerializers = getTextSerializersFromSchema(schema);
						const { blockSeparator } = this.options;
						const options = {
							...(blockSeparator !== void 0 ? { blockSeparator } : {}),
							textSerializers,
						};
						const sortedRanges = [...selection.ranges].sort((a, b) => a.$from.pos - b.$from.pos);
						return sortedRanges.map(({ $from, $to }) => getTextBetween(doc, { from: $from.pos, to: $to.pos }, options)).join(blockSeparator != null ? blockSeparator : "\n\n");
					},
				},
			}),
		];
	},
});

// src/extensions/commands.ts
var Commands = Extension.create({
	name: "commands",
	addCommands() {
		return {
			...commands_exports,
		};
	},
});
var Delete = Extension.create({
	name: "delete",
	onUpdate({ transaction, appendedTransactions }) {
		var _a, _b, _c;
		const callback = () => {
			var _a2, _b2, _c2, _d;
			if (
				(
					(_d =
						(_c2 = (_b2 = (_a2 = this.editor.options.coreExtensionOptions) == null ? void 0 : _a2.delete) == null ? void 0 : _b2.filterTransaction) == null ?
							void 0
						:	_c2.call(_b2, transaction)) != null
				) ?
					_d
				:	transaction.getMeta("y-sync$")
			) {
				return;
			}
			const nextTransaction = combineTransactionSteps(transaction.before, [transaction, ...appendedTransactions]);
			const changes = getChangedRanges(nextTransaction);
			changes.forEach((change) => {
				if (nextTransaction.mapping.mapResult(change.oldRange.from).deletedAfter && nextTransaction.mapping.mapResult(change.oldRange.to).deletedBefore) {
					nextTransaction.before.nodesBetween(change.oldRange.from, change.oldRange.to, (node, from) => {
						const to = from + node.nodeSize - 2;
						const isFullyWithinRange = change.oldRange.from <= from && to <= change.oldRange.to;
						this.editor.emit("delete", {
							type: "node",
							node,
							from,
							to,
							newFrom: nextTransaction.mapping.map(from),
							newTo: nextTransaction.mapping.map(to),
							deletedRange: change.oldRange,
							newRange: change.newRange,
							partial: !isFullyWithinRange,
							editor: this.editor,
							transaction,
							combinedTransform: nextTransaction,
						});
					});
				}
			});
			const mapping = nextTransaction.mapping;
			nextTransaction.steps.forEach((step, index) => {
				var _a3, _b3;
				if (step instanceof RemoveMarkStep) {
					const newStart = mapping.slice(index).map(step.from, -1);
					const newEnd = mapping.slice(index).map(step.to);
					const oldStart = mapping.invert().map(newStart, -1);
					const oldEnd = mapping.invert().map(newEnd);
					const foundBeforeMark =
						newStart > 0 ?
							(_a3 = nextTransaction.doc.nodeAt(newStart - 1)) == null ?
								void 0
							:	_a3.marks.some((mark) => mark.eq(step.mark))
						:	false;
					const foundAfterMark = (_b3 = nextTransaction.doc.nodeAt(newEnd)) == null ? void 0 : _b3.marks.some((mark) => mark.eq(step.mark));
					this.editor.emit("delete", {
						type: "mark",
						mark: step.mark,
						from: step.from,
						to: step.to,
						deletedRange: {
							from: oldStart,
							to: oldEnd,
						},
						newRange: {
							from: newStart,
							to: newEnd,
						},
						partial: Boolean(foundAfterMark || foundBeforeMark),
						editor: this.editor,
						transaction,
						combinedTransform: nextTransaction,
					});
				}
			});
		};
		if ((_c = (_b = (_a = this.editor.options.coreExtensionOptions) == null ? void 0 : _a.delete) == null ? void 0 : _b.async) != null ? _c : true) {
			setTimeout(callback, 0);
		} else {
			callback();
		}
	},
});
var Drop = Extension.create({
	name: "drop",
	addProseMirrorPlugins() {
		return [
			new Plugin({
				key: new PluginKey("tiptapDrop"),
				props: {
					handleDrop: (_, e, slice, moved) => {
						this.editor.emit("drop", {
							editor: this.editor,
							event: e,
							slice,
							moved,
						});
					},
				},
			}),
		];
	},
});
var Editable = Extension.create({
	name: "editable",
	addProseMirrorPlugins() {
		return [
			new Plugin({
				key: new PluginKey("editable"),
				props: {
					editable: () => this.editor.options.editable,
				},
			}),
		];
	},
});
var focusEventsPluginKey = new PluginKey("focusEvents");
var FocusEvents = Extension.create({
	name: "focusEvents",
	addProseMirrorPlugins() {
		const { editor } = this;
		return [
			new Plugin({
				key: focusEventsPluginKey,
				props: {
					handleDOMEvents: {
						focus: (view, event) => {
							editor.isFocused = true;
							const transaction = editor.state.tr.setMeta("focus", { event }).setMeta("addToHistory", false);
							view.dispatch(transaction);
							return false;
						},
						blur: (view, event) => {
							editor.isFocused = false;
							const transaction = editor.state.tr.setMeta("blur", { event }).setMeta("addToHistory", false);
							view.dispatch(transaction);
							return false;
						},
					},
				},
			}),
		];
	},
});
var Keymap = Extension.create({
	name: "keymap",
	addKeyboardShortcuts() {
		const handleBackspace = () =>
			this.editor.commands.first(({ commands }) => [
				() => commands.undoInputRule(),
				// maybe convert first text block node to default node
				() =>
					commands.command(({ tr }) => {
						const { selection, doc } = tr;
						const { empty, $anchor } = selection;
						const { pos, parent } = $anchor;
						const $parentPos = $anchor.parent.isTextblock && pos > 0 ? tr.doc.resolve(pos - 1) : $anchor;
						const parentIsIsolating = $parentPos.parent.type.spec.isolating;
						const parentPos = $anchor.pos - $anchor.parentOffset;
						const isAtStart = parentIsIsolating && $parentPos.parent.childCount === 1 ? parentPos === $anchor.pos : Selection.atStart(doc).from === pos;
						if (!empty || !parent.type.isTextblock || parent.textContent.length || !isAtStart || (isAtStart && $anchor.parent.type.name === "paragraph")) {
							return false;
						}
						return commands.clearNodes();
					}),
				() => commands.deleteSelection(),
				() => commands.joinBackward(),
				() => commands.selectNodeBackward(),
			]);
		const handleDelete = () =>
			this.editor.commands.first(({ commands }) => [() => commands.deleteSelection(), () => commands.deleteCurrentNode(), () => commands.joinForward(), () => commands.selectNodeForward()]);
		const handleEnter = () =>
			this.editor.commands.first(({ commands }) => [() => commands.newlineInCode(), () => commands.createParagraphNear(), () => commands.liftEmptyBlock(), () => commands.splitBlock()]);
		const baseKeymap = {
			"Enter": handleEnter,
			"Mod-Enter": () => this.editor.commands.exitCode(),
			"Backspace": handleBackspace,
			"Mod-Backspace": handleBackspace,
			"Shift-Backspace": handleBackspace,
			"Delete": handleDelete,
			"Mod-Delete": handleDelete,
			"Mod-a": () => this.editor.commands.selectAll(),
		};
		const pcKeymap = {
			...baseKeymap,
		};
		const macKeymap = {
			...baseKeymap,
			"Ctrl-h": handleBackspace,
			"Alt-Backspace": handleBackspace,
			"Ctrl-d": handleDelete,
			"Ctrl-Alt-Backspace": handleDelete,
			"Alt-Delete": handleDelete,
			"Alt-d": handleDelete,
			"Ctrl-a": () => this.editor.commands.selectTextblockStart(),
			"Ctrl-e": () => this.editor.commands.selectTextblockEnd(),
		};
		if (isiOS() || isMacOS()) {
			return macKeymap;
		}
		return pcKeymap;
	},
	addProseMirrorPlugins() {
		return [
			// With this plugin we check if the whole document was selected and deleted.
			// In this case we will additionally call `clearNodes()` to convert e.g. a heading
			// to a paragraph if necessary.
			// This is an alternative to ProseMirror's `AllSelection`, which doesn’t work well
			// with many other commands.
			new Plugin({
				key: new PluginKey("clearDocument"),
				appendTransaction: (transactions, oldState, newState) => {
					if (transactions.some((tr2) => tr2.getMeta("composition"))) {
						return;
					}
					const docChanges = transactions.some((transaction) => transaction.docChanged) && !oldState.doc.eq(newState.doc);
					const ignoreTr = transactions.some((transaction) => transaction.getMeta("preventClearDocument"));
					if (!docChanges || ignoreTr) {
						return;
					}
					const { empty, from, to } = oldState.selection;
					const allFrom = Selection.atStart(oldState.doc).from;
					const allEnd = Selection.atEnd(oldState.doc).to;
					const allWasSelected = from === allFrom && to === allEnd;
					if (empty || !allWasSelected) {
						return;
					}
					const isEmpty = isNodeEmpty(newState.doc);
					if (!isEmpty) {
						return;
					}
					const tr = newState.tr;
					const state = createChainableState({
						state: newState,
						transaction: tr,
					});
					const { commands } = new CommandManager({
						editor: this.editor,
						state,
					});
					commands.clearNodes();
					if (!tr.steps.length) {
						return;
					}
					return tr;
				},
			}),
		];
	},
});
var Paste = Extension.create({
	name: "paste",
	addProseMirrorPlugins() {
		return [
			new Plugin({
				key: new PluginKey("tiptapPaste"),
				props: {
					handlePaste: (_view, e, slice) => {
						this.editor.emit("paste", {
							editor: this.editor,
							event: e,
							slice,
						});
					},
				},
			}),
		];
	},
});
var Tabindex = Extension.create({
	name: "tabindex",
	addOptions() {
		return {
			value: void 0,
		};
	},
	addProseMirrorPlugins() {
		return [
			new Plugin({
				key: new PluginKey("tabindex"),
				props: {
					attributes: () => {
						var _a;
						if (!this.editor.isEditable && this.options.value === void 0) {
							return {};
						}
						return { tabindex: (_a = this.options.value) != null ? _a : "0" };
					},
				},
			}),
		];
	},
});
var TextDirection = Extension.create({
	name: "textDirection",
	addOptions() {
		return {
			direction: void 0,
		};
	},
	addGlobalAttributes() {
		if (!this.options.direction) {
			return [];
		}
		const { nodeExtensions } = splitExtensions(this.extensions);
		return [
			{
				types: nodeExtensions.filter((extension) => extension.name !== "text").map((extension) => extension.name),
				attributes: {
					dir: {
						default: this.options.direction,
						parseHTML: (element) => {
							const dir = element.getAttribute("dir");
							if (dir && (dir === "ltr" || dir === "rtl" || dir === "auto")) {
								return dir;
							}
							return this.options.direction;
						},
						renderHTML: (attributes) => {
							if (!attributes.dir) {
								return {};
							}
							return {
								dir: attributes.dir,
							};
						},
					},
				},
			},
		];
	},
	addProseMirrorPlugins() {
		return [
			new Plugin({
				key: new PluginKey("textDirection"),
				props: {
					attributes: () => {
						const direction = this.options.direction;
						if (!direction) {
							return {};
						}
						return {
							dir: direction,
						};
					},
				},
			}),
		];
	},
});

// src/NodePos.ts
var NodePos = class _NodePos {
	constructor(pos, editor, isBlock = false, node = null) {
		this.currentNode = null;
		this.actualDepth = null;
		this.isBlock = isBlock;
		this.resolvedPos = pos;
		this.editor = editor;
		this.currentNode = node;
	}
	get name() {
		return this.node.type.name;
	}
	get node() {
		return this.currentNode || this.resolvedPos.node();
	}
	get element() {
		return this.editor.view.domAtPos(this.pos).node;
	}
	get depth() {
		var _a;
		return (_a = this.actualDepth) != null ? _a : this.resolvedPos.depth;
	}
	get pos() {
		return this.resolvedPos.pos;
	}
	get content() {
		return this.node.content;
	}
	set content(content) {
		let from = this.from;
		let to = this.to;
		if (this.isBlock) {
			if (this.content.size === 0) {
				console.error(`You can\u2019t set content on a block node. Tried to set content on ${this.name} at ${this.pos}`);
				return;
			}
			from = this.from + 1;
			to = this.to - 1;
		}
		this.editor.commands.insertContentAt({ from, to }, content);
	}
	get attributes() {
		return this.node.attrs;
	}
	get textContent() {
		return this.node.textContent;
	}
	get size() {
		return this.node.nodeSize;
	}
	get from() {
		if (this.isBlock) {
			return this.pos;
		}
		return this.resolvedPos.start(this.resolvedPos.depth);
	}
	get range() {
		return {
			from: this.from,
			to: this.to,
		};
	}
	get to() {
		if (this.isBlock) {
			return this.pos + this.size;
		}
		return this.resolvedPos.end(this.resolvedPos.depth) + (this.node.isText ? 0 : 1);
	}
	get parent() {
		if (this.depth === 0) {
			return null;
		}
		const parentPos = this.resolvedPos.start(this.resolvedPos.depth - 1);
		const $pos = this.resolvedPos.doc.resolve(parentPos);
		return new _NodePos($pos, this.editor);
	}
	get before() {
		let $pos = this.resolvedPos.doc.resolve(this.from - (this.isBlock ? 1 : 2));
		if ($pos.depth !== this.depth) {
			$pos = this.resolvedPos.doc.resolve(this.from - 3);
		}
		return new _NodePos($pos, this.editor);
	}
	get after() {
		let $pos = this.resolvedPos.doc.resolve(this.to + (this.isBlock ? 2 : 1));
		if ($pos.depth !== this.depth) {
			$pos = this.resolvedPos.doc.resolve(this.to + 3);
		}
		return new _NodePos($pos, this.editor);
	}
	get children() {
		const children = [];
		this.node.content.forEach((node, offset) => {
			const isBlock = node.isBlock && !node.isTextblock;
			const isNonTextAtom = node.isAtom && !node.isText;
			const isInline = node.isInline;
			const targetPos = this.pos + offset + (isNonTextAtom ? 0 : 1);
			if (targetPos < 0 || targetPos > this.resolvedPos.doc.nodeSize - 2) {
				return;
			}
			const $pos = this.resolvedPos.doc.resolve(targetPos);
			if (!isBlock && !isInline && $pos.depth <= this.depth) {
				return;
			}
			const childNodePos = new _NodePos($pos, this.editor, isBlock, isBlock || isInline ? node : null);
			if (isBlock) {
				childNodePos.actualDepth = this.depth + 1;
			}
			children.push(childNodePos);
		});
		return children;
	}
	get firstChild() {
		return this.children[0] || null;
	}
	get lastChild() {
		const children = this.children;
		return children[children.length - 1] || null;
	}
	closest(selector, attributes = {}) {
		let node = null;
		let currentNode = this.parent;
		while (currentNode && !node) {
			if (currentNode.node.type.name === selector) {
				if (Object.keys(attributes).length > 0) {
					const nodeAttributes = currentNode.node.attrs;
					const attrKeys = Object.keys(attributes);
					for (let index = 0; index < attrKeys.length; index += 1) {
						const key = attrKeys[index];
						if (nodeAttributes[key] !== attributes[key]) {
							break;
						}
					}
				} else {
					node = currentNode;
				}
			}
			currentNode = currentNode.parent;
		}
		return node;
	}
	querySelector(selector, attributes = {}) {
		return this.querySelectorAll(selector, attributes, true)[0] || null;
	}
	querySelectorAll(selector, attributes = {}, firstItemOnly = false) {
		let nodes = [];
		if (!this.children || this.children.length === 0) {
			return nodes;
		}
		const attrKeys = Object.keys(attributes);
		this.children.forEach((childPos) => {
			if (firstItemOnly && nodes.length > 0) {
				return;
			}
			if (childPos.node.type.name === selector) {
				const doesAllAttributesMatch = attrKeys.every((key) => attributes[key] === childPos.node.attrs[key]);
				if (doesAllAttributesMatch) {
					nodes.push(childPos);
				}
			}
			if (firstItemOnly && nodes.length > 0) {
				return;
			}
			nodes = nodes.concat(childPos.querySelectorAll(selector, attributes, firstItemOnly));
		});
		return nodes;
	}
	setAttribute(attributes) {
		const { tr } = this.editor.state;
		tr.setNodeMarkup(this.from, void 0, {
			...this.node.attrs,
			...attributes,
		});
		this.editor.view.dispatch(tr);
	}
};

// src/style.ts
var style = `.ProseMirror {
  position: relative;
}

.ProseMirror {
  word-wrap: break-word;
  white-space: pre-wrap;
  white-space: break-spaces;
  -webkit-font-variant-ligatures: none;
  font-variant-ligatures: none;
  font-feature-settings: "liga" 0; /* the above doesn't seem to work in Edge */
}

.ProseMirror [contenteditable="false"] {
  white-space: normal;
}

.ProseMirror [contenteditable="false"] [contenteditable="true"] {
  white-space: pre-wrap;
}

.ProseMirror pre {
  white-space: pre-wrap;
}

img.ProseMirror-separator {
  display: inline !important;
  border: none !important;
  margin: 0 !important;
  width: 0 !important;
  height: 0 !important;
}

.ProseMirror-gapcursor {
  display: none;
  pointer-events: none;
  position: absolute;
  margin: 0;
}

.ProseMirror-gapcursor:after {
  content: "";
  display: block;
  position: absolute;
  top: -2px;
  width: 20px;
  border-top: 1px solid black;
  animation: ProseMirror-cursor-blink 1.1s steps(2, start) infinite;
}

@keyframes ProseMirror-cursor-blink {
  to {
    visibility: hidden;
  }
}

.ProseMirror-hideselection *::selection {
  background: transparent;
}

.ProseMirror-hideselection *::-moz-selection {
  background: transparent;
}

.ProseMirror-hideselection * {
  caret-color: transparent;
}

.ProseMirror-focused .ProseMirror-gapcursor {
  display: block;
}`;

// src/Editor.ts
var Editor = class extends EventEmitter {
	constructor(options = {}) {
		super();
		this.css = null;
		this.className = "tiptap";
		this.editorView = null;
		this.isFocused = false;
		this.destroyed = false;
		/**
		 * The editor is considered initialized after the `create` event has been emitted.
		 */
		this.isInitialized = false;
		this.extensionStorage = {};
		/**
		 * A unique ID for this editor instance.
		 */
		this.instanceId = Math.random().toString(36).slice(2, 9);
		this.options = {
			element: typeof document !== "undefined" ? document.createElement("div") : null,
			content: "",
			injectCSS: true,
			injectNonce: void 0,
			extensions: [],
			autofocus: false,
			editable: true,
			textDirection: void 0,
			editorProps: {},
			parseOptions: {},
			coreExtensionOptions: {},
			enableInputRules: true,
			enablePasteRules: true,
			enableCoreExtensions: true,
			enableContentCheck: false,
			emitContentError: false,
			onBeforeCreate: () => null,
			onCreate: () => null,
			onMount: () => null,
			onUnmount: () => null,
			onUpdate: () => null,
			onSelectionUpdate: () => null,
			onTransaction: () => null,
			onFocus: () => null,
			onBlur: () => null,
			onDestroy: () => null,
			onContentError: ({ error }) => {
				throw error;
			},
			onPaste: () => null,
			onDrop: () => null,
			onDelete: () => null,
			enableExtensionDispatchTransaction: true,
		};
		this.isCapturingTransaction = false;
		this.capturedTransaction = null;
		/**
		 * Returns a set of utilities for working with positions and ranges.
		 */
		this.utils = {
			getUpdatedPosition,
			createMappablePosition,
		};
		this.setOptions(options);
		this.createExtensionManager();
		this.createCommandManager();
		this.createSchema();
		this.on("beforeCreate", this.options.onBeforeCreate);
		this.emit("beforeCreate", { editor: this });
		this.on("mount", this.options.onMount);
		this.on("unmount", this.options.onUnmount);
		this.on("contentError", this.options.onContentError);
		this.on("create", this.options.onCreate);
		this.on("update", this.options.onUpdate);
		this.on("selectionUpdate", this.options.onSelectionUpdate);
		this.on("transaction", this.options.onTransaction);
		this.on("focus", this.options.onFocus);
		this.on("blur", this.options.onBlur);
		this.on("destroy", this.options.onDestroy);
		this.on("drop", ({ event, slice, moved }) => this.options.onDrop(event, slice, moved));
		this.on("paste", ({ event, slice }) => this.options.onPaste(event, slice));
		this.on("delete", this.options.onDelete);
		const initialDoc = this.createDoc();
		const selection = resolveFocusPosition(initialDoc, this.options.autofocus);
		this.editorState = EditorState.create({
			doc: initialDoc,
			schema: this.schema,
			selection: selection || void 0,
		});
		if (this.options.element) {
			this.mount(this.options.element);
		}
	}
	/**
	 * Attach the editor to the DOM, creating a new editor view.
	 */
	mount(el) {
		if (typeof document === "undefined") {
			throw new Error(`[tiptap error]: The editor cannot be mounted because there is no 'document' defined in this environment.`);
		}
		this.createView(el);
		this.emit("mount", { editor: this });
		if (this.css && !document.head.contains(this.css)) {
			document.head.appendChild(this.css);
		}
		window.setTimeout(() => {
			if (this.isDestroyed) {
				return;
			}
			if (this.options.autofocus !== false && this.options.autofocus !== null) {
				this.commands.focus(this.options.autofocus);
			}
			this.emit("create", { editor: this });
			this.isInitialized = true;
		}, 0);
	}
	/**
	 * Remove the editor from the DOM, but still allow remounting at a different point in time
	 */
	unmount() {
		if (this.editorView) {
			const dom = this.editorView.dom;
			if (dom == null ? void 0 : dom.editor) {
				delete dom.editor;
			}
			this.editorView.destroy();
		}
		this.editorView = null;
		this.isInitialized = false;
		if (this.css && !document.querySelectorAll(`.${this.className}`).length) {
			try {
				if (typeof this.css.remove === "function") {
					this.css.remove();
				} else if (this.css.parentNode) {
					this.css.parentNode.removeChild(this.css);
				}
			} catch (error) {
				console.warn("Failed to remove CSS element:", error);
			}
		}
		this.css = null;
		this.emit("unmount", { editor: this });
	}
	/**
	 * Returns the editor storage.
	 */
	get storage() {
		return this.extensionStorage;
	}
	/**
	 * An object of all registered commands.
	 */
	get commands() {
		return this.commandManager.commands;
	}
	/**
	 * Create a command chain to call multiple commands at once.
	 */
	chain() {
		return this.commandManager.chain();
	}
	/**
	 * Check if a command or a command chain can be executed. Without executing it.
	 */
	can() {
		return this.commandManager.can();
	}
	/**
	 * Inject CSS styles.
	 */
	injectCSS() {
		if (this.options.injectCSS && typeof document !== "undefined") {
			this.css = createStyleTag(style, this.options.injectNonce);
		}
	}
	/**
	 * Update editor options.
	 *
	 * @param options A list of options
	 */
	setOptions(options = {}) {
		this.options = {
			...this.options,
			...options,
		};
		if (!this.editorView || !this.state || this.isDestroyed) {
			return;
		}
		if (this.options.editorProps) {
			this.view.setProps(this.options.editorProps);
		}
		this.view.updateState(this.state);
	}
	/**
	 * Update editable state of the editor.
	 */
	setEditable(editable, emitUpdate = true) {
		this.setOptions({ editable });
		if (emitUpdate) {
			this.emit("update", { editor: this, transaction: this.state.tr, appendedTransactions: [] });
		}
	}
	/**
	 * Returns whether the editor is editable.
	 */
	get isEditable() {
		return this.options.editable && this.view && this.view.editable;
	}
	/**
	 * Returns the editor view.
	 */
	get view() {
		if (this.editorView) {
			return this.editorView;
		}
		return new Proxy(
			{
				state: this.editorState,
				updateState: (state) => {
					this.editorState = state;
				},
				dispatch: (tr) => {
					this.dispatchTransaction(tr);
				},
				// Stub some commonly accessed properties to prevent errors
				composing: false,
				dragging: null,
				editable: true,
				isDestroyed: false,
			},
			{
				get: (obj, key) => {
					if (this.editorView) {
						return this.editorView[key];
					}
					if (key === "state") {
						return this.editorState;
					}
					if (key in obj) {
						return Reflect.get(obj, key);
					}
					throw new Error(`[tiptap error]: The editor view is not available. Cannot access view['${key}']. The editor may not be mounted yet.`);
				},
			},
		);
	}
	/**
	 * Returns the editor state.
	 */
	get state() {
		if (this.editorView) {
			this.editorState = this.view.state;
		}
		return this.editorState;
	}
	/**
	 * Register a ProseMirror plugin.
	 *
	 * @param plugin A ProseMirror plugin
	 * @param handlePlugins Control how to merge the plugin into the existing plugins.
	 * @returns The new editor state
	 */
	registerPlugin(plugin, handlePlugins) {
		const plugins = isFunction(handlePlugins) ? handlePlugins(plugin, [...this.state.plugins]) : [...this.state.plugins, plugin];
		const state = this.state.reconfigure({ plugins });
		this.view.updateState(state);
		return state;
	}
	/**
	 * Unregister a ProseMirror plugin.
	 *
	 * @param nameOrPluginKeyToRemove The plugins name
	 * @returns The new editor state or undefined if the editor is destroyed
	 */
	unregisterPlugin(nameOrPluginKeyToRemove) {
		if (this.isDestroyed) {
			return void 0;
		}
		const prevPlugins = this.state.plugins;
		let plugins = prevPlugins;
		[].concat(nameOrPluginKeyToRemove).forEach((nameOrPluginKey) => {
			const name = typeof nameOrPluginKey === "string" ? `${nameOrPluginKey}$` : nameOrPluginKey.key;
			plugins = plugins.filter((plugin) => !plugin.key.startsWith(name));
		});
		if (prevPlugins.length === plugins.length) {
			return void 0;
		}
		const state = this.state.reconfigure({
			plugins,
		});
		this.view.updateState(state);
		return state;
	}
	/**
	 * Creates an extension manager.
	 */
	createExtensionManager() {
		var _a, _b, _c, _d;
		const coreExtensions =
			this.options.enableCoreExtensions ?
				[
					Editable,
					ClipboardTextSerializer.configure({
						blockSeparator: (_b = (_a = this.options.coreExtensionOptions) == null ? void 0 : _a.clipboardTextSerializer) == null ? void 0 : _b.blockSeparator,
					}),
					Commands,
					FocusEvents,
					Keymap,
					Tabindex.configure({
						value: (_d = (_c = this.options.coreExtensionOptions) == null ? void 0 : _c.tabindex) == null ? void 0 : _d.value,
					}),
					Drop,
					Paste,
					Delete,
					TextDirection.configure({
						direction: this.options.textDirection,
					}),
				].filter((ext) => {
					if (typeof this.options.enableCoreExtensions === "object") {
						return this.options.enableCoreExtensions[ext.name] !== false;
					}
					return true;
				})
			:	[];
		const allExtensions = [...coreExtensions, ...this.options.extensions].filter((extension) => {
			return ["extension", "node", "mark"].includes(extension == null ? void 0 : extension.type);
		});
		this.extensionManager = new ExtensionManager(allExtensions, this);
	}
	/**
	 * Creates an command manager.
	 */
	createCommandManager() {
		this.commandManager = new CommandManager({
			editor: this,
		});
	}
	/**
	 * Creates a ProseMirror schema.
	 */
	createSchema() {
		this.schema = this.extensionManager.schema;
	}
	/**
	 * Creates the initial document.
	 */
	createDoc() {
		let doc;
		try {
			doc = createDocument(this.options.content, this.schema, this.options.parseOptions, {
				errorOnInvalidContent: this.options.enableContentCheck,
			});
		} catch (e) {
			if (!(e instanceof Error) || !["[tiptap error]: Invalid JSON content", "[tiptap error]: Invalid HTML content"].includes(e.message)) {
				throw e;
			}
			this.emit("contentError", {
				editor: this,
				error: e,
				disableCollaboration: () => {
					if ("collaboration" in this.storage && typeof this.storage.collaboration === "object" && this.storage.collaboration) {
						this.storage.collaboration.isDisabled = true;
					}
					this.options.extensions = this.options.extensions.filter((extension) => extension.name !== "collaboration");
					this.createExtensionManager();
				},
			});
			doc = createDocument(this.options.content, this.schema, this.options.parseOptions, {
				errorOnInvalidContent: false,
			});
		}
		return doc;
	}
	/**
	 * Creates a ProseMirror view.
	 */
	createView(element) {
		const { editorProps, enableExtensionDispatchTransaction } = this.options;
		const baseDispatch = editorProps.dispatchTransaction || this.dispatchTransaction.bind(this);
		const dispatch = enableExtensionDispatchTransaction ? this.extensionManager.dispatchTransaction(baseDispatch) : baseDispatch;
		const baseTransformPastedHTML = editorProps.transformPastedHTML;
		const transformPastedHTML = this.extensionManager.transformPastedHTML(baseTransformPastedHTML);
		this.editorView = new EditorView(element, {
			...editorProps,
			attributes: {
				// add `role="textbox"` to the editor element
				role: "textbox",
				...(editorProps == null ? void 0 : editorProps.attributes),
			},
			dispatchTransaction: dispatch,
			transformPastedHTML,
			state: this.editorState,
			markViews: this.extensionManager.markViews,
			nodeViews: this.extensionManager.nodeViews,
		});
		const newState = this.state.reconfigure({
			plugins: this.extensionManager.plugins,
		});
		this.view.updateState(newState);
		this.prependClass();
		this.injectCSS();
		const dom = this.view.dom;
		dom.editor = this;
	}
	/**
	 * Creates all node and mark views.
	 */
	createNodeViews() {
		if (this.view.isDestroyed) {
			return;
		}
		this.view.setProps({
			markViews: this.extensionManager.markViews,
			nodeViews: this.extensionManager.nodeViews,
		});
	}
	/**
	 * Prepend class name to element.
	 */
	prependClass() {
		this.view.dom.className = `${this.className} ${this.view.dom.className}`;
	}
	captureTransaction(fn) {
		this.isCapturingTransaction = true;
		fn();
		this.isCapturingTransaction = false;
		const tr = this.capturedTransaction;
		this.capturedTransaction = null;
		return tr;
	}
	/**
	 * The callback over which to send transactions (state updates) produced by the view.
	 *
	 * @param transaction An editor state transaction
	 */
	dispatchTransaction(transaction) {
		if (this.view.isDestroyed) {
			return;
		}
		if (this.isCapturingTransaction) {
			if (!this.capturedTransaction) {
				this.capturedTransaction = transaction;
				return;
			}
			transaction.steps.forEach((step) => {
				var _a;
				return (_a = this.capturedTransaction) == null ? void 0 : _a.step(step);
			});
			return;
		}
		const { state, transactions } = this.state.applyTransaction(transaction);
		const selectionHasChanged = !this.state.selection.eq(state.selection);
		const rootTrWasApplied = transactions.includes(transaction);
		const prevState = this.state;
		this.emit("beforeTransaction", {
			editor: this,
			transaction,
			nextState: state,
		});
		if (!rootTrWasApplied) {
			return;
		}
		this.view.updateState(state);
		this.emit("transaction", {
			editor: this,
			transaction,
			appendedTransactions: transactions.slice(1),
		});
		if (selectionHasChanged) {
			this.emit("selectionUpdate", {
				editor: this,
				transaction,
			});
		}
		const mostRecentFocusTr = transactions.findLast((tr) => tr.getMeta("focus") || tr.getMeta("blur"));
		const focus2 = mostRecentFocusTr == null ? void 0 : mostRecentFocusTr.getMeta("focus");
		const blur2 = mostRecentFocusTr == null ? void 0 : mostRecentFocusTr.getMeta("blur");
		if (focus2) {
			this.emit("focus", {
				editor: this,
				event: focus2.event,
				// oxlint-disable-next-lineno-non-null-assertion
				transaction: mostRecentFocusTr,
			});
		}
		if (blur2) {
			this.emit("blur", {
				editor: this,
				event: blur2.event,
				// oxlint-disable-next-lineno-non-null-assertion
				transaction: mostRecentFocusTr,
			});
		}
		if (transaction.getMeta("preventUpdate") || !transactions.some((tr) => tr.docChanged) || prevState.doc.eq(state.doc)) {
			return;
		}
		this.emit("update", {
			editor: this,
			transaction,
			appendedTransactions: transactions.slice(1),
		});
	}
	/**
	 * Get attributes of the currently selected node or mark.
	 */
	getAttributes(nameOrType) {
		return getAttributes(this.state, nameOrType);
	}
	isActive(nameOrAttributes, attributesOrUndefined) {
		const name = typeof nameOrAttributes === "string" ? nameOrAttributes : null;
		const attributes = typeof nameOrAttributes === "string" ? attributesOrUndefined : nameOrAttributes;
		return isActive(this.state, name, attributes);
	}
	/**
	 * Get the document as JSON.
	 */
	getJSON() {
		return this.state.doc.toJSON();
	}
	/**
	 * Get the document as HTML.
	 */
	getHTML() {
		return getHTMLFromFragment(this.state.doc.content, this.schema);
	}
	/**
	 * Get the document as text.
	 */
	getText(options) {
		const { blockSeparator = "\n\n", textSerializers = {} } = options || {};
		return getText(this.state.doc, {
			blockSeparator,
			textSerializers: {
				...getTextSerializersFromSchema(this.schema),
				...textSerializers,
			},
		});
	}
	/**
	 * Check if there is no content.
	 */
	get isEmpty() {
		return isNodeEmpty(this.state.doc);
	}
	/**
	 * Destroy the editor.
	 */
	destroy() {
		if (this.destroyed) {
			return;
		}
		this.destroyed = true;
		this.emit("destroy");
		this.unmount();
		this.removeAllListeners();
		this.extensionManager.destroy();
		this.extensionManager = null;
		this.schema = null;
		this.commandManager = null;
		this.extensionStorage = {};
	}
	/**
	 * Check if the editor is already destroyed.
	 */
	get isDestroyed() {
		var _a, _b;
		return (_b = (_a = this.editorView) == null ? void 0 : _a.isDestroyed) != null ? _b : true;
	}
	$node(selector, attributes) {
		var _a;
		return ((_a = this.$doc) == null ? void 0 : _a.querySelector(selector, attributes)) || null;
	}
	$nodes(selector, attributes) {
		var _a;
		return ((_a = this.$doc) == null ? void 0 : _a.querySelectorAll(selector, attributes)) || null;
	}
	$pos(pos) {
		const $pos = this.state.doc.resolve(pos);
		const node = pos > 0 && $pos.nodeAfter && !$pos.nodeAfter.isText ? $pos.nodeAfter : null;
		return new NodePos($pos, this, false, node);
	}
	get $doc() {
		return this.$pos(0);
	}
};

// src/inputRules/markInputRule.ts
function markInputRule(config) {
	return new InputRule({
		find: config.find,
		handler: ({ state, range, match }) => {
			const attributes = callOrReturn(config.getAttributes, void 0, match);
			if (attributes === false || attributes === null) {
				return null;
			}
			const { tr } = state;
			const captureGroup = match[match.length - 1];
			const fullMatch = match[0];
			if (captureGroup) {
				const startSpaces = fullMatch.search(/\S/);
				const textStart = range.from + fullMatch.indexOf(captureGroup);
				const textEnd = textStart + captureGroup.length;
				const excludedMarks = getMarksBetween(range.from, range.to, state.doc)
					.filter((item) => {
						const excluded = item.mark.type.excluded;
						return excluded.find((type) => type === config.type && type !== item.mark.type);
					})
					.filter((item) => item.to > textStart);
				if (excludedMarks.length) {
					return null;
				}
				if (textEnd < range.to) {
					tr.delete(textEnd, range.to);
				}
				if (textStart > range.from) {
					tr.delete(range.from + startSpaces, textStart);
				}
				const markEnd = range.from + startSpaces + captureGroup.length;
				tr.addMark(range.from + startSpaces, markEnd, config.type.create(attributes || {}));
				tr.removeStoredMark(config.type);
			}
		},
		undoable: config.undoable,
	});
}

// src/inputRules/nodeInputRule.ts
function nodeInputRule(config) {
	return new InputRule({
		find: config.find,
		handler: ({ state, range, match }) => {
			const attributes = callOrReturn(config.getAttributes, void 0, match) || {};
			const { tr } = state;
			const start = range.from;
			let end = range.to;
			const newNode = config.type.create(attributes);
			if (match[1]) {
				const offset = match[0].lastIndexOf(match[1]);
				let matchStart = start + offset;
				if (matchStart > end) {
					matchStart = end;
				} else {
					end = matchStart + match[1].length;
				}
				const lastChar = match[0][match[0].length - 1];
				tr.insertText(lastChar, start + match[0].length - 1);
				tr.replaceWith(matchStart, end, newNode);
			} else if (match[0]) {
				const insertionStart = config.type.isInline ? start : start - 1;
				tr.insert(insertionStart, config.type.create(attributes)).delete(tr.mapping.map(start), tr.mapping.map(end));
			}
			tr.scrollIntoView();
		},
		undoable: config.undoable,
	});
}

// src/inputRules/textblockTypeInputRule.ts
function textblockTypeInputRule(config) {
	return new InputRule({
		find: config.find,
		handler: ({ state, range, match }) => {
			const $start = state.doc.resolve(range.from);
			const attributes = callOrReturn(config.getAttributes, void 0, match) || {};
			if (!$start.node(-1).canReplaceWith($start.index(-1), $start.indexAfter(-1), config.type)) {
				return null;
			}
			state.tr.delete(range.from, range.to).setBlockType(range.from, range.from, config.type, attributes);
		},
		undoable: config.undoable,
	});
}
function wrappingInputRule(config) {
	return new InputRule({
		find: config.find,
		handler: ({ state, range, match, chain }) => {
			const attributes = callOrReturn(config.getAttributes, void 0, match) || {};
			const tr = state.tr.delete(range.from, range.to);
			const $start = tr.doc.resolve(range.from);
			const blockRange = $start.blockRange();
			const wrapping = blockRange && findWrapping(blockRange, config.type, attributes);
			if (!wrapping) {
				return null;
			}
			tr.wrap(blockRange, wrapping);
			if (config.keepMarks && config.editor) {
				const { selection, storedMarks } = state;
				const { splittableMarks } = config.editor.extensionManager;
				const marks = storedMarks || (selection.$to.parentOffset && selection.$from.marks());
				if (marks) {
					const filteredMarks = marks.filter((mark) => splittableMarks.includes(mark.type.name));
					tr.ensureMarks(filteredMarks);
				}
			}
			if (config.keepAttributes) {
				const nodeType = config.type.name === "bulletList" || config.type.name === "orderedList" ? "listItem" : "taskList";
				chain().updateAttributes(nodeType, attributes).run();
			}
			const before = tr.doc.resolve(range.from - 1).nodeBefore;
			if (before && before.type === config.type && canJoin(tr.doc, range.from - 1) && (!config.joinPredicate || config.joinPredicate(match, before))) {
				tr.join(range.from - 1);
			}
		},
		undoable: config.undoable,
	});
}

// src/Node.ts
var Node3 = class _Node extends Extendable {
	constructor() {
		super(...arguments);
		this.type = "node";
	}
	/**
	 * Create a new Node instance
	 * @param config - Node configuration object or a function that returns a configuration object
	 */
	static create(config = {}) {
		const resolvedConfig = typeof config === "function" ? config() : config;
		return new _Node(resolvedConfig);
	}
	configure(options) {
		return super.configure(options);
	}
	extend(extendedConfig) {
		const resolvedConfig = typeof extendedConfig === "function" ? extendedConfig() : extendedConfig;
		return super.extend(resolvedConfig);
	}
};

// src/pasteRules/markPasteRule.ts
function markPasteRule(config) {
	return new PasteRule({
		find: config.find,
		handler: ({ state, range, match, pasteEvent }) => {
			const attributes = callOrReturn(config.getAttributes, void 0, match, pasteEvent);
			if (attributes === false || attributes === null) {
				return null;
			}
			const { tr } = state;
			const captureGroup = match[match.length - 1];
			const fullMatch = match[0];
			let markEnd = range.to;
			if (captureGroup) {
				const startSpaces = fullMatch.search(/\S/);
				const textStart = range.from + fullMatch.indexOf(captureGroup);
				const textEnd = textStart + captureGroup.length;
				const excludedMarks = getMarksBetween(range.from, range.to, state.doc)
					.filter((item) => {
						const excluded = item.mark.type.excluded;
						return excluded.find((type) => type === config.type && type !== item.mark.type);
					})
					.filter((item) => item.to > textStart);
				if (excludedMarks.length) {
					return null;
				}
				if (textEnd < range.to) {
					tr.delete(textEnd, range.to);
				}
				if (textStart > range.from) {
					tr.delete(range.from + startSpaces, textStart);
				}
				markEnd = range.from + startSpaces + captureGroup.length;
				tr.addMark(range.from + startSpaces, markEnd, config.type.create(attributes || {}));
				const isMatchAtEndOfText = match.index !== void 0 && match.input !== void 0 && match.index + match[0].length >= match.input.length;
				if (!isMatchAtEndOfText) {
					tr.removeStoredMark(config.type);
				}
			}
		},
	});
}

// src/jsx-runtime.ts
var h = (tag, attributes) => {
	if (tag === "slot") {
		return 0;
	}
	if (tag instanceof Function) {
		return tag(attributes);
	}
	const { children, ...rest } = attributes != null ? attributes : {};
	if (tag === "svg") {
		throw new Error("SVG elements are not supported in the JSX syntax, use the array syntax instead");
	}
	return [tag, rest, children];
};

// src/bold.tsx
var starInputRegex$1 = /(?:^|\s)(\*\*(?!\s+\*\*)((?:[^*]+))\*\*(?!\s+\*\*))$/;
var starPasteRegex$1 = /(?:^|\s)(\*\*(?!\s+\*\*)((?:[^*]+))\*\*(?!\s+\*\*))/g;
var underscoreInputRegex$1 = /(?:^|\s)(__(?!\s+__)((?:[^_]+))__(?!\s+__))$/;
var underscorePasteRegex$1 = /(?:^|\s)(__(?!\s+__)((?:[^_]+))__(?!\s+__))/g;
var Bold = Mark.create({
	name: "bold",
	addOptions() {
		return {
			HTMLAttributes: {},
		};
	},
	parseHTML() {
		return [
			{
				tag: "strong",
			},
			{
				tag: "b",
				getAttrs: (node) => node.style.fontWeight !== "normal" && null,
			},
			{
				style: "font-weight=400",
				clearMark: (mark) => mark.type.name === this.name,
			},
			{
				style: "font-weight",
				getAttrs: (value) => /^(bold(er)?|[5-9]\d{2,})$/.test(value) && null,
			},
		];
	},
	renderHTML({ HTMLAttributes }) {
		return /* @__PURE__ */ h("strong", { ...mergeAttributes(this.options.HTMLAttributes, HTMLAttributes), children: /* @__PURE__ */ h("slot", {}) });
	},
	markdownTokenName: "strong",
	parseMarkdown: (token, helpers) => {
		return helpers.applyMark("bold", helpers.parseInline(token.tokens || []));
	},
	markdownOptions: {
		htmlReopen: {
			open: "<strong>",
			close: "</strong>",
		},
	},
	renderMarkdown: (node, h) => {
		return `**${h.renderChildren(node)}**`;
	},
	addCommands() {
		return {
			setBold:
				() =>
				({ commands }) => {
					return commands.setMark(this.name);
				},
			toggleBold:
				() =>
				({ commands }) => {
					return commands.toggleMark(this.name);
				},
			unsetBold:
				() =>
				({ commands }) => {
					return commands.unsetMark(this.name);
				},
		};
	},
	addKeyboardShortcuts() {
		return {
			"Mod-b": () => this.editor.commands.toggleBold(),
			"Mod-B": () => this.editor.commands.toggleBold(),
		};
	},
	addInputRules() {
		return [
			markInputRule({
				find: starInputRegex$1,
				type: this.type,
			}),
			markInputRule({
				find: underscoreInputRegex$1,
				type: this.type,
			}),
		];
	},
	addPasteRules() {
		return [
			markPasteRule({
				find: starPasteRegex$1,
				type: this.type,
			}),
			markPasteRule({
				find: underscorePasteRegex$1,
				type: this.type,
			}),
		];
	},
});

// src/index.ts
var index_default$5 = Bold;

// src/code.ts
var inputRegexMatch = (text) => {
	const match = /`([^`]+)`(?!`)$/.exec(text);
	if (!match) {
		return null;
	}
	if (match.index > 0 && text[match.index - 1] === "`") {
		return null;
	}
	return {
		index: match.index,
		text: match[0],
		replaceWith: match[1],
	};
};
var pasteRegexMatch = (text) => {
	const regex = /`([^`]+)`(?!`)/g;
	const matches = [];
	let match;
	while ((match = regex.exec(text)) !== null) {
		if (match.index > 0 && text[match.index - 1] === "`") {
			continue;
		}
		matches.push({
			index: match.index,
			text: match[0],
			replaceWith: match[1],
		});
	}
	return matches;
};
var Code = Mark.create({
	name: "code",
	addOptions() {
		return {
			HTMLAttributes: {},
		};
	},
	excludes: "_",
	code: true,
	exitable: true,
	parseHTML() {
		return [{ tag: "code" }];
	},
	renderHTML({ HTMLAttributes }) {
		return ["code", mergeAttributes(this.options.HTMLAttributes, HTMLAttributes), 0];
	},
	markdownTokenName: "codespan",
	parseMarkdown: (token, helpers) => {
		return helpers.applyMark("code", [{ type: "text", text: token.text || "" }]);
	},
	renderMarkdown: (node, h) => {
		if (!node.content) {
			return "";
		}
		return `\`${h.renderChildren(node.content)}\``;
	},
	addCommands() {
		return {
			setCode:
				() =>
				({ commands }) => {
					return commands.setMark(this.name);
				},
			toggleCode:
				() =>
				({ commands }) => {
					return commands.toggleMark(this.name);
				},
			unsetCode:
				() =>
				({ commands }) => {
					return commands.unsetMark(this.name);
				},
		};
	},
	addKeyboardShortcuts() {
		return {
			"Mod-e": () => this.editor.commands.toggleCode(),
		};
	},
	addInputRules() {
		return [
			markInputRule({
				find: inputRegexMatch,
				type: this.type,
			}),
		];
	},
	addPasteRules() {
		return [
			markPasteRule({
				find: pasteRegexMatch,
				type: this.type,
			}),
		];
	},
});

// src/index.ts
var index_default$4 = Code;

// src/italic.ts
var starInputRegex = /(?:^|\s)(\*(?!\s+\*)((?:[^*]+))\*(?!\s+\*))$/;
var starPasteRegex = /(?:^|\s)(\*(?!\s+\*)((?:[^*]+))\*(?!\s+\*))/g;
var underscoreInputRegex = /(?:^|\s)(_(?!\s+_)((?:[^_]+))_(?!\s+_))$/;
var underscorePasteRegex = /(?:^|\s)(_(?!\s+_)((?:[^_]+))_(?!\s+_))/g;
var Italic = Mark.create({
	name: "italic",
	addOptions() {
		return {
			HTMLAttributes: {},
		};
	},
	parseHTML() {
		return [
			{
				tag: "em",
			},
			{
				tag: "i",
				getAttrs: (node) => node.style.fontStyle !== "normal" && null,
			},
			{
				style: "font-style=normal",
				clearMark: (mark) => mark.type.name === this.name,
			},
			{
				style: "font-style=italic",
			},
		];
	},
	renderHTML({ HTMLAttributes }) {
		return ["em", mergeAttributes(this.options.HTMLAttributes, HTMLAttributes), 0];
	},
	addCommands() {
		return {
			setItalic:
				() =>
				({ commands }) => {
					return commands.setMark(this.name);
				},
			toggleItalic:
				() =>
				({ commands }) => {
					return commands.toggleMark(this.name);
				},
			unsetItalic:
				() =>
				({ commands }) => {
					return commands.unsetMark(this.name);
				},
		};
	},
	markdownTokenName: "em",
	parseMarkdown: (token, helpers) => {
		return helpers.applyMark("italic", helpers.parseInline(token.tokens || []));
	},
	markdownOptions: {
		htmlReopen: {
			open: "<em>",
			close: "</em>",
		},
	},
	renderMarkdown: (node, h) => {
		return `*${h.renderChildren(node)}*`;
	},
	addKeyboardShortcuts() {
		return {
			"Mod-i": () => this.editor.commands.toggleItalic(),
			"Mod-I": () => this.editor.commands.toggleItalic(),
		};
	},
	addInputRules() {
		return [
			markInputRule({
				find: starInputRegex,
				type: this.type,
			}),
			markInputRule({
				find: underscoreInputRegex,
				type: this.type,
			}),
		];
	},
	addPasteRules() {
		return [
			markPasteRule({
				find: starPasteRegex,
				type: this.type,
			}),
			markPasteRule({
				find: underscorePasteRegex,
				type: this.type,
			}),
		];
	},
});

// src/index.ts
var index_default$3 = Italic;

// src/strike.ts
var inputRegex = /(?:^|\s)(~~(?!\s+~~)((?:[^~]+))~~(?!\s+~~))$/;
var pasteRegex = /(?:^|\s)(~~(?!\s+~~)((?:[^~]+))~~(?!\s+~~))/g;
var Strike = Mark.create({
	name: "strike",
	addOptions() {
		return {
			HTMLAttributes: {},
		};
	},
	parseHTML() {
		return [
			{
				tag: "s",
			},
			{
				tag: "del",
			},
			{
				tag: "strike",
			},
			{
				style: "text-decoration",
				consuming: false,
				getAttrs: (style) => (style.includes("line-through") ? {} : false),
			},
		];
	},
	renderHTML({ HTMLAttributes }) {
		return ["s", mergeAttributes(this.options.HTMLAttributes, HTMLAttributes), 0];
	},
	markdownTokenName: "del",
	parseMarkdown: (token, helpers) => {
		return helpers.applyMark("strike", helpers.parseInline(token.tokens || []));
	},
	renderMarkdown: (node, h) => {
		return `~~${h.renderChildren(node)}~~`;
	},
	addCommands() {
		return {
			setStrike:
				() =>
				({ commands }) => {
					return commands.setMark(this.name);
				},
			toggleStrike:
				() =>
				({ commands }) => {
					return commands.toggleMark(this.name);
				},
			unsetStrike:
				() =>
				({ commands }) => {
					return commands.unsetMark(this.name);
				},
		};
	},
	addKeyboardShortcuts() {
		return {
			"Mod-Shift-s": () => this.editor.commands.toggleStrike(),
		};
	},
	addInputRules() {
		return [
			markInputRule({
				find: inputRegex,
				type: this.type,
			}),
		];
	},
	addPasteRules() {
		return [
			markPasteRule({
				find: pasteRegex,
				type: this.type,
			}),
		];
	},
});

// src/index.ts
var index_default$2 = Strike;

// src/underline.ts
var Underline = Mark.create({
	name: "underline",
	addOptions() {
		return {
			HTMLAttributes: {},
		};
	},
	parseHTML() {
		return [
			{
				tag: "u",
			},
			{
				style: "text-decoration",
				consuming: false,
				getAttrs: (style) => (style.includes("underline") ? {} : false),
			},
		];
	},
	renderHTML({ HTMLAttributes }) {
		return ["u", mergeAttributes(this.options.HTMLAttributes, HTMLAttributes), 0];
	},
	parseMarkdown(token, helpers) {
		return helpers.applyMark(this.name || "underline", helpers.parseInline(token.tokens || []));
	},
	renderMarkdown(node, helpers) {
		return `++${helpers.renderChildren(node)}++`;
	},
	markdownTokenizer: {
		name: "underline",
		level: "inline",
		start(src) {
			return src.indexOf("++");
		},
		tokenize(src, _tokens, lexer) {
			const rule = /^(\+\+)([\s\S]+?)(\+\+)/;
			const match = rule.exec(src);
			if (!match) {
				return void 0;
			}
			const innerContent = match[2].trim();
			return {
				type: "underline",
				raw: match[0],
				text: innerContent,
				tokens: lexer.inlineTokens(innerContent),
			};
		},
	},
	addCommands() {
		return {
			setUnderline:
				() =>
				({ commands }) => {
					return commands.setMark(this.name);
				},
			toggleUnderline:
				() =>
				({ commands }) => {
					return commands.toggleMark(this.name);
				},
			unsetUnderline:
				() =>
				({ commands }) => {
					return commands.unsetMark(this.name);
				},
		};
	},
	addKeyboardShortcuts() {
		return {
			"Mod-u": () => this.editor.commands.toggleUnderline(),
			"Mod-U": () => this.editor.commands.toggleUnderline(),
		};
	},
});

// src/index.ts
var index_default$1 = Underline;

var GOOD_LEAF_SIZE = 200;

// :: class<T> A rope sequence is a persistent sequence data structure
// that supports appending, prepending, and slicing without doing a
// full copy. It is represented as a mostly-balanced tree.
var RopeSequence = function RopeSequence() {};

RopeSequence.prototype.append = function append(other) {
	if (!other.length) {
		return this;
	}
	other = RopeSequence.from(other);

	return (!this.length && other) || (other.length < GOOD_LEAF_SIZE && this.leafAppend(other)) || (this.length < GOOD_LEAF_SIZE && other.leafPrepend(this)) || this.appendInner(other);
};

// :: (union<[T], RopeSequence<T>>) → RopeSequence<T>
// Prepend an array or other rope to this one, returning a new rope.
RopeSequence.prototype.prepend = function prepend(other) {
	if (!other.length) {
		return this;
	}
	return RopeSequence.from(other).append(this);
};

RopeSequence.prototype.appendInner = function appendInner(other) {
	return new Append(this, other);
};

// :: (?number, ?number) → RopeSequence<T>
// Create a rope repesenting a sub-sequence of this rope.
RopeSequence.prototype.slice = function slice(from, to) {
	if (from === void 0) from = 0;
	if (to === void 0) to = this.length;

	if (from >= to) {
		return RopeSequence.empty;
	}
	return this.sliceInner(Math.max(0, from), Math.min(this.length, to));
};

// :: (number) → T
// Retrieve the element at the given position from this rope.
RopeSequence.prototype.get = function get(i) {
	if (i < 0 || i >= this.length) {
		return undefined;
	}
	return this.getInner(i);
};

// :: ((element: T, index: number) → ?bool, ?number, ?number)
// Call the given function for each element between the given
// indices. This tends to be more efficient than looping over the
// indices and calling `get`, because it doesn't have to descend the
// tree for every element.
RopeSequence.prototype.forEach = function forEach(f, from, to) {
	if (from === void 0) from = 0;
	if (to === void 0) to = this.length;

	if (from <= to) {
		this.forEachInner(f, from, to, 0);
	} else {
		this.forEachInvertedInner(f, from, to, 0);
	}
};

// :: ((element: T, index: number) → U, ?number, ?number) → [U]
// Map the given functions over the elements of the rope, producing
// a flat array.
RopeSequence.prototype.map = function map(f, from, to) {
	if (from === void 0) from = 0;
	if (to === void 0) to = this.length;

	var result = [];
	this.forEach(
		function (elt, i) {
			return result.push(f(elt, i));
		},
		from,
		to,
	);
	return result;
};

// :: (?union<[T], RopeSequence<T>>) → RopeSequence<T>
// Create a rope representing the given array, or return the rope
// itself if a rope was given.
RopeSequence.from = function from(values) {
	if (values instanceof RopeSequence) {
		return values;
	}
	return values && values.length ? new Leaf(values) : RopeSequence.empty;
};

var Leaf = /*@__PURE__*/ (function (RopeSequence) {
	function Leaf(values) {
		RopeSequence.call(this);
		this.values = values;
	}

	if (RopeSequence) Leaf.__proto__ = RopeSequence;
	Leaf.prototype = Object.create(RopeSequence && RopeSequence.prototype);
	Leaf.prototype.constructor = Leaf;

	var prototypeAccessors = { length: { configurable: true }, depth: { configurable: true } };

	Leaf.prototype.flatten = function flatten() {
		return this.values;
	};

	Leaf.prototype.sliceInner = function sliceInner(from, to) {
		if (from == 0 && to == this.length) {
			return this;
		}
		return new Leaf(this.values.slice(from, to));
	};

	Leaf.prototype.getInner = function getInner(i) {
		return this.values[i];
	};

	Leaf.prototype.forEachInner = function forEachInner(f, from, to, start) {
		for (var i = from; i < to; i++) {
			if (f(this.values[i], start + i) === false) {
				return false;
			}
		}
	};

	Leaf.prototype.forEachInvertedInner = function forEachInvertedInner(f, from, to, start) {
		for (var i = from - 1; i >= to; i--) {
			if (f(this.values[i], start + i) === false) {
				return false;
			}
		}
	};

	Leaf.prototype.leafAppend = function leafAppend(other) {
		if (this.length + other.length <= GOOD_LEAF_SIZE) {
			return new Leaf(this.values.concat(other.flatten()));
		}
	};

	Leaf.prototype.leafPrepend = function leafPrepend(other) {
		if (this.length + other.length <= GOOD_LEAF_SIZE) {
			return new Leaf(other.flatten().concat(this.values));
		}
	};

	prototypeAccessors.length.get = function () {
		return this.values.length;
	};

	prototypeAccessors.depth.get = function () {
		return 0;
	};

	Object.defineProperties(Leaf.prototype, prototypeAccessors);

	return Leaf;
})(RopeSequence);

// :: RopeSequence
// The empty rope sequence.
RopeSequence.empty = new Leaf([]);

var Append = /*@__PURE__*/ (function (RopeSequence) {
	function Append(left, right) {
		RopeSequence.call(this);
		this.left = left;
		this.right = right;
		this.length = left.length + right.length;
		this.depth = Math.max(left.depth, right.depth) + 1;
	}

	if (RopeSequence) Append.__proto__ = RopeSequence;
	Append.prototype = Object.create(RopeSequence && RopeSequence.prototype);
	Append.prototype.constructor = Append;

	Append.prototype.flatten = function flatten() {
		return this.left.flatten().concat(this.right.flatten());
	};

	Append.prototype.getInner = function getInner(i) {
		return i < this.left.length ? this.left.get(i) : this.right.get(i - this.left.length);
	};

	Append.prototype.forEachInner = function forEachInner(f, from, to, start) {
		var leftLen = this.left.length;
		if (from < leftLen && this.left.forEachInner(f, from, Math.min(to, leftLen), start) === false) {
			return false;
		}
		if (to > leftLen && this.right.forEachInner(f, Math.max(from - leftLen, 0), Math.min(this.length, to) - leftLen, start + leftLen) === false) {
			return false;
		}
	};

	Append.prototype.forEachInvertedInner = function forEachInvertedInner(f, from, to, start) {
		var leftLen = this.left.length;
		if (from > leftLen && this.right.forEachInvertedInner(f, from - leftLen, Math.max(to, leftLen) - leftLen, start + leftLen) === false) {
			return false;
		}
		if (to < leftLen && this.left.forEachInvertedInner(f, Math.min(from, leftLen), to, start) === false) {
			return false;
		}
	};

	Append.prototype.sliceInner = function sliceInner(from, to) {
		if (from == 0 && to == this.length) {
			return this;
		}
		var leftLen = this.left.length;
		if (to <= leftLen) {
			return this.left.slice(from, to);
		}
		if (from >= leftLen) {
			return this.right.slice(from - leftLen, to - leftLen);
		}
		return this.left.slice(from, leftLen).append(this.right.slice(0, to - leftLen));
	};

	Append.prototype.leafAppend = function leafAppend(other) {
		var inner = this.right.leafAppend(other);
		if (inner) {
			return new Append(this.left, inner);
		}
	};

	Append.prototype.leafPrepend = function leafPrepend(other) {
		var inner = this.left.leafPrepend(other);
		if (inner) {
			return new Append(inner, this.right);
		}
	};

	Append.prototype.appendInner = function appendInner(other) {
		if (this.left.depth >= Math.max(this.right.depth, other.depth) + 1) {
			return new Append(this.left, new Append(this.right, other));
		}
		return new Append(this, other);
	};

	return Append;
})(RopeSequence);

// ProseMirror's history isn't simply a way to roll back to a previous
// state, because ProseMirror supports applying changes without adding
// them to the history (for example during collaboration).
//
// To this end, each 'Branch' (one for the undo history and one for
// the redo history) keeps an array of 'Items', which can optionally
// hold a step (an actual undoable change), and always hold a position
// map (which is needed to move changes below them to apply to the
// current document).
//
// An item that has both a step and a selection bookmark is the start
// of an 'event' — a group of changes that will be undone or redone at
// once. (It stores only the bookmark, since that way we don't have to
// provide a document until the selection is actually applied, which
// is useful when compressing.)
// Used to schedule history compression
const max_empty_items = 500;
class Branch {
	constructor(items, eventCount) {
		this.items = items;
		this.eventCount = eventCount;
	}
	// Pop the latest event off the branch's history and apply it
	// to a document transform.
	popEvent(state, preserveItems) {
		if (this.eventCount == 0) return null;
		let end = this.items.length;
		for (; ; end--) {
			let next = this.items.get(end - 1);
			if (next.selection) {
				--end;
				break;
			}
		}
		let remap, mapFrom;
		if (preserveItems) {
			remap = this.remapping(end, this.items.length);
			mapFrom = remap.maps.length;
		}
		let transform = state.tr;
		let selection, remaining;
		let addAfter = [],
			addBefore = [];
		this.items.forEach(
			(item, i) => {
				if (!item.step) {
					if (!remap) {
						remap = this.remapping(end, i + 1);
						mapFrom = remap.maps.length;
					}
					mapFrom--;
					addBefore.push(item);
					return;
				}
				if (remap) {
					addBefore.push(new Item(item.map));
					let step = item.step.map(remap.slice(mapFrom)),
						map;
					if (step && transform.maybeStep(step).doc) {
						map = transform.mapping.maps[transform.mapping.maps.length - 1];
						addAfter.push(new Item(map, undefined, undefined, addAfter.length + addBefore.length));
					}
					mapFrom--;
					if (map) remap.appendMap(map, mapFrom);
				} else {
					transform.maybeStep(item.step);
				}
				if (item.selection) {
					selection = remap ? item.selection.map(remap.slice(mapFrom)) : item.selection;
					remaining = new Branch(this.items.slice(0, end).append(addBefore.reverse().concat(addAfter)), this.eventCount - 1);
					return false;
				}
			},
			this.items.length,
			0,
		);
		return { remaining: remaining, transform, selection: selection };
	}
	// Create a new branch with the given transform added.
	addTransform(transform, selection, histOptions, preserveItems) {
		let newItems = [],
			eventCount = this.eventCount;
		let oldItems = this.items,
			lastItem = !preserveItems && oldItems.length ? oldItems.get(oldItems.length - 1) : null;
		for (let i = 0; i < transform.steps.length; i++) {
			let step = transform.steps[i].invert(transform.docs[i]);
			let item = new Item(transform.mapping.maps[i], step, selection),
				merged;
			if ((merged = lastItem && lastItem.merge(item))) {
				item = merged;
				if (i) newItems.pop();
				else oldItems = oldItems.slice(0, oldItems.length - 1);
			}
			newItems.push(item);
			if (selection) {
				eventCount++;
				selection = undefined;
			}
			if (!preserveItems) lastItem = item;
		}
		let overflow = eventCount - histOptions.depth;
		if (overflow > DEPTH_OVERFLOW) {
			oldItems = cutOffEvents(oldItems, overflow);
			eventCount -= overflow;
		}
		return new Branch(oldItems.append(newItems), eventCount);
	}
	remapping(from, to) {
		let maps = new Mapping();
		this.items.forEach(
			(item, i) => {
				let mirrorPos = item.mirrorOffset != null && i - item.mirrorOffset >= from ? maps.maps.length - item.mirrorOffset : undefined;
				maps.appendMap(item.map, mirrorPos);
			},
			from,
			to,
		);
		return maps;
	}
	addMaps(array) {
		if (this.eventCount == 0) return this;
		return new Branch(this.items.append(array.map((map) => new Item(map))), this.eventCount);
	}
	// When the collab module receives remote changes, the history has
	// to know about those, so that it can adjust the steps that were
	// rebased on top of the remote changes, and include the position
	// maps for the remote changes in its array of items.
	rebased(rebasedTransform, rebasedCount) {
		if (!this.eventCount) return this;
		let rebasedItems = [],
			start = Math.max(0, this.items.length - rebasedCount);
		let mapping = rebasedTransform.mapping;
		let newUntil = rebasedTransform.steps.length;
		let eventCount = this.eventCount;
		this.items.forEach((item) => {
			if (item.selection) eventCount--;
		}, start);
		let iRebased = rebasedCount;
		this.items.forEach((item) => {
			let pos = mapping.getMirror(--iRebased);
			if (pos == null) return;
			newUntil = Math.min(newUntil, pos);
			let map = mapping.maps[pos];
			if (item.step) {
				let step = rebasedTransform.steps[pos].invert(rebasedTransform.docs[pos]);
				let selection = item.selection && item.selection.map(mapping.slice(iRebased + 1, pos));
				if (selection) eventCount++;
				rebasedItems.push(new Item(map, step, selection));
			} else {
				rebasedItems.push(new Item(map));
			}
		}, start);
		let newMaps = [];
		for (let i = rebasedCount; i < newUntil; i++) newMaps.push(new Item(mapping.maps[i]));
		let items = this.items.slice(0, start).append(newMaps).append(rebasedItems);
		let branch = new Branch(items, eventCount);
		if (branch.emptyItemCount() > max_empty_items) branch = branch.compress(this.items.length - rebasedItems.length);
		return branch;
	}
	emptyItemCount() {
		let count = 0;
		this.items.forEach((item) => {
			if (!item.step) count++;
		});
		return count;
	}
	// Compressing a branch means rewriting it to push the air (map-only
	// items) out. During collaboration, these naturally accumulate
	// because each remote change adds one. The `upto` argument is used
	// to ensure that only the items below a given level are compressed,
	// because `rebased` relies on a clean, untouched set of items in
	// order to associate old items with rebased steps.
	compress(upto = this.items.length) {
		let remap = this.remapping(0, upto),
			mapFrom = remap.maps.length;
		let items = [],
			events = 0;
		this.items.forEach(
			(item, i) => {
				if (i >= upto) {
					items.push(item);
					if (item.selection) events++;
				} else if (item.step) {
					let step = item.step.map(remap.slice(mapFrom)),
						map = step && step.getMap();
					mapFrom--;
					if (map) remap.appendMap(map, mapFrom);
					if (step) {
						let selection = item.selection && item.selection.map(remap.slice(mapFrom));
						if (selection) events++;
						let newItem = new Item(map.invert(), step, selection),
							merged,
							last = items.length - 1;
						if ((merged = items.length && items[last].merge(newItem))) items[last] = merged;
						else items.push(newItem);
					}
				} else if (item.map) {
					mapFrom--;
				}
			},
			this.items.length,
			0,
		);
		return new Branch(RopeSequence.from(items.reverse()), events);
	}
}
Branch.empty = new Branch(RopeSequence.empty, 0);
function cutOffEvents(items, n) {
	let cutPoint;
	items.forEach((item, i) => {
		if (item.selection && n-- == 0) {
			cutPoint = i;
			return false;
		}
	});
	return items.slice(cutPoint);
}
class Item {
	constructor(
		// The (forward) step map for this item.
		map,
		// The inverted step
		step,
		// If this is non-null, this item is the start of a group, and
		// this selection is the starting selection for the group (the one
		// that was active before the first step was applied)
		selection,
		// If this item is the inverse of a previous mapping on the stack,
		// this points at the inverse's offset
		mirrorOffset,
	) {
		this.map = map;
		this.step = step;
		this.selection = selection;
		this.mirrorOffset = mirrorOffset;
	}
	merge(other) {
		if (this.step && other.step && !other.selection) {
			let step = other.step.merge(this.step);
			if (step) return new Item(step.getMap().invert(), step, this.selection);
		}
	}
}
// The value of the state field that tracks undo/redo history for that
// state. Will be stored in the plugin state when the history plugin
// is active.
class HistoryState {
	constructor(done, undone, prevRanges, prevTime, prevComposition) {
		this.done = done;
		this.undone = undone;
		this.prevRanges = prevRanges;
		this.prevTime = prevTime;
		this.prevComposition = prevComposition;
	}
}
const DEPTH_OVERFLOW = 20;
// Record a transformation in undo history.
function applyTransaction(history, state, tr, options) {
	let historyTr = tr.getMeta(historyKey),
		rebased;
	if (historyTr) return historyTr.historyState;
	if (tr.getMeta(closeHistoryKey)) history = new HistoryState(history.done, history.undone, null, 0, -1);
	let appended = tr.getMeta("appendedTransaction");
	if (tr.steps.length == 0) {
		return history;
	} else if (appended && appended.getMeta(historyKey)) {
		if (appended.getMeta(historyKey).redo)
			return new HistoryState(history.done.addTransform(tr, undefined, options, mustPreserveItems(state)), history.undone, rangesFor(tr.mapping.maps), history.prevTime, history.prevComposition);
		else return new HistoryState(history.done, history.undone.addTransform(tr, undefined, options, mustPreserveItems(state)), null, history.prevTime, history.prevComposition);
	} else if (tr.getMeta("addToHistory") !== false && !(appended && appended.getMeta("addToHistory") === false)) {
		// Group transforms that occur in quick succession into one event.
		let composition = tr.getMeta("composition");
		let newGroup =
			history.prevTime == 0 || (!appended && history.prevComposition != composition && (history.prevTime < (tr.time || 0) - options.newGroupDelay || !isAdjacentTo(tr, history.prevRanges)));
		let prevRanges = appended ? mapRanges(history.prevRanges, tr.mapping) : rangesFor(tr.mapping.maps);
		return new HistoryState(
			history.done.addTransform(tr, newGroup ? state.selection.getBookmark() : undefined, options, mustPreserveItems(state)),
			Branch.empty,
			prevRanges,
			tr.time,
			composition == null ? history.prevComposition : composition,
		);
	} else if ((rebased = tr.getMeta("rebased"))) {
		// Used by the collab module to tell the history that some of its
		// content has been rebased.
		return new HistoryState(history.done.rebased(tr, rebased), history.undone.rebased(tr, rebased), mapRanges(history.prevRanges, tr.mapping), history.prevTime, history.prevComposition);
	} else {
		return new HistoryState(history.done.addMaps(tr.mapping.maps), history.undone.addMaps(tr.mapping.maps), mapRanges(history.prevRanges, tr.mapping), history.prevTime, history.prevComposition);
	}
}
function isAdjacentTo(transform, prevRanges) {
	if (!prevRanges) return false;
	if (!transform.docChanged) return true;
	let adjacent = false;
	transform.mapping.maps[0].forEach((start, end) => {
		for (let i = 0; i < prevRanges.length; i += 2) if (start <= prevRanges[i + 1] && end >= prevRanges[i]) adjacent = true;
	});
	return adjacent;
}
function rangesFor(maps) {
	let result = [];
	for (let i = maps.length - 1; i >= 0 && result.length == 0; i--) maps[i].forEach((_from, _to, from, to) => result.push(from, to));
	return result;
}
function mapRanges(ranges, mapping) {
	if (!ranges) return null;
	let result = [];
	for (let i = 0; i < ranges.length; i += 2) {
		let from = mapping.map(ranges[i], 1),
			to = mapping.map(ranges[i + 1], -1);
		if (from <= to) result.push(from, to);
	}
	return result;
}
// Apply the latest event from one branch to the document and shift the event
// onto the other branch.
function histTransaction(history, state, redo) {
	let preserveItems = mustPreserveItems(state);
	let histOptions = historyKey.get(state).spec.config;
	let pop = (redo ? history.undone : history.done).popEvent(state, preserveItems);
	if (!pop) return null;
	let selection = pop.selection.resolve(pop.transform.doc);
	let added = (redo ? history.done : history.undone).addTransform(pop.transform, state.selection.getBookmark(), histOptions, preserveItems);
	let newHist = new HistoryState(redo ? added : pop.remaining, redo ? pop.remaining : added, null, 0, -1);
	return pop.transform.setSelection(selection).setMeta(historyKey, { redo, historyState: newHist });
}
let cachedPreserveItems = false,
	cachedPreserveItemsPlugins = null;
// Check whether any plugin in the given state has a
// `historyPreserveItems` property in its spec, in which case we must
// preserve steps exactly as they came in, so that they can be
// rebased.
function mustPreserveItems(state) {
	let plugins = state.plugins;
	if (cachedPreserveItemsPlugins != plugins) {
		cachedPreserveItems = false;
		cachedPreserveItemsPlugins = plugins;
		for (let i = 0; i < plugins.length; i++)
			if (plugins[i].spec.historyPreserveItems) {
				cachedPreserveItems = true;
				break;
			}
	}
	return cachedPreserveItems;
}
/**
Set a flag on the given transaction that will prevent further steps
from being appended to an existing history event (so that they
require a separate undo command to undo).
*/
function closeHistory(tr) {
	return tr.setMeta(closeHistoryKey, true);
}
const historyKey = new PluginKey("history");
const closeHistoryKey = new PluginKey("closeHistory");
/**
Returns a plugin that enables the undo history for an editor. The
plugin will track undo and redo stacks, which can be used with the
[`undo`](https://prosemirror.net/docs/ref/#history.undo) and [`redo`](https://prosemirror.net/docs/ref/#history.redo) commands.

You can set an `"addToHistory"` [metadata
property](https://prosemirror.net/docs/ref/#state.Transaction.setMeta) of `false` on a transaction
to prevent it from being rolled back by undo.
*/
function history(config = {}) {
	config = { depth: config.depth || 100, newGroupDelay: config.newGroupDelay || 500 };
	return new Plugin({
		key: historyKey,
		state: {
			init() {
				return new HistoryState(Branch.empty, Branch.empty, null, 0, -1);
			},
			apply(tr, hist, state) {
				return applyTransaction(hist, state, tr, config);
			},
		},
		config,
		props: {
			handleDOMEvents: {
				beforeinput(view, e) {
					let inputType = e.inputType;
					let command =
						inputType == "historyUndo" ? undo
						: inputType == "historyRedo" ? redo
						: null;
					if (!command || !view.editable) return false;
					e.preventDefault();
					return command(view.state, view.dispatch);
				},
			},
		},
	});
}
function buildCommand(redo, scroll) {
	return (state, dispatch) => {
		let hist = historyKey.getState(state);
		if (!hist || (redo ? hist.undone : hist.done).eventCount == 0) return false;
		if (dispatch) {
			let tr = histTransaction(hist, state, redo);
			if (tr) dispatch(scroll ? tr.scrollIntoView() : tr);
		}
		return true;
	};
}
/**
A command function that undoes the last change, if any.
*/
const undo = buildCommand(false, true);
/**
A command function that redoes the last undone change, if any.
*/
const redo = buildCommand(true, true);

/**
Gap cursor selections are represented using this class. Its
`$anchor` and `$head` properties both point at the cursor position.
*/
class GapCursor extends Selection {
	/**
    Create a gap cursor.
    */
	constructor($pos) {
		super($pos, $pos);
	}
	map(doc, mapping) {
		let $pos = doc.resolve(mapping.map(this.head));
		return GapCursor.valid($pos) ? new GapCursor($pos) : Selection.near($pos);
	}
	content() {
		return Slice.empty;
	}
	eq(other) {
		return other instanceof GapCursor && other.head == this.head;
	}
	toJSON() {
		return { type: "gapcursor", pos: this.head };
	}
	/**
    @internal
    */
	static fromJSON(doc, json) {
		if (typeof json.pos != "number") throw new RangeError("Invalid input for GapCursor.fromJSON");
		return new GapCursor(doc.resolve(json.pos));
	}
	/**
    @internal
    */
	getBookmark() {
		return new GapBookmark(this.anchor);
	}
	/**
    @internal
    */
	static valid($pos) {
		let parent = $pos.parent;
		if (parent.inlineContent || !closedBefore($pos) || !closedAfter($pos)) return false;
		let override = parent.type.spec.allowGapCursor;
		if (override != null) return override;
		let deflt = parent.contentMatchAt($pos.index()).defaultType;
		return deflt && deflt.isTextblock;
	}
	/**
    @internal
    */
	static findGapCursorFrom($pos, dir, mustMove = false) {
		search: for (;;) {
			if (!mustMove && GapCursor.valid($pos)) return $pos;
			let pos = $pos.pos,
				next = null;
			// Scan up from this position
			for (let d = $pos.depth; ; d--) {
				let parent = $pos.node(d);
				if (dir > 0 ? $pos.indexAfter(d) < parent.childCount : $pos.index(d) > 0) {
					next = parent.child(dir > 0 ? $pos.indexAfter(d) : $pos.index(d) - 1);
					break;
				} else if (d == 0) {
					return null;
				}
				pos += dir;
				let $cur = $pos.doc.resolve(pos);
				if (GapCursor.valid($cur)) return $cur;
			}
			// And then down into the next node
			for (;;) {
				let inside = dir > 0 ? next.firstChild : next.lastChild;
				if (!inside) {
					if (next.isAtom && !next.isText && !NodeSelection.isSelectable(next)) {
						$pos = $pos.doc.resolve(pos + next.nodeSize * dir);
						mustMove = false;
						continue search;
					}
					break;
				}
				next = inside;
				pos += dir;
				let $cur = $pos.doc.resolve(pos);
				if (GapCursor.valid($cur)) return $cur;
			}
			return null;
		}
	}
}
GapCursor.prototype.visible = false;
GapCursor.findFrom = GapCursor.findGapCursorFrom;
Selection.jsonID("gapcursor", GapCursor);
class GapBookmark {
	constructor(pos) {
		this.pos = pos;
	}
	map(mapping) {
		return new GapBookmark(mapping.map(this.pos));
	}
	resolve(doc) {
		let $pos = doc.resolve(this.pos);
		return GapCursor.valid($pos) ? new GapCursor($pos) : Selection.near($pos);
	}
}
function needsGap(type) {
	return type.isAtom || type.spec.isolating || type.spec.createGapCursor;
}
function closedBefore($pos) {
	for (let d = $pos.depth; d >= 0; d--) {
		let index = $pos.index(d),
			parent = $pos.node(d);
		// At the start of this parent, look at next one
		if (index == 0) {
			if (parent.type.spec.isolating) return true;
			continue;
		}
		// See if the node before (or its first ancestor) is closed
		for (let before = parent.child(index - 1); ; before = before.lastChild) {
			if ((before.childCount == 0 && !before.inlineContent) || needsGap(before.type)) return true;
			if (before.inlineContent) return false;
		}
	}
	// Hit start of document
	return true;
}
function closedAfter($pos) {
	for (let d = $pos.depth; d >= 0; d--) {
		let index = $pos.indexAfter(d),
			parent = $pos.node(d);
		if (index == parent.childCount) {
			if (parent.type.spec.isolating) return true;
			continue;
		}
		for (let after = parent.child(index); ; after = after.firstChild) {
			if ((after.childCount == 0 && !after.inlineContent) || needsGap(after.type)) return true;
			if (after.inlineContent) return false;
		}
	}
	return true;
}

/**
Create a gap cursor plugin. When enabled, this will capture clicks
near and arrow-key-motion past places that don't have a normally
selectable position nearby, and create a gap cursor selection for
them. The cursor is drawn as an element with class
`ProseMirror-gapcursor`. You can either include
`style/gapcursor.css` from the package's directory or add your own
styles to make it visible.
*/
function gapCursor() {
	return new Plugin({
		props: {
			decorations: drawGapCursor,
			createSelectionBetween(_view, $anchor, $head) {
				return $anchor.pos == $head.pos && GapCursor.valid($head) ? new GapCursor($head) : null;
			},
			handleClick,
			handleKeyDown,
			handleDOMEvents: { beforeinput: beforeinput },
		},
	});
}
const handleKeyDown = keydownHandler({
	ArrowLeft: arrow("horiz", -1),
	ArrowRight: arrow("horiz", 1),
	ArrowUp: arrow("vert", -1),
	ArrowDown: arrow("vert", 1),
});
function arrow(axis, dir) {
	const dirStr =
		axis == "vert" ?
			dir > 0 ?
				"down"
			:	"up"
		: dir > 0 ? "right"
		: "left";
	return function (state, dispatch, view) {
		let sel = state.selection;
		let $start = dir > 0 ? sel.$to : sel.$from,
			mustMove = sel.empty;
		if (sel instanceof TextSelection) {
			if (!view.endOfTextblock(dirStr) || $start.depth == 0) return false;
			mustMove = false;
			$start = state.doc.resolve(dir > 0 ? $start.after() : $start.before());
		}
		let $found = GapCursor.findGapCursorFrom($start, dir, mustMove);
		if (!$found) return false;
		if (dispatch) dispatch(state.tr.setSelection(new GapCursor($found)));
		return true;
	};
}
function handleClick(view, pos, event) {
	if (!view || !view.editable) return false;
	let $pos = view.state.doc.resolve(pos);
	if (!GapCursor.valid($pos)) return false;
	let clickPos = view.posAtCoords({ left: event.clientX, top: event.clientY });
	if (clickPos && clickPos.inside > -1 && NodeSelection.isSelectable(view.state.doc.nodeAt(clickPos.inside))) return false;
	view.dispatch(view.state.tr.setSelection(new GapCursor($pos)));
	return true;
}
// This is a hack that, when a composition starts while a gap cursor
// is active, quickly creates an inline context for the composition to
// happen in, to avoid it being aborted by the DOM selection being
// moved into a valid position.
function beforeinput(view, event) {
	if (event.inputType != "insertCompositionText" || !(view.state.selection instanceof GapCursor)) return false;
	let { $from } = view.state.selection;
	let insert = $from.parent.contentMatchAt($from.index()).findWrapping(view.state.schema.nodes.text);
	if (!insert) return false;
	let frag = Fragment.empty;
	for (let i = insert.length - 1; i >= 0; i--) frag = Fragment.from(insert[i].createAndFill(null, frag));
	let tr = view.state.tr.replace($from.pos, $from.pos, new Slice(frag, 0, 0));
	tr.setSelection(TextSelection.near(tr.doc.resolve($from.pos + 1)));
	view.dispatch(tr);
	return false;
}
function drawGapCursor(state) {
	if (!(state.selection instanceof GapCursor)) return null;
	let node = document.createElement("div");
	node.className = "ProseMirror-gapcursor";
	return DecorationSet.create(state.doc, [Decoration.widget(state.selection.head, node, { key: "gapcursor" })]);
}

// THIS FILE IS AUTOMATICALLY GENERATED DO NOT EDIT DIRECTLY
// See update-tlds.js for encoding/decoding format
// https://data.iana.org/TLD/tlds-alpha-by-domain.txt
const encodedTlds =
	"aaa1rp3bb0ott3vie4c1le2ogado5udhabi7c0ademy5centure6ountant0s9o1tor4d0s1ult4e0g1ro2tna4f0l1rica5g0akhan5ency5i0g1rbus3force5tel5kdn3l0ibaba4pay4lfinanz6state5y2sace3tom5m0azon4ericanexpress7family11x2fam3ica3sterdam8nalytics7droid5quan4z2o0l2partments8p0le4q0uarelle8r0ab1mco4chi3my2pa2t0e3s0da2ia2sociates9t0hleta5torney7u0ction5di0ble3o3spost5thor3o0s4w0s2x0a2z0ure5ba0by2idu3namex4d1k2r0celona5laycard4s5efoot5gains6seball5ketball8uhaus5yern5b0c1t1va3cg1n2d1e0ats2uty4er2rlin4st0buy5t2f1g1h0arti5i0ble3d1ke2ng0o3o1z2j1lack0friday9ockbuster8g1omberg7ue3m0s1w2n0pparibas9o0ats3ehringer8fa2m1nd2o0k0ing5sch2tik2on4t1utique6x2r0adesco6idgestone9oadway5ker3ther5ussels7s1t1uild0ers6siness6y1zz3v1w1y1z0h3ca0b1fe2l0l1vinklein9m0era3p2non3petown5ital0one8r0avan4ds2e0er0s4s2sa1e1h1ino4t0ering5holic7ba1n1re3c1d1enter4o1rn3f0a1d2g1h0anel2nel4rity4se2t2eap3intai5ristmas6ome4urch5i0priani6rcle4sco3tadel4i0c2y3k1l0aims4eaning6ick2nic1que6othing5ud3ub0med6m1n1o0ach3des3ffee4llege4ogne5m0mbank4unity6pany2re3uter5sec4ndos3struction8ulting7tact3ractors9oking4l1p2rsica5untry4pon0s4rses6pa2r0edit0card4union9icket5own3s1uise0s6u0isinella9v1w1x1y0mru3ou3z2dad1nce3ta1e1ing3sun4y2clk3ds2e0al0er2s3gree4livery5l1oitte5ta3mocrat6ntal2ist5si0gn4v2hl2iamonds6et2gital5rect0ory7scount3ver5h2y2j1k1m1np2o0cs1tor4g1mains5t1wnload7rive4tv2ubai3pont4rban5vag2r2z2earth3t2c0o2deka3u0cation8e1g1mail3erck5nergy4gineer0ing9terprises10pson4quipment8r0icsson6ni3s0q1tate5t1u0rovision8s2vents5xchange6pert3osed4ress5traspace10fage2il1rwinds6th3mily4n0s2rm0ers5shion4t3edex3edback6rrari3ero6i0delity5o2lm2nal1nce1ial7re0stone6mdale6sh0ing5t0ness6j1k1lickr3ghts4r2orist4wers5y2m1o0o0d1tball6rd1ex2sale4um3undation8x2r0ee1senius7l1ogans4ntier7tr2ujitsu5n0d2rniture7tbol5yi3ga0l0lery3o1up4me0s3p1rden4y2b0iz3d0n2e0a1nt0ing5orge5f1g0ee3h1i0ft0s3ves2ing5l0ass3e1obal2o4m0ail3bh2o1x2n1odaddy5ld0point6f2odyear5g0le4p1t1v2p1q1r0ainger5phics5tis4een3ipe3ocery4up4s1t1u0cci3ge2ide2tars5ru3w1y2hair2mburg5ngout5us3bo2dfc0bank7ealth0care8lp1sinki6re1mes5iphop4samitsu7tachi5v2k0t2m1n1ockey4ldings5iday5medepot5goods5s0ense7nda3rse3spital5t0ing5t0els3mail5use3w2r1sbc3t1u0ghes5yatt3undai7ibm2cbc2e1u2d1e0ee3fm2kano4l1m0amat4db2mo0bilien9n0c1dustries8finiti5o2g1k1stitute6urance4e4t0ernational10uit4vestments10o1piranga7q1r0ish4s0maili5t0anbul7t0au2v3jaguar4va3cb2e0ep2tzt3welry6io2ll2m0p2nj2o0bs1urg4t1y2p0morgan6rs3uegos4niper7kaufen5ddi3e0rryhotels6properties14fh2g1h1i0a1ds2m1ndle4tchen5wi3m1n1oeln3matsu5sher5p0mg2n2r0d1ed3uokgroup8w1y0oto4z2la0caixa5mborghini8er3nd0rover6xess5salle5t0ino3robe5w0yer5b1c1ds2ease3clerc5frak4gal2o2xus4gbt3i0dl2fe0insurance9style7ghting6ke2lly3mited4o2ncoln4k2ve1ing5k1lc1p2oan0s3cker3us3l1ndon4tte1o3ve3pl0financial11r1s1t0d0a3u0ndbeck6xe1ury5v1y2ma0drid4if1son4keup4n0agement7go3p1rket0ing3s4riott5shalls7ttel5ba2c0kinsey7d1e0d0ia3et2lbourne7me1orial6n0u2rck0msd7g1h1iami3crosoft7l1ni1t2t0subishi9k1l0b1s2m0a2n1o0bi0le4da2e1i1m1nash3ey2ster5rmon3tgage6scow4to0rcycles9v0ie4p1q1r1s0d2t0n1r2u0seum3ic4v1w1x1y1z2na0b1goya4me2vy3ba2c1e0c1t0bank4flix4work5ustar5w0s2xt0direct7us4f0l2g0o2hk2i0co2ke1on3nja3ssan1y5l1o0kia3rton4w0ruz3tv4p1r0a1w2tt2u1yc2z2obi1server7ffice5kinawa6layan0group9lo3m0ega4ne1g1l0ine5oo2pen3racle3nge4g0anic5igins6saka4tsuka4t2vh3pa0ge2nasonic7ris2s1tners4s1y3y2ccw3e0t2f0izer5g1h0armacy6d1ilips5one2to0graphy6s4ysio5ics1tet2ures6d1n0g1k2oneer5zza4k1l0ace2y0station9umbing5s3m1n0c2ohl2ker3litie5rn2st3r0axi3ess3ime3o0d0uctions8f1gressive8mo2perties3y5tection8u0dential9s1t1ub2w0c2y2qa1pon3uebec3st5racing4dio4e0ad1lestate6tor2y4cipes5d0umbrella9hab3ise0n3t2liance6n0t0als5pair3ort3ublican8st0aurant8view0s5xroth6ich0ardli6oh3l1o1p2o0cks3deo3gers4om3s0vp3u0gby3hr2n2w0e2yukyu6sa0arland6fe0ty4kura4le1on3msclub4ung5ndvik0coromant12ofi4p1rl2s1ve2xo3b0i1s2c0b1haeffler7midt4olarships8ol3ule3warz5ience5ot3d1e0arch3t2cure1ity6ek2lect4ner3rvices6ven3w1x0y3fr2g1h0angrila6rp3ell3ia1ksha5oes2p0ping5uji3w3i0lk2na1gles5te3j1k0i0n2y0pe4l0ing4m0art3ile4n0cf3o0ccer3ial4ftbank4ware6hu2lar2utions7ng1y2y2pa0ce3ort2t3r0l2s1t0ada2ples4r1tebank4farm7c0group6ockholm6rage3e3ream4udio2y3yle4u0cks3pplies3y2ort5rf1gery5zuki5v1watch4iss4x1y0dney4stems6z2tab1ipei4lk2obao4rget4tamotors6r2too4x0i3c0i2d0k2eam2ch0nology8l1masek5nnis4va3f1g1h0d1eater2re6iaa2ckets5enda4ps2res2ol4j0maxx4x2k0maxx5l1m0all4n1o0day3kyo3ols3p1ray3shiba5tal3urs3wn2yota3s3r0ade1ing4ining5vel0ers0insurance16ust3v2t1ube2i1nes3shu4v0s2w1z2ua1bank3s2g1k1nicom3versity8o2ol2ps2s1y1z2va0cations7na1guard7c1e0gas3ntures6risign5mögensberater2ung14sicherung10t2g1i0ajes4deo3g1king4llas4n1p1rgin4sa1ion4va1o3laanderen9n1odka3lvo3te1ing3o2yage5u2wales2mart4ter4ng0gou5tch0es6eather0channel12bcam3er2site5d0ding5ibo2r3f1hoswho6ien2ki2lliamhill9n0dows4e1ners6me2oodside6rk0s2ld3w2s1tc1f3xbox3erox4ihuan4n2xx2yz3yachts4hoo3maxun5ndex5e1odobashi7ga2kohama6u0tube6t1un3za0ppos4ra3ero3ip2m1one3uerich6w2";
// Internationalized domain names containing non-ASCII
const encodedUtlds =
	"ελ1υ2бг1ел3дети4ею2католик6ом3мкд2он1сква6онлайн5рг3рус2ф2сайт3рб3укр3қаз3հայ3ישראל5קום3ابوظبي5رامكو5لاردن4بحرين5جزائر5سعودية6عليان5مغرب5مارات5یران5بارت2زار4يتك3ھارت5تونس4سودان3رية5شبكة4عراق2ب2مان4فلسطين6قطر3كاثوليك6وم3مصر2ليسيا5وريتانيا7قع4همراه5پاکستان7ڀارت4कॉम3नेट3भारत0म्3ोत5संगठन5বাংলা5ভারত2ৰত4ਭਾਰਤ4ભારત4ଭାରତ4இந்தியா6லங்கை6சிங்கப்பூர்11భారత్5ಭಾರತ4ഭാരതം5ලංකා4คอม3ไทย3ລາວ3გე2みんな3アマゾン4クラウド4グーグル4コム2ストア3セール3ファッション6ポイント4世界2中信1国1國1文网3亚马逊3企业2佛山2信息2健康2八卦2公司1益2台湾1灣2商城1店1标2嘉里0大酒店5在线2大拿2天主教3娱乐2家電2广东2微博2慈善2我爱你3手机2招聘2政务1府2新加坡2闻2时尚2書籍2机构2淡马锡3游戏2澳門2点看2移动2组织机构4网址1店1站1络2联通2谷歌2购物2通販2集团2電訊盈科4飞利浦3食品2餐厅2香格里拉3港2닷넷1컴2삼성2한국2";

/**
 * Finite State Machine generation utilities
 */

/**
 * @template T
 * @typedef {{ [group: string]: T[] }} Collections
 */

/**
 * @typedef {{ [group: string]: true }} Flags
 */

// Keys in scanner Collections instances
const numeric = "numeric";
const ascii = "ascii";
const alpha = "alpha";
const asciinumeric = "asciinumeric";
const alphanumeric = "alphanumeric";
const domain = "domain";
const emoji = "emoji";
const scheme = "scheme";
const slashscheme = "slashscheme";
const whitespace = "whitespace";

/**
 * @template T
 * @param {string} name
 * @param {Collections<T>} groups to register in
 * @returns {T[]} Current list of tokens in the given collection
 */
function registerGroup(name, groups) {
	if (!(name in groups)) {
		groups[name] = [];
	}
	return groups[name];
}

/**
 * @template T
 * @param {T} t token to add
 * @param {Collections<T>} groups
 * @param {Flags} flags
 */
function addToGroups(t, flags, groups) {
	if (flags[numeric]) {
		flags[asciinumeric] = true;
		flags[alphanumeric] = true;
	}
	if (flags[ascii]) {
		flags[asciinumeric] = true;
		flags[alpha] = true;
	}
	if (flags[asciinumeric]) {
		flags[alphanumeric] = true;
	}
	if (flags[alpha]) {
		flags[alphanumeric] = true;
	}
	if (flags[alphanumeric]) {
		flags[domain] = true;
	}
	if (flags[emoji]) {
		flags[domain] = true;
	}
	for (const k in flags) {
		const group = registerGroup(k, groups);
		if (group.indexOf(t) < 0) {
			group.push(t);
		}
	}
}

/**
 * @template T
 * @param {T} t token to check
 * @param {Collections<T>} groups
 * @returns {Flags} group flags that contain this token
 */
function flagsForToken(t, groups) {
	const result = {};
	for (const c in groups) {
		if (groups[c].indexOf(t) >= 0) {
			result[c] = true;
		}
	}
	return result;
}

/**
 * @template T
 * @typedef {null | T } Transition
 */

/**
 * Define a basic state machine state. j is the list of character transitions,
 * jr is the list of regex-match transitions, jd is the default state to
 * transition to t is the accepting token type, if any. If this is the terminal
 * state, then it does not emit a token.
 *
 * The template type T represents the type of the token this state accepts. This
 * should be a string (such as of the token exports in `text.js`) or a
 * MultiToken subclass (from `multi.js`)
 *
 * @template T
 * @param {T} [token] Token that this state emits
 */
function State(token = null) {
	// this.n = null; // DEBUG: State name
	/** @type {{ [input: string]: State<T> }} j */
	this.j = {}; // IMPLEMENTATION 1
	// this.j = []; // IMPLEMENTATION 2
	/** @type {[RegExp, State<T>][]} jr */
	this.jr = [];
	/** @type {?State<T>} jd */
	this.jd = null;
	/** @type {?T} t */
	this.t = token;
}

/**
 * Scanner token groups
 * @type Collections<string>
 */
State.groups = {};
State.prototype = {
	accepts() {
		return !!this.t;
	},
	/**
	 * Follow an existing transition from the given input to the next state.
	 * Does not mutate.
	 * @param {string} input character or token type to transition on
	 * @returns {?State<T>} the next state, if any
	 */
	go(input) {
		const state = this;
		const nextState = state.j[input];
		if (nextState) {
			return nextState;
		}
		for (let i = 0; i < state.jr.length; i++) {
			const regex = state.jr[i][0];
			const nextState = state.jr[i][1]; // note: might be empty to prevent default jump
			if (nextState && regex.test(input)) {
				return nextState;
			}
		}
		// Nowhere left to jump! Return default, if any
		return state.jd;
	},
	/**
	 * Whether the state has a transition for the given input. Set the second
	 * argument to true to only look for an exact match (and not a default or
	 * regular-expression-based transition)
	 * @param {string} input
	 * @param {boolean} exactOnly
	 */
	has(input, exactOnly = false) {
		return exactOnly ? input in this.j : !!this.go(input);
	},
	/**
	 * Short for "transition all"; create a transition from the array of items
	 * in the given list to the same final resulting state.
	 * @param {string | string[]} inputs Group of inputs to transition on
	 * @param {Transition<T> | State<T>} [next] Transition options
	 * @param {Flags} [flags] Collections flags to add token to
	 * @param {Collections<T>} [groups] Master list of token groups
	 */
	ta(inputs, next, flags, groups) {
		for (let i = 0; i < inputs.length; i++) {
			this.tt(inputs[i], next, flags, groups);
		}
	},
	/**
	 * Short for "take regexp transition"; defines a transition for this state
	 * when it encounters a token which matches the given regular expression
	 * @param {RegExp} regexp Regular expression transition (populate first)
	 * @param {T | State<T>} [next] Transition options
	 * @param {Flags} [flags] Collections flags to add token to
	 * @param {Collections<T>} [groups] Master list of token groups
	 * @returns {State<T>} taken after the given input
	 */
	tr(regexp, next, flags, groups) {
		groups = groups || State.groups;
		let nextState;
		if (next && next.j) {
			nextState = next;
		} else {
			// Token with maybe token groups
			nextState = new State(next);
			if (flags && groups) {
				addToGroups(next, flags, groups);
			}
		}
		this.jr.push([regexp, nextState]);
		return nextState;
	},
	/**
	 * Short for "take transitions", will take as many sequential transitions as
	 * the length of the given input and returns the
	 * resulting final state.
	 * @param {string | string[]} input
	 * @param {T | State<T>} [next] Transition options
	 * @param {Flags} [flags] Collections flags to add token to
	 * @param {Collections<T>} [groups] Master list of token groups
	 * @returns {State<T>} taken after the given input
	 */
	ts(input, next, flags, groups) {
		let state = this;
		const len = input.length;
		if (!len) {
			return state;
		}
		for (let i = 0; i < len - 1; i++) {
			state = state.tt(input[i]);
		}
		return state.tt(input[len - 1], next, flags, groups);
	},
	/**
	 * Short for "take transition", this is a method for building/working with
	 * state machines.
	 *
	 * If a state already exists for the given input, returns it.
	 *
	 * If a token is specified, that state will emit that token when reached by
	 * the linkify engine.
	 *
	 * If no state exists, it will be initialized with some default transitions
	 * that resemble existing default transitions.
	 *
	 * If a state is given for the second argument, that state will be
	 * transitioned to on the given input regardless of what that input
	 * previously did.
	 *
	 * Specify a token group flags to define groups that this token belongs to.
	 * The token will be added to corresponding entires in the given groups
	 * object.
	 *
	 * @param {string} input character, token type to transition on
	 * @param {T | State<T>} [next] Transition options
	 * @param {Flags} [flags] Collections flags to add token to
	 * @param {Collections<T>} [groups] Master list of groups
	 * @returns {State<T>} taken after the given input
	 */
	tt(input, next, flags, groups) {
		groups = groups || State.groups;
		const state = this;

		// Check if existing state given, just a basic transition
		if (next && next.j) {
			state.j[input] = next;
			return next;
		}
		const t = next;

		// Take the transition with the usual default mechanisms and use that as
		// a template for creating the next state
		let nextState,
			templateState = state.go(input);
		if (templateState) {
			nextState = new State();
			Object.assign(nextState.j, templateState.j);
			nextState.jr.push.apply(nextState.jr, templateState.jr);
			nextState.jd = templateState.jd;
			nextState.t = templateState.t;
		} else {
			nextState = new State();
		}
		if (t) {
			// Ensure newly token is in the same groups as the old token
			if (groups) {
				if (nextState.t && typeof nextState.t === "string") {
					const allFlags = Object.assign(flagsForToken(nextState.t, groups), flags);
					addToGroups(t, allFlags, groups);
				} else if (flags) {
					addToGroups(t, flags, groups);
				}
			}
			nextState.t = t; // overwrite anything that was previously there
		}
		state.j[input] = nextState;
		return nextState;
	},
};

// Helper functions to improve minification (not exported outside linkifyjs module)

/**
 * @template T
 * @param {State<T>} state
 * @param {string | string[]} input
 * @param {Flags} [flags]
 * @param {Collections<T>} [groups]
 */
const ta = (state, input, next, flags, groups) => state.ta(input, next, flags, groups);

/**
 * @template T
 * @param {State<T>} state
 * @param {RegExp} regexp
 * @param {T | State<T>} [next]
 * @param {Flags} [flags]
 * @param {Collections<T>} [groups]
 */
const tr = (state, regexp, next, flags, groups) => state.tr(regexp, next, flags, groups);

/**
 * @template T
 * @param {State<T>} state
 * @param {string | string[]} input
 * @param {T | State<T>} [next]
 * @param {Flags} [flags]
 * @param {Collections<T>} [groups]
 */
const ts = (state, input, next, flags, groups) => state.ts(input, next, flags, groups);

/**
 * @template T
 * @param {State<T>} state
 * @param {string} input
 * @param {T | State<T>} [next]
 * @param {Collections<T>} [groups]
 * @param {Flags} [flags]
 */
const tt = (state, input, next, flags, groups) => state.tt(input, next, flags, groups);

/******************************************************************************
Text Tokens
Identifiers for token outputs from the regexp scanner
******************************************************************************/

// A valid web domain token
const WORD = "WORD"; // only contains a-z
const UWORD = "UWORD"; // contains letters other than a-z, used for IDN
const ASCIINUMERICAL = "ASCIINUMERICAL"; // contains a-z, 0-9
const ALPHANUMERICAL = "ALPHANUMERICAL"; // contains numbers and letters other than a-z, used for IDN

// Special case of word
const LOCALHOST = "LOCALHOST";

// Valid top-level domain, special case of WORD (see tlds.js)
const TLD = "TLD";

// Valid IDN TLD, special case of UWORD (see tlds.js)
const UTLD = "UTLD";

// The scheme portion of a web URI protocol. Supported types include: `mailto`,
// `file`, and user-defined custom protocols. Limited to schemes that contain
// only letters
const SCHEME = "SCHEME";

// Similar to SCHEME, except makes distinction for schemes that must always be
// followed by `://`, not just `:`. Supported types include `http`, `https`,
// `ftp`, `ftps`
const SLASH_SCHEME = "SLASH_SCHEME";

// Any sequence of digits 0-9
const NUM = "NUM";

// Any number of consecutive whitespace characters that are not newline
const WS = "WS";

// New line (unix style)
const NL = "NL"; // \n

// Opening/closing bracket classes
// TODO: Rename OPEN -> LEFT and CLOSE -> RIGHT in v5 to fit with Unicode names
// Also rename angle brackes to LESSTHAN and GREATER THAN
const OPENBRACE = "OPENBRACE"; // {
const CLOSEBRACE = "CLOSEBRACE"; // }
const OPENBRACKET = "OPENBRACKET"; // [
const CLOSEBRACKET = "CLOSEBRACKET"; // ]
const OPENPAREN = "OPENPAREN"; // (
const CLOSEPAREN = "CLOSEPAREN"; // )
const OPENANGLEBRACKET = "OPENANGLEBRACKET"; // <
const CLOSEANGLEBRACKET = "CLOSEANGLEBRACKET"; // >
const FULLWIDTHLEFTPAREN = "FULLWIDTHLEFTPAREN"; // （
const FULLWIDTHRIGHTPAREN = "FULLWIDTHRIGHTPAREN"; // ）
const LEFTCORNERBRACKET = "LEFTCORNERBRACKET"; // 「
const RIGHTCORNERBRACKET = "RIGHTCORNERBRACKET"; // 」
const LEFTWHITECORNERBRACKET = "LEFTWHITECORNERBRACKET"; // 『
const RIGHTWHITECORNERBRACKET = "RIGHTWHITECORNERBRACKET"; // 』
const FULLWIDTHLESSTHAN = "FULLWIDTHLESSTHAN"; // ＜
const FULLWIDTHGREATERTHAN = "FULLWIDTHGREATERTHAN"; // ＞

// Various symbols
const AMPERSAND = "AMPERSAND"; // &
const APOSTROPHE = "APOSTROPHE"; // '
const ASTERISK = "ASTERISK"; // *
const AT = "AT"; // @
const BACKSLASH = "BACKSLASH"; // \
const BACKTICK = "BACKTICK"; // `
const CARET = "CARET"; // ^
const COLON = "COLON"; // :
const COMMA = "COMMA"; // ,
const DOLLAR = "DOLLAR"; // $
const DOT = "DOT"; // .
const EQUALS = "EQUALS"; // =
const EXCLAMATION = "EXCLAMATION"; // !
const HYPHEN = "HYPHEN"; // -
const PERCENT = "PERCENT"; // %
const PIPE = "PIPE"; // |
const PLUS = "PLUS"; // +
const POUND = "POUND"; // #
const QUERY = "QUERY"; // ?
const QUOTE = "QUOTE"; // "
const FULLWIDTHMIDDLEDOT = "FULLWIDTHMIDDLEDOT"; // ・

const SEMI = "SEMI"; // ;
const SLASH = "SLASH"; // /
const TILDE = "TILDE"; // ~
const UNDERSCORE = "UNDERSCORE"; // _

// Emoji symbol
const EMOJI$1 = "EMOJI";

// Default token - anything that is not one of the above
const SYM = "SYM";

var tk = /*#__PURE__*/ Object.freeze({
	__proto__: null,
	ALPHANUMERICAL: ALPHANUMERICAL,
	AMPERSAND: AMPERSAND,
	APOSTROPHE: APOSTROPHE,
	ASCIINUMERICAL: ASCIINUMERICAL,
	ASTERISK: ASTERISK,
	AT: AT,
	BACKSLASH: BACKSLASH,
	BACKTICK: BACKTICK,
	CARET: CARET,
	CLOSEANGLEBRACKET: CLOSEANGLEBRACKET,
	CLOSEBRACE: CLOSEBRACE,
	CLOSEBRACKET: CLOSEBRACKET,
	CLOSEPAREN: CLOSEPAREN,
	COLON: COLON,
	COMMA: COMMA,
	DOLLAR: DOLLAR,
	DOT: DOT,
	EMOJI: EMOJI$1,
	EQUALS: EQUALS,
	EXCLAMATION: EXCLAMATION,
	FULLWIDTHGREATERTHAN: FULLWIDTHGREATERTHAN,
	FULLWIDTHLEFTPAREN: FULLWIDTHLEFTPAREN,
	FULLWIDTHLESSTHAN: FULLWIDTHLESSTHAN,
	FULLWIDTHMIDDLEDOT: FULLWIDTHMIDDLEDOT,
	FULLWIDTHRIGHTPAREN: FULLWIDTHRIGHTPAREN,
	HYPHEN: HYPHEN,
	LEFTCORNERBRACKET: LEFTCORNERBRACKET,
	LEFTWHITECORNERBRACKET: LEFTWHITECORNERBRACKET,
	LOCALHOST: LOCALHOST,
	NL: NL,
	NUM: NUM,
	OPENANGLEBRACKET: OPENANGLEBRACKET,
	OPENBRACE: OPENBRACE,
	OPENBRACKET: OPENBRACKET,
	OPENPAREN: OPENPAREN,
	PERCENT: PERCENT,
	PIPE: PIPE,
	PLUS: PLUS,
	POUND: POUND,
	QUERY: QUERY,
	QUOTE: QUOTE,
	RIGHTCORNERBRACKET: RIGHTCORNERBRACKET,
	RIGHTWHITECORNERBRACKET: RIGHTWHITECORNERBRACKET,
	SCHEME: SCHEME,
	SEMI: SEMI,
	SLASH: SLASH,
	SLASH_SCHEME: SLASH_SCHEME,
	SYM: SYM,
	TILDE: TILDE,
	TLD: TLD,
	UNDERSCORE: UNDERSCORE,
	UTLD: UTLD,
	UWORD: UWORD,
	WORD: WORD,
	WS: WS,
});

// Note that these two Unicode ones expand into a really big one with Babel
const ASCII_LETTER = /[a-z]/;
const LETTER = /\p{L}/u; // Any Unicode character with letter data type
const EMOJI = /\p{Emoji}/u; // Any Unicode emoji character
const DIGIT = /\d/;
const SPACE = /\s/;

/**
	The scanner provides an interface that takes a string of text as input, and
	outputs an array of tokens instances that can be used for easy URL parsing.
*/

const CR = "\r"; // carriage-return character
const LF = "\n"; // line-feed character
const EMOJI_VARIATION = "\ufe0f"; // Variation selector, follows heart and others
const EMOJI_JOINER = "\u200d"; // zero-width joiner
const OBJECT_REPLACEMENT = "\ufffc"; // whitespace placeholder that sometimes appears in rich text editors

let tlds = null,
	utlds = null; // don't change so only have to be computed once

/**
 * Scanner output token:
 * - `t` is the token name (e.g., 'NUM', 'EMOJI', 'TLD')
 * - `v` is the value of the token (e.g., '123', '❤️', 'com')
 * - `s` is the start index of the token in the original string
 * - `e` is the end index of the token in the original string
 * @typedef {{t: string, v: string, s: number, e: number}} Token
 */

/**
 * @template T
 * @typedef {{ [collection: string]: T[] }} Collections
 */

/**
 * Initialize the scanner character-based state machine for the given start
 * state
 * @param {[string, boolean][]} customSchemes List of custom schemes, where each
 * item is a length-2 tuple with the first element set to the string scheme, and
 * the second element set to `true` if the `://` after the scheme is optional
 */
function init$2(customSchemes = []) {
	// Frequently used states (name argument removed during minification)
	/** @type Collections<string> */
	const groups = {}; // of tokens
	State.groups = groups;
	/** @type State<string> */
	const Start = new State();
	if (tlds == null) {
		tlds = decodeTlds(encodedTlds);
	}
	if (utlds == null) {
		utlds = decodeTlds(encodedUtlds);
	}

	// States for special URL symbols that accept immediately after start
	tt(Start, "'", APOSTROPHE);
	tt(Start, "{", OPENBRACE);
	tt(Start, "}", CLOSEBRACE);
	tt(Start, "[", OPENBRACKET);
	tt(Start, "]", CLOSEBRACKET);
	tt(Start, "(", OPENPAREN);
	tt(Start, ")", CLOSEPAREN);
	tt(Start, "<", OPENANGLEBRACKET);
	tt(Start, ">", CLOSEANGLEBRACKET);
	tt(Start, "（", FULLWIDTHLEFTPAREN);
	tt(Start, "）", FULLWIDTHRIGHTPAREN);
	tt(Start, "「", LEFTCORNERBRACKET);
	tt(Start, "」", RIGHTCORNERBRACKET);
	tt(Start, "『", LEFTWHITECORNERBRACKET);
	tt(Start, "』", RIGHTWHITECORNERBRACKET);
	tt(Start, "＜", FULLWIDTHLESSTHAN);
	tt(Start, "＞", FULLWIDTHGREATERTHAN);
	tt(Start, "&", AMPERSAND);
	tt(Start, "*", ASTERISK);
	tt(Start, "@", AT);
	tt(Start, "`", BACKTICK);
	tt(Start, "^", CARET);
	tt(Start, ":", COLON);
	tt(Start, ",", COMMA);
	tt(Start, "$", DOLLAR);
	tt(Start, ".", DOT);
	tt(Start, "=", EQUALS);
	tt(Start, "!", EXCLAMATION);
	tt(Start, "-", HYPHEN);
	tt(Start, "%", PERCENT);
	tt(Start, "|", PIPE);
	tt(Start, "+", PLUS);
	tt(Start, "#", POUND);
	tt(Start, "?", QUERY);
	tt(Start, '"', QUOTE);
	tt(Start, "/", SLASH);
	tt(Start, ";", SEMI);
	tt(Start, "~", TILDE);
	tt(Start, "_", UNDERSCORE);
	tt(Start, "\\", BACKSLASH);
	tt(Start, "・", FULLWIDTHMIDDLEDOT);
	const Num = tr(Start, DIGIT, NUM, {
		[numeric]: true,
	});
	tr(Num, DIGIT, Num);
	const Asciinumeric = tr(Num, ASCII_LETTER, ASCIINUMERICAL, {
		[asciinumeric]: true,
	});
	const Alphanumeric = tr(Num, LETTER, ALPHANUMERICAL, {
		[alphanumeric]: true,
	});

	// State which emits a word token
	const Word = tr(Start, ASCII_LETTER, WORD, {
		[ascii]: true,
	});
	tr(Word, DIGIT, Asciinumeric);
	tr(Word, ASCII_LETTER, Word);
	tr(Asciinumeric, DIGIT, Asciinumeric);
	tr(Asciinumeric, ASCII_LETTER, Asciinumeric);

	// Same as previous, but specific to non-fsm.ascii alphabet words
	const UWord = tr(Start, LETTER, UWORD, {
		[alpha]: true,
	});
	tr(UWord, ASCII_LETTER); // Non-accepting
	tr(UWord, DIGIT, Alphanumeric);
	tr(UWord, LETTER, UWord);
	tr(Alphanumeric, DIGIT, Alphanumeric);
	tr(Alphanumeric, ASCII_LETTER); // Non-accepting
	tr(Alphanumeric, LETTER, Alphanumeric); // Non-accepting

	// Whitespace jumps
	// Tokens of only non-newline whitespace are arbitrarily long
	// If any whitespace except newline, more whitespace!
	const Nl = tt(Start, LF, NL, {
		[whitespace]: true,
	});
	const Cr = tt(Start, CR, WS, {
		[whitespace]: true,
	});
	const Ws = tr(Start, SPACE, WS, {
		[whitespace]: true,
	});
	tt(Start, OBJECT_REPLACEMENT, Ws);
	tt(Cr, LF, Nl); // \r\n
	tt(Cr, OBJECT_REPLACEMENT, Ws);
	tr(Cr, SPACE, Ws);
	tt(Ws, CR); // non-accepting state to avoid mixing whitespaces
	tt(Ws, LF); // non-accepting state to avoid mixing whitespaces
	tr(Ws, SPACE, Ws);
	tt(Ws, OBJECT_REPLACEMENT, Ws);

	// Emoji tokens. They are not grouped by the scanner except in cases where a
	// zero-width joiner is present
	const Emoji = tr(Start, EMOJI, EMOJI$1, {
		[emoji]: true,
	});
	tt(Emoji, "#"); // no transition, emoji regex seems to match #
	tr(Emoji, EMOJI, Emoji);
	tt(Emoji, EMOJI_VARIATION, Emoji);
	// tt(Start, EMOJI_VARIATION, Emoji); // This one is sketchy

	const EmojiJoiner = tt(Emoji, EMOJI_JOINER);
	tt(EmojiJoiner, "#");
	tr(EmojiJoiner, EMOJI, Emoji);
	// tt(EmojiJoiner, EMOJI_VARIATION, Emoji); // also sketchy

	// Generates states for top-level domains
	// Note that this is most accurate when tlds are in alphabetical order
	const wordjr = [
		[ASCII_LETTER, Word],
		[DIGIT, Asciinumeric],
	];
	const uwordjr = [
		[ASCII_LETTER, null],
		[LETTER, UWord],
		[DIGIT, Alphanumeric],
	];
	for (let i = 0; i < tlds.length; i++) {
		fastts(Start, tlds[i], TLD, WORD, wordjr);
	}
	for (let i = 0; i < utlds.length; i++) {
		fastts(Start, utlds[i], UTLD, UWORD, uwordjr);
	}
	addToGroups(
		TLD,
		{
			tld: true,
			ascii: true,
		},
		groups,
	);
	addToGroups(
		UTLD,
		{
			utld: true,
			alpha: true,
		},
		groups,
	);

	// Collect the states generated by different protocols. NOTE: If any new TLDs
	// get added that are also protocols, set the token to be the same as the
	// protocol to ensure parsing works as expected.
	fastts(Start, "file", SCHEME, WORD, wordjr);
	fastts(Start, "mailto", SCHEME, WORD, wordjr);
	fastts(Start, "http", SLASH_SCHEME, WORD, wordjr);
	fastts(Start, "https", SLASH_SCHEME, WORD, wordjr);
	fastts(Start, "ftp", SLASH_SCHEME, WORD, wordjr);
	fastts(Start, "ftps", SLASH_SCHEME, WORD, wordjr);
	addToGroups(
		SCHEME,
		{
			scheme: true,
			ascii: true,
		},
		groups,
	);
	addToGroups(
		SLASH_SCHEME,
		{
			slashscheme: true,
			ascii: true,
		},
		groups,
	);

	// Register custom schemes. Assumes each scheme is asciinumeric with hyphens
	customSchemes = customSchemes.sort((a, b) => (a[0] > b[0] ? 1 : -1));
	for (let i = 0; i < customSchemes.length; i++) {
		const sch = customSchemes[i][0];
		const optionalSlashSlash = customSchemes[i][1];
		const flags =
			optionalSlashSlash ?
				{
					[scheme]: true,
				}
			:	{
					[slashscheme]: true,
				};
		if (sch.indexOf("-") >= 0) {
			flags[domain] = true;
		} else if (!ASCII_LETTER.test(sch)) {
			flags[numeric] = true; // numbers only
		} else if (DIGIT.test(sch)) {
			flags[asciinumeric] = true;
		} else {
			flags[ascii] = true;
		}
		ts(Start, sch, sch, flags);
	}

	// Localhost token
	ts(Start, "localhost", LOCALHOST, {
		ascii: true,
	});

	// Set default transition for start state (some symbol)
	Start.jd = new State(SYM);
	return {
		start: Start,
		tokens: Object.assign(
			{
				groups,
			},
			tk,
		),
	};
}

/**
	Given a string, returns an array of TOKEN instances representing the
	composition of that string.

	@method run
	@param {State<string>} start scanner starting state
	@param {string} str input string to scan
	@return {Token[]} list of tokens, each with a type and value
*/
function run$1(start, str) {
	// State machine is not case sensitive, so input is tokenized in lowercased
	// form (still returns regular case). Uses selective `toLowerCase` because
	// lowercasing the entire string causes the length and character position to
	// vary in some non-English strings with V8-based runtimes.
	const iterable = stringToArray(str.replace(/[A-Z]/g, (c) => c.toLowerCase()));
	const charCount = iterable.length; // <= len if there are emojis, etc
	const tokens = []; // return value

	// cursor through the string itself, accounting for characters that have
	// width with length 2 such as emojis
	let cursor = 0;

	// Cursor through the array-representation of the string
	let charCursor = 0;

	// Tokenize the string
	while (charCursor < charCount) {
		let state = start;
		let nextState = null;
		let tokenLength = 0;
		let latestAccepting = null;
		let sinceAccepts = -1;
		let charsSinceAccepts = -1;
		while (charCursor < charCount && (nextState = state.go(iterable[charCursor]))) {
			state = nextState;

			// Keep track of the latest accepting state
			if (state.accepts()) {
				sinceAccepts = 0;
				charsSinceAccepts = 0;
				latestAccepting = state;
			} else if (sinceAccepts >= 0) {
				sinceAccepts += iterable[charCursor].length;
				charsSinceAccepts++;
			}
			tokenLength += iterable[charCursor].length;
			cursor += iterable[charCursor].length;
			charCursor++;
		}

		// Roll back to the latest accepting state
		cursor -= sinceAccepts;
		charCursor -= charsSinceAccepts;
		tokenLength -= sinceAccepts;

		// No more jumps, just make a new token from the last accepting one
		tokens.push({
			t: latestAccepting.t,
			// token type/name
			v: str.slice(cursor - tokenLength, cursor),
			// string value
			s: cursor - tokenLength,
			// start index
			e: cursor, // end index (excluding)
		});
	}
	return tokens;
}

/**
 * Convert a String to an Array of characters, taking into account that some
 * characters like emojis take up two string indexes.
 *
 * Adapted from core-js (MIT license)
 * https://github.com/zloirock/core-js/blob/2d69cf5f99ab3ea3463c395df81e5a15b68f49d9/packages/core-js/internals/string-multibyte.js
 *
 * @function stringToArray
 * @param {string} str
 * @returns {string[]}
 */
function stringToArray(str) {
	const result = [];
	const len = str.length;
	let index = 0;
	while (index < len) {
		let first = str.charCodeAt(index);
		let second;
		let char =
			first < 0xd800 || first > 0xdbff || index + 1 === len || (second = str.charCodeAt(index + 1)) < 0xdc00 || second > 0xdfff ?
				str[index] // single character
			:	str.slice(index, index + 2); // two-index characters
		result.push(char);
		index += char.length;
	}
	return result;
}

/**
 * Fast version of ts function for when transition defaults are well known
 * @param {State<string>} state
 * @param {string} input
 * @param {string} t
 * @param {string} defaultt
 * @param {[RegExp, State<string>][]} jr
 * @returns {State<string>}
 */
function fastts(state, input, t, defaultt, jr) {
	let next;
	const len = input.length;
	for (let i = 0; i < len - 1; i++) {
		const char = input[i];
		if (state.j[char]) {
			next = state.j[char];
		} else {
			next = new State(defaultt);
			next.jr = jr.slice();
			state.j[char] = next;
		}
		state = next;
	}
	next = new State(t);
	next.jr = jr.slice();
	state.j[input[len - 1]] = next;
	return next;
}

/**
 * Converts a string of Top-Level Domain names encoded in update-tlds.js back
 * into a list of strings.
 * @param {str} encoded encoded TLDs string
 * @returns {str[]} original TLDs list
 */
function decodeTlds(encoded) {
	const words = [];
	const stack = [];
	let i = 0;
	let digits = "0123456789";
	while (i < encoded.length) {
		let popDigitCount = 0;
		while (digits.indexOf(encoded[i + popDigitCount]) >= 0) {
			popDigitCount++; // encountered some digits, have to pop to go one level up trie
		}
		if (popDigitCount > 0) {
			words.push(stack.join("")); // whatever preceded the pop digits must be a word
			for (let popCount = parseInt(encoded.substring(i, i + popDigitCount), 10); popCount > 0; popCount--) {
				stack.pop();
			}
			i += popDigitCount;
		} else {
			stack.push(encoded[i]); // drop down a level into the trie
			i++;
		}
	}
	return words;
}

/**
 * An object where each key is a valid DOM Event Name such as `click` or `focus`
 * and each value is an event handler function.
 *
 * https://developer.mozilla.org/en-US/docs/Web/API/Element#events
 * @typedef {?{ [event: string]: Function }} EventListeners
 */

/**
 * All formatted properties required to render a link, including `tagName`,
 * `attributes`, `content` and `eventListeners`.
 * @typedef {{ tagName: any, attributes: {[attr: string]: any}, content: string,
 * eventListeners: EventListeners }} IntermediateRepresentation
 */

/**
 * Specify either an object described by the template type `O` or a function.
 *
 * The function takes a string value (usually the link's href attribute), the
 * link type (`'url'`, `'hashtag`', etc.) and an internal token representation
 * of the link. It should return an object of the template type `O`
 * @template O
 * @typedef {O | ((value: string, type: string, token: MultiToken) => O)} OptObj
 */

/**
 * Specify either a function described by template type `F` or an object.
 *
 * Each key in the object should be a link type (`'url'`, `'hashtag`', etc.). Each
 * value should be a function with template type `F` that is called when the
 * corresponding link type is encountered.
 * @template F
 * @typedef {F | { [type: string]: F}} OptFn
 */

/**
 * Specify either a value with template type `V`, a function that returns `V` or
 * an object where each value resolves to `V`.
 *
 * The function takes a string value (usually the link's href attribute), the
 * link type (`'url'`, `'hashtag`', etc.) and an internal token representation
 * of the link. It should return an object of the template type `V`
 *
 * For the object, each key should be a link type (`'url'`, `'hashtag`', etc.).
 * Each value should either have type `V` or a function that returns V. This
 * function similarly takes a string value and a token.
 *
 * Example valid types for `Opt<string>`:
 *
 * ```js
 * 'hello'
 * (value, type, token) => 'world'
 * { url: 'hello', email: (value, token) => 'world'}
 * ```
 * @template V
 * @typedef {V | ((value: string, type: string, token: MultiToken) => V) | { [type: string]: V | ((value: string, token: MultiToken) => V) }} Opt
 */

/**
 * See available options: https://linkify.js.org/docs/options.html
 * @typedef {{
 * 	defaultProtocol?: string,
 *  events?: OptObj<EventListeners>,
 * 	format?: Opt<string>,
 * 	formatHref?: Opt<string>,
 * 	nl2br?: boolean,
 * 	tagName?: Opt<any>,
 * 	target?: Opt<string>,
 * 	rel?: Opt<string>,
 * 	validate?: Opt<boolean>,
 * 	truncate?: Opt<number>,
 * 	className?: Opt<string>,
 * 	attributes?: OptObj<({ [attr: string]: any })>,
 *  ignoreTags?: string[],
 * 	render?: OptFn<((ir: IntermediateRepresentation) => any)>
 * }} Opts
 */

/**
 * @type Required<Opts>
 */
const defaults = {
	defaultProtocol: "http",
	events: null,
	format: noop,
	formatHref: noop,
	nl2br: false,
	tagName: "a",
	target: null,
	rel: null,
	validate: true,
	truncate: Infinity,
	className: null,
	attributes: null,
	ignoreTags: [],
	render: null,
};

/**
 * Utility class for linkify interfaces to apply specified
 * {@link Opts formatting and rendering options}.
 *
 * @param {Opts | Options} [opts] Option value overrides.
 * @param {(ir: IntermediateRepresentation) => any} [defaultRender] (For
 *   internal use) default render function that determines how to generate an
 *   HTML element based on a link token's derived tagName, attributes and HTML.
 *   Similar to render option
 */
function Options(opts, defaultRender = null) {
	let o = Object.assign({}, defaults);
	if (opts) {
		o = Object.assign(o, opts instanceof Options ? opts.o : opts);
	}

	// Ensure all ignored tags are uppercase
	const ignoredTags = o.ignoreTags;
	const uppercaseIgnoredTags = [];
	for (let i = 0; i < ignoredTags.length; i++) {
		uppercaseIgnoredTags.push(ignoredTags[i].toUpperCase());
	}
	/** @protected */
	this.o = o;
	if (defaultRender) {
		this.defaultRender = defaultRender;
	}
	this.ignoreTags = uppercaseIgnoredTags;
}
Options.prototype = {
	o: defaults,
	/**
	 * @type string[]
	 */
	ignoreTags: [],
	/**
	 * @param {IntermediateRepresentation} ir
	 * @returns {any}
	 */
	defaultRender(ir) {
		return ir;
	},
	/**
	 * Returns true or false based on whether a token should be displayed as a
	 * link based on the user options.
	 * @param {MultiToken} token
	 * @returns {boolean}
	 */
	check(token) {
		return this.get("validate", token.toString(), token);
	},
	// Private methods

	/**
	 * Resolve an option's value based on the value of the option and the given
	 * params. If operator and token are specified and the target option is
	 * callable, automatically calls the function with the given argument.
	 * @template {keyof Opts} K
	 * @param {K} key Name of option to use
	 * @param {string} [operator] will be passed to the target option if it's a
	 * function. If not specified, RAW function value gets returned
	 * @param {MultiToken} [token] The token from linkify.tokenize
	 * @returns {Opts[K] | any}
	 */
	get(key, operator, token) {
		const isCallable = operator != null;
		let option = this.o[key];
		if (!option) {
			return option;
		}
		if (typeof option === "object") {
			option = token.t in option ? option[token.t] : defaults[key];
			if (typeof option === "function" && isCallable) {
				option = option(operator, token);
			}
		} else if (typeof option === "function" && isCallable) {
			option = option(operator, token.t, token);
		}
		return option;
	},
	/**
	 * @template {keyof Opts} L
	 * @param {L} key Name of options object to use
	 * @param {string} [operator]
	 * @param {MultiToken} [token]
	 * @returns {Opts[L] | any}
	 */
	getObj(key, operator, token) {
		let obj = this.o[key];
		if (typeof obj === "function" && operator != null) {
			obj = obj(operator, token.t, token);
		}
		return obj;
	},
	/**
	 * Convert the given token to a rendered element that may be added to the
	 * calling-interface's DOM
	 * @param {MultiToken} token Token to render to an HTML element
	 * @returns {any} Render result; e.g., HTML string, DOM element, React
	 *   Component, etc.
	 */
	render(token) {
		const ir = token.render(this); // intermediate representation
		const renderFn = this.get("render", null, token) || this.defaultRender;
		return renderFn(ir, token.t, token);
	},
};
function noop(val) {
	return val;
}

/******************************************************************************
	Multi-Tokens
	Tokens composed of arrays of TextTokens
******************************************************************************/

/**
 * @param {string} value
 * @param {Token[]} tokens
 */
function MultiToken(value, tokens) {
	this.t = "token";
	this.v = value;
	this.tk = tokens;
}

/**
 * Abstract class used for manufacturing tokens of text tokens. That is rather
 * than the value for a token being a small string of text, it's value an array
 * of text tokens.
 *
 * Used for grouping together URLs, emails, hashtags, and other potential
 * creations.
 * @class MultiToken
 * @property {string} t
 * @property {string} v
 * @property {Token[]} tk
 * @abstract
 */
MultiToken.prototype = {
	isLink: false,
	/**
	 * Return the string this token represents.
	 * @return {string}
	 */
	toString() {
		return this.v;
	},
	/**
	 * What should the value for this token be in the `href` HTML attribute?
	 * Returns the `.toString` value by default.
	 * @param {string} [scheme]
	 * @return {string}
	 */
	toHref(scheme) {
		return this.toString();
	},
	/**
	 * @param {Options} options Formatting options
	 * @returns {string}
	 */
	toFormattedString(options) {
		const val = this.toString();
		const truncate = options.get("truncate", val, this);
		const formatted = options.get("format", val, this);
		return truncate && formatted.length > truncate ? formatted.substring(0, truncate) + "…" : formatted;
	},
	/**
	 *
	 * @param {Options} options
	 * @returns {string}
	 */
	toFormattedHref(options) {
		return options.get("formatHref", this.toHref(options.get("defaultProtocol")), this);
	},
	/**
	 * The start index of this token in the original input string
	 * @returns {number}
	 */
	startIndex() {
		return this.tk[0].s;
	},
	/**
	 * The end index of this token in the original input string (up to this
	 * index but not including it)
	 * @returns {number}
	 */
	endIndex() {
		return this.tk[this.tk.length - 1].e;
	},
	/**
  	Returns an object  of relevant values for this token, which includes keys
  	* type - Kind of token ('url', 'email', etc.)
  	* value - Original text
  	* href - The value that should be added to the anchor tag's href
  		attribute
  		@method toObject
  	@param {string} [protocol] `'http'` by default
  */
	toObject(protocol = defaults.defaultProtocol) {
		return {
			type: this.t,
			value: this.toString(),
			isLink: this.isLink,
			href: this.toHref(protocol),
			start: this.startIndex(),
			end: this.endIndex(),
		};
	},
	/**
	 *
	 * @param {Options} options Formatting option
	 */
	toFormattedObject(options) {
		return {
			type: this.t,
			value: this.toFormattedString(options),
			isLink: this.isLink,
			href: this.toFormattedHref(options),
			start: this.startIndex(),
			end: this.endIndex(),
		};
	},
	/**
	 * Whether this token should be rendered as a link according to the given options
	 * @param {Options} options
	 * @returns {boolean}
	 */
	validate(options) {
		return options.get("validate", this.toString(), this);
	},
	/**
	 * Return an object that represents how this link should be rendered.
	 * @param {Options} options Formattinng options
	 */
	render(options) {
		const token = this;
		const href = this.toHref(options.get("defaultProtocol"));
		const formattedHref = options.get("formatHref", href, this);
		const tagName = options.get("tagName", href, token);
		const content = this.toFormattedString(options);
		const attributes = {};
		const className = options.get("className", href, token);
		const target = options.get("target", href, token);
		const rel = options.get("rel", href, token);
		const attrs = options.getObj("attributes", href, token);
		const eventListeners = options.getObj("events", href, token);
		attributes.href = formattedHref;
		if (className) {
			attributes.class = className;
		}
		if (target) {
			attributes.target = target;
		}
		if (rel) {
			attributes.rel = rel;
		}
		if (attrs) {
			Object.assign(attributes, attrs);
		}
		return {
			tagName,
			attributes,
			content,
			eventListeners,
		};
	},
};

/**
 * Create a new token that can be emitted by the parser state machine
 * @param {string} type readable type of the token
 * @param {object} props properties to assign or override, including isLink = true or false
 * @returns {new (value: string, tokens: Token[]) => MultiToken} new token class
 */
function createTokenClass(type, props) {
	class Token extends MultiToken {
		constructor(value, tokens) {
			super(value, tokens);
			this.t = type;
		}
	}
	for (const p in props) {
		Token.prototype[p] = props[p];
	}
	Token.t = type;
	return Token;
}

/**
	Represents a list of tokens making up a valid email address
*/
const Email = createTokenClass("email", {
	isLink: true,
	toHref() {
		return "mailto:" + this.toString();
	},
});

/**
	Represents some plain text
*/
const Text$1 = createTokenClass("text");

/**
	Multi-linebreak token - represents a line break
	@class Nl
*/
const Nl = createTokenClass("nl");

/**
	Represents a list of text tokens making up a valid URL
	@class Url
*/
const Url = createTokenClass("url", {
	isLink: true,
	/**
  	Lowercases relevant parts of the domain and adds the protocol if
  	required. Note that this will not escape unsafe HTML characters in the
  	URL.
  		@param {string} [scheme] default scheme (e.g., 'https')
  	@return {string} the full href
  */
	toHref(scheme = defaults.defaultProtocol) {
		// Check if already has a prefix scheme
		return this.hasProtocol() ? this.v : `${scheme}://${this.v}`;
	},
	/**
	 * Check whether this URL token has a protocol
	 * @return {boolean}
	 */
	hasProtocol() {
		const tokens = this.tk;
		return tokens.length >= 2 && tokens[0].t !== LOCALHOST && tokens[1].t === COLON;
	},
});

/**
	Not exactly parser, more like the second-stage scanner (although we can
	theoretically hotswap the code here with a real parser in the future... but
	for a little URL-finding utility abstract syntax trees may be a little
	overkill).

	URL format: http://en.wikipedia.org/wiki/URI_scheme
	Email format: http://en.wikipedia.org/wiki/EmailAddress (links to RFC in
	reference)

	@module linkify
	@submodule parser
	@main run
*/

const makeState = (arg) => new State(arg);

/**
 * Generate the parser multi token-based state machine
 * @param {{ groups: Collections<string> }} tokens
 */
function init$1({ groups }) {
	// Types of characters the URL can definitely end in
	const qsAccepting = groups.domain.concat([AMPERSAND, ASTERISK, AT, BACKSLASH, BACKTICK, CARET, DOLLAR, EQUALS, HYPHEN, NUM, PERCENT, PIPE, PLUS, POUND, SLASH, SYM, TILDE, UNDERSCORE]);

	// Types of tokens that can follow a URL and be part of the query string
	// but cannot be the very last characters
	// Characters that cannot appear in the URL at all should be excluded
	const qsNonAccepting = [
		APOSTROPHE,
		COLON,
		COMMA,
		DOT,
		EXCLAMATION,
		PERCENT,
		QUERY,
		QUOTE,
		SEMI,
		OPENANGLEBRACKET,
		CLOSEANGLEBRACKET,
		OPENBRACE,
		CLOSEBRACE,
		CLOSEBRACKET,
		OPENBRACKET,
		OPENPAREN,
		CLOSEPAREN,
		FULLWIDTHLEFTPAREN,
		FULLWIDTHRIGHTPAREN,
		LEFTCORNERBRACKET,
		RIGHTCORNERBRACKET,
		LEFTWHITECORNERBRACKET,
		RIGHTWHITECORNERBRACKET,
		FULLWIDTHLESSTHAN,
		FULLWIDTHGREATERTHAN,
	];

	// For addresses without the mailto prefix
	// Tokens allowed in the localpart of the email
	const localpartAccepting = [
		AMPERSAND,
		APOSTROPHE,
		ASTERISK,
		BACKSLASH,
		BACKTICK,
		CARET,
		DOLLAR,
		EQUALS,
		HYPHEN,
		OPENBRACE,
		CLOSEBRACE,
		PERCENT,
		PIPE,
		PLUS,
		POUND,
		QUERY,
		SLASH,
		SYM,
		TILDE,
		UNDERSCORE,
	];

	// The universal starting state.
	/**
	 * @type State<Token>
	 */
	const Start = makeState();
	const Localpart = tt(Start, TILDE); // Local part of the email address
	ta(Localpart, localpartAccepting, Localpart);
	ta(Localpart, groups.domain, Localpart);
	const Domain = makeState(),
		Scheme = makeState(),
		SlashScheme = makeState();
	ta(Start, groups.domain, Domain); // parsed string ends with a potential domain name (A)
	ta(Start, groups.scheme, Scheme); // e.g., 'mailto'
	ta(Start, groups.slashscheme, SlashScheme); // e.g., 'http'

	ta(Domain, localpartAccepting, Localpart);
	ta(Domain, groups.domain, Domain);
	const LocalpartAt = tt(Domain, AT); // Local part of the email address plus @

	tt(Localpart, AT, LocalpartAt); // close to an email address now

	// Local part of an email address can be e.g. 'http' or 'mailto'
	tt(Scheme, AT, LocalpartAt);
	tt(SlashScheme, AT, LocalpartAt);
	const LocalpartDot = tt(Localpart, DOT); // Local part of the email address plus '.' (localpart cannot end in .)
	ta(LocalpartDot, localpartAccepting, Localpart);
	ta(LocalpartDot, groups.domain, Localpart);
	const EmailDomain = makeState();
	ta(LocalpartAt, groups.domain, EmailDomain); // parsed string starts with local email info + @ with a potential domain name
	ta(EmailDomain, groups.domain, EmailDomain);
	const EmailDomainDot = tt(EmailDomain, DOT); // domain followed by DOT
	ta(EmailDomainDot, groups.domain, EmailDomain);
	const Email$1 = makeState(Email); // Possible email address (could have more tlds)
	ta(EmailDomainDot, groups.tld, Email$1);
	ta(EmailDomainDot, groups.utld, Email$1);
	tt(LocalpartAt, LOCALHOST, Email$1);

	// Hyphen can jump back to a domain name
	const EmailDomainHyphen = tt(EmailDomain, HYPHEN); // parsed string starts with local email info + @ with a potential domain name
	tt(EmailDomainHyphen, HYPHEN, EmailDomainHyphen);
	ta(EmailDomainHyphen, groups.domain, EmailDomain);
	ta(Email$1, groups.domain, EmailDomain);
	tt(Email$1, DOT, EmailDomainDot);
	tt(Email$1, HYPHEN, EmailDomainHyphen);

	// Account for dots and hyphens. Hyphens are usually parts of domain names
	// (but not TLDs)
	const DomainHyphen = tt(Domain, HYPHEN); // domain followed by hyphen
	const DomainDot = tt(Domain, DOT); // domain followed by DOT
	tt(DomainHyphen, HYPHEN, DomainHyphen);
	ta(DomainHyphen, groups.domain, Domain);
	ta(DomainDot, localpartAccepting, Localpart);
	ta(DomainDot, groups.domain, Domain);
	const DomainDotTld = makeState(Url); // Simplest possible URL with no query string
	ta(DomainDot, groups.tld, DomainDotTld);
	ta(DomainDot, groups.utld, DomainDotTld);
	ta(DomainDotTld, groups.domain, Domain);
	ta(DomainDotTld, localpartAccepting, Localpart);
	tt(DomainDotTld, DOT, DomainDot);
	tt(DomainDotTld, HYPHEN, DomainHyphen);
	tt(DomainDotTld, AT, LocalpartAt);
	const DomainDotTldColon = tt(DomainDotTld, COLON); // URL followed by colon (potential port number here)
	const DomainDotTldColonPort = makeState(Url); // TLD followed by a port number
	ta(DomainDotTldColon, groups.numeric, DomainDotTldColonPort);

	// Long URL with optional port and maybe query string
	const Url$1 = makeState(Url);

	// URL with extra symbols at the end, followed by an opening bracket
	const UrlNonaccept = makeState(); // URL followed by some symbols (will not be part of the final URL)

	// Query strings
	ta(Url$1, qsAccepting, Url$1);
	ta(Url$1, qsNonAccepting, UrlNonaccept);
	ta(UrlNonaccept, qsAccepting, Url$1);
	ta(UrlNonaccept, qsNonAccepting, UrlNonaccept);

	// Become real URLs after `SLASH` or `COLON NUM SLASH`
	// Here works with or without scheme:// prefix
	tt(DomainDotTld, SLASH, Url$1);
	tt(DomainDotTldColonPort, SLASH, Url$1);

	// Note that domains that begin with schemes are treated slighly differently
	const SchemeColon = tt(Scheme, COLON); // e.g., 'mailto:'
	const SlashSchemeColon = tt(SlashScheme, COLON); // e.g., 'http:'
	const SlashSchemeColonSlash = tt(SlashSchemeColon, SLASH); // e.g., 'http:/'

	const UriPrefix = tt(SlashSchemeColonSlash, SLASH); // e.g., 'http://'

	// Scheme states can transition to domain states
	ta(Scheme, groups.domain, Domain);
	tt(Scheme, DOT, DomainDot);
	tt(Scheme, HYPHEN, DomainHyphen);
	ta(SlashScheme, groups.domain, Domain);
	tt(SlashScheme, DOT, DomainDot);
	tt(SlashScheme, HYPHEN, DomainHyphen);

	// Force URL with scheme prefix followed by anything sane
	ta(SchemeColon, groups.domain, Url$1);
	tt(SchemeColon, SLASH, Url$1);
	tt(SchemeColon, QUERY, Url$1);
	ta(UriPrefix, groups.domain, Url$1);
	ta(UriPrefix, qsAccepting, Url$1);
	tt(UriPrefix, SLASH, Url$1);
	const bracketPairs = [
		[OPENBRACE, CLOSEBRACE],
		// {}
		[OPENBRACKET, CLOSEBRACKET],
		// []
		[OPENPAREN, CLOSEPAREN],
		// ()
		[OPENANGLEBRACKET, CLOSEANGLEBRACKET],
		// <>
		[FULLWIDTHLEFTPAREN, FULLWIDTHRIGHTPAREN],
		// （）
		[LEFTCORNERBRACKET, RIGHTCORNERBRACKET],
		// 「」
		[LEFTWHITECORNERBRACKET, RIGHTWHITECORNERBRACKET],
		// 『』
		[FULLWIDTHLESSTHAN, FULLWIDTHGREATERTHAN], // ＜＞
	];
	for (let i = 0; i < bracketPairs.length; i++) {
		const [OPEN, CLOSE] = bracketPairs[i];
		const UrlOpen = tt(Url$1, OPEN); // URL followed by open bracket

		// Continue not accepting for open brackets
		tt(UrlNonaccept, OPEN, UrlOpen);

		// URL that begins with an opening bracket, followed by a symbols.
		// Note that the final state can still be `UrlOpen` (if the URL has a
		// single opening bracket for some reason).
		const UrlOpenQ = makeState(Url);
		ta(UrlOpen, qsAccepting, UrlOpenQ);
		const UrlOpenSyms = makeState(); // UrlOpen followed by some symbols it cannot end it
		ta(UrlOpen, qsNonAccepting, UrlOpenSyms);

		// Closing bracket component. This character WILL be included in the URL.
		// Must come after qsNonAccepting (which includes all close-bracket tokens)
		// so that CLOSE -> Url wins over CLOSE -> UrlOpenSyms.
		tt(UrlOpen, CLOSE, Url$1);

		// URL that begins with an opening bracket, followed by some symbols
		ta(UrlOpenQ, qsAccepting, UrlOpenQ);
		ta(UrlOpenQ, qsNonAccepting, UrlOpenSyms);
		ta(UrlOpenSyms, qsAccepting, UrlOpenQ);
		ta(UrlOpenSyms, qsNonAccepting, UrlOpenSyms);

		// Close brace/bracket to become regular URL
		tt(UrlOpenQ, CLOSE, Url$1);
		tt(UrlOpenSyms, CLOSE, Url$1);
	}
	tt(Start, LOCALHOST, DomainDotTld); // localhost is a valid URL state
	tt(Start, NL, Nl); // single new line

	return {
		start: Start,
		tokens: tk,
	};
}

/**
 * Run the parser state machine on a list of scanned string-based tokens to
 * create a list of multi tokens, each of which represents a URL, email address,
 * plain text, etc.
 *
 * @param {State<MultiToken>} start parser start state
 * @param {string} input the original input used to generate the given tokens
 * @param {Token[]} tokens list of scanned tokens
 * @returns {MultiToken[]}
 */
function run(start, input, tokens) {
	let len = tokens.length;
	let cursor = 0;
	let multis = [];
	let textTokens = [];
	while (cursor < len) {
		let state = start;
		let secondState = null;
		let nextState = null;
		let multiLength = 0;
		let latestAccepting = null;
		let sinceAccepts = -1;
		while (cursor < len && !(secondState = state.go(tokens[cursor].t))) {
			// Starting tokens with nowhere to jump to.
			// Consider these to be just plain text
			textTokens.push(tokens[cursor++]);
		}
		while (cursor < len && (nextState = secondState || state.go(tokens[cursor].t))) {
			// Get the next state
			secondState = null;
			state = nextState;

			// Keep track of the latest accepting state
			if (state.accepts()) {
				sinceAccepts = 0;
				latestAccepting = state;
			} else if (sinceAccepts >= 0) {
				sinceAccepts++;
			}
			cursor++;
			multiLength++;
		}
		if (sinceAccepts < 0) {
			// No accepting state was found, part of a regular text token add
			// the first text token to the text tokens array and try again from
			// the next
			cursor -= multiLength;
			if (cursor < len) {
				textTokens.push(tokens[cursor]);
				cursor++;
			}
		} else {
			// Accepting state!
			// First close off the textTokens (if available)
			if (textTokens.length > 0) {
				multis.push(initMultiToken(Text$1, input, textTokens));
				textTokens = [];
			}

			// Roll back to the latest accepting state
			cursor -= sinceAccepts;
			multiLength -= sinceAccepts;

			// Create a new multitoken
			const Multi = latestAccepting.t;
			const subtokens = tokens.slice(cursor - multiLength, cursor);
			multis.push(initMultiToken(Multi, input, subtokens));
		}
	}

	// Finally close off the textTokens (if available)
	if (textTokens.length > 0) {
		multis.push(initMultiToken(Text$1, input, textTokens));
	}
	return multis;
}

/**
 * Utility function for instantiating a new multitoken with all the relevant
 * fields during parsing.
 * @param {new (value: string, tokens: Token[]) => MultiToken} Multi class to instantiate
 * @param {string} input original input string
 * @param {Token[]} tokens consecutive tokens scanned from input string
 * @returns {MultiToken}
 */
function initMultiToken(Multi, input, tokens) {
	const startIdx = tokens[0].s;
	const endIdx = tokens[tokens.length - 1].e;
	const value = input.slice(startIdx, endIdx);
	return new Multi(value, tokens);
}

const warn = (typeof console !== "undefined" && console && console.warn) || (() => {});
const warnAdvice = "until manual call of linkify.init(). Register all schemes and plugins before invoking linkify the first time.";

// Side-effect initialization state
const INIT = {
	scanner: null,
	parser: null,
	tokenQueue: [],
	pluginQueue: [],
	customSchemes: [],
	initialized: false,
};

/**
 * @typedef {{
 * 	start: State<string>,
 * 	tokens: { groups: Collections<string> } & typeof tk
 * }} ScannerInit
 */

/**
 * @typedef {{
 * 	start: State<MultiToken>,
 * 	tokens: typeof multi
 * }} ParserInit
 */

/**
 * @typedef {(arg: { scanner: ScannerInit }) => void} TokenPlugin
 */

/**
 * @typedef {(arg: { scanner: ScannerInit, parser: ParserInit }) => void} Plugin
 */

/**
 * De-register all plugins and reset the internal state-machine. Used for
 * testing; not required in practice.
 * @private
 */
function reset() {
	State.groups = {};
	INIT.scanner = null;
	INIT.parser = null;
	INIT.tokenQueue = [];
	INIT.pluginQueue = [];
	INIT.customSchemes = [];
	INIT.initialized = false;
	return INIT;
}

/**
 * Detect URLs with the following additional protocol. Anything with format
 * "protocol://..." will be considered a link. If `optionalSlashSlash` is set to
 * `true`, anything with format "protocol:..." will be considered a link.
 * @param {string} scheme
 * @param {boolean} [optionalSlashSlash]
 */
function registerCustomProtocol(scheme, optionalSlashSlash = false) {
	if (INIT.initialized) {
		warn(`linkifyjs: already initialized - will not register custom scheme "${scheme}" ${warnAdvice}`);
	}
	if (!/^[0-9a-z]+(-[0-9a-z]+)*$/.test(scheme)) {
		throw new Error(`linkifyjs: incorrect scheme format.
1. Must only contain digits, lowercase ASCII letters or "-"
2. Cannot start or end with "-"
3. "-" cannot repeat`);
	}
	INIT.customSchemes.push([scheme, optionalSlashSlash]);
}

/**
 * Initialize the linkify state machine. Called automatically the first time
 * linkify is called on a string, but may be called manually as well.
 */
function init() {
	// Initialize scanner state machine and plugins
	INIT.scanner = init$2(INIT.customSchemes);
	for (let i = 0; i < INIT.tokenQueue.length; i++) {
		INIT.tokenQueue[i][1]({
			scanner: INIT.scanner,
		});
	}

	// Initialize parser state machine and plugins
	INIT.parser = init$1(INIT.scanner.tokens);
	for (let i = 0; i < INIT.pluginQueue.length; i++) {
		INIT.pluginQueue[i][1]({
			scanner: INIT.scanner,
			parser: INIT.parser,
		});
	}
	INIT.initialized = true;
	return INIT;
}

/**
 * Parse a string into tokens that represent linkable and non-linkable sub-components
 * @param {string} str
 * @return {MultiToken[]} tokens
 */
function tokenize(str) {
	if (!INIT.initialized) {
		init();
	}
	return run(INIT.parser.start, str, run$1(INIT.scanner.start, str));
}
tokenize.scan = run$1; // for testing

/**
 * Find a list of linkable items in the given string.
 * @param {string} str string to find links in
 * @param {string | Opts} [type] either formatting options or specific type of
 * links to find, e.g., 'url' or 'email'
 * @param {Opts} [opts] formatting options for final output. Cannot be specified
 * if opts already provided in `type` argument
 */
function find(str, type = null, opts = null) {
	if (type && typeof type === "object") {
		if (opts) {
			throw Error(`linkifyjs: Invalid link type ${type}; must be a string`);
		}
		opts = type;
		type = null;
	}
	const options = new Options(opts);
	const tokens = tokenize(str);
	const filtered = [];
	for (let i = 0; i < tokens.length; i++) {
		const token = tokens[i];
		if (token.isLink && (!type || token.t === type) && options.check(token)) {
			filtered.push(token.toFormattedObject(options));
		}
	}
	return filtered;
}

// src/link.ts

// src/helpers/whitespace.ts
var UNICODE_WHITESPACE_PATTERN = "[\0- \xA0\u1680\u180E\u2000-\u2029\u205F\u3000]";
var UNICODE_WHITESPACE_REGEX = new RegExp(UNICODE_WHITESPACE_PATTERN);
var UNICODE_WHITESPACE_REGEX_END = new RegExp(`${UNICODE_WHITESPACE_PATTERN}$`);
var UNICODE_WHITESPACE_REGEX_GLOBAL = new RegExp(UNICODE_WHITESPACE_PATTERN, "g");

// src/helpers/autolink.ts
function isValidLinkStructure(tokens) {
	if (tokens.length === 1) {
		return tokens[0].isLink;
	}
	if (tokens.length === 3 && tokens[1].isLink) {
		return ["()", "[]"].includes(tokens[0].value + tokens[2].value);
	}
	return false;
}
function autolink(options) {
	return new Plugin({
		key: new PluginKey("autolink"),
		appendTransaction: (transactions, oldState, newState) => {
			const docChanges = transactions.some((transaction) => transaction.docChanged) && !oldState.doc.eq(newState.doc);
			const preventAutolink = transactions.some((transaction) => transaction.getMeta("preventAutolink"));
			if (!docChanges || preventAutolink) {
				return;
			}
			const { tr } = newState;
			const transform = combineTransactionSteps(oldState.doc, [...transactions]);
			const changes = getChangedRanges(transform);
			changes.forEach(({ newRange }) => {
				const nodesInChangedRanges = findChildrenInRange(newState.doc, newRange, (node) => node.isTextblock);
				let textBlock;
				let textBeforeWhitespace;
				if (nodesInChangedRanges.length > 1) {
					textBlock = nodesInChangedRanges[0];
					textBeforeWhitespace = newState.doc.textBetween(textBlock.pos, textBlock.pos + textBlock.node.nodeSize, void 0, " ");
				} else if (nodesInChangedRanges.length) {
					const endText = newState.doc.textBetween(newRange.from, newRange.to, " ", " ");
					if (!UNICODE_WHITESPACE_REGEX_END.test(endText)) {
						return;
					}
					textBlock = nodesInChangedRanges[0];
					textBeforeWhitespace = newState.doc.textBetween(textBlock.pos, newRange.to, void 0, " ");
				}
				if (textBlock && textBeforeWhitespace) {
					const wordsBeforeWhitespace = textBeforeWhitespace.split(UNICODE_WHITESPACE_REGEX).filter(Boolean);
					if (wordsBeforeWhitespace.length <= 0) {
						return false;
					}
					const lastWordBeforeSpace = wordsBeforeWhitespace[wordsBeforeWhitespace.length - 1];
					const lastWordAndBlockOffset = textBlock.pos + textBeforeWhitespace.lastIndexOf(lastWordBeforeSpace);
					if (!lastWordBeforeSpace) {
						return false;
					}
					const linksBeforeSpace = tokenize(lastWordBeforeSpace).map((t) => t.toObject(options.defaultProtocol));
					if (!isValidLinkStructure(linksBeforeSpace)) {
						return false;
					}
					linksBeforeSpace
						.filter((link) => link.isLink)
						.map((link) => ({
							...link,
							from: lastWordAndBlockOffset + link.start + 1,
							to: lastWordAndBlockOffset + link.end + 1,
						}))
						.filter((link) => {
							if (!newState.schema.marks.code) {
								return true;
							}
							return !newState.doc.rangeHasMark(link.from, link.to, newState.schema.marks.code);
						})
						.filter((link) => options.validate(link.value))
						.filter((link) => options.shouldAutoLink(link.value))
						.forEach((link) => {
							if (getMarksBetween(link.from, link.to, newState.doc).some((item) => item.mark.type === options.type)) {
								return;
							}
							tr.addMark(
								link.from,
								link.to,
								options.type.create({
									href: link.href,
								}),
							);
						});
				}
			});
			if (!tr.steps.length) {
				return;
			}
			return tr;
		},
	});
}
function clickHandler(options) {
	return new Plugin({
		key: new PluginKey("handleClickLink"),
		props: {
			handleClick: (view, pos, event) => {
				var _a, _b;
				if (event.button !== 0) {
					return false;
				}
				if (!view.editable) {
					return false;
				}
				let link = null;
				if (event.target instanceof HTMLAnchorElement) {
					link = event.target;
				} else {
					const target = event.target;
					if (!target) {
						return false;
					}
					const root = options.editor.view.dom;
					link = target.closest("a");
					if (link && !root.contains(link)) {
						link = null;
					}
				}
				if (!link) {
					return false;
				}
				let handled = false;
				if (options.enableClickSelection) {
					const commandResult = options.editor.commands.extendMarkRange(options.type.name);
					handled = commandResult;
				}
				if (options.openOnClick) {
					const attrs = getAttributes(view.state, options.type.name);
					const href = (_a = link.href) != null ? _a : attrs.href;
					const target = (_b = link.target) != null ? _b : attrs.target;
					if (href) {
						window.open(href, target);
						handled = true;
					}
				}
				return handled;
			},
		},
	});
}
function pasteHandler(options) {
	return new Plugin({
		key: new PluginKey("handlePasteLink"),
		props: {
			handlePaste: (view, _event, slice) => {
				const { shouldAutoLink } = options;
				const { state } = view;
				const { selection } = state;
				const { empty } = selection;
				if (empty) {
					return false;
				}
				let textContent = "";
				slice.content.forEach((node) => {
					textContent += node.textContent;
				});
				const link = find(textContent, { defaultProtocol: options.defaultProtocol }).find((item) => item.isLink && item.value === textContent);
				if (!textContent || !link || (shouldAutoLink !== void 0 && !shouldAutoLink(link.value))) {
					return false;
				}
				return options.editor.commands.setMark(options.type, {
					href: link.href,
				});
			},
		},
	});
}
function isAllowedUri(uri, protocols) {
	const allowedProtocols = ["http", "https", "ftp", "ftps", "mailto", "tel", "callto", "sms", "cid", "xmpp"];
	if (protocols) {
		protocols.forEach((protocol) => {
			const nextProtocol = typeof protocol === "string" ? protocol : protocol.scheme;
			if (nextProtocol) {
				allowedProtocols.push(nextProtocol);
			}
		});
	}
	return (
		!uri ||
		uri
			.replace(UNICODE_WHITESPACE_REGEX_GLOBAL, "")
			.match(new RegExp(`^(?:(?:${allowedProtocols.map((protocol) => protocol.replace(/[-/\\^$*+?.()|[\]{}]/g, "\\$&")).join("|")}):|[^a-z]|[a-z0-9+.\\-]+(?:[^a-z+.\\-:]|$))`, "i"))
	);
}
var Link = Mark.create({
	name: "link",
	priority: 1e3,
	keepOnSplit: false,
	exitable: true,
	onCreate() {
		if (this.options.validate && !this.options.shouldAutoLink) {
			this.options.shouldAutoLink = this.options.validate;
			console.warn("The `validate` option is deprecated. Rename to the `shouldAutoLink` option instead.");
		}
		this.options.protocols.forEach((protocol) => {
			if (typeof protocol === "string") {
				registerCustomProtocol(protocol);
				return;
			}
			registerCustomProtocol(protocol.scheme, protocol.optionalSlashes);
		});
	},
	onDestroy() {
		reset();
	},
	inclusive() {
		return this.options.autolink;
	},
	addOptions() {
		return {
			openOnClick: true,
			enableClickSelection: false,
			linkOnPaste: true,
			autolink: true,
			protocols: [],
			defaultProtocol: "http",
			HTMLAttributes: {
				target: "_blank",
				rel: "noopener noreferrer nofollow",
				class: null,
			},
			isAllowedUri: (url, ctx) => !!isAllowedUri(url, ctx.protocols),
			validate: (url) => !!url,
			shouldAutoLink: (url) => {
				const hasProtocol = /^[a-z][a-z0-9+.-]*:\/\//i.test(url);
				const hasMaybeProtocol = /^[a-z][a-z0-9+.-]*:/i.test(url);
				if (hasProtocol || (hasMaybeProtocol && !url.includes("@"))) {
					return true;
				}
				const urlWithoutUserinfo = url.includes("@") ? url.split("@").pop() : url;
				const hostname = urlWithoutUserinfo.split(/[/?#:]/)[0];
				if (/^\d{1,3}(\.\d{1,3}){3}$/.test(hostname)) {
					return false;
				}
				if (!/\./.test(hostname)) {
					return false;
				}
				return true;
			},
		};
	},
	addAttributes() {
		return {
			href: {
				default: null,
				parseHTML(element) {
					return element.getAttribute("href");
				},
			},
			target: {
				default: this.options.HTMLAttributes.target,
			},
			rel: {
				default: this.options.HTMLAttributes.rel,
			},
			class: {
				default: this.options.HTMLAttributes.class,
			},
			title: {
				default: null,
			},
		};
	},
	parseHTML() {
		return [
			{
				tag: "a[href]",
				getAttrs: (dom) => {
					const href = dom.getAttribute("href");
					if (
						!href ||
						!this.options.isAllowedUri(href, {
							defaultValidate: (url) => !!isAllowedUri(url, this.options.protocols),
							protocols: this.options.protocols,
							defaultProtocol: this.options.defaultProtocol,
						})
					) {
						return false;
					}
					return null;
				},
			},
		];
	},
	renderHTML({ HTMLAttributes }) {
		if (
			!this.options.isAllowedUri(HTMLAttributes.href, {
				defaultValidate: (href) => !!isAllowedUri(href, this.options.protocols),
				protocols: this.options.protocols,
				defaultProtocol: this.options.defaultProtocol,
			})
		) {
			return ["a", mergeAttributes(this.options.HTMLAttributes, { ...HTMLAttributes, href: "" }), 0];
		}
		return ["a", mergeAttributes(this.options.HTMLAttributes, HTMLAttributes), 0];
	},
	markdownTokenName: "link",
	parseMarkdown: (token, helpers) => {
		return helpers.applyMark("link", helpers.parseInline(token.tokens || []), {
			href: token.href,
			title: token.title || null,
		});
	},
	renderMarkdown: (node, h) => {
		var _a, _b, _c, _d;
		const href = (_b = (_a = node.attrs) == null ? void 0 : _a.href) != null ? _b : "";
		const title = (_d = (_c = node.attrs) == null ? void 0 : _c.title) != null ? _d : "";
		const text = h.renderChildren(node);
		return title ? `[${text}](${href} "${title}")` : `[${text}](${href})`;
	},
	addCommands() {
		return {
			setLink:
				(attributes) =>
				({ chain }) => {
					const { href } = attributes;
					if (
						!this.options.isAllowedUri(href, {
							defaultValidate: (url) => !!isAllowedUri(url, this.options.protocols),
							protocols: this.options.protocols,
							defaultProtocol: this.options.defaultProtocol,
						})
					) {
						return false;
					}
					return chain().setMark(this.name, attributes).setMeta("preventAutolink", true).run();
				},
			toggleLink:
				(attributes) =>
				({ chain }) => {
					const { href } = attributes || {};
					if (
						href &&
						!this.options.isAllowedUri(href, {
							defaultValidate: (url) => !!isAllowedUri(url, this.options.protocols),
							protocols: this.options.protocols,
							defaultProtocol: this.options.defaultProtocol,
						})
					) {
						return false;
					}
					return chain().toggleMark(this.name, attributes, { extendEmptyMarkRange: true }).setMeta("preventAutolink", true).run();
				},
			unsetLink:
				() =>
				({ chain }) => {
					return chain().unsetMark(this.name, { extendEmptyMarkRange: true }).setMeta("preventAutolink", true).run();
				},
		};
	},
	addPasteRules() {
		return [
			markPasteRule({
				find: (text) => {
					const foundLinks = [];
					if (text) {
						const { protocols, defaultProtocol } = this.options;
						const links = find(text).filter(
							(item) =>
								item.isLink &&
								this.options.isAllowedUri(item.value, {
									defaultValidate: (href) => !!isAllowedUri(href, protocols),
									protocols,
									defaultProtocol,
								}),
						);
						if (links.length) {
							links.forEach((link) => {
								if (!this.options.shouldAutoLink(link.value)) {
									return;
								}
								foundLinks.push({
									text: link.value,
									data: {
										href: link.href,
									},
									index: link.start,
								});
							});
						}
					}
					return foundLinks;
				},
				type: this.type,
				getAttributes: (match) => {
					var _a;
					return {
						href: (_a = match.data) == null ? void 0 : _a.href,
					};
				},
			}),
		];
	},
	addProseMirrorPlugins() {
		const plugins = [];
		const { protocols, defaultProtocol } = this.options;
		if (this.options.autolink) {
			plugins.push(
				autolink({
					type: this.type,
					defaultProtocol: this.options.defaultProtocol,
					validate: (url) =>
						this.options.isAllowedUri(url, {
							defaultValidate: (href) => !!isAllowedUri(href, protocols),
							protocols,
							defaultProtocol,
						}),
					shouldAutoLink: this.options.shouldAutoLink,
				}),
			);
		}
		plugins.push(
			clickHandler({
				type: this.type,
				editor: this.editor,
				openOnClick: this.options.openOnClick === "whenNotEditable" ? true : this.options.openOnClick,
				enableClickSelection: this.options.enableClickSelection,
			}),
		);
		if (this.options.linkOnPaste) {
			plugins.push(
				pasteHandler({
					editor: this.editor,
					defaultProtocol: this.options.defaultProtocol,
					type: this.type,
					shouldAutoLink: this.options.shouldAutoLink,
				}),
			);
		}
		return plugins;
	},
});

// src/index.ts
var index_default = Link;

// src/text.ts
var Text = Node3.create({
	name: "text",
	group: "inline",
	parseMarkdown: (token) => {
		return {
			type: "text",
			text: token.text || "",
		};
	},
	renderMarkdown: (node) => node.text || "",
});

var shim = { exports: {} };

var useSyncExternalStoreShim_production = {};

/**
 * @license React
 * use-sync-external-store-shim.production.js
 *
 * Copyright (c) Meta Platforms, Inc. and affiliates.
 *
 * This source code is licensed under the MIT license found in the
 * LICENSE file in the root directory of this source tree.
 */

var hasRequiredUseSyncExternalStoreShim_production;

function requireUseSyncExternalStoreShim_production() {
	if (hasRequiredUseSyncExternalStoreShim_production) return useSyncExternalStoreShim_production;
	hasRequiredUseSyncExternalStoreShim_production = 1;
	var React = requireReact();
	function is(x, y) {
		return (x === y && (0 !== x || 1 / x === 1 / y)) || (x !== x && y !== y);
	}
	var objectIs = "function" === typeof Object.is ? Object.is : is,
		useState = React.useState,
		useEffect = React.useEffect,
		useLayoutEffect = React.useLayoutEffect,
		useDebugValue = React.useDebugValue;
	function useSyncExternalStore$2(subscribe, getSnapshot) {
		var value = getSnapshot(),
			_useState = useState({ inst: { value: value, getSnapshot: getSnapshot } }),
			inst = _useState[0].inst,
			forceUpdate = _useState[1];
		useLayoutEffect(
			function () {
				inst.value = value;
				inst.getSnapshot = getSnapshot;
				checkIfSnapshotChanged(inst) && forceUpdate({ inst: inst });
			},
			[subscribe, value, getSnapshot],
		);
		useEffect(
			function () {
				checkIfSnapshotChanged(inst) && forceUpdate({ inst: inst });
				return subscribe(function () {
					checkIfSnapshotChanged(inst) && forceUpdate({ inst: inst });
				});
			},
			[subscribe],
		);
		useDebugValue(value);
		return value;
	}
	function checkIfSnapshotChanged(inst) {
		var latestGetSnapshot = inst.getSnapshot;
		inst = inst.value;
		try {
			var nextValue = latestGetSnapshot();
			return !objectIs(inst, nextValue);
		} catch (error) {
			return true;
		}
	}
	function useSyncExternalStore$1(subscribe, getSnapshot) {
		return getSnapshot();
	}
	var shim = "undefined" === typeof window || "undefined" === typeof window.document || "undefined" === typeof window.document.createElement ? useSyncExternalStore$1 : useSyncExternalStore$2;
	useSyncExternalStoreShim_production.useSyncExternalStore = void 0 !== React.useSyncExternalStore ? React.useSyncExternalStore : shim;
	return useSyncExternalStoreShim_production;
}

var hasRequiredShim;

function requireShim() {
	if (hasRequiredShim) return shim.exports;
	hasRequiredShim = 1;
	{
		shim.exports = requireUseSyncExternalStoreShim_production();
	}
	return shim.exports;
}

export {
	findChildrenInRange as $,
	Decoration as A,
	createStyleTag as B,
	Bold as C,
	DecorationSet as D,
	Editor as E,
	Fragment as F,
	Code as G,
	Strike as H,
	Italic as I,
	Text as J,
	Schema as K,
	Link as L,
	Mark$1 as M,
	Node3 as N,
	extensions_exports as O,
	Plugin as P,
	DOMParser as Q,
	Mark as R,
	Selection as S,
	TextSelection as T,
	Underline as U,
	getHTMLFromFragment as V,
	index_default as W,
	requireShim as X,
	posToDOMRect as Y,
	combineTransactionSteps as Z,
	getChangedRanges as _,
	PluginKey as a,
	Slice as a0,
	SelectionRange as a1,
	keydownHandler as a2,
	Transform as a3,
	AllSelection as a4,
	ReplaceStep as a5,
	findParentNode as a6,
	Mapping as a7,
	DOMSerializer as a8,
	index_default$4 as a9,
	index_default$2 as aa,
	index_default$1 as ab,
	index_default$3 as ac,
	index_default$5 as ad,
	getMarkRange as ae,
	findChildren as af,
	closeHistory as ag,
	getSchema as ah,
	createDocument as ai,
	Node as aj,
	keymap as ak,
	findParentNodeClosestToPos as al,
	selectionToInsertionEnd as am,
	ReplaceAroundStep as an,
	NodeSelection as b,
	canInsertNode as c,
	Extension as d,
	isNodeActive as e,
	isAtStartOfNode as f,
	isAtEndOfNode as g,
	h,
	isNodeSelection as i,
	getNodeAtPosition as j,
	getNodeType as k,
	getRenderedAttributes as l,
	mergeAttributes as m,
	nodeInputRule as n,
	dropPoint as o,
	parseIndentedBlocks as p,
	callOrReturn as q,
	renderNestedMarkdownContent as r,
	getExtensionField as s,
	textblockTypeInputRule as t,
	gapCursor as u,
	history as v,
	wrappingInputRule as w,
	redo as x,
	undo as y,
	isNodeEmpty as z,
};