/opt/alt/python-internal/lib64/python3.11/lib2to3/__pycache__
Edit: /opt/alt/python-internal/lib64/python3.11/lib2to3/__pycache__/pytree.cpython-311.pyc (36999B)
'o' d Z dZddlZddlmZ dZi ad Z G d de Z G d d
e Z
G d d e Z d
Z G d de Z
G d de
Z G d de
Z G d de
Z G d de
Zd 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
N)StringIOic t sGddlm} |j D ]'\ }}t | t k r
|t |< (t | | S )N )python_symbols) _type_reprspygramr __dict__itemstypeint
setdefault)type_numr namevals ;/opt/alt/python-internal/lib64/python3.11/lib2to3/pytree.py type_reprr sq 9****** (06688 9 9ID#CyyC DS!1 ! !(H 5 55 c e Zd ZdZdZdZdZdZdZd Z d Z
dZ d Z d Z
d Zd
Zd Zd Zd
Zd Zed Zed Zd Zd Zd Zej dk rd 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.
N Fc \ | t us
J d t | S )z7Constructor that prevents Base from being instantiated.zCannot instantiate Base)r object__new__clsargskwdss r r z Base.__new__1 s( $ 9~~c"""r c V | j |j urt S | | S )zW
Compare two nodes for equality.
This calls the method _eq().
) __class__NotImplemented_eqselfothers r __eq__z Base.__eq__6 s) > 0 0! !xx r 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" s r r! zBase._eqB s
"!r c t )zr
Return a cloned (deep) copy of self.
This must be implemented by the concrete subclass.
r' r# s r clonez
Base.cloneM
"!r c t )zx
Return a post-order iterator for the tree.
This must be implemented by the concrete subclass.
r' r* s r
post_orderzBase.post_orderU r, r c t )zw
Return a pre-order iterator for the tree.
This must be implemented by the concrete subclass.
r' r* s r pre_orderzBase.pre_order] r, r c | j J t | |J t |t s|g}g }d}| j j D ]N}|| u r3|rJ | j j | |f || | d}9| | O|sJ | j | |f | j || j _ |D ]}| j |_ d| _ dS )z/Replace this node with a new one in the parent.NFT)parentstr
isinstancelistchildrenextendappendchanged)r# new
l_childrenfoundchxs r replacez Base.replacee s {&&D &&&#t$$ %C
+& & &BTzz CC4;#7s"CCCy? %%c*** !!"%%%%00t}dC000u ) # #A{AHH r c | }t |t s+|j sdS |j d }t |t +|j S )z9Return the line number which generated the invocant node.Nr )r4 Leafr6 linenor# nodes r
get_linenozBase.get_lineno| sR T4(( $=
=#D T4(( $ {r c T | j r| j d| _ d S )NT)r2 r9 was_changedr* s r r9 z Base.changed s. ; " K ! ! ! r c | j rTt | j j D ]<\ }}|| u r1| j | j j |= d| _ |c S ;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)r2 enumerater6 r9 )r# irD s r removez Base.remove s
; $T[%9::
44<<K''))) ,Q/"&DK HHH
r c | j dS t | j j D ]3\ }}|| u r* | j j |dz c S # t $ r Y dS w xY w4dS )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 )r2 rI r6
IndexErrorr# rJ childs r next_siblingzBase.next_sibling s ; 4 "$+"677 HAu}} ;/!4444! 444 s A
AAc | j dS t | j j D ])\ }}|| u r |dk r dS | j j |dz
c S *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 )r2 rI r6 rN s r prev_siblingzBase.prev_sibling su ; 4 "$+"677 1 1HAu}}66 44{+AaC0000 1 1r c # R K | j D ] }| E d {V d S N)r6 leavesr# rO s r rU z Base.leaves sD ] & &E ||~~ % % % % % % % % & &r c L | j dS d| j z S )Nr r )r2 depthr* s r rX z
Base.depth s( ; 14;$$&&&&r c & | j }|dS |j S )z
Return the string immediately following the invocant node. This is
effectively equivalent to node.next_sibling.prefix
N )rP prefix)r# next_sibs r
get_suffixzBase.get_suffix s
$ 2 r r c F t | d S )Nascii)r3 encoder* s r __str__z Base.__str__ s t99##G,, ,r ) __name__
__module__ __qualname____doc__r r2 r6 rG was_checkedr r% __hash__r! r+ r. r0 r? rE r9 rK propertyrP rR rU rX r] sys version_inforc r r r r r s` D
FHKK# # #
H " " "" " "" " "" " " .
X
1
1 X
1 & & &' ' '
& - - - - - ! r r c e Zd ZdZ ddZd Zd Zej dk reZ d Z
d Z d Z d
Z
ed Zej d Zd
Zd Zd ZdS )Nodez+Concrete implementation for interior nodes.Nc |dk s
J | || _ t | | _ | j D ]'}|j J t | | |_ (||| _ |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 r5 r6 r2 reprr[ fixers_applied)r# r r6 contextr[ rr r= s r __init__z
Node.__init__ s s{{{D{{{ X
- B9$$d2hh$$$ BII DK '"0"3D "&D r c Z | j j dt | j d| j dS z)Return a canonical string representation.(, ))r rd r r r6 r* s r __repr__z
Node.__repr__ s6 #~ 6 6 6 ( 3 3 3 3 #}}}. .r c \ d t t | j S )k
Return a pretty string representation.
This reproduces the input source exactly.
rZ )joinmapr3 r6 r* s r __unicode__zNode.__unicode__ s" wws3
..///r r^ c > | j | j f|j |j fk S z Compare two nodes for equality.)r r6 r" s r r! zNode._eq s 4=)ej%.-IIIr c X t | j d | j D | j S )$Return a cloned (deep) copy of self.c 6 g | ]}| S r )r+ ).0r= s r
z Node.clone.. s C C Cr
C C Cr rr )rn r r6 rr r* s r r+ z
Node.clone s6 DI C CT] C C C#'#68 8 8 8r c # Z K | j D ] }| E d{V | V dS z*Return a post-order iterator for the tree.N)r6 r. rV s r r. zNode.post_order sK ] * *E '')) ) ) ) ) ) ) ) )
r c # Z K | V | j D ] }| E d{V dS z)Return a pre-order iterator for the tree.N)r6 r0 rV s r r0 zNode.pre_order sO
] ) )E (( ( ( ( ( ( ( ( ( ) )r c 8 | j sdS | j d j S )zO
The whitespace and comments preceding this node in the input.
rZ r r6 r[ r* s r r[ z Node.prefix s#
} 2}Q &&r c < | j r|| j d _ d S d S Nr r r# r[ s r r[ z Node.prefix s+ = -&,DM! # # # - -r c t | |_ d| j | _ || j |< | dS )z
Equivalent to 'node.children[i] = child'. This method also sets the
child's parent attribute appropriately.
N)r2 r6 r9 rN s r set_childzNode.set_child s7
"&
a
a r c r | |_ | j || | dS )z
Equivalent to 'node.children.insert(i, child)'. This method also sets
the child's parent attribute appropriately.
N)r2 r6 insertr9 rN s r insert_childzNode.insert_child* s4
Q&&& r c p | |_ | j | | dS )z
Equivalent to 'node.children.append(child)'. This method also sets the
child's parent attribute appropriately.
N)r2 r6 r8 r9 rV s r append_childzNode.append_child3 s2
U### r NNN)rd re rf rg rt rz r rk rl rc r! r+ r. r0 rj r[ setterr r r r r r rn rn s 55 $' ' ' '2. . . 0 0 0 & J J J8 8 8
) ) ) ' ' X' ]- - ]- r rn c e Zd ZdZdZdZdZddg fdZd Zd Z e
j dk re Z d Z
d
Zd Zd Zd
Zed Zej d ZdS )rA z'Concrete implementation for leaf nodes.rZ r Nc d|cxk rdk s n J | ||\ | _ \ | _ | _ || _ || _ ||| _ |dd | _ dS )z
Initializer.
Takes a type constant (a token number < 256), a string value, and an
optional context keyword argument.
r rp N)_prefixrB columnr valuerr )r# r r rs r[ rr s r rt z
Leaf.__init__F sr D3 7> 4DL44;
!DL ,QQQ /r c @ | j j d| j d| j dS rv )r rd r r r* s r rz z
Leaf.__repr__Y s, #~ 6 6 6 #yyy #zzz+ +r c : | j t | j z S )r| )r[ r3 r r* s r r zLeaf.__unicode___ s {S__,,r r^ c > | j | j f|j |j fk S r )r r r" s r r! zLeaf._eqj s 4:&5:u{*CCCr c l t | j | j | j | j | j ff| j S )r r )rA r r r[ rB r rr r* s r r+ z
Leaf.clonen s: DItz[4; "<=#'#68 8 8 8r c # K | V d S rT r r* s r rU z Leaf.leavest s
r c # K | V dS r r r* s r r. zLeaf.post_orderw
r c # K | V dS r r r* s r r0 zLeaf.pre_order{ r r c | j S )zP
The whitespace and comments preceding this token in the input.
)r r* s r r[ z Leaf.prefix s
|r c < | || _ d S rT )r9 r r s r r[ z Leaf.prefix s r )rd re rf rg r rB r rt rz r rk rl rc r! r+ rU r. r0 rj r[ r r r r rA rA = s 11 G
F
F "0 0 0 0&+ + + - - - & D D D8 8 8 X ] ] r rA c |\ }}}}|s || j v r-t | dk r|d S t ||| S t ||| 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 )rs )
number2symbollenrn rA )grraw_noder r rs r6 s r convertr sn &."D%( 242+++ x==A A; D(G4444D%1111r c F e Zd ZdZdZdZdZd Zd Zd Z d dZ
d dZ 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 \ | t us
J d t | S )z>Constructor that prevents BasePattern from being instantiated.z Cannot instantiate BasePattern)r r r r s r r zBasePattern.__new__ s. +%%%'G%%%~~c"""r c t | j | j | j g}|r|d
|d= |r|d
| j j dd t t | dS )Nrw rx ry ) r r contentr r rd r} r~ rq )r# r s r rz zBasePattern.__repr__ sw $)$$dlDI> tBx'R tBx' >222DIIc$oo4N4N4N4NOOr c | S )z
A subclass can define this as a hook for optimizations.
Returns either self or another node with the same effect.
r r* s r optimizezBasePattern.optimize s r c | j |j | j k rdS | j 5d}|i }| || sdS |r| | || j r
||| 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 _submatchupdater )r# rD resultsrs r matchzBasePattern.match s 9 TY$)%;%;5 < #A">>$**
u
"q!!! 49 !%GDI tr c d t | dk rdS | |d | S )z
Does this pattern exactly match a sequence of nodes?
Default implementation for non-wildcard patterns.
r Fr )r r )r# nodesr s r match_seqzBasePattern.match_seq s0 u::??5zz%(G,,,r c # ^ K i }|r$| |d | r
d|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 s r generate_matchesz BasePattern.generate_matches sS
TZZa!,, Q$JJJJJ r rT )
rd re rf rg r r r r rz r r r r r r r r r s DG D# # #
P P P 2- - - - r r c & e Zd ZddZddZddZdS ) LeafPatternNc |d|cxk rdk s n J | |,t |t sJ t | || _ || _ || _ 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.
Nr rp )r4 r3 rq r r r )r# r r r s r rt zLeafPattern.__init__ sn ????s?????D??? gs++ : :T']] : :+ r c h t |t sdS t | || S )z*Override match() to insist on a leaf node.F)r4 rA r r r# rD r s r r zLeafPattern.match
s1 $%% 5 tW555r c " | j |j k S )
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 r r s r r zLeafPattern._submatch s |tz))r r rT )rd re rf rt r r r r r r r sP (6 6 6 6
*
*
*
*
*
*r r c " e Zd ZdZddZddZdS ) NodePatternFNc r ||dk s
J | |t |t rJ t | t | }t | D ]B\ }}t |t
s J ||f t |t rd| _ C|| _ || _ || _
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.
Nrp T) r4 r3 rq r5 rI r WildcardPattern wildcardsr r r )r# r r r rJ items r rt zNodePattern.__init__$ s 3;;;;;; !'3// > >g > >/7mmG$W--
*
*4!$ 44??q$i??4 dO44 *%)DN r c | j rTt | j |j D ]7\ }}|t |j k r|| | dS 8dS t | j t |j k rdS t
| j |j D ] \ }}| || s dS dS )r NTF)r r r r6 r r zipr )r# rD r cr
subpatternrO s r r zNodePattern._submatchA s > ( t}EE
1DM**** * q))) 44 + 5 t| DM 2 2 2 25!$T\4=!A!A J ##E733
uu
tr r rT )rd re rf r rt r r r r r r sA I : r r c P e Zd ZdZddedfdZd Zd dZd dZd Z d Z
d
Z d 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 v d|cxk r|cxk r t k sn J ||f |st t t | }t | sJ t | |D ](}t | sJ t | )|| _ || _ || _ || _ 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)*
r N) HUGEtupler~ r rq r minmaxr )r# r r r r alts r rt zWildcardPattern.__init__k s . C&&&&3&&&&$&&&&&c
&&& Cw / /00Gw<< . .g . .<
+
+3xx**c**x* r c < d}| j It | j dk r1t | j d dk r| j d d }| j dk rM| j dk rB| j t | j S |$| j |j k r| S | j dk rft |t rQ|j dk rF| j |j k r6t |j | j |j z | j |j z |j S | S )z+Optimize certain stacked wildcard patterns.Nr r )r ) r r r r r r r r4 r )r# r s r r zWildcardPattern.optimize s
L $ " "s4<?';';q'@'@ a +J 8q==TX]]|#" 2222%49
+G+G!**,,, HMMj_ E EM Na DI $@$@":#5#'8JN#:#'8JN#:#-?4 4
4 r c 0 | |g| S )z'Does this pattern exactly match a node?)r r s r r zWildcardPattern.match s ~~tfg...r c | | D ]P\ }}|t | k r8|3| | | j rt | || j < dS QdS )z4Does this pattern exactly match a sequence of nodes?NTF)r r r r r5 )r# r r r r s r r zWildcardPattern.match_seq sy ))%00 DAqCJJ&NN1%%%y 9-1%[[ *tt ur c # . K | j ^t | j dt t | | j z D ]#}i }| j r|d| || j < ||fV $dS | j dk r| | V dS t t d r$t j }t t _ | |d D ]$\ }}| j r|d| || j < ||fV %nJ# t $ r= |
| D ]$\ }}| j r|d| || j < ||fV %Y nw xY wt t d r|t _ dS dS # t t d r |t _ w xY 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 bare_name getrefcountr )r ranger r r r _bare_name_matcheshasattrrk stderrr _recursive_matches RuntimeError_iterative_matches)r# r countr save_stderrs r r z WildcardPattern.generate_matches s < txSUTX-F-F)FGG
9 1#(%=AdiLQh
Y+
%
%))%00 0 0 0 0 0 sM**
( !j %ZZ
- $ 7 7q A A # #HE1y 5',VeV}$) (NNNN#
#
#
# !% 7 7 > > # #HE1y 5',VeV}$) (NNNN# #
# 3
.. -!,CJJJ- -73
.. -!,CJ,,,,s+ ;D E1 AE E1 E E1 1#Fc # K t | }d| j k rdi fV g }| j D ]5}t || D ]"\ }}||fV | ||f #6|rg }|D ]\ }} ||k r|| j k r}| j D ]u}t |||d D ]Z\ }
} |
dk rOi }| | | | ||
z |fV | ||
z |f [v|}|dS dS )z(Helper to iteratively yield the matches.r N)r r r r r8 r r ) r# r nodelenr r r r new_resultsc0r0c1r1s r r z"WildcardPattern._iterative_matches s e** ==R%KKK< ' 'C(e44
'
'1d
1v&&&&
'
" K!
A
AB<r s 3
6 6 6n- n- n- n- n-6 n- n- n-`k k k k k4 k k k\L L L L L 4 L L L \2 2 2&S S S S S& S S Sl)* )* )* )* )*+ )* )* )*X: : : : :+ : : :zy) y) y) y) y)k y) y) y)x [ F% % % % %r