@gct-paas/core 0.1.4-dev.10 → 0.1.4-dev.12

package/es/utils/treeHelper/treeHelper.mjs

@@ -1,234 +1,206 @@
-class TreeHelper {
-  /**
-   * 默认配置
-   */
-  static _DEFAULT_CONFIG = {
-    id: "id",
-    children: "children",
-    pid: "pid",
-    deep: true
-  };
-  /**
-   * 获取合并后的配置
-   * @param config 用户配置
-   * @returns 合并后的完整配置
-   */
-  static _getConfig(config) {
-    return Object.assign({}, TreeHelper._DEFAULT_CONFIG, config);
-  }
-  /**
-   * 将列表数据转换为树形结构
-   * @param list 列表数据
-   * @param config 配置项
-   * @param callBack 节点转换回调函数
-   * @returns 树形结构数据
-   */
-  static listToTree(list, config = {}, callBack) {
-    const conf = TreeHelper._getConfig(config);
-    const nodeMap = /* @__PURE__ */ new Map();
-    const result = [];
-    const { id, children, pid, deep } = conf;
-    for (const node of list) {
-      const record = node;
-      if (!deep) {
-        record[children] = record[pid] === "ROOT" ? record[children] ?? [] : [];
-      } else {
-        record[children] = record[children] ?? void 0;
-      }
-      nodeMap.set(record[id], callBack(node));
-    }
-    for (const node of list) {
-      const record = node;
-      const parent = nodeMap.get(record[pid]);
-      if (parent) {
-        const parentRecord = parent;
-        if (!parentRecord[children]) {
-          parentRecord[children] = [];
-        }
-        parentRecord[children].push(callBack(node));
-      } else {
-        result.push(callBack(node));
-      }
-    }
-    return result;
-  }
-  /**
-   * 将树形结构转换为列表数据
-   * @param tree 树形结构数据
-   * @param config 配置项
-   * @returns 列表数据
-   */
-  static treeToList(tree, config = {}) {
-    const { children } = TreeHelper._getConfig(config);
-    const result = [...tree];
-    for (let i = 0; i < result.length; i++) {
-      const record = result[i];
-      const child = record[children];
-      if (!Array.isArray(child)) continue;
-      result.splice(i + 1, 0, ...child);
-    }
-    return result;
-  }
-  /**
-   * 在树中查找单个节点
-   * @param tree 树形结构数据
-   * @param func 查找条件函数
-   * @param config 配置项
-   * @returns 找到的节点或 null
-   */
-  static findNode(tree, func, config = {}) {
-    const { children } = TreeHelper._getConfig(config);
-    const list = tree ? [...tree] : [];
-    for (const node of list) {
-      if (func(node)) return node;
-      const record = node;
-      const child = record[children];
-      if (Array.isArray(child)) {
-        list.push(...child);
-      }
-    }
-    return null;
-  }
-  /**
-   * 在树中查找所有匹配的节点
-   * @param tree 树形结构数据
-   * @param func 查找条件函数
-   * @param config 配置项
-   * @returns 所有匹配的节点数组
-   */
-  static findNodeAll(tree, func, config = {}) {
-    const { children } = TreeHelper._getConfig(config);
-    const list = tree ? [...tree] : [];
-    const result = [];
-    for (const node of list) {
-      if (func(node)) result.push(node);
-      const record = node;
-      const child = record[children];
-      if (Array.isArray(child)) {
-        list.push(...child);
-      }
-    }
-    return result;
-  }
-  /**
-   * 查找节点的路径
-   * @param tree 树形结构数据
-   * @param func 查找条件函数
-   * @param config 配置项
-   * @returns 从根节点到目标节点的路径数组,未找到返回 null
-   */
-  static findPath(tree, func, config = {}) {
-    const { children } = TreeHelper._getConfig(config);
-    const path = [];
-    const list = tree ? [...tree] : [];
-    const visitedSet = /* @__PURE__ */ new Set();
-    while (list.length) {
-      const node = list[0];
-      if (visitedSet.has(node)) {
-        path.pop();
-        list.shift();
-      } else {
-        visitedSet.add(node);
-        const record = node;
-        const child = record[children];
-        if (Array.isArray(child)) {
-          list.unshift(...child);
-        }
-        path.push(node);
-        if (func(node)) return path;
-      }
-    }
-    return null;
-  }
-  /**
-   * 查找最近的符合条件的父节点
-   * @param tree 树形结构数据
-   * @param startId 起始节点 ID
-   * @param func 查找条件函数
-   * @param config 配置项
-   * @returns 找到的父节点或 undefined
-   */
-  static findClosestParent(tree, startId, func, config = {}) {
-    const { id } = TreeHelper._getConfig(config);
-    const path = TreeHelper.findPath(
-      tree,
-      (node) => node[id] === startId,
-      config
-    );
-    return path?.reverse().find((n) => func(n));
-  }
-  /**
-   * 将具有 id 和 parentId 的列表转换为树形结构
-   * @param list 列表数据,需要包含 id 和 parentId 字段
-   * @param callBack 节点转换回调函数
-   * @returns 树形结构数据
-   */
-  static list_to_tree(list, callBack) {
-    const map = {};
-    const roots = [];
-    for (let i = 0; i < list.length; i++) {
-      const node = list[i];
-      map[node.id] = i;
-      node.children = [];
-    }
-    for (const node of list) {
-      if (node.parentId === "ROOT" || !node.parentId) {
-        roots.push(callBack(node));
-      } else {
-        const current = node;
-        const parentIndex = map[node.parentId];
-        if (parentIndex !== void 0) {
-          const parent = list[parentIndex];
-          parent.children?.push(callBack(current));
-        }
-      }
-    }
-    return roots;
-  }
-  /**
-   * 获取所有父级路径
-   * @param treeData 树形结构数据
-   * @param path 目标路径
-   * @returns 从根节点到目标节点的所有路径数组
-   */
-  static getAllParentPath(treeData, path) {
-    const menuList = TreeHelper.findPath(treeData, (n) => n.path === path);
-    return (menuList || []).map((item) => item.path);
-  }
-  /**
-   * 递归遍历树并且根据callback返回新数据再拼装成一个新树
-   *
-   * @static
-   * @param {IObject[]} treeData
-   * @param {Function} callback
-   * @param {Partial<ITreeHelperConfig>} [config={}]
-   * @return {*}
-   */
-  static traverseAndBuildTree(treeData, callback, config = {}) {
-    config = this._getConfig(config);
-    const { children } = config;
-    return treeData.map((node) => {
-      const newNode = callback(node) || node;
-      if (children && node[children] && node[children].length > 0) {
-        newNode[children] = this.traverseAndBuildTree(node.children, callback);
-      }
-      return newNode;
-    });
-  }
-  /**
-   * 递归遍历树结构
-   * @param treeData 树形结构数据
-   * @param callBack 回调函数
-   * @param parentNode 父节点
-   */
-  static eachTree(treeData, callBack, parentNode = {}) {
-    treeData.forEach((element) => {
-      const newNode = callBack(element, parentNode) || element;
-      if (element.children) {
-        TreeHelper.eachTree(element.children, callBack, newNode);
-      }
-    });
-  }
-}
-
+//#region src/utils/treeHelper/treeHelper.ts
+/**
+* 树结构数据处理工具类
+* 提供树形数据与列表数据的相互转换、节点查找、路径查找等功能
+*/
+var TreeHelper = class TreeHelper {
+	/**
+	* 默认配置
+	*/
+	static _DEFAULT_CONFIG = {
+		id: "id",
+		children: "children",
+		pid: "pid",
+		deep: true
+	};
+	/**
+	* 获取合并后的配置
+	* @param config 用户配置
+	* @returns 合并后的完整配置
+	*/
+	static _getConfig(config) {
+		return Object.assign({}, TreeHelper._DEFAULT_CONFIG, config);
+	}
+	/**
+	* 将列表数据转换为树形结构
+	* @param list 列表数据
+	* @param config 配置项
+	* @param callBack 节点转换回调函数
+	* @returns 树形结构数据
+	*/
+	static listToTree(list, config = {}, callBack) {
+		const conf = TreeHelper._getConfig(config);
+		const nodeMap = /* @__PURE__ */ new Map();
+		const result = [];
+		const { id, children, pid, deep } = conf;
+		for (const node of list) {
+			const record = node;
+			if (!deep) record[children] = record[pid] === "ROOT" ? record[children] ?? [] : [];
+			else record[children] = record[children] ?? void 0;
+			nodeMap.set(record[id], callBack(node));
+		}
+		for (const node of list) {
+			const record = node;
+			const parent = nodeMap.get(record[pid]);
+			if (parent) {
+				const parentRecord = parent;
+				if (!parentRecord[children]) parentRecord[children] = [];
+				parentRecord[children].push(callBack(node));
+			} else result.push(callBack(node));
+		}
+		return result;
+	}
+	/**
+	* 将树形结构转换为列表数据
+	* @param tree 树形结构数据
+	* @param config 配置项
+	* @returns 列表数据
+	*/
+	static treeToList(tree, config = {}) {
+		const { children } = TreeHelper._getConfig(config);
+		const result = [...tree];
+		for (let i = 0; i < result.length; i++) {
+			const child = result[i][children];
+			if (!Array.isArray(child)) continue;
+			result.splice(i + 1, 0, ...child);
+		}
+		return result;
+	}
+	/**
+	* 在树中查找单个节点
+	* @param tree 树形结构数据
+	* @param func 查找条件函数
+	* @param config 配置项
+	* @returns 找到的节点或 null
+	*/
+	static findNode(tree, func, config = {}) {
+		const { children } = TreeHelper._getConfig(config);
+		const list = tree ? [...tree] : [];
+		for (const node of list) {
+			if (func(node)) return node;
+			const child = node[children];
+			if (Array.isArray(child)) list.push(...child);
+		}
+		return null;
+	}
+	/**
+	* 在树中查找所有匹配的节点
+	* @param tree 树形结构数据
+	* @param func 查找条件函数
+	* @param config 配置项
+	* @returns 所有匹配的节点数组
+	*/
+	static findNodeAll(tree, func, config = {}) {
+		const { children } = TreeHelper._getConfig(config);
+		const list = tree ? [...tree] : [];
+		const result = [];
+		for (const node of list) {
+			if (func(node)) result.push(node);
+			const child = node[children];
+			if (Array.isArray(child)) list.push(...child);
+		}
+		return result;
+	}
+	/**
+	* 查找节点的路径
+	* @param tree 树形结构数据
+	* @param func 查找条件函数
+	* @param config 配置项
+	* @returns 从根节点到目标节点的路径数组,未找到返回 null
+	*/
+	static findPath(tree, func, config = {}) {
+		const { children } = TreeHelper._getConfig(config);
+		const path = [];
+		const list = tree ? [...tree] : [];
+		const visitedSet = /* @__PURE__ */ new Set();
+		while (list.length) {
+			const node = list[0];
+			if (visitedSet.has(node)) {
+				path.pop();
+				list.shift();
+			} else {
+				visitedSet.add(node);
+				const child = node[children];
+				if (Array.isArray(child)) list.unshift(...child);
+				path.push(node);
+				if (func(node)) return path;
+			}
+		}
+		return null;
+	}
+	/**
+	* 查找最近的符合条件的父节点
+	* @param tree 树形结构数据
+	* @param startId 起始节点 ID
+	* @param func 查找条件函数
+	* @param config 配置项
+	* @returns 找到的父节点或 undefined
+	*/
+	static findClosestParent(tree, startId, func, config = {}) {
+		const { id } = TreeHelper._getConfig(config);
+		return TreeHelper.findPath(tree, (node) => node[id] === startId, config)?.reverse().find((n) => func(n));
+	}
+	/**
+	* 将具有 id 和 parentId 的列表转换为树形结构
+	* @param list 列表数据,需要包含 id 和 parentId 字段
+	* @param callBack 节点转换回调函数
+	* @returns 树形结构数据
+	*/
+	static list_to_tree(list, callBack) {
+		const map = {};
+		const roots = [];
+		for (let i = 0; i < list.length; i++) {
+			const node = list[i];
+			map[node.id] = i;
+			node.children = [];
+		}
+		for (const node of list) if (node.parentId === "ROOT" || !node.parentId) roots.push(callBack(node));
+		else {
+			const current = node;
+			const parentIndex = map[node.parentId];
+			if (parentIndex !== void 0) list[parentIndex].children?.push(callBack(current));
+		}
+		return roots;
+	}
+	/**
+	* 获取所有父级路径
+	* @param treeData 树形结构数据
+	* @param path 目标路径
+	* @returns 从根节点到目标节点的所有路径数组
+	*/
+	static getAllParentPath(treeData, path) {
+		return (TreeHelper.findPath(treeData, (n) => n.path === path) || []).map((item) => item.path);
+	}
+	/**
+	* 递归遍历树并且根据callback返回新数据再拼装成一个新树
+	*
+	* @static
+	* @param {IObject[]} treeData
+	* @param {Function} callback
+	* @param {Partial<ITreeHelperConfig>} [config={}]
+	* @return {*}
+	*/
+	static traverseAndBuildTree(treeData, callback, config = {}) {
+		config = this._getConfig(config);
+		const { children } = config;
+		return treeData.map((node) => {
+			const newNode = callback(node) || node;
+			if (children && node[children] && node[children].length > 0) newNode[children] = this.traverseAndBuildTree(node.children, callback);
+			return newNode;
+		});
+	}
+	/**
+	* 递归遍历树结构
+	* @param treeData 树形结构数据
+	* @param callBack 回调函数
+	* @param parentNode 父节点
+	*/
+	static eachTree(treeData, callBack, parentNode = {}) {
+		treeData.forEach((element) => {
+			const newNode = callBack(element, parentNode) || element;
+			if (element.children) TreeHelper.eachTree(element.children, callBack, newNode);
+		});
+	}
+};
+//#endregion
 export { TreeHelper };

package/es/utils/uploader/uploader.d.ts

@@ -0,0 +1,20 @@
+export declare class Uploader {
+    static getFiles({ multiple, acceptList, }: {
+        multiple: boolean;
+        acceptList?: string;
+    }): Promise<File[]>;
+    static beforeUploadFun(file: File, { maxSize, acceptList, beforeUpload, }: {
+        maxSize: number;
+        acceptList: string[];
+        beforeUpload?: (file: File) => Promise<unknown>;
+    }): Promise<undefined>;
+    static uploadByFile(file: File, isApp?: boolean, modelKey?: string): Promise<string>;
+    static toBase64(file: File): Promise<unknown>;
+    /**
+     * 图片压缩转Base64
+     */
+    static compressToBase64(file: File, { quality, scale }?: {
+        quality?: number | undefined;
+        scale?: number | undefined;
+    }): Promise<unknown>;
+}

package/es/utils/uploader/uploader.mjs

@@ -0,0 +1,86 @@
+//#region src/utils/uploader/uploader.ts
+var Uploader = class {
+	static getFiles({ multiple, acceptList }) {
+		const input = document.createElement("input");
+		input.type = "file";
+		input.multiple = !!multiple;
+		input.accept = acceptList || "*";
+		input.click();
+		return new Promise((resolve, reject) => {
+			input.onchange = async () => {
+				const filelist = input.files || [];
+				resolve(Object.values(filelist));
+			};
+			input.onerror = async () => {
+				reject();
+			};
+		});
+	}
+	static async beforeUploadFun(file, { maxSize = 5, acceptList = [], beforeUpload }) {
+		if (file.name.indexOf(",") > -1) return Promise.reject(`文件名不能有逗号`);
+		if (beforeUpload) await beforeUpload(file);
+		if (file.size / 1024 / 1024 > maxSize) return Promise.reject(`【${file.name}】文件大小不能超过 ${maxSize}MB`);
+		if (acceptList.length) {
+			const filename = file?.name?.replaceAll(" ", "")?.match(/\.([A-Za-z0-9]+)$/)?.at(-1);
+			if (!acceptList.includes(`.${filename?.toLocaleLowerCase()}`)) return Promise.reject(`【${file.name}】支持的扩展名为${acceptList.join(" ")}`);
+		}
+	}
+	static async uploadByFile(file, isApp = false, modelKey) {
+		const formData = new FormData();
+		formData.append("file", file, file.name);
+		return "/" + await (isApp ? appUploadapis : passUploadapis)(formData, modelKey);
+	}
+	static toBase64(file) {
+		return new Promise((resolve, reject) => {
+			const reader = new FileReader();
+			reader.onloadend = function() {
+				resolve(reader.result);
+			};
+			reader.onerror = () => reject("转换失败");
+			if (file) reader.readAsDataURL(file);
+		});
+	}
+	/**
+	* 图片压缩转Base64
+	*/
+	static compressToBase64(file, { quality = .8, scale = .8 } = {}) {
+		return new Promise((resolve, reject) => {
+			if (!file.type.startsWith("image/")) {
+				reject("请选择图片文件");
+				return;
+			}
+			if (typeof scale !== "number" || scale <= 0 || scale > 1) {
+				reject("缩放比例必须在0-1之间");
+				return;
+			}
+			const reader = new FileReader();
+			reader.onload = (e) => {
+				const img = new Image();
+				img.onload = () => {
+					const width = Math.floor(img.width * scale);
+					const height = Math.floor(img.height * scale);
+					const canvas = document.createElement("canvas");
+					canvas.width = width;
+					canvas.height = height;
+					const ctx = canvas.getContext("2d");
+					ctx.imageSmoothingEnabled = true;
+					ctx.imageSmoothingQuality = "high";
+					ctx.drawImage(img, 0, 0, width, height);
+					resolve(canvas.toDataURL(file.type, quality));
+				};
+				img.onerror = () => reject("图片加载失败");
+				img.src = e.target?.result;
+			};
+			reader.onerror = () => reject("文件读取失败");
+			reader.readAsDataURL(file);
+		});
+	}
+};
+async function appUploadapis(formData, modelKey) {
+	return _api.apaas.fileResource.postUpload({ ...modelKey ? { modelKey } : {} }, formData, { headers: { "Content-Type": "multipart/form-data;charset=UTF-8" } });
+}
+async function passUploadapis(formData) {
+	return _api.apaas.file.postUploadImage({ bucket: "IMAGE" }, formData, { headers: { "Content-Type": "multipart/form-data;charset=UTF-8" } });
+}
+//#endregion
+export { Uploader };