onchain-utility 0.0.7 → 0.0.8

package/dist/OnchainUtility.js

@@ -1607,6 +1607,27 @@ function insert({
   }
 }
 
+/** 树结构搜索 */
+function treeSearch({
+  data,
+  searchValue,
+  childrenKey = 'children'
+}) {
+  return data.map(row => {
+    const children = treeSearch({
+      childrenKey,
+      data: row[childrenKey] || [],
+      searchValue
+    });
+    if (searchValue(row) || children.length) {
+      return {
+        ...row,
+        [childrenKey]: children
+      };
+    }
+  }).filter(row => !!row);
+}
+
 exports._isMoment = _isMoment;
 exports.arrayAttributeFlat = arrayAttributeFlat;
 exports.asyncDfs = asyncDfs;
@@ -1640,6 +1661,7 @@ exports.t = t;
 exports.toRawType = toRawType;
 exports.toTypeString = toTypeString;
 exports.translateI18n = translateI18n;
+exports.treeSearch = treeSearch;
 exports.upgrade = upgrade;
 exports.useReactive = useReactive;
 exports.useShallowReactive = useShallowReactive;

package/dist/OnchainUtility.mjs

@@ -1605,4 +1605,25 @@ function insert({
   }
 }
 
-export { _isMoment, arrayAttributeFlat, asyncDfs, base64ToFile, base64ToMimeType, baseTemplate, bfs, createEnumObject, deleteTreeNodes, dfs, downgrade, generateSecureUUID, generatedAcrossHierarchySort, getBase64Regular, getHTMLTagString, getI18nText, getSiblings, getTreeRelation, hasOwnProperty, initTranslateI18nFn, insert, isEmptyObject, isIntegerKey, levelTransformTree, makeDestructurable, mergeAdjacent, movUp, move, moveDown, t, toRawType, toTypeString, translateI18n, upgrade, useReactive, useShallowReactive, useStore };
+/** 树结构搜索 */
+function treeSearch({
+  data,
+  searchValue,
+  childrenKey = 'children'
+}) {
+  return data.map(row => {
+    const children = treeSearch({
+      childrenKey,
+      data: row[childrenKey] || [],
+      searchValue
+    });
+    if (searchValue(row) || children.length) {
+      return {
+        ...row,
+        [childrenKey]: children
+      };
+    }
+  }).filter(row => !!row);
+}
+
+export { _isMoment, arrayAttributeFlat, asyncDfs, base64ToFile, base64ToMimeType, baseTemplate, bfs, createEnumObject, deleteTreeNodes, dfs, downgrade, generateSecureUUID, generatedAcrossHierarchySort, getBase64Regular, getHTMLTagString, getI18nText, getSiblings, getTreeRelation, hasOwnProperty, initTranslateI18nFn, insert, isEmptyObject, isIntegerKey, levelTransformTree, makeDestructurable, mergeAdjacent, movUp, move, moveDown, t, toRawType, toTypeString, translateI18n, treeSearch, upgrade, useReactive, useShallowReactive, useStore };

package/dist/Tree.js

@@ -600,6 +600,27 @@ function insert({
   }
 }
 
+/** 树结构搜索 */
+function treeSearch({
+  data,
+  searchValue,
+  childrenKey = 'children'
+}) {
+  return data.map(row => {
+    const children = treeSearch({
+      childrenKey,
+      data: row[childrenKey] || [],
+      searchValue
+    });
+    if (searchValue(row) || children.length) {
+      return {
+        ...row,
+        [childrenKey]: children
+      };
+    }
+  }).filter(row => !!row);
+}
+
 exports.arrayAttributeFlat = arrayAttributeFlat;
 exports.deleteTreeNodes = deleteTreeNodes;
 exports.downgrade = downgrade;
@@ -612,4 +633,5 @@ exports.mergeAdjacent = mergeAdjacent;
 exports.movUp = movUp;
 exports.move = move;
 exports.moveDown = moveDown;
+exports.treeSearch = treeSearch;
 exports.upgrade = upgrade;

package/dist/Tree.mjs

@@ -598,4 +598,25 @@ function insert({
   }
 }
 
-export { arrayAttributeFlat, deleteTreeNodes, downgrade, generatedAcrossHierarchySort, getSiblings, getTreeRelation, insert, levelTransformTree, mergeAdjacent, movUp, move, moveDown, upgrade };
+/** 树结构搜索 */
+function treeSearch({
+  data,
+  searchValue,
+  childrenKey = 'children'
+}) {
+  return data.map(row => {
+    const children = treeSearch({
+      childrenKey,
+      data: row[childrenKey] || [],
+      searchValue
+    });
+    if (searchValue(row) || children.length) {
+      return {
+        ...row,
+        [childrenKey]: children
+      };
+    }
+  }).filter(row => !!row);
+}
+
+export { arrayAttributeFlat, deleteTreeNodes, downgrade, generatedAcrossHierarchySort, getSiblings, getTreeRelation, insert, levelTransformTree, mergeAdjacent, movUp, move, moveDown, treeSearch, upgrade };

package/package.json

@@ -2,7 +2,7 @@
   "name": "onchain-utility",
   "description": "This package contains misc utilities for onchain.",
   "license": "MIT",
-  "version": "0.0.7",
+  "version": "0.0.8",
   "files": [
     "dist",
     "src"

package/src/Tree/index.ts

@@ -670,3 +670,26 @@ export function insert<T extends Item>({
     }
   }
 }
+
+/** 树结构搜索 */
+export function treeSearch<T extends Record<string, any>>({
+  data,
+  searchValue,
+  childrenKey = 'children',
+}: {
+  data: T[];
+  searchValue: (item: T) => boolean;
+  childrenKey?: string;
+}) {
+  return data
+    .map((row) => {
+      const children: T[] = treeSearch({ childrenKey, data: row[childrenKey] || [], searchValue });
+      if (searchValue(row) || children.length) {
+        return {
+          ...row,
+          [childrenKey]: children,
+        };
+      }
+    })
+    .filter((row): row is T => !!row);
+}