OwlCyberSecurity - MANAGER
Edit File: pytree.cpython-310.opt-1.pyc
o �?OgFm � @ s� d Z dZddlZddlmZ dZi add� ZG dd � d e�Z G d d � d e �Z G d d � d e �Z dd� Z G dd� de�Z G dd� de �ZG dd� de �ZG dd� de �ZG dd� de �Zdd� ZdS ) z� Python parse tree definitions. This is a very concrete parse tree; we need to keep every token and even the comments and whitespace between tokens. There's also a pattern matching implementation here. z#Guido van Rossum <guido@python.org>� N)�StringIOi���c C sD t s ddlm} |j�� D ]\}}t|�tkr|t |< q t �| | �S )N� )�python_symbols)� _type_reprsZpygramr �__dict__�items�type�int� setdefault)Ztype_numr �name�val� r �5/opt/alt/python310/lib64/python3.10/lib2to3/pytree.py� type_repr s � r c @ s� e Zd ZdZdZdZdZdZdZdd� Z dd� Z dZ d d � Z d d � Z d d� Zdd� Zdd� Zdd� Zdd� Zdd� Zedd� �Zedd � �Zd d � Zd d � Zd!d"� Zejd#k r]d$d%� Z dS dS )&�Basez� Abstract base class for Node and Leaf. This provides some default functionality and boilerplate using the template pattern. A node may be a subnode of at most one parent. Nr Fc O � t �| �S )z7Constructor that prevents Base from being instantiated.��object�__new__��cls�args�kwdsr r r r 1 � z Base.__new__c C s | j |j urtS | �|�S )zW Compare two nodes for equality. This calls the method _eq(). )� __class__�NotImplemented�_eq��self�otherr r r �__eq__6 s z Base.__eq__c C � t �)a_ Compare two nodes for equality. This is called by __eq__ and __ne__. It is only called if the two nodes have the same type. This must be implemented by the concrete subclass. Nodes should be considered equal if they have the same structure, ignoring the prefix string and other context information. ��NotImplementedErrorr r r r r B s zBase._eqc C r! )zr Return a cloned (deep) copy of self. This must be implemented by the concrete subclass. r" �r r r r �cloneM � z Base.clonec C r! )zx Return a post-order iterator for the tree. This must be implemented by the concrete subclass. r" r$ r r r � post_orderU r& zBase.post_orderc C r! )zw Return a pre-order iterator for the tree. This must be implemented by the concrete subclass. r" r$ r r r � pre_order] r& zBase.pre_orderc C s~ t |t�s|g}g }d}| jjD ]}|| u r"|dur |�|� d}q|�|� q| j�� || j_|D ]}| j|_q3d| _dS )z/Replace this node with a new one in the parent.FNT)� isinstance�list�parent�children�extend�append�changed)r �newZ l_children�found�ch�xr r r �replacee s z Base.replacec C s2 | }t |t�s|js dS |jd }t |t�r|jS )z9Return the line number which generated the invocant node.Nr )r) �Leafr, �lineno�r �noder r r � get_lineno| s �zBase.get_linenoc C s | j r| j �� d| _d S )NT)r+ r/ � was_changedr$ r r r r/ � s z Base.changedc C sN | j r#t| j j�D ]\}}|| u r"| j �� | j j|= d| _ | S q dS dS )z� Remove the node from the tree. Returns the position of the node in its parent's children before it was removed. N)r+ � enumerater, r/ )r �ir8 r r r �remove� s ��z Base.removec C s^ | j du rdS t| j j�D ] \}}|| u r,z | j j|d W S ty+ Y dS w q dS )z� The node immediately following the invocant in their parent's children list. If the invocant does not have a next sibling, it is None Nr )r+ r; r, � IndexError�r r< �childr r r � next_sibling� s ���zBase.next_siblingc C sR | j du rdS t| j j�D ]\}}|| u r&|dkr dS | j j|d S q dS )z� The node immediately preceding the invocant in their parent's children list. If the invocant does not have a previous sibling, it is None. Nr r )r+ r; r, r? r r r � prev_sibling� s ��zBase.prev_siblingc c s � | j D ] }|�� E d H qd S �N)r, �leaves�r r@ r r r rD � s � �z Base.leavesc C s | j d u rdS d| j �� S )Nr r )r+ �depthr$ r r r rF � s z Base.depthc C s | j }|du r dS |jS )z� Return the string immediately following the invocant node. This is effectively equivalent to node.next_sibling.prefix N� )rA �prefix)r Znext_sibr r r � get_suffix� s zBase.get_suffix�� r c C s t | ��d�S )N�ascii)�str�encoder$ r r r �__str__� s z Base.__str__) �__name__� __module__� __qualname__�__doc__r r+ r, r: Z was_checkedr r �__hash__r r% r' r( r4 r9 r/ r= �propertyrA rB rD rF rI �sys� version_inforO r r r r r s8 �r c @ s� e Zd ZdZ ddd�Zdd� Zdd� Zejd kr eZ d d � Z d d � Z dd� Z dd� Z edd� �Zejdd� �Zdd� Zdd� Zdd� ZdS ) �Nodez+Concrete implementation for interior nodes.Nc C sP || _ t|�| _| jD ]}| |_q |dur|| _|r#|dd� | _dS d| _dS )z� Initializer. Takes a type constant (a symbol number >= 256), a sequence of child nodes, and an optional context keyword argument. As a side effect, the parent pointers of the children are updated. N)r r* r, r+ rH �fixers_applied)r r r, �contextrH rY r2 r r r �__init__� s z Node.__init__c C s d| j jt| j�| jf S )�)Return a canonical string representation.z %s(%s, %r))r rP r r r, r$ r r r �__repr__� s �z Node.__repr__c C s d� tt| j��S )�k Return a pretty string representation. This reproduces the input source exactly. rG )�join�maprM r, r$ r r r � __unicode__� s zNode.__unicode__rJ c C � | j | jf|j |jfkS �z Compare two nodes for equality.)r r, r r r r r � � zNode._eqc C s t | jdd� | jD �| jd�S )�$Return a cloned (deep) copy of self.c S s g | ]}|� � �qS r )r% )�.0r2 r r r � <listcomp> s z Node.clone.<locals>.<listcomp>�rY )rX r r, rY r$ r r r r% s �z Node.clonec c s& � | j D ] }|�� E dH q| V dS �z*Return a post-order iterator for the tree.N)r, r' rE r r r r' s � zNode.post_orderc c s& � | V | j D ] }|�� E dH qdS �z)Return a pre-order iterator for the tree.N)r, r( rE r r r r( s � �zNode.pre_orderc C s | j sdS | j d jS )zO The whitespace and comments preceding this node in the input. rG r �r, rH r$ r r r rH s z Node.prefixc C s | j r || j d _d S d S �Nr rk �r rH r r r rH s �c C s( | |_ d| j| _ || j|< | �� dS )z� Equivalent to 'node.children[i] = child'. This method also sets the child's parent attribute appropriately. N)r+ r, r/ r? r r r � set_child s zNode.set_childc C s | |_ | j�||� | �� dS )z� Equivalent to 'node.children.insert(i, child)'. This method also sets the child's parent attribute appropriately. N)r+ r, �insertr/ r? r r r � insert_child* s zNode.insert_childc C s | |_ | j�|� | �� dS )z� Equivalent to 'node.children.append(child)'. This method also sets the child's parent attribute appropriately. N)r+ r, r. r/ rE r r r � append_child3 s zNode.append_child�NNN)rP rQ rR rS r[ r] ra rV rW rO r r% r' r( rU rH �setterrn rp rq r r r r rX � s* � rX c @ s� e Zd ZdZdZdZdZddg fdd�Zdd� Zd d � Z e j d kr#e Z d d � Z dd� Zdd� Zdd� Zdd� Zedd� �Zejdd� �ZdS )r5 z'Concrete implementation for leaf nodes.rG r Nc C sF |dur |\| _ \| _| _|| _|| _|dur|| _ |dd� | _dS )z� Initializer. Takes a type constant (a token number < 256), a string value, and an optional context keyword argument. N)�_prefixr6 �columnr �valuerY )r r rv rZ rH rY r r r r[ F s z Leaf.__init__c C s d| j j| j| jf S )r\ z %s(%r, %r))r rP r rv r$ r r r r] Y s �z Leaf.__repr__c C s | j t| j� S )r^ )rH rM rv r$ r r r ra _ s zLeaf.__unicode__rJ c C rb rc )r rv r r r r r j rd zLeaf._eqc C s$ t | j| j| j| j| jff| jd�S )re rh )r5 r rv rH r6 ru rY r$ r r r r% n s �z Leaf.clonec c s � | V d S rC r r$ r r r rD t s � z Leaf.leavesc c � � | V dS ri r r$ r r r r' w � � zLeaf.post_orderc c rw rj r r$ r r r r( { rx zLeaf.pre_orderc C s | j S )zP The whitespace and comments preceding this token in the input. )rt r$ r r r rH s z Leaf.prefixc C s | � � || _d S rC )r/ rt rm r r r rH � s )rP rQ rR rS rt r6 ru r[ r] ra rV rW rO r r% rD r' r( rU rH rs r r r r r5 = s, � r5 c C sJ |\}}}}|s || j v r t|�dkr|d S t|||d�S t|||d�S )z� Convert raw node information to a Node or Leaf instance. This is passed to the parser driver which calls it whenever a reduction of a grammar rule produces a new complete node, so that the tree is build strictly bottom-up. r r )rZ )Z number2symbol�lenrX r5 )ZgrZraw_noder rv rZ r, r r r �convert� s rz c @ sP e Zd ZdZdZdZdZdd� Zdd� Zdd� Z dd d �Z dd d �Z d d� Z dS )� BasePatterna� A pattern is a tree matching pattern. It looks for a specific node type (token or symbol), and optionally for a specific content. This is an abstract base class. There are three concrete subclasses: - LeafPattern matches a single leaf node; - NodePattern matches a single node (usually non-leaf); - WildcardPattern matches a sequence of nodes of variable length. Nc O r )z>Constructor that prevents BasePattern from being instantiated.r r r r r r � r zBasePattern.__new__c C sV t | j�| j| jg}|r |d d u r |d= |r |d d u sd| jjd�tt|��f S )N���z%s(%s)z, ) r r �contentr r rP r_ r` �repr)r r r r r r] � s � zBasePattern.__repr__c C s | S )z� A subclass can define this as a hook for optimizations. Returns either self or another node with the same effect. r r$ r r r �optimize� r& zBasePattern.optimizec C sn | j dur |j | j kr dS | jdur)d}|duri }| �||�s"dS |r)|�|� |dur5| jr5||| j< dS )a# Does this pattern exactly match a node? Returns True if it matches, False if not. If results is not None, it must be a dict which will be updated with the nodes matching named subpatterns. Default implementation for non-wildcard patterns. NFT)r r} � _submatch�updater )r r8 �results�rr r r �match� s zBasePattern.matchc C s t |�dkrdS | �|d |�S )z� Does this pattern exactly match a sequence of nodes? Default implementation for non-wildcard patterns. r Fr )ry r� )r �nodesr� r r r � match_seq� s zBasePattern.match_seqc c s0 � i }|r| � |d |�rd|fV dS dS dS )z} Generator yielding all matches for this pattern. Default implementation for non-wildcard patterns. r r N)r� )r r� r� r r r �generate_matches� s ��z BasePattern.generate_matchesrC ) rP rQ rR rS r r} r r r] r r� r� r� r r r r r{ � s r{ c @ s* e Zd Zddd�Zd dd�Zd dd�ZdS ) � LeafPatternNc C s& |dur|dur|| _ || _|| _dS )ap Initializer. Takes optional type, content, and name. The type, if given must be a token type (< 256). If not given, this matches any *leaf* node; the content may still be required. The content, if given, must be a string. If a name is given, the matching node is stored in the results dict under that key. N)r r} r )r r r} r r r r r[ � s zLeafPattern.__init__c C s t |t�sdS t�| ||�S )z*Override match() to insist on a leaf node.F)r) r5 r{ r� �r r8 r� r r r r� s zLeafPattern.matchc C s | j |jkS )� Match the pattern's content to the node's children. This assumes the node type matches and self.content is not None. Returns True if it matches, False if not. If results is not None, it must be a dict which will be updated with the nodes matching named subpatterns. When returning False, the results dict may still be updated. )r} rv r� r r r r� s zLeafPattern._submatchrr rC )rP rQ rR r[ r� r� r r r r r� � s r� c @ s$ e Zd ZdZddd�Zddd�ZdS ) � NodePatternFNc C sP |dur|dur t |�}t|�D ] \}}t|t�r d| _q|| _|| _|| _dS )ad Initializer. Takes optional type, content, and name. The type, if given, must be a symbol type (>= 256). If the type is None this matches *any* single node (leaf or not), except if content is not None, in which it only matches non-leaf nodes that also match the content pattern. The content, if not None, must be a sequence of Patterns that must match the node's children exactly. If the content is given, the type must not be None. If a name is given, the matching node is stored in the results dict under that key. NT)r* r; r) �WildcardPattern� wildcardsr r} r )r r r} r r< �itemr r r r[ $ s � zNodePattern.__init__c C s� | j r$t| j|j�D ]\}}|t|j�kr!|dur |�|� dS q dS t| j�t|j�kr0dS t| j|j�D ] \}}|�||�sD dS q7dS )r� NTF)r� r� r} r, ry r� �zipr� )r r8 r� �cr� � subpatternr@ r r r r� A s � �zNodePattern._submatchrr rC )rP rQ rR r� r[ r� r r r r r� s r� c @ s^ e Zd ZdZddedfdd�Zdd� Zddd �Zdd d �Zd d � Z dd� Z dd� Z dd� Z dS )r� a A wildcard pattern can match zero or more nodes. This has all the flexibility needed to implement patterns like: .* .+ .? .{m,n} (a b c | d e | f) (...)* (...)+ (...)? (...){m,n} except it always uses non-greedy matching. Nr c C s< |durt tt |��}|D ]}q || _|| _|| _|| _dS )a� Initializer. Args: content: optional sequence of subsequences of patterns; if absent, matches one node; if present, each subsequence is an alternative [*] min: optional minimum number of times to match, default 0 max: optional maximum number of times to match, default HUGE name: optional name assigned to this match [*] Thus, if content is [[a, b, c], [d, e], [f, g, h]] this is equivalent to (a b c | d e | f g h); if content is None, this is equivalent to '.' in regular expression terms. The min and max parameters work as follows: min=0, max=maxint: .* min=1, max=maxint: .+ min=0, max=1: .? min=1, max=1: . If content is not None, replace the dot with the parenthesized list of alternatives, e.g. (a b c | d e | f g h)* N)�tupler` r} �min�maxr )r r} r� r� r �altr r r r[ k s zWildcardPattern.__init__c C s� d}| j dur t| j �dkr t| j d �dkr | j d d }| jdkrA| jdkrA| j du r3t| jd�S |durA| j|jkrA|�� S | jdkrgt|t�rg|jdkrg| j|jkrgt|j | j|j | j|j |j�S | S )z+Optimize certain stacked wildcard patterns.Nr r )r ) r} ry r� r� r� r r r) r� )r r� r r r r � s" �zWildcardPattern.optimizec C s | � |g|�S )z'Does this pattern exactly match a node?)r� r� r r r r� � s zWildcardPattern.matchc C sP | � |�D ] \}}|t|�kr%|dur"|�|� | jr"t|�|| j< dS qdS )z4Does this pattern exactly match a sequence of nodes?NTF)r� ry r� r r* )r r� r� r� r� r r r r� � s �zWildcardPattern.match_seqc c s> � | j du r,t| jdtt|�| j� �D ]}i }| jr$|d|� || j< ||fV qdS | jdkr9| �|�V dS ttd�rEtj }t � t_ zPz | � |d�D ]\}}| jr]|d|� || j< ||fV qMW n$ t y� | � |�D ]\}}| jr�|d|� || j< ||fV qpY nw W ttd�r�|t_ dS dS ttd�r�|t_ w )a" Generator yielding matches for a sequence of nodes. Args: nodes: sequence of nodes Yields: (count, results) tuples where: count: the match comprises nodes[:count]; results: dict containing named submatches. Nr Z bare_name� getrefcountr )r} �ranger� ry r� r �_bare_name_matches�hasattrrV �stderrr �_recursive_matches� RuntimeError�_iterative_matches)r r� �countr� Z save_stderrr r r r� � s> � � � ��� �z WildcardPattern.generate_matchesc c s� � t |�}d| jkrdi fV g }| jD ]}t||�D ]\}}||fV |�||f� qq|r{g }|D ]A\}} ||k rt|| jkrt| jD ]0}t|||d� �D ]$\} } | dkrri }|�| � |�| � || |fV |�|| |f� qNqCq3|}|s/dS dS )z(Helper to iteratively yield the matches.r N)ry r� r} r� r. r� r� ) r r� Znodelenr� r� r� r� Z new_results�c0�r0�c1�r1r r r r� � s6 � � ��� �z"WildcardPattern._iterative_matchesc C sz d}i }d}t |�}|s0||k r0d}| jD ]}|d �|| |�r)|d7 }d} nq|s0||k s|d|� || j< ||fS )z(Special optimized matcher for bare_name.r FTr N)ry r} r� r )r r� r� r� Zdoner� Zleafr r r r� � s � �z"WildcardPattern._bare_name_matchesc c s� � || j kr di fV || jk rD| jD ]2}t||�D ](\}}| �||d� |d �D ]\}}i }|�|� |�|� || |fV q*qqdS dS )z(Helper to recursively yield the matches.r Nr )r� r� r} r� r� r� ) r r� r� r� r� r� r� r� r� r r r r� s � ���z"WildcardPattern._recursive_matchesrC ) rP rQ rR rS �HUGEr[ r r� r� r� r� r� r� r r r r r� ] s # - r� c @ s. e Zd Zd dd�Zdd� Zdd� Zdd � ZdS ) �NegatedPatternNc C s |dur|| _ dS )a Initializer. The argument is either a pattern or None. If it is None, this only matches an empty sequence (effectively '$' in regex lingo). If it is not None, this matches whenever the argument pattern doesn't have any matches. N)r} )r r} r r r r[ s zNegatedPattern.__init__c C s dS )NFr r7 r r r r� ( s zNegatedPattern.matchc C s t |�dkS rl )ry )r r� r r r r� , s zNegatedPattern.match_seqc c sR � | j d u rt|�dkrdi fV d S d S | j �|�D ]\}} d S di fV d S rl )r} ry r� )r r� r� r� r r r r� 0 s � �z NegatedPattern.generate_matchesrC )rP rQ rR r[ r� r� r� r r r r r� s r� c c s� � | s di fV dS | d | dd� }}|� |�D ]-\}}|s&||fV qt |||d� �D ]\}}i }|�|� |�|� || |fV q/qdS )aR Generator yielding matches for a sequence of patterns and nodes. Args: patterns: a sequence of patterns nodes: a sequence of nodes Yields: (count, results) tuples where: count: the entire sequence of patterns matches nodes[:count]; results: dict containing named submatches. r r N)r� r� ) �patternsr� �p�restr� r� r� r� r� r r r r� < s � ��r� )rS � __author__rV �ior r� r r r r rX r5 rz r{ r� r� r� r� r� r r r r �<module> s& 1nNV,= = #