şgp %SrSSKJrJr SSKJrJrJrJr SSK J r Sr SSK r SSK Jr Sr\\S '0q\\\\\44\S 'S \S \\\44S jr\"SSS9r\Sr\\\\\44r\\\\\\\\\4r"SS5r"SS\5r"SS\5rS\ S\S \4Sjr\\\4r "SS5r!"SS\!5r""SS\!5r#"S S!\!5r$"S"S#\!5r%S$\\!S%\\S \\\\ 44S&jr&g)'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. )IterableIterator)AnyOptionalTypeVarUnion)Grammarz#Guido van Rossum N)StringIOiHUGE _type_reprstype_numreturnc.[(dvSSKJn [US5(dUR SS9 [ UR 5H7n[UR U5n[U5[:XdM.U[U'M9 [RX5$)N)pygrampython_symbols) cache_dir) r rhasattr initializedirrgetattrtypeint setdefault)r rnamevals P/var/www/blue/EV-Temp_rev04/venv/lib/python3.13/site-packages/blib2to3/pytree.py type_reprrs{ ;v/00     ---.D&//6CCyC#' C /  ! !( 55_PBase)bound)NodeLeafc\rSrSr%Sr\\S'Sr\S\S'\ \ \S'Sr \ \S 'Sr \ \S 'S rS \S \ 4Sjr\S \4Sj5rS\S \S \ 4SjrS\S\S \4SjrS\S \4SjrS \\ 4SjrS \\ 4SjrS\\ \ \ 4S S4SjrS \\4SjrS#SjrS \\4Sjr\S \\ 4Sj5r \S \\ 4Sj5r!S \S4Sjr"S \4S jr#S \4S!jr$S"r%g)$r"6z 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. rNr$parentchildrenF was_changed was_checkedcLU[LdS5e[RU5$)z7Constructor that prevents Base from being instantiated.zCannot instantiate Base)r"object__new__clsargskwdss rr. Base.__new__Gs#$9 99~~c""r otherrcbURURLa[$URU5$)z? Compare two nodes for equality. This calls the method _eq(). ) __class__NotImplemented_eqselfr4s r__eq__ Base.__eq__Ls( >> 0! !xxr c[eNNotImplementedErrorr:s rprefix Base.prefixVs!!r r:c[e)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. r?r9s rr8Base._eqZs "!r memoc"UR5$r>)clone)r:rFs r __deepcopy__Base.__deepcopy__eszz|r c[e)zZ Return a cloned (deep) copy of self. This must be implemented by the concrete subclass. r?rAs rrH Base.cloneh "!r c[e)z` Return a post-order iterator for the tree. This must be implemented by the concrete subclass. r?rAs r post_orderBase.post_orderprMr c[e)z_ Return a pre-order iterator for the tree. This must be implemented by the concrete subclass. r?rAs r pre_orderBase.pre_orderxrMr newcZURc[U55eUce[U[5(dU/n/nSnURRHTnX@La<U(aURRX45eUbUR U5 SnMCUR U5 MV U(dURX45eX RlURR5 URR5 UHnURUlM SUlg)z/Replace this node with a new one in the parent.NFT) r(str isinstancelistr)extendappendchangedinvalidate_sibling_maps)r:rT l_childrenfoundchxs rreplace Base.replaces{{&1D 1&#t$$%C ++&&Bz C4;;#7#7"CCy?%%c*!!"%'0t}}d00u)   ++-A{{AH r cUn[U[5(d8UR(dgURSn[U[5(dM8UR$)z9Return the line number which generated the invocant node.Nr)rWr%r)lineno)r:nodes r get_linenoBase.get_linenosGT4((====#DT4(({{r cUR(agUR(aURR5 SUlg)NT)r*r(r[rAs rr[ Base.changeds-     ;; KK   !r c*UR(a[URR5H_upX LdM URRU URR5 URR 5 SUlUs $ g)zq 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\)r:ires rremove Base.removesn ;;$T[[%9%9:< ,,Q/KK'')KK779"&DKH ;r cURcgURRcURR5 URRceURR[U5$)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 N)r(next_sibling_mapupdate_sibling_mapsidrAs r next_siblingBase.next_sibling` ;;  ;; ' ' / KK + + -{{++777{{++BtH55r cURcgURRcURR5 URRceURR[U5$)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. N)r(prev_sibling_maprqrrrAs r prev_siblingBase.prev_siblingrur r%c#f# URHnUR5ShvN M gN 7fr>)r)leavesr:childs rr{ Base.leavess%]]E||~ % %# %s #1/ 1cXURcgSURR5-$)Nrr)r(depthrAs rr Base.depths' ;; 4;;$$&&&r c>URnUcgURnU$)zw Return the string immediately following the invocant node. This is effectively equivalent to node.next_sibling.prefix r)rsrB)r:next_sibrBs r get_suffixBase.get_suffixs& $$   r )r(r*rN)&__name__ __module__ __qualname____firstlineno____doc__r__annotations__r(rrXNLr*boolr+r.rr;propertyrVrBr!r8rIrHrrOrRrrarfr[rmrsrxr{rr__static_attributes__r rr"r"6s I#FHV #2hKK# CD""" "" "R "D "2SR"B"2""HRL""8B<"5T"X.40HSM    6hrl 6 6 6hrl 6 6&(&'s' C r c \rSrSr%Sr\\\\S'\\ \ \S'SS\ S\\ S\\S \\ S\\\S S4 S jjr S \ 4S jrS \ 4S jrS\S \4SjrSSjrS \\ 4SjrS \\ 4Sjr\S \ 4Sj5r\R2S \ S S4Sj5rS\ S\ S S4SjrS\ S\ S S4SjrS\ S S4SjrSSjrSSjrSrg) r$z+Concrete implementation for interior nodes.fixers_applied used_namesNrr)contextrBrcUS:dU5eXl[U5UlURH&nURb[ U55eXlM( UR 5 UbX@lU(a USSUlgSUlg)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)rrXr)r(reprr\rBr)r:rr)rrBrr_s r__init__ Node.__init__s s{ D { X --B99$ .d2h .$I  $$&   K "0"3D "&D r cURceSRURR[ UR5UR 5$))Return a canonical string representation. {}({}, {!r}))rformatr6rrr)rAs r__repr__ Node.__repr__ sEyy$$$$$ NN # # dii MM  r cTSR[[UR55$)S Return a pretty string representation. This reproduces the input source exactly. r)joinmaprVr)rAs r__str__ Node.__str__s wws3 .//r r4cdURUR4URUR4:H$zCompare two nodes for equality.)rr)r9s rr8Node._eqs' 4==)ejj%..-IIIr cURce[URURVs/sHoR5PM snURS9$s snfN)r)rr$r)rHr)r:r_s rrH Node.clone!sOyy$$$2 II"&-- 0-BXXZ- 0..  0sA c#n# URHnUR5ShvN M Uv gN 7fz*Return a post-order iterator for the tree.N)r)rOr|s rrONode.post_order*s/]]E'') ) )#  *s #535c#n# Uv URHnUR5ShvN M gN 7fz)Return a pre-order iterator for the tree.N)r)rRr|s rrRNode.pre_order0s+ ]]E( ( (# (s '53 5cXUR(dgURSR$)z? The whitespace and comments preceding this node in the input. rrr)rBrAs rrB Node.prefix6s# }}}}Q&&&r cNUR(aXRSlggNrrr:rBs rrBr?s ==&,MM!  # r rlr}cXlSURUlX RU'UR5 UR5 g)zm Equivalent to 'node.children[i] = child'. This method also sets the child's parent attribute appropriately. N)r(r)r[r\r:rlr}s r set_childNode.set_childDs;  "& a a  $$&r cXlURRX5 UR5 UR 5 g)zs Equivalent to 'node.children.insert(i, child)'. This method also sets the child's parent attribute appropriately. N)r(r)insertr[r\rs r insert_childNode.insert_childOs0   Q&  $$&r cXlURRU5 UR5 UR 5 g)zp Equivalent to 'node.children.append(child)'. This method also sets the child's parent attribute appropriately. N)r(r)rZr[r\r|s r append_childNode.append_childYs0   U#  $$&r c SUlSUlgr>)rwrprAs rr\Node.invalidate_sibling_mapscsCGCGr c0n0nXlX lSnURHnX1[U5'XB[U5'UnM! SU[W5'gr>)rwrpr)rr)r:_prev_nextpreviouscurrents rrqNode.update_sibling_mapsgsX)+)+ % %!%}}G!)"W+ ")"X, H%"bkr )r)rrprBrwrNNN)rr$r) rrrrrrrXrrsetrVrrrrrr"rr8rHrrOrRrrBsetterrrrr\rqrrr rr$r$sh5T#Y''S"" "& $.2 ''r('# '  ' !c+ ' '< # 00JJ$J HRL )8B<) ''' ]]-S-T-- '3 'r 'd ''c'"'''"''H "r r$c\rSrSr%Sr\\S'\\\S'\ \S'Sr \ S\S'\ \ \\S'S r S r\ \S 'S r\ \S 'Sr\ S\S 'SS/SS4S\ S\S\ \S\ \S\\S\ SS \ SSS4SjjrS\4SjrS\4SjrSSS\4SjrSSjrS\S4SjrS\S4SjrS\S4Sjr\S\4Sj5r\R<S\SS4Sj5rSrg)r%itz'Concrete implementation for leaf nodes.valuer bracket_depthNopening_bracketrrrrdcolumnfmt_pass_converted_first_leafrrrBrcSUs=::a S:dU5e U5eUbUuUluUlUlXlX lUbX@lUSSUl/UlX`lXplg)zw Initializer. Takes a type constant (a token number < 256), a string value, and an optional context keyword argument. rrN) _prefixrdrrrrr)rr)r:rrrrBrrrs rr Leaf.__init__ss"D3$$$$  7> 4DL44;    !L3A!3D .-J*r cSSKJn URceSRURR UR URUR5UR5$)rr)tok_namer) pgen2.tokenrrrr6rgetr)r:rs rr Leaf.__repr__sR)yy$$$$$ NN # # LLDII . JJ  r cFUR[UR5-$)r)rrVrrAs rr Leaf.__str__s ||c$**o--r r4cdURUR4URUR4:H$r)rrr9s rr8Leaf._eqs' 4::&5::u{{*CCCr cURce[URURURURUR 44UR S9$r)rr%rrBrdrrrAs rrH Leaf.clonesRyy$$$2 II JJ [[4;; 4 5..   r c## Uv g7fr>rrAs rr{ Leaf.leavess  c## Uv g7frrrAs rrOLeaf.post_order  rc## Uv g7frrrAs rrRLeaf.pre_orderrrcUR$)z@ The whitespace and comments preceding this token in the input. )rrAs rrB Leaf.prefixs ||r c0UR5 Xlgr>)r[rrs rrBrs  r ) rr)rrrrdrrr)rr%) rrrrrrVrrXrrrrrrrdrrContextrrrrr8rHrr{rOrRrrBrrrr rr%r%ts1 JI(,OXf%,S""GFCOFCO7;!8F#3: &* $$&,0:>KKK'" K  K S K"&)K(0'7K K:  #  ..DDDD (HV,8F+  ]]STr r%grraw_nodecUup#pEU(dX R;a#Uce[U5S:XaUS$[X%US9$[X#=(d SUS9$)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)rr) number2symbollenr$r%)rrrrrr)s rconvertrs^&."D4+++### x=A A; DG44D+2w77r c\rSrSr%Sr\\\S'SrSr \ \S'Sr \\ \S'Sr S\ 4S jrSS\4S jjrSS jrSS \S \\S\4SjjrSS\\S \\S\4SjjrS\\S\\\\44SjrSrg) BasePatterniap 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. rNcontentrcLU[LdS5e[RU5$)z>Constructor that prevents BasePattern from being instantiated.zCannot instantiate BasePattern)rr-r.r/s rr.BasePattern.__new__s%+%G'GG%~~c""r rc <URce[UR5URUR/nU(aUScUS U(aUScMSR UR R SR[[U555$)Nz{}({})z, ) rrrrrr6rrrr)r:r1s rrBasePattern.__repr__ szyy$$$$))$dllDII>tBx'RtBx't~~66 #dD/8RSSr c[er>r?r:reresultss r _submatchBasePattern._submatchs!!r cU$)zt A subclass can define this as a hook for optimizations. Returns either self or another node with the same effect. rrAs roptimizeBasePattern.optimizes  r rerc(URbURUR:wagURb;SnUb0nURX5(dgU(aUceURU5 UbUR(aXUR'g)z 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)rrrupdater)r:rerrs rmatchBasePattern.matchs 99 TYY$))%; << #$(A">>$*****q!  499!%DII r nodescL[U5S:wagURUSU5$)zi Does this pattern exactly match a sequence of nodes? Default implementation for non-wildcard patterns. rFr)rr r:r rs r match_seqBasePattern.match_seq9s' u:?zz%(G,,r c#b# 0nU(a"URUSU5(aSU4v ggg7f)ze Generator yielding all matches for this pattern. Default implementation for non-wildcard patterns. rrN)r )r:r rs rgenerate_matchesBasePattern.generate_matchesCs3  TZZa!,,Q$J-5s-/rr>)rr)rrrrrrrrrrrrrVr.rrrrr_Resultsr rXrrtuplerrrr rrrs  3- DGSD(3-# T#T"t""x'9T4-tBx-(82D-PT-d2h8E#x-) rrrrrrrVrrrr rrrr rrrNs\#!%" sm#sm   26"6t6 *r rc r\rSrSr%Sr\\S'S S\\S\\ \ S\\ SS4S jjr S S\4S jjr S r g) NodePatterni~F wildcardsNrrrrcNUb US:dU5eUb[U[5(a[U55e[U5n[ U5H@upV[U[ 5(dXV45e[U[ 5(dM9SUlMB XlWUl X0l g)a  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. NrT) rWrVrrXrkrWildcardPatternr rrr)r:rrr newcontentrlitems rrNodePattern.__init__s*  3; $ $;  !'3// >g >/gJ$Z0!$ 44?qi?4dO44%)DN 1 !  r cUR(aY[URUR5H4up4U[ UR5:XdM UbUR U5 g g[ UR5[ UR5:wag[ URUR5HupVURXb5(aM g g)rTF)r rrr)rrzipr )r:rercr subpatternr}s rrNodePattern._submatchs >>(t}}EDMM***q) F  t|| DMM 2 2!$T\\4==!A J##E33"Br )rrrr rr>)rrrrr rrrrrrVrrrrr rrr~seIt#+/" #sm#(3-(#sm #  #Jtr rc \rSrSr%Sr\\S'\\S'SS\S4S\\ S\S\S\\ S S4 S jjr S \ 4S jr SS \ 4S jjrSS \ 4S jjrS \\\\44SjrS \\\\44SjrS \\\44SjrS \\\\44SjrSrg)r"iz 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. minmaxNrrrrc@SUs=::aUs=::a [::d O X#45eUb`Sn[[XQ55n[U5(d[ U55eUH#n[U5(aM[ U55e WUlX lX0lX@lg)a7 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)* rNc[U5$r>)r)ss r*WildcardPattern.__init__..s%(r ) r rrrrrr,r-r)r:rr,r-rfwrapped_contentalts rrWildcardPattern.__init__s:C&3&$&2 2&  "A#CO4O'' * ''3xx*c*x'&  r cSnURbG[UR5S:Xa.[URS5S:XaURSSnURS:Xa]URS:XaMURc[ UR S9$Ub*UR UR :XaUR 5$URS::a[U[5(azURS::ajUR UR :XaP[URURUR-URUR-UR 5$U$)z+Optimize certain stacked wildcard patterns.Nrr)r) rrr,r-rrrrWr")r:r)s rrWildcardPattern.optimizes LL $DLL!Q&DLLO$)a+J 88q=TXX]||#" 22%$))z*F!**,, HHM:77!# Z__,""":>>):>>)    r c(URU/U5$)z'Does this pattern exactly match a node?)rrs rr WildcardPattern.matchs~~tfg..r cURU5HRup4U[U5:XdMUb9URU5 UR(a[ U5X R' g g)z4Does this pattern exactly match a sequence of nodes?TF)rrrrrX)r:r rr(rs rrWildcardPattern.match_seqsU))%0DACJ&NN1%yy-1%[ * 1r c #b# URcg[URS[[U5UR5-5H,n0nUR (aUSUX0R 'X#4v M. gUR S:XaUR U5v g[[S5(a#[Rn[5[l URUS5H,up#UR (aUSUX0R 'X#4v M. [[S5(a W[l gg![aD URU5H,up#UR (aUSUX0R 'X#4v M. Nof=f![[S5(a W[l ff=f7f)z 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)rranger,rr-r_bare_name_matchesrsysstderrr _recursive_matches RuntimeError_iterative_matches)r:r countr save_stderrs rr WildcardPattern.generate_matches)s\ << txxSUTXX-F)FG99#(%=AiiLh H YY+ %))%0 0 sM**!jj %Z  - $ 7 7q AHEyy',Ve})) (N!B3 ..!,CJ/  #!% 7 7 >HEyy',Ve})) (N!? #3 ..!,CJ/s8CF/AD8"F/8A FF FF #F,,F/c#$# [U5nSUR:aS04v /nURH.n[XA5HupVXV4v UR XV45 M M0 U(a/nUHupX:dM XR ::dMURHcn[XAUS5HNupU S:dM 0nUR U 5 UR U 5 X-U4v UR X-U45 MP Me M UnU(aMgg7f)z(Helper to iteratively yield the matches.rN)rr,rrrZr-r) r:r nodelenrr5r(r new_resultsc0r0c1r1s rrF"WildcardPattern._iterative_matchesVse* =R%K<)rrrrrrrr rrVrrrrr rrrrrrFrArDrrr rr"r"s  H H"&" *#** * sm *  *X#8/4/  +-%X 2F)G+-Z"8E#x-4H+I":5h+?" )(5h;O2P )r r"c|\rSrSrS S\\SS4SjjrS S\4SjjrS S\4Sjjr S\ \ S\ \ \\44S jrS rg) NegatedPatterniNrrc`Ub%[U[5(d[U55eXlg)z 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)rWrrr)r:rs rrNegatedPattern.__init__s+  g{33 BT'] B3 r cg)NFrrs rr NegatedPattern.matchsr c[U5S:H$r)rr s rrNegatedPattern.match_seqs5zQr r c## URc[U5S:XaS04v ggURRU5Hup# g S04v g7fr)rrr)r:r r(rs rrNegatedPattern.generate_matchessQ << 5zQe  55e<=R%KsAA)rr>)rrrrrrrrr rrXrrrrrrrrr rrYrYsW  5  4 d2h 8E#x-rms/00* 2  c*, T#uS#X& ',66c3h6" T  > U38_$ % Xc]HW$5xR7II JoodI"4I"Xe4eP8878r8( R=XXv-*+-*`A+AHN)kN)b[D%;%(,R% eCM"#%r