@gx-design-vue/pro-utils 0.1.3 → 0.2.0-alpha.0

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2022 gx12358
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -1,5 +1,76 @@
-# Pro Utils
+<div align="center"><a name="readme-top"></a>
 
-```shell
+<img height="180" src="https://gx12358.cn/resource/img/favicon.ico">
+
+<h1>Pro Utils</h1>
+
+</div>
+
+## ✨ Features
+
+- 🌈 Enterprise-class UI designed for web applications.
+- 📦 A set of high-quality Vue3 components out of the box.
+- 🛡 Written in TypeScript with predictable static types.
+- ⚙️ Whole package of design resources and development tools.
+- 🌍 Internationalization support for dozens of languages.
+- 🎨 Powerful theme customization based on CSS-in-JS.
+
+## 🖥 Environment Support
+
+- Modern browsers
+- Server-side Rendering
+- [Electron](https://www.electronjs.org/)
+
+| [<img src="https://raw.githubusercontent.com/alrra/browser-logos/master/src/edge/edge_48x48.png" alt="Edge" width="24px" height="24px" />](https://godban.github.io/browsers-support-badges/)<br>Edge | [<img src="https://raw.githubusercontent.com/alrra/browser-logos/master/src/firefox/firefox_48x48.png" alt="Firefox" width="24px" height="24px" />](https://godban.github.io/browsers-support-badges/)<br>Firefox | [<img src="https://raw.githubusercontent.com/alrra/browser-logos/master/src/chrome/chrome_48x48.png" alt="Chrome" width="24px" height="24px" />](https://godban.github.io/browsers-support-badges/)<br>Chrome | [<img src="https://raw.githubusercontent.com/alrra/browser-logos/master/src/safari/safari_48x48.png" alt="Safari" width="24px" height="24px" />](https://godban.github.io/browsers-support-badges/)<br>Safari | [<img src="https://raw.githubusercontent.com/alrra/browser-logos/master/src/electron/electron_48x48.png" alt="Electron" width="24px" height="24px" />](https://godban.github.io/browsers-support-badges/)<br>Electron |
+| --- | --- | --- | --- | --- |
+| Edge | last 2 versions | last 2 versions | last 2 versions | last 2 versions |
+
+## 📦 Install
+
+```bash
+npm install @gx-design-vue/pro-utils
+```
+
+```bash
+yarn add @gx-design-vue/pro-utils
+```
+
+```bash
 pnpm add @gx-design-vue/pro-utils
 ```
+
+```bash
+bun add @gx-design-vue/pro-utils
+```
+
+## Acknowledgements
+
+Antdv Next is inspired by and built upon the following open-source projects.
+
+- [Ant Design](https://ant.design/)
+- [Vue.js](https://vuejs.org/)
+- [Vite](https://vitejs.dev/)
+
+## Maintainer
+
+[@gx12358](https://github.com/gx12358/vue3-antd-admin)
+
+## Contributors
+
+<a href="https://github.com/gx12358/vue3-antd-admin/graphs/contributors">
+  <img alt="Contributors" src="https://contrib.rocks/image?repo=gx12358/vue3-antd-admin" />
+</a>
+
+## Special Thanks
+
+Thanks to the [vbenjs/vue-vben-admin](https://github.com/gx12358/vue3-antd-admin) project for providing inspiration and reference implementation.
+
+## License
+
+[MIT © gx12358-2021](./LICENSE)
+
+## `Star`
+
+Thank you very much for the stars from kind-hearted people, thank you for your support :heart:
+
+[![Stargazers repo roster for @gx12358/vue3-antd-admin](https://bytecrank.com/nastyox/reporoster/php/stargazersSVG.php?user=gx12358&repo=vue3-antd-admin)](https://github.com/gx12358/vue3-antd-admin/stargazers)

package/dist/array/index.d.ts

@@ -0,0 +1,5 @@
+import { arraySlice } from "./slice.js";
+import { compareArray, compareArraySort, compareArrayTimeSort, compareTime } from "./sort.js";
+import { filterTree, findSourceByTree, findValueAndAncestors, getArrayLast, getLevelData, getMaxFloor, getSortIndex, treeData } from "./tree.js";
+import { arrayUnique } from "./unique.js";
+export { arraySlice, arrayUnique, compareArray, compareArraySort, compareArrayTimeSort, compareTime, filterTree, findSourceByTree, findValueAndAncestors, getArrayLast, getLevelData, getMaxFloor, getSortIndex, treeData };

package/dist/array/index.js

@@ -0,0 +1,6 @@
+import { arraySlice } from "./slice.js";
+import { compareArray, compareArraySort, compareArrayTimeSort, compareTime } from "./sort.js";
+import { filterTree, findSourceByTree, findValueAndAncestors, getArrayLast, getLevelData, getMaxFloor, getSortIndex, treeData } from "./tree.js";
+import { arrayUnique } from "./unique.js";
+
+export { arraySlice, arrayUnique, compareArray, compareArraySort, compareArrayTimeSort, compareTime, filterTree, findSourceByTree, findValueAndAncestors, getArrayLast, getLevelData, getMaxFloor, getSortIndex, treeData };

package/dist/array/slice.d.ts

@@ -0,0 +1,11 @@
+//#region src/array/slice.d.ts
+/**
+ * 数组切片，根据范围筛选数组元素
+ *
+ * @param data - 源数组
+ * @param range - 范围，可以是数字（前n个）或数组[start, end]
+ * @returns 筛选后的数组
+ */
+declare function arraySlice<T = Record<string, any>>(data: T[], range: number | number[]): T[];
+//#endregion
+export { arraySlice };

package/dist/array/slice.js

@@ -0,0 +1,29 @@
+import { isArray, isNumber } from "../is/type.js";
+import "../is/index.js";
+
+//#region src/array/slice.ts
+/**
+* 数组切片，根据范围筛选数组元素
+*
+* @param data - 源数组
+* @param range - 范围，可以是数字（前n个）或数组[start, end]
+* @returns 筛选后的数组
+*/
+function arraySlice(data, range) {
+	if (!isArray(data)) return [];
+	return data?.filter((_, index) => {
+		if (isNumber(range)) return index <= range - 1;
+		else if (isArray(range) && range.length === 2) {
+			const r = range;
+			const start = r[0] - 1;
+			return index <= (r[1] ? r[1] - 1 : data.length - 1) && index >= start;
+		} else if (isArray(range) && range.length === 1) {
+			const start = range[0] - 1;
+			return index <= data.length - 1 && index >= start;
+		}
+		return true;
+	});
+}
+
+//#endregion
+export { arraySlice };

package/dist/array/sort.d.ts

@@ -0,0 +1,41 @@
+//#region src/array/sort.d.ts
+/**
+ * 比较数组元素（用于排序）
+ *
+ * @param obj1 - 第一个对象
+ * @param obj2 - 第二个对象
+ * @param key - 比较的键
+ * @param sort - 排序方向，0 从小到大，1 从大到小
+ * @returns 比较结果
+ */
+declare function compareArray<T = Record<string, any>>(obj1: T, obj2: T, key: keyof T, sort?: 0 | 1): number;
+/**
+ * 比较时间（用于排序）
+ *
+ * @param obj1 - 第一个对象
+ * @param obj2 - 第二个对象
+ * @param key - 比较的键
+ * @param sort - 排序方向，0 从小到大，1 从大到小
+ * @returns 比较结果
+ */
+declare function compareTime<T = Record<string, any>>(obj1: T, obj2: T, key: keyof T, sort?: 0 | 1): number;
+/**
+ * 数组排序
+ *
+ * @param dataSource - 数据源
+ * @param key - 排序键
+ * @param sort - 排序方向，0 从小到大，1 从大到小
+ * @returns 排序后的数组
+ */
+declare function compareArraySort<T = Record<string, any>>(dataSource: T[], key: keyof T, sort?: 0 | 1): T[];
+/**
+ * 按时间排序
+ *
+ * @param dataSource - 数据源
+ * @param key - 排序键
+ * @param sort - 排序方向，0 从小到大，1 从大到小
+ * @returns 排序后的数组
+ */
+declare function compareArrayTimeSort<T = Record<string, any>>(dataSource: T[], key: keyof T, sort?: 0 | 1): T[];
+//#endregion
+export { compareArray, compareArraySort, compareArrayTimeSort, compareTime };

package/dist/array/sort.js

@@ -0,0 +1,65 @@
+import { isNumber } from "../is/type.js";
+import "../is/index.js";
+
+//#region src/array/sort.ts
+/**
+* 比较数组元素（用于排序）
+*
+* @param obj1 - 第一个对象
+* @param obj2 - 第二个对象
+* @param key - 比较的键
+* @param sort - 排序方向，0 从小到大，1 从大到小
+* @returns 比较结果
+*/
+function compareArray(obj1, obj2, key, sort = 0) {
+	const newType = isNumber(sort) ? sort === 0 || sort === 1 ? sort : 0 : 0;
+	const prev = obj1[key];
+	const next = obj2[key];
+	let result = 0;
+	if (prev < next) result = newType === 0 ? -1 : 0;
+	else if (prev > next) result = newType === 0 ? 0 : -1;
+	return result;
+}
+/**
+* 比较时间（用于排序）
+*
+* @param obj1 - 第一个对象
+* @param obj2 - 第二个对象
+* @param key - 比较的键
+* @param sort - 排序方向，0 从小到大，1 从大到小
+* @returns 比较结果
+*/
+function compareTime(obj1, obj2, key, sort = 0) {
+	const newType = isNumber(sort) ? sort === 0 || sort === 1 ? sort : 0 : 0;
+	const prev = new Date(obj1[key]);
+	const next = new Date(obj2[key]);
+	let result = 0;
+	if (prev < next) result = newType === 0 ? -1 : 0;
+	else if (prev > next) result = newType === 0 ? 0 : -1;
+	return result;
+}
+/**
+* 数组排序
+*
+* @param dataSource - 数据源
+* @param key - 排序键
+* @param sort - 排序方向，0 从小到大，1 从大到小
+* @returns 排序后的数组
+*/
+function compareArraySort(dataSource, key, sort = 0) {
+	return dataSource.sort((a, b) => compareArray(a, b, key, sort));
+}
+/**
+* 按时间排序
+*
+* @param dataSource - 数据源
+* @param key - 排序键
+* @param sort - 排序方向，0 从小到大，1 从大到小
+* @returns 排序后的数组
+*/
+function compareArrayTimeSort(dataSource, key, sort = 0) {
+	return dataSource.sort((a, b) => compareTime(a, b, key, sort));
+}
+
+//#endregion
+export { compareArray, compareArraySort, compareArrayTimeSort, compareTime };

package/dist/array/tree.d.ts

@@ -0,0 +1,83 @@
+import { BasicTablePageConfig, RecordType } from "../typing.js";
+
+//#region src/array/tree.d.ts
+/**
+ * 获取树形结构最深的层级数
+ *
+ * @param data - 树形数据
+ * @param childrenKey - 子节点键名
+ * @returns 最大深度
+ */
+declare function getMaxFloor<T>(data: T[], childrenKey?: keyof T): number;
+/**
+ * 树形转平级
+ *
+ * @param data - 树形数据
+ * @param filed - 子节点键名
+ * @returns 平级数组
+ */
+declare function getLevelData<T extends RecordType = RecordType>(data: T[], filed?: keyof T): T[];
+/**
+ * 构造树型结构数据
+ *
+ * @param source - 数据源
+ * @param options - 配置选项
+ * @returns 树形数据
+ */
+declare function treeData<T extends RecordType = RecordType>(source: T[], options?: {
+  id?: keyof T;
+  parentId?: keyof T;
+  children?: keyof T;
+  rootId?: number | false;
+  emptyChildren?: boolean;
+}): T[];
+/**
+ * 树形数组按照条件过滤
+ *
+ * @param tree - 树形数据
+ * @param predicate - 过滤条件
+ * @returns 过滤后的树
+ */
+declare function filterTree<T = any>(tree: T[], predicate: (val: T) => boolean): any[];
+/**
+ * 给定指定的 value 值，找到其所有的祖先节点
+ *
+ * @param tree - 树形数据
+ * @param targetValue - 目标值
+ * @param fieldNames - 字段名配置
+ * @returns 祖先节点值数组
+ */
+declare function findValueAndAncestors<T = any>(tree: T[], targetValue: any, fieldNames?: {
+  value: 'value';
+  children: 'children';
+}): any[];
+/**
+ * 树形数组递归查找指定对象
+ *
+ * @param tree - 树形数据
+ * @param value - 目标值
+ * @param options - 配置选项
+ * @returns 找到的节点
+ */
+declare function findSourceByTree<T>(tree: T[], value: any, options?: {
+  value: keyof T;
+  children: keyof T;
+}): T | undefined;
+/**
+ * 获取数组最后一个元素
+ *
+ * @param data - 数组
+ * @returns 最后一个元素
+ */
+declare function getArrayLast<T = any>(data: any): T;
+/**
+ * 数组（树形）添加序号
+ *
+ * @param data - 数据
+ * @param pageConfig - 分页配置
+ * @param childrenKey - 子节点键名
+ * @returns 添加序号后的数据
+ */
+declare function getSortIndex<T = RecordType>(data: T[] | undefined, pageConfig: BasicTablePageConfig, childrenKey?: keyof T): any[];
+//#endregion
+export { filterTree, findSourceByTree, findValueAndAncestors, getArrayLast, getLevelData, getMaxFloor, getSortIndex, treeData };

package/dist/array/tree.js

@@ -0,0 +1,157 @@
+import { isArray, isObject } from "../is/type.js";
+import "../is/index.js";
+
+//#region src/array/tree.ts
+/**
+* 获取树形结构最深的层级数
+*
+* @param data - 树形数据
+* @param childrenKey - 子节点键名
+* @returns 最大深度
+*/
+function getMaxFloor(data, childrenKey) {
+	if (!Array.isArray(data) || data.length === 0) return 0;
+	const key = childrenKey || "children";
+	return Math.max(...data.map((item) => {
+		const children = item[key];
+		return 1 + (children ? getMaxFloor(children, key) : 0);
+	}));
+}
+/**
+* 树形转平级
+*
+* @param data - 树形数据
+* @param filed - 子节点键名
+* @returns 平级数组
+*/
+function getLevelData(data, filed = "children") {
+	let newData = [];
+	data.forEach((item) => {
+		newData.push(item);
+		if (isArray(item[filed]) && item[filed].length > 0) newData = newData.concat(getLevelData(item[filed], filed));
+	});
+	return newData;
+}
+/**
+* 构造树型结构数据
+*
+* @param source - 数据源
+* @param options - 配置选项
+* @returns 树形数据
+*/
+function treeData(source, options) {
+	if (!source || !isArray(source) || source?.length === 0) return [];
+	const { id = "id", parentId = "parentId", children = "children", emptyChildren = true } = options || {};
+	const rootId = options?.rootId ?? 0;
+	const cloneData = structuredClone(source);
+	return cloneData.map((item) => {
+		if (!emptyChildren && item[children] && item[children]?.length === 0) delete item[children];
+		return item;
+	}).filter((father) => {
+		const branchArr = cloneData.filter((child) => father[id] === child[parentId]);
+		if (branchArr.length > 0) father[children] = branchArr;
+		else if (emptyChildren) father[children] = [];
+		return rootId === false ? true : father[parentId] === rootId;
+	});
+}
+/**
+* 树形数组按照条件过滤
+*
+* @param tree - 树形数据
+* @param predicate - 过滤条件
+* @returns 过滤后的树
+*/
+function filterTree(tree, predicate) {
+	return tree.map((node) => {
+		const newNode = { ...node };
+		if (newNode.children) newNode.children = filterTree(newNode.children, predicate);
+		if (predicate(newNode) || newNode.children && newNode.children.length > 0) return newNode;
+		return null;
+	}).filter(Boolean);
+}
+/**
+* 给定指定的 value 值，找到其所有的祖先节点
+*
+* @param tree - 树形数据
+* @param targetValue - 目标值
+* @param fieldNames - 字段名配置
+* @returns 祖先节点值数组
+*/
+function findValueAndAncestors(tree, targetValue, fieldNames) {
+	const { value, children } = fieldNames || {
+		value: "value",
+		children: "children"
+	};
+	let result = [];
+	function dfs(node, path) {
+		if (node[value] === targetValue) {
+			result = [...path, node[value]];
+			return true;
+		}
+		if (node[children]) {
+			for (const child of node[children]) if (dfs(child, [...path, node[value]])) return true;
+		}
+		return false;
+	}
+	for (const root of tree) if (dfs(root, [])) break;
+	return result;
+}
+/**
+* 树形数组递归查找指定对象
+*
+* @param tree - 树形数据
+* @param value - 目标值
+* @param options - 配置选项
+* @returns 找到的节点
+*/
+function findSourceByTree(tree, value, options) {
+	const key = options?.value || "id";
+	const childrenKey = options?.children || "children";
+	for (const node of tree) {
+		if (node[key] === value) return node;
+		const children = node[childrenKey];
+		if (children) {
+			const result = findSourceByTree(children, value, options);
+			if (result) return result;
+		}
+	}
+}
+/**
+* 获取数组最后一个元素
+*
+* @param data - 数组
+* @returns 最后一个元素
+*/
+function getArrayLast(data) {
+	if (data && isArray(data)) return data[data.length - 1];
+	return null;
+}
+/**
+* 数组（树形）添加序号
+*
+* @param data - 数据
+* @param pageConfig - 分页配置
+* @param childrenKey - 子节点键名
+* @returns 添加序号后的数据
+*/
+function getSortIndex(data = [], pageConfig, childrenKey = "children") {
+	function getChildSortIndex(parentSort, data) {
+		return data.map((item, index) => {
+			const sortIndex = `${parentSort}-${index + 1}`;
+			if (item[childrenKey]) item[childrenKey] = getChildSortIndex(sortIndex, item[childrenKey]);
+			item.sortIndex = sortIndex;
+			return item;
+		});
+	}
+	return structuredClone(data).map((item, key) => {
+		const current = isObject(pageConfig) ? pageConfig.current || 1 : 1;
+		const pageSize = isObject(pageConfig) ? pageConfig.pageSize || 10 : 10;
+		const sortIndex = `${current ? (current - 1) * pageSize + (key + 1) : key + 1}`;
+		if (item[childrenKey]) item[childrenKey] = getChildSortIndex(`${sortIndex}`, item[childrenKey]);
+		item.sortIndex = sortIndex;
+		return item;
+	});
+}
+
+//#endregion
+export { filterTree, findSourceByTree, findValueAndAncestors, getArrayLast, getLevelData, getMaxFloor, getSortIndex, treeData };

package/dist/array/unique.d.ts

@@ -0,0 +1,12 @@
+import { RecordType } from "../typing.js";
+
+//#region src/array/unique.d.ts
+/**
+ * 数组去重
+ *
+ * @param data - 源数组
+ * @returns 去重后的新数组
+ */
+declare function arrayUnique<T = RecordType>(data: T[]): T[];
+//#endregion
+export { arrayUnique };

package/dist/array/unique.js

@@ -0,0 +1,14 @@
+//#region src/array/unique.ts
+/**
+* 数组去重
+*
+* @param data - 源数组
+* @returns 去重后的新数组
+*/
+function arrayUnique(data) {
+	const set = new Set(data);
+	return Array.from(set);
+}
+
+//#endregion
+export { arrayUnique };

package/dist/base64/index.d.ts

@@ -0,0 +1,26 @@
+//#region src/base64/index.d.ts
+/**
+ * Base64 编解码类
+ */
+declare class Base64 {
+  _keyStr: string;
+  constructor();
+  _utf8_encode(string: string): string;
+  _utf8_decode(utftext: string): string;
+  /**
+   * 加密方法
+   *
+   * @param input - 要加密的字符串
+   * @returns Base64 编码后的字符串
+   */
+  encode(input: string): string;
+  /**
+   * 解密方法
+   *
+   * @param input - 要解密的 Base64 字符串
+   * @returns 解码后的字符串
+   */
+  decode(input: string): string;
+}
+//#endregion
+export { Base64 as default };

package/dist/base64/index.js

@@ -0,0 +1,106 @@
+//#region src/base64/index.ts
+/**
+* Base64 编解码类
+*/
+var Base64 = class {
+	_keyStr;
+	constructor() {
+		this._keyStr = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=";
+	}
+	_utf8_encode(string) {
+		string = string.replace(/\r\n/g, "\n");
+		let utftext = "";
+		for (let n = 0; n < string.length; n++) {
+			const c = string.charCodeAt(n);
+			if (c < 128) utftext += String.fromCharCode(c);
+			else if (c > 127 && c < 2048) {
+				utftext += String.fromCharCode(c >> 6 | 192);
+				utftext += String.fromCharCode(c & 63 | 128);
+			} else {
+				utftext += String.fromCharCode(c >> 12 | 224);
+				utftext += String.fromCharCode(c >> 6 & 63 | 128);
+				utftext += String.fromCharCode(c & 63 | 128);
+			}
+		}
+		return utftext;
+	}
+	_utf8_decode(utftext) {
+		let string = "";
+		let i = 0;
+		let c = 0;
+		let c1 = 0;
+		let c2 = 0;
+		while (i < utftext.length) {
+			c = utftext.charCodeAt(i);
+			if (c < 128) {
+				string += String.fromCharCode(c);
+				i++;
+			} else if (c > 191 && c < 224) {
+				c1 = utftext.charCodeAt(i + 1);
+				string += String.fromCharCode((c & 31) << 6 | c1 & 63);
+				i += 2;
+			} else {
+				c1 = utftext.charCodeAt(i + 1);
+				c2 = utftext.charCodeAt(i + 2);
+				string += String.fromCharCode((c & 15) << 12 | (c1 & 63) << 6 | c2 & 63);
+				i += 3;
+			}
+		}
+		return string;
+	}
+	/**
+	* 加密方法
+	*
+	* @param input - 要加密的字符串
+	* @returns Base64 编码后的字符串
+	*/
+	encode(input) {
+		let output = "";
+		let chr1, chr2, chr3, enc1, enc2, enc3, enc4;
+		let i = 0;
+		input = this._utf8_encode(input);
+		while (i < input.length) {
+			chr1 = input.charCodeAt(i++);
+			chr2 = input.charCodeAt(i++);
+			chr3 = input.charCodeAt(i++);
+			enc1 = chr1 >> 2;
+			enc2 = (chr1 & 3) << 4 | chr2 >> 4;
+			enc3 = (chr2 & 15) << 2 | chr3 >> 6;
+			enc4 = chr3 & 63;
+			if (Number.isNaN(chr2)) enc3 = enc4 = 64;
+			else if (Number.isNaN(chr3)) enc4 = 64;
+			output = output + this._keyStr.charAt(enc1) + this._keyStr.charAt(enc2) + this._keyStr.charAt(enc3) + this._keyStr.charAt(enc4);
+		}
+		return output;
+	}
+	/**
+	* 解密方法
+	*
+	* @param input - 要解密的 Base64 字符串
+	* @returns 解码后的字符串
+	*/
+	decode(input) {
+		let output = "";
+		let chr1, chr2, chr3;
+		let enc1, enc2, enc3, enc4;
+		let i = 0;
+		input = input.replace(/[^A-Z0-9+/=]/gi, "");
+		while (i < input.length) {
+			enc1 = this._keyStr.indexOf(input.charAt(i++));
+			enc2 = this._keyStr.indexOf(input.charAt(i++));
+			enc3 = this._keyStr.indexOf(input.charAt(i++));
+			enc4 = this._keyStr.indexOf(input.charAt(i++));
+			chr1 = enc1 << 2 | enc2 >> 4;
+			chr2 = (enc2 & 15) << 4 | enc3 >> 2;
+			chr3 = (enc3 & 3) << 6 | enc4;
+			output = output + String.fromCharCode(chr1);
+			if (enc3 !== 64) output = output + String.fromCharCode(chr2);
+			if (enc4 !== 64) output = output + String.fromCharCode(chr3);
+		}
+		output = this._utf8_decode(output);
+		return output;
+	}
+};
+
+//#endregion
+export { Base64 as default };

package/dist/class/index.d.ts

@@ -0,0 +1,2 @@
+import { PrefixCls, getPrefixCls } from "./prefix.js";
+export { PrefixCls, getPrefixCls };

package/dist/class/index.js

@@ -0,0 +1,3 @@
+import { getPrefixCls } from "./prefix.js";
+
+export { getPrefixCls };