^h0%SrSSKJrJr SSKJrJr SSKJrJ r J r SSK J r J r JrJrJrJrJrJrJrJr SSKJr SSKJrJr \ \\4r\r\r\r\r Sr!\\"S 'S r#\\"S 'S r$\\"S 'Sr%\\"S'Sr&\\"S'Sr'\\"S'\RPS\RRS\RTS\RVS\RXS\RZS\R\S\R^S\R`S\RbS\RdS\RfS\RhS\RjS0r6\\"S'Sr7\\"S'"SS \85r9\"S!S"55r:S#\S$\ 4S%jr;S-S#\S'\ \S$\ 4S(jjr\4S,jr?g&).z,Builds on top of nodes.py to track brackets.)IterableSequence) dataclassfield)FinalOptionalUnion) BRACKETCLOSING_BRACKETS COMPARATORSLOGIC_OPERATORSMATH_OPERATORSOPENING_BRACKETSUNPACKING_PARENTSVARARGS_PARENTS is_varargsyms)token)LeafNodeCOMPREHENSION_PRIORITYCOMMA_PRIORITYTERNARY_PRIORITYLOGIC_PRIORITY STRING_PRIORITY COMPARATOR_PRIORITY MATH_PRIORITIES DOT_PRIORITYc\rSrSrSrSrg)BracketMatchError7zLRaised when an opening bracket is unable to be matched to a closing bracket.N)__name__ __module__ __qualname____firstlineno____doc____static_attributes__r1H/home/james-whalen/.local/lib/python3.13/site-packages/black/brackets.pyr/r/7sVr8r/c\rSrSr%SrSr\\S'\"\ S9r \ \ \ \ 4\4\S'\"\ S9r\ \\4\S'Sr\\\S '\"\S9r\\\S '\"\S9r\\\S '\"\S9r\\\S 'S \SS4SjrS\4SjrS\4SjrSS\\S\4SjjrSS\S\4SjjrS \S\4SjrS \S\4Sjr S \S\4Sjr!S \S\4Sjr"S\\4Sjr#Sr$g)BracketTracker;z"Keeps track of brackets on a line.rdepth)default_factory bracket_match delimitersNprevious_for_loop_depths_lambda_argument_depths invisibleleafreturncUR[R:XagURS:Xa;UR[;a'URUR4UR ;agUR U5 URU5 UR[;ayU=RS-slUR RURUR45nX!l UR(dURRU5 URUlURS:Xat[!XR"5nU(a/UR"b"X@R$['UR"5'O)[)U5nU(aX@R$['U5'UR[*;alXR UR[,UR4'U=RS- slUR(dURRU5 XlUR/U5 UR1U5 g![an[SU35UeSnAff=f)a;Mark `leaf` with bracket-related metadata. Keep track of delimiters. All leaves receive an int `bracket_depth` field that stores how deep within brackets a given leaf is. 0 means there are no enclosing brackets that started on this line. If a leaf is itself a closing bracket and there is a matching opening bracket earlier, it receives an `opening_bracket` field with which it forms a pair. This is a one-directional link to avoid reference cycles. Closing bracket without opening happens on lines continued from previous breaks, e.g. `) -> "ReturnType":` as part of a funcdef where we place the return type annotation on its own line of the previous closing RPAR. If a leaf is a delimiter (a token on which Black can split the line if needed) and it's on depth 0, its `id()` is stored in the tracker's `delimiters` field. Nrr,zDUnable to match a closing bracket to the following opening bracket: )typerCOMMENTr=r r?'maybe_decrement_after_for_loop_variable&maybe_decrement_after_lambda_argumentspopKeyErrorr/opening_bracketvaluerDappend bracket_depthis_split_before_delimiterrAr@idis_split_after_delimiterrr maybe_increment_lambda_arguments!maybe_increment_for_loop_variable)selfrErNedelims r9markBracketTracker.markGs$ 99 %  JJ!O --TYY't/A/AA  44T: 33D9 99( ( JJ!OJ "&"4"4"8"8$**dii9P"Q $3 ::%%d+!ZZ ::?-dMMBE25:4== 120605OOBtH- 99( (AE  tzz7499+== > JJ!OJ::%%d+  --d3 ..t41 '!!%( s71I I6"I11I6cR[UR=(d UR5$)zReturn True if there is an open for or lambda expression on the line. See maybe_increment_for_loop_variable and maybe_increment_lambda_arguments for details.)boolrBrCrWs r9any_open_for_or_lambda%BracketTracker.any_open_for_or_lambdas D))IT-I-IJJr8c,[UR5$)zBReturn True if there is an yet unmatched open bracket on the line.)r]r?r^s r9any_open_brackets BracketTracker.any_open_bracketssD&&''r8excludec^^[U4SjURR555$)zReturn the highest priority of a delimiter found on the line. Values are consistent with what `is_split_*_delimiter()` return. Raises ValueError on no delimiters. c3<># UHupUT;dM Uv M g7fNr1).0kvrds r9 8BracketTracker.max_delimiter_priority..sM!8AW# UHoT:XdM Sv M g7f)r,Nr1)rhprqs r9rk?BracketTracker.delimiter_count_with_priority..sH6x-116s  )r@rosumvalues)rWrqs `r9delimiter_count_with_priority,BracketTracker.delimiter_count_with_prioritys@ See `maybe_increment_for_loop_variable` above for explanation.inr,TF)rBr=rHrr|rOrLr}s r9rJ6BracketTracker.maybe_decrement_after_for_loop_variablese  ! !%%b)TZZ7 UZZ' d" JJ!OJ  ! ! % % 'r8cUR[R:XaKURS:Xa;U=RS- slUR R UR5 gg)zIn a lambda expression, there might be more than one argument. To avoid splitting on the comma in this situation, increase the depth of tokens between `lambda` and `:`. lambdar,TF)rHrr|rOr=rCrPr}s r9rU/BracketTracker.maybe_increment_lambda_argumentssJ 99 "tzzX'= JJ!OJ  ( ( / / ;r8cUR(akURSUR:XaNUR[R:Xa0U=RS-slURR 5 gg)z=See `maybe_increment_lambda_arguments` above for explanation.rr,TF)rCr=rHrCOLONrLr}s r9rK5BracketTracker.maybe_decrement_after_lambda_argumentssY  ( (,,R0DJJ> U[[( JJ!OJ  ( ( , , .r8crURRURS- [R45$)z7Return the most recent opening square bracket (if any).r,)r?getr=rRSQBr^s r9 get_open_lsqbBracketTracker.get_open_lsqbs*!!%%tzzA~uzz&BCCr8)rA)r1)r)%r2r3r4r5r6r=int__annotations__rdictr?tupleDepthNodeTyperr@LeafIDPriorityrArlistrBrCrDrZr]r_rbrrorxrVrJrUrKrr7r1r8r9r;r;;sO,E3N8=d8SM4eXo.45S).t)DJVX%&D#Hhtn#"'"=d3i=).t)DT#YD!$7ItDz7:5:5$:5xKK(4(Nhv.>NN Ih Is I d t  D T  T d  4 D Dx~Dr8r;rErFcLUR[R:Xa[$g)zReturn the priority of the `leaf` delimiter, given a line break after it. The delimiter priorities returned here are from those delimiters that would cause a line break after themselves. Higher numbers are higher priority. r)rHrCOMMAr)rEs r9rTrTs yyEKK r8NrAc[U[[-S9(agUR[R :XafUR (aUUR R[R[R1;aUbUR[;a[$UR[;a\UR (aKUR R[R[R1;a[UR$UR[ ;a["$UR[R$:Xa'Ub$UR[R$:Xa[&$UR[R([R*1;agUR,S:XaIUR (a8UR R[R.[R01;dUR[R*:Xa?[3UR4[65(aUR4R,S:wa[8$UR,S:XaOUR (a>UR R[R:[R<1;a[8$UR,S;a?UR (a.UR R[R>:Xa[@$UR,S:Xa["$UR,S:XaUR (aoUR R[RB[RD1;a7Ub.UR[R(:XaUR,S :Xd["$UR,S :XapUR (a_UR R[RB:Xa7Ub.UR[R(:XaUR,S:Xd["$UR,[F;aUR (a[H$g) zReturn the priority of the `leaf` delimiter, given a line break before it. The delimiter priorities returned here are from those delimiters that would cause a line break before themselves. Higher numbers are higher priority. )withinrr{asyncif>relseisrnot)%rrrrHrDOTparentr import_from dotted_namer r-rfactor star_exprr+r r"STRINGr r|ASYNCrOcomp_for old_comp_for isinstance prev_siblingrrcomp_if old_comp_iftestrcomp_op comparisonr r)rErAs r9rRrRso0AAB UYY KK KK  T%5%5t7G7G$H H  2B!B ^# KK KK  T[[$..$A Atyy)) yyK"" U\\!  MMU\\ ) yyU[[11 e KK KK  0A0A B B 99 #4,,d33  &&'1) ) d KK KK  t/?/? @ @%% zz^#  8H8HDII8U zzT"" d KK KK  t ? ?   +%'#" e KK KK   ,   +$&#" zz_$ r8nodecUR[R:wagURSnURSnUR[R :XaUR[R :Xdg[5nURSSHSn[U[5(aURU5 M+UR5HnURU5 M MU UR5$![a gf=f)zReturn maximum delimiter priority inside `node`. This is specific to atoms with contents contained in a pair of parentheses. If `node` isn't an atom or there are no enclosing parentheses, returns 0. rrr,)rHratomchildrenrLPARRPARr;rrrZleavesro ValueError)rfirstlastbtcrEs r9max_delimiter_priority_in_atomrIs  yyDII MM! E == D JJ%** $ejj)@  B ]]1R  a   GGAJ  # ! ((** s,C<< D D rc,[S[U555n/n[5n[ U[ U55HnXnUR [;a$UR[UR U45 UR [;dMUU(a[UR USS:XaEUR5upg[ XtS-5HnUR[X55 M! M U$ U$![a [5s$f=f)zReturn leaves that are inside matching brackets. The input `leaves` can have non-matching brackets at the head or tail parts. Matching brackets are included. c3V# UHupUR[;dMUv M! g7frg)rHr)rhils r9rk6get_leaves_inside_matching_brackets..ms$ +$!qvv9I/IAA+s) )rrr,)next enumerate StopIterationsetrangelenrHrrPr r rLaddrS) r start_index bracket_stackidsrrE_startjs r9#get_leaves_inside_matching_bracketsres  #F+  M %C ;F ,y 99( (  '$))"4a!8 9 99( (mB.?.B!B(,,.u!e,AGGBvyM*- J- J u sC<<DDrg)@r6collections.abcrr dataclassesrrtypingrrr black.nodesr r r r rrrrrrblib2to3.pgen2rblib2to3.pytreerrLNrrrrrrrrrrr r"VBAR CIRCUMFLEXAMPER LEFTSHIFT RIGHTSHIFTPLUSMINUSSTARSLASH DOUBLESLASHPERCENTATTILDE DOUBLESTARr+r- Exceptionr/r;rTrRrrrr1r8r9rs2.())   !& 4:    !#"%U JJ a KK OOQ a JJ KK JJ KK q MM1 HHa KK a  eW W \D\D \D~  4  H  ] D] HTN] h] @83v;r8