sculp-js 1.3.1 → 1.4.0

package/README.md

@@ -34,8 +34,8 @@
   - forEachDeep 高性能的深度优先遍历函数, 支持continue、break，可定制id、children
   - forEachMap 高性能的深度优先遍历的Map函数, 支持continue、break，可定制id、children
   - searchTreeById 在树中找到 id 为某个值的节点，并返回上游的所有父级节点
-  - buildTree 根据 id 与 parentId 从对象数组中构建对应的树
   - formatTree 高性能的数组转树函数
+  - fuzzySearchTree 模糊搜索函数，返回包含搜索字符的节点及其祖先节点的树
 
 - Object
 
@@ -54,7 +54,7 @@
 
   - stringCamelCase
   - stringKebabCase
-  - getStrWidthPx
+  - getStrWidthPx (web)
 
 - Unique
 
@@ -69,18 +69,19 @@
   - calculateDate
   - calculateDateTime
 
-- Download
+- Download (web)
 
   - downloadURL
   - downloadHref
   - downloadBlob
   - downloadData
 
-- File
+- File (web)
 
   - chooseLocalFile
+  - compressImg 压缩图片
 
-- Dom
+- Dom （web）
 
   - hasClass
   - addClass
@@ -89,11 +90,11 @@
   - getStyle
   - getComputedCssVal
 
-- Watermark
+- Watermark (web)
 
   - genCanvasWM
 
-- Clipboard
+- Clipboard (web)
   - copyText
 
 ## Install

package/lib/cjs/array.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */

package/lib/cjs/async.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */

package/lib/cjs/clipboard.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */

package/lib/cjs/cookie.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */

package/lib/cjs/date.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */
@@ -163,64 +163,50 @@ function formatDate(value, format = 'YYYY-MM-DD HH:mm:ss') {
 }
 /**
  * 计算向前或向后N天的具体日期
- * @param {string} strDate - 参考日期
+ * @param {DateValue} originDate - 参考日期
  * @param {number} n - 正数：向后推算；负数：向前推算
  * @param {string} sep - 日期格式的分隔符
  * @returns {string} 计算后的目标日期
  */
-function calculateDate(strDate, n, sep = '-') {
-    //strDate 为字符串日期 如:'2019-01-01' n为你要传入的参数，当前为0，前一天为-1，后一天为1
-    const dateArr = strDate.split(sep); //这边给定一个特定时间
-    const newDate = new Date(+dateArr[0], +dateArr[1] - 1, +dateArr[2]);
-    const befminuts = newDate.getTime() + 1000 * 60 * 60 * 24 * parseInt(String(n)); //计算前几天用减，计算后几天用加，最后一个就是多少天的数量
-    const beforeDat = new Date();
-    beforeDat.setTime(befminuts);
-    const befMonth = beforeDat.getMonth() + 1;
-    const mon = befMonth >= 10 ? befMonth : '0' + befMonth;
-    const befDate = beforeDat.getDate();
-    const da = befDate >= 10 ? befDate : '0' + befDate;
-    const finalNewDate = beforeDat.getFullYear() + '-' + mon + '-' + da;
+function calculateDate(originDate, n, sep = '-') {
+    //originDate 为字符串日期 如:'2019-01-01' n为你要传入的参数，当前为0，前一天为-1，后一天为1
+    const date = new Date(originDate); //这边给定一个特定时间
+    const newDate = new Date(date.getFullYear(), date.getMonth(), date.getDate());
+    const millisecondGap = newDate.getTime() + 1000 * 60 * 60 * 24 * parseInt(String(n)); //计算前几天用减，计算后几天用加，最后一个就是多少天的数量
+    const targetDate = new Date(millisecondGap);
+    const finalNewDate = targetDate.getFullYear() +
+        sep +
+        String(targetDate.getMonth() + 1).padStart(2, '0') +
+        '-' +
+        String(targetDate.getDate()).padStart(2, '0');
     return finalNewDate;
 }
 /**
- * 计算向前或向后N天的具体时间日期
+ * 计算向前或向后N天的具体日期时间
+ * @param {DateValue} originDateTime - 参考日期时间
  * @param {number} n - 正数：向后推算；负数：向前推算
  * @param {string} dateSep - 日期分隔符
  * @param {string} timeSep - 时间分隔符
  * @returns {string} 转换后的目标日期时间
  */
-function calculateDateTime(n, dateSep = '-', timeSep = ':') {
-    const date = new Date();
-    const separator1 = '-';
-    const separator2 = ':';
-    let year = date.getFullYear();
-    let month = date.getMonth() + 1;
-    let strDate = date.getDate() + n;
-    if (strDate > new Date(year, month, 0).getDate()) {
-        month += 1;
-        strDate -= new Date(year, month, 0).getDate();
-        if (month > 12) {
-            year += 1;
-            month = 1;
-        }
-    }
-    if (month >= 1 && month <= 9) {
-        month = '0' + month;
-    }
-    if (strDate >= 0 && strDate <= 9) {
-        strDate = '0' + strDate;
-    }
-    return (year +
+function calculateDateTime(originDateTime, n, dateSep = '-', timeSep = ':') {
+    const date = new Date(originDateTime);
+    const separator1 = dateSep;
+    const separator2 = timeSep;
+    const dateTime = new Date(date.getFullYear(), date.getMonth(), date.getDate(), date.getHours(), date.getMinutes(), date.getSeconds());
+    const millisecondGap = dateTime.getTime() + 1000 * 60 * 60 * 24 * parseInt(String(n)); //计算前几天用减，计算后几天用加，最后一个就是多少天的数量
+    const targetDateTime = new Date(millisecondGap);
+    return (targetDateTime.getFullYear() +
         separator1 +
-        month +
+        String(targetDateTime.getMonth() + 1).padStart(2, '0') +
         separator1 +
-        strDate +
+        String(targetDateTime.getDate()).padStart(2, '0') +
         ' ' +
-        date.getHours() +
+        String(targetDateTime.getHours()).padStart(2, '0') +
         separator2 +
-        date.getMinutes() +
+        String(targetDateTime.getMinutes()).padStart(2, '0') +
         separator2 +
-        date.getSeconds());
+        String(targetDateTime.getSeconds()).padStart(2, '0'));
 }
 
 exports.calculateDate = calculateDate;

package/lib/cjs/dom.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */

package/lib/cjs/download.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */

package/lib/cjs/easing.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */

package/lib/cjs/file.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */

package/lib/cjs/func.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */

package/lib/cjs/index.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */
@@ -131,9 +131,11 @@ exports.uniqueNumber = unique.uniqueNumber;
 exports.uniqueString = unique.uniqueString;
 exports.tooltipEvent = tooltip.tooltipEvent;
 exports.buildTree = tree.buildTree;
+exports.flatTree = tree.flatTree;
 exports.forEachDeep = tree.forEachDeep;
 exports.forEachMap = tree.forEachMap;
 exports.formatTree = tree.formatTree;
+exports.fuzzySearchTree = tree.fuzzySearchTree;
 exports.searchTreeById = tree.searchTreeById;
 exports.weAppJwtDecode = weDecode.weAppJwtDecode;
 exports.weAtob = weDecode.weAtob;

package/lib/cjs/number.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */

package/lib/cjs/object.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */

package/lib/cjs/path.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */

package/lib/cjs/qs.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */

package/lib/cjs/random.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */

package/lib/cjs/string.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */

package/lib/cjs/tooltip.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */

package/lib/cjs/tree.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */
@@ -7,6 +7,11 @@
 'use strict';
 
 const defaultFieldOptions = { keyField: 'key', childField: 'children', pidField: 'pid' };
+const defaultSearchTreeOptions = {
+    childField: 'children',
+    nameField: 'name',
+    ignoreEmptyChild: false
+};
 /**
  * 深度优先遍历函数(支持continue和break操作), 可用于insert tree item 和 remove tree item
  * @param {ArrayLike<V>} tree  树形数据
@@ -70,9 +75,9 @@ function forEachDeep(tree, iterator, children = 'children', isReverse = false) {
  * @returns {any[]} 新的一棵树
  */
 function forEachMap(tree, iterator, children = 'children', isReverse = false) {
-    let level = 0, isBreak = false;
+    let isBreak = false;
     const newTree = [];
-    const walk = (arr, parent, newTree) => {
+    const walk = (arr, parent, newTree, level = 0) => {
         if (isReverse) {
             for (let i = arr.length - 1; i >= 0; i--) {
                 if (isBreak) {
@@ -89,10 +94,9 @@ function forEachMap(tree, iterator, children = 'children', isReverse = false) {
                 newTree.push(re);
                 // @ts-ignore
                 if (arr[i] && Array.isArray(arr[i][children])) {
-                    ++level;
                     newTree[newTree.length - 1][children] = [];
                     // @ts-ignore
-                    walk(arr[i][children], arr[i], newTree[newTree.length - 1][children]);
+                    walk(arr[i][children], arr[i], newTree[newTree.length - 1][children], level + 1);
                 }
                 else {
                     // children非有效数组时，移除该属性字段
@@ -116,10 +120,9 @@ function forEachMap(tree, iterator, children = 'children', isReverse = false) {
                 newTree.push(re);
                 // @ts-ignore
                 if (arr[i] && Array.isArray(arr[i][children])) {
-                    ++level;
                     newTree[newTree.length - 1][children] = [];
                     // @ts-ignore
-                    walk(arr[i][children], arr[i], newTree[newTree.length - 1][children]);
+                    walk(arr[i][children], arr[i], newTree[newTree.length - 1][children], level + 1);
                 }
                 else {
                     // children非有效数组时，移除该属性字段
@@ -273,9 +276,83 @@ function formatTree(list, options = defaultFieldOptions) {
     });
     return treeArr;
 }
+/**
+ * 树形结构转扁平化
+ * @param {any} treeList
+ * @param {IFieldOptions} options
+ * @return {*}
+ */
+function flatTree(treeList, options = defaultFieldOptions) {
+    const { childField, keyField, pidField } = options;
+    return treeList.reduce((res, node) => {
+        const item = {
+            ...node,
+            [childField]: [] // 清空子级
+        };
+        item.hasOwnProperty([childField]) && delete item[childField];
+        res.push(item);
+        if (node[childField]) {
+            const children = node[childField].map(item => ({
+                ...item,
+                [pidField]: node[keyField] || item.pid // 给子级设置pid
+            }));
+            res = res.concat(flatTree(children, options));
+        }
+        return res;
+    }, []);
+}
+/**
+ * 模糊搜索函数，返回包含搜索字符的节点及其祖先节点, 适用于树型组件的字符过滤功能
+ * @param {any[]} nodes
+ * @param {string} query
+ * @param {ISearchTreeOpts} options
+ * @return {any[]}
+ */
+function fuzzySearchTree(nodes, query, options = defaultSearchTreeOptions) {
+    const result = [];
+    for (const node of nodes) {
+        // 递归检查子节点是否匹配
+        const matchedChildren = node[options.childField] && node[options.childField].length > 0
+            ? fuzzySearchTree(node[options.childField] || [], query, options)
+            : [];
+        // 检查当前节点是否匹配或者有匹配的子节点
+        if (node[options.nameField].toLowerCase().includes(query.toLowerCase()) || matchedChildren.length > 0) {
+            // 将当前节点加入结果中
+            if (node[options.childField]) {
+                if (matchedChildren.length > 0) {
+                    result.push({
+                        ...node,
+                        [options.childField]: matchedChildren // 包含匹配的子节点
+                    });
+                }
+                else if (options.ignoreEmptyChild) {
+                    node[options.childField] && delete node[options.childField];
+                    result.push({
+                        ...node
+                    });
+                }
+                else {
+                    result.push({
+                        ...node,
+                        ...{ [options.childField]: [] }
+                    });
+                }
+            }
+            else {
+                node[options.childField] && delete node[options.childField];
+                result.push({
+                    ...node
+                });
+            }
+        }
+    }
+    return result;
+}
 
 exports.buildTree = buildTree;
+exports.flatTree = flatTree;
 exports.forEachDeep = forEachDeep;
 exports.forEachMap = forEachMap;
 exports.formatTree = formatTree;
+exports.fuzzySearchTree = fuzzySearchTree;
 exports.searchTreeById = searchTreeById;

package/lib/cjs/type.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */

package/lib/cjs/unique.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */

package/lib/cjs/url.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */

package/lib/cjs/watermark.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */

package/lib/cjs/we-decode.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */

package/lib/es/array.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */

package/lib/es/async.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */

package/lib/es/clipboard.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */

package/lib/es/cookie.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */

package/lib/es/date.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */
@@ -161,64 +161,50 @@ function formatDate(value, format = 'YYYY-MM-DD HH:mm:ss') {
 }
 /**
  * 计算向前或向后N天的具体日期
- * @param {string} strDate - 参考日期
+ * @param {DateValue} originDate - 参考日期
  * @param {number} n - 正数：向后推算；负数：向前推算
  * @param {string} sep - 日期格式的分隔符
  * @returns {string} 计算后的目标日期
  */
-function calculateDate(strDate, n, sep = '-') {
-    //strDate 为字符串日期 如:'2019-01-01' n为你要传入的参数，当前为0，前一天为-1，后一天为1
-    const dateArr = strDate.split(sep); //这边给定一个特定时间
-    const newDate = new Date(+dateArr[0], +dateArr[1] - 1, +dateArr[2]);
-    const befminuts = newDate.getTime() + 1000 * 60 * 60 * 24 * parseInt(String(n)); //计算前几天用减，计算后几天用加，最后一个就是多少天的数量
-    const beforeDat = new Date();
-    beforeDat.setTime(befminuts);
-    const befMonth = beforeDat.getMonth() + 1;
-    const mon = befMonth >= 10 ? befMonth : '0' + befMonth;
-    const befDate = beforeDat.getDate();
-    const da = befDate >= 10 ? befDate : '0' + befDate;
-    const finalNewDate = beforeDat.getFullYear() + '-' + mon + '-' + da;
+function calculateDate(originDate, n, sep = '-') {
+    //originDate 为字符串日期 如:'2019-01-01' n为你要传入的参数，当前为0，前一天为-1，后一天为1
+    const date = new Date(originDate); //这边给定一个特定时间
+    const newDate = new Date(date.getFullYear(), date.getMonth(), date.getDate());
+    const millisecondGap = newDate.getTime() + 1000 * 60 * 60 * 24 * parseInt(String(n)); //计算前几天用减，计算后几天用加，最后一个就是多少天的数量
+    const targetDate = new Date(millisecondGap);
+    const finalNewDate = targetDate.getFullYear() +
+        sep +
+        String(targetDate.getMonth() + 1).padStart(2, '0') +
+        '-' +
+        String(targetDate.getDate()).padStart(2, '0');
     return finalNewDate;
 }
 /**
- * 计算向前或向后N天的具体时间日期
+ * 计算向前或向后N天的具体日期时间
+ * @param {DateValue} originDateTime - 参考日期时间
  * @param {number} n - 正数：向后推算；负数：向前推算
  * @param {string} dateSep - 日期分隔符
  * @param {string} timeSep - 时间分隔符
  * @returns {string} 转换后的目标日期时间
  */
-function calculateDateTime(n, dateSep = '-', timeSep = ':') {
-    const date = new Date();
-    const separator1 = '-';
-    const separator2 = ':';
-    let year = date.getFullYear();
-    let month = date.getMonth() + 1;
-    let strDate = date.getDate() + n;
-    if (strDate > new Date(year, month, 0).getDate()) {
-        month += 1;
-        strDate -= new Date(year, month, 0).getDate();
-        if (month > 12) {
-            year += 1;
-            month = 1;
-        }
-    }
-    if (month >= 1 && month <= 9) {
-        month = '0' + month;
-    }
-    if (strDate >= 0 && strDate <= 9) {
-        strDate = '0' + strDate;
-    }
-    return (year +
+function calculateDateTime(originDateTime, n, dateSep = '-', timeSep = ':') {
+    const date = new Date(originDateTime);
+    const separator1 = dateSep;
+    const separator2 = timeSep;
+    const dateTime = new Date(date.getFullYear(), date.getMonth(), date.getDate(), date.getHours(), date.getMinutes(), date.getSeconds());
+    const millisecondGap = dateTime.getTime() + 1000 * 60 * 60 * 24 * parseInt(String(n)); //计算前几天用减，计算后几天用加，最后一个就是多少天的数量
+    const targetDateTime = new Date(millisecondGap);
+    return (targetDateTime.getFullYear() +
         separator1 +
-        month +
+        String(targetDateTime.getMonth() + 1).padStart(2, '0') +
         separator1 +
-        strDate +
+        String(targetDateTime.getDate()).padStart(2, '0') +
         ' ' +
-        date.getHours() +
+        String(targetDateTime.getHours()).padStart(2, '0') +
         separator2 +
-        date.getMinutes() +
+        String(targetDateTime.getMinutes()).padStart(2, '0') +
         separator2 +
-        date.getSeconds());
+        String(targetDateTime.getSeconds()).padStart(2, '0'));
 }
 
 export { calculateDate, calculateDateTime, dateParse, dateToEnd, dateToStart, formatDate, isValidDate };

package/lib/es/dom.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */

package/lib/es/download.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */

package/lib/es/easing.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */

package/lib/es/file.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */

package/lib/es/func.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */

package/lib/es/index.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */
@@ -24,5 +24,5 @@ export { STRING_POOL, randomNumber, randomString, randomUuid } from './random.js
 export { HEX_POOL, formatNumber, numberAbbr, numberToHex } from './number.js';
 export { UNIQUE_NUMBER_SAFE_LENGTH, uniqueNumber, uniqueString } from './unique.js';
 export { tooltipEvent } from './tooltip.js';
-export { buildTree, forEachDeep, forEachMap, formatTree, searchTreeById } from './tree.js';
+export { buildTree, flatTree, forEachDeep, forEachMap, formatTree, fuzzySearchTree, searchTreeById } from './tree.js';
 export { weAppJwtDecode, weAtob, weBtoa } from './we-decode.js';

package/lib/es/number.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */

package/lib/es/object.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */

package/lib/es/path.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */

package/lib/es/qs.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */

package/lib/es/random.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */

package/lib/es/string.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */

package/lib/es/tooltip.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */

package/lib/es/tree.js

@@ -1,10 +1,15 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */
 
 const defaultFieldOptions = { keyField: 'key', childField: 'children', pidField: 'pid' };
+const defaultSearchTreeOptions = {
+    childField: 'children',
+    nameField: 'name',
+    ignoreEmptyChild: false
+};
 /**
  * 深度优先遍历函数(支持continue和break操作), 可用于insert tree item 和 remove tree item
  * @param {ArrayLike<V>} tree  树形数据
@@ -68,9 +73,9 @@ function forEachDeep(tree, iterator, children = 'children', isReverse = false) {
  * @returns {any[]} 新的一棵树
  */
 function forEachMap(tree, iterator, children = 'children', isReverse = false) {
-    let level = 0, isBreak = false;
+    let isBreak = false;
     const newTree = [];
-    const walk = (arr, parent, newTree) => {
+    const walk = (arr, parent, newTree, level = 0) => {
         if (isReverse) {
             for (let i = arr.length - 1; i >= 0; i--) {
                 if (isBreak) {
@@ -87,10 +92,9 @@ function forEachMap(tree, iterator, children = 'children', isReverse = false) {
                 newTree.push(re);
                 // @ts-ignore
                 if (arr[i] && Array.isArray(arr[i][children])) {
-                    ++level;
                     newTree[newTree.length - 1][children] = [];
                     // @ts-ignore
-                    walk(arr[i][children], arr[i], newTree[newTree.length - 1][children]);
+                    walk(arr[i][children], arr[i], newTree[newTree.length - 1][children], level + 1);
                 }
                 else {
                     // children非有效数组时，移除该属性字段
@@ -114,10 +118,9 @@ function forEachMap(tree, iterator, children = 'children', isReverse = false) {
                 newTree.push(re);
                 // @ts-ignore
                 if (arr[i] && Array.isArray(arr[i][children])) {
-                    ++level;
                     newTree[newTree.length - 1][children] = [];
                     // @ts-ignore
-                    walk(arr[i][children], arr[i], newTree[newTree.length - 1][children]);
+                    walk(arr[i][children], arr[i], newTree[newTree.length - 1][children], level + 1);
                 }
                 else {
                     // children非有效数组时，移除该属性字段
@@ -271,5 +274,77 @@ function formatTree(list, options = defaultFieldOptions) {
     });
     return treeArr;
 }
+/**
+ * 树形结构转扁平化
+ * @param {any} treeList
+ * @param {IFieldOptions} options
+ * @return {*}
+ */
+function flatTree(treeList, options = defaultFieldOptions) {
+    const { childField, keyField, pidField } = options;
+    return treeList.reduce((res, node) => {
+        const item = {
+            ...node,
+            [childField]: [] // 清空子级
+        };
+        item.hasOwnProperty([childField]) && delete item[childField];
+        res.push(item);
+        if (node[childField]) {
+            const children = node[childField].map(item => ({
+                ...item,
+                [pidField]: node[keyField] || item.pid // 给子级设置pid
+            }));
+            res = res.concat(flatTree(children, options));
+        }
+        return res;
+    }, []);
+}
+/**
+ * 模糊搜索函数，返回包含搜索字符的节点及其祖先节点, 适用于树型组件的字符过滤功能
+ * @param {any[]} nodes
+ * @param {string} query
+ * @param {ISearchTreeOpts} options
+ * @return {any[]}
+ */
+function fuzzySearchTree(nodes, query, options = defaultSearchTreeOptions) {
+    const result = [];
+    for (const node of nodes) {
+        // 递归检查子节点是否匹配
+        const matchedChildren = node[options.childField] && node[options.childField].length > 0
+            ? fuzzySearchTree(node[options.childField] || [], query, options)
+            : [];
+        // 检查当前节点是否匹配或者有匹配的子节点
+        if (node[options.nameField].toLowerCase().includes(query.toLowerCase()) || matchedChildren.length > 0) {
+            // 将当前节点加入结果中
+            if (node[options.childField]) {
+                if (matchedChildren.length > 0) {
+                    result.push({
+                        ...node,
+                        [options.childField]: matchedChildren // 包含匹配的子节点
+                    });
+                }
+                else if (options.ignoreEmptyChild) {
+                    node[options.childField] && delete node[options.childField];
+                    result.push({
+                        ...node
+                    });
+                }
+                else {
+                    result.push({
+                        ...node,
+                        ...{ [options.childField]: [] }
+                    });
+                }
+            }
+            else {
+                node[options.childField] && delete node[options.childField];
+                result.push({
+                    ...node
+                });
+            }
+        }
+    }
+    return result;
+}
 
-export { buildTree, forEachDeep, forEachMap, formatTree, searchTreeById };
+export { buildTree, flatTree, forEachDeep, forEachMap, formatTree, fuzzySearchTree, searchTreeById };

package/lib/es/type.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */

package/lib/es/unique.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */

package/lib/es/url.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */

package/lib/es/watermark.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */

package/lib/es/we-decode.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */

package/lib/index.d.ts

@@ -160,20 +160,21 @@ declare function dateToEnd(value: DateValue): Date;
 declare function formatDate(value: DateValue, format?: string): string;
 /**
  * 计算向前或向后N天的具体日期
- * @param {string} strDate - 参考日期
+ * @param {DateValue} originDate - 参考日期
  * @param {number} n - 正数：向后推算；负数：向前推算
  * @param {string} sep - 日期格式的分隔符
  * @returns {string} 计算后的目标日期
  */
-declare function calculateDate(strDate: string, n: number, sep?: string): string;
+declare function calculateDate(originDate: DateValue, n: number, sep?: string): string;
 /**
- * 计算向前或向后N天的具体时间日期
+ * 计算向前或向后N天的具体日期时间
+ * @param {DateValue} originDateTime - 参考日期时间
  * @param {number} n - 正数：向后推算；负数：向前推算
  * @param {string} dateSep - 日期分隔符
  * @param {string} timeSep - 时间分隔符
  * @returns {string} 转换后的目标日期时间
  */
-declare function calculateDateTime(n: number, dateSep?: string, timeSep?: string): string;
+declare function calculateDateTime(originDateTime: DateValue, n: number, dateSep?: string, timeSep?: string): string;
 
 type EasingName = 'ease' | 'linear' | 'ease-in' | 'ease-out' | 'ease-in-out' | string;
 
@@ -708,6 +709,11 @@ interface IFieldOptions {
     childField: string;
     pidField: string;
 }
+interface ISearchTreeOpts {
+    childField: string;
+    nameField: string;
+    ignoreEmptyChild: boolean;
+}
 /**
  * 深度优先遍历函数(支持continue和break操作), 可用于insert tree item 和 remove tree item
  * @param {ArrayLike<V>} tree  树形数据
@@ -786,6 +792,21 @@ declare function buildTree<ID extends string, PID extends string, T extends {
  * @returns {any[]}
  */
 declare function formatTree(list: any[], options?: IFieldOptions): any[];
+/**
+ * 树形结构转扁平化
+ * @param {any} treeList
+ * @param {IFieldOptions} options
+ * @return {*}
+ */
+declare function flatTree(treeList: any[], options?: IFieldOptions): any[];
+/**
+ * 模糊搜索函数，返回包含搜索字符的节点及其祖先节点, 适用于树型组件的字符过滤功能
+ * @param {any[]} nodes
+ * @param {string} query
+ * @param {ISearchTreeOpts} options
+ * @return {any[]}
+ */
+declare function fuzzySearchTree(nodes: any[], query: string, options?: ISearchTreeOpts): any[];
 
 /**
  * 字符串编码成Base64 （适用于任何环境，包括小程序）
@@ -801,4 +822,4 @@ declare function weBtoa(string: string): string;
 declare function weAtob(string: string): string;
 declare function weAppJwtDecode(token: any, options: any): any;
 
-export { type AnyArray, type AnyFunc, type AnyObject, type ArrayElements, type DateObj, type DateValue, type DebounceFunc, type FileType, HEX_POOL, type ICanvasWM, type ICompressOptions, type IFieldOptions, type ITreeConf, type IdLike, type LooseParamValue, type LooseParams, type ObjectAssignItem, type OnceFunc, type Params, type PartialDeep, type RandomString, type ReadyCallback, type Replacer, STRING_ARABIC_NUMERALS, STRING_LOWERCASE_ALPHA, STRING_POOL, STRING_UPPERCASE_ALPHA, type SetStyle, type SmoothScrollOptions, type Style, type ThrottleFunc, UNIQUE_NUMBER_SAFE_LENGTH, type UniqueString, type Url, type WithChildren, addClass, arrayEach, arrayEachAsync, arrayInsertBefore, arrayLike, arrayRemove, asyncMap, buildTree, calculateDate, calculateDateTime, chooseLocalFile, cloneDeep, compressImg, cookieDel, cookieGet, cookieSet, copyText, dateParse, dateToEnd, dateToStart, debounce, downloadBlob, downloadData, downloadHref, downloadURL, forEachDeep, forEachMap, formatDate, formatNumber, formatTree, genCanvasWM, getComputedCssVal, getGlobal, getStrWidthPx, getStyle, hasClass, isArray, isBigInt, isBoolean, isDate, isDomReady, isError, isFunction, isNaN, isNull, isNullOrUnDef, isNumber, isObject, isPlainObject, isPrimitive, isRegExp, isString, isSymbol, isUndefined, isValidDate, numberAbbr, numberToHex, objectAssign, objectEach, objectEachAsync, objectFill, objectGet, objectHas, objectMap, objectAssign as objectMerge, objectOmit, objectPick, onDomReady, once, pathJoin, pathNormalize, qsParse, qsStringify, randomNumber, randomString, randomUuid, removeClass, searchTreeById, setGlobal, setStyle, smoothScroll, stringAssign, stringCamelCase, stringEscapeHtml, stringFill, stringFormat, stringKebabCase, supportCanvas, throttle, tooltipEvent, typeIs, uniqueNumber, uniqueString, urlDelParams, urlParse, urlSetParams, urlStringify, wait, weAppJwtDecode, weAtob, weBtoa };
+export { type AnyArray, type AnyFunc, type AnyObject, type ArrayElements, type DateObj, type DateValue, type DebounceFunc, type FileType, HEX_POOL, type ICanvasWM, type ICompressOptions, type IFieldOptions, type ISearchTreeOpts, type ITreeConf, type IdLike, type LooseParamValue, type LooseParams, type ObjectAssignItem, type OnceFunc, type Params, type PartialDeep, type RandomString, type ReadyCallback, type Replacer, STRING_ARABIC_NUMERALS, STRING_LOWERCASE_ALPHA, STRING_POOL, STRING_UPPERCASE_ALPHA, type SetStyle, type SmoothScrollOptions, type Style, type ThrottleFunc, UNIQUE_NUMBER_SAFE_LENGTH, type UniqueString, type Url, type WithChildren, addClass, arrayEach, arrayEachAsync, arrayInsertBefore, arrayLike, arrayRemove, asyncMap, buildTree, calculateDate, calculateDateTime, chooseLocalFile, cloneDeep, compressImg, cookieDel, cookieGet, cookieSet, copyText, dateParse, dateToEnd, dateToStart, debounce, downloadBlob, downloadData, downloadHref, downloadURL, flatTree, forEachDeep, forEachMap, formatDate, formatNumber, formatTree, fuzzySearchTree, genCanvasWM, getComputedCssVal, getGlobal, getStrWidthPx, getStyle, hasClass, isArray, isBigInt, isBoolean, isDate, isDomReady, isError, isFunction, isNaN, isNull, isNullOrUnDef, isNumber, isObject, isPlainObject, isPrimitive, isRegExp, isString, isSymbol, isUndefined, isValidDate, numberAbbr, numberToHex, objectAssign, objectEach, objectEachAsync, objectFill, objectGet, objectHas, objectMap, objectAssign as objectMerge, objectOmit, objectPick, onDomReady, once, pathJoin, pathNormalize, qsParse, qsStringify, randomNumber, randomString, randomUuid, removeClass, searchTreeById, setGlobal, setStyle, smoothScroll, stringAssign, stringCamelCase, stringEscapeHtml, stringFill, stringFormat, stringKebabCase, supportCanvas, throttle, tooltipEvent, typeIs, uniqueNumber, uniqueString, urlDelParams, urlParse, urlSetParams, urlStringify, wait, weAppJwtDecode, weAtob, weBtoa };

package/lib/umd/index.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.3.0
+ * sculp-js v1.4.0
  * (c) 2023-2024 chandq
  * Released under the MIT License.
  */
@@ -913,64 +913,50 @@
     }
     /**
      * 计算向前或向后N天的具体日期
-     * @param {string} strDate - 参考日期
+     * @param {DateValue} originDate - 参考日期
      * @param {number} n - 正数：向后推算；负数：向前推算
      * @param {string} sep - 日期格式的分隔符
      * @returns {string} 计算后的目标日期
      */
-    function calculateDate(strDate, n, sep = '-') {
-        //strDate 为字符串日期 如:'2019-01-01' n为你要传入的参数，当前为0，前一天为-1，后一天为1
-        const dateArr = strDate.split(sep); //这边给定一个特定时间
-        const newDate = new Date(+dateArr[0], +dateArr[1] - 1, +dateArr[2]);
-        const befminuts = newDate.getTime() + 1000 * 60 * 60 * 24 * parseInt(String(n)); //计算前几天用减，计算后几天用加，最后一个就是多少天的数量
-        const beforeDat = new Date();
-        beforeDat.setTime(befminuts);
-        const befMonth = beforeDat.getMonth() + 1;
-        const mon = befMonth >= 10 ? befMonth : '0' + befMonth;
-        const befDate = beforeDat.getDate();
-        const da = befDate >= 10 ? befDate : '0' + befDate;
-        const finalNewDate = beforeDat.getFullYear() + '-' + mon + '-' + da;
+    function calculateDate(originDate, n, sep = '-') {
+        //originDate 为字符串日期 如:'2019-01-01' n为你要传入的参数，当前为0，前一天为-1，后一天为1
+        const date = new Date(originDate); //这边给定一个特定时间
+        const newDate = new Date(date.getFullYear(), date.getMonth(), date.getDate());
+        const millisecondGap = newDate.getTime() + 1000 * 60 * 60 * 24 * parseInt(String(n)); //计算前几天用减，计算后几天用加，最后一个就是多少天的数量
+        const targetDate = new Date(millisecondGap);
+        const finalNewDate = targetDate.getFullYear() +
+            sep +
+            String(targetDate.getMonth() + 1).padStart(2, '0') +
+            '-' +
+            String(targetDate.getDate()).padStart(2, '0');
         return finalNewDate;
     }
     /**
-     * 计算向前或向后N天的具体时间日期
+     * 计算向前或向后N天的具体日期时间
+     * @param {DateValue} originDateTime - 参考日期时间
      * @param {number} n - 正数：向后推算；负数：向前推算
      * @param {string} dateSep - 日期分隔符
      * @param {string} timeSep - 时间分隔符
      * @returns {string} 转换后的目标日期时间
      */
-    function calculateDateTime(n, dateSep = '-', timeSep = ':') {
-        const date = new Date();
-        const separator1 = '-';
-        const separator2 = ':';
-        let year = date.getFullYear();
-        let month = date.getMonth() + 1;
-        let strDate = date.getDate() + n;
-        if (strDate > new Date(year, month, 0).getDate()) {
-            month += 1;
-            strDate -= new Date(year, month, 0).getDate();
-            if (month > 12) {
-                year += 1;
-                month = 1;
-            }
-        }
-        if (month >= 1 && month <= 9) {
-            month = '0' + month;
-        }
-        if (strDate >= 0 && strDate <= 9) {
-            strDate = '0' + strDate;
-        }
-        return (year +
+    function calculateDateTime(originDateTime, n, dateSep = '-', timeSep = ':') {
+        const date = new Date(originDateTime);
+        const separator1 = dateSep;
+        const separator2 = timeSep;
+        const dateTime = new Date(date.getFullYear(), date.getMonth(), date.getDate(), date.getHours(), date.getMinutes(), date.getSeconds());
+        const millisecondGap = dateTime.getTime() + 1000 * 60 * 60 * 24 * parseInt(String(n)); //计算前几天用减，计算后几天用加，最后一个就是多少天的数量
+        const targetDateTime = new Date(millisecondGap);
+        return (targetDateTime.getFullYear() +
             separator1 +
-            month +
+            String(targetDateTime.getMonth() + 1).padStart(2, '0') +
             separator1 +
-            strDate +
+            String(targetDateTime.getDate()).padStart(2, '0') +
             ' ' +
-            date.getHours() +
+            String(targetDateTime.getHours()).padStart(2, '0') +
             separator2 +
-            date.getMinutes() +
+            String(targetDateTime.getMinutes()).padStart(2, '0') +
             separator2 +
-            date.getSeconds());
+            String(targetDateTime.getSeconds()).padStart(2, '0'));
     }
 
     /**
@@ -2043,6 +2029,11 @@
     const tooltipEvent = { handleMouseEnter, handleMouseLeave };
 
     const defaultFieldOptions = { keyField: 'key', childField: 'children', pidField: 'pid' };
+    const defaultSearchTreeOptions = {
+        childField: 'children',
+        nameField: 'name',
+        ignoreEmptyChild: false
+    };
     /**
      * 深度优先遍历函数(支持continue和break操作), 可用于insert tree item 和 remove tree item
      * @param {ArrayLike<V>} tree  树形数据
@@ -2106,9 +2097,9 @@
      * @returns {any[]} 新的一棵树
      */
     function forEachMap(tree, iterator, children = 'children', isReverse = false) {
-        let level = 0, isBreak = false;
+        let isBreak = false;
         const newTree = [];
-        const walk = (arr, parent, newTree) => {
+        const walk = (arr, parent, newTree, level = 0) => {
             if (isReverse) {
                 for (let i = arr.length - 1; i >= 0; i--) {
                     if (isBreak) {
@@ -2125,10 +2116,9 @@
                     newTree.push(re);
                     // @ts-ignore
                     if (arr[i] && Array.isArray(arr[i][children])) {
-                        ++level;
                         newTree[newTree.length - 1][children] = [];
                         // @ts-ignore
-                        walk(arr[i][children], arr[i], newTree[newTree.length - 1][children]);
+                        walk(arr[i][children], arr[i], newTree[newTree.length - 1][children], level + 1);
                     }
                     else {
                         // children非有效数组时，移除该属性字段
@@ -2152,10 +2142,9 @@
                     newTree.push(re);
                     // @ts-ignore
                     if (arr[i] && Array.isArray(arr[i][children])) {
-                        ++level;
                         newTree[newTree.length - 1][children] = [];
                         // @ts-ignore
-                        walk(arr[i][children], arr[i], newTree[newTree.length - 1][children]);
+                        walk(arr[i][children], arr[i], newTree[newTree.length - 1][children], level + 1);
                     }
                     else {
                         // children非有效数组时，移除该属性字段
@@ -2309,6 +2298,78 @@
         });
         return treeArr;
     }
+    /**
+     * 树形结构转扁平化
+     * @param {any} treeList
+     * @param {IFieldOptions} options
+     * @return {*}
+     */
+    function flatTree(treeList, options = defaultFieldOptions) {
+        const { childField, keyField, pidField } = options;
+        return treeList.reduce((res, node) => {
+            const item = {
+                ...node,
+                [childField]: [] // 清空子级
+            };
+            item.hasOwnProperty([childField]) && delete item[childField];
+            res.push(item);
+            if (node[childField]) {
+                const children = node[childField].map(item => ({
+                    ...item,
+                    [pidField]: node[keyField] || item.pid // 给子级设置pid
+                }));
+                res = res.concat(flatTree(children, options));
+            }
+            return res;
+        }, []);
+    }
+    /**
+     * 模糊搜索函数，返回包含搜索字符的节点及其祖先节点, 适用于树型组件的字符过滤功能
+     * @param {any[]} nodes
+     * @param {string} query
+     * @param {ISearchTreeOpts} options
+     * @return {any[]}
+     */
+    function fuzzySearchTree(nodes, query, options = defaultSearchTreeOptions) {
+        const result = [];
+        for (const node of nodes) {
+            // 递归检查子节点是否匹配
+            const matchedChildren = node[options.childField] && node[options.childField].length > 0
+                ? fuzzySearchTree(node[options.childField] || [], query, options)
+                : [];
+            // 检查当前节点是否匹配或者有匹配的子节点
+            if (node[options.nameField].toLowerCase().includes(query.toLowerCase()) || matchedChildren.length > 0) {
+                // 将当前节点加入结果中
+                if (node[options.childField]) {
+                    if (matchedChildren.length > 0) {
+                        result.push({
+                            ...node,
+                            [options.childField]: matchedChildren // 包含匹配的子节点
+                        });
+                    }
+                    else if (options.ignoreEmptyChild) {
+                        node[options.childField] && delete node[options.childField];
+                        result.push({
+                            ...node
+                        });
+                    }
+                    else {
+                        result.push({
+                            ...node,
+                            ...{ [options.childField]: [] }
+                        });
+                    }
+                }
+                else {
+                    node[options.childField] && delete node[options.childField];
+                    result.push({
+                        ...node
+                    });
+                }
+            }
+        }
+        return result;
+    }
 
     exports.HEX_POOL = HEX_POOL;
     exports.STRING_ARABIC_NUMERALS = STRING_ARABIC_NUMERALS;
@@ -2341,11 +2402,13 @@
     exports.downloadData = downloadData;
     exports.downloadHref = downloadHref;
     exports.downloadURL = downloadURL;
+    exports.flatTree = flatTree;
     exports.forEachDeep = forEachDeep;
     exports.forEachMap = forEachMap;
     exports.formatDate = formatDate;
     exports.formatNumber = formatNumber;
     exports.formatTree = formatTree;
+    exports.fuzzySearchTree = fuzzySearchTree;
     exports.genCanvasWM = genCanvasWM;
     exports.getComputedCssVal = getComputedCssVal;
     exports.getGlobal = getGlobal;

package/package.json

@@ -1,11 +1,12 @@
 {
   "name": "sculp-js",
-  "version": "1.3.1",
+  "version": "1.4.0",
   "packageManager": "npm@8.19.2",
   "description": "js工具库",
   "scripts": {
     "prepare": "husky install",
     "build": "rollup  --bundleConfigAsCjs --config rollup.config.js",
+    "build:core": "BUILD_TARGET=core rollup  --bundleConfigAsCjs --config rollup.config.js",
     "build:terser": "node scripts/build.js",
     "test:unit": "jest",
     "test": "jest --coverage",