|
6 | 6 | // @namespace hoothin |
7 | 7 | // @supportURL https://github.com/hoothin/UserScripts |
8 | 8 | // @homepageURL https://github.com/hoothin/UserScripts |
9 | | -// @version 1.2.7.9 |
| 9 | +// @version 1.2.7.10 |
10 | 10 | // @description 任意轉換網頁中的簡體中文與正體中文(默認簡體→正體),顯示漢字對應漢語拼音,自訂任意替換文本 |
11 | 11 | // @description:zh-CN 任意转换网页中的简体中文与繁体中文(默认繁体→简体),显示汉字对应汉语拼音,自定义任意替换文本 |
12 | 12 | // @description:ja ウェブページ上の簡体字中国語と繁体字中国語を自由に変換し、中国語の文字にひらがなを表示し、任意の文字を置き換えることができます。 |
|
1713 | 1713 | storage.setItem('sc2tcCombConfig', sc2tcCombConfig); |
1714 | 1714 | } catch (e) { |
1715 | 1715 | console.log(e); |
| 1716 | + alert("自訂簡繁用語轉換格式錯誤:" + e); |
| 1717 | + return; |
1716 | 1718 | } |
1717 | 1719 | try { |
1718 | 1720 | illiteracyConfig = customIlliteracyInput.value ? JSON.parse(customIlliteracyInput.value) : ""; |
1719 | 1721 | storage.setItem('illiteracyConfig', illiteracyConfig); |
1720 | 1722 | } catch (e) { |
1721 | 1723 | console.log(e); |
| 1724 | + alert("通用字詞轉換格式錯誤:" + e); |
| 1725 | + return; |
1722 | 1726 | } |
1723 | 1727 | storage.setItem('sc2tcCombTree', ""); |
1724 | 1728 | storage.setItem('tc2scCombTree', ""); |
|
1888 | 1892 | function makeCombTree(key, value) { |
1889 | 1893 | let curTree=sc2tcCombTree; |
1890 | 1894 | for(let i=0;i<key.length;i++){ |
| 1895 | + let curKey=key.charAt(i); |
| 1896 | + let branch=curTree[curKey]; |
1891 | 1897 | let newTree={}; |
1892 | 1898 | if(i==key.length-1){ |
1893 | 1899 | newTree={"end":value}; |
| 1900 | + if(branch){ |
| 1901 | + branch.end=value; |
| 1902 | + } |
1894 | 1903 | } |
1895 | | - let curKey=key.charAt(i); |
1896 | | - let branch=curTree[curKey]; |
1897 | | - if(!branch){ |
| 1904 | + if(branch){ |
| 1905 | + curTree=branch; |
| 1906 | + }else{ |
1898 | 1907 | curTree[curKey]=newTree; |
1899 | 1908 | curTree=newTree; |
1900 | | - }else{ |
1901 | | - curTree=branch; |
1902 | 1909 | } |
1903 | 1910 | } |
1904 | 1911 | curTree=tc2scCombTree; |
1905 | 1912 | for(let i=0;i<value.length;i++){ |
| 1913 | + let curKey=value.charAt(i); |
| 1914 | + let branch=curTree[curKey]; |
1906 | 1915 | let newTree={}; |
1907 | 1916 | if(i==value.length-1){ |
1908 | 1917 | newTree={"end":key}; |
| 1918 | + if(branch){ |
| 1919 | + branch.end=value; |
| 1920 | + } |
1909 | 1921 | } |
1910 | | - let curKey=value.charAt(i); |
1911 | | - let branch=curTree[curKey]; |
1912 | | - if(!branch){ |
| 1922 | + if(branch){ |
| 1923 | + curTree=branch; |
| 1924 | + }else{ |
1913 | 1925 | curTree[curKey]=newTree; |
1914 | 1926 | curTree=newTree; |
1915 | | - }else{ |
1916 | | - curTree=branch; |
1917 | 1927 | } |
1918 | 1928 | } |
1919 | 1929 | } |
|
0 commit comments