switch-chinese 1.0.8 → 1.0.10

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "switch-chinese",
-  "version": "1.0.8",
-  "description": "簡繁轉換，支援簡繁雙向轉換、智慧分詞、自訂詞庫、文字偵測及多種輸出格式，零依賴。 Lightweight Chinese converter library for bidirectional conversion between Simplified and Traditional Chinese with intelligent word segmentation, custom dictionary support, character detection, and multiple output formats. Zero dependencies. 轻量级简繁体中文智能转换库，支持简繁双向转换、智能分词、自定义词库、文本检测及多种输出格式，零依赖。",
+  "version": "1.0.10",
+  "description": "簡繁轉換，支援簡繁雙向轉換、智慧分詞、自訂詞庫、文字偵測及多種輸出格式，零依賴。 Lightweight Chinese converter library for conversion between Simplified and Traditional Chinese. 轻量级简繁体中文智能转换库，支持简繁双向转换、智能分词、自定义词库、文本检测及多种输出格式，零依赖。",
   "main": "stcasc.lib.js",
   "types": "stcasc.d.ts",
   "type": "module",

package/stcasc.lib.js

@@ -837,84 +837,90 @@ function detect(text) {
 }
 
 function stcasc(cache, custom, disableTerms) {
-	if (!cache) cache = {};
-	if (cache.sc2tcCombTree && cache.tc2scCombTree) {
-		sc2tcCombTree = cache.sc2tcCombTree;
+    if (!cache) cache = {};
+    if (cache.sc2tcCombTree && cache.tc2scCombTree) {
+        sc2tcCombTree = cache.sc2tcCombTree;
         tc2scCombTree = cache.tc2scCombTree;
-	} else {
+    } else {
         if (disableTerms) sc2tcComb = {};
-		if (custom && custom.length) {
-			for (let sc in custom) {
-				sc2tcComb[sc] = custom[sc];
-			}
-		}
-	    function makeCombTree(key, value) {
-	        let curTree = sc2tcCombTree;
-	        for (let i = 0; i < key.length; i++) {
-	            let newTree = {};
-	            if (i == key.length - 1) {
-	                newTree = {"end": value};
-	            }
-	            let curKey = key.charAt(i);
-	            let branch = curTree[curKey];
-	            if (!branch) {
-	                curTree[curKey] = newTree;
-	                curTree = newTree;
-	            } else {
-	                curTree = branch;
-	            }
-	        }
-	        curTree = tc2scCombTree;
-	        for (let i = 0; i < value.length; i++) {
-	            let newTree = {};
-	            if (i == value.length - 1) {
-	                newTree = {"end": key};
-	            }
-	            let curKey = value.charAt(i);
-	            let branch = curTree[curKey];
-	            if (!branch) {
-	                curTree[curKey] = newTree;
-	                curTree = newTree;
-	            } else {
-	                curTree = branch;
-	            }
-	        }
-	    }
-	    for (let key in sc2tcComb) {
-	        let value = sc2tcComb[key];
-	        if (Array.isArray(value)) {
-	            value.forEach(v => {
-	                makeCombTree(key, v);
-	            });
-	        } else {
-	            makeCombTree(key, value);
-	        }
-	    }
-	    cache.sc2tcCombTree = sc2tcCombTree;
+        if (custom && custom.length) {
+            for (let sc in custom) {
+                sc2tcComb[sc] = custom[sc];
+            }
+        }
+        function makeCombTree(key, value) {
+            let curTree = sc2tcCombTree;
+            for (let i = 0; i < key.length; i++) {
+                let curKey = key.charAt(i);
+                let branch = curTree[curKey];
+                let newTree = {};
+                if (i == key.length - 1) {
+                    newTree = {"end": value};
+                    if (branch) {
+                        branch.end = value;
+                    }
+                }
+                if (branch) {
+                    curTree = branch;
+                } else {
+                    curTree[curKey] = newTree;
+                    curTree = newTree;
+                }
+            }
+            curTree = tc2scCombTree;
+            for (let i = 0; i < value.length; i++) {
+                let curKey = value.charAt(i);
+                let branch = curTree[curKey];
+                let newTree = {};
+                if (i == value.length - 1) {
+                    newTree = {"end": key};
+                    if (branch) {
+                        branch.end = value;
+                    }
+                }
+                if (branch) {
+                    curTree = branch;
+                } else {
+                    curTree[curKey] = newTree;
+                    curTree = newTree;
+                }
+            }
+        }
+        for (let key in sc2tcComb) {
+            let value = sc2tcComb[key];
+            if (Array.isArray(value)) {
+                value.forEach(v => {
+                    makeCombTree(key, v);
+                });
+            } else {
+                makeCombTree(key, value);
+            }
+        }
+        cache.sc2tcCombTree = sc2tcCombTree;
         cache.tc2scCombTree = tc2scCombTree;
-	}
-	if (cache.stDict && cache.tsDict) {
-		stDict = cache.stDict;
+    }
+    if (cache.stDict && cache.tsDict) {
+        stDict = cache.stDict;
         tsDict = cache.tsDict;
-	} else {
-		for (let i = 0; i < scStr.length; i++) {
-	        let _sc = scStr[i];
-	        let _tc = tcStr[i];
-	        if (!stDict[_sc]) stDict[_sc] = _tc;
-	        if (!tsDict[_tc]) tsDict[_tc] = _sc;
-	    }
-	    Object.keys(oc2tc).forEach(key => {
-	        let ocList = oc2tc[key];
-	        for (let i = 0; i < ocList.length; i++) {
-	            let oc = ocList[i];
-	            stDict[oc] = key;
-	            tsDict[oc] = tsDict[key] || key;
-	        }
-	    })
-		cache.stDict = stDict;
+    } else {
+        for (let i = 0; i < scStr.length; i++) {
+            let _sc = scStr[i];
+            let _tc = tcStr[i];
+            if (!stDict[_sc]) stDict[_sc] = _tc;
+            if (!tsDict[_tc]) tsDict[_tc] = _sc;
+        }
+        Object.keys(oc2tc).forEach(key => {
+            let ocList = oc2tc[key];
+            for (let i = 0; i < ocList.length; i++) {
+                let oc = ocList[i];
+                stDict[oc] = key;
+                tsDict[oc] = tsDict[key] || key;
+            }
+        })
+        cache.stDict = stDict;
         cache.tsDict = tsDict;
-	}
-	return {simplized, traditionalized, detect, cache};
+    }
+    return {simplized, traditionalized, detect, cache};
 }
 
 export default stcasc;