@unicom-cloud/utils 0.1.37 → 0.1.39

package/tinycolor/src/utils.js

@@ -1,33 +1,28 @@
-/* 2026-01-27 10:43:49 */
-function o(t, r) {
-  i(t) && (t = "100%");
-  const e = n(t);
-  return t = r === 360 ? t : Math.min(r, Math.max(0, parseFloat(t))), e && (t = parseInt(String(t * r), 10) / 100), Math.abs(t - r) < 1e-6 ? 1 : (r === 360 ? t = (t < 0 ? t % r + r : t % r) / parseFloat(String(r)) : t = t % r / parseFloat(String(r)), t);
+/* 潘启宝 2026-03-24 15:26:16 星期二 */
+//#region utils/tinycolor/src/utils.ts
+function e(e, t) {
+	n(e) && (e = "100%");
+	let i = r(e);
+	return e = t === 360 ? e : Math.min(t, Math.max(0, parseFloat(e))), i && (e = parseInt(String(e * t), 10) / 100), Math.abs(e - t) < 1e-6 ? 1 : (e = t === 360 ? (e < 0 ? e % t + t : e % t) / parseFloat(String(t)) : e % t / parseFloat(String(t)), e);
 }
-function u(t) {
-  return Math.min(1, Math.max(0, t));
+function t(e) {
+	return Math.min(1, Math.max(0, e));
 }
-function i(t) {
-  return typeof t == "string" && t.indexOf(".") !== -1 && parseFloat(t) === 1;
+function n(e) {
+	return typeof e == "string" && e.indexOf(".") !== -1 && parseFloat(e) === 1;
 }
-function n(t) {
-  return typeof t == "string" && t.indexOf("%") !== -1;
+function r(e) {
+	return typeof e == "string" && e.indexOf("%") !== -1;
 }
-function f(t) {
-  return t = parseFloat(t), (isNaN(t) || t < 0 || t > 1) && (t = 1), t;
+function i(e) {
+	return e = parseFloat(e), (isNaN(e) || e < 0 || e > 1) && (e = 1), e;
 }
-function s(t) {
-  return Number(t) <= 1 ? `${Number(t) * 100}%` : t;
+function a(e) {
+	return Number(e) <= 1 ? `${Number(e) * 100}%` : e;
 }
-function p(t) {
-  return t.length === 1 ? "0" + t : String(t);
+function o(e) {
+	return e.length === 1 ? "0" + e : String(e);
 }
-export {
-  o as bound01,
-  f as boundAlpha,
-  u as clamp01,
-  s as convertToPercentage,
-  i as isOnePointZero,
-  n as isPercentage,
-  p as pad2
-};
+//#endregion
+export { e as bound01, i as boundAlpha, t as clamp01, a as convertToPercentage, n as isOnePointZero, r as isPercentage, o as pad2 };
+/* 独立思考，明辨是非 */

package/tree/index.d.ts

@@ -0,0 +1,8 @@
+export default searchTree;
+export function findNodeBy(root: any, key: any, value: any, childrenKey?: string): any;
+export function getChildWithParentBy(root: any, key: any, value: any, childrenKey?: string): null | undefined;
+export function getItemBy(root: any, key: any, value: any, childrenKey?: string, strict?: boolean): any;
+export function getItemByID(root: any, value: any): any;
+export function getLabelFromDictionaryByValue(a: any, value: any, fallback?: boolean): any;
+import searchTree from './search';
+export { searchTree };

package/tree/index.js

@@ -1,72 +1,63 @@
-/* 2026-01-27 10:43:49 */
-import d from "lodash/castArray";
-import s from "lodash/isArray.js";
-import h from "lodash/isObject.js";
-import p from "lodash/isUndefined.js";
-import A from "./search/index.js";
-function g(e, i, r, n = "children") {
-  if (s(e) && (e = {
-    [n]: e
-  }), !(e && h(e))) return null;
-  if (i in e && e[i] === r)
-    return e;
-  const f = e[n] ?? e.items ?? e.list;
-  if (s(f))
-    for (let l of f) {
-      const t = g(l, i, r, n);
-      if (t)
-        return t;
-    }
-  return null;
+/* 潘启宝 2026-03-24 15:26:16 星期二 */
+import { isArray as e, isObject as t, isUndefined as n } from "../is/index.js";
+import r from "./search/index.js";
+import i from "lodash/castArray.js";
+//#region utils/tree/index.js
+function a(n, r, i, o = "children") {
+	if (e(n) && (n = { [o]: n }), !(n && t(n))) return null;
+	if (r in n && n[r] === i) return n;
+	let s = n[o] ?? n.items ?? n.list;
+	if (e(s)) for (let e of s) {
+		let t = a(e, r, i, o);
+		if (t) return t;
+	}
+	return null;
 }
-function a(e, i, r, n = "children", f = !0) {
-  if (!e) return;
-  let l = [...d(e)];
-  e: for (; l.length; ) {
-    let t = l.shift();
-    if (!t) continue e;
-    const c = t[i];
-    if (!s(t)) {
-      if (f ? c === r : c == r)
-        return t;
-      let u = t[n] ?? t.items ?? t.list;
-      if (p(u))
-        continue e;
-      t = u;
-    }
-    l = l.concat(t);
-  }
+function o(t, r, a, o = "children", s = !0) {
+	if (!t) return;
+	let c = [...i(t)];
+	pqb: for (; c.length;) {
+		let t = c.shift();
+		if (!t) continue pqb;
+		let i = t[r];
+		if (!e(t)) {
+			if (s ? i === a : i == a) return t;
+			let e = t[o] ?? t.items ?? t.list;
+			if (n(e)) continue pqb;
+			t = e;
+		}
+		c = c.concat(t);
+	}
 }
-function D(e, i) {
-  return a(e, "id", i);
+function s(e, t) {
+	return o(e, "id", t);
 }
-function N(e, i, r = !0) {
-  let n = a(e, "value", i)?.label;
-  return !n && r && (n = i), n;
+function c(e, t, n = !0) {
+	let r = o(e, "value", t)?.label;
+	return n && (r ||= t), r;
 }
-function j(e, i, r, n = "children") {
-  if (!e) return;
-  let f = null;
-  function l(t) {
-    if (!t) return;
-    let c = s(t) ? t : t[n] ?? t.items ?? t.list ?? [];
-    for (let u = 0; u < c.length; u++) {
-      const m = c[u];
-      if (m?.[i] === r) {
-        f = { item: m, parent: t, index: u };
-        return;
-      }
-      l(m);
-    }
-  }
-  return l(e), f;
+function l(t, n, r, i = "children") {
+	if (!t) return;
+	let a = null;
+	function o(t) {
+		if (!t) return;
+		let s = e(t) ? t : t[i] ?? t.items ?? t.list ?? [];
+		for (let e = 0; e < s.length; e++) {
+			let i = s[e];
+			if (i?.[n] === r) {
+				a = {
+					item: i,
+					parent: t,
+					index: e
+				};
+				return;
+			}
+			o(i);
+		}
+	}
+	return o(t), a;
 }
-export {
-  A as default,
-  g as findNodeBy,
-  j as getChildWithParentBy,
-  a as getItemBy,
-  D as getItemByID,
-  N as getLabelFromDictionaryByValue,
-  A as searchTree
-};
+var u = r;
+//#endregion
+export { u as default, a as findNodeBy, l as getChildWithParentBy, o as getItemBy, s as getItemByID, c as getLabelFromDictionaryByValue, r as searchTree };
+/* 独立思考，明辨是非 */

package/tree/search/index.js

@@ -1,108 +1,86 @@
-/* 2026-01-27 10:43:49 */
-import E from "lodash/isArray";
-import B from "lodash/isFunction";
-import C from "lodash/isNil";
-import K from "lodash/isNumber";
-import L from "lodash/isObjectLike";
-import j from "lodash/isRegExp";
-import f from "lodash/isString";
-function k(n, u, m, w) {
-  return u && n ? { shouldExit: !0, newMatch: !0 } : m && !n ? { shouldExit: !0, newMatch: !1 } : { shouldExit: !1, newMatch: w || n };
+/* 潘启宝 2026-03-24 15:26:16 星期二 */
+import { isArray as e, isFunction as t, isNil as n, isNumber as r, isObjectLike as i, isRegExp as a, isString as o } from "../../is/index.js";
+//#region utils/tree/search/index.ts
+function s(e, t, n, r) {
+	return t && e ? {
+		shouldExit: !0,
+		newMatch: !0
+	} : n && !e ? {
+		shouldExit: !0,
+		newMatch: !1
+	} : {
+		shouldExit: !1,
+		newMatch: r || e
+	};
 }
-function P(n, u, m = {}) {
-  if (C(n) || !E(n)) return null;
-  if (!L(u)) throw new TypeError("参数 searchCondition 必须是一个对象");
-  const w = {
-    strategy: "BFS",
-    childrenKey: "children",
-    strict: !1,
-    fuzzyMatch: !1,
-    returnAllMatches: !1,
-    caseSensitive: !1,
-    allowEmptyString: !1,
-    matchMode: "AND",
-    returnTree: !1,
-    returnTreeMaxDepth: 0,
-    // 只在 returnTree 为 true 时才生效
-    ...m
-    // 用户配置覆盖默认值
-  }, {
-    strategy: S,
-    childrenKey: a,
-    strict: v,
-    fuzzyMatch: R,
-    returnAllMatches: M,
-    caseSensitive: b,
-    allowEmptyString: z,
-    matchMode: T,
-    returnTree: g,
-    returnTreeMaxDepth: d
-  } = w, x = T === "OR", A = T === "AND", y = S === "BFS";
-  if (!(y || S === "DFS")) throw new Error('配置 strategy 必须是 "BFS" 或 "DFS"');
-  if (!(x || A)) throw new Error('配置 matchMode 必须是 "AND" 或 "OR"');
-  if (!f(a)) throw new TypeError("配置 childrenKey 必须是字符串");
-  if (g) {
-    if (!M) throw new Error(
-      "当 returnTree 为 true 时，returnAllMatches 也必须为 true"
-    );
-    if (!(K(d) && d > -1)) throw new TypeError("配置 returnTreeMaxDepth 必须是一个非负整数");
-  }
-  const h = [...n], F = [], D = Object.entries(u);
-  if (D.length) {
-    const N = (r) => {
-      let s = !1;
-      for (const [i, c] of D) {
-        let e = c, t = r[i];
-        if (b || (f(e) && (e = e.toLowerCase()), f(t) && (t = t.toLowerCase())), e === "" && !z)
-          continue;
-        let o = !1;
-        B(e) ? o = !!e(t, r) : j(e) && f(t) ? o = t ? e.test(t) : !1 : R && f(e) && f(t) ? o = t.includes(e) : o = v ? t === e : t == e;
-        const l = k(o, x, A, s);
-        if (l.shouldExit)
-          return l.newMatch;
-        s = l.newMatch;
-      }
-      return s;
-    };
-    if (g) {
-      const r = (i, c = 1) => {
-        const e = d > 0 && c > d, t = !e && N(i), o = e ? void 0 : i[a], l = [];
-        if (E(o))
-          for (const p of o) {
-            const O = r(p, c + 1);
-            O && l.push(O);
-          }
-        if (t || l.length > 0) {
-          const p = { ...i };
-          return l.length > 0 && (p[a] = l), p;
-        }
-        return null;
-      }, s = [];
-      for (const i of n) {
-        const c = r(i, 1);
-        c && s.push(c);
-      }
-      return s;
-    } else
-      for (; h.length > 0; ) {
-        const r = y ? h.shift() : h.pop();
-        if (!r) continue;
-        if (N(r))
-          if (M)
-            F.push(r);
-          else
-            return r;
-        const s = r[a];
-        if (E(s))
-          if (y)
-            h.push(...s);
-          else
-            for (let i = s.length - 1; i >= 0; i--)
-              h.push(s[i]);
-      }
-  }
-  return M ? F : null;
+function c(c, l, u = {}) {
+	if (n(c) || !e(c)) return null;
+	if (!i(l)) throw TypeError("参数 searchCondition 必须是一个对象");
+	let { strategy: d, childrenKey: f, strict: p, fuzzyMatch: m, returnAllMatches: h, caseSensitive: g, allowEmptyString: _, matchMode: v, returnTree: y, returnTreeMaxDepth: b } = {
+		strategy: "BFS",
+		childrenKey: "children",
+		strict: !1,
+		fuzzyMatch: !1,
+		returnAllMatches: !1,
+		caseSensitive: !1,
+		allowEmptyString: !1,
+		matchMode: "AND",
+		returnTree: !1,
+		returnTreeMaxDepth: 0,
+		...u
+	}, x = v === "OR", S = v === "AND", C = d === "BFS";
+	if (!(C || d === "DFS")) throw Error("配置 strategy 必须是 \"BFS\" 或 \"DFS\"");
+	if (!(x || S)) throw Error("配置 matchMode 必须是 \"AND\" 或 \"OR\"");
+	if (!o(f)) throw TypeError("配置 childrenKey 必须是字符串");
+	if (y) {
+		if (!h) throw Error("当 returnTree 为 true 时，returnAllMatches 也必须为 true");
+		if (!(r(b) && b > -1)) throw TypeError("配置 returnTreeMaxDepth 必须是一个非负整数");
+	}
+	let w = [...c], T = [], E = Object.entries(l);
+	if (E.length) {
+		let n = (e) => {
+			let n = !1;
+			for (let [r, i] of E) {
+				let c = i, l = e[r];
+				if (g || (o(c) && (c = c.toLowerCase()), o(l) && (l = l.toLowerCase())), c === "" && !_) continue;
+				let u = !1;
+				u = t(c) ? !!c(l, e) : a(c) && o(l) ? l ? c.test(l) : !1 : m && o(c) && o(l) ? l.includes(c) : p ? l === c : l == c;
+				let d = s(u, x, S, n);
+				if (d.shouldExit) return d.newMatch;
+				n = d.newMatch;
+			}
+			return n;
+		};
+		if (y) {
+			let t = (r, i = 1) => {
+				let a = b > 0 && i > b, o = !a && n(r), s = a ? void 0 : r[f], c = [];
+				if (e(s)) for (let e of s) {
+					let n = t(e, i + 1);
+					n && c.push(n);
+				}
+				if (o || c.length > 0) {
+					let e = { ...r };
+					return c.length > 0 && (e[f] = c), e;
+				}
+				return null;
+			}, r = [];
+			for (let e of c) {
+				let n = t(e, 1);
+				n && r.push(n);
+			}
+			return r;
+		} else for (; w.length > 0;) {
+			let t = C ? w.shift() : w.pop();
+			if (!t) continue;
+			if (n(t)) if (h) T.push(t);
+			else return t;
+			let r = t[f];
+			if (e(r)) if (C) w.push(...r);
+			else for (let e = r.length - 1; e >= 0; e--) w.push(r[e]);
+		}
+	}
+	return h ? T : null;
 }
-export {
-  P as default
-};
+//#endregion
+export { c as default };
+/* 独立思考，明辨是非 */

package/tween/index.js

@@ -1,8 +1,6 @@
-/* 2026-01-27 10:43:49 */
-import * as e from "./src/easing.js";
-import { default as r, default as t } from "./src/tween.js";
-export {
-  r as Tween,
-  t as default,
-  e as easing
-};
+/* 潘启宝 2026-03-24 15:26:16 星期二 */
+import { easing_exports as e } from "./src/easing.js";
+import t from "./src/tween.js";
+import "./src/index.js";
+export { t as Tween, t as default, e as easing };
+/* 独立思考，明辨是非 */

package/tween/src/easing.js

@@ -1,62 +1,68 @@
-/* 2026-01-27 10:43:49 */
-function u(n) {
-  return function(t) {
-    return Math.pow(t, n);
-  };
-}
-function r(n) {
-  return function(t) {
-    return 1 - Math.abs(Math.pow(t - 1, n));
-  };
-}
-function c(n) {
-  return function(t) {
-    return t < 0.5 ? u(n)(t * 2) / 2 : r(n)(t * 2 - 1) / 2 + 0.5;
-  };
-}
-function s(n) {
-  return n;
-}
-const a = u(2), I = r(2), f = c(2), O = u(3), h = r(3), M = c(3), p = u(4), q = r(4), b = c(4), P = u(5), d = r(5), l = c(5);
-function y(n) {
-  return 1 + Math.sin(Math.PI / 2 * n - Math.PI / 2);
-}
-function B(n) {
-  return Math.sin(Math.PI / 2 * n);
-}
-function w(n) {
-  return (1 + Math.sin(Math.PI * n - Math.PI / 2)) / 2;
-}
-function e(n) {
-  return n < 1 / 2.75 ? 7.5625 * n * n : n < 2 / 2.75 ? (n -= 1.5 / 2.75, 7.5625 * n * n + 0.75) : n < 2.5 / 2.75 ? (n -= 2.25 / 2.75, 7.5625 * n * n + 0.9375) : (n -= 2.625 / 2.75, 7.5625 * n * n + 0.984375);
-}
-function o(n) {
-  return 1 - e(1 - n);
-}
-function x(n) {
-  return n < 0.5 ? o(n * 2) * 0.5 : e(n * 2 - 1) * 0.5 + 0.5;
-}
-export {
-  o as bounceIn,
-  x as bounceInOut,
-  e as bounceOut,
-  O as cubicIn,
-  M as cubicInOut,
-  h as cubicOut,
-  u as easeInBy,
-  c as easeInOutBy,
-  r as easeOutBy,
-  s as linear,
-  a as quadIn,
-  f as quadInOut,
-  I as quadOut,
-  p as quartIn,
-  b as quartInOut,
-  q as quartOut,
-  P as quintIn,
-  l as quintInOut,
-  d as quintOut,
-  y as sineIn,
-  w as sineInOut,
-  B as sineOut
-};
+/* 潘启宝 2026-03-24 15:26:16 星期二 */
+import { __exportAll as e } from "../../.virtual/_rolldown/runtime.js";
+//#region utils/tween/src/easing.js
+var t = /* @__PURE__ */ e({
+	bounceIn: () => S,
+	bounceInOut: () => C,
+	bounceOut: () => x,
+	cubicIn: () => l,
+	cubicInOut: () => d,
+	cubicOut: () => u,
+	easeInBy: () => n,
+	easeInOutBy: () => i,
+	easeOutBy: () => r,
+	linear: () => a,
+	quadIn: () => o,
+	quadInOut: () => c,
+	quadOut: () => s,
+	quartIn: () => f,
+	quartInOut: () => m,
+	quartOut: () => p,
+	quintIn: () => h,
+	quintInOut: () => _,
+	quintOut: () => g,
+	sineIn: () => v,
+	sineInOut: () => b,
+	sineOut: () => y
+});
+function n(e) {
+	return function(t) {
+		return t ** +e;
+	};
+}
+function r(e) {
+	return function(t) {
+		return 1 - Math.abs((t - 1) ** e);
+	};
+}
+function i(e) {
+	return function(t) {
+		return t < .5 ? n(e)(t * 2) / 2 : r(e)(t * 2 - 1) / 2 + .5;
+	};
+}
+function a(e) {
+	return e;
+}
+var o = n(2), s = r(2), c = i(2), l = n(3), u = r(3), d = i(3), f = n(4), p = r(4), m = i(4), h = n(5), g = r(5), _ = i(5);
+function v(e) {
+	return 1 + Math.sin(Math.PI / 2 * e - Math.PI / 2);
+}
+function y(e) {
+	return Math.sin(Math.PI / 2 * e);
+}
+function b(e) {
+	return (1 + Math.sin(Math.PI * e - Math.PI / 2)) / 2;
+}
+function x(e) {
+	let t = 7.5625, n = 2.75;
+	return e < 1 / n ? t * e * e : e < 2 / n ? (e -= 1.5 / n, t * e * e + .75) : e < 2.5 / n ? (e -= 2.25 / n, t * e * e + .9375) : (e -= 2.625 / n, t * e * e + .984375);
+}
+function S(e) {
+	return 1 - x(1 - e);
+}
+function C(e) {
+	return e < .5 ? S(e * 2) * .5 : x(e * 2 - 1) * .5 + .5;
+}
+//#endregion
+export { t as easing_exports, a as linear };
+/* 独立思考，明辨是非 */

package/tween/src/index.js

@@ -0,0 +1,4 @@
+/* 潘启宝 2026-03-24 15:26:16 星期二 */
+import "./easing.js";
+import "./tween.js";
+/* 独立思考，明辨是非 */

package/tween/src/tween.js

@@ -1,47 +1,32 @@
-/* 2026-01-27 10:43:49 */
-import n from "lodash/isFunction.js";
-import l from "lodash/isString.js";
-import a from "lodash/isUndefined.js";
-import * as u from "./easing.js";
-import { linear as p } from "./easing.js";
-class S {
-  constructor(i) {
-    const {
-      from: s,
-      to: e,
-      duration: r = 500,
-      delay: o = 0,
-      easing: h,
-      onStart: f,
-      onUpdate: m = function() {
-      },
-      onFinish: d
-    } = i;
-    for (const t in s)
-      a(e[t]) && (e[t] = s[t]);
-    for (const t in e)
-      a(s[t]) && (s[t] = e[t]);
-    this.from = s, this.to = e, this.duration = r, this.delay = o, n(h) ? this.easing = h : l(h) && (this.easing = u[h]), this.easing ||= p, this.onStart = f, this.onUpdate = m, this.onFinish = d, this.startTime = Date.now() + this.delay, this.started = !1, this.finished = !1, this.timer = null, this.keys = {};
-  }
-  update() {
-    if (this.time = Date.now(), !(this.time < this.startTime) && !this.finished) {
-      this.elapsed = this.time - this.startTime, this.elapsed = Math.min(this.elapsed, this.duration);
-      for (const i in this.to)
-        this.keys[i] = this.from[i] + (this.to[i] - this.from[i]) * this.easing(this.elapsed / this.duration);
-      this.started || (n(this.onStart) && this.onStart(this.keys), this.started = !0), n(this.onUpdate) && this.onUpdate(this.keys), this.elapsed === this.duration && !this.finished && (this.finished = !0, n(this.onFinish) && this.onFinish(this.keys));
-    }
-  }
-  start() {
-    this.startTime = Date.now() + this.delay, this.started = !1, this.finished = !1;
-    const i = () => {
-      this.update(), this.finished ? this.timer && (cancelAnimationFrame(this.timer), this.timer = null) : this.timer = requestAnimationFrame(i);
-    };
-    this.timer = requestAnimationFrame(i);
-  }
-  stop() {
-    this.timer && (cancelAnimationFrame(this.timer), this.timer = null), this.finished = !0;
-  }
-}
-export {
-  S as default
+/* 潘启宝 2026-03-24 15:26:16 星期二 */
+import { isFunction as e, isString as t, isUndefined as n } from "../../is/index.js";
+import { easing_exports as r, linear as i } from "./easing.js";
+//#region utils/tween/src/tween.js
+var a = class {
+	constructor(a) {
+		let { from: o, to: s, duration: c = 500, delay: l = 0, easing: u, onStart: d, onUpdate: f = function() {}, onFinish: p } = a;
+		for (let e in o) n(s[e]) && (s[e] = o[e]);
+		for (let e in s) n(o[e]) && (o[e] = s[e]);
+		this.from = o, this.to = s, this.duration = c, this.delay = l, e(u) ? this.easing = u : t(u) && (this.easing = r[u]), this.easing ||= i, this.onStart = d, this.onUpdate = f, this.onFinish = p, this.startTime = Date.now() + this.delay, this.started = !1, this.finished = !1, this.timer = null, this.keys = {};
+	}
+	update() {
+		if (this.time = Date.now(), !(this.time < this.startTime) && !this.finished) {
+			this.elapsed = this.time - this.startTime, this.elapsed = Math.min(this.elapsed, this.duration);
+			for (let e in this.to) this.keys[e] = this.from[e] + (this.to[e] - this.from[e]) * this.easing(this.elapsed / this.duration);
+			this.started ||= (e(this.onStart) && this.onStart(this.keys), !0), e(this.onUpdate) && this.onUpdate(this.keys), this.elapsed === this.duration && !this.finished && (this.finished = !0, e(this.onFinish) && this.onFinish(this.keys));
+		}
+	}
+	start() {
+		this.startTime = Date.now() + this.delay, this.started = !1, this.finished = !1;
+		let e = () => {
+			this.update(), this.finished ? this.timer &&= (cancelAnimationFrame(this.timer), null) : this.timer = requestAnimationFrame(e);
+		};
+		this.timer = requestAnimationFrame(e);
+	}
+	stop() {
+		this.timer &&= (cancelAnimationFrame(this.timer), null), this.finished = !0;
+	}
 };
+//#endregion
+export { a as default };
+/* 独立思考，明辨是非 */