0x1949 Team - FAZEMRX - MANAGER
Edit File: btm_matcher.cpython-310.pyc
o ��bc� � @ sl d Z dZddlZddlZddlmZ ddlmZ ddlm Z G dd � d e �Z G d d � d e �Z i a 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 <gboutsioukis@gmail.com>� N)� defaultdict� )�pytree)� reduce_treec @ s e Zd ZdZe�� Zdd� ZdS )�BMNodez?Class for a node of the Aho-Corasick automaton used in matchingc C s" i | _ g | _ttj�| _d| _d S )N� )�transition_table�fixers�nextr �count�id�content��self� r �*/usr/lib/python3.10/lib2to3/btm_matcher.py�__init__ s zBMNode.__init__N)�__name__� __module__� __qualname__�__doc__� itertoolsr r r r r r r s r c @ s8 e Zd ZdZdd� Zdd� Zdd� Zdd � Zd d � Zd S ) � BottomMatcherzgThe main matcher class. After instantiating the patterns should be added using the add_fixer methodc C s0 t � | _t� | _| jg| _g | _t�d�| _d S )N�RefactoringTool) �set�matchr �root�nodesr �logging� getLogger�loggerr r r r r s zBottomMatcher.__init__c C sH | j �|� t|j�}|�� }| j|| jd�}|D ]}|j �|� qdS )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 �appendr � pattern_tree�get_linear_subpattern�addr )r �fixer�tree�linear� match_nodes� match_noder r r � add_fixer% s �zBottomMatcher.add_fixerc C s� |s|gS t |d t�r0g }|d D ]}| j||d�}|D ]}|�| �|dd� |�� q q|S |d |jvrBt� }||j|d < n|j|d }|dd� r\| j|dd� |d�}|S |g}|S )z5Recursively adds a linear pattern to the AC automatonr r! r N)� isinstance�tupler& �extendr r )r �patternr" r* � alternative� end_nodes�end� next_noder r r r& 1 s& � �zBottomMatcher.addc C s� | j }tt�}|D ]l}|}|rud|_|jD ]}t|tj�r'|jdkr'd|_ nq|j dkr1|j}n|j }||j v rL|j | }|j D ] }|| � |� qAn$| j }|j durY|j jrYn ||j v rp|j | }|j D ] }|| � |� qf|j }|sq |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 N)r r �list� was_checked�childrenr- r �Leaf�value�typer r r# �parent) r �leaves�current_ac_node�results�leaf�current_ast_node�child� node_tokenr' r r r �runS s@ � � � ��"zBottomMatcher.runc s* t d� � fdd�� � | j� t d� dS )z<Prints a graphviz diagram of the BM automaton(for debugging)z digraph g{c sZ | j �� D ]%}| j | }td| j|jt|�t|j�f � |dkr&t|j� � |� qd S )Nz%d -> %d [label=%s] //%sr )r �keys�printr � type_repr�strr r )�node� subnode_key�subnode�� print_noder r rM � s � �z*BottomMatcher.print_ac.<locals>.print_node�}N)rF r r r rL r �print_ac� s zBottomMatcher.print_acN) r r r r r r, r& rD rO r r r r r s " 8r c C sD t s ddlm} |j�� D ]\}}t|�tkr|t |< q t �| | �S )Nr )�python_symbols)� _type_reprs�pygramrP �__dict__�itemsr; �int� setdefault)�type_numrP �name�valr r r rG � s � rG )r � __author__r r � collectionsr r r � btm_utilsr �objectr r rQ rG r r r r �<module> s