sculp-js 1.13.0 → 1.13.2

package/{lib → dist}/cjs/tree.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.13.0
+ * sculp-js v1.13.2
  * (c) 2023-present chandq
  * Released under the MIT License.
  */
@@ -55,19 +55,15 @@ function forEachDeep(tree, iterator, options = {
                     else if (re === true) {
                         continue;
                     }
-                    // @ts-ignore
                     if (item && Array.isArray(item[childField])) {
-                        // @ts-ignore
                         walk(item[childField], item, level + 1);
                     }
                 }
             }
             if (breadthFirst) {
                 // Process queue
-                while (!isBreak) {
+                while (queue.length > 0 && !isBreak) {
                     const current = queue.shift();
-                    // iterate(info);
-                    // @ts-ignore
                     const { item, index, array, tree, parent, level } = current;
                     const re = iterator(item, index, array, tree, parent, level);
                     if (re === false) {
@@ -77,9 +73,7 @@ function forEachDeep(tree, iterator, options = {
                     else if (re === true) {
                         continue;
                     }
-                    // @ts-ignore
                     if (item && Array.isArray(item[childField])) {
-                        // @ts-ignore
                         walk(item[childField], item, level + 1);
                     }
                 }
@@ -105,19 +99,16 @@ function forEachDeep(tree, iterator, options = {
                     else if (re === true) {
                         continue;
                     }
-                    // @ts-ignore
                     if (item && Array.isArray(item[childField])) {
-                        // @ts-ignore
                         walk(item[childField], item, level + 1);
                     }
                 }
             }
             if (breadthFirst) {
-                while (!isBreak) {
+                while (queue.length > 0 && !isBreak) {
                     const current = queue.shift();
                     if (!current)
                         break;
-                    // @ts-ignore
                     const { item, index, array, tree, parent, level } = current;
                     const re = iterator(item, index, array, tree, parent, level);
                     if (re === false) {
@@ -127,9 +118,7 @@ function forEachDeep(tree, iterator, options = {
                     else if (re === true) {
                         continue;
                     }
-                    // @ts-ignore
                     if (item && Array.isArray(item[childField])) {
-                        // @ts-ignore
                         walk(item[childField], item, level + 1);
                     }
                 }
@@ -146,20 +135,27 @@ function forEachDeep(tree, iterator, options = {
  * 可遍历任何带有 length 属性和数字键的类数组对象
  * @param {ArrayLike<V>} tree  树形数据
  * @param {Function} iterator  迭代函数, 返回值为true时continue, 返回值为false时break
- * @param {string} children 定制子元素的key
- * @param {boolean} isReverse  是否反向遍历
+ * @param {options} options 支持定制子元素名称、反向遍历，默认{
+    childField: 'children',
+    reverse: false,
+  }
  * @returns {any[]} 新的一棵树
  */
-function mapDeep(tree, iterator, children = 'children', isReverse = false) {
+function mapDeep(tree, iterator, options = {
+    childField: 'children',
+    reverse: false
+}) {
+    const { childField = 'children', reverse = false } = type.isObject(options) ? options : {};
     let isBreak = false;
     const newTree = [];
     const walk = (arr, parent, newTree, level = 0) => {
-        if (isReverse) {
+        if (reverse) {
             for (let i = arr.length - 1; i >= 0; i--) {
                 if (isBreak) {
                     break;
                 }
-                const re = iterator(arr[i], i, arr, tree, parent, level);
+                const item = arr[i];
+                const re = iterator(item, i, arr, tree, parent, level);
                 if (re === false) {
                     isBreak = true;
                     break;
@@ -167,16 +163,14 @@ function mapDeep(tree, iterator, children = 'children', isReverse = false) {
                 else if (re === true) {
                     continue;
                 }
-                newTree.push(object.objectOmit(re, [children]));
-                // @ts-ignore
-                if (arr[i] && Array.isArray(arr[i][children])) {
-                    newTree[newTree.length - 1][children] = [];
-                    // @ts-ignore
-                    walk(arr[i][children], arr[i], newTree[newTree.length - 1][children], level + 1);
+                newTree.push(object.objectOmit(re, [childField]));
+                if (item && Array.isArray(item[childField])) {
+                    newTree[newTree.length - 1][childField] = [];
+                    walk(item[childField], item, newTree[newTree.length - 1][childField], level + 1);
                 }
                 else {
                     // children非有效数组时，移除该属性字段
-                    delete re[children];
+                    delete re[childField];
                 }
             }
         }
@@ -185,7 +179,8 @@ function mapDeep(tree, iterator, children = 'children', isReverse = false) {
                 if (isBreak) {
                     break;
                 }
-                const re = iterator(arr[i], i, arr, tree, parent, level);
+                const item = arr[i];
+                const re = iterator(item, i, arr, tree, parent, level);
                 if (re === false) {
                     isBreak = true;
                     break;
@@ -193,16 +188,14 @@ function mapDeep(tree, iterator, children = 'children', isReverse = false) {
                 else if (re === true) {
                     continue;
                 }
-                newTree.push(object.objectOmit(re, [children]));
-                // @ts-ignore
-                if (arr[i] && Array.isArray(arr[i][children])) {
-                    newTree[newTree.length - 1][children] = [];
-                    // @ts-ignore
-                    walk(arr[i][children], arr[i], newTree[newTree.length - 1][children], level + 1);
+                newTree.push(object.objectOmit(re, [childField]));
+                if (item && Array.isArray(item[childField])) {
+                    newTree[newTree.length - 1][childField] = [];
+                    walk(item[childField], item, newTree[newTree.length - 1][childField], level + 1);
                 }
                 else {
                     // children非有效数组时，移除该属性字段
-                    delete re[children];
+                    delete re[childField];
                 }
             }
         }
@@ -216,30 +209,30 @@ function mapDeep(tree, iterator, children = 'children', isReverse = false) {
  * 在树中找到 id 为某个值的节点，并返回上游的所有父级节点
  *
  * @param {ArrayLike<T>} tree - 树形数据
- * @param {IdLike} nodeId - 元素ID
- * @param {ITreeConf} config - 迭代配置项
- * @returns {[IdLike[], ITreeItem<V>[]]} - 由parentId...childId, parentObject-childObject组成的二维数组
+ * @param {number | string} nodeId - 目标元素ID
+ * @param {ITreeConf} options - 迭代配置项, 默认：{ children = 'children', id = 'id' }
+ * @returns {[(number | string)[], V[]]} - 由parentId...childId, parentObject-childObject组成的二维数组
  */
-function searchTreeById(tree, nodeId, config) {
-    const { children = 'children', id = 'id' } = config || {};
+function searchTreeById(tree, nodeId, options = { childField: 'children', keyField: 'id' }) {
+    const { childField = 'children', keyField = 'id' } = type.isObject(options) ? options : {};
     const toFlatArray = (tree, parentId, parent) => {
         return tree.reduce((t, _) => {
-            const child = _[children];
+            const child = _[childField];
             return [
                 ...t,
                 parentId ? { ..._, parentId, parent } : _,
-                ...(child && child.length ? toFlatArray(child, _[id], _) : [])
+                ...(child && child.length ? toFlatArray(child, _[keyField], _) : [])
             ];
         }, []);
     };
     const getIds = (flatArray) => {
-        let child = flatArray.find(_ => _[id] === nodeId);
+        let child = flatArray.find(_ => _[keyField] === nodeId);
         const { parent, parentId, ...other } = child;
         let ids = [nodeId], nodes = [other];
         while (child && child.parentId) {
             ids = [child.parentId, ...ids];
             nodes = [child.parent, ...nodes];
-            child = flatArray.find(_ => _[id] === child.parentId); // eslint-disable-line
+            child = flatArray.find(_ => _[keyField] === child.parentId); // eslint-disable-line
         }
         return [ids, nodes];
     };

package/{lib → dist}/cjs/type.js

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

package/{lib → dist}/cjs/unique.js

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

package/{lib → dist}/cjs/url.js

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

package/{lib → dist}/cjs/validator.js

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

package/{lib → dist}/cjs/variable.js

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

package/{lib → dist}/cjs/watermark.js

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

package/{lib/es → dist/esm}/array.js

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

package/{lib/es → dist/esm}/async.js

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

package/{lib/es/we-decode.js → dist/esm/base64.js}

@@ -1,9 +1,12 @@
 /*!
- * sculp-js v1.13.0
+ * sculp-js v1.13.2
  * (c) 2023-present chandq
  * Released under the MIT License.
  */
 
+import { getGlobal } from './func.js';
+import { isNullOrUnDef } from './type.js';
+
 const b64 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=';
 // eslint-disable-next-line
 const b64re = /^(?:[A-Za-z\d+\/]{4})*?(?:[A-Za-z\d+\/]{2}(?:==)?|[A-Za-z\d+\/]{3}=?)?$/;
@@ -57,48 +60,52 @@ function weAtob(string) {
     }
     return result;
 }
-// function b64DecodeUnicode(str) {
-//   return decodeURIComponent(
-//     exports.weAtob(str).replace(/(.)/g, function (p) {
-//       let code = p.charCodeAt(0).toString(16).toUpperCase();
-//       if (code.length < 2) {
-//         code = '0' + code;
-//       }
-//       return '%' + code;
-//     })
-//   );
-// }
-// function base64_url_decode(str) {
-//   let output = str.replace(/-/g, '+').replace(/_/g, '/');
-//   switch (output.length % 4) {
-//     case 0:
-//       break;
-//     case 2:
-//       output += '==';
-//       break;
-//     case 3:
-//       output += '=';
-//       break;
-//     default:
-//       throw new Error('Illegal base64url string!');
-//   }
-//   try {
-//     return b64DecodeUnicode(output);
-//   } catch (err) {
-//     return exports.weAtob(output);
-//   }
-// }
-// export function weAppJwtDecode(token, options) {
-//   if (typeof token !== 'string') {
-//     throw new Error('Invalid token specified');
-//   }
-//   options = options || {};
-//   const pos = options.header === true ? 0 : 1;
-//   try {
-//     return JSON.parse(base64_url_decode(token.split('.')[pos]));
-//   } catch (e) {
-//     throw new Error('Invalid token specified: ' + (e as Error).message);
-//   }
-// }
+function stringToUint8Array(str) {
+    const utf8 = encodeURIComponent(str); // 将字符串转换为 UTF-8 编码
+    const uint8Array = new Uint8Array(utf8.length); // 创建 Uint8Array
+    for (let i = 0; i < utf8.length; i++) {
+        uint8Array[i] = utf8.charCodeAt(i); // 填充 Uint8Array
+    }
+    return uint8Array;
+}
+function uint8ArrayToString(uint8Array) {
+    const utf8 = String.fromCharCode.apply(null, uint8Array); // 将 Uint8Array 转为字符串
+    return decodeURIComponent(utf8); // 将 UTF-8 字符串解码回正常字符串
+}
+/**
+ * 将base64编码的字符串转换为原始字符串，包括对中文内容的处理(高性能，且支持Web、Node、小程序等任意平台)
+ * @param base64 base64编码的字符串
+ * @returns 原始字符串，包括中文内容
+ */
+function b64decode(base64) {
+    const binaryString = !isNullOrUnDef(getGlobal('atob')) ? getGlobal('atob')(base64) : weAtob(base64);
+    const len = binaryString.length;
+    const bytes = new Uint8Array(len);
+    for (let i = 0; i < len; i++) {
+        bytes[i] = binaryString.charCodeAt(i);
+    }
+    // 使用TextDecoder将Uint8Array转换为原始字符串，包括中文内容
+    return !isNullOrUnDef(getGlobal('TextDecoder'))
+        ? new (getGlobal('TextDecoder'))('utf-8').decode(bytes)
+        : uint8ArrayToString(bytes);
+}
+/**
+ * 将原始字符串，包括中文内容，转换为base64编码的字符串(高性能，且支持Web、Node、小程序等任意平台)
+ * @param rawStr 原始字符串，包括中文内容
+ * @returns base64编码的字符串
+ */
+function b64encode(rawStr) {
+    const utf8Array = !isNullOrUnDef(getGlobal('TextEncoder'))
+        ? new (getGlobal('TextEncoder'))().encode(rawStr)
+        : stringToUint8Array(rawStr);
+    // 将 Uint8Array 转换为二进制字符串
+    let binaryString = '';
+    const len = utf8Array.length;
+    for (let i = 0; i < len; i++) {
+        binaryString += String.fromCharCode(utf8Array[i]);
+    }
+    // 将二进制字符串转换为base64编码的字符串
+    return !isNullOrUnDef(getGlobal('btoa')) ? getGlobal('btoa')(binaryString) : weBtoa(binaryString);
+}
 
-export { weAtob, weBtoa };
+export { b64decode, b64encode, weAtob, weBtoa };

package/{lib/es → dist/esm}/clipboard.js

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

package/{lib/es → dist/esm}/cloneDeep.js

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

package/{lib/es → dist/esm}/cookie.js

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

package/{lib/es → dist/esm}/date.js

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

package/{lib/es → dist/esm}/dom.js

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

package/{lib/es → dist/esm}/download.js

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

package/{lib/es → dist/esm}/easing.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.13.0
+ * sculp-js v1.13.2
  * (c) 2023-present chandq
  * Released under the MIT License.
  */
@@ -15,6 +15,19 @@ const easingDefines = {
     'ease-out': [0, 0, 0.58, 1],
     'ease-in-out': [0.42, 0, 0.58, 1]
 };
+/**
+ * 设置缓存定义
+ * @param {string} name
+ * @param {EasingDefine} define
+ */
+function setEasing(name, define) {
+    easingDefines[name] = define;
+}
+function getEasing(name) {
+    if (name)
+        return easingDefines[name];
+    return easingDefines;
+}
 /**
  * 缓冲函数化，用于 js 计算缓冲进度
  * @param {EasingNameOrDefine} [name=linear]
@@ -34,5 +47,24 @@ function easingFunctional(name) {
     }
     return (input) => fn(Math.max(0, Math.min(input, 1)));
 }
+/**
+ * 缓冲字符化，用于 css 设置缓冲属性
+ * @param {EasingNameOrDefine} name
+ * @returns {string}
+ */
+function easingStringify(name) {
+    let bezierDefine;
+    if (isArray(name)) {
+        bezierDefine = name;
+    }
+    else {
+        const define = easingDefines[name];
+        if (!define) {
+            throw new Error(`${name} 缓冲函数未定义`);
+        }
+        bezierDefine = define;
+    }
+    return `cubic-bezier(${bezierDefine.join(',')})`;
+}
 
-export { easingFunctional };
+export { easingFunctional, easingStringify, getEasing, setEasing };

package/{lib/es → dist/esm}/file.js

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

package/{lib/es → dist/esm}/func.js

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

package/{lib/es → dist/esm}/index.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.13.0
+ * sculp-js v1.13.2
  * (c) 2023-present chandq
  * Released under the MIT License.
  */
@@ -26,9 +26,8 @@ export { UNIQUE_NUMBER_SAFE_LENGTH, uniqueNumber, uniqueString } from './unique.
 export { tooltipEvent } from './tooltip.js';
 export { flatTree, forEachDeep, formatTree, fuzzySearchTree, mapDeep, searchTreeById } from './tree.js';
 export { add, divide, multiply, strip, subtract } from './math.js';
-export { weAtob, weBtoa } from './we-decode.js';
-export { decodeFromBase64, encodeToBase64 } from './base64.js';
+export { b64decode, b64encode, weAtob, weBtoa } from './base64.js';
 export { EMAIL_REGEX, HTTP_URL_REGEX, IPV4_REGEX, IPV6_REGEX, PHONE_REGEX, URL_REGEX, isDigit, isEmail, isFloat, isIdNo, isInteger, isIpV4, isIpV6, isNumerical, isPhone, isUrl } from './validator.js';
 export { escapeRegExp, executeInScope, parseVarFromString, replaceVarFromString, uniqueSymbol } from './variable.js';
 export { cloneDeep } from './cloneDeep.js';
-export { isEqual } from './isEqual.js';
+export { easingFunctional, easingStringify, getEasing, setEasing } from './easing.js';

package/{lib/es → dist/esm}/math.js

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

package/{lib/es → dist/esm}/number.js

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

package/{lib/es → dist/esm}/object.js

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

package/{lib/es → dist/esm}/path.js

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

package/{lib/es → dist/esm}/qs.js

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

package/{lib/es → dist/esm}/random.js

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

package/{lib/es → dist/esm}/string.js

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

package/{lib/es → dist/esm}/tooltip.js

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