sculp-js 1.8.0 → 1.8.2

package/lib/cjs/array.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.8.0
+ * sculp-js v1.8.1
  * (c) 2023-present chandq
  * Released under the MIT License.
  */
@@ -26,7 +26,7 @@ function arrayEach(array, iterator, reverse = false) {
         }
     }
     else {
-        for (let idx = 0; idx < array.length; idx++) {
+        for (let idx = 0, len = array.length; idx < len; idx++) {
             const val = array[idx];
             const re = iterator(val, idx, array);
             if (re === false)
@@ -51,7 +51,7 @@ async function arrayEachAsync(array, iterator, reverse = false) {
         }
     }
     else {
-        for (let idx = 0; idx < array.length; idx++) {
+        for (let idx = 0, len = array.length; idx < len; idx++) {
             const val = array[idx];
             if ((await iterator(val, idx)) === false)
                 break;
@@ -88,7 +88,9 @@ function arrayRemove(array, expect) {
         if (_expect(val, idx))
             indexes.push(idx);
     });
-    indexes.forEach((val, idx) => array.splice(val - idx, 1));
+    arrayEach(indexes, (val, idx) => {
+        array.splice(val - idx, 1);
+    });
     return array;
 }
 

package/lib/cjs/async.js

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

package/lib/cjs/base64.js

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

package/lib/cjs/clipboard.js

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

package/lib/cjs/cookie.js

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

package/lib/cjs/date.js

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

package/lib/cjs/dom.js

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

package/lib/cjs/download.js

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

package/lib/cjs/easing.js

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

package/lib/cjs/file.js

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

package/lib/cjs/func.js

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

package/lib/cjs/index.js

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

package/lib/cjs/math.js

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

package/lib/cjs/number.js

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

package/lib/cjs/object.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.8.0
+ * sculp-js v1.8.1
  * (c) 2023-present chandq
  * Released under the MIT License.
  */
@@ -143,7 +143,7 @@ const merge = (map, source, target) => {
  */
 function objectAssign(source, ...targets) {
     const map = new Map();
-    for (let i = 0; i < targets.length; i++) {
+    for (let i = 0, len = targets.length; i < len; i++) {
         const target = targets[i];
         // eslint-disable-next-line @typescript-eslint/ban-ts-comment
         // @ts-ignore
@@ -268,10 +268,10 @@ function cloneDeep(source, map = new WeakMap()) {
     }
     // 处理数组 (包含稀疏数组)
     if (Array.isArray(source)) {
-        const copy = Array.from({ length: source.length });
+        const copy = new Array(source.length);
         map.set(source, copy);
         // 克隆所有有效索引
-        for (let i = 0; i < source.length; i++) {
+        for (let i = 0, len = source.length; i < len; i++) {
             if (i in source) {
                 // 保留空位
                 copy[i] = cloneDeep(source[i], map);
@@ -424,7 +424,7 @@ function compareArrays(a, b, compared) {
     if (keysA.length !== keysB.length)
         return false;
     // 递归比较每个元素
-    for (let i = 0; i < a.length; i++) {
+    for (let i = 0, len = a.length; i < len; i++) {
         if (!deepEqual(a[i], b[i], compared))
             return false;
     }

package/lib/cjs/path.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.8.0
+ * sculp-js v1.8.1
  * (c) 2023-present chandq
  * Released under the MIT License.
  */
@@ -12,7 +12,7 @@
  * @returns {string}
  */
 const pathNormalize = (path) => {
-    const slicees = path
+    const slices = path
         .replace(/\\/g, '/')
         .replace(/\/{2,}/g, '/')
         .replace(/\.{3,}/g, '..')
@@ -37,7 +37,7 @@ const pathNormalize = (path) => {
             points.pop();
         }
     };
-    slicees.forEach(slice => {
+    slices.forEach(slice => {
         const isCurrent = isCurrentSlice(slice);
         const isParent = isParentSlice(slice);
         // 未进入实际路径

package/lib/cjs/qs.js

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

package/lib/cjs/random.js

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

package/lib/cjs/string.js

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

package/lib/cjs/tooltip.js

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

package/lib/cjs/tree.js

@@ -1,11 +1,12 @@
 /*!
- * sculp-js v1.8.0
+ * sculp-js v1.8.1
  * (c) 2023-present chandq
  * Released under the MIT License.
  */
 
 'use strict';
 
+var array = require('./array.js');
 var object = require('./object.js');
 var type = require('./type.js');
 
@@ -48,7 +49,7 @@ function forEachDeep(tree, iterator, children = 'children', isReverse = false) {
             }
         }
         else {
-            for (let i = 0; i < arr.length; i++) {
+            for (let i = 0, len = arr.length; i < len; i++) {
                 if (isBreak) {
                     break;
                 }
@@ -174,7 +175,7 @@ function searchTreeById(tree, nodeId, config) {
     return getIds(toFlatArray(tree));
 }
 /**
- * 扁平化数组转换成树(效率高于buildTree)
+ * 扁平化数组转换成树
  * @param {any[]} list
  * @param {IFieldOptions} options
  * @returns {any[]}
@@ -183,10 +184,10 @@ function formatTree(list, options = defaultFieldOptions) {
     const { keyField, childField, pidField } = options;
     const treeArr = [];
     const sourceMap = {};
-    list.forEach(item => {
+    array.arrayEach(list, item => {
         sourceMap[item[keyField]] = item;
     });
-    list.forEach(item => {
+    array.arrayEach(list, item => {
         const parent = sourceMap[item[pidField]];
         if (parent) {
             (parent[childField] || (parent[childField] = [])).push(item);
@@ -205,7 +206,8 @@ function formatTree(list, options = defaultFieldOptions) {
  */
 function flatTree(treeList, options = defaultFieldOptions) {
     const { childField, keyField, pidField } = options;
-    return treeList.reduce((res, node) => {
+    let res = [];
+    array.arrayEach(treeList, node => {
         const item = {
             ...node,
             [childField]: [] // 清空子级
@@ -219,8 +221,8 @@ function flatTree(treeList, options = defaultFieldOptions) {
             }));
             res = res.concat(flatTree(children, options));
         }
-        return res;
-    }, []);
+    });
+    return res;
 }
 /**
  * 模糊搜索函数，返回包含搜索字符的节点及其祖先节点, 适用于树型组件的字符过滤功能
@@ -242,7 +244,7 @@ function fuzzySearchTree(nodes, filterCondition, options = defaultSearchTreeOpti
         return nodes;
     }
     const result = [];
-    for (const node of nodes) {
+    array.arrayEach(nodes, node => {
         // 递归检查子节点是否匹配
         const matchedChildren = node[options.childField] && node[options.childField].length > 0
             ? fuzzySearchTree(node[options.childField] || [], filterCondition, options)
@@ -282,7 +284,7 @@ function fuzzySearchTree(nodes, filterCondition, options = defaultSearchTreeOpti
                 });
             }
         }
-    }
+    });
     return result;
 }
 

package/lib/cjs/type.js

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

package/lib/cjs/unique.js

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

package/lib/cjs/url.js

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

package/lib/cjs/validator.js

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

package/lib/cjs/variable.js

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

package/lib/cjs/watermark.js

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

package/lib/cjs/we-decode.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.8.0
+ * sculp-js v1.8.1
  * (c) 2023-present chandq
  * Released under the MIT License.
  */
@@ -10,7 +10,7 @@ const b64 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=';
 // eslint-disable-next-line
 const b64re = /^(?:[A-Za-z\d+\/]{4})*?(?:[A-Za-z\d+\/]{2}(?:==)?|[A-Za-z\d+\/]{3}=?)?$/;
 /**
- * 字符串编码成Base64 （适用于任何环境，包括小程序）
+ * 字符串编码成Base64, 平替浏览器的btoa, 不包含中文的处理 （适用于任何环境，包括小程序）
  * @param {string} string
  * @returns {string}
  */
@@ -18,8 +18,9 @@ function weBtoa(string) {
     // 同window.btoa: 字符串编码成Base64
     string = String(string);
     let bitmap, a, b, c, result = '', i = 0;
-    const rest = string.length % 3;
-    for (; i < string.length;) {
+    const strLen = string.length;
+    const rest = strLen % 3;
+    for (; i < strLen;) {
         if ((a = string.charCodeAt(i++)) > 255 || (b = string.charCodeAt(i++)) > 255 || (c = string.charCodeAt(i++)) > 255)
             throw new TypeError("Failed to execute 'btoa' on 'Window': The string to be encoded contains characters outside of the Latin1 range.");
         bitmap = (a << 16) | (b << 8) | c;
@@ -32,7 +33,7 @@ function weBtoa(string) {
     return rest ? result.slice(0, rest - 3) + '==='.substring(rest) : result;
 }
 /**
- * Base64解码为原始字符串（适用于任何环境，包括小程序）
+ * Base64解码为原始字符串，平替浏览器的atob, 不包含中文的处理（适用于任何环境，包括小程序）
  * @param {string} string
  * @returns {string}
  */
@@ -43,7 +44,7 @@ function weAtob(string) {
         throw new TypeError("Failed to execute 'atob' on 'Window': The string to be decoded is not correctly encoded.");
     string += '=='.slice(2 - (string.length & 3));
     let bitmap, result = '', r1, r2, i = 0;
-    for (; i < string.length;) {
+    for (const strLen = string.length; i < strLen;) {
         bitmap =
             (b64.indexOf(string.charAt(i++)) << 18) |
                 (b64.indexOf(string.charAt(i++)) << 12) |

package/lib/es/array.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.8.0
+ * sculp-js v1.8.1
  * (c) 2023-present chandq
  * Released under the MIT License.
  */
@@ -24,7 +24,7 @@ function arrayEach(array, iterator, reverse = false) {
         }
     }
     else {
-        for (let idx = 0; idx < array.length; idx++) {
+        for (let idx = 0, len = array.length; idx < len; idx++) {
             const val = array[idx];
             const re = iterator(val, idx, array);
             if (re === false)
@@ -49,7 +49,7 @@ async function arrayEachAsync(array, iterator, reverse = false) {
         }
     }
     else {
-        for (let idx = 0; idx < array.length; idx++) {
+        for (let idx = 0, len = array.length; idx < len; idx++) {
             const val = array[idx];
             if ((await iterator(val, idx)) === false)
                 break;
@@ -86,7 +86,9 @@ function arrayRemove(array, expect) {
         if (_expect(val, idx))
             indexes.push(idx);
     });
-    indexes.forEach((val, idx) => array.splice(val - idx, 1));
+    arrayEach(indexes, (val, idx) => {
+        array.splice(val - idx, 1);
+    });
     return array;
 }
 

package/lib/es/async.js

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

package/lib/es/base64.js

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

package/lib/es/clipboard.js

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

package/lib/es/cookie.js

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

package/lib/es/date.js

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

package/lib/es/dom.js

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

package/lib/es/download.js

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

package/lib/es/easing.js

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

package/lib/es/file.js

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

package/lib/es/func.js

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

package/lib/es/index.js

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

package/lib/es/math.js

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

package/lib/es/number.js

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

package/lib/es/object.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.8.0
+ * sculp-js v1.8.1
  * (c) 2023-present chandq
  * Released under the MIT License.
  */
@@ -141,7 +141,7 @@ const merge = (map, source, target) => {
  */
 function objectAssign(source, ...targets) {
     const map = new Map();
-    for (let i = 0; i < targets.length; i++) {
+    for (let i = 0, len = targets.length; i < len; i++) {
         const target = targets[i];
         // eslint-disable-next-line @typescript-eslint/ban-ts-comment
         // @ts-ignore
@@ -266,10 +266,10 @@ function cloneDeep(source, map = new WeakMap()) {
     }
     // 处理数组 (包含稀疏数组)
     if (Array.isArray(source)) {
-        const copy = Array.from({ length: source.length });
+        const copy = new Array(source.length);
         map.set(source, copy);
         // 克隆所有有效索引
-        for (let i = 0; i < source.length; i++) {
+        for (let i = 0, len = source.length; i < len; i++) {
             if (i in source) {
                 // 保留空位
                 copy[i] = cloneDeep(source[i], map);
@@ -422,7 +422,7 @@ function compareArrays(a, b, compared) {
     if (keysA.length !== keysB.length)
         return false;
     // 递归比较每个元素
-    for (let i = 0; i < a.length; i++) {
+    for (let i = 0, len = a.length; i < len; i++) {
         if (!deepEqual(a[i], b[i], compared))
             return false;
     }

package/lib/es/path.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.8.0
+ * sculp-js v1.8.1
  * (c) 2023-present chandq
  * Released under the MIT License.
  */
@@ -10,7 +10,7 @@
  * @returns {string}
  */
 const pathNormalize = (path) => {
-    const slicees = path
+    const slices = path
         .replace(/\\/g, '/')
         .replace(/\/{2,}/g, '/')
         .replace(/\.{3,}/g, '..')
@@ -35,7 +35,7 @@ const pathNormalize = (path) => {
             points.pop();
         }
     };
-    slicees.forEach(slice => {
+    slices.forEach(slice => {
         const isCurrent = isCurrentSlice(slice);
         const isParent = isParentSlice(slice);
         // 未进入实际路径

package/lib/es/qs.js

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

package/lib/es/random.js

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

package/lib/es/string.js

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

package/lib/es/tooltip.js

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

package/lib/es/tree.js

@@ -1,9 +1,10 @@
 /*!
- * sculp-js v1.8.0
+ * sculp-js v1.8.1
  * (c) 2023-present chandq
  * Released under the MIT License.
  */
 
+import { arrayEach } from './array.js';
 import { objectOmit } from './object.js';
 import { objectHas, isEmpty } from './type.js';
 
@@ -46,7 +47,7 @@ function forEachDeep(tree, iterator, children = 'children', isReverse = false) {
             }
         }
         else {
-            for (let i = 0; i < arr.length; i++) {
+            for (let i = 0, len = arr.length; i < len; i++) {
                 if (isBreak) {
                     break;
                 }
@@ -172,7 +173,7 @@ function searchTreeById(tree, nodeId, config) {
     return getIds(toFlatArray(tree));
 }
 /**
- * 扁平化数组转换成树(效率高于buildTree)
+ * 扁平化数组转换成树
  * @param {any[]} list
  * @param {IFieldOptions} options
  * @returns {any[]}
@@ -181,10 +182,10 @@ function formatTree(list, options = defaultFieldOptions) {
     const { keyField, childField, pidField } = options;
     const treeArr = [];
     const sourceMap = {};
-    list.forEach(item => {
+    arrayEach(list, item => {
         sourceMap[item[keyField]] = item;
     });
-    list.forEach(item => {
+    arrayEach(list, item => {
         const parent = sourceMap[item[pidField]];
         if (parent) {
             (parent[childField] || (parent[childField] = [])).push(item);
@@ -203,7 +204,8 @@ function formatTree(list, options = defaultFieldOptions) {
  */
 function flatTree(treeList, options = defaultFieldOptions) {
     const { childField, keyField, pidField } = options;
-    return treeList.reduce((res, node) => {
+    let res = [];
+    arrayEach(treeList, node => {
         const item = {
             ...node,
             [childField]: [] // 清空子级
@@ -217,8 +219,8 @@ function flatTree(treeList, options = defaultFieldOptions) {
             }));
             res = res.concat(flatTree(children, options));
         }
-        return res;
-    }, []);
+    });
+    return res;
 }
 /**
  * 模糊搜索函数，返回包含搜索字符的节点及其祖先节点, 适用于树型组件的字符过滤功能
@@ -240,7 +242,7 @@ function fuzzySearchTree(nodes, filterCondition, options = defaultSearchTreeOpti
         return nodes;
     }
     const result = [];
-    for (const node of nodes) {
+    arrayEach(nodes, node => {
         // 递归检查子节点是否匹配
         const matchedChildren = node[options.childField] && node[options.childField].length > 0
             ? fuzzySearchTree(node[options.childField] || [], filterCondition, options)
@@ -280,7 +282,7 @@ function fuzzySearchTree(nodes, filterCondition, options = defaultSearchTreeOpti
                 });
             }
         }
-    }
+    });
     return result;
 }
 

package/lib/es/type.js

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

package/lib/es/unique.js

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

package/lib/es/url.js

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

package/lib/es/validator.js

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

package/lib/es/variable.js

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

package/lib/es/watermark.js

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

package/lib/es/we-decode.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.8.0
+ * sculp-js v1.8.1
  * (c) 2023-present chandq
  * Released under the MIT License.
  */
@@ -8,7 +8,7 @@ const b64 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=';
 // eslint-disable-next-line
 const b64re = /^(?:[A-Za-z\d+\/]{4})*?(?:[A-Za-z\d+\/]{2}(?:==)?|[A-Za-z\d+\/]{3}=?)?$/;
 /**
- * 字符串编码成Base64 （适用于任何环境，包括小程序）
+ * 字符串编码成Base64, 平替浏览器的btoa, 不包含中文的处理 （适用于任何环境，包括小程序）
  * @param {string} string
  * @returns {string}
  */
@@ -16,8 +16,9 @@ function weBtoa(string) {
     // 同window.btoa: 字符串编码成Base64
     string = String(string);
     let bitmap, a, b, c, result = '', i = 0;
-    const rest = string.length % 3;
-    for (; i < string.length;) {
+    const strLen = string.length;
+    const rest = strLen % 3;
+    for (; i < strLen;) {
         if ((a = string.charCodeAt(i++)) > 255 || (b = string.charCodeAt(i++)) > 255 || (c = string.charCodeAt(i++)) > 255)
             throw new TypeError("Failed to execute 'btoa' on 'Window': The string to be encoded contains characters outside of the Latin1 range.");
         bitmap = (a << 16) | (b << 8) | c;
@@ -30,7 +31,7 @@ function weBtoa(string) {
     return rest ? result.slice(0, rest - 3) + '==='.substring(rest) : result;
 }
 /**
- * Base64解码为原始字符串（适用于任何环境，包括小程序）
+ * Base64解码为原始字符串，平替浏览器的atob, 不包含中文的处理（适用于任何环境，包括小程序）
  * @param {string} string
  * @returns {string}
  */
@@ -41,7 +42,7 @@ function weAtob(string) {
         throw new TypeError("Failed to execute 'atob' on 'Window': The string to be decoded is not correctly encoded.");
     string += '=='.slice(2 - (string.length & 3));
     let bitmap, result = '', r1, r2, i = 0;
-    for (; i < string.length;) {
+    for (const strLen = string.length; i < strLen;) {
         bitmap =
             (b64.indexOf(string.charAt(i++)) << 18) |
                 (b64.indexOf(string.charAt(i++)) << 12) |

package/lib/index.d.ts

@@ -827,7 +827,7 @@ interface ITreeConf {
  */
 declare function searchTreeById<V>(tree: ArrayLike<V>, nodeId: IdLike, config?: ITreeConf): [IdLike[], ArrayLike<V>[]];
 /**
- * 扁平化数组转换成树(效率高于buildTree)
+ * 扁平化数组转换成树
  * @param {any[]} list
  * @param {IFieldOptions} options
  * @returns {any[]}
@@ -892,13 +892,13 @@ type NumberType = number | string;
 declare function strip(num: NumberType, precision?: number): number;
 
 /**
- * 字符串编码成Base64 （适用于任何环境，包括小程序）
+ * 字符串编码成Base64, 平替浏览器的btoa, 不包含中文的处理 （适用于任何环境，包括小程序）
  * @param {string} string
  * @returns {string}
  */
 declare function weBtoa(string: string): string;
 /**
- * Base64解码为原始字符串（适用于任何环境，包括小程序）
+ * Base64解码为原始字符串，平替浏览器的atob, 不包含中文的处理（适用于任何环境，包括小程序）
  * @param {string} string
  * @returns {string}
  */

package/lib/umd/index.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.8.0
+ * sculp-js v1.8.1
  * (c) 2023-present chandq
  * Released under the MIT License.
  */
@@ -30,7 +30,7 @@
             }
         }
         else {
-            for (let idx = 0; idx < array.length; idx++) {
+            for (let idx = 0, len = array.length; idx < len; idx++) {
                 const val = array[idx];
                 const re = iterator(val, idx, array);
                 if (re === false)
@@ -55,7 +55,7 @@
             }
         }
         else {
-            for (let idx = 0; idx < array.length; idx++) {
+            for (let idx = 0, len = array.length; idx < len; idx++) {
                 const val = array[idx];
                 if ((await iterator(val, idx)) === false)
                     break;
@@ -92,7 +92,9 @@
             if (_expect(val, idx))
                 indexes.push(idx);
         });
-        indexes.forEach((val, idx) => array.splice(val - idx, 1));
+        arrayEach(indexes, (val, idx) => {
+            array.splice(val - idx, 1);
+        });
         return array;
     }
 
@@ -375,7 +377,7 @@
      */
     function objectAssign(source, ...targets) {
         const map = new Map();
-        for (let i = 0; i < targets.length; i++) {
+        for (let i = 0, len = targets.length; i < len; i++) {
             const target = targets[i];
             // eslint-disable-next-line @typescript-eslint/ban-ts-comment
             // @ts-ignore
@@ -500,10 +502,10 @@
         }
         // 处理数组 (包含稀疏数组)
         if (Array.isArray(source)) {
-            const copy = Array.from({ length: source.length });
+            const copy = new Array(source.length);
             map.set(source, copy);
             // 克隆所有有效索引
-            for (let i = 0; i < source.length; i++) {
+            for (let i = 0, len = source.length; i < len; i++) {
                 if (i in source) {
                     // 保留空位
                     copy[i] = cloneDeep(source[i], map);
@@ -656,7 +658,7 @@
         if (keysA.length !== keysB.length)
             return false;
         // 递归比较每个元素
-        for (let i = 0; i < a.length; i++) {
+        for (let i = 0, len = a.length; i < len; i++) {
             if (!deepEqual(a[i], b[i], compared))
                 return false;
         }
@@ -1230,7 +1232,7 @@
      * @returns {string}
      */
     const pathNormalize = (path) => {
-        const slicees = path
+        const slices = path
             .replace(/\\/g, '/')
             .replace(/\/{2,}/g, '/')
             .replace(/\.{3,}/g, '..')
@@ -1255,7 +1257,7 @@
                 points.pop();
             }
         };
-        slicees.forEach(slice => {
+        slices.forEach(slice => {
             const isCurrent = isCurrentSlice(slice);
             const isParent = isParentSlice(slice);
             // 未进入实际路径
@@ -1560,7 +1562,7 @@
     // eslint-disable-next-line
     const b64re = /^(?:[A-Za-z\d+\/]{4})*?(?:[A-Za-z\d+\/]{2}(?:==)?|[A-Za-z\d+\/]{3}=?)?$/;
     /**
-     * 字符串编码成Base64 （适用于任何环境，包括小程序）
+     * 字符串编码成Base64, 平替浏览器的btoa, 不包含中文的处理 （适用于任何环境，包括小程序）
      * @param {string} string
      * @returns {string}
      */
@@ -1568,8 +1570,9 @@
         // 同window.btoa: 字符串编码成Base64
         string = String(string);
         let bitmap, a, b, c, result = '', i = 0;
-        const rest = string.length % 3;
-        for (; i < string.length;) {
+        const strLen = string.length;
+        const rest = strLen % 3;
+        for (; i < strLen;) {
             if ((a = string.charCodeAt(i++)) > 255 || (b = string.charCodeAt(i++)) > 255 || (c = string.charCodeAt(i++)) > 255)
                 throw new TypeError("Failed to execute 'btoa' on 'Window': The string to be encoded contains characters outside of the Latin1 range.");
             bitmap = (a << 16) | (b << 8) | c;
@@ -1582,7 +1585,7 @@
         return rest ? result.slice(0, rest - 3) + '==='.substring(rest) : result;
     }
     /**
-     * Base64解码为原始字符串（适用于任何环境，包括小程序）
+     * Base64解码为原始字符串，平替浏览器的atob, 不包含中文的处理（适用于任何环境，包括小程序）
      * @param {string} string
      * @returns {string}
      */
@@ -1593,7 +1596,7 @@
             throw new TypeError("Failed to execute 'atob' on 'Window': The string to be decoded is not correctly encoded.");
         string += '=='.slice(2 - (string.length & 3));
         let bitmap, result = '', r1, r2, i = 0;
-        for (; i < string.length;) {
+        for (const strLen = string.length; i < strLen;) {
             bitmap =
                 (b64.indexOf(string.charAt(i++)) << 18) |
                     (b64.indexOf(string.charAt(i++)) << 12) |
@@ -2360,7 +2363,7 @@
                 }
             }
             else {
-                for (let i = 0; i < arr.length; i++) {
+                for (let i = 0, len = arr.length; i < len; i++) {
                     if (isBreak) {
                         break;
                     }
@@ -2486,7 +2489,7 @@
         return getIds(toFlatArray(tree));
     }
     /**
-     * 扁平化数组转换成树(效率高于buildTree)
+     * 扁平化数组转换成树
      * @param {any[]} list
      * @param {IFieldOptions} options
      * @returns {any[]}
@@ -2495,10 +2498,10 @@
         const { keyField, childField, pidField } = options;
         const treeArr = [];
         const sourceMap = {};
-        list.forEach(item => {
+        arrayEach(list, item => {
             sourceMap[item[keyField]] = item;
         });
-        list.forEach(item => {
+        arrayEach(list, item => {
             const parent = sourceMap[item[pidField]];
             if (parent) {
                 (parent[childField] || (parent[childField] = [])).push(item);
@@ -2517,7 +2520,8 @@
      */
     function flatTree(treeList, options = defaultFieldOptions) {
         const { childField, keyField, pidField } = options;
-        return treeList.reduce((res, node) => {
+        let res = [];
+        arrayEach(treeList, node => {
             const item = {
                 ...node,
                 [childField]: [] // 清空子级
@@ -2531,8 +2535,8 @@
                 }));
                 res = res.concat(flatTree(children, options));
             }
-            return res;
-        }, []);
+        });
+        return res;
     }
     /**
      * 模糊搜索函数，返回包含搜索字符的节点及其祖先节点, 适用于树型组件的字符过滤功能
@@ -2554,7 +2558,7 @@
             return nodes;
         }
         const result = [];
-        for (const node of nodes) {
+        arrayEach(nodes, node => {
             // 递归检查子节点是否匹配
             const matchedChildren = node[options.childField] && node[options.childField].length > 0
                 ? fuzzySearchTree(node[options.childField] || [], filterCondition, options)
@@ -2594,7 +2598,7 @@
                     });
                 }
             }
-        }
+        });
         return result;
     }
 

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "sculp-js",
-  "version": "1.8.0",
+  "version": "1.8.2",
   "packageManager": "npm@8.19.2",
   "description": "js utils library, includes function library、class library",
   "scripts": {