Name	Size	Mode	Actions
btm_matcher.cpython-35.opt-1.pyc	5316	0644	editdlrm
btm_matcher.cpython-35.opt-2.pyc	3731	0644	editdlrm
btm_matcher.cpython-35.pyc	5316	0644	editdlrm
btm_utils.cpython-35.opt-1.pyc	6786	0644	editdlrm
btm_utils.cpython-35.opt-2.pyc	5254	0644	editdlrm
btm_utils.cpython-35.pyc	6786	0644	editdlrm
fixer_base.cpython-35.opt-1.pyc	6503	0644	editdlrm
fixer_base.cpython-35.opt-2.pyc	3728	0644	editdlrm
fixer_base.cpython-35.pyc	6503	0644	editdlrm
fixer_util.cpython-35.opt-1.pyc	13352	0644	editdlrm
fixer_util.cpython-35.opt-2.pyc	11174	0644	editdlrm
fixer_util.cpython-35.pyc	13352	0644	editdlrm
main.cpython-35.opt-1.pyc	9139	0644	editdlrm
main.cpython-35.opt-2.pyc	7372	0644	editdlrm
main.cpython-35.pyc	9178	0644	editdlrm
patcomp.cpython-35.opt-1.pyc	6035	0644	editdlrm
patcomp.cpython-35.opt-2.pyc	5515	0644	editdlrm
patcomp.cpython-35.pyc	6332	0644	editdlrm
pygram.cpython-35.opt-1.pyc	1259	0644	editdlrm
pygram.cpython-35.opt-2.pyc	1044	0644	editdlrm
pygram.cpython-35.pyc	1259	0644	editdlrm
pytree.cpython-35.opt-1.pyc	26005	0644	editdlrm
pytree.cpython-35.opt-2.pyc	16591	0644	editdlrm
pytree.cpython-35.pyc	26869	0644	editdlrm
refactor.cpython-35.opt-1.pyc	22761	0644	editdlrm
refactor.cpython-35.opt-2.pyc	18701	0644	editdlrm
refactor.cpython-35.pyc	22803	0644	editdlrm
__init__.cpython-35.opt-1.pyc	136	0644	editdlrm
__init__.cpython-35.opt-2.pyc	128	0644	editdlrm
__init__.cpython-35.pyc	136	0644	editdlrm
__main__.cpython-35.opt-1.pyc	233	0644	editdlrm
__main__.cpython-35.opt-2.pyc	225	0644	editdlrm
__main__.cpython-35.pyc	233	0644	editdlrm

 y�zf��@s�dZd
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
Zej�Zdd�ZdS)�BMNodez?Class for a node of the Aho-Corasick automaton used in matchingc

Cs1i|_g|_
ttj�
|_d
|_dS)N�)�transition_table�fixers�nextr�count�id�content)
�self�r�8/opt/alt/python35/lib64/python3.5/lib2to3/btm_matcher.py�__init__s



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


rc@sReZ
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

CsFt�|_
t�|_|jg
|_g|_tjd
�
|_dS)NZRefactoringTool) �set�matchr�rootZnodesr �loggingZ getLoggerZlogger)
rrrrrs




zBottomMatcher.__init__cCsh|jj
|
�

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

}x|D]}|jj
|
�

qJWdS)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_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
|jD]3}||j�krd
g||<||j|�

qB
W|j }q+WqW|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�keys) rZleavesZcurrent_ac_nodeZresultsZleafZcurrent_ast_nodeZchildZ node_tokenrrrr�runSs>





!


 











zBottomMatcher.runc

s7td
�

�f
dd���|j
�

td�

dS)z %d [label=%s] //%sr)rr,�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"=rc
CsbtsRd
dl
m}

x9|
jj�D](\}}t|�
tkr&|t|s


 �