@d-matrix/utils 1.23.0 → 1.25.0

package/dist/algorithm/tree.d.ts

@@ -14,3 +14,20 @@ export declare const nodeCountAtDepth: <T extends Record<string, any>>(root: T,
  * @returns 找到的节点
  */
 export declare const findNode: <T extends Record<string, any>>(tree: T[], predicate: (node: T) => boolean, childrenKey?: string) => T | null;
+/**
+ * 根据子节点查找父节点
+ * @param tree
+ * @param child 子节点
+ * @param indentityKey 节点唯一id字段名称
+ * @param childrenKey 节点的子节点的字段名称
+ * @returns 父节点
+ */
+export declare const findParent: <T extends Record<string, any>>(tree: T | undefined, child: T | undefined, indentityKey?: string, childrenKey?: string) => T | null;
+/**
+ * 查找节点路径
+ * @param tree
+ * @param func 符合条件的节点函数,返回 boolean
+ * @param childrenKey 子节点key
+ * @returns 节点路径
+ */
+export declare function findPath<T extends Record<string, any>>(tree: T[], func: (node: T) => boolean, childrenKey?: string): T[] | null;

package/dist/algorithm/tree.js

@@ -41,3 +41,57 @@ export const findNode = (tree, predicate, childrenKey = 'children') => {
     }
     return null;
 };
+/**
+ * 根据子节点查找父节点
+ * @param tree
+ * @param child 子节点
+ * @param indentityKey 节点唯一id字段名称
+ * @param childrenKey 节点的子节点的字段名称
+ * @returns 父节点
+ */
+export const findParent = (tree, child, indentityKey = 'id', childrenKey = 'children') => {
+    if (tree === undefined || child === undefined) {
+        return null;
+    }
+    const children = tree[childrenKey];
+    if (Array.isArray(children)) {
+        const count = children.length;
+        for (let i = 0; i < count; i++) {
+            if (children[i][indentityKey] === child[indentityKey]) {
+                return tree;
+            }
+            const parent = findParent(children[i], child, indentityKey, childrenKey);
+            if (parent !== null) {
+                return parent;
+            }
+        }
+    }
+    return null;
+};
+/**
+ * 查找节点路径
+ * @param tree
+ * @param func 符合条件的节点函数,返回 boolean
+ * @param childrenKey 子节点key
+ * @returns 节点路径
+ */
+export function findPath(tree, func, childrenKey = 'children') {
+    const path = [];
+    const list = [...tree];
+    const visitedSet = new Set();
+    while (list.length) {
+        const node = list[0];
+        if (visitedSet.has(node)) {
+            path.pop();
+            list.shift();
+        }
+        else {
+            visitedSet.add(node);
+            Array.isArray(node[childrenKey]) && list.unshift(...node[childrenKey]);
+            path.push(node);
+            if (func(node))
+                return path;
+        }
+    }
+    return null;
+}

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@d-matrix/utils",
   "sideEffects": false,
-  "version": "1.23.0",
+  "version": "1.25.0",
   "description": "A dozen of utils for Front-End Development",
   "main": "dist/index.js",
   "scripts": {

package/readme.md

@@ -390,6 +390,40 @@ const actual2 = tree.findNode([root], (node) => node.id === 33);
 expect(actual2).to.be.deep.equal(root.children[1].children[2]);
 ```
 
+- `tree.findNode(tree, child, indentityKey, childrenKey)`
+
+根据子节点查找父节点
+
+```ts
+const treeData = {
+  code: 1,
+  subs: [
+    { code: 2, subs: [{ code: 21 }, { code: 22 }, { code: 23 }] },
+    { code: 3, subs: [{ code: 31 }, { code: 32 }, { code: 33 }] },
+  ],
+};
+
+const actual = tree.findParent(treeData, treeData.subs[1].subs[2], 'code', 'subs');
+expect(actual).to.be.deep.equal(treeData.subs[1]);
+```
+
+- `function findPath<T extends Record<string, any>>(tree: T[], func: (node: T) => boolean, childrenKey = 'children'): T[] | null`
+
+查找节点路径, 返回节点数组或`null`
+
+```ts
+const treeData = {
+  code: 1,
+  subs: [
+    { code: 2, subs: [{ code: 21 }, { code: 22 }, { code: 23 }] },
+    { code: 3, subs: [{ code: 31 }, { code: 32 }, { code: 33 }] },
+  ],
+};
+
+const actual = tree.findPath([root], (node) => node.id === 33);
+expect(actual).to.be.deep.equal([root, root.children[1], root.children[1].children[2]]);
+```
+
 ### file
 
 - `toImage(file: BlobPart | FileURL, options?: BlobPropertyBag): Promise<HTMLImageElement>`