Name	Size	Mode	Actions
fixes/	-	0755	rm
pgen2/	-	0755	rm
btm_matcher.py	6834	0644	editdlrm
btm_matcher.pyc	5830	0644	editdlrm
btm_matcher.pyo	5830	0644	editdlrm
btm_utils.py	10012	0644	editdlrm
btm_utils.pyc	7563	0644	editdlrm
btm_utils.pyo	7563	0644	editdlrm
fixer_base.py	6780	0644	editdlrm
fixer_base.pyc	7186	0644	editdlrm
fixer_base.pyo	7186	0644	editdlrm
fixer_util.py	14597	0644	editdlrm
fixer_util.pyc	14683	0644	editdlrm
fixer_util.pyo	14683	0644	editdlrm
Grammar.txt	7094	0644	editdlrm
Grammar2.7.18.final.0.pickle	40486	0644	editdlrm
main.py	11605	0644	editdlrm
main.pyc	9831	0644	editdlrm
main.pyo	9789	0644	editdlrm
patcomp.py	7065	0644	editdlrm
patcomp.pyc	6601	0644	editdlrm
patcomp.pyo	6289	0644	editdlrm
PatternGrammar.txt	793	0644	editdlrm
PatternGrammar2.7.18.final.0.pickle	2799	0644	editdlrm
pygram.py	1158	0644	editdlrm
pygram.pyc	1441	0644	editdlrm
pygram.pyo	1441	0644	editdlrm
pytree.py	29039	0644	editdlrm
pytree.pyc	30303	0644	editdlrm
pytree.pyo	29420	0644	editdlrm
refactor.py	28026	0644	editdlrm
refactor.pyc	23912	0644	editdlrm
refactor.pyo	23870	0644	editdlrm
__init__.py	7	0644	editdlrm
__init__.pyc	127	0644	editdlrm
__init__.pyo	127	0644	editdlrm
__main__.py	67	0644	editdlrm
__main__.pyc	242	0644	editdlrm
__main__.pyo	242	0644	editdlrm

� {fc@s�dZd
Z
ddlZddlZddlmZ
ddlmZ
ddlm Z
de f
d ��YZd e f
d��YZia 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 i����N(
tdefaultdicti
(
tpytree(
treduce_treetBMNodec
Bs#eZ
dZej�Zd
�ZRS(s?Class for a node of the Aho-Corasick automaton used in matchingc

Cs1i|_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.pyRs


t BottomMatcherc
Bs;eZ
dZd
�Zd�Zd�Zd�Zd�ZRS(sgThe main matcher class. After instantiating the patterns should be added using the add_fixer methodc

CsFt�|_
t�|_|jg
|_g|_tjd
�
|_dS(NtRefactoringTool( tsettmatchRtroottnodesRtloggingt getLoggertlogger(
R((s+/usr/lib64/python2.7/lib2to3/btm_matcher.pyRs




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(RtappendRtpattern_treetget_linear_subpatterntaddR(Rtfixerttreetlineartmatch_nodest match_node((s+/usr/lib64/python2.7/lib2to3/btm_matcher.pyt add_fixer%s




cCs�|
s |g
St|
d
t
�r�g}xU|
d
D]I}|j|d|�

}x+|D]#}|j|j|
d|��

qSWq1W|S|
d
|jkr�t�}||j|
d






!


 










c

s*d
GH�f
d���|j�

dGHdS(s<Prints a graphviz diagram of the BM automaton(for debugging)s digraph g{c
svxo|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 RRRR$RR?RG(((s+/usr/lib64/python2.7/lib2to3/btm_matcher.pyRs   " =c
CshtsXd
dl
m}

x?|
jj�D]+\}}t|�
tkr&|t|s


 �