@unicom-cloud/utils 0.1.45 → 0.1.47

package/pinyin/LICENSE

@@ -1,20 +1,21 @@
 MIT License
 
-Copyright (c) 2020 All contributors to pinyin-match
+Copyright (c) 2022-present zh-lx
 
-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:
+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.
+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/pinyin/index.d.ts

@@ -1 +1,2 @@
-export { default } from "./simplified";
+export * from './lib';
+export { pinyin as default } from './lib';

package/pinyin/index.js

@@ -1,4 +1,15 @@
-/* 潘启宝 2026-05-18 15:16:47 星期一 */
-import e from "./simplified.js";
-export { e as default };
+/* 潘启宝 2026-05-26 15:49:57 星期二 山东省济南市 */
+import { clearCustomDict as e, customPinyin as t } from "./lib/core/custom/index.js";
+import { addTraditionalDict as n, getTraditionalDict as r } from "./lib/core/traditional/index.js";
+import { getFinalParts as i, getInitialAndFinal as a, getNumOfTone as o } from "./lib/core/pinyin/handle.js";
+import { convert as s } from "./lib/core/convert/index.js";
+import { addDict as c, removeDict as l } from "./lib/core/dict/index.js";
+import { pinyin as u } from "./lib/core/pinyin/index.js";
+import { html as d } from "./lib/core/html/index.js";
+import { match as f } from "./lib/core/match/index.js";
+import { polyphonic as p } from "./lib/core/polyphonic/index.js";
+import { OutputFormat as m } from "./lib/core/segment/middlewares.js";
+import { segment as h } from "./lib/core/segment/index.js";
+import "./lib/index.js";
+export { m as OutputFormat, c as addDict, n as addTraditionalDict, e as clearCustomDict, s as convert, t as customPinyin, u as default, i as getFinalParts, a as getInitialAndFinal, o as getNumOfTone, r as getTraditionalDict, d as html, f as match, u as pinyin, p as polyphonic, l as removeDict, h as segment };
 /* 独立思考，明辨是非 */

package/pinyin/lib/common/constant.d.ts

@@ -0,0 +1,16 @@
+export declare const DoubleUnicodePrefixReg: RegExp;
+export declare const DoubleUnicodeSuffixReg: RegExp;
+export declare const DoubleUnicodeReg: RegExp;
+export declare const DoubleUnicodeCharReg: RegExp;
+export declare const Probability: {
+    readonly Unknown: 1e-13;
+    readonly Rule: 1e-12;
+    readonly DICT: 2e-8;
+    readonly Surname: 1;
+    readonly Custom: 1;
+};
+export declare const Priority: {
+    Normal: number;
+    Surname: number;
+    Custom: number;
+};

package/pinyin/lib/common/constant.js

@@ -0,0 +1,16 @@
+/* 潘启宝 2026-05-26 15:49:57 星期二 山东省济南市 */
+//#region utils/pinyin/lib/common/constant.ts
+var e = /^[\uD800-\uDBFF]$/, t = /^[\uDC00-\uDFFF]$/, n = /[\uD800-\uDBFF][\uDC00-\uDFFF]/g, r = {
+	Unknown: 1e-13,
+	Rule: 1e-12,
+	DICT: 2e-8,
+	Surname: 1,
+	Custom: 1
+}, i = {
+	Normal: 1,
+	Surname: 10,
+	Custom: 100
+};
+//#endregion
+export { e as DoubleUnicodePrefixReg, n as DoubleUnicodeReg, t as DoubleUnicodeSuffixReg, i as Priority, r as Probability };
+/* 独立思考，明辨是非 */

package/pinyin/lib/common/segmentit/AC.d.ts

@@ -0,0 +1,18 @@
+import type { SurnameMode } from '../type';
+import type { MatchPattern, Pattern } from './TrieNode';
+import { TokenizationAlgorithm, TrieNode } from './TrieNode';
+export declare class AC {
+    root: TrieNode;
+    dictMap: Map<string | symbol, Set<Pattern>>;
+    queues: TrieNode[][];
+    constructor();
+    build(patternList: Pattern[]): void;
+    buildTrie(patternList: Pattern[]): void;
+    buildFailPointer(): void;
+    addPatternToDictMap(pattern: Pattern): void;
+    addNodeToQueues(trieNode: TrieNode): void;
+    insertPattern(patterns: Pattern[], pattern: Pattern): void;
+    removeDict(dictName: string | symbol): void;
+    match(text: string, surname: SurnameMode): MatchPattern[];
+    search(text: string, surname: SurnameMode, algorithm?: TokenizationAlgorithm): MatchPattern[];
+}

package/pinyin/lib/common/segmentit/AC.js

@@ -0,0 +1,95 @@
+/* 潘启宝 2026-05-26 15:49:57 星期二 山东省济南市 */
+import { Priority as e } from "../constant.js";
+import { splitString as t, stringLength as n } from "../utils.js";
+import { maxProbability as r } from "./max-probability.js";
+import { minTokenization as i } from "./min-tokenization.js";
+import { reverseMaxMatch as a } from "./reverse-max-match.js";
+import { TokenizationAlgorithm as o, TrieNode as s } from "./TrieNode.js";
+//#region utils/pinyin/lib/common/segmentit/AC.ts
+var c = class {
+	constructor() {
+		this.dictMap = /* @__PURE__ */ new Map(), this.queues = [], this.root = new s(null);
+	}
+	build(e) {
+		this.buildTrie(e), this.buildFailPointer();
+	}
+	buildTrie(e) {
+		for (let n of e) {
+			let e = t(n.zh), r = this.root;
+			for (let t = 0; t < e.length; t++) {
+				let n = e[t];
+				if (!r.children.has(n)) {
+					let i = new s(r, e.slice(0, t).join(""), n);
+					r.children.set(n, i), this.addNodeToQueues(i);
+				}
+				r = r.children.get(n);
+			}
+			this.insertPattern(r.patterns, n), n.node = r, this.addPatternToDictMap(n);
+		}
+	}
+	buildFailPointer() {
+		let e = [], t = 0;
+		for (this.queues.forEach((t) => {
+			e = e.concat(t);
+		}), this.queues = []; e.length > t;) {
+			let n = e[t++], r = n.parent && n.parent.fail, i = n.key;
+			for (; r && !r.children.has(i);) r = r.fail;
+			r ? n.fail = r.children.get(i) : n.fail = this.root;
+		}
+	}
+	addPatternToDictMap(e) {
+		this.dictMap.has(e.dict) || this.dictMap.set(e.dict, /* @__PURE__ */ new Set()), this.dictMap.get(e.dict).add(e);
+	}
+	addNodeToQueues(e) {
+		this.queues[n(e.prefix)] || (this.queues[n(e.prefix)] = []), this.queues[n(e.prefix)].push(e);
+	}
+	insertPattern(e, t) {
+		for (let n = e.length - 1; n >= 0; n--) {
+			let r = e[n];
+			if (t.priority === r.priority && t.probability >= r.probability) e[n + 1] = r;
+			else if (t.priority > r.priority) e[n + 1] = r;
+			else {
+				e[n + 1] = t;
+				return;
+			}
+		}
+		e[0] = t;
+	}
+	removeDict(e) {
+		this.dictMap.has(e) && (this.dictMap.get(e).forEach((e) => {
+			e.node.patterns = e.node.patterns.filter((t) => t !== e);
+		}), this.dictMap.delete(e));
+	}
+	match(n, r) {
+		let i = this.root, a = [], o = t(n);
+		for (let t = 0; t < o.length; t++) {
+			let n = o[t];
+			for (; i !== null && !i.children.has(n);) i = i.fail;
+			if (i === null) i = this.root;
+			else {
+				i = i.children.get(n);
+				let o = i.patterns.find((n) => r === "off" ? n.priority !== e.Surname : r === "head" ? n.length - 1 - t == 0 : !0);
+				o && a.push({
+					...o,
+					index: t - o.length + 1
+				});
+				let s = i.fail;
+				for (; s !== null;) {
+					let n = s.patterns.find((n) => r === "off" ? n.priority !== e.Surname : r === "head" ? n.length - 1 - t == 0 : !0);
+					n && a.push({
+						...n,
+						index: t - n.length + 1
+					}), s = s.fail;
+				}
+			}
+		}
+		return a;
+	}
+	search(e, t, s = o.MaxProbability) {
+		let c = this.match(e, t);
+		return s === o.ReverseMaxMatch ? a(c) : s === o.MinTokenization ? i(c, n(e)) : r(c, n(e));
+	}
+};
+//#endregion
+export { c as AC };
+/* 独立思考，明辨是非 */

package/pinyin/lib/common/segmentit/TrieNode.d.ts

@@ -0,0 +1,30 @@
+export declare const enum TokenizationAlgorithm {
+    ReverseMaxMatch = 1,
+    MaxProbability = 2,
+    MinTokenization = 3
+}
+/**
+ * @description: AC 自动机
+ */
+export interface Pattern {
+    zh: string;
+    pinyin: string;
+    probability: number;
+    length: number;
+    priority: number;
+    dict: string | symbol;
+    pos?: string;
+    node?: TrieNode;
+}
+export interface MatchPattern extends Pattern {
+    index: number;
+}
+export declare class TrieNode {
+    children: Map<string, TrieNode>;
+    fail: TrieNode | null;
+    patterns: Pattern[];
+    prefix: string;
+    parent: TrieNode | null;
+    key: string;
+    constructor(parent: TrieNode | null, prefix?: string, key?: string);
+}

package/pinyin/lib/common/segmentit/TrieNode.js

@@ -0,0 +1,12 @@
+/* 潘启宝 2026-05-26 15:49:57 星期二 山东省济南市 */
+//#region utils/pinyin/lib/common/segmentit/TrieNode.ts
+var e = /* @__PURE__ */ function(e) {
+	return e[e.ReverseMaxMatch = 1] = "ReverseMaxMatch", e[e.MaxProbability = 2] = "MaxProbability", e[e.MinTokenization = 3] = "MinTokenization", e;
+}({}), t = class {
+	constructor(e, t = "", n = "") {
+		this.children = /* @__PURE__ */ new Map(), this.fail = null, this.patterns = [], this.parent = e, this.prefix = t, this.key = n;
+	}
+};
+//#endregion
+export { e as TokenizationAlgorithm, t as TrieNode };
+/* 独立思考，明辨是非 */

package/pinyin/lib/common/segmentit/index.d.ts

@@ -0,0 +1,3 @@
+import { AC } from './AC';
+export declare const PatternsNormal: import("./TrieNode").Pattern[];
+export declare const acTree: AC;

package/pinyin/lib/common/segmentit/index.js

@@ -0,0 +1,21 @@
+/* 潘启宝 2026-05-26 15:49:57 星期二 山东省济南市 */
+import { Pattern2 as e } from "../../data/dict2.js";
+import { Pattern3 as t } from "../../data/dict3.js";
+import { Pattern4 as n } from "../../data/dict4.js";
+import { Pattern5 as r } from "../../data/dict5.js";
+import { PatternNumberDict as i } from "../../data/special.js";
+import { PatternSurname as a } from "../../data/surname.js";
+import { AC as o } from "./AC.js";
+//#region utils/pinyin/lib/common/segmentit/index.ts
+var s = [
+	...r,
+	...n,
+	...t,
+	...e,
+	...i,
+	...a
+], c = new o();
+c.build(s);
+//#endregion
+export { c as acTree };
+/* 独立思考，明辨是非 */

package/pinyin/lib/common/segmentit/max-probability.d.ts

@@ -0,0 +1,2 @@
+import type { MatchPattern } from './TrieNode';
+export declare function maxProbability(patterns: MatchPattern[], length: number): MatchPattern[];

package/pinyin/lib/common/segmentit/max-probability.js

@@ -0,0 +1,41 @@
+/* 潘启宝 2026-05-26 15:49:57 星期二 山东省济南市 */
+import { Priority as e, Probability as t } from "../constant.js";
+//#region utils/pinyin/lib/common/segmentit/max-probability.ts
+function n(e, t) {
+	return e && (e.decimal < t.decimal || e.decimal === t.decimal && e.probability > t.probability) ? e : t;
+}
+function r(e) {
+	e.probability < 1e-300 && (e.probability *= 1e300, e.decimal += 1);
+}
+function i(t) {
+	return t.priority === e.Custom ? -(t.length * t.length * 100) : t.priority === e.Surname ? -(t.length * t.length * 10) : 0;
+}
+function a(e, a) {
+	let o = [], s = e.length - 1, c = e[s];
+	for (let l = a - 1; l >= 0; l--) {
+		let u = l + 1 >= a ? {
+			probability: 1,
+			decimal: 0,
+			patterns: []
+		} : o[l + 1];
+		for (; c && c.index + c.length - 1 === l;) {
+			let t = c.index, a = {
+				probability: c.probability * u.probability,
+				decimal: u.decimal + i(c),
+				patterns: u.patterns,
+				concatPattern: c
+			};
+			r(a), o[t] = n(o[t], a), c = e[--s];
+		}
+		let d = {
+			probability: t.Unknown * u.probability,
+			decimal: 0,
+			patterns: u.patterns
+		};
+		r(d), o[l] = n(o[l], d), o[l].concatPattern && (o[l].patterns = o[l].patterns.concat(o[l].concatPattern), o[l].concatPattern = void 0, delete o[l + 1]);
+	}
+	return o[0].patterns.reverse();
+}
+//#endregion
+export { a as maxProbability };
+/* 独立思考，明辨是非 */

package/pinyin/lib/common/segmentit/min-tokenization.d.ts

@@ -0,0 +1,2 @@
+import type { MatchPattern } from './TrieNode';
+export declare function minTokenization(patterns: MatchPattern[], length: number): MatchPattern[];

package/pinyin/lib/common/segmentit/min-tokenization.js

@@ -0,0 +1,35 @@
+/* 潘启宝 2026-05-26 15:49:57 星期二 山东省济南市 */
+import { Priority as e } from "../constant.js";
+//#region utils/pinyin/lib/common/segmentit/min-tokenization.ts
+function t(e, t) {
+	return e && e.count <= t.count ? e : t;
+}
+function n(t) {
+	return t.priority === e.Custom ? -(t.length * t.length * 1e5) : t.priority === e.Surname ? -(t.length * t.length * 100) : 1;
+}
+function r(e, r) {
+	let i = [], a = e.length - 1, o = e[a];
+	for (let s = r - 1; s >= 0; s--) {
+		let c = s + 1 >= r ? {
+			count: 0,
+			patterns: []
+		} : i[s + 1];
+		for (; o && o.index + o.length - 1 === s;) {
+			let r = o.index, s = {
+				count: n(o) + c.count,
+				patterns: c.patterns,
+				concatPattern: o
+			};
+			i[r] = t(i[r], s), o = e[--a];
+		}
+		let l = {
+			count: 1 + c.count,
+			patterns: c.patterns
+		};
+		i[s] = t(i[s], l), i[s].concatPattern && (i[s].patterns = i[s].patterns.concat(i[s].concatPattern), i[s].concatPattern = void 0, delete i[s + 1]);
+	}
+	return i[0].patterns.reverse();
+}
+//#endregion
+export { r as minTokenization };
+/* 独立思考，明辨是非 */

package/pinyin/lib/common/segmentit/reverse-max-match.d.ts

@@ -0,0 +1,2 @@
+import type { MatchPattern } from './TrieNode';
+export declare function reverseMaxMatch(patterns: MatchPattern[]): MatchPattern[];

package/pinyin/lib/common/segmentit/reverse-max-match.js

@@ -0,0 +1,17 @@
+/* 潘启宝 2026-05-26 15:49:57 星期二 山东省济南市 */
+//#region utils/pinyin/lib/common/segmentit/reverse-max-match.ts
+function e(e, t) {
+	return !(t.index + t.length <= e.index || t.priority > e.priority || t.priority === e.priority && t.length > e.length);
+}
+function t(t) {
+	let n = [];
+	for (let r = t.length - 1; r >= 0;) {
+		let { index: i } = t[r], a = r - 1;
+		for (; a >= 0 && e(t[r], t[a]);) a--;
+		(a < 0 || t[a].index + t[a].length <= i) && n.push(t[r]), r = a;
+	}
+	return n.reverse();
+}
+//#endregion
+export { t as reverseMaxMatch };
+/* 独立思考，明辨是非 */

package/pinyin/lib/common/type.d.ts

@@ -0,0 +1,69 @@
+export interface SingleWordResult {
+    origin: string;
+    originPinyin: string;
+    result: string;
+    isZh: boolean;
+    delete?: boolean;
+    traditional?: string;
+}
+export type ToneType = 'symbol' | 'num' | 'none';
+export type PinyinMode = 'normal' | 'surname';
+export type SurnameMode = 'all' | 'head' | 'off';
+export type InitialPattern = 'yw' | 'standard';
+export type CommonOptions = {
+    /**
+     * @description 返回的拼音音调类型
+     * @value symbol：在字母上加音调 （默认值）
+     * @value num：以数字格式展示音调，并跟在拼音后面
+     * @value none：不展示音调
+     */
+    toneType?: 'symbol' | 'num' | 'none';
+    /**
+     * @description 返回的拼音格式类型
+     * @value pinyin：返回完整拼音 （默认值）
+     * @value initial：返回声母
+     * @value final：返回韵母
+     * @value num：返回音调对应的数字
+     * @value first：返回首字母
+     * @value finalHead：返回韵头（介音）
+     * @value finalBody：返回韵腹
+     * @value finalTail：返回韵尾
+     */
+    pattern?: 'pinyin' | 'initial' | 'final' | 'num' | 'first' | 'finalHead' | 'finalBody' | 'finalTail';
+    /**
+     * @description 是否移除非汉字字符（推荐使用 removeNonZh: removed 代替）
+     * @value false：返回结果保留非汉字字符 （默认值）
+     * @value true：返回结果移除非汉字字符
+     */
+    removeNonZh?: boolean;
+    /**
+     * @description 非汉字字符的间距格式
+     * @value spaced：连续非汉字字符之间用空格隔开 （默认值）
+     * @value consecutive：连续非汉字字符无间距
+     * @value removed：返回结果移除非汉字字符
+     */
+    nonZh?: 'spaced' | 'consecutive' | 'removed';
+    /**
+     * @description nonZh 生效范围的正则表达式
+     */
+    nonZhScope?: RegExp;
+    /**
+     * @description 对于 ü 的返回是否转换成 v（仅在 toneType: none 启用时生效）
+     * @value false：返回值中保留 ü （默认值）
+     * @value true：返回值中 ü 转换成 v
+     * @value string：返回值中 ü 转换成指定字符
+     */
+    v?: boolean | string;
+    /**
+     * @description 是否将 `y`、`w` 视为声母
+     * @value yw：将 `y`、`w` 视为声母
+     * @value standard：不将 `y`、`w` 视为声母
+     */
+    initialPattern?: InitialPattern;
+    /**
+     * @description 是否启用繁体字模式(可以更好地识别繁体字)
+     * @value false：不启用繁体字模式 （默认值）
+     * @value true：启用繁体字模式
+     */
+    traditional?: boolean;
+};

package/pinyin/lib/common/utils.d.ts

@@ -0,0 +1,10 @@
+export declare function stringLength(text: string): number;
+export declare function splitString(text: string): string[];
+export declare class FastDictFactory {
+    NumberDICT: string[];
+    StringDICT: Map<string, string>;
+    constructor();
+    get(word: string): string;
+    set(word: string, pinyin: string): void;
+    clear(): void;
+}

package/pinyin/lib/common/utils.js

@@ -0,0 +1,39 @@
+/* 潘启宝 2026-05-26 15:49:57 星期二 山东省济南市 */
+import { DoubleUnicodePrefixReg as e, DoubleUnicodeReg as t, DoubleUnicodeSuffixReg as n } from "./constant.js";
+//#region utils/pinyin/lib/common/utils.ts
+function r(e) {
+	return e.length - (e.match(t)?.length || 0);
+}
+function i(t) {
+	let r = [], i = 0;
+	for (; i < t.length;) {
+		let a = t[i];
+		e.test(a) && n.test(t[i + 1]) ? (r.push(t.substring(i, i + 2)), i += 2) : (r.push(a), i += 1);
+	}
+	return r;
+}
+var a = class {
+	constructor() {
+		this.NumberDICT = [], this.StringDICT = /* @__PURE__ */ new Map();
+	}
+	get(e) {
+		if (e.length > 1) return this.StringDICT.get(e);
+		{
+			let t = e.charCodeAt(0);
+			return this.NumberDICT[t];
+		}
+	}
+	set(e, t) {
+		if (e.length > 1) this.StringDICT.set(e, t);
+		else {
+			let n = e.charCodeAt(0);
+			this.NumberDICT[n] = t;
+		}
+	}
+	clear() {
+		this.NumberDICT = [], this.StringDICT.clear();
+	}
+};
+//#endregion
+export { a as FastDictFactory, i as splitString, r as stringLength };
+/* 独立思考，明辨是非 */

package/pinyin/lib/core/convert/index.d.ts

@@ -0,0 +1,29 @@
+type ConvertFormat = 'numToSymbol' | 'symbolToNum' | 'toneNone';
+interface ConvertOptions {
+    /**
+     * @description 拼音之间的分隔符，默认为空格，convert方法会以该分隔符分割拼音进行转换
+     */
+    separator?: string;
+    /**
+     * @description 转换的格式， 默认为 numToSymbol
+     * @example numToSymbol: pin1 yin1 -> pīn yīn
+     * @example symbolToNum: pīn yīn -> pin1 yin1
+     * @example toneNone: pīn yīn -> pin yin
+     */
+    format?: ConvertFormat;
+}
+/**
+ * @description: 拼音格式转换。pin1 yin1 -> pīn yīn 或 pīn yīn -> pin1 yin1 或 pīn yīn -> pin yin
+ * @param {string} pinyin 要转换的拼音字符串或者拼音字符串数组
+ * @param {ConvertOptions=} options 配置项
+ * @return {string} 转换后的拼音字符串或者拼音字符串数组
+ */
+declare function convert(pinyin: string, options?: ConvertOptions): string;
+/**
+ * @description: 拼音格式转换。pin1 yin1 -> pīn yīn 或 pīn yīn -> pin1 yin1 或 pīn yīn -> pin yin
+ * @param {string[]} pinyin 要转换的拼音字符串或者拼音字符串数组
+ * @param {ConvertOptions=} options 配置项
+ * @return {string[]} 转换后的拼音字符串或者拼音字符串数组
+ */
+declare function convert(pinyin: string[], options?: ConvertOptions): string[];
+export { convert };

package/pinyin/lib/core/convert/index.js

@@ -0,0 +1,128 @@
+/* 潘启宝 2026-05-26 15:49:57 星期二 山东省济南市 */
+import { getNumOfTone as e, getPinyinWithoutTone as t } from "../pinyin/handle.js";
+//#region utils/pinyin/lib/core/convert/index.ts
+var n = {
+	separator: " ",
+	format: "numToSymbol"
+}, r = {
+	a: [
+		"a",
+		"ā",
+		"á",
+		"ǎ",
+		"à"
+	],
+	o: [
+		"o",
+		"ō",
+		"ó",
+		"ǒ",
+		"ò"
+	],
+	e: [
+		"e",
+		"ē",
+		"é",
+		"ě",
+		"è"
+	],
+	ü: [
+		"ü",
+		"ǖ",
+		"ǘ",
+		"ǚ",
+		"ǜ"
+	],
+	v: [
+		"ü",
+		"ǖ",
+		"ǘ",
+		"ǚ",
+		"ǜ"
+	],
+	ui: [
+		"ui",
+		"uī",
+		"uí",
+		"uǐ",
+		"uì"
+	],
+	iu: [
+		"iu",
+		"iū",
+		"iú",
+		"iǔ",
+		"iù"
+	],
+	i: [
+		"i",
+		"ī",
+		"í",
+		"ǐ",
+		"ì"
+	],
+	u: [
+		"u",
+		"ū",
+		"ú",
+		"ǔ",
+		"ù"
+	],
+	n: [
+		"n",
+		"n̄",
+		"ń",
+		"ň",
+		"ǹ"
+	],
+	m: [
+		"m",
+		"m̄",
+		"ḿ",
+		"m̌",
+		"m̀"
+	],
+	ê: [
+		"ê",
+		"ê̄",
+		"ế",
+		"ê̌",
+		"ề"
+	]
+};
+function i(e, t) {
+	t = {
+		...n,
+		...t || {}
+	};
+	let r = typeof e;
+	return typeof e == "string" && (e = e.split(t.separator)), e = e.map((e) => {
+		let n = t.format;
+		return n === "numToSymbol" ? a(e) : n === "symbolToNum" ? o(e) : n === "toneNone" ? s(e) : e;
+	}), r === "string" ? e.join(t.separator) : e;
+}
+function a(e) {
+	let t = "";
+	if (e.length > 2 && e.endsWith("r")) {
+		let n = Number(e[e.length - 2]);
+		n >= 0 && n <= 4 && (t = "r", e = e.slice(0, -1));
+	}
+	let n = Number(e[e.length - 1]);
+	if (n >= 0 && n <= 4) {
+		for (let i in r) if (e.includes(i)) return e.slice(0, e.length - 1).replace(i, r[i][n]) + t;
+		return e + t;
+	} else return e + t;
+}
+function o(n) {
+	if (n.endsWith("r") && n.length > 1 && !/^[eēéěè]r$/.test(n)) {
+		let r = n.slice(0, -1), i = e(r);
+		if (i !== "" && i !== "0") return `${t(r)}${i}r`;
+	}
+	return `${t(n)}${e(n)}`;
+}
+function s(e) {
+	return t(e);
+}
+//#endregion
+export { i as convert };
+/* 独立思考，明辨是非 */