a2bei4-utils 1.0.3 → 1.0.5

package/dist/menu.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"menu.cjs","sources":["../src/source/menu.js"],"sourcesContent":["/**\r\n * 处理数据库菜单项，生成 UI 菜单树和路由配置。\r\n *\r\n * @param {Array<Object>} menuItems - 原始菜单项数组，树形结构\r\n * @param {Object} [options] - 配置选项\r\n * @param {string} [options.idKey='id'] - 数据源 ID 键名\r\n * @param {string} [options.codeKey='code'] - 数据源编码键名, 用于拼接路由名称和路由路径\r\n * @param {string} [options.labelKey='text'] - 数据源标签键名\r\n * @param {string} [options.childrenKey='children'] - 数据源子节点键名\r\n * @param {string} [options.extendKey='extend'] - 数据源扩展对象键名\r\n * @param {string} [options.menuIdKey='key'] - 输出菜单 ID 键名\r\n * @param {string} [options.menuLabelKey='label'] - 输出菜单标签键名\r\n * @param {string} [options.menuChildrenKey='children'] - 输出菜单子节点键名\r\n * @param {string} [options.menuExtendKey='extend'] - 输出菜单扩展对象键名\r\n * @param {string} [options.routeNameKey='name'] - 路由名称键名\r\n * @param {string} [options.routePathKey='path'] - 路由路径键名\r\n * @param {string} [options.routeMetaKey='meta'] - 路由元数据键名\r\n * @param {Function} [options.handleNodeItem] - 节点处理钩子，参数：(nodeSimple) => void\r\n * @param {Function} [options.handleMenuItem] - 菜单项处理钩子，参数：(uiMenuItem, nodeSimple) => void\r\n * @param {Function} [options.handleRouteItem] - 路由项处理钩子，参数：(routeItem, nodeSimple) => void\r\n *\r\n * @returns {Object} 处理结果\r\n * @returns {Array<Object>} returns.uiMenuItems - UI 菜单树形结构数组\r\n * @returns {Array<Object>} returns.routeItems - 扁平化路由配置数组\r\n * @returns {Map<string, Object>} returns.nodeMap - 节点 ID 到节点数据的映射表\r\n *\r\n * @example\r\n * const menuItems = [\r\n *   { id: '1', code: 'system', text: '系统管理', children: [\r\n *     { id: '1-1', code: 'user', text: '用户管理' }\r\n *   ]}\r\n * ];\r\n *\r\n * const result = handleDbMenuItems(menuItems, {\r\n *   handleRouteItem: (route, node) => {\r\n *     route.component = () => import(`./views/${node.code}.vue`);\r\n *   }\r\n * });\r\n *\r\n * // result.uiMenuItems: [{ key: '1', label: '系统管理', children: [...] }]\r\n * // result.routeItems: [{ name: 'system.user', path: '/system/user', meta: { id: '1-1' } }]\r\n * // result.nodeMap: Map { '1' => {...}, '1-1' => {...} }\r\n */\r\nexport function handleDbMenuItems(menuItems, options = {}) {\r\n    // 1. 统一配置项，简化调用\r\n    const {\r\n        // 数据源键名\r\n        idKey = \"id\",\r\n        codeKey = \"code\",\r\n        labelKey = \"text\",\r\n        childrenKey = \"children\",\r\n        extendKey = \"extend\",\r\n\r\n        // 输出目标键名\r\n        menuIdKey = \"key\",\r\n        menuLabelKey = \"label\",\r\n        menuChildrenKey = \"children\",\r\n        menuExtendKey = \"extend\",\r\n\r\n        routeNameKey = \"name\",\r\n        routePathKey = \"path\",\r\n        routeMetaKey = \"meta\",\r\n\r\n        // 钩子函数\r\n        handleNodeItem,\r\n        handleMenuItem,\r\n        handleRouteItem\r\n    } = options;\r\n\r\n    const uiMenuItems = [];\r\n    const routeItems = [];\r\n    const nodeMap = new Map(); // id -> node (纯净的节点数据)\r\n    const nodePathMap = new Map(); // id -> [{ code, id }] (仅存储路径计算所需的轻量数据)\r\n\r\n    /* ---------- 1. 建立索引：扁平化节点 & 构建路径索引 ---------- */\r\n    // 使用栈进行深度优先遍历，记录路径\r\n    const stack = [];\r\n    if (Array.isArray(menuItems)) {\r\n        menuItems.forEach((n) => stack.push({ node: n, parentPath: [] }));\r\n    }\r\n\r\n    while (stack.length) {\r\n        const { node, parentPath } = stack.pop();\r\n        const idValue = node[idKey];\r\n\r\n        // 构建当前节点的路径片段\r\n        const currentPathSegment = { [idKey]: idValue };\r\n        const fullPath = [...parentPath, currentPathSegment];\r\n\r\n        // 存储路径信息用于后续路由生成\r\n        nodePathMap.set(idValue, fullPath);\r\n\r\n        // 创建轻量级的节点对象存入 nodeMap\r\n        // 注意：这里先创建基础结构，路由信息在第二步补充\r\n        const nodeSimple = {\r\n            ...node,\r\n            [extendKey]: {}, // 初始化扩展对象\r\n            [childrenKey]: null // 去除原始 children，避免引用污染\r\n        };\r\n        nodeMap.set(idValue, nodeSimple);\r\n\r\n        // 处理子节点\r\n        const childrenNodes = node[childrenKey];\r\n        if (Array.isArray(childrenNodes)) {\r\n            // 逆序压栈，保持原序\r\n            for (let i = childrenNodes.length - 1; i >= 0; i--) {\r\n                stack.push({ node: childrenNodes[i], parentPath: fullPath });\r\n            }\r\n        }\r\n    }\r\n\r\n    /* ---------- 2. 构建树形结构 & 生成路由 ---------- */\r\n    const buildStack = [];\r\n    if (Array.isArray(menuItems)) {\r\n        for (let i = menuItems.length - 1; i >= 0; i--) {\r\n            buildStack.push({ node: menuItems[i], parentUi: undefined });\r\n        }\r\n    }\r\n\r\n    while (buildStack.length) {\r\n        const { node, parentUi } = buildStack.pop();\r\n        const idValue = node[idKey];\r\n\r\n        // 从 Map 中取出之前创建好的节点对象\r\n        const nodeSimple = nodeMap.get(idValue);\r\n\r\n        // 2.1 构建 UI 菜单项\r\n        const uiMenuItem = {\r\n            [menuIdKey]: idValue,\r\n            [menuLabelKey]: node[labelKey],\r\n            [menuExtendKey]: {} // UI 菜单专用扩展\r\n        };\r\n\r\n        // 处理子节点\r\n        const childrenNodes = node[childrenKey];\r\n        const hasChildren = Array.isArray(childrenNodes) && childrenNodes.length > 0;\r\n\r\n        if (hasChildren) {\r\n            // 有子节点 -> 继续压栈，传递当前 uiMenuItem 作为父级\r\n            for (let i = childrenNodes.length - 1; i >= 0; i--) {\r\n                buildStack.push({ node: childrenNodes[i], parentUi: uiMenuItem });\r\n            }\r\n        } else {\r\n            // 2.2 无子节点 -> 生成路由配置\r\n\r\n            // 提取 code 和 id 数组\r\n            const codePaths = [],\r\n                keyPaths = [];\r\n            nodePathMap.get(idValue).forEach((item) => {\r\n                const idValue = item[idKey];\r\n                const nodeSimple = nodeMap.get(idValue);\r\n                keyPaths.push(idValue);\r\n                codePaths.push(nodeSimple[codeKey]);\r\n            });\r\n\r\n            const routeName = codePaths.join(\".\");\r\n            const routePath = \"/\" + codePaths.join(\"/\");\r\n\r\n            const routeItem = {\r\n                [routeNameKey]: routeName,\r\n                [routePathKey]: routePath,\r\n                [routeMetaKey]: { [idKey]: idValue }\r\n            };\r\n\r\n            // 执行路由钩子\r\n            if (typeof handleRouteItem === \"function\") {\r\n                handleRouteItem(routeItem, nodeSimple);\r\n            }\r\n            routeItems.push(routeItem);\r\n\r\n            // 补充扩展信息\r\n            uiMenuItem[menuExtendKey].routeName = routeName;\r\n            uiMenuItem[menuExtendKey].keyPaths = keyPaths;\r\n\r\n            nodeSimple[extendKey].routeName = routeName;\r\n            nodeSimple[extendKey].keyPaths = keyPaths;\r\n        }\r\n\r\n        // 2.3 挂载到父级 UI 或根数组\r\n        if (parentUi) {\r\n            // 逻辑赋值，确保 children 数组存在\r\n            (parentUi[menuChildrenKey] || (parentUi[menuChildrenKey] = [])).push(uiMenuItem);\r\n        } else {\r\n            if (typeof handleMenuItem === \"function\") {\r\n                handleMenuItem(uiMenuItem, nodeSimple);\r\n            }\r\n            uiMenuItems.push(uiMenuItem);\r\n        }\r\n\r\n        // 执行节点钩子\r\n        if (typeof handleNodeItem === \"function\") {\r\n            handleNodeItem(nodeSimple);\r\n        }\r\n    }\r\n\r\n    return { uiMenuItems, routeItems, nodeMap };\r\n}\r\n"],"names":[],"mappings":";;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,iBAAiB,CAAC,SAAS,EAAE,OAAO,GAAG,EAAE,EAAE;AAC3D;AACA,IAAI,MAAM;AACV;AACA,QAAQ,KAAK,GAAG,IAAI;AACpB,QAAQ,OAAO,GAAG,MAAM;AACxB,QAAQ,QAAQ,GAAG,MAAM;AACzB,QAAQ,WAAW,GAAG,UAAU;AAChC,QAAQ,SAAS,GAAG,QAAQ;AAC5B;AACA;AACA,QAAQ,SAAS,GAAG,KAAK;AACzB,QAAQ,YAAY,GAAG,OAAO;AAC9B,QAAQ,eAAe,GAAG,UAAU;AACpC,QAAQ,aAAa,GAAG,QAAQ;AAChC;AACA,QAAQ,YAAY,GAAG,MAAM;AAC7B,QAAQ,YAAY,GAAG,MAAM;AAC7B,QAAQ,YAAY,GAAG,MAAM;AAC7B;AACA;AACA,QAAQ,cAAc;AACtB,QAAQ,cAAc;AACtB,QAAQ,eAAe;AACvB,KAAK,GAAG,OAAO,CAAC;AAChB;AACA,IAAI,MAAM,WAAW,GAAG,EAAE,CAAC;AAC3B,IAAI,MAAM,UAAU,GAAG,EAAE,CAAC;AAC1B,IAAI,MAAM,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC;AAC9B,IAAI,MAAM,WAAW,GAAG,IAAI,GAAG,EAAE,CAAC;AAClC;AACA;AACA;AACA,IAAI,MAAM,KAAK,GAAG,EAAE,CAAC;AACrB,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE;AAClC,QAAQ,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;AAC1E,IAAI,CAAC;AACL;AACA,IAAI,OAAO,KAAK,CAAC,MAAM,EAAE;AACzB,QAAQ,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;AACjD,QAAQ,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;AACpC;AACA;AACA,QAAQ,MAAM,kBAAkB,GAAG,EAAE,CAAC,KAAK,GAAG,OAAO,EAAE,CAAC;AACxD,QAAQ,MAAM,QAAQ,GAAG,CAAC,GAAG,UAAU,EAAE,kBAAkB,CAAC,CAAC;AAC7D;AACA;AACA,QAAQ,WAAW,CAAC,GAAG,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;AAC3C;AACA;AACA;AACA,QAAQ,MAAM,UAAU,GAAG;AAC3B,YAAY,GAAG,IAAI;AACnB,YAAY,CAAC,SAAS,GAAG,EAAE;AAC3B,YAAY,CAAC,WAAW,GAAG,IAAI;AAC/B,SAAS,CAAC;AACV,QAAQ,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;AACzC;AACA;AACA,QAAQ,MAAM,aAAa,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC;AAChD,QAAQ,IAAI,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,EAAE;AAC1C;AACA,YAAY,KAAK,IAAI,CAAC,GAAG,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;AAChE,gBAAgB,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,QAAQ,EAAE,CAAC,CAAC;AAC7E,YAAY,CAAC;AACb,QAAQ,CAAC;AACT,IAAI,CAAC;AACL;AACA;AACA,IAAI,MAAM,UAAU,GAAG,EAAE,CAAC;AAC1B,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE;AAClC,QAAQ,KAAK,IAAI,CAAC,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;AACxD,YAAY,UAAU,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,CAAC;AACzE,QAAQ,CAAC;AACT,IAAI,CAAC;AACL;AACA,IAAI,OAAO,UAAU,CAAC,MAAM,EAAE;AAC9B,QAAQ,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC;AACpD,QAAQ,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;AACpC;AACA;AACA,QAAQ,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;AAChD;AACA;AACA,QAAQ,MAAM,UAAU,GAAG;AAC3B,YAAY,CAAC,SAAS,GAAG,OAAO;AAChC,YAAY,CAAC,YAAY,GAAG,IAAI,CAAC,QAAQ,CAAC;AAC1C,YAAY,CAAC,aAAa,GAAG,EAAE;AAC/B,SAAS,CAAC;AACV;AACA;AACA,QAAQ,MAAM,aAAa,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC;AAChD,QAAQ,MAAM,WAAW,GAAG,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC;AACrF;AACA,QAAQ,IAAI,WAAW,EAAE;AACzB;AACA,YAAY,KAAK,IAAI,CAAC,GAAG,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;AAChE,gBAAgB,UAAU,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,UAAU,EAAE,CAAC,CAAC;AAClF,YAAY,CAAC;AACb,QAAQ,CAAC,MAAM;AACf;AACA;AACA;AACA,YAAY,MAAM,SAAS,GAAG,EAAE;AAChC,gBAAgB,QAAQ,GAAG,EAAE,CAAC;AAC9B,YAAY,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,KAAK;AACvD,gBAAgB,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;AAC5C,gBAAgB,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;AACxD,gBAAgB,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;AACvC,gBAAgB,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC;AACpD,YAAY,CAAC,CAAC,CAAC;AACf;AACA,YAAY,MAAM,SAAS,GAAG,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAClD,YAAY,MAAM,SAAS,GAAG,GAAG,GAAG,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACxD;AACA,YAAY,MAAM,SAAS,GAAG;AAC9B,gBAAgB,CAAC,YAAY,GAAG,SAAS;AACzC,gBAAgB,CAAC,YAAY,GAAG,SAAS;AACzC,gBAAgB,CAAC,YAAY,GAAG,EAAE,CAAC,KAAK,GAAG,OAAO,EAAE;AACpD,aAAa,CAAC;AACd;AACA;AACA,YAAY,IAAI,OAAO,eAAe,KAAK,UAAU,EAAE;AACvD,gBAAgB,eAAe,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;AACvD,YAAY,CAAC;AACb,YAAY,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;AACvC;AACA;AACA,YAAY,UAAU,CAAC,aAAa,CAAC,CAAC,SAAS,GAAG,SAAS,CAAC;AAC5D,YAAY,UAAU,CAAC,aAAa,CAAC,CAAC,QAAQ,GAAG,QAAQ,CAAC;AAC1D;AACA,YAAY,UAAU,CAAC,SAAS,CAAC,CAAC,SAAS,GAAG,SAAS,CAAC;AACxD,YAAY,UAAU,CAAC,SAAS,CAAC,CAAC,QAAQ,GAAG,QAAQ,CAAC;AACtD,QAAQ,CAAC;AACT;AACA;AACA,QAAQ,IAAI,QAAQ,EAAE;AACtB;AACA,YAAY,CAAC,QAAQ,CAAC,eAAe,CAAC,KAAK,QAAQ,CAAC,eAAe,CAAC,GAAG,EAAE,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;AAC7F,QAAQ,CAAC,MAAM;AACf,YAAY,IAAI,OAAO,cAAc,KAAK,UAAU,EAAE;AACtD,gBAAgB,cAAc,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;AACvD,YAAY,CAAC;AACb,YAAY,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;AACzC,QAAQ,CAAC;AACT;AACA;AACA,QAAQ,IAAI,OAAO,cAAc,KAAK,UAAU,EAAE;AAClD,YAAY,cAAc,CAAC,UAAU,CAAC,CAAC;AACvC,QAAQ,CAAC;AACT,IAAI,CAAC;AACL;AACA,IAAI,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC;AAChD;;;;"}

package/dist/menu.js

@@ -0,0 +1,200 @@
+/**
+ * 处理数据库菜单项，生成 UI 菜单树和路由配置。
+ *
+ * @param {Array<Object>} menuItems - 原始菜单项数组，树形结构
+ * @param {Object} [options] - 配置选项
+ * @param {string} [options.idKey='id'] - 数据源 ID 键名
+ * @param {string} [options.codeKey='code'] - 数据源编码键名, 用于拼接路由名称和路由路径
+ * @param {string} [options.labelKey='text'] - 数据源标签键名
+ * @param {string} [options.childrenKey='children'] - 数据源子节点键名
+ * @param {string} [options.extendKey='extend'] - 数据源扩展对象键名
+ * @param {string} [options.menuIdKey='key'] - 输出菜单 ID 键名
+ * @param {string} [options.menuLabelKey='label'] - 输出菜单标签键名
+ * @param {string} [options.menuChildrenKey='children'] - 输出菜单子节点键名
+ * @param {string} [options.menuExtendKey='extend'] - 输出菜单扩展对象键名
+ * @param {string} [options.routeNameKey='name'] - 路由名称键名
+ * @param {string} [options.routePathKey='path'] - 路由路径键名
+ * @param {string} [options.routeMetaKey='meta'] - 路由元数据键名
+ * @param {Function} [options.handleNodeItem] - 节点处理钩子，参数：(nodeSimple) => void
+ * @param {Function} [options.handleMenuItem] - 菜单项处理钩子，参数：(uiMenuItem, nodeSimple) => void
+ * @param {Function} [options.handleRouteItem] - 路由项处理钩子，参数：(routeItem, nodeSimple) => void
+ *
+ * @returns {Object} 处理结果
+ * @returns {Array<Object>} returns.uiMenuItems - UI 菜单树形结构数组
+ * @returns {Array<Object>} returns.routeItems - 扁平化路由配置数组
+ * @returns {Map<string, Object>} returns.nodeMap - 节点 ID 到节点数据的映射表
+ *
+ * @example
+ * const menuItems = [
+ *   { id: '1', code: 'system', text: '系统管理', children: [
+ *     { id: '1-1', code: 'user', text: '用户管理' }
+ *   ]}
+ * ];
+ *
+ * const result = handleDbMenuItems(menuItems, {
+ *   handleRouteItem: (route, node) => {
+ *     route.component = () => import(`./views/${node.code}.vue`);
+ *   }
+ * });
+ *
+ * // result.uiMenuItems: [{ key: '1', label: '系统管理', children: [...] }]
+ * // result.routeItems: [{ name: 'system.user', path: '/system/user', meta: { id: '1-1' } }]
+ * // result.nodeMap: Map { '1' => {...}, '1-1' => {...} }
+ */
+function handleDbMenuItems(menuItems, options = {}) {
+    // 1. 统一配置项，简化调用
+    const {
+        // 数据源键名
+        idKey = "id",
+        codeKey = "code",
+        labelKey = "text",
+        childrenKey = "children",
+        extendKey = "extend",
+
+        // 输出目标键名
+        menuIdKey = "key",
+        menuLabelKey = "label",
+        menuChildrenKey = "children",
+        menuExtendKey = "extend",
+
+        routeNameKey = "name",
+        routePathKey = "path",
+        routeMetaKey = "meta",
+
+        // 钩子函数
+        handleNodeItem,
+        handleMenuItem,
+        handleRouteItem
+    } = options;
+
+    const uiMenuItems = [];
+    const routeItems = [];
+    const nodeMap = new Map(); // id -> node (纯净的节点数据)
+    const nodePathMap = new Map(); // id -> [{ code, id }] (仅存储路径计算所需的轻量数据)
+
+    /* ---------- 1. 建立索引：扁平化节点 & 构建路径索引 ---------- */
+    // 使用栈进行深度优先遍历，记录路径
+    const stack = [];
+    if (Array.isArray(menuItems)) {
+        menuItems.forEach((n) => stack.push({ node: n, parentPath: [] }));
+    }
+
+    while (stack.length) {
+        const { node, parentPath } = stack.pop();
+        const idValue = node[idKey];
+
+        // 构建当前节点的路径片段
+        const currentPathSegment = { [idKey]: idValue };
+        const fullPath = [...parentPath, currentPathSegment];
+
+        // 存储路径信息用于后续路由生成
+        nodePathMap.set(idValue, fullPath);
+
+        // 创建轻量级的节点对象存入 nodeMap
+        // 注意：这里先创建基础结构，路由信息在第二步补充
+        const nodeSimple = {
+            ...node,
+            [extendKey]: {}, // 初始化扩展对象
+            [childrenKey]: null // 去除原始 children，避免引用污染
+        };
+        nodeMap.set(idValue, nodeSimple);
+
+        // 处理子节点
+        const childrenNodes = node[childrenKey];
+        if (Array.isArray(childrenNodes)) {
+            // 逆序压栈，保持原序
+            for (let i = childrenNodes.length - 1; i >= 0; i--) {
+                stack.push({ node: childrenNodes[i], parentPath: fullPath });
+            }
+        }
+    }
+
+    /* ---------- 2. 构建树形结构 & 生成路由 ---------- */
+    const buildStack = [];
+    if (Array.isArray(menuItems)) {
+        for (let i = menuItems.length - 1; i >= 0; i--) {
+            buildStack.push({ node: menuItems[i], parentUi: undefined });
+        }
+    }
+
+    while (buildStack.length) {
+        const { node, parentUi } = buildStack.pop();
+        const idValue = node[idKey];
+
+        // 从 Map 中取出之前创建好的节点对象
+        const nodeSimple = nodeMap.get(idValue);
+
+        // 2.1 构建 UI 菜单项
+        const uiMenuItem = {
+            [menuIdKey]: idValue,
+            [menuLabelKey]: node[labelKey],
+            [menuExtendKey]: {} // UI 菜单专用扩展
+        };
+
+        // 处理子节点
+        const childrenNodes = node[childrenKey];
+        const hasChildren = Array.isArray(childrenNodes) && childrenNodes.length > 0;
+
+        if (hasChildren) {
+            // 有子节点 -> 继续压栈，传递当前 uiMenuItem 作为父级
+            for (let i = childrenNodes.length - 1; i >= 0; i--) {
+                buildStack.push({ node: childrenNodes[i], parentUi: uiMenuItem });
+            }
+        } else {
+            // 2.2 无子节点 -> 生成路由配置
+
+            // 提取 code 和 id 数组
+            const codePaths = [],
+                keyPaths = [];
+            nodePathMap.get(idValue).forEach((item) => {
+                const idValue = item[idKey];
+                const nodeSimple = nodeMap.get(idValue);
+                keyPaths.push(idValue);
+                codePaths.push(nodeSimple[codeKey]);
+            });
+
+            const routeName = codePaths.join(".");
+            const routePath = "/" + codePaths.join("/");
+
+            const routeItem = {
+                [routeNameKey]: routeName,
+                [routePathKey]: routePath,
+                [routeMetaKey]: { [idKey]: idValue }
+            };
+
+            // 执行路由钩子
+            if (typeof handleRouteItem === "function") {
+                handleRouteItem(routeItem, nodeSimple);
+            }
+            routeItems.push(routeItem);
+
+            // 补充扩展信息
+            uiMenuItem[menuExtendKey].routeName = routeName;
+            uiMenuItem[menuExtendKey].keyPaths = keyPaths;
+
+            nodeSimple[extendKey].routeName = routeName;
+            nodeSimple[extendKey].keyPaths = keyPaths;
+        }
+
+        // 2.3 挂载到父级 UI 或根数组
+        if (parentUi) {
+            // 逻辑赋值，确保 children 数组存在
+            (parentUi[menuChildrenKey] || (parentUi[menuChildrenKey] = [])).push(uiMenuItem);
+        } else {
+            if (typeof handleMenuItem === "function") {
+                handleMenuItem(uiMenuItem, nodeSimple);
+            }
+            uiMenuItems.push(uiMenuItem);
+        }
+
+        // 执行节点钩子
+        if (typeof handleNodeItem === "function") {
+            handleNodeItem(nodeSimple);
+        }
+    }
+
+    return { uiMenuItems, routeItems, nodeMap };
+}
+
+export { handleDbMenuItems };
+//# sourceMappingURL=menu.js.map

package/dist/menu.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"menu.js","sources":["../src/source/menu.js"],"sourcesContent":["/**\r\n * 处理数据库菜单项，生成 UI 菜单树和路由配置。\r\n *\r\n * @param {Array<Object>} menuItems - 原始菜单项数组，树形结构\r\n * @param {Object} [options] - 配置选项\r\n * @param {string} [options.idKey='id'] - 数据源 ID 键名\r\n * @param {string} [options.codeKey='code'] - 数据源编码键名, 用于拼接路由名称和路由路径\r\n * @param {string} [options.labelKey='text'] - 数据源标签键名\r\n * @param {string} [options.childrenKey='children'] - 数据源子节点键名\r\n * @param {string} [options.extendKey='extend'] - 数据源扩展对象键名\r\n * @param {string} [options.menuIdKey='key'] - 输出菜单 ID 键名\r\n * @param {string} [options.menuLabelKey='label'] - 输出菜单标签键名\r\n * @param {string} [options.menuChildrenKey='children'] - 输出菜单子节点键名\r\n * @param {string} [options.menuExtendKey='extend'] - 输出菜单扩展对象键名\r\n * @param {string} [options.routeNameKey='name'] - 路由名称键名\r\n * @param {string} [options.routePathKey='path'] - 路由路径键名\r\n * @param {string} [options.routeMetaKey='meta'] - 路由元数据键名\r\n * @param {Function} [options.handleNodeItem] - 节点处理钩子，参数：(nodeSimple) => void\r\n * @param {Function} [options.handleMenuItem] - 菜单项处理钩子，参数：(uiMenuItem, nodeSimple) => void\r\n * @param {Function} [options.handleRouteItem] - 路由项处理钩子，参数：(routeItem, nodeSimple) => void\r\n *\r\n * @returns {Object} 处理结果\r\n * @returns {Array<Object>} returns.uiMenuItems - UI 菜单树形结构数组\r\n * @returns {Array<Object>} returns.routeItems - 扁平化路由配置数组\r\n * @returns {Map<string, Object>} returns.nodeMap - 节点 ID 到节点数据的映射表\r\n *\r\n * @example\r\n * const menuItems = [\r\n *   { id: '1', code: 'system', text: '系统管理', children: [\r\n *     { id: '1-1', code: 'user', text: '用户管理' }\r\n *   ]}\r\n * ];\r\n *\r\n * const result = handleDbMenuItems(menuItems, {\r\n *   handleRouteItem: (route, node) => {\r\n *     route.component = () => import(`./views/${node.code}.vue`);\r\n *   }\r\n * });\r\n *\r\n * // result.uiMenuItems: [{ key: '1', label: '系统管理', children: [...] }]\r\n * // result.routeItems: [{ name: 'system.user', path: '/system/user', meta: { id: '1-1' } }]\r\n * // result.nodeMap: Map { '1' => {...}, '1-1' => {...} }\r\n */\r\nexport function handleDbMenuItems(menuItems, options = {}) {\r\n    // 1. 统一配置项，简化调用\r\n    const {\r\n        // 数据源键名\r\n        idKey = \"id\",\r\n        codeKey = \"code\",\r\n        labelKey = \"text\",\r\n        childrenKey = \"children\",\r\n        extendKey = \"extend\",\r\n\r\n        // 输出目标键名\r\n        menuIdKey = \"key\",\r\n        menuLabelKey = \"label\",\r\n        menuChildrenKey = \"children\",\r\n        menuExtendKey = \"extend\",\r\n\r\n        routeNameKey = \"name\",\r\n        routePathKey = \"path\",\r\n        routeMetaKey = \"meta\",\r\n\r\n        // 钩子函数\r\n        handleNodeItem,\r\n        handleMenuItem,\r\n        handleRouteItem\r\n    } = options;\r\n\r\n    const uiMenuItems = [];\r\n    const routeItems = [];\r\n    const nodeMap = new Map(); // id -> node (纯净的节点数据)\r\n    const nodePathMap = new Map(); // id -> [{ code, id }] (仅存储路径计算所需的轻量数据)\r\n\r\n    /* ---------- 1. 建立索引：扁平化节点 & 构建路径索引 ---------- */\r\n    // 使用栈进行深度优先遍历，记录路径\r\n    const stack = [];\r\n    if (Array.isArray(menuItems)) {\r\n        menuItems.forEach((n) => stack.push({ node: n, parentPath: [] }));\r\n    }\r\n\r\n    while (stack.length) {\r\n        const { node, parentPath } = stack.pop();\r\n        const idValue = node[idKey];\r\n\r\n        // 构建当前节点的路径片段\r\n        const currentPathSegment = { [idKey]: idValue };\r\n        const fullPath = [...parentPath, currentPathSegment];\r\n\r\n        // 存储路径信息用于后续路由生成\r\n        nodePathMap.set(idValue, fullPath);\r\n\r\n        // 创建轻量级的节点对象存入 nodeMap\r\n        // 注意：这里先创建基础结构，路由信息在第二步补充\r\n        const nodeSimple = {\r\n            ...node,\r\n            [extendKey]: {}, // 初始化扩展对象\r\n            [childrenKey]: null // 去除原始 children，避免引用污染\r\n        };\r\n        nodeMap.set(idValue, nodeSimple);\r\n\r\n        // 处理子节点\r\n        const childrenNodes = node[childrenKey];\r\n        if (Array.isArray(childrenNodes)) {\r\n            // 逆序压栈，保持原序\r\n            for (let i = childrenNodes.length - 1; i >= 0; i--) {\r\n                stack.push({ node: childrenNodes[i], parentPath: fullPath });\r\n            }\r\n        }\r\n    }\r\n\r\n    /* ---------- 2. 构建树形结构 & 生成路由 ---------- */\r\n    const buildStack = [];\r\n    if (Array.isArray(menuItems)) {\r\n        for (let i = menuItems.length - 1; i >= 0; i--) {\r\n            buildStack.push({ node: menuItems[i], parentUi: undefined });\r\n        }\r\n    }\r\n\r\n    while (buildStack.length) {\r\n        const { node, parentUi } = buildStack.pop();\r\n        const idValue = node[idKey];\r\n\r\n        // 从 Map 中取出之前创建好的节点对象\r\n        const nodeSimple = nodeMap.get(idValue);\r\n\r\n        // 2.1 构建 UI 菜单项\r\n        const uiMenuItem = {\r\n            [menuIdKey]: idValue,\r\n            [menuLabelKey]: node[labelKey],\r\n            [menuExtendKey]: {} // UI 菜单专用扩展\r\n        };\r\n\r\n        // 处理子节点\r\n        const childrenNodes = node[childrenKey];\r\n        const hasChildren = Array.isArray(childrenNodes) && childrenNodes.length > 0;\r\n\r\n        if (hasChildren) {\r\n            // 有子节点 -> 继续压栈，传递当前 uiMenuItem 作为父级\r\n            for (let i = childrenNodes.length - 1; i >= 0; i--) {\r\n                buildStack.push({ node: childrenNodes[i], parentUi: uiMenuItem });\r\n            }\r\n        } else {\r\n            // 2.2 无子节点 -> 生成路由配置\r\n\r\n            // 提取 code 和 id 数组\r\n            const codePaths = [],\r\n                keyPaths = [];\r\n            nodePathMap.get(idValue).forEach((item) => {\r\n                const idValue = item[idKey];\r\n                const nodeSimple = nodeMap.get(idValue);\r\n                keyPaths.push(idValue);\r\n                codePaths.push(nodeSimple[codeKey]);\r\n            });\r\n\r\n            const routeName = codePaths.join(\".\");\r\n            const routePath = \"/\" + codePaths.join(\"/\");\r\n\r\n            const routeItem = {\r\n                [routeNameKey]: routeName,\r\n                [routePathKey]: routePath,\r\n                [routeMetaKey]: { [idKey]: idValue }\r\n            };\r\n\r\n            // 执行路由钩子\r\n            if (typeof handleRouteItem === \"function\") {\r\n                handleRouteItem(routeItem, nodeSimple);\r\n            }\r\n            routeItems.push(routeItem);\r\n\r\n            // 补充扩展信息\r\n            uiMenuItem[menuExtendKey].routeName = routeName;\r\n            uiMenuItem[menuExtendKey].keyPaths = keyPaths;\r\n\r\n            nodeSimple[extendKey].routeName = routeName;\r\n            nodeSimple[extendKey].keyPaths = keyPaths;\r\n        }\r\n\r\n        // 2.3 挂载到父级 UI 或根数组\r\n        if (parentUi) {\r\n            // 逻辑赋值，确保 children 数组存在\r\n            (parentUi[menuChildrenKey] || (parentUi[menuChildrenKey] = [])).push(uiMenuItem);\r\n        } else {\r\n            if (typeof handleMenuItem === \"function\") {\r\n                handleMenuItem(uiMenuItem, nodeSimple);\r\n            }\r\n            uiMenuItems.push(uiMenuItem);\r\n        }\r\n\r\n        // 执行节点钩子\r\n        if (typeof handleNodeItem === \"function\") {\r\n            handleNodeItem(nodeSimple);\r\n        }\r\n    }\r\n\r\n    return { uiMenuItems, routeItems, nodeMap };\r\n}\r\n"],"names":[],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,iBAAiB,CAAC,SAAS,EAAE,OAAO,GAAG,EAAE,EAAE;AAC3D;AACA,IAAI,MAAM;AACV;AACA,QAAQ,KAAK,GAAG,IAAI;AACpB,QAAQ,OAAO,GAAG,MAAM;AACxB,QAAQ,QAAQ,GAAG,MAAM;AACzB,QAAQ,WAAW,GAAG,UAAU;AAChC,QAAQ,SAAS,GAAG,QAAQ;AAC5B;AACA;AACA,QAAQ,SAAS,GAAG,KAAK;AACzB,QAAQ,YAAY,GAAG,OAAO;AAC9B,QAAQ,eAAe,GAAG,UAAU;AACpC,QAAQ,aAAa,GAAG,QAAQ;AAChC;AACA,QAAQ,YAAY,GAAG,MAAM;AAC7B,QAAQ,YAAY,GAAG,MAAM;AAC7B,QAAQ,YAAY,GAAG,MAAM;AAC7B;AACA;AACA,QAAQ,cAAc;AACtB,QAAQ,cAAc;AACtB,QAAQ,eAAe;AACvB,KAAK,GAAG,OAAO,CAAC;AAChB;AACA,IAAI,MAAM,WAAW,GAAG,EAAE,CAAC;AAC3B,IAAI,MAAM,UAAU,GAAG,EAAE,CAAC;AAC1B,IAAI,MAAM,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC;AAC9B,IAAI,MAAM,WAAW,GAAG,IAAI,GAAG,EAAE,CAAC;AAClC;AACA;AACA;AACA,IAAI,MAAM,KAAK,GAAG,EAAE,CAAC;AACrB,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE;AAClC,QAAQ,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;AAC1E,IAAI,CAAC;AACL;AACA,IAAI,OAAO,KAAK,CAAC,MAAM,EAAE;AACzB,QAAQ,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;AACjD,QAAQ,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;AACpC;AACA;AACA,QAAQ,MAAM,kBAAkB,GAAG,EAAE,CAAC,KAAK,GAAG,OAAO,EAAE,CAAC;AACxD,QAAQ,MAAM,QAAQ,GAAG,CAAC,GAAG,UAAU,EAAE,kBAAkB,CAAC,CAAC;AAC7D;AACA;AACA,QAAQ,WAAW,CAAC,GAAG,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;AAC3C;AACA;AACA;AACA,QAAQ,MAAM,UAAU,GAAG;AAC3B,YAAY,GAAG,IAAI;AACnB,YAAY,CAAC,SAAS,GAAG,EAAE;AAC3B,YAAY,CAAC,WAAW,GAAG,IAAI;AAC/B,SAAS,CAAC;AACV,QAAQ,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;AACzC;AACA;AACA,QAAQ,MAAM,aAAa,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC;AAChD,QAAQ,IAAI,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,EAAE;AAC1C;AACA,YAAY,KAAK,IAAI,CAAC,GAAG,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;AAChE,gBAAgB,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,QAAQ,EAAE,CAAC,CAAC;AAC7E,YAAY,CAAC;AACb,QAAQ,CAAC;AACT,IAAI,CAAC;AACL;AACA;AACA,IAAI,MAAM,UAAU,GAAG,EAAE,CAAC;AAC1B,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE;AAClC,QAAQ,KAAK,IAAI,CAAC,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;AACxD,YAAY,UAAU,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,CAAC;AACzE,QAAQ,CAAC;AACT,IAAI,CAAC;AACL;AACA,IAAI,OAAO,UAAU,CAAC,MAAM,EAAE;AAC9B,QAAQ,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,UAAU,CAAC,GAAG,EAAE,CAAC;AACpD,QAAQ,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;AACpC;AACA;AACA,QAAQ,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;AAChD;AACA;AACA,QAAQ,MAAM,UAAU,GAAG;AAC3B,YAAY,CAAC,SAAS,GAAG,OAAO;AAChC,YAAY,CAAC,YAAY,GAAG,IAAI,CAAC,QAAQ,CAAC;AAC1C,YAAY,CAAC,aAAa,GAAG,EAAE;AAC/B,SAAS,CAAC;AACV;AACA;AACA,QAAQ,MAAM,aAAa,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC;AAChD,QAAQ,MAAM,WAAW,GAAG,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC;AACrF;AACA,QAAQ,IAAI,WAAW,EAAE;AACzB;AACA,YAAY,KAAK,IAAI,CAAC,GAAG,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE;AAChE,gBAAgB,UAAU,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,aAAa,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,UAAU,EAAE,CAAC,CAAC;AAClF,YAAY,CAAC;AACb,QAAQ,CAAC,MAAM;AACf;AACA;AACA;AACA,YAAY,MAAM,SAAS,GAAG,EAAE;AAChC,gBAAgB,QAAQ,GAAG,EAAE,CAAC;AAC9B,YAAY,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,KAAK;AACvD,gBAAgB,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;AAC5C,gBAAgB,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;AACxD,gBAAgB,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;AACvC,gBAAgB,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC;AACpD,YAAY,CAAC,CAAC,CAAC;AACf;AACA,YAAY,MAAM,SAAS,GAAG,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAClD,YAAY,MAAM,SAAS,GAAG,GAAG,GAAG,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACxD;AACA,YAAY,MAAM,SAAS,GAAG;AAC9B,gBAAgB,CAAC,YAAY,GAAG,SAAS;AACzC,gBAAgB,CAAC,YAAY,GAAG,SAAS;AACzC,gBAAgB,CAAC,YAAY,GAAG,EAAE,CAAC,KAAK,GAAG,OAAO,EAAE;AACpD,aAAa,CAAC;AACd;AACA;AACA,YAAY,IAAI,OAAO,eAAe,KAAK,UAAU,EAAE;AACvD,gBAAgB,eAAe,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;AACvD,YAAY,CAAC;AACb,YAAY,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;AACvC;AACA;AACA,YAAY,UAAU,CAAC,aAAa,CAAC,CAAC,SAAS,GAAG,SAAS,CAAC;AAC5D,YAAY,UAAU,CAAC,aAAa,CAAC,CAAC,QAAQ,GAAG,QAAQ,CAAC;AAC1D;AACA,YAAY,UAAU,CAAC,SAAS,CAAC,CAAC,SAAS,GAAG,SAAS,CAAC;AACxD,YAAY,UAAU,CAAC,SAAS,CAAC,CAAC,QAAQ,GAAG,QAAQ,CAAC;AACtD,QAAQ,CAAC;AACT;AACA;AACA,QAAQ,IAAI,QAAQ,EAAE;AACtB;AACA,YAAY,CAAC,QAAQ,CAAC,eAAe,CAAC,KAAK,QAAQ,CAAC,eAAe,CAAC,GAAG,EAAE,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;AAC7F,QAAQ,CAAC,MAAM;AACf,YAAY,IAAI,OAAO,cAAc,KAAK,UAAU,EAAE;AACtD,gBAAgB,cAAc,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;AACvD,YAAY,CAAC;AACb,YAAY,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;AACzC,QAAQ,CAAC;AACT;AACA;AACA,QAAQ,IAAI,OAAO,cAAc,KAAK,UAAU,EAAE;AAClD,YAAY,cAAc,CAAC,UAAU,CAAC,CAAC;AACvC,QAAQ,CAAC;AACT,IAAI,CAAC;AACL;AACA,IAAI,OAAO,EAAE,WAAW,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC;AAChD;;;;"}

package/dist/tree.cjs

@@ -67,24 +67,23 @@ function flatCompleteTree2NestedTree(nodes, parentId = 0, { idKey = "id", parent
 }
 
 /**
- * 在嵌套树中按 `id` 递归查找节点，并返回其指定属性值。
+ * 在嵌套树中按 `id` 递归查找节点
  *
  * @template T extends Record<PropertyKey, any>
  * @param {string | number} id - 要查找的 id
  * @param {T[]} arr - 嵌套树森林
- * @param {string} [resultKey='name'] - 需要返回的字段
  * @param {string} [idKey='id'] - 主键字段
  * @param {string} [childrenKey='children'] - 子节点字段
- * @returns {any} 找到的值；未找到返回 `undefined`
+ * @returns {any} 找到的节点；未找到返回 `undefined`
  */
-const findObjAttrValueById = function findObjAttrValueByIdFn(id, arr, resultKey = "name", idKey = "id", childrenKey = "children") {
+const findTreeNodeById = function findTreeNodeByIdFn(id, arr, idKey = "id", childrenKey = "children") {
     if (Array.isArray(arr) && arr.length > 0) {
         for (let i = 0; i < arr.length; i++) {
             const item = arr[i];
             if (item[idKey]?.toString() === id?.toString()) {
-                return item[resultKey];
+                return item;
             } else if (Array.isArray(item[childrenKey]) && item[childrenKey].length > 0) {
-                const result = findObjAttrValueByIdFn(id, item[childrenKey], resultKey, idKey, childrenKey);
+                const result = findTreeNodeByIdFn(id, item[childrenKey], idKey, childrenKey);
                 if (result) {
                     return result;
                 }
@@ -93,6 +92,21 @@ const findObjAttrValueById = function findObjAttrValueByIdFn(id, arr, resultKey
     }
 };
 
+/**
+ * 在嵌套树中按 `id` 递归查找节点，并返回其指定属性值。
+ *
+ * @template T extends Record<PropertyKey, any>
+ * @param {string | number} id - 要查找的 id
+ * @param {T[]} arr - 嵌套树森林
+ * @param {string} [resultKey='name'] - 需要返回的字段
+ * @param {string} [idKey='id'] - 主键字段
+ * @param {string} [childrenKey='children'] - 子节点字段
+ * @returns {any} 找到的值；未找到返回 `undefined`
+ */
+function findObjAttrValueById(id, arr, resultKey = "name", idKey = "id", childrenKey = "children") {
+    return findTreeNodeById(id, arr, idKey, childrenKey)?.[resultKey];
+}
+
 /**
  * 从服务端返回的已选 id 数组里，提取出
  * 1. 叶子节点
@@ -169,6 +183,7 @@ function extractFullyCheckedKeys(treeData, selectedKeys, idKey = "id", childrenK
 
 exports.extractFullyCheckedKeys = extractFullyCheckedKeys;
 exports.findObjAttrValueById = findObjAttrValueById;
+exports.findTreeNodeById = findTreeNodeById;
 exports.flatCompleteTree2NestedTree = flatCompleteTree2NestedTree;
 exports.nestedTree2IdMap = nestedTree2IdMap;
 //# sourceMappingURL=tree.cjs.map

package/dist/tree.cjs.map

@@ -1 +1 @@
-{"version":3,"file":"tree.cjs","sources":["../src/source/tree.js"],"sourcesContent":["/**\r\n * 把嵌套树拍平成 `{ [id]: node }` 映射，同时把原 `children` 置为 `null`。\r\n *\r\n * @template T extends Record<PropertyKey, any>\r\n * @param {T[]} data - 嵌套树森林\r\n * @param {string} [idKey='id'] - 主键字段\r\n * @param {string} [childrenKey='children'] - 子节点字段\r\n * @returns {Record<string, T & { [k in typeof childrenKey]: null }>} id→节点的映射表\r\n */\r\nexport function nestedTree2IdMap(data, idKey = \"id\", childrenKey = \"children\") {\r\n    const retObj = {};\r\n    function fn(nodes) {\r\n        if (Array.isArray(nodes) && nodes.length > 0) {\r\n            nodes.forEach((node) => {\r\n                retObj[node[idKey]] = { ...node };\r\n                retObj[node[idKey]][childrenKey] = null;\r\n\r\n                fn(node[childrenKey]);\r\n            });\r\n        }\r\n    }\r\n    fn(data);\r\n    return retObj;\r\n}\r\n\r\n/**\r\n * 把**已包含完整父子关系**的扁平节点列表还原成嵌套树（森林）。\r\n *\r\n * @template T extends Record<PropertyKey, any>\r\n * @param {T[]} nodes - 扁平节点列表（必须包含 id / parentId）\r\n * @param {number | string} [parentId=0] - 根节点标识值\r\n * @param {Object} [opts] - 字段映射配置\r\n * @param {string} [opts.idKey='id'] - 节点主键\r\n * @param {string} [opts.parentKey='parentId'] - 父节点外键\r\n * @param {string} [opts.childrenKey='children'] - 存放子节点的字段\r\n * @returns {(T & { [k in typeof childrenKey]: T[] })[]} 嵌套树森林\r\n */\r\nexport function flatCompleteTree2NestedTree(nodes, parentId = 0, { idKey = \"id\", parentKey = \"parentId\", childrenKey = \"children\" } = {}) {\r\n    const map = new Map(); // id -> node\r\n    const items = []; // 多根森林\r\n\r\n    // 1. 初始化：保证每个节点都有 children，并存入 map\r\n    for (const item of nodes) {\r\n        const node = { ...item, [childrenKey]: [] };\r\n        map.set(item[idKey], node);\r\n    }\r\n\r\n    // 2. 建立父子关系\r\n    for (const item of nodes) {\r\n        const node = map.get(item[idKey]);\r\n        const parentIdVal = item[parentKey];\r\n\r\n        if (parentIdVal === parentId) {\r\n            // 根层\r\n            items.push(node);\r\n        } else {\r\n            // 非根层：找到父节点，把自己挂上去\r\n            const parent = map.get(parentIdVal);\r\n            if (parent) parent[childrenKey].push(node);\r\n            // 如果 parent 不存在，说明数据不完整，可自定义处理\r\n        }\r\n    }\r\n\r\n    return items;\r\n}\r\n\r\n/**\r\n * 在嵌套树中按 `id` 递归查找节点，并返回其指定属性值。\r\n *\r\n * @template T extends Record<PropertyKey, any>\r\n * @param {string | number} id - 要查找的 id\r\n * @param {T[]} arr - 嵌套树森林\r\n * @param {string} [resultKey='name'] - 需要返回的字段\r\n * @param {string} [idKey='id'] - 主键字段\r\n * @param {string} [childrenKey='children'] - 子节点字段\r\n * @returns {any} 找到的值；未找到返回 `undefined`\r\n */\r\nexport const findObjAttrValueById = function findObjAttrValueByIdFn(id, arr, resultKey = \"name\", idKey = \"id\", childrenKey = \"children\") {\r\n    if (Array.isArray(arr) && arr.length > 0) {\r\n        for (let i = 0; i < arr.length; i++) {\r\n            const item = arr[i];\r\n            if (item[idKey]?.toString() === id?.toString()) {\r\n                return item[resultKey];\r\n            } else if (Array.isArray(item[childrenKey]) && item[childrenKey].length > 0) {\r\n                const result = findObjAttrValueByIdFn(id, item[childrenKey], resultKey, idKey, childrenKey);\r\n                if (result) {\r\n                    return result;\r\n                }\r\n            }\r\n        }\r\n    }\r\n};\r\n\r\n/**\r\n * 从服务端返回的已选 id 数组里，提取出\r\n * 1. 叶子节点\r\n * 2. 所有子节点都被选中的父节点\r\n * 其余父节点一律丢弃（由前端 Tree 自动算半选）\r\n *\r\n * @param {Array}  treeData     完整树\r\n * @param {Array}  selectedKeys 后端给的选中 id 数组\r\n * @param {String} idKey        节点唯一字段\r\n * @param {String} childrenKey  子节点字段\r\n * @returns {{checked: string[], halfChecked: string[]}}\r\n */\r\nexport function extractFullyCheckedKeys(treeData, selectedKeys, idKey = \"id\", childrenKey = \"children\") {\r\n    const selectedSet = new Set(selectedKeys);\r\n    const checked = new Set();\r\n    const halfChecked = new Set();\r\n\r\n    /* 返回值含义\r\n        0 - 未选中\r\n        1 - 半选\r\n        2 - 全选\r\n        */\r\n    function dfs(node) {\r\n        const nodeId = node[idKey];\r\n        const children = node[childrenKey] || [];\r\n\r\n        // 叶子\r\n        if (!children.length) {\r\n            if (selectedSet.has(nodeId)) {\r\n                checked.add(nodeId);\r\n                return 2;\r\n            }\r\n            return 0;\r\n        }\r\n\r\n        // 非叶子\r\n        let allChecked = true;\r\n        let someChecked = false;\r\n\r\n        children.forEach((child) => {\r\n            const childState = dfs(child);\r\n            if (childState !== 2) allChecked = false;\r\n            if (childState >= 1) someChecked = true;\r\n        });\r\n\r\n        // 当前节点本身在 selectedKeys 里，但子节点未全选 → 只能算半选\r\n        if (selectedSet.has(nodeId)) {\r\n            if (allChecked) {\r\n                checked.add(nodeId);\r\n                return 2;\r\n            }\r\n            halfChecked.add(nodeId);\r\n            return 1;\r\n        }\r\n\r\n        // 当前节点不在 selectedKeys 里，看子节点\r\n        if (allChecked) {\r\n            checked.add(nodeId);\r\n            return 2;\r\n        }\r\n        if (someChecked) {\r\n            halfChecked.add(nodeId);\r\n            return 1;\r\n        }\r\n        return 0;\r\n    }\r\n\r\n    treeData.forEach(dfs);\r\n    return {\r\n        checked: [...checked],\r\n        halfChecked: [...halfChecked]\r\n    };\r\n}\r\n"],"names":[],"mappings":";;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,gBAAgB,CAAC,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,WAAW,GAAG,UAAU,EAAE;AAC/E,IAAI,MAAM,MAAM,GAAG,EAAE,CAAC;AACtB,IAAI,SAAS,EAAE,CAAC,KAAK,EAAE;AACvB,QAAQ,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;AACtD,YAAY,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,KAAK;AACpC,gBAAgB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,IAAI,EAAE,CAAC;AAClD,gBAAgB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,IAAI,CAAC;AACxD;AACA,gBAAgB,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;AACtC,YAAY,CAAC,CAAC,CAAC;AACf,QAAQ,CAAC;AACT,IAAI,CAAC;AACL,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC;AACb,IAAI,OAAO,MAAM,CAAC;AAClB,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,2BAA2B,CAAC,KAAK,EAAE,QAAQ,GAAG,CAAC,EAAE,EAAE,KAAK,GAAG,IAAI,EAAE,SAAS,GAAG,UAAU,EAAE,WAAW,GAAG,UAAU,EAAE,GAAG,EAAE,EAAE;AAC1I,IAAI,MAAM,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;AAC1B,IAAI,MAAM,KAAK,GAAG,EAAE,CAAC;AACrB;AACA;AACA,IAAI,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;AAC9B,QAAQ,MAAM,IAAI,GAAG,EAAE,GAAG,IAAI,EAAE,CAAC,WAAW,GAAG,EAAE,EAAE,CAAC;AACpD,QAAQ,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,CAAC;AACnC,IAAI,CAAC;AACL;AACA;AACA,IAAI,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;AAC9B,QAAQ,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;AAC1C,QAAQ,MAAM,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC;AAC5C;AACA,QAAQ,IAAI,WAAW,KAAK,QAAQ,EAAE;AACtC;AACA,YAAY,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC7B,QAAQ,CAAC,MAAM;AACf;AACA,YAAY,MAAM,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;AAChD,YAAY,IAAI,MAAM,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACvD;AACA,QAAQ,CAAC;AACT,IAAI,CAAC;AACL;AACA,IAAI,OAAO,KAAK,CAAC;AACjB,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,oBAAoB,GAAG,SAAS,sBAAsB,CAAC,EAAE,EAAE,GAAG,EAAE,SAAS,GAAG,MAAM,EAAE,KAAK,GAAG,IAAI,EAAE,WAAW,GAAG,UAAU,EAAE;AACzI,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE;AAC9C,QAAQ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AAC7C,YAAY,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;AAChC,YAAY,IAAI,IAAI,CAAC,KAAK,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,EAAE,QAAQ,EAAE,EAAE;AAC5D,gBAAgB,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC;AACvC,YAAY,CAAC,MAAM,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,IAAI,IAAI,CAAC,WAAW,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE;AACzF,gBAAgB,MAAM,MAAM,GAAG,sBAAsB,CAAC,EAAE,EAAE,IAAI,CAAC,WAAW,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC;AAC5G,gBAAgB,IAAI,MAAM,EAAE;AAC5B,oBAAoB,OAAO,MAAM,CAAC;AAClC,gBAAgB,CAAC;AACjB,YAAY,CAAC;AACb,QAAQ,CAAC;AACT,IAAI,CAAC;AACL,EAAE;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,uBAAuB,CAAC,QAAQ,EAAE,YAAY,EAAE,KAAK,GAAG,IAAI,EAAE,WAAW,GAAG,UAAU,EAAE;AACxG,IAAI,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,CAAC;AAC9C,IAAI,MAAM,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC;AAC9B,IAAI,MAAM,WAAW,GAAG,IAAI,GAAG,EAAE,CAAC;AAClC;AACA;AACA;AACA;AACA;AACA;AACA,IAAI,SAAS,GAAG,CAAC,IAAI,EAAE;AACvB,QAAQ,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;AACnC,QAAQ,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;AACjD;AACA;AACA,QAAQ,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE;AAC9B,YAAY,IAAI,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE;AACzC,gBAAgB,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;AACpC,gBAAgB,OAAO,CAAC,CAAC;AACzB,YAAY,CAAC;AACb,YAAY,OAAO,CAAC,CAAC;AACrB,QAAQ,CAAC;AACT;AACA;AACA,QAAQ,IAAI,UAAU,GAAG,IAAI,CAAC;AAC9B,QAAQ,IAAI,WAAW,GAAG,KAAK,CAAC;AAChC;AACA,QAAQ,QAAQ,CAAC,OAAO,CAAC,CAAC,KAAK,KAAK;AACpC,YAAY,MAAM,UAAU,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC;AAC1C,YAAY,IAAI,UAAU,KAAK,CAAC,EAAE,UAAU,GAAG,KAAK,CAAC;AACrD,YAAY,IAAI,UAAU,IAAI,CAAC,EAAE,WAAW,GAAG,IAAI,CAAC;AACpD,QAAQ,CAAC,CAAC,CAAC;AACX;AACA;AACA,QAAQ,IAAI,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE;AACrC,YAAY,IAAI,UAAU,EAAE;AAC5B,gBAAgB,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;AACpC,gBAAgB,OAAO,CAAC,CAAC;AACzB,YAAY,CAAC;AACb,YAAY,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;AACpC,YAAY,OAAO,CAAC,CAAC;AACrB,QAAQ,CAAC;AACT;AACA;AACA,QAAQ,IAAI,UAAU,EAAE;AACxB,YAAY,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;AAChC,YAAY,OAAO,CAAC,CAAC;AACrB,QAAQ,CAAC;AACT,QAAQ,IAAI,WAAW,EAAE;AACzB,YAAY,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;AACpC,YAAY,OAAO,CAAC,CAAC;AACrB,QAAQ,CAAC;AACT,QAAQ,OAAO,CAAC,CAAC;AACjB,IAAI,CAAC;AACL;AACA,IAAI,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;AAC1B,IAAI,OAAO;AACX,QAAQ,OAAO,EAAE,CAAC,GAAG,OAAO,CAAC;AAC7B,QAAQ,WAAW,EAAE,CAAC,GAAG,WAAW,CAAC;AACrC,KAAK,CAAC;AACN;;;;;;;"}
+{"version":3,"file":"tree.cjs","sources":["../src/source/tree.js"],"sourcesContent":["/**\r\n * 把嵌套树拍平成 `{ [id]: node }` 映射，同时把原 `children` 置为 `null`。\r\n *\r\n * @template T extends Record<PropertyKey, any>\r\n * @param {T[]} data - 嵌套树森林\r\n * @param {string} [idKey='id'] - 主键字段\r\n * @param {string} [childrenKey='children'] - 子节点字段\r\n * @returns {Record<string, T & { [k in typeof childrenKey]: null }>} id→节点的映射表\r\n */\r\nexport function nestedTree2IdMap(data, idKey = \"id\", childrenKey = \"children\") {\r\n    const retObj = {};\r\n    function fn(nodes) {\r\n        if (Array.isArray(nodes) && nodes.length > 0) {\r\n            nodes.forEach((node) => {\r\n                retObj[node[idKey]] = { ...node };\r\n                retObj[node[idKey]][childrenKey] = null;\r\n\r\n                fn(node[childrenKey]);\r\n            });\r\n        }\r\n    }\r\n    fn(data);\r\n    return retObj;\r\n}\r\n\r\n/**\r\n * 把**已包含完整父子关系**的扁平节点列表还原成嵌套树（森林）。\r\n *\r\n * @template T extends Record<PropertyKey, any>\r\n * @param {T[]} nodes - 扁平节点列表（必须包含 id / parentId）\r\n * @param {number | string} [parentId=0] - 根节点标识值\r\n * @param {Object} [opts] - 字段映射配置\r\n * @param {string} [opts.idKey='id'] - 节点主键\r\n * @param {string} [opts.parentKey='parentId'] - 父节点外键\r\n * @param {string} [opts.childrenKey='children'] - 存放子节点的字段\r\n * @returns {(T & { [k in typeof childrenKey]: T[] })[]} 嵌套树森林\r\n */\r\nexport function flatCompleteTree2NestedTree(nodes, parentId = 0, { idKey = \"id\", parentKey = \"parentId\", childrenKey = \"children\" } = {}) {\r\n    const map = new Map(); // id -> node\r\n    const items = []; // 多根森林\r\n\r\n    // 1. 初始化：保证每个节点都有 children，并存入 map\r\n    for (const item of nodes) {\r\n        const node = { ...item, [childrenKey]: [] };\r\n        map.set(item[idKey], node);\r\n    }\r\n\r\n    // 2. 建立父子关系\r\n    for (const item of nodes) {\r\n        const node = map.get(item[idKey]);\r\n        const parentIdVal = item[parentKey];\r\n\r\n        if (parentIdVal === parentId) {\r\n            // 根层\r\n            items.push(node);\r\n        } else {\r\n            // 非根层：找到父节点，把自己挂上去\r\n            const parent = map.get(parentIdVal);\r\n            if (parent) parent[childrenKey].push(node);\r\n            // 如果 parent 不存在，说明数据不完整，可自定义处理\r\n        }\r\n    }\r\n\r\n    return items;\r\n}\r\n\r\n/**\r\n * 在嵌套树中按 `id` 递归查找节点\r\n *\r\n * @template T extends Record<PropertyKey, any>\r\n * @param {string | number} id - 要查找的 id\r\n * @param {T[]} arr - 嵌套树森林\r\n * @param {string} [idKey='id'] - 主键字段\r\n * @param {string} [childrenKey='children'] - 子节点字段\r\n * @returns {any} 找到的节点；未找到返回 `undefined`\r\n */\r\nexport const findTreeNodeById = function findTreeNodeByIdFn(id, arr, idKey = \"id\", childrenKey = \"children\") {\r\n    if (Array.isArray(arr) && arr.length > 0) {\r\n        for (let i = 0; i < arr.length; i++) {\r\n            const item = arr[i];\r\n            if (item[idKey]?.toString() === id?.toString()) {\r\n                return item;\r\n            } else if (Array.isArray(item[childrenKey]) && item[childrenKey].length > 0) {\r\n                const result = findTreeNodeByIdFn(id, item[childrenKey], idKey, childrenKey);\r\n                if (result) {\r\n                    return result;\r\n                }\r\n            }\r\n        }\r\n    }\r\n};\r\n\r\n/**\r\n * 在嵌套树中按 `id` 递归查找节点，并返回其指定属性值。\r\n *\r\n * @template T extends Record<PropertyKey, any>\r\n * @param {string | number} id - 要查找的 id\r\n * @param {T[]} arr - 嵌套树森林\r\n * @param {string} [resultKey='name'] - 需要返回的字段\r\n * @param {string} [idKey='id'] - 主键字段\r\n * @param {string} [childrenKey='children'] - 子节点字段\r\n * @returns {any} 找到的值；未找到返回 `undefined`\r\n */\r\nexport function findObjAttrValueById(id, arr, resultKey = \"name\", idKey = \"id\", childrenKey = \"children\") {\r\n    return findTreeNodeById(id, arr, idKey, childrenKey)?.[resultKey];\r\n}\r\n\r\n/**\r\n * 从服务端返回的已选 id 数组里，提取出\r\n * 1. 叶子节点\r\n * 2. 所有子节点都被选中的父节点\r\n * 其余父节点一律丢弃（由前端 Tree 自动算半选）\r\n *\r\n * @param {Array}  treeData     完整树\r\n * @param {Array}  selectedKeys 后端给的选中 id 数组\r\n * @param {String} idKey        节点唯一字段\r\n * @param {String} childrenKey  子节点字段\r\n * @returns {{checked: string[], halfChecked: string[]}}\r\n */\r\nexport function extractFullyCheckedKeys(treeData, selectedKeys, idKey = \"id\", childrenKey = \"children\") {\r\n    const selectedSet = new Set(selectedKeys);\r\n    const checked = new Set();\r\n    const halfChecked = new Set();\r\n\r\n    /* 返回值含义\r\n        0 - 未选中\r\n        1 - 半选\r\n        2 - 全选\r\n        */\r\n    function dfs(node) {\r\n        const nodeId = node[idKey];\r\n        const children = node[childrenKey] || [];\r\n\r\n        // 叶子\r\n        if (!children.length) {\r\n            if (selectedSet.has(nodeId)) {\r\n                checked.add(nodeId);\r\n                return 2;\r\n            }\r\n            return 0;\r\n        }\r\n\r\n        // 非叶子\r\n        let allChecked = true;\r\n        let someChecked = false;\r\n\r\n        children.forEach((child) => {\r\n            const childState = dfs(child);\r\n            if (childState !== 2) allChecked = false;\r\n            if (childState >= 1) someChecked = true;\r\n        });\r\n\r\n        // 当前节点本身在 selectedKeys 里，但子节点未全选 → 只能算半选\r\n        if (selectedSet.has(nodeId)) {\r\n            if (allChecked) {\r\n                checked.add(nodeId);\r\n                return 2;\r\n            }\r\n            halfChecked.add(nodeId);\r\n            return 1;\r\n        }\r\n\r\n        // 当前节点不在 selectedKeys 里，看子节点\r\n        if (allChecked) {\r\n            checked.add(nodeId);\r\n            return 2;\r\n        }\r\n        if (someChecked) {\r\n            halfChecked.add(nodeId);\r\n            return 1;\r\n        }\r\n        return 0;\r\n    }\r\n\r\n    treeData.forEach(dfs);\r\n    return {\r\n        checked: [...checked],\r\n        halfChecked: [...halfChecked]\r\n    };\r\n}\r\n"],"names":[],"mappings":";;AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,gBAAgB,CAAC,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,WAAW,GAAG,UAAU,EAAE;AAC/E,IAAI,MAAM,MAAM,GAAG,EAAE,CAAC;AACtB,IAAI,SAAS,EAAE,CAAC,KAAK,EAAE;AACvB,QAAQ,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;AACtD,YAAY,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,KAAK;AACpC,gBAAgB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,IAAI,EAAE,CAAC;AAClD,gBAAgB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,IAAI,CAAC;AACxD;AACA,gBAAgB,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;AACtC,YAAY,CAAC,CAAC,CAAC;AACf,QAAQ,CAAC;AACT,IAAI,CAAC;AACL,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC;AACb,IAAI,OAAO,MAAM,CAAC;AAClB,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,2BAA2B,CAAC,KAAK,EAAE,QAAQ,GAAG,CAAC,EAAE,EAAE,KAAK,GAAG,IAAI,EAAE,SAAS,GAAG,UAAU,EAAE,WAAW,GAAG,UAAU,EAAE,GAAG,EAAE,EAAE;AAC1I,IAAI,MAAM,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;AAC1B,IAAI,MAAM,KAAK,GAAG,EAAE,CAAC;AACrB;AACA;AACA,IAAI,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;AAC9B,QAAQ,MAAM,IAAI,GAAG,EAAE,GAAG,IAAI,EAAE,CAAC,WAAW,GAAG,EAAE,EAAE,CAAC;AACpD,QAAQ,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,CAAC;AACnC,IAAI,CAAC;AACL;AACA;AACA,IAAI,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;AAC9B,QAAQ,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;AAC1C,QAAQ,MAAM,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC;AAC5C;AACA,QAAQ,IAAI,WAAW,KAAK,QAAQ,EAAE;AACtC;AACA,YAAY,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC7B,QAAQ,CAAC,MAAM;AACf;AACA,YAAY,MAAM,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;AAChD,YAAY,IAAI,MAAM,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACvD;AACA,QAAQ,CAAC;AACT,IAAI,CAAC;AACL;AACA,IAAI,OAAO,KAAK,CAAC;AACjB,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,gBAAgB,GAAG,SAAS,kBAAkB,CAAC,EAAE,EAAE,GAAG,EAAE,KAAK,GAAG,IAAI,EAAE,WAAW,GAAG,UAAU,EAAE;AAC7G,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE;AAC9C,QAAQ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AAC7C,YAAY,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;AAChC,YAAY,IAAI,IAAI,CAAC,KAAK,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,EAAE,QAAQ,EAAE,EAAE;AAC5D,gBAAgB,OAAO,IAAI,CAAC;AAC5B,YAAY,CAAC,MAAM,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,IAAI,IAAI,CAAC,WAAW,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE;AACzF,gBAAgB,MAAM,MAAM,GAAG,kBAAkB,CAAC,EAAE,EAAE,IAAI,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC;AAC7F,gBAAgB,IAAI,MAAM,EAAE;AAC5B,oBAAoB,OAAO,MAAM,CAAC;AAClC,gBAAgB,CAAC;AACjB,YAAY,CAAC;AACb,QAAQ,CAAC;AACT,IAAI,CAAC;AACL,EAAE;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,oBAAoB,CAAC,EAAE,EAAE,GAAG,EAAE,SAAS,GAAG,MAAM,EAAE,KAAK,GAAG,IAAI,EAAE,WAAW,GAAG,UAAU,EAAE;AAC1G,IAAI,OAAO,gBAAgB,CAAC,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,WAAW,CAAC,GAAG,SAAS,CAAC,CAAC;AACtE,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,uBAAuB,CAAC,QAAQ,EAAE,YAAY,EAAE,KAAK,GAAG,IAAI,EAAE,WAAW,GAAG,UAAU,EAAE;AACxG,IAAI,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,CAAC;AAC9C,IAAI,MAAM,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC;AAC9B,IAAI,MAAM,WAAW,GAAG,IAAI,GAAG,EAAE,CAAC;AAClC;AACA;AACA;AACA;AACA;AACA;AACA,IAAI,SAAS,GAAG,CAAC,IAAI,EAAE;AACvB,QAAQ,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;AACnC,QAAQ,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;AACjD;AACA;AACA,QAAQ,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE;AAC9B,YAAY,IAAI,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE;AACzC,gBAAgB,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;AACpC,gBAAgB,OAAO,CAAC,CAAC;AACzB,YAAY,CAAC;AACb,YAAY,OAAO,CAAC,CAAC;AACrB,QAAQ,CAAC;AACT;AACA;AACA,QAAQ,IAAI,UAAU,GAAG,IAAI,CAAC;AAC9B,QAAQ,IAAI,WAAW,GAAG,KAAK,CAAC;AAChC;AACA,QAAQ,QAAQ,CAAC,OAAO,CAAC,CAAC,KAAK,KAAK;AACpC,YAAY,MAAM,UAAU,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC;AAC1C,YAAY,IAAI,UAAU,KAAK,CAAC,EAAE,UAAU,GAAG,KAAK,CAAC;AACrD,YAAY,IAAI,UAAU,IAAI,CAAC,EAAE,WAAW,GAAG,IAAI,CAAC;AACpD,QAAQ,CAAC,CAAC,CAAC;AACX;AACA;AACA,QAAQ,IAAI,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE;AACrC,YAAY,IAAI,UAAU,EAAE;AAC5B,gBAAgB,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;AACpC,gBAAgB,OAAO,CAAC,CAAC;AACzB,YAAY,CAAC;AACb,YAAY,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;AACpC,YAAY,OAAO,CAAC,CAAC;AACrB,QAAQ,CAAC;AACT;AACA;AACA,QAAQ,IAAI,UAAU,EAAE;AACxB,YAAY,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;AAChC,YAAY,OAAO,CAAC,CAAC;AACrB,QAAQ,CAAC;AACT,QAAQ,IAAI,WAAW,EAAE;AACzB,YAAY,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;AACpC,YAAY,OAAO,CAAC,CAAC;AACrB,QAAQ,CAAC;AACT,QAAQ,OAAO,CAAC,CAAC;AACjB,IAAI,CAAC;AACL;AACA,IAAI,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;AAC1B,IAAI,OAAO;AACX,QAAQ,OAAO,EAAE,CAAC,GAAG,OAAO,CAAC;AAC7B,QAAQ,WAAW,EAAE,CAAC,GAAG,WAAW,CAAC;AACrC,KAAK,CAAC;AACN;;;;;;;;"}

package/dist/tree.js

@@ -65,24 +65,23 @@ function flatCompleteTree2NestedTree(nodes, parentId = 0, { idKey = "id", parent
 }
 
 /**
- * 在嵌套树中按 `id` 递归查找节点，并返回其指定属性值。
+ * 在嵌套树中按 `id` 递归查找节点
  *
  * @template T extends Record<PropertyKey, any>
  * @param {string | number} id - 要查找的 id
  * @param {T[]} arr - 嵌套树森林
- * @param {string} [resultKey='name'] - 需要返回的字段
  * @param {string} [idKey='id'] - 主键字段
  * @param {string} [childrenKey='children'] - 子节点字段
- * @returns {any} 找到的值；未找到返回 `undefined`
+ * @returns {any} 找到的节点；未找到返回 `undefined`
  */
-const findObjAttrValueById = function findObjAttrValueByIdFn(id, arr, resultKey = "name", idKey = "id", childrenKey = "children") {
+const findTreeNodeById = function findTreeNodeByIdFn(id, arr, idKey = "id", childrenKey = "children") {
     if (Array.isArray(arr) && arr.length > 0) {
         for (let i = 0; i < arr.length; i++) {
             const item = arr[i];
             if (item[idKey]?.toString() === id?.toString()) {
-                return item[resultKey];
+                return item;
             } else if (Array.isArray(item[childrenKey]) && item[childrenKey].length > 0) {
-                const result = findObjAttrValueByIdFn(id, item[childrenKey], resultKey, idKey, childrenKey);
+                const result = findTreeNodeByIdFn(id, item[childrenKey], idKey, childrenKey);
                 if (result) {
                     return result;
                 }
@@ -91,6 +90,21 @@ const findObjAttrValueById = function findObjAttrValueByIdFn(id, arr, resultKey
     }
 };
 
+/**
+ * 在嵌套树中按 `id` 递归查找节点，并返回其指定属性值。
+ *
+ * @template T extends Record<PropertyKey, any>
+ * @param {string | number} id - 要查找的 id
+ * @param {T[]} arr - 嵌套树森林
+ * @param {string} [resultKey='name'] - 需要返回的字段
+ * @param {string} [idKey='id'] - 主键字段
+ * @param {string} [childrenKey='children'] - 子节点字段
+ * @returns {any} 找到的值；未找到返回 `undefined`
+ */
+function findObjAttrValueById(id, arr, resultKey = "name", idKey = "id", childrenKey = "children") {
+    return findTreeNodeById(id, arr, idKey, childrenKey)?.[resultKey];
+}
+
 /**
  * 从服务端返回的已选 id 数组里，提取出
  * 1. 叶子节点
@@ -165,5 +179,5 @@ function extractFullyCheckedKeys(treeData, selectedKeys, idKey = "id", childrenK
     };
 }
 
-export { extractFullyCheckedKeys, findObjAttrValueById, flatCompleteTree2NestedTree, nestedTree2IdMap };
+export { extractFullyCheckedKeys, findObjAttrValueById, findTreeNodeById, flatCompleteTree2NestedTree, nestedTree2IdMap };
 //# sourceMappingURL=tree.js.map

package/dist/tree.js.map

@@ -1 +1 @@
-{"version":3,"file":"tree.js","sources":["../src/source/tree.js"],"sourcesContent":["/**\r\n * 把嵌套树拍平成 `{ [id]: node }` 映射，同时把原 `children` 置为 `null`。\r\n *\r\n * @template T extends Record<PropertyKey, any>\r\n * @param {T[]} data - 嵌套树森林\r\n * @param {string} [idKey='id'] - 主键字段\r\n * @param {string} [childrenKey='children'] - 子节点字段\r\n * @returns {Record<string, T & { [k in typeof childrenKey]: null }>} id→节点的映射表\r\n */\r\nexport function nestedTree2IdMap(data, idKey = \"id\", childrenKey = \"children\") {\r\n    const retObj = {};\r\n    function fn(nodes) {\r\n        if (Array.isArray(nodes) && nodes.length > 0) {\r\n            nodes.forEach((node) => {\r\n                retObj[node[idKey]] = { ...node };\r\n                retObj[node[idKey]][childrenKey] = null;\r\n\r\n                fn(node[childrenKey]);\r\n            });\r\n        }\r\n    }\r\n    fn(data);\r\n    return retObj;\r\n}\r\n\r\n/**\r\n * 把**已包含完整父子关系**的扁平节点列表还原成嵌套树（森林）。\r\n *\r\n * @template T extends Record<PropertyKey, any>\r\n * @param {T[]} nodes - 扁平节点列表（必须包含 id / parentId）\r\n * @param {number | string} [parentId=0] - 根节点标识值\r\n * @param {Object} [opts] - 字段映射配置\r\n * @param {string} [opts.idKey='id'] - 节点主键\r\n * @param {string} [opts.parentKey='parentId'] - 父节点外键\r\n * @param {string} [opts.childrenKey='children'] - 存放子节点的字段\r\n * @returns {(T & { [k in typeof childrenKey]: T[] })[]} 嵌套树森林\r\n */\r\nexport function flatCompleteTree2NestedTree(nodes, parentId = 0, { idKey = \"id\", parentKey = \"parentId\", childrenKey = \"children\" } = {}) {\r\n    const map = new Map(); // id -> node\r\n    const items = []; // 多根森林\r\n\r\n    // 1. 初始化：保证每个节点都有 children，并存入 map\r\n    for (const item of nodes) {\r\n        const node = { ...item, [childrenKey]: [] };\r\n        map.set(item[idKey], node);\r\n    }\r\n\r\n    // 2. 建立父子关系\r\n    for (const item of nodes) {\r\n        const node = map.get(item[idKey]);\r\n        const parentIdVal = item[parentKey];\r\n\r\n        if (parentIdVal === parentId) {\r\n            // 根层\r\n            items.push(node);\r\n        } else {\r\n            // 非根层：找到父节点，把自己挂上去\r\n            const parent = map.get(parentIdVal);\r\n            if (parent) parent[childrenKey].push(node);\r\n            // 如果 parent 不存在，说明数据不完整，可自定义处理\r\n        }\r\n    }\r\n\r\n    return items;\r\n}\r\n\r\n/**\r\n * 在嵌套树中按 `id` 递归查找节点，并返回其指定属性值。\r\n *\r\n * @template T extends Record<PropertyKey, any>\r\n * @param {string | number} id - 要查找的 id\r\n * @param {T[]} arr - 嵌套树森林\r\n * @param {string} [resultKey='name'] - 需要返回的字段\r\n * @param {string} [idKey='id'] - 主键字段\r\n * @param {string} [childrenKey='children'] - 子节点字段\r\n * @returns {any} 找到的值；未找到返回 `undefined`\r\n */\r\nexport const findObjAttrValueById = function findObjAttrValueByIdFn(id, arr, resultKey = \"name\", idKey = \"id\", childrenKey = \"children\") {\r\n    if (Array.isArray(arr) && arr.length > 0) {\r\n        for (let i = 0; i < arr.length; i++) {\r\n            const item = arr[i];\r\n            if (item[idKey]?.toString() === id?.toString()) {\r\n                return item[resultKey];\r\n            } else if (Array.isArray(item[childrenKey]) && item[childrenKey].length > 0) {\r\n                const result = findObjAttrValueByIdFn(id, item[childrenKey], resultKey, idKey, childrenKey);\r\n                if (result) {\r\n                    return result;\r\n                }\r\n            }\r\n        }\r\n    }\r\n};\r\n\r\n/**\r\n * 从服务端返回的已选 id 数组里，提取出\r\n * 1. 叶子节点\r\n * 2. 所有子节点都被选中的父节点\r\n * 其余父节点一律丢弃（由前端 Tree 自动算半选）\r\n *\r\n * @param {Array}  treeData     完整树\r\n * @param {Array}  selectedKeys 后端给的选中 id 数组\r\n * @param {String} idKey        节点唯一字段\r\n * @param {String} childrenKey  子节点字段\r\n * @returns {{checked: string[], halfChecked: string[]}}\r\n */\r\nexport function extractFullyCheckedKeys(treeData, selectedKeys, idKey = \"id\", childrenKey = \"children\") {\r\n    const selectedSet = new Set(selectedKeys);\r\n    const checked = new Set();\r\n    const halfChecked = new Set();\r\n\r\n    /* 返回值含义\r\n        0 - 未选中\r\n        1 - 半选\r\n        2 - 全选\r\n        */\r\n    function dfs(node) {\r\n        const nodeId = node[idKey];\r\n        const children = node[childrenKey] || [];\r\n\r\n        // 叶子\r\n        if (!children.length) {\r\n            if (selectedSet.has(nodeId)) {\r\n                checked.add(nodeId);\r\n                return 2;\r\n            }\r\n            return 0;\r\n        }\r\n\r\n        // 非叶子\r\n        let allChecked = true;\r\n        let someChecked = false;\r\n\r\n        children.forEach((child) => {\r\n            const childState = dfs(child);\r\n            if (childState !== 2) allChecked = false;\r\n            if (childState >= 1) someChecked = true;\r\n        });\r\n\r\n        // 当前节点本身在 selectedKeys 里，但子节点未全选 → 只能算半选\r\n        if (selectedSet.has(nodeId)) {\r\n            if (allChecked) {\r\n                checked.add(nodeId);\r\n                return 2;\r\n            }\r\n            halfChecked.add(nodeId);\r\n            return 1;\r\n        }\r\n\r\n        // 当前节点不在 selectedKeys 里，看子节点\r\n        if (allChecked) {\r\n            checked.add(nodeId);\r\n            return 2;\r\n        }\r\n        if (someChecked) {\r\n            halfChecked.add(nodeId);\r\n            return 1;\r\n        }\r\n        return 0;\r\n    }\r\n\r\n    treeData.forEach(dfs);\r\n    return {\r\n        checked: [...checked],\r\n        halfChecked: [...halfChecked]\r\n    };\r\n}\r\n"],"names":[],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,gBAAgB,CAAC,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,WAAW,GAAG,UAAU,EAAE;AAC/E,IAAI,MAAM,MAAM,GAAG,EAAE,CAAC;AACtB,IAAI,SAAS,EAAE,CAAC,KAAK,EAAE;AACvB,QAAQ,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;AACtD,YAAY,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,KAAK;AACpC,gBAAgB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,IAAI,EAAE,CAAC;AAClD,gBAAgB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,IAAI,CAAC;AACxD;AACA,gBAAgB,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;AACtC,YAAY,CAAC,CAAC,CAAC;AACf,QAAQ,CAAC;AACT,IAAI,CAAC;AACL,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC;AACb,IAAI,OAAO,MAAM,CAAC;AAClB,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,2BAA2B,CAAC,KAAK,EAAE,QAAQ,GAAG,CAAC,EAAE,EAAE,KAAK,GAAG,IAAI,EAAE,SAAS,GAAG,UAAU,EAAE,WAAW,GAAG,UAAU,EAAE,GAAG,EAAE,EAAE;AAC1I,IAAI,MAAM,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;AAC1B,IAAI,MAAM,KAAK,GAAG,EAAE,CAAC;AACrB;AACA;AACA,IAAI,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;AAC9B,QAAQ,MAAM,IAAI,GAAG,EAAE,GAAG,IAAI,EAAE,CAAC,WAAW,GAAG,EAAE,EAAE,CAAC;AACpD,QAAQ,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,CAAC;AACnC,IAAI,CAAC;AACL;AACA;AACA,IAAI,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;AAC9B,QAAQ,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;AAC1C,QAAQ,MAAM,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC;AAC5C;AACA,QAAQ,IAAI,WAAW,KAAK,QAAQ,EAAE;AACtC;AACA,YAAY,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC7B,QAAQ,CAAC,MAAM;AACf;AACA,YAAY,MAAM,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;AAChD,YAAY,IAAI,MAAM,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACvD;AACA,QAAQ,CAAC;AACT,IAAI,CAAC;AACL;AACA,IAAI,OAAO,KAAK,CAAC;AACjB,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,oBAAoB,GAAG,SAAS,sBAAsB,CAAC,EAAE,EAAE,GAAG,EAAE,SAAS,GAAG,MAAM,EAAE,KAAK,GAAG,IAAI,EAAE,WAAW,GAAG,UAAU,EAAE;AACzI,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE;AAC9C,QAAQ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AAC7C,YAAY,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;AAChC,YAAY,IAAI,IAAI,CAAC,KAAK,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,EAAE,QAAQ,EAAE,EAAE;AAC5D,gBAAgB,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC;AACvC,YAAY,CAAC,MAAM,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,IAAI,IAAI,CAAC,WAAW,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE;AACzF,gBAAgB,MAAM,MAAM,GAAG,sBAAsB,CAAC,EAAE,EAAE,IAAI,CAAC,WAAW,CAAC,EAAE,SAAS,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC;AAC5G,gBAAgB,IAAI,MAAM,EAAE;AAC5B,oBAAoB,OAAO,MAAM,CAAC;AAClC,gBAAgB,CAAC;AACjB,YAAY,CAAC;AACb,QAAQ,CAAC;AACT,IAAI,CAAC;AACL,EAAE;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,uBAAuB,CAAC,QAAQ,EAAE,YAAY,EAAE,KAAK,GAAG,IAAI,EAAE,WAAW,GAAG,UAAU,EAAE;AACxG,IAAI,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,CAAC;AAC9C,IAAI,MAAM,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC;AAC9B,IAAI,MAAM,WAAW,GAAG,IAAI,GAAG,EAAE,CAAC;AAClC;AACA;AACA;AACA;AACA;AACA;AACA,IAAI,SAAS,GAAG,CAAC,IAAI,EAAE;AACvB,QAAQ,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;AACnC,QAAQ,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;AACjD;AACA;AACA,QAAQ,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE;AAC9B,YAAY,IAAI,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE;AACzC,gBAAgB,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;AACpC,gBAAgB,OAAO,CAAC,CAAC;AACzB,YAAY,CAAC;AACb,YAAY,OAAO,CAAC,CAAC;AACrB,QAAQ,CAAC;AACT;AACA;AACA,QAAQ,IAAI,UAAU,GAAG,IAAI,CAAC;AAC9B,QAAQ,IAAI,WAAW,GAAG,KAAK,CAAC;AAChC;AACA,QAAQ,QAAQ,CAAC,OAAO,CAAC,CAAC,KAAK,KAAK;AACpC,YAAY,MAAM,UAAU,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC;AAC1C,YAAY,IAAI,UAAU,KAAK,CAAC,EAAE,UAAU,GAAG,KAAK,CAAC;AACrD,YAAY,IAAI,UAAU,IAAI,CAAC,EAAE,WAAW,GAAG,IAAI,CAAC;AACpD,QAAQ,CAAC,CAAC,CAAC;AACX;AACA;AACA,QAAQ,IAAI,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE;AACrC,YAAY,IAAI,UAAU,EAAE;AAC5B,gBAAgB,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;AACpC,gBAAgB,OAAO,CAAC,CAAC;AACzB,YAAY,CAAC;AACb,YAAY,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;AACpC,YAAY,OAAO,CAAC,CAAC;AACrB,QAAQ,CAAC;AACT;AACA;AACA,QAAQ,IAAI,UAAU,EAAE;AACxB,YAAY,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;AAChC,YAAY,OAAO,CAAC,CAAC;AACrB,QAAQ,CAAC;AACT,QAAQ,IAAI,WAAW,EAAE;AACzB,YAAY,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;AACpC,YAAY,OAAO,CAAC,CAAC;AACrB,QAAQ,CAAC;AACT,QAAQ,OAAO,CAAC,CAAC;AACjB,IAAI,CAAC;AACL;AACA,IAAI,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;AAC1B,IAAI,OAAO;AACX,QAAQ,OAAO,EAAE,CAAC,GAAG,OAAO,CAAC;AAC7B,QAAQ,WAAW,EAAE,CAAC,GAAG,WAAW,CAAC;AACrC,KAAK,CAAC;AACN;;;;"}
+{"version":3,"file":"tree.js","sources":["../src/source/tree.js"],"sourcesContent":["/**\r\n * 把嵌套树拍平成 `{ [id]: node }` 映射，同时把原 `children` 置为 `null`。\r\n *\r\n * @template T extends Record<PropertyKey, any>\r\n * @param {T[]} data - 嵌套树森林\r\n * @param {string} [idKey='id'] - 主键字段\r\n * @param {string} [childrenKey='children'] - 子节点字段\r\n * @returns {Record<string, T & { [k in typeof childrenKey]: null }>} id→节点的映射表\r\n */\r\nexport function nestedTree2IdMap(data, idKey = \"id\", childrenKey = \"children\") {\r\n    const retObj = {};\r\n    function fn(nodes) {\r\n        if (Array.isArray(nodes) && nodes.length > 0) {\r\n            nodes.forEach((node) => {\r\n                retObj[node[idKey]] = { ...node };\r\n                retObj[node[idKey]][childrenKey] = null;\r\n\r\n                fn(node[childrenKey]);\r\n            });\r\n        }\r\n    }\r\n    fn(data);\r\n    return retObj;\r\n}\r\n\r\n/**\r\n * 把**已包含完整父子关系**的扁平节点列表还原成嵌套树（森林）。\r\n *\r\n * @template T extends Record<PropertyKey, any>\r\n * @param {T[]} nodes - 扁平节点列表（必须包含 id / parentId）\r\n * @param {number | string} [parentId=0] - 根节点标识值\r\n * @param {Object} [opts] - 字段映射配置\r\n * @param {string} [opts.idKey='id'] - 节点主键\r\n * @param {string} [opts.parentKey='parentId'] - 父节点外键\r\n * @param {string} [opts.childrenKey='children'] - 存放子节点的字段\r\n * @returns {(T & { [k in typeof childrenKey]: T[] })[]} 嵌套树森林\r\n */\r\nexport function flatCompleteTree2NestedTree(nodes, parentId = 0, { idKey = \"id\", parentKey = \"parentId\", childrenKey = \"children\" } = {}) {\r\n    const map = new Map(); // id -> node\r\n    const items = []; // 多根森林\r\n\r\n    // 1. 初始化：保证每个节点都有 children，并存入 map\r\n    for (const item of nodes) {\r\n        const node = { ...item, [childrenKey]: [] };\r\n        map.set(item[idKey], node);\r\n    }\r\n\r\n    // 2. 建立父子关系\r\n    for (const item of nodes) {\r\n        const node = map.get(item[idKey]);\r\n        const parentIdVal = item[parentKey];\r\n\r\n        if (parentIdVal === parentId) {\r\n            // 根层\r\n            items.push(node);\r\n        } else {\r\n            // 非根层：找到父节点，把自己挂上去\r\n            const parent = map.get(parentIdVal);\r\n            if (parent) parent[childrenKey].push(node);\r\n            // 如果 parent 不存在，说明数据不完整，可自定义处理\r\n        }\r\n    }\r\n\r\n    return items;\r\n}\r\n\r\n/**\r\n * 在嵌套树中按 `id` 递归查找节点\r\n *\r\n * @template T extends Record<PropertyKey, any>\r\n * @param {string | number} id - 要查找的 id\r\n * @param {T[]} arr - 嵌套树森林\r\n * @param {string} [idKey='id'] - 主键字段\r\n * @param {string} [childrenKey='children'] - 子节点字段\r\n * @returns {any} 找到的节点；未找到返回 `undefined`\r\n */\r\nexport const findTreeNodeById = function findTreeNodeByIdFn(id, arr, idKey = \"id\", childrenKey = \"children\") {\r\n    if (Array.isArray(arr) && arr.length > 0) {\r\n        for (let i = 0; i < arr.length; i++) {\r\n            const item = arr[i];\r\n            if (item[idKey]?.toString() === id?.toString()) {\r\n                return item;\r\n            } else if (Array.isArray(item[childrenKey]) && item[childrenKey].length > 0) {\r\n                const result = findTreeNodeByIdFn(id, item[childrenKey], idKey, childrenKey);\r\n                if (result) {\r\n                    return result;\r\n                }\r\n            }\r\n        }\r\n    }\r\n};\r\n\r\n/**\r\n * 在嵌套树中按 `id` 递归查找节点，并返回其指定属性值。\r\n *\r\n * @template T extends Record<PropertyKey, any>\r\n * @param {string | number} id - 要查找的 id\r\n * @param {T[]} arr - 嵌套树森林\r\n * @param {string} [resultKey='name'] - 需要返回的字段\r\n * @param {string} [idKey='id'] - 主键字段\r\n * @param {string} [childrenKey='children'] - 子节点字段\r\n * @returns {any} 找到的值；未找到返回 `undefined`\r\n */\r\nexport function findObjAttrValueById(id, arr, resultKey = \"name\", idKey = \"id\", childrenKey = \"children\") {\r\n    return findTreeNodeById(id, arr, idKey, childrenKey)?.[resultKey];\r\n}\r\n\r\n/**\r\n * 从服务端返回的已选 id 数组里，提取出\r\n * 1. 叶子节点\r\n * 2. 所有子节点都被选中的父节点\r\n * 其余父节点一律丢弃（由前端 Tree 自动算半选）\r\n *\r\n * @param {Array}  treeData     完整树\r\n * @param {Array}  selectedKeys 后端给的选中 id 数组\r\n * @param {String} idKey        节点唯一字段\r\n * @param {String} childrenKey  子节点字段\r\n * @returns {{checked: string[], halfChecked: string[]}}\r\n */\r\nexport function extractFullyCheckedKeys(treeData, selectedKeys, idKey = \"id\", childrenKey = \"children\") {\r\n    const selectedSet = new Set(selectedKeys);\r\n    const checked = new Set();\r\n    const halfChecked = new Set();\r\n\r\n    /* 返回值含义\r\n        0 - 未选中\r\n        1 - 半选\r\n        2 - 全选\r\n        */\r\n    function dfs(node) {\r\n        const nodeId = node[idKey];\r\n        const children = node[childrenKey] || [];\r\n\r\n        // 叶子\r\n        if (!children.length) {\r\n            if (selectedSet.has(nodeId)) {\r\n                checked.add(nodeId);\r\n                return 2;\r\n            }\r\n            return 0;\r\n        }\r\n\r\n        // 非叶子\r\n        let allChecked = true;\r\n        let someChecked = false;\r\n\r\n        children.forEach((child) => {\r\n            const childState = dfs(child);\r\n            if (childState !== 2) allChecked = false;\r\n            if (childState >= 1) someChecked = true;\r\n        });\r\n\r\n        // 当前节点本身在 selectedKeys 里，但子节点未全选 → 只能算半选\r\n        if (selectedSet.has(nodeId)) {\r\n            if (allChecked) {\r\n                checked.add(nodeId);\r\n                return 2;\r\n            }\r\n            halfChecked.add(nodeId);\r\n            return 1;\r\n        }\r\n\r\n        // 当前节点不在 selectedKeys 里，看子节点\r\n        if (allChecked) {\r\n            checked.add(nodeId);\r\n            return 2;\r\n        }\r\n        if (someChecked) {\r\n            halfChecked.add(nodeId);\r\n            return 1;\r\n        }\r\n        return 0;\r\n    }\r\n\r\n    treeData.forEach(dfs);\r\n    return {\r\n        checked: [...checked],\r\n        halfChecked: [...halfChecked]\r\n    };\r\n}\r\n"],"names":[],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,gBAAgB,CAAC,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,WAAW,GAAG,UAAU,EAAE;AAC/E,IAAI,MAAM,MAAM,GAAG,EAAE,CAAC;AACtB,IAAI,SAAS,EAAE,CAAC,KAAK,EAAE;AACvB,QAAQ,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE;AACtD,YAAY,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,KAAK;AACpC,gBAAgB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,GAAG,IAAI,EAAE,CAAC;AAClD,gBAAgB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,IAAI,CAAC;AACxD;AACA,gBAAgB,EAAE,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;AACtC,YAAY,CAAC,CAAC,CAAC;AACf,QAAQ,CAAC;AACT,IAAI,CAAC;AACL,IAAI,EAAE,CAAC,IAAI,CAAC,CAAC;AACb,IAAI,OAAO,MAAM,CAAC;AAClB,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,2BAA2B,CAAC,KAAK,EAAE,QAAQ,GAAG,CAAC,EAAE,EAAE,KAAK,GAAG,IAAI,EAAE,SAAS,GAAG,UAAU,EAAE,WAAW,GAAG,UAAU,EAAE,GAAG,EAAE,EAAE;AAC1I,IAAI,MAAM,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;AAC1B,IAAI,MAAM,KAAK,GAAG,EAAE,CAAC;AACrB;AACA;AACA,IAAI,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;AAC9B,QAAQ,MAAM,IAAI,GAAG,EAAE,GAAG,IAAI,EAAE,CAAC,WAAW,GAAG,EAAE,EAAE,CAAC;AACpD,QAAQ,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,CAAC;AACnC,IAAI,CAAC;AACL;AACA;AACA,IAAI,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE;AAC9B,QAAQ,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;AAC1C,QAAQ,MAAM,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC;AAC5C;AACA,QAAQ,IAAI,WAAW,KAAK,QAAQ,EAAE;AACtC;AACA,YAAY,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC7B,QAAQ,CAAC,MAAM;AACf;AACA,YAAY,MAAM,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;AAChD,YAAY,IAAI,MAAM,EAAE,MAAM,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACvD;AACA,QAAQ,CAAC;AACT,IAAI,CAAC;AACL;AACA,IAAI,OAAO,KAAK,CAAC;AACjB,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACY,MAAC,gBAAgB,GAAG,SAAS,kBAAkB,CAAC,EAAE,EAAE,GAAG,EAAE,KAAK,GAAG,IAAI,EAAE,WAAW,GAAG,UAAU,EAAE;AAC7G,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE;AAC9C,QAAQ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AAC7C,YAAY,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;AAChC,YAAY,IAAI,IAAI,CAAC,KAAK,CAAC,EAAE,QAAQ,EAAE,KAAK,EAAE,EAAE,QAAQ,EAAE,EAAE;AAC5D,gBAAgB,OAAO,IAAI,CAAC;AAC5B,YAAY,CAAC,MAAM,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,IAAI,IAAI,CAAC,WAAW,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE;AACzF,gBAAgB,MAAM,MAAM,GAAG,kBAAkB,CAAC,EAAE,EAAE,IAAI,CAAC,WAAW,CAAC,EAAE,KAAK,EAAE,WAAW,CAAC,CAAC;AAC7F,gBAAgB,IAAI,MAAM,EAAE;AAC5B,oBAAoB,OAAO,MAAM,CAAC;AAClC,gBAAgB,CAAC;AACjB,YAAY,CAAC;AACb,QAAQ,CAAC;AACT,IAAI,CAAC;AACL,EAAE;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,oBAAoB,CAAC,EAAE,EAAE,GAAG,EAAE,SAAS,GAAG,MAAM,EAAE,KAAK,GAAG,IAAI,EAAE,WAAW,GAAG,UAAU,EAAE;AAC1G,IAAI,OAAO,gBAAgB,CAAC,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,WAAW,CAAC,GAAG,SAAS,CAAC,CAAC;AACtE,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO,SAAS,uBAAuB,CAAC,QAAQ,EAAE,YAAY,EAAE,KAAK,GAAG,IAAI,EAAE,WAAW,GAAG,UAAU,EAAE;AACxG,IAAI,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,CAAC;AAC9C,IAAI,MAAM,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC;AAC9B,IAAI,MAAM,WAAW,GAAG,IAAI,GAAG,EAAE,CAAC;AAClC;AACA;AACA;AACA;AACA;AACA;AACA,IAAI,SAAS,GAAG,CAAC,IAAI,EAAE;AACvB,QAAQ,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC;AACnC,QAAQ,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;AACjD;AACA;AACA,QAAQ,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE;AAC9B,YAAY,IAAI,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE;AACzC,gBAAgB,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;AACpC,gBAAgB,OAAO,CAAC,CAAC;AACzB,YAAY,CAAC;AACb,YAAY,OAAO,CAAC,CAAC;AACrB,QAAQ,CAAC;AACT;AACA;AACA,QAAQ,IAAI,UAAU,GAAG,IAAI,CAAC;AAC9B,QAAQ,IAAI,WAAW,GAAG,KAAK,CAAC;AAChC;AACA,QAAQ,QAAQ,CAAC,OAAO,CAAC,CAAC,KAAK,KAAK;AACpC,YAAY,MAAM,UAAU,GAAG,GAAG,CAAC,KAAK,CAAC,CAAC;AAC1C,YAAY,IAAI,UAAU,KAAK,CAAC,EAAE,UAAU,GAAG,KAAK,CAAC;AACrD,YAAY,IAAI,UAAU,IAAI,CAAC,EAAE,WAAW,GAAG,IAAI,CAAC;AACpD,QAAQ,CAAC,CAAC,CAAC;AACX;AACA;AACA,QAAQ,IAAI,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE;AACrC,YAAY,IAAI,UAAU,EAAE;AAC5B,gBAAgB,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;AACpC,gBAAgB,OAAO,CAAC,CAAC;AACzB,YAAY,CAAC;AACb,YAAY,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;AACpC,YAAY,OAAO,CAAC,CAAC;AACrB,QAAQ,CAAC;AACT;AACA;AACA,QAAQ,IAAI,UAAU,EAAE;AACxB,YAAY,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;AAChC,YAAY,OAAO,CAAC,CAAC;AACrB,QAAQ,CAAC;AACT,QAAQ,IAAI,WAAW,EAAE;AACzB,YAAY,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;AACpC,YAAY,OAAO,CAAC,CAAC;AACrB,QAAQ,CAAC;AACT,QAAQ,OAAO,CAAC,CAAC;AACjB,IAAI,CAAC;AACL;AACA,IAAI,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;AAC1B,IAAI,OAAO;AACX,QAAQ,OAAO,EAAE,CAAC,GAAG,OAAO,CAAC;AAC7B,QAAQ,WAAW,EAAE,CAAC,GAAG,WAAW,CAAC;AACrC,KAAK,CAAC;AACN;;;;"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "a2bei4-utils",
-  "version": "1.0.3",
+  "version": "1.0.5",
   "description": "🧰 零依赖、ESM 的 JS 业务工具箱：数组乱序/深浅克隆、防抖节流、URL/query 解析、Date/时长格式化、随机汉字/字母、文件下载、事件总线、UUID/分布式短 ID、树结构互转等 40+ 常用函数 & 类，Tree-Shaking 友好。",
   "private": false,
   "type": "module",
@@ -55,6 +55,11 @@
       "import": "./dist/id.js",
       "require": "./dist/id.cjs"
     },
+    "./menu": {
+      "types": "./types/menu.d.ts",
+      "import": "./dist/menu.js",
+      "require": "./dist/menu.cjs"
+    },
     "./timer": {
       "types": "./types/timer.d.ts",
       "import": "./dist/timer.js",
@@ -135,12 +140,12 @@
   },
   "homepage": "https://github.com/xiaodu114/a2bei4-utils",
   "devDependencies": {
-    "@rollup/plugin-commonjs": "^28.0.6",
-    "@rollup/plugin-node-resolve": "^16.0.2",
-    "@rollup/plugin-terser": "^0.4.4",
-    "prettier": "^3.6.2",
-    "rollup": "^4.52.4",
-    "rollup-plugin-dts": "^6.2.3",
+    "@rollup/plugin-commonjs": "^29.0.2",
+    "@rollup/plugin-node-resolve": "^16.0.3",
+    "@rollup/plugin-terser": "^1.0.0",
+    "prettier": "^3.8.1",
+    "rollup": "^4.60.0",
+    "rollup-plugin-dts": "^6.4.1",
     "rollup-plugin-filesize": "^10.0.0",
     "typescript": "^5.9.3"
   },