uawdijnntqw1x1x1
IP : 18.226.186.12
Hostname : ns1.eurodns.top
Kernel : Linux ns1.eurodns.top 4.18.0-553.5.1.lve.1.el7h.x86_64 #1 SMP Fri Jun 14 14:24:52 UTC 2024 x86_64
Disable Function : mail,sendmail,exec,passthru,shell_exec,system,popen,curl_multi_exec,show_source,eval,open_base
OS : Linux
PATH:
/
home
/
.
/
.
/
..
/
..
/
lib64
/
python2.7
/
lib2to3
/
btm_matcher.pyo
/
/
� �mec@s�dZdZddlZddlZddlmZddlmZddlm Z de fd ��YZd e fd��YZia d�ZdS( s�A bottom-up tree matching algorithm implementation meant to speed up 2to3's matching process. After the tree patterns are reduced to their rarest linear path, a linear Aho-Corasick automaton is created. The linear automaton traverses the linear paths from the leaves to the root of the AST and returns a set of nodes for further matching. This reduces significantly the number of candidate nodes.s+George Boutsioukis <gboutsioukis@gmail.com>i����N(tdefaultdicti(tpytree(treduce_treetBMNodecBs#eZdZej�Zd�ZRS(s?Class for a node of the Aho-Corasick automaton used in matchingcCs1i|_g|_ttj�|_d|_dS(Nt(ttransition_tabletfixerstnextRtcounttidtcontent(tself((s+/usr/lib64/python2.7/lib2to3/btm_matcher.pyt__init__s (t__name__t __module__t__doc__t itertoolsRR(((s+/usr/lib64/python2.7/lib2to3/btm_matcher.pyRst BottomMatchercBs;eZdZd�Zd�Zd�Zd�Zd�ZRS(sgThe main matcher class. After instantiating the patterns should be added using the add_fixer methodcCsFt�|_t�|_|jg|_g|_tjd�|_dS(NtRefactoringTool( tsettmatchRtroottnodesRtloggingt getLoggertlogger(R((s+/usr/lib64/python2.7/lib2to3/btm_matcher.pyRs cCsh|jj|�t|j�}|j�}|j|d|j�}x|D]}|jj|�qJWdS(s�Reduces a fixer's pattern tree to a linear path and adds it to the matcher(a common Aho-Corasick automaton). The fixer is appended on the matching states and called when they are reachedtstartN(RtappendRtpattern_treetget_linear_subpatterntaddR(Rtfixerttreetlineartmatch_nodest match_node((s+/usr/lib64/python2.7/lib2to3/btm_matcher.pyt add_fixer%s cCs�|s |gSt|dt�r�g}xU|dD]I}|j|d|�}x+|D]#}|j|j|d|��qSWq1W|S|d|jkr�t�}||j|d<n|j|d}|dr�|j|dd|�}n |g}|SdS(s5Recursively adds a linear pattern to the AC automatoniRiN(t isinstancettupleRtextendRR(RtpatternRR"talternativet end_nodestendt next_node((s+/usr/lib64/python2.7/lib2to3/btm_matcher.pyR1s" % c Cs�|j}tt�}x�|D]y}|}xj|r�t|_x?|jD]4}t|tj�rD|j dkrDt |_PqDqDW|jdkr�|j }n |j}||jkr�|j|}x�|j D]0}||kr�g||<n||j|�q�Wn�|j}|jdk r%|jjr%Pn||jkr�|j|}xD|j D]6}||j�krpg||<n||j|�qKWn|j}q+WqW|S(suThe main interface with the bottom matcher. The tree is traversed from the bottom using the constructed automaton. Nodes are only checked once as the tree is retraversed. When the automaton fails, we give it one more shot(in case the above tree matches as a whole with the rejected leaf), then we break for the next leaf. There is the special case of multiple arguments(see code comments) where we recheck the nodes Args: The leaves of the AST tree to be matched Returns: A dictionary of node matches with fixers as the keys u;iN(RRtlisttTruetwas_checkedtchildrenR%RtLeaftvaluetFalsettypeRRRtparenttNonetkeys( Rtleavestcurrent_ac_nodetresultstleaftcurrent_ast_nodetchildt node_tokenR((s+/usr/lib64/python2.7/lib2to3/btm_matcher.pytrunSs> ! cs*dGH�fd���|j�dGHdS(s<Prints a graphviz diagram of the BM automaton(for debugging)s digraph g{csvxo|jj�D]^}|j|}d|j|jt|�t|j�fGH|dkrd|jGHn�|�qWdS(Ns%d -> %d [label=%s] //%si(RR7R t type_reprtstrRR (tnodetsubnode_keytsubnode(t print_node(s+/usr/lib64/python2.7/lib2to3/btm_matcher.pyRE�s 't}N(R(R((REs+/usr/lib64/python2.7/lib2to3/btm_matcher.pytprint_ac�s (R RRRR$RR?RG(((s+/usr/lib64/python2.7/lib2to3/btm_matcher.pyRs " =cCshtsXddlm}x?|jj�D]+\}}t|�tkr&|t|<q&q&Wntj||�S(Ni(tpython_symbols(t_type_reprstpygramRHt__dict__titemsR4tintt setdefault(ttype_numRHtnametval((s+/usr/lib64/python2.7/lib2to3/btm_matcher.pyR@�s(Rt __author__RRtcollectionsRRRt btm_utilsRtobjectRRRIR@(((s+/usr/lib64/python2.7/lib2to3/btm_matcher.pyt<module>s �
/home/././../../lib64/python2.7/lib2to3/btm_matcher.pyo