:ja0ddlmZmZmZmZddlZddlZddlZddlZdZ dZ GddZ Gdde Z Gd d e Zy) )unicode_literalsdivisionabsolute_importprint_functionNconfig dictionaryc<eZdZd dZdZgfdZdZdZdZdZ y) OpenCCNcd|_||_d|_t|_t|_t |_tjd|_ |j|jyy)a init OpenCC :param conversion: the conversion of usage, options are 'hk2s', 's2hk', 's2t', 's2tw', 's2twp', 't2hk', 't2s', 't2tw', 'tw2s', 'tw2sp', etc check the json file names in config directory :return: None Fu(\s+|-|,|\.|\?|!|\*|　|，|。|、|；|：|？|！|…|“|”|‘|’|『|』|「|」|﹁|﹂|—|－|（|）|《|》|〈|〉|～|．|／|＼|︒|︑|︔|︓|︿|﹀|︹|︺|︙|︐|［|﹇|］|﹈|︕|︖|︰|︳|︴|︽|︾|︵|︶|｛|︷|｝|︸|﹃|﹄|【|︻|】|︼)N) conversion_name conversion_dict_init_donelist _dict_chain_dict_chain_datadict dict_cacherecompilesplit_chars_re _init_dictselfrs b/home/mcse/projects/srt_converter/srt-converter-venv/lib/python3.12/site-packages/opencc/opencc.py__init__zOpenCC.__init__$sk "$$6 $&!jj de ?? & OO  'cn|js|jd|_g}|jj|}t dt |D]M}|dzdk(r/|j |j|||j:|j ||Odj|S)z] Convert string from Simplified Chinese to Traditional Chinese or vice versa Trr ) rrrsplitrangelenappend_convertrjoin)rstringresultsplit_string_listis rconvertzOpenCC.convert9s## OO #'D  //55f=q#/01 4A1uz dmm,=a,@$BWBWXY /23 4wwvrct|}|D];}|j|tdj|j}=dj|jS)av Convert string from Simplified Chinese to Traditional Chinese or vice versa If a dictionary is part of a group of dictionaries, stop conversion on a word after the first match is found. :param string: the input string :param dictionary: list of dictionaries to be applied against the string :return: converted string r ) StringTreecreate_parse_treer%inorder)rr&rtreec_dicts rr$zOpenCC._convertPs[&!  7F  " "6 *bggdlln56D 7wwt||~&&rc|j tdg|_|jdz}tjj tjj tt|}t|5}tj|}dddjd|_ |jdD]-}|j|j|jd/g|_|j!|j|jt#|jD]&\}}t%|t&s|g|j|<(d|_y#1swYxYw)zR initialize the dict with chosen conversion :return: None Nzconversion is not setz.jsonnameconversion_chainrT)r ValueErrorrospathr%dirname__file__ CONFIG_DIRopenjsonloadgetr _add_dict_chainr_add_dictionaries enumerate isinstancetupler)rr config_filef setting_jsonchainindexr0s rrzOpenCC._init_dict_s: ?? "45 57*ggll277??8# DD& c|jddk(rr#r5r6r%r7r8DICT_DIR)r dict_chain dict_dictrF dict_itemfilename dict_files rr>zOpenCC._add_dict_chains == G +E&]]73 7 $$UI6 7   e $ ]]6 "e + }}V,H RWW__X%>(SI   i (,rc@|j|k(ryd|_||_y)a  set conversion :param conversion: the conversion of usage, options are 'hk2s', 's2hk', 's2t', 's2tw', 's2twp', 't2hk', 't2s', 't2tw', 'tw2s', and 'tw2sp' check the json file names in config directory :return: None NF)rrrs rset_conversionzOpenCC.set_conversions" ??j ( #(D (DOrN) __name__ __module__ __qualname__rr*r$rr?r>rerrr r #s**.-/ '$6=4)$ )rr c4eZdZdZdZd dZdZdZdZdZ y) TreeNoderrINc@ddg|_||_d|_||_y)NF)branchrWmatched length_hint)rrWhints rrzTreeNode.__init__s#Tl   rc||_yrf)ro)rros r set_matchedzTreeNode.set_matcheds  rc||_yrf)rW)rrWs r set_valuezTreeNode.set_values  rc"||j|<yrf)rn)rrnnodes r set_branchzTreeNode.set_branchs" Frc||_yrf)rp)rrqs rset_hintzTreeNode.set_hints rrf) rgrhriLEFTRIGHTrrsrurxrzrjrrrlrls% D E # rrlc&eZdZdZdZdZddZy)r,c$t||_yrf)rlroot)rr&s rrzStringTree.__init__sV$ rc^|jg}g}|D]}|r |j}|j|j||j\}}}} |r|j ||j d|jd|r=t|| } |j| |jtj| |rVt|| } |j| |jtj| n|j|d|_|r |} |}| }y)a Compare smaller and smaller sub-strings going from left to rightin root node value against a test_dict_list entry. If match is found, create tree nodes for remaining left and right string portions and place these nodes on a stack for processing. :param test_dict_list: a list of tuples of the max key length and dict currently being applied against the string NT) rpop_StringTree__findMatchrWrprurzrsrlr#rxr{r|) rtest_dict_list working_stackunmatched_stack test_dictcurrrWlstringrstringtest_lenrwtemps rr-zStringTree.create_parse_trees ( #I$((*484D4DTZZQZ\`\l\l4m1wNN5)MM$'$$T*':%,,T2 t<':%,,T2=#**40'+D$# &!D+M"O- #rc(g}g}|j} |r1|j||jtj}|r1|rI|j }|j|j |jtj}n |S)zd Do a non-recursive inorder traversal of the tree. :return: list of strings )rr#rnrlr{rrWr|)r return_valstackrs rr.zStringTree.inorders  yy T"{{8==1yy{!!$**-{{8>>2rNct|}d}d}t||d}|r t||}|d}||k\rtd||z dzD]p} || | |z|dvs| dkDr|d| }| |z|kr|| |zd}|d|| | |z} t| jddkDr| jdd} | |||fcS|dz}||k\ry)a8 Compare smaller and smaller sub-strings going from left to right against test_dict. If an entry is found, return it as well as the remaining string(s) and the test length. :param cstring: the string to find a match :param test_dict: a tuple of the max key length and dict currently being applied against the string :return: the new matched value, old string to left of the match, old string to right of the match (may be all None if no match found), last test length NrrIr )NNNN)r"minr!r ) rr&rrq string_lenrrrrTr)rWs r __findMatchzStringTree.__findMatch s[  IaL1 Hd+HA,'!1j83a78 =!AhJ'9Q<71u"(!*( j0"(8"5%aL!H*)=>E5;;s+,q0 % C 0 3 '7H<< = MH#'!&&rrf)rgrhrirr-r.rrjrrr,r,s%%#N,&&rr,) __future__rrrrrMr5r;rr9r^r objectrlr,rjrrrsN((0  O)O)f v ,g&g&r