o 8fp@srUdZddlZddlmZmZmZmZmZmZm Z m Z m Z m Z ej dkr+ddlmZnddlmZddlmZddlmZddlmZmZdd lmZmZdd lmZdd lmZdd lmZm Z m!Z!m"Z"e#eej$Z%ee&d <e dZ'e e e!fZ(e)Z*e)Z+ej,ej-ej.hZ/ee&d<e%j0e%j1e%j2e%j3e%j4e%j5e%j6e%j7e%j8e%j9h Z:ee&d<dZ;ee&d<dejej?ej@ejAejBejChZDee&d<ejEejFejGejHejIejJejKejLejMejNejOejPejQejRhZSee&d<ejLejRhZTee&d<eTejMhBZUee&d<e%jVe%jWe%jXe%jYe%jZhZ[ee&d<e%j\e%j]e%j^e%j_e%j`e%jae%jbhZcee&d<e%jde%jee%jfe%jge%jhe%jie%jje%jke%jle%jme%jne%joe%jXe%jpe%jqe%jrhZsee&d<e%jte%juhZvee&d<hdZwee&d<e%jxe%j`e%jyhZzee&d <ej{ej|ej}ej~ejejiZee&d!<eeZee&d"<eeZee&d#<eeBZee&d$<eeje;hBZee&d%<d&Zed'd(Gd)d*d*ee'Zd+e d,ed-ed.efd/d0Zdd2e)d3ed4ed.efd5d6Zd7ee(d.ee fd8d9Zd7ee(d:eee+d.efd;d<Zd7ee(d.ee+fd=d>Zd?e!d@e(d.ee(fdAdBZdCe(dDe(d.dfdEdFZd+e d.e(fdGdHZd7e(d.ee fdIdJZd7e(d.efdKdLZd+e d-ed.efdMdNZd7e(d.efdOdPZd7e(d.efdQdRZd7e(d.efdSdTZej{ej|ffdUe dVe dWee dXe e)e)fd.ef dYdZZd7e(d.efd[d\Zdd7e(d^ed.efd_d`Zd7e(d.efdadbZd7e(d.efdcddZd+e dee e+d.efdfdgZd+e d.efdhdiZd7e!d.efdjdkZd7e!d.efdldmZd7e!d.efdndoZd7e(d.efdpdqZd7e(d.efdrdsZd+e d.efdtduZd+e d.efdvdwZd+e d.efdxdyZd+e d.efdzd{Zd+e d.efd|d}Zd+e d.efd~dZd+e d.efddZd+e d.efddZded.efddZd'dde!de(ded.dfddZd7e(d.ee(fddZd+e d.dfddZded.ee fddZded.ee fddZded.ee fddZded.ee fddZded.ee fddZd+e d.edfddZd+e d.efddZd7e(d.ee fddZd7e(d.ee fddZd+e d.e(fddZdS)z> blib2to3 Node/Leaf transformation-related utility functions. N) FinalGenericIteratorListLiteralOptionalSetTupleTypeVarUnion) ) TypeGuard) mypyc_attr) CACHE_DIR)ModePreview)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_subclassesc@s<eZdZdZdedeefddZdedeefddZdS) VisitorzBBasic lib2to3 visitor that yields things of type `T` on `visit()`.nodereturnccsd|jdkr tj|j}ntt|j}t|d|d}|r(||EdHdS||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)selfrEnamevisitfrQD/home/ertert/spirit/venv/lib/python3.10/site-packages/black/nodes.pyvisits z Visitor.visitccs0t|tr|jD] }||EdHq dSdS)zCDefault `visit_*()` implementation. Recurses to children of `node`.N) isinstancerchildrenrS)rNrEchildrQrQrRrMs   zVisitor.visit_defaultN) __name__ __module__ __qualname____doc__LNrrrSrMrQrQrQrRrDsrDleafcomplex_subscriptmoderFc CsRd}d}d}|j}|j}|j}|tvr|S|tjkr|S|dus'Jd||tjkr9|jtjtj tj hvr9|S|j } | st |} | rI| jt vrK|S|tjkrd| jtjkrX|S| jtjkrb|sb|S|S| jtjkr| jr| jjtjtjtjtjhvr}|S| jjtjkr| jSnl| jtjkrt| tjkrt| jtj kr|S| jtvrt| ttBdr|SnE| jtjkr| jr| jjtjtj hvr|r|S|Sn+| jr| jjtjkr| jtvr|S| jtjkr|jr|jjtj kr|Sn| jt vr|S|jtjtjhvr | r| jtjkr |S|S|jtjkr!| r| jtjkr|S|S|jtjkrR| s-|S|tjkr=| jt!vr;|S|S| jtjkrG| jS| jtjkrP|S|S|jt!vrm| skt |} | ri| jtjkrk|S|S|jtj"kr|tj#ks|tj$kr|S| s|tj%ks|tj&kr|S|S| jtjkr|S|S|jtjkr|tjkr|S| st |} | r| jtj#kr|S|S| jtjhtBvr|S|S|jtj kr|S|jtj'kr| r|St |} | r| jtjks| jtj%kr|S|S|jtj(kr|tj#kr|S| r| jtj#kr|S|S|jtjtj hvrV| s@|jdus4Jd|jjtj kr>|S|S|tj)ksM| jtj)krO|S|sT|S|S|jtj*krj| rh|tj%krh|S|S|jtj+kr| r}| jtj,kr}|S|S|jtjtjhvr| st |} | r| jt vr|S| j} | dusJ| jtjkr| jtjtj hvr|S| jtjkr| jtjkr|S|S|tj-tj.tj/hvr|S|S|jtj0kr|tj%kr| r| jtj%kr|S|S|tj-kr |dkr|S| r | jtj%kr |S|S|jtj kr|S|jtj1kr'|tjkr'|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)2rIparentvaluerArCOMMENTCOLONr subscript subscriptlistsliceop prev_siblingpreceding_leafr>COMMAEQUALarglistargument parameters varargslist typedargslistprefixSTAR parent_type star_exprr' is_varargr(r)factorr%AT decoratorr+trailerLPARRPARDOTLSQB dotted_nameclassdef COLONEQUALatom dictsetmaker DOUBLESTARNAMENUMBERSTRING import_from except_clause) r\r]r^NOSPACE DOUBLESPACEtpvprevprevp prevp_parentrQrQrR whitespacesl              ~v ofc YV"J C4/*    r nl_count form_feed empty_linecCs |r ||dd|S||S)z$Generate a normalized prefix string. rQ)rrrrQrQrRmake_simple_prefixsrrEcCsR|r'|j}|r"t|tr|Sz t|dWSty!YdSw|j}|sdS)z3Return the first leaf that precedes `node`, if any.N)rjrTrlistleaves IndexErrorrc)rEresrQrQrRrks   rktokenscCsJ|sdS|ddur|duS|sdS|j|dkrdSt|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.TrNF)rIprev_siblings_arerj)rErrQrQrRrs rcCs|dus |jdur dS|jjS)z| Returns: @node.parent.type, if @node is not None and has a parent. OR None, otherwise. N)rcrIrErQrQrRrusruancestor descendantcCs*|}|r|j|kr|j}|r|j|ks |S)z:Return the child of `ancestor` that contains `descendant`.)rc)rrrErQrQrR child_towardss r old_child new_childcCs2|j}|sdS|}|dur|||dSdS)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)rcremove insert_child)rrrc child_idxrQrQrR replace_childsrcCsr|j}|}|r7|j}|dur |S|jdj|kr |S|jtjkr% |S|jdur3|jjtvr3 |S|}|s|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)rsrcrUrIr file_inputrjr@)r\ same_prefix containerrcrQrQrR container_ofs&  rcCs&t|tr|S|jrt|jdSdS)z(Returns the first leaf of the node tree.rN)rTrrU first_leaf_ofrrQrQrRr s rcCs|jtjtjtjtjhvS)z?Whether node is an arithmetic or a binary arithmetic expression)rIr arith_expr shift_exprxor_exprand_exprrrQrQrR is_arith_likes rcCs|jtjkrdSt|j}t|drdStj|vr7|j r7|j jt j kr7|j j s7|j j r7|j j jt j kr7dSt|j dtjtjt j grFdSt|j t jtjt j grTdSdS)NFbBfFT)rIrrrrdset intersectionrunify_docstring_detectionrcr simple_stmtrjrrNEWLINEINDENTrprf)r\r^rsrQrQrR is_docstring!s,   rcCs>|jtjkot|jdko|jdjtjko|jdjtjkS)z+Return True if `node` holds an empty tuple.rr)rIrrlenrUrr|r}rrQrQrRis_empty_tupleAs  rcCsv|jtjkr&t|}|dus|jtjkrdSt|jdko%|jdjtjkS|jt vo:t|jdko:|jdjtjkS)zMReturn True if `node` holds a tuple with one element, with or without parens.NFrr) rIrrunwrap_singleton_parenthesis testlist_gexprrUrrlr<rEgexprQrQrR is_one_tupleKs    rcCsD|jtjkrdSt|}|dus|jtjkrdStdd|jDS)zDReturn True if `node` holds a tuple that contains a walrus operator.FNcss|] }|jtjkVqdSN)rIrnamedexpr_test).0rVrQrQrR csz-is_tuple_containing_walrus..)rIrrrranyrUrrQrQrRis_tuple_containing_walrus[s ropeningclosingrbracketsc Cs|j|jf|kr dS|jd}t|D] \}}||urnqtdd}|d7}||dD]2}||ur9|dkS|j}||kr`|jtjkr`|d7}|jr`|jjtjtj hvr`|d7}|dkSq.|dkS)zIReturn True if content between `opening` and `closing` is a one-sequence.Frz#Opening paren not found in `leaves`rNr) rI bracket_depth enumerate LookupErrorrrlrcrrnrr) rrrrdepth_opening_indexr\commasrrQrQrRis_one_sequence_betweenfs4   rcCst|}|duo |jtjkS)z7Return True iff `node` is of the shape ( test := test )N)rrIrr)rEinnerrQrQrRis_walrus_assignmentsrFlastcCs|jtjkoTt|jdko|jdjtjko|jdjtjkpT|o9t|jdko9|jdjtjko9|jdjtj kpT|oTt|jdkoT|jdjtjkoT|jdjtj kS)z?Return True iff `node` is a trailer valid in a simple decoratorrrrr ) rIrr{rrUrr~rr|r})rErrQrQrRis_simple_decorator_trailers(   rcCsp|jtjkrdS|jtjkr6|jr6|jdjtjko5ttt|jddo5t |jdkp5t|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 Trrrr)rF) rIrrrpowerrUallmaprrrrQrQrRis_simple_decorator_expressions  rcCsx|jtjkrdSt|r|jdkrdS|jtjkrdSt|jdkr$dS|j\}}}|jtj kr:|jtj kr:t |SdS)zAReturn True if `node` holds a `yield` or `yield from` expression.TyieldFr ) rIr yield_expr is_name_tokenrdrrrUrr|r}is_yield)rElparexprrparrQrQrRrs   rracCs@|jtvs|js dS|j}|jtjkr|jsdS|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)rIr'rcrrv)r\rarrQrQrRrws  rwcCst|jo d|jvS)zKReturn True if `leaf` is a multiline string that actually spans many lines.r)rrdr\rQrQrRis_multiline_stringsrcCs8|jtjtjhvs J|jdusJ|jjtjtjhvSr)rIrsuiterrcfuncdefrrrQrQrRis_parent_function_or_classsrcCs|jtjtjtjhvSr)rIrrr async_funcdefrrQrQrRis_function_or_classrcCs|jdur t|s dS|jrdSt|jdks4|jdjtjks4|jdjtj ks4|jdjtj kr6dS|jdjr@dSt |jdS)z2Return True if `node` is a suite with a stub body.NFrrr r) rcrrsstriprrUrIrrrDEDENT is_stub_bodyrrQrQrR is_stub_suites rcCspt|tr |jtjkr dSt|jdkrdS|jd}|j o7|jtj ko7t|jdko7t dd|jDS)zCReturn True if `node` is a simple statement containing an ellipsis.Frrr css |] }|ttjdkVqdS).N)rrr~)rr\rQrQrRr#szis_stub_body..) rTrrIrrrrUrsrrr)rErVrQrQrRrs    rcCspt|ts |jtjkr dS|jd|jd}}t|to7|jtjko7|jdko7t|to7|jtj ko7|jdkS)zGiven a `LN`, determines whether it's an atom `node` with invisible parens. Useful in dedupe-ing and normalizing parens. Frrr_) rTrrIrrrUrr|rdr})rEfirstrrQrQrRis_atom_with_invisible_parens's   rcCst|pt|Sr) is_empty_lpar is_empty_rparrrQrQrR is_empty_par9srcC|jtjko |jdkSNr_)rIrr|rdrrQrQrRr=rrcCrr)rIrr}rdrrQrQrRrArrcCsP|j}|j}|j}t|tjko&|dkr|r|jtjkp&|dko&|o&|jtjkS)z9Return True if the given leaf starts an import statement.rbfrom) rcrIrdboolrrr import_namer)r\rrrrQrQrR is_importEs rcCsRt|jtjko|jdko|jo|jjtjkp(t|jtjko'|j o'|j jtjkS)zDReturn True if the given leaf starts a with or async with statement.with) rrIrrrdrcr with_stmtASYNC next_siblingrrQrQrRis_with_or_async_with_stmtSs    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. )rrIrrrcr async_stmtrrrQrQrRis_async_stmt_or_funcdefas  rcCs$|j}|j}|tjthvo|dS)aBReturn 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:)rIrdrrer startswithr\rrrQrQrRis_type_commentnsrcCs"|j}|j}|tjthvot|S)zGReturn True if the given leaf is a type comment with ignore annotation.)rIrdrrer is_type_ignore_comment_stringrrQrQrRis_type_ignore_commentxsr rdcCs |dS)zSReturn True if the given string match with type comment with ignore annotation.z# type: ignore)r)rdrQrQrRr s r )visiblercrVr cCshttj|rdnd}ttj|rdnd}|j}d|_|pd}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). (r_)rN) rrr|r}rsrrrrr)rcrVr rrrsindexrrQrQrRwrap_in_parenthesess rcCs>t|jdkr dS|j\}}}|jtjkr|jtjksdS|S)zqReturns `wrapped` if `node` is of the shape ( wrapped ). Parenthesis can be optional. Returns None otherwiser N)rrUrIrr|r})rErwrappedrrQrQrRrs  rcCs0|jtjkr d|_dS|jtjkrd|_dSdS)zMake sure parentheses are visible. They could be invisible as part of some statements (see :func:`normalize_invisible_parens` and :func:`visit_import_from`). r r N)rIrr|rdr}rrQrQrRensure_visibles    rnlcC |jtjkSr)rIrrrrQrQrRr rcCrr)rIrr|rrQrQrR is_lpar_tokenrrcCrr)rIrr}rrQrQrR is_rpar_tokenrrcCrr)rIrrrrQrQrRis_string_tokenrrcCrr)rIrrrrQrQrRis_number_tokenrr)rFparamNcCsP|j}|dur&|jr|jjtjkrdS|jr|jjtjkrdS|j}|dusdS)zvaluesr?r@rlrArrDrrKrrrkrrurrrrrrrrrrrrrrrwrrrrrrrrrrrrrr r rrrrrrrrrrr r"r#rQrQrQrRsF0                 "j"        %