python (3.12.0)
̑e v d Z dZddlZddlZddlmZ ddlmZ ddlm Z G d d e
Z G d
d e
Z i a
d Zy)
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 <gboutsioukis@gmail.com> N) defaultdict )pytree) reduce_treec 8 e Zd ZdZ ej
Zd Zy)BMNodez?Class for a node of the Aho-Corasick automaton used in matchingc j i | _ g | _ t t j | _ d| _ y )N )transition_tablefixersnextr countidcontentselfs G/BuggyBox/python/3.12.0/bootstrap/lib/python3.12/lib2to3/btm_matcher.py__init__zBMNode.__init__ s( " v||$ N)__name__
__module__ __qualname____doc__ itertoolsr r r r r r s I IOO Er r c . e Zd ZdZd Zd Zd Zd Zd Zy)
BottomMatcherzgThe main matcher class. After instantiating the patterns should
be added using the add_fixer methodc t | _ t | _ | j g| _ g | _ t
j d | _ y )NRefactoringTool) setmatchr rootnodesr logging getLoggerloggerr s r r zBottomMatcher.__init__ s; U
H ii[
''(9: r c | j j | t |j }|j }| j || j }|D ] }|j j | y)zReduces 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
reachedstartN)r appendr pattern_treeget_linear_subpatternaddr" )r fixertreelinear match_nodes
match_nodes r add_fixerzBottomMatcher.add_fixer% sm
5!5--.++-hhvTYYh7 % ,J $ $U + ,r c |s|gS t |d t rLg }|d D ]@ }| j || }|D ]& }|j | j |dd | ( B |S |d |j vr t }||j |d < n|j |d }|dd r| j |dd | }|S |g}|S )z5Recursively adds a linear pattern to the AC automatonr r( r N)
isinstancetupler- extendr r )r patternr) r1 alternative end_nodesend next_nodes r r- zBottomMatcher.add1 s 7N gaj% ( K &qz
C !HH[H > $ CC &&txx S'ABC
C qz!7!77 "H 5>&&wqz2 " 2 271: > qr{ HHWQR[ H B 'K r c | j }t t }|D ]? }|}|s d|_ |j D ]5 }t |t j s |j dk( s.d|_ n |j dk( r
|j }n |j }||j v r5|j | }|j D ] }|| j | nq| j }|j |j j r||j v r4|j | }|j D ] }|| j | |j }|r7B |S )au The 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;Fr )r" r list was_checkedchildrenr5 r Leafvaluetyper r r* parent) r leavescurrent_ac_noderesultsleafcurrent_ast_nodechild
node_tokenr. s r runzBottomMatcher.runS so )) d# # ;D # "/3 , - 6 6 E!%5%++:L7<(4
$((A-!1!7!7J!1!6!6J !A!AA&5&F&Fz&RO!0!7!7 @ --.>?@ '+iiO(//; , 3 3 ? ? "_%E%EE*9*J*J:*V%4%;%; DE #EN 1 12B CD $4#:#: C ## ;H r c ` t d fd | j t d y)z<Prints a graphviz diagram of the BM automaton(for debugging)z
digraph g{c
* | j j D ]u }| j | }t d| j |j t | t |j fz |dk( rt |j | w y )Nz%d -> %d [label=%s] //%sr )r keysprintr type_reprstrr r )node subnode_keysubnode
print_nodes r rW z*BottomMatcher.print_ac.<locals>.print_node s # 4 4 9 9 ;
$ // <0ww
Ik,BCDWXY Z !#'//*7#
$r }N)rQ r" )r rW s @r print_aczBottomMatcher.print_ac s%
l $ 499
c
r N) r r r r r r3 r- rM rY r r r r r s" +;
, D6p r r c t sDddlm} |j j D ]! \ }}t | t k( s|t |< # t j | | S )Nr )python_symbols) _type_reprspygramr[ __dict__itemsrD int
setdefault)type_numr[ namevals r rR rR sT * (00668 9ID#CyC DS!1 9 ! !(H 55r )r
__author__r$ r collectionsr r
r btm_utilsr objectr r r\ rR r r r <module>ri sH G ;
# "V }F }@ 6r 
Browse
Usage
Versions