sculp-js 1.1.0 → 1.2.1

package/lib/cjs/watermark.js

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

package/lib/es/array.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.0.1
+ * sculp-js v1.2.1
  * (c) 2023-2023 chandq
  * Released under the MIT License.
  */
@@ -107,179 +107,5 @@ function arrayRemove(array, expect) {
     indexes.forEach((val, idx) => array.splice(val - idx, 1));
     return array;
 }
-/**
- * 自定义深度优先遍历函数(支持continue和break操作)
- * @param {ArrayLike<V>} tree  树形数据
- * @param {Function} iterator  迭代函数, 返回值为true时continue, 返回值为false时break
- * @param {string} children 定制子元素的key
- * @param {boolean} isReverse  是否反向遍历
- * @returns {*}
- */
-function forEachDeep(tree, iterator, children = 'children', isReverse = false) {
-    let level = 0, isBreak = false;
-    const walk = (arr, parent) => {
-        if (isReverse) {
-            for (let i = arr.length - 1; i >= 0; i--) {
-                if (isBreak) {
-                    break;
-                }
-                const re = iterator(arr[i], i, tree, parent, level);
-                if (re === false) {
-                    isBreak = true;
-                    break;
-                }
-                else if (re === true) {
-                    continue;
-                }
-                // @ts-ignore
-                if (Array.isArray(arr[i][children])) {
-                    ++level;
-                    // @ts-ignore
-                    walk(arr[i][children], arr[i]);
-                }
-            }
-        }
-        else {
-            for (let i = 0; i < arr.length; i++) {
-                if (isBreak) {
-                    break;
-                }
-                const re = iterator(arr[i], i, tree, parent, level);
-                if (re === false) {
-                    isBreak = true;
-                    break;
-                }
-                else if (re === true) {
-                    continue;
-                }
-                // @ts-ignore
-                if (Array.isArray(arr[i][children])) {
-                    ++level;
-                    // @ts-ignore
-                    walk(arr[i][children], arr[i]);
-                }
-            }
-        }
-    };
-    walk(tree, null);
-}
-/**
- * 在树中找到 id 为某个值的节点，并返回上游的所有父级节点
- *
- * @param {ArrayLike<T>} tree - 树形数据
- * @param {IdLike} nodeId - 元素ID
- * @param {ITreeConf} config - 迭代配置项
- * @returns {[IdLike[], ITreeItem<V>[]]} - 由parentId...childId, parentObject-childObject组成的二维数组
- */
-function searchTreeById(tree, nodeId, config) {
-    const { children = 'children', id = 'id' } = config || {};
-    const toFlatArray = (tree, parentId, parent) => {
-        return tree.reduce((t, _) => {
-            const child = _[children];
-            return [
-                ...t,
-                parentId ? { ..._, parentId, parent } : _,
-                ...(child && child.length ? toFlatArray(child, _[id], _) : [])
-            ];
-        }, []);
-    };
-    const getIds = (flatArray) => {
-        let child = flatArray.find(_ => _[id] === 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
-        }
-        return [ids, nodes];
-    };
-    return getIds(toFlatArray(tree));
-}
-/**
- * 使用迭代函数转换数组
- * @param {T} array
- * @param {Function} callback 迭代函数
- * @return {Array}
- */
-function flatMap(array, callback) {
-    const result = [];
-    array.forEach((value, index) => {
-        result.push(...callback(value, index, array));
-    });
-    return result;
-}
-/**
- * 根据 idProp 与 parentIdProp 从对象数组中构建对应的树
- * 当 A[parentIdProp] === B[idProp] 时，对象A会被移动到对象B的children。
- * 当一个对象的 parentIdProp 不与其他对象的 idProp 字段相等时，该对象被作为树的顶层节点
- * @param {string} idProp 元素ID
- * @param {string} parentIdProp 父元素ID
- * @param {object[]} items 一维数组
- * @returns {WithChildren<T>[]} 树
- * @example
- * const array = [
- *   { id: 'node-1', parent: 'root' },
- *   { id: 'node-2', parent: 'root' },
- *   { id: 'node-3', parent: 'node-2' },
- *   { id: 'node-4', parent: 'node-2' },
- *   { id: 'node-5', parent: 'node-4' },
- * ]
- * const tree = buildTree('id', 'parent', array)
- * expect(tree).toEqual([
- *   { id: 'node-1', parent: 'root' },
- *   {
- *     id: 'node-2',
- *     parent: 'root',
- *     children: [
- *       { id: 'node-3', parent: 'node-2' },
- *       {
- *         id: 'node-4',
- *         parent: 'node-2',
- *         children: [{ id: 'node-5', parent: 'node-4' }],
- *       },
- *     ],
- *   },
- * ])
- */
-function buildTree(idProp, parentIdProp, items) {
-    const wrapperMap = new Map();
-    const ensure = (id) => {
-        if (wrapperMap.has(id)) {
-            return wrapperMap.get(id);
-        }
-        //@ts-ignore
-        const wrapper = { id, parent: null, item: null, children: [] };
-        wrapperMap.set(id, wrapper);
-        return wrapper;
-    };
-    for (const item of items) {
-        const parentWrapper = ensure(item[parentIdProp]);
-        const itemWrapper = ensure(item[idProp]);
-        //@ts-ignore
-        itemWrapper.parent = parentWrapper;
-        //@ts-ignore
-        parentWrapper.children.push(itemWrapper);
-        //@ts-ignore
-        itemWrapper.item = item;
-    }
-    const topLevelWrappers = flatMap(Array.from(wrapperMap.values()).filter(wrapper => wrapper.parent === null), wrapper => wrapper.children);
-    return unwrapRecursively(topLevelWrappers);
-    function unwrapRecursively(wrapperArray) {
-        const result = [];
-        for (const wrapper of wrapperArray) {
-            if (wrapper.children.length === 0) {
-                result.push(wrapper.item);
-            }
-            else {
-                result.push({
-                    ...wrapper.item,
-                    children: unwrapRecursively(wrapper.children)
-                });
-            }
-        }
-        return result;
-    }
-}
 
-export { arrayEach, arrayEachAsync, arrayInsertBefore, arrayLike, arrayRemove, buildTree, forEachDeep, searchTreeById };
+export { arrayEach, arrayEachAsync, arrayInsertBefore, arrayLike, arrayRemove };

package/lib/es/async.js

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

package/lib/es/clipboard.js

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

package/lib/es/cookie.js

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

package/lib/es/date.js

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

package/lib/es/dom.js

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

package/lib/es/download.js

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

package/lib/es/easing.js

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

package/lib/es/file.js

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

package/lib/es/func.js

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

package/lib/es/index.js

@@ -1,10 +1,10 @@
 /*!
- * sculp-js v1.0.1
+ * sculp-js v1.2.1
  * (c) 2023-2023 chandq
  * Released under the MIT License.
  */
 
-export { arrayEach, arrayEachAsync, arrayInsertBefore, arrayLike, arrayRemove, buildTree, forEachDeep, searchTreeById } from './array.js';
+export { arrayEach, arrayEachAsync, arrayInsertBefore, arrayLike, arrayRemove } from './array.js';
 export { copyText } from './clipboard.js';
 export { cookieDel, cookieGet, cookieSet } from './cookie.js';
 export { calculateDate, calculateDateTime, dateParse, dateToEnd, dateToStart, formatDate, isValidDate } from './date.js';
@@ -24,3 +24,4 @@ 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';

package/lib/es/number.js

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

package/lib/es/object.js

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

package/lib/es/path.js

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

package/lib/es/qs.js

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

package/lib/es/random.js

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

package/lib/es/string.js

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

package/lib/es/tooltip.js

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

package/lib/es/tree.js

@@ -0,0 +1,277 @@
+/*!
+ * sculp-js v1.2.1
+ * (c) 2023-2023 chandq
+ * Released under the MIT License.
+ */
+
+const defaultFieldOptions = { keyField: 'key', childField: 'children', pidField: 'pid' };
+/**
+ * 深度优先遍历函数(支持continue和break操作), 可用于insert tree item 和 remove tree item
+ * @param {ArrayLike<V>} tree  树形数据
+ * @param {Function} iterator  迭代函数, 返回值为true时continue, 返回值为false时break
+ * @param {string} children 定制子元素的key
+ * @param {boolean} isReverse  是否反向遍历
+ * @returns {*}
+ */
+function forEachDeep(tree, iterator, children = 'children', isReverse = false) {
+    let level = 0, isBreak = false;
+    const walk = (arr, parent) => {
+        if (isReverse) {
+            for (let i = arr.length - 1; i >= 0; i--) {
+                if (isBreak) {
+                    break;
+                }
+                const re = iterator(arr[i], i, arr, tree, parent, level);
+                if (re === false) {
+                    isBreak = true;
+                    break;
+                }
+                else if (re === true) {
+                    continue;
+                }
+                // @ts-ignore
+                if (arr[i] && Array.isArray(arr[i][children])) {
+                    ++level;
+                    // @ts-ignore
+                    walk(arr[i][children], arr[i]);
+                }
+            }
+        }
+        else {
+            for (let i = 0; i < arr.length; i++) {
+                if (isBreak) {
+                    break;
+                }
+                const re = iterator(arr[i], i, arr, tree, parent, level);
+                if (re === false) {
+                    isBreak = true;
+                    break;
+                }
+                else if (re === true) {
+                    continue;
+                }
+                // @ts-ignore
+                if (arr[i] && Array.isArray(arr[i][children])) {
+                    ++level;
+                    // @ts-ignore
+                    walk(arr[i][children], arr[i]);
+                }
+            }
+        }
+    };
+    walk(tree, null);
+}
+/**
+ * 深度优先遍历的Map函数(支持continue和break操作), 可用于insert tree item 和 remove tree item
+ * @param {ArrayLike<V>} tree  树形数据
+ * @param {Function} iterator  迭代函数, 返回值为true时continue, 返回值为false时break
+ * @param {string} children 定制子元素的key
+ * @param {boolean} isReverse  是否反向遍历
+ * @returns {any[]} 新的一棵树
+ */
+function forEachMap(tree, iterator, children = 'children', isReverse = false) {
+    let level = 0, isBreak = false;
+    const newTree = [];
+    const walk = (arr, parent, newTree) => {
+        if (isReverse) {
+            for (let i = arr.length - 1; i >= 0; i--) {
+                if (isBreak) {
+                    break;
+                }
+                const re = iterator(arr[i], i, arr, tree, parent, level);
+                if (re === false) {
+                    isBreak = true;
+                    break;
+                }
+                else if (re === true) {
+                    continue;
+                }
+                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]);
+                }
+                else {
+                    // children非有效数组时，移除该属性字段
+                    delete re[children];
+                }
+            }
+        }
+        else {
+            for (let i = 0; i < arr.length; i++) {
+                if (isBreak) {
+                    break;
+                }
+                const re = iterator(arr[i], i, arr, tree, parent, level);
+                if (re === false) {
+                    isBreak = true;
+                    break;
+                }
+                else if (re === true) {
+                    continue;
+                }
+                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]);
+                }
+                else {
+                    // children非有效数组时，移除该属性字段
+                    delete re[children];
+                }
+            }
+        }
+    };
+    walk(tree, null, newTree);
+    return newTree;
+}
+/**
+ * 在树中找到 id 为某个值的节点，并返回上游的所有父级节点
+ *
+ * @param {ArrayLike<T>} tree - 树形数据
+ * @param {IdLike} nodeId - 元素ID
+ * @param {ITreeConf} config - 迭代配置项
+ * @returns {[IdLike[], ITreeItem<V>[]]} - 由parentId...childId, parentObject-childObject组成的二维数组
+ */
+function searchTreeById(tree, nodeId, config) {
+    const { children = 'children', id = 'id' } = config || {};
+    const toFlatArray = (tree, parentId, parent) => {
+        return tree.reduce((t, _) => {
+            const child = _[children];
+            return [
+                ...t,
+                parentId ? { ..._, parentId, parent } : _,
+                ...(child && child.length ? toFlatArray(child, _[id], _) : [])
+            ];
+        }, []);
+    };
+    const getIds = (flatArray) => {
+        let child = flatArray.find(_ => _[id] === 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
+        }
+        return [ids, nodes];
+    };
+    return getIds(toFlatArray(tree));
+}
+/**
+ * 使用迭代函数转换数组
+ * @param {T} array
+ * @param {Function} callback 迭代函数
+ * @returns {Array}
+ */
+function flatMap(array, callback) {
+    const result = [];
+    array.forEach((value, index) => {
+        result.push(...callback(value, index, array));
+    });
+    return result;
+}
+/**
+ * 根据 idProp 与 parentIdProp 从对象数组中构建对应的树
+ * 当 A[parentIdProp] === B[idProp] 时，对象A会被移动到对象B的children。
+ * 当一个对象的 parentIdProp 不与其他对象的 idProp 字段相等时，该对象被作为树的顶层节点
+ * @param {string} idProp 元素ID
+ * @param {string} parentIdProp 父元素ID
+ * @param {object[]} items 一维数组
+ * @returns {WithChildren<T>[]} 树
+ * @example
+ * const array = [
+ *   { id: 'node-1', parent: 'root' },
+ *   { id: 'node-2', parent: 'root' },
+ *   { id: 'node-3', parent: 'node-2' },
+ *   { id: 'node-4', parent: 'node-2' },
+ *   { id: 'node-5', parent: 'node-4' },
+ * ]
+ * const tree = buildTree('id', 'parent', array)
+ * expect(tree).toEqual([
+ *   { id: 'node-1', parent: 'root' },
+ *   {
+ *     id: 'node-2',
+ *     parent: 'root',
+ *     children: [
+ *       { id: 'node-3', parent: 'node-2' },
+ *       {
+ *         id: 'node-4',
+ *         parent: 'node-2',
+ *         children: [{ id: 'node-5', parent: 'node-4' }],
+ *       },
+ *     ],
+ *   },
+ * ])
+ */
+function buildTree(idProp, parentIdProp, items) {
+    const wrapperMap = new Map();
+    const ensure = (id) => {
+        if (wrapperMap.has(id)) {
+            return wrapperMap.get(id);
+        }
+        //@ts-ignore
+        const wrapper = { id, parent: null, item: null, children: [] };
+        wrapperMap.set(id, wrapper);
+        return wrapper;
+    };
+    for (const item of items) {
+        const parentWrapper = ensure(item[parentIdProp]);
+        const itemWrapper = ensure(item[idProp]);
+        //@ts-ignore
+        itemWrapper.parent = parentWrapper;
+        //@ts-ignore
+        parentWrapper.children.push(itemWrapper);
+        //@ts-ignore
+        itemWrapper.item = item;
+    }
+    const topLevelWrappers = flatMap(Array.from(wrapperMap.values()).filter(wrapper => wrapper.parent === null), wrapper => wrapper.children);
+    return unwrapRecursively(topLevelWrappers);
+    function unwrapRecursively(wrapperArray) {
+        const result = [];
+        for (const wrapper of wrapperArray) {
+            if (wrapper.children.length === 0) {
+                result.push(wrapper.item);
+            }
+            else {
+                result.push({
+                    ...wrapper.item,
+                    children: unwrapRecursively(wrapper.children)
+                });
+            }
+        }
+        return result;
+    }
+}
+/**
+ * 扁平化数组转换成树(效率高于buildTree)
+ * @param {any[]} list
+ * @param {IFieldOptions} options
+ * @returns {any[]}
+ */
+function formatTree(list, options = defaultFieldOptions) {
+    const { keyField, childField, pidField } = options;
+    const treeArr = [];
+    const sourceMap = {};
+    list.forEach(item => {
+        sourceMap[item[keyField]] = item;
+    });
+    list.forEach(item => {
+        const parent = sourceMap[item[pidField]];
+        if (parent) {
+            (parent[childField] || (parent[childField] = [])).push(item);
+        }
+        else {
+            treeArr.push(item);
+        }
+    });
+    return treeArr;
+}
+
+export { buildTree, forEachDeep, forEachMap, formatTree, searchTreeById };

package/lib/es/type.js

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

package/lib/es/unique.js

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

package/lib/es/url.js

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

package/lib/es/watermark.js

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