@unicom-cloud/ui 0.8.150 → 0.8.152

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

@@ -1,383 +1,285 @@
-/* 2026-03-04 15:09:50 */
-import { isNumber as C } from "@unicom-cloud/ui-common/utils/is";
-let L = -1, w = 1, A = 0;
-function y(e, n, l, r, i) {
-  if (e === n)
-    return e ? [[A, e]] : [];
-  if (l != null) {
-    let a = d(e, n, l);
-    if (a)
-      return a;
-  }
-  let t = D(e, n), h = e.substring(0, t);
-  e = e.substring(t), n = n.substring(t), t = N(e, n);
-  let g = e.substring(e.length - t);
-  e = e.substring(0, e.length - t), n = n.substring(0, n.length - t);
-  let s = H(e, n);
-  return h && s.unshift([A, h]), g && s.push([A, g]), F(s, i), r && V(s), s;
+/* 潘启宝 2026-03-24 16:29:04 星期二 */
+import { isNumber as e } from "../../../utils/is.js";
+function t(e, t, r, i, o) {
+	if (e === t) return e ? [[0, e]] : [];
+	if (r != null) {
+		let n = C(e, t, r);
+		if (n) return n;
+	}
+	let c = a(e, t), u = e.substring(0, c);
+	e = e.substring(c), t = t.substring(c), c = s(e, t);
+	let d = e.substring(e.length - c);
+	e = e.substring(0, e.length - c), t = t.substring(0, t.length - c);
+	let f = n(e, t);
+	return u && f.unshift([0, u]), d && f.push([0, d]), g(f, o), i && l(f), f;
 }
-function H(e, n) {
-  let l;
-  if (!e)
-    return [[w, n]];
-  if (!n)
-    return [[L, e]];
-  let r = e.length > n.length ? e : n, i = e.length > n.length ? n : e, t = r.indexOf(i);
-  if (t !== -1)
-    return l = [
-      [w, r.substring(0, t)],
-      [A, i],
-      [w, r.substring(t + i.length)]
-    ], e.length > n.length && (l[0][0] = l[2][0] = L), l;
-  if (i.length === 1)
-    return [
-      [L, e],
-      [w, n]
-    ];
-  let h = K(e, n);
-  if (h) {
-    let g = h[0], s = h[1], a = h[2], u = h[3], c = h[4], k = y(g, a), b = y(s, u);
-    return k.concat([[A, c]], b);
-  }
-  return J(e, n);
+function n(e, n) {
+	let i;
+	if (!e) return [[1, n]];
+	if (!n) return [[-1, e]];
+	let a = e.length > n.length ? e : n, o = e.length > n.length ? n : e, s = a.indexOf(o);
+	if (s !== -1) return i = [
+		[1, a.substring(0, s)],
+		[0, o],
+		[1, a.substring(s + o.length)]
+	], e.length > n.length && (i[0][0] = i[2][0] = -1), i;
+	if (o.length === 1) return [[-1, e], [1, n]];
+	let l = c(e, n);
+	if (l) {
+		let e = l[0], n = l[1], r = l[2], i = l[3], a = l[4], o = t(e, r), s = t(n, i);
+		return o.concat([[0, a]], s);
+	}
+	return r(e, n);
 }
-function J(e, n) {
-  let l = e.length, r = n.length, i = Math.ceil((l + r) / 2), t = i, h = 2 * i, g = new Array(h), s = new Array(h);
-  for (let _ = 0; _ < h; _++)
-    g[_] = -1, s[_] = -1;
-  g[t + 1] = 0, s[t + 1] = 0;
-  let a = l - r, u = a % 2 !== 0, c = 0, k = 0, b = 0, p = 0;
-  for (let _ = 0; _ < i; _++) {
-    for (let f = -_ + c; f <= _ - k; f += 2) {
-      let m = t + f, o;
-      f === -_ || f !== _ && g[m - 1] < g[m + 1] ? o = g[m + 1] : o = g[m - 1] + 1;
-      let M = o - f;
-      for (; o < l && M < r && e.charAt(o) === n.charAt(M); )
-        o++, M++;
-      if (g[m] = o, o > l)
-        k += 2;
-      else if (M > r)
-        c += 2;
-      else if (u) {
-        let E = t + a - f;
-        if (E >= 0 && E < h && s[E] !== -1) {
-          let S = l - s[E];
-          if (o >= S)
-            return O(e, n, o, M);
-        }
-      }
-    }
-    for (let f = -_ + b; f <= _ - p; f += 2) {
-      let m = t + f, o;
-      f === -_ || f !== _ && s[m - 1] < s[m + 1] ? o = s[m + 1] : o = s[m - 1] + 1;
-      let M = o - f;
-      for (; o < l && M < r && e.charAt(l - o - 1) === n.charAt(r - M - 1); )
-        o++, M++;
-      if (s[m] = o, o > l)
-        p += 2;
-      else if (M > r)
-        b += 2;
-      else if (!u) {
-        let E = t + a - f;
-        if (E >= 0 && E < h && g[E] !== -1) {
-          let S = g[E], R = t + S - E;
-          if (o = l - o, S >= o)
-            return O(e, n, S, R);
-        }
-      }
-    }
-  }
-  return [
-    [L, e],
-    [w, n]
-  ];
+function r(e, t) {
+	let n = e.length, r = t.length, a = Math.ceil((n + r) / 2), o = a, s = 2 * a, 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 < a; g++) {
+		for (let a = -g + f; a <= g - p; a += 2) {
+			let m = o + a, h;
+			h = a === -g || a !== g && c[m - 1] < c[m + 1] ? c[m + 1] : c[m - 1] + 1;
+			let _ = h - a;
+			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 - a;
+				if (r >= 0 && r < s && l[r] !== -1) {
+					let a = n - l[r];
+					if (h >= a) return i(e, t, h, _);
+				}
+			}
+		}
+		for (let a = -g + m; a <= g - h; a += 2) {
+			let f = o + a, p;
+			p = a === -g || a !== g && l[f - 1] < l[f + 1] ? l[f + 1] : l[f - 1] + 1;
+			let _ = p - a;
+			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 - a;
+				if (r >= 0 && r < s && c[r] !== -1) {
+					let a = c[r], s = o + a - r;
+					if (p = n - p, a >= p) return i(e, t, a, s);
+				}
+			}
+		}
+	}
+	return [[-1, e], [1, t]];
 }
-function O(e, n, l, r) {
-  let i = e.substring(0, l), t = n.substring(0, r), h = e.substring(l), g = n.substring(r), s = y(i, t), a = y(h, g);
-  return s.concat(a);
+function i(e, n, r, i) {
+	let a = e.substring(0, r), o = n.substring(0, i), s = e.substring(r), c = n.substring(i), l = t(a, o), u = t(s, c);
+	return l.concat(u);
 }
-function D(e, n) {
-  if (!e || !n || e.charAt(0) !== n.charAt(0))
-    return 0;
-  let l = 0, r = Math.min(e.length, n.length), i = r, t = 0;
-  for (; l < i; )
-    e.substring(t, i) == n.substring(t, i) ? (l = i, t = l) : r = i, i = Math.floor((r - l) / 2 + l);
-  return z(e.charCodeAt(i - 1)) && i--, i;
+function a(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 _(e.charCodeAt(i - 1)) && i--, i;
 }
-function P(e, n) {
-  let l = e.length, r = n.length;
-  if (l == 0 || r == 0)
-    return 0;
-  l > r ? e = e.substring(l - r) : l < r && (n = n.substring(0, l));
-  let i = Math.min(l, r);
-  if (e == n)
-    return i;
-  let t = 0, h = 1;
-  for (; ; ) {
-    let g = e.substring(i - h), s = n.indexOf(g);
-    if (s == -1)
-      return t;
-    h += s, (s == 0 || e.substring(i - h) == n.substring(0, h)) && (t = h, h++);
-  }
+function o(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 N(e, n) {
-  if (!e || !n || e.slice(-1) !== n.slice(-1))
-    return 0;
-  let l = 0, r = Math.min(e.length, n.length), i = r, t = 0;
-  for (; l < i; )
-    e.substring(e.length - i, e.length - t) == n.substring(n.length - i, n.length - t) ? (l = i, t = l) : r = i, i = Math.floor((r - l) / 2 + l);
-  return Z(e.charCodeAt(e.length - i)) && i--, i;
+function s(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 v(e.charCodeAt(e.length - i)) && i--, i;
 }
-function K(e, n) {
-  let l = e.length > n.length ? e : n, r = e.length > n.length ? n : e;
-  if (l.length < 4 || r.length * 2 < l.length)
-    return null;
-  function i(b, p, _) {
-    let f = b.substring(_, _ + Math.floor(b.length / 4)), m = -1, o = "", M, E, S, R;
-    for (; (m = p.indexOf(f, m + 1)) !== -1; ) {
-      let v = D(
-        b.substring(_),
-        p.substring(m)
-      ), q = N(
-        b.substring(0, _),
-        p.substring(0, m)
-      );
-      o.length < q + v && (o = p.substring(m - q, m) + p.substring(m, m + v), M = b.substring(0, _ - q), E = b.substring(_ + v), S = p.substring(0, m - q), R = p.substring(m + v));
-    }
-    return o.length * 2 >= b.length ? [
-      M,
-      E,
-      S,
-      R,
-      o
-    ] : null;
-  }
-  let t = i(
-    l,
-    r,
-    Math.ceil(l.length / 4)
-  ), h = i(
-    l,
-    r,
-    Math.ceil(l.length / 2)
-  ), g;
-  if (!t && !h)
-    return null;
-  h ? t ? g = t[4].length > h[4].length ? t : h : g = h : g = t;
-  let s, a, u, c;
-  e.length > n.length ? (s = g[0], a = g[1], u = g[2], c = g[3]) : (u = g[0], c = g[1], s = g[2], a = g[3]);
-  let k = g[4];
-  return [s, a, u, c, k];
+function c(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, o = "", c, l, u, d;
+		for (; (i = t.indexOf(r, i + 1)) !== -1;) {
+			let r = a(e.substring(n), t.substring(i)), f = s(e.substring(0, n), t.substring(0, i));
+			o.length < f + r && (o = t.substring(i - f, i) + t.substring(i, i + r), c = e.substring(0, n - f), l = e.substring(n + r), u = t.substring(0, i - f), d = t.substring(i + r));
+		}
+		return o.length * 2 >= e.length ? [
+			c,
+			l,
+			u,
+			d,
+			o
+		] : null;
+	}
+	let o = i(n, r, Math.ceil(n.length / 4)), c = i(n, r, Math.ceil(n.length / 2)), l;
+	if (!o && !c) return null;
+	l = c ? o && o[4].length > c[4].length ? o : c : o;
+	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 V(e) {
-  let n = !1, l = [], r = 0, i = null, t = 0, h = 0, g = 0, s = 0, a = 0;
-  for (; t < e.length; )
-    e[t][0] == A ? (l[r++] = t, h = s, g = a, s = 0, a = 0, i = e[t][1]) : (e[t][0] == w ? s += e[t][1].length : a += e[t][1].length, i && i.length <= Math.max(h, g) && i.length <= Math.max(s, a) && (e.splice(l[r - 1], 0, [
-      L,
-      i
-    ]), e[l[r - 1] + 1][0] = w, r--, r--, t = r > 0 ? l[r - 1] : -1, h = 0, g = 0, s = 0, a = 0, i = null, n = !0)), t++;
-  for (n && F(e), Y(e), t = 1; t < e.length; ) {
-    if (e[t - 1][0] == L && e[t][0] == w) {
-      let u = e[t - 1][1], c = e[t][1], k = P(u, c), b = P(c, u);
-      k >= b ? (k >= u.length / 2 || k >= c.length / 2) && (e.splice(t, 0, [
-        A,
-        c.substring(0, k)
-      ]), e[t - 1][1] = u.substring(
-        0,
-        u.length - k
-      ), e[t + 1][1] = c.substring(k), t++) : (b >= u.length / 2 || b >= c.length / 2) && (e.splice(t, 0, [
-        A,
-        u.substring(0, b)
-      ]), e[t - 1][0] = w, e[t - 1][1] = c.substring(
-        0,
-        c.length - b
-      ), e[t + 1][0] = L, e[t + 1][1] = u.substring(b), t++), t++;
-    }
-    t++;
-  }
+function l(e) {
+	let t = !1, n = [], r = 0, i = null, a = 0, s = 0, c = 0, l = 0, u = 0;
+	for (; a < e.length;) e[a][0] == 0 ? (n[r++] = a, s = 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(s, 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, s = 0, c = 0, l = 0, u = 0, i = null, t = !0)), a++;
+	for (t && g(e), h(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 = o(t, n), i = o(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++;
+	}
 }
-let Q = /[^a-zA-Z0-9]/, U = /\s/, j = /[\r\n]/, W = /\n\r?\n$/, X = /^\r?\n\r?\n/;
-function Y(e) {
-  function n(r, i) {
-    if (!r || !i)
-      return 6;
-    let t = r.charAt(r.length - 1), h = i.charAt(0), g = t.match(Q), s = h.match(Q), a = g && t.match(U), u = s && h.match(U), c = a && t.match(j), k = u && h.match(j), b = c && r.match(W), p = k && i.match(X);
-    return b || p ? 5 : c || k ? 4 : g && !a && u ? 3 : a || u ? 2 : g || s ? 1 : 0;
-  }
-  let l = 1;
-  for (; l < e.length - 1; ) {
-    if (e[l - 1][0] == A && e[l + 1][0] == A) {
-      let r = e[l - 1][1], i = e[l][1], t = e[l + 1][1], h = N(r, i);
-      if (h) {
-        let c = i.substring(i.length - h);
-        r = r.substring(0, r.length - h), i = c + i.substring(0, i.length - h), t = c + t;
-      }
-      let g = r, s = i, a = t, u = n(r, i) + n(i, t);
-      for (; i.charAt(0) === t.charAt(0); ) {
-        r += i.charAt(0), i = i.substring(1) + t.charAt(0), t = t.substring(1);
-        let c = n(r, i) + n(i, t);
-        c >= u && (u = c, g = r, s = i, a = t);
-      }
-      e[l - 1][1] != g && (g ? e[l - 1][1] = g : (e.splice(l - 1, 1), l--), e[l][1] = s, a ? e[l + 1][1] = a : (e.splice(l + 1, 1), l--));
-    }
-    l++;
-  }
+var u = /[^a-zA-Z0-9]/, d = /\s/, f = /[\r\n]/, p = /\n\r?\n$/, m = /^\r?\n\r?\n/;
+function h(e) {
+	function t(e, t) {
+		if (!e || !t) return 6;
+		let n = e.charAt(e.length - 1), r = t.charAt(0), i = n.match(u), a = r.match(u), o = i && n.match(d), s = a && r.match(d), c = o && n.match(f), l = s && r.match(f), h = c && e.match(p), g = l && t.match(m);
+		return h || 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 = s(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 c = 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, c = r, l = i, u = a);
+			}
+			e[n - 1][1] != c && (c ? e[n - 1][1] = c : (e.splice(n - 1, 1), n--), e[n][1] = l, u ? e[n + 1][1] = u : (e.splice(n + 1, 1), n--));
+		}
+		n++;
+	}
 }
-function F(e, n) {
-  e.push([A, ""]);
-  let l = 0, r = 0, i = 0, t = "", h = "", g;
-  for (; l < e.length; ) {
-    if (l < e.length - 1 && !e[l][1]) {
-      e.splice(l, 1);
-      continue;
-    }
-    switch (e[l][0]) {
-      case w: {
-        i++, h += e[l][1], l++;
-        break;
-      }
-      case L:
-        r++, t += e[l][1], l++;
-        break;
-      case A: {
-        let a = l - i - r - 1;
-        if (n) {
-          if (a >= 0 && G(e[a][1])) {
-            let u = e[a][1].slice(-1);
-            if (e[a][1] = e[a][1].slice(
-              0,
-              -1
-            ), t = u + t, h = u + h, !e[a][1]) {
-              e.splice(a, 1), l--;
-              let c = a - 1;
-              e[c] && e[c][0] === w && (i++, h = e[c][1] + h, c--), e[c] && e[c][0] === L && (r++, t = e[c][1] + t, c--), a = c;
-            }
-          }
-          if ($(e[l][1])) {
-            let u = e[l][1].charAt(0);
-            e[l][1] = e[l][1].slice(1), t += u, h += u;
-          }
-        }
-        if (l < e.length - 1 && !e[l][1]) {
-          e.splice(l, 1);
-          break;
-        }
-        if (t.length > 0 || h.length > 0) {
-          t.length > 0 && h.length > 0 && (g = D(h, t), g !== 0 && (a >= 0 ? e[a][1] += h.substring(
-            0,
-            g
-          ) : (e.splice(0, 0, [
-            A,
-            h.substring(0, g)
-          ]), l++), h = h.substring(g), t = t.substring(g)), g = N(h, t), g !== 0 && (e[l][1] = h.substring(h.length - g) + e[l][1], h = h.substring(
-            0,
-            h.length - g
-          ), t = t.substring(
-            0,
-            t.length - g
-          )));
-          let u = i + r;
-          t.length === 0 && h.length === 0 ? (e.splice(l - u, u), l = l - u) : t.length === 0 ? (e.splice(l - u, u, [w, h]), l = l - u + 1) : h.length === 0 ? (e.splice(l - u, u, [L, t]), l = l - u + 1) : (e.splice(
-            l - u,
-            u,
-            [L, t],
-            [w, h]
-          ), l = l - u + 2);
-        }
-        l !== 0 && e[l - 1][0] === A ? (e[l - 1][1] += e[l][1], e.splice(l, 1)) : l++, i = 0, r = 0, t = "", h = "";
-        break;
-      }
-    }
-  }
-  e[e.length - 1][1] === "" && e.pop();
-  let s = !1;
-  for (l = 1; l < e.length - 1; )
-    e[l - 1][0] === A && e[l + 1][0] === A && (e[l][1].substring(
-      e[l][1].length - e[l - 1][1].length
-    ) === e[l - 1][1] ? (e[l][1] = e[l - 1][1] + e[l][1].substring(
-      0,
-      e[l][1].length - e[l - 1][1].length
-    ), e[l + 1][1] = e[l - 1][1] + e[l + 1][1], e.splice(l - 1, 1), s = !0) : e[l][1].substring(0, e[l + 1][1].length) == e[l + 1][1] && (e[l - 1][1] += e[l + 1][1], e[l][1] = e[l][1].substring(e[l + 1][1].length) + e[l + 1][1], e.splice(l + 1, 1), s = !0)), l++;
-  s && F(e, n);
+function g(e, t) {
+	e.push([0, ""]);
+	let n = 0, r = 0, i = 0, o = "", c = "", 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++, c += e[n][1], n++;
+				break;
+			case -1:
+				r++, o += e[n][1], n++;
+				break;
+			case 0: {
+				let u = n - i - r - 1;
+				if (t) {
+					if (u >= 0 && b(e[u][1])) {
+						let t = e[u][1].slice(-1);
+						if (e[u][1] = e[u][1].slice(0, -1), o = t + o, c = t + c, !e[u][1]) {
+							e.splice(u, 1), n--;
+							let t = u - 1;
+							e[t] && e[t][0] === 1 && (i++, c = e[t][1] + c, t--), e[t] && e[t][0] === -1 && (r++, o = e[t][1] + o, t--), u = t;
+						}
+					}
+					if (y(e[n][1])) {
+						let t = e[n][1].charAt(0);
+						e[n][1] = e[n][1].slice(1), o += t, c += t;
+					}
+				}
+				if (n < e.length - 1 && !e[n][1]) {
+					e.splice(n, 1);
+					break;
+				}
+				if (o.length > 0 || c.length > 0) {
+					o.length > 0 && c.length > 0 && (l = a(c, o), l !== 0 && (u >= 0 ? e[u][1] += c.substring(0, l) : (e.splice(0, 0, [0, c.substring(0, l)]), n++), c = c.substring(l), o = o.substring(l)), l = s(c, o), l !== 0 && (e[n][1] = c.substring(c.length - l) + e[n][1], c = c.substring(0, c.length - l), o = o.substring(0, o.length - l)));
+					let t = i + r;
+					o.length === 0 && c.length === 0 ? (e.splice(n - t, t), n -= t) : o.length === 0 ? (e.splice(n - t, t, [1, c]), n = n - t + 1) : c.length === 0 ? (e.splice(n - t, t, [-1, o]), n = n - t + 1) : (e.splice(n - t, t, [-1, o], [1, c]), 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, o = "", c = "";
+				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 && g(e, t);
 }
-function z(e) {
-  return e >= 55296 && e <= 56319;
+function _(e) {
+	return e >= 55296 && e <= 56319;
 }
-function Z(e) {
-  return e >= 56320 && e <= 57343;
+function v(e) {
+	return e >= 56320 && e <= 57343;
 }
-function $(e) {
-  return Z(e.charCodeAt(0));
+function y(e) {
+	return v(e.charCodeAt(0));
 }
-function G(e) {
-  return z(e.charCodeAt(e.length - 1));
+function b(e) {
+	return _(e.charCodeAt(e.length - 1));
 }
-function T(e) {
-  let n = [];
-  for (let l = 0; l < e.length; l++)
-    e[l][1].length > 0 && n.push(e[l]);
-  return n;
+function x(e) {
+	let t = [];
+	for (let n = 0; n < e.length; n++) e[n][1].length > 0 && t.push(e[n]);
+	return t;
 }
-function I(e, n, l, r) {
-  return G(e) || $(r) ? null : T([
-    [A, e],
-    [L, n],
-    [w, l],
-    [A, r]
-  ]);
+function S(e, t, n, r) {
+	return b(e) || y(r) ? null : x([
+		[0, e],
+		[-1, t],
+		[1, n],
+		[0, r]
+	]);
 }
-function d(e, n, l) {
-  let r = C(l) ? { index: l, length: 0 } : l.oldRange, i = C(l) ? null : l.newRange, t = e.length, h = n.length;
-  if (r.length === 0 && (i === null || i.length === 0)) {
-    let g = r.index, s = e.slice(0, g), a = e.slice(g), u = i ? i.index : null;
-    e: {
-      let c = g + h - t;
-      if (u !== null && u !== c || c < 0 || c > h)
-        break e;
-      let k = n.slice(0, c);
-      if (n.slice(c) !== a)
-        break e;
-      let p = Math.min(g, c), _ = s.slice(0, p), f = k.slice(0, p);
-      if (_ !== f)
-        break e;
-      let m = s.slice(p), o = k.slice(p);
-      return I(_, m, o, a);
-    }
-    e: {
-      if (u !== null && u !== g)
-        break e;
-      let c = g, k = n.slice(0, c), b = n.slice(c);
-      if (k !== s)
-        break e;
-      let p = Math.min(t - c, h - c), _ = a.slice(a.length - p), f = b.slice(b.length - p);
-      if (_ !== f)
-        break e;
-      let m = a.slice(0, a.length - p), o = b.slice(0, b.length - p);
-      return I(s, m, o, _);
-    }
-  }
-  if (r.length > 0 && i && i.length === 0)
-    e: {
-      let g = e.slice(0, r.index), s = e.slice(r.index + r.length), a = g.length, u = s.length;
-      if (h < a + u)
-        break e;
-      let c = n.slice(0, a), k = n.slice(h - u);
-      if (g !== c || s !== k)
-        break e;
-      let b = e.slice(a, t - u), p = n.slice(a, h - u);
-      return I(g, b, p, s);
-    }
-  return null;
+function C(t, n, r) {
+	let i = e(r) ? {
+		index: r,
+		length: 0
+	} : r.oldRange, a = e(r) ? null : r.newRange, o = t.length, s = n.length;
+	if (i.length === 0 && (a === null || a.length === 0)) {
+		let e = i.index, r = t.slice(0, e), c = t.slice(e), l = a ? a.index : null;
+		editBefore: {
+			let t = e + s - o;
+			if (l !== null && l !== t || t < 0 || t > s) break editBefore;
+			let i = n.slice(0, t);
+			if (n.slice(t) !== c) break editBefore;
+			let a = Math.min(e, t), u = r.slice(0, a);
+			if (u !== i.slice(0, a)) break editBefore;
+			return S(u, r.slice(a), i.slice(a), c);
+		}
+		editAfter: {
+			if (l !== null && l !== e) break editAfter;
+			let t = e, i = n.slice(0, t), a = n.slice(t);
+			if (i !== r) break editAfter;
+			let u = Math.min(o - t, s - t), d = c.slice(c.length - u);
+			if (d !== a.slice(a.length - u)) break editAfter;
+			return S(r, c.slice(0, c.length - u), a.slice(0, a.length - u), d);
+		}
+	}
+	if (i.length > 0 && a && a.length === 0) replaceRange: {
+		let e = t.slice(0, i.index), r = t.slice(i.index + i.length), a = e.length, c = r.length;
+		if (s < a + c) break replaceRange;
+		let l = n.slice(0, a), u = n.slice(s - c);
+		if (e !== l || r !== u) break replaceRange;
+		return S(e, t.slice(a, o - c), n.slice(a, s - c), r);
+	}
+	return null;
 }
-function B(e, n, l, r) {
-  return y(e, n, l, r, !0);
+function w(e, n, r, i) {
+	return t(e, n, r, i, !0);
 }
-B.INSERT = w;
-B.DELETE = L;
-B.EQUAL = A;
-export {
-  L as DELETE,
-  A as EQUAL,
-  w as INSERT,
-  B as default
-};
+w.INSERT = 1, w.DELETE = -1, w.EQUAL = 0;
+//#endregion
+export { w as default };
+/* 独立思考，明辨是非 */