!.d/UdZddlZddlmZmZddlmZmZmZm Z m Z m Z m Z m Z ejdkrddlmZnddlmZddlmZmZmZmZmZmZmZmZmZmZddlmZdd lmZm Z e ee fZ!e"Z#e"Z$e"Z%e"Z&d Z'ee(d <d Z)ee(d <dZ*ee(d<dZ+ee(d<dZ,ee(d<dZ-ee(d<ej.dej/dej0dej1dej2dej3dej4dej5dej6dej7dej8dej9dej:dej;diZZ?eGd#d$Z@d.d%ed&e ed'e&fd(ZAd.d%ed&e ed'e&fd)ZBd*e!d'e&fd+ZCd,e ed'e e$fd-ZDdS)/z,Builds on top of nodes.py to track brackets.N) dataclassfield)DictIterableListOptionalSequenceSetTupleUnion))Final) BRACKETCLOSING_BRACKETS COMPARATORSLOGIC_OPERATORSMATH_OPERATORSOPENING_BRACKETSUNPACKING_PARENTSVARARGS_PARENTS is_varargsyms)token)LeafNodeCOMPREHENSION_PRIORITYCOMMA_PRIORITYTERNARY_PRIORITYLOGIC_PRIORITY STRING_PRIORITY COMPARATOR_PRIORITY rr MATH_PRIORITIES DOT_PRIORITYceZdZdZdS)BracketMatchErrorzLRaised when an opening bracket is unable to be matched to a closing bracket.N)__name__ __module__ __qualname____doc__.lib/python3.11/site-packages/black/brackets.pyr3r3<sVVVVr9r3ceZdZUdZdZeed<eeZ e e e e fefed<eeZe eefed<dZeeed<eeZeeed <eeZeeed <eeZeeed <d ed dfdZd efdZddeed efdZdded efdZd ed efdZd ed efdZ d ed efdZ!d ed efdZ"d eefdZ#dS)BracketTrackerz"Keeps track of brackets on a line.rdepth)default_factory bracket_match delimitersNprevious_for_loop_depths_lambda_argument_depths invisibleleafreturnc0|jtjkrdS|jdkr%|jtvr|j|jf|jvrdS|||||jtvr|xjdzc_ |j|j|jf}n%#t$r}td||d}~wwxYw||_ |j s|j ||j|_|jdkrit!||j}|r$|j||jt'|j<n.t)||j}|r||jt'|<|jt*vrR||j|jt,|jf<|xjdz c_|j s|j |||_||||dS)aMark `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. Nrr0zDUnable to match a closing bracket to the following opening bracket: )typerCOMMENTr=rr?'maybe_decrement_after_for_loop_variable&maybe_decrement_after_lambda_argumentspopKeyErrorr3opening_bracketvaluerDappend bracket_depthis_split_before_delimiterrAr@idis_split_after_delimiterrr maybe_increment_lambda_arguments!maybe_increment_for_loop_variable)selfrErNedelims r:markzBracketTracker.markLs2$ 9 % % F J!OO ---TY't/AAA F 44T::: 33D999 9( ( ( JJ!OJJ "&"4"8"8$*di9P"Q"Q   '(!%((  $3D : ,%%d+++!Z :??-dDMBBE 625:4= 1 1220t}EE605DOBtHH- 9( ( (AED tz749+== > JJ!OJJ: ,%%d+++  --d333 ..t44444s&B88 CCCc*t|jS)zBReturn True if there is an yet unmatched open bracket on the line.)boolr?rWs r:any_open_bracketsz BracketTracker.any_open_bracketssD&'''r9r8excludechtfd|jDS)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*K|] \}}|v |VdSNr8).0kvr_s r: z8BracketTracker.max_delimiter_priority..s1MMAAW.s'HH!x--1----HHr9)r@risumvalues)rWrjs `r:delimiter_count_with_priorityz,BracketTracker.delimiter_count_with_prioritys[  1See `maybe_increment_for_loop_variable` above for explanation.inr0TF)rBr=rHrrsrOrLrts r:rJz6BracketTracker.maybe_decrement_after_for_loop_variablesn  ! %b)TZ77 UZ'' d"" JJ!OJJ  ! % % ' ' '4ur9c|jtjkr<|jdkr1|xjdz c_|j|jdSdS)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 `:`. lambdar0TF)rHrrsrOr=rCrPrts r:rUz/BracketTracker.maybe_increment_lambda_argumentssQ 9 " "tzX'='= JJ!OJJ  ( / / ; ; ;4ur9c|jrV|jd|jkr@|jtjkr+|xjdzc_|jdSdS)z=See `maybe_increment_lambda_arguments` above for explanation.rvr0TF)rCr=rHrCOLONrLrts r:rKz5BracketTracker.maybe_decrement_after_lambda_argumentssa  ( ,R0DJ>> U[(( JJ!OJJ  ( , , . . .4ur9c^|j|jdz tjfS)z7Return the most recent opening square bracket (if any).r0)r?getr=rRSQBr]s r: get_open_lsqbzBracketTracker.get_open_lsqbs&!%%tzA~uz&BCCCr9)r8)r)$r4r5r6r7r=int__annotations__rdictr?rr DepthNodeTyperr@LeafIDPriorityrArlistrBrrCrDrZr\r^rrirprVrJrUrKrr8r9r:r<r<@sF,,E3NNN8=d8S8S8SM4eXo.45SSS).t)D)D)DJVX%&DDD#Hhtn###"'%"="="=d3i===).t)D)D)DT#YDDD!E$777ItDz777:5:5$:5:5:5:5x(4((((NNhv.>NNNNN I Ih Is I I I I d t     D T     T d     4 D    Dx~DDDDDDr9r<rErArFc>|jtjkrtSdS)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 rErAs r:rTrTs yEK 1r9ct|ttzrdS|jtjkrB|jr;|jjtjtj hvr||jtvrtS|jtvr=|jr6|jjtj tjhvrt|jS|jt vrt"S|jtjkr||jtjkrt&S|jtjtjhvrdS|jdkr+|jr$|jjtjtjhvs|jtjkr1t3|jt6r|jjdkrt8S|jdkr2|jr+|jjtjtjhvrt8S|jdvr(|jr!|jjtjkrt@S|jdkrt"S|jd krT|jrM|jjtj!tj"hvr)| |jtjkr |jd kst"S|jd krJ|jrC|jjtj!kr)| |jtjkr |jdkst"S|jtFvr|jrtHSdS) 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. )withinrNrrasyncif>relseisrwnot)%rrrrHrDOTparentr import_from dotted_namerr1rfactor star_exprr/rr(STRINGr&rsASYNCrOcomp_for old_comp_for isinstance prev_siblingrrcomp_if old_comp_iftestr"comp_op comparisonrr$rs r:rRrRso0AABBBq UY K  K T%5t7G$H H H  2B!B!B ^## K $ K T[$.$A A Aty)) yK"" U\!!  MU\ ) ) yU[111q e K  K 0A B B B 9 # #4,d33 * &'11) ) d K  K t/? @ @ @%% z^## # 8HDI8U8U zT"" d K  K t ? ? ?   ++%''#" e K  K  , ,   ++$&&#" z_$$$ 1r9nodec|jtjkrdS|jd}|jd}|jtjkr|jtjksdSt}|jddD]Y}t|tr| |-| D]}| |Z | S#t$rYdSwxYw)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. rrvr0)rHratomchildrenrLPARRPARr<rrrZleavesri ValueError)rfirstlastbtcrEs r:max_delimiter_priority_in_atomrGs  yDIq M! E = D J%* $ $ej)@)@q   B ]1R4  a    GGAJJJJ     ((*** qqsC** C87C8rcj tdt|D}n#t$rtcYSwxYwg}t}t |t |D]}||}|jtvr'|t|j|f|jtvrq|rm|j|ddkrV| \}}t ||dzD]*}| t||+n|S)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. c3<K|]\}}|jtv|VdSrb)rHr)rcils r:rfz6get_leaves_inside_matching_brackets..ks<  !Qqv9I/I/IA/I/I/I/I  r9rvrr0)next enumerate StopIterationsetrangelenrHrrPrrrLaddrS) r start_index bracket_stackidsrrE_startjs r:#get_leaves_inside_matching_bracketsrcs_   #F++      uu M %%C ;F , ,  ay 9( ( (  '$)"4a!8 9 9 9 9( ( ( mB.?.B!B!B(,,..5ua!e,,++AGGBvayMM****+ ) Js&)AArb)Er7sys dataclassesrrtypingrrrrr r r r version_infotyping_extensionsr black.nodesrrrrrrrrrrblib2to3.pgen2rblib2to3.pytreerrLNrrrrrrrr r"r$r&r(VBAR CIRCUMFLEXAMPER LEFTSHIFT RIGHTSHIFTPLUSMINUSSTARSLASH DOUBLESLASHPERCENTATTILDE DOUBLESTARr/r1 Exceptionr3r<rTrRrrr8r9r:rs222 ((((((((NNNNNNNNNNNNNNNNNNNNf'''''''                        ! &&&&&&&& 4:    !#"""%U J a K OQ a J K J K q M1 Ha K a  eWWWWW WWW UDUDUDUDUDUDUD UDp   4  8D>  X     ] ] D] HTN] h] ] ] ] @83v;r9