vmo-tree 0.0.0-beta.3 → 0.0.1

package/README.md

@@ -79,19 +79,19 @@ console.log(mappedTree)
 
 ## 静态方法
 
-- `VmoTree.array2Tree(array, nodeKey, parentKey, childrenKey)`: 把平展的数组变为树结构。
+- `VmoTree.array2Tree(array, nodeKey, parentKey, childrenKey,keepOrphansAsRoot)`: 把平展的数组变为树结构。
 
   - `array`: 需要转化的数组。
   - `nodeKey`: 节点主键
   - `parentKey`: 父节点主键
   - `childrenKey`: 子节点主键
+  - `keepOrphansAsRoot`: 孤儿节点是否保留为根节点 defalut:false
 
 - `VmoTree.flatten2Array(tree, nodeKey, parentKey, childrenKey)`: 将树形结构展平特定数组。
   - `tree`: 需要转化的目标树。
   - `nodeKey`: 节点主键
   - `parentKey`: 父节点主键
   - `childrenKey`: 子节点主键
-  -
 - `VmoTree.path(predicate, targetTree, childrenKey, pickFirst)`: 获取给定节点到根节点的路径。
   - `predicate`: 目标节点指针或比对函数。
   - `targetTree`: 查找树
@@ -108,7 +108,7 @@ console.log(mappedTree)
   - `childrenKey`: 子节点键名
   - `prioritizeChildren`: 默认 true 子节点优先会先处理子节点情况，然后再将处理结果合并到父节点访问器中一并判断，false，则会优先处理父节点判定，再进行子节点
 - `VmoTree.find(targetNode, targetTree, childrenKey, pickFirst)`: 查找树节点。
-  - `visit`: 目标节点指针或比对函数
+  - `visit`: 条件函数，或者也可以给出目标节点的部分属性，方法会自动完成比对，属性给出越多越精准
   - `targetTree`: 子节点键名
   - `childrenKey`: 子节点键名
   - `pickFirst`:仅匹配首个结果
@@ -123,7 +123,7 @@ const vmoTreeInstance = new VmoTree(flatArray, { nodeKey: 'id', parentKey: 'pare
 
 ### `find(target, option?)`
 
-- `target`: 查找的条件，可以是节点对象或一个条件函数。
+- `target`: 条件函数，或节点比对数据，同静态方法。
 - `option`: 可选对象，支持以下属性：
   - `childrenKey`：指定子节点的键名(本次操作)。
   - `pickFirst`：布尔值，是否只寻找第一个匹配的节点(本次操作)。
@@ -132,6 +132,8 @@ const vmoTreeInstance = new VmoTree(flatArray, { nodeKey: 'id', parentKey: 'pare
 
 - `visit`: 映射函数，接收并返回一个节点对象。
 - `option`: 可选对象，支持以下属性：
+  - `nodeKey`: 节点主键
+  - `parentKey`: 父节点主键
   - `childrenKey`：指定子节点的键名 (本次操作)。
   - `prioritizeChildren`：子节点是否优先,如子节点优先，则父节点映射处理时，其子节点已先行被映射处理完毕 默认 true。
 
@@ -144,16 +146,17 @@ const vmoTreeInstance = new VmoTree(flatArray, { nodeKey: 'id', parentKey: 'pare
 
 ### `path(targetNode, option?)`
 
-- `targetNode`: 表示要查找路径的节点对象或查找条件。
+- `targetNode`: 条件函数，或节点比对数据。
 - `option`: 可选对象，包含以下属性：
   - `childrenKey`：指定子节点的键名。
+  - `pickFirst`：布尔值，是否只寻找第一个匹配的节点的路径(本次操作)。
 
 ### `flatten(option?)`
 
 - `option`: 可选对象，用于指定树展平到数组时的相关配置。
-  - `nodeKey`: 节点主键
-  - `parentKey`: 父节点主键
-  - `childrenKey`: 子节点主键
+  - `nodeKey`: 节点主键(本次操作)
+  - `parentKey`: 父节点主键(本次操作)
+  - `childrenKey`: 子节点主键(本次操作)
 
 ## 配置树
 
@@ -172,7 +175,7 @@ console.log(config)
 
 ## 注意事项
 
-- 处理非常深的树可能会导致性能问题。
+- 因为支持 `prioritizeChildren` 子节点优先，`map`, `filter` 处理非常深的树可能会导致性能问题 。
 - 确保输入的数据结构符合期望的格式，以避免不可预见的错误。
 
 通过上面的指南，你可以灵活地操作复杂的树形数据。希望此文档能帮助你快速上手 `VmoTree` 库！

package/dist/index.d.ts

@@ -1,3 +1,4 @@
 import { VmoTree } from './use.lib/vmo-tree';
 import type { TreeNode, NodeData, TreeConfig } from './use.lib/vmo-tree';
-export { VmoTree, TreeNode, NodeData, TreeConfig };
+export { VmoTree };
+export type { TreeNode, NodeData, TreeConfig };

package/dist/test/gpt.staitc.test.d.ts

@@ -0,0 +1 @@
+export {};

package/dist/test/sample.test.d.ts

@@ -0,0 +1 @@
+export {};

package/dist/use.lib/vmo-tree.d.ts

@@ -21,32 +21,33 @@ export interface TreeConfig {
 }
 /**
  * 查找节点路径(深度优先)
- * @param target 目标节点
+ * @param target 目标节点, findNodePath 不支持多节点匹配路径，因此他的 target只能是一个对象，不再支持条件函数
  * @param node 当前子节点
  * @param childrenKey 子节点键名
  * @param path 路径递归的数组
  * @returns {NodeData[] | null}
  */
-export declare function findNodePath(target: NodeData, node: NodeData, childrenKey: string, path?: NodeData[]): NodeData[] | null;
+export declare function findNodePath<T extends NodeData>(target: T, node: T, childrenKey: string, path?: T[], treeRoot?: T | undefined): NodeData[] | null;
 export declare class VmoTree<T> extends Array {
     /**
-     * 将数组转化为 tree 数据
+     * 将数组转化为 tree 数据 迭代方法
      * @param array 需要转化的数组
      * @param nodeKey 节点主键
      * @param parentKey 父节点主键
      * @param childrenKey 子节点键名
+     * @param keepOrphansAsRoot 孤儿节点转为根节点
      * @returns
      */
-    static array2Tree<N extends NodeData, children extends string>(array: Record<string, any>[], nodeKey: string | undefined, parentKey: string | undefined, childrenKey: children): VmoTree<TreeNode<N, children>>;
+    static array2Tree<N extends NodeData, children extends string>(array: Record<string, any>[], nodeKey?: string, parentKey?: string, childrenKey?: children, keepOrphansAsRoot?: boolean): VmoTree<TreeNode<N, children>>;
     /**
-     * 将树数据转换为 array 数组数据
+     * 将树数据转换为 array 数组数据 迭代方法
      * @param targetTree 需要转化的目标树
-     * @param childrenKey 子节点键名
      * @param nodekey 节点主键
-     * @param parentId 父节点主键
+     * @param parentKey 父节点主键
+     * @param childrenKey 子节点键名
      * @returns {T[]} 返回数组
      */
-    static flatten2Array<T extends Record<string, any>>(targetTree: NodeData[], nodekey?: string, parentKey?: string, childrenKey?: string, array?: NodeData[], parent?: any): T[];
+    static flatten2Array<T extends Record<string, any>>(targetTree: NodeData[], nodekey?: string, parentKey?: string, childrenKey?: string): T[];
     /**
      * 根据目标节点，或者目标节点条件，返回其到根节点的路径
      * @param targetNode 目标节点指针或比对函数
@@ -57,7 +58,7 @@ export declare class VmoTree<T> extends Array {
      */
     static path<T extends Record<string, any>>(targetNode: T | {
         (node: T): boolean;
-    }, targetTree: T[], childrenKey: string, pickFirst?: boolean): T[] | T[][];
+    }, targetTree: T[] | T, childrenKey: string, pickFirst?: boolean): T[] | T[][];
     /**
      * 树组件过滤核心方法
      * @param predicate 过滤函数
@@ -75,7 +76,7 @@ export declare class VmoTree<T> extends Array {
      * @param prioritizeChildren @default true 子节点优先会先处理子节点情况，然后再将处理结果合并到父节点访问器中一并判断，false，则会优先处理父节点判定，再进行子节点处理
      * @returns {T[]}
      */
-    static map<T extends Record<string, any>>(visit: (node: T, index: number, ary: T[]) => T, targetTree: T[], childrenKey: string, prioritizeChildren?: boolean): VmoTree<T>;
+    static map<T extends Record<string, any>>(visit: (node: T, index: number, ary: T[]) => T, targetTree: T[] | VmoTree<T>, childrenKey: string, prioritizeChildren?: boolean): T[];
     /**
      * find node 的核心方法
      * @param targetNode 目标节点指针或比对函数
@@ -90,12 +91,12 @@ export declare class VmoTree<T> extends Array {
     /**
      * 静态方法构造 VmoTree 实例
      * @param arr 来源数组(可空)
-     * @param childrenKey 子节点键名
      * @param nodeKey 节点主键
      * @param parentKey 父节点主键
+     * @param childrenKey 子节点键名
      * @returns {VmoTree<T>}
      */
-    static treeFrom<T>(arr?: T[], childrenKey?: string, nodeKey?: string, parentKey?: string): VmoTree<T>;
+    static treeFrom<T>(arr?: T[], nodeKey?: string, parentKey?: string, childrenKey?: string): VmoTree<T>;
     /**
      * 构造函数
      * @param array 树结构化数据
@@ -111,13 +112,15 @@ export declare class VmoTree<T> extends Array {
      */
     find(target: {
         (value: T, index: number, ary: T[]): boolean;
-    }, option?: Partial<Pick<TreeConfig, 'childrenKey'> & {
+    }, option?: Partial<TreeConfig & {
         pickFirst: boolean;
     }>): T | T[] | null;
     /**
      * 实例映射方法
      * @param visit 访问函数
      * @param {
+     *  @param nodeKey 节点主键
+     *  @param parentKey 父节点主键
      *  @param childrenKey 子节点主键
      *  @param prioritizeChildren 子节点优先
      * }option 操作配置
@@ -125,7 +128,7 @@ export declare class VmoTree<T> extends Array {
      */
     map<T>(visit: (value: any, index: number, array: any[]) => T, option?: Partial<Pick<TreeConfig, 'childrenKey'> & {
         prioritizeChildren: boolean;
-    }>): T[];
+    }>): T[] & VmoTree<T>;
     /**
      * 实例过滤方法
      * @param predicate 过滤方法
@@ -134,10 +137,10 @@ export declare class VmoTree<T> extends Array {
      */
     filter<S extends T>(predicate: (value: T, index: number, array: T[]) => boolean, option?: Partial<Pick<TreeConfig, 'childrenKey'> & {
         prioritizeChildren: boolean;
-    }>): S[];
+    }>): S[] & VmoTree<T>;
     filter(predicate: (value: T, index: number, array: T[]) => boolean, option?: Partial<Pick<TreeConfig, 'childrenKey'> & {
         prioritizeChildren: boolean;
-    }>): T[];
+    }>): T[] & VmoTree<T>;
     /**
      * 获取指定或条件节点的路径，允许多结果集
      * @param targetNode 目标节点指针或比对函数
@@ -159,7 +162,7 @@ export declare class VmoTree<T> extends Array {
      * 设置树的配置
      * @param option 树结构配置
      */
-    setConfig(option: Partial<TreeConfig>): void;
+    setConfig(option?: Partial<TreeConfig>): void;
     /**
      * 获取树结构配置
      * @returns {TreeConfig}

package/dist/vmo-tree.js

@@ -1,60 +1,213 @@
-const O = {
+const P = {
   "@@functional/placeholder": !0
 };
-function l(e) {
-  return e === O;
+function A(t) {
+  return t === P;
 }
-function h(e) {
-  return function t(r) {
-    return arguments.length === 0 || l(r) ? t : e.apply(this, arguments);
+function y(t) {
+  return function r(e) {
+    return arguments.length === 0 || A(e) ? r : t.apply(this, arguments);
   };
 }
-function w(e) {
-  return function t(r, s) {
+function x(t) {
+  return function r(e, n) {
     switch (arguments.length) {
       case 0:
-        return t;
+        return r;
       case 1:
-        return l(r) ? t : h(function(u) {
-          return e(r, u);
+        return A(e) ? r : y(function(s) {
+          return t(e, s);
         });
       default:
-        return l(r) && l(s) ? t : l(r) ? h(function(u) {
-          return e(u, s);
-        }) : l(s) ? h(function(u) {
-          return e(r, u);
-        }) : e(r, s);
+        return A(e) && A(n) ? r : A(e) ? y(function(s) {
+          return t(s, n);
+        }) : A(n) ? y(function(s) {
+          return t(e, s);
+        }) : t(e, n);
     }
   };
 }
-var j = /* @__PURE__ */ h(function(t) {
-  return t === null ? "Null" : t === void 0 ? "Undefined" : Object.prototype.toString.call(t).slice(8, -1);
+function j(t) {
+  for (var r = [], e; !(e = t.next()).done; )
+    r.push(e.value);
+  return r;
+}
+function q(t, r, e) {
+  for (var n = 0, s = e.length; n < s; ) {
+    if (t(r, e[n]))
+      return !0;
+    n += 1;
+  }
+  return !1;
+}
+function U(t) {
+  var r = String(t).match(/^function (\w*)/);
+  return r == null ? "" : r[1];
+}
+function g(t, r) {
+  return Object.prototype.hasOwnProperty.call(r, t);
+}
+function C(t, r) {
+  return t === r ? t !== 0 || 1 / t === 1 / r : t !== t && r !== r;
+}
+const v = typeof Object.is == "function" ? Object.is : C;
+var E = Object.prototype.toString, F = /* @__PURE__ */ function() {
+  return E.call(arguments) === "[object Arguments]" ? function(r) {
+    return E.call(r) === "[object Arguments]";
+  } : function(r) {
+    return g("callee", r);
+  };
+}();
+const R = F;
+var $ = !/* @__PURE__ */ {
+  toString: null
+}.propertyIsEnumerable("toString"), I = ["constructor", "valueOf", "isPrototypeOf", "toString", "propertyIsEnumerable", "hasOwnProperty", "toLocaleString"], p = /* @__PURE__ */ function() {
+  return arguments.propertyIsEnumerable("length");
+}(), B = function(r, e) {
+  for (var n = 0; n < r.length; ) {
+    if (r[n] === e)
+      return !0;
+    n += 1;
+  }
+  return !1;
+}, M = /* @__PURE__ */ y(typeof Object.keys == "function" && !p ? function(r) {
+  return Object(r) !== r ? [] : Object.keys(r);
+} : function(r) {
+  if (Object(r) !== r)
+    return [];
+  var e, n, s = [], c = p && R(r);
+  for (e in r)
+    g(e, r) && (!c || e !== "length") && (s[s.length] = e);
+  if ($)
+    for (n = I.length - 1; n >= 0; )
+      e = I[n], g(e, r) && !B(s, e) && (s[s.length] = e), n -= 1;
+  return s;
+});
+const S = M;
+var z = /* @__PURE__ */ y(function(r) {
+  return r === null ? "Null" : r === void 0 ? "Undefined" : Object.prototype.toString.call(r).slice(8, -1);
 });
-const g = j;
-function _(e) {
-  return new RegExp(e.source, e.flags ? e.flags : (e.global ? "g" : "") + (e.ignoreCase ? "i" : "") + (e.multiline ? "m" : "") + (e.sticky ? "y" : "") + (e.unicode ? "u" : "") + (e.dotAll ? "s" : ""));
+const m = z;
+function k(t, r, e, n) {
+  var s = j(t), c = j(r);
+  function u(a, i) {
+    return d(a, i, e.slice(), n.slice());
+  }
+  return !q(function(a, i) {
+    return !q(u, i, a);
+  }, c, s);
 }
-function m(e, t, r) {
-  if (r || (r = new v()), d(e))
-    return e;
-  var s = function(n) {
-    var c = r.get(e);
-    if (c)
-      return c;
-    r.set(e, n);
-    for (var f in e)
-      Object.prototype.hasOwnProperty.call(e, f) && (n[f] = t ? m(e[f], !0, r) : e[f]);
-    return n;
+function d(t, r, e, n) {
+  if (v(t, r))
+    return !0;
+  var s = m(t);
+  if (s !== m(r))
+    return !1;
+  if (typeof t["fantasy-land/equals"] == "function" || typeof r["fantasy-land/equals"] == "function")
+    return typeof t["fantasy-land/equals"] == "function" && t["fantasy-land/equals"](r) && typeof r["fantasy-land/equals"] == "function" && r["fantasy-land/equals"](t);
+  if (typeof t.equals == "function" || typeof r.equals == "function")
+    return typeof t.equals == "function" && t.equals(r) && typeof r.equals == "function" && r.equals(t);
+  switch (s) {
+    case "Arguments":
+    case "Array":
+    case "Object":
+      if (typeof t.constructor == "function" && U(t.constructor) === "Promise")
+        return t === r;
+      break;
+    case "Boolean":
+    case "Number":
+    case "String":
+      if (!(typeof t == typeof r && v(t.valueOf(), r.valueOf())))
+        return !1;
+      break;
+    case "Date":
+      if (!v(t.valueOf(), r.valueOf()))
+        return !1;
+      break;
+    case "Error":
+      return t.name === r.name && t.message === r.message;
+    case "RegExp":
+      if (!(t.source === r.source && t.global === r.global && t.ignoreCase === r.ignoreCase && t.multiline === r.multiline && t.sticky === r.sticky && t.unicode === r.unicode))
+        return !1;
+      break;
+  }
+  for (var c = e.length - 1; c >= 0; ) {
+    if (e[c] === t)
+      return n[c] === r;
+    c -= 1;
+  }
+  switch (s) {
+    case "Map":
+      return t.size !== r.size ? !1 : k(t.entries(), r.entries(), e.concat([t]), n.concat([r]));
+    case "Set":
+      return t.size !== r.size ? !1 : k(t.values(), r.values(), e.concat([t]), n.concat([r]));
+    case "Arguments":
+    case "Array":
+    case "Object":
+    case "Boolean":
+    case "Number":
+    case "String":
+    case "Date":
+    case "Error":
+    case "RegExp":
+    case "Int8Array":
+    case "Uint8Array":
+    case "Uint8ClampedArray":
+    case "Int16Array":
+    case "Uint16Array":
+    case "Int32Array":
+    case "Uint32Array":
+    case "Float32Array":
+    case "Float64Array":
+    case "ArrayBuffer":
+      break;
+    default:
+      return !1;
+  }
+  var u = S(t);
+  if (u.length !== S(r).length)
+    return !1;
+  var a = e.concat([t]), i = n.concat([r]);
+  for (c = u.length - 1; c >= 0; ) {
+    var f = u[c];
+    if (!(g(f, r) && d(r[f], t[f], a, i)))
+      return !1;
+    c -= 1;
+  }
+  return !0;
+}
+var D = /* @__PURE__ */ x(function(r, e) {
+  return d(r, e, [], []);
+});
+const O = D;
+var K = /* @__PURE__ */ y(function(r) {
+  return r == null;
+});
+const L = K;
+function W(t) {
+  return new RegExp(t.source, t.flags ? t.flags : (t.global ? "g" : "") + (t.ignoreCase ? "i" : "") + (t.multiline ? "m" : "") + (t.sticky ? "y" : "") + (t.unicode ? "u" : "") + (t.dotAll ? "s" : ""));
+}
+function b(t, r, e) {
+  if (e || (e = new H()), G(t))
+    return t;
+  var n = function(c) {
+    var u = e.get(t);
+    if (u)
+      return u;
+    e.set(t, c);
+    for (var a in t)
+      Object.prototype.hasOwnProperty.call(t, a) && (c[a] = r ? b(t[a], !0, e) : t[a]);
+    return c;
   };
-  switch (g(e)) {
+  switch (m(t)) {
     case "Object":
-      return s(Object.create(Object.getPrototypeOf(e)));
+      return n(Object.create(Object.getPrototypeOf(t)));
     case "Array":
-      return s(Array(e.length));
+      return n(Array(t.length));
     case "Date":
-      return new Date(e.valueOf());
+      return new Date(t.valueOf());
     case "RegExp":
-      return _(e);
+      return W(t);
     case "Int8Array":
     case "Uint8Array":
     case "Uint8ClampedArray":
@@ -66,101 +219,105 @@ function m(e, t, r) {
     case "Float64Array":
     case "BigInt64Array":
     case "BigUint64Array":
-      return e.slice();
+      return t.slice();
     default:
-      return e;
+      return t;
   }
 }
-function d(e) {
-  var t = typeof e;
-  return e == null || t != "object" && t != "function";
+function G(t) {
+  var r = typeof t;
+  return t == null || r != "object" && r != "function";
 }
-var v = /* @__PURE__ */ function() {
-  function e() {
+var H = /* @__PURE__ */ function() {
+  function t() {
     this.map = {}, this.length = 0;
   }
-  return e.prototype.set = function(t, r) {
-    var s = this.hash(t), u = this.map[s];
-    u || (this.map[s] = u = []), u.push([t, r]), this.length += 1;
-  }, e.prototype.hash = function(t) {
-    var r = [];
-    for (var s in t)
-      r.push(Object.prototype.toString.call(t[s]));
-    return r.join();
-  }, e.prototype.get = function(t) {
+  return t.prototype.set = function(r, e) {
+    var n = this.hash(r), s = this.map[n];
+    s || (this.map[n] = s = []), s.push([r, e]), this.length += 1;
+  }, t.prototype.hash = function(r) {
+    var e = [];
+    for (var n in r)
+      e.push(Object.prototype.toString.call(r[n]));
+    return e.join();
+  }, t.prototype.get = function(r) {
     if (this.length <= 180) {
-      for (var r in this.map)
-        for (var c = this.map[r], s = 0; s < c.length; s += 1) {
-          var u = c[s];
-          if (u[0] === t)
-            return u[1];
+      for (var e in this.map)
+        for (var u = this.map[e], n = 0; n < u.length; n += 1) {
+          var s = u[n];
+          if (s[0] === r)
+            return s[1];
         }
       return;
     }
-    var n = this.hash(t), c = this.map[n];
-    if (c)
-      for (var s = 0; s < c.length; s += 1) {
-        var u = c[s];
-        if (u[0] === t)
-          return u[1];
+    var c = this.hash(r), u = this.map[c];
+    if (u)
+      for (var n = 0; n < u.length; n += 1) {
+        var s = u[n];
+        if (s[0] === r)
+          return s[1];
       }
-  }, e;
-}(), P = /* @__PURE__ */ h(function(t) {
-  return t != null && typeof t.clone == "function" ? t.clone() : m(t, !0);
+  }, t;
+}(), J = /* @__PURE__ */ y(function(r) {
+  return r != null && typeof r.clone == "function" ? r.clone() : b(r, !0);
 });
-const b = P;
-var I = /* @__PURE__ */ w(function(t, r) {
-  for (var s = {}, u = {}, n = 0, c = t.length; n < c; )
-    u[t[n]] = 1, n += 1;
-  for (var f in r)
-    u.hasOwnProperty(f) || (s[f] = r[f]);
-  return s;
+const o = J;
+var Q = /* @__PURE__ */ x(function(r, e) {
+  for (var n = {}, s = 0; s < r.length; )
+    r[s] in e && (n[r[s]] = e[r[s]]), s += 1;
+  return n;
 });
-const U = I;
-function A(e, t, r, s = []) {
-  if (s.push(t), t === e)
-    return s;
-  if (Array.isArray(t[r]))
-    for (let u of t[r]) {
-      const n = A(e, u, r, s);
-      if (n)
-        return n;
+const _ = Q;
+function w(t, r, e, n = [], s = void 0) {
+  if (n.push(r), O(t, _(Object.keys(t), r)) || s === r)
+    return n;
+  if (Array.isArray(r[e]))
+    for (let c of r[e]) {
+      const u = w(t, c, e, n, r);
+      if (u)
+        return u;
     }
-  return s.pop(), null;
+  return n.pop(), null;
 }
-class i extends Array {
+class l extends Array {
   // 静态方法 ------
   /**
-   * 将数组转化为 tree 数据
+   * 将数组转化为 tree 数据 迭代方法
    * @param array 需要转化的数组
    * @param nodeKey 节点主键
    * @param parentKey 父节点主键
    * @param childrenKey 子节点键名
+   * @param keepOrphansAsRoot 孤儿节点转为根节点
    * @returns
    */
-  static array2Tree(t, r = "id", s = "parentId", u) {
-    const n = {}, c = [];
-    for (const f of t)
-      n[f[r]] = { ...f, [u]: [] };
-    for (const f of t) {
-      const a = n[f[r]];
-      f[s] ? n[f[s]] && n[f[s]][u].push(a) : c.push(a);
-    }
-    return i.treeFrom(c, u, r, s);
+  static array2Tree(r, e = "id", n = "parentId", s = "children", c = !1) {
+    let u = [];
+    const a = {}, i = {};
+    return r.forEach((f) => {
+      i[f[e]] = { ...f, [s]: [] }, L(f[n]) ? u.push(i[f[e]]) : i[f[n]] ? i[f[n]][s].push(i[f[e]]) : a[f[n]] ? a[f[n]].push(i[f[e]]) : a[f[n]] = [i[f[e]]], a[f[e]] && (i[f[e]][s] = a[f[e]], delete a[f[e]]);
+    }), c && Object.keys(a).length > 0 && Object.keys(a).forEach((f) => {
+      u = u.concat(a[f]);
+    }), l.treeFrom(u, e, n, s);
   }
   /**
-   * 将树数据转换为 array 数组数据
+   * 将树数据转换为 array 数组数据 迭代方法
    * @param targetTree 需要转化的目标树
-   * @param childrenKey 子节点键名
    * @param nodekey 节点主键
-   * @param parentId 父节点主键
+   * @param parentKey 父节点主键
+   * @param childrenKey 子节点键名
    * @returns {T[]} 返回数组
    */
-  static flatten2Array(t, r = "id", s = "parentId", u = "children", n = [], c = void 0) {
-    return t.forEach((f) => {
-      const a = U([u], f);
-      c && (a[s] = c), n.push(a), Array.isArray(f[u]) && i.flatten2Array(f[u], r, s, u, n, f[r]);
-    }), n;
+  static flatten2Array(r, e = "id", n = "parentId", s = "children") {
+    const c = [], u = [];
+    for (r.forEach((a) => {
+      u.push({ node: a, parent: void 0 });
+    }); u.length > 0; ) {
+      const { node: a, parent: i } = u.pop(), f = { ...a };
+      delete f[s], i && (f[n] = i), c.push(f), Array.isArray(a[s]) && a[s].forEach((h) => {
+        u.unshift({ node: h, parent: a[e] });
+      });
+    }
+    return c;
   }
   /**
    * 根据目标节点，或者目标节点条件，返回其到根节点的路径
@@ -170,14 +327,14 @@ class i extends Array {
    * @param pickFirst @default true 仅匹配首个结果
    * @returns {T[] | T[][]}
    */
-  static path(t, r, s, u = !0) {
-    const n = Array.isArray(r) ? { [s]: r } : r, c = u ? [i.find(t, r, s, u)].filter((f) => f != null) : i.find(t, r, s, u);
-    return u ? c.map((f) => {
-      const a = A(f, n, s, []);
-      return a == null || a.shift(), a;
-    })[0] : c.map((f) => {
-      const a = A(f, n, s, []);
-      return a == null || a.shift(), a;
+  static path(r, e, n, s = !0) {
+    const c = Array.isArray(e), u = c ? { [n]: e } : e, a = c ? e : [e], i = s ? [l.find(r, a, n, s)].filter((f) => f != null) : l.find(r, a, n, s);
+    return s ? i.map((f) => {
+      const h = w(f, u, n, []);
+      return c && (h == null || h.shift()), h;
+    })[0] ?? [] : i.map((f) => {
+      const h = w(f, u, n, []);
+      return c && (h == null || h.shift()), h;
     });
   }
   /**
@@ -188,23 +345,23 @@ class i extends Array {
    * @param prioritizeChildren @default true 子节点优先会先处理子节点情况，然后再将处理结果合并到父节点访问器中一并判断，false，则会优先处理父节点判定，再进行子节点处理
    * @returns {T[]}
    */
-  static filter(t, r, s, u = !0) {
-    return b(r).filter((n, c, f) => {
-      if (u)
-        return Array.isArray(n[s]) && (n[s] = i.filter(
-          t,
-          n[s],
-          s,
-          u
-        )), t(n, c, f);
+  static filter(r, e, n, s = !0) {
+    return o(e).filter((u, a, i) => {
+      if (s)
+        return Array.isArray(u[n]) && (u[n] = l.filter(
+          r,
+          u[n],
+          n,
+          s
+        )), r(u, a, i);
       {
-        const a = t(n, c, f);
-        return Array.isArray(n[s]) && (n[s] = i.filter(
-          t,
-          n[s],
-          s,
-          u
-        )), a;
+        const f = r(u, a, i);
+        return Array.isArray(u[n]) && (u[n] = l.filter(
+          r,
+          u[n],
+          n,
+          s
+        )), f;
       }
     });
   }
@@ -216,16 +373,15 @@ class i extends Array {
    * @param prioritizeChildren @default true 子节点优先会先处理子节点情况，然后再将处理结果合并到父节点访问器中一并判断，false，则会优先处理父节点判定，再进行子节点处理
    * @returns {T[]}
    */
-  static map(t, r, s, u = !0) {
-    const n = [].map.bind(b(r))((c, f, a) => {
-      if (u)
-        return Array.isArray(c[s]) && (c[s] = i.map(t, c[s], s)), t(c, f, a);
+  static map(r, e, n, s = !0) {
+    return [].map.bind(o(e))((u, a, i) => {
+      if (s)
+        return Array.isArray(u[n]) && (u[n] = l.map(r, u[n], n)), r(u, a, i);
       {
-        const y = t(c, f, a);
-        return Array.isArray(y[s]) && (y[s] = i.map(t, y[s], s)), y;
+        const f = r(u, a, i);
+        return Array.isArray(f[n]) && (f[n] = l.map(r, f[n], n)), f;
       }
     });
-    return i.treeFrom(n, s);
   }
   /**
    * find node 的核心方法
@@ -235,39 +391,39 @@ class i extends Array {
    * @param pickFirst @default true 仅匹配首个结果
    * @returns {T|T[]|null} 返回查找结果集
    */
-  static find(t, r, s, u = !0) {
-    if (u) {
-      for (let n in r) {
-        if (typeof t == "function" ? t(r[n]) : r[n] == t)
-          return r[n];
-        const c = Array.isArray(r[n][s]) ? i.find(t, r[n][s], s) : null;
-        if (c)
-          return c;
+  static find(r, e, n, s = !0) {
+    if (s) {
+      for (let c in e) {
+        if (typeof r == "function" ? r(e[c]) : O(r, _(Object.keys(r), e[c])))
+          return e[c];
+        const u = e[c][n], a = Array.isArray(u) ? l.find(r, u, n) : null;
+        if (a)
+          return a;
       }
       return null;
     } else {
-      let n = [];
-      for (let c in r) {
-        (typeof t == "function" ? t(r[c]) : r[c] == t) && n.push(r[c]);
-        const f = Array.isArray(r[c][s]) ? i.find(t, r[c][s], s, u) : [];
-        f && (n = n.concat(f));
+      let c = [];
+      for (let u in e) {
+        (typeof r == "function" ? r(e[u]) : O(r, _(Object.keys(r), e[u]))) && c.push(e[u]);
+        const a = e[u][n], i = Array.isArray(a) ? l.find(r, a, n, s) : [];
+        i && (c = c.concat(i));
       }
-      return n;
+      return c;
     }
   }
   /**
    * 静态方法构造 VmoTree 实例
    * @param arr 来源数组(可空)
-   * @param childrenKey 子节点键名
    * @param nodeKey 节点主键
    * @param parentKey 父节点主键
+   * @param childrenKey 子节点键名
    * @returns {VmoTree<T>}
    */
-  static treeFrom(t, r, s, u) {
-    return new i(t, {
-      childrenKey: r,
-      nodeKey: s,
-      parentKey: u
+  static treeFrom(r, e, n, s) {
+    return new l(r, {
+      nodeKey: e,
+      parentKey: n,
+      childrenKey: s
     });
   }
   // 动态部分
@@ -277,22 +433,22 @@ class i extends Array {
    * @param option 树结构指定键名
    * @returns {VmoTree<T>}
    */
-  constructor(t, r) {
-    if (!t || Array.isArray(t)) {
-      t ? super(...t) : super(), Object.defineProperty(this, "_childrenKey", {
-        value: (r == null ? void 0 : r.childrenKey) ?? "children",
+  constructor(r, e) {
+    if (!r || Array.isArray(r)) {
+      r ? super(...r) : super(), Object.defineProperty(this, "_nodeKey", {
+        value: (e == null ? void 0 : e.nodeKey) ?? "id",
         writable: !0,
         enumerable: !1,
         // 设置为不可枚举
         configurable: !0
-      }), Object.defineProperty(this, "_nodeKey", {
-        value: (r == null ? void 0 : r.nodeKey) ?? "id",
+      }), Object.defineProperty(this, "_parentKey", {
+        value: (e == null ? void 0 : e.parentKey) ?? "parentId",
         writable: !0,
         enumerable: !1,
         // 设置为不可枚举
         configurable: !0
-      }), Object.defineProperty(this, "_parentKey", {
-        value: (r == null ? void 0 : r.parentKey) ?? "parentId",
+      }), Object.defineProperty(this, "_childrenKey", {
+        value: (e == null ? void 0 : e.childrenKey) ?? "children",
         writable: !0,
         enumerable: !1,
         // 设置为不可枚举
@@ -310,32 +466,39 @@ class i extends Array {
    * @param option 查找配置 {childrenKey:string,pickFirst:boolean=true}
    * @returns {T| T[]| null}
    */
-  find(t, r) {
-    return i.find(t, this, (r == null ? void 0 : r.childrenKey) ?? this._childrenKey, r == null ? void 0 : r.pickFirst);
+  find(r, e) {
+    return l.find(r, this, (e == null ? void 0 : e.childrenKey) ?? this._childrenKey, e == null ? void 0 : e.pickFirst);
   }
   /**
    * 实例映射方法
    * @param visit 访问函数
    * @param {
+   *  @param nodeKey 节点主键
+   *  @param parentKey 父节点主键
    *  @param childrenKey 子节点主键
    *  @param prioritizeChildren 子节点优先
    * }option 操作配置
    * @returns {T[]}
    */
-  map(t, r) {
-    return i.map(
-      t,
-      this,
-      (r == null ? void 0 : r.childrenKey) ?? this._childrenKey,
-      r == null ? void 0 : r.prioritizeChildren
+  map(r, e) {
+    return l.treeFrom(
+      l.map(r, this, (e == null ? void 0 : e.childrenKey) ?? this._childrenKey, e == null ? void 0 : e.prioritizeChildren),
+      this._nodeKey,
+      this._parentKey,
+      (e == null ? void 0 : e.childrenKey) ?? this._childrenKey
     );
   }
-  filter(t, r) {
-    return i.filter(
-      t,
-      this,
-      (r == null ? void 0 : r.childrenKey) ?? this._childrenKey,
-      r == null ? void 0 : r.prioritizeChildren
+  filter(r, e) {
+    return l.treeFrom(
+      l.filter(
+        r,
+        this,
+        (e == null ? void 0 : e.childrenKey) ?? this._childrenKey,
+        e == null ? void 0 : e.prioritizeChildren
+      ),
+      this._nodeKey,
+      this._parentKey,
+      (e == null ? void 0 : e.childrenKey) ?? this._chidlrenKey
     );
   }
   /**
@@ -344,29 +507,29 @@ class i extends Array {
    * @param option 查找配置 {childrenKey:string,pickFirst:boolean=true}
    * @returns {S[]| S[][]}
    */
-  path(t, r) {
-    return i.path(t, this, (r == null ? void 0 : r.childrenKey) ?? this._childrenKey, r == null ? void 0 : r.pickFirst);
+  path(r, e) {
+    return l.path(r, this, (e == null ? void 0 : e.childrenKey) ?? this._childrenKey, e == null ? void 0 : e.pickFirst);
   }
   /**
    * 平展树数据结构为数组
    * @param option // 树结构
    * @returns {S[]}
    */
-  flatten(t) {
-    return i.flatten2Array(
+  flatten(r) {
+    return l.flatten2Array(
       this,
-      (t == null ? void 0 : t.nodeKey) ?? this._nodeKey,
-      (t == null ? void 0 : t.parentKey) ?? this._parentKey,
-      (t == null ? void 0 : t.childrenKey) ?? this._childrenKey
+      (r == null ? void 0 : r.nodeKey) ?? this._nodeKey,
+      (r == null ? void 0 : r.parentKey) ?? this._parentKey,
+      (r == null ? void 0 : r.childrenKey) ?? this._childrenKey
     );
   }
   /**
    * 设置树的配置
    * @param option 树结构配置
    */
-  setConfig(t) {
-    const r = this;
-    r._nodeKey = (t == null ? void 0 : t.nodeKey) ?? r._nodeKey ?? "id", r._parentKey = (t == null ? void 0 : t.parentKey) ?? r._parentKey ?? "parentId", r._childrenKey = (t == null ? void 0 : t.childrenKey) ?? r._childrenKey ?? "children";
+  setConfig(r) {
+    const e = this;
+    e._nodeKey = (r == null ? void 0 : r.nodeKey) ?? e._nodeKey ?? "id", e._parentKey = (r == null ? void 0 : r.parentKey) ?? e._parentKey ?? "parentId", e._childrenKey = (r == null ? void 0 : r.childrenKey) ?? e._childrenKey ?? "children";
   }
   /**
    * 获取树结构配置
@@ -381,5 +544,5 @@ class i extends Array {
   }
 }
 export {
-  i as VmoTree
+  l as VmoTree
 };

package/dist/vmo-tree.umd.cjs

@@ -1 +1 @@
-(function(l,y){typeof exports=="object"&&typeof module<"u"?y(exports):typeof define=="function"&&define.amd?define(["exports"],y):(l=typeof globalThis<"u"?globalThis:l||self,y(l["vmo-tree"]={}))})(this,function(l){"use strict";const y={"@@functional/placeholder":!0};function h(s){return s===y}function A(s){return function t(r){return arguments.length===0||h(r)?t:s.apply(this,arguments)}}function j(s){return function t(r,e){switch(arguments.length){case 0:return t;case 1:return h(r)?t:A(function(u){return s(r,u)});default:return h(r)&&h(e)?t:h(r)?A(function(u){return s(u,e)}):h(e)?A(function(u){return s(r,u)}):s(r,e)}}}var w=A(function(t){return t===null?"Null":t===void 0?"Undefined":Object.prototype.toString.call(t).slice(8,-1)});const g=w;function v(s){return new RegExp(s.source,s.flags?s.flags:(s.global?"g":"")+(s.ignoreCase?"i":"")+(s.multiline?"m":"")+(s.sticky?"y":"")+(s.unicode?"u":"")+(s.dotAll?"s":""))}function m(s,t,r){if(r||(r=new P),_(s))return s;var e=function(n){var f=r.get(s);if(f)return f;r.set(s,n);for(var c in s)Object.prototype.hasOwnProperty.call(s,c)&&(n[c]=t?m(s[c],!0,r):s[c]);return n};switch(g(s)){case"Object":return e(Object.create(Object.getPrototypeOf(s)));case"Array":return e(Array(s.length));case"Date":return new Date(s.valueOf());case"RegExp":return v(s);case"Int8Array":case"Uint8Array":case"Uint8ClampedArray":case"Int16Array":case"Uint16Array":case"Int32Array":case"Uint32Array":case"Float32Array":case"Float64Array":case"BigInt64Array":case"BigUint64Array":return s.slice();default:return s}}function _(s){var t=typeof s;return s==null||t!="object"&&t!="function"}var P=function(){function s(){this.map={},this.length=0}return s.prototype.set=function(t,r){var e=this.hash(t),u=this.map[e];u||(this.map[e]=u=[]),u.push([t,r]),this.length+=1},s.prototype.hash=function(t){var r=[];for(var e in t)r.push(Object.prototype.toString.call(t[e]));return r.join()},s.prototype.get=function(t){if(this.length<=180){for(var r in this.map)for(var f=this.map[r],e=0;e<f.length;e+=1){var u=f[e];if(u[0]===t)return u[1]}return}var n=this.hash(t),f=this.map[n];if(f)for(var e=0;e<f.length;e+=1){var u=f[e];if(u[0]===t)return u[1]}},s}(),I=A(function(t){return t!=null&&typeof t.clone=="function"?t.clone():m(t,!0)});const O=I;var x=j(function(t,r){for(var e={},u={},n=0,f=t.length;n<f;)u[t[n]]=1,n+=1;for(var c in r)u.hasOwnProperty(c)||(e[c]=r[c]);return e});const U=x;function d(s,t,r,e=[]){if(e.push(t),t===s)return e;if(Array.isArray(t[r]))for(let u of t[r]){const n=d(s,u,r,e);if(n)return n}return e.pop(),null}class i extends Array{static array2Tree(t,r="id",e="parentId",u){const n={},f=[];for(const c of t)n[c[r]]={...c,[u]:[]};for(const c of t){const a=n[c[r]];c[e]?n[c[e]]&&n[c[e]][u].push(a):f.push(a)}return i.treeFrom(f,u,r,e)}static flatten2Array(t,r="id",e="parentId",u="children",n=[],f=void 0){return t.forEach(c=>{const a=U([u],c);f&&(a[e]=f),n.push(a),Array.isArray(c[u])&&i.flatten2Array(c[u],r,e,u,n,c[r])}),n}static path(t,r,e,u=!0){const n=Array.isArray(r)?{[e]:r}:r,f=u?[i.find(t,r,e,u)].filter(c=>c!=null):i.find(t,r,e,u);return u?f.map(c=>{const a=d(c,n,e,[]);return a==null||a.shift(),a})[0]:f.map(c=>{const a=d(c,n,e,[]);return a==null||a.shift(),a})}static filter(t,r,e,u=!0){return O(r).filter((n,f,c)=>{if(u)return Array.isArray(n[e])&&(n[e]=i.filter(t,n[e],e,u)),t(n,f,c);{const a=t(n,f,c);return Array.isArray(n[e])&&(n[e]=i.filter(t,n[e],e,u)),a}})}static map(t,r,e,u=!0){const n=[].map.bind(O(r))((f,c,a)=>{if(u)return Array.isArray(f[e])&&(f[e]=i.map(t,f[e],e)),t(f,c,a);{const b=t(f,c,a);return Array.isArray(b[e])&&(b[e]=i.map(t,b[e],e)),b}});return i.treeFrom(n,e)}static find(t,r,e,u=!0){if(u){for(let n in r){if(typeof t=="function"?t(r[n]):r[n]==t)return r[n];const f=Array.isArray(r[n][e])?i.find(t,r[n][e],e):null;if(f)return f}return null}else{let n=[];for(let f in r){(typeof t=="function"?t(r[f]):r[f]==t)&&n.push(r[f]);const c=Array.isArray(r[f][e])?i.find(t,r[f][e],e,u):[];c&&(n=n.concat(c))}return n}}static treeFrom(t,r,e,u){return new i(t,{childrenKey:r,nodeKey:e,parentKey:u})}constructor(t,r){if(!t||Array.isArray(t)){t?super(...t):super(),Object.defineProperty(this,"_childrenKey",{value:(r==null?void 0:r.childrenKey)??"children",writable:!0,enumerable:!1,configurable:!0}),Object.defineProperty(this,"_nodeKey",{value:(r==null?void 0:r.nodeKey)??"id",writable:!0,enumerable:!1,configurable:!0}),Object.defineProperty(this,"_parentKey",{value:(r==null?void 0:r.parentKey)??"parentId",writable:!0,enumerable:!1,configurable:!0});return}else throw Error('The constructor of VmoTree requires parameters " new VmoTree(array?: T[], childrenKey?: string)", the current type is incorrect! ')}find(t,r){return i.find(t,this,(r==null?void 0:r.childrenKey)??this._childrenKey,r==null?void 0:r.pickFirst)}map(t,r){return i.map(t,this,(r==null?void 0:r.childrenKey)??this._childrenKey,r==null?void 0:r.prioritizeChildren)}filter(t,r){return i.filter(t,this,(r==null?void 0:r.childrenKey)??this._childrenKey,r==null?void 0:r.prioritizeChildren)}path(t,r){return i.path(t,this,(r==null?void 0:r.childrenKey)??this._childrenKey,r==null?void 0:r.pickFirst)}flatten(t){return i.flatten2Array(this,(t==null?void 0:t.nodeKey)??this._nodeKey,(t==null?void 0:t.parentKey)??this._parentKey,(t==null?void 0:t.childrenKey)??this._childrenKey)}setConfig(t){const r=this;r._nodeKey=(t==null?void 0:t.nodeKey)??r._nodeKey??"id",r._parentKey=(t==null?void 0:t.parentKey)??r._parentKey??"parentId",r._childrenKey=(t==null?void 0:t.childrenKey)??r._childrenKey??"children"}getConfig(){return{nodeKey:this._nodeKey,parentKey:this._parentKey,childrenKey:this._childrenKey}}}l.VmoTree=i,Object.defineProperty(l,Symbol.toStringTag,{value:"Module"})});
+(function(A,v){typeof exports=="object"&&typeof module<"u"?v(exports):typeof define=="function"&&define.amd?define(["exports"],v):(A=typeof globalThis<"u"?globalThis:A||self,v(A["vmo-tree"]={}))})(this,function(A){"use strict";const v={"@@functional/placeholder":!0};function g(t){return t===v}function y(t){return function r(e){return arguments.length===0||g(e)?r:t.apply(this,arguments)}}function p(t){return function r(e,n){switch(arguments.length){case 0:return r;case 1:return g(e)?r:y(function(s){return t(e,s)});default:return g(e)&&g(n)?r:g(e)?y(function(s){return t(s,n)}):g(n)?y(function(s){return t(e,s)}):t(e,n)}}}function q(t){for(var r=[],e;!(e=t.next()).done;)r.push(e.value);return r}function E(t,r,e){for(var n=0,s=e.length;n<s;){if(t(r,e[n]))return!0;n+=1}return!1}function C(t){var r=String(t).match(/^function (\w*)/);return r==null?"":r[1]}function m(t,r){return Object.prototype.hasOwnProperty.call(r,t)}function F(t,r){return t===r?t!==0||1/t===1/r:t!==t&&r!==r}const O=typeof Object.is=="function"?Object.is:F;var I=Object.prototype.toString,R=function(){return I.call(arguments)==="[object Arguments]"?function(r){return I.call(r)==="[object Arguments]"}:function(r){return m("callee",r)}}();const $=R;var M=!{toString:null}.propertyIsEnumerable("toString"),S=["constructor","valueOf","isPrototypeOf","toString","propertyIsEnumerable","hasOwnProperty","toLocaleString"],b=function(){return arguments.propertyIsEnumerable("length")}(),B=function(r,e){for(var n=0;n<r.length;){if(r[n]===e)return!0;n+=1}return!1},z=y(typeof Object.keys=="function"&&!b?function(r){return Object(r)!==r?[]:Object.keys(r)}:function(r){if(Object(r)!==r)return[];var e,n,s=[],c=b&&$(r);for(e in r)m(e,r)&&(!c||e!=="length")&&(s[s.length]=e);if(M)for(n=S.length-1;n>=0;)e=S[n],m(e,r)&&!B(s,e)&&(s[s.length]=e),n-=1;return s});const x=z;var D=y(function(r){return r===null?"Null":r===void 0?"Undefined":Object.prototype.toString.call(r).slice(8,-1)});const d=D;function k(t,r,e,n){var s=q(t),c=q(r);function u(a,f){return _(a,f,e.slice(),n.slice())}return!E(function(a,f){return!E(u,f,a)},c,s)}function _(t,r,e,n){if(O(t,r))return!0;var s=d(t);if(s!==d(r))return!1;if(typeof t["fantasy-land/equals"]=="function"||typeof r["fantasy-land/equals"]=="function")return typeof t["fantasy-land/equals"]=="function"&&t["fantasy-land/equals"](r)&&typeof r["fantasy-land/equals"]=="function"&&r["fantasy-land/equals"](t);if(typeof t.equals=="function"||typeof r.equals=="function")return typeof t.equals=="function"&&t.equals(r)&&typeof r.equals=="function"&&r.equals(t);switch(s){case"Arguments":case"Array":case"Object":if(typeof t.constructor=="function"&&C(t.constructor)==="Promise")return t===r;break;case"Boolean":case"Number":case"String":if(!(typeof t==typeof r&&O(t.valueOf(),r.valueOf())))return!1;break;case"Date":if(!O(t.valueOf(),r.valueOf()))return!1;break;case"Error":return t.name===r.name&&t.message===r.message;case"RegExp":if(!(t.source===r.source&&t.global===r.global&&t.ignoreCase===r.ignoreCase&&t.multiline===r.multiline&&t.sticky===r.sticky&&t.unicode===r.unicode))return!1;break}for(var c=e.length-1;c>=0;){if(e[c]===t)return n[c]===r;c-=1}switch(s){case"Map":return t.size!==r.size?!1:k(t.entries(),r.entries(),e.concat([t]),n.concat([r]));case"Set":return t.size!==r.size?!1:k(t.values(),r.values(),e.concat([t]),n.concat([r]));case"Arguments":case"Array":case"Object":case"Boolean":case"Number":case"String":case"Date":case"Error":case"RegExp":case"Int8Array":case"Uint8Array":case"Uint8ClampedArray":case"Int16Array":case"Uint16Array":case"Int32Array":case"Uint32Array":case"Float32Array":case"Float64Array":case"ArrayBuffer":break;default:return!1}var u=x(t);if(u.length!==x(r).length)return!1;var a=e.concat([t]),f=n.concat([r]);for(c=u.length-1;c>=0;){var i=u[c];if(!(m(i,r)&&_(r[i],t[i],a,f)))return!1;c-=1}return!0}var K=p(function(r,e){return _(r,e,[],[])});const o=K;var L=y(function(r){return r==null});const W=L;function G(t){return new RegExp(t.source,t.flags?t.flags:(t.global?"g":"")+(t.ignoreCase?"i":"")+(t.multiline?"m":"")+(t.sticky?"y":"")+(t.unicode?"u":"")+(t.dotAll?"s":""))}function P(t,r,e){if(e||(e=new J),H(t))return t;var n=function(c){var u=e.get(t);if(u)return u;e.set(t,c);for(var a in t)Object.prototype.hasOwnProperty.call(t,a)&&(c[a]=r?P(t[a],!0,e):t[a]);return c};switch(d(t)){case"Object":return n(Object.create(Object.getPrototypeOf(t)));case"Array":return n(Array(t.length));case"Date":return new Date(t.valueOf());case"RegExp":return G(t);case"Int8Array":case"Uint8Array":case"Uint8ClampedArray":case"Int16Array":case"Uint16Array":case"Int32Array":case"Uint32Array":case"Float32Array":case"Float64Array":case"BigInt64Array":case"BigUint64Array":return t.slice();default:return t}}function H(t){var r=typeof t;return t==null||r!="object"&&r!="function"}var J=function(){function t(){this.map={},this.length=0}return t.prototype.set=function(r,e){var n=this.hash(r),s=this.map[n];s||(this.map[n]=s=[]),s.push([r,e]),this.length+=1},t.prototype.hash=function(r){var e=[];for(var n in r)e.push(Object.prototype.toString.call(r[n]));return e.join()},t.prototype.get=function(r){if(this.length<=180){for(var e in this.map)for(var u=this.map[e],n=0;n<u.length;n+=1){var s=u[n];if(s[0]===r)return s[1]}return}var c=this.hash(r),u=this.map[c];if(u)for(var n=0;n<u.length;n+=1){var s=u[n];if(s[0]===r)return s[1]}},t}(),Q=y(function(r){return r!=null&&typeof r.clone=="function"?r.clone():P(r,!0)});const U=Q;var X=p(function(r,e){for(var n={},s=0;s<r.length;)r[s]in e&&(n[r[s]]=e[r[s]]),s+=1;return n});const j=X;function w(t,r,e,n=[],s=void 0){if(n.push(r),o(t,j(Object.keys(t),r))||s===r)return n;if(Array.isArray(r[e]))for(let c of r[e]){const u=w(t,c,e,n,r);if(u)return u}return n.pop(),null}class l extends Array{static array2Tree(r,e="id",n="parentId",s="children",c=!1){let u=[];const a={},f={};return r.forEach(i=>{f[i[e]]={...i,[s]:[]},W(i[n])?u.push(f[i[e]]):f[i[n]]?f[i[n]][s].push(f[i[e]]):a[i[n]]?a[i[n]].push(f[i[e]]):a[i[n]]=[f[i[e]]],a[i[e]]&&(f[i[e]][s]=a[i[e]],delete a[i[e]])}),c&&Object.keys(a).length>0&&Object.keys(a).forEach(i=>{u=u.concat(a[i])}),l.treeFrom(u,e,n,s)}static flatten2Array(r,e="id",n="parentId",s="children"){const c=[],u=[];for(r.forEach(a=>{u.push({node:a,parent:void 0})});u.length>0;){const{node:a,parent:f}=u.pop(),i={...a};delete i[s],f&&(i[n]=f),c.push(i),Array.isArray(a[s])&&a[s].forEach(h=>{u.unshift({node:h,parent:a[e]})})}return c}static path(r,e,n,s=!0){const c=Array.isArray(e),u=c?{[n]:e}:e,a=c?e:[e],f=s?[l.find(r,a,n,s)].filter(i=>i!=null):l.find(r,a,n,s);return s?f.map(i=>{const h=w(i,u,n,[]);return c&&(h==null||h.shift()),h})[0]??[]:f.map(i=>{const h=w(i,u,n,[]);return c&&(h==null||h.shift()),h})}static filter(r,e,n,s=!0){return U(e).filter((u,a,f)=>{if(s)return Array.isArray(u[n])&&(u[n]=l.filter(r,u[n],n,s)),r(u,a,f);{const i=r(u,a,f);return Array.isArray(u[n])&&(u[n]=l.filter(r,u[n],n,s)),i}})}static map(r,e,n,s=!0){return[].map.bind(U(e))((u,a,f)=>{if(s)return Array.isArray(u[n])&&(u[n]=l.map(r,u[n],n)),r(u,a,f);{const i=r(u,a,f);return Array.isArray(i[n])&&(i[n]=l.map(r,i[n],n)),i}})}static find(r,e,n,s=!0){if(s){for(let c in e){if(typeof r=="function"?r(e[c]):o(r,j(Object.keys(r),e[c])))return e[c];const u=e[c][n],a=Array.isArray(u)?l.find(r,u,n):null;if(a)return a}return null}else{let c=[];for(let u in e){(typeof r=="function"?r(e[u]):o(r,j(Object.keys(r),e[u])))&&c.push(e[u]);const a=e[u][n],f=Array.isArray(a)?l.find(r,a,n,s):[];f&&(c=c.concat(f))}return c}}static treeFrom(r,e,n,s){return new l(r,{nodeKey:e,parentKey:n,childrenKey:s})}constructor(r,e){if(!r||Array.isArray(r)){r?super(...r):super(),Object.defineProperty(this,"_nodeKey",{value:(e==null?void 0:e.nodeKey)??"id",writable:!0,enumerable:!1,configurable:!0}),Object.defineProperty(this,"_parentKey",{value:(e==null?void 0:e.parentKey)??"parentId",writable:!0,enumerable:!1,configurable:!0}),Object.defineProperty(this,"_childrenKey",{value:(e==null?void 0:e.childrenKey)??"children",writable:!0,enumerable:!1,configurable:!0});return}else throw Error('The constructor of VmoTree requires parameters " new VmoTree(array?: T[], childrenKey?: string)", the current type is incorrect! ')}find(r,e){return l.find(r,this,(e==null?void 0:e.childrenKey)??this._childrenKey,e==null?void 0:e.pickFirst)}map(r,e){return l.treeFrom(l.map(r,this,(e==null?void 0:e.childrenKey)??this._childrenKey,e==null?void 0:e.prioritizeChildren),this._nodeKey,this._parentKey,(e==null?void 0:e.childrenKey)??this._childrenKey)}filter(r,e){return l.treeFrom(l.filter(r,this,(e==null?void 0:e.childrenKey)??this._childrenKey,e==null?void 0:e.prioritizeChildren),this._nodeKey,this._parentKey,(e==null?void 0:e.childrenKey)??this._chidlrenKey)}path(r,e){return l.path(r,this,(e==null?void 0:e.childrenKey)??this._childrenKey,e==null?void 0:e.pickFirst)}flatten(r){return l.flatten2Array(this,(r==null?void 0:r.nodeKey)??this._nodeKey,(r==null?void 0:r.parentKey)??this._parentKey,(r==null?void 0:r.childrenKey)??this._childrenKey)}setConfig(r){const e=this;e._nodeKey=(r==null?void 0:r.nodeKey)??e._nodeKey??"id",e._parentKey=(r==null?void 0:r.parentKey)??e._parentKey??"parentId",e._childrenKey=(r==null?void 0:r.childrenKey)??e._childrenKey??"children"}getConfig(){return{nodeKey:this._nodeKey,parentKey:this._parentKey,childrenKey:this._childrenKey}}}A.VmoTree=l,Object.defineProperty(A,Symbol.toStringTag,{value:"Module"})});

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "vmo-tree",
-  "version": "0.0.0-beta.3",
+  "version": "0.0.1",
   "type": "module",
   "private": false,
   "description": "A lightweight JavaScript library for creating and maintaining tree structures, providing easy methods for manipulation, traversal, and search.",
@@ -19,24 +19,27 @@
     "dist"
   ],
   "scripts": {
+    "coverage": "vitest run --coverage",
+    "test": "vitest",
     "dev": "vite",
     "build": "vue-tsc && vite build",
     "preview": "vite preview"
   },
-  "peerDependencies": {
-    "ramda": "^0.30.0",
-    "vue": "^3.3.4"
-  },
   "devDependencies": {
     "@types/node": "^20.10.4",
     "@types/ramda": "^0.30.2",
     "@vitejs/plugin-vue": "^4.5.0",
+    "@vitest/coverage-istanbul": "^2.1.4",
+    "@vitest/coverage-v8": "^2.1.4",
     "autoprefixer": "^10.4.16",
+    "jsdom": "^25.0.1",
     "postcss": "^8.4.32",
+    "ramda": "^0.30.0",
     "tailwindcss": "^3.3.6",
     "typescript": "^5.2.2",
     "vite": "^5.0.0",
     "vite-plugin-dts": "^3.6.4",
+    "vitest": "^2.1.4",
     "vue-tsc": "^1.8.22"
   }
 }