tree-processor 0.3.0 → 0.4.0

package/README.md

@@ -2,7 +2,7 @@
 
 一个轻量级的树结构数据处理工具库，使用 TypeScript 编写，支持 tree-shaking，每个格式打包体积约 **3-4 KB**（ESM: 3.25 KB，CJS: 3.42 KB，UMD: 3.56 KB）。
 
-目前已支持 mapTree、filterTree、findTree、pushTree、unshiftTree、popTree、shiftTree、someTree、everyTree、atTree、indexOfTree、atIndexOfTree、nodeDepthMap 和 dedupTree。每个方法的最后一个参数可以自定义 children 和 id 的属性名。
+目前已支持 mapTree、forEachTree、filterTree、findTree、pushTree、unshiftTree、popTree、shiftTree、someTree、everyTree、includesTree、atTree、indexOfTree、atIndexOfTree、getParentTree、nodeDepthMap、dedupTree、removeTree 和 isEmptyTree。每个方法的最后一个参数可以自定义 children 和 id 的属性名。
 
 ## ✨ 特性
 
@@ -12,6 +12,7 @@
 - 🎯 **类似数组 API** - 提供 map、filter、find 等熟悉的数组方法
 - ⚙️ **自定义字段名** - 支持自定义 children 和 id 字段名
 - ✅ **零依赖** - 无外部依赖，开箱即用
+- 🧪 **完善的测试覆盖** - 包含 103 个测试用例，覆盖基础功能、边界情况、异常处理、复杂场景等
 
 ## 📦 安装
 
@@ -91,6 +92,18 @@ t.mapTree(treeData, (item) => {
 })
 ```
 
+### forEachTree（遍历树结构数据的方法，不返回值）
+
+遍历树结构数据，对每个节点执行回调函数。与 mapTree 的区别是不返回值，性能更好，适合只需要遍历而不需要返回结果的场景。
+
+```javascript
+t.forEachTree(treeData, (item) => {
+    console.log(item)
+    // 可以在这里修改节点
+    item.visited = true
+})
+```
+
 ### filterTree（树结构数据的filter方法）
 
 过滤树结构数据，返回满足条件的节点。
@@ -176,6 +189,16 @@ const result = t.everyTree(treeData, item => item.age >= 18)
 console.log(result)
 ```
 
+### includesTree（检查树中是否包含指定节点）
+
+检查树结构数据中是否包含指定ID的节点。
+
+```javascript
+const hasNode = t.includesTree(treeData, targetId)
+
+console.log(hasNode) // true 表示包含该节点，false 表示不包含
+```
+
 ### atTree（根据父节点ID和子节点索引获取节点）
 
 parentId 为指定父节点的 id，nodeIndex 为子节点的索引，可传负数，和数组的 at 方法一样。
@@ -206,6 +229,16 @@ const result = t.atIndexOfTree(treeData, [0, 1, 0])
 console.log(result)
 ```
 
+### getParentTree（获取节点的父节点）
+
+获取指定节点的父节点。如果节点是根节点，返回 null。
+
+```javascript
+const parent = t.getParentTree(treeData, targetId)
+
+console.log(parent) // 返回父节点对象，如果未找到或节点是根节点则返回 null
+```
+
 ### nodeDepthMap（返回节点ID到深度的映射）
 
 返回一个字典，键代表节点的 id，值代表该节点在数据的第几层。
@@ -226,6 +259,27 @@ const result = t.dedupTree(treeData, 'id')
 console.log(result)
 ```
 
+### removeTree（删除指定节点）
+
+删除树结构数据中指定ID的节点，包括根节点和子节点。
+
+```javascript
+const success = t.removeTree(treeData, targetId)
+
+console.log(success) // true 表示删除成功，false 表示未找到节点
+console.log(treeData) // 删除后的树结构
+```
+
+### isEmptyTree（检查树是否为空）
+
+检查树结构数据是否为空。
+
+```javascript
+const isEmpty = t.isEmptyTree(treeData)
+
+console.log(isEmpty) // true 表示树为空，false 表示树不为空
+```
+
 ## 自定义字段名
 
 所有方法都支持自定义 children 和 id 的属性名，通过最后一个参数传入配置对象：
@@ -237,19 +291,6 @@ const result = t.findTree(treeData, (item) => item.nodeId === 2, fieldNames);
 
 ## 测试
 
-项目包含 **73 个测试用例**，覆盖了各种场景和边界情况：
-
-### 测试覆盖范围
-
-- ✅ **基础功能测试** - 所有 13 个核心方法的正常使用场景
-- ✅ **边界情况测试** - 空数据、单节点、深层嵌套等
-- ✅ **异常处理测试** - children 字段为 null/undefined/非数组等情况
-- ✅ **索引边界测试** - 负数索引、超出范围、空路径等
-- ✅ **复杂场景测试** - 多根节点、数据修改、组合操作等
-- ✅ **自定义字段名测试** - 各种自定义字段名的使用场景
-- ✅ **特殊值处理测试** - id 为 0、false、字符串等特殊情况
-- ✅ **去重功能测试** - 嵌套重复、null/undefined 值去重等
-
 ### 运行测试
 
 ```bash
@@ -263,13 +304,6 @@ npm run test:coverage
 npm test -- --run
 ```
 
-### 测试统计
-
-- **测试文件**: 2 个（功能测试 + 导入测试）
-- **测试用例**: 73 个
-- **测试框架**: Vitest
-- **覆盖率**: 包含边界情况和复杂场景的全面测试
-
 ## 开发
 
 ```bash

package/dist/index.d.ts

@@ -18,6 +18,11 @@ export declare function indexOfTree(tree: TreeData, targetId: any, fieldNames?:
 export declare function atIndexOfTree(tree: TreeData, path: number[], fieldNames?: FieldNames): TreeNode | null;
 export declare function nodeDepthMap(tree: TreeData, fieldNames?: FieldNames): Record<string, number>;
 export declare function dedupTree(tree: TreeData, key: string, fieldNames?: FieldNames): TreeData;
+export declare function removeTree(tree: TreeData, targetId: any, fieldNames?: FieldNames): boolean;
+export declare function forEachTree(tree: TreeData, callback: (node: TreeNode) => void, fieldNames?: FieldNames): void;
+export declare function isEmptyTree(tree: TreeData): boolean;
+export declare function getParentTree(tree: TreeData, targetId: any, fieldNames?: FieldNames): TreeNode | null;
+export declare function includesTree(tree: TreeData, targetId: any, fieldNames?: FieldNames): boolean;
 declare const treeProcessor: {
     mapTree: typeof mapTree;
     filterTree: typeof filterTree;
@@ -33,6 +38,11 @@ declare const treeProcessor: {
     atIndexOfTree: typeof atIndexOfTree;
     nodeDepthMap: typeof nodeDepthMap;
     dedupTree: typeof dedupTree;
+    removeTree: typeof removeTree;
+    forEachTree: typeof forEachTree;
+    isEmptyTree: typeof isEmptyTree;
+    getParentTree: typeof getParentTree;
+    includesTree: typeof includesTree;
 };
 export default treeProcessor;
 //# sourceMappingURL=index.d.ts.map

package/dist/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAGA,MAAM,WAAW,UAAU;IACzB,QAAQ,EAAE,MAAM,CAAC;IACjB,EAAE,EAAE,MAAM,CAAC;CACZ;AAaD,MAAM,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;AAK3C,MAAM,MAAM,QAAQ,GAAG,QAAQ,EAAE,CAAC;AASlC,wBAAgB,OAAO,CACrB,IAAI,EAAE,QAAQ,EACd,QAAQ,EAAE,CAAC,IAAI,EAAE,QAAQ,KAAK,GAAG,EACjC,UAAU,GAAE,UAAgC,GAC3C,GAAG,EAAE,CAeP;AASD,wBAAgB,UAAU,CACxB,IAAI,EAAE,QAAQ,EACd,QAAQ,EAAE,CAAC,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,KAAK,OAAO,EACpD,UAAU,GAAE,UAAgC,GAC3C,QAAQ,CAiBV;AASD,wBAAgB,QAAQ,CACtB,IAAI,EAAE,QAAQ,EACd,WAAW,EAAE,CAAC,IAAI,EAAE,QAAQ,KAAK,OAAO,EACxC,UAAU,GAAE,UAAgC,GAC3C,QAAQ,GAAG,IAAI,CAcjB;AAUD,wBAAgB,QAAQ,CACtB,IAAI,EAAE,QAAQ,EACd,cAAc,EAAE,GAAG,EACnB,OAAO,EAAE,QAAQ,EACjB,UAAU,GAAE,UAAgC,GAC3C,OAAO,CAqBT;AAUD,wBAAgB,WAAW,CACzB,IAAI,EAAE,QAAQ,EACd,cAAc,EAAE,GAAG,EACnB,OAAO,EAAE,QAAQ,EACjB,UAAU,GAAE,UAAgC,GAC3C,OAAO,CAqBT;AASD,wBAAgB,OAAO,CACrB,IAAI,EAAE,QAAQ,EACd,MAAM,EAAE,GAAG,EACX,UAAU,GAAE,UAAgC,GAC3C,OAAO,CAsBT;AASD,wBAAgB,SAAS,CACvB,IAAI,EAAE,QAAQ,EACd,MAAM,EAAE,GAAG,EACX,UAAU,GAAE,UAAgC,GAC3C,OAAO,CAsBT;AASD,wBAAgB,QAAQ,CACtB,IAAI,EAAE,QAAQ,EACd,QAAQ,EAAE,CAAC,IAAI,EAAE,QAAQ,KAAK,OAAO,EACrC,UAAU,GAAE,UAAgC,GAC3C,OAAO,CAaT;AASD,wBAAgB,SAAS,CACvB,IAAI,EAAE,QAAQ,EACd,QAAQ,EAAE,CAAC,IAAI,EAAE,QAAQ,KAAK,OAAO,EACrC,UAAU,GAAE,UAAgC,GAC3C,OAAO,CAaT;AAUD,wBAAgB,MAAM,CACpB,IAAI,EAAE,QAAQ,EACd,QAAQ,EAAE,GAAG,EACb,SAAS,EAAE,MAAM,EACjB,UAAU,GAAE,UAAgC,GAC3C,QAAQ,GAAG,IAAI,CAqCjB;AASD,wBAAgB,WAAW,CACzB,IAAI,EAAE,QAAQ,EACd,QAAQ,EAAE,GAAG,EACb,UAAU,GAAE,UAAgC,GAC3C,MAAM,EAAE,GAAG,IAAI,CAsBjB;AASD,wBAAgB,aAAa,CAC3B,IAAI,EAAE,QAAQ,EACd,IAAI,EAAE,MAAM,EAAE,EACd,UAAU,GAAE,UAAgC,GAC3C,QAAQ,GAAG,IAAI,CA4BjB;AAQD,wBAAgB,YAAY,CAC1B,IAAI,EAAE,QAAQ,EACd,UAAU,GAAE,UAAgC,GAC3C,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAexB;AASD,wBAAgB,SAAS,CACvB,IAAI,EAAE,QAAQ,EACd,GAAG,EAAE,MAAM,EACX,UAAU,GAAE,UAAgC,GAC3C,QAAQ,CA+BV;AAKD,QAAA,MAAM,aAAa;;;;;;;;;;;;;;;CAelB,CAAC;AAEF,eAAe,aAAa,CAAC"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAGA,MAAM,WAAW,UAAU;IACzB,QAAQ,EAAE,MAAM,CAAC;IACjB,EAAE,EAAE,MAAM,CAAC;CACZ;AAaD,MAAM,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;AAK3C,MAAM,MAAM,QAAQ,GAAG,QAAQ,EAAE,CAAC;AASlC,wBAAgB,OAAO,CACrB,IAAI,EAAE,QAAQ,EACd,QAAQ,EAAE,CAAC,IAAI,EAAE,QAAQ,KAAK,GAAG,EACjC,UAAU,GAAE,UAAgC,GAC3C,GAAG,EAAE,CAeP;AASD,wBAAgB,UAAU,CACxB,IAAI,EAAE,QAAQ,EACd,QAAQ,EAAE,CAAC,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,KAAK,OAAO,EACpD,UAAU,GAAE,UAAgC,GAC3C,QAAQ,CAiBV;AASD,wBAAgB,QAAQ,CACtB,IAAI,EAAE,QAAQ,EACd,WAAW,EAAE,CAAC,IAAI,EAAE,QAAQ,KAAK,OAAO,EACxC,UAAU,GAAE,UAAgC,GAC3C,QAAQ,GAAG,IAAI,CAcjB;AAUD,wBAAgB,QAAQ,CACtB,IAAI,EAAE,QAAQ,EACd,cAAc,EAAE,GAAG,EACnB,OAAO,EAAE,QAAQ,EACjB,UAAU,GAAE,UAAgC,GAC3C,OAAO,CAqBT;AAUD,wBAAgB,WAAW,CACzB,IAAI,EAAE,QAAQ,EACd,cAAc,EAAE,GAAG,EACnB,OAAO,EAAE,QAAQ,EACjB,UAAU,GAAE,UAAgC,GAC3C,OAAO,CAqBT;AASD,wBAAgB,OAAO,CACrB,IAAI,EAAE,QAAQ,EACd,MAAM,EAAE,GAAG,EACX,UAAU,GAAE,UAAgC,GAC3C,OAAO,CAsBT;AASD,wBAAgB,SAAS,CACvB,IAAI,EAAE,QAAQ,EACd,MAAM,EAAE,GAAG,EACX,UAAU,GAAE,UAAgC,GAC3C,OAAO,CAsBT;AASD,wBAAgB,QAAQ,CACtB,IAAI,EAAE,QAAQ,EACd,QAAQ,EAAE,CAAC,IAAI,EAAE,QAAQ,KAAK,OAAO,EACrC,UAAU,GAAE,UAAgC,GAC3C,OAAO,CAaT;AASD,wBAAgB,SAAS,CACvB,IAAI,EAAE,QAAQ,EACd,QAAQ,EAAE,CAAC,IAAI,EAAE,QAAQ,KAAK,OAAO,EACrC,UAAU,GAAE,UAAgC,GAC3C,OAAO,CAaT;AAUD,wBAAgB,MAAM,CACpB,IAAI,EAAE,QAAQ,EACd,QAAQ,EAAE,GAAG,EACb,SAAS,EAAE,MAAM,EACjB,UAAU,GAAE,UAAgC,GAC3C,QAAQ,GAAG,IAAI,CAqCjB;AASD,wBAAgB,WAAW,CACzB,IAAI,EAAE,QAAQ,EACd,QAAQ,EAAE,GAAG,EACb,UAAU,GAAE,UAAgC,GAC3C,MAAM,EAAE,GAAG,IAAI,CAsBjB;AASD,wBAAgB,aAAa,CAC3B,IAAI,EAAE,QAAQ,EACd,IAAI,EAAE,MAAM,EAAE,EACd,UAAU,GAAE,UAAgC,GAC3C,QAAQ,GAAG,IAAI,CA4BjB;AAQD,wBAAgB,YAAY,CAC1B,IAAI,EAAE,QAAQ,EACd,UAAU,GAAE,UAAgC,GAC3C,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAexB;AASD,wBAAgB,SAAS,CACvB,IAAI,EAAE,QAAQ,EACd,GAAG,EAAE,MAAM,EACX,UAAU,GAAE,UAAgC,GAC3C,QAAQ,CA+BV;AASD,wBAAgB,UAAU,CACxB,IAAI,EAAE,QAAQ,EACd,QAAQ,EAAE,GAAG,EACb,UAAU,GAAE,UAAgC,GAC3C,OAAO,CAuBT;AAQD,wBAAgB,WAAW,CACzB,IAAI,EAAE,QAAQ,EACd,QAAQ,EAAE,CAAC,IAAI,EAAE,QAAQ,KAAK,IAAI,EAClC,UAAU,GAAE,UAAgC,GAC3C,IAAI,CAYN;AAOD,wBAAgB,WAAW,CACzB,IAAI,EAAE,QAAQ,GACb,OAAO,CAET;AASD,wBAAgB,aAAa,CAC3B,IAAI,EAAE,QAAQ,EACd,QAAQ,EAAE,GAAG,EACb,UAAU,GAAE,UAAgC,GAC3C,QAAQ,GAAG,IAAI,CAqBjB;AASD,wBAAgB,YAAY,CAC1B,IAAI,EAAE,QAAQ,EACd,QAAQ,EAAE,GAAG,EACb,UAAU,GAAE,UAAgC,GAC3C,OAAO,CAaT;AAKD,QAAA,MAAM,aAAa;;;;;;;;;;;;;;;;;;;;CAoBlB,CAAC;AAEF,eAAe,aAAa,CAAC"}

package/dist/stats.html

@@ -4929,7 +4929,7 @@ var drawChart = (function (exports) {
   </script>
   <script>
     /*<!--*/
-    const data = {"version":2,"tree":{"name":"root","children":[{"name":"tree-processor.umd.js","children":[{"name":"src/index.ts","uid":"ba49a412-1"}]}],"isRoot":true},"nodeParts":{"ba49a412-1":{"renderedLength":9165,"gzipLength":1358,"brotliLength":1184,"metaUid":"ba49a412-0"}},"nodeMetas":{"ba49a412-0":{"id":"\\src\\index.ts","moduleParts":{"tree-processor.umd.js":"ba49a412-1"},"imported":[],"importedBy":[],"isEntry":true}},"env":{"rollup":"4.56.0"},"options":{"gzip":true,"brotli":true,"sourcemap":false}};
+    const data = {"version":2,"tree":{"name":"root","children":[{"name":"tree-processor.umd.js","children":[{"name":"src/index.ts","uid":"07707b15-1"}]}],"isRoot":true},"nodeParts":{"07707b15-1":{"renderedLength":11403,"gzipLength":1547,"brotliLength":1351,"metaUid":"07707b15-0"}},"nodeMetas":{"07707b15-0":{"id":"\\src\\index.ts","moduleParts":{"tree-processor.umd.js":"07707b15-1"},"imported":[],"importedBy":[],"isEntry":true}},"env":{"rollup":"4.56.0"},"options":{"gzip":true,"brotli":true,"sourcemap":false}};
 
     const run = () => {
       const width = window.innerWidth;

package/dist/tree-processor.cjs.js

@@ -16,11 +16,11 @@ if(Array.isArray(n)&&n.length>0&&r(n))return!0}return!1}(n)}function o(n,e,t,i=r
 const n=o[i.children]
 if(Array.isArray(n)&&n.length>0&&r(n))return!0}return!1}(n)}function c(n,e,t=r){return function r(n){for(const i of n){if(i[t.id]===e){const r=i[t.children]
 return!!(Array.isArray(r)&&r.length>0)&&(r.pop(),!0)}const n=i[t.children]
-if(Array.isArray(n)&&n.length>0&&r(n))return!0}return!1}(n)}function s(n,e,t=r){return function r(n){for(const i of n){if(i[t.id]===e){const r=i[t.children]
+if(Array.isArray(n)&&n.length>0&&r(n))return!0}return!1}(n)}function u(n,e,t=r){return function r(n){for(const i of n){if(i[t.id]===e){const r=i[t.children]
 return!!(Array.isArray(r)&&r.length>0)&&(r.shift(),!0)}const n=i[t.children]
-if(Array.isArray(n)&&n.length>0&&r(n))return!0}return!1}(n)}function u(n,e,t=r){for(const r of n){if(e(r))return!0
+if(Array.isArray(n)&&n.length>0&&r(n))return!0}return!1}(n)}function s(n,e,t=r){for(const r of n){if(e(r))return!0
 const n=r[t.children]
-if(Array.isArray(n)&&n.length>0&&u(n,e,t))return!0}return!1}function f(n,e,t=r){for(const r of n){if(!e(r))return!1
+if(Array.isArray(n)&&n.length>0&&s(n,e,t))return!0}return!1}function f(n,e,t=r){for(const r of n){if(!e(r))return!1
 const n=r[t.children]
 if(Array.isArray(n)&&n.length>0&&!f(n,e,t))return!1}return!0}function l(n,e,t,i=r){const o=function r(n){for(const t of n){if(t[i.id]===e)return t
 const n=t[i.children]
@@ -29,11 +29,11 @@ if(e)return e}}return null}(n)
 if(!o)return null
 const c=o[i.children]
 if(!Array.isArray(c)||0===c.length)return null
-const s=t>=0?t:c.length+t
-return s>=0&&s<c.length?c[s]:null}function h(n,e,t=r){return function r(n,i=[]){for(let o=0;o<n.length;o++){const c=n[o],s=[...i,o]
-if(c[t.id]===e)return s
-const u=c[t.children]
-if(Array.isArray(u)&&u.length>0){const n=r(u,s)
+const u=t>=0?t:c.length+t
+return u>=0&&u<c.length?c[u]:null}function h(n,e,t=r){return function r(n,i=[]){for(let o=0;o<n.length;o++){const c=n[o],u=[...i,o]
+if(c[t.id]===e)return u
+const s=c[t.children]
+if(Array.isArray(s)&&s.length>0){const n=r(s,u)
 if(n)return n}}return null}(n)}function a(n,e,t=r){if(!Array.isArray(e)||0===e.length)return null
 let i=n
 for(let r=0;r<e.length;r++){const n=e[r]
@@ -49,6 +49,16 @@ Array.isArray(n)&&n.length>0&&r(n,i+1)}}(n),t}function y(n,e,t=r){const i=new Se
 return function r(n){const o=[]
 for(const c of n){const n=c[e]
 if(null!=n){if(i.has(n))continue
-i.add(n)}const s={...c},u=c[t.children]
-Array.isArray(u)&&u.length>0&&(s[t.children]=r(u)),o.push(s)}return o}(n)}const A={mapTree:n,filterTree:e,findTree:t,pushTree:i,unshiftTree:o,popTree:c,shiftTree:s,someTree:u,everyTree:f,atTree:l,indexOfTree:h,atIndexOfTree:a,nodeDepthMap:d,dedupTree:y}
-exports.atIndexOfTree=a,exports.atTree=l,exports.dedupTree=y,exports.default=A,exports.everyTree=f,exports.filterTree=e,exports.findTree=t,exports.indexOfTree=h,exports.mapTree=n,exports.nodeDepthMap=d,exports.popTree=c,exports.pushTree=i,exports.shiftTree=s,exports.someTree=u,exports.unshiftTree=o
+i.add(n)}const u={...c},s=c[t.children]
+Array.isArray(s)&&s.length>0&&(u[t.children]=r(s)),o.push(u)}return o}(n)}function A(n,e,t=r){return function r(n){for(let i=0;i<n.length;i++){const o=n[i]
+if(o[t.id]===e)return n.splice(i,1),!0
+const c=o[t.children]
+if(Array.isArray(c)&&c.length>0&&r(c))return!0}return!1}(n)}function p(n,e,t=r){!function r(n){for(const i of n){e(i)
+const n=i[t.children]
+Array.isArray(n)&&n.length>0&&r(n)}}(n)}function T(r){return!Array.isArray(r)||0===r.length}function g(n,e,t=r){return function r(n,i=null){for(const o of n){if(o[t.id]===e)return i
+const n=o[t.children]
+if(Array.isArray(n)&&n.length>0){const e=r(n,o)
+if(null!==e)return e}}return null}(n)}function x(n,e,t=r){for(const r of n){if(r[t.id]===e)return!0
+const n=r[t.children]
+if(Array.isArray(n)&&n.length>0&&x(n,e,t))return!0}return!1}const m={mapTree:n,filterTree:e,findTree:t,pushTree:i,unshiftTree:o,popTree:c,shiftTree:u,someTree:s,everyTree:f,atTree:l,indexOfTree:h,atIndexOfTree:a,nodeDepthMap:d,dedupTree:y,removeTree:A,forEachTree:p,isEmptyTree:T,getParentTree:g,includesTree:x}
+exports.atIndexOfTree=a,exports.atTree=l,exports.dedupTree=y,exports.default=m,exports.everyTree=f,exports.filterTree=e,exports.findTree=t,exports.forEachTree=p,exports.getParentTree=g,exports.includesTree=x,exports.indexOfTree=h,exports.isEmptyTree=T,exports.mapTree=n,exports.nodeDepthMap=d,exports.popTree=c,exports.pushTree=i,exports.removeTree=A,exports.shiftTree=u,exports.someTree=s,exports.unshiftTree=o

package/dist/tree-processor.esm.js

@@ -48,5 +48,15 @@ return function r(n){const o=[]
 for(const c of n){const n=c[t]
 if(null!=n){if(i.has(n))continue
 i.add(n)}const u={...c},f=c[e.children]
-Array.isArray(f)&&f.length>0&&(u[e.children]=r(f)),o.push(u)}return o}(n)}const A={mapTree:n,filterTree:t,findTree:e,pushTree:i,unshiftTree:o,popTree:c,shiftTree:u,someTree:f,everyTree:l,atTree:s,indexOfTree:h,atIndexOfTree:a,nodeDepthMap:d,dedupTree:y}
-export{a as atIndexOfTree,s as atTree,y as dedupTree,A as default,l as everyTree,t as filterTree,e as findTree,h as indexOfTree,n as mapTree,d as nodeDepthMap,c as popTree,i as pushTree,u as shiftTree,f as someTree,o as unshiftTree}
+Array.isArray(f)&&f.length>0&&(u[e.children]=r(f)),o.push(u)}return o}(n)}function A(n,t,e=r){return function r(n){for(let i=0;i<n.length;i++){const o=n[i]
+if(o[e.id]===t)return n.splice(i,1),!0
+const c=o[e.children]
+if(Array.isArray(c)&&c.length>0&&r(c))return!0}return!1}(n)}function g(n,t,e=r){!function r(n){for(const i of n){t(i)
+const n=i[e.children]
+Array.isArray(n)&&n.length>0&&r(n)}}(n)}function T(r){return!Array.isArray(r)||0===r.length}function p(n,t,e=r){return function r(n,i=null){for(const o of n){if(o[e.id]===t)return i
+const n=o[e.children]
+if(Array.isArray(n)&&n.length>0){const t=r(n,o)
+if(null!==t)return t}}return null}(n)}function m(n,t,e=r){for(const r of n){if(r[e.id]===t)return!0
+const n=r[e.children]
+if(Array.isArray(n)&&n.length>0&&m(n,t,e))return!0}return!1}const x={mapTree:n,filterTree:t,findTree:e,pushTree:i,unshiftTree:o,popTree:c,shiftTree:u,someTree:f,everyTree:l,atTree:s,indexOfTree:h,atIndexOfTree:a,nodeDepthMap:d,dedupTree:y,removeTree:A,forEachTree:g,isEmptyTree:T,getParentTree:p,includesTree:m}
+export{a as atIndexOfTree,s as atTree,y as dedupTree,x as default,l as everyTree,t as filterTree,e as findTree,g as forEachTree,p as getParentTree,m as includesTree,h as indexOfTree,T as isEmptyTree,n as mapTree,d as nodeDepthMap,c as popTree,i as pushTree,A as removeTree,u as shiftTree,f as someTree,o as unshiftTree}

package/dist/tree-processor.umd.js

@@ -13,9 +13,9 @@ if(n)return n}}return null}function o(r,e,t,i=n){return function r(n){for(const
 const n=o[i.children]
 if(Array.isArray(n)&&n.length>0&&r(n))return!0}return!1}(r)}function f(r,e,t,i=n){return function r(n){for(const o of n){if(o[i.id]===e)return o[i.children]||(o[i.children]=[]),o[i.children].unshift(t),!0
 const n=o[i.children]
-if(Array.isArray(n)&&n.length>0&&r(n))return!0}return!1}(r)}function u(r,e,t=n){return function r(n){for(const i of n){if(i[t.id]===e){const r=i[t.children]
-return!!(Array.isArray(r)&&r.length>0)&&(r.pop(),!0)}const n=i[t.children]
 if(Array.isArray(n)&&n.length>0&&r(n))return!0}return!1}(r)}function c(r,e,t=n){return function r(n){for(const i of n){if(i[t.id]===e){const r=i[t.children]
+return!!(Array.isArray(r)&&r.length>0)&&(r.pop(),!0)}const n=i[t.children]
+if(Array.isArray(n)&&n.length>0&&r(n))return!0}return!1}(r)}function u(r,e,t=n){return function r(n){for(const i of n){if(i[t.id]===e){const r=i[t.children]
 return!!(Array.isArray(r)&&r.length>0)&&(r.shift(),!0)}const n=i[t.children]
 if(Array.isArray(n)&&n.length>0&&r(n))return!0}return!1}(r)}function s(r,e,t=n){for(const n of r){if(e(n))return!0
 const r=n[t.children]
@@ -28,11 +28,11 @@ if(e)return e}}return null}(r)
 if(!o)return null
 const f=o[i.children]
 if(!Array.isArray(f)||0===f.length)return null
-const u=t>=0?t:f.length+t
-return u>=0&&u<f.length?f[u]:null}function d(r,e,t=n){return function r(n,i=[]){for(let o=0;o<n.length;o++){const f=n[o],u=[...i,o]
-if(f[t.id]===e)return u
-const c=f[t.children]
-if(Array.isArray(c)&&c.length>0){const n=r(c,u)
+const c=t>=0?t:f.length+t
+return c>=0&&c<f.length?f[c]:null}function d(r,e,t=n){return function r(n,i=[]){for(let o=0;o<n.length;o++){const f=n[o],c=[...i,o]
+if(f[t.id]===e)return c
+const u=f[t.children]
+if(Array.isArray(u)&&u.length>0){const n=r(u,c)
 if(n)return n}}return null}(r)}function a(r,e,t=n){if(!Array.isArray(e)||0===e.length)return null
 let i=r
 for(let r=0;r<e.length;r++){const n=e[r]
@@ -48,6 +48,16 @@ Array.isArray(n)&&n.length>0&&r(n,i+1)}}(r),t}function A(r,e,t=n){const i=new Se
 return function r(n){const o=[]
 for(const f of n){const n=f[e]
 if(null!=n){if(i.has(n))continue
-i.add(n)}const u={...f},c=f[t.children]
-Array.isArray(c)&&c.length>0&&(u[t.children]=r(c)),o.push(u)}return o}(r)}const T={mapTree:e,filterTree:t,findTree:i,pushTree:o,unshiftTree:f,popTree:u,shiftTree:c,someTree:s,everyTree:l,atTree:h,indexOfTree:d,atIndexOfTree:a,nodeDepthMap:y,dedupTree:A}
-r.atIndexOfTree=a,r.atTree=h,r.dedupTree=A,r.default=T,r.everyTree=l,r.filterTree=t,r.findTree=i,r.indexOfTree=d,r.mapTree=e,r.nodeDepthMap=y,r.popTree=u,r.pushTree=o,r.shiftTree=c,r.someTree=s,r.unshiftTree=f,Object.defineProperties(r,{__esModule:{value:!0},[Symbol.toStringTag]:{value:"Module"}})})
+i.add(n)}const c={...f},u=f[t.children]
+Array.isArray(u)&&u.length>0&&(c[t.children]=r(u)),o.push(c)}return o}(r)}function T(r,e,t=n){return function r(n){for(let i=0;i<n.length;i++){const o=n[i]
+if(o[t.id]===e)return n.splice(i,1),!0
+const f=o[t.children]
+if(Array.isArray(f)&&f.length>0&&r(f))return!0}return!1}(r)}function g(r,e,t=n){!function r(n){for(const i of n){e(i)
+const n=i[t.children]
+Array.isArray(n)&&n.length>0&&r(n)}}(r)}function p(r){return!Array.isArray(r)||0===r.length}function m(r,e,t=n){return function r(n,i=null){for(const o of n){if(o[t.id]===e)return i
+const n=o[t.children]
+if(Array.isArray(n)&&n.length>0){const e=r(n,o)
+if(null!==e)return e}}return null}(r)}function x(r,e,t=n){for(const n of r){if(n[t.id]===e)return!0
+const r=n[t.children]
+if(Array.isArray(r)&&r.length>0&&x(r,e,t))return!0}return!1}const v={mapTree:e,filterTree:t,findTree:i,pushTree:o,unshiftTree:f,popTree:c,shiftTree:u,someTree:s,everyTree:l,atTree:h,indexOfTree:d,atIndexOfTree:a,nodeDepthMap:y,dedupTree:A,removeTree:T,forEachTree:g,isEmptyTree:p,getParentTree:m,includesTree:x}
+r.atIndexOfTree=a,r.atTree=h,r.dedupTree=A,r.default=v,r.everyTree=l,r.filterTree=t,r.findTree=i,r.forEachTree=g,r.getParentTree=m,r.includesTree=x,r.indexOfTree=d,r.isEmptyTree=p,r.mapTree=e,r.nodeDepthMap=y,r.popTree=c,r.pushTree=o,r.removeTree=T,r.shiftTree=u,r.someTree=s,r.unshiftTree=f,Object.defineProperties(r,{__esModule:{value:!0},[Symbol.toStringTag]:{value:"Module"}})})

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "tree-processor",
-  "version": "0.3.0",
-  "description": "A lightweight TypeScript library for processing tree-structured data with array-like methods (map, filter, find, push, pop, etc.), supporting tree-shaking and custom field names",
+  "version": "0.4.0",
+  "description": "A lightweight TypeScript library for processing tree-structured data with comprehensive methods (map, filter, find, push, pop, remove, getParent, includes, etc.), supporting tree-shaking and custom field names",
   "main": "dist/tree-processor.cjs.js",
   "module": "dist/tree-processor.esm.js",
   "types": "dist/index.d.ts",