@vef-framework/shared 2.0.11 → 2.1.0

package/dist/es/utils/pinyin.js

@@ -1,46 +1,44 @@
-import a from "@pinyin-pro/data/modern";
-import { addDict as c, pinyin as o } from "pinyin-pro";
-import "./lib.js";
-import { isString as f } from "radashi";
-c(a);
-const r = {
-  type: "array",
-  toneType: "none",
-  multiple: !1,
-  nonZh: "consecutive",
-  surname: "head"
-};
-function u(n) {
-  return o(
-    n,
-    {
-      ...r,
-      pattern: "pinyin"
-    }
-  );
+/*! @vef-framework/shared v2.1.0 made by Venus | 2026-03-27T07:12:59.574Z */
+import { isString as e } from "./lib.js";
+import t from "@pinyin-pro/data/modern";
+import { addDict as n, pinyin as r } from "pinyin-pro";
+//#region src/utils/pinyin.ts
+n(t);
+var i = {
+	type: "array",
+	toneType: "none",
+	multiple: !1,
+	nonZh: "consecutive",
+	surname: "head"
+}, a = /* @__PURE__ */ new Map(), o = /* @__PURE__ */ new Map();
+function s(e) {
+	let t = a.get(e);
+	if (t) return t;
+	let n = r(e, {
+		...i,
+		pattern: "pinyin"
+	});
+	return a.set(e, n), n;
 }
-function m(n) {
-  return o(
-    n,
-    {
-      ...r,
-      pattern: "first"
-    }
-  );
+function c(e) {
+	let t = o.get(e);
+	if (t) return t;
+	let n = r(e, {
+		...i,
+		pattern: "first"
+	});
+	return o.set(e, n), n;
 }
-function g(n, ...s) {
-  const i = { ...n };
-  for (const t of s) {
-    const e = n[t];
-    if (f(e)) {
-      const p = `${t}Pinyin`, y = `${t}PinyinInitials`;
-      i[p] = u(e).join(""), i[y] = m(e).join("");
-    }
-  }
-  return i;
+function l(t, ...n) {
+	let r = { ...t };
+	for (let i of n) {
+		let n = t[i];
+		if (e(n)) {
+			let e = `${i}Pinyin`, t = `${i}PinyinInitials`;
+			r[e] = s(n).join(""), r[t] = c(n).join("");
+		}
+	}
+	return r;
 }
-export {
-  u as getPinyin,
-  m as getPinyinInitials,
-  g as withPinyin
-};
+//#endregion
+export { s as getPinyin, c as getPinyinInitials, l as withPinyin };

package/dist/es/utils/security.js

@@ -1,31 +1,73 @@
-import i from "jsencrypt";
-import "./lib.js";
-import { isNullish as e } from "radashi";
-function a(r, t) {
-  if (e(r))
-    throw new Error(`Failed to encrypt data [${r}] using RSA`);
-  if (!t || t.trim() === "")
-    throw new Error(`Failed to encrypt data [${r}] using RSA`);
-  const n = new i();
-  n.setPublicKey(t);
-  const o = n.encrypt(r);
-  if (!o)
-    throw console.error("Failed to encrypt data using RSA", r), new Error(`Failed to encrypt data [${r}] using RSA`);
-  return o;
-}
-function p(r, t) {
-  if (e(r))
-    throw new Error(`Failed to decrypt data [${r}] using RSA`);
-  if (!t || t.trim() === "")
-    throw new Error(`Failed to decrypt data [${r}] using RSA`);
-  const n = new i();
-  n.setPrivateKey(t);
-  const o = n.decrypt(r);
-  if (!o)
-    throw console.error("Failed to decrypt data using RSA", r), new Error(`Failed to decrypt data [${r}] using RSA`);
-  return o;
-}
-export {
-  p as decryptUsingRSA,
-  a as encryptUsingRSA
-};
+/*! @vef-framework/shared v2.1.0 made by Venus | 2026-03-27T07:12:59.574Z */
+import { isNullish as e } from "./lib.js";
+import t from "jsencrypt";
+//#region src/utils/security.ts
+var n = new Uint8Array([
+	90,
+	75,
+	60,
+	45,
+	30,
+	15,
+	154,
+	139,
+	124,
+	109,
+	94,
+	79,
+	58,
+	43,
+	28,
+	13
+]);
+function r(e) {
+	if (!e) return new Uint8Array();
+	let t = new TextEncoder().encode(e), r = new Uint8Array(t.length);
+	for (let [e, i] of t.entries()) r[e] = i ^ n[e % n.length];
+	return r;
+}
+function i(e) {
+	if (!e?.length) return "";
+	let t = e instanceof Uint8Array ? e : new Uint8Array(e), r = new Uint8Array(t.length);
+	for (let [e, i] of t.entries()) r[e] = i ^ n[e % n.length];
+	return new TextDecoder("utf-8").decode(r);
+}
+function a(e) {
+	return [...r(e)].map((e) => e.toString(16).padStart(2, "0")).join("");
+}
+function o(e) {
+	if (!e) return "";
+	let t = new Uint8Array(e.length / 2);
+	for (let n = 0; n < e.length; n += 2) t[n / 2] = Number.parseInt(e.slice(n, n + 2), 16);
+	return i(t);
+}
+function s(e) {
+	let t = r(e);
+	if (t.length === 0) return "";
+	let n = String.fromCodePoint(...t);
+	return btoa(n);
+}
+function c(e) {
+	if (!e) return "";
+	let t = atob(e), n = new Uint8Array(t.length);
+	for (let e = 0; e < t.length; e++) n[e] = t.codePointAt(e);
+	return i(n);
+}
+function l(n, r) {
+	if (e(n) || !r?.trim()) throw Error("Failed to encrypt data using RSA: invalid input");
+	let i = new t();
+	i.setPublicKey(r);
+	let a = i.encrypt(n);
+	if (!a) throw console.error("Failed to encrypt data using RSA"), Error("Failed to encrypt data using RSA");
+	return a;
+}
+function u(n, r) {
+	if (e(n) || !r?.trim()) throw Error("Failed to decrypt data using RSA: invalid input");
+	let i = new t();
+	i.setPrivateKey(r);
+	let a = i.decrypt(n);
+	if (!a) throw console.error("Failed to decrypt data using RSA"), Error("Failed to decrypt data using RSA");
+	return a;
+}
+//#endregion
+export { u as decryptUsingRSA, l as encryptUsingRSA, i as obfuscateDecode, c as obfuscateDecodeFromBase64, o as obfuscateDecodeFromHex, r as obfuscateEncode, s as obfuscateEncodeToBase64, a as obfuscateEncodeToHex };

package/dist/es/utils/string.js

@@ -1,8 +1,20 @@
-import "./lib.js";
-import { snake as o } from "radashi";
-function n(t) {
-  return o(t).toUpperCase();
+/*! @vef-framework/shared v2.1.0 made by Venus | 2026-03-27T07:12:59.574Z */
+import { snakeCase as e } from "./lib.js";
+//#region src/utils/string.ts
+function t(t) {
+	return e(t).toUpperCase();
 }
-export {
-  n as constantCase
-};
+function n(e, t = !0) {
+	if (e === null) return t ? "" : "null";
+	if (e === void 0) return t ? "" : "undefined";
+	if (typeof e == "string") return e;
+	if (typeof e == "number" || typeof e == "boolean" || typeof e == "bigint") return String(e);
+	if (typeof e == "symbol" || typeof e == "function") return e.toString();
+	try {
+		return JSON.stringify(e);
+	} catch {
+		return String(e);
+	}
+}
+//#endregion
+export { t as constantCase, n as stringify };

package/dist/es/utils/table.js

@@ -1,15 +1,15 @@
-import { isDeepEqual as i, isShallowEqual as p } from "./equal.js";
-import "./lib.js";
-import { isPlainObject as l, isArray as f } from "radashi";
-const u = {
-  reference: (e, o) => e === o,
-  shallow: p,
-  deep: i
+/*! @vef-framework/shared v2.1.0 made by Venus | 2026-03-27T07:12:59.574Z */
+import { isDeepEqual as e, isShallowEqual as t } from "./equal.js";
+import { isPlainObject as n } from "./lib.js";
+//#region src/utils/table.ts
+var r = {
+	reference: (e, t) => e === t,
+	shallow: t,
+	deep: e
 };
-function w(e, ...o) {
-  const c = l(e) && !f(e) && "compare" in e, n = c ? e : {}, s = c ? o : [e, ...o], a = u[n.compare ?? "reference"];
-  return (m, t) => s.some((r) => !a(m?.[r], t?.[r]));
+function i(e, ...t) {
+	let i = n(e) && "compare" in e, a = i ? e : {}, o = i ? t : [e, ...t], s = r[a.compare ?? "reference"];
+	return (e, t) => o.some((n) => !s(e?.[n], t?.[n]));
 }
-export {
-  w as shouldUpdateByKeys
-};
+//#endregion
+export { i as shouldUpdateByKeys };

package/dist/es/utils/task.js

@@ -1,8 +1,7 @@
-import "./lib.js";
-import { isFunction as o } from "radashi";
-function t(e) {
-  o(queueMicrotask) ? queueMicrotask(e) : Promise.resolve().then(e);
+/*! @vef-framework/shared v2.1.0 made by Venus | 2026-03-27T07:12:59.574Z */
+//#region src/utils/task.ts
+function e(e) {
+	typeof queueMicrotask == "function" ? queueMicrotask(e) : Promise.resolve().then(e);
 }
-export {
-  t as scheduleMicrotask
-};
+//#endregion
+export { e as scheduleMicrotask };

package/dist/es/utils/tree.js

@@ -1,189 +1,167 @@
-import "./lib.js";
-import { isArray as a, isFunction as g, isNullish as I } from "radashi";
-function y(s, l = {}) {
-  const {
-    childrenKey: d = "children",
-    includeParent: h = !1,
-    includeLevel: o = !1,
-    transform: c,
-    filter: n
-  } = l, e = [];
-  function r(t, u, i = 0) {
-    if (a(t))
-      for (const f of t) {
-        const p = { parent: u, level: i };
-        if (g(n) && !n(f, p)) {
-          const N = f[d];
-          a(N) && r(N, f, i + 1);
-          continue;
-        }
-        let m = f;
-        if (g(c))
-          m = c(f, p);
-        else if (h || o) {
-          const N = { data: f };
-          h && (N.parent = u), o && (N.level = i), m = N;
-        }
-        e.push(m);
-        const x = f[d];
-        a(x) && r(x, f, i + 1);
-      }
-  }
-  return r(s), e;
+/*! @vef-framework/shared v2.1.0 made by Venus | 2026-03-27T07:12:59.574Z */
+import { isArray as e, isFunction as t, isNullish as n } from "./lib.js";
+//#region src/utils/tree.ts
+function r(n, r = {}) {
+	let { childrenKey: i = "children", includeParent: a = !1, includeLevel: o = !1, transform: s, filter: c } = r, l = [];
+	function u(n, r, d = 0) {
+		if (e(n)) for (let f of n) {
+			let n = {
+				parent: r,
+				level: d
+			};
+			if (t(c) && !c(f, n)) {
+				let t = f[i];
+				e(t) && u(t, f, d + 1);
+				continue;
+			}
+			let p = f;
+			if (t(s)) p = s(f, n);
+			else if (a || o) {
+				let e = { data: f };
+				a && (e.parent = r), o && (e.level = d), p = e;
+			}
+			l.push(p);
+			let m = f[i];
+			e(m) && u(m, f, d + 1);
+		}
+	}
+	return u(n), l;
 }
-function T(s, l) {
-  return g(l) ? l(s) : s[l];
+function i(e, n) {
+	return t(n) ? n(e) : e[n];
 }
-function A(s, l = {}) {
-  const {
-    idKey: d = "id",
-    parentIdKey: h = "parentId",
-    childrenKey: o = "children",
-    rootValue: c,
-    transform: n
-  } = l;
-  if (!a(s) || s.length === 0)
-    return [];
-  const e = /* @__PURE__ */ new Map(), r = [];
-  for (const t of s) {
-    const u = T(t, d);
-    e.set(u, { ...t });
-  }
-  for (const t of s) {
-    const u = T(t, d), i = T(t, h), f = e.get(u);
-    if (g(c) ? c(t) : i === c || I(i))
-      r.push(f);
-    else {
-      const m = e.get(i);
-      m ? (a(m[o]) || (m[o] = []), m[o].push(f)) : r.push(f);
-    }
-  }
-  if (g(n)) {
-    let t = function(i, f = 0) {
-      const p = i[o], m = u(i, { children: p, level: f });
-      return a(p) && (m[o] = p.map((x) => t(x, f + 1))), m;
-    };
-    const u = n;
-    return r.map((i) => t(i));
-  }
-  return r;
+function a(r, a = {}) {
+	let { idKey: o = "id", parentIdKey: s = "parentId", childrenKey: c = "children", rootValue: l, transform: u } = a;
+	if (!e(r) || r.length === 0) return [];
+	let d = /* @__PURE__ */ new Map(), f = [];
+	for (let e of r) {
+		let t = i(e, o);
+		d.set(t, { ...e });
+	}
+	for (let a of r) {
+		let r = i(a, o), u = i(a, s), p = d.get(r);
+		if (t(l) ? l(a) : u === l || n(u)) f.push(p);
+		else {
+			let t = d.get(u);
+			t ? (e(t[c]) || (t[c] = []), t[c].push(p)) : f.push(p);
+		}
+	}
+	if (t(u)) {
+		let t = u;
+		function n(r, i = 0) {
+			let a = r[c], o = t(r, {
+				children: a,
+				level: i
+			});
+			return e(a) && (o[c] = a.map((e) => n(e, i + 1))), o;
+		}
+		return f.map((e) => n(e));
+	}
+	return f;
 }
-function C(s, l, d = "children") {
-  function h(o, c, n = 0) {
-    if (a(o))
-      for (const e of o) {
-        if (l(e, { parent: c, level: n }))
-          return e;
-        const r = e[d];
-        if (a(r)) {
-          const t = h(r, e, n + 1);
-          if (t)
-            return t;
-        }
-      }
-  }
-  return h(s);
+function o(t, n, r = "children") {
+	function i(t, a, o = 0) {
+		if (e(t)) for (let s of t) {
+			if (n(s, {
+				parent: a,
+				level: o
+			})) return s;
+			let t = s[r];
+			if (e(t)) {
+				let e = i(t, s, o + 1);
+				if (e) return e;
+			}
+		}
+	}
+	return i(t);
 }
-function F(s, l, d = {}) {
-  const { strategy: h = "dfs", childrenKey: o = "children" } = d;
-  if (a(s))
-    if (h === "bfs") {
-      const c = s.map((n, e) => ({
-        node: n,
-        level: 0,
-        index: e
-      }));
-      for (; c.length > 0; ) {
-        const n = c.shift();
-        l(n.node, {
-          parent: n.parent,
-          level: n.level,
-          index: n.index
-        });
-        const e = n.node[o];
-        if (a(e))
-          for (const [r, t] of e.entries())
-            c.push({
-              node: t,
-              parent: n.node,
-              level: n.level + 1,
-              index: r
-            });
-      }
-    } else {
-      let c = function(n, e, r = 0) {
-        if (a(n))
-          for (const [t, u] of n.entries()) {
-            l(u, {
-              parent: e,
-              level: r,
-              index: t
-            });
-            const i = u[o];
-            a(i) && c(i, u, r + 1);
-          }
-      };
-      c(s);
-    }
+function s(t, n, r = {}) {
+	let { strategy: i = "dfs", childrenKey: a = "children" } = r;
+	if (e(t)) if (i === "bfs") {
+		let r = t.map((e, t) => ({
+			node: e,
+			level: 0,
+			index: t
+		})), i = 0;
+		for (; i < r.length;) {
+			let t = r[i++];
+			n(t.node, {
+				parent: t.parent,
+				level: t.level,
+				index: t.index
+			});
+			let o = t.node[a];
+			if (e(o)) for (let [e, n] of o.entries()) r.push({
+				node: n,
+				parent: t.node,
+				level: t.level + 1,
+				index: e
+			});
+		}
+	} else {
+		function r(t, i, o = 0) {
+			if (e(t)) for (let [s, c] of t.entries()) {
+				n(c, {
+					parent: i,
+					level: o,
+					index: s
+				});
+				let t = c[a];
+				e(t) && r(t, c, o + 1);
+			}
+		}
+		r(t);
+	}
 }
-function R(s, l, d = "children") {
-  function h(o, c, n = 0) {
-    return a(o) ? o.map((e, r) => {
-      const t = l(e, {
-        parent: c,
-        level: n,
-        index: r
-      }), u = e[d];
-      return a(u) && (t[d] = h(u, e, n + 1)), t;
-    }) : [];
-  }
-  return h(s);
+function c(t, n, r = "children") {
+	function i(t, a, o = 0) {
+		return e(t) ? t.map((t, s) => {
+			let c = n(t, {
+				parent: a,
+				level: o,
+				index: s
+			}), l = t[r];
+			return e(l) && (c[r] = i(l, t, o + 1)), c;
+		}) : [];
+	}
+	return i(t);
 }
-function V(s, l, d = "children") {
-  function h(o, c, n = 0) {
-    return a(o) ? o.reduce((e, r, t) => {
-      if (!l(r, {
-        parent: c,
-        level: n,
-        index: t
-      }))
-        return e;
-      const u = r[d], i = { ...r };
-      if (u && a(u)) {
-        const f = h(u, r, n + 1);
-        f.length > 0 ? i[d] = f : delete i[d];
-      }
-      return e.push(i), e;
-    }, []) : [];
-  }
-  return h(s);
+function l(t, n, r = "children") {
+	function i(t, a, o = 0) {
+		return e(t) ? t.reduce((t, s, c) => {
+			if (!n(s, {
+				parent: a,
+				level: o,
+				index: c
+			})) return t;
+			let l = s[r], u = { ...s };
+			if (l && e(l)) {
+				let e = i(l, s, o + 1);
+				e.length > 0 ? u[r] = e : delete u[r];
+			}
+			return t.push(u), t;
+		}, []) : [];
+	}
+	return i(t);
 }
-function b(s, l, d = "children") {
-  function h(o, c, n = 0) {
-    if (!a(o))
-      return [];
-    const e = [];
-    for (const [r, t] of o.entries()) {
-      const u = l(t, {
-        parent: c,
-        level: n,
-        index: r
-      }), i = t[d], f = a(i) ? h(i, t, n + 1) : [];
-      if (u || f.length > 0) {
-        const p = { ...t };
-        f.length > 0 ? p[d] = f : delete p[d], e.push(p);
-      }
-    }
-    return e;
-  }
-  return h(s);
+function u(t, n, r = "children") {
+	function i(t, a, o = 0) {
+		if (!e(t)) return [];
+		let s = [];
+		for (let [c, l] of t.entries()) {
+			let t = n(l, {
+				parent: a,
+				level: o,
+				index: c
+			}), u = l[r], d = e(u) ? i(u, l, o + 1) : [];
+			if (t || d.length > 0) {
+				let e = { ...l };
+				d.length > 0 ? e[r] = d : delete e[r], s.push(e);
+			}
+		}
+		return s;
+	}
+	return i(t);
 }
-export {
-  A as buildTree,
-  V as filterTree,
-  b as filterTreeWithAncestors,
-  C as findNodeInTree,
-  y as flattenTree,
-  R as mapTree,
-  F as traverseTree
-};
+//#endregion
+export { a as buildTree, l as filterTree, u as filterTreeWithAncestors, o as findNodeInTree, r as flattenTree, c as mapTree, s as traverseTree };

package/dist/es/utils/zod.js

@@ -1,7 +1,7 @@
-import { z as o } from "zod";
-import { z as t } from "zod";
-import { zhCN as r } from "zod/locales";
-o.config(r());
-export {
-  t as z
-};
+/*! @vef-framework/shared v2.1.0 made by Venus | 2026-03-27T07:12:59.574Z */
+import { z as e, z as t } from "zod";
+import { zhCN as n } from "zod/locales";
+//#region src/utils/zod.ts
+e.config(n());
+//#endregion
+export { t as z };