@kerebron/legacy-compat 0.8.4 → 0.8.5

package/dist/kerebron.js

@@ -7093,6 +7093,350 @@ function setPathValue(e, t, n) {
 	}
 }
 //#endregion
+//#region ../editor/src/search/query.ts
+var SearchQuery = class {
+	search;
+	caseSensitive;
+	literal;
+	regexp;
+	replace;
+	valid;
+	wholeWord;
+	filter;
+	impl;
+	constructor(e) {
+		this.search = e.search, this.caseSensitive = !!e.caseSensitive, this.literal = !!e.literal, this.regexp = !!e.regexp, this.replace = e.replace || "", this.valid = !!this.search && !(this.regexp && !validRegExp(this.search)), this.wholeWord = !!e.wholeWord, this.filter = e.filter || null, this.impl = this.valid ? this.regexp ? new RegExpQuery(this) : new StringQuery(this) : nullQuery;
+	}
+	eq(e) {
+		return this.search == e.search && this.replace == e.replace && this.caseSensitive == e.caseSensitive && this.regexp == e.regexp && this.wholeWord == e.wholeWord;
+	}
+	findNext(e, t = 0, n = e.doc.content.size) {
+		for (;;) {
+			if (t >= n) return null;
+			let r = this.impl.findNext(e, t, n);
+			if (!r || this.checkResult(e, r)) return r;
+			t = r.from + 1;
+		}
+	}
+	findPrev(e, t = e.doc.content.size, n = 0) {
+		for (;;) {
+			if (t <= n) return null;
+			let r = this.impl.findPrev(e, t, n);
+			if (!r || this.checkResult(e, r)) return r;
+			t = r.to - 1;
+		}
+	}
+	checkResult(e, t) {
+		return (!this.wholeWord || checkWordBoundary(e, t.from) && checkWordBoundary(e, t.to)) && (!this.filter || this.filter(e, t));
+	}
+	unquote(e) {
+		return this.literal ? e : e.replace(/\\([nrt\\])/g, (e, t) => t == "n" ? "\n" : t == "r" ? "\r" : t == "t" ? "	" : "\\");
+	}
+	getReplacements(e, t) {
+		let n = e.doc.resolve(t.from).marksAcross(e.doc.resolve(t.to)), r = [], a = Fragment.empty, o = t.from, { match: s } = t, c = s ? getGroupIndices(s) : [[0, t.to - t.from]], l = parseReplacement(this.unquote(this.replace)), u;
+		for (let s of l) if (typeof s == "string") a = a.addToEnd(e.schema.text(s, n));
+		else if (u = c[s.group], u) {
+			let n = t.matchStart + u[0], c = t.matchStart + u[1];
+			s.copy ? a = a.append(e.doc.slice(n, c).content) : ((a != Fragment.empty || n > o) && (r.push({
+				from: o,
+				to: n,
+				insert: new Slice(a, 0, 0)
+			}), a = Fragment.empty), o = c);
+		}
+		return (a != Fragment.empty || o < t.to) && r.push({
+			from: o,
+			to: t.to,
+			insert: new Slice(a, 0, 0)
+		}), r;
+	}
+}, nullQuery = new class {
+	findNext() {
+		return null;
+	}
+	findPrev() {
+		return null;
+	}
+}(), StringQuery = class {
+	query;
+	string;
+	constructor(e) {
+		this.query = e;
+		let t = e.unquote(e.search);
+		e.caseSensitive || (t = t.toLowerCase()), this.string = t;
+	}
+	findNext(e, t, n) {
+		return scanTextblocks(e.doc, t, n, (e, r) => {
+			let a = Math.max(t, r), o = textContent(e).slice(a - r, Math.min(e.content.size, n - r)), s = (this.query.caseSensitive ? o : o.toLowerCase()).indexOf(this.string);
+			return s < 0 ? null : {
+				from: a + s,
+				to: a + s + this.string.length,
+				match: null,
+				matchStart: r
+			};
+		});
+	}
+	findPrev(e, t, n) {
+		return scanTextblocks(e.doc, t, n, (e, r) => {
+			let a = Math.max(r, n), o = textContent(e).slice(a - r, Math.min(e.content.size, t - r));
+			this.query.caseSensitive || (o = o.toLowerCase());
+			let s = o.lastIndexOf(this.string);
+			return s < 0 ? null : {
+				from: a + s,
+				to: a + s + this.string.length,
+				match: null,
+				matchStart: r
+			};
+		});
+	}
+}, baseFlags = "g" + (/x/.unicode == null ? "" : "u") + (/x/.hasIndices == null ? "" : "d"), RegExpQuery = class {
+	query;
+	regexp;
+	constructor(e) {
+		this.query = e, this.regexp = new RegExp(e.search, baseFlags + (e.caseSensitive ? "" : "i"));
+	}
+	findNext(e, t, n) {
+		return scanTextblocks(e.doc, t, n, (e, r) => {
+			let a = textContent(e).slice(0, Math.min(e.content.size, n - r));
+			this.regexp.lastIndex = t - r;
+			let o = this.regexp.exec(a);
+			return o ? {
+				from: r + o.index,
+				to: r + o.index + o[0].length,
+				match: o,
+				matchStart: r
+			} : null;
+		});
+	}
+	findPrev(e, t, n) {
+		return scanTextblocks(e.doc, t, n, (e, n) => {
+			let r = textContent(e).slice(0, Math.min(e.content.size, t - n)), a;
+			for (let e = 0;;) {
+				this.regexp.lastIndex = e;
+				let t = this.regexp.exec(r);
+				if (!t) break;
+				a = t, e = t.index + 1;
+			}
+			return a ? {
+				from: n + a.index,
+				to: n + a.index + a[0].length,
+				match: a,
+				matchStart: n
+			} : null;
+		});
+	}
+};
+function getGroupIndices(e) {
+	if (e.indices) return e.indices;
+	let t = [[0, e[0].length]];
+	for (let n = 1, r = 0; n < e.length; n++) {
+		let a = e[n] ? e[0].indexOf(e[n], r) : -1;
+		t.push(a < 0 ? void 0 : [a, r = a + e[n].length]);
+	}
+	return t;
+}
+function parseReplacement(e) {
+	let t = [], n = -1;
+	function r(e) {
+		let n = t.length - 1;
+		n > -1 && typeof t[n] == "string" ? t[n] += e : t.push(e);
+	}
+	for (; e.length;) {
+		let a = /\$([$&\d+])/.exec(e);
+		if (!a) return r(e), t;
+		if (a.index > 0 && r(e.slice(0, a.index + +(a[1] == "$"))), a[1] != "$") {
+			let e = a[1] == "&" ? 0 : +a[1];
+			n >= e ? t.push({
+				group: e,
+				copy: !0
+			}) : (n = e || 1e3, t.push({
+				group: e,
+				copy: !1
+			}));
+		}
+		e = e.slice(a.index + a[0].length);
+	}
+	return t;
+}
+function validRegExp(e) {
+	try {
+		return new RegExp(e, baseFlags), !0;
+	} catch {
+		return !1;
+	}
+}
+var TextContentCache = /* @__PURE__ */ new WeakMap();
+function textContent(e) {
+	let t = TextContentCache.get(e);
+	if (t) return t;
+	let n = "";
+	for (let t = 0; t < e.childCount; t++) {
+		let r = e.child(t);
+		r.isText ? n += r.text : r.isLeaf ? n += "" : n += " " + textContent(r) + " ";
+	}
+	return TextContentCache.set(e, n), n;
+}
+function scanTextblocks(e, t, n, r, a = 0) {
+	if (e.inlineContent) return r(e, a);
+	if (!e.isLeaf) if (t > n) for (let o = e.childCount - 1, s = a + e.content.size; o >= 0 && s > n; o--) {
+		let a = e.child(o);
+		if (s -= a.nodeSize, s < t) {
+			let e = scanTextblocks(a, t, n, r, s + 1);
+			if (e != null) return e;
+		}
+	}
+	else for (let o = 0, s = a; o < e.childCount && s < n; o++) {
+		let a = e.child(o), c = s;
+		if (s += a.nodeSize, s > t) {
+			let e = scanTextblocks(a, t, n, r, c + 1);
+			if (e != null) return e;
+		}
+	}
+	return null;
+}
+function checkWordBoundary(e, t) {
+	let n = e.doc.resolve(t), r = n.nodeBefore, a = n.nodeAfter;
+	return !r || !a || !r.isText || !a.isText ? !0 : !/\p{L}$/u.test(r.text) || !/^\p{L}/u.test(a.text);
+}
+//#endregion
+//#region ../editor/src/search/search.ts
+var SearchState = class {
+	query;
+	range;
+	deco;
+	constructor(e, t, n) {
+		this.query = e, this.range = t, this.deco = n;
+	}
+};
+function buildMatchDeco(e, t, n) {
+	if (!t.valid) return DecorationSet.empty;
+	let r = [], a = e.selection;
+	for (let o = n ? n.from : 0, s = n ? n.to : e.doc.content.size;;) {
+		let n = t.findNext(e, o, s);
+		if (!n) break;
+		let c = n.from == a.from && n.to == a.to ? "kb-active-search-match" : "kb-search-match";
+		r.push(Decoration.inline(n.from, n.to, { class: c })), o = n.to;
+	}
+	return DecorationSet.create(e.doc, r);
+}
+var searchKey = new PluginKey("search");
+function createSearchPlugin(e = {}) {
+	return new Plugin({
+		key: searchKey,
+		state: {
+			init(t, n) {
+				let r = e.initialQuery || new SearchQuery({ search: "" }), a = e.initialRange || null;
+				return new SearchState(r, a, buildMatchDeco(n, r, a));
+			},
+			apply(e, t, n, r) {
+				let a = e.getMeta(searchKey);
+				if (a) return new SearchState(a.query, a.range, buildMatchDeco(r, a.query, a.range));
+				if (e.docChanged || e.selectionSet) {
+					let n = t.range;
+					if (n) {
+						let t = e.mapping.map(n.from, 1), r = e.mapping.map(n.to, -1);
+						n = t < r ? {
+							from: t,
+							to: r
+						} : null;
+					}
+					t = new SearchState(t.query, n, buildMatchDeco(r, t.query, n));
+				}
+				return t;
+			}
+		},
+		props: { decorations: (e) => searchKey.getState(e).deco }
+	});
+}
+function setSearchState(e, t, n = null) {
+	return e.setMeta(searchKey, {
+		query: t,
+		range: n
+	});
+}
+function nextMatch(e, t, n, r, a) {
+	let o = e.range || {
+		from: 0,
+		to: t.doc.content.size
+	}, s = e.query.findNext(t, Math.max(a, o.from), o.to);
+	return !s && n && (s = e.query.findNext(t, o.from, Math.min(r, o.to))), s;
+}
+function prevMatch(e, t, n, r, a) {
+	let o = e.range || {
+		from: 0,
+		to: t.doc.content.size
+	}, s = e.query.findPrev(t, Math.min(r, o.to), o.from);
+	return !s && n && (s = e.query.findPrev(t, o.to, Math.max(a, o.from))), s;
+}
+function findCommand(e, t) {
+	return (n, r) => {
+		let a = searchKey.getState(n);
+		if (!a || !a.query.valid) return !1;
+		let { from: o, to: s } = n.selection, c = t > 0 ? nextMatch(a, n, e, o, s) : prevMatch(a, n, e, o, s);
+		if (!c) return !1;
+		let l = TextSelection.create(n.doc, c.from, c.to);
+		return r && r(n.tr.setSelection(l).scrollIntoView()), !0;
+	};
+}
+var findNext = findCommand(!0, 1), findNextNoWrap = findCommand(!1, 1), findPrev = findCommand(!0, -1), findPrevNoWrap = findCommand(!1, -1);
+function replaceCommand(e, t) {
+	return (n, r) => {
+		let a = searchKey.getState(n);
+		if (!a || !a.query.valid) return !1;
+		let { from: o } = n.selection, s = nextMatch(a, n, e, o, o);
+		if (!s) return !1;
+		if (!r) return !0;
+		if (n.selection.from == s.from && n.selection.to == s.to) {
+			let o = n.tr, c = a.query.getReplacements(n, s);
+			for (let e = c.length - 1; e >= 0; e--) {
+				let { from: t, to: n, insert: r } = c[e];
+				o.replace(t, n, r);
+			}
+			let l = t && nextMatch(a, n, e, s.from, s.to);
+			l ? o.setSelection(TextSelection.create(o.doc, o.mapping.map(l.from, 1), o.mapping.map(l.to, -1))) : o.setSelection(TextSelection.create(o.doc, s.from, o.mapping.map(s.to, 1))), r(o.scrollIntoView());
+		} else if (t) r(n.tr.setSelection(TextSelection.create(n.doc, s.from, s.to)).scrollIntoView());
+		else return !1;
+		return !0;
+	};
+}
+var replaceNext = replaceCommand(!0, !0), replaceNextNoWrap = replaceCommand(!1, !0), replaceCurrent = replaceCommand(!1, !1), replaceAll = (e, t) => {
+	let n = searchKey.getState(e);
+	if (!n) return !1;
+	let r = [], a = n.range || {
+		from: 0,
+		to: e.doc.content.size
+	};
+	for (let t = a.from;;) {
+		let o = n.query.findNext(e, t, a.to);
+		if (!o) break;
+		r.push(o), t = o.to;
+	}
+	if (t) {
+		let a = e.tr;
+		for (let t = r.length - 1; t >= 0; t--) {
+			let o = r[t], s = n.query.getReplacements(e, o);
+			for (let e = s.length - 1; e >= 0; e--) {
+				let { from: t, to: n, insert: r } = s[e];
+				a.replace(t, n, r);
+			}
+		}
+		t(a);
+	}
+	return !0;
+}, searchFactory = (e, t = null) => (n, r) => {
+	let a = n.tr;
+	return setSearchState(a, e, t), r && r(a), !0;
+}, searchCommandFactories = {
+	search: searchFactory,
+	findNext: () => findNext,
+	findNextNoWrap: () => findNextNoWrap,
+	findPrev: () => findPrev,
+	findPrevNoWrap: () => findPrevNoWrap,
+	replaceNext: () => replaceNext,
+	replaceNextNoWrap: () => replaceNextNoWrap,
+	replaceCurrent: () => replaceCurrent,
+	replaceAll: () => replaceAll
+};
+//#endregion
 //#region ../editor/src/ExtensionManager.ts
 function splitExtensions(e) {
 	return {
@@ -7149,7 +7493,7 @@ var ExtensionManager = class {
 			let t = r.get(e);
 			t && r.set(e, firstCommand$1((t, n, r) => (console.debug(`Key: ${e}`), !0), t));
 		}
-		this.converters = o, this.plugins.push(new InputRulesPlugin(n)), this.plugins.push(new KeymapPlugin(Object.fromEntries(r))), this.plugins.push(new TrackSelecionPlugin(e));
+		this.converters = o, this.plugins.push(new InputRulesPlugin(n)), this.plugins.push(new KeymapPlugin(Object.fromEntries(r))), this.plugins.push(createSearchPlugin()), this.plugins.push(new TrackSelecionPlugin(e));
 	}
 	setupExtensions(e) {
 		let t = /* @__PURE__ */ new Map(), n = (e) => {
@@ -7712,7 +8056,7 @@ var insertBlockBefore = (e, t) => (n, r) => {
 	run = {};
 	debug = !0;
 	constructor(e) {
-		this.editor = e, this.mergeCommandFactories(baseCommandFactories, "baseCommand"), this.mergeCommandFactories(keyCommandFactories, "key"), this.mergeCommandFactories(replaceCommandFactories, "replace");
+		this.editor = e, this.mergeCommandFactories(baseCommandFactories, "baseCommand"), this.mergeCommandFactories(keyCommandFactories, "key"), this.mergeCommandFactories(replaceCommandFactories, "replace"), this.mergeCommandFactories(searchCommandFactories, "search");
 	}
 	mergeCommandFactories(e, t) {
 		for (let n in e) {
@@ -23329,7 +23673,9 @@ async function mdToPmConverterText(e, t, n) {
 			getAttrs: (e) => ({ lang: e.attrGet("lang") || void 0 }),
 			noCloseToken: !0
 		},
-		hr: { node: "hr" },
+		hr: { custom: (e, t, r, a) => {
+			e.openNode(n.nodes.paragraph, {}), e.addNode(n.nodes.hr, {}), e.closeNode();
+		} },
 		image: {
 			node: "image",
 			getAttrs: (e) => {