@vope/utils 1.9.1 → 1.9.2

package/CHANGELOG.md

@@ -5,6 +5,12 @@ All notable changes to this project will be documented in this file.
 The format is based on [Keep a Changelog](https://keepachangelog.com/en/1.0.0/),
 and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.html).
 
+## [1.9.2] - 2026-09-15
+### Added
+- 添加 [forBfsAsyncEach](src/each.ts) 方法，[forBfsEach](src/each.ts) 异步版本
+- 添加 [forDfsAsyncEach](src/each.ts) 方法，[forDfsEach](src/each.ts) 异步版本
+- 添加 [forDfsStackAsyncEach](src/each.ts) 方法，[forDfsStackEach](src/each.ts) 异步版本
+
 ## [1.9.1] - 2026-05-11
 ### Fixed
 - 修复升级依赖 typescript 引起的 .d.ts 文件生成路径错误问题

package/README.md

@@ -12,6 +12,9 @@ pnpm add @vope/utils
 yarn add @vope/utils
 ```
 
+## Logs
+[CHANGELOG](./CHANGELOG.md)
+
 ## API 文档
 
 ### 异步控制

package/dist/each.d.ts

@@ -5,6 +5,13 @@
  * @param callback 节点回调，返回false则停止搜索
  */
 export declare const forBfsEach: <T>(list: T[] | Set<T>, up: (data: T) => T[] | Set<T> | void, callback: (data: T) => boolean) => void;
+/**
+ * 广度优先异步搜索
+ * @param list 节点源
+ * @param up 节点下钻，返回当前节点的子节点
+ * @param callback 节点回调，返回false/Promise<false>则停止搜索
+ */
+export declare const forBfsAsyncEach: <T>(list: T[] | Set<T>, up: (data: T) => T[] | Set<T> | void, callback: (data: T) => boolean | Promise<boolean>) => Promise<void>;
 /**
  * 深度优先搜索
  * @param list 节点源
@@ -12,6 +19,13 @@ export declare const forBfsEach: <T>(list: T[] | Set<T>, up: (data: T) => T[] |
  * @param callback 节点回调，返回false则停止搜索
  */
 export declare const forDfsEach: <T>(list: T[] | Set<T>, up: (data: T) => T[] | Set<T> | void, callback: (data: T) => boolean) => void;
+/**
+ * 深度优先异步搜索
+ * @param list 节点源
+ * @param up 节点下钻，返回当前节点的子节点
+ * @param callback 节点回调，返回false/Promise<false>则停止搜索
+ */
+export declare const forDfsAsyncEach: <T>(list: T[] | Set<T>, up: (data: T) => T[] | Set<T> | void, callback: (data: T) => boolean | Promise<boolean>) => Promise<void>;
 /**
  * 深度优先搜索(栈模式)，回调规则为从里到外
  * @param list 节点源
@@ -20,3 +34,11 @@ export declare const forDfsEach: <T>(list: T[] | Set<T>, up: (data: T) => T[] |
  * @description 应用场景：统计子节点的数据量
  */
 export declare const forDfsStackEach: <T>(list: T[] | Set<T>, up: (data: T) => T[] | Set<T> | void, callback: (data: T) => boolean) => void;
+/**
+ * 深度优先异步搜索(栈模式)，回调规则为从里到外
+ * @param list 节点源
+ * @param up 节点下钻，返回当前节点的子节点
+ * @param callback 节点回调，返回false/Promise<false>则停止搜索
+ * @description 应用场景：统计子节点的数据量
+ */
+export declare const forDfsStackAsyncEach: <T>(list: T[] | Set<T>, up: (data: T) => T[] | Set<T> | void, callback: (data: T) => boolean | Promise<boolean>) => Promise<void>;

package/dist/each.js

@@ -8,6 +8,16 @@ const forBfsEach = (list, up, callback) => {
     }
   }
 };
+const forBfsAsyncEach = async (list, up, callback) => {
+  const stack = [list];
+  for (const list2 of stack) {
+    for (const value of list2) {
+      if (!await callback(value)) break;
+      const result = up(value);
+      result === void 0 || stack.push(result);
+    }
+  }
+};
 const reverseMergeIn = (from, to = []) => {
   let i = to.length + (Array.isArray(from) ? from.length : from.size);
   for (const value of from) {
@@ -24,6 +34,15 @@ const forDfsEach = (list, up, callback) => {
     result === void 0 || reverseMergeIn(result, stack);
   }
 };
+const forDfsAsyncEach = async (list, up, callback) => {
+  const stack = reverseMergeIn(list);
+  while (stack.length > 0) {
+    const value = stack.pop();
+    if (!await callback(value)) break;
+    const result = up(value);
+    result === void 0 || reverseMergeIn(result, stack);
+  }
+};
 const mergeIns = (from, asc, desc) => {
   let count = desc.length + (Array.isArray(from) ? from.length : from.size);
   for (const value of from) {
@@ -43,8 +62,22 @@ const forDfsStackEach = (list, up, callback) => {
     if (!callback(locals[--i])) break;
   }
 };
+const forDfsStackAsyncEach = async (list, up, callback) => {
+  const [stack, locals] = mergeIns(list, [], []);
+  while (stack.length > 0) {
+    const value = stack.pop();
+    const result = up(value);
+    result === void 0 || mergeIns(result, stack, locals);
+  }
+  for (let i = locals.length; i > 0; ) {
+    if (!await callback(locals[--i])) break;
+  }
+};
 export {
+  forBfsAsyncEach,
   forBfsEach,
+  forDfsAsyncEach,
   forDfsEach,
+  forDfsStackAsyncEach,
   forDfsStackEach
 };

package/dist/index.cjs.js

@@ -65,8 +65,11 @@ __export(index_exports, {
   desensReplace: () => desensReplace,
   disableEnumerable: () => disable_enumerable_default,
   flatURLParams: () => flatURLParams,
+  forBfsAsyncEach: () => forBfsAsyncEach,
   forBfsEach: () => forBfsEach,
+  forDfsAsyncEach: () => forDfsAsyncEach,
   forDfsEach: () => forDfsEach,
+  forDfsStackAsyncEach: () => forDfsStackAsyncEach,
   forDfsStackEach: () => forDfsStackEach,
   getEncoding: () => getEncoding,
   hash8json: () => hash8json,
@@ -1190,6 +1193,16 @@ var forBfsEach = (list, up, callback) => {
     }
   }
 };
+var forBfsAsyncEach = async (list, up, callback) => {
+  const stack = [list];
+  for (const list2 of stack) {
+    for (const value of list2) {
+      if (!await callback(value)) break;
+      const result = up(value);
+      result === void 0 || stack.push(result);
+    }
+  }
+};
 var reverseMergeIn = (from, to = []) => {
   let i = to.length + (Array.isArray(from) ? from.length : from.size);
   for (const value of from) {
@@ -1206,6 +1219,15 @@ var forDfsEach = (list, up, callback) => {
     result === void 0 || reverseMergeIn(result, stack);
   }
 };
+var forDfsAsyncEach = async (list, up, callback) => {
+  const stack = reverseMergeIn(list);
+  while (stack.length > 0) {
+    const value = stack.pop();
+    if (!await callback(value)) break;
+    const result = up(value);
+    result === void 0 || reverseMergeIn(result, stack);
+  }
+};
 var mergeIns = (from, asc, desc) => {
   let count = desc.length + (Array.isArray(from) ? from.length : from.size);
   for (const value of from) {
@@ -1225,6 +1247,17 @@ var forDfsStackEach = (list, up, callback) => {
     if (!callback(locals[--i])) break;
   }
 };
+var forDfsStackAsyncEach = async (list, up, callback) => {
+  const [stack, locals] = mergeIns(list, [], []);
+  while (stack.length > 0) {
+    const value = stack.pop();
+    const result = up(value);
+    result === void 0 || mergeIns(result, stack, locals);
+  }
+  for (let i = locals.length; i > 0; ) {
+    if (!await callback(locals[--i])) break;
+  }
+};
 
 // src/encoding.ts
 var utf8_first_prefix = /^1{2,}/g;

package/dist/index.d.ts

@@ -11,7 +11,7 @@ export { weekDic, default_max_second, default_min_second, default_max_minute, de
 export { type DesensDecrypt, type DesensEncrypt, desensEncrypt, desensDecrypt, desensReplace } from './desens';
 export { type Dic, default as DicRollup } from './dic';
 export { default as disableEnumerable } from './disable-enumerable';
-export { forBfsEach, forDfsEach, forDfsStackEach } from './each';
+export { forBfsEach, forBfsAsyncEach, forDfsEach, forDfsAsyncEach, forDfsStackEach, forDfsStackAsyncEach } from './each';
 export { getEncoding } from './encoding';
 export { FlatTree } from './flat-tree';
 export { default as indexSort } from './index-sort';

package/dist/index.js

@@ -11,7 +11,7 @@ import { weekDic, default_max_second, default_min_second, default_max_minute, de
 import { desensEncrypt, desensDecrypt, desensReplace } from "./desens";
 import { default as default4 } from "./dic";
 import { default as default5 } from "./disable-enumerable";
-import { forBfsEach, forDfsEach, forDfsStackEach } from "./each";
+import { forBfsEach, forBfsAsyncEach, forDfsEach, forDfsAsyncEach, forDfsStackEach, forDfsStackAsyncEach } from "./each";
 import { getEncoding } from "./encoding";
 import { FlatTree } from "./flat-tree";
 import { default as default6 } from "./index-sort";
@@ -87,8 +87,11 @@ export {
   desensReplace,
   default5 as disableEnumerable,
   flatURLParams,
+  forBfsAsyncEach,
   forBfsEach,
+  forDfsAsyncEach,
   forDfsEach,
+  forDfsStackAsyncEach,
   forDfsStackEach,
   getEncoding,
   hash8json,

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@vope/utils",
-  "version": "1.9.1",
+  "version": "1.9.2",
   "description": "",
   "publishConfig": {
     "access": "public",