sculp-js 1.13.3-beta.0 → 1.13.4

package/dist/cjs/_virtual/_commonjsHelpers.js

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

package/dist/cjs/array.js

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

package/dist/cjs/async.js

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

package/dist/cjs/base64.js

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

package/dist/cjs/clipboard.js

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

package/dist/cjs/cloneDeep.js

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

package/dist/cjs/cookie.js

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

package/dist/cjs/date.js

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

package/dist/cjs/dom.js

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

package/dist/cjs/download.js

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

package/dist/cjs/easing.js

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

package/dist/cjs/file.js

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

package/dist/cjs/func.js

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

package/dist/cjs/index.js

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

package/dist/cjs/math.js

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

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

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

package/dist/cjs/number.js

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

package/dist/cjs/object.js

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

package/dist/cjs/path.js

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

package/dist/cjs/qs.js

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

package/dist/cjs/random.js

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

package/dist/cjs/string.js

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

package/dist/cjs/tooltip.js

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

package/dist/cjs/tree.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.13.3-beta.0
+ * sculp-js v1.13.4
  * (c) 2023-present chandq
  * Released under the MIT License.
  */
@@ -23,7 +23,8 @@ const defaultSearchTreeOptions = {
  * @param {options} options 支持定制子元素名称、反向遍历、广度优先遍历，默认{
     childField: 'children',
     reverse: false,
-    breadthFirst: false
+    breadthFirst: false,
+    isDomNode: false,
   }
  * @returns {*}
  */
@@ -36,97 +37,95 @@ function forEachDeep(tree, iterator, options = {
     const { childField = 'children', reverse = false, breadthFirst = false, isDomNode = false } = type.isObject(options) ? options : {};
     let isBreak = false;
     const queue = [];
-    const walk = (arr, parent, level = 0) => {
-        if (reverse) {
-            for (let index = arr.length - 1; index >= 0; index--) {
-                if (isBreak) {
+    const reverseWalk = (arr, parent, level = 0) => {
+        for (let index = arr.length - 1; index >= 0; index--) {
+            if (isBreak) {
+                break;
+            }
+            const item = arr[index];
+            // 广度优先
+            if (breadthFirst) {
+                queue.push({ item, index, array: arr, tree, parent, level });
+            }
+            else {
+                const re = iterator(item, index, arr, tree, parent, level);
+                if (re === false) {
+                    isBreak = true;
                     break;
                 }
-                const item = arr[index];
-                // 广度优先
-                if (breadthFirst) {
-                    queue.push({ item, index, array: arr, tree, parent, level });
+                else if (re === true) {
+                    continue;
                 }
-                else {
-                    const re = iterator(item, index, arr, tree, parent, level);
-                    if (re === false) {
-                        isBreak = true;
-                        break;
-                    }
-                    else if (re === true) {
-                        continue;
-                    }
-                    if (item && (isDomNode ? type.isNodeList(item[childField]) : Array.isArray(item[childField]))) {
-                        walk(item[childField], item, level + 1);
-                    }
+                if (item && (isDomNode ? type.isNodeList(item[childField]) : Array.isArray(item[childField]))) {
+                    reverseWalk(item[childField], item, level + 1);
                 }
             }
-            if (breadthFirst) {
-                // Process queue
-                while (queue.length > 0 && !isBreak) {
-                    const current = queue.shift();
-                    const { item, index, array, tree, parent, level } = current;
-                    const re = iterator(item, index, array, tree, parent, level);
-                    if (re === false) {
-                        isBreak = true;
-                        break;
-                    }
-                    else if (re === true) {
-                        continue;
-                    }
-                    if (item && (isDomNode ? type.isNodeList(item[childField]) : Array.isArray(item[childField]))) {
-                        walk(item[childField], item, level + 1);
-                    }
+        }
+        if (breadthFirst) {
+            // Process queue
+            while (queue.length > 0 && !isBreak) {
+                const current = queue.shift();
+                const { item, index, array, tree, parent, level } = current;
+                const re = iterator(item, index, array, tree, parent, level);
+                if (re === false) {
+                    isBreak = true;
+                    break;
+                }
+                else if (re === true) {
+                    continue;
+                }
+                if (item && (isDomNode ? type.isNodeList(item[childField]) : Array.isArray(item[childField]))) {
+                    reverseWalk(item[childField], item, level + 1);
                 }
             }
         }
-        else {
-            for (let index = 0, len = arr.length; index < len; index++) {
-                if (isBreak) {
+    };
+    const walk = (arr, parent, level = 0) => {
+        for (let index = 0, len = arr.length; index < len; index++) {
+            if (isBreak) {
+                break;
+            }
+            const item = arr[index];
+            if (breadthFirst) {
+                // 广度优先
+                queue.push({ item, index: index, array: arr, tree, parent, level });
+            }
+            else {
+                // 深度优先
+                const re = iterator(item, index, arr, tree, parent, level);
+                if (re === false) {
+                    isBreak = true;
                     break;
                 }
-                const item = arr[index];
-                if (breadthFirst) {
-                    // 广度优先
-                    queue.push({ item, index: index, array: arr, tree, parent, level });
+                else if (re === true) {
+                    continue;
                 }
-                else {
-                    // 深度优先
-                    const re = iterator(item, index, arr, tree, parent, level);
-                    if (re === false) {
-                        isBreak = true;
-                        break;
-                    }
-                    else if (re === true) {
-                        continue;
-                    }
-                    if (item && (isDomNode ? type.isNodeList(item[childField]) : Array.isArray(item[childField]))) {
-                        walk(item[childField], item, level + 1);
-                    }
+                if (item && (isDomNode ? type.isNodeList(item[childField]) : Array.isArray(item[childField]))) {
+                    walk(item[childField], item, level + 1);
                 }
             }
-            if (breadthFirst) {
-                while (queue.length > 0 && !isBreak) {
-                    const current = queue.shift();
-                    if (!current)
-                        break;
-                    const { item, index, array, tree, parent, level } = current;
-                    const re = iterator(item, index, array, tree, parent, level);
-                    if (re === false) {
-                        isBreak = true;
-                        break;
-                    }
-                    else if (re === true) {
-                        continue;
-                    }
-                    if (item && (isDomNode ? type.isNodeList(item[childField]) : Array.isArray(item[childField]))) {
-                        walk(item[childField], item, level + 1);
-                    }
+        }
+        if (breadthFirst) {
+            while (queue.length > 0 && !isBreak) {
+                const current = queue.shift();
+                if (!current)
+                    break;
+                const { item, index, array, tree, parent, level } = current;
+                const re = iterator(item, index, array, tree, parent, level);
+                if (re === false) {
+                    isBreak = true;
+                    break;
+                }
+                else if (re === true) {
+                    continue;
+                }
+                if (item && (isDomNode ? type.isNodeList(item[childField]) : Array.isArray(item[childField]))) {
+                    walk(item[childField], item, level + 1);
                 }
             }
         }
     };
-    walk(tree, null, 0);
+    reverse ? reverseWalk(tree, null, 0) : walk(tree, null, 0);
     // @ts-ignore
     tree = null;
 }

package/dist/cjs/type.js

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

package/dist/cjs/unique.js

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

package/dist/cjs/url.js

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

package/dist/cjs/validator.js

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

package/dist/cjs/variable.js

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

package/dist/cjs/watermark.js

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

package/dist/esm/array.js

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

package/dist/esm/async.js

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

package/dist/esm/base64.js

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

package/dist/esm/clipboard.js

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

package/dist/esm/cloneDeep.js

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

package/dist/esm/cookie.js

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

package/dist/esm/date.js

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

package/dist/esm/dom.js

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

package/dist/esm/download.js

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

package/dist/esm/easing.js

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

package/dist/esm/file.js

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

package/dist/esm/func.js

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

package/dist/esm/index.js

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

package/dist/esm/math.js

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

package/dist/esm/number.js

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

package/dist/esm/object.js

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

package/dist/esm/path.js

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

package/dist/esm/qs.js

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

package/dist/esm/random.js

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

package/dist/esm/string.js

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

package/dist/esm/tooltip.js

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