yIfddlmZddlZddlZddlZddlZddlmZddlm Z m Z ddl m Z ddl mZmZmZmZmZddlZddlmZmZddlmZdd lmZdd lmZdd lmZdd lmZdd l m!Z!m"Z"m#Z#erddl$m%Z%eej&ej'ej(ej)fZ*ddhZ+e,dZ-e,dZ.e,dZ/d-dZ0d.dZ1d/d"Z2d0d$Z3d0d%Z4d0d&Z5d0d'Z6d1d(Z7Gd)d*eZ8Gd+d,ej9Z:dS)2) annotationsN)Iterator)cached_propertyreduce)Pattern) TYPE_CHECKINGAny NamedTupleUnioncast)basesnodes)UninferableBase)checkers)utils)_loop_exits_early)node_frame_class)HIGH INFERENCE Confidence)PyLinterzitertools.countzitertools.cycle)quitexit)zthreading.lock.acquirezthreading._RLock.acquirezthreading.Semaphore.acquirez*multiprocessing.managers.BaseManager.startz*multiprocessing.managers.SyncManager.start)z_io.openzpathlib.Path.openz codecs.openzurllib.request.urlopenztempfile.NamedTemporaryFileztempfile.SpooledTemporaryFileztempfile.TemporaryDirectoryztempfile.TemporaryFilezzipfile.ZipFilezzipfile.PyZipFilezzipfile.ZipFile.openzzipfile.PyZipFile.openztarfile.TarFileztarfile.TarFile.openz(multiprocessing.context.BaseContext.Poolzsubprocess.Popenif_nodenodes.Ifreturning_node_class nodes.NodeNGreturnboolcDtfd|jDS)Nc38K|]}t|VdSN isinstance).0noders c/var/www/piapp/venv/lib/python3.11/site-packages/pylint/checkers/refactoring/refactoring_checker.py z4_if_statement_is_always_returning..Ds.OO$z$ 455OOOOOOanybody)rrs `r'!_if_statement_is_always_returningr-As* OOOO',OOO O OOr)r& nodes.TrycDtfd|jDS)z'Detect if all except statements return.c3XK|]$}tfd|jDV%dS)c38K|]}t|VdSr"r#)r%childrs r'r(zB_except_statement_is_always_returning...Ls. N NJu2 3 3 N N N N N Nr)Nr*)r%handlerrs r'r(z8_except_statement_is_always_returning..KsV  N N N N N N NNNr))allhandlers)r&rs `r'%_except_statement_is_always_returningr6Gs? }  r)tokenslist[tokenize.TokenInfo]indexintc~}|jtjkrdStjdzd}d}|D]B}|jd|jdkr$d}|jtjtjfvrdSC|sdSd fd }|}dd htfd |DS) aCheck if the given token is a trailing comma. :param tokens: Sequence of modules tokens :type tokens: list[tokenize.TokenInfo] :param int index: Index of token under check in tokens :returns: True if the token is a comma which trails an expression :rtype: bool FNrTrr:cttdD]!\}}|jtjkr|z cS"dS)z5Get the index denoting the start of the current line.Nr) enumeratereversedtypetokenizeNEWLINE)subindextokenr9r7s r'get_curline_index_startz3_is_trailing_comma..get_curline_index_startlsY(&%.)A)ABB ( (OHezX---x''''.qr)yieldc3<K|]}d|jvp|jvVdS)=N)string)r% prevtokenexpected_tokenss r'r(z%_is_trailing_comma..vsL  yF9#3#Fr))rr:) exact_typerACOMMA itertoolsislicestartr@rBCOMMENTr+) r7r9rD left_tokensmore_tokens_on_lineremaining_tokenrE curline_startrKs `` @r'_is_trailing_commarVQs  5ME 8>))u"6519d;;K&   #u{1~ 5 5"& #H,N+OOOuu u,+--M)O  e 34  r) nodes.Callc|}t|tjtjtjfsdS|jdkptj |dS)NF __enter__zcontextlib.contextmanager) framer$r FunctionDefastroid BoundMethod UnboundMethodnamerdecorated_with)r&rZs r'_is_inside_context_managerra|sf JJLLE  !7#68MN  u : $ (< *))r)c|}|D]%}||urnt|tjrdS&dS)NTF)rZnode_ancestorsr$rReturn)r&rZparents r'_is_a_return_statementrfs] JJLLE%%'' U?? E fel + + 44  5r)c|}|}||krlt|tjrE|jddj}|jddj}||jcxko|kncS|j}||kldS)zChecks if one of the node's parents is a ``nodes.With`` node and that the node itself is located somewhere under its ``items``. rF)rZr$rWithitemslinenotolinenore)r&rZcurrent items_start items_ends r'_is_part_of_with_itemsrps JJLLEG U   guz * * ;!-*1-4K b)!,5I$+:::::::: :. U   5r)ctd}t|jtjsdSt j|jj}|sdS||vS)zChecks if a call that could be used in a ``with`` statement is used in an alternative construct which would ensure that its __exit__ method is called. )z'contextlib._BaseExitStack.enter_contextz"contextlib.ExitStack.enter_contextF) frozensetr$rerCallr safe_inferfuncqname)r&callables_taking_care_of_exitrus r'_will_be_released_automaticallyrxsl%. %%! dk5: . .u  DK, - -D u ::<<8 88r)c<t|jtjr||jjvSt|jtjr||jjkSt|jtjtjfrt|jSdS)zCheck whether use of a variable is happening as part of the left-hand side of an assignment. This requires recursive checking, because destructuring assignment can have arbitrarily nested tuples and lists to unpack. F) r$rerAssigntargets AugAssigntargetTupleList_is_part_of_assignment_targetr&s r'rrs$+u|,,+t{***$+u//*t{)))$+ UZ899:,T[999 5r)cVeZdZUdZiZded<iZded<iZded<ddZdd Z dd Z dS)ConsiderUsingWithStackzzStack for objects that may potentially trigger a R1732 message if they are not used in a ``with`` block later on. dict[str, nodes.NodeNG] module_scope class_scopefunction_scoper!Iterator[dict[str, nodes.NodeNG]]c#>K|j|j|jfEd{VdSr")rrrselfs r'__iter__zConsiderUsingWithStack.__iter__s4')94;LMMMMMMMMMMr)rZ1nodes.FunctionDef | nodes.ClassDef | nodes.Modulect|tjr|jSt|tjr|jS|jS)zd?d@dAdBdCdDdEdFdGdHdIdJdKdLdMdNdOdPdQZdRdSdTdUdVdWfdXdYdZd[d\dWfd]d^d_d`dadWffZd fdf ZddgZddhZ e ddjZ e ddnZ ddpZddrZdduZejdvddyZejddzdd|ZeZddZejddddddZejdddZejddvddZddZddZddZddZddZe ddZddZ ddZ!ejdddzdddddd ddZ"ddZ#ejdddZ$ddZ%ejddddvddZ&ejdvddZ'ejdd dZ(d dZ)e d!dZ*d"dZ+d"dZ,ejdddddddvddd d"dZ-ejdd#dZ.e d$d„Z/d"dÄZ0d"dĄZ1d"dńZ2d%dDŽZ3d&dʄZ4d'd̈́Z5e d(dЄZ6d)dфZ7d)d҄Z8d)dӄZ9e d*dׄZ:d+dلZ;d)dڄZ<ejdddddߦd)dZ=e d,dZ>d-dZ?ejddddvd.dZ@ejdddd-dZAd.dZBd"dZCd"dZDd"dZEe d/dZFd0dZGd1dZHejdd2dZIejdddd3dZJd3dZKe d,dZLe d4dZMddZNddZOddZPd5dZQd6dZRe d6dZSd7dZTddZUd8dZVd8dZWd9d ZXd:d ZYxZZS(;RefactoringCheckerzLooks for code which can be refactored. This checker also mixes the astroid and the token approaches in order to create knowledge about whether an "else if" node is a true "else if" node, or an "elif" node. refactoringR1701)z?Consider merging these isinstance calls to isinstance(%s, (%s))consider-merging-isinstancezGUsed when multiple consecutive isinstance calls can be merged into one.R1706)zConsider using ternary (%s)consider-using-ternaryz=Used when one of known pre-python 2.5 ternary syntax is used.R1709)z*Boolean expression may be simplified to %ssimplify-boolean-expressionz=Emitted when redundant pre-python 2.5 ternary syntax is used.R1726)z0Boolean condition "%s" may be simplified to "%s"simplifiable-conditionz:Emitted when a boolean condition is able to be simplified.R1727)z3Boolean condition '%s' will always evaluate to '%s'condition-evals-to-constantzGEmitted when a boolean condition can be simplified to a constant value.R1702zToo many nested blocks (%s/%s)too-many-nested-blockszvUsed when a function or a method has too many nested blocks. This makes the code less understandable and maintainable. old_names)R0101zold-too-many-nested-blocksR1703z(The if statement can be replaced with %ssimplifiable-if-statementzz:Maximum number of nested blocks for function / method body)defaultr@metavarhelpznever-returning-functions)zsys.exitzargparse.parse_errorcsvzzComplete name of functions that never returns. When checking for inconsistent-return-statements if a never returning function is called then it will be considered as an explicit return statement and no message will be printed.z%suggest-join-with-non-empty-separatorTynzzLet 'consider-using-join' be raised when the separator to join on would be non-empty (resulting in expected fixes of the type: ``"- " + " - ".join(items)``)linterrrrct|i|_t|_|t |_d|_dSNF) super__init__ _return_nodesr_consider_using_with_stack_initset_never_returning_functions&_suggest_join_with_non_empty_separator)rr __class__s r'rzRefactoringChecker.__init__sX    <>*@*B*B' 47EE'z=RefactoringChecker._check_simplifiable_if..bs=$$$fe&677$ $$$r)cPg|]#}t|tj|j$Srrrs r'rz=RefactoringChecker._check_simplifiable_if..gs=###fe&677# ###r)z'var = bool(test)'rr&args) rlenrr,r$rrdrrzr{sortedr add_message) rr& first_branch else_branchfirst_branch_is_boolelse_branch_is_bool reduced_tofirst_branch_targetselse_branch_targetss r'_check_simplifiable_ifz)RefactoringChecker._check_simplifiable_ifDs    % %  F t{  q C NNa$7$7 Fy| k!n lEL 1 1 k5<88 #'#6#6|#D#D "&"5"5k"B"B .JJ  el 3 3 k5<88 $$*2$$$ ##)1###  ( /B *++v6I/J/JJJ#'#6#6|#D#D "&"5"5k"B"B -JJ F# +>  F!'  F 44zmTTTTTr)r7r8cHt|D]\}}|d}|dkr2|j|d||dzdgE|jdr2t ||r"|d|jddS)Nr<elifrr)line)r>rextendris_message_enabledrVr$rP)rr7r9rD token_strings r'process_tokensz!RefactoringChecker.process_tokenss%f-- N NLE5 8Lv%% ""E!HfUQY.?.B#CDDDD//& N$VU33 N  !7ek!n MMM N Nr)r_ nodes.Modulecl||jj|dSr")#_emit_consider_using_with_if_neededrrrrr5s r' leave_modulezRefactoringChecker.leave_modules8 00  + 8    r)rr.c||||||dSr")_check_nested_blocks_check_superfluous_else_return_check_superfluous_else_raiserr&s r' visit_tryzRefactoringChecker.visit_trysD !!$''' ++D111 **400000r) name_nodenodes.AssignNamec|jr!|j|jrdS|jsdS|}t |t jsdS|j t j t j fD]0}|j|jkr| d||jf1dS)N skip_klassrr ) r matchr_rkscoper$rr[r!nodes_of_classrLambdar$)rrArGdefined_arguments r'$_check_redefined_argument_from_localz7RefactoringChecker._check_redefined_argument_from_locals ? t44Y^DD  F  F!!%!233  F % 9 9  %,!:! !     $ 66  3"#.*!   r)rrr nodes.Forc|||||||jt jD]}||dSr")r<$_check_unnecessary_dict_index_lookup$_check_unnecessary_list_index_lookupr}rHrrrK)rr&r_s r' visit_forzRefactoringChecker.visit_fors !!$''' 11$777 11$777K..u/?@@ < > @ @99$???? @ @ @r)msg_idstrrrct|tjr |jrdS|jsdS||rdSt|tjrt||s1t|tjr^|jsYt||rK|jd}|j |j f|j vrd}nd}| |||tdSdSdSdS)Nr)r.z#remove the leading "el" from "elif")elsez2remove the "else" and de-indent the code inside itr&r! confidence)r$rTry finalbodyrrrr-r6rkrrr$r)rr&rZrrr!s r'_check_superfluous_elsez*RefactoringChecker._check_superfluous_elses, dEI & & 4>  F{  F    % %  F tUX & & L1$8LMM L tUY ' ' L N L 6dz0RefactoringChecker._check_superfluous_else_raise (++ u{,   r)cF||dtjS)Nrrd)rbrBreakr?s r'_check_superfluous_else_breakz0RefactoringChecker._check_superfluous_else_breakrgr)cF||dtjS)Nrrd)rbrContinuer?s r' _check_superfluous_else_continuez3RefactoringChecker._check_superfluous_else_continues)++ +%.,   r)node_ar node_bct|tjr*t|tjr|j|jkSt|tjr*t|tjr|j|jkSt|tjr*t|tjr|j|jkSdSr)r$rrVr_rrr)rnros r'_type_and_name_are_equalz+RefactoringChecker._type_and_name_are_equals fej ) ) .j.L.L .;&+- - fe. / / .J E$5 5  .;&+- - fek * * 0z&%+/N/N 0<6</ /ur)ct|jtjsdSt |jdkrdS|jd}t|tjrrt |jdjdkrOt|jdjdtjrt|j tj sdS|j j }| |j j |jj ddr | ||jjsdSttj|jj ddtjS)NFr<r)r$testrComparer"r,rzr{rr SubscriptslicerqopsleftrrtDict)rr&stmt slice_values r'_is_dict_get_blockz%RefactoringChecker._is_dict_get_block(s;$)U]33 5 ty>>Q  5y| tU\ * * DIaL())Q..49Q</2E4DEE/4:u77/5j&  ) )$**:DIM!JJ 5%*49=+;A+>??LLLr)c||}|r |js|d|dS|rt|jdkrt |jdt jr||jdjd|j djdrBt|jdjdkr!|d|dSdSdSdSdSdS)Nrrr<r) r|rr$r"r$rrzrqr{r,)rr& if_block_oks r'_check_consider_getz&RefactoringChecker._check_consider_getFs--d33  >t{ >   1  = = = = =  >DK  A%%4;q>5<88&-- A&q)49Q<+?+B& DKN*++q00   1  = = = = = > >%%%%%% 10r)rrrrrrcV||||||||||||||||dSr")r,r<r=r>rjrmr%_check_consider_using_min_max_builtinr?s r'visit_ifzRefactoringChecker.visit_ifUs ##D))) !!$''' ++D111 **4000 **4000 --d333   &&& 22488888r)c$||s|jrdSt|jdkrdSdd}|jd}t |d rt|jdkrdS|jd}t |jtj rXt |tj s>t |jj tj st |tj sdSt |d r|j }nt |d r|j}ndSt|jjdkrdS|jjd\}}||j}||jj } ||} | |krn| |krt#j|}ndS|| | fvrdS|d vr&|d |d|d} |d|| fdS|dvr&|d|d|d} |d|| fdSdS)zICheck if the given if node can be refactored as a min/max python builtin.Nr<r&rrr[c t|tjr|jSt|tjr|jSt|tjrt|jS| S)z5Obtain simplest representation of a node as a string.) r$rrVr_ Attributeattrnamerr[r as_stringrs r' get_node_namezORefactoringChecker._check_consider_using_min_max_builtin..get_node_namexsn$ ++ !y $00 %}$$ ,, '4:&>>## #r)rr{r_r<==>z = min(r)r&rrr[)rrr"r,hasattrr{r$rsrrtrurxrzr_rrwrrget_inverse_comparatorr$) rr&rr,r}target_assignationoperatorright_statement body_value left_operandright_statement_valuer)s r'rz8RefactoringChecker._check_consider_using_min_max_builtinjs    % %   F ty>>Q   F $ $ $ $y|tY'' 3t|+<+<+A+A Fa ty%- 0 0 vu77 ty~u?? 4..   F 66 " " !'   VZ ( ( !'   F ty}   ! ! F$(IM!$4!/"]4:.. $}TY^44 - o > > - - -  "&8 8 83H==HH F 3\B B B F { " "%QQ.@QQJQQQ    ,4zm       $ $%QQ.@QQJQQQ    ,4zm       % $r)r nodes.IfExpc0||dSr")_check_simplifiable_ifexpr?s r' visit_ifexpzRefactoringChecker.visit_ifexps &&t,,,,,r)ct|jtjrt|jtjsdSt|jjt rt|jjt sdSt|jtjrd}nd}|jj|jjfdkrd|d}n!|jj|jjfdkrd}ndS| d||fdS) Nrsz bool(test))TF')FTz 'not test'rr ) r$r,rrrrrrsrtr$)rr&test_reduced_tor)s r'rz,RefactoringChecker._check_simplifiable_ifexps$)U[11  K: :   F$)/400  K t9 9   F di / / +$OO*O IOT[. /= @ @/_///JJiot{0 1] B B%JJ F 5D }UUUUUr)rrnodes.FunctionDefc4||jg|_||||g|j|j<||jj|jj dSr") %_emit_nested_blocks_message_if_neededr_check_consistent_returns_check_return_at_the_endrr_r8rrrr?s r'leave_functiondefz$RefactoringChecker.leave_functiondefs 2243FGGG  &&t,,, %%d+++(*49% 00  + :    '6<<>>>>>r)nodes.ClassDefc||jj|jjdSr")r8rrrr9s r'leave_classdefz!RefactoringChecker.leave_classdefsE 00  + 7    '399;;;;;r)r nodes.Raisec0||dSr")&_check_stop_iteration_inside_generatorr?s r' visit_raisezRefactoringChecker.visit_raises 33D99999r)c|}t|tjr|sdSt j|trdS|jsdSt j |j}|r&t|tj tj fsdS| |r|d|tdSdS)zICheck if an exception of type StopIteration is raised inside a generator.Nrr&r_)rZr$rr[ is_generatorrnode_ignores_exception StopIterationexcrtr Instancer+_check_exception_inherit_from_stopiterationr$r)rr&rZrs r'rz9RefactoringChecker._check_stop_iteration_inside_generators %!233 5;M;M;O;O  F  'm < <  Fx  Ftx(( *S5>5>*JKK  F  ; ;C @ @ W   44I  V V V V V W Wr)rnodes.ClassDef | bases.Instancec|tjdtfd|DS)zIReturn True if the exception node in argument inherit from StopIteration.z.StopIterationc3HK|]}|kVdSr")rv)r%_classstopiteration_qnames r'r(zQRefactoringChecker._check_exception_inherit_from_stopiteration..s1QQV6<<>>%88QQQQQQr))rEXCEPTIONS_MODULEr+mro)rrs @r'rz>RefactoringChecker._check_exception_inherit_from_stopiteration sB "'!8HHHQQQQswwyyQQQQQQr)rWct|jtjr|jrt|jdtjr|jjdkrh|jdj}t|tjrdSt|tj rt|j tj tj frt|j jdkrt|jtj tj frt|jjdkrt|j j\}}|jj\}}||kr,||krdSd}|||dS|jjdkr!d}|||dSdSdSdSdS)Nrdictr/rrrr)r$rurrVr!ListCompr_eltrsIfExpr,r~rr"eltsrrr$)rr&elementkey1value1key2value2 message_names r'/_check_consider_using_comprehension_constructorzBRefactoringChecker._check_consider_using_comprehension_constructors ty%* - - :  :49Q<88 : y~'')A,*guz22F w 44 "7<%+uz1JKK GL-..!33"7>EK3LMM4GN/00A55#*<#4LD&#*>#6LD&((DNN,<,<<<",,..&2B2B2D2DDDB   D 999995((A   D 99999? : : : : : ::)(r)cgd}t|tjr|jrt|jtjr|jj|vrt |jdkrt|jdtjr|jd dd}|j r2d|d}|dz }|d d|j Dz }|jj}|d vr| d |||f dS| d |||f dSdSdSdSdSdSdS) N)r+r4summaxminlisttupler<rrh(rrc3>K|]}|VdSr"r)r%kws r'r(zERefactoringChecker._check_consider_using_generator..Ls*,T,TR\\^^,T,T,T,T,T,Tr)>r4r+rr r) r$rrsrurVr_r"r!rrkeywordsjoinr$)rr& checked_call inside_comp call_names r'_check_consider_using_generatorz2RefactoringChecker._check_consider_using_generator7s LKK tUZ ( (   49ej11  ,..49~~""z$)A,'O'O""il4466qt< =U"4k"4"4"4K4'K499,T,Tdm,T,T,T#T#TTK IN ..$$)!'5% $$2!'5%/      /.#"""r)rrrrrrrrcV||||||||||||||||dSr")3_check_raising_stopiteration_in_generator_next_callr_check_quit_exit_call_check_super_with_argumentsr_check_consider_using_with_check_use_list_literal_check_use_dict_literalr?s r' visit_callzRefactoringChecker.visit_call[s @@FFF <.s.HHsz#uz22HHHHHHr)r<rrrr) r$rurrVr_r"r!r4rr$)rr& frame_classs r'rz.RefactoringChecker._check_super_with_argumentss$)UZ00 DINg4M4M F  NNa  HHdiHHHHH y| F**/555 >y| K$444 F /d;;;;;r)cd d}t|jtjrdSt |jdkrdSt j|j}t|tjr| dkr| }t |jd k}t|tjri| rW|sWt j |ts?||jds+|d |t dSdSdSdSdSdSdSdS) a Check if a StopIteration exception is raised by the call to next function. If the next value has a default value, then do not add message. :param node: Check to see if this Call node is a next function :type node: :class:`nodes.Call` paramrrrctj|}t|tjr|t vSdSr)rrtr$r rrvKNOWN_INFINITE_ITERATORS)rinferreds r'_looks_like_infinite_iteratorzmRefactoringChecker._check_raising_stopiteration_in_generator_next_call.._looks_like_infinite_iteratorsB'..H(EN33 D~~''+CCC5r)Nrz builtins.nextr<rr)rrrr)r$rurrr"r!rrtr[rvrZrrrr$r)rr&rrrZhas_sentinel_values r'rzFRefactoringChecker._check_raising_stopiteration_in_generator_next_calls     di 1 1  F ty>>Q   F#DI.. x!2 3 3   O33JJLLE"%TY!!3 5%"344 &&(( + 4T=II  65dilCC   +$9!  33          r)NodesWithNestedBlocksct|tjsdS|jdd}|j|kr |g|_nt |jD](}||jkrn|j)t|tjr5| |r |jr|j|j |t|t|jkr| |dSdS)z-Update and check the number of nested blocks.N) r$rGrr[rrer?poprrappendr"r)rr& nested_blocks ancestor_nodes r'r<z'RefactoringChecker._check_nested_blockssC $**,,(9::  F+AAA. ;$**,, & &#'&D  "*$*=!>!> * *  DK//E#''))))$)) .d.B.B4.H.H .&.'++---   & &t , , , }  D$7 8 8 8 8  6 6} E E E E E 9 8r)rlist[NodesWithNestedBlocks]ct||jjjkr>|d|dt||jjjfdSdS)Nrrr )r"rrmax_nested_blocksr$)rrs r'rz8RefactoringChecker._emit_nested_blocks_message_if_neededsr }   2 D D D   ("1%-(($+*<*NO       E Dr)rrcb|D]}|d|dSNrr)valuesr$)rrr&s r'r8z6RefactoringChecker._emit_consider_using_with_if_neededsBLLNN ? ?D   2  > > > > ? ?r) nodes.BoolOpdict[str, set[str]]cttjt}|jD] }t |t jrt|jdkr6tj |j }|rtj |sf|j dkrr|jd}|jd}||vr|t |t jrd|D}n|g}|||"fd|DS)aFGet the duplicated types from the underlying isinstance calls. :param nodes.BoolOp node: Node which should contain a bunch of isinstance calls. :returns: Dictionary of the comparison objects from the isinstance calls, to duplicate values from consecutive calls. :rtype: dict r/r$rr<c6g|]}|Srr)r% class_types r'rzCRefactoringChecker._duplicated_isinstance_types..!s1/9J((**r)c$i|] \}}|v || Srr)r%keyrduplicated_objectss r' zCRefactoringChecker._duplicated_isinstance_types..)s1   %3cEW>W>WC>W>W>Wr))r collections defaultdictr r$rrsr"r!rrtruis_builtin_objectr_raddr~iteredupdaterj)r& all_typescallrisinstance_objectisinstance_typeselemsrs @r'_duplicated_isinstance_typesz/RefactoringChecker._duplicated_isinstance_typess(+uu>Q3F3F' 22H 5#:8#D#D } ,, $ ! 6 6 8 8 #y|  I--"&&'8999*EK88 7=M=T=T=V=V*33556 ' ( / / 6 6 6 6    )2):):    r)c  |jdkrdS||}|D]K\}}td|D}|d||d|fLdS)z4Check isinstance calls which can be merged together.orNc3K|]}|VdSr"r)r%r_s r'r(zHRefactoringChecker._check_consider_merging_isinstance..4s"88D4888888r)rrr )oprrjr#r$r)rr& first_argsduplicated_name class_namesrXs r'"_check_consider_merging_isinstancez5RefactoringChecker._check_consider_merging_isinstance-s 7d?? F66t<< ,6,<,<,>,>   (O[88K88888E   -%tyy'7'78       r)cddd}|j|vst|jdkrdS|jD]}t|tjr8t|jdks |jdd||jvrdS|j|jddfD] }t|tjrdS!gg}}|jD]}t}|j|jddfD]v}t|tj tj fr'| | || w||td|}|sdSt!t#|d} t#t$j|}|| t|dkrd|n |dd z} |jd krd nd } |d || | | ft0dS)Nz==z!=)r!andr/r<rc,||Sr") intersection)abs r'z=RefactoringChecker._check_consider_using_in..Wsq~~a/@/@r)r,r!znot rr^)r#r"r r$rrtrwrxrsrrVrrrrrr#rr OrderedDictfromkeysremoverr$r) rr& allowed_opsr comparable variablesr  variable_setcommon_variablescommon_variable values_string maybe_nots r'_check_consider_using_inz+RefactoringChecker._check_consider_using_in;sz!$// 7+ % %T[)9)9A)=)= F[  Euem44 uy>>Q&&9Q<?+dg*>>>#j%)A,q/9   j%*55FFF  6 [ + +E55L#j%)A,q/9 6 6 j5:u*GHH= $$Z%9%9%;%;<<< j22445555   \ * * * *""@"@)LL  F!&6!7!788;k-66v>>?? o&&&-0[[A-=-= &)))6!9s? 'T//BBv   !9m<      r)c |jdkst|jdkrdSdd }tjd }|jD](}t |t jr |||)|D]}t|d |d }t|d }t|d }||kr ||kr| d|dSdS)a Check if there is any chained comparison in the expression. Add a refactoring message if a boolOp contains comparison like a < b and b < c, which can be chained as a < b < c. Care is taken to avoid simplifying a < b < c and b < d. r)r/Ncomparison_node nodes.Compareuses;collections.defaultdict[str, dict[str, set[nodes.Compare]]]rrc|j}|jD]\}}||fD]}d}t|tjr|j}n!t|tjr|j}|J|dvrL||ur"||d|t||ur!||d||dvrK||ur"||d|||ur!||d||}dS)Nr lower_bound upper_boundr) rxrwr$rrVr_rrr)r>r@rr right_operandoperandrs r'_find_lower_upper_boundszNRefactoringChecker._check_chained_comparison.._find_lower_upper_boundstsM+/L+:+> - -'- ,m<LLG E!'5:66. ' #GU[99. ' } ;.."l22 K 6::?KKKK$ 55 K 6::?KKK![00"l22 K 6::?KKKK$ 55 K 6::?KKK, + - -r)c<ttdS)N)rCrD)rrr)r'r.z>RefactoringChecker._check_chained_comparison..sceeDDr)rCrDrr)r>r?r@rArr) r#r"r rrr$rrtr+r$) rr&rGr@r>bounds num_sharednum_lower_boundsnum_upper_boundss r'_check_chained_comparisonz,RefactoringChecker._check_chained_comparisonis> 7e  s4;//!33 F - - - -:  #DD   ${ @ @O/5=99 @(($???kkmm  FVM2??}@UVVWWJ"6-#899 "6-#899 ,,,>N1N1N  !5D AAA   r)rr list[nodes.NodeNG]clg}|D]}d}t|tjds*t j|}|r|}t|ts| ||dk|kr|gcS|ptj |dkgS)a[Removes irrelevant values or returns short-circuiting values. This function applies the following two rules: 1) an OR expression with True in it will always be true, and the reverse for AND 2) False values in OR expressions are only relevant if all values are false, and the reverse for AND NFr!r)) nextrHrrVrrt bool_valuer$rrr)rr simplified_valuessubnode inferred_boolrs r'#_apply_boolean_simplification_rulesz6RefactoringChecker._apply_boolean_simplification_ruless13 ! !G M..uz::EBB : +G44:$,$7$7$9$9MmT22 !!((1111d"}44y   5!DU[U1B%C%C$DDr)bool_opcrt|}fd|D}|j|}t |t |krd_t |dkr|dSt j|}|||S)zAttempts to simplify a boolean operation. Recursively applies simplification on the operator terms, and keeps track of whether reductions have been made. crg|]3}t|tjr|n|4Sr)r$rBoolOp_simplify_boolean_operationr%r2rs r'rzBRefactoringChecker._simplify_boolean_operation..sR   eU\2200777    r)Tr<r)r get_childrenrUr#r"rcopypostinit)rrVchildren intermediateresultsimplified_bool_ops` r'rZz.RefactoringChecker._simplify_boolean_operations ,,..//    "    99'*lSS v;;X & &)-D & v;;!  !9 !Yw//##F+++!!r)ctj|sdSd|_||}|jsdSt |t jds@|d|| | fdS|d|| | fdS)zCheck if a boolean condition can be simplified. Variables will not be simplified, even if the value can be inferred, and expressions like '3 + 4' will remain expanded. NFrr r) ris_test_conditionrrZrPrHrrVr$r)rr&simplified_exprs r'_check_simplifiable_conditionz0RefactoringChecker._check_simplifiable_conditions &t,,  F%*"::4@@)  FO225:>>FF    -nn&&(A(A(C(CD         (nn&&(A(A(C(CD      r)rrrrrc||||||||dSr")r'r<rMrfr?s r' visit_boolopzRefactoringChecker.visit_boolopsZ //555 %%d+++ &&t,,, **400000r)nodes.NodeNG | Nonect|tjo[t|jdkoCt|jdtjot|jtjSNr<r)r$rrzr"r{rrrVrs r'_is_simple_assignmentz(RefactoringChecker._is_simple_assignmentsb tU\ * * 3DL!!Q& 34<?E,<== 34:uz22  r)cX|r&|sdS|||g}tfd|DsdStfd|DrdSd|D}d|D}|d|dkrK|dd|ddkr7j|d}|| dSdSdS) Nc3BK|]}|VdSr")rlr%r&rs r'r(z;RefactoringChecker._check_swap_variables.. s1LL4--d33LLLLLLr)c3*K|] }|jvVdSr")rros r'r(z;RefactoringChecker._check_swap_variables..s+IITtt00IIIIIIr)c2g|]}|jdjS)r)r{r_r%r&s r'rz.s!=== Q$===r)c&g|]}|jjSr)rr_rrs r'rz.s999T999r)rrhr<rr) next_siblingr4r+rrr$)rr& assignmentsrxrightmessages` r'_check_swap_variablesz(RefactoringChecker._check_swap_variabless[  "" $*;*;*=*=*J*J*L*L  FT..00$2C2C2E2E2R2R2T2TU LLLL LLLLL  F IIII[III I I  F=====99[999 7eBi  DHcrc $:$:  % , ,[ 9 9 9/G   W4  0 0 0 0 0 $:$:r)rrr nodes.AssigncZ||||dSr")!_append_context_managers_to_stack visit_returnr?s r' visit_assignzRefactoringChecker.visit_assigns2 ..t444 $r)c^||||jr||j\}}}ndSt d||fDrdSt j|d}|t|trdS| }|durd}| }nBd}| d| d| }| |||ft dS) Nc3JK|]}t|tjVdSr")r$rrtr%rs r'r(z2RefactoringChecker.visit_return..-s?  16Juem , ,      r)T)compare_constantsFrrz if z else r^) rx_is_and_or_ternaryr_and_or_ternary_argumentsr4rrtr$rrQrr$r) rr&cond truth_value false_valueinferred_truth_valuetruth_boolean_valuerw suggestions r'r|zRefactoringChecker.visit_return!sa ""4(((  " "4: . . -1-K-KDJ-W-W *D+{{ F   ;F :T       F$/ tTTT  ': /, , ' F2==?? % ' '3G$..00JJ.G'1133jj9I9IjjQ\QfQfQhQhjjJ t:-IVVVVVr)ct|rdSt|jdtjtjtjfrG|jdj}tj |j }|t|dsdS|j}n|jdg}|j g}td||fDrdSt||D]\}}t|tjs!tj |j}|rA|t"vs&t|tjtjfs~|j|}t|tjr|jn|j}||vr:||} t3j|| r|||<|d| |||<dS)Nrrc3@K|]}t|tVdSr")r$r)r%ns r'r(zGRefactoringChecker._append_context_managers_to_stack..Ps,KK!z!_--KKKKKKr)rr)rar$r{rr~rSetrrrtrrr+ziprsrurv CALLS_RETURNING_CONTEXT_MANAGERSr AssignAttrrrrZr_rr\ are_exclusiver$) rr& assigneesrr assigneerrvarname existing_nodes r'r{z4RefactoringChecker._append_context_managers_to_stackAs %d + +  F dl1o UZ'K L L " Q,I$TZ00E}GE6$:$:}ZFFa)Ij\F KK 67JKKK K K  F"9f55 # #OHeeUZ00 ' 33H >>##+KKK!(U-=u?O,PQQL3GG UUEh(899' &  % %g (}==%*E'N  )&!#E'NN7 # #r)cJt|st|rdS||j|vrdSt j|j}|r1t|tj tj tjfsdS|t vp*|t"vot%| }|r(t'|s|d|dSdSdSr )rarfrrrZr rrtrur$rr[rr r^rv$CALLS_THAT_COULD_BE_REPLACED_BY_WITHrrprxr$)rr&rcould_be_used_in_withs r'rz-RefactoringChecker._check_consider_using_withosB %d + + /Ed/K/K  F .BB fhh   F#DI.. z u(%.%:MN    F NN   D D   $DD5.t444  ! ?)H)N)N ?   2  > > > > > ? ? ? ?r)c|dkrktj|j}t |t jr:|js5|dkr| d|dSdSdSdSdS)z7Check if empty list is created by using the literal [].zlist()z builtins.listrrN) rrrtrur$rrr!rvr$rr&rs r'rz*RefactoringChecker._check_use_list_literals >>  x ' '' 22H(EN33 DDI D>>##66$$%7d$CCCCC ( ' D D D D66r)c|t|jtjr|jjdkrdSt j|j}t|tjrS| dkr=|j s8| d| |f|tdSdSdSdS)z1Check if dict is created by using the literal {}.rNz builtins.dictr)r!r&r_)r$rur\rVr_rrtrrrvr!r$_dict_literal_suggestionrrs r'rz*RefactoringChecker._check_use_dict_literals$)W\22 din6N6N F#DI.. x 0 0   O33I4   "33D99;$        3333r)cg}|jD]j}td|dkrnA||jvr7|d|jd|jk|jD]Y}td|dkrn0|d|jZd|}d|t|dkrdndd S) z)Return a suggestion of reasonable length.r@"z": z**{z, ... r0})rr"rkwargsrrrr)r&elementskeywordrs r'rz+RefactoringChecker._dict_literal_suggestions!} Q QG499X&&''2--dk)) OGK O OGM4K4K4M4M O OPPP{ > >G499X&&''2-- OO<!8!8!:!:<< = = = =YYx(( MJMS__r-A-ArMMMMr) str | Nonect|tjrtd|jSt|tjsdSd|jD}t|dks%t|djtjsdSt|jt|k}|r |j sdStd|djjS)z5Try to extract the name used in a concatenation loop.rNcFg|]}t|tj|Sr)r$rFormattedValuers r'rz;RefactoringChecker._name_to_concatenate..s:   j@T.U.U    r)r<r) r$rrVr r_ JoinedStrr r"rr)rr&r with_separatorss r'_name_to_concatenatez'RefactoringChecker._name_to_concatenates dEJ ' ' 1 di00 0$00 4  #{    v;;!  :fQiouz#J#J 4dk**S[[8  4#N 4L&)/"6777r) aug_assignnodes.AugAssignc|j}t|tjrt |jdkrdS|}t|tjsdSd|jD}|j dkot|j tj ot |jdkos|j j |voet|j tjoFt|j j to'||j |j j k}|r|d|dSdS)zWe start with the augmented assignment and work our way upwards. Names of variables for nodes if match successful: result = '' # assign for number in ['1', '2', '3'] # for_loop result += number # aug_assign r<NcPh|]#}t|tj|j$Srrrs r' z@RefactoringChecker._check_consider_using_join..s=   &%"233 K   r)z+=rr)rer$rrr"r,previous_siblingrzr{r#r}rr_rrr[rr$)rrfor_loopassignresult_assign_namesis_concat_loops r'_check_consider_using_joinz-RefactoringChecker._check_consider_using_joinsm$(EI.. #hm2D2Dq2H2H F**,,&%,//  F   .    MT ! T:,e.>?? THM""a' T!&*== T6<55  T 6<-s33  T ))**:;;x?SS   E   2  D D D D D E Er)rc0||dSr")rr?s r'visit_augassignz"RefactoringChecker.visit_augassigns ''-----r)rnodes.Comprehensionc||||||dSr") _check_unnecessary_comprehensionrNrOr?s r'visit_comprehensionz&RefactoringChecker.visit_comprehensionsF --d333 11$777 11$77777r)ct|jtjs. s/RR#JsE$455RRRRRRr)cg|] }|j Srr_rs r'rzGRefactoringChecker._check_unnecessary_comprehension.. s@@@38@@@r)c3LK|]}t|tj V dSr"rrs r'r(zFRefactoringChecker._check_unnecessary_comprehension..s1LL3:c5:666LLLLLLr)cg|] }|j Srrrs r'rzGRefactoringChecker._check_unnecessary_comprehension..s;;;#SX;;;r)cPg|]#}t|tj|j$Srrrs r'rzGRefactoringChecker._check_unnecessary_comprehension..s=%c5+;<<r)zdict(rzlist(zset(rr rrrr)"r$rer GeneratorExpr"ifs generatorsis_asyncDictComprrVrr}r~r4rr_rSetComprr+rrrtiterr\objects DictItemsruexprrrrr$) rr& expr_list target_listrr}r!rrus r'rz3RefactoringChecker._check_unnecessary_comprehensionsA t{E$6 7 7 48}}!!4;)**a//}0 F t{EN 3 3# 4;?EJ77# 4;,ej99# 4; 44 #  RRAQRRRRR # -t{/@/EFI@@t{/?@@@KK  enem%D E E ;?D$ ++  I D%+.. LL$)LLLLLF;;;;;  [+A.5Ffe&677  "&%+66 #);  K F  # # #&*D' 22H$+u~66 ::'/3<< :C  3 = = ? ?BBBDDK88 :Z%*>> :9 3 3 5 5888:DK77 :J%)== :8ty22447779   /dk!$+u~66 DK88 DK77    +[88 3 3 5 5888:      = $ # # #r)ct|tjo|jdkot |jdkot|jdtjot|jdtj oi|jdjdkoSt|jdjdtj o"t |jdjdkS)zReturns true if node is 'condition and true_value or false_value' form. All of: condition, true_value and false_value should not be a complex boolean expression r!r/rr<r))r$rrYr#r"r rs r'rz%RefactoringChecker._is_and_or_ternaryLs tU\ * * 04 0DK  A% 04;q>5<88 0t{1~u|<<<  0  A!U*  0 t{1~4Q7FFF  0DKN)**a/ r)/tuple[nodes.NodeNG, nodes.NodeNG, nodes.NodeNG]cP|jd}|jdj\}}|||fSrk)r )r&r condition true_values r'rz,RefactoringChecker._and_or_ternary_arguments]s/k!n $ A 5 :*k11r)ct|tjtj|j|j<dS)NrD)rrHrrdr[rr_r?s r'visit_functiondefz$RefactoringChecker.visit_functiondefes<(,    9J  K K) ) 49%%%r)cd|j|jD}|sdSt|t|j|jkr||rdS|d|dS)axCheck that all return statements inside a function are consistent. Return statements are consistent if: - all returns are explicit and if there is no implicit return; - all returns are empty and if there is, possibly, an implicit return. Args: node (nodes.FunctionDef): the function holding the return statements. c g|] }|j | Sr")r)r%_nodes r'rz@RefactoringChecker._check_consistent_returns..us&    @WE@W@W@Wr)Nrr)rr_r"_is_node_return_endedr$)rr&explicit_returnss r'rz,RefactoringChecker._check_consistent_returnsjs  #1$)<      F  C  ty )% %   ((..  F 9EEEEEr)ctfd|jD}|js|sdS|Stfd|jD}|o|S)zCheck if the If node ends with an explicit return statement. Args: node (nodes.If): If node to be checked. Returns: bool: True if the node ends with an explicit statement, False otherwise. c3vK|]3}t|tj|V4dSr"r$rr[r)r%_ifnrs r'r(z>RefactoringChecker._is_if_node_return_ended..sX  dE$566  & &t , ,      r)Fc3vK|]3}t|tj|V4dSr"r)r%_orers r'r(z>RefactoringChecker._is_if_node_return_ended..sX" " dE$566"  & &t , ," " " " " " r))r+r,r_has_return_in_siblings)rr&is_if_returningis_orelse_returnings` r'_is_if_node_return_endedz+RefactoringChecker._is_if_node_return_endeds           { #//55 u" "!" " " "  " " "    6#66r)c|jsdStj|sdStj|j}|%t |t st |dsdS|dd}tj ||}|t|ng}|rtfd|DSdS)zCheck if the Raise node ends with an explicit return statement. Args: node (nodes.Raise): Raise node to be checked. Returns: bool: True if the node ends with an explicit statement, False otherwise. TNpytypeF.rhc3BK|]}|VdSr"r)r%_handlerrs r'r(zARefactoringChecker._is_raise_node_return_ended..s1UUt11(;;UUUUUUr)) rris_node_inside_try_exceptrtr$rrrsplitget_exception_handlersrr+)rr&rexc_namer5s` r'_is_raise_node_return_endedz.RefactoringChecker._is_raise_node_return_endedsx 4.t44 4tx(( K#// 3)) 5::<<%%c**2./h??%-%94>>>r  VUUUUHUUUUU Utr)ct|tjrdSt|tjrM |jd}|rdSn#tj$rYnwxYwt|tj rI|j rt| ptfd|jDSt|tjr|St|tjr|St|tjrxd|D}t+||z }tfd|Dot-fd|DSt|tjr-t|j tjr|j jsdStfd|DS)zCheck if the node ends with an explicit return statement. Args: node (nodes.NodeNG): node to be checked. Returns: bool: True if the node ends with an explicit statement, False otherwise. Trc3BK|]}|VdSr"rr[s r'r(z;RefactoringChecker._is_node_return_ended..sJSS6;**511SSSSSSr)cFh|]}t|tj|Sr)r$r ExceptHandler)r%_childs r'rz;RefactoringChecker._is_node_return_ended..s;fe&9::r)c3BK|]}|VdSr"rr%rrs r'r(z;RefactoringChecker._is_node_return_ended..sB7=**622r)c3BK|]}|VdSr"rrs r'r(z;RefactoringChecker._is_node_return_ended..s1PPVd0088PPPPPPr)c3BK|]}|VdSr"rrs r'r(z;RefactoringChecker._is_node_return_ended..s1XX&4--f55XXXXXXr))r$rrdrsrur _is_function_def_never_returningr\InferenceErrorWhilersrQrr+rrfrrrr`r\rr4Assertrr)rr& funcdef_noder5all_but_handlers` r'rz(RefactoringChecker._is_node_return_endeds dEL ) ) 4 dEJ ' '  #y1133A6 88FF 4 )     dEK ( ( I((**J3DT3J3J/JsSSSS?C{SSSPP  dEK ( ( :33D99 9 dEH % % 70066 6 dEI & & Q"//11H "$"3"3"5"566AOAPQPPPPxPPPPP Q tU\ * * 49ek22 IO  4XXXXDDUDUDWDWXXXXXXs4A00BBc|}|r2t|tjrdS|}|2dS)zDReturns True if there is at least one return in the node's siblings.TF)rtr$rrd)r&rts r'rz*RefactoringChecker._has_return_in_siblingssX((**  7, 55 t'4466L 7ur)'nodes.FunctionDef | astroid.BoundMethodct|tjtjfre|jr^t|jtjr|jjdkp.t|jtjo|jj dkS | |j vS#ttf$rYdSwxYw)aReturn True if the function never returns, False otherwise. Args: node (nodes.FunctionDef or astroid.BoundMethod): function definition node to be analyzed. Returns: bool: True if the function never returns, False otherwise. NoReturnF)r$rr[r\r]returnsrrrVr_rvr TypeErrorAttributeErrorr?s r'rz3RefactoringChecker._is_function_def_never_returnings dU.0CD E E $, 4<998L)Z74dlEJ774L%3    ::<<4#BB B>*   55 s B((B=<B=ct|j|jdkrdSt|jdkrdS|jd}t |t jrd|j|d|dSt |jt j r'|jj|d|dSdSdSdS)a Check for presence of a *single* return statement at the end of a function. "return" or "return None" are useless because None is the default return type if they are missing. NOTE: produces a message only if there is a single return statement in the function body. Otherwise _check_consistent_returns() is called! Per its implementation and PEP8 we can have a "return None" at the end of the function body if there are other return statements before that! r<Nrhrr) r"rr_r,r$rrdrr$r)rr&lasts r'rz+RefactoringChecker._check_return_at_the_ends t!$), - - 1 1 F ty>>Q   Fy} dEL ) ) >z!  !1 =====DJ 44 >$*:J:R  !1 =====  > >  > >:R:Rr)nodes.For | nodes.Comprehensionc  t|jtjr*t|jjtjr|jjjdkrtj|jj}t|tj sdS|jjj }g}t|tj r|jn%t|j}t$jd|D}t+|ddu}|D]}|tjD]} t| jtjtjfs/| j} t|tj rt7| rdSt| jtjrdSt| tjrFt|jtjrZt?|jj dks=| j!|jj dj!ks|| j krt|tj r6| "| j!ddj#|j#krl|r<|$| |jj d d|%d | |jj d f t| tjrt|jtj&rVt| jtjr7|jj!| jj!ks|| j kryt|tj r@| j"| jj!ddj#|j#krtj| j}t|tj'r |jdkr|rT|$| d (| )d d di|%d | d (| )d d f |D]-} |%d | d| df (dSdSdSdS)z7Add message when accessing dict values by index lookup.rjNc3lK|]/}|tjtjfV0dSr"rHrrrr%r2s r'r(zJRefactoringChecker._check_unnecessary_dict_index_lookup..TsJ99CH$$ei%=>>999999r)r/rr<rh)r&variablerr 10)maxsplitr&r)*r$rrrsrurrrrtr\r]rrrr,rrer\rNchain from_iterablerPrHrurrVrvrDeleter}r~r"rr_lookuprkrr$rrrrsplit) rr&riterating_object_namemessagesr_ nested_loopshas_nested_loopsr2 subscriptrrws r'rNz7RefactoringChecker._check_unnecessary_dict_index_lookup/sJ ty%* - -H 49>5?;;H  '722' 77Hh(;<< $(IN$7$A$A$C$C !HdEI..6 $+224455 %?8899LT999L $L$77tC !_ _ !&!5!5eo!F!F^^I%io EO7TUU! %OE!$ 227T!88 !)"2ELAA"%44L *4; D D% #4;#344q88$zT[-=a-@-EEE4 8Q8Q8S8SSS$'tUY77% % UZ 8 8 ;B ? F T T %+ $OO,504 0@0C0M0M0O0O!"!"!,, ?%.&*k&6q&9&C&C&E&E%G-$E5?;;) *4;8H I I%#-ek5:#F#F% ${/5;3CCC4 8Q8Q8S8SSS$'tUY77 % % 2 25;3C D DQ G K R"k!*!*%$)#3EK#@#@)(EK@@%HNVWDWDW$+$OO,503(-(9(9(@(@q(@(Q(Q1&1&!"!"!,, ?%.$'HHU__->->-E-EcTU-E-V-V$W$W&"-q^@$    3 !*-/!IH H H H 32@  r)czt|jtjr9t|jjtjr|jjjdksdSt} tj |jdd}n7#tj $r%tj |jd}t}YnwxYwt|tjsdSt|j tjrt|j jdkrdSt|j jdtjsdS||\}}|rdS|tkr|n|}|j}|j jd}g}t|tjr|jn%t+|j} t0jd| D} t7| ddu} t0jd | D} t7| ddu} | D]}|tjD]}t|tjrt=|rdSt|jtjrdS|j }t|tjr*|j|j jdjks||j!"krt|tjr6|#|jdd j$|j$krt|tjr6|#|jdd j$|j$krS| r|%|l| rp|&d ||j jdjf| |D]1}|&d ||j jdjf| 2dS) Nr>riterable)positionr)rr/r<c3lK|]/}|tjtjfV0dSr"r rs r'r(zJRefactoringChecker._check_unnecessary_list_index_lookup..sJ5 5 ?DE %)U[!9 : :5 5 5 5 5 5 r)c3TK|]#}|tjV$dSr")rHrrrs r'r(zJRefactoringChecker._check_unnecessary_list_index_lookup.. sC6 6 /4E  * *6 6 6 6 6 6 r)rhrr^)'r$rrrsrurVr_rrget_argument_from_callNoSuchArgumentErrorinfer_kwarg_from_callrr}r~r"rr_enumerate_with_startrr,rrer\rNrrrPrHrurrrvrrrrkrr$)rr&preliminary_confidence iterable_arg has_start_argr_rvalue_variable bad_nodesr_rr if_statementshas_if_statementsr2rr9s r'rOz7RefactoringChecker._check_unnecessary_list_index_lookups49ej11 dinej99 9>&+55 F!% / 7 AzLL( / / / 6ty*UUUL%. " " " /, 33  F$+u{33 s4;;K7L7Lq7P7P F$+*1-u/?@@  F$($>$>t$D$D! z   F &22 # "  !- 1)!, $ ** 2DIIdk..0011 !445 5 HP5 5 5    d334? "556 6 8@6 6 6   !55TA3 3 E"11%/BB2 2  dEI..3P44 FFFi. ==FFF!eUZ00% dk&6q&9&>>>0IO4M4M4O4OOO #433!!LL44Q7;BT[PP!#433!!LL)<==a@DK+&& !' "((3333* ((;!*"&+"21"5":!<'1 )[2 h#  I   /k&q).0%       s#B1B43B4tuple[bool, Confidence]cXt}t|jjdkr9|jjd}||\}}|d|fS|dk |fS|jjD]=}|jdkr0||j\}}|d|fcS|dk |fcS>d|fS)a#Check presence of `start` kwarg or second argument to enumerate. For example: `enumerate([1,2,3], start=1)` `enumerate([1,2,3], 1)` If `start` is assigned to `0`, the default value, this is equivalent to not calling `enumerate` with start. r<NFrrP)rr"rr!_get_start_valuerrr)rr&r_ start_arg start_valrs r'r%z(RefactoringChecker._enumerate_with_startI s ty~   " " q)I$($9$9)$D$D !Iz j(( A~%z1 1y) 6 6G{g%%(,(=(=gm(L(L% :$ *,,,,$>):5555 & j  r)tuple[int | None, Confidence]ct|tjtjtjfsEt|tjrSt|jtjtjfr(tj|}|r|j nd}|tfSt|tjr|jj tfSt|tj r|j tfSdtfSr") r$rrVrsrUnaryOprFrrtrrrr)rr&rr1s r'r/z#RefactoringChecker._get_start_valuek s tej%*eoF G G ($ .. (4<%/5:)FGG ( '--H*2<Ii' ' dEM * * ,<%t+ + dEK ( ( $:t# #Tzr))rrrrr)rr )r&rrr)r&rrr)r&rrr)r7r8rr)r5r6rr)r&r.rr)rArBrr)r&rLrr)r&rQrr)r&rTrr)r&rrZr[rrrr)rnr ror rr)r&rrr)r&rrr)r&rrr)r5rrr)r&rrr)rrrr)r&rWrr)r&rrr)rGrrr)r&rrr)rrrr)rrrr)r&r rr )r&r rr)rr[r rNrrN)rVr rr )r&rirr)r&rrr)r&ryrr)r&rWrr[)r&rrr)rrrr)r&rrr)r&rrr)r&r rr)r&rrrr&rrr)r&rrr)r&r rr)r&r rr-)r&rrr2)[rrrrr_msgsoptionsrrr rr  staticmethodrrr,r4ronly_required_for_messagesr:r@ visit_whilerKrPrSrYrbr=r>rjrmrqr|rrrrrrrrrrrrrrrrrrr<rr8rr'r<rMrUrZrfrhrlrxr}r|r{rrrrrrrrrrrrrrrrrrrrNrOr%r/ __classcell__)rs@r'rrs  DA  A   A   A   !A *  +A 4  , $ BC D  5A D  6 ' J EF G  EA P  QA `  aA r  sA D  EA R  SA d  eA r  sA @  AA N  OA `  aA A p  qA |   }A P  QA `  aA l  mA ~  A L  MA X  YA j  kA |  }A H  IA T  UA `  aA j  kA t  uA B  CA P  QA A \   wA A A DH "T     (?,2     4%B   -#GJBBBBBB4444    666_6   \  EUEUEUEUNNNNN"&U%&;<<=<&U%&>@PQQ111RQ1 K*&U%' ''  <<<  <&U%&EFFAAAGFA&U%')> @ @ @ @LLLLB                   \ MMMM< > > > >&U% #$$  999  9SSSSj&U%&BCC---DC-VVVV2&U% (  ???  ? &U%&;<<<<<=<<&U%&=>>:::?>: W W W WRRR\R : : : :D""""H&U%+*!"  +++  +&U%&677III87I(   \ T T T T < < < <----^FFFF:???? ' ' ' \' R    , , , , \6666pEEE\E8""""08&U%% % 1111    \  1 1 1 1&U%% !       &U%% ! WWW  W6,#,#,#,#\????BDDDD" N N N\ N8888(EEEE@&U%&;<<...=<.&U%#'' 888  8 OOOOb   \ 222\2    FFFF,7777<####J/Y/Y/Y/Yb\.>>>>4PPPPdFFFFP ! ! ! !D        r)r)rrrrrr)r&r.rrrr)r7r8r9r:rr)r&rWrrr5); __future__rrr]rNrAcollections.abcr functoolsrrrertypingrr r r r r\r r astroid.utilrpylintrpylint.checkersr(pylint.checkers.base.basic_error_checkerrpylint.checkers.utilsrpylint.interfacesrrr pylint.lintrr`rrrrrrrrrrr-r6rVrarfrprxrrBaseTokenCheckerrrr)r'rIs #""""" $$$$$$-------->>>>>>>>>>>>>> ((((((!!!!!!FFFFFF2222229999999999%$$$$$$eieiIJ-/@AY/00'0y(($$-9$$ ,PPPP ((((V    9999$&Z8W"W"W"W"W"2W"W"W"W"W"r)