o go@sXUdZddlZddlmZmZmZmZmZmZm Z m Z m Z ej dkr)ddlm Z nddlm Z ddlmZddlmZddlmZmZdd lmZmZdd lmZdd lmZdd lmZmZm Z m!Z!e"eej#Z$ee%d <e dZ&e ee fZ'e(Z)e(Z*ej+ej,ej-hZ.ee%d<e$j/e$j0e$j1e$j2e$j3e$j4e$j5e$j6e$j7e$j8h Z9ee%d<dZ:ee%d<dej;e:<ddhZej?ej@ejAejBhZCee%d<ejDejEejFejGejHejIejJejKejLejMejNejOejPejQhZRee%d<ejKejQhZSee%d<eSejLhBZTee%d<e$jUe$jVe$jWe$jXe$jYhZZee%d<e$j[e$j\e$j]e$j^e$j_e$j`e$jahZbee%d<e$jce$jde$jee$jfe$jge$jhe$jie$jje$jke$jle$jme$jne$jWe$joe$jpe$jqhZree%d<e$jse$jthZuee%d<hdZvee%d<e$jwe$j_e$jxhZyee%d <ejzej{ej|ej}ej~ejiZee%d!<eeZee%d"<eeZee%d#<eeBZee%d$<eeje:hBZee%d%<d&Zed'd(Gd)d*d*ee&Zd+ed,ed-ed.efd/d0Zdd2e(d3ed4ed.efd5d6Zd7ee'd.eefd8d9Zd7ee'd:eee*d.efd;d<Zd7ee'd.ee*fd=d>Zd?e d@e'd.ee'fdAdBZdCe'dDe'd.dfdEdFZd+ed.e'fdGdHZd7e'd.eefdIdJZd7e'd.efdKdLZd+ed-ed.efdMdNZd7e'd.efdOdPZd7e'd.efdQdRZd7e'd.efdSdTZejzej{ffdUedVedWeedXe e(e(fd.ef dYdZZd7e'd.efd[d\Zdd7e'd^ed.efd_d`Zd7e'd.efdadbZd7e'd.efdcddZd+edeee*d.efdfdgZd+ed.efdhdiZd7e d.efdjdkZd7e d.efdldmZd7e d.efdndoZd7e'd.efdpdqZd7e'd.efdrdsZd+ed.efdtduZd+ed.efdvdwZd+ed.efdxdyZd+ed.efdzd{Zd+ed.efd|d}Zd+ed.efd~dZd+ed.efddZd+ed.efddZded.efddZd'dde de'ded.dfddZd7e'd.ee'fddZd+ed.dfddZded.e efddZded.e efddZded.e efddZded.e efddZded.e efddZd+ed.efddZd7e'd.eefddZd7e'd.eefddZd+ed.e'fddZdS)z> blib2to3 Node/Leaf transformation-related utility functions. N) FinalGenericIteratorListOptionalSetTupleTypeVarUnion) ) 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)selfrDnamevisitfrPK/var/www/html/bloggers_ems/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) isinstancerchildrenrR)rMrDchildrPrPrQrLs   zVisitor.visit_defaultN) __name__ __module__ __qualname____doc__LNrrrRrLrPrPrPrQrCsrCleafcomplex_subscriptmoderEc 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)2rHparentvaluer@rCOMMENTCOLONr 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_parentrPrPrQ whitespacesl              ~v ofc YV"J C4/*    r nl_count form_feed empty_linecCs |r ||dd|S||S)z$Generate a normalized prefix string. rP)rrrrPrPrQmake_simple_prefixsrrDcCsR|r'|j}|r"t|tr|Sz t|dWSty!YdSw|j}|sdS)z3Return the first leaf that precedes `node`, if any.N)rirSrlistleaves IndexErrorrb)rDresrPrPrQrjs   rjtokenscCsJ|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)rHprev_siblings_areri)rDrrPrPrQrs rcCs|dus |jdur dS|jjS)z| Returns: @node.parent.type, if @node is not None and has a parent. OR None, otherwise. N)rbrHrDrPrPrQrtsrtancestor descendantcCs*|}|r|j|kr|j}|r|j|ks |S)z:Return the child of `ancestor` that contains `descendant`.)rb)rrrDrPrPrQ 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)rbremove insert_child)rrrb child_idxrPrPrQ 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)rrrbrTrHr file_inputrir?)r[ same_prefix containerrbrPrPrQ container_ofs&  rcCs&t|tr|S|jrt|jdSdS)z(Returns the first leaf of the node tree.rN)rSrrT first_leaf_ofrrPrPrQrs rcCs|jtjtjtjtjhvS)z?Whether node is an arithmetic or a binary arithmetic expression)rHr arith_expr shift_exprxor_exprand_exprrrPrPrQ is_arith_like s 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)rHrrrrcset intersectionrunify_docstring_detectionrbr simple_stmtrirrNEWLINEINDENTrore)r[r]rrrPrPrQ is_docstrings,   rcCs>|jtjkot|jdko|jdjtjko|jdjtjkS)z+Return True if `node` holds an empty tuple.rr)rHrrlenrTrr{r|rrPrPrQis_empty_tuple6s  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) rHrrunwrap_singleton_parenthesis testlist_gexprrTrrkr;rDgexprPrPrQ is_one_tuple@s    rcCsD|jtjkrdSt|}|dus|jtjkrdStdd|jDS)zDReturn True if `node` holds a tuple that contains a walrus operator.FNcss|] }|jtjkVqdSN)rHrnamedexpr_test).0rUrPrPrQ Xsz-is_tuple_containing_walrus..)rHrrrranyrTrrPrPrQis_tuple_containing_walrusPs 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) rH bracket_depth enumerate LookupErrorrrkrbrrmrq) rrrrdepth_opening_indexr[commasrrPrPrQis_one_sequence_between[s4   rcCst|}|duo |jtjkS)z7Return True iff `node` is of the shape ( test := test )N)rrHrr)rDinnerrPrPrQis_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 ) rHrrzrrTrr}rr{r|)rDrrPrPrQis_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) rHrrrpowerrTallmaprrrrPrPrQis_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 ) rHr yield_expr is_name_tokenrcrrrTrr{r|is_yield)rDlparexprrparrPrPrQrs   rr`cCs@|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)rHr&rbrru)r[r`rrPrPrQrvs  rvcCst|jo d|jvS)zKReturn True if `leaf` is a multiline string that actually spans many lines.r)rrcr[rPrPrQis_multiline_stringsrcCs8|jtjtjhvs J|jdusJ|jjtjtjhvSr)rHrsuiterrbfuncdefrrrPrPrQis_parent_function_or_classsrcCs|jtjtjtjhvSr)rHrrr async_funcdefrrPrPrQis_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) rbrrrstriprrTrHrrrDEDENT is_stub_bodyrrPrPrQ 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[rPrPrQrszis_stub_body..) rSrrHrrrrTrrrrr)rDrUrPrPrQr s    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^) rSrrHrrrTrr{rcr|)rDfirstrrPrPrQis_atom_with_invisible_parenss   rcCst|pt|Sr) is_empty_lpar is_empty_rparrrPrPrQ is_empty_par.srcC|jtjko |jdkSNr^)rHrr{rcrrPrPrQr2rrcCrr)rHrr|rcrrPrPrQr6rrcCsP|j}|j}|j}t|tjko&|dkr|r|jtjkp&|dko&|o&|jtjkS)z9Return True if the given leaf starts an import statement.rafrom) rbrHrcboolrrr import_namer)r[rrrrPrPrQ is_import:s 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) rrHrrrcrbr with_stmtASYNC next_siblingrrPrPrQis_with_or_async_with_stmtHs    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. )rrHrrrbr async_stmtrrrPrPrQis_async_stmt_or_funcdefVs  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:)rHrcrrdr startswithr[rrrPrPrQis_type_commentcsrcCs"|j}|j}|tjthvot|S)zGReturn True if the given leaf is a type comment with ignore annotation.)rHrcrrdris_type_ignore_comment_stringrrPrPrQis_type_ignore_commentmsr rccCs |dS)zSReturn True if the given string match with type comment with ignore annotation.z# type: ignore)r)rcrPrPrQrts r)visiblerbrUr 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|rrrrrrr)rbrUr rrrrindexrrPrPrQwrap_in_parentheseszs 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)rrTrHrr{r|)rDrwrappedrrPrPrQrs  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)rHrr{rcr|rrPrPrQensure_visibles    rnlcC |jtjkSr)rHrrrrPrPrQr rcCrr)rHrr{rrPrPrQ is_lpar_tokenrrcCrr)rHrr|rrPrPrQ is_rpar_tokenrrcCrr)rHrrrrPrPrQis_string_tokenrrcCrr)rHrrrrPrPrQis_number_tokenrrcCsP|j}|dur&|jr|jjtjkrdS|jr|jjtjkrdS|j}|dusdS)z6Returns whether this leaf is part of type annotations.NTF)rbrirHrRARROWrtname)r[rrPrPrQis_part_of_annotationsrcC&t|tr|S|js dSt|jdS)z,Returns the first leaf of the ancestor node.Nr)rSrrT first_leafrrPrPrQr rcCr)z+Returns the last leaf of the ancestor node.Nr)rSrrT last_leafrrPrPrQrrrcCsJ|}|jr#|jjr#||jjdur#|j}|jr#|jjr#||jjdus|S)zGReturns the furthest ancestor that has this leaf node as the last leaf.r)rbrT)r[rDrPrPrQ furthest_ancestor_with_last_leafs r )r)F)rYsystypingrrrrrrrr r version_infor typing_extensionsmypy_extensionsr black.cacher black.moderr black.stringsrrblib2to3rblib2to3.pgen2rblib2to3.pytreerrrr initializepython_symbolsr__annotations__rrZintLeafIDNodeTyperrrrif_stmt while_stmtfor_stmttry_stmtrrrr match_stmt case_blockrrrIr"LESSGREATEREQEQUALNOTEQUAL LESSEQUAL GREATEREQUALr#VBAR CIRCUMFLEXAMPER LEFTSHIFT RIGHTSHIFTPLUSMINUSrsSLASH DOUBLESLASHPERCENTrxTILDErr$r%r&rmrnrzrqrpr'rr listmakerrtestlist_star_expr subject_exprpatternr(testlambdefor_testand_testnot_test comparisonrurrrrrtermrrr)r tname_starr*r:testlistexprlistr;r{r|r~RSQBLBRACERBRACEr<rkeysr=valuesr>r?rkr@rrCrrJrrrjrrtrrrrrrrrrrrrrrrvrrrrrrrrrrrrrr rrrrrrrrrrrrr rPrPrPrQsD,                 "j"        %