@kerebron/legacy-compat 0.8.2 → 0.8.3

package/dist/kerebron.js

@@ -65,7 +65,7 @@ OrderedMap.prototype = {
 	return new OrderedMap(t);
 };
 //#endregion
-//#region ../../node_modules/.deno/prosemirror-model@1.25.3/node_modules/prosemirror-model/dist/index.js
+//#region ../../node_modules/.deno/prosemirror-model@1.25.9/node_modules/prosemirror-model/dist/index.js
 function findDiffStart(e, t, n) {
 	for (let r = 0;; r++) {
 		if (r == e.childCount || r == t.childCount) return e.childCount == t.childCount ? null : n;
@@ -76,8 +76,9 @@ function findDiffStart(e, t, n) {
 		}
 		if (!a.sameMarkup(o)) return n;
 		if (a.isText && a.text != o.text) {
-			for (let e = 0; a.text[e] == o.text[e]; e++) n++;
-			return n;
+			let e = a.text, t = o.text, r = 0;
+			for (; e[r] == t[r]; r++) n++;
+			return r && r < e.length && r < t.length && surrogateHigh(e.charCodeAt(r - 1)) && surrogateLow(e.charCodeAt(r)) && n--, n;
 		}
 		if (a.content.size || o.content.size) {
 			let e = findDiffStart(a.content, o.content, n + 1);
@@ -102,9 +103,9 @@ function findDiffEnd(e, t, n, r) {
 			b: r
 		};
 		if (s.isText && s.text != c.text) {
-			let e = 0, t = Math.min(s.text.length, c.text.length);
-			for (; e < t && s.text[s.text.length - e - 1] == c.text[c.text.length - e - 1];) e++, n--, r--;
-			return {
+			let e = s.text, t = c.text, a = e.length, o = t.length;
+			for (; a > 0 && o > 0 && e[a - 1] == t[o - 1];) a--, o--, n--, r--;
+			return a && o && a < e.length && surrogateHigh(e.charCodeAt(a - 1)) && surrogateLow(e.charCodeAt(a)) && (n++, r++), {
 				a: n,
 				b: r
 			};
@@ -116,6 +117,12 @@ function findDiffEnd(e, t, n, r) {
 		n -= l, r -= l;
 	}
 }
+function surrogateLow(e) {
+	return e >= 56320 && e < 57344;
+}
+function surrogateHigh(e) {
+	return e >= 55296 && e < 56320;
+}
 var Fragment = class e {
 	constructor(e, t) {
 		if (this.content = e, this.size = t || 0, t == null) for (let t = 0; t < e.length; t++) this.size += e[t].nodeSize;
@@ -227,7 +234,7 @@ var Fragment = class e {
 	static fromJSON(t, n) {
 		if (!n) return e.empty;
 		if (!Array.isArray(n)) throw RangeError("Invalid input for Fragment.fromJSON");
-		return new e(n.map(t.nodeFromJSON));
+		return e.fromArray(n.map(t.nodeFromJSON));
 	}
 	static fromArray(t) {
 		if (!t.length) return e.empty;
@@ -331,7 +338,7 @@ var ReplaceError = class extends Error {}, Slice = class e {
 		return this.content.size - this.openStart - this.openEnd;
 	}
 	insertAt(t, n) {
-		let r = insertInto(this.content, t + this.openStart, n);
+		let r = insertInto(this.content, t + this.openStart, n, this.openStart + 1, this.openEnd + 1);
 		return r && new e(r, this.openStart, this.openEnd);
 	}
 	removeBetween(t, n) {
@@ -371,11 +378,11 @@ function removeRange(e, t, n) {
 	if (r != s) throw RangeError("Removing non-flat range");
 	return e.replaceChild(r, o.copy(removeRange(o.content, t - a - 1, n - a - 1)));
 }
-function insertInto(e, t, n, r) {
-	let { index: a, offset: o } = e.findIndex(t), s = e.maybeChild(a);
-	if (o == t || s.isText) return r && !r.canReplace(a, a, n) ? null : e.cut(0, t).append(n).append(e.cut(t));
-	let c = insertInto(s.content, t - o - 1, n, s);
-	return c && e.replaceChild(a, s.copy(c));
+function insertInto(e, t, n, r, a, o) {
+	let { index: s, offset: c } = e.findIndex(t), l = e.maybeChild(s);
+	if (c == t || l.isText) return o && r <= 0 && a <= 0 && !o.canReplace(s, s, n) ? null : e.cut(0, t).append(n).append(e.cut(t));
+	let u = insertInto(l.content, t - c - 1, n, s == 0 ? r - 1 : 0, s == e.childCount - 1 ? a - 1 : 0, l);
+	return u && e.replaceChild(s, l.copy(u));
 }
 function replace(e, t, n) {
 	if (n.openStart > e.depth) throw new ReplaceError("Inserted content deeper than insertion position");
@@ -414,7 +421,8 @@ function addRange(e, t, n, r) {
 	t && t.depth == n && t.textOffset && addNode(t.nodeBefore, r);
 }
 function close(e, t) {
-	return e.type.checkContent(t), e.copy(t);
+	if (!e.type.validContent(t)) throw new ReplaceError("Invalid content for node " + e.type.name);
+	return e.copy(t);
 }
 function replaceThreeWay(e, t, n, r, a) {
 	let o = e.depth > a && joinable$1(e, t, a + 1), s = r.depth > a && joinable$1(n, r, a + 1), c = [];
@@ -1116,11 +1124,8 @@ function computeAttrs(e, t) {
 	return n;
 }
 function checkAttrs(e, t, n, r) {
-	for (let r in t) if (!(r in e)) throw RangeError(`Unsupported attribute ${r} for ${n} of type ${r}`);
-	for (let n in e) {
-		let r = e[n];
-		r.validate && r.validate(t[n]);
-	}
+	for (let a in t) if (!(a in e)) throw RangeError(`Unsupported attribute ${a} for ${n} of type ${r}`);
+	for (let n in e) e[n].validate && e[n].validate(t[n]);
 }
 function initAttrs(e, t) {
 	let n = Object.create(null);
@@ -1479,14 +1484,20 @@ var NodeContext = class {
 		e.nodeType == 3 ? this.addTextNode(e, t) : e.nodeType == 1 && this.addElement(e, t);
 	}
 	addTextNode(e, t) {
-		let n = e.nodeValue, r = this.top, a = r.options & OPT_PRESERVE_WS_FULL ? "full" : this.localPreserveWS || (r.options & OPT_PRESERVE_WS) > 0;
+		let n = e.nodeValue, r = this.top, a = r.options & OPT_PRESERVE_WS_FULL ? "full" : this.localPreserveWS || (r.options & OPT_PRESERVE_WS) > 0, { schema: o } = this.parser;
 		if (a === "full" || r.inlineContext(e) || /[^ \t\r\n\u000c]/.test(n)) {
-			if (a) n = a === "full" ? n.replace(/\r\n?/g, "\n") : n.replace(/\r?\n|\r/g, " ");
-			else if (n = n.replace(/[ \t\r\n\u000c]+/g, " "), /^[ \t\r\n\u000c]/.test(n) && this.open == this.nodes.length - 1) {
-				let t = r.content[r.content.length - 1], a = e.previousSibling;
-				(!t || a && a.nodeName == "BR" || t.isText && /[ \t\r\n\u000c]$/.test(t.text)) && (n = n.slice(1));
-			}
-			n && this.insertNode(this.parser.schema.text(n), t, !/\S/.test(n)), this.findInText(e);
+			if (!a) {
+				if (n = n.replace(/[ \t\r\n\u000c]+/g, " "), /^[ \t\r\n\u000c]/.test(n) && this.open == this.nodes.length - 1) {
+					let t = r.content[r.content.length - 1], a = e.previousSibling;
+					(!t || a && a.nodeName == "BR" || t.isText && /[ \t\r\n\u000c]$/.test(t.text)) && (n = n.slice(1));
+				}
+			} else if (a === "full") n = n.replace(/\r\n?/g, "\n");
+			else if (o.linebreakReplacement && /[\r\n]/.test(n) && this.top.findWrapping(o.linebreakReplacement.create())) {
+				let e = n.split(/\r?\n|\r/);
+				for (let n = 0; n < e.length; n++) n && this.insertNode(o.linebreakReplacement.create(), t, !0), e[n] && this.insertNode(o.text(e[n]), t, !/\S/.test(e[n]));
+				n = "";
+			} else n = n.replace(/\r?\n|\r/g, " ");
+			n && this.insertNode(o.text(n), t, !/\S/.test(n)), this.findInText(e);
 		} else this.findInside(e);
 	}
 	addElement(e, t, n) {
@@ -1728,6 +1739,7 @@ var DOMSerializer = class e {
 		}), n;
 	}
 	serializeNodeInner(e, t) {
+		if (e.isText) return doc$1(t).createTextNode(e.text);
 		let { dom: n, contentDOM: r } = renderSpec(doc$1(t), this.nodes[e.type.name](e), null, e.attrs);
 		if (r) {
 			if (e.isLeaf) throw RangeError("Content hole not allowed in a leaf node spec");
@@ -1748,7 +1760,7 @@ var DOMSerializer = class e {
 		return r && renderSpec(doc$1(n), r(e, t), null, e.attrs);
 	}
 	static renderSpec(e, t, n = null, r) {
-		return renderSpec(e, t, n, r);
+		return typeof t == "string" ? { dom: e.createTextNode(t) } : renderSpec(e, t, n, r);
 	}
 	static fromSchema(t) {
 		return t.cached.domSerializer || (t.cached.domSerializer = new e(this.nodesFromSchema(t), this.marksFromSchema(t)));
@@ -1787,9 +1799,8 @@ function suspiciousAttributesInner(e) {
 	return n(e), t;
 }
 function renderSpec(e, t, n, r) {
-	if (typeof t == "string") return { dom: e.createTextNode(t) };
-	if (t.nodeType != null) return { dom: t };
-	if (t.dom && t.dom.nodeType != null) return t;
+	if (t.nodeType == 1) return { dom: t };
+	if (t.dom && t.dom.nodeType == 1) return t;
 	let a = t[0], o;
 	if (typeof a != "string") throw RangeError("Invalid array passed to renderSpec");
 	if (r && (o = suspiciousAttributes(r)) && o.indexOf(t) > -1) throw RangeError("Using an array from an attribute object as a DOM spec. This may be an attempted cross site scripting attack.");
@@ -1811,7 +1822,8 @@ function renderSpec(e, t, n, r) {
 				dom: l,
 				contentDOM: l
 			};
-		} else {
+		} else if (typeof o == "string") l.appendChild(e.createTextNode(o));
+		else {
 			let { dom: t, contentDOM: a } = renderSpec(e, o, n, r);
 			if (l.appendChild(t), a) {
 				if (c) throw RangeError("Multiple content holes");