@unicom-cloud/utils 0.1.20 → 0.1.21

package/index.js

@@ -1,72 +1,4 @@
-import * as o from "./constant/index.js";
-import * as e from "./date/index.js";
-import * as r from "./is/index.js";
-import * as t from "./math/index.js";
-import * as a from "./snapdom/index.js";
-import * as s from "./tree/index.js";
-import * as i from "./turbo-stream/index.js";
-import * as m from "./ui-color/index.js";
-import * as p from "./url-toolkit/index.js";
-import { default as u } from "./case-name/index.js";
-import { default as C } from "./class-name/index.js";
-import { default as b } from "./clipboard-copy/index.js";
-import { default as k, getContentDispositionFromHeader as y, getContentDispositionParametersFilenameFromHeader as T, getContentDispositionParametersFromHeader as g } from "./content-disposition/index.js";
-import { splitCookiesString as D } from "./cookie/index.js";
-import { default as S } from "./decimal/decimal.js";
-import { default as j } from "./diff/src/diff.js";
-import { Emitter as L } from "./emitter/src/index.js";
-import { fileToURL as P } from "./file/fileToURL.js";
-import { saveAs as E } from "./file/saveAs.js";
-import * as f from "./filesize/src/constants.js";
-import { filesize as R, partial as U } from "./filesize/src/filesize.js";
-import { default as $ } from "./invariant/index.js";
-import { default as w } from "./js-cookie/src/api.js";
-import * as n from "./lunar/lib/index.js";
-import { default as G } from "./md5/index.js";
-import { default as J } from "./normalize-wheel/index.js";
-import { default as O } from "./number-to-chinese/index.js";
-import { default as V } from "./nzh/nzh.js";
-import { default as Y } from "./object-keys-sort/index.js";
-import { default as oo } from "./pinyin/src/simplified.js";
-import { default as ro } from "./screenfull/index.js";
-import { TinyColor as ao } from "./tinycolor/src/index.js";
-import * as x from "./cookie/src/index.js";
+import { VERSION as e } from "./version/index.js";
 export {
-  n as Lunar,
-  u as caseName,
-  C as className,
-  b as clipboardCopy,
-  o as constant,
-  k as contentDisposition,
-  x as cookie,
-  e as date,
-  S as decimal,
-  j as diff,
-  L as emitter,
-  P as fileToURL,
-  R as filesize,
-  f as filesizeConstants,
-  y as getContentDispositionFromHeader,
-  T as getContentDispositionParametersFilenameFromHeader,
-  g as getContentDispositionParametersFromHeader,
-  $ as invariant,
-  r as is,
-  w as jsCookie,
-  t as math,
-  G as md5,
-  J as normalizeWheel,
-  O as numberToChinese,
-  V as nzh,
-  Y as objectKeysSort,
-  U as partial,
-  oo as pinyin,
-  E as saveAs,
-  ro as screenfull,
-  a as snapdom,
-  D as splitCookiesString,
-  ao as tinycolor,
-  s as tree,
-  i as turboStream,
-  m as uiColor,
-  p as urlToolkit
+  e as version
 };

package/nzh/src/index.js

@@ -1,4 +1,4 @@
-import { getNumbResult as R, clearZero as Y, unshiftZero as L, centerArray as j, extend as E, getDigit as C } from "./utils.js";
+import { getNumbResult as R, extend as E, clearZero as Y, unshiftZero as L, centerArray as j, getDigit as C } from "./utils.js";
 function z(m, h) {
   let _ = R(m);
   if (!_)

package/package.json

@@ -1 +1 @@
-{"name":"@unicom-cloud/utils","version":"0.1.20","dependencies":{},"peerDependencies":{"lodash":"^4.17.21"},"main":"./index.js","type":"module","types":"types/index.d.ts","publishConfig":{"registry":"https://registry.npmjs.org/","access":"public"}}
+{"name":"@unicom-cloud/utils","version":"0.1.21","dependencies":{},"peerDependencies":{"lodash":"^4.17.21"},"main":"./index.js","type":"module","types":"types/index.d.ts","publishConfig":{"registry":"https://registry.npmjs.org/","access":"public"}}

package/tree/search/index.js

@@ -1,15 +1,80 @@
 import "../../is/index.js";
 import A from "lodash/isArray";
-import z from "lodash/isObjectLike";
-import w from "lodash/isString";
-import T from "lodash/isFunction";
-function v(r, l, a, f) {
-  return l && r ? { shouldExit: !0, newMatch: !0 } : a && !r ? { shouldExit: !0, newMatch: !1 } : { shouldExit: !1, newMatch: f || r };
+import T from "lodash/isObjectLike";
+import F from "lodash/isString";
+import x from "lodash/isFunction";
+function z(c, r, e, i) {
+  return r && c ? { shouldExit: !0, newMatch: !0 } : e && !c ? { shouldExit: !0, newMatch: !1 } : { shouldExit: !1, newMatch: i || c };
 }
-function q(r, l, a = {}) {
-  if (!A(r)) throw new TypeError("参数treeData必须是一个数组");
-  if (!z(l)) throw new TypeError("参数searchCondition必须是一个对象");
-  const f = {
+function O(c, r, e) {
+  const { strict: i, fuzzyMatch: l, caseSensitive: u, matchMode: S, allowEmptyString: y } = e, n = S === "OR", p = S === "AND";
+  let M = !1;
+  const t = Object.entries(r), m = {};
+  for (const [d, s] of t) {
+    const a = c[d];
+    if (s === "")
+      if (y)
+        m[d] = a === "";
+      else {
+        m[d] = !1;
+        continue;
+      }
+    let o = !1;
+    try {
+      if (s instanceof RegExp)
+        o = F(a) ? s.test(a) : !1;
+      else if (x(s))
+        o = !!s(a);
+      else if (l && F(s)) {
+        const h = String(a), D = u ? s : s.toLowerCase();
+        o = (u ? h : h.toLowerCase()).includes(D);
+      } else
+        o = i ? a === s : a == s;
+    } catch {
+      o = !1;
+    }
+    m[d] = o;
+    const g = z(o, n, p, M);
+    if (g.shouldExit)
+      return { match: g.newMatch, matches: m };
+    M = g.newMatch;
+  }
+  return { match: M, matches: m };
+}
+function K(c, r, e) {
+  const i = [];
+  for (const l of c) {
+    const { match: u, matches: S } = O(
+      l,
+      r,
+      e
+    );
+    let y = u;
+    if (e.customMatcher)
+      try {
+        const t = e.customMatcher(l, S);
+        typeof t == "boolean" ? y = t : t && typeof t.match == "boolean" && (y = t.match);
+      } catch (t) {
+        console.warn("Custom matcher function error:", t);
+      }
+    const n = { ...l }, p = l[e.childrenKey];
+    if (A(p)) {
+      const t = K(
+        p,
+        r,
+        e
+      );
+      t.length > 0 ? n[e.childrenKey] = t : delete n[e.childrenKey];
+    }
+    const M = n[e.childrenKey] && n[e.childrenKey].length > 0;
+    (y || M) && i.push(n);
+  }
+  return i;
+}
+function V(c, r, e = {}) {
+  if (!A(c)) throw new TypeError("参数treeData必须是一个数组");
+  if (!T(r)) throw new TypeError("参数searchCondition必须是一个对象");
+  const i = {
     strategy: "BFS",
     childrenKey: "children",
     strict: !1,
@@ -18,73 +83,68 @@ function q(r, l, a = {}) {
     caseSensitive: !1,
     allowEmptyString: !1,
     matchMode: "AND",
-    ...a
+    preserveTreeStructure: !1,
+    customMatcher: void 0,
+    ...e
     // 用户配置覆盖默认值
   }, {
-    strategy: p,
-    childrenKey: S,
-    strict: x,
-    fuzzyMatch: O,
-    returnAllMatches: y,
-    caseSensitive: m,
-    allowEmptyString: B,
-    matchMode: E
-  } = f, M = E === "OR", g = E === "AND", h = p === "BFS";
-  if (!(h || p === "DFS")) throw new Error('配置 strategy 必须是 "BFS" 或 "DFS"');
-  if (!(M || g)) throw new Error('配置 matchMode 必须是 "AND" 或 "OR"');
-  if (!w(S)) throw new TypeError("配置 childrenKey 必须是字符串");
-  const c = [...r], F = [], D = Object.entries(l);
-  if (D.length) {
-    const N = (s) => {
-      let t = !1;
-      for (const [n, e] of D) {
-        const i = s[n];
-        if (e === "" && !B)
-          continue;
-        let o = !1;
-        try {
-          if (e instanceof RegExp)
-            o = w(i) ? e.test(i) : !1;
-          else if (T(e))
-            o = !!e(i);
-          else if (O && w(e)) {
-            const d = String(i), R = m ? e : e.toLowerCase();
-            o = (m ? d : d.toLowerCase()).includes(R);
-          } else
-            o = x ? i === e : i == e;
-        } catch {
-          o = !1;
-        }
-        const u = v(o, M, g, t);
-        if (u.shouldExit)
-          return u.newMatch;
-        t = u.newMatch;
-      }
-      return t;
-    };
-    for (; c.length > 0; ) {
-      const s = h ? c.shift() : c.pop();
-      if (!s) continue;
+    strategy: l,
+    childrenKey: u,
+    strict: S,
+    fuzzyMatch: y,
+    returnAllMatches: n,
+    caseSensitive: p,
+    allowEmptyString: M,
+    matchMode: t,
+    preserveTreeStructure: m,
+    customMatcher: d
+  } = i;
+  if (m) {
+    const f = K(
+      c,
+      r,
+      i
+    );
+    return n ? f : f[0] || null;
+  }
+  const s = t === "OR", a = t === "AND", o = l === "BFS";
+  if (!(o || l === "DFS")) throw new Error('配置 strategy 必须是 "BFS" 或 "DFS"');
+  if (!(s || a)) throw new Error('配置 matchMode 必须是 "AND" 或 "OR"');
+  if (!F(u)) throw new TypeError("配置 childrenKey 必须是字符串");
+  const h = [...c], D = [];
+  if (Object.entries(r).length)
+    for (; h.length > 0; ) {
+      const f = o ? h.shift() : h.pop();
+      if (!f) continue;
       try {
-        if (N(s))
-          if (y)
-            F.push(s);
+        const { match: w, matches: v } = O(
+          f,
+          r,
+          i
+        );
+        let R = w;
+        if (d) {
+          const E = d(f, v);
+          typeof E == "boolean" ? R = E : E && typeof E.match == "boolean" && (R = E.match);
+        }
+        if (R)
+          if (n)
+            D.push(f);
           else
-            return s;
+            return f;
       } catch {
         continue;
       }
-      const t = s[S];
-      if (A(t))
-        if (h)
-          c.push(...t);
+      const N = f[u];
+      if (A(N))
+        if (o)
+          h.push(...N);
         else
-          for (let n = t.length - 1; n >= 0; n--)
-            c.push(t[n]);
+          for (let w = N.length - 1; w >= 0; w--)
+            h.push(N[w]);
     }
-  }
-  return y ? F : null;
+  return n ? D : null;
 }
 export {
-  q as default
+  V as default
 };

package/types/index.d.ts

@@ -1,30 +1 @@
-export * as constant from "./constant";
-export * as date from "./date";
-export * as is from "./is";
-export * as math from "./math";
-export * as snapdom from "./snapdom";
-export * as tree from "./tree";
-export * as turboStream from "./turbo-stream";
-export * as uiColor from "./ui-color";
-export * as urlToolkit from "./url-toolkit";
-export { default as caseName } from "./case-name";
-export { default as className } from "./class-name";
-export { default as clipboardCopy } from "./clipboard-copy";
-export { default as decimal } from "./decimal";
-export { default as diff } from "./diff";
-export { default as emitter } from "./emitter";
-export { default as invariant } from "./invariant";
-export { default as jsCookie } from "./js-cookie";
-export { default as Lunar } from "./lunar";
-export { default as md5 } from "./md5";
-export { default as normalizeWheel } from "./normalize-wheel";
-export { default as numberToChinese } from "./number-to-chinese";
-export { default as nzh } from "./nzh";
-export { default as objectKeysSort } from "./object-keys-sort";
-export { default as pinyin } from "./pinyin";
-export { default as screenfull } from "./screenfull";
-export { default as tinycolor } from "./tinycolor";
-export { default as contentDisposition, getContentDispositionFromHeader, getContentDispositionParametersFilenameFromHeader, getContentDispositionParametersFromHeader } from "./content-disposition";
-export { default as cookie, splitCookiesString } from "./cookie";
-export { fileToURL, saveAs } from "./file";
-export { default as filesize, filesizeConstants, partial } from "./filesize";
+export { default as version } from "./version";

package/types/tree/search/index.d.ts

@@ -10,6 +10,18 @@ type Primitive = string | number | boolean | symbol | null | undefined;
  * @template T 节点值的泛型类型
  */
 type ConditionValue<T = unknown> = Primitive | ((value: T) => boolean) | RegExp;
+/**
+ * 自定义匹配函数类型
+ * @param node 当前节点
+ * @param matches 当前已匹配的条件信息
+ * @returns 返回boolean或对象包含匹配详情
+ */
+type CustomMatchFunction = (node: TreeNode, matches: {
+    [key: string]: boolean;
+}) => boolean | {
+    match: boolean;
+    reason?: string;
+};
 /**
  * 树搜索配置选项接口
  */
@@ -54,6 +66,16 @@ interface SearchOptions {
      * @default false
      */
     allowEmptyString?: boolean;
+    /**
+     * 是否保留树形结构（返回包含匹配节点的最小完整子树）
+     * @default false
+     */
+    preserveTreeStructure?: boolean;
+    /**
+     * 自定义匹配函数，可以覆盖默认的匹配逻辑
+     * 返回true表示匹配，false表示不匹配
+     */
+    customMatcher?: CustomMatchFunction;
 }
 /**
  * 树节点接口定义

package/types/turbo-stream/src/shared.d.ts

@@ -80,11 +80,11 @@ export declare class TurboBlob extends Blob {
     text(): Promise<string>;
 }
 declare const FileBaseClass: {
-    new (blobParts?: BlobPart[], options?: BlobPropertyBag): Blob;
-    prototype: Blob;
-} | {
     new (fileBits: BlobPart[], fileName: string, options?: FilePropertyBag): File;
     prototype: File;
+} | {
+    new (blobParts?: BlobPart[], options?: BlobPropertyBag): Blob;
+    prototype: Blob;
 };
 export declare class TurboFile extends FileBaseClass {
     #private;

package/types/version/index.d.ts

@@ -0,0 +1,2 @@
+export const VERSION: "0.0.0";
+export default VERSION;

package/version/index.js

@@ -0,0 +1,5 @@
+const t = "0.0.0";
+export {
+  t as VERSION,
+  t as default
+};

package/version.js

@@ -0,0 +1,5 @@
+import { VERSION as f, VERSION as o } from "./version/index.js";
+export {
+  f as VERSION,
+  o as default
+};

package/diff/index.js

@@ -1,7 +0,0 @@
-import { DELETE as f, EQUAL as o, INSERT as r, default as t } from "./src/diff.js";
-export {
-  f as DELETE,
-  o as EQUAL,
-  r as INSERT,
-  t as default
-};

package/diff/src/diff.d.ts

@@ -1,21 +0,0 @@
-declare function diff(
-  text1: string,
-  text2: string,
-  cursorPos?: number | diff.CursorInfo,
-  cleanup?: boolean,
-): diff.Diff[];
-
-declare namespace diff {
-  type Diff = [-1 | 0 | 1, string];
-
-  const DELETE: -1;
-  const INSERT: 1;
-  const EQUAL: 0;
-
-  interface CursorInfo {
-    oldRange: { index: number; length: number };
-    newRange: { index: number; length: number };
-  }
-}
-
-export = diff;

package/diff/src/diff.js

@@ -1,381 +0,0 @@
-let L = -1, w = 1, A = 0;
-function S(e, t, l, r, i) {
-  if (e === t)
-    return e ? [[A, e]] : [];
-  if (l != null) {
-    let a = T(e, t, l);
-    if (a)
-      return a;
-  }
-  let n = D(e, t), h = e.substring(0, n);
-  e = e.substring(n), t = t.substring(n), n = I(e, t);
-  let g = e.substring(e.length - n);
-  e = e.substring(0, e.length - n), t = t.substring(0, t.length - n);
-  let s = G(e, t);
-  return h && s.unshift([A, h]), g && s.push([A, g]), F(s, i), r && K(s), s;
-}
-function G(e, t) {
-  let l;
-  if (!e)
-    return [[w, t]];
-  if (!t)
-    return [[L, e]];
-  let r = e.length > t.length ? e : t, i = e.length > t.length ? t : e, n = r.indexOf(i);
-  if (n !== -1)
-    return l = [
-      [w, r.substring(0, n)],
-      [A, i],
-      [w, r.substring(n + i.length)]
-    ], e.length > t.length && (l[0][0] = l[2][0] = L), l;
-  if (i.length === 1)
-    return [
-      [L, e],
-      [w, t]
-    ];
-  let h = J(e, t);
-  if (h) {
-    let g = h[0], s = h[1], a = h[2], u = h[3], c = h[4], f = S(g, a), b = S(s, u);
-    return f.concat([[A, c]], b);
-  }
-  return H(e, t);
-}
-function H(e, t) {
-  let l = e.length, r = t.length, i = Math.ceil((l + r) / 2), n = i, h = 2 * i, g = new Array(h), s = new Array(h);
-  for (let _ = 0; _ < h; _++)
-    g[_] = -1, s[_] = -1;
-  g[n + 1] = 0, s[n + 1] = 0;
-  let a = l - r, u = a % 2 !== 0, c = 0, f = 0, b = 0, p = 0;
-  for (let _ = 0; _ < i; _++) {
-    for (let k = -_ + c; k <= _ - f; k += 2) {
-      let m = n + k, o;
-      k === -_ || k !== _ && g[m - 1] < g[m + 1] ? o = g[m + 1] : o = g[m - 1] + 1;
-      let M = o - k;
-      for (; o < l && M < r && e.charAt(o) === t.charAt(M); )
-        o++, M++;
-      if (g[m] = o, o > l)
-        f += 2;
-      else if (M > r)
-        c += 2;
-      else if (u) {
-        let E = n + a - k;
-        if (E >= 0 && E < h && s[E] !== -1) {
-          let y = l - s[E];
-          if (o >= y)
-            return C(e, t, o, M);
-        }
-      }
-    }
-    for (let k = -_ + b; k <= _ - p; k += 2) {
-      let m = n + k, o;
-      k === -_ || k !== _ && s[m - 1] < s[m + 1] ? o = s[m + 1] : o = s[m - 1] + 1;
-      let M = o - k;
-      for (; o < l && M < r && e.charAt(l - o - 1) === t.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 = n + a - k;
-        if (E >= 0 && E < h && g[E] !== -1) {
-          let y = g[E], R = n + y - E;
-          if (o = l - o, y >= o)
-            return C(e, t, y, R);
-        }
-      }
-    }
-  }
-  return [
-    [L, e],
-    [w, t]
-  ];
-}
-function C(e, t, l, r) {
-  let i = e.substring(0, l), n = t.substring(0, r), h = e.substring(l), g = t.substring(r), s = S(i, n), a = S(h, g);
-  return s.concat(a);
-}
-function D(e, t) {
-  if (!e || !t || e.charAt(0) !== t.charAt(0))
-    return 0;
-  let l = 0, r = Math.min(e.length, t.length), i = r, n = 0;
-  for (; l < i; )
-    e.substring(n, i) == t.substring(n, i) ? (l = i, n = l) : r = i, i = Math.floor((r - l) / 2 + l);
-  return j(e.charCodeAt(i - 1)) && i--, i;
-}
-function O(e, t) {
-  let l = e.length, r = t.length;
-  if (l == 0 || r == 0)
-    return 0;
-  l > r ? e = e.substring(l - r) : l < r && (t = t.substring(0, l));
-  let i = Math.min(l, r);
-  if (e == t)
-    return i;
-  let n = 0, h = 1;
-  for (; ; ) {
-    let g = e.substring(i - h), s = t.indexOf(g);
-    if (s == -1)
-      return n;
-    h += s, (s == 0 || e.substring(i - h) == t.substring(0, h)) && (n = h, h++);
-  }
-}
-function I(e, t) {
-  if (!e || !t || e.slice(-1) !== t.slice(-1))
-    return 0;
-  let l = 0, r = Math.min(e.length, t.length), i = r, n = 0;
-  for (; l < i; )
-    e.substring(e.length - i, e.length - n) == t.substring(t.length - i, t.length - n) ? (l = i, n = l) : r = i, i = Math.floor((r - l) / 2 + l);
-  return z(e.charCodeAt(e.length - i)) && i--, i;
-}
-function J(e, t) {
-  let l = e.length > t.length ? e : t, r = e.length > t.length ? t : e;
-  if (l.length < 4 || r.length * 2 < l.length)
-    return null;
-  function i(b, p, _) {
-    let k = b.substring(_, _ + Math.floor(b.length / 4)), m = -1, o = "", M, E, y, R;
-    for (; (m = p.indexOf(k, m + 1)) !== -1; ) {
-      let v = D(
-        b.substring(_),
-        p.substring(m)
-      ), q = I(
-        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), y = p.substring(0, m - q), R = p.substring(m + v));
-    }
-    return o.length * 2 >= b.length ? [
-      M,
-      E,
-      y,
-      R,
-      o
-    ] : null;
-  }
-  let n = i(
-    l,
-    r,
-    Math.ceil(l.length / 4)
-  ), h = i(
-    l,
-    r,
-    Math.ceil(l.length / 2)
-  ), g;
-  if (!n && !h)
-    return null;
-  h ? n ? g = n[4].length > h[4].length ? n : h : g = h : g = n;
-  let s, a, u, c;
-  e.length > t.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 f = g[4];
-  return [s, a, u, c, f];
-}
-function K(e) {
-  let t = !1, l = [], r = 0, i = null, n = 0, h = 0, g = 0, s = 0, a = 0;
-  for (; n < e.length; )
-    e[n][0] == A ? (l[r++] = n, h = s, g = a, s = 0, a = 0, i = e[n][1]) : (e[n][0] == w ? s += e[n][1].length : a += e[n][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--, n = r > 0 ? l[r - 1] : -1, h = 0, g = 0, s = 0, a = 0, i = null, t = !0)), n++;
-  for (t && F(e), X(e), n = 1; n < e.length; ) {
-    if (e[n - 1][0] == L && e[n][0] == w) {
-      let u = e[n - 1][1], c = e[n][1], f = O(u, c), b = O(c, u);
-      f >= b ? (f >= u.length / 2 || f >= c.length / 2) && (e.splice(n, 0, [
-        A,
-        c.substring(0, f)
-      ]), e[n - 1][1] = u.substring(
-        0,
-        u.length - f
-      ), e[n + 1][1] = c.substring(f), n++) : (b >= u.length / 2 || b >= c.length / 2) && (e.splice(n, 0, [
-        A,
-        u.substring(0, b)
-      ]), e[n - 1][0] = w, e[n - 1][1] = c.substring(
-        0,
-        c.length - b
-      ), e[n + 1][0] = L, e[n + 1][1] = u.substring(b), n++), n++;
-    }
-    n++;
-  }
-}
-let P = /[^a-zA-Z0-9]/, Q = /\s/, U = /[\r\n]/, V = /\n\r?\n$/, W = /^\r?\n\r?\n/;
-function X(e) {
-  function t(r, i) {
-    if (!r || !i)
-      return 6;
-    let n = r.charAt(r.length - 1), h = i.charAt(0), g = n.match(P), s = h.match(P), a = g && n.match(Q), u = s && h.match(Q), c = a && n.match(U), f = u && h.match(U), b = c && r.match(V), p = f && i.match(W);
-    return b || p ? 5 : c || f ? 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], n = e[l + 1][1], h = I(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), n = c + n;
-      }
-      let g = r, s = i, a = n, u = t(r, i) + t(i, n);
-      for (; i.charAt(0) === n.charAt(0); ) {
-        r += i.charAt(0), i = i.substring(1) + n.charAt(0), n = n.substring(1);
-        let c = t(r, i) + t(i, n);
-        c >= u && (u = c, g = r, s = i, a = n);
-      }
-      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++;
-  }
-}
-function F(e, t) {
-  e.push([A, ""]);
-  let l = 0, r = 0, i = 0, n = "", 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++, n += e[l][1], l++;
-        break;
-      case A: {
-        let a = l - i - r - 1;
-        if (t) {
-          if (a >= 0 && $(e[a][1])) {
-            let u = e[a][1].slice(-1);
-            if (e[a][1] = e[a][1].slice(
-              0,
-              -1
-            ), n = u + n, 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++, n = e[c][1] + n, c--), a = c;
-            }
-          }
-          if (Z(e[l][1])) {
-            let u = e[l][1].charAt(0);
-            e[l][1] = e[l][1].slice(1), n += u, h += u;
-          }
-        }
-        if (l < e.length - 1 && !e[l][1]) {
-          e.splice(l, 1);
-          break;
-        }
-        if (n.length > 0 || h.length > 0) {
-          n.length > 0 && h.length > 0 && (g = D(h, n), 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), n = n.substring(g)), g = I(h, n), g !== 0 && (e[l][1] = h.substring(h.length - g) + e[l][1], h = h.substring(
-            0,
-            h.length - g
-          ), n = n.substring(
-            0,
-            n.length - g
-          )));
-          let u = i + r;
-          n.length === 0 && h.length === 0 ? (e.splice(l - u, u), l = l - u) : n.length === 0 ? (e.splice(l - u, u, [w, h]), l = l - u + 1) : h.length === 0 ? (e.splice(l - u, u, [L, n]), l = l - u + 1) : (e.splice(
-            l - u,
-            u,
-            [L, n],
-            [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, n = "", 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, t);
-}
-function j(e) {
-  return e >= 55296 && e <= 56319;
-}
-function z(e) {
-  return e >= 56320 && e <= 57343;
-}
-function Z(e) {
-  return z(e.charCodeAt(0));
-}
-function $(e) {
-  return j(e.charCodeAt(e.length - 1));
-}
-function Y(e) {
-  let t = [];
-  for (let l = 0; l < e.length; l++)
-    e[l][1].length > 0 && t.push(e[l]);
-  return t;
-}
-function N(e, t, l, r) {
-  return $(e) || Z(r) ? null : Y([
-    [A, e],
-    [L, t],
-    [w, l],
-    [A, r]
-  ]);
-}
-function T(e, t, l) {
-  let r = typeof l == "number" ? { index: l, length: 0 } : l.oldRange, i = typeof l == "number" ? null : l.newRange, n = e.length, h = t.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 - n;
-      if (u !== null && u !== c || c < 0 || c > h)
-        break e;
-      let f = t.slice(0, c);
-      if (t.slice(c) !== a)
-        break e;
-      let p = Math.min(g, c), _ = s.slice(0, p), k = f.slice(0, p);
-      if (_ !== k)
-        break e;
-      let m = s.slice(p), o = f.slice(p);
-      return N(_, m, o, a);
-    }
-    e: {
-      if (u !== null && u !== g)
-        break e;
-      let c = g, f = t.slice(0, c), b = t.slice(c);
-      if (f !== s)
-        break e;
-      let p = Math.min(n - c, h - c), _ = a.slice(a.length - p), k = b.slice(b.length - p);
-      if (_ !== k)
-        break e;
-      let m = a.slice(0, a.length - p), o = b.slice(0, b.length - p);
-      return N(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 = t.slice(0, a), f = t.slice(h - u);
-      if (g !== c || s !== f)
-        break e;
-      let b = e.slice(a, n - u), p = t.slice(a, h - u);
-      return N(g, b, p, s);
-    }
-  return null;
-}
-function B(e, t, l, r) {
-  return S(e, t, l, r, !0);
-}
-B.INSERT = w;
-B.DELETE = L;
-B.EQUAL = A;
-export {
-  L as DELETE,
-  A as EQUAL,
-  w as INSERT,
-  B as default
-};

package/diff.js

@@ -1,7 +0,0 @@
-import { DELETE as f, EQUAL as o, INSERT as r, default as t } from "./diff/src/diff.js";
-export {
-  f as DELETE,
-  o as EQUAL,
-  r as INSERT,
-  t as default
-};

package/types/diff/index.d.ts

@@ -1,2 +0,0 @@
-export * from "./src/diff";
-export { default } from "./src/diff";

package/types/diff/src/diff.d.ts

@@ -1,40 +0,0 @@
-export default diff;
-/**
- * This library modifies the diff-patch-match library by Neil Fraser
- * by removing the patch and match functionality and certain advanced
- * options in the diff function. The original license is as follows:
- *
- * ===
- *
- * Diff Match and Patch
- *
- * Copyright 2006 Google Inc.
- * http://code.google.com/p/google-diff-match-patch/
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *   http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-/**
- * The data structure representing a diff is an array of tuples:
- * [[DIFF_DELETE, 'Hello'], [DIFF_INSERT, 'Goodbye'], [DIFF_EQUAL, ' world.']]
- * which means: delete 'Hello', add 'Goodbye' and keep ' world.'
- */
-declare let DIFF_DELETE: number;
-declare let DIFF_EQUAL: number;
-declare let DIFF_INSERT: number;
-declare function diff(text1: any, text2: any, cursor_pos: any, cleanup: any): any[];
-declare namespace diff {
-    export { DIFF_INSERT as INSERT };
-    export { DIFF_DELETE as DELETE };
-    export { DIFF_EQUAL as EQUAL };
-}
-export { DIFF_DELETE as DELETE, DIFF_EQUAL as EQUAL, DIFF_INSERT as INSERT };