^hy%SrSSKrSSKJr SSKJrJrJrJrJ r J r \RS:aSSKJ r OSSK J r SSKJr SSKJr SS KJr SS KJrJr SS KJr SS KJr SS KJrJrJrJr \R@"\5 \RBr"\\#S'\ "S5r$\ \\4r%\&r'\&r(\RR\RT\RV1r,\\#S'\"RZ\"R\\"R^\"R`\"Rb\"Rd\"Rf\"Rh\"Rj\"Rl1 r7\\#S'Sr8\\#S'S\Rr\8'SS1r:\\#S'\Rv\Rx\Rz\R|\R~\R1rA\\#S'\R\R\R\R\R\R\R\R\R\R\R\R\R\R1rP\\#S'\R\R1rQ\\#S'\Q\R1-rR\\#S'\"R\"R\"R\"R\"R1rX\\#S'\"R\"R\"R\"R\"R\"R\"R1r`\\#S'\"R\"R\"R\"R\"R\"R\"R\"R\"R\"R\"R\"R\"R\"R\"R\"R1rp\\#S'\"R\"R1rs\\#S'1Skrt\\#S '\"R\"R\"R1rw\\#S!'\R\R\R\R\R\R0r~\\#S"'\"\~GR55r\\#S#'\"\~GR55r\\#S$'\\-r\\#S%'\\GR \8\GR \GR\GR1-r\\#S&'S'r\"S(S)9"S*S+\\$55rS,\S-\S.\S/\4S0jrS|S1\&S2\S3\S/\4S4jjrS5\\%S/\\4S6jrS5\\%S7\\\(S/\4S8jrS5\\%S/\\(4S9jrS:\S;\%S/\\%4S<jrS=\%S>\%S/S4S?jrS,\S/\%4S@jrS5\%S/\\4SAjrS5\%S/\4SBjrS5\S/\4SCjrS5\%S/\4SDjrS5\%S/\4SEjrS5\%S/\4SFjrS5\%S/\4SGjrS5\%S/\4SHjrS5\%S/\4SIjr\R\R44SJ\SK\SL\\SM\\&\&4S/\4 SNjjrS5\%S/\4SOjrS}S5\%SP\S/\4SQjjrS5\%S/\4SRjrS5\%S/\4SSjrS,\ST\\(S/\4SUjrS5\S/\4SVjrS5\S/\4SWjrS5\%S/\4SXjrS5\S/\4SYjrS5\S/\4SZjrS5\S/\4S[jrS5\%S/\4S\jrS5\%S/\4S]jrS,\S/\4S^jrS,\S/\4S_jrS,\S/\4S`jrS,\S/\4SajrS,\S/\4SbjrS,\S/\4ScjrS,\S/\4SdjrS,\S/\4SejrSf\S/\4SgjrS(Sh.Si\Sj\%Sk\S/S4SljjrS5\%S/\\%4SmjrS,\S/S4SnjrSo\S/\ \4SpjrSo\S/\ \4SqjrSo\S/\ \4SrjrSo\S/\ \4SsjrS,\S/\St4SujrS,\S/\4SvjrS5\%S/\\4SwjrS5\%S/\\4SxjrS,\S/\%4SyjrS5\%Sz\&S/\4S{jrg)~z> blib2to3 Node/Leaf transformation-related utility functions. N)Iterator)FinalGenericLiteralOptionalTypeVarUnion) ) TypeGuard) mypyc_attr) CACHE_DIR)Mode)get_string_prefixhas_triple_quotes)pygram)token)NLLeafNode type_reprsymsT WHITESPACE STATEMENTSTANDALONE_COMMENTandorLOGIC_OPERATORS COMPARATORSMATH_OPERATORSSTARSVARARGS_SPECIALSVARARGS_PARENTSUNPACKING_PARENTSTEST_DESCENDANTS TYPED_NAMES>:=%=&=*=+=-=/=@=^=|=**=//=<<=>>= ASSIGNMENTSIMPLICIT_TUPLEBRACKETOPENING_BRACKETSCLOSING_BRACKETSBRACKETSALWAYS_NO_SPACE7T)allow_interpreted_subclassescH\rSrSrSrS\S\\4SjrS\S\\4Sjr Sr g) VisitorzBBasic lib2to3 visitor that yields things of type `T` on `visit()`.nodereturnc#.# URS:a[RURnO[[ UR55n[ USU3S5nU(aU"U5ShvN gUR U5ShvN gNN7f)aJMain method to visit `node` and its children. It tries to find a `visit_*()` method for the given `node.type`, like `visit_simple_stmt` for Node objects or `visit_INDENT` for Leaf objects. If no dedicated `visit_*()` method is found, chooses `visit_default()` instead. Then yields objects of type `T` from the selected visitor. visit_N)typertok_namestrrgetattr visit_default)selfrDnamevisitfs E/home/james-whalen/.local/lib/python3.13/site-packages/black/nodes.pyvisit Visitor.visitsy 99s?>>$)),Dy+,D v5 d| # #))$/ / / $ /s$A/B1B2B B BBc## [U[5(a-URHnURU5ShvN M ggN 7f)zCDefault `visit_*()` implementation. Recurses to children of `node`.N) isinstancerchildrenrR)rNrDchilds rQrMVisitor.visit_defaults: dD ! !::e,,,' ",s9AA AN) __name__ __module__ __qualname____firstlineno____doc__LNrrrRrM__static_attributes__rYrQrBrBs3L0"0!00-"-!-rarBleafcomplex_subscriptmoderEcSnSnSnURnURnURnU[;aU$U[R :XaU$Uc SU<35eU[R :Xa?UR[R[R[R1;aU$U[R:Xa UR[R:XaU$URn U (Gd[U5n U (aU R[;aU$U[R :XaIU R[R :XaU$U R[R :wa U(dU$U$U R[R":XaU R(aU RR[R$[R&[R([R*1;aU$U RR[R,:Xa U R.$GOU R[R0:XaV[3U 5[R4:Xa9[3U R5[R[R64;aU$U R[8;a[;U [<[>-S9(aU$GORU R[R :XaUU R(aCU RR[R[R1;a U(aU$U$OU R(a>U RR[R@:XaU R[B;aU$U R[RD:Xa;UR(a*URR[RF:XaU$O6U R[;aU$U R[RH:XaU$UR[R([R$1;a*U (aU R[R :waU$U$UR[R*:Xa)U (a U R[R :waU$U$UR[R,:XaU (dU$U[R":XaU R[J;aU$U$U R[R":Xa U R.$U R[R :waU$U$UR[J;a;U (d2[U5n U (aU R[R :waU$U$UR[RL:XaU[RN:XdU[RP:XaU$U (d-U[RR:XdU[RT:XaU$U$U R[R :waU$U$UR[R&:Xa}U[R":XaU$U (d5[U5n U (aU R[RN:XaU$U$U R[R"1[8-;aU$U$UR[RF:XaU$UR[RV:Xa\U (aU$[U5n U (a<U R[RD:XdU R[RR:XaU$U$UR[RX:Xa?U[RN:XaU$U (a U R[RN:XaU$U$UR[R[R1;aU (d@URcS5eURR[R:XaU$U$U[RZ:XdU R[RZ:XaU$U(dU$U$UR[R\:XaU (aU[RR:XaU$U$UR[R^:Xa)U (a U R[R`:XaU$U$UR[R@[R41;GaU (d[U5n U (aU R[;aU$U Rn U ceU R[R :Xa0U R[R[R1;aU$U R[R":Xa U R[R&:XaU$U$U[Rb[Rd[Rf1;aU$U$UR[Rh:XaU[RR:Xa)U (a U R[RR:XaU$U$U[Rb:Xa/US:XaU$U (a U R[RR:XaU$U$UR[R:XaU$UR[Rj:XaU[R0:XaU$U$)zReturn whitespace prefix if needed for the given `leaf`. `complex_subscript` signals whether the given leaf is part of a subscription which has non-trivial arguments, like arithmetic expressions or function calls.  z z/INTERNAL ERROR: hand-made leaf without parent: )withinzsubscripts are always parentedimport)6rIparentvaluer>rCOMMENTCOLONr subscript subscriptlistsliceopLBRACEfstring_replacement_field prev_siblingpreceding_leafr;COMMAEQUALarglistargument parameters varargslist typedargslistprefixSTAR parent_type star_expr tname_starr$ is_varargr%r&factorr"AT decoratorBANGr(trailerLPARRPARDOTLSQB dotted_nameclassdef COLONEQUALatom dictsetmaker DOUBLESTARNAMENUMBERSTRING import_from except_clause) rbrcrdNOSPACE DOUBLESPACEtpvprevprevp prevp_parents rQ whitespacersK BE"K A A AO EMM =TKD8TT=EKKAFF   +  ELLQVVt'E'EE   D q! &66I  zzU[[( u{{*3D L :: $||<<$$LLMMOO$$ ) I\\&&$*<*<<!<<' JJ%** $E"dnn4ELL)d.@.@$//-RRI ZZ+ +9J'JK LZZ5;; &|| 1 1dnndll5S S 1u9r9 LL !!T[[0 n,I ZZ588 #QXX]]dnn5TI & & ejj  vv$//4<<00tyyEKK/I0\ LW 4## # DII,IP LM 4%% %I  yy + ,@ L{YY%++ %;;  YY%++ %I&p Lk ; "1%EEJJ%++5 ` L] 4<<   ?a5::oIEII~ejj "1P LKYY%++ %I&J LE 4==  I"1%EEJJ%**4 5v LqYY5;;-*:: :I;p Lk 4>> ! 4## # Iq! ehh.%** 2II3JX LS 4==  ?I DII+IH LE DNNDLL1 188' I)I I'xx}} 2 22 I %"" "dii53C3C&CL"I#l Lg 499  ANI` L] 4$$ $ DII!1!11IV LS DKK0 0"1%EEJJ*::  <-> C. u{{*|/@/@DMM/Q 2 L-5::u||U\\: :I;, L' 4## #  > UYY. L%**_H}  UYY.  L 4<<  4%% %  ?I Lranl_count form_feed empty_linec2U(a X S- -S-U-$X -$)z$Generate a normalized prefix string. rY)rrrs rQmake_simple_prefixrs%l+t3j@@   rarDcU(a\URnU(a4[U[5(aU$[UR 55S$UR nU(aM\g![ a gf=f)z3Return the first leaf that precedes `node`, if any.N)rsrUrlistleaves IndexErrorrj)rDress rQrtrtsk  #t$$  CJJL)"-- {{ $    sA%% A21A2tokenscU(dgUScUSL$U(dgURUS:wag[URUSS5$)a/Return if the `node` and its previous siblings match types against the provided list of tokens; the provided `node`has its type matched against the last element in the list. `None` can be used as the first element to declare that the start of the list is anchored at the start of its parent's children.TrNF)rIprev_siblings_arers)rDrs rQrrsP  bzt|  yyF2J T..s <   ??1  $ $ 3   ;;$// )      *v/B/B/G/G8/S    ) rac[U[5(aU$UR(a[URS5$g)z(Returns the first leaf of the node tree.rN)rUrrV first_leaf_ofrs rQrrs2$  }}T]]1-..racUR[R[R[R[R 1;$)z?Whether node is an arithmetic or a binary arithmetic expression)rIr arith_expr shift_exprxor_exprand_exprrs rQ is_arith_likers4 99     rac@[U[5(aTUR[R:wag[ UR 5n[U5RS5(agUR(aURR[R:XaiURR(dNURR(a3URRR[R:Xag[URS[R[R [R/5(ag[UR[R"[R$[R/5(agg)NFbBfFT)rUrrIrrrrkset intersectionrjr simple_stmtrsrrNEWLINEINDENTryrm)rDr|s rQ is_docstringr$s$ 99 $"4::. v; # #F + + KK   0 0 0 (( KK   KK   # #t 6 dEMM5<<9I9IJt TEUEU&VWW rac>UR[R:H=(az [UR5S:H=(a[ URSR[ R :H=(a* URSR[ R:H$)z+Return True if `node` holds an empty tuple.rr)rIrrlenrVrrrrs rQis_empty_tuplerDsq TYY 0  ! # 0 MM!  ! !UZZ / 0 MM!  ! !UZZ / racUR[R:Xav[U5nUbUR[R:wag[ UR 5S:H=(a* UR SR[R:H$UR[;=(aI [ UR 5S:H=(a* UR SR[R:H$)zMReturn True if `node` holds a tuple with one element, with or without parens.Frr) rIrrunwrap_singleton_parenthesis testlist_gexprrVrrur9rDgexps rQ is_one_tuplerNs yyDII+D1 <499(:(::4==!Q&O4==+;+@+@EKK+OO ^# 1  ! # 1 MM!  ! !U[[ 0racUR[R:wag[U5nUbUR[R:wagg)z$Return True if `node` holds a tuple.FT)rIrrrrrs rQis_tupler^s; yyDII ' -D |tyyD$6$66 racUR[R:wag[U5nUbUR[R:wag[ SUR 55$)zDReturn True if `node` holds a tuple that contains a walrus operator.Fc3Z# UH!oR[R:Hv M# g7fN)rIrnamedexpr_test.0rWs rQ -is_tuple_containing_walrus..qsLmUzzT000m)+rIrrrranyrVrs rQis_tuple_containing_walrusrisM yyDII ' -D |tyyD$6$66 LdmmL LLracUR[R:wag[U5nUbUR[R:wag[ SUR 55$)zBReturn True if `node` holds a tuple that contains a star operator.Fc3Z# UH!oR[R:Hv M# g7fr)rIrrrs rQr+is_tuple_containing_star..|sGzzT^^+rrrs rQis_tuple_containing_starrtsM yyDII ' -D |tyyD$6$66 GG GGracUR[R:wag[U5nUbUR[R:wag[ SUR 55$)z(Return True if `node` holds a generator.Fc3Z# UH!oR[R:Hv M# g7fr)rIr old_comp_forrs rQris_generator..sJM5zzT...Mrrrs rQ is_generatorrsM yyDII ' -D |tyyD$6$66 JDMMJ JJraopeningclosingrbracketscURUR4U:wagURS-n[U5H upVX`LdM O [S5eSnUS- nX%SHnXaLa US:$URnX:XdM UR[R :XdM@US- nUR (dMXUR R[R[R1;dMUS- n US:$ US:$)zIReturn True if content between `opening` and `closing` is a one-sequence.Frz#Opening paren not found in `leaves`rNr) rI bracket_depth enumerate LookupErrorrrurjrrwr{) rrrrdepth_opening_indexrbcommasrs rQis_one_sequence_betweenrs  gll#x/  ! !A %E )& 1 ? !2 ?@@ FaN' ?  A:**  !dii5;;&> aKF{{{t{{// ""4 !  A:( A:rach[U5nUSL=(a UR[R:H$)z7Return True iff `node` is of the shape ( test := test )N)rrIrr)rDinners rQis_walrus_assignmentrs+ ( .E   Bt/B/B!BBralastcjUR[R:H=(Ga [UR5S:H=(a[ URSR[ R :H=(a* URSR[ R:H=(Gd U=(az [UR5S:H=(a[ URSR[ R:H=(a* URSR[ R:H=(d U=(az [UR5S:H=(a[ URSR[ R:H=(a* URSR[ R:H$)z?Return True iff `node` is a trailer valid in a simple decoratorrrrr ) rIrrrrVrrrrr)rDrs rQis_simple_decorator_trailerrs; 99 $    ! # 4 a %%2 4 a %%3    4DMM"a' 4 a %%3 4 a %%3   4DMM"a' 4 a %%3 4 a %%3'racUR[R:XagUR[R:XaUR (aUR SR[R:H=(ac [ [[UR SS55=(a6 [UR 5S:=(d [UR SSS9$g)aHReturn True iff `node` could be a 'dotted name' decorator This function takes the node of the 'namedexpr_test' of the new decorator grammar and test if it would be valid under the old decorator grammar. The old grammar was: decorator: @ dotted_name [arguments] NEWLINE The new grammar is : decorator: @ namedexpr_test NEWLINE Trrrr)rF) rIrrrpowerrVallmaprrrs rQis_simple_decorator_expressionrs yyEJJ yyDJJ == a %%37q9LMN &*Q24==3D4P   racUR[R:Xag[U5(aURS:XagUR[R :wag[ UR5S:wagURupnUR[R:Xa)UR[R:Xa [U5$g)zAReturn True if `node` holds a `yield` or `yield from` expression.TyieldFr ) rIr yield_expr is_name_tokenrkrrrVrrris_yield)rDlparexprrpars rQr r s yyDOO#TtzzW4 yyDII 4==Q}}D yyEJJ499 #:~ rarhcUR[;dUR(dgURnUR[R:XaUR(dgURnURU;$)a2Return True if `leaf` is a star or double star in a vararg or kwarg. If `within` includes VARARGS_PARENTS, this applies to function signatures. If `within` includes UNPACKING_PARENTS, it applies to right hand-side extended iterable unpacking (PEP 3132) and additional unpacking generalizations (PEP 448). F)rIr$rjrr)rbrhrs rQrrsW yy((  Avvxx HH 66V rac<UR[R:H$)z&Return True if the node is an f-string)rIrfstringrs rQ is_fstringrs 99 $$rac[U5[UR5Sn[[R XRS9nUR 5=(d SUlU$)z/Converts an fstring node back to a string node.N)r|r)rKrr|rrr get_linenolineno)rDstring_without_prefix string_leafs rQfstring_to_stringrsLIc$++&6&89u||%:;;OK*/aK rac[U[5(a[U5(a [U5nO[U[5(aUnOg[ UR 5=(a SUR ;$)zKReturn True if `leaf` is a multiline string that actually spans many lines.F )rUrrrrrrk)rDrbs rQis_multiline_stringr sU$*T"2"2 & D$   TZZ ( ?TTZZ-??racUR[R[R1;deURceURR[R [R 1;$r)rIrsuiterrjfuncdefrrs rQis_parent_function_or_classr!,sU 99T%5%56 66 6 ;; "" " ;;   dmm< <URb[U5(dgURR5(ag[ UR 5S:wdUR SR [R:wdVUR SR [R:wd+UR SR [R:wagUR SRR5(ag[UR S5$)z2Return True if `node` is a suite with a stub body.Frrr r) rjr!r|striprrVrIrrrDEDENT is_stub_bodyrs rQ is_stub_suiter*7s {{'B4'H'H {{ DMMa ==  EMM 1 ==  ELL 0 ==  ELL 0 }}Q$$&&  a( ))rac[U[5(aUR[R:wag[ UR 5S:wagUR SnURR5(+=(a_ UR[R:H=(a; [ UR 5S:H=(a [SUR 55$)zCReturn True if `node` is a simple statement containing an ellipsis.Frrr c3Z# UH!o[[RS5:Hv M# g7f).N)rrr)rrbs rQris_stub_body..[sHUYY,,r) rUrrIrrrrVr|r'rr)rDrWs rQr)r)Ns dD ! !TYY$2B2B%B 4==Q MM! E LL     I JJ$)) # I  1 $ I HH H rac[U[5(dUR[R:wagUR SUR Sp![U[5=(a UR[ R:H=(a` URS:H=(aJ [U[5=(a3 UR[ R:H=(a URS:H$)zyGiven a `LN`, determines whether it's an atom `node` with invisible parens. Useful in dedupe-ing and normalizing parens. Frrrf) rUrrIrrrVrrrkr)rDfirstrs rQis_atom_with_invisible_parensr1_s$dii!7--"DMM"$545$  JJ%** $  KK2   tT "  II #   JJ"  rac<[U5=(d [U5$r) is_empty_lpar is_empty_rparrbs rQ is_empty_parr6qs   5-"55rachUR[R:H=(a URS:H$Nrf)rIrrrkr5s rQr3r3u# 99 " 7tzzR'77rachUR[R:H=(a URS:H$r8)rIrrrkr5s rQr4r4yr9racfURnURnURn[U[R :H=(ak US:H=(a& U=(a UR[ R:H=(d2 US:H=(a& U=(a UR[ R:H5$)z9Return True if the given leaf starts an import statement.rifrom) rjrIrkboolrrr import_namer)rbrrrs rQ is_importr?}s A A A  UZZ (] ?q ?QVVt/?/?%? BV @@aff0@0@&@  rac[UR[R:H=(aP URS:H=(a: UR =(a' UR R[ R:H5=(dg [UR[R:H=(a: UR=(a' URR[ R:H5$)zDReturn True if the given leaf starts a with or async with statement.with) r=rIrrrkrjr with_stmtASYNC next_siblingr5s rQis_with_or_async_with_stmtrEs  UZZ / JJ&  / KK / KK   .     U[[  5    5    " "dnn 4  rac[UR[R:H=(aJ UR=(a7 URR[ R [ R1;5$)zReturn True if the given leaf starts an async def/for/with statement. Note that `async def` can be either an `async_stmt` or `async_funcdef`, the latter is used when it has decorators. )r=rIrrCrjr async_stmtr#r5s rQis_async_stmt_or_funcdefrHsU  U[[  F KK F KK  $2D2D E E racURnURnU[R[1;=(a UR S5$)a6Return True if the given leaf is a type comment. This function should only be used for general type comments (excluding ignore annotations, which should use `is_type_ignore_comment`). Note that general type comments are no longer used in modern version of Python, this function may be deprecated in the future.z# type:)rIrkrrlr startswithrbrrs rQis_type_commentrLs9 A A  23 3 O Y8OOracURnURnU[R[1;=(a [ U5$)zGReturn True if the given leaf is a type comment with ignore annotation.)rIrkrrlris_type_ignore_comment_stringrKs rQis_type_ignore_commentrOs5 A A  23 3 X8UVW8XXrarkc$URS5$)zOReturn True if the given string match with type comment with ignore annotation.z# type: ignore)rJ)rks rQrNrNs   , --ra)visiblerjrWrQcN[[RU(aSOS5n[[RU(aSOS5nURnSUlUR 5=(d Sn[ [RX1U/5nXWlURXg5 g)zWrap `child` in parentheses. This replaces `child` with an atom holding the parentheses and the old child. That requires moving the prefix. If `visible` is False, the leaves will be valueless (and thus invisible). (rf)rN) rrrrr|rrrrr)rjrWrQrrr|indexrs rQwrap_in_parenthesesrVsu  7C 3D  7C 3D \\FEL LLN aETYYd 34I )rac[UR5S:wagURupnUR[R:XaUR[R :XdgU$)zmReturns `wrapped` if `node` is of the shape ( wrapped ). Parenthesis can be optional. Returns None otherwiser N)rrVrIrrr)rDrwrappedrs rQrrsM 4==Q--D4 II # UZZ(? NracUR[R:XaSUlgUR[R:XaSUlgg)zMake sure parentheses are visible. They could be invisible as part of some statements (see :func:`normalize_invisible_parens` and :func:`visit_import_from`). rSrTN)rIrrrkrr5s rQensure_visiblerZs7  yyEJJ ejj   !ranlc<UR[R:H$r)rIrrr[s rQr r  77ejj  rac<UR[R:H$r)rIrrr]s rQ is_lpar_tokenr`r^rac<UR[R:H$r)rIrrr]s rQ is_rpar_tokenrbr^rac<UR[R:H$r)rIrrr]s rQis_number_tokenrds 77ell ""ra)rEparamNc,URnUbUR(a)URR[R:XagUR(a)URR[ R :XagURnUbMg)zrgrBr=rKrrrtrrr~rrrrrrrrrrrrtuplerrrrr rrrrr!r$r*r)r1r6r3r4r?rErHrLrOrNrVrrZr r`rbrdrirkrmrorqrtrYrarQrs"  $DDw +&!> 55)##e# CL 4:  \\5<<? E?LLOOMMMMNNLLMMOOOO  5  E%9!"& JJ MM MM NN OO   U JJ  KK OO  JJ KK JJ KK  MM HH KK   E,,-u-5;;-/%/LLMMLL  IINNLL5 IILLLLMMMMOONNIIMMMMOOOOLLIIJJ!%$jj$//2 U2 U$(?(?OO JJ  JJ  LL%,, glln-%-gnn./%/"%55%5) KK   JJ -  .-gaj-/-DmTmmTmcm`!!!3!RU!"(4.$ =HRL =$x7I2J =t = hrl x'9 DbXb\2R2B242"t2x~trd@ r d  2$MRMDMH2H$HKrKdK"'UZZ 8 " " " J"CHo "  "JCrCdC b402$*D#h-D.%T%d% DT @b @T @=d=t=JtJJ***.rd"t$6t66888888 D T  T d  4 D P$P4PYY$Y... EI**R*T*T*$ r hrl   $ !b!Yt_!!b!Yt_!!b!Yt_!##y# d w/F'G 111 ,R,HTN,,B,8D>,4B#$ra