sculp-js 1.13.1 → 1.13.2

package/README.md

@@ -1,6 +1,6 @@
 [![Node.js CI](https://github.com/chandq/sculp-js/actions/workflows/node.js.yml/badge.svg)](https://github.com/chandq/sculp-js/actions/workflows/node.js.yml)
-[![sculp-js](https://img.shields.io/github/package-json/v/chandq/sculp-js?style=flat-square)](https://github.com/chandq/sculp-js)
-[![node](https://img.shields.io/badge/language-typescript-orange.svg)](https://nodejs.org/download/release/v12.0.0/)
+[![sculp-js](https://img.shields.io/github/package-json/v/chandq/sculp-js?style=flat-square)](https://www.npmjs.com/package/sculp-js)
+
 [![license:MIT](https://img.shields.io/npm/l/vue.svg?sanitize=true)](https://github.com/chandq/sculp-js/blob/main/LICENSE.md)
 [![Downloads:?](https://img.shields.io/npm/dm/sculp-js.svg?sanitize=true)](https://npmcharts.com/compare/sculp-js?minimal=true)
 [![codecov](https://codecov.io/gh/chandq/sculp-js/graph/badge.svg?token=VZ6TERPGI9)](https://codecov.io/gh/chandq/sculp-js)
@@ -45,17 +45,17 @@
 
 - Array
 
-  - arrayLike 判断类数组
-  - arrayEachAsync 异步遍历数组，可中断，支持倒序
+  - arrayEach
+  - arrayEachAsync
 
 - Tree
 
-  - forEachDeep 高性能的深度优先遍历函数, 支持continue、break，可定制id、children
-  - mapDeep 高性能的深度优先遍历的Map函数, 支持continue、break，可定制id、children
-  - searchTreeById 在树中找到 id 为某个值的节点，并返回上游的所有父级节点
-  - formatTree 高性能的数组转树函数
-  - flatTree 树转数组
-  - fuzzySearchTree 模糊搜索函数，返回包含搜索字符的节点及其祖先节点的树
+  - forEachDeep
+  - mapDeep
+  - searchTreeById
+  - formatTree
+  - flatTree
+  - fuzzySearchTree
 
 - Object
 
@@ -66,7 +66,6 @@
   - objectEachAsync
   - objectGet
   - cloneDeep
-  - isEqual
 
 - Number
 

package/dist/cjs/_virtual/_commonjsHelpers.js

@@ -0,0 +1,13 @@
+/*!
+ * sculp-js v1.13.2
+ * (c) 2023-present chandq
+ * Released under the MIT License.
+ */
+
+'use strict';
+
+function getDefaultExportFromCjs (x) {
+	return x && x.__esModule && Object.prototype.hasOwnProperty.call(x, 'default') ? x['default'] : x;
+}
+
+exports.getDefaultExportFromCjs = getDefaultExportFromCjs;

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

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

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

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

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

@@ -1,11 +1,14 @@
 /*!
- * sculp-js v1.13.1
+ * sculp-js v1.13.2
  * (c) 2023-present chandq
  * Released under the MIT License.
  */
 
 'use strict';
 
+var func = require('./func.js');
+var type = require('./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}=?)?$/;
@@ -59,49 +62,55 @@ 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 = !type.isNullOrUnDef(func.getGlobal('atob')) ? func.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 !type.isNullOrUnDef(func.getGlobal('TextDecoder'))
+        ? new (func.getGlobal('TextDecoder'))('utf-8').decode(bytes)
+        : uint8ArrayToString(bytes);
+}
+/**
+ * 将原始字符串，包括中文内容，转换为base64编码的字符串(高性能，且支持Web、Node、小程序等任意平台)
+ * @param rawStr 原始字符串，包括中文内容
+ * @returns base64编码的字符串
+ */
+function b64encode(rawStr) {
+    const utf8Array = !type.isNullOrUnDef(func.getGlobal('TextEncoder'))
+        ? new (func.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 !type.isNullOrUnDef(func.getGlobal('btoa')) ? func.getGlobal('btoa')(binaryString) : weBtoa(binaryString);
+}
 
+exports.b64decode = b64decode;
+exports.b64encode = b64encode;
 exports.weAtob = weAtob;
 exports.weBtoa = weBtoa;

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

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

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

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

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

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

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

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

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

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

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

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

package/dist/cjs/easing.js

@@ -0,0 +1,75 @@
+/*!
+ * sculp-js v1.13.2
+ * (c) 2023-present chandq
+ * Released under the MIT License.
+ */
+
+'use strict';
+
+var index = require('./node_modules/bezier-easing/src/index.js');
+var type = require('./type.js');
+
+// @ref https://cubic-bezier.com/
+const easingDefines = {
+    linear: [0, 0, 1, 1],
+    ease: [0.25, 0.1, 0.25, 1],
+    'ease-in': [0.42, 0, 1, 1],
+    '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]
+ * @returns {EasingFunction}
+ */
+function easingFunctional(name) {
+    let fn;
+    if (type.isArray(name)) {
+        fn = index.default(...name);
+    }
+    else {
+        const define = easingDefines[name];
+        if (!define) {
+            throw new Error(`${name} 缓冲函数未定义`);
+        }
+        fn = index.default(...define);
+    }
+    return (input) => fn(Math.max(0, Math.min(input, 1)));
+}
+/**
+ * 缓冲字符化，用于 css 设置缓冲属性
+ * @param {EasingNameOrDefine} name
+ * @returns {string}
+ */
+function easingStringify(name) {
+    let bezierDefine;
+    if (type.isArray(name)) {
+        bezierDefine = name;
+    }
+    else {
+        const define = easingDefines[name];
+        if (!define) {
+            throw new Error(`${name} 缓冲函数未定义`);
+        }
+        bezierDefine = define;
+    }
+    return `cubic-bezier(${bezierDefine.join(',')})`;
+}
+
+exports.easingFunctional = easingFunctional;
+exports.easingStringify = easingStringify;
+exports.getEasing = getEasing;
+exports.setEasing = setEasing;

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

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

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

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

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

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.13.1
+ * sculp-js v1.13.2
  * (c) 2023-present chandq
  * Released under the MIT License.
  */
@@ -28,12 +28,11 @@ var unique = require('./unique.js');
 var tooltip = require('./tooltip.js');
 var tree = require('./tree.js');
 var math = require('./math.js');
-var weDecode = require('./we-decode.js');
 var base64 = require('./base64.js');
 var validator = require('./validator.js');
 var variable = require('./variable.js');
 var cloneDeep = require('./cloneDeep.js');
-var isEqual = require('./isEqual.js');
+var easing = require('./easing.js');
 
 
 
@@ -154,10 +153,10 @@ exports.divide = math.divide;
 exports.multiply = math.multiply;
 exports.strip = math.strip;
 exports.subtract = math.subtract;
-exports.weAtob = weDecode.weAtob;
-exports.weBtoa = weDecode.weBtoa;
-exports.decodeFromBase64 = base64.decodeFromBase64;
-exports.encodeToBase64 = base64.encodeToBase64;
+exports.b64decode = base64.b64decode;
+exports.b64encode = base64.b64encode;
+exports.weAtob = base64.weAtob;
+exports.weBtoa = base64.weBtoa;
 exports.EMAIL_REGEX = validator.EMAIL_REGEX;
 exports.HTTP_URL_REGEX = validator.HTTP_URL_REGEX;
 exports.IPV4_REGEX = validator.IPV4_REGEX;
@@ -180,4 +179,7 @@ exports.parseVarFromString = variable.parseVarFromString;
 exports.replaceVarFromString = variable.replaceVarFromString;
 exports.uniqueSymbol = variable.uniqueSymbol;
 exports.cloneDeep = cloneDeep.cloneDeep;
-exports.isEqual = isEqual.isEqual;
+exports.easingFunctional = easing.easingFunctional;
+exports.easingStringify = easing.easingStringify;
+exports.getEasing = easing.getEasing;
+exports.setEasing = easing.setEasing;

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

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

package/dist/cjs/node_modules/bezier-easing/src/index.js

@@ -0,0 +1,123 @@
+/*!
+ * sculp-js v1.13.2
+ * (c) 2023-present chandq
+ * Released under the MIT License.
+ */
+
+'use strict';
+
+Object.defineProperty(exports, '__esModule', { value: true });
+
+var _commonjsHelpers = require('../../../_virtual/_commonjsHelpers.js');
+
+/**
+ * https://github.com/gre/bezier-easing
+ * BezierEasing - use bezier curve for transition easing function
+ * by Gaëtan Renaudeau 2014 - 2015 – MIT License
+ */
+
+// These values are established by empiricism with tests (tradeoff: performance VS precision)
+var NEWTON_ITERATIONS = 4;
+var NEWTON_MIN_SLOPE = 0.001;
+var SUBDIVISION_PRECISION = 0.0000001;
+var SUBDIVISION_MAX_ITERATIONS = 10;
+
+var kSplineTableSize = 11;
+var kSampleStepSize = 1.0 / (kSplineTableSize - 1.0);
+
+var float32ArraySupported = typeof Float32Array === 'function';
+
+function A (aA1, aA2) { return 1.0 - 3.0 * aA2 + 3.0 * aA1; }
+function B (aA1, aA2) { return 3.0 * aA2 - 6.0 * aA1; }
+function C (aA1)      { return 3.0 * aA1; }
+
+// Returns x(t) given t, x1, and x2, or y(t) given t, y1, and y2.
+function calcBezier (aT, aA1, aA2) { return ((A(aA1, aA2) * aT + B(aA1, aA2)) * aT + C(aA1)) * aT; }
+
+// Returns dx/dt given t, x1, and x2, or dy/dt given t, y1, and y2.
+function getSlope (aT, aA1, aA2) { return 3.0 * A(aA1, aA2) * aT * aT + 2.0 * B(aA1, aA2) * aT + C(aA1); }
+
+function binarySubdivide (aX, aA, aB, mX1, mX2) {
+  var currentX, currentT, i = 0;
+  do {
+    currentT = aA + (aB - aA) / 2.0;
+    currentX = calcBezier(currentT, mX1, mX2) - aX;
+    if (currentX > 0.0) {
+      aB = currentT;
+    } else {
+      aA = currentT;
+    }
+  } while (Math.abs(currentX) > SUBDIVISION_PRECISION && ++i < SUBDIVISION_MAX_ITERATIONS);
+  return currentT;
+}
+
+function newtonRaphsonIterate (aX, aGuessT, mX1, mX2) {
+ for (var i = 0; i < NEWTON_ITERATIONS; ++i) {
+   var currentSlope = getSlope(aGuessT, mX1, mX2);
+   if (currentSlope === 0.0) {
+     return aGuessT;
+   }
+   var currentX = calcBezier(aGuessT, mX1, mX2) - aX;
+   aGuessT -= currentX / currentSlope;
+ }
+ return aGuessT;
+}
+
+function LinearEasing (x) {
+  return x;
+}
+
+var src = function bezier (mX1, mY1, mX2, mY2) {
+  if (!(0 <= mX1 && mX1 <= 1 && 0 <= mX2 && mX2 <= 1)) {
+    throw new Error('bezier x values must be in [0, 1] range');
+  }
+
+  if (mX1 === mY1 && mX2 === mY2) {
+    return LinearEasing;
+  }
+
+  // Precompute samples table
+  var sampleValues = float32ArraySupported ? new Float32Array(kSplineTableSize) : new Array(kSplineTableSize);
+  for (var i = 0; i < kSplineTableSize; ++i) {
+    sampleValues[i] = calcBezier(i * kSampleStepSize, mX1, mX2);
+  }
+
+  function getTForX (aX) {
+    var intervalStart = 0.0;
+    var currentSample = 1;
+    var lastSample = kSplineTableSize - 1;
+
+    for (; currentSample !== lastSample && sampleValues[currentSample] <= aX; ++currentSample) {
+      intervalStart += kSampleStepSize;
+    }
+    --currentSample;
+
+    // Interpolate to provide an initial guess for t
+    var dist = (aX - sampleValues[currentSample]) / (sampleValues[currentSample + 1] - sampleValues[currentSample]);
+    var guessForT = intervalStart + dist * kSampleStepSize;
+
+    var initialSlope = getSlope(guessForT, mX1, mX2);
+    if (initialSlope >= NEWTON_MIN_SLOPE) {
+      return newtonRaphsonIterate(aX, guessForT, mX1, mX2);
+    } else if (initialSlope === 0.0) {
+      return guessForT;
+    } else {
+      return binarySubdivide(aX, intervalStart, intervalStart + kSampleStepSize, mX1, mX2);
+    }
+  }
+
+  return function BezierEasing (x) {
+    // Because JavaScript number are imprecise, we should guarantee the extremes are right.
+    if (x === 0) {
+      return 0;
+    }
+    if (x === 1) {
+      return 1;
+    }
+    return calcBezier(getTForX(x), mY1, mY2);
+  };
+};
+
+var bezier = /*@__PURE__*/_commonjsHelpers.getDefaultExportFromCjs(src);
+
+exports.default = bezier;

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.13.1
+ * sculp-js v1.13.2
  * (c) 2023-present chandq
  * Released under the MIT License.
  */
@@ -55,9 +55,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);
                     }
                 }
@@ -66,8 +64,6 @@ function forEachDeep(tree, iterator, options = {
                 // Process queue
                 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,9 +99,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);
                     }
                 }
@@ -117,7 +109,6 @@ function forEachDeep(tree, iterator, options = {
                     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);
                     }
                 }
@@ -175,10 +164,8 @@ function mapDeep(tree, iterator, options = {
                     continue;
                 }
                 newTree.push(object.objectOmit(re, [childField]));
-                // @ts-ignore
                 if (item && Array.isArray(item[childField])) {
                     newTree[newTree.length - 1][childField] = [];
-                    // @ts-ignore
                     walk(item[childField], item, newTree[newTree.length - 1][childField], level + 1);
                 }
                 else {
@@ -202,10 +189,8 @@ function mapDeep(tree, iterator, options = {
                     continue;
                 }
                 newTree.push(object.objectOmit(re, [childField]));
-                // @ts-ignore
                 if (item && Array.isArray(item[childField])) {
                     newTree[newTree.length - 1][childField] = [];
-                    // @ts-ignore
                     walk(item[childField], item, newTree[newTree.length - 1][childField], level + 1);
                 }
                 else {

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

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.13.1
+ * 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.1
+ * sculp-js v1.13.2
  * (c) 2023-present chandq
  * Released under the MIT License.
  */