Name	Size	Mode	Actions
btm_matcher.cpython-39.opt-1.pyc	4890	0644	editdlrm
btm_matcher.cpython-39.opt-2.pyc	3319	0644	editdlrm
btm_matcher.cpython-39.pyc	4890	0644	editdlrm
btm_utils.cpython-39.opt-1.pyc	6161	0644	editdlrm
btm_utils.cpython-39.opt-2.pyc	4649	0644	editdlrm
btm_utils.cpython-39.pyc	6161	0644	editdlrm
fixer_base.cpython-39.opt-1.pyc	6268	0644	editdlrm
fixer_base.cpython-39.opt-2.pyc	3517	0644	editdlrm
fixer_base.cpython-39.pyc	6268	0644	editdlrm
fixer_util.cpython-39.opt-1.pyc	12183	0644	editdlrm
fixer_util.cpython-39.opt-2.pyc	10020	0644	editdlrm
fixer_util.cpython-39.pyc	12183	0644	editdlrm
main.cpython-39.opt-1.pyc	8684	0644	editdlrm
main.cpython-39.opt-2.pyc	6931	0644	editdlrm
main.cpython-39.pyc	8702	0644	editdlrm
patcomp.cpython-39.opt-1.pyc	5402	0644	editdlrm
patcomp.cpython-39.opt-2.pyc	4894	0644	editdlrm
patcomp.cpython-39.pyc	5618	0644	editdlrm
pygram.cpython-39.opt-1.pyc	1275	0644	editdlrm
pygram.cpython-39.opt-2.pyc	1070	0644	editdlrm
pygram.cpython-39.pyc	1275	0644	editdlrm
pytree.cpython-39.opt-1.pyc	23685	0644	editdlrm
pytree.cpython-39.opt-2.pyc	14982	0644	editdlrm
pytree.cpython-39.pyc	24308	0644	editdlrm
refactor.cpython-39.opt-1.pyc	20626	0644	editdlrm
refactor.cpython-39.opt-2.pyc	16580	0644	editdlrm
refactor.cpython-39.pyc	20656	0644	editdlrm
__init__.cpython-39.opt-1.pyc	315	0644	editdlrm
__init__.cpython-39.opt-2.pyc	315	0644	editdlrm
__init__.cpython-39.pyc	315	0644	editdlrm
__main__.cpython-39.opt-1.pyc	228	0644	editdlrm
__main__.cpython-39.opt-2.pyc	228	0644	editdlrm
__main__.cpython-39.pyc	228	0644	editdlrm

a XC?h��@sldZd
Z
ddlZddlZddlmZ
ddlmZ
ddlm Z
Gdd �d e �ZGd d�de �Zia dd �ZdS)a�
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.z+George Boutsioukis �N)
�defaultdict�
)
�pytree)
�reduce_treec@s eZ
dZd
Ze��Zdd�ZdS)�BMNodez?Class for a node of the Aho-Corasick automaton used in matchingc

Cs"i|_g|_
ttj�
|_d
|_dS)N�)�transition_table�fixers�nextr�count�id�content�
�self�r�8/opt/alt/python39/lib64/python3.9/lib2to3/btm_matcher.py�__init__s



zBMNode.__init__N)�__name__� __module__�__qualname__�__doc__� itertoolsrrrrrrrs


rc@s8eZ
dZd
Zdd�Zdd�Zdd�Zdd �Zd d�ZdS) � BottomMatcherzgThe main matcher class. After instantiating the patterns should be added using the add_fixer methodc

Cs0t�|_
t�|_|jg
|_g|_t�d
�
|_dS)NZRefactoringTool) �set�matchr�rootZnodesr �loggingZ getLoggerZloggerrrrrrs




zBottomMatcher.__init__cCsH|j�
|
�

t|
j�
}|��}|j||jd
�}|D]}|j�
|
�

q2dS)z�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 reached�
�startN)r �appendrZpattern_treeZget_linear_subpattern�addr)r�fixerZtreeZlinear�match_nodesZ match_noderrr� add_fixer%s




zBottomMatcher.add_fixerc Cs�|
s |g
St|
d
t
�r`g}|
d
D]6}|j||d�}|D]}|�|�|
dd�|��

q:q$|S|
d
|jv
r�t�}||j|
d
<n|j|
d
}|
dd�r�|j|
dd�|d�}n|g
}|SdS)z5Recursively adds a linear pattern to the AC automatonr
rrN)� isinstance�tupler �extendrr)r�patternrr"ZalternativeZ end_nodes�endZ next_noderrrr 1s"







zBottomMatcher.addc Cs�|j}t
t�
}|
D]�}|}|rd
|_|jD]$}t|tj�r*|jdkr*d|_
qPq*|j dkrb|j}n|j }||j vr�|j |}|jD]}||�|�

q�nH|j}|j du
r�|j jr�q||j vr�|j |}|jD]}||�|�

q�|j }qq|S)auThe 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 T�
;FrN)rr�listZwas_checkedZchildrenr$rZLeaf�value�typerr r�parent) rZleavesZcurrent_ac_nodeZresultsZleafZcurrent_ast_node�childZ node_tokenr!rrr�runSs8








 



� 


zBottomMatcher.runc

s*td
�

�f
dd���|j
�

td�

dS)z %d [label=%s] //%sr)r�keys�printr� type_repr�strr r )ZnodeZsubnode_keyZsubnode�
� print_noderrr5�s



�

z*BottomMatcher.print_ac..print_node�
}N)r1rrrr4r�print_ac�s

zBottomMatcher.print_acN) rrrrrr#r r/r7rrrrrs
"8rc
CsDts8d
dl
m}

|
j��D]\}}t|�
tkr|t|<qt�||�S)Nr)
�python_symbols)�_type_reprsZpygramr8�__dict__�itemsr,�int� setdefault)Ztype_numr8�name�valrrrr2�s 


r2)r� __author__rr�collectionsrrrZ btm_utilsr�objectrrr9r2rrrr�
s