o b*@sUdZddlmZmZddlZddlmZmZmZm Z m Z m Z ej dkr+ddl mZnddlmZddlmZmZddlmZdd lmZmZmZmZdd lmZmZmZdd lmZmZmZe eefZe Z!e Z"e Z#e Z$d Z%ee&d <dZ'ee&d<dZ(ee&d<dZ)ee&d<dZ*ee&d<dZ+ee&d<ej,dej-dej.dej/dej0dej1dej2dej3dej4dej5dej6dej7dej8dej9diZ:ee&d <d!Z;ee&d"<Gd#d$d$e<Z=eGd%d&d&Z>d1d'ed(e ed)e$fd*d+Z?d1d'ed(e ed)e$fd,d-Z@d.ed)e$fd/d0ZAdS)2z,Builds on top of nodes.py to track brackets.) dataclassfieldN)DictIterableListOptionalTupleUnion))Final)LeafNode)token)syms is_varargVARARGS_PARENTSUNPACKING_PARENTS)BRACKETOPENING_BRACKETSCLOSING_BRACKETS)MATH_OPERATORS COMPARATORSLOGIC_OPERATORSCOMPREHENSION_PRIORITYCOMMA_PRIORITYTERNARY_PRIORITYLOGIC_PRIORITY STRING_PRIORITY COMPARATOR_PRIORITY r r MATH_PRIORITIES DOT_PRIORITYc@seZdZdZdS)BracketMatchErrorzLRaised when an opening bracket is unable to be matched to a closing bracket.N)__name__ __module__ __qualname____doc__r4r4M/var/www/secure340b-portal/env/lib/python3.10/site-packages/black/brackets.pyr/4sr/c@sReZdZUdZdZeed<eedZ e e e e fefed<eedZe eefed<dZeeed<eedZeeed <eedZeeed <eedZeeed <d ed dfddZd efddZd#deed efddZd$ded efddZd ed efddZd ed efddZ d ed efddZ!d ed efdd Z"d eefd!d"Z#dS)%BracketTrackerz"Keeps track of brackets on a line.rdepth)default_factory bracket_match delimitersNprevious_for_loop_depths_lambda_argument_depths invisibleleafreturnc CsP|jtjkrdS|||||jtvrK|jd8_z |j|j|jf}Wnt y>}zt d||d}~ww||_ |j sK|j ||j|_|jdkryt||j}|rj|jdurj||jt|j<nt||j}|ry||jt|<|jtvr||j|jt|jf<|jd7_|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, it receives an `opening_bracket` field that it forms a pair with. This is a one-directional link to avoid reference cycles. 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. Nr-zDUnable to match a closing bracket to the following opening bracket: r)typerCOMMENT'maybe_decrement_after_for_loop_variable&maybe_decrement_after_lambda_argumentsrr7r9popKeyErrorr/opening_bracketvaluer>appendZ bracket_depthis_split_before_delimiterr;r:idis_split_after_delimiterrr maybe_increment_lambda_arguments!maybe_increment_for_loop_variable)selfr?rGedelimr4r4r5markDsJ           zBracketTracker.markcCs t|jS)zBReturn True if there is an yet unmatched open bracket on the line.)boolr9rOr4r4r5any_open_bracketsvs z BracketTracker.any_open_bracketsr4excludecstfdd|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. c3s |] \}}|vr|VqdSNr4).0kvrVr4r5 sz8BracketTracker.max_delimiter_priority..)maxr:items)rOrVr4r[r5max_delimiter_priorityzsz%BracketTracker.max_delimiter_priorityprioritycs2|jsdSp |tfdd|jDS)zReturn the number of delimiters with the given `priority`. If no `priority` is passed, defaults to max priority on the line. rc3s|] }|krdVqdS)r-Nr4)rXpr`r4r5r\sz?BracketTracker.delimiter_count_with_priority..)r:r_sumvalues)rOr`r4rbr5delimiter_count_with_prioritys z,BracketTracker.delimiter_count_with_prioritycC:|jtjkr|jdkr|jd7_|j|jdSdS)zIn a for loop, or comprehension, the variables are often unpacks. To avoid splitting on the comma in this situation, increase the depth of tokens between `for` and `in`. forr-TF)rArNAMErHr7r<rIrOr?r4r4r5rN z0BracketTracker.maybe_increment_for_loop_variablecCsL|jr$|jd|jkr$|jtjkr$|jdkr$|jd8_|jdSdS)z>See `maybe_increment_for_loop_variable` above for explanation.inr-TF)r<r7rArrhrHrErir4r4r5rCs  z6BracketTracker.maybe_decrement_after_for_loop_variablecCrf)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)rArrhrHr7r=rIrir4r4r5rMrjz/BracketTracker.maybe_increment_lambda_argumentscCsB|jr|jd|jkr|jtjkr|jd8_|jdSdS)z=See `maybe_increment_lambda_arguments` above for explanation.rkr-TF)r=r7rArCOLONrErir4r4r5rDs  z5BracketTracker.maybe_decrement_after_lambda_argumentscCs|j|jdtjfS)z7Return the most recent opening square bracket (if any).r-)r9getr7rRSQBrTr4r4r5 get_open_lsqbszBracketTracker.get_open_lsqb)r4)r)$r0r1r2r3r7int__annotations__rdictr9rrDepthNodeTyper r:LeafIDPriorityr;rlistr<rr=r>rRrSrUrr_rerNrCrMrDrqr4r4r4r5r68s$  "2    r6r?r;r@cCs|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)rArCOMMArr?r;r4r4r5rLs rLcCs t|ttBdr dS|jtjkr(|jr(|jjtjtj hvr(|dus&|jt vr(t S|jt vr?|jr?|jjtj tjhvr?t|jS|jtvrFtS|jtjkrX|durX|jtjkrXtS|jtjtjhvrcdS|jdkru|jru|jjtjtjhvs{|jtjkrt|jtr|jjdkrtS|jdkr|jr|jjtjtjhvrtS|jdvr|jr|jjtjkrt S|jdkrtS|jd kr|jr|jjtj!tj"hvr|dur|jtjkr|jd kstS|jd kr|jr|jjtj!kr|dur|jtjkr|jdkstS|jt#vr|jrt$SdS) 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. )ZwithinrNrgasyncif>r}elseisrlnot)%rrrrArDOTparentrZ import_fromZ dotted_namerr.rfactorZ star_exprr,rr%STRINGr#rhASYNCrHZcomp_forZ old_comp_for isinstanceZ prev_siblingr rZcomp_ifZ old_comp_iftestrZcomp_opZ comparisonrr!r{r4r4r5rJs              rJnodecCs|jtjkrdS|jd}|jd}|jtjkr|jtjks dSt}|jddD]}t|t r7| |q*| D]}| |q;q*z| WSt ySYdSw)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. rrkr-)rArZatomchildrenrLPARRPARr6rr rRleavesr_ ValueError)rfirstlastZbtcr?r4r4r5max_delimiter_priority_in_atom5s$         rrW)Br3 dataclassesrrsystypingrrrrrr version_infoZtyping_extensionsr Zblib2to3.pytreer rZblib2to3.pgen2rZ black.nodesrrrrrrrrrrLNrrrurwrvrxrrsrrr!r#r%VBAR CIRCUMFLEXAMPER LEFTSHIFT RIGHTSHIFTPLUSMINUSSTARSLASH DOUBLESLASHPERCENTATTILDE DOUBLESTARr,r.rFr/r6rLrJrr4r4r4r5s\            `