Operation   : Linux premium131.web-hosting.com 4.18.0-553.44.1.lve.el8.x86_64 #1 SMP Thu Mar 13 14:29:12 UTC 2025 x86_64
Software     : Apache
Server IP    : 162.0.232.56 | Your IP: 216.73.216.111
Domains      : 1034 Domain(s)
Permission   : [ 0755 ]

o

�=?hFm�@s�dZd
Z
ddlZddlmZ
dZiadd�ZGdd	�d	e�Z	Gd
d�de	�Z
Gdd
�d
e	�Zdd�ZGdd�de�Z
Gdd�de
�ZGdd�de
�ZGdd�de
�ZGdd�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
CsDtsd
dl
m}

|
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_reprs

�
rc@s�eZ
dZd
ZdZdZdZdZdZdd�Z	dd�Z
dZd	d
�Zdd�Z
d
d�Zdd�Zdd�Zdd�Zdd�Zdd�Zedd��
Zedd��
Zdd�Zdd �Zd!d"�Zejd#kr]d$d%�ZdSdS)&�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
rr1�
zBase.__new__cCs|j|
ju
rt
S|�|
�
S)
zW
        Compare two nodes for equality.

        This calls the method _eq().
        )�	__class__�NotImplemented�_eq��self�otherr
r
r�__eq__6s


zBase.__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.
        �
�NotImplementedErrorrr
r
rrBs	zBase._eqc


Cr!)
zr
        Return a cloned (deep) copy of self.

        This must be implemented by the concrete subclass.
        r"�
rr
r
r�cloneM�z
Base.clonec


Cr!)
zx
        Return a post-order iterator for the tree.

        This must be implemented by the concrete subclass.
        r"r$r
r
r�
post_orderUr&zBase.post_orderc


Cr!)
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_ordercCs~t|
t
�s|
g
}
g}d
}|jjD]}||ur"|
du
r|�|
�

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�replacees















zBase.replacec
Cs2|}
t|
t
�s|
jsd
S|
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

Cs|jr|j�
�
d
|_dS)NT)r+r/�was_changedr$r
r
rr/�s




zBase.changedc
CsN|jr#t
|jj�
D]\}
}||ur"|j��
|jj|
=d
|_|

Sq	d
Sd
S)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�
ir8r
r
r�remove�s







��
zBase.removec
	Cs^|jd
urd
St
|jj�
D]\}
}||ur,z|jj|
dW
Sty+


Y
d
Swq
d
S)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�rr<�childr
r
r�next_sibling�s






���zBase.next_siblingc
CsR|jd
urd
St
|jj�
D]\}
}||ur&|
dkr
d
S|jj|
d
Sq
d
S)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
cs �|jD]	}
|
�
�EdH
qdS�
N)r,�leaves�rr@r
r
rrD�s�


�zBase.leavesc

Cs|jdurd
Sd|j�
�S)Nr
r)r+�depthr$r
r
rrF�s



z
Base.depthc
Cs|j}
|
d
ur	dS|
j
S)z�
        Return the string immediately following the invocant node. This is
        effectively equivalent to node.next_sibling.prefix
        N�)rA�prefix)rZnext_sibr
r
r�
get_suffix�s


zBase.get_suffix��r
c

Cst|�
�
d
�
S)N�ascii)�str�encoder$r
r
r�__str__�s
zBase.__str__)�__name__�
__module__�__qualname__�__doc__rr+r,r:Zwas_checkedrr �__hash__rr%r'r(r4r9r/r=�propertyrArBrDrFrI�sys�version_inforOr
r
r
rrs8





	






�rc@s�eZ
dZd
Z			ddd�
Zdd�Zdd�Zejd	kreZ	d
d�Z
dd
�Zdd�Zdd�Z
edd��
Zejdd��
Zdd�Zdd�Zdd�ZdS)�Nodez+Concrete implementation for interior nodes.NcCsP|
|_t
|�
|_|jD]}||_q|d
u
r||_|r#|d
d
�|_d
Sd
|_d
S)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)rr*r,r+rH�fixers_applied)rrr,�contextrHrYr2r
r
r�__init__�s








z
Node.__init__c

Csd
|jj
t|j�
|jfS)�)Return a canonical string representation.z
%s(%s, %r))rrPrrr,r$r
r
r�__repr__�s

�z
Node.__repr__c

Csd
�t
t|j��
S)�k
        Return a pretty string representation.

        This reproduces the input source exactly.
        rG)�join�maprMr,r$r
r
r�__unicode__�szNode.__unicode__rJcC�|j|j
f|
j|
j
fkS�
zCompare two nodes for equality.)rr,rr
r
rr��zNode._eqc

Cst|j
d
d�|jD�
|jd�S)�$Return a cloned (deep) copy of self.c
Ssg|]}
|
���qSr
)
r%)�.0r2r
r
r�
<listcomp>
szNode.clone.<locals>.<listcomp>�
rY)rXrr,rYr$r
r
rr%

s
�z
Node.clonec
cs&�|jD]	}
|
�
�Ed
H
q|V
d
S�z*Return a post-order iterator for the tree.N)r,r'rEr
r
rr'
s�



zNode.post_orderc
cs&�|V
|jD]	}
|
�
�Ed
H
qd
S�z)Return a pre-order iterator for the tree.N)r,r(rEr
r
rr(
s
�


�zNode.pre_orderc

Cs|jsd
S|jdj
S)zO
        The whitespace and comments preceding this node in the input.
        rGr
�r,rHr$r
r
rrH
s

zNode.prefixcCs|jr|
|jd
_
dSdS�Nr
rk�rrHr
r
rrH
s
�cCs(||_d
|j
|
_||j
|
<|��
d
S)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_childcCs ||_|j
�|
|�
|��
d
S)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_childcCs||
_|j
�|
�

|��
d
S)z�
        Equivalent to 'node.children.append(child)'. This method also sets the
        child's parent attribute appropriately.
        N)r+r,r.r/rEr
r
r�append_child3
s

zNode.append_child�NNN)rPrQrRrSr[r]rarVrWrOrr%r'r(rUrH�setterrnrprqr
r
r
rrX�s*


�






	rXc@s�eZ
dZd
ZdZdZdZddgfdd�
Zdd�Zd	d
�Z	e
jdkr#e	Zdd
�Z
dd�Zdd�Zdd�Zdd�Zedd��
Zejdd��
ZdS)r5z'Concrete implementation for leaf nodes.rGr
NcCsF|d
u
r
|\|_\|_
|_|
|_||_|d
u
r||_|d
d
�|_d
S)z�
        Initializer.

        Takes a type constant (a token number < 256), a string value, and an
        optional context keyword argument.
        N)�_prefixr6�columnr�valuerY)rrrvrZrHrYr
r
rr[F
s





z
Leaf.__init__c

Csd
|jj
|j|jfS)r\z
%s(%r, %r))rrPrrvr$r
r
rr]Y
s

�z
Leaf.__repr__c

Cs|jt
|j�
S)
r^)rHrMrvr$r
r
rra_
szLeaf.__unicode__rJcCrbrc)rrvrr
r
rrj
rdzLeaf._eqc

Cs$t|j
|j|j|j|jff|jd
�S)rerh)r5rrvrHr6rurYr$r
r
rr%n
s


�z
Leaf.clonec


cs�|V
dSrCr
r$r
r
rrDt
s�

zLeaf.leavesc


c��|V
d
Srir
r$r
r
rr'w
��
zLeaf.post_orderc


crwrjr
r$r
r
rr({
rxzLeaf.pre_orderc


Cs|jS)
zP
        The whitespace and comments preceding this token in the input.
        )
rtr$r
r
rrH
szLeaf.prefixcCs|��
|
|_
dSrC)r/rtrmr
r
rrH�
s

)rPrQrRrSrtr6rur[r]rarVrWrOrr%rDr'r(rUrHrsr
r
r
rr5=
s,




�




r5cCsJ|
\}}}}|s
||jvrt
|�
d
kr|dSt|||d�St|||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.
    rr
)
rZ)Z
number2symbol�lenrXr5)ZgrZraw_noderrvrZr,r
r
r�convert�
s


rzc@sPeZ
dZd
ZdZdZdZdd�Zdd�Zdd�Z	dd	d
�
Z
ddd�
Zd
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
Or)
z>Constructor that prevents BasePattern from being instantiated.rrr
r
rr�
rzBasePattern.__new__c
CsVt|j
�
|j|jg}
|
r|
d
dur|
d
=|
r|
d
dusd|jjd�tt|
��
fS)N���z%s(%s)z, )	rr�contentrrrPr_r`�repr)rrr
r
rr]�
s



�zBasePattern.__repr__c


Cs|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.optimizecCsn|jd
u
r
|
j|jkr
dS|j
d
u
r)d
}|d
u
ri}|�|
|�s"dS|r)|�|�

|d
u
r5|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)rr}�	_submatch�updater)rr8�results�
rr
r
r�match�
s














zBasePattern.matchcCs t|
�
d
krdS|�
|
d|�S)z�
        Does this pattern exactly match a sequence of nodes?

        Default implementation for non-wildcard patterns.
        rFr
)ryr�)r�nodesr�r
r
r�	match_seq�
s

zBasePattern.match_seqccs0�i}|
r|�|
d
|�rd|fV
dSdSdS)z}
        Generator yielding all matches for this pattern.

        Default implementation for non-wildcard patterns.
        r
rN)
r�)rr�r�r
r
r�generate_matches�
s
�

�zBasePattern.generate_matchesrC)
rPrQrRrSrr}rrr]rr�r�r�r
r
r
rr{�
s




r{c@s*eZ
dZddd�
Zd	dd�
Zd	dd�
Zd
S)
�LeafPatternNcCs&|
d
u
r|d
u
r|
|_||_
||_d
S)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)rr}r)rrr}rr
r
rr[�
s



zLeafPattern.__init__cCst|
t
�sd
St�||
|�S)z*Override match() to insist on a leaf node.F)r)r5r{r��rr8r�r
r
rr�
s


zLeafPattern.matchcCs|j|
j
kS)
�

        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}rvr�r
r
rr�s
zLeafPattern._submatchrrrC)rPrQrRr[r�r�r
r
r
rr��
s

r�c@s$eZ
dZd
Zddd�
Zddd�
ZdS)	�NodePatternFNcCsP|
d
u
r|d
u
rt|�
}t
|�
D]\}}t|t�rd|_q|
|_||_||_d
S)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�	wildcardsrr}r)rrr}rr<�itemr
r
rr[$s


�



zNodePattern.__init__cCs�|jr$t
|j|
j�D]\}}|t|
j�
kr!|d
u
r|�|�


dSq
dSt|j�
t|
j�
kr0dSt|j|
j�D]
\}}|�||�sD
dSq7dS)r�NTF)r�r�r}r,ryr��zipr�)rr8r��
cr��
subpatternr@r
r
rr�As






�




�zNodePattern._submatchrrrC)rPrQrRr�r[r�r
r
r
rr� s
r�c@s^eZ
dZd
Zddedfdd�
Zdd�Zddd	�
Zdd
d�
Zdd
�Z	dd�Z
dd�Zdd�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
cCs<|
d
u
rtt
t|
��
}
|
D]}q
|
|_||_||_||_d
S)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)rr}r�r�r�altr
r
rr[ks





zWildcardPattern.__init__c
Cs�d
}
|jd
u
rt
|j�
dkrt
|jd�
dkr|jdd}
|jdkrA|jdkrA|jd
ur3t|jd�
S|
d
u
rA|j|
jkrA|
��S|jdk
rgt|
t�rg|
jdk
rg|j|
jkrgt|
j|j|
j|j|
j|
j�S|S)z+Optimize certain stacked wildcard patterns.Nrr
)
r)	r}ryr�r�r�rrr)r�)rr�r
r
rr�s"

 















�zWildcardPattern.optimizecCs|�|
g
|�S)
z'Does this pattern exactly match a node?)
r�r�r
r
rr��szWildcardPattern.matchcCsP|�|
�
D] \}}|t
|
�
kr%|d
u
r"|�|�

|jr"t|
�
||j<
dSqdS)z4Does this pattern exactly match a sequence of nodes?NTF)r�ryr�rr*)rr�r�r�r�r
r
rr��s






�zWildcardPattern.match_seqc	cs>
�|jd
ur,t
|jdtt|
�
|j��D]}i}|jr$|
d
|�||j<||fV
qd
S|jdkr9|�|
�
V
d
Sttd�rEtj	}t
�t_	zPz|�|
d�D]\}}|jr]|
d
|�||j<||fV
qMWn$ty�


|�
|
�
D]\}}|jr�|
d
|�||j<||fV
qpYn
wWttd�r�|t_	d
Sd
Sttd�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.
        NrZ	bare_name�getrefcountr
)r}�ranger�ryr�r�_bare_name_matches�hasattrrV�stderrr�_recursive_matches�RuntimeError�_iterative_matches)rr��countr�Zsave_stderrr
r
rr��s>�
 



�









�


���


�
z WildcardPattern.generate_matchesccs��t|
�
}d
|j
krd
ifV
g}|jD]}t||
�D]\}}||fV
|�||f�

qq|r{g}|D]A\}}	||krt||jk
rt|jD]0}t||
|d��D]$\}
}|
d
krri}|�|	�

|�|�

||
|fV
|�||
|f�

qNqCq3|}|s/dSdS)z(Helper to iteratively yield the matches.r
N)ryr�r}r�r.r�r�)rr�Znodelenr�r�r�r�Znew_results�c0�r0�c1�r1r
r
rr��s6�








�












����z"WildcardPattern._iterative_matchescCszd
}i}d}t|
�
}|s0||kr0d}|j
D]}|d
�|
||�r)|d7}d}
n
q|s0||ks|
d|�||j<||fS)z(Special optimized matcher for bare_name.r
FTrN)ryr}r�r)rr�r�r�Zdoner�Zleafr
r
rr��s










��
z"WildcardPattern._bare_name_matchesc	cs��||jkrd
ifV
||j
krD|jD]2}t||
�D](\}}|�|
|d�|d�D]\}}i}|�|�

|�|�

|||fV
q*qqdSdS)z(Helper to recursively yield the matches.r
Nr)r�r�r}r�r�r�)	rr�r�r�r�r�r�r�r�r
r
rr�
s�







 






���
z"WildcardPattern._recursive_matchesrC)
rPrQrRrS�HUGEr[rr�r�r�r�r�r�r
r
r
rr�]s#

-r�c@s.eZ
dZd
dd�
Zdd�Zdd�Zdd	�Zd
S)�NegatedPatternNcCs|
d
u
r|
|_d
S)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})rr}r
r
rr[s	
zNegatedPattern.__init__c
Csd
S)NFr
r7r
r
rr�(szNegatedPattern.matchcCst|
�
d
kSrl)
ry)rr�r
r
rr�,szNegatedPattern.match_seqccsR�|jdurt
|
�
d
krd
ifV
dSdS|j�|
�
D]\}}
dSd
ifV
dSrl)r}ryr�)rr�r�r�r
r
rr�0s�


�

zNegatedPattern.generate_matchesrC)rPrQrRr[r�r�r�r
r
r
rr�s


r�c	cs��|s
d
ifV
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
rN)r�r�)	�patternsr��
p�restr�r�r�r�r�r
r
rr�<s�










��r�)rS�
__author__rV�iorr�rrrrrXr5rzr{r�r�r�r�r�r
r
r
r�<module>
s&	


1nNV,==#