a2bei4-utils 1.0.2 → 1.0.4

package/dist/tree.js

@@ -1,168 +1,168 @@
-/**
- * 把嵌套树拍平成 `{ [id]: node }` 映射，同时把原 `children` 置为 `null`。
- *
- * @template T extends Record<PropertyKey, any>
- * @param {T[]} data - 嵌套树森林
- * @param {string} [idKey='id'] - 主键字段
- * @param {string} [childrenKey='children'] - 子节点字段
- * @returns {Record<string, T & { [k in typeof childrenKey]: null }>} id→节点的映射表
- */
-function nestedTree2IdMap(data, idKey = "id", childrenKey = "children") {
-    const retObj = {};
-    function fn(nodes) {
-        if (Array.isArray(nodes) && nodes.length > 0) {
-            nodes.forEach((node) => {
-                retObj[node[idKey]] = { ...node };
-                retObj[node[idKey]][childrenKey] = null;
-
-                fn(node[childrenKey]);
-            });
-        }
-    }
-    fn(data);
-    return retObj;
-}
-
-/**
- * 把**已包含完整父子关系**的扁平节点列表还原成嵌套树（森林）。
- *
- * @template T extends Record<PropertyKey, any>
- * @param {T[]} nodes - 扁平节点列表（必须包含 id / parentId）
- * @param {number | string} [parentId=0] - 根节点标识值
- * @param {Object} [opts] - 字段映射配置
- * @param {string} [opts.idKey='id'] - 节点主键
- * @param {string} [opts.parentKey='parentId'] - 父节点外键
- * @param {string} [opts.childrenKey='children'] - 存放子节点的字段
- * @returns {(T & { [k in typeof childrenKey]: T[] })[]} 嵌套树森林
- */
-function flatCompleteTree2NestedTree(nodes, parentId = 0, { idKey = "id", parentKey = "parentId", childrenKey = "children" } = {}) {
-    const map = new Map(); // id -> node
-    const items = []; // 多根森林
-
-    // 1. 初始化：保证每个节点都有 children，并存入 map
-    for (const item of nodes) {
-        const node = { ...item, [childrenKey]: [] };
-        map.set(item[idKey], node);
-    }
-
-    // 2. 建立父子关系
-    for (const item of nodes) {
-        const node = map.get(item[idKey]);
-        const parentIdVal = item[parentKey];
-
-        if (parentIdVal === parentId) {
-            // 根层
-            items.push(node);
-        } else {
-            // 非根层：找到父节点，把自己挂上去
-            const parent = map.get(parentIdVal);
-            if (parent) parent[childrenKey].push(node);
-            // 如果 parent 不存在，说明数据不完整，可自定义处理
-        }
-    }
-
-    return items;
-}
-
-/**
- * 在嵌套树中按 `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`
- */
-const findObjAttrValueById = function findObjAttrValueByIdFn(id, arr, resultKey = "name", 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];
-            } else if (Array.isArray(item[childrenKey]) && item[childrenKey].length > 0) {
-                const result = findObjAttrValueByIdFn(id, item[childrenKey], resultKey, idKey, childrenKey);
-                if (result) {
-                    return result;
-                }
-            }
-        }
-    }
-};
-
-/**
- * 从服务端返回的已选 id 数组里，提取出
- * 1. 叶子节点
- * 2. 所有子节点都被选中的父节点
- * 其余父节点一律丢弃（由前端 Tree 自动算半选）
- *
- * @param {Array}  treeData     完整树
- * @param {Array}  selectedKeys 后端给的选中 id 数组
- * @param {String} idKey        节点唯一字段
- * @param {String} childrenKey  子节点字段
- * @returns {{checked: string[], halfChecked: string[]}}
- */
-function extractFullyCheckedKeys(treeData, selectedKeys, idKey = "id", childrenKey = "children") {
-    const selectedSet = new Set(selectedKeys);
-    const checked = new Set();
-    const halfChecked = new Set();
-
-    /* 返回值含义
-        0 - 未选中
-        1 - 半选
-        2 - 全选
-        */
-    function dfs(node) {
-        const nodeId = node[idKey];
-        const children = node[childrenKey] || [];
-
-        // 叶子
-        if (!children.length) {
-            if (selectedSet.has(nodeId)) {
-                checked.add(nodeId);
-                return 2;
-            }
-            return 0;
-        }
-
-        // 非叶子
-        let allChecked = true;
-        let someChecked = false;
-
-        children.forEach((child) => {
-            const childState = dfs(child);
-            if (childState !== 2) allChecked = false;
-            if (childState >= 1) someChecked = true;
-        });
-
-        // 当前节点本身在 selectedKeys 里，但子节点未全选 → 只能算半选
-        if (selectedSet.has(nodeId)) {
-            if (allChecked) {
-                checked.add(nodeId);
-                return 2;
-            }
-            halfChecked.add(nodeId);
-            return 1;
-        }
-
-        // 当前节点不在 selectedKeys 里，看子节点
-        if (allChecked) {
-            checked.add(nodeId);
-            return 2;
-        }
-        if (someChecked) {
-            halfChecked.add(nodeId);
-            return 1;
-        }
-        return 0;
-    }
-
-    treeData.forEach(dfs);
-    return {
-        checked: [...checked],
-        halfChecked: [...halfChecked]
-    };
+/**
+ * 把嵌套树拍平成 `{ [id]: node }` 映射，同时把原 `children` 置为 `null`。
+ *
+ * @template T extends Record<PropertyKey, any>
+ * @param {T[]} data - 嵌套树森林
+ * @param {string} [idKey='id'] - 主键字段
+ * @param {string} [childrenKey='children'] - 子节点字段
+ * @returns {Record<string, T & { [k in typeof childrenKey]: null }>} id→节点的映射表
+ */
+function nestedTree2IdMap(data, idKey = "id", childrenKey = "children") {
+    const retObj = {};
+    function fn(nodes) {
+        if (Array.isArray(nodes) && nodes.length > 0) {
+            nodes.forEach((node) => {
+                retObj[node[idKey]] = { ...node };
+                retObj[node[idKey]][childrenKey] = null;
+
+                fn(node[childrenKey]);
+            });
+        }
+    }
+    fn(data);
+    return retObj;
+}
+
+/**
+ * 把**已包含完整父子关系**的扁平节点列表还原成嵌套树（森林）。
+ *
+ * @template T extends Record<PropertyKey, any>
+ * @param {T[]} nodes - 扁平节点列表（必须包含 id / parentId）
+ * @param {number | string} [parentId=0] - 根节点标识值
+ * @param {Object} [opts] - 字段映射配置
+ * @param {string} [opts.idKey='id'] - 节点主键
+ * @param {string} [opts.parentKey='parentId'] - 父节点外键
+ * @param {string} [opts.childrenKey='children'] - 存放子节点的字段
+ * @returns {(T & { [k in typeof childrenKey]: T[] })[]} 嵌套树森林
+ */
+function flatCompleteTree2NestedTree(nodes, parentId = 0, { idKey = "id", parentKey = "parentId", childrenKey = "children" } = {}) {
+    const map = new Map(); // id -> node
+    const items = []; // 多根森林
+
+    // 1. 初始化：保证每个节点都有 children，并存入 map
+    for (const item of nodes) {
+        const node = { ...item, [childrenKey]: [] };
+        map.set(item[idKey], node);
+    }
+
+    // 2. 建立父子关系
+    for (const item of nodes) {
+        const node = map.get(item[idKey]);
+        const parentIdVal = item[parentKey];
+
+        if (parentIdVal === parentId) {
+            // 根层
+            items.push(node);
+        } else {
+            // 非根层：找到父节点，把自己挂上去
+            const parent = map.get(parentIdVal);
+            if (parent) parent[childrenKey].push(node);
+            // 如果 parent 不存在，说明数据不完整，可自定义处理
+        }
+    }
+
+    return items;
+}
+
+/**
+ * 在嵌套树中按 `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`
+ */
+const findObjAttrValueById = function findObjAttrValueByIdFn(id, arr, resultKey = "name", 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];
+            } else if (Array.isArray(item[childrenKey]) && item[childrenKey].length > 0) {
+                const result = findObjAttrValueByIdFn(id, item[childrenKey], resultKey, idKey, childrenKey);
+                if (result) {
+                    return result;
+                }
+            }
+        }
+    }
+};
+
+/**
+ * 从服务端返回的已选 id 数组里，提取出
+ * 1. 叶子节点
+ * 2. 所有子节点都被选中的父节点
+ * 其余父节点一律丢弃（由前端 Tree 自动算半选）
+ *
+ * @param {Array}  treeData     完整树
+ * @param {Array}  selectedKeys 后端给的选中 id 数组
+ * @param {String} idKey        节点唯一字段
+ * @param {String} childrenKey  子节点字段
+ * @returns {{checked: string[], halfChecked: string[]}}
+ */
+function extractFullyCheckedKeys(treeData, selectedKeys, idKey = "id", childrenKey = "children") {
+    const selectedSet = new Set(selectedKeys);
+    const checked = new Set();
+    const halfChecked = new Set();
+
+    /* 返回值含义
+        0 - 未选中
+        1 - 半选
+        2 - 全选
+        */
+    function dfs(node) {
+        const nodeId = node[idKey];
+        const children = node[childrenKey] || [];
+
+        // 叶子
+        if (!children.length) {
+            if (selectedSet.has(nodeId)) {
+                checked.add(nodeId);
+                return 2;
+            }
+            return 0;
+        }
+
+        // 非叶子
+        let allChecked = true;
+        let someChecked = false;
+
+        children.forEach((child) => {
+            const childState = dfs(child);
+            if (childState !== 2) allChecked = false;
+            if (childState >= 1) someChecked = true;
+        });
+
+        // 当前节点本身在 selectedKeys 里，但子节点未全选 → 只能算半选
+        if (selectedSet.has(nodeId)) {
+            if (allChecked) {
+                checked.add(nodeId);
+                return 2;
+            }
+            halfChecked.add(nodeId);
+            return 1;
+        }
+
+        // 当前节点不在 selectedKeys 里，看子节点
+        if (allChecked) {
+            checked.add(nodeId);
+            return 2;
+        }
+        if (someChecked) {
+            halfChecked.add(nodeId);
+            return 1;
+        }
+        return 0;
+    }
+
+    treeData.forEach(dfs);
+    return {
+        checked: [...checked],
+        halfChecked: [...halfChecked]
+    };
 }
 
 export { extractFullyCheckedKeys, findObjAttrValueById, flatCompleteTree2NestedTree, nestedTree2IdMap };

package/dist/tree.js.map

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