sculp-js 1.19.12 → 1.19.14

package/dist/esm/func.mjs

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.19.12
+ * sculp-js v1.19.14
  * (c) 2023-present chandq
  * Released under the MIT License.
  */
@@ -86,35 +86,10 @@ const once = func => {
     return result;
   };
 };
-/**
- * 设置全局变量
- * @param {string | number | symbol} key
- * @param val
- */
-function setGlobal(key, val) {
-  if (typeof globalThis !== 'undefined') globalThis[key] = val;
-  else if (typeof window !== 'undefined') window[key] = val;
-  else if (typeof global !== 'undefined') global[key] = val;
-  else if (typeof self !== 'undefined') self[key] = val;
-  else throw new SyntaxError('当前环境下无法设置全局属性');
-}
-/**
- * 获取全局变量
- * @param {string | number | symbol} key
- * @param val
- */
-function getGlobal(key) {
-  if (typeof globalThis !== 'undefined') return globalThis[key];
-  else if (typeof window !== 'undefined') return window[key];
-  else if (typeof global !== 'undefined') return global[key];
-  else if (typeof self !== 'undefined') return self[key];
-}
 var func = {
   debounce,
   throttle,
-  once,
-  getGlobal,
-  setGlobal
+  once
 };
 
-export { debounce, func as default, getGlobal, once, setGlobal, throttle };
+export { debounce, func as default, once, throttle };

package/dist/esm/index.mjs

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.19.12
+ * sculp-js v1.19.14
  * (c) 2023-present chandq
  * Released under the MIT License.
  */
@@ -99,7 +99,7 @@ export { chooseLocalFile, compressImg, supportCanvas } from './file.mjs';
 import * as watermark from './watermark.mjs';
 export { genCanvasWM } from './watermark.mjs';
 import * as func from './func.mjs';
-export { debounce, getGlobal, once, setGlobal, throttle } from './func.mjs';
+export { debounce, once, throttle } from './func.mjs';
 import * as random from './random.mjs';
 export { STRING_POOL, randomNumber, randomString, randomUuid } from './random.mjs';
 import * as number from './number.mjs';

package/dist/esm/isEqual.mjs

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

package/dist/esm/math.mjs

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

package/dist/esm/number.mjs

@@ -1,16 +1,16 @@
 /*!
- * sculp-js v1.19.12
+ * sculp-js v1.19.14
  * (c) 2023-present chandq
  * Released under the MIT License.
  */
 
-import { getGlobal } from './func.mjs';
 import { STRING_ARABIC_NUMERALS, STRING_UPPERCASE_ALPHA, STRING_LOWERCASE_ALPHA } from './string.mjs';
 import { isNullOrUnDef } from './type.mjs';
 
 const HEX_POOL = `${STRING_ARABIC_NUMERALS}${STRING_UPPERCASE_ALPHA}${STRING_LOWERCASE_ALPHA}`;
 const supportBigInt = typeof BigInt !== 'undefined';
-const jsbi = () => getGlobal('JSBI');
+// @ts-ignore
+const jsbi = () => globalThis.JSBI;
 const toBigInt = n => (supportBigInt ? BigInt(n) : jsbi().BigInt(n));
 const divide = (x, y) => (supportBigInt ? x / y : jsbi().divide(x, y));
 const remainder = (x, y) => (supportBigInt ? x % y : jsbi().remainder(x, y));

package/dist/esm/object.mjs

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

package/dist/esm/path.mjs

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

package/dist/esm/qs.mjs

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

package/dist/esm/random.mjs

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

package/dist/esm/string.mjs

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

package/dist/esm/tooltip.mjs

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

package/dist/esm/tree.mjs

@@ -1,5 +1,5 @@
 /*!
- * sculp-js v1.19.12
+ * sculp-js v1.19.14
  * (c) 2023-present chandq
  * Released under the MIT License.
  */
@@ -17,13 +17,13 @@ const defaultSearchTreeOptions = {
 function getChildNodes(item, childField, isDomNode) {
   const child = item[childField];
   if (!child) return null;
-  return isDomNode && isNodeList(child) ? Array.from(child) : Array.isArray(child) ? child : null;
+  return isDomNode && isNodeList(child) ? child : Array.isArray(child) ? child : null;
 }
 /**
  * Tree traversal function (default DFS, supports continue and break operations).
  * Can be used to traverse Array and NodeList type data.
- * @param {V[]} tree - Tree data
- * @param {Function} iterator - Iterator function. Returns true to continue, false to break.
+ * @param {ArrayLike<V>} tree - Tree data
+ * @param {Function} iteratee - Iteratee function. Returns true to continue, false to break.
  * @param {object} options - Options to customize child element name, reverse traversal, breadth-first traversal. Default: {
     childField: 'children',
     reverse: false,
@@ -34,7 +34,7 @@ function getChildNodes(item, childField, isDomNode) {
  */
 function forEachDeep(
   tree,
-  iterator,
+  iteratee,
   options = {
     childField: 'children',
     reverse: false,
@@ -51,12 +51,12 @@ function forEachDeep(
   let isBreak = false;
   const queue = [];
   const processNode = (item, index, arr, parent, level) => {
-    const re = iterator(item, index, arr, tree, parent, level);
-    if (re === false) {
+    const result = iteratee(item, index, arr, tree, parent, level);
+    if (result === false) {
       isBreak = true;
       return;
     }
-    if (re === true) return;
+    if (result === true) return;
     const childNodes = getChildNodes(item, childField, isDomNode);
     if (childNodes) {
       if (breadthFirst) {
@@ -100,7 +100,7 @@ function forEachDeep(
 }
 /**
  * Tree search function, can be used to search Array and NodeList type data.
- * @param {V[]} tree - Tree data
+ * @param {ArrayLike<V>} tree - Tree data
  * @param {Function} predicate - Predicate function
  * @param {object} options - Options to customize child element name, reverse traversal, breadth-first traversal. Default: {
     childField: 'children',
@@ -135,7 +135,7 @@ function findDeep(
 }
 /**
  * Tree filter function, can be used to filter Array and NodeList type data.
- * @param {V[]} tree - Tree data
+ * @param {ArrayLike<V>} tree - Tree data
  * @param {Function} predicate - Predicate function
  * @param {object} options - Options to customize child element name, reverse traversal, breadth-first traversal. Default: {
     childField: 'children',
@@ -172,8 +172,8 @@ function filterDeep(
  * Can be used for inserting or removing tree items.
  *
  * Can traverse any array-like object with a length property and numeric keys.
- * @param {V[]} tree - Tree data
- * @param {Function} iterator - Iterator function. Returns true to continue, false to break.
+ * @param {ArrayLike<V>} tree - Tree data
+ * @param {Function} iteratee - Iteratee function. Returns true to continue, false to break.
  * @param {object} options - Options to customize child element name, reverse traversal. Default: {
     childField: 'children',
     reverse: false,
@@ -182,7 +182,7 @@ function filterDeep(
  */
 function mapDeep(
   tree,
-  iterator,
+  iteratee,
   options = {
     childField: 'children',
     reverse: false
@@ -196,13 +196,13 @@ function mapDeep(
       for (let i = arr.length - 1; i >= 0; i--) {
         if (isBreak) break;
         const item = arr[i];
-        const re = iterator(item, i, arr, tree, parent, level);
-        if (re === false) {
+        const result = iteratee(item, i, arr, tree, parent, level);
+        if (result === false) {
           isBreak = true;
           break;
         }
-        if (re === true) continue;
-        const newItem = objectOmit(re, [childField]);
+        if (result === true) continue;
+        const newItem = objectOmit(result, [childField]);
         output.push(newItem);
         const children = item[childField];
         if (Array.isArray(children)) {
@@ -214,13 +214,13 @@ function mapDeep(
       for (let i = 0; i < arr.length; i++) {
         if (isBreak) break;
         const item = arr[i];
-        const re = iterator(item, i, arr, tree, parent, level);
-        if (re === false) {
+        const result = iteratee(item, i, arr, tree, parent, level);
+        if (result === false) {
           isBreak = true;
           break;
         }
-        if (re === true) continue;
-        const newItem = objectOmit(re, [childField]);
+        if (result === true) continue;
+        const newItem = objectOmit(result, [childField]);
         output.push(newItem);
         const children = item[childField];
         if (Array.isArray(children)) {
@@ -238,14 +238,14 @@ function mapDeep(
 /**
  * Retrieves the path (ancestors + self) for a given node ID.
  *
- * @param {ArrayLike<T>} tree - Tree data
+ * @param {ArrayLike<V>} tree - Tree data
  * @param {number | string} nodeId - Target node ID
  * @param {ITreeConf} options - Configuration. Default: { childField = 'children', keyField = 'id' }
  * @returns {[(number | string)[], V[]]} - Array of IDs and Array of Nodes from root to target
  */
 function getPathById(tree, nodeId, options = { childField: 'children', keyField: 'id' }) {
   const { childField = 'children', keyField = 'id' } = isObject(options) ? options : {};
-  const flatMap = {};
+  const nodeMap = {};
   // 扁平化 - 使用迭代而非递归，避免栈溢出
   const stack = [];
   const len = tree.length;
@@ -255,7 +255,7 @@ function getPathById(tree, nodeId, options = { childField: 'children', keyField:
   while (stack.length > 0) {
     const { node, parentId, parent } = stack.pop();
     const id = node[keyField];
-    flatMap[id] = { node, parentId, parent };
+    nodeMap[id] = { node, parentId, parent };
     const children = node[childField];
     if (Array.isArray(children)) {
       const childLen = children.length;
@@ -267,13 +267,13 @@ function getPathById(tree, nodeId, options = { childField: 'children', keyField:
   // 回溯路径
   const ids = [];
   const nodes = [];
-  let current = flatMap[nodeId];
+  let current = nodeMap[nodeId];
   if (!current) return [[], []];
   ids.push(nodeId);
   nodes.push(current.node);
   while (current && current.parentId !== undefined) {
     ids.unshift(current.parentId);
-    const parent = flatMap[current.parentId];
+    const parent = nodeMap[current.parentId];
     if (!parent) break;
     nodes.unshift(parent.node);
     current = parent;
@@ -417,6 +417,9 @@ var tree = {
   filterDeep,
   mapDeep,
   getPathById,
+  /**
+   * @deprecated 已废弃，请使用 getPathById
+   */
   searchTreeById: getPathById,
   formatTree,
   flatTree,

package/dist/esm/type.mjs

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

package/dist/esm/unicodeToolkit.mjs

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

package/dist/esm/unique.mjs

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

package/dist/esm/url.mjs

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

package/dist/esm/validator.mjs

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

package/dist/esm/variable.mjs

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

package/dist/esm/watermark.mjs

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

package/dist/types/func.d.ts

@@ -35,23 +35,9 @@ export interface OnceFunc<F extends AnyFunc> {
  * @returns {AnyFunc}
  */
 export declare const once: <F extends AnyFunc = AnyFunc>(func: F) => OnceFunc<F>;
-/**
- * 设置全局变量
- * @param {string | number | symbol} key
- * @param val
- */
-export declare function setGlobal(key: string | number | symbol, val?: any): void;
-/**
- * 获取全局变量
- * @param {string | number | symbol} key
- * @param val
- */
-export declare function getGlobal<T>(key: string | number | symbol): T | void;
 declare const _default: {
     debounce: <F extends AnyFunc>(func: F, wait?: number) => DebounceFunc<F>;
     throttle: <F_1 extends AnyFunc>(func: F_1, wait: number, immediate?: boolean) => ThrottleFunc<F_1>;
     once: <F_2 extends AnyFunc = AnyFunc>(func: F_2) => OnceFunc<F_2>;
-    getGlobal: typeof getGlobal;
-    setGlobal: typeof setGlobal;
 };
 export default _default;

package/dist/types/tree.d.ts

@@ -11,13 +11,13 @@ export interface ISearchTreeOpts {
 }
 export interface IFilterCondition<V> {
     keyword?: string;
-    filter?: (args: V) => boolean;
+    filter?: (val: V) => boolean;
 }
 /**
  * Tree traversal function (default DFS, supports continue and break operations).
  * Can be used to traverse Array and NodeList type data.
- * @param {V[]} tree - Tree data
- * @param {Function} iterator - Iterator function. Returns true to continue, false to break.
+ * @param {ArrayLike<V>} tree - Tree data
+ * @param {Function} iteratee - Iteratee function. Returns true to continue, false to break.
  * @param {object} options - Options to customize child element name, reverse traversal, breadth-first traversal. Default: {
     childField: 'children',
     reverse: false,
@@ -26,7 +26,7 @@ export interface IFilterCondition<V> {
   }
  * @returns {*}
  */
-export declare function forEachDeep<V>(tree: V[], iterator: (val: V, index: number, currentArr: V[], tree: V[], parent: V | null, level: number) => boolean | void, options?: {
+export declare function forEachDeep<V>(tree: ArrayLike<V>, iteratee: (val: V, index: number, currentArr: ArrayLike<V>, tree: ArrayLike<V>, parent: V | null, level: number) => boolean | void, options?: {
     childField?: string;
     reverse?: boolean;
     breadthFirst?: boolean;
@@ -34,7 +34,7 @@ export declare function forEachDeep<V>(tree: V[], iterator: (val: V, index: numb
 }): void;
 /**
  * Tree search function, can be used to search Array and NodeList type data.
- * @param {V[]} tree - Tree data
+ * @param {ArrayLike<V>} tree - Tree data
  * @param {Function} predicate - Predicate function
  * @param {object} options - Options to customize child element name, reverse traversal, breadth-first traversal. Default: {
     childField: 'children',
@@ -44,7 +44,7 @@ export declare function forEachDeep<V>(tree: V[], iterator: (val: V, index: numb
   }
  * @returns {V|null}
  */
-export declare function findDeep<V>(tree: V[], predicate: (val: V, index: number, currentArr: V[], tree: V[], parent: V | null, level: number) => boolean | void, options?: {
+export declare function findDeep<V>(tree: ArrayLike<V>, predicate: (val: V, index: number, currentArr: ArrayLike<V>, tree: ArrayLike<V>, parent: V | null, level: number) => boolean | void, options?: {
     childField?: string;
     reverse?: boolean;
     breadthFirst?: boolean;
@@ -52,7 +52,7 @@ export declare function findDeep<V>(tree: V[], predicate: (val: V, index: number
 }): V | null;
 /**
  * Tree filter function, can be used to filter Array and NodeList type data.
- * @param {V[]} tree - Tree data
+ * @param {ArrayLike<V>} tree - Tree data
  * @param {Function} predicate - Predicate function
  * @param {object} options - Options to customize child element name, reverse traversal, breadth-first traversal. Default: {
     childField: 'children',
@@ -62,7 +62,7 @@ export declare function findDeep<V>(tree: V[], predicate: (val: V, index: number
   }
  * @returns {V[]}
  */
-export declare function filterDeep<V>(tree: V[], predicate: (val: V, index: number, currentArr: V[], tree: V[], parent: V | null, level: number) => boolean | void, options?: {
+export declare function filterDeep<V>(tree: ArrayLike<V>, predicate: (val: V, index: number, currentArr: ArrayLike<V>, tree: ArrayLike<V>, parent: V | null, level: number) => boolean | void, options?: {
     childField?: string;
     reverse?: boolean;
     breadthFirst?: boolean;
@@ -73,15 +73,15 @@ export declare function filterDeep<V>(tree: V[], predicate: (val: V, index: numb
  * Can be used for inserting or removing tree items.
  *
  * Can traverse any array-like object with a length property and numeric keys.
- * @param {V[]} tree - Tree data
- * @param {Function} iterator - Iterator function. Returns true to continue, false to break.
+ * @param {ArrayLike<V>} tree - Tree data
+ * @param {Function} iteratee - Iteratee function. Returns true to continue, false to break.
  * @param {object} options - Options to customize child element name, reverse traversal. Default: {
     childField: 'children',
     reverse: false,
   }
  * @returns {any[]} A new tree structure
  */
-export declare function mapDeep<T>(tree: T[], iterator: (val: T, index: number, currentArr: T[], tree: T[], parent: T | null, level: number) => {
+export declare function mapDeep<V>(tree: ArrayLike<V>, iteratee: (val: V, index: number, currentArr: ArrayLike<V>, tree: ArrayLike<V>, parent: V | null, level: number) => {
     [k: string | number]: any;
 } | boolean, options?: {
     childField?: string;
@@ -92,12 +92,12 @@ export type ITreeConf = Omit<IFieldOptions, 'pidField'>;
 /**
  * Retrieves the path (ancestors + self) for a given node ID.
  *
- * @param {ArrayLike<T>} tree - Tree data
+ * @param {ArrayLike<V>} tree - Tree data
  * @param {number | string} nodeId - Target node ID
  * @param {ITreeConf} options - Configuration. Default: { childField = 'children', keyField = 'id' }
  * @returns {[(number | string)[], V[]]} - Array of IDs and Array of Nodes from root to target
  */
-export declare function getPathById<V>(tree: V[], nodeId: IdLike, options?: ITreeConf): [(number | string)[], any[]];
+export declare function getPathById<V>(tree: ArrayLike<V>, nodeId: IdLike, options?: ITreeConf): [(number | string)[], any[]];
 export { getPathById as searchTreeById };
 /**
  * Converts a flat array into a tree structure.
@@ -144,6 +144,9 @@ declare const _default: {
     filterDeep: typeof filterDeep;
     mapDeep: typeof mapDeep;
     getPathById: typeof getPathById;
+    /**
+     * @deprecated 已废弃，请使用 getPathById
+     */
     searchTreeById: typeof getPathById;
     formatTree: typeof formatTree;
     flatTree: typeof flatTree;