Файловый менеджер - Редактировать - /opt/imh-python/lib/python3.9/site-packages/parso/__pycache__/tree.cpython-39.pyc
Ðазад
a e�h? � @ s� d dl mZmZ d dlmZmZmZmZ d dlm Z de dd�dd�Z G d d� d�Z G d d � d e �Z G d d � d e �ZG dd� de �ZG dd� de�ZG dd� de�ZG dd� de �ZdS )� )�abstractmethod�abstractproperty)�List�Optional�Tuple�Union)� split_lines� NodeOrLeaf�Optional[BaseNode])�node� node_types�returnc G s( | j }|dur$|j|v r |S |j }qdS )an Recursively looks at the parents of a node and returns the first found node that matches ``node_types``. Returns ``None`` if no matching node is found. This function is deprecated, use :meth:`NodeOrLeaf.search_ancestor` instead. :param node: The ancestors of this node will be checked. :param node_types: type names that are searched for. N��parent�type)r r �n� r �z/root/rpmbuild/BUILDROOT/imh-python39-modules-3.9.7-92.el8.x86_64/opt/imh-python/lib/python3.9/site-packages/parso/tree.py�search_ancestor s r c @ s� e Zd ZU dZdZeed< ded< dd� Zdd � Zd d � Z d d � Z dd� Z e e eef d�dd��Ze e eef d�dd��Zedd� �Zedd� �Zedd� �Zed'd d ��Zedd �d d �Zd!d"�eeeef ed#�d$d%�Zd&S )(r z. The base class for nodes and leaves. �r r r r c C s | }|j dur|j }q|S )z� Returns the root node of a parser tree. The returned node doesn't have a parent node like all the other nodes/leaves. Nr )�self�scoper r r � get_root_node( s zNodeOrLeaf.get_root_nodec C s` | j }|du rdS t|j�D ]>\}}|| u r z| j j|d W S tyX Y dS 0 q dS )z� Returns the node immediately following this node in this parent's children list. If this node does not have a next sibling, it is None N� )r � enumerate�children� IndexError�r r �i�childr r r �get_next_sibling2 s zNodeOrLeaf.get_next_siblingc C sT | j }|du rdS t|j�D ]2\}}|| u r |dkr: dS | j j|d S q dS )z� Returns the node immediately preceding this node in this parent's children list. If this node does not have a previous sibling, it is None. Nr r )r r r r r r r �get_previous_siblingC s z NodeOrLeaf.get_previous_siblingc C s~ | j du rdS | }|j j}|�|�}|dkrB|j }|j du rPdS q||d }qRqz|jd }W qR tyv | Y S 0 qRdS )z� Returns the previous leaf in the parser tree. Returns `None` if this is the first element in the parser tree. Nr r ���)r r �index�AttributeError�r r �cr r r r �get_previous_leafT s z NodeOrLeaf.get_previous_leafc C s� | j du rdS | }|j j}|�|�}|t|�d krJ|j }|j du rXdS q||d }qZqz|jd }W qZ ty~ | Y S 0 qZdS )z� Returns the next leaf in the parser tree. Returns None if this is the last element in the parser tree. Nr r )r r r# �lenr$ r% r r r � get_next_leafn s zNodeOrLeaf.get_next_leaf�r c C s dS )z� Returns the starting position of the prefix as a tuple, e.g. `(3, 4)`. :return tuple of int: (line, column) Nr �r r r r � start_pos� s zNodeOrLeaf.start_posc C s dS )z� Returns the end position of the prefix as a tuple, e.g. `(3, 4)`. :return tuple of int: (line, column) Nr r+ r r r �end_pos� s zNodeOrLeaf.end_posc C s dS )a- Returns the start_pos of the prefix. This means basically it returns the end_pos of the last prefix. The `get_start_pos_of_prefix()` of the prefix `+` in `2 + 1` would be `(1, 1)`, while the start_pos is `(1, 2)`. :return tuple of int: (line, column) Nr r+ r r r �get_start_pos_of_prefix� s z"NodeOrLeaf.get_start_pos_of_prefixc C s dS )zO Returns the first leaf of a node or itself if this is a leaf. Nr r+ r r r �get_first_leaf� s zNodeOrLeaf.get_first_leafc C s dS )zN Returns the last leaf of a node or itself if this is a leaf. Nr r+ r r r � get_last_leaf� s zNodeOrLeaf.get_last_leafTc C s dS )z� Returns the code that was the input for the parser for this node. :param include_prefix: Removes the prefix (whitespace and comments) of e.g. a statement. Nr �r �include_prefixr r r �get_code� s zNodeOrLeaf.get_code)r r c G s( | j }|dur$|j|v r |S |j }qdS )a Recursively looks at the parents of this node or leaf and returns the first found node that matches ``node_types``. Returns ``None`` if no matching node is found. :param node_types: type names that are searched for. Nr )r r r r r r r � s zNodeOrLeaf.search_ancestor� )�indent)r5 r c sr |du rd�d�n:t |t�r*d�d| �n"t |t�r>d�|�ntd|����d ttttd�� ��fdd � � � | �S ) a Returns a formatted dump of the parser tree rooted at this node or leaf. This is mainly useful for debugging purposes. The ``indent`` parameter is interpreted in a similar way as :py:func:`ast.dump`. If ``indent`` is a non-negative integer or string, then the tree will be pretty-printed with that indent level. An indent level of 0, negative, or ``""`` will only insert newlines. ``None`` selects the single line representation. Using a positive integer indent indents that many spaces per level. If ``indent`` is a string (such as ``"\t"``), that string is used to indent each level. :param indent: Indentation style as described above. The default indentation is 4 spaces, which yields a pretty-printed dump. >>> import parso >>> print(parso.parse("lambda x, y: x + y").dump()) Module([ Lambda([ Keyword('lambda', (1, 0)), Param([ Name('x', (1, 7), prefix=' '), Operator(',', (1, 8)), ]), Param([ Name('y', (1, 10), prefix=' '), ]), Operator(':', (1, 11)), PythonNode('arith_expr', [ Name('x', (1, 13), prefix=' '), Operator('+', (1, 15), prefix=' '), Name('y', (1, 17), prefix=' '), ]), ]), EndMarker('', (1, 18)), ]) NF� T� z,expect 'indent' to be int, str or None, got )r r5 � top_levelr c sD d}t | �j}t| t�r�||� |� d�7 }t| t�rF|| j�d�7 }nt| t�r`|| j �d�7 }|| j�d| j��7 }| j r�|d| j ��7 }|d7 }n�t| t ��r||� |� d�7 }t| t �r�|| j �d�7 }|d7 }�r�|d7 }| j D ]}|� ||� dd �7 }q�||� d �7 }nt d | ����|�s@��r8|d 7 }n|d7 }|S ) Nr6 �(z, z , prefix=�)�[� F)r5 r8 z])z unsupported node encountered: z, )r �__name__� isinstance�Leaf� ErrorLeaf� token_type� TypedLeaf�valuer, �prefix�BaseNode�Noder � TypeError)r r5 r8 �resultZ node_typer �� _format_dumpZ indent_string�newliner r rJ � s8 z%NodeOrLeaf.dump.<locals>._format_dump)r6 T)r> �int�strrG r �bool)r r5 r rI r �dump� s & $zNodeOrLeaf.dumpN)T)r= � __module__� __qualname__�__doc__� __slots__rM �__annotations__r r r! r' r) r r rL r, r- r r. r/ r0 r3 r r r rO r r r r r s. c @ s� e Zd ZU dZdZeed< deeeef edd�dd�Z e eeef d �d d ��Z e j eeef dd �d d ��Z dd� Z dd� Zdd� Zd dd�Ze eeef d �dd��Zdd� ZdS ) r? z� Leafs are basically tokens with a better API. Leafs exactly know where they were defined and what text preceeds them. )rC �line�columnrD rD r6 N)rC r, rD r c C s || _ || _|| _d | _d S �N)rC r, rD r )r rC r, rD r r r �__init__( s z Leaf.__init__r* c C s | j | jfS rW �rU rV r+ r r r r, 8 s zLeaf.start_pos)rC r c C s |d | _ |d | _d S )Nr r rY �r rC r r r r, < s c C s6 | � � }|d u r0t| j�}| jt|� d dfS |jS )Nr r )r' r rD rU r( r- )r Z previous_leaf�linesr r r r. A s z Leaf.get_start_pos_of_prefixc C s | S rW r r+ r r r r/ I s zLeaf.get_first_leafc C s | S rW r r+ r r r r0 L s zLeaf.get_last_leafTc C s |r| j | j S | jS d S rW )rD rC r1 r r r r3 O s z Leaf.get_codec C sN t | j�}| jt|� d }| j|kr:| jt|d � }n t|d �}||fS )Nr r" )r rC rU r( rV )r r[ Z end_pos_lineZend_pos_columnr r r r- U s z Leaf.end_posc C s" | j }|s| j}dt| �j|f S )Nz<%s: %s>)rC r r= rZ r r r �__repr__` s z Leaf.__repr__)r6 )T)r= rP rQ rR rS rM rT r rL rX �propertyr, �setterr. r/ r0 r3 r- r\ r r r r r? s r? c s" e Zd ZdZd� fdd� Z� ZS )rB �r r6 c s t � �|||� || _d S rW ��superrX r )r r rC r, rD �� __class__r r rX j s zTypedLeaf.__init__)r6 )r= rP rQ rS rX � __classcell__r r rb r rB g s rB c @ s� e Zd ZdZdZee dd�dd�Zee e e f d�dd ��Z d d � Z ee e e f d�d d ��Z dd� Zd dd�Zd dd�Zdd� Zdd� Zdd� ZdS ) rE zd The super class for all nodes. A node has children, a type and possibly a parent node. )r N)r r c C s || _ d | _|D ] }| |_qd S rW )r r )r r r r r r rX v s zBaseNode.__init__r* c C s | j d jS �Nr )r r, r+ r r r r, � s zBaseNode.start_posc C s | j d �� S re )r r. r+ r r r r. � s z BaseNode.get_start_pos_of_prefixc C s | j d jS �Nr" )r r- r+ r r r r- � s zBaseNode.end_posc C sL |rd� dd� |D ��S |d jdd�}|d� dd� |dd � D �� S d S ) Nr6 c s s | ]}|� � V qd S rW �r3 ��.0r& r r r � <genexpr>� � z2BaseNode._get_code_for_children.<locals>.<genexpr>r F)r2 c s s | ]}|� � V qd S rW rg rh r r r rj � rk r )�joinr3 )r r r2 �firstr r r �_get_code_for_children� s z BaseNode._get_code_for_childrenTc C s | � | j|�S rW )rn r r1 r r r r3 � s zBaseNode.get_codeFc sL � ���fdd�� d� kr.�j d jks8n td��� dt�j �d �S )ax Get the :py:class:`parso.tree.Leaf` at ``position`` :param tuple position: A position tuple, row, column. Rows start from 1 :param bool include_prefixes: If ``False``, ``None`` will be returned if ``position`` falls on whitespace or comments before a leaf :return: :py:class:`parso.tree.Leaf` at ``position``, or ``None`` c s� | |krJ�j | }�s$�|jk r$d S z|����W S tyH | Y S 0 t| | d �}�j | }�|jkrx� | |�S � |d |�S d S )N� r )r r, �get_leaf_for_positionr$ rL r- )�lower�upper�elementr# �� binary_search�include_prefixes�positionr r r ru � s z5BaseNode.get_leaf_for_position.<locals>.binary_search)r r r" z7Please provide a position that exists within this node.r r )r r- � ValueErrorr( )r rw rv r rt r rp � s z BaseNode.get_leaf_for_positionc C s | j d �� S re )r r/ r+ r r r r/ � s zBaseNode.get_first_leafc C s | j d �� S rf )r r0 r+ r r r r0 � s zBaseNode.get_last_leafc C s> | � � �dd��dd��� }dt| �j|| jd | jd f S )Nr< r7 � z<%s: %s@%s,%s>r r )r3 �replace�stripr r= r, )r �coder r r r\ � s �zBaseNode.__repr__)T)F)r= rP rQ rR rS r r rX r] r rL r, r. r- rn r3 rp r/ r0 r\ r r r r rE o s rE c s, e Zd ZdZdZ� fdd�Zdd� Z� ZS )rF z+Concrete implementation for interior nodes.r_ c s t � �|� || _d S rW r` )r r r rb r r rX � s z Node.__init__c C s d| j j| j| jf S )Nz %s(%s, %r))rc r= r r r+ r r r r\ � s z Node.__repr__)r= rP rQ rR rS rX r\ rd r r rb r rF � s rF c @ s e Zd ZdZdZdZdS )� ErrorNodez� A node that contains valid nodes/leaves that we're follow by a token that was invalid. This basically means that the leaf after this node is where Python would mark a syntax error. r Z error_nodeN)r= rP rQ rR rS r r r r r r} � s r} c s2 e Zd ZdZdZdZd � fdd� Zdd� Z� ZS ) r@ z� A leaf that is either completely invalid in a language (like `$` in Python) or is invalid at that position. Like the star in `1 +* 1`. )rA Z error_leafr6 c s t � �|||� || _d S rW )ra rX rA )r rA rC r, rD rb r r rX � s zErrorLeaf.__init__c C s dt | �j| jt| j�| jf S )Nz<%s: %s:%s, %s>)r r= rA �reprrC r, r+ r r r r\ � s �zErrorLeaf.__repr__)r6 ) r= rP rQ rR rS r rX r\ rd r r rb r r@ � s r@ N)�abcr r �typingr r r r Z parso.utilsr rM r r r? rB rE rF r} r@ r r r r �<module> s GU
| ver. 1.1 | |
.
| PHP 8.3.30 | Ð“ÐµÐ½ÐµÑ€Ð°Ñ†Ð¸Ñ Ñтраницы: 0 |
proxy
|
phpinfo
|
ÐаÑтройка