tree-processor 0.9.7 → 0.11.0

package/dist/tree-processor.esm.js

@@ -13,25 +13,27 @@ const n=o[i.children]
 if(Array.isArray(n)&&n.length>0&&r(n))return!0}return!1}(n)}function o(n,t,e,i=r){return function r(n){for(const o of n){if(o[i.id]===t)return o[i.children]||(o[i.children]=[]),o[i.children].unshift(e),!0
 const n=o[i.children]
 if(Array.isArray(n)&&n.length>0&&r(n))return!0}return!1}(n)}function c(n,t,e=r){return function r(n){for(const i of n){if(i[e.id]===t){const r=i[e.children]
-return!!(Array.isArray(r)&&r.length>0)&&(r.pop(),!0)}const n=i[e.children]
-if(Array.isArray(n)&&n.length>0&&r(n))return!0}return!1}(n)}function f(n,t,e=r){return function r(n){for(const i of n){if(i[e.id]===t){const r=i[e.children]
-return!!(Array.isArray(r)&&r.length>0)&&(r.shift(),!0)}const n=i[e.children]
-if(Array.isArray(n)&&n.length>0&&r(n))return!0}return!1}(n)}function u(n,t,e=r){for(const r of n){if(t(r))return!0
+return Array.isArray(r)&&r.length>0&&r.pop()||null}const n=i[e.children]
+if(Array.isArray(n)&&n.length>0){const t=r(n)
+if(null!==t)return t}}return null}(n)}function u(n,t,e=r){return function r(n){for(const i of n){if(i[e.id]===t){const r=i[e.children]
+return Array.isArray(r)&&r.length>0&&r.shift()||null}const n=i[e.children]
+if(Array.isArray(n)&&n.length>0){const t=r(n)
+if(null!==t)return t}}return null}(n)}function l(n,t,e=r){for(const r of n){if(t(r))return!0
 const n=r[e.children]
-if(Array.isArray(n)&&n.length>0&&u(n,t,e))return!0}return!1}function s(n,t,e=r){for(const r of n){if(!t(r))return!1
+if(Array.isArray(n)&&n.length>0&&l(n,t,e))return!0}return!1}function s(n,t,e=r){for(const r of n){if(!t(r))return!1
 const n=r[e.children]
-if(Array.isArray(n)&&n.length>0&&!s(n,t,e))return!1}return!0}function l(n,t,e,i=r){const o=function r(n){for(const e of n){if(e[i.id]===t)return e
+if(Array.isArray(n)&&n.length>0&&!s(n,t,e))return!1}return!0}function f(n,t,e,i=r){const o=function r(n){for(const e of n){if(e[i.id]===t)return e
 const n=e[i.children]
 if(Array.isArray(n)&&n.length>0){const t=r(n)
 if(t)return t}}return null}(n)
 if(!o)return null
 const c=o[i.children]
 if(!Array.isArray(c)||0===c.length)return null
-const f=e>=0?e:c.length+e
-return f>=0&&f<c.length?c[f]:null}function a(n,t,e=r){return function r(n,i=[]){for(let o=0;o<n.length;o++){const c=n[o],f=[...i,o]
-if(c[e.id]===t)return f
-const u=c[e.children]
-if(Array.isArray(u)&&u.length>0){const n=r(u,f)
+const u=e>=0?e:c.length+e
+return u>=0&&u<c.length?c[u]:null}function a(n,t,e=r){return function r(n,i=[]){for(let o=0;o<n.length;o++){const c=n[o],u=[...i,o]
+if(c[e.id]===t)return u
+const l=c[e.children]
+if(Array.isArray(l)&&l.length>0){const n=r(l,u)
 if(n)return n}}return null}(n)}function h(n,t,e=r){if(!Array.isArray(t)||0===t.length)return null
 let i=n
 for(let r=0;r<t.length;r++){const n=t[r]
@@ -46,25 +48,30 @@ const n=o[t.children]
 Array.isArray(n)&&n.length>0&&r(n,i+1)}}(n),e}function d(n,t,e=r){return function r(n,i=1){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,i+1)
-if(null!==t)return t}}return null}(n)}function A(n,t,e=r){const i=new Set
-return function r(n){const o=[]
-for(const c of n){const n=c[t]
+if(null!==t)return t}}return null}(n)}function A(n,t,e=r){const i=new Set,o=r=>{if("function"==typeof t)return t(r)
+if(Array.isArray(t)){const n=[]
+let e=!1
+for(const i of t){const t=r[i]
+null!=t?(e=!0,n.push(String(t))):n.push("")}if(!e)return
+return n.join("
")}return r[t]}
+return function r(n){const t=[]
+for(const c of n){const n=o(c)
 if(null!=n){if(i.has(n))continue
-i.add(n)}const f={...c},u=c[e.children]
-Array.isArray(u)&&u.length>0&&(f[e.children]=r(u)),o.push(f)}return o}(n)}function g(n,t,e=r){return function r(n){for(let i=0;i<n.length;i++){const o=n[i]
+i.add(n)}const u={...c},l=c[e.children]
+Array.isArray(l)&&l.length>0&&(u[e.children]=r(l)),t.push(u)}return t}(n)}function g(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 p(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 v(n,t=r){if(!m(n,t))return!0
+Array.isArray(n)&&n.length>0&&r(n)}}(n)}function T(r){return!Array.isArray(r)||0===r.length}function m(n,t=r){if(!N(n,t))return!0
 const e=n[t.children]
-return void 0===e||!Array.isArray(e)||0===e.length}function b(n,t,e=r){const i=function r(n){for(const i of n){if(i[e.id]===t)return i
+return void 0===e||!Array.isArray(e)||0===e.length}function v(n,t,e=r){const i=function r(n){for(const i of n){if(i[e.id]===t)return i
 const n=i[e.children]
 if(Array.isArray(n)&&n.length>0){const t=r(n)
 if(null!==t)return t}}return null}(n)
 if(!i)return[]
 const o=i[e.children]
-return Array.isArray(o)?o:[]}function j(n,t,e=r){const i=function r(n,i=null){for(const o of n){if(o[e.id]===t)return{node:o,parent:i}
+return Array.isArray(o)?o:[]}function b(n,t,e=r){const i=function r(n,i=null){for(const o of n){if(o[e.id]===t)return{node:o,parent: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)
@@ -74,45 +81,49 @@ const o=i.parent[e.children]
 return Array.isArray(o)?o:[]}function D(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 N(n,t,e=r){for(const r of n){if(r[e.id]===t)return!0
+if(null!==t)return t}}return null}(n)}function x(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&&N(n,t,e))return!0}return!1}function m(n,t=r){if(!n||"object"!=typeof n||Array.isArray(n))return!1
+if(Array.isArray(n)&&n.length>0&&x(n,t,e))return!0}return!1}function N(n,t=r){if(!n||"object"!=typeof n||Array.isArray(n))return!1
 const e=n[t.children]
 if(void 0!==e){if(null===e)return!1
 if(!Array.isArray(e))return!1
-for(const r of e)if(!m(r,t))return!1}return!0}function M(n,t=r){if(!Array.isArray(n))return!1
-for(const r of n)if(!m(r,t))return!1
-return!0}function S(n,t=r){if(!n||"object"!=typeof n||Array.isArray(n))return!1
+for(const r of e)if(!N(r,t))return!1}return!0}function B(n,t=r){if(!Array.isArray(n))return!1
+for(const r of n)if(!N(r,t))return!1
+return!0}function L(n,t=r){if(!n||"object"!=typeof n||Array.isArray(n))return!1
 const e=n[t.children]
-return void 0===e||Array.isArray(e)}function k(n,t=r,e=new WeakSet){if(!n||"object"!=typeof n||Array.isArray(n))return!1
+return void 0===e||Array.isArray(e)}function j(n,t=r,e=new WeakSet){if(!n||"object"!=typeof n||Array.isArray(n))return!1
 if(e.has(n))return!1
 e.add(n)
 const i=n[t.children]
 if(void 0!==i){if(null===i)return!1
 if(!Array.isArray(i))return!1
-for(const r of i)if(!k(r,t,e))return!1}return!0}function E(n,t,e=r){return!(t<=0)&&function r(n,i){if(i>t)return!1
+for(const r of i)if(!j(r,t,e))return!1}return!0}function S(n,t,e=r){return!(t<=0)&&function r(n,i){if(i>t)return!1
 for(const t of n){const n=t[e.children]
 if(Array.isArray(n)&&n.length>0&&!r(n,i+1))return!1}return!0}(n,1)}function w(n,t=r){const e=n[t.children]
-return void 0===e||!Array.isArray(e)||0===e.length}function I(n,t,e=r){return!!N(n,t,e)&&null===D(n,t,e)}function O(n,t=r){const e=[]
+return void 0===e||!Array.isArray(e)||0===e.length}function F(n,t,e=r){const i=function r(n,i=null){for(const o of n){if(o[e.id]===t)return{found:!0,isRoot:null===i}
+const n=o[e.children]
+if(Array.isArray(n)&&n.length>0){const t=r(n,o)
+if(t.found)return t}}return{found:!1,isRoot:!1}}(n)
+return i.found&&i.isRoot}function O(n,t=r){const e=[]
 return function r(n){for(const i of n){const{[t.children]:n,...o}=i
 e.push(o)
 const c=i[t.children]
-Array.isArray(c)&&c.length>0&&r(c)}}(n),e}function x(n,t={}){const{rootParentId:e=null,parentIdField:i="parentId",fieldNames:o=r}=t
+Array.isArray(c)&&c.length>0&&r(c)}}(n),e}function P(n,t={}){const{rootParentId:e=null,parentIdField:i="parentId",fieldNames:o=r}=t
 if(Array.isArray(n)){if(0===n.length)return[]
 const r=new Map
 for(const t of n){const n=t[o.id]
 if(null==n)continue
 const e={...t,[o.children]:[]}
 r.set(n,e)}const t=[]
-for(const c of n){const n=c[o.id],f=c[i]
+for(const c of n){const n=c[o.id],u=c[i]
 if(null==n)continue
-const u=r.get(n)
-if(u)if(f===e||null==f)t.push(u)
-else{const n=r.get(f)
+const l=r.get(n)
+if(l)if(u===e||null==u)t.push(l)
+else{const n=r.get(u)
 if(n){const r=n[o.children]
-Array.isArray(r)?r.push(u):n[o.children]=[u]}else t.push(u)}}return t}if(n instanceof Map){if(0===n.size)return[]
+Array.isArray(r)?r.push(l):n[o.children]=[l]}else t.push(l)}}return t}if(n instanceof Map){if(0===n.size)return[]
 const r=[]
-return n.forEach((n,t)=>{r.push({...n,[o.id]:t})}),x(r,t)}if(n&&"object"==typeof n&&!Array.isArray(n)&&!(n instanceof Map)){const r=n[o.children]
+return n.forEach((n,t)=>{r.push({...n,[o.id]:t})}),P(r,t)}if(n&&"object"==typeof n&&!Array.isArray(n)&&!(n instanceof Map)){const r=n[o.children]
 if(Array.isArray(r))return[n]
 const e=Object.keys(n)
 if(e.length>0){let r=!0
@@ -120,14 +131,81 @@ for(const t of e){const e=n[t]
 if(!e||"object"!=typeof e||Array.isArray(e)){r=!1
 break}}if(r){const r=[]
 for(const t of e){const e=n[t]
-r.push({...e,[o.id]:t})}if(r.length>0)return x(r,t)}}return[{...n,[o.children]:[]}]}return[]}function C(n,t=r){const e=new Map
+r.push({...e,[o.id]:t})}if(r.length>0)return P(r,t)}}return[{...n,[o.children]:[]}]}return[]}function R(n,t=r){const e=new Map
 return function r(n){for(const i of n){const n=i[t.id]
 if(null!=n){const{[t.children]:r,...o}=i
 e.set(n,o)}const o=i[t.children]
-Array.isArray(o)&&o.length>0&&r(o)}}(n),e}function L(n,t=r){const e=[]
+Array.isArray(o)&&o.length>0&&r(o)}}(n),e}function E(n,t=r){const e=[]
 return Array.isArray(n)&&0!==n.length?(function r(n,i=0){e[i]||(e[i]=[])
 for(const o of n){const{[t.children]:n,...c}=o
 e[i].push(c)
-const f=o[t.children]
-Array.isArray(f)&&f.length>0&&r(f,i+1)}}(n),e):[]}function P(r){return Array.isArray(r)&&0!==r.length&&1===r.length?r[0]:null}const W={mapTree:n,filterTree:t,findTree:e,pushTree:i,unshiftTree:o,popTree:c,shiftTree:f,someTree:u,everyTree:s,atTree:l,indexOfTree:a,atIndexOfTree:h,getNodeDepthMap:y,getNodeDepth:d,dedupTree:A,removeTree:g,forEachTree:p,isEmptyTreeData:T,isEmptySingleTreeData:v,getParentTree:D,getChildrenTree:b,getSiblingsTree:j,includesTree:N,isSingleTreeData:m,isTreeData:M,isValidTreeNode:S,isTreeNodeWithCircularCheck:k,isSafeTreeDepth:E,isLeafNode:w,isRootNode:I,convertToArrayTree:O,convertBackTree:x,convertToMapTree:C,convertToLevelArrayTree:L,convertToObjectTree:P}
-export{h as atIndexOfTree,l as atTree,x as convertBackTree,O as convertToArrayTree,L as convertToLevelArrayTree,C as convertToMapTree,P as convertToObjectTree,A as dedupTree,W as default,s as everyTree,t as filterTree,e as findTree,p as forEachTree,b as getChildrenTree,d as getNodeDepth,y as getNodeDepthMap,D as getParentTree,j as getSiblingsTree,N as includesTree,a as indexOfTree,v as isEmptySingleTreeData,T as isEmptyTreeData,w as isLeafNode,I as isRootNode,E as isSafeTreeDepth,m as isSingleTreeData,M as isTreeData,k as isTreeNodeWithCircularCheck,S as isValidTreeNode,n as mapTree,c as popTree,i as pushTree,g as removeTree,f as shiftTree,u as someTree,o as unshiftTree}
+const u=o[t.children]
+Array.isArray(u)&&u.length>0&&r(u,i+1)}}(n),e):[]}function M(r){return Array.isArray(r)&&0!==r.length&&1===r.length?r[0]:null}function W(n,t=r){if(!Array.isArray(n)||0===n.length)return[]
+function e(r){const n={...r},i=r[t.children]
+return Array.isArray(i)&&i.length>0&&(n[t.children]=i.map(r=>e(r))),n}return n.map(r=>e(r))}function k(r){return Array.isArray(r)&&0!==r.length?r.map(r=>({...r})):[]}function C(n,t,e=r){if(!Array.isArray(n)||0===n.length)return[]
+if(!t||"object"!=typeof t||Array.isArray(t)||t.constructor!==Object)throw new Error('cloneSubtree: 必须传入对象，例如 { id: 1 } 或 { name: "xxx" }')
+const i=Object.keys(t)
+if(0===i.length)return[]
+if(i.length>1)throw new Error('cloneSubtree: 查找对象只能包含一个字段，例如 { id: 1 } 或 { name: "xxx" }')
+const o=i[0],c=t[o],u=function r(n){for(const t of n){if(t[o]===c)return t
+const n=t[e.children]
+if(Array.isArray(n)&&n.length>0){const t=r(n)
+if(t)return t}}return null}(n)
+return u?[function r(n){const t={...n},i=n[e.children]
+return Array.isArray(i)&&i.length>0&&(t[e.children]=i.map(n=>r(n))),t}(u)]:[]}function I(n,t,e=r){if(!Array.isArray(n)||0===n.length)return[]
+function i(r){const n={...t(r)},o=r[e.children]
+return Array.isArray(o)&&o.length>0&&(n[e.children]=o.map(r=>i(r))),n}return n.map(r=>i(r))}function V(...n){const t=[]
+for(const e of n)Array.isArray(e)&&e.length>0&&t.push(...W(e,r))
+return t}function z(n,t,e=r){if(!Array.isArray(n)||0===n.length)return[]
+const i=W(n,e)
+return function r(n){n.sort(t)
+for(const t of n){const n=t[e.children]
+Array.isArray(n)&&n.length>0&&r(n)}}(i),i}function q(n,t,e,i=r){let o=e
+return function r(n){for(const e of n){o=t(o,e)
+const n=e[i.children]
+Array.isArray(n)&&n.length>0&&r(n)}}(n),o}function G(n,t,e,i=r){return Array.isArray(n)&&0!==n.length?W(n.slice(t,e),i):[]}function H(n,t,e=r){const i={}
+!function r(n){for(const o of n){const n=String(t.groupBy(o))
+if(!i[n]){i[n]={}
+for(const[r,e]of Object.entries(t.aggregations))"count"===e.operation?i[n][r]=0:"avg"===e.operation?i[n][r]={sum:0,count:0}:"max"===e.operation||"min"===e.operation?i[n][r]=e.field?o[e.field]??null:null:i[n][r]=0}for(const[r,e]of Object.entries(t.aggregations)){const{operation:t,field:c}=e
+if("count"===t)i[n][r]++
+else if("avg"===t){if(c){const t=o[c]??0
+i[n][r].sum+=t,i[n][r].count++}}else if("max"===t){if(c){const t=o[c]
+null!=t&&(null===i[n][r]||t>i[n][r])&&(i[n][r]=t)}}else if("min"===t){if(c){const t=o[c]
+null!=t&&(null===i[n][r]||t<i[n][r])&&(i[n][r]=t)}}else"sum"===t&&c&&(i[n][r]+=o[c]??0)}const c=o[e.children]
+Array.isArray(c)&&c.length>0&&r(c)}}(n)
+for(const r in i)for(const[n,e]of Object.entries(t.aggregations))"avg"===e.operation&&i[r][n].count>0?i[r][n]=i[r][n].sum/i[r][n].count:"avg"===e.operation&&0===i[r][n].count&&(i[r][n]=0)
+return i}function J(n,t,e=r){const i={}
+return function r(n){for(const o of n){const n=String(o[t]??"")
+i[n]||(i[n]=[]),i[n].push(o)
+const c=o[e.children]
+Array.isArray(c)&&c.length>0&&r(c)}}(n),i}function K(n,t,e=r){const i={}
+return function r(n){for(const o of n){const n=String(t(o)??"")
+i[n]||(i[n]=[]),i[n].push(o)
+const c=o[e.children]
+Array.isArray(c)&&c.length>0&&r(c)}}(n),i}function Q(n,t,e=r){return q(n,(r,n)=>r+(n[t]??0),0,e)}function U(n,t,e=r){let i=0,o=0
+return q(n,(r,n)=>{const e=n[t]
+return null!=e&&(i+=e,o++),null},null,e),o>0?i/o:0}function X(n,t,e=r){let i=null,o=!1
+return q(n,(r,n)=>{const e=n[t]
+return null!=e&&"number"==typeof e&&(!o||e>i)&&(i=e,o=!0),null},null,e),o?i:null}function Y(n,t,e=r){let i=null,o=!1
+return q(n,(r,n)=>{const e=n[t]
+return null!=e&&"number"==typeof e&&(!o||e<i)&&(i=e,o=!0),null},null,e),o?i:null}function Z(n,t,e=r){return q(n,t?(r,n)=>r+(t(n)?1:0):r=>r+1,0,e)}function $(n,t=r){if(!Array.isArray(n)||0===n.length)return{totalNodes:0,leafNodes:0,maxDepth:0,minDepth:0,avgDepth:0,levels:0}
+let e=0,i=0,o=0,c=1/0,u=0
+return function r(n,l){for(const s of n){e++,u+=l,l>o&&(o=l),l<c&&(c=l)
+const n=s[t.children]
+Array.isArray(n)&&n.length>0?r(n,l+1):i++}}(n,1),{totalNodes:e,leafNodes:i,maxDepth:o,minDepth:c===1/0?0:c,avgDepth:e>0?u/e:0,levels:o}}function _(n,t={},e=r){const{includeBasic:i=!0,includeLevelAnalysis:o=!0,includeBranchingFactor:c=!0,includeDepthDistribution:u=!0,includeBalanceAnalysis:l=!0,includePathAnalysis:s=!0,includeLeafAnalysis:f=!0}=t
+if(!Array.isArray(n)||0===n.length)return{totalNodes:0,leafNodes:0,internalNodes:0,maxDepth:0,minDepth:0,avgDepth:0,levels:0,byLevel:{},maxWidth:0,avgWidth:0,widthByLevel:{},avgBranchingFactor:0,maxBranchingFactor:0,minBranchingFactor:0,branchingFactorDistribution:{},depthDistribution:{},depthVariance:0,isBalanced:!1,balanceRatio:0,avgPathLength:0,maxPathLength:0,minPathLength:0,leafNodeRatio:0,leafNodesByLevel:{}}
+const a={},h={},y={},d={},A={}
+let g=0,p=0,T=0,m=0,v=1/0,b=0,D=0,x=0,N=0,B=0,L=0,j=0,S=1/0,w=0,F=0,O=1/0
+const P=[]
+!function r(n,t,R){const E=n.length
+o&&(a[t]=(a[t]||0)+E,h[t]=(h[t]||0)+E,E>D&&(D=E),x+=E,N++)
+for(const o of n){g++
+const n=t+1
+if(i&&(b+=n,n>m&&(m=n),n<v&&(v=n)),l&&P.push(n),u&&(y[n]=(y[n]||0)+1),s){const r=R+1
+w+=r,r>F&&(F=r),r<O&&(O=r)}const a=o[e.children],h=Array.isArray(a)?a.length:0
+h>0?(i&&T++,c&&(B+=h,L++,A[h]=(A[h]||0)+1,h>j&&(j=h),h<S&&(S=h)),r(a,n,s?R+1:R)):(i&&p++,f&&(d[n]=(d[n]||0)+1))}}(n,0,0)
+const R=i&&g>0?b/g:0,E=o&&N>0?x/N:0,M=c&&L>0?B/L:0,W=s&&g>0?w/g:0,k=f&&g>0?p/g:0
+let C=0,I=!1,V=0
+if(l){if(P.length>0){const r=R
+C=P.reduce((n,t)=>n+Math.pow(t-r,2),0)/P.length}I=C<2&&m-v<=2,V=m>0?v/m:0}return{totalNodes:i?g:0,leafNodes:i?p:0,internalNodes:i?T:0,maxDepth:i?m:0,minDepth:i?v===1/0?0:v:0,avgDepth:R,levels:i?m:0,byLevel:o?a:{},maxWidth:o?D:0,avgWidth:E,widthByLevel:o?h:{},avgBranchingFactor:M,maxBranchingFactor:c?0===j?0:j:0,minBranchingFactor:c?S===1/0?0:S:0,branchingFactorDistribution:c?A:{},depthDistribution:u?y:{},depthVariance:C,isBalanced:I,balanceRatio:V,avgPathLength:W,maxPathLength:s?F:0,minPathLength:s?O===1/0?0:O:0,leafNodeRatio:k,leafNodesByLevel:f?d:{}}}const rr={mapTree:n,filterTree:t,findTree:e,pushTree:i,unshiftTree:o,popTree:c,shiftTree:u,someTree:l,everyTree:s,atTree:f,indexOfTree:a,atIndexOfTree:h,getNodeDepthMap:y,getNodeDepth:d,dedupTree:A,removeTree:g,forEachTree:p,isEmptyTreeData:T,isEmptySingleTreeData:m,getParentTree:D,getChildrenTree:v,getSiblingsTree:b,includesTree:x,isSingleTreeData:N,isTreeData:B,isValidTreeNode:L,isTreeNodeWithCircularCheck:j,isSafeTreeDepth:S,isLeafNode:w,isRootNode:F,convertToArrayTree:O,convertBackTree:P,convertToMapTree:R,convertToLevelArrayTree:E,convertToObjectTree:M,cloneTree:W,shallowCloneTree:k,cloneSubtree:C,cloneWithTransform:I,concatTree:V,sortTree:z,reduceTree:q,sliceTree:G,aggregateTree:H,groupTree:J,groupByTree:K,sumTree:Q,avgTree:U,maxTree:X,minTree:Y,countTree:Z,getTreeStats:$,analyzeTree:_}
+export{H as aggregateTree,_ as analyzeTree,h as atIndexOfTree,f as atTree,U as avgTree,C as cloneSubtree,W as cloneTree,I as cloneWithTransform,V as concatTree,P as convertBackTree,O as convertToArrayTree,E as convertToLevelArrayTree,R as convertToMapTree,M as convertToObjectTree,Z as countTree,A as dedupTree,rr as default,s as everyTree,t as filterTree,e as findTree,p as forEachTree,v as getChildrenTree,d as getNodeDepth,y as getNodeDepthMap,D as getParentTree,b as getSiblingsTree,$ as getTreeStats,K as groupByTree,J as groupTree,x as includesTree,a as indexOfTree,m as isEmptySingleTreeData,T as isEmptyTreeData,w as isLeafNode,F as isRootNode,S as isSafeTreeDepth,N as isSingleTreeData,B as isTreeData,j as isTreeNodeWithCircularCheck,L as isValidTreeNode,n as mapTree,X as maxTree,Y as minTree,c as popTree,i as pushTree,q as reduceTree,g as removeTree,k as shallowCloneTree,u as shiftTree,G as sliceTree,l as someTree,z as sortTree,Q as sumTree,o as unshiftTree}

package/dist/tree-processor.umd.js

@@ -1,119 +1,130 @@
 !function(r,n){"object"==typeof exports&&"undefined"!=typeof module?n(exports):"function"==typeof define&&define.amd?define(["exports"],n):n((r="undefined"!=typeof globalThis?globalThis:r||self).TreeProcessor={})}(this,function(r){"use strict"
 const n={children:"children",id:"id"}
-function e(r,e,t=n){const i=[]
-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)
+function e(r,e,t=n){const o=[]
+return function r(n){for(const i of n){o.push(e(i))
+const n=i[t.children]
+Array.isArray(n)&&n.length>0&&r(n)}}(r),o}function t(r,e,t=n){const o=[]
+return function r(n){n.forEach((n,i)=>{e(n,i)&&o.push(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
+Array.isArray(c)&&c.length>0&&r(c)})}(r),o}function o(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 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 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 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
+if(Array.isArray(r)&&r.length>0){const n=o(r,e,t)
+if(n)return n}}return null}function i(r,e,t,o=n){return function r(n){for(const i of n){if(i[o.id]===e)return i[o.children]||(i[o.children]=[]),i[o.children].push(t),!0
+const n=i[o.children]
+if(Array.isArray(n)&&n.length>0&&r(n))return!0}return!1}(r)}function c(r,e,t,o=n){return function r(n){for(const i of n){if(i[o.id]===e)return i[o.children]||(i[o.children]=[]),i[o.children].unshift(t),!0
+const n=i[o.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 o of n){if(o[t.id]===e){const r=o[t.children]
+return Array.isArray(r)&&r.length>0&&r.pop()||null}const n=o[t.children]
+if(Array.isArray(n)&&n.length>0){const e=r(n)
+if(null!==e)return e}}return null}(r)}function s(r,e,t=n){return function r(n){for(const o of n){if(o[t.id]===e){const r=o[t.children]
+return Array.isArray(r)&&r.length>0&&r.shift()||null}const n=o[t.children]
+if(Array.isArray(n)&&n.length>0){const e=r(n)
+if(null!==e)return e}}return null}(r)}function l(r,e,t=n){for(const n of r){if(e(n))return!0
 const r=n[t.children]
-if(Array.isArray(r)&&r.length>0&&s(r,e,t))return!0}return!1}function l(r,e,t=n){for(const n of r){if(!e(n))return!1
+if(Array.isArray(r)&&r.length>0&&l(r,e,t))return!0}return!1}function f(r,e,t=n){for(const n of r){if(!e(n))return!1
 const r=n[t.children]
-if(Array.isArray(r)&&r.length>0&&!l(r,e,t))return!1}return!0}function a(r,e,t,i=n){const o=function r(n){for(const t of n){if(t[i.id]===e)return t
-const n=t[i.children]
+if(Array.isArray(r)&&r.length>0&&!f(r,e,t))return!1}return!0}function a(r,e,t,o=n){const i=function r(n){for(const t of n){if(t[o.id]===e)return t
+const n=t[o.children]
 if(Array.isArray(n)&&n.length>0){const e=r(n)
 if(e)return e}}return null}(r)
-if(!o)return null
-const c=o[i.children]
+if(!i)return null
+const c=i[o.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)
+const u=t>=0?t:c.length+t
+return u>=0&&u<c.length?c[u]:null}function h(r,e,t=n){return function r(n,o=[]){for(let i=0;i<n.length;i++){const c=n[i],u=[...o,i]
+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}(r)}function d(r,e,t=n){if(!Array.isArray(e)||0===e.length)return null
-let i=r
+let o=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 c=o[t.children]
+if(!Array.isArray(o)||n<0||n>=o.length)return null
+const i=o[n]
+if(r===e.length-1)return i
+const c=i[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
-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 c of n){const n=c[e]
-if(null!=n){if(i.has(n))continue
-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 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)
+o=c}return null}function y(r,e=n){const t={}
+return function r(n,o=1){for(const i of n){t[i[e.id]]=o
+const n=i[e.children]
+Array.isArray(n)&&n.length>0&&r(n,o+1)}}(r),t}function A(r,e,t=n){return function r(n,o=1){for(const i of n){if(i[t.id]===e)return o
 const n=i[t.children]
-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
+if(Array.isArray(n)&&n.length>0){const e=r(n,o+1)
+if(null!==e)return e}}return null}(r)}function g(r,e,t=n){const o=new Set,i=r=>{if("function"==typeof e)return e(r)
+if(Array.isArray(e)){const n=[]
+let t=!1
+for(const o of e){const e=r[o]
+null!=e?(t=!0,n.push(String(e))):n.push("")}if(!t)return
+return n.join("
")}return r[e]}
+return function r(n){const e=[]
+for(const c of n){const n=i(c)
+if(null!=n){if(o.has(n))continue
+o.add(n)}const u={...c},s=c[t.children]
+Array.isArray(s)&&s.length>0&&(u[t.children]=r(s)),e.push(u)}return e}(r)}function T(r,e,t=n){return function r(n){for(let o=0;o<n.length;o++){const i=n[o]
+if(i[t.id]===e)return n.splice(o,1),!0
+const c=i[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 o of n){e(o)
+const n=o[t.children]
+Array.isArray(n)&&n.length>0&&r(n)}}(r)}function m(r){return!Array.isArray(r)||0===r.length}function v(r,e=n){if(!S(r,e))return!0
 const t=r[e.children]
-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]
+return void 0===t||!Array.isArray(t)||0===t.length}function b(r,e,t=n){const o=function r(n){for(const o of n){if(o[t.id]===e)return o
+const n=o[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 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(!o)return[]
+const i=o[t.children]
+return Array.isArray(i)?i:[]}function D(r,e,t=n){const o=function r(n,o=null){for(const i of n){if(i[t.id]===e)return{node:i,parent:o}
+const n=i[t.children]
+if(Array.isArray(n)&&n.length>0){const e=r(n,i)
 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 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 S(r,e,t=n){for(const n of r){if(n[t.id]===e)return!0
+if(!o)return[]
+if(null===o.parent)return r
+const i=o.parent[t.children]
+return Array.isArray(i)?i:[]}function x(r,e,t=n){return function r(n,o=null){for(const i of n){if(i[t.id]===e)return o
+const n=i[t.children]
+if(Array.isArray(n)&&n.length>0){const e=r(n,i)
+if(null!==e)return e}}return null}(r)}function N(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&&S(r,e,t))return!0}return!1}function j(r,e=n){if(!r||"object"!=typeof r||Array.isArray(r))return!1
+if(Array.isArray(r)&&r.length>0&&N(r,e,t))return!0}return!1}function S(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(!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
+for(const r of t)if(!S(r,e))return!1}return!0}function B(r,e=n){if(!Array.isArray(r))return!1
+for(const n of r)if(!S(n,e))return!1
+return!0}function L(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 O(r,e=n,t=new WeakSet){if(!r||"object"!=typeof r||Array.isArray(r))return!1
+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
 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(!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
+const o=r[e.children]
+if(void 0!==o){if(null===o)return!1
+if(!Array.isArray(o))return!1
+for(const r of o)if(!j(r,e,t))return!1}return!0}function w(r,e,t=n){return!(e<=0)&&function r(n,o){if(o>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 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(n)&&n.length>0&&!r(n,o+1))return!1}return!0}(r,1)}function O(r,e=n){const t=r[e.children]
+return void 0===t||!Array.isArray(t)||0===t.length}function P(r,e,t=n){const o=function r(n,o=null){for(const i of n){if(i[t.id]===e)return{found:!0,isRoot:null===o}
+const n=i[t.children]
+if(Array.isArray(n)&&n.length>0){const e=r(n,i)
+if(e.found)return e}}return{found:!1,isRoot:!1}}(r)
+return o.found&&o.isRoot}function M(r,e=n){const t=[]
+return function r(n){for(const o of n){const{[e.children]:n,...i}=o
+t.push(i)
+const c=o[e.children]
+Array.isArray(c)&&c.length>0&&r(c)}}(r),t}function E(r,e={}){const{rootParentId:t=null,parentIdField:o="parentId",fieldNames:i=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]
+for(const e of r){const r=e[i.id]
 if(null==r)continue
-const t={...e,[o.children]:[]}
+const t={...e,[i.children]:[]}
 n.set(r,t)}const e=[]
-for(const c of r){const r=c[o.id],f=c[i]
+for(const c of r){const r=c[i.id],u=c[o]
 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 s=n.get(r)
+if(s)if(u===t||null==u)e.push(s)
+else{const r=n.get(u)
+if(r){const n=r[i.children]
+Array.isArray(n)?n.push(s):r[i.children]=[s]}else e.push(s)}}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]
+return r.forEach((r,e)=>{n.push({...r,[i.id]:e})}),E(n,e)}if(r&&"object"==typeof r&&!Array.isArray(r)&&!(r instanceof Map)){const n=r[i.children]
 if(Array.isArray(n))return[r]
 const t=Object.keys(r)
 if(t.length>0){let n=!0
@@ -121,14 +132,81 @@ 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"}})})
+n.push({...t,[i.id]:e})}if(n.length>0)return E(n,e)}}return[{...r,[i.children]:[]}]}return[]}function F(r,e=n){const t=new Map
+return function r(n){for(const o of n){const n=o[e.id]
+if(null!=n){const{[e.children]:r,...i}=o
+t.set(n,i)}const i=o[e.children]
+Array.isArray(i)&&i.length>0&&r(i)}}(r),t}function R(r,e=n){const t=[]
+return Array.isArray(r)&&0!==r.length?(function r(n,o=0){t[o]||(t[o]=[])
+for(const i of n){const{[e.children]:n,...c}=i
+t[o].push(c)
+const u=i[e.children]
+Array.isArray(u)&&u.length>0&&r(u,o+1)}}(r),t):[]}function W(r){return Array.isArray(r)&&0!==r.length&&1===r.length?r[0]:null}function k(r,e=n){if(!Array.isArray(r)||0===r.length)return[]
+function t(r){const n={...r},o=r[e.children]
+return Array.isArray(o)&&o.length>0&&(n[e.children]=o.map(r=>t(r))),n}return r.map(r=>t(r))}function C(r){return Array.isArray(r)&&0!==r.length?r.map(r=>({...r})):[]}function I(r,e,t=n){if(!Array.isArray(r)||0===r.length)return[]
+if(!e||"object"!=typeof e||Array.isArray(e)||e.constructor!==Object)throw new Error('cloneSubtree: 必须传入对象，例如 { id: 1 } 或 { name: "xxx" }')
+const o=Object.keys(e)
+if(0===o.length)return[]
+if(o.length>1)throw new Error('cloneSubtree: 查找对象只能包含一个字段，例如 { id: 1 } 或 { name: "xxx" }')
+const i=o[0],c=e[i],u=function r(n){for(const e of n){if(e[i]===c)return e
+const n=e[t.children]
+if(Array.isArray(n)&&n.length>0){const e=r(n)
+if(e)return e}}return null}(r)
+return u?[function r(n){const e={...n},o=n[t.children]
+return Array.isArray(o)&&o.length>0&&(e[t.children]=o.map(n=>r(n))),e}(u)]:[]}function V(r,e,t=n){if(!Array.isArray(r)||0===r.length)return[]
+function o(r){const n={...e(r)},i=r[t.children]
+return Array.isArray(i)&&i.length>0&&(n[t.children]=i.map(r=>o(r))),n}return r.map(r=>o(r))}function z(...r){const e=[]
+for(const t of r)Array.isArray(t)&&t.length>0&&e.push(...k(t,n))
+return e}function _(r,e,t=n){if(!Array.isArray(r)||0===r.length)return[]
+const o=k(r,t)
+return function r(n){n.sort(e)
+for(const e of n){const n=e[t.children]
+Array.isArray(n)&&n.length>0&&r(n)}}(o),o}function q(r,e,t,o=n){let i=t
+return function r(n){for(const t of n){i=e(i,t)
+const n=t[o.children]
+Array.isArray(n)&&n.length>0&&r(n)}}(r),i}function G(r,e,t,o=n){return Array.isArray(r)&&0!==r.length?k(r.slice(e,t),o):[]}function H(r,e,t=n){const o={}
+!function r(n){for(const i of n){const n=String(e.groupBy(i))
+if(!o[n]){o[n]={}
+for(const[r,t]of Object.entries(e.aggregations))"count"===t.operation?o[n][r]=0:"avg"===t.operation?o[n][r]={sum:0,count:0}:"max"===t.operation||"min"===t.operation?o[n][r]=t.field?i[t.field]??null:null:o[n][r]=0}for(const[r,t]of Object.entries(e.aggregations)){const{operation:e,field:c}=t
+if("count"===e)o[n][r]++
+else if("avg"===e){if(c){const e=i[c]??0
+o[n][r].sum+=e,o[n][r].count++}}else if("max"===e){if(c){const e=i[c]
+null!=e&&(null===o[n][r]||e>o[n][r])&&(o[n][r]=e)}}else if("min"===e){if(c){const e=i[c]
+null!=e&&(null===o[n][r]||e<o[n][r])&&(o[n][r]=e)}}else"sum"===e&&c&&(o[n][r]+=i[c]??0)}const c=i[t.children]
+Array.isArray(c)&&c.length>0&&r(c)}}(r)
+for(const r in o)for(const[n,t]of Object.entries(e.aggregations))"avg"===t.operation&&o[r][n].count>0?o[r][n]=o[r][n].sum/o[r][n].count:"avg"===t.operation&&0===o[r][n].count&&(o[r][n]=0)
+return o}function J(r,e,t=n){const o={}
+return function r(n){for(const i of n){const n=String(i[e]??"")
+o[n]||(o[n]=[]),o[n].push(i)
+const c=i[t.children]
+Array.isArray(c)&&c.length>0&&r(c)}}(r),o}function K(r,e,t=n){const o={}
+return function r(n){for(const i of n){const n=String(e(i)??"")
+o[n]||(o[n]=[]),o[n].push(i)
+const c=i[t.children]
+Array.isArray(c)&&c.length>0&&r(c)}}(r),o}function Q(r,e,t=n){return q(r,(r,n)=>r+(n[e]??0),0,t)}function U(r,e,t=n){let o=0,i=0
+return q(r,(r,n)=>{const t=n[e]
+return null!=t&&(o+=t,i++),null},null,t),i>0?o/i:0}function X(r,e,t=n){let o=null,i=!1
+return q(r,(r,n)=>{const t=n[e]
+return null!=t&&"number"==typeof t&&(!i||t>o)&&(o=t,i=!0),null},null,t),i?o:null}function Y(r,e,t=n){let o=null,i=!1
+return q(r,(r,n)=>{const t=n[e]
+return null!=t&&"number"==typeof t&&(!i||t<o)&&(o=t,i=!0),null},null,t),i?o:null}function Z(r,e,t=n){return q(r,e?(r,n)=>r+(e(n)?1:0):r=>r+1,0,t)}function $(r,e=n){if(!Array.isArray(r)||0===r.length)return{totalNodes:0,leafNodes:0,maxDepth:0,minDepth:0,avgDepth:0,levels:0}
+let t=0,o=0,i=0,c=1/0,u=0
+return function r(n,s){for(const l of n){t++,u+=s,s>i&&(i=s),s<c&&(c=s)
+const n=l[e.children]
+Array.isArray(n)&&n.length>0?r(n,s+1):o++}}(r,1),{totalNodes:t,leafNodes:o,maxDepth:i,minDepth:c===1/0?0:c,avgDepth:t>0?u/t:0,levels:i}}function rr(r,e={},t=n){const{includeBasic:o=!0,includeLevelAnalysis:i=!0,includeBranchingFactor:c=!0,includeDepthDistribution:u=!0,includeBalanceAnalysis:s=!0,includePathAnalysis:l=!0,includeLeafAnalysis:f=!0}=e
+if(!Array.isArray(r)||0===r.length)return{totalNodes:0,leafNodes:0,internalNodes:0,maxDepth:0,minDepth:0,avgDepth:0,levels:0,byLevel:{},maxWidth:0,avgWidth:0,widthByLevel:{},avgBranchingFactor:0,maxBranchingFactor:0,minBranchingFactor:0,branchingFactorDistribution:{},depthDistribution:{},depthVariance:0,isBalanced:!1,balanceRatio:0,avgPathLength:0,maxPathLength:0,minPathLength:0,leafNodeRatio:0,leafNodesByLevel:{}}
+const a={},h={},d={},y={},A={}
+let g=0,T=0,p=0,m=0,v=1/0,b=0,D=0,x=0,N=0,S=0,B=0,L=0,j=1/0,w=0,O=0,P=1/0
+const M=[]
+!function r(n,e,E){const F=n.length
+i&&(a[e]=(a[e]||0)+F,h[e]=(h[e]||0)+F,F>D&&(D=F),x+=F,N++)
+for(const i of n){g++
+const n=e+1
+if(o&&(b+=n,n>m&&(m=n),n<v&&(v=n)),s&&M.push(n),u&&(d[n]=(d[n]||0)+1),l){const r=E+1
+w+=r,r>O&&(O=r),r<P&&(P=r)}const a=i[t.children],h=Array.isArray(a)?a.length:0
+h>0?(o&&p++,c&&(S+=h,B++,A[h]=(A[h]||0)+1,h>L&&(L=h),h<j&&(j=h)),r(a,n,l?E+1:E)):(o&&T++,f&&(y[n]=(y[n]||0)+1))}}(r,0,0)
+const E=o&&g>0?b/g:0,F=i&&N>0?x/N:0,R=c&&B>0?S/B:0,W=l&&g>0?w/g:0,k=f&&g>0?T/g:0
+let C=0,I=!1,V=0
+if(s){if(M.length>0){const r=E
+C=M.reduce((n,e)=>n+Math.pow(e-r,2),0)/M.length}I=C<2&&m-v<=2,V=m>0?v/m:0}return{totalNodes:o?g:0,leafNodes:o?T:0,internalNodes:o?p:0,maxDepth:o?m:0,minDepth:o?v===1/0?0:v:0,avgDepth:E,levels:o?m:0,byLevel:i?a:{},maxWidth:i?D:0,avgWidth:F,widthByLevel:i?h:{},avgBranchingFactor:R,maxBranchingFactor:c?0===L?0:L:0,minBranchingFactor:c?j===1/0?0:j:0,branchingFactorDistribution:c?A:{},depthDistribution:u?d:{},depthVariance:C,isBalanced:I,balanceRatio:V,avgPathLength:W,maxPathLength:l?O:0,minPathLength:l?P===1/0?0:P:0,leafNodeRatio:k,leafNodesByLevel:f?y:{}}}const nr={mapTree:e,filterTree:t,findTree:o,pushTree:i,unshiftTree:c,popTree:u,shiftTree:s,someTree:l,everyTree:f,atTree:a,indexOfTree:h,atIndexOfTree:d,getNodeDepthMap:y,getNodeDepth:A,dedupTree:g,removeTree:T,forEachTree:p,isEmptyTreeData:m,isEmptySingleTreeData:v,getParentTree:x,getChildrenTree:b,getSiblingsTree:D,includesTree:N,isSingleTreeData:S,isTreeData:B,isValidTreeNode:L,isTreeNodeWithCircularCheck:j,isSafeTreeDepth:w,isLeafNode:O,isRootNode:P,convertToArrayTree:M,convertBackTree:E,convertToMapTree:F,convertToLevelArrayTree:R,convertToObjectTree:W,cloneTree:k,shallowCloneTree:C,cloneSubtree:I,cloneWithTransform:V,concatTree:z,sortTree:_,reduceTree:q,sliceTree:G,aggregateTree:H,groupTree:J,groupByTree:K,sumTree:Q,avgTree:U,maxTree:X,minTree:Y,countTree:Z,getTreeStats:$,analyzeTree:rr}
+r.aggregateTree=H,r.analyzeTree=rr,r.atIndexOfTree=d,r.atTree=a,r.avgTree=U,r.cloneSubtree=I,r.cloneTree=k,r.cloneWithTransform=V,r.concatTree=z,r.convertBackTree=E,r.convertToArrayTree=M,r.convertToLevelArrayTree=R,r.convertToMapTree=F,r.convertToObjectTree=W,r.countTree=Z,r.dedupTree=g,r.default=nr,r.everyTree=f,r.filterTree=t,r.findTree=o,r.forEachTree=p,r.getChildrenTree=b,r.getNodeDepth=A,r.getNodeDepthMap=y,r.getParentTree=x,r.getSiblingsTree=D,r.getTreeStats=$,r.groupByTree=K,r.groupTree=J,r.includesTree=N,r.indexOfTree=h,r.isEmptySingleTreeData=v,r.isEmptyTreeData=m,r.isLeafNode=O,r.isRootNode=P,r.isSafeTreeDepth=w,r.isSingleTreeData=S,r.isTreeData=B,r.isTreeNodeWithCircularCheck=j,r.isValidTreeNode=L,r.mapTree=e,r.maxTree=X,r.minTree=Y,r.popTree=u,r.pushTree=i,r.reduceTree=q,r.removeTree=T,r.shallowCloneTree=C,r.shiftTree=s,r.sliceTree=G,r.someTree=l,r.sortTree=_,r.sumTree=Q,r.unshiftTree=c,Object.defineProperties(r,{__esModule:{value:!0},[Symbol.toStringTag]:{value:"Module"}})})

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "tree-processor",
-  "version": "0.9.7",
-  "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",
+  "version": "0.11.0",
+  "description": "Lightweight tree-structured data processing library with 50+ APIs (traversal, search, modification, conversion, query, analysis, validation). Supports ESM/CJS/UMD, tree-shaking, zero dependencies",
   "main": "dist/tree-processor.cjs.js",
   "module": "dist/tree-processor.esm.js",
   "types": "dist/index.d.ts",
@@ -24,6 +24,8 @@
     "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:performance": "vitest run src/index.performance.test.ts",
+    "test:performance:all": "vitest run src/index.all-performance.test.ts",
     "test:coverage": "vitest --coverage",
     "update:badge": "node scripts/update-coverage-badge.js",
     "update:downloads": "node scripts/update-downloads-badge.js",