Name	Size	Mode	Actions
btm_matcher.cpython-37.opt-1.pyc	4890	0644	editdlrm
btm_matcher.cpython-37.opt-2.pyc	3319	0644	editdlrm
btm_matcher.cpython-37.pyc	4890	0644	editdlrm
btm_utils.cpython-37.opt-1.pyc	6140	0644	editdlrm
btm_utils.cpython-37.opt-2.pyc	4620	0644	editdlrm
btm_utils.cpython-37.pyc	6140	0644	editdlrm
fixer_base.cpython-37.opt-1.pyc	6232	0644	editdlrm
fixer_base.cpython-37.opt-2.pyc	3471	0644	editdlrm
fixer_base.cpython-37.pyc	6232	0644	editdlrm
fixer_util.cpython-37.opt-1.pyc	12043	0644	editdlrm
fixer_util.cpython-37.opt-2.pyc	9875	0644	editdlrm
fixer_util.cpython-37.pyc	12043	0644	editdlrm
main.cpython-37.opt-1.pyc	8525	0644	editdlrm
main.cpython-37.opt-2.pyc	6770	0644	editdlrm
main.cpython-37.pyc	8559	0644	editdlrm
patcomp.cpython-37.opt-1.pyc	5366	0644	editdlrm
patcomp.cpython-37.opt-2.pyc	4856	0644	editdlrm
patcomp.cpython-37.pyc	5608	0644	editdlrm
pygram.cpython-37.opt-1.pyc	1195	0644	editdlrm
pygram.cpython-37.opt-2.pyc	990	0644	editdlrm
pygram.cpython-37.pyc	1195	0644	editdlrm
pytree.cpython-37.opt-1.pyc	24323	0644	editdlrm
pytree.cpython-37.opt-2.pyc	14929	0644	editdlrm
pytree.cpython-37.pyc	25000	0644	editdlrm
refactor.cpython-37.opt-1.pyc	20329	0644	editdlrm
refactor.cpython-37.opt-2.pyc	16281	0644	editdlrm
refactor.cpython-37.pyc	20362	0644	editdlrm
__init__.cpython-37.opt-1.pyc	140	0644	editdlrm
__init__.cpython-37.opt-2.pyc	140	0644	editdlrm
__init__.cpython-37.pyc	140	0644	editdlrm
__main__.cpython-37.opt-1.pyc	224	0644	editdlrm
__main__.cpython-37.opt-2.pyc	224	0644	editdlrm
__main__.cpython-37.pyc	224	0644	editdlrm

B  f��@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/python37/lib64/python3.7/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 getLoggerZlogger)
rrrrrs




zBottomMatcher.__init__cCsL|j�
|
�

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

q4WdS)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
�rhg}xF|
d
D]:}|j||d�}x&|D]}|�|�|
dd�|��

q>Wq&W|S|
d
|jkr�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_noderrrr1s"



"



zBottomMatcher.addc Cs
|j}t
t�
}x�|
D]�}|}x�|r�d
|_x,|jD]"}t|tj�r0|jdkr0d|_Pq0W|j dkrh|j}n|j }||j kr�|j |}xj|jD]}||�|�

q�WnL|j}|j dk r�|j jr�P||j kr�|j |}x|jD]}||�|�

q�W|j }qWqW|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_nodeZchildZ node_tokenrrrr�runSs6








 



 


zBottomMatcher.runc

s*td
�

�f
dd���|j
�

td�

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






z*BottomMatcher.print_ac..print_node�
}N)r.r)
rr)
r1r�print_ac�s

zBottomMatcher.print_acN) rrrrrr!rr,r3rrrrrs"8rc
CsHtss