sculp-js 1.13.6 → 1.15.0

package/README.md

@@ -52,6 +52,8 @@
 
   - forEachDeep
   - mapDeep
+  - findDeep
+  - filterDeep
   - searchTreeById
   - formatTree
   - flatTree
@@ -100,7 +102,7 @@
 - File (web)
 
   - chooseLocalFile
-  - compressImg 压缩图片
+  - compressImg
 
 - Dom （web）
 

package/dist/cjs/_virtual/_commonjsHelpers.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/cjs/array.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/cjs/async.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/cjs/base64.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/cjs/clipboard.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/cjs/cloneDeep.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/cjs/concurrentLimit.js

@@ -0,0 +1,179 @@
+/*!
+ * sculp-js v1.15.0
+ * (c) 2023-present chandq
+ * Released under the MIT License.
+ */
+
+'use strict';
+
+/**
+ * 并发限制执行器
+ * @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 = [];
+  }
+}
+
+exports.ConcurrentExecutor = ConcurrentExecutor;
+exports.concurrentLimit = concurrentLimit;

package/dist/cjs/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/cjs/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/cjs/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/cjs/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/cjs/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/cjs/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/cjs/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/cjs/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.
  */
@@ -33,6 +33,7 @@ var validator = require('./validator.js');
 var variable = require('./variable.js');
 var cloneDeep = require('./cloneDeep.js');
 var easing = require('./easing.js');
+var concurrentLimit = require('./concurrentLimit.js');
 
 exports.arrayEach = array.arrayEach;
 exports.arrayEachAsync = array.arrayEachAsync;
@@ -141,6 +142,8 @@ exports.UNIQUE_NUMBER_SAFE_LENGTH = unique.UNIQUE_NUMBER_SAFE_LENGTH;
 exports.uniqueNumber = unique.uniqueNumber;
 exports.uniqueString = unique.uniqueString;
 exports.tooltipEvent = tooltip.tooltipEvent;
+exports.filterDeep = tree.filterDeep;
+exports.findDeep = tree.findDeep;
 exports.flatTree = tree.flatTree;
 exports.forEachDeep = tree.forEachDeep;
 exports.formatTree = tree.formatTree;
@@ -182,3 +185,5 @@ exports.easingFunctional = easing.easingFunctional;
 exports.easingStringify = easing.easingStringify;
 exports.getEasing = easing.getEasing;
 exports.setEasing = easing.setEasing;
+exports.ConcurrentExecutor = concurrentLimit.ConcurrentExecutor;
+exports.concurrentLimit = concurrentLimit.concurrentLimit;

package/dist/cjs/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/cjs/node_modules/bezier-easing/src/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.
  */

package/dist/cjs/number.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.13.6
+ * sculp-js v1.15.0
  * (c) 2023-present chandq
  * Released under the MIT License.
  */
@@ -106,9 +106,7 @@ function formatNumber(num, decimals) {
     return parseInt(String(num)).toLocaleString();
   }
   let prec = 0;
-  if (!type.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/cjs/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/cjs/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/cjs/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/cjs/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/cjs/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/cjs/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/cjs/tree.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.13.6
+ * sculp-js v1.15.0
  * (c) 2023-present chandq
  * Released under the MIT License.
  */
@@ -131,6 +131,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
  *
@@ -316,10 +385,7 @@ function flatTree(treeList, options = defaultFieldOptions) {
  * @returns {V[]}
  */
 function fuzzySearchTree(nodes, filterCondition, options = defaultSearchTreeOptions) {
-  if (
-    !type.objectHas(filterCondition, 'filter') &&
-    (!type.objectHas(filterCondition, 'keyword') || type.isEmpty(filterCondition.keyword))
-  ) {
+  if (!type.objectHas(filterCondition, 'filter') && !filterCondition.keyword) {
     return nodes;
   }
   const result = [];
@@ -364,6 +430,8 @@ function fuzzySearchTree(nodes, filterCondition, options = defaultSearchTreeOpti
   return result;
 }
 
+exports.filterDeep = filterDeep;
+exports.findDeep = findDeep;
 exports.flatTree = flatTree;
 exports.forEachDeep = forEachDeep;
 exports.formatTree = formatTree;

package/dist/cjs/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/cjs/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/cjs/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/cjs/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/cjs/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/cjs/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/esm/array.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/async.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/base64.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/clipboard.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/cloneDeep.js

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