Operation   : Linux premium131.web-hosting.com 4.18.0-553.44.1.lve.el8.x86_64 #1 SMP Thu Mar 13 14:29:12 UTC 2025 x86_64
Software     : Apache
Server IP    : 162.0.232.56 | Your IP: 216.73.216.111
Domains      : 1034 Domain(s)
Permission   : [ 0755 ]

�
��f�c@s�dZd
Z
ddlZddlZddlmZ
ddlmZ
ddlm	Z	
Gdd	�d	e
�ZGd
d�de
�Zia
dd
�ZdS(u�
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.u+George Boutsioukis <gboutsioukis@gmail.com>iN(
udefaultdicti
(
upytree(
ureduce_treec

Bs2|EeZ
dZd
Zej�Zdd�ZdS(uBMNodeu?Class for a node of the Aho-Corasick automaton used in matchingc

Cs1i|_g|_
ttj�
|_d
|_dS(Nu(utransition_tableufixersunextuBMNodeucountuiducontent(
uself((u8/opt/alt/python33/lib64/python3.3/lib2to3/btm_matcher.pyu__init__s
	
	

uBMNode.__init__N(u__name__u
__module__u__qualname__u__doc__u	itertoolsucountu__init__(
u
__locals__((u8/opt/alt/python33/lib64/python3.3/lib2to3/btm_matcher.pyuBMNodes


uBMNodec

BsV|EeZ
dZd
Zdd�Zdd�Zdd�Zdd	�Zd
d�ZdS(
u
BottomMatcherugThe main matcher class. After instantiating the patterns should
    be added using the add_fixer methodc

CsFt�|_
t�|_|jg
|_g|_tjd
�
|_dS(NuRefactoringTool(	usetumatchuBMNodeurootunodesufixersuloggingu	getLoggerulogger(
uself((u8/opt/alt/python33/lib64/python3.3/lib2to3/btm_matcher.pyu__init__s




	
uBottomMatcher.__init__cCsh|jj
|
�

t|
j�
}|j�}|j|d
|j�

}x|D]}|jj
|
�

qJWdS(u�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
        reachedustartN(ufixersuappendureduce_treeupattern_treeuget_linear_subpatternuadduroot(uselfufixerutreeulinearumatch_nodesu
match_node((u8/opt/alt/python33/lib64/python3.3/lib2to3/btm_matcher.pyu	add_fixer%s





uBottomMatcher.add_fixercCs
|
s
|g
St|
d
t
�r�g}x[|
d
D]O}|j|d|�

}x1|D])}|j|j|
dd�|��

qSWq1W|S|
d
|jkr�t�}||j|
d
<n|j|
d
}|
dd�r�|j|
dd�d|�

}n	|g
}|SdS(u5Recursively adds a linear pattern to the AC automatoniustarti
N(u
isinstanceutupleuadduextendutransition_tableuBMNode(uselfupatternustartumatch_nodesualternativeu	end_nodesuendu	next_node((u8/opt/alt/python33/lib64/python3.3/lib2to3/btm_matcher.pyuadd1s"




+
	

"	
uBottomMatcher.addc	Cs�
|j}t
t�
}x�
|
D]y
}|}xj
|r�
d|_x?|jD]4}t|tj�rD|j	d
krDd|_PqDqDW|jdkr�|j	}n	|j}||jkr�|j|}x�|j
D]0}||kr�g||<n||j|�

q�Wn�|j}|jdk	r%
|jjr%
Pn||jkr�
|j|}xD|j
D]6}||j�krp
g||<n||j|�

qK
Wn|j}q+WqW|S(uuThe 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
;i
TFN(urootudefaultdictulistuTrueuwas_checkeduchildrenu
isinstanceupytreeuLeafuvalueuFalseutypeutransition_tableufixersuappenduparentuNoneukeys(	uselfuleavesucurrent_ac_nodeuresultsuleafucurrent_ast_nodeuchildu
node_tokenufixer((u8/opt/alt/python33/lib64/python3.3/lib2to3/btm_matcher.pyurunSs>	




	
	
!
	

	





	








uBottomMatcher.runc

s7td
�

�f
dd���|j
�

td�

dS(u<Prints a graphviz diagram of the BM automaton(for debugging)u
digraph g{c
s�xy|jj
�D]h}
|j|
}td
|j|jt|
�
t|j�
f�

|
dkrnt|j�

n�|�

qWdS(Nu%d -> %d [label=%s] //%si
(utransition_tableukeysuprintuidu	type_reprustrufixersucontent(unodeusubnode_keyusubnode(
u
print_node(u8/opt/alt/python33/lib64/python3.3/lib2to3/btm_matcher.pyu
print_node�s




)


u*BottomMatcher.print_ac.<locals>.print_nodeu
}N(uprinturoot(
uself((
u
print_nodeu8/opt/alt/python33/lib64/python3.3/lib2to3/btm_matcher.pyuprint_ac�s



uBottomMatcher.print_acN(	u__name__u
__module__u__qualname__u__doc__u__init__u	add_fixeruaddurunuprint_ac(
u
__locals__((u8/opt/alt/python33/lib64/python3.3/lib2to3/btm_matcher.pyu
BottomMatchers"=u
BottomMatcherc
CshtsXd
dl
m}

x?|
jj�D]+\}}t|�
tkr&|t|<q&q&Wntj||�S(Ni
(
upython_symbols(u_type_reprsupygramupython_symbolsu__dict__uitemsutypeuintu
setdefault(utype_numupython_symbolsunameuval((u8/opt/alt/python33/lib64/python3.3/lib2to3/btm_matcher.pyu	type_repr�s


u	type_repr(u__doc__u
__author__uloggingu	itertoolsucollectionsudefaultdictuupytreeu	btm_utilsureduce_treeuobjectuBMNodeu
BottomMatcheru_type_reprsu	type_repr(((u8/opt/alt/python33/lib64/python3.3/lib2to3/btm_matcher.pyu<module>s


	�