a g gbd@sVUdZddlZddlmZmZmZmZmZmZm Z m Z ej dkrNddlm Z n ddl m Z ej dkrrddlmZn ddl mZddlmZdd lmZdd lmZdd lmZdd lmZdd lmZmZmZmZeeejZ e e!d<e dZ"e eefZ#e$Z%e$Z&ej'ej(ej)hZ*e e!d<e j+e j,e j-e j.e j/e j0e j1e j2e j3e j4h Z5e e!d<dZ6e e!d<dej7e6<ddhZ8e e!d<ej9ej:ej;ejhZ?e e!d<ej@ejAejBejCejDejEejFejGejHejIejJejKejLejMhZNe e!d<ejGejMhZOe e!d<eOejHhBZPe e!d<e jQe jRe jSe jTe jUhZVe e!d<e jWe jXe jYe jZe j[e j\e j]hZ^e e!d<e j_e j`e jae jbe jce jde jee jfe jge jhe jie jje jSe jke jlhZme e!d<e jne johZpe e!d<hdZqe e!d <e jre j[e jshZte e!d!<ejuejvejwejxejyejziZ{e e!d"<e|e{}Z~e e!d#<e|e{Ze e!d$<e~eBZe e!d%<eeje6hBZe e!d&<d'Zed(d)Gd*d+d+ee"Zeeed,d-d.Zee#eed/d0d1Zee#eee&ed2d3d4Zee#ee&d/d5d6Zee#ee#d7d8d9Ze#e#dd:d;d<Zee#d=d>d?Ze#eed/d@dAZe#ed/dBdCZeed=dDdEZe#ed/dFdGZe#ed/dHdIZe#ed/dJdKZejuejvffeeeeee$e$fedLdMdNZe#ed/dOdPZde#eedRdSdTZe#ed/dUdVZe#ed/dWdXZeee&edYdZd[Zeed=d\d]Zeed/d^d_Ze#ed/d`daZe#ed/dbdcZeed=dddeZeed=dfdgZeed=dhdiZeed=djdkZeed=dldmZeed=dndoZdeeedqdrdsZd(dtee#eddudvdwZe#ee#d/dxdyZedd=dzd{Zeeed|d}d~Zeeed|ddZeeed|ddZeeed|ddZeeed|ddZeed=ddZdS)z> blib2to3 Node/Leaf transformation-related utility functions. N)GenericIteratorListOptionalSetTupleTypeVarUnion))Final)r ) TypeGuard) mypyc_attr) CACHE_DIR)has_triple_quotes)pygram)token)NLLeafNode type_reprsymsT WHITESPACE STATEMENTSTANDALONE_COMMENTandorLOGIC_OPERATORS COMPARATORSMATH_OPERATORSSTARSVARARGS_SPECIALSVARARGS_PARENTSUNPACKING_PARENTSTEST_DESCENDANTS TYPED_NAMES>=z/=z**=z*=z>>=z-=z@=z<<=z%=z^=z&=z//=z+=z|= ASSIGNMENTSIMPLICIT_TUPLEBRACKETOPENING_BRACKETSCLOSING_BRACKETSBRACKETSALWAYS_NO_SPACE7T)Zallow_interpreted_subclassesc@s8eZdZdZeeedddZeeedddZdS)VisitorzBBasic lib2to3 visitor that yields things of type `T` on `visit()`.nodereturnccs`|jdkrtj|j}ntt|j}t|d|d}|rL||EdHn||EdHdS)azMain 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)selfr4nameZvisitfr?N/var/www/html/llm_bihealth/app/venv/lib/python3.9/site-packages/black/nodes.pyvisits z Visitor.visitccs*t|tr&|jD]}||EdHqdS)zCDefault `visit_*()` implementation. Recurses to children of `node`.N) isinstancerchildrenrA)r=r4childr?r?r@r<s  zVisitor.visit_defaultN) __name__ __module__ __qualname____doc__LNrrrAr<r?r?r?r@r2sr2)leafcomplex_subscriptr5c CsPd}d}d}|j}|j}|j}|tvr*|S|tjkr8|S|dusNJd||tjkrr|jtjtj tj hvrr|S|j }|st |} | r| jt vr|S|tjkr| jtjkr|S| jtjkr|s|S|S| jtjkr| jr| jjtjtjtjtjhvr|S| jjtjkr| jSn| jtjkrNt| tjkrNt| jtj krN|S| jtvrrt| ttBdr|Sn| jtjkr| jr| jjtjtj hvr|r|S|SnR| jr| jjtjkr| jtvr|S| jtjkr|jr|jjtj kr|Sn|jt vr|S|jtjtjhvrB|r:|jtjkrL|Sn |jtjkrl|rL|jtjkrL|Sn|jtjkr|s|S|tjkr|jt!vr|Sn&|jtjkr|jS|jtjkrL|Sn|jt!vr|sLt |} | r| jtjkrL|SnJ|jtj"krf|tj#ks(|tj$kr,|S|sP|tj%ksJ|tj&krb|Sn|jtjkrL|Sn|jtjkr|tjkr|S|st |} | r| jtj#kr|Sn|jtjhtBvrL|Sn|jtj kr|S|jtj'kr$|r|St |} | r| jtjks| jtj%krL|Sn(|jtj(kr^|tj#krB|S|rL|jtj#krL|Sn|jtjtj hvr|s|jdusJd|jjtj kr|S|S|sL|Sn|jtj)kr|rL|tj%krL|Snr|jtj*kr|rL|jtj+krL|SnH|jtjtjhvr|st |} | r8| jt vr<|S| j} | dusPJ| jtjkrv| jtjtj hvrv|S| jtjkr| jtjkr|Sn|tj,tj-tj.hvrL|Sn|jtj/kr|tj%kr|r|jtj%kr|Sn2|tj,krL|dkr|S|rL|jtj%krL|Sn0|jtj kr.|S|jtj0krL|tjkrL|S|S) 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 Nz/INTERNAL ERROR: hand-made leaf without parent: )withinzsubscripts are always parentedimport)1r8parentvaluer0rCOMMENTCOLONrZ subscriptZ subscriptlistZsliceop prev_siblingpreceding_leafr-COMMAEQUALarglistargument parameters varargslist typedargslistprefixSTAR parent_type star_exprr$ is_varargr%r&Zfactorr"AT decoratorr(trailerLPARRPARDOTLSQBZ dotted_nameclassdefatom dictsetmaker DOUBLESTARNAMENUMBERSTRING import_from except_clause) rJrKNOSPACEZ DOUBLESPACEtpvprevZprevpZ prevp_parentr?r?r@ whitespaces>       &     "     rxr3cCsP|rL|j}|rDt|tr|Szt|dWStyBYdS0|j}qdS)z3Return the first leaf that precedes `node`, if any.N)rTrBrlistleaves IndexErrorrP)r4resr?r?r@rUs  rU)r4tokensr5cCsJ|sdS|ddur|duS|s$dS|j|dkr6dSt|j|ddS)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.TryNF)r8prev_siblings_arerT)r4r~r?r?r@rs rcCs|dus|jdurdS|jjS)z| Returns: @node.parent.type, if @node is not None and has a parent. OR None, otherwise. N)rPr8r4r?r?r@r_sr_)ancestor descendantr5cCs|}|r|j|kr|j}q|S)z:Return the child of `ancestor` that contains `descendant`.)rP)rrr4r?r?r@ child_towardssr) old_child new_childr5cCs.|j}|sdS|}|dur*|||dS)z Side Effects: * If @old_child.parent is set, replace @old_child with @new_child in @old_child's underlying Node structure. OR * Otherwise, this function does nothing. N)rPremove insert_child)rrrPZ child_idxr?r?r@ replace_childs r)rJr5cCs`|j}|}|r\|j}|durq\|jdj|kr0q\|jtjkr>q\|jdurV|jjtvrVq\|}q |S)zReturn `leaf` or one of its ancestors that is the topmost container of it. By "container" we mean a node where `leaf` is the very first child. Nr)r]rPrCr8rZ file_inputrTr/)rJZ same_prefix containerrPr?r?r@ container_ofs rcCs*t|tr|S|jr"t|jdSdSdS)z(Returns the first leaf of the node tree.rN)rBrrC first_leaf_ofrr?r?r@rs  rcCs|jtjtjtjtjhvS)z?Whether node is an arithmetic or a binary arithmetic expression)r8r arith_expr shift_exprxor_exprand_exprrr?r?r@ is_arith_likes rcCs>t|jdtjtjtjgrdSt|jtjtjtjgr:dSdS)NTF) rrPrNEWLINEINDENTr simple_stmtrZrSrJr?r?r@ is_docstring srcCs>|jtjko>z-is_tuple_containing_walrus..)r8rrjrranyrCrr?r?r@is_tuple_containing_walrus6s  r)openingclosingr{bracketsr5c Cs|j|jf|krdS|jd}t|D]\}}||ur&qDq&tdd}|d7}||dD]X}||urlq|j}||kr\|jtjkr\|d7}|jr\|jjtjtj hvr\|d7}qq\|dkS)zIReturn True if content between `opening` and `closing` is a one-sequence.Frz#Opening paren not found in `leaves`rNr) r8 bracket_depth enumerate LookupErrorrrVrPrrXr\) rrr{rdepthZ_opening_indexrJZcommasrr?r?r@is_one_sequence_betweenAs,  rcCst|}|duo|jtjkS)z7Return True iff `node` is of the shape ( test := test )N)rr8rr)r4innerr?r?r@is_walrus_assignmentfsrF)r4lastr5cCs|jtjkot|jdkr>|jdjtjkr>|jdjtjkp|rtt|jdkrt|jdjtjkrt|jdjtj kp|ot|jdko|jdjtjko|jdjtj kS)z?Return True iff `node` is a trailer valid in a simple decoratorrrrr ) r8rrdrrCrrgrmrerf)r4rr?r?r@is_simple_decorator_trailerls(   rcCsp|jtjkrdS|jtjkrl|jrl|jdjtjkojttt|jddojt |jdkpjt|jdddSdS)a\Return 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 Trrryr)rF) r8rrmrpowerrCallmaprrrr?r?r@is_simple_decorator_expressions  rcCsx|jtjkrdSt|r&|jdkr&dS|jtjkr6dSt|jdkrHdS|j\}}}|jtj krt|jtj krtt |SdS)zAReturn True if `node` holds a `yield` or `yield from` expression.TyieldFr ) r8rZ yield_expr is_name_tokenrQrjrrCrrerfis_yield)r4lparexprrparr?r?r@rs   r)rJrNr5cCs@|jtvs|jsdS|j}|jtjkr6|js0dS|j}|j|vS)aFReturn 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)r8r$rPrr`)rJrNrur?r?r@ras racCst|jod|jvS)zKReturn True if `leaf` is a multiline string that actually spans many lines. )rrQrr?r?r@is_multiline_stringsrcCsVt|jdksD|jdjtjksD|jdjtjksD|jdjtjkrHdSt|jdS)z2Return True if `node` is a suite with a stub body.rrr Fr)rrCr8rrrDEDENT is_stub_bodyrr?r?r@ is_stub_suites rcCsdt|tr|jtjkrdSt|jdkr,dS|jd}|jtjkobt|jdkobtdd|jDS)zCReturn True if `node` is a simple statement containing an ellipsis.Frrr css|]}|ttjdkVqdS).N)rrrg)rrJr?r?r@rrzis_stub_body..) rBrr8rrrrCrjr)r4rDr?r?r@rs   rcCspt|ts|jtjkrdS|jd|jd}}t|ton|jtjkon|jdkont|ton|jtj kon|jdkS)zGiven a `LN`, determines whether it's an atom `node` with invisible parens. Useful in dedupe-ing and normalizing parens. FrryrL) rBrr8rrjrCrrerQrf)r4firstrr?r?r@is_atom_with_invisible_parenss   rcCst|pt|Sr) is_empty_lpar is_empty_rparrr?r?r@ is_empty_parsrcCs|jtjko|jdkSNrL)r8rrerQrr?r?r@rsrcCs|jtjko|jdkSr)r8rrfrQrr?r?r@rsrcCsP|j}|j}|j}t|tjkoL|dkr6|r6|jtjkpL|dkoL|oL|jtjkS)z9Return True if the given leaf starts an import statement.rOfrom) rPr8rQboolrrmr import_namerp)rJrurtrvr?r?r@ is_import s rcCsRt|jtjko*|jdko*|jo*|jjtjkpPt|jtjkoN|j oN|j jtjkS)zDReturn True if the given leaf starts a with or async with statement.with) rr8rrmrQrPr with_stmtASYNCZ next_siblingrr?r?r@is_with_or_async_with_stmts    rcCs*t|jtjko&|jo&|jjtjtjhvS)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. )rr8rrrPrZ async_stmtZ async_funcdefrr?r?r@is_async_stmt_or_funcdef&s  rrL)rJsuffixr5cCs(|j}|j}|tjthvo&|d|S)zdReturn True if the given leaf is a special comment. Only returns true for type comments for now.z# type:)r8rQrrRr startswith)rJrrtrvr?r?r@is_type_comment3sr)visible)rPrDrr5cCshttj|rdnd}ttj|r"dnd}|j}d|_|p>d}ttj|||g}||_| ||dS)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). (rL)rN) rrrerfr]rrrrjr)rPrDrrrr]indexrr?r?r@wrap_in_parentheses;s rcCs>t|jdkrdS|j\}}}|jtjkr6|jtjks:dS|S)zqReturns `wrapped` if `node` is of the shape ( wrapped ). Parenthesis can be optional. Returns None otherwiser N)rrCr8rrerf)r4rwrappedrr?r?r@rMs  rcCs*|jtjkrd|_n|jtjkr&d|_dS)zMake sure parentheses are visible. They could be invisible as part of some statements (see :func:`normalize_invisible_parens` and :func:`visit_import_from`). rrN)r8rrerQrfrr?r?r@ensure_visible[s  r)nlr5cCs |jtjkSr)r8rrmrr?r?r@rgsrcCs |jtjkSr)r8rrerr?r?r@ is_lpar_tokenksrcCs |jtjkSr)r8rrfrr?r?r@ is_rpar_tokenosrcCs |jtjkSr)r8rrorr?r?r@is_string_tokenssrcCs |jtjkSr)r8rrnrr?r?r@is_number_tokenwsrcCsJ|j}|durF|jr&|jjtjkr&dS|jr>|jjtjkr>dS|j}qdS)z6Returns whether this leaf is part of type annotations.NTF)rPrTr8rRARROWrtname)rJrr?r?r@is_part_of_annotation{sr)F)rL)rHsystypingrrrrrrrr version_infor Ztyping_extensionsrZmypy_extensionsrZ black.cacherZ black.stringsrZblib2to3rZblib2to3.pgen2rZblib2to3.pytreerrrrZ initializeZpython_symbolsr__annotations__rrIintZLeafIDZNodeTyperrrrZif_stmtZ while_stmtZfor_stmtZtry_stmtrqrZfuncdefriZ match_stmtZ case_blockrrr9r LESSGREATEREQEQUALNOTEQUAL LESSEQUAL GREATEREQUALr!VBAR CIRCUMFLEXAMPER LEFTSHIFT RIGHTSHIFTPLUSMINUSr^SLASH DOUBLESLASHPERCENTrbTILDErlr"r#r$rXrYrdr\r[r%rjrkZ listmakerrZtestlist_star_exprZ subject_exprpatternr&testZlambdefZor_testZand_testZnot_testZ comparisonr`rrrrrZtermrr'rZ tname_starr(r*ZtestlistZexprlistr+rerfrhRSQBLBRACERBRACEr,setkeysr-valuesr.r/rVr0rr2rr:rxrUrr_rrrrrrrrrrrrrrrarrrrrrrrrrrrrrrrrrrrr?r?r?r@s,(                   "g       %