a XC?h�&�@s|dZddlmZddlmZmZddlmZmZeZ eZ ejZeZ dZdZdZGdd �d e�Zddd�Zd d�Zdd�Zd S)z0Utility functions used by the btm_matcher module�)�pytree)�grammar�token)�pattern_symbols�python_symbols��c@s:eZdZdZd dd�Zdd�Zdd�Zd d �Zdd�ZdS)�MinNodez�This class serves as an intermediate representation of the pattern tree during the conversion to sets of leaf-to-root subpatternsNcCs.||_||_g|_d|_d|_g|_g|_dS)NF)�type�name�children�leaf�parent�alternatives�group)�selfrr�r�6/opt/alt/python39/lib64/python3.9/lib2to3/btm_utils.py�__init__szMinNode.__init__cCst|j�dt|j�S)N� )�strrr)rrrr�__repr__szMinNode.__repr__cCs�|}g}|r�|jtkr^|j�|�t|j�t|j�krRt|j�g}g|_|j}qn|j}d}q�|jtkr�|j �|�t|j �t|j�kr�t |j �}g|_ |j}qn|j}d}q�|jtjkr�|j r�|�|j �n|�|j�|j}q|S)z�Internal method. Returns a characteristic path of the pattern tree. This method must be run for all leaves until the linear subpatterns are merged into a singleN)r�TYPE_ALTERNATIVESr�append�lenr �tupler� TYPE_GROUPr�get_characteristic_subpattern�token_labels�NAMEr)r�node�subprrr�leaf_to_root!s8 zMinNode.leaf_to_rootcCs&|��D]}|��}|r|SqdS)a�Drives the leaf_to_root method. The reason that leaf_to_root must be run multiple times is because we need to reject 'group' matches; for example the alternative form (a | b c) creates a group [b c] that needs to be matched. Since matching multiple linear patterns overcomes the automaton's capabilities, leaf_to_root merges each group into a single choice based on 'characteristic'ity, i.e. (a|b c) -> (a|b) if b more characteristic than c Returns: The most 'characteristic'(as defined by get_characteristic_subpattern) path for the compiled pattern tree. N)�leavesr#)r�lr"rrr�get_linear_subpatternKszMinNode.get_linear_subpatternccs*|jD]}|��EdHq|js&|VdS)z-Generator that returns the leaves of the treeN)r r$)r�childrrrr$`s zMinNode.leaves)NN) �__name__� __module__�__qualname__�__doc__rrr#r&r$rrrrr s *r Nc Cs�d}|jtjkr|jd}|jtjkr�t|j�dkrFt|jd|�}nFttd�}|jD]4}|j� |�drlqVt||�}|durV|j� |�qV�n|jtjkr�t|j�dkr�ttd�}|jD]}t||�}|r�|j� |�q�|js�d}nt|jd|�}�n�|jtj k�r�t|jdtj��r>|jdjdk�r>t|jd|�St|jdtj��rd|jdjdk�s�t|j�dk�r�t|jdd��r�|jdjdk�r�dSd }d}d}d }d} d } |jD]d}|jtjk�r�d }|}n*|jtjk�r�d }|} n|jtjk�r|}t|d��r�|jdk�r�d } �q�| �rT|jd}t|d��r^|jdk�r^|jd}n |jd}|jtjk�r�|jd k�r�ttd�}n4tt|j��r�ttt|j�d�}nttt|j�d�}n\|jtjk�r�|j�d�}|tv�r�tt|d�}nttj|d�}n|jtjk�rt||�}|�rL| jdjdk�r4d}n| jdjdk�rHnt�|�r�|du�r�|jdd�D]&}t||�}|du�rj|j� |��qj|�r�||_|S)z� Internal function. Reduces a compiled pattern tree to an intermediate representation suitable for feeding the automaton. This also trims off any optional pattern elements(like [a], a*). N��)rr�(�[�valueTF�=��any�')rr�*�+r)r�symsZMatcherr ZAlternativesr�reduce_treer r�indexrZAlternativerZUnit� isinstancerZLeafr0�hasattrZDetailsZRepeaterrr �TYPE_ANY�getattr�pysyms�STRING�strip�tokens�NotImplementedErrorr) r!rZnew_noder'ZreducedrZdetails_nodeZalternatives_nodeZhas_repeaterZ repeater_nodeZhas_variable_nameZ name_leafrrrrr8gs� �� r8cs�t|t�s|St|�dkr"|dSg}g}gd��g}d�|D]d}tt|dd��r>tt|�fdd��rv|�|�q>tt|�fdd��r�|�|�q>|�|�q>|r�|}n|r�|}n|r�|}t|td �S) z�Picks the most characteristic from a list of linear patterns Current order used is: names > common_names > common_chars rr,)�in�for�if�not�Nonez[]().,:cSst|�tuS�N)rr��xrrr��z/get_characteristic_subpattern..cst|t�o|�vSrH�r:rrI)�common_charsrrrKrLcst|t�o|�vSrHrMrI)�common_namesrrrKrL)�key)r:�listrr3�rec_testr�max)ZsubpatternsZsubpatterns_with_namesZsubpatterns_with_common_namesZsubpatterns_with_common_chars� subpatternr)rNrOrr�s6 � �rccs8|D].}t|ttf�r(t||�EdHq||�VqdS)zPTests test_func on all items of sequence and items of included sub-iterablesN)r:rQrrR)ZsequenceZ test_funcrJrrrrRsrR)N)r+�rZpgen2rrZpygramrrr7r>ZopmaprArr<rr�objectr r8rrRrrrr�sW %