@vef-framework/shared 2.0.4 → 2.0.6

package/dist/cjs/utils/tree.cjs

@@ -1,262 +1 @@
-/*! @vef-framework/shared v2.0.2 made with ❤️ by Venus | 2025-11-25T15:03:13.127Z */
-'use strict';
-
-Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
-
-require('./lib.cjs');
-const radashi = require('radashi');
-
-function flattenTree(tree, options = {}) {
-  const {
-    childrenKey = "children",
-    includeParent = false,
-    includeLevel = false,
-    transform,
-    filter
-  } = options;
-  const result = [];
-  function traverse(nodes, parent, level = 0) {
-    if (!radashi.isArray(nodes)) {
-      return;
-    }
-    for (const node of nodes) {
-      const context = { parent, level };
-      if (radashi.isFunction(filter) && !filter(node, context)) {
-        const children2 = node[childrenKey];
-        if (radashi.isArray(children2)) {
-          traverse(children2, node, level + 1);
-        }
-        continue;
-      }
-      let newNode = node;
-      if (radashi.isFunction(transform)) {
-        newNode = transform(node, context);
-      } else if (includeParent || includeLevel) {
-        const flattenedNode = { data: node };
-        if (includeParent) {
-          flattenedNode.parent = parent;
-        }
-        if (includeLevel) {
-          flattenedNode.level = level;
-        }
-        newNode = flattenedNode;
-      }
-      result.push(newNode);
-      const children = node[childrenKey];
-      if (radashi.isArray(children)) {
-        traverse(children, node, level + 1);
-      }
-    }
-  }
-  traverse(tree);
-  return result;
-}
-function getNodeValue(node, accessor) {
-  return radashi.isFunction(accessor) ? accessor(node) : node[accessor];
-}
-function buildTree(nodes, options = {}) {
-  const {
-    idKey = "id",
-    parentIdKey = "parentId",
-    childrenKey = "children",
-    rootValue,
-    transform
-  } = options;
-  if (!radashi.isArray(nodes) || nodes.length === 0) {
-    return [];
-  }
-  const nodeMap = /* @__PURE__ */ new Map();
-  const rootNodes = [];
-  for (const node of nodes) {
-    const nodeId = getNodeValue(node, idKey);
-    nodeMap.set(nodeId, { ...node });
-  }
-  for (const originalNode of nodes) {
-    const nodeId = getNodeValue(originalNode, idKey);
-    const parentId = getNodeValue(originalNode, parentIdKey);
-    const node = nodeMap.get(nodeId);
-    const isRoot = radashi.isFunction(rootValue) ? rootValue(originalNode) : parentId === rootValue || radashi.isNullish(parentId);
-    if (isRoot) {
-      rootNodes.push(node);
-    } else {
-      const parentNode = nodeMap.get(parentId);
-      if (parentNode) {
-        if (!radashi.isArray(parentNode[childrenKey])) {
-          parentNode[childrenKey] = [];
-        }
-        parentNode[childrenKey].push(node);
-      } else {
-        rootNodes.push(node);
-      }
-    }
-  }
-  if (radashi.isFunction(transform)) {
-    let transformNode = function(node, level = 0) {
-      const children = node[childrenKey];
-      const transformedNode = transformFn(node, { children, level });
-      if (radashi.isArray(children)) {
-        transformedNode[childrenKey] = children.map((child) => transformNode(child, level + 1));
-      }
-      return transformedNode;
-    };
-    const transformFn = transform;
-    return rootNodes.map((node) => transformNode(node));
-  }
-  return rootNodes;
-}
-function findNodeInTree(tree, predicate, childrenKey = "children") {
-  function search(nodes, parent, level = 0) {
-    if (radashi.isArray(nodes)) {
-      for (const node of nodes) {
-        if (predicate(node, { parent, level })) {
-          return node;
-        }
-        const children = node[childrenKey];
-        if (radashi.isArray(children)) {
-          const found = search(children, node, level + 1);
-          if (found) {
-            return found;
-          }
-        }
-      }
-    }
-  }
-  return search(tree);
-}
-function traverseTree(tree, callback, options = {}) {
-  const { strategy = "dfs", childrenKey = "children" } = options;
-  if (!radashi.isArray(tree)) {
-    return;
-  }
-  if (strategy === "bfs") {
-    const queue = tree.map((node, index) => {
-      return {
-        node,
-        level: 0,
-        index
-      };
-    });
-    while (queue.length > 0) {
-      const item = queue.shift();
-      callback(item.node, {
-        parent: item.parent,
-        level: item.level,
-        index: item.index
-      });
-      const children = item.node[childrenKey];
-      if (radashi.isArray(children)) {
-        for (const [index, child] of children.entries()) {
-          queue.push({
-            node: child,
-            parent: item.node,
-            level: item.level + 1,
-            index
-          });
-        }
-      }
-    }
-  } else {
-    let traverse = function(nodes, parent, level = 0) {
-      if (!radashi.isArray(nodes)) {
-        return;
-      }
-      for (const [index, node] of nodes.entries()) {
-        callback(node, {
-          parent,
-          level,
-          index
-        });
-        const children = node[childrenKey];
-        if (radashi.isArray(children)) {
-          traverse(children, node, level + 1);
-        }
-      }
-    };
-    traverse(tree);
-  }
-}
-function mapTree(tree, callback, childrenKey = "children") {
-  function transform(nodes, parent, level = 0) {
-    if (!radashi.isArray(nodes)) {
-      return [];
-    }
-    return nodes.map((node, index) => {
-      const mappedNode = callback(node, {
-        parent,
-        level,
-        index
-      });
-      const children = node[childrenKey];
-      if (radashi.isArray(children)) {
-        mappedNode[childrenKey] = transform(children, node, level + 1);
-      }
-      return mappedNode;
-    });
-  }
-  return transform(tree);
-}
-function filterTree(tree, predicate, childrenKey = "children") {
-  function filter(nodes, parent, level = 0) {
-    if (!radashi.isArray(nodes)) {
-      return [];
-    }
-    return nodes.reduce((acc, node, index) => {
-      if (!predicate(node, {
-        parent,
-        level,
-        index
-      })) {
-        return acc;
-      }
-      const children = node[childrenKey];
-      const newNode = { ...node };
-      if (children && radashi.isArray(children)) {
-        const filteredChildren = filter(children, node, level + 1);
-        if (filteredChildren.length > 0) {
-          newNode[childrenKey] = filteredChildren;
-        } else {
-          delete newNode[childrenKey];
-        }
-      }
-      acc.push(newNode);
-      return acc;
-    }, []);
-  }
-  return filter(tree);
-}
-function filterTreeWithAncestors(tree, predicate, childrenKey = "children") {
-  function filter(nodes, parent, level = 0) {
-    if (!radashi.isArray(nodes)) {
-      return [];
-    }
-    const result = [];
-    for (const [index, node] of nodes.entries()) {
-      const nodeMatches = predicate(node, {
-        parent,
-        level,
-        index
-      });
-      const children = node[childrenKey];
-      const filteredChildren = radashi.isArray(children) ? filter(children, node, level + 1) : [];
-      if (nodeMatches || filteredChildren.length > 0) {
-        const newNode = { ...node };
-        if (filteredChildren.length > 0) {
-          newNode[childrenKey] = filteredChildren;
-        } else {
-          delete newNode[childrenKey];
-        }
-        result.push(newNode);
-      }
-    }
-    return result;
-  }
-  return filter(tree);
-}
-
-exports.buildTree = buildTree;
-exports.filterTree = filterTree;
-exports.filterTreeWithAncestors = filterTreeWithAncestors;
-exports.findNodeInTree = findNodeInTree;
-exports.flattenTree = flattenTree;
-exports.mapTree = mapTree;
-exports.traverseTree = traverseTree;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});require("./lib.cjs");const i=require("radashi");function N(c,l={}){const{childrenKey:a="children",includeParent:h=!1,includeLevel:o=!1,transform:u,filter:e}=l,r=[];function t(n,d,s=0){if(i.isArray(n))for(const f of n){const p={parent:d,level:s};if(i.isFunction(e)&&!e(f,p)){const A=f[a];i.isArray(A)&&t(A,f,s+1);continue}let y=f;if(i.isFunction(u))y=u(f,p);else if(h||o){const A={data:f};h&&(A.parent=d),o&&(A.level=s),y=A}r.push(y);const m=f[a];i.isArray(m)&&t(m,f,s+1)}}return t(c),r}function T(c,l){return i.isFunction(l)?l(c):c[l]}function g(c,l={}){const{idKey:a="id",parentIdKey:h="parentId",childrenKey:o="children",rootValue:u,transform:e}=l;if(!i.isArray(c)||c.length===0)return[];const r=new Map,t=[];for(const n of c){const d=T(n,a);r.set(d,{...n})}for(const n of c){const d=T(n,a),s=T(n,h),f=r.get(d);if(i.isFunction(u)?u(n):s===u||i.isNullish(s))t.push(f);else{const y=r.get(s);y?(i.isArray(y[o])||(y[o]=[]),y[o].push(f)):t.push(f)}}if(i.isFunction(e)){let n=function(s,f=0){const p=s[o],y=d(s,{children:p,level:f});return i.isArray(p)&&(y[o]=p.map(m=>n(m,f+1))),y};const d=e;return t.map(s=>n(s))}return t}function I(c,l,a="children"){function h(o,u,e=0){if(i.isArray(o))for(const r of o){if(l(r,{parent:u,level:e}))return r;const t=r[a];if(i.isArray(t)){const n=h(t,r,e+1);if(n)return n}}}return h(c)}function x(c,l,a={}){const{strategy:h="dfs",childrenKey:o="children"}=a;if(i.isArray(c))if(h==="bfs"){const u=c.map((e,r)=>({node:e,level:0,index:r}));for(;u.length>0;){const e=u.shift();l(e.node,{parent:e.parent,level:e.level,index:e.index});const r=e.node[o];if(i.isArray(r))for(const[t,n]of r.entries())u.push({node:n,parent:e.node,level:e.level+1,index:t})}}else{let u=function(e,r,t=0){if(i.isArray(e))for(const[n,d]of e.entries()){l(d,{parent:r,level:t,index:n});const s=d[o];i.isArray(s)&&u(s,d,t+1)}};u(c)}}function F(c,l,a="children"){function h(o,u,e=0){return i.isArray(o)?o.map((r,t)=>{const n=l(r,{parent:u,level:e,index:t}),d=r[a];return i.isArray(d)&&(n[a]=h(d,r,e+1)),n}):[]}return h(c)}function w(c,l,a="children"){function h(o,u,e=0){return i.isArray(o)?o.reduce((r,t,n)=>{if(!l(t,{parent:u,level:e,index:n}))return r;const d=t[a],s={...t};if(d&&i.isArray(d)){const f=h(d,t,e+1);f.length>0?s[a]=f:delete s[a]}return r.push(s),r},[]):[]}return h(c)}function b(c,l,a="children"){function h(o,u,e=0){if(!i.isArray(o))return[];const r=[];for(const[t,n]of o.entries()){const d=l(n,{parent:u,level:e,index:t}),s=n[a],f=i.isArray(s)?h(s,n,e+1):[];if(d||f.length>0){const p={...n};f.length>0?p[a]=f:delete p[a],r.push(p)}}return r}return h(c)}exports.buildTree=g;exports.filterTree=w;exports.filterTreeWithAncestors=b;exports.findNodeInTree=I;exports.flattenTree=N;exports.mapTree=F;exports.traverseTree=x;

package/dist/cjs/utils/zod.cjs

@@ -1,14 +1 @@
-/*! @vef-framework/shared v2.0.2 made with ❤️ by Venus | 2025-11-25T15:03:13.127Z */
-'use strict';
-
-Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });
-
-const zod = require('zod');
-const locales = require('zod/locales');
-
-zod.z.config(locales.zhCN());
-
-Object.defineProperty(exports, "z", {
-	enumerable: true,
-	get: () => zod.z
-});
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("zod"),r=require("zod/locales");e.z.config(r.zhCN());Object.defineProperty(exports,"z",{enumerable:!0,get:()=>e.z});

package/dist/es/color/color-ops.js

@@ -1,62 +1,68 @@
-/*! @vef-framework/shared v2.0.2 made with ❤️ by Venus | 2025-11-25T15:03:13.127Z */
-import { extend, colord } from 'colord';
-import labPlugin from 'colord/plugins/lab';
-import mixPlugin from 'colord/plugins/mix';
-import namesPlugin from 'colord/plugins/names';
-
-extend([namesPlugin, mixPlugin, labPlugin]);
-const WHITE_COLOR = "#ffffff";
-function isValidColor(color) {
-  return colord(color).isValid();
-}
-function toHexColor(color) {
-  return colord(color).toHex();
-}
-function toRgbColor(color) {
-  return colord(color).toRgb();
-}
-function toHslColor(color) {
-  return colord(color).toHsl();
-}
-function toHsvColor(color) {
-  return colord(color).toHsv();
-}
-function getColorDifference(firstColor, secondColor) {
-  return colord(firstColor).delta(secondColor);
-}
-function convertHslToHex(hslColor) {
-  return colord(hslColor).toHex();
-}
-function setColorAlpha(color, alphaValue) {
-  return colord(color).alpha(alphaValue).toHex();
-}
-function mixColor(baseColor, blendColor, blendRatio) {
-  return colord(baseColor).mix(blendColor, blendRatio).toHex();
-}
-function convertTransparentToOpaque(color, alphaValue, backgroundColor = WHITE_COLOR) {
-  const transparentColor = setColorAlpha(color, alphaValue);
-  const {
-    r: foregroundR,
-    g: foregroundG,
-    b: foregroundB
-  } = colord(transparentColor).toRgb();
-  const {
-    r: backgroundR,
-    g: backgroundG,
-    b: backgroundB
-  } = colord(backgroundColor).toRgb();
-  const resultRgb = {
-    r: calculateRgbComponent(foregroundR, backgroundR, alphaValue),
-    g: calculateRgbComponent(foregroundG, backgroundG, alphaValue),
-    b: calculateRgbComponent(foregroundB, backgroundB, alphaValue)
+import { extend as b, colord as t } from "colord";
+import x from "colord/plugins/lab";
+import C from "colord/plugins/mix";
+import d from "colord/plugins/names";
+b([d, C, x]);
+const u = "#ffffff";
+function O(o) {
+  return t(o).isValid();
+}
+function P(o) {
+  return t(o).toHex();
+}
+function k(o) {
+  return t(o).toRgb();
+}
+function q(o) {
+  return t(o).toHsl();
+}
+function B(o) {
+  return t(o).toHsv();
+}
+function E(o, r) {
+  return t(o).delta(r);
+}
+function G(o) {
+  return t(o).toHex();
+}
+function R(o, r) {
+  return t(o).alpha(r).toHex();
+}
+function W(o, r, n) {
+  return t(o).mix(r, n).toHex();
+}
+function A(o, r, n = u) {
+  const i = R(o, r), {
+    r: f,
+    g: c,
+    b: l
+  } = t(i).toRgb(), {
+    r: s,
+    g,
+    b: m
+  } = t(n).toRgb(), H = {
+    r: e(f, s, r),
+    g: e(c, g, r),
+    b: e(l, m, r)
   };
-  return colord(resultRgb).toHex();
+  return t(H).toHex();
 }
-function isWhiteColor(color) {
-  return colord(color).isEqual(WHITE_COLOR);
+function D(o) {
+  return t(o).isEqual(u);
 }
-function calculateRgbComponent(foregroundValue, backgroundValue, alphaValue) {
-  return backgroundValue + (foregroundValue - backgroundValue) * alphaValue;
+function e(o, r, n) {
+  return r + (o - r) * n;
 }
-
-export { convertHslToHex, convertTransparentToOpaque, getColorDifference, isValidColor, isWhiteColor, mixColor, setColorAlpha, toHexColor, toHslColor, toHsvColor, toRgbColor };
+export {
+  G as convertHslToHex,
+  A as convertTransparentToOpaque,
+  E as getColorDifference,
+  O as isValidColor,
+  D as isWhiteColor,
+  W as mixColor,
+  R as setColorAlpha,
+  P as toHexColor,
+  q as toHslColor,
+  B as toHsvColor,
+  k as toRgbColor
+};

package/dist/es/color/index.js

@@ -1,4 +1,18 @@
-/*! @vef-framework/shared v2.0.2 made with ❤️ by Venus | 2025-11-25T15:03:13.127Z */
-export { convertHslToHex, convertTransparentToOpaque, getColorDifference, isValidColor, isWhiteColor, mixColor, setColorAlpha, toHexColor, toHslColor, toHsvColor, toRgbColor } from './color-ops.js';
-export { getColorName } from './name.js';
-export { getColorPalette } from './palette.js';
+import { convertHslToHex as e, convertTransparentToOpaque as t, getColorDifference as l, isValidColor as C, isWhiteColor as a, mixColor as s, setColorAlpha as i, toHexColor as p, toHslColor as x, toHsvColor as f, toRgbColor as m } from "./color-ops.js";
+import { getColorName as H } from "./name.js";
+import { getColorPalette as c } from "./palette.js";
+export {
+  e as convertHslToHex,
+  t as convertTransparentToOpaque,
+  l as getColorDifference,
+  H as getColorName,
+  c as getColorPalette,
+  C as isValidColor,
+  a as isWhiteColor,
+  s as mixColor,
+  i as setColorAlpha,
+  p as toHexColor,
+  x as toHslColor,
+  f as toHsvColor,
+  m as toRgbColor
+};

package/dist/es/color/name.js

@@ -1,45 +1,32 @@
-/*! @vef-framework/shared v2.0.2 made with ❤️ by Venus | 2025-11-25T15:03:13.127Z */
-import '../constants/index.js';
-import { toHexColor, toRgbColor, toHslColor } from './color-ops.js';
-import { colorEntries } from '../constants/color-names.js';
-
-const COLOR_DISTANCE_WEIGHTS = {
+import "../constants/index.js";
+import { toHexColor as p, toRgbColor as m, toHslColor as C } from "./color-ops.js";
+import { colorEntries as i } from "../constants/color-names.js";
+const f = {
   RGB: 1,
   HSL: 2
 };
-function getColorName(color) {
-  const inputHex = toHexColor(color);
-  const inputRgb = toRgbColor(color);
-  const inputHsl = toHslColor(color);
-  let closestColorName = "";
-  let smallestDistance = Number.POSITIVE_INFINITY;
-  let closestColorIndex = -1;
-  const exactMatch = colorEntries.find(([hexValue]) => inputHex === hexValue);
-  if (exactMatch) {
-    return exactMatch[1];
+function b(t) {
+  const o = p(t), n = m(t), r = C(t);
+  let e = "", c = Number.POSITIVE_INFINITY, s = -1;
+  const a = i.find(([l]) => o === l);
+  if (a)
+    return a[1];
+  for (const [l, [H, I]] of i.entries()) {
+    const u = R(n, r, H);
+    u < c && (c = u, e = I, s = l);
   }
-  for (const [index, [hexValue, colorName]] of colorEntries.entries()) {
-    const distance = calculateColorDistance(inputRgb, inputHsl, hexValue);
-    if (distance < smallestDistance) {
-      smallestDistance = distance;
-      closestColorName = colorName;
-      closestColorIndex = index;
-    }
-  }
-  return closestColorName || colorEntries[closestColorIndex]?.[1] || "Unknown";
+  return e || i[s]?.[1] || "Unknown";
 }
-function calculateRgbDistance(rgb1, rgb2) {
-  return (rgb1.r - rgb2.r) ** 2 + (rgb1.g - rgb2.g) ** 2 + (rgb1.b - rgb2.b) ** 2;
+function D(t, o) {
+  return (t.r - o.r) ** 2 + (t.g - o.g) ** 2 + (t.b - o.b) ** 2;
 }
-function calculateHslDistance(hsl1, hsl2) {
-  return (hsl1.h - hsl2.h) ** 2 + (hsl1.s - hsl2.s) ** 2 + (hsl1.l - hsl2.l) ** 2;
+function N(t, o) {
+  return (t.h - o.h) ** 2 + (t.s - o.s) ** 2 + (t.l - o.l) ** 2;
 }
-function calculateColorDistance(sourceRgb, sourceHsl, targetHex) {
-  const targetRgb = toRgbColor(targetHex);
-  const targetHsl = toHslColor(targetHex);
-  const rgbDistance = calculateRgbDistance(sourceRgb, targetRgb);
-  const hslDistance = calculateHslDistance(sourceHsl, targetHsl);
-  return rgbDistance * COLOR_DISTANCE_WEIGHTS.RGB + hslDistance * COLOR_DISTANCE_WEIGHTS.HSL;
+function R(t, o, n) {
+  const r = m(n), e = C(n), c = D(t, r), s = N(o, e);
+  return c * f.RGB + s * f.HSL;
 }
-
-export { getColorName };
+export {
+  b as getColorName
+};