/opt/alt/python311/lib64/python3.11/lib2to3/__pycache__
NameSizeModeActions
btm_matcher.cpython-311.opt-1.pyc78140644editdlrm
btm_matcher.cpython-311.opt-2.pyc62640644editdlrm
btm_matcher.cpython-311.pyc78140644editdlrm
btm_utils.cpython-311.opt-1.pyc115300644editdlrm
btm_utils.cpython-311.opt-2.pyc100560644editdlrm
btm_utils.cpython-311.pyc115300644editdlrm
fixer_base.cpython-311.opt-1.pyc84310644editdlrm
fixer_base.cpython-311.opt-2.pyc57520644editdlrm
fixer_base.cpython-311.pyc84310644editdlrm
fixer_util.cpython-311.opt-1.pyc223810644editdlrm
fixer_util.cpython-311.opt-2.pyc203680644editdlrm
fixer_util.cpython-311.pyc223810644editdlrm
main.cpython-311.opt-1.pyc152200644editdlrm
main.cpython-311.opt-2.pyc134840644editdlrm
main.cpython-311.pyc152660644editdlrm
patcomp.cpython-311.opt-1.pyc102230644editdlrm
patcomp.cpython-311.opt-2.pyc97440644editdlrm
patcomp.cpython-311.pyc107250644editdlrm
pygram.cpython-311.opt-1.pyc20700644editdlrm
pygram.cpython-311.opt-2.pyc18730644editdlrm
pygram.cpython-311.pyc20700644editdlrm
pytree.cpython-311.opt-1.pyc352100644editdlrm
pytree.cpython-311.opt-2.pyc268610644editdlrm
pytree.cpython-311.pyc369930644editdlrm
refactor.cpython-311.opt-1.pyc384440644editdlrm
refactor.cpython-311.opt-2.pyc345390644editdlrm
refactor.cpython-311.pyc385260644editdlrm
__init__.cpython-311.opt-1.pyc3870644editdlrm
__init__.cpython-311.opt-2.pyc3870644editdlrm
__init__.cpython-311.pyc3870644editdlrm
__main__.cpython-311.opt-1.pyc3310644editdlrm
__main__.cpython-311.opt-2.pyc3310644editdlrm
__main__.cpython-311.pyc3310644editdlrm
Edit: /opt/alt/python311/lib64/python3.11/lib2to3/__pycache__/btm_utils.cpython-311.pyc (11530B)
§ ¬p@­¤÷sãóŒ—dZddlmZddlmZmZddlmZmZeZ eZ ej Z eZ dZdZdZGd„d e¦«Zdd „Zd „Zd „Zd S)z0Utility functions used by the btm_matcher moduleé)Úpytree)ÚgrammarÚtoken)Úpattern_symbolsÚpython_symbolséÿÿÿÿéþÿÿÿéýÿÿÿcó2—eZdZdZdd„Zd„Zd„Zd„Zd„ZdS) ÚMinNodez‰This class serves as an intermediate representation of the pattern tree during the conversion to sets of leaf-to-root subpatternsNcóh—||_||_g|_d|_d|_g|_g|_dS)NF)ÚtypeÚnameÚchildrenÚleafÚparentÚ alternativesÚgroup)Úselfrrs ú8/opt/alt/python311/lib64/python3.11/lib2to3/btm_utils.pyÚ__init__zMinNode.__init__s8€ØˆŒ ؈Œ ؈Œ ؈Œ ؈Œ ØˆÔØˆŒ ˆ ˆ ócóZ—t|j¦«dzt|j¦«zS)Nú )Ústrrr)rs rÚ__repr__zMinNode.__repr__s"€Ý�4”9‰~Œ~ Ñ#¥c¨$¬)¡n¤nÑ4Ð4rcóЗ|}g}|�r^|jtkrr|j |¦«t |j¦«t |j¦«kr$t |j¦«g}g|_|j}Œ{|j}d}nÜ|jtkrq|j  |¦«t |j ¦«t |j¦«kr#t|j ¦«}g|_ |j}Œü|j}d}n[|jtj kr"|j r| |j ¦«n| |j¦«|j}|�°^|S)z°Internal method. Returns a characteristic path of the pattern tree. This method must be run for all leaves until the linear subpatterns are merged into a singleN)rÚTYPE_ALTERNATIVESrÚappendÚlenrÚtuplerÚ TYPE_GROUPrÚget_characteristic_subpatternÚ token_labelsÚNAMEr)rÚnodeÚsubps rÚ leaf_to_rootzMinNode.leaf_to_root!sZ€ðˆØˆØñ! ØŒyÕ-Ò-Ð-ØÔ!×(Ò(¨Ñ.Ô.Ð.Ý�tÔ(Ñ)Ô)­S°´Ñ-?Ô-?Ò?Ð?å! $Ô"3Ñ4Ô4Ð5�DØ(*�DÔ%Øœ;�DØàœ;�DØ�DØàŒy�JÒ&Ð&Ø” ×!Ò! $Ñ'Ô'Ð'å�t”z‘?”?¥c¨$¬-Ñ&8Ô&8Ò8Ð8Ý8¸¼ÑDÔD�DØ!#�D”JØœ;�DØàœ;�DØ�DØàŒy�LÔ-Ò-Ð-°$´)Ð-à— ’ ˜DœIÑ&Ô&Ð&Ð&à— ’ ˜DœIÑ&Ô&Ð&à”;ˆDðCñ! ðDˆ rcóh—| ¦«D]}| ¦«}|r|cSŒdS)a‹Drives the leaf_to_root method. The reason that leaf_to_root must be run multiple times is because we need to reject 'group' matches; for example the alternative form (a | b c) creates a group [b c] that needs to be matched. Since matching multiple linear patterns overcomes the automaton's capabilities, leaf_to_root merges each group into a single choice based on 'characteristic'ity, i.e. (a|b c) -> (a|b) if b more characteristic than c Returns: The most 'characteristic'(as defined by get_characteristic_subpattern) path for the compiled pattern tree. N)Úleavesr()rÚlr's rÚget_linear_subpatternzMinNode.get_linear_subpatternKsJ€ð —’‘”ð ð ˆAØ—>’>Ñ#Ô#ˆDØð Ø� � � ð ð ð rc#ólK—|jD]}| ¦«Ed{V—†Œ|js|V—dSdS)z-Generator that returns the leaves of the treeN)rr*)rÚchilds rr*zMinNode.leaves`s[èè€à”]ð &ð &ˆEØ—|’|‘~”~Ð %Ð %Ð %Ð %Ð %Ð %Ð %Ð %ØŒ}ð ØˆJˆJˆJˆJˆJð ð r)NN) Ú__name__Ú __module__Ú __qualname__Ú__doc__rrr(r,r*©rrr r so€€€€€ððððððð5ð5ð5ð(ð(ð(ðTððð*ððððrr NcóÚ —d}|jtjkr |jd}|jtjkr t |j¦«dkrt |jd|¦«}�nstt¬¦«}|jD]L}|j  |¦«dzrŒ t ||¦«}|�|j  |¦«ŒM�n|jtj kr‹t |j¦«dkrVtt¬¦«}|jD].}t ||¦«}|r|j  |¦«Œ/|jsd}�n…t |jd|¦«}�nh|jtj k�rRt|jdtj¦«r1|jdjdkrt |jd|¦«St|jdtj¦«r|jdjdksIt |j¦«dkr3t%|jdd¦«r|jdjdkrdSd }d}d}d }d} d } |jD]j}|jtjkrd }|}n1|jtjkrd }|} n|jtjkr|}t%|d¦«r |jd krd } Œk| r6|jd} t%| d¦«r| jdkr |jd } n |jd} | jt*jkrŽ| jd krtt.¬¦«}�nt%t*| j¦«r)tt1t*| j¦«¬¦«}n¾tt1t2| j¦«¬¦«}n•| jt*jkr[| j d¦«} | t8vrtt8| ¬¦«}nAtt*j| ¬¦«}n%| jtjkrt ||¦«}|r7| jdjdkrd}n| jdjdkrnt:‚|r@|�>|jdd…D].}t ||¦«}|�|j  |¦«Œ/|r||_|S)zÏ Internal function. Reduces a compiled pattern tree to an intermediate representation suitable for feeding the automaton. This also trims off any optional pattern elements(like [a], a*). Néé)rrú(ú[ÚvalueTFú=éÚanyú')rrÚ*ú+r)rÚsymsÚMatcherrÚ Alternativesr Ú reduce_treer rÚindexrÚ Alternativer"ÚUnitÚ isinstancerÚLeafr9ÚhasattrÚDetailsÚRepeaterr$r%ÚTYPE_ANYÚgetattrÚpysymsÚSTRINGÚstripÚtokensÚNotImplementedErrorr) r&rÚnew_noder.ÚreducedrÚ details_nodeÚalternatives_nodeÚ has_repeaterÚ repeater_nodeÚhas_variable_nameÚ name_leafrs rrCrCgsè€ð€Hà „y•D”LÒ Ð àŒ}˜QÔˆà „y•DÔ%Ò%Ð%å ˆtŒ}Ñ Ô  Ò "Ð "å" 4¤=°Ô#3°VÑ<Ô<ˆH‰HõÕ$5Ð6Ñ6Ô6ˆHàœð 6ð 6�Ø”=×&Ò& uÑ-Ô-¨aÑ/ðØÝ% e¨XÑ6Ô6�ØÐ&ØÔ%×,Ò,¨WÑ5Ô5Ð5øñ  6𠌕dÔ&Ò &Ð &Ý ˆtŒ}Ñ Ô  Ò !Ð !å¥JÐ/Ñ/Ô/ˆHØœð 6ð 6�Ý% e¨XÑ6Ô6�Øð6ØÔ%×,Ò,¨WÑ5Ô5Ð5øØÔ$ð à�ùõ# 4¤=°Ô#3°VÑ<Ô<ˆH‰Hà Œ•d”iÒ Ñ Ý �t”} QÔ'­¬Ñ 5Ô 5ð 9Ø ŒM˜!Ô Ô " cÒ )Ð )å˜tœ}¨QÔ/°Ñ8Ô8Ð 8Ý ˜œ  aÔ(­&¬+Ñ 6Ô 6ð ØŒ}˜QÔÔ%¨Ò,Ð,å�D”MÑ"Ô" 1Ò$Ð$Ý�t”} QÔ'¨Ñ1Ô1ð%àŒ}˜QÔÔ%¨Ò,Ð,à�4àˆØˆ Ø ÐØˆ ؈ Ø!Ðà”]ð )ð )ˆEØŒz�Tœ\Ò)Ð)Ø�Ø$� � Ø”�tœ}Ò,Ð,Ø#� Ø %� � Ø”�tÔ0Ò0Ð0Ø$)Ð!Ý�u˜gÑ&Ô&ð )¨5¬;¸#Ò+=Ð+=Ø$(Ð!øð ð )àœ  aÔ(ˆIÝ�y 'Ñ*Ô*ð -¨y¬À#Ò/EÐ/Eà œM¨!Ô,� øàœ  aÔ(ˆIð Œ>�\Ô.Ò .Ð .àŒ %Ò'Ð'Ý"­Ð1Ñ1Ô1�‘å�<¨¬Ñ9Ô9ðNÝ&­GµLÀ)Ä/Ñ,RÔ,RÐSÑSÔS�H�Hå&­GµF¸I¼OÑ,LÔ,LÐMÑMÔM�H�Hà Œ^�|Ô2Ò 2Ð 2ð”?×(Ò(¨Ñ-Ô-ˆDØ•vˆ~ˆ~Ý"­¨t¬ Ð5Ñ5Ô5��å"­ Ô(9ÀÐEÑEÔE��Ø Œ^�tÔ0Ò 0Ð 0Ý"Ð#4°fÑ=Ô=ˆHð ð *ØÔ% aÔ(Ô.°#Ò5Ð5à��ØÔ'¨Ô*Ô0°CÒ7Ð7àõ*Ð)ð ð 6˜HÐ0Ø%Ô.¨q°¨tÔ4ð 6ð 6�å% e¨XÑ6Ô6�ØÐ&ØÔ%×,Ò,¨WÑ5Ô5Ð5øØð!Ø ˆŒØ €Orc󇇗t|t¦«s|St|¦«dkr|dSg}g}gd¢Šg}dŠ|D]¡}tt |d„¦«¦«r�tt |ˆfd„¦«¦«r| |¦«ŒVtt |ˆfd„¦«¦«r| |¦«ŒŒ| |¦«Œ¢|r|}n |r|}n|r|}t |t¬¦«S) z„Picks the most characteristic from a list of linear patterns Current order used is: names > common_names > common_chars rr5)ÚinÚforÚifÚnotÚNonez[]().,:có.—t|¦«tuS©N)rr)Úxs rúz/get_characteristic_subpattern..ýs€­d°1©g¬g½¨n€rcó6•—t|t¦«o|‰vSrb©rGr)rcÚ common_charss €rrdz/get_characteristic_subpattern..ÿsø€¥j°µCÑ&8Ô&8Ð&N¸QÀ,Ð=N€rcó6•—t|t¦«o|‰vSrbrf)rcÚ common_namess €rrdz/get_characteristic_subpattern..sø€­ °1µcÑ(:Ô(:Ð(P¸qÀLÐ?P€r)Úkey)rGÚlistr r<Úrec_testrÚmax)Ú subpatternsÚsubpatterns_with_namesÚsubpatterns_with_common_namesÚsubpatterns_with_common_charsÚ subpatternrgris @@rr#r#ìsoøø€õ �k¥4Ñ (Ô (ðØÐÝ ˆ;ÑÔ˜ÒÐØ˜1Œ~Ðð ÐØ$&Ð!Ø6Ð6Ð6€LØ$&Ð!Ø€LØ!ð :ð :ˆ Ý �x˜ Ð$<Ð$<Ñ=Ô=Ñ >Ô >ð :Ý•8˜JØNÐNÐNÐNñPôPñQôQð :à-×4Ò4°ZÑ@Ô@Ð@Ð@Ý•X˜jØPÐPÐPÐPñRôRñSôSð :à-×4Ò4°ZÑ@Ô@Ð@Ð@ð'×-Ò-¨jÑ9Ô9Ð9øàð4Ø,ˆ ˆ Ø &ð4Ø3ˆ ˆ Ø &ð4Ø3ˆ å ˆ{¥Ð $Ñ $Ô $Ð$rc#ó”K—|D]B}t|ttf¦«rt||¦«Ed{V—†Œ5||¦«V—ŒCdS)zPTests test_func on all items of sequence and items of included sub-iterablesN)rGrkr!rl)ÚsequenceÚ test_funcrcs rrlrlssèè€ðððˆÝ �a�$¥˜Ñ 'Ô 'ð Ý  9Ñ-Ô-Ð -Ð -Ð -Ð -Ð -Ð -Ð -Ð -à�)˜A‘,”,Ð Ð Ð Ð ð ðrrb)r2ÚrÚpgen2rrÚpygramrrr@rNÚopmaprQr$rLrr"Úobjectr rCr#rlr3rrúr{sèðØ2Ð2àÐÐÐÐÐØ!Ð!Ð!Ð!Ð!Ð!Ð!Ð!Ø3Ð3Ð3Ð3Ð3Ð3Ð3Ð3à€Ø €Ø Œ€Ø€ à €ØÐØ € ðUðUðUðUðUˆfñUôUðUðnBðBðBðBðJ#%ð#%ð#%ðJððððr