sculp-js 1.13.6 → 1.15.0

package/dist/esm/concurrentLimit.js

@@ -0,0 +1,176 @@
+/*!
+ * sculp-js v1.15.0
+ * (c) 2023-present chandq
+ * Released under the MIT License.
+ */
+
+/**
+ * 并发限制执行器
+ * @param {Array<Function>} tasks - 返回Promise的任务函数数组
+ * @param {number} limit - 最大并发数
+ * @returns {Promise<Array>} - 按任务顺序返回结果数组
+ */
+async function concurrentLimit(tasks, limit) {
+  if (!Array.isArray(tasks)) {
+    throw new Error('tasks must be an array of functions');
+  }
+  if (typeof limit !== 'number' || limit <= 0) {
+    throw new Error('limit must be a positive number');
+  }
+  // Validate each task is a function
+  for (let i = 0; i < tasks.length; i++) {
+    if (typeof tasks[i] !== 'function') {
+      throw new Error(`task at index ${i} must be a function`);
+    }
+  }
+  if (tasks.length === 0) {
+    return [];
+  }
+  const results = new Array(tasks.length);
+  let currentIndex = 0;
+  return new Promise(resolve => {
+    let running = 0;
+    let completed = 0;
+    const executeNext = () => {
+      // 启动新任务直到达到并发限制
+      while (running < limit && currentIndex < tasks.length) {
+        const taskIndex = currentIndex;
+        const task = tasks[currentIndex];
+        currentIndex++;
+        running++;
+        // 将函数包装在 Promise 中以处理同步错误
+        Promise.resolve()
+          .then(() => task())
+          .then(value => {
+            results[taskIndex] = { status: 'fulfilled', value };
+          })
+          .catch(reason => {
+            results[taskIndex] = { status: 'rejected', reason };
+          })
+          // eslint-disable-next-line no-loop-func
+          .finally(() => {
+            running--;
+            completed++;
+            if (completed === tasks.length) {
+              resolve(results);
+            } else {
+              // 继续执行下一个任务
+              executeNext();
+            }
+          });
+      }
+    };
+    // 开始执行
+    executeNext();
+  });
+}
+/**
+ * 增强版：支持取消和进度回调
+ */
+class ConcurrentExecutor {
+  limit;
+  active;
+  queue;
+  results;
+  isStopped;
+  onProgress;
+  onTaskComplete;
+  constructor(limit = 5) {
+    this.limit = limit;
+    this.active = new Map();
+    this.queue = [];
+    this.results = [];
+    this.isStopped = false;
+    this.onProgress = null;
+    this.onTaskComplete = null;
+  }
+  /**
+   * 添加任务
+   * @param {Function} task - 返回Promise的任务函数
+   * @param {any} meta - 任务元数据
+   */
+  add(task, meta = {}) {
+    const taskId = this.queue.length;
+    this.queue.push({ task, meta, id: taskId });
+    return taskId;
+  }
+  /**
+   * 批量添加任务
+   */
+  addAll(tasks) {
+    return tasks.map((task, i) => this.add(task, { index: i }));
+  }
+  /**
+   * 执行所有任务
+   */
+  async run() {
+    if (this.isStopped) {
+      throw new Error('Executor has been stopped');
+    }
+    this.results = new Array(this.queue.length);
+    let completed = 0;
+    // 更新进度
+    const updateProgress = () => {
+      if (this.onProgress) {
+        this.onProgress({
+          completed,
+          total: this.queue.length,
+          active: this.active.size,
+          percent: (completed / this.queue.length) * 100
+        });
+      }
+    };
+    // 执行单个任务
+    const runTask = async taskInfo => {
+      if (this.isStopped) return;
+      const { task, id, meta } = taskInfo;
+      const taskPromise = Promise.resolve().then(() => task(meta));
+      this.active.set(id, taskPromise);
+      try {
+        const result = await taskPromise;
+        this.results[id] = { status: 'fulfilled', value: result };
+      } catch (error) {
+        this.results[id] = { status: 'rejected', reason: error };
+      } finally {
+        this.active.delete(id);
+        completed++;
+        updateProgress();
+        if (this.onTaskComplete) {
+          this.onTaskComplete(id, this.results[id]);
+        }
+        // 执行队列中的下一个任务
+        if (this.queue.length > 0 && !this.isStopped) {
+          const nextTask = this.queue.shift();
+          runTask(nextTask);
+        }
+      }
+    };
+    // 启动初始任务
+    const initialTasks = this.queue.splice(0, this.limit);
+    initialTasks.forEach(runTask);
+    // 等待所有任务完成
+    while (this.active.size > 0 && !this.isStopped) {
+      await Promise.race(this.active.values());
+    }
+    if (this.isStopped) {
+      throw new Error('Execution was stopped');
+    }
+    return this.results;
+  }
+  /**
+   * 停止执行
+   */
+  stop() {
+    this.isStopped = true;
+    this.active.clear();
+    this.queue = [];
+  }
+  /**
+   * 清空队列
+   */
+  clear() {
+    this.queue = [];
+  }
+}
+
+export { ConcurrentExecutor, concurrentLimit };

package/dist/esm/cookie.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.13.6
+ * sculp-js v1.15.0
  * (c) 2023-present chandq
  * Released under the MIT License.
  */

package/dist/esm/date.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.13.6
+ * sculp-js v1.15.0
  * (c) 2023-present chandq
  * Released under the MIT License.
  */

package/dist/esm/dom.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.13.6
+ * sculp-js v1.15.0
  * (c) 2023-present chandq
  * Released under the MIT License.
  */

package/dist/esm/download.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.13.6
+ * sculp-js v1.15.0
  * (c) 2023-present chandq
  * Released under the MIT License.
  */

package/dist/esm/easing.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.13.6
+ * sculp-js v1.15.0
  * (c) 2023-present chandq
  * Released under the MIT License.
  */

package/dist/esm/file.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.13.6
+ * sculp-js v1.15.0
  * (c) 2023-present chandq
  * Released under the MIT License.
  */

package/dist/esm/func.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.13.6
+ * sculp-js v1.15.0
  * (c) 2023-present chandq
  * Released under the MIT License.
  */

package/dist/esm/index.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.13.6
+ * sculp-js v1.15.0
  * (c) 2023-present chandq
  * Released under the MIT License.
  */
@@ -95,7 +95,16 @@ export {
 } from './number.js';
 export { UNIQUE_NUMBER_SAFE_LENGTH, uniqueNumber, uniqueString } from './unique.js';
 export { tooltipEvent } from './tooltip.js';
-export { flatTree, forEachDeep, formatTree, fuzzySearchTree, mapDeep, searchTreeById } from './tree.js';
+export {
+  filterDeep,
+  findDeep,
+  flatTree,
+  forEachDeep,
+  formatTree,
+  fuzzySearchTree,
+  mapDeep,
+  searchTreeById
+} from './tree.js';
 export { add, divide, multiply, strip, subtract } from './math.js';
 export { b64decode, b64encode, weAtob, weBtoa } from './base64.js';
 export {
@@ -119,3 +128,4 @@ export {
 export { escapeRegExp, executeInScope, parseVarFromString, replaceVarFromString, uniqueSymbol } from './variable.js';
 export { cloneDeep } from './cloneDeep.js';
 export { easingFunctional, easingStringify, getEasing, setEasing } from './easing.js';
+export { ConcurrentExecutor, concurrentLimit } from './concurrentLimit.js';

package/dist/esm/math.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.13.6
+ * sculp-js v1.15.0
  * (c) 2023-present chandq
  * Released under the MIT License.
  */

package/dist/esm/number.js

@@ -1,12 +1,12 @@
 /*!
- * sculp-js v1.13.6
+ * sculp-js v1.15.0
  * (c) 2023-present chandq
  * Released under the MIT License.
  */
 
 import { getGlobal } from './func.js';
 import { STRING_ARABIC_NUMERALS, STRING_UPPERCASE_ALPHA, STRING_LOWERCASE_ALPHA } from './string.js';
-import { isNullOrUnDef, isNumber } from './type.js';
+import { isNullOrUnDef } from './type.js';
 
 const HEX_POOL = `${STRING_ARABIC_NUMERALS}${STRING_UPPERCASE_ALPHA}${STRING_LOWERCASE_ALPHA}`;
 const supportBigInt = typeof BigInt !== 'undefined';
@@ -104,9 +104,7 @@ function formatNumber(num, decimals) {
     return parseInt(String(num)).toLocaleString();
   }
   let prec = 0;
-  if (!isNumber(decimals)) {
-    throw new Error('Decimals must be a positive number not less than zero');
-  } else if (decimals > 0) {
+  if (decimals > 0) {
     prec = decimals;
   }
   return Number(Number(num).toFixed(prec)).toLocaleString('en-US');

package/dist/esm/object.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.13.6
+ * sculp-js v1.15.0
  * (c) 2023-present chandq
  * Released under the MIT License.
  */

package/dist/esm/path.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.13.6
+ * sculp-js v1.15.0
  * (c) 2023-present chandq
  * Released under the MIT License.
  */

package/dist/esm/qs.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.13.6
+ * sculp-js v1.15.0
  * (c) 2023-present chandq
  * Released under the MIT License.
  */

package/dist/esm/random.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.13.6
+ * sculp-js v1.15.0
  * (c) 2023-present chandq
  * Released under the MIT License.
  */

package/dist/esm/string.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.13.6
+ * sculp-js v1.15.0
  * (c) 2023-present chandq
  * Released under the MIT License.
  */

package/dist/esm/tooltip.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.13.6
+ * sculp-js v1.15.0
  * (c) 2023-present chandq
  * Released under the MIT License.
  */

package/dist/esm/tree.js

@@ -1,11 +1,11 @@
 /*!
- * sculp-js v1.13.6
+ * sculp-js v1.15.0
  * (c) 2023-present chandq
  * Released under the MIT License.
  */
 
 import { objectOmit } from './object.js';
-import { isObject, objectHas, isEmpty, isNodeList } from './type.js';
+import { isObject, objectHas, isNodeList } from './type.js';
 
 const defaultFieldOptions = { keyField: 'key', childField: 'children', pidField: 'pid' };
 const defaultSearchTreeOptions = {
@@ -129,6 +129,75 @@ function forEachDeep(
   // @ts-ignore
   tree = null;
 }
+/**
+ * 树查找函数, 可用于查找Array和NodeList类型的数据
+ * @param {ArrayLike<V>} tree  树形数据
+ * @param {Function} predicate  断言函数
+ * @param {options} options 支持定制子元素名称、反向遍历、广度优先遍历，默认{
+    childField: 'children',
+    reverse: false,
+    breadthFirst: false,
+    isDomNode: false,
+  }
+ * @returns {V|null}
+ */
+function findDeep(
+  tree,
+  predicate,
+  options = {
+    childField: 'children',
+    reverse: false,
+    breadthFirst: false,
+    isDomNode: false
+  }
+) {
+  let result = null;
+  forEachDeep(
+    tree,
+    (...args) => {
+      if (predicate(...args)) {
+        result = args[0];
+        return false;
+      }
+    },
+    options
+  );
+  return result;
+}
+/**
+ * 树过滤函数, 可用于过滤Array和NodeList类型的数据
+ * @param {ArrayLike<V>} tree  树形数据
+ * @param {Function} predicate  断言函数
+ * @param {options} options 支持定制子元素名称、反向遍历、广度优先遍历，默认{
+    childField: 'children',
+    reverse: false,
+    breadthFirst: false,
+    isDomNode: false,
+  }
+ * @returns {V[]}
+ */
+function filterDeep(
+  tree,
+  predicate,
+  options = {
+    childField: 'children',
+    reverse: false,
+    breadthFirst: false,
+    isDomNode: false
+  }
+) {
+  const result = [];
+  forEachDeep(
+    tree,
+    (...args) => {
+      if (predicate(...args)) {
+        result.push(args[0]);
+      }
+    },
+    options
+  );
+  return result;
+}
 /**
  * 创建一个新数组, 深度优先遍历的Map函数(支持continue和break操作), 可用于insert tree item 和 remove tree item
  *
@@ -314,10 +383,7 @@ function flatTree(treeList, options = defaultFieldOptions) {
  * @returns {V[]}
  */
 function fuzzySearchTree(nodes, filterCondition, options = defaultSearchTreeOptions) {
-  if (
-    !objectHas(filterCondition, 'filter') &&
-    (!objectHas(filterCondition, 'keyword') || isEmpty(filterCondition.keyword))
-  ) {
+  if (!objectHas(filterCondition, 'filter') && !filterCondition.keyword) {
     return nodes;
   }
   const result = [];
@@ -362,4 +428,4 @@ function fuzzySearchTree(nodes, filterCondition, options = defaultSearchTreeOpti
   return result;
 }
 
-export { flatTree, forEachDeep, formatTree, fuzzySearchTree, mapDeep, searchTreeById };
+export { filterDeep, findDeep, flatTree, forEachDeep, formatTree, fuzzySearchTree, mapDeep, searchTreeById };

package/dist/esm/type.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.13.6
+ * sculp-js v1.15.0
  * (c) 2023-present chandq
  * Released under the MIT License.
  */

package/dist/esm/unique.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.13.6
+ * sculp-js v1.15.0
  * (c) 2023-present chandq
  * Released under the MIT License.
  */

package/dist/esm/url.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.13.6
+ * sculp-js v1.15.0
  * (c) 2023-present chandq
  * Released under the MIT License.
  */

package/dist/esm/validator.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.13.6
+ * sculp-js v1.15.0
  * (c) 2023-present chandq
  * Released under the MIT License.
  */

package/dist/esm/variable.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.13.6
+ * sculp-js v1.15.0
  * (c) 2023-present chandq
  * Released under the MIT License.
  */

package/dist/esm/watermark.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.13.6
+ * sculp-js v1.15.0
  * (c) 2023-present chandq
  * Released under the MIT License.
  */

package/dist/types/concurrentLimit.d.ts

@@ -0,0 +1,65 @@
+/**
+ * 并发限制执行器
+ * @param {Array<Function>} tasks - 返回Promise的任务函数数组
+ * @param {number} limit - 最大并发数
+ * @returns {Promise<Array>} - 按任务顺序返回结果数组
+ */
+declare function concurrentLimit<T>(tasks: Array<() => Promise<T> | T>, limit: number): Promise<Array<{
+    status: 'fulfilled';
+    value: T;
+} | {
+    status: 'rejected';
+    reason: any;
+}>>;
+export interface TaskInfo<T> {
+    task: () => Promise<T> | T;
+    meta: any;
+    id: number;
+}
+export interface ProgressInfo {
+    completed: number;
+    total: number;
+    active: number;
+    percent: number;
+}
+export interface TaskResult<T> {
+    status: 'fulfilled' | 'rejected';
+    value?: T;
+    reason?: any;
+}
+/**
+ * 增强版：支持取消和进度回调
+ */
+declare class ConcurrentExecutor<T = any> {
+    private limit;
+    private active;
+    private queue;
+    private results;
+    private isStopped;
+    onProgress: ((progress: ProgressInfo) => void) | null;
+    onTaskComplete: ((taskId: number, result: TaskResult<T>) => void) | null;
+    constructor(limit?: number);
+    /**
+     * 添加任务
+     * @param {Function} task - 返回Promise的任务函数
+     * @param {any} meta - 任务元数据
+     */
+    add(task: any, meta?: {}): number;
+    /**
+     * 批量添加任务
+     */
+    addAll(tasks: any): any;
+    /**
+     * 执行所有任务
+     */
+    run(): Promise<TaskResult<T>[]>;
+    /**
+     * 停止执行
+     */
+    stop(): void;
+    /**
+     * 清空队列
+     */
+    clear(): void;
+}
+export { concurrentLimit, ConcurrentExecutor };

package/dist/types/index.d.ts

@@ -25,3 +25,4 @@ export * from './validator';
 export * from './variable';
 export * from './cloneDeep';
 export * from './easing';
+export * from './concurrentLimit';

package/dist/types/tree.d.ts

@@ -31,6 +31,42 @@ export declare function forEachDeep<V>(tree: ArrayLike<V>, iterator: (val: V, in
     breadthFirst?: boolean;
     isDomNode?: boolean;
 }): void;
+/**
+ * 树查找函数, 可用于查找Array和NodeList类型的数据
+ * @param {ArrayLike<V>} tree  树形数据
+ * @param {Function} predicate  断言函数
+ * @param {options} options 支持定制子元素名称、反向遍历、广度优先遍历，默认{
+    childField: 'children',
+    reverse: false,
+    breadthFirst: false,
+    isDomNode: false,
+  }
+ * @returns {V|null}
+ */
+export declare function findDeep<V>(tree: ArrayLike<V>, predicate: (val: V, index: number, currentArr: ArrayLike<V>, tree: ArrayLike<V>, parent: V | null, level: number) => boolean | void, options?: {
+    childField?: string;
+    reverse?: boolean;
+    breadthFirst?: boolean;
+    isDomNode?: boolean;
+}): V | null;
+/**
+ * 树过滤函数, 可用于过滤Array和NodeList类型的数据
+ * @param {ArrayLike<V>} tree  树形数据
+ * @param {Function} predicate  断言函数
+ * @param {options} options 支持定制子元素名称、反向遍历、广度优先遍历，默认{
+    childField: 'children',
+    reverse: false,
+    breadthFirst: false,
+    isDomNode: false,
+  }
+ * @returns {V[]}
+ */
+export declare function filterDeep<V>(tree: ArrayLike<V>, predicate: (val: V, index: number, currentArr: ArrayLike<V>, tree: ArrayLike<V>, parent: V | null, level: number) => boolean | void, options?: {
+    childField?: string;
+    reverse?: boolean;
+    breadthFirst?: boolean;
+    isDomNode?: boolean;
+}): V[];
 /**
  * 创建一个新数组, 深度优先遍历的Map函数(支持continue和break操作), 可用于insert tree item 和 remove tree item
  *