ó
AögWc@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 <gboutsioukis@gmail.com>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./lib2to3/btm_matcher.pyt__init__s
	
	

(t__name__t
__module__t__doc__t	itertoolsRR(((s./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./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./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
<n|j|
d
}|
dré|j|
dd|ƒ

}n	|g
}|SdS(s5Recursively adds a linear pattern to the AC automatoniRi
N(t
isinstancettupleRtextendRR(RtpatternRR"talternativet	end_nodestendt	next_node((s./lib2to3/btm_matcher.pyR1s"




%
	


	
c	Cs
|j}t
tƒ
}x
|
D]y
}|}xj
|r”
t|_x?|jD]4}t|tjƒrD|j	d
krDt
|_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(suThe 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
N(RRtlisttTruetwas_checkedtchildrenR%R
tLeaftvaluetFalsettypeRRRtparenttNonetkeys(	Rtleavestcurrent_ac_nodetresultstleaftcurrent_ast_nodetchildt
node_tokenR((s./lib2to3/btm_matcher.pytrunSs>	




	
	
!
	

	





	








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./lib2to3/btm_matcher.pyRE“s




'


t
}N(
R(
R((
REs./lib2to3/btm_matcher.pytprint_acs


(R
RRRR$RR?RG(((s./lib2to3/btm_matcher.pyRs			"	=c
CshtsXd
dl
m}

x?|
jjƒD]+\}}t|ƒ
tkr&|t|<q&q&Wntj||ƒS(Ni
(
tpython_symbols(t_type_reprstpygramRHt__dict__titemsR4tintt
setdefault(ttype_numRHtnametval((s./lib2to3/btm_matcher.pyR@ s


(Rt
__author__RRtcollectionsRRR
t	btm_utilsRtobjectRRRIR@(((s./lib2to3/btm_matcher.pyt<module>s


	…