tree-processor 0.8.1 → 0.9.0

package/dist/tree-processor.umd.js

@@ -5,17 +5,17 @@ return function r(n){for(const o of n){i.push(e(o))
 const n=o[t.children]
 Array.isArray(n)&&n.length>0&&r(n)}}(r),i}function t(r,e,t=n){const i=[]
 return function r(n){n.forEach((n,o)=>{e(n,o)&&i.push(n)
-const f=n[t.children]
-Array.isArray(f)&&f.length>0&&r(f,o)})}(r),i}function i(r,e,t=n){for(const n of r){if(e(n))return n
+const c=n[t.children]
+Array.isArray(c)&&c.length>0&&r(c)})}(r),i}function i(r,e,t=n){for(const n of r){if(e(n))return n
 const r=n[t.children]
 if(Array.isArray(r)&&r.length>0){const n=i(r,e,t)
 if(n)return n}}return null}function o(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].push(t),!0
 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
+if(Array.isArray(n)&&n.length>0&&r(n))return!0}return!1}(r)}function c(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]
+if(Array.isArray(n)&&n.length>0&&r(n))return!0}return!1}(r)}function f(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]
+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]
@@ -26,22 +26,22 @@ const n=t[i.children]
 if(Array.isArray(n)&&n.length>0){const e=r(n)
 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 h(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=o[i.children]
+if(!Array.isArray(c)||0===c.length)return null
+const f=t>=0?t:c.length+t
+return f>=0&&f<c.length?c[f]:null}function h(r,e,t=n){return function r(n,i=[]){for(let o=0;o<n.length;o++){const c=n[o],f=[...i,o]
+if(c[t.id]===e)return f
+const u=c[t.children]
+if(Array.isArray(u)&&u.length>0){const n=r(u,f)
 if(n)return n}}return null}(r)}function d(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]
 if(!Array.isArray(i)||n<0||n>=i.length)return null
 const o=i[n]
 if(r===e.length-1)return o
-const f=o[t.children]
-if(!Array.isArray(f))return null
-i=f}return null}function y(r,e=n){const t={}
+const c=o[t.children]
+if(!Array.isArray(c))return null
+i=c}return null}function y(r,e=n){const t={}
 return function r(n,i=1){for(const o of n){t[o[e.id]]=i
 const n=o[e.children]
 Array.isArray(n)&&n.length>0&&r(n,i+1)}}(r),t}function A(r,e,t=n){return function r(n,i=1){for(const o of n){if(o[t.id]===e)return i
@@ -49,51 +49,86 @@ const n=o[t.children]
 if(Array.isArray(n)&&n.length>0){const e=r(n,i+1)
 if(null!==e)return e}}return null}(r)}function T(r,e,t=n){const i=new Set
 return function r(n){const o=[]
-for(const f of n){const n=f[e]
+for(const c of n){const n=c[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)}function g(r,e,t=n){return function r(n){for(let i=0;i<n.length;i++){const o=n[i]
+i.add(n)}const f={...c},u=c[t.children]
+Array.isArray(u)&&u.length>0&&(f[t.children]=r(u)),o.push(f)}return o}(r)}function g(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 p(r,e,t=n){!function r(n){for(const i of n){e(i)
+const c=o[t.children]
+if(Array.isArray(c)&&c.length>0&&r(c))return!0}return!1}(r)}function p(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 D(r){return!Array.isArray(r)||0===r.length}function m(r,e=n){if(!x(r,e))return!0
+Array.isArray(n)&&n.length>0&&r(n)}}(r)}function v(r){return!Array.isArray(r)||0===r.length}function b(r,e=n){if(!j(r,e))return!0
 const t=r[e.children]
-return void 0===t||(!Array.isArray(t)||0===t.length)}function N(r,e,t=n){const i=function r(n){for(const i of n){if(i[t.id]===e)return i
+return void 0===t||!Array.isArray(t)||0===t.length}function m(r,e,t=n){const i=function r(n){for(const i of n){if(i[t.id]===e)return i
 const n=i[t.children]
 if(Array.isArray(n)&&n.length>0){const e=r(n)
 if(null!==e)return e}}return null}(r)
 if(!i)return[]
 const o=i[t.children]
-return Array.isArray(o)?o:[]}function S(r,e,t=n){const i=function r(n,i=null){for(const o of n){if(o[t.id]===e)return{node:o,parent:i}
+return Array.isArray(o)?o:[]}function D(r,e,t=n){const i=function r(n,i=null){for(const o of n){if(o[t.id]===e)return{node:o,parent: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)
 if(!i)return[]
 if(null===i.parent)return r
 const o=i.parent[t.children]
-return Array.isArray(o)?o:[]}function v(r,e,t=n){return function r(n,i=null){for(const o of n){if(o[t.id]===e)return i
+return Array.isArray(o)?o:[]}function N(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 b(r,e,t=n){for(const n of r){if(n[t.id]===e)return!0
+if(null!==e)return e}}return null}(r)}function S(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&&b(r,e,t))return!0}return!1}function x(r,e=n){if(!r||"object"!=typeof r||Array.isArray(r))return!1
+if(Array.isArray(r)&&r.length>0&&S(r,e,t))return!0}return!1}function j(r,e=n){if(!r||"object"!=typeof r||Array.isArray(r))return!1
 const t=r[e.children]
 if(void 0!==t){if(null===t)return!1
 if(!Array.isArray(t))return!1
-for(const r of t)if(!x(r,e))return!1}return!0}function E(r,e=n){if(!Array.isArray(r))return!1
-for(const n of r)if(!x(n,e))return!1
-return!0}function C(r,e=n){if(!r||"object"!=typeof r||Array.isArray(r))return!1
+for(const r of t)if(!j(r,e))return!1}return!0}function M(r,e=n){if(!Array.isArray(r))return!1
+for(const n of r)if(!j(n,e))return!1
+return!0}function E(r,e=n){if(!r||"object"!=typeof r||Array.isArray(r))return!1
 const t=r[e.children]
-return void 0===t||Array.isArray(t)}function j(r,e=n,t=new WeakSet){if(!r||"object"!=typeof r||Array.isArray(r))return!1
+return void 0===t||Array.isArray(t)}function O(r,e=n,t=new WeakSet){if(!r||"object"!=typeof r||Array.isArray(r))return!1
 if(t.has(r))return!1
 t.add(r)
 const i=r[e.children]
 if(void 0!==i){if(null===i)return!1
 if(!Array.isArray(i))return!1
-for(const r of i)if(!j(r,e,t))return!1}return!0}function O(r,e,t=n){if(e<=0)return!1
-return function r(n,i){if(i>e)return!1
+for(const r of i)if(!O(r,e,t))return!1}return!0}function k(r,e,t=n){return!(e<=0)&&function r(n,i){if(i>e)return!1
 for(const e of n){const n=e[t.children]
-if(Array.isArray(n)&&n.length>0&&!r(n,i+1))return!1}return!0}(r,1)}function M(r,e=n){const t=r[e.children]
-return void 0===t||!Array.isArray(t)||0===t.length}function P(r,e,t=n){return!!b(r,e,t)&&null===v(r,e,t)}const k={mapTree:e,filterTree:t,findTree:i,pushTree:o,unshiftTree:f,popTree:u,shiftTree:c,someTree:s,everyTree:l,atTree:a,indexOfTree:h,atIndexOfTree:d,getNodeDepthMap:y,getNodeDepth:A,dedupTree:T,removeTree:g,forEachTree:p,isEmptyTreeData:D,isEmptySingleTreeData:m,getParentTree:v,getChildrenTree:N,getSiblingsTree:S,includesTree:b,isSingleTreeData:x,isTreeData:E,isValidTreeNode:C,isTreeNodeWithCircularCheck:j,isSafeTreeDepth:O,isLeafNode:M,isRootNode:P}
-r.atIndexOfTree=d,r.atTree=a,r.dedupTree=T,r.default=k,r.everyTree=l,r.filterTree=t,r.findTree=i,r.forEachTree=p,r.getChildrenTree=N,r.getNodeDepth=A,r.getNodeDepthMap=y,r.getParentTree=v,r.getSiblingsTree=S,r.includesTree=b,r.indexOfTree=h,r.isEmptySingleTreeData=m,r.isEmptyTreeData=D,r.isLeafNode=M,r.isRootNode=P,r.isSafeTreeDepth=O,r.isSingleTreeData=x,r.isTreeData=E,r.isTreeNodeWithCircularCheck=j,r.isValidTreeNode=C,r.mapTree=e,r.popTree=u,r.pushTree=o,r.removeTree=g,r.shiftTree=c,r.someTree=s,r.unshiftTree=f,Object.defineProperties(r,{__esModule:{value:!0},[Symbol.toStringTag]:{value:"Module"}})})
+if(Array.isArray(n)&&n.length>0&&!r(n,i+1))return!1}return!0}(r,1)}function x(r,e=n){const t=r[e.children]
+return void 0===t||!Array.isArray(t)||0===t.length}function C(r,e,t=n){return!!S(r,e,t)&&null===N(r,e,t)}function I(r,e=n){const t=[]
+return function r(n){for(const i of n){const{[e.children]:n,...o}=i
+t.push(o)
+const c=i[e.children]
+Array.isArray(c)&&c.length>0&&r(c)}}(r),t}function P(r,e={}){const{rootParentId:t=null,parentIdField:i="parentId",fieldNames:o=n}=e
+if(Array.isArray(r)){if(0===r.length)return[]
+const n=new Map
+for(const e of r){const r=e[o.id]
+if(null==r)continue
+const t={...e,[o.children]:[]}
+n.set(r,t)}const e=[]
+for(const c of r){const r=c[o.id],f=c[i]
+if(null==r)continue
+const u=n.get(r)
+if(u)if(f===t||null==f)e.push(u)
+else{const r=n.get(f)
+if(r){const n=r[o.children]
+Array.isArray(n)?n.push(u):r[o.children]=[u]}else e.push(u)}}return e}if(r instanceof Map){if(0===r.size)return[]
+const n=[]
+return r.forEach((r,e)=>{n.push({...r,[o.id]:e})}),P(n,e)}if(r&&"object"==typeof r&&!Array.isArray(r)&&!(r instanceof Map)){const n=r[o.children]
+if(Array.isArray(n))return[r]
+const t=Object.keys(r)
+if(t.length>0){let n=!0
+for(const e of t){const t=r[e]
+if(!t||"object"!=typeof t||Array.isArray(t)){n=!1
+break}}if(n){const n=[]
+for(const e of t){const t=r[e]
+n.push({...t,[o.id]:e})}if(n.length>0)return P(n,e)}}return[{...r,[o.children]:[]}]}return[]}function w(r,e=n){const t=new Map
+return function r(n){for(const i of n){const n=i[e.id]
+if(null!=n){const{[e.children]:r,...o}=i
+t.set(n,o)}const o=i[e.children]
+Array.isArray(o)&&o.length>0&&r(o)}}(r),t}function L(r,e=n){const t=[]
+return Array.isArray(r)&&0!==r.length?(function r(n,i=0){t[i]||(t[i]=[])
+for(const o of n){const{[e.children]:n,...c}=o
+t[i].push(c)
+const f=o[e.children]
+Array.isArray(f)&&f.length>0&&r(f,i+1)}}(r),t):[]}function W(r){return Array.isArray(r)&&0!==r.length&&1===r.length?r[0]:null}const B={mapTree:e,filterTree:t,findTree:i,pushTree:o,unshiftTree:c,popTree:f,shiftTree:u,someTree:s,everyTree:l,atTree:a,indexOfTree:h,atIndexOfTree:d,getNodeDepthMap:y,getNodeDepth:A,dedupTree:T,removeTree:g,forEachTree:p,isEmptyTreeData:v,isEmptySingleTreeData:b,getParentTree:N,getChildrenTree:m,getSiblingsTree:D,includesTree:S,isSingleTreeData:j,isTreeData:M,isValidTreeNode:E,isTreeNodeWithCircularCheck:O,isSafeTreeDepth:k,isLeafNode:x,isRootNode:C,convertToArrayTree:I,convertBackTree:P,convertToMapTree:w,convertToLevelArrayTree:L,convertToObjectTree:W}
+r.atIndexOfTree=d,r.atTree=a,r.convertBackTree=P,r.convertToArrayTree=I,r.convertToLevelArrayTree=L,r.convertToMapTree=w,r.convertToObjectTree=W,r.dedupTree=T,r.default=B,r.everyTree=l,r.filterTree=t,r.findTree=i,r.forEachTree=p,r.getChildrenTree=m,r.getNodeDepth=A,r.getNodeDepthMap=y,r.getParentTree=N,r.getSiblingsTree=D,r.includesTree=S,r.indexOfTree=h,r.isEmptySingleTreeData=b,r.isEmptyTreeData=v,r.isLeafNode=x,r.isRootNode=C,r.isSafeTreeDepth=k,r.isSingleTreeData=j,r.isTreeData=M,r.isTreeNodeWithCircularCheck=O,r.isValidTreeNode=E,r.mapTree=e,r.popTree=f,r.pushTree=o,r.removeTree=g,r.shiftTree=u,r.someTree=s,r.unshiftTree=c,Object.defineProperties(r,{__esModule:{value:!0},[Symbol.toStringTag]:{value:"Module"}})})

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "tree-processor",
-  "version": "0.8.1",
+  "version": "0.9.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",
@@ -20,13 +20,18 @@
     "README.md"
   ],
   "scripts": {
-    "build": "rollup -c",
-    "test": "vitest",
+    "build": "rimraf dist && rollup -c",
+    "test": "npm run build && vitest run src/index-all-dist.test.ts",
+    "test:src": "vitest run src/index.test.ts",
+    "test:dist": "npm run build && vitest run src/index-dist-only.test.ts",
     "test:coverage": "vitest --coverage",
+    "update:badge": "node scripts/update-coverage-badge.js",
+    "update:downloads": "node scripts/update-downloads-badge.js",
     "size:dist": "node scripts/check-size.js",
     "size:src": "node scripts/check-src-size.js",
     "size:all": "npm run size:src && npm run size:dist",
-    "prepublishOnly": "npm run build"
+    "prepublishOnly": "npm run build",
+    "ci": "npm test -- --run && npm run test:coverage && npm run update:badge && npm run update:downloads"
   },
   "keywords": [
     "tree",
@@ -46,12 +51,6 @@
     "deduplicate",
     "menu",
     "navigation",
-    "file-tree",
-    "directory",
-    "category",
-    "comment",
-    "permission",
-    "tree-select",
     "tree-processor"
   ],
   "author": "",
@@ -67,7 +66,9 @@
     "@rollup/plugin-typescript": "^12.1.0",
     "@types/node": "^22.10.2",
     "@vitest/coverage-v8": "^4.0.18",
+    "rimraf": "^6.1.2",
     "rollup": "^4.24.0",
+    "rollup-plugin-node-externals": "^8.1.2",
     "rollup-plugin-visualizer": "^6.0.5",
     "terser": "^5.36.0",
     "tslib": "^2.8.1",