sculp-js 1.11.1-alpha.3 → 1.13.0

package/lib/es/cloneDeep.js

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

package/lib/es/cookie.js

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

package/lib/es/date.js

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

package/lib/es/dom.js

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

package/lib/es/download.js

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

package/lib/es/easing.js

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

package/lib/es/file.js

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

package/lib/es/func.js

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

package/lib/es/index.js

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.11.1-alpha.3
+ * sculp-js v1.13.0
  * (c) 2023-present chandq
  * Released under the MIT License.
  */
@@ -16,7 +16,7 @@ export { qsParse, qsStringify } from './qs.js';
 export { STRING_ARABIC_NUMERALS, STRING_LOWERCASE_ALPHA, STRING_UPPERCASE_ALPHA, parseQueryParams, stringAssign, stringCamelCase, stringEscapeHtml, stringFill, stringFormat, stringKebabCase } from './string.js';
 export { arrayLike, isArray, isBigInt, isBoolean, isDate, isEmpty, isError, isFunction, isJsonString, isNaN, isNull, isNullOrUnDef, isNullOrUnDef as isNullish, isNumber, isObject, isPrimitive, isRegExp, isString, isSymbol, isUndefined, objectHas, typeIs } from './type.js';
 export { urlDelParams, urlParse, urlSetParams, urlStringify } from './url.js';
-export { asyncMap, wait } from './async.js';
+export { asyncMap, safeAwait, wait } from './async.js';
 export { chooseLocalFile, compressImg, supportCanvas } from './file.js';
 export { genCanvasWM } from './watermark.js';
 export { debounce, getGlobal, once, setGlobal, throttle } from './func.js';

package/lib/es/isEqual.js

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

package/lib/es/math.js

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

package/lib/es/number.js

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

package/lib/es/object.js

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

package/lib/es/path.js

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

package/lib/es/qs.js

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

package/lib/es/random.js

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

package/lib/es/string.js

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

package/lib/es/tooltip.js

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

package/lib/es/tree.js

@@ -1,12 +1,11 @@
 /*!
- * sculp-js v1.11.1-alpha.3
+ * sculp-js v1.13.0
  * (c) 2023-present chandq
  * Released under the MIT License.
  */
 
-import { arrayEach } from './array.js';
 import { objectOmit } from './object.js';
-import { objectHas, isEmpty } from './type.js';
+import { isObject, objectHas, isEmpty } from './type.js';
 
 const defaultFieldOptions = { keyField: 'key', childField: 'children', pidField: 'pid' };
 const defaultSearchTreeOptions = {
@@ -16,58 +15,126 @@ const defaultSearchTreeOptions = {
     ignoreCase: true
 };
 /**
- * 深度优先遍历函数(支持continue和break操作), 可用于insert tree item 和 remove tree item
+ * 树遍历函数(支持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  是否反向遍历
+ * @param {options} options 支持定制子元素名称、反向遍历、广度优先遍历，默认{
+    childField: 'children',
+    reverse: false,
+    breadthFirst: false
+  }
  * @returns {*}
  */
-function forEachDeep(tree, iterator, children = 'children', isReverse = false) {
+function forEachDeep(tree, iterator, options = {
+    childField: 'children',
+    reverse: false,
+    breadthFirst: false
+}) {
+    const { childField = 'children', reverse = false, breadthFirst = false } = isObject(options) ? options : {};
     let isBreak = false;
+    const queue = [];
     const walk = (arr, parent, level = 0) => {
-        if (isReverse) {
-            for (let i = arr.length - 1; i >= 0; i--) {
+        if (reverse) {
+            for (let index = arr.length - 1; index >= 0; index--) {
                 if (isBreak) {
                     break;
                 }
-                const re = iterator(arr[i], i, 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;
+                    }
+                    // @ts-ignore
+                    if (item && Array.isArray(item[childField])) {
+                        // @ts-ignore
+                        walk(item[childField], item, level + 1);
+                    }
                 }
-                // @ts-ignore
-                if (arr[i] && Array.isArray(arr[i][children])) {
+            }
+            if (breadthFirst) {
+                // Process queue
+                while (!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) {
+                        isBreak = true;
+                        break;
+                    }
+                    else if (re === true) {
+                        continue;
+                    }
                     // @ts-ignore
-                    walk(arr[i][children], arr[i], level + 1);
+                    if (item && Array.isArray(item[childField])) {
+                        // @ts-ignore
+                        walk(item[childField], item, level + 1);
+                    }
                 }
             }
         }
         else {
-            for (let i = 0, len = arr.length; i < len; i++) {
+            for (let index = 0, len = arr.length; index < len; index++) {
                 if (isBreak) {
                     break;
                 }
-                const re = iterator(arr[i], i, 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;
+                    }
+                    // @ts-ignore
+                    if (item && Array.isArray(item[childField])) {
+                        // @ts-ignore
+                        walk(item[childField], item, level + 1);
+                    }
                 }
-                // @ts-ignore
-                if (arr[i] && Array.isArray(arr[i][children])) {
+            }
+            if (breadthFirst) {
+                while (!isBreak) {
+                    const current = queue.shift();
+                    if (!current)
+                        break;
+                    // @ts-ignore
+                    const { item, index, array, tree, parent, level } = current;
+                    const re = iterator(item, index, array, tree, parent, level);
+                    if (re === false) {
+                        isBreak = true;
+                        break;
+                    }
+                    else if (re === true) {
+                        continue;
+                    }
                     // @ts-ignore
-                    walk(arr[i][children], arr[i], level + 1);
+                    if (item && Array.isArray(item[childField])) {
+                        // @ts-ignore
+                        walk(item[childField], item, level + 1);
+                    }
                 }
             }
         }
     };
-    walk(tree, null);
+    walk(tree, null, 0);
     // @ts-ignore
     tree = null;
 }
@@ -179,17 +246,20 @@ function searchTreeById(tree, nodeId, config) {
 /**
  * 扁平化数组转换成树
  * @param {any[]} list
- * @param {IFieldOptions} options
+ * @param {IFieldOptions} options 定制id字段名，子元素字段名，父元素字段名，默认
+ *        { keyField: 'key', childField: 'children', pidField: 'pid' }
  * @returns {any[]}
  */
 function formatTree(list, options = defaultFieldOptions) {
-    const { keyField, childField, pidField } = options;
+    const { keyField = 'key', childField = 'children', pidField = 'pid' } = isObject(options) ? options : {};
     const treeArr = [];
     const sourceMap = {};
-    arrayEach(list, item => {
+    for (let i = 0, len = list.length; i < len; i++) {
+        const item = list[i];
         sourceMap[item[keyField]] = item;
-    });
-    arrayEach(list, item => {
+    }
+    for (let i = 0, len = list.length; i < len; i++) {
+        const item = list[i];
         const parent = sourceMap[item[pidField]];
         if (parent) {
             (parent[childField] || (parent[childField] = [])).push(item);
@@ -197,21 +267,23 @@ function formatTree(list, options = defaultFieldOptions) {
         else {
             treeArr.push(item);
         }
-    });
+    }
     // @ts-ignore
     list = null;
     return treeArr;
 }
 /**
  * 树形结构转扁平化
- * @param {any} treeList
- * @param {IFieldOptions} options
- * @returns {*}
+ * @param {any[]} treeList
+ * @param {IFieldOptions} options 定制id字段名，子元素字段名，父元素字段名，默认
+ *        { keyField: 'key', childField: 'children', pidField: 'pid' }
+ * @returns {any[]}
  */
 function flatTree(treeList, options = defaultFieldOptions) {
-    const { childField, keyField, pidField } = options;
+    const { keyField = 'key', childField = 'children', pidField = 'pid' } = isObject(options) ? options : {};
     let res = [];
-    arrayEach(treeList, node => {
+    for (let i = 0, len = treeList.length; i < len; i++) {
+        const node = treeList[i];
         const item = {
             ...node,
             [childField]: [] // 清空子级
@@ -225,7 +297,7 @@ function flatTree(treeList, options = defaultFieldOptions) {
             }));
             res = res.concat(flatTree(children, options));
         }
-    });
+    }
     return res;
 }
 /**
@@ -239,7 +311,12 @@ function flatTree(treeList, options = defaultFieldOptions) {
  * 2. 若无任何过滤条件或keyword模式匹配且keyword为空串，返回原对象；其他情况返回新数组
  * @param {V[]} nodes
  * @param {IFilterCondition} filterCondition
- * @param {ISearchTreeOpts} options
+ * @param {ISearchTreeOpts} options 默认配置项 {
+      childField: 'children',
+      nameField: 'name',
+      removeEmptyChild: false,
+      ignoreCase: true
+    }
  * @returns {V[]}
  */
 function fuzzySearchTree(nodes, filterCondition, options = defaultSearchTreeOptions) {
@@ -248,7 +325,8 @@ function fuzzySearchTree(nodes, filterCondition, options = defaultSearchTreeOpti
         return nodes;
     }
     const result = [];
-    arrayEach(nodes, node => {
+    for (let i = 0, len = nodes.length; i < len; i++) {
+        const node = nodes[i];
         // 递归检查子节点是否匹配
         const matchedChildren = node[options.childField] && node[options.childField].length > 0
             ? fuzzySearchTree(node[options.childField] || [], filterCondition, options)
@@ -269,26 +347,22 @@ function fuzzySearchTree(nodes, filterCondition, options = defaultSearchTreeOpti
                     });
                 }
                 else if (options.removeEmptyChild) {
-                    node[options.childField] && delete node[options.childField];
-                    result.push({
-                        ...node
-                    });
+                    const { [options.childField]: _, ...other } = node;
+                    result.push(other);
                 }
                 else {
                     result.push({
                         ...node,
-                        ...{ [options.childField]: [] }
+                        [options.childField]: []
                     });
                 }
             }
             else {
-                node[options.childField] && delete node[options.childField];
-                result.push({
-                    ...node
-                });
+                const { [options.childField]: _, ...other } = node;
+                result.push(other);
             }
         }
-    });
+    }
     return result;
 }
 

package/lib/es/type.js

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

package/lib/es/unique.js

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

package/lib/es/url.js

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

package/lib/es/validator.js

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

package/lib/es/variable.js

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

package/lib/es/watermark.js

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

package/lib/es/we-decode.js

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

package/lib/index.d.ts

@@ -11,6 +11,30 @@ type AsyncCallback = {
     successCallback?: Function;
     failCallback?: Function;
 };
+interface Fn<T = any, R = T> {
+    (...arg: T[]): R;
+}
+interface PromiseFn<T = any, R = T> {
+    (...arg: T[]): Promise<R>;
+}
+/**
+ * 将除指定属性外的所有属性变为必填
+ *
+ * Change all properties except the specified properties to required
+ */
+type ChangeRequiredExcept<T, K extends keyof T> = Required<Omit<T, K>> & Partial<Pick<T, K>>;
+/**
+ * 将指定属性变为可选
+ *
+ * Change the specified properties to optional
+ */
+type ChangeOptional<T, K extends keyof T> = Omit<T, K> & Partial<Pick<T, K>>;
+/**
+ * 将指定属性变为必填
+ *
+ * Change the specified properties to required
+ */
+type ChangeRequired<T, K extends keyof T> = Omit<T, K> & Required<Pick<T, K>>;
 type PartialDeep<T> = {
     [P in keyof T]?: PartialDeep<T[P]>;
 };
@@ -150,9 +174,11 @@ type CopyTextOptions = AsyncCallback & {
     container?: HTMLElement;
 };
 /**
- * 复制文本，优先使用navigator.clipboard，若不支持则回退使用execCommand方式
+ * 复制文本，优先使用navigator.clipboard，仅在安全上下文(HTTPS/localhost)下生效，若不支持则回退使用execCommand方式
  * @param {string} text
- * @param {AsyncCallback} options 可选参数：成功回调、失败回调、容器元素
+ * @param {CopyTextOptions} options 可选参数：成功回调successCallback、失败回调failCallback、容器元素container
+ *                      （默认document.body, 当不支持clipboard时必须传复制按钮元素，包裹模拟选择操作的临时元素，
+ *                        解决脱离文档流的元素无法复制的问题，如Modal内复制操作)
  */
 declare function copyText(text: string, options?: CopyTextOptions): void;
 /**
@@ -604,6 +630,26 @@ declare function wait(timeout?: number): Promise<void>;
  * @returns {Promise<R[]>}
  */
 declare function asyncMap<T, R>(list: Array<T>, mapper: (val: T, idx: number, list: Array<T>) => Promise<R>, concurrency?: number): Promise<R[]>;
+/**
+ * Execute a promise safely
+ *
+ * @param { Promise } promise
+ * @param { Object= } errorExt - Additional Information you can pass safeAwait the err object
+ * @return { Promise }
+ * @example
+ * async function asyncTaskWithCb(cb) {
+     let err, user, savedTask, notification;
+
+     [ err, user ] = await safeAwait(UserModel.findById(1));
+     if(!user) return cb('No user found');
+
+     [ err, savedTask ] = await safeAwait(TaskModel({userId: user.id, name: 'Demo Task'}));
+     if(err) return cb('Error occurred while saving task')
+
+    cb(null, savedTask);
+}
+ */
+declare function safeAwait<T, U = Error>(promise: Promise<T>, errorExt?: object): Promise<[U, undefined] | [null, T]>;
 
 /**
  * 判断是否支持canvas
@@ -863,14 +909,21 @@ interface IFilterCondition<V> {
     filter?: (args: V) => boolean;
 }
 /**
- * 深度优先遍历函数(支持continue和break操作), 可用于insert tree item 和 remove tree item
+ * 树遍历函数(支持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  是否反向遍历
+ * @param {options} options 支持定制子元素名称、反向遍历、广度优先遍历，默认{
+    childField: 'children',
+    reverse: false,
+    breadthFirst: false
+  }
  * @returns {*}
  */
-declare function forEachDeep<V>(tree: ArrayLike<V>, iterator: (val: V, i: number, currentArr: ArrayLike<V>, tree: ArrayLike<V>, parent: V | null, level: number) => boolean | void, children?: string, isReverse?: boolean): void;
+declare function forEachDeep<V>(tree: ArrayLike<V>, iterator: (val: V, index: number, currentArr: ArrayLike<V>, tree: ArrayLike<V>, parent: V | null, level: number) => boolean | void, options?: {
+    childField?: string;
+    reverse?: boolean;
+    breadthFirst?: boolean;
+}): void;
 /**
  * 创建一个新数组, 深度优先遍历的Map函数(支持continue和break操作), 可用于insert tree item 和 remove tree item
  *
@@ -901,15 +954,17 @@ declare function searchTreeById<V>(tree: ArrayLike<V>, nodeId: IdLike, config?:
 /**
  * 扁平化数组转换成树
  * @param {any[]} list
- * @param {IFieldOptions} options
+ * @param {IFieldOptions} options 定制id字段名，子元素字段名，父元素字段名，默认
+ *        { keyField: 'key', childField: 'children', pidField: 'pid' }
  * @returns {any[]}
  */
 declare function formatTree(list: any[], options?: IFieldOptions): any[];
 /**
  * 树形结构转扁平化
- * @param {any} treeList
- * @param {IFieldOptions} options
- * @returns {*}
+ * @param {any[]} treeList
+ * @param {IFieldOptions} options 定制id字段名，子元素字段名，父元素字段名，默认
+ *        { keyField: 'key', childField: 'children', pidField: 'pid' }
+ * @returns {any[]}
  */
 declare function flatTree(treeList: any[], options?: IFieldOptions): any[];
 /**
@@ -923,7 +978,12 @@ declare function flatTree(treeList: any[], options?: IFieldOptions): any[];
  * 2. 若无任何过滤条件或keyword模式匹配且keyword为空串，返回原对象；其他情况返回新数组
  * @param {V[]} nodes
  * @param {IFilterCondition} filterCondition
- * @param {ISearchTreeOpts} options
+ * @param {ISearchTreeOpts} options 默认配置项 {
+      childField: 'children',
+      nameField: 'name',
+      removeEmptyChild: false,
+      ignoreCase: true
+    }
  * @returns {V[]}
  */
 declare function fuzzySearchTree<V>(nodes: V[], filterCondition: IFilterCondition<V>, options?: ISearchTreeOpts): V[];
@@ -1148,4 +1208,4 @@ type Comparable = null | undefined | boolean | number | string | Date | RegExp |
  */
 declare function isEqual(a: Comparable, b: Comparable): boolean;
 
-export { type AnyArray, type AnyFunc, type AnyObject, type ArrayElements, type AsyncCallback, type Comparable, type DateObj, type DateValue, type DebounceFunc, EMAIL_REGEX, type FileType, HEX_POOL, HTTP_URL_REGEX, type ICanvasWM, type ICompressImgResult, type ICompressOptions, type IFieldOptions, type IFilterCondition, IPV4_REGEX, IPV6_REGEX, type ISearchTreeOpts, type ITreeConf, type IdLike, type LooseParamValue, type LooseParams, type ObjectAssignItem, type OnceFunc, PHONE_REGEX, type Params, type PartialDeep, type RandomString, 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, URL_REGEX, type UniqueString, type Url, add, addClass, arrayEach, arrayEachAsync, arrayInsertBefore, arrayLike, arrayRemove, asyncMap, calculateDate, calculateDateTime, chooseLocalFile, cloneDeep, compressImg, cookieDel, cookieGet, cookieSet, copyText, crossOriginDownload, dateParse, dateToEnd, dateToStart, debounce, decodeFromBase64, divide, downloadBlob, downloadData, downloadHref, downloadURL, encodeToBase64, escapeRegExp, executeInScope, fallbackCopyText, flatTree, forEachDeep, formatDate, formatNumber as formatMoney, formatNumber, formatTree, fuzzySearchTree, genCanvasWM, getComputedCssVal, getGlobal, getStrWidthPx, getStyle, hasClass, humanFileSize, isArray, isBigInt, isBoolean, isDate, isDigit, isEmail, isEmpty, isEqual, isError, isFloat, isFunction, isIdNo, isInteger, isIpV4, isIpV6, isJsonString, isNaN, isNull, isNullOrUnDef, isNullOrUnDef as isNullish, isNumber, isNumerical, isObject, isPhone, isPlainObject, isPrimitive, isRegExp, isString, isSymbol, isUndefined, isUrl, isValidDate, mapDeep, multiply, numberAbbr, numberToHex, objectAssign, objectEach, objectEachAsync, objectFill, objectGet, objectHas, objectMap, objectAssign as objectMerge, objectOmit, objectPick, once, parseQueryParams, parseVarFromString, pathJoin, pathNormalize, qsParse, qsStringify, randomNumber, randomString, randomUuid, removeClass, replaceVarFromString, searchTreeById, select, setGlobal, setStyle, smoothScroll, stringAssign, stringCamelCase, stringEscapeHtml, stringFill, stringFormat, stringKebabCase, strip, subtract, supportCanvas, throttle, tooltipEvent, typeIs, uniqueNumber, uniqueString, uniqueSymbol, urlDelParams, urlParse, urlSetParams, urlStringify, wait, weAtob, weBtoa };
+export { type AnyArray, type AnyFunc, type AnyObject, type ArrayElements, type AsyncCallback, type ChangeOptional, type ChangeRequired, type ChangeRequiredExcept, type Comparable, type DateObj, type DateValue, type DebounceFunc, EMAIL_REGEX, type FileType, type Fn, HEX_POOL, HTTP_URL_REGEX, type ICanvasWM, type ICompressImgResult, type ICompressOptions, type IFieldOptions, type IFilterCondition, IPV4_REGEX, IPV6_REGEX, type ISearchTreeOpts, type ITreeConf, type IdLike, type LooseParamValue, type LooseParams, type ObjectAssignItem, type OnceFunc, PHONE_REGEX, type Params, type PartialDeep, type PromiseFn, type RandomString, 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, URL_REGEX, type UniqueString, type Url, add, addClass, arrayEach, arrayEachAsync, arrayInsertBefore, arrayLike, arrayRemove, asyncMap, calculateDate, calculateDateTime, chooseLocalFile, cloneDeep, compressImg, cookieDel, cookieGet, cookieSet, copyText, crossOriginDownload, dateParse, dateToEnd, dateToStart, debounce, decodeFromBase64, divide, downloadBlob, downloadData, downloadHref, downloadURL, encodeToBase64, escapeRegExp, executeInScope, fallbackCopyText, flatTree, forEachDeep, formatDate, formatNumber as formatMoney, formatNumber, formatTree, fuzzySearchTree, genCanvasWM, getComputedCssVal, getGlobal, getStrWidthPx, getStyle, hasClass, humanFileSize, isArray, isBigInt, isBoolean, isDate, isDigit, isEmail, isEmpty, isEqual, isError, isFloat, isFunction, isIdNo, isInteger, isIpV4, isIpV6, isJsonString, isNaN, isNull, isNullOrUnDef, isNullOrUnDef as isNullish, isNumber, isNumerical, isObject, isPhone, isPlainObject, isPrimitive, isRegExp, isString, isSymbol, isUndefined, isUrl, isValidDate, mapDeep, multiply, numberAbbr, numberToHex, objectAssign, objectEach, objectEachAsync, objectFill, objectGet, objectHas, objectMap, objectAssign as objectMerge, objectOmit, objectPick, once, parseQueryParams, parseVarFromString, pathJoin, pathNormalize, qsParse, qsStringify, randomNumber, randomString, randomUuid, removeClass, replaceVarFromString, safeAwait, searchTreeById, select, setGlobal, setStyle, smoothScroll, stringAssign, stringCamelCase, stringEscapeHtml, stringFill, stringFormat, stringKebabCase, strip, subtract, supportCanvas, throttle, tooltipEvent, typeIs, uniqueNumber, uniqueString, uniqueSymbol, urlDelParams, urlParse, urlSetParams, urlStringify, wait, weAtob, weBtoa };