@unicom-cloud/ui 0.8.167 → 0.8.169

package/rich-text/lib/core/utils/scrollRectIntoView.js

@@ -1,59 +0,0 @@
-/* 潘启宝 2026-06-17 16:03:05 星期三 山东省济南市 */
-//#region components/pc/rich-text/lib/core/utils/scrollRectIntoView.ts
-var e = (e) => e.parentElement || e.getRootNode().host || null, t = (e) => {
-	let t = e.getBoundingClientRect(), n = "offsetWidth" in e && Math.abs(t.width) / e.offsetWidth || 1, r = "offsetHeight" in e && Math.abs(t.height) / e.offsetHeight || 1;
-	return {
-		top: t.top,
-		right: t.left + e.clientWidth * n,
-		bottom: t.top + e.clientHeight * r,
-		left: t.left
-	};
-}, n = (e) => {
-	let t = parseInt(e, 10);
-	return Number.isNaN(t) ? 0 : t;
-}, r = (e, t, n, r, i, a) => e < n && t > r ? 0 : e < n ? -(n - e + i) : t > r ? t - e > r - n ? e + i - n : t - r + a : 0, i = (i, a, o = {}) => {
-	let s = i.ownerDocument, c = a, l = [], u = i;
-	for (; u;) {
-		let i = u === s.body, a = i ? {
-			top: 0,
-			right: window.visualViewport?.width ?? s.documentElement.clientWidth,
-			bottom: window.visualViewport?.height ?? s.documentElement.clientHeight,
-			left: 0
-		} : t(u), o = getComputedStyle(u), d = r(c.left, c.right, a.left, a.right, n(o.scrollPaddingLeft), n(o.scrollPaddingRight)), f = r(c.top, c.bottom, a.top, a.bottom, n(o.scrollPaddingTop), n(o.scrollPaddingBottom));
-		if (d || f) if (i) s.defaultView && (l.push({
-			element: s.defaultView,
-			left: d,
-			top: f
-		}), s.defaultView.scrollBy(d, f));
-		else {
-			let { scrollLeft: e, scrollTop: t } = u;
-			f && (u.scrollTop += f), d && (u.scrollLeft += d), l.push({
-				element: u,
-				left: d,
-				top: f
-			});
-			let n = u.scrollLeft - e, r = u.scrollTop - t;
-			c = {
-				left: c.left - n,
-				top: c.top - r,
-				right: c.right - n,
-				bottom: c.bottom - r
-			};
-		}
-		u = i || o.position === "fixed" ? null : e(u);
-	}
-	o.smooth && l.forEach(({ element: e, top: t, left: n }) => {
-		e.scrollBy({
-			top: -t,
-			left: -n,
-			behavior: "instant"
-		}), e.scrollBy({
-			top: t,
-			left: n,
-			behavior: "smooth"
-		});
-	});
-};
-//#endregion
-export { i as default };
-/* 独立思考，明辨是非 */

package/rich-text/lib/delta/AttributeMap.js

@@ -1,37 +0,0 @@
-/* 潘启宝 2026-06-17 16:03:05 星期三 山东省济南市 */
-import { isEqual as e, isObjectLike as t, isUndefined as n } from "../../../utils/is.js";
-import r from "lodash/cloneDeep";
-//#region components/pc/rich-text/lib/delta/AttributeMap.ts
-function i(e = {}, i = {}, a = !1) {
-	t(e) || (e = {}), t(i) || (i = {});
-	let o = r(i);
-	a || (o = Object.keys(o).reduce((e, t) => (o[t] != null && (e[t] = o[t]), e), {}));
-	for (let t in e) !n(e[t]) && n(i[t]) && (o[t] = e[t]);
-	return Object.keys(o).length > 0 ? o : void 0;
-}
-function a(r = {}, i = {}) {
-	t(r) || (r = {}), t(i) || (i = {});
-	let a = Object.keys(r).concat(Object.keys(i)).reduce((t, a) => (e(r[a], i[a]) || (t[a] = n(i[a]) ? null : i[a]), t), {});
-	return Object.keys(a).length > 0 ? a : void 0;
-}
-function o(e = {}, t = {}) {
-	e ||= {};
-	let r = Object.keys(t).reduce((r, i) => (t[i] !== e[i] && !n(e[i]) && (r[i] = t[i]), r), {});
-	return Object.keys(e).reduce((r, i) => (e[i] !== t[i] && n(t[i]) && (r[i] = null), r), r);
-}
-function s(e, r, i = !1) {
-	if (!t(e)) return r;
-	if (!t(e)) return;
-	if (!i) return r;
-	let a = Object.keys(r).reduce((t, i) => (n(e[i]) && (t[i] = r[i]), t), {});
-	return Object.keys(a).length > 0 ? a : void 0;
-}
-var c = {
-	compose: i,
-	diff: a,
-	invert: o,
-	transform: s
-};
-//#endregion
-export { c as default };
-/* 独立思考，明辨是非 */

package/rich-text/lib/delta/Op.js

@@ -1,10 +0,0 @@
-/* 潘启宝 2026-06-17 16:03:05 星期三 山东省济南市 */
-import { isNumber as e, isObjectLike as t, isString as n } from "../../../utils/is.js";
-//#region components/pc/rich-text/lib/delta/Op.ts
-function r(r) {
-	return e(r.delete) ? r.delete : e(r.retain) ? r.retain : t(r.retain) ? 1 : n(r.insert) ? r.insert.length : 1;
-}
-var i = { length: r };
-//#endregion
-export { i as default };
-/* 独立思考，明辨是非 */

package/rich-text/lib/delta/OpIterator.js

@@ -1,45 +0,0 @@
-/* 潘启宝 2026-06-17 16:03:05 星期三 山东省济南市 */
-import { isNumber as e, isObjectLike as t, isString as n } from "../../../utils/is.js";
-import r from "./Op.js";
-//#region components/pc/rich-text/lib/delta/OpIterator.ts
-var i = class {
-	constructor(e) {
-		this.ops = e, this.index = 0, this.offset = 0;
-	}
-	hasNext() {
-		return this.peekLength() < Infinity;
-	}
-	next(i) {
-		i ||= Infinity;
-		let a = this.ops[this.index];
-		if (a) {
-			let o = this.offset, s = r.length(a);
-			if (i >= s - o ? (i = s - o, this.index += 1, this.offset = 0) : this.offset += i, e(a.delete)) return { delete: i };
-			{
-				let r = {};
-				return a.attributes && (r.attributes = a.attributes), e(a.retain) ? r.retain = i : t(a.retain) ? r.retain = a.retain : n(a.insert) ? r.insert = a.insert.substring(o, o + i) : r.insert = a.insert, r;
-			}
-		} else return { retain: Infinity };
-	}
-	peek() {
-		return this.ops[this.index];
-	}
-	peekLength() {
-		return this.ops[this.index] ? r.length(this.ops[this.index]) - this.offset : Infinity;
-	}
-	peekType() {
-		let n = this.ops[this.index];
-		return n ? e(n.delete) ? "delete" : e(n.retain) || t(n.retain) ? "retain" : "insert" : "retain";
-	}
-	rest() {
-		if (!this.hasNext()) return [];
-		if (this.offset === 0) return this.ops.slice(this.index);
-		{
-			let e = this.offset, t = this.index, n = this.next(), r = this.ops.slice(this.index);
-			return this.offset = e, this.index = t, [n].concat(r);
-		}
-	}
-};
-//#endregion
-export { i as default };
-/* 独立思考，明辨是非 */

package/rich-text/lib/delta/index.js

@@ -1,235 +0,0 @@
-/* 潘启宝 2026-06-17 16:03:05 星期三 山东省济南市 */
-import { isArray as e, isEqual as t, isNumber as n, isObjectLike as r, isString as i } from "../../../utils/is.js";
-import a from "../diff/index.js";
-import o from "./AttributeMap.js";
-import s from "./Op.js";
-import c from "./OpIterator.js";
-import l from "lodash/cloneDeep";
-//#region components/pc/rich-text/lib/delta/index.ts
-var u = "\0", d = (e, t) => {
-	if (!r(e)) throw Error(`cannot retain a ${typeof e}`);
-	if (!r(t)) throw Error(`cannot retain a ${typeof t}`);
-	let n = Object.keys(e)[0];
-	if (!n || n !== Object.keys(t)[0]) throw Error(`embed types not matched: ${n} != ${Object.keys(t)[0]}`);
-	return [
-		n,
-		e[n],
-		t[n]
-	];
-}, f = class f {
-	static {
-		this.Op = s;
-	}
-	static {
-		this.OpIterator = c;
-	}
-	static {
-		this.AttributeMap = o;
-	}
-	static #e = {};
-	static registerEmbed(e, t) {
-		this.#e[e] = t;
-	}
-	static unregisterEmbed(e) {
-		delete this.#e[e];
-	}
-	static #t(e) {
-		let t = this.#e[e];
-		if (!t) throw Error(`no handlers for embed type "${e}"`);
-		return t;
-	}
-	constructor(t) {
-		e(t) ? this.ops = t : t != null && e(t.ops) ? this.ops = t.ops : this.ops = [];
-	}
-	insert(e, t) {
-		let n = {};
-		return i(e) && e.length === 0 ? this : (n.insert = e, r(t) && Object.keys(t).length > 0 && (n.attributes = t), this.push(n));
-	}
-	delete(e) {
-		return e <= 0 ? this : this.push({ delete: e });
-	}
-	retain(e, t) {
-		if (n(e) && e <= 0) return this;
-		let i = { retain: e };
-		return r(t) && Object.keys(t).length > 0 && (i.attributes = t), this.push(i);
-	}
-	push(e) {
-		let a = this.ops.length, o = this.ops[a - 1];
-		if (e = l(e), r(o)) {
-			if (n(e.delete) && n(o.delete)) return this.ops[a - 1] = { delete: o.delete + e.delete }, this;
-			if (n(o.delete) && e.insert != null && (--a, o = this.ops[a - 1], !r(o))) return this.ops.unshift(e), this;
-			if (t(e.attributes, o.attributes)) {
-				if (i(e.insert) && i(o.insert)) return this.ops[a - 1] = { insert: o.insert + e.insert }, r(e.attributes) && (this.ops[a - 1].attributes = e.attributes), this;
-				if (n(e.retain) && n(o.retain)) return this.ops[a - 1] = { retain: o.retain + e.retain }, r(e.attributes) && (this.ops[a - 1].attributes = e.attributes), this;
-			}
-		}
-		return a === this.ops.length ? this.ops.push(e) : this.ops.splice(a, 0, e), this;
-	}
-	chop() {
-		let e = this.ops[this.ops.length - 1];
-		return e && n(e.retain) && !e.attributes && this.ops.pop(), this;
-	}
-	filter(e) {
-		return this.ops.filter(e);
-	}
-	forEach(e) {
-		this.ops.forEach(e);
-	}
-	map(e) {
-		return this.ops.map(e);
-	}
-	partition(e) {
-		let t = [], n = [];
-		return this.forEach((r) => {
-			(e(r) ? t : n).push(r);
-		}), [t, n];
-	}
-	reduce(e, t) {
-		return this.ops.reduce(e, t);
-	}
-	changeLength() {
-		return this.reduce((e, t) => t.insert ? e + s.length(t) : t.delete ? e - t.delete : e, 0);
-	}
-	length() {
-		return this.reduce((e, t) => e + s.length(t), 0);
-	}
-	slice(e = 0, t = Infinity) {
-		let n = [], r = new c(this.ops), i = 0;
-		for (; i < t && r.hasNext();) {
-			let a;
-			i < e ? a = r.next(e - i) : (a = r.next(t - i), n.push(a)), i += s.length(a);
-		}
-		return new f(n);
-	}
-	compose(e) {
-		let i = new c(this.ops), a = new c(e.ops), s = [], l = a.peek();
-		if (l != null && n(l.retain) && l.attributes == null) {
-			let e = l.retain;
-			for (; i.peekType() === "insert" && i.peekLength() <= e;) e -= i.peekLength(), s.push(i.next());
-			l.retain - e > 0 && a.next(l.retain - e);
-		}
-		let u = new f(s);
-		for (; i.hasNext() || a.hasNext();) if (a.peekType() === "insert") u.push(a.next());
-		else if (i.peekType() === "delete") u.push(i.next());
-		else {
-			let e = Math.min(i.peekLength(), a.peekLength()), s = i.next(e), c = a.next(e);
-			if (c.retain) {
-				let r = {};
-				if (n(s.retain)) r.retain = n(c.retain) ? e : c.retain;
-				else if (n(c.retain)) s.retain == null ? r.insert = s.insert : r.retain = s.retain;
-				else {
-					let e = s.retain == null ? "insert" : "retain", [t, n, i] = d(s[e], c.retain), a = f.#t(t);
-					r[e] = { [t]: a.compose(n, i, e === "retain") };
-				}
-				let l = o.compose(s.attributes, c.attributes, n(s.retain));
-				if (l && (r.attributes = l), u.push(r), !a.hasNext() && t(u.ops[u.ops.length - 1], r)) {
-					let e = new f(i.rest());
-					return u.concat(e).chop();
-				}
-			} else n(c.delete) && (n(s.retain) || r(s.retain)) && u.push(c);
-		}
-		return u.chop();
-	}
-	concat(e) {
-		let t = new f(this.ops.slice());
-		return e.ops.length > 0 && (t.push(e.ops[0]), t.ops = t.ops.concat(e.ops.slice(1))), t;
-	}
-	diff(e, n) {
-		if (this.ops === e.ops) return new f();
-		let r = [this, e].map((t) => t.map((n) => {
-			if (n.insert != null) return i(n.insert) ? n.insert : u;
-			throw Error("diff() called " + (t === e ? "on" : "with") + " non-document");
-		}).join("")), s = new f(), l = a(r[0], r[1], n, !0), d = new c(this.ops), p = new c(e.ops);
-		return l.forEach((e) => {
-			let n = e[1].length;
-			for (; n > 0;) {
-				let r = 0;
-				switch (e[0]) {
-					case a.INSERT:
-						r = Math.min(p.peekLength(), n), s.push(p.next(r));
-						break;
-					case a.DELETE:
-						r = Math.min(n, d.peekLength()), d.next(r), s.delete(r);
-						break;
-					case a.EQUAL: {
-						r = Math.min(d.peekLength(), p.peekLength(), n);
-						let e = d.next(r), i = p.next(r);
-						t(e.insert, i.insert) ? s.retain(r, o.diff(e.attributes, i.attributes)) : s.push(i).delete(r);
-						break;
-					}
-				}
-				n -= r;
-			}
-		}), s.chop();
-	}
-	eachLine(e, t = "\n") {
-		let n = new c(this.ops), r = new f(), a = 0;
-		for (; n.hasNext();) {
-			if (n.peekType() !== "insert") return;
-			let o = n.peek(), c = s.length(o) - n.peekLength(), l = i(o.insert) ? o.insert.indexOf(t, c) - c : -1;
-			if (l < 0) r.push(n.next());
-			else if (l > 0) r.push(n.next(l));
-			else {
-				if (e(r, n.next(1).attributes || {}, a) === !1) return;
-				a += 1, r = new f();
-			}
-		}
-		r.length() > 0 && e(r, {}, a);
-	}
-	invert(e) {
-		let t = new f();
-		return this.reduce((i, a) => {
-			if (a.insert) t.delete(s.length(a));
-			else if (n(a.retain) && a.attributes == null) return t.retain(a.retain), i + a.retain;
-			else if (a.delete || n(a.retain)) {
-				let n = a.delete || a.retain;
-				return e.slice(i, i + n).forEach((e) => {
-					a.delete ? t.push(e) : a.retain && a.attributes && t.retain(s.length(e), o.invert(a.attributes, e.attributes));
-				}), i + n;
-			} else if (r(a.retain)) {
-				let n = new c(e.slice(i, i + 1).ops).next(), [r, s, l] = d(a.retain, n.insert), u = f.#t(r);
-				return t.retain({ [r]: u.invert(s, l) }, o.invert(a.attributes, n.attributes)), i + 1;
-			}
-			return i;
-		}, 0), t.chop();
-	}
-	transform(e, t = !1) {
-		if (t = !!t, n(e)) return this.transformPosition(e, t);
-		let i = e, a = new c(this.ops), l = new c(i.ops), u = new f();
-		for (; a.hasNext() || l.hasNext();) if (a.peekType() === "insert" && (t || l.peekType() !== "insert")) u.retain(s.length(a.next()));
-		else if (l.peekType() === "insert") u.push(l.next());
-		else {
-			let e = Math.min(a.peekLength(), l.peekLength()), n = a.next(e), i = l.next(e);
-			if (n.delete) continue;
-			if (i.delete) u.push(i);
-			else {
-				let a = n.retain, s = i.retain, c = r(s) ? s : e;
-				if (r(a) && r(s)) {
-					let e = Object.keys(a)[0];
-					if (e === Object.keys(s)[0]) {
-						let n = f.#t(e);
-						n && (c = { [e]: n.transform(a[e], s[e], t) });
-					}
-				}
-				u.retain(c, o.transform(n.attributes, i.attributes, t));
-			}
-		}
-		return u.chop();
-	}
-	transformPosition(e, t = !1) {
-		t = !!t;
-		let n = new c(this.ops), r = 0;
-		for (; n.hasNext() && r <= e;) {
-			let i = n.peekLength(), a = n.peekType();
-			if (n.next(), a === "delete") {
-				e -= Math.min(i, e - r);
-				continue;
-			} else a === "insert" && (r < e || !t) && (e += i);
-			r += i;
-		}
-		return e;
-	}
-};
-//#endregion
-export { f as default };
-/* 独立思考，明辨是非 */

package/rich-text/lib/diff/index.js

@@ -1,285 +0,0 @@
-/* 潘启宝 2026-06-17 16:03:05 星期三 山东省济南市 */
-import { isNull as e, isNumber as t } from "../../../utils/is.js";
-function n(e, t, n, i, a) {
-	if (e === t) return e ? [[0, e]] : [];
-	if (n != null) {
-		let r = w(e, t, n);
-		if (r) return r;
-	}
-	let s = o(e, t), l = e.substring(0, s);
-	e = e.substring(s), t = t.substring(s), s = c(e, t);
-	let d = e.substring(e.length - s);
-	e = e.substring(0, e.length - s), t = t.substring(0, t.length - s);
-	let f = r(e, t);
-	return l && f.unshift([0, l]), d && f.push([0, d]), _(f, a), i && u(f), f;
-}
-function r(e, t) {
-	let r;
-	if (!e) return [[1, t]];
-	if (!t) return [[-1, e]];
-	let a = e.length > t.length ? e : t, o = e.length > t.length ? t : e, s = a.indexOf(o);
-	if (s !== -1) return r = [
-		[1, a.substring(0, s)],
-		[0, o],
-		[1, a.substring(s + o.length)]
-	], e.length > t.length && (r[0][0] = r[2][0] = -1), r;
-	if (o.length === 1) return [[-1, e], [1, t]];
-	let c = l(e, t);
-	if (c) {
-		let e = c[0], t = c[1], r = c[2], i = c[3], a = c[4], o = n(e, r), s = n(t, i);
-		return o.concat([[0, a]], s);
-	}
-	return i(e, t);
-}
-function i(e, t) {
-	let n = e.length, r = t.length, i = Math.ceil((n + r) / 2), o = i, s = 2 * i, c = Array(s), l = Array(s);
-	for (let e = 0; e < s; e++) c[e] = -1, l[e] = -1;
-	c[o + 1] = 0, l[o + 1] = 0;
-	let u = n - r, d = u % 2 != 0, f = 0, p = 0, m = 0, h = 0;
-	for (let g = 0; g < i; g++) {
-		for (let i = -g + f; i <= g - p; i += 2) {
-			let m = o + i, h;
-			h = i === -g || i !== g && c[m - 1] < c[m + 1] ? c[m + 1] : c[m - 1] + 1;
-			let _ = h - i;
-			for (; h < n && _ < r && e.charAt(h) === t.charAt(_);) h++, _++;
-			if (c[m] = h, h > n) p += 2;
-			else if (_ > r) f += 2;
-			else if (d) {
-				let r = o + u - i;
-				if (r >= 0 && r < s && l[r] !== -1) {
-					let i = n - l[r];
-					if (h >= i) return a(e, t, h, _);
-				}
-			}
-		}
-		for (let i = -g + m; i <= g - h; i += 2) {
-			let f = o + i, p;
-			p = i === -g || i !== g && l[f - 1] < l[f + 1] ? l[f + 1] : l[f - 1] + 1;
-			let _ = p - i;
-			for (; p < n && _ < r && e.charAt(n - p - 1) === t.charAt(r - _ - 1);) p++, _++;
-			if (l[f] = p, p > n) h += 2;
-			else if (_ > r) m += 2;
-			else if (!d) {
-				let r = o + u - i;
-				if (r >= 0 && r < s && c[r] !== -1) {
-					let i = c[r], s = o + i - r;
-					if (p = n - p, i >= p) return a(e, t, i, s);
-				}
-			}
-		}
-	}
-	return [[-1, e], [1, t]];
-}
-function a(e, t, r, i) {
-	let a = e.substring(0, r), o = t.substring(0, i), s = e.substring(r), c = t.substring(i), l = n(a, o), u = n(s, c);
-	return l.concat(u);
-}
-function o(e, t) {
-	if (!e || !t || e.charAt(0) !== t.charAt(0)) return 0;
-	let n = 0, r = Math.min(e.length, t.length), i = r, a = 0;
-	for (; n < i;) e.substring(a, i) == t.substring(a, i) ? (n = i, a = n) : r = i, i = Math.floor((r - n) / 2 + n);
-	return v(e.charCodeAt(i - 1)) && i--, i;
-}
-function s(e, t) {
-	let n = e.length, r = t.length;
-	if (n == 0 || r == 0) return 0;
-	n > r ? e = e.substring(n - r) : n < r && (t = t.substring(0, n));
-	let i = Math.min(n, r);
-	if (e == t) return i;
-	let a = 0, o = 1;
-	for (;;) {
-		let n = e.substring(i - o), r = t.indexOf(n);
-		if (r == -1) return a;
-		o += r, (r == 0 || e.substring(i - o) == t.substring(0, o)) && (a = o, o++);
-	}
-}
-function c(e, t) {
-	if (!e || !t || e.slice(-1) !== t.slice(-1)) return 0;
-	let n = 0, r = Math.min(e.length, t.length), i = r, a = 0;
-	for (; n < i;) e.substring(e.length - i, e.length - a) == t.substring(t.length - i, t.length - a) ? (n = i, a = n) : r = i, i = Math.floor((r - n) / 2 + n);
-	return y(e.charCodeAt(e.length - i)) && i--, i;
-}
-function l(e, t) {
-	let n = e.length > t.length ? e : t, r = e.length > t.length ? t : e;
-	if (n.length < 4 || r.length * 2 < n.length) return null;
-	function i(e, t, n) {
-		let r = e.substring(n, n + Math.floor(e.length / 4)), i = -1, a = "", s, l, u, d;
-		for (; (i = t.indexOf(r, i + 1)) !== -1;) {
-			let r = o(e.substring(n), t.substring(i)), f = c(e.substring(0, n), t.substring(0, i));
-			a.length < f + r && (a = t.substring(i - f, i) + t.substring(i, i + r), s = e.substring(0, n - f), l = e.substring(n + r), u = t.substring(0, i - f), d = t.substring(i + r));
-		}
-		return a.length * 2 >= e.length ? [
-			s,
-			l,
-			u,
-			d,
-			a
-		] : null;
-	}
-	let a = i(n, r, Math.ceil(n.length / 4)), s = i(n, r, Math.ceil(n.length / 2)), l;
-	if (!a && !s) return null;
-	l = s ? a && a[4].length > s[4].length ? a : s : a;
-	let u, d, f, p;
-	e.length > t.length ? (u = l[0], d = l[1], f = l[2], p = l[3]) : (f = l[0], p = l[1], u = l[2], d = l[3]);
-	let m = l[4];
-	return [
-		u,
-		d,
-		f,
-		p,
-		m
-	];
-}
-function u(e) {
-	let t = !1, n = [], r = 0, i = null, a = 0, o = 0, c = 0, l = 0, u = 0;
-	for (; a < e.length;) e[a][0] == 0 ? (n[r++] = a, o = l, c = u, l = 0, u = 0, i = e[a][1]) : (e[a][0] == 1 ? l += e[a][1].length : u += e[a][1].length, i && i.length <= Math.max(o, c) && i.length <= Math.max(l, u) && (e.splice(n[r - 1], 0, [-1, i]), e[n[r - 1] + 1][0] = 1, r--, r--, a = r > 0 ? n[r - 1] : -1, o = 0, c = 0, l = 0, u = 0, i = null, t = !0)), a++;
-	for (t && _(e), g(e), a = 1; a < e.length;) {
-		if (e[a - 1][0] == -1 && e[a][0] == 1) {
-			let t = e[a - 1][1], n = e[a][1], r = s(t, n), i = s(n, t);
-			r >= i ? (r >= t.length / 2 || r >= n.length / 2) && (e.splice(a, 0, [0, n.substring(0, r)]), e[a - 1][1] = t.substring(0, t.length - r), e[a + 1][1] = n.substring(r), a++) : (i >= t.length / 2 || i >= n.length / 2) && (e.splice(a, 0, [0, t.substring(0, i)]), e[a - 1][0] = 1, e[a - 1][1] = n.substring(0, n.length - i), e[a + 1][0] = -1, e[a + 1][1] = t.substring(i), a++), a++;
-		}
-		a++;
-	}
-}
-var d = /[^a-zA-Z0-9]/, f = /\s/, p = /[\r\n]/, m = /\n\r?\n$/, h = /^\r?\n\r?\n/;
-function g(e) {
-	function t(e, t) {
-		if (!e || !t) return 6;
-		let n = e.charAt(e.length - 1), r = t.charAt(0), i = n.match(d), a = r.match(d), o = i && n.match(f), s = a && r.match(f), c = o && n.match(p), l = s && r.match(p), u = c && e.match(m), g = l && t.match(h);
-		return u || g ? 5 : c || l ? 4 : i && !o && s ? 3 : o || s ? 2 : i || a ? 1 : 0;
-	}
-	let n = 1;
-	for (; n < e.length - 1;) {
-		if (e[n - 1][0] == 0 && e[n + 1][0] == 0) {
-			let r = e[n - 1][1], i = e[n][1], a = e[n + 1][1], o = c(r, i);
-			if (o) {
-				let e = i.substring(i.length - o);
-				r = r.substring(0, r.length - o), i = e + i.substring(0, i.length - o), a = e + a;
-			}
-			let s = r, l = i, u = a, d = t(r, i) + t(i, a);
-			for (; i.charAt(0) === a.charAt(0);) {
-				r += i.charAt(0), i = i.substring(1) + a.charAt(0), a = a.substring(1);
-				let e = t(r, i) + t(i, a);
-				e >= d && (d = e, s = r, l = i, u = a);
-			}
-			e[n - 1][1] != s && (s ? e[n - 1][1] = s : (e.splice(n - 1, 1), n--), e[n][1] = l, u ? e[n + 1][1] = u : (e.splice(n + 1, 1), n--));
-		}
-		n++;
-	}
-}
-function _(e, t) {
-	e.push([0, ""]);
-	let n = 0, r = 0, i = 0, a = "", s = "", l;
-	for (; n < e.length;) {
-		if (n < e.length - 1 && !e[n][1]) {
-			e.splice(n, 1);
-			continue;
-		}
-		switch (e[n][0]) {
-			case 1:
-				i++, s += e[n][1], n++;
-				break;
-			case -1:
-				r++, a += e[n][1], n++;
-				break;
-			case 0: {
-				let u = n - i - r - 1;
-				if (t) {
-					if (u >= 0 && x(e[u][1])) {
-						let t = e[u][1].slice(-1);
-						if (e[u][1] = e[u][1].slice(0, -1), a = t + a, s = t + s, !e[u][1]) {
-							e.splice(u, 1), n--;
-							let t = u - 1;
-							e[t] && e[t][0] === 1 && (i++, s = e[t][1] + s, t--), e[t] && e[t][0] === -1 && (r++, a = e[t][1] + a, t--), u = t;
-						}
-					}
-					if (b(e[n][1])) {
-						let t = e[n][1].charAt(0);
-						e[n][1] = e[n][1].slice(1), a += t, s += t;
-					}
-				}
-				if (n < e.length - 1 && !e[n][1]) {
-					e.splice(n, 1);
-					break;
-				}
-				if (a.length > 0 || s.length > 0) {
-					a.length > 0 && s.length > 0 && (l = o(s, a), l !== 0 && (u >= 0 ? e[u][1] += s.substring(0, l) : (e.splice(0, 0, [0, s.substring(0, l)]), n++), s = s.substring(l), a = a.substring(l)), l = c(s, a), l !== 0 && (e[n][1] = s.substring(s.length - l) + e[n][1], s = s.substring(0, s.length - l), a = a.substring(0, a.length - l)));
-					let t = i + r;
-					a.length === 0 && s.length === 0 ? (e.splice(n - t, t), n -= t) : a.length === 0 ? (e.splice(n - t, t, [1, s]), n = n - t + 1) : s.length === 0 ? (e.splice(n - t, t, [-1, a]), n = n - t + 1) : (e.splice(n - t, t, [-1, a], [1, s]), n = n - t + 2);
-				}
-				n !== 0 && e[n - 1][0] === 0 ? (e[n - 1][1] += e[n][1], e.splice(n, 1)) : n++, i = 0, r = 0, a = "", s = "";
-				break;
-			}
-		}
-	}
-	e[e.length - 1][1] === "" && e.pop();
-	let u = !1;
-	for (n = 1; n < e.length - 1;) e[n - 1][0] === 0 && e[n + 1][0] === 0 && (e[n][1].substring(e[n][1].length - e[n - 1][1].length) === e[n - 1][1] ? (e[n][1] = e[n - 1][1] + e[n][1].substring(0, e[n][1].length - e[n - 1][1].length), e[n + 1][1] = e[n - 1][1] + e[n + 1][1], e.splice(n - 1, 1), u = !0) : e[n][1].substring(0, e[n + 1][1].length) == e[n + 1][1] && (e[n - 1][1] += e[n + 1][1], e[n][1] = e[n][1].substring(e[n + 1][1].length) + e[n + 1][1], e.splice(n + 1, 1), u = !0)), n++;
-	u && _(e, t);
-}
-function v(e) {
-	return e >= 55296 && e <= 56319;
-}
-function y(e) {
-	return e >= 56320 && e <= 57343;
-}
-function b(e) {
-	return y(e.charCodeAt(0));
-}
-function x(e) {
-	return v(e.charCodeAt(e.length - 1));
-}
-function S(e) {
-	let t = [];
-	for (let n = 0; n < e.length; n++) e[n][1].length > 0 && t.push(e[n]);
-	return t;
-}
-function C(e, t, n, r) {
-	return x(e) || b(r) ? null : S([
-		[0, e],
-		[-1, t],
-		[1, n],
-		[0, r]
-	]);
-}
-function w(n, r, i) {
-	let a = t(i) ? {
-		index: i,
-		length: 0
-	} : i.oldRange, o = t(i) ? null : i.newRange, s = n.length, c = r.length;
-	if (a.length === 0 && (e(o) || o.length === 0)) {
-		let t = a.index, i = n.slice(0, t), l = n.slice(t), u = o ? o.index : null;
-		editBefore: {
-			let n = t + c - s;
-			if (!e(u) && u !== n || n < 0 || n > c) break editBefore;
-			let a = r.slice(0, n);
-			if (r.slice(n) !== l) break editBefore;
-			let o = Math.min(t, n), d = i.slice(0, o);
-			if (d !== a.slice(0, o)) break editBefore;
-			return C(d, i.slice(o), a.slice(o), l);
-		}
-		editAfter: {
-			if (!e(u) && u !== t) break editAfter;
-			let n = t, a = r.slice(0, n), o = r.slice(n);
-			if (a !== i) break editAfter;
-			let d = Math.min(s - n, c - n), f = l.slice(l.length - d);
-			if (f !== o.slice(o.length - d)) break editAfter;
-			return C(i, l.slice(0, l.length - d), o.slice(0, o.length - d), f);
-		}
-	}
-	if (a.length > 0 && o?.length === 0) replaceRange: {
-		let e = n.slice(0, a.index), t = n.slice(a.index + a.length), i = e.length, o = t.length;
-		if (c < i + o) break replaceRange;
-		let l = r.slice(0, i), u = r.slice(c - o);
-		if (e !== l || t !== u) break replaceRange;
-		return C(e, n.slice(i, s - o), r.slice(i, c - o), t);
-	}
-	return null;
-}
-function T(e, t, r, i) {
-	return n(e, t, r, i, !0);
-}
-T.INSERT = 1, T.DELETE = -1, T.EQUAL = 0;
-//#endregion
-export { T as default };
-/* 独立思考，明辨是非 */

package/rich-text/lib/formats/align.js

@@ -1,20 +0,0 @@
-/* 潘启宝 2026-06-17 16:03:05 星期三 山东省济南市 */
-import { RICH_TEXT_CLASS_NAME_PREFIX as e } from "../../constant.js";
-import t from "../parchment/scope.js";
-import n from "../parchment/attributor/attributor.js";
-import r from "../parchment/attributor/class.js";
-import i from "../parchment/attributor/style.js";
-import "../parchment/index.js";
-//#region components/pc/rich-text/lib/formats/align.ts
-var a = {
-	scope: t.BLOCK,
-	whitelist: [
-		"left",
-		"right",
-		"center",
-		"justify"
-	]
-}, o = "align", s = new n(o, "align", a), c = new r(o, `${e}-align`, a), l = new i(o, "text-align", a);
-//#endregion
-export { s as AlignAttribute, c as AlignClass, l as AlignStyle, o as attrName };
-/* 独立思考，明辨是非 */