o ^iB|@sUdZddlZddlmZddlmZmZmZmZm Z m Z ej dkr)ddlm Z nddl m Z ddlmZddlmZdd lmZmZdd lmZmZdd lmZdd lmZdd lmZmZmZm Z e!eej"Z#ee$d<e dZ%e eefZ&e'Z(e'Z)ej*ej+ej,hZ-ee$d<e#j.e#j/e#j0e#j1e#j2e#j3e#j4e#j5e#j6e#j7h Z8ee$d<dZ9ee$d<dej:e9<ddhZ;ee$d<ejej?ej@ejAhZBee$d<ejCejDejEejFejGejHejIejJejKejLejMejNejOejPhZQee$d<ejJejPhZRee$d<eRejKhBZSee$d<e#jTe#jUe#jVe#jWe#jXhZYee$d<e#jZe#j[e#j\e#j]e#j^e#j_e#j`hZaee$d<e#jbe#jce#jde#jee#jfe#jge#jhe#jie#jje#jke#jle#jme#jVe#jne#joe#jphZqee$d<e#jre#jshZtee$d<hdZuee$d <e#jve#j^e#jwhZxee$d!<ejyejzej{ej|ej}ej~iZee$d"<eeZee$d#<eeZee$d$<eeBZee$d%<eeje9ejejejejejhBZee$d&<d'Zed(d)Gd*d+d+ee%Zd,ed-ed.ed/efd0d1Zdd3e'd4ed5ed/efd6d7Zd8ee&d/eefd9d:Zd8ee&d;eee)d/efdd?Zd@edAe&d/ee&fdBdCZdDe&dEe&d/dfdFdGZd,ed/e&fdHdIZd8e&d/eefdJdKZd8e&d/efdLdMZd8ed/efdNdOZd8e&d/efdPdQZd8e&d/efdRdSZd8e&d/efdTdUZd8e&d/efdVdWZd8e&d/efdXdYZd8e&d/efdZd[Zejyejzffd\ed]ed^eed_ee'e'fd/ef d`daZd8e&d/efdbdcZdd8e&deed/efdfdgZd8e&d/efdhdiZd8e&d/efdjdkZd,edlee)d/efdmdnZd8ed/efdodpZd8ed/efdqdrZd8e&d/efdsdtZd8ed/efdudvZd8ed/efdwdxZd8ed/efdydzZd8e&d/efd{d|Zd8e&d/efd}d~Zd,ed/efddZd,ed/efddZd,ed/efddZd,ed/efddZd,ed/efddZd,ed/efddZd,ed.ed/efddZded.ed/efddZd,ed.ed/efddZded.ed/efddZd(ddede&ded/dfddZd8e&d/ee&fddZd,ed/dfddZded/e efddZded/e efddZded/e efddZded/e efddZd,ed/edfddZd,ed/efddZd8e&d/eefddZd8e&d/eefddZd,ed/e&fddZd8e&de'd/efddZdS)z> blib2to3 Node/Leaf transformation-related utility functions. N)Iterator)FinalGenericLiteralOptionalTypeVarUnion) ) 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)selfrBnamevisitfrNP/var/www/html/stock_analysis/be/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) isinstancerchildrenrP)rKrBchildrNrNrOrJs   zVisitor.visit_defaultN) __name__ __module__ __qualname____doc__LNrrrPrJrNrNrNrOrAsrAleafcomplex_subscriptmoderCc Csd}d}d}|j}|j}|j}|tvr|S|tjkr|S|dus'Jd||tjkr9|jtjtj tj hvr9|S|tj krI|jtj tj fvrI|S|j} | st|} | rZ| jtvr\|S|tjkru| jtjkri|S| jtjkrs|ss|S|S| jtjkr| jr| jjtjtjtjtjhvr|S| jjtjkr| jSn|| jtjkrt| tjkrt| jtj tjfvr|S| jtvrt| tt Bdr|SnR| jtjkr| jr| jjtjtj hvr|r|S|Sn8| jr| jjtj!kr| jt"vr|S| jtj#kr|jr|jjtj$kr|Sn| jtvr |S| jtj%kr|S|jtjtjhvr-| r)| jtjkr+|S|S|jtjkrB| r@| jtjkr@|S|S|jtjkrs| sN|S|tjkr^| jt&vr\|S|S| jtjkrh| jS| jtjkrq|S|S|jt&vr| st|} | r| jtjkr|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| jtj#ks| jtj*kr|S|S|jtj-kr>|tj(kr0|S| r<| jtj(kr<|S|S|jtjtj hvrw| sa|jdusUJd|jjtj kr_|S|S|tj.ksn| jtj.krp|S|su|S|S|jtj/kr| r|tj*kr|S|S|jtj0kr| r| jtj1kr|S|S|jtj!tjhvr| st|} | r| jtvr|S| j} | dusJ| jtjkr| jtjtj hvr|S| jtjkr| jtjkr|S|S|tj2tj3tj4hvr|S|S|jtj5kr0|tj*kr| r| jtj*kr|S|S|tj2kr.|dkr"|S| r.| jtj*kr.|S|S|jtj kr9|S|jtj6krH|tjkrH|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)7rFparentvaluer>rCOMMENTCOLONr subscript subscriptlistsliceopLBRACEfstring_replacement_fieldtstring_replacement_field prev_siblingpreceding_leafr;COMMAEQUALarglistargument parameters varargslist typedargslistprefixSTAR parent_type star_expr tname_starr$ is_varargr%r&factorr"AT decoratorBANGr(trailerLPARRPARDOTLSQB dotted_nameclassdef COLONEQUALatom dictsetmaker DOUBLESTARNAMENUMBERSTRING import_from except_clause) rYrZr[NOSPACE DOUBLESPACEtpvprevprevp prevp_parentrNrNrO whitespaces          &    ~v ofc YV"J C4/*    r nl_count form_feed empty_linecCs |r ||dd|S||S)z$Generate a normalized prefix string. rN)rrrrNrNrOmake_simple_prefixsrrBcCsR|r'|j}|r"t|tr|Sz t|dWSty!YdSw|j}|sdS)z3Return the first leaf that precedes `node`, if any.N)rjrQrlistleaves IndexErrorr`)rBresrNrNrOrks   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)rFprev_siblings_arerj)rBrrNrNrOrs rcCs|dus |jdur dS|jjS)z| Returns: @node.parent.type, if @node is not None and has a parent. OR None, otherwise. N)r`rFrBrNrNrOrusruancestor descendantcCs*|}|r|j|kr|j}|r|j|ks |S)z:Return the child of `ancestor` that contains `descendant`.)r`)rrrBrNrNrO 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)r`remove insert_child)rrr` child_idxrNrNrO 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)rsr`rRrFr file_inputrjr=)rY same_prefix containerr`rNrNrO container_ofs&  rcCs&t|tr|S|jrt|jdSdS)z(Returns the first leaf of the node tree.rN)rQrrR first_leaf_ofrrNrNrOrs rcCs|jtjtjtjtjhvS)z?Whether node is an arithmetic or a binary arithmetic expression)rFr arith_expr shift_exprxor_exprand_exprrrNrNrO is_arith_likes rcCst|tr|jtjkr dSt|j}t|drdS|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)rQrrFrrrraset intersectionr`r simple_stmtrjrrNEWLINEINDENTrprc)rBrsrNrNrO is_docstring(s0    rcCs>|jtjkot|jdko|jdjtjko|jdjtjkS)z+Return True if `node` holds an empty tuple.rr)rFrrlenrRrr~rrrNrNrOis_empty_tupleHs  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) rFrrunwrap_singleton_parenthesis testlist_gexprrRrrlr9rBgexprNrNrO is_one_tupleRs    rcCs4|jtjkrdSt|}|dus|jtjkrdSdS)z$Return True if `node` holds a tuple.FNT)rFrrrrrrNrNrOis_tuplebs rcCD|jtjkrdSt|}|dus|jtjkrdStdd|jDS)zDReturn True if `node` holds a tuple that contains a walrus operator.FNcs|] }|jtjkVqdSN)rFrnamedexpr_test.0rSrNrNrO uz-is_tuple_containing_walrus..rFrrrranyrRrrNrNrOis_tuple_containing_walrusm rcCr)zBReturn True if `node` holds a tuple that contains a star operator.FNcsrr)rFrrvrrNrNrOrrz+is_tuple_containing_star..rrrNrNrOis_tuple_containing_starxrrcCr)z(Return True if `node` holds a generator.FNcsrr)rFr old_comp_forrrNrNrOrrzis_generator..rrrNrNrO is_generatorrropeningclosingrbracketsc 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) rF bracket_depth enumerate LookupErrorrrlr`rrnrr) rrrrdepth_opening_indexrYcommasrrNrNrOis_one_sequence_betweens4   rcCst|}|duo |jtjkS)z7Return True iff `node` is of the shape ( test := test )N)rrFrr)rBinnerrNrNrOis_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 ) rFrr}rrRrrrr~r)rBrrNrNrOis_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) rFrrrpowerrRallmaprrrrNrNrOis_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 ) rFr yield_expr is_name_tokenrarrrRrr~ris_yield)rBlparexprrparrNrNrOrs   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)rFr$r`rrv)rYr^rrNrNrOrxs  rxcC |jtjkS)z&Return True if the node is an f-string)rFrfstringrrNrNrO is_fstrings rcCs:t|t|jd}ttj||jd}|pd|_|S)z:Converts an fstring or tstring node back to a string node.N)rsr)rHrrsrrr get_linenolineno)rBstring_without_prefix string_leafrNrNrOfstring_tstring_to_stringsrcCsDt|trt|rt|}n t|tr|}ndSt|jo!d|jvS)zKReturn True if `leaf` is a multiline string that actually spans many lines.Fr)rQrrrrrra)rBrYrNrNrOis_multiline_string$s   rcCs8|jtjtjhvs J|jdusJ|jjtjtjhvSr)rFrsuiterr`funcdefrrrNrNrOis_parent_function_or_class0srcCs|jtjtjtjhvSr)rFrrr async_funcdefrrNrNrOis_function_or_class7rcCs|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) r`rrsstriprrRrFrrrDEDENT is_stub_bodyrrNrNrO is_stub_suite;s   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)rrYrNrNrOr_szis_stub_body..) rQrrFrrrrRrsrrr)rBrSrNrNrOrRs    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\) rQrrFrrrRrr~rar)rBfirstrrNrNrOis_atom_with_invisible_parenscs   rcCst|pt|Sr) is_empty_lpar is_empty_rparrYrNrNrO is_empty_parusr cC|jtjko |jdkSNr\)rFrr~rar rNrNrOryrrcCr r )rFrrrar rNrNrOr }rr cCsP|j}|j}|j}t|tjko&|dkr|r|jtjkp&|dko&|o&|jtjkS)z9Return True if the given leaf starts an import statement.r_from) r`rFraboolrrr import_namer)rYrrrrNrNrO is_imports 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) rrFrrrar`r with_stmtASYNC next_siblingr rNrNrOis_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. )rrFrrr`r async_stmtrr rNrNrOis_async_stmt_or_funcdefs  rcC$|j}|j}|tjthvot||S)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.)rFrarrbris_type_comment_stringrYr[rrrNrNrOis_type_commentsrracCs<tj|vr|do|ddd}|S|d}|S)N#rztype:z# type:)rstandardize_type_comments startswithlstriprar[is_validrNrNrOrs   rcCr)zGReturn True if the given leaf is a type comment with ignore annotation.)rFrarrbris_type_ignore_comment_stringrrNrNrOis_type_ignore_comments r$cCs@tj|vrt||o|dddd}|S|d}|S)zSReturn True if the given string match with type comment with ignore annotation.r6rignorez# type: ignore)rrrsplitr rr!rNrNrOr#s   r#)visibler`rSr'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~rrsrrrrr)r`rSr'rrrsindexrrNrNrOwrap_in_parenthesess r+cCs>t|jdkr dS|j\}}}|jtjkr|jtjksdS|S)zqReturns `wrapped` if `node` is of the shape ( wrapped ). Parenthesis can be optional. Returns None otherwiser N)rrRrFrr~r)rBrwrappedrrNrNrOrs  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)rFrr~rarr rNrNrOensure_visibles    r-nlcCrr)rFrrr.rNrNrOr rcCrr)rFrr~r/rNrNrO is_lpar_tokenr0r1cCrr)rFrrr/rNrNrO is_rpar_tokenr0r2cCrr)rFrrr/rNrNrOis_number_token r0r3)rCparamNcCsP|j}|dur&|jr|jjtjkrdS|jr|jjtjkrdS|j}|dusdS)zr5rArrHrrrkrrrurrrrrrrrrrrrtuplerrrrrrxrrrrrrrrr rr rrrrrr$r#r+rr-rr1r2r3r7r8r:r<r=r?rNrNrNrOsd                    "s"          %