r]% U d Z ddlmZ ddlZddlZddlZddlZddlZddlZddlm Z ddl
m Z m Z m
Z
ddlmZ ddlmZ ddlmZmZmZ ddlZdd lmZmZmZmZ dd
lm Z dd l m Z dd l m Z m!Z! dd
l"m#Z#m$Z$m%Z% ddl&m'Z'm(Z(m)Z) ddl*m+Z+m,Z,m-Z-m.Z. ddl/m0Z0 ej1 dk rddlm2Z2 nddl3m4Z2 erddl5m6Z6 ej7 d Z8dZ9 ej7 d Z:ddiZ;dZh d Z?ej@ jA ej@ jB ej@ jC ej jD jE fZFejG ejH ejI ejJ ejK ejL fZM G d d e ZNdd%ZO ed&' dd, ZPdd1ZQdd6ZRdd9ZSdd=ZTdd>ZUddBZVddEZWddGZXddKZYi dLdMdNdOdPdQdRdSdTdUdVdWdXdYdZd[d\d]d^d_d`dadbdcdddedfdgdhdidjdkdldmdndodpdqdrgifdsdtdudqdvgifdwdxdydzd{d|ZZd}e[d~< G d de Z\ G d d Z] G d de Z^ddZ_dS )z#Variables checkers for Python code. ) annotationsN) defaultdict) GeneratorIterableIterator)Enum) lru_cache)
TYPE_CHECKINGAny
NamedTuple)bases extract_nodenodesutil) _base_nodes)InferenceResult) BaseCheckerutils)in_type_checking_block is_postponed_evaluation_enabled is_sys_guard) PY39_PLUS TYPING_NEVERTYPING_NORETURN) CONTROL_FLOWHIGH INFERENCEINFERENCE_FAILURE)MessageDefinitionTuple) )cached_property)cachedproperty)PyLinterz^_{2}[a-z]+_{2}$
__future__z_.*|^ignored_|^unused__py_abcabczbuiltins.rangetyping>5 r SetDictListTextTypeDequeSizedTupleUnionAnyStrCounterGenericMappingPatternTypeVarBinaryIOCallableClassVarHashabler r KeysViewOptionalSequence Awaitable Container Coroutine FrozenSetr ItemsView
ByteString
Collection
MutableSetr
Reversible
ValuesView AbstractSet DefaultDict MappingView SupportsAbs SupportsInt
AsyncIterable
AsyncIterator
SupportsBytes
SupportsFloat
SupportsRoundAsyncGeneratorContextManagerMutableMappingMutableSequenceSupportsComplexAsyncContextManagerc e Zd ZdZdZdZdS )VariableVisitConsumerActionzReported by _check_consumer() and its sub-methods to determine the
subsequent action to take in _undefined_and_used_before_checker().
Continue -> continue loop to next consumer
Return -> return and thereby break the loop
r N)__name__
__module__ __qualname____doc__CONTINUERETURN k/builddir/build/BUILD/cloudlinux-venv-1.0.10/venv/lib/python3.11/site-packages/pylint/checkers/variables.pyrZ rZ s$ H
FFFrc rZ stmtnodes.ImportFromnamestrreturn bool | Nonec | | j }n# t j $ r Y dS w xY w|j |g D ]/}t
|t j r|j t k r dS 0dS )z9Check if the name is a future import from another module.NT)
do_import_modulemodnameastroidAstroidBuildingExceptionlocalsget
isinstancer
ImportFromFUTURE)re rg module
local_nodes rd _is_from_future_importrw s &&t|44 + tt m''b11
j%"2 3 3
8Jf8T8T44 4s 00i )maxsizeklassnodes.LocalsDictNodeNG
str | Nonenodes.FunctionDef | Nonec t | | }n# t t f$ r Y dS w xY w || }n# t $ r Y dS w xY wt |t
j r|S dS )z Get overridden method if any.N)nextlocal_attr_ancestors
StopIterationKeyErrorrr r FunctionDef)ry rg parent meth_nodes rd overridden_methodr s
e006677 8 $ tt4L tt )U .// 4s "% ::A
AAnode nodes.Assigninferredr c d}t |t rit | t j r| j }n3t | t j r| j }|S | j }| j |k r;| j
|j
k rd| d}n&|j
r
d|j
}n|j
r
d|j
d| }|S )z~Return extra information to add to the message for unpacking-non-sequence
and unbalanced-tuple/dict-unpacking errors.
'zdefined at line z of ) rr
DICT_TYPESr Assignvalue as_stringForiterrootrg lineno)r r moreinferred_modules rd _get_unpacking_extra_infor s D(J'' dEL ) ) ):''))DD
ei
(
( )9&&((D mmoo*O yy{{?** ;(/ ) ).x))++...DD
_ 87ho77D IH(/HHHH Krc
nodes.Nameframedefframeboolc j dx}}|r |j r|j }|r |j r|j }t |t j r'||ur#|t j | t j u rdS t |t j rS| | r| j |j k S t | j t j t j
f sdS n t d ||fD rdS g }||fD ]f}|}|r`t |t j t j f s|
| n$|j r|j }nn|`g|r"t t | dk rdS |j |j k S )a Detect that the given frames share a global scope.
Two frames share a global scope when neither
of them are hidden under a function scope, as well
as any parent scope of them, until the root scope.
In this case, depending from something defined later on
will only work if guarded by a nested function definition.
Example:
class A:
# B has the same global scope as `C`, leading to a NameError.
# Return True to indicate a shared scope.
class B(C): ...
class C: ...
Whereas this does not lead to a NameError:
class A:
def guard():
# Return False to indicate no scope sharing.
class B(C): ...
class C: ...
NFc 3 d K | ]+}t |t j t j f V ,d S N)rr r ClassDefModule).0fs rd z'_detect_global_scope.. sI
>?Jq5>5<8 9 99
rc r[ )r scoperr r r r get_node_first_ancestor_of_typer parent_ofr Argumentsanyr appendlenset)r r r def_scoper break_scopes
current_scope parent_scopes rd _detect_global_scoper s 2 I % % ""$$ ,HO , O))++ 5%.)) " " U:4ARSS S S u%*++ ??8 $ $ 1; 0 0$+(95?'KLL 5
DI8CT
uL +
% lU^U\,JKK
##L111"
+ 2 8 8 : : C - -..!33 u <(/ ))rc nodes.Import&Generator[InferenceResult, None, None]c z t j }||_ | |d S )NF)asname)rn contextInferenceContext
lookupnameinfer)r rg r s rd _infer_name_moduler s5 o..00G G ::ge: , ,,rc not_consumed dict[str, list[nodes.NodeNG]](list[tuple[str, _base_nodes.ImportNode]]c i }| D ]\ }}t d |D r |D ]}t |t j t j f s)|j D ]Z}d}|d }|dk r|}n:d}| | r| d dk rd}|s||v r|}|r ||vr|||< [t | d
S ) a Try to fix imports with multiple dots, by returning a dictionary
with the import names expanded.
The function unflattens root imports,
like 'xml' (when we have both 'xml.etree' and 'xml.sax'), to 'xml.etree'
and 'xml.sax' respectively.
c 3 K | ]J}t |t j o+t | t j V Kd S r )rr r
AssignName assign_type AugAssignr re s rd r z#_fix_dot_imports..+ sf
tU - . .
@4++--u??
rc Nr *F.Tc | d j S )Nr[ )
fromlineno)as rd z"_fix_dot_imports..J s qt rc )key)
itemsr rr r rs Importnames
startswithfindsorted) r r rg stmtsre imports second_nameimport_module_namename_matches_dotted_imports rd _fix_dot_importsr sY 02E#))++ . . e
. .D dU%5u|$DEE
:
.
. " %,QZ"%,, #'KK16.*55d;;: . 3 3C 8 82 = =5921 9TW__ '9 .;e#;#;)-E+&+
. .2 %++--%>%> ? ? ??rc c | t | t j v rdS | t j t j f }|D ](}|j D ] \ }}|r || k r dS |r
|| k r dS )dS )zDetect imports in the frame, with the required *name*.
Such imports can be considered assignments if they are not globals.
Returns True if an import for the given name was found.
FT)_flattened_scope_namesnodes_of_classr Globalr rs r )rg r r import_node import_name import_aliass rd _find_frame_importsr M s %e&:&:5<&H&HIIIIu""EL%2B#CDDG )4): %K
4'' 444 (
!4!4ttt 5rc %nodes.Global | _base_nodes.ImportNode global_namesset[str]c B | j D ]\ }}|r||v r dS ||v r dS dS )NTF)r )re r r r s rd _import_name_is_globalr c sW &*Z ! \ |++tt ,
L
(
(44 ) 5rc iterator'Iterator[nodes.Global | nodes.Nonlocal]c r d | D }t t j | S )Nc 3 > K | ]}t |j V d S r )r r r s rd r z)_flattened_scope_names..t s*
3
3$c$*oo
3
3
3
3
3
3rc )r itertoolschain
from_iterable)r valuess rd r r q s5 4
3(
3
3
3F y,,V44 5 55rc name_nodec }| t j }t fd|D pt j | S )zEChecks if name_node has corresponding assign statement in same scope.c 3 8 K | ]}|j j k V d S r rg )r r r s rd r z$_assigned_locally..| s, >>Aqv '>>>>>>rc )r r r r r r rg )r name_node_scope assign_stmtss ` rd _assigned_locallyr x sh oo''O"11%2BCCL >>>> >>> > > BUC C rc nodes.NodeNGr nodes.FunctionDefc T t j t j t j t j f}| t j | D ]W}t j |j }t j
| r(t |dd dk r| j |j k r dS XdS )N)
skip_klassrg rp TF)
r r r r rs r Callr
safe_inferfuncis_builtin_objectgetattrr )re r
skip_nodescallr s rd _has_locals_call_after_noder s
J $$UZJ$GG #DI.. #H - - &$//8;;{T[((tt 5rc E0601)z#Using variable %r before assignmentused-before-assignmentaf Emitted when a local variable is accessed before its assignment took place. Assignments in try blocks are assumed not to have occurred when evaluating associated except/finally blocks. Assignments in except blocks are assumed not to have occurred when evaluating statements outside the block, except when the associated try block contains a return statement.E0602)zUndefined variable %rundefined-variablez,Used when an undefined variable is accessed.E0603)z%Undefined variable name %r in __all__undefined-all-variablez>Used when an undefined variable name is referenced in __all__.E0604)z7Invalid object %r in __all__, must contain only stringsinvalid-all-objectz;Used when an invalid (non-string) object occurs in __all__.E0605)z1Invalid format for __all__, must be tuple or listinvalid-all-formatz(Used when __all__ has an invalid format.E0611)zNo name %r in module %rno-name-in-modulez-Used when a name cannot be found in a module.W0601)z0Global variable %r undefined at the module levelglobal-variable-undefinedzsUsed when a variable is defined through the "global" statement but the variable is not defined in the module scope.W0602)z-Using global for %r but no assignment is done global-variable-not-assignedzWhen a variable defined in the global scope is modified in an inner scope, the 'global' keyword is required in the inner scope only if there is an assignment operation done in the inner scope.W0603)zUsing the global statementglobal-statementzUsed when you use the "global" statement to update a global variable. Pylint discourages its usage. That doesn't mean you cannot use it!W0604)z.Using the global statement at the module levelglobal-at-module-levelzTUsed when you use the "global" statement at the module level since it has no effect.W0611)z Unused %s
unused-importz5Used when an imported module or variable is not used.W0612)zUnused variable %runused-variablez-Used when a variable is defined but not used.W0613)zUnused argument %runused-argumentz4Used when a function or method argument is not used.W0614)z.Unused import(s) %s from wildcard import of %sunused-wildcard-importz]Used when an imported module or variable is not used from a `'from X import *'` style import.W0621)z-Redefining name %r from outer scope (line %s)redefined-outer-namezUUsed when a variable's name hides a name defined in an outer scope or except handler.W0622)zRedefining built-in %rredefined-builtinz5Used when a variable or function override a built-in.W0631)z)Using possibly undefined loop variable %rundefined-loop-variablezUsed when a loop variable (i.e. defined by a for loop or a list comprehension or a generator expression) is used outside the loop.ziPossible unbalanced tuple unpacking with sequence %s: left side has %d label%s, right side has %d value%sunbalanced-tuple-unpackingz>Used when there is an unbalanced tuple unpacking in assignment old_names)E0632z old-unbalanced-tuple-unpackingz%Attempting to unpack a non-sequence%sunpacking-non-sequencezKUsed when something which is not a sequence is used in an unpack assignment)W0633zold-unpacking-non-sequence)z Cell variable %s defined in loopcell-var-from-loopzA variable used in a closure is defined in a loop. This will result in all closures using the same value for the closed-over variable.)zPossibly unused variable %rpossibly-unused-variablezUsed when a variable is defined but might not be used. The possibility comes from the fact that locals() might be used, which could consume or not the said variable)z"Invalid assignment to %s in methodself-cls-assignmentzKInvalid assignment to self or cls in instance or class method respectively.)z!Invalid index for iterable lengthpotential-index-errorzREmitted when an index used on an iterable goes beyond the length of that iterable.)z_Possible unbalanced dict unpacking with %s: left side has %d label%s, right side has %d value%sunbalanced-dict-unpackingzIUsed when there is an unbalanced dict unpacking in assignment or for loop)W0632E0633W0640W0641W0642E0643W0644z!dict[str, MessageDefinitionTuple]MSGSc < e Zd ZU dZded< ded< ded< ded< d S )
ScopeConsumerz)Store nodes and their consumption states.r
to_consumeconsumed$defaultdict[str, list[nodes.NodeNG]]consumed_uncertainrh
scope_typeN)r\ r] r^ r_ __annotations__rb rc rd r3 r3 & sC 33----++++<<<<OOOOOrc r3 c z e Zd ZdZd/dZd0d Zd1d Zed2d
Zed2d Z ed3d Z
ed0d Z d4dZ d5dZ
ed6d Zed7d Zd8d Zed9d" Zed6d# Zed6d$ Zed:d' Zed;d+ Zedrb r kvs rd
z*NamesConsumer.__repr__..: s& PPP11 PPPrc c " g | ] \ }}| d |
S rG rb rH s rd rK z*NamesConsumer.__repr__..; s& KKKTQ[[Q[[KKKrc c " g | ] \ }}| d |
S rG rb rH s rd rK z*NamesConsumer.__repr__..< s3
AqqKKAKK
rc , z
to_consume : z
consumed : z
consumed_uncertain: z
scope_type :
)rA r4 r r5 r7 joinr8 )rC _to_consumes _consumed_consumed_uncertain to_consumesr5 r7 s rd __repr__zNamesConsumer.__repr__9 s PP 0G0M0M0O0OPPP KKT\-B-H-H-J-JKKK
$(L$C$I$I$K$K
ii -- 99Y'' !YY': ; ; ( l% rc
Iterator[Any]c * t | j S r )r rA rC s rd __iter__zNamesConsumer.__iter__I s DL!!!rc r c | j j S r )rA r4 rX s rd r4 zNamesConsumer.to_consumeL
|&&rc c | j j S r )rA r5 rX s rd r5 zNamesConsumer.consumedP s
|$$rc r6 c | j j S )a Retrieves nodes filtered out by get_next_to_consume() that may not
have executed.
These include nodes such as statements in except blocks, or statements
in try blocks (when evaluating their corresponding except and finally
blocks). Checkers that want to treat the statements as executed
(e.g. for unused-variable) may need to add them back.
)rA r7 rX s rd r7 z NamesConsumer.consumed_uncertainT s |..rc c | j j S r )rA r8 rX s rd r8 zNamesConsumer.scope_type` r[ rc rg consumed_nodeslist[nodes.NodeNG]c z fd| j | D }| j |< |r || j |< dS | j |= dS )zMark the given nodes as consumed for the name.
If all of the nodes for the name were consumed, delete the name from
the to_consume dictionary
c 6 g | ]}|t v|S rb )r )r nr_ s rd rK z2NamesConsumer.mark_as_consumed..j s+ WWWA!3~CVCV:V:Va:V:V:Vrc N)r4 r5 )rC rg r_
unconsumeds ` rd mark_as_consumedz NamesConsumer.mark_as_consumedd s\ XWWW !6WWW
,
d &$.DOD ! ! !%%%rc r list[nodes.NodeNG] | Nonec j }j }| j | } d }|rPt |t j r6||d j k r%|d j j d }|j |k rd}|r0t |t j r|j
k r |j |v rd}t fd
d D r|S t r|S |rM| | }| j j xx |z
cc< t' | fd|D }|rfd|D }|rN| || }| j j xx |z
cc< t' | fd|D }|rM| || }| j j xx |z
cc< t' | fd |D }|rM| || }| j j xx |z
cc< t' | fd
|D }|S ) aG Return a list of the nodes that define `node` from this scope.
If it is uncertain whether a node will be consumed, such as for statements in
except blocks, add it to self.consumed_uncertain instead of returning it.
Return None to indicate a special case that needs to be handled by the caller.
Tfuturer Nc 3 h K | ],}t |t j o
j |j v V -d S r rr r Nonlocalrg r r childr s rd r z4NamesConsumer.get_next_to_consume.. sQ
uen - - J$)u{2J
rc c g | ]}|v| S rb rb r rc uncertain_nodes_sets rd rK z5NamesConsumer.get_next_to_consume.. $ RRRQ>Q5Q5Q15Q5Q5Qrc c g | ][}t | d t j r)| d Y|\S )Trh )rr statementr
ExceptHandlerr )r rc r s rd rK z5NamesConsumer.get_next_to_consume.. sp !!++T+":":E. rr rc c g | ]}|v| S rb rb rp s rd rK z5NamesConsumer.get_next_to_consume.. rr rc c g | ]}|v| S rb rb rp s rd rK z5NamesConsumer.get_next_to_consume.. rr rc )rg r r4 rq rt rr r r targetsr r targetr r get_childrenVariablesChecker%_comprehension_between_frame_and_node _uncertain_nodes_in_false_testsr7 r !_uncertain_nodes_in_except_blocks=_uncertain_nodes_in_try_blocks_when_evaluating_finally_blocks<_uncertain_nodes_in_try_blocks_when_evaluating_except_blocks) rC r rg parent_node found_nodesnode_statementlhsuncertain_nodesrq s ` @rd get_next_to_consumez!NamesConsumer.get_next_to_consumer sC yk o))$// t 44 #; 55 # {1~ 444 a.'/2Cx4 "
; 22 D(("k11 K
400==??
A A$ G G S " B B;PT U UO #DI . . ./ A . . ."%o"6"6 RRRRkRRRK $ K S " D DT> O
#DI . . ./ A . . ."%o"6"6 RRRRkRRRK SRR
#DI . . ./ A . . ."%o"6"6 RRRRkRRRK SQQ
#DI . . ./ A . . ."%o"6"6 RRRRkRRRKrc r c t |t j t j f rUt | p9t |t j o t
fd|j D S t |t j rt | S t |t j sdS t | t j rdS t
| rdS |j sdS t |j o t |j S )zReturn True if there is a collectively exhaustive set of paths under
this `if_node` that define `name`, raise, or return.
c 3 N K | ] }t | V d S r )r; )_defines_name_raises_or_returns_recursive)r handlerrg s rd r zJNamesConsumer._exhaustively_define_name_raise_or_return.. sN "KK g rc FT)rr r TryExcept
TryFinallyr; r allhandlersWithIfr r Break _defines_name_raises_or_returnsorelse_branch_handles_namebody)rg r s ` rd )_exhaustively_define_name_raise_or_returnz7NamesConsumer._exhaustively_define_name_raise_or_return sd dU_e.> ? @ @ GGdSS dEO44 $(=
dEJ ' ' W JJ4QUVV V$)) 5 t""5;// 0 0 4 8 8t D D 4 { 5 11 $)
D00t{CC Drc r Iterable[nodes.NodeNG]c : t fd|D S )Nc 3 K | ]v}t | pVt |t j t j t j t j f ot | V wd S r ) r; r rr r r r r r r )r if_body_stmtrg s rd r z5NamesConsumer._branch_handles_name.. s
9 9$ M M
5?E,.% sE !!*-- rc c 3 Z K | ]&}t |t j o|j V 'd S r )rr r Constr )r r s rd r z@NamesConsumer._uncertain_nodes_in_false_tests..2 sL + + 8U[11H(.6H+ + + + + +rc )r rr r r r r r r r r; r rg r rB r test NamedExprr infer_allr add)rC r r r
other_noder all_inferredr s @rd r~ z-NamesConsumer._uncertain_nodes_in_false_tests s % * < * z58TTJ!zz||:#3#3#5#555%**>*>t*D*D% FF
# >
&&z222 */5?;;
'!,! ?400L
s + + ,+ + + ( (
" ": . . . + / /
; ; ; ; rc r nodes.Statementc g }| D ]}| d }t j |t j }|s;| rQ|j }t d |j D }t d |j D } t d |j D }
|s| s|
rt |j t j r>||j j v r0|j | r|
| nt |j t j r>||j j v r0|j | r|
| n"t fd|j D rt" | r|
| |S )z}Return any nodes in ``found_nodes`` that should be treated as uncertain
because they are in an except block.
Trh c 3 J K | ] }t |t j V d S r rr r Return)r
try_statements rd r zBNamesConsumer._uncertain_nodes_in_except_blocks..T sB $ $! =%,77$ $ $ $ $ $rc c 3 J K | ] }t |t j V d S r r r else_statements rd r zBNamesConsumer._uncertain_nodes_in_except_blocks..X sB % %" >5<88% % % % % %rc c 3 K | ]V}t |t j o7t |j t j ot j |j V Wd S r )rr r Exprr r r is_terminating_funcr s rd r zBNamesConsumer._uncertain_nodes_in_except_blocks..\ ss # # # >5:66 D ~ 3UZ@@D-n.BCC# # # # # #rc c 3 X K | ]$}t j | V %d S r )r; r rg )r r r s rd r zBNamesConsumer._uncertain_nodes_in_except_blocks..u sP "KK 7 rc )rt r r r ru r r r r r rr r finalbodyr r r r r; _check_loop_finishes_via_except) r r r r r other_node_statementclosest_except_handlerclosest_try_excepttry_block_returnselse_block_returnselse_block_exitss ` rd r z/NamesConsumer._uncertain_nodes_in_except_blocks= sa % : / : /J#-#7#7t#7#D#D %*%J$e&9& & " *
%//55
2H2O # $ $%7%<$ $ $ ! ! "% % %&8&?% % % " " # # # '9&? # # # !
$6
:J
~ 4e6FGG &.*?*III*1;;NKK J $**:6666 ~ 4eoFF &.*?*FFF*1;;NKK G $**:6666 $6#> <. sB $ !',4 rc F)rr r RaiseAssertr AnnAssignr rz r rg r ry r get_all_elementsStarredr r r r )rg r rz elts ` rd r z-NamesConsumer._defines_name_raises_or_returns si dU[%, E F F 4 tU_ - -
4;(899 D((4 dEL ) ) $ ,
$
$ 1&99 $ $C!#u}55 ( !i!#u'788 $SX=M=M #ttt $
dEH % % (,(;(;EO(L(L
turc c | D ]v}t | r dS t |t j t j f r0t fd| D r dS wdS )zaReturn True if some child of `node` defines the name `name`,
raises, or returns.
Tc 3 N K | ] }t | V d S r )r; r )r nested_stmtrg s rd r zJNamesConsumer._defines_name_raises_or_returns_recursive.. sG # "AA$ TT rc F)r{ r; r rr r r r r )rg r re s ` rd r z7NamesConsumer._defines_name_raises_or_returns_recursive s %%'' D <. sO
d " Dn&>&>t&D&D
rc r r loopnodes.For | nodes.Whileri r c D t fd|j D S )zAReturn True if `other_node_try_except` is a descendant of `loop`.c 3 J K | ] }|u p| V d S r r )r loop_body_statementr s rd r z[NamesConsumer._check_loop_finishes_via_except.._try_in_loop_body.. sW ( $'<< H&001FGG rc )r r )r r s ` rd _try_in_loop_bodyzHNamesConsumer._check_loop_finishes_via_except.._try_in_loop_body sA ,09
rc T)r r r r ri r )
r r r r r Whiler rr r node_ancestorsr r; +_recursive_search_for_continue_before_break)r r closest_loopinner_else_statement
break_stmtr ancestor loop_stmts ` rd r z-NamesConsumer._check_loop_finishes_via_except s . %+ 5
1$EK8P Q Q 5
"."5
5$9$@ . <<
1
5 ! !6 EE ( 7 7 9 9
hEK(@AA (()>II u%* I HH:
4urc re r nodes.Breakc | |u rdS t | t j rdS | D ]G}t | t j t j f r)t || r dS HdS )zReturn True if any Continue node can be found in descendants of `stmt`
before encountering `break_stmt`, ignoring any nested loops.
FT)rr r Continuer{ r r r; r )re r rn s rd r z9NamesConsumer._recursive_search_for_continue_before_break s : 5 dEN + + 4&&(( E$EK 899
HHz
tt
urc c ` g }t j |t j |S | D ]}| d }|u r t j |t j \ }B|j vrLt fdj D sn|
| |S )zReturn any nodes in ``found_nodes`` that should be treated as uncertain.
Nodes are uncertain when they are in a try block and the ``node_statement``
being evaluated is in one of its except handlers.
NTrh c 3 V K | ]#}j v p| v V $d S r )r r )r &other_node_try_ancestor_except_handlerr other_node_try_ancestors rd r z]NamesConsumer._uncertain_nodes_in_try_blocks_when_evaluating_except_blocks..2 s^ ; '*A*JJ ;9)88::; rc ) r r r ru rt -get_node_first_ancestor_of_type_and_its_childr r r r r )r r r r r %other_node_try_ancestor_visited_childr r s @@rd r zJNamesConsumer._uncertain_nodes_in_try_blocks_when_evaluating_except_blocks
s /1!&!F E /"
"
" )" "% / /J#-#7#7t#7#D#D #'===
C$eo
'5 '.5.34 4 ?V>^
" ": . . . . rc c v g }t j |t j \ }|S |j vr|S | D ]}| d }t j |t j \ }}|=||j vrG|ur!t fd|j D sl| | |S )NTrh c 3 J K | ] }|u p| V d S r r )r other_node_final_statement closest_try_finally_ancestors rd r z^NamesConsumer._uncertain_nodes_in_try_blocks_when_evaluating_finally_blocks..e sZ
3 /2NN 1;;4 rc ) r r r r r rt r r r ) r r r %child_of_closest_try_finally_ancestorr r other_node_try_finally_ancestor(child_of_other_node_try_finally_ancestorr s @rd r zKNamesConsumer._uncertain_nodes_in_try_blocks_when_evaluating_finally_blocks= s7 /1
? E ,
( 1 ( /" " 1/9
:
: # "% / /J#-#7#7t#7#D#D C$e&6
/8 /6 96;< < 07SSS
7V6_ T " ": . . . . rc N)r r r8 rh ri r< )ri rh )ri rV )ri r )ri r6 )rg rh r_ r` ri r< )r r ri rf )rg rh r r ri r )rg rh r r ri r )r r` r r ri r` )r r` r r r r ri r` )r r r r ri r )re r r r ri r )r r` r r ri r` )r\ r] r^ r_ rD rU rY propertyr4 r5 r7 r8 re r staticmethodr r r~ r r r r r r r rb rc rd r; r; / sH [[? ? ? ? " " " " ' ' ' X' % % % X% / / / X / ' ' ' X' & & & & Y Y Y Yv 'D 'D 'D \'DR
\
6 6 6 6 p D D D \D L \2 \" F F F \FP \& - - - \- ^ 2 2 2 \2 2 2 rc r; c
@ e Zd ZdZdZeZddddddfd d
d d d
dfddddddfddddddfddddddfded d ddfd d ddd dfd dddd dffZdˈ fd% Z e
j d& dd) Z dd*Z
dd,Z e
j d-d.d/d0d1d2d3d4 dd5 Zdd7Zdd8Zdd:Zdd<Zdd>Zdd?ZddAZddBZddDZddEZddGZddHZeZ eZ e
j dIdJdKdLd/ ddN Z ddPZ ddRZ ddTZ! e
j dU ddW Z" e
j dU ddX Z#dd\Z$ddaZ%ddhZ& e
j di ddk Z' e
j di ddm Z( e
j dndodpdq dds Z)dduZ*ddvZ+ddwZ,ddyZ-dd{Z.e/dd| Z0e/dd~ Z1e/dd Z2e3dd Z4e3dd Z5e3dd Z6e3dd Z7ddZ8e3dd Z9e3dd Z:ddZ;ddZddZ?ddZ@ddZAddZBe3dd ZCddZDddZEddZFddZGe3dd ZHddZIddZJddZKddZLd dZMddZNddZOddÄZPddńZQddȄZR e
j d-d3 ddʄ ZS xZTS ( r| a BaseChecker for variables.
Checks for
* unused variables / imports
* undefined variables
* redefinition of variable from builtins or from an outer scope or except handler
* use of variable before assignment
* __all__ consistency
* self/cls assignment
variablesz init-importFynzzBTells whether we should check for unused import in __init__ files.)defaulttypemetavarhelpzdummy-variables-rgxz;_+$|(_[a-zA-Z0-9_]*[a-zA-Z0-9]+?$)|dummy|^ignored_|^unused_regexpzzYA regular expression matching the name of dummy variables (i.e. expected to not be used).zadditional-builtinsrb csvzzList of additional names supposed to be defined in builtins. Remember that you should avoid defining new builtins when possible. callbacks)cb__cbz z|List of strings which can identify a callback function by name. A callback name must start or end with one of those strings.zredefining-builtins-modules)z six.movesz
past.builtinszfuture.builtinsbuiltinsiozQList of qualified module names which can have objects that can redefine builtins.zignored-argument-namesz:Argument names that match this expression will be ignored.z allow-global-unused-variablesTzGTells whether unused global variables should be treated as a violation.zallowed-redefined-builtinsz(List of names allowed to shadow builtinslinterr$ ri r< c t | g | _ g | _ g | _ d| _ d S NF)superrD _to_consume_type_annotation_names_except_handler_names_queue _postponed_evaluation_enabled)rC r __class__s rd rD zVariablesChecker.__init__ sK
0213#
( 2-2***rc r) r nodes.Forc X t |j t j sd S |j j }t j |j }t |t sd S | | }|sd S t |t j j rIt | dk rt d |D rd S t d |D rd S t | t | k r+t! || }| ||||| d S d S )N c 3 F K | ] }t |j d k V dS )r N)r elts)r xs rd r z-VariablesChecker.visit_for.. s/ (J(JaQV)9(J(J(J(J(J(Jrc c 3 J K | ] }t |t j V d S r rr r r r rz s rd r z-VariablesChecker.visit_for.. s. KK:fem44KKKKKKrc )rr rz r r0 r r r r r _nodes_to_unpackrn objects DictItemsr r r r _report_unbalanced_unpacking)rC r ry r r detailss rd visit_forzVariablesChecker.visit_for s3 $+u{33 F+"#DI..(J// F&&x00 F h 9 : :
7||q S(J(J6(J(J(J%J%J KK7KKKKK
w<<3v;; & &/h??G - -dHgvw W W W W W ' &rc c 0 | | d S r _store_type_annotation_namesrC r s rd leave_forzVariablesChecker.leave_for ))$/////rc nodes.Modulec @ t |d g| _ t | | _ |j D ]Y\ }}t
j | r@| |d s|dk r;| d||d ZdS )zoVisit module : update consumption analysis variable
checks globals doesn't overrides builtins.
ru r r_ r argsr N)
r; r r r rp r r
is_builtin _should_ignore_redefined_builtin add_message)rC r rg r s rd visit_modulez VariablesChecker.visit_module
s *$ 9 9:-LT-R-R* ;,,.. P PKD% %%
P88qBB diFWFW !44eAh OOO P Prc r r r r r r r r c t t | j dk sJ | | | j j }d|j v r| || | | | j j j
s |j rdS | | g | _
dS )z Leave module: check globals.r[ __all__N)r r _check_metaclassespopr4 rp
_check_all_check_globalsr config init_importpackage_check_importsr )rC r r s rd leave_modulez VariablesChecker.leave_module s 4#$$)))) %%%'++--8 # # OOD, / / /
L))) {!- $, F L)))&(###rc nodes.ClassDefc V | j t |d dS )z2Visit class: update consumption analysis variable.classNr r r; r s rd visit_classdefz VariablesChecker.visit_classdef5 s)
dG < <=====rc c | t j D ]}t |j t j rt |j j t j rt |j j j t j rV|j j j }| j D ]=}|j
|j v r-| |j
|j |j
n>| j
dS )z2Leave class: update consumption analysis variable.N)r r Namerr r r r Attributeexprr rg r4 re r% )rC r r hidden_name_nodeconsumers rd leave_classdefz VariablesChecker.leave_classdef9 s ,,UZ88
I9+UZ88
y / 4eoFF
y / 4 95:FF
$-#3#8#= $ 0 H',0CCC 11 , 1 $ /0@0E F D
rc nodes.Lambdac V | j t |d dS )z3Visit lambda: update consumption analysis variable.lambdaNr0 r s rd visit_lambdaz VariablesChecker.visit_lambdaM s)
dH = =>>>>>rc _c 8 | j dS )z3Leave lambda: update consumption analysis variable.Nr r% rC r= s rd leave_lambdaz VariablesChecker.leave_lambdaQ
rc nodes.GeneratorExpc V | j t |d dS )z4Visit genexpr: update consumption analysis variable.
comprehensionNr0 r s rd visit_generatorexpz#VariablesChecker.visit_generatorexpV )
dO D DEEEEErc c 8 | j dS )z4Leave genexpr: update consumption analysis variable.Nr? r@ s rd leave_generatorexpz#VariablesChecker.leave_generatorexpZ rB rc nodes.DictCompc V | j t |d dS )z5Visit dictcomp: update consumption analysis variable.rE Nr0 r s rd visit_dictcompz VariablesChecker.visit_dictcomp_ rG rc c 8 | j dS )z5Leave dictcomp: update consumption analysis variable.Nr? r@ s rd leave_dictcompz VariablesChecker.leave_dictcompc rB rc
nodes.SetCompc V | j t |d dS )z4Visit setcomp: update consumption analysis variable.rE Nr0 r s rd
visit_setcompz VariablesChecker.visit_setcomph rG rc c 8 | j dS )z4Leave setcomp: update consumption analysis variable.Nr? r@ s rd
leave_setcompz VariablesChecker.leave_setcompl rB rc r c 6 | j t |d | j d s | j d sdS | j }| D ] \ }}||v rt |t j
s|| d }t |t j r|j t k r]t d || D r}|j }| || s| d||f| t% j | rB| | s-| | s| d||
dS )zFVisit function: update consumption analysis variable and check locals.functionr r Nr c 3 4 K | ]}t | V d S r )r )r
definitions rd r z5VariablesChecker.visit_functiondef.. s< ;E*:66 rc r )r r r; r is_message_enabledr globalsr rr r r rs rm rt r r _is_name_ignoredr r r _allowed_redefined_builtinr )rC r globsrg re rW lines rd visit_functiondefz"VariablesChecker.visit_functiondefq s
dJ ? ?@@@ K * *+A B B {--.ABB
F # **,, L LJD$u}}Zel%C%C} "4[^
z5+;<< "*f44 INt !,,,T488 $$.dD\ %
&&
L 77==
L ==dCC
L !44d KKK; L Lrc c | | |j r| |j |j r |j D ]}| | | j j }| j d s6| j d s | j d sdS t j
| rdS | }|r| rdS t | t j }t | t j }t% }| t j D ]=}|j D ]3} t j | j D ]}
| |
4>| D ]%\ }
} | |
|| d ||| &dS )z5Leave function: check function's locals are consumed.r r& r Nr )r$ type_comment_returns_store_type_annotation_nodetype_comment_argsr r% r4 r rX r is_error is_method is_abstractr r r r rl r ComprehensionScope
generators find_assigned_names_recursiverz r r _check_is_unused) rC r argument_annotationr rd r nonlocal_namescomprehension_target_namescomprehension_scope generatorrg r s rd leave_functiondefz"VariablesChecker.leave_functiondef s: %%% $ H , ,T-F G G G ! F'+'=
F
F#001DEEEE'++--8 K * *+< = = {--.HII {--.?@@
F >$ F NN$$ ))++ F-d.A.A%,.O.OPP /0C0CEN0S0STT/2uu"#'#6#6u7O#P#P 9 9 0 ;
9
9 ! ? @P Q Q 9 9D.22488889
9 (--// KD% ! !a *
rc r r
r r nodes.Globalc | d }t |t j r | d|t
dS | }d}| j }|j D ]`} |
| }n# t j $ r g }Y nw xY wt d | |d D }t j || s8t j || s#|r!| d||t
d
}|D ]} t | t j r(| j |j v r| d || nn| d |u r nTt | t j t j f r | j |u r n#|r | d
||t
d
}b|r | d|t
dS dS )z0Check names imported exists in the global scope.Trh r r
confidenceNc 3 b K | ]*}t |t j t j f V +d S r )rr r r rs )r locals rd r z0VariablesChecker.visit_global.. sJ 4 4 55<1A"BCC4 4 4 4 4 4rc rb r
r r rs Fr r r r )r rr r r r r r r rp r r rn
NotFoundErrorr rq r is_reassigned_after_currentis_deleted_after_currentr rg special_attributesr r r )
rC r r ru default_messagelocals_rg assign_nodes not_defined_locally_by_importanodes
rd visit_globalz VariablesChecker.visit_global s~
$
'' eU\ * * 5DT R R R F **,,%J 2 , 2 ,D
" %~~d 3 3 (
"
"
" !
" 14 4 4 $[[r 2 24 4 4 1 1 - )
5dDAA
6tTBB
2
2 # ! #(%
,
, ue&677
f&???$$%8t$$OOOE;;d;++v55E uu~u7H&IJJ .. E0 ,$$3 ! !#' % ',O M /dt L L L L L M Ms
B B43B4nodes.AssignNamec t | t j r| | d S d S r )rr r r r
visit_namer s rd visit_assignnamez!VariablesChecker.visit_assignname sD d&&((%/ : : " OOD ! ! ! ! ! " "rc
nodes.DelNamec 0 | | d S r )r r s rd
visit_delnamez VariablesChecker.visit_delname s rc -nodes.Name | nodes.AssignName | nodes.DelNamec | d }|j 0| j d rJ dS | || | | dS )zDon't add the 'utils.only_required_for_messages' decorator here!
It's important that all 'Name' nodes are visited, otherwise the
'NamesConsumers' won't be correct.
Trh Nz.py)rt r r fileendswith"_undefined_and_used_before_checker
_loopvar_name)rC r re s rd r zVariablesChecker.visit_name sy ~~T~** ? "yy{{'0077 7 77 F //d;;; 4 rc r nodes.ExceptHandlerc ( |j r t |j t j sd S | j D ]@\ }}|j j |j k r&| d|j |j f| nA| j ||j f d S )Nr r )rg rr r r r r r r )rC r outer_exceptouter_except_assign_names rd visit_excepthandlerz$VariablesChecker.visit_excepthandler( s y
49e6F G G F6:6V 2L2y~!9!>>> *27 9PQ !
?
(//ty0ABBBBBrc c |j r t |j t j sd S | j d S r )rg rr r r r r% r s rd leave_excepthandlerz$VariablesChecker.leave_excepthandler8 sB y
49e6F G G F (,,.....rc r re r c V | }t | j dz
}| j | j }t |dd D ]}| j | }| ||||k r+| ||||| \ }} | r0| |j |j z
} | |j | |t j u r|t j u r d S |j t j j v st! j |j s|j | j j j v ss|j dk r+t+ d | D sAt! j |t0 s%| d|j | d S d S d S d S d S d S )Nr[ r r c 3 r K | ]2}t |t j | V 3d S r )rr r r rd r is rd r zFVariablesChecker._undefined_and_used_before_checker..e sQ !!U%677KKMM rc r r )r r r r8 range_should_node_be_skipped_check_consumerr7 rg re rZ r` ra r r scope_attrsr r r r( additional_builtinsr r node_ignores_exception NameErrorr )
rC r re r start_indexbase_scope_typer current_consumeractionnodes_to_consumes
rd r z3VariablesChecker._undefined_and_used_before_checker> s
$*++a/ *;7B{B++ A # / 2 ++D2BADTUU
'+';';dE#3_( ( $F$
O
!$4$G $RR 11$)=MNNN4===4;;; <
I 1 1 1 **
2yDK . BBB [(( ! 0 0 2 2 ) .tY?? )
1 M M M M M
2 1 1 1BB((((rc r7 r; is_start_indexr c |j dk ryt j |j | s|s| | rdS t |j t j r&t |j j t j rdS nO|j dk r |
||j rdS |j dk r t j ||j rdS dS )zTests a consumer and node for various conditions in which the node shouldn't
be checked for the undefined-variable and used-before-assignment checks.
r/ TrU r; F) r8 r is_ancestor_namer _ignore_class_scoperr r r Keywordr _defined_in_function_definitionis_default_argument)rC r r7 r s rd r z(VariablesChecker._should_node_be_skippedn s ' ) ) %hmT::
"
'+'?'?'E'E
t $+u}55
* "EN; ;
t
J
.
.43W3W (-4
4
. 4
H
,
,1J (-2
2
, 4urc r rz r r rh =tuple[VariableVisitConsumerAction, list[nodes.NodeNG] | None]c
" |j |j v rVt j |j st |t j s#| | t j
dfS | | }|t j dfS |sY|j |j
v rt }nt }| d|j || t j
|j
|j fS | | t j |d }| d } | d }
||
u o>|
| o)t |
t j o|j |
j k } | rnt j |t j rOt j | r-| j |
urt j
dfS | |||| ||
|| \ } }
}|rt j dfS | r t j | st; j || d s| |u o%t |t j t j f }| s |s |
st | t j! rt j" |tF sw| j$ rQt |t j% t j& t j' f r |j |( j) v s |rt j |gfS t j dfS nT|dk r| j$ r&t |t j% t j& f sjt |t j% r t j |t j& s1| d|j |t t j
|fS n|dk r[t |t j rA|j |j) v r3|j* | j* k r#| d|j |t nR| + || r| j) , |j r$| d|j |t n#| d |j |t t j
|fS t | t j r| - || | S t |t j. rkt |j t j/ rL| 0 ||j r1| d |j |tb t j
|fS t j
|fS )
z>Checks a consumer for conditions that should trigger messages.Nr rv r Trh )r r; r )2rg r5 r is_func_decoratorr rr r rf _check_late_binding_closurerZ ra r r` r7 r r r
assign_parentrt r r r r Lambdar r r _is_variable_violationis_defined_beforern
are_exclusiveDelNamer Deleter r r r r r r rp r _is_only_type_assignmentrq _is_first_level_self_referencer IfExp_is_never_evaluatedr )rC r re r r r r rs defnodedefstmtr is_recursive_klassmaybe_before_assignannotation_returnuse_outer_definitiondefined_by_stmts rd r z VariablesChecker._check_consumer s 9(1 1 1 &'7'<==
BZe.F F
B 006663:DAA&::4@@ /8$? ? y , ??? )
!
(Y%
,2 3DI>
((...%k!n55##4#00===--
X
+""4((
+8U^44
+ X]*
>5dELII > -d33 >
::<<&,,..h>>( 06= =
' '
@/8$? ?
b M+D11b M )$ HHb M &o *u}e&673 3O #@
"@
%@
gu|44 @
3D)DD L :L & % % 1 % L !I); ; ;* R$?$H4&#Q Q ; Dd KK H,, 6
M"4%/5;L)MNN
M tU_55
M
=dEDUVV
M $$0 !Y !#' % 8 > LL H,, uen55
U\11 7+===$$0 !Y !#' %
*
*4
9
9 Mzz||"&&ty11
,494TX ! (tytPT ! 06 D D
0
0 M66tWkRR R
1
1 M'.%+66
M++GW^DD M$$, !Y !#, % 8 > LL+2K@@rc r r c | j st j | rdS t | rdS t |j t j rt |j rdS |j D ]\ }}|
d } t t ||d }n# t j $ r Y Pw xY wt |t j so| |||dd dS )!Check modules attribute accesses.Nr r r[ )_analyse_fallback_blocksr is_from_fallback_blockr rr r r r r r splitr~ r rn ResolveErrorr _check_module_attrs)rC r rg r= partsru s rd visit_importz VariablesChecker.visit_import` s , 1Md1S1S
F !$ ' ' F dk58 , , dk1J1J Fz > >GD!JJsOOE
0uQx @ @AA'
fel33
$ $T659 = = = = > >s #B**B<;B<rf c ( | j st j | rdS t | rdS t |j t j rt |j rdS |j
d } | |d }n# t j
$ r Y dS w xY w| |||dd }|sdS |j D ]6\ }}|dk r | |||
d 7dS )r Nr r r[ r )r r r r rr r r r r rm r rl rn ro r r )rC r
name_partsru rg r= s rd visit_importfromz!VariablesChecker.visit_importfromw sC , 1Md1S1S
F "$ ' ' F dk58 , , dk1J1J F\'',,
**:a=99FF/ FF ))$
122GG Fz D DGD!s{{ $ $T64::c?? C C C C D Ds ?B B.-B.r r# r' unbalanced_dict_unpackingr c | | t |j d t j t j f sdS |j d }t d |D rdS t j |j
}|| ||| dS dS # t j
$ r Y dS w xY w)zCheck unbalanced tuple unpacking for assignments and unpacking
non-sequences as well as in case self/cls get assigned.
r Nc 3 J K | ] }t |t j V d S r r r
s rd r z0VariablesChecker.visit_assign.. s. GGVz&%-00GGGGGGrc )_check_self_cls_assignrr ry r r0 r+ iteredr r r r _check_unpackingrn InferenceError)rC r ry r s rd visit_assignz VariablesChecker.visit_assign s
##D)))$,q/EK+DEE F,q/((** GGwGGG G G F '
33H#%%hg>>>>> $#% FF s 2B: :C
C
nodes.ListCompc V | j t |d dS )z5Visit listcomp: update consumption analysis variable.rE Nr0 r s rd visit_listcompz VariablesChecker.visit_listcomp rG rc c 8 | j dS )z5Leave listcomp: update consumption analysis variable.Nr? r@ s rd leave_listcompz VariablesChecker.leave_listcomp rB rc c 0 | | d S r r r s rd leave_assignz VariablesChecker.leave_assign r rc
nodes.Withc 0 | | d S r r r s rd
leave_withzVariablesChecker.leave_with r rc nodes.Argumentsc D |j D ]}| | d S r )rb ra )rC r
annotations rd visit_argumentsz VariablesChecker.visit_arguments s5 0 9 9J , ,Z 8 8 8 8 9 9rc c > t | j j j S r )r r r( analyse_fallback_blocksrX s rd r z)VariablesChecker._analyse_fallback_blocks s DK&>???rc
Iterable[str]c $ | j j j S r )r r( ignored_modulesrX s rd _ignored_modulesz!VariablesChecker._ignored_modules s {!11rc c > t | j j j S r )r r r( allow_global_unused_variablesrX s rd _allow_global_unused_variablesz/VariablesChecker._allow_global_unused_variables s DK&DEEErc c d}t |t j r| d |u r| |j j v p7| |j j v p)| |j j v p| |j j u p
| |j j u pd|j
| pJ|j o|j
| p)|j o"| |j u p|j
| }|S )NFTrh )
rr r r rt r r posonlyargs_annotationskwonlyargs_annotationsvarargannotationkwargannotationr
decoratorsreturns)r r %in_annotation_or_default_or_decorators rd r z0VariablesChecker._defined_in_function_definition s 16- ue / 0 0 d++u44 EJ 22 :uz AA:uz @@: uz ::: uz 99 :''-- $I)9)C)CD)I)I M Q .O%-2I2I$2O2O
2 54rc c 6 | }| j }|||u rdS t |t j r ||j urdS t |t j r ||j urdS t |t j r|j r||j d u sdS |}|j }|dS )zReturn True if node within a lambda/comprehension body (or similar) and thus
should not have access to class attributes in frame.
NFTr ) r rr r r r
Comprehensionr rf rg )r r rn r s rd _in_lambda_or_comprehension_bodyz1VariablesChecker._in_lambda_or_comprehension_body s u&%,//
E4L4Lt&%"566
5 ;S;St&%":;;
!
&+v/@/C&C&C tE]F! " urc r r r r r tuple[bool, bool, bool]c
d}d} d}
||urt || }n"|j 0 j |j v s t j j d rd}nt
|t j p-t
d t j
ot } | sV|
j d r$d}||k ot
t j }
n< j |j v r.t! fd| D }|dk rtt
|t j rZ j |j v rLt
t j o. j v o%|j j d j |j k }nt
|t j rt
|t j r |j u rZ| |j r@d} |j j |j v r)|j j d j |j k rd}nd}t
j t j r|j |j k }n|rd}n|o|j |j k }|r|j |j k rt
|t j r!||u r | r||urd}n_t
|t2 r;t4 | r!||u r | r||u rd}nt
t j r||u r| | r||u r؉j j k rj j k sj j k srt< sj j k rt
|t j t j t j! t j" f rUt
|j# t j$ r6j# u p,t! fd % D }t
|t j& t j' f rt
|j t j( rtS | rtS s|j } tU j+ t j }
|
r tU j+ |
t j su| }|s^| , r&tU j- j | j. d }n t! fd | j. D }|sd}|| |
fS )
NTFr[ rh c 3 h K | ],}t |t j o
j |j v V -d S r rk rm s rd r z:VariablesChecker._is_variable_violation... sQ . . uen55R$)u{:R. . . . . .rc r; r c 3 * K | ]
}|j u V d S r )r )r ancr s rd r z:VariablesChecker._is_variable_violation.. sC G G14w},G G G G G Grc c 3 L K | ] }t j j | V d S r )r
is_definedrg )r contentr s rd r z:VariablesChecker._is_variable_violation.. sF 5 5 $+ !& 0G D D5 5 5 5 5 5 rc )/r r rg r rn builtin_lookuprr r r r r r r lookupr rp r r{ r r defaultsr r r r NODES_WITH_VALUE_ATTRr| _maybe_used_and_assigned_at_oncer
col_offsetr r r r r r JoinedStrr r rs r r r r has_elif_blockr r )r r re r r r r r r r r
forbid_lookupdefstmt_parentmaybe_annotationused_in_branchdefined_in_or_elses `` rd r z'VariablesChecker._is_variable_violation s0 # ! $ "6tUH"M"M
_
$ X 111)$)44Q7 2 ',# 5%"344 E djjj 5 5u|DD * $D))
!
X]]__%;%;DI%F%Fq%I
&+#'+w (zU 0@ @ <$$ ho--*- . . . .!)!6!6!8!8. . . + + '#
x ' '5%.11
( U\)) 7EO44 OG ,,OL+A.9G>2(II'RR2 )) **400 *
+0'' ' )) **400 * $Ndk 9 9 ' 2T_ D D #NT[ 8 8
!* 9 !($+ = = * '$)L$)O$)O$)L !"! ! !> !+7=%/ J J !>& +2-4*? +3 G G G G8<8K8K8M8MG G G D D' 7U\53C$DEE
7 w~ux88
7 +733
7 /t44
7 ") #(#H%/$ $ %7 =(%*; 7 &4%=%=d%C%CN) 7)88:: 161A $ >+@+C2 2 . . 25 5 5 5 5 /=/D5 5 5 2 2 .
2 726 /"$57KKKrc c t | t j r t d | j D S t | t j rdS t | j t j r#t d | j j D S | j }t |t j rdS t |t j r!t |j
t j rdS t |t j r t d |j D rdS t |t j
sdS t d | t j
D S )zeCheck if `defstmt` has the potential to use and assign a name in the
same statement.
c 3 $ K | ] }|j V d S r )guard)r cases rd r zDVariablesChecker._maybe_used_and_assigned_at_once.. s$ <. sc c#8EK;U#UVV AA#FF rc c 3 K | ]D}t |d t j p t |d t j V EdS )r r[ Nrr r r )r items rd r zDVariablesChecker._maybe_used_and_assigned_at_once.. s[ 1
1
tAw , , P
47EK0P0P1
1
1
1
1
1
rc Fc 3 K | ]}t d |j D p`t d |j D pBt |j t
j o#t |j j t
j V dS )c 3 T K | ]#}t |j t j V $d S r )rr r r r )r kwargs rd r zNVariablesChecker._maybe_used_and_assigned_at_once... s0 PP
5; 44PPPPPPrc c 3 J K | ] }t |t j V d S r r )r args rd r zNVariablesChecker._maybe_used_and_assigned_at_once... s. EEC:c5;//EEEEEErc N) r keywordsr rr r r r4 r5 r )r r s rd r zDVariablesChecker._maybe_used_and_assigned_at_once.. s
PP$-PPP P P
EE49EEEEE
49eo66 < ty~u{;;
rc )ry )rr r r r casesr r
BaseContainerr r r r* r r r )r r s rd r z1VariablesChecker._maybe_used_and_assigned_at_once s
gu{ + + =<>
rc c t |t j r|j rdS j | j j j v st j j rdS |
d }
d }}||j urv| }|
t j D ]z}||u rt fd|
t j D r;t fd|
t j D r dS {|j j g }|D ] ||k r j j k r n{t j t j r j j rOt j t j r-t fd D s dS |j }||j uvdS )z>Check if variable only gets assigned a type and never a value.FTrh c 3 4 K | ]}j |j v V d S r )rg r )r nlr s rd r z. s@ I) rc c 3 8 K | ]}j |j k V d S r r )r anr s rd r z. s@ I( rc c 3 4 K | ]}|j j u V d S r )r r )r r ref_nodes rd r z. s> 9<x 44 rc )rr r r r rg r r( r r r r r r r r r rl r rp rq r r r )
rC r r
defstmt_frame
node_framer r
inner_func
local_refsr% s
` @rd r z)VariablesChecker._is_only_type_assignment sg '5?33 w} 5 9 *> > >%BR IC
C
> 5
T
22
ZZtZ,,
M 000!<<>>L + 9 9%:K L L
!
!
-- ( 7 7 G G ! ( 7 78H I I ! !55%,00B??J &
!
! !J..8?T[3P3PE #8?EODD ! , ! x@@ ! @D@S@S@U@U ! !55!(FW M 000X trc r r` c | d j |k r| d | d k rt j | r0t j | st j dfS t j dfS t | j t j r2t | j j t j rt j dfS t j |fS )zCheck if a first level method's annotation or default values
refers to its own class, and return a consumer action.
Trh N)
r r rt r "is_node_in_type_annotation_contextr rZ r` ra rr r r r )r r r s rd r z/VariablesChecker._is_first_level_self_reference' s ::T: " " )W 4 4 :H :
:
ZZtZ
$
$:% :%
7==
B sp ( )<==
mU[ 1 1 "d**w.:O/O/Ot "e++>;N0N0Nturc c z |j }| d }| || }t j || }|s|r |j j }n|j }t |t j
s|o| || o||v S )a Return True if the node is in a local class scope, as an assignment.
Detect if we are in a local class scope, as an assignment.
For example, the following is fair game.
class A:
b = 1
c = lambda b=b: b * b
class B:
tp = 1
def func(self, arg: tp):
...
class C:
tp = 2
def func(self, arg=tp):
...
class C:
class Tp:
pass
class D(Tp):
...
Trh ) rg rt r r r r r rp rr r r r )rC r rg r r in_ancestor_list frame_localss rd r z$VariablesChecker._ignore_class_scopeM s 0 yd++1133040T0T %1
1
- !1%>> 0 (4D ( <--//6LL .x s' TTT'!]:S:ST!TTTrc r[ c 3 f K | ]+}| V ,d S r )r r )r asmtr s rd r z1VariablesChecker._loopvar_name.. sJ 3
3
.2DJJLL " "5 ) )3
3
3
3
3
3
rc r Trh r r ztyping._SpecialFormzbuiltins.enumerater r )>tDD
5 GG RaRjG ,, ! !GAtay""$"//99
.vay/B/B$/B/O/OQUVV
NN4 v;;! F&&(( v 5+>@R S T T --T^^4^5P5PPP F&%),, 6TYT R R R F IEL%+u{ENS
)UZ00
Z6 6
!& 0 1E F F
}e.?@@ %- ',&6}7L&M&MO!'): )//11 6(6%6 .6
#?ENCC + 1 1 3 37L L L .D
s' HH5$%------HHrc r&
imported as import r r imported from as r c 3 . K | ]}|j k V d S r r )r rc rg s rd r z4VariablesChecker._check_is_unused..g
sB D D#$$D D D D D Drc )#rZ rr r r r rp r r r rs r r argnamesrg r r{ r7 _check_unused_argumentsr r r0 r r r~ r r r rm r r is_overload_stubru r r r3 )rC rg r re r rk rl rU is_init_defrc r? r import_names message_namemsgs ` rd ri z!VariablesChecker._check_is_unused
s% t , , F
tU . / / ##DK ,--224;{3A6GG 3
F dU\5<9I J K K
6t\ J J
- - - F 4. . . F==?? 8 yI%% # 1133 A")!V"4"4"O!&J:NK" F ( (tT8^ T T T T T{
z elEOU[%) T
>))F ! !EF$ u/? @AA
+tz??Q&&#'HHHHDJHHH$$ $LL $(:a=L +$0ME6!?UD*4 >>
1 9 dEL11 )!& = =V = = . . .$$_3T$JJJF dE$455 )!& Q Qt| Q Q Q Q!% D Ddl D D$$_3T$JJJF 0 $ 122
t
%d++
$+u':;;
D D D D(, (B(B5:(N(ND D D A A
\4 @ @ @ @ @rc &re.Pattern[str] | re.Match[str] | Nonec | j j j }t |t j r t |j t j st |t j r| j j j }n|}|o| | S r )
r r( dummy_variables_rgxrr r r r r ignored_argument_namesmatch)rC re rg authorized_rgxregexs rd rZ z!VariablesChecker._is_name_ignoredn
s +? tU - . . #4;88 # $00 #
&*[%7%NEE"E *T***rc rU list[str]c }j d }|r=t |t j r#t
j | rt nt }nt }|rfj dk r||d k rd S t |j
} | || v rd S j
t j v r j
dvrd S t! fd| j j j D rd S t
j rd S t
j rd S t
j | rd S ||v rd S | d||| d S ) NTrh r r )rD rN c 3 K | ]8}j | pj | V 9d S r )rg r r )r cbr s rd r z;VariablesChecker._check_unused_arguments..
s\
I $ $ > (:(:2(>(>
rc r rv )rd r r rr r r r has_known_basesr r r r r rg rU PYMETHODSr r r( r (is_registered_in_singledispatch_functionrW is_protocol_classr )
rC rg r re rU rk rd ry rs
overriddens
` rd rV z(VariablesChecker._check_unused_arguments
s NN$$ !!!.. E5>:: " 25 9 9P ?P
J J yN**tx{/B/B*5$)< ! ! F *DZXXXXXrc c | j d sdS | d }t j || r|j d }t
|t j t j f r|j
|j v rdS | |j
\ }}|r|
| sdS t j | r | d||j
dS |d }|}|rCt
|t j s)||u rdS |j }|rt
|t j )|r}|
| rjt j | sX|j rSt
| d t j s'| d||j
dS dS dS dS dS dS )a: Check whether node is a cell var that is assigned within a containing loop.
Special cases where we don't care about the error:
1. When the node's function is immediately called, e.g. (lambda: i)()
2. When the node's function is returned from within the loop, e.g. return lambda: i
r% NTrh r r r )r rX r r r r rr r r r rg rp r r is_comprehensionr r is_being_calledrt r )rC r
node_scope assign_scoper assignment_node maybe_fors rd r z,VariablesChecker._check_late_binding_closure
s> {--.BCC FZZtZ,,
$T: 6 6 >#*000==J : e6G'HII yJ --- F "kk$) 4 4 e L 2 2: > > F !, / / V 149 M M M M M $AhO'I
VJy%)$D$D
V ,,E % ,
VJy%)$D$D
V V!++J77V " 1* = =V #) V
'z';';4';'H'H%, W W V $$%949$UUUUUV V V V V V V V V Vrc c j t |t j sdS |j | j j j v S r )rr r rs rm r r( redefining_builtins_modules)rC re s rd r z1VariablesChecker._should_ignore_redefined_builtin
s1 $ 011 5|t{ 1 MMMrc c ( || j j j v S r )r r( allowed_redefined_builtins)rC rg s rd r[ z+VariablesChecker._allowed_redefined_builtin
s t{)DDDrc c t j | t j }|duo(| d | S )z]Return True if a ComprehensionScope intervenes between `node` and its
frame.
NTrh )r r r rf r r )r closest_comprehension_scopes rd r} z6VariablesChecker._comprehension_between_frame_and_node
sZ
',&K %*'
'
# +$6 14:: . s5 +
+
*JO+
+
+
+
+
+
rc )rr r r3 r r rg r4 ra r5 Subscriptr
TYPING_MODULEextendr )rC rz s rd ra z,VariablesChecker._store_type_annotation_node
s4 ouz 2 2 ' . ./C D D D F ou 7 7 , ,_-A B B B F/5?;; F
,eo > > ?05uzBB %*/=@@ ' . .} = = = F #** +
+
.=.L.LUZ.X.X+
+
+
rc %nodes.For | nodes.Assign | nodes.Withc P |j }|sd S | |j d S r )rz ra )rC r rz s rd r z-VariablesChecker._store_type_annotation_names s6 . F (()=>>>>>rc c t }|j D ]u}t |t j r| |j 7t |t j r$| d |j D v|
}t d |j D }|r+|
j
}t |t j r*| rd| vsdS | }|sdS |d }||v r| d||f dS dS )z'Check that self/cls don't get assigned.c 3 X K | ]%}t |t j |j V &d S r )rr r r rg r s rd r z:VariablesChecker._check_self_cls_assign.." sJ $ $!$z#uGW7X7X$H$ $ $ $ $ $rc c 3 N K | ] }t |t j |V !d S r )rr r rl )r rn s rd r z:VariablesChecker._check_self_cls_assign..& sG '
'
Zu~-N-N'
'
'
'
'
'
'
rc zbuiltins.staticmethodNr r' rm )r ry rr r r r rg r0 updater r r r r r rd decoratornamesrU r )rC r assign_namesrz r nonlocals_with_same_nameargument_names
self_cls_names rd r z'VariablesChecker._check_self_cls_assign s (+ l F&%"233
----FEK00
## $ $(. $ $ $
#& '
'
$z'
'
'
$
$
$ 0JJLL'--//E
ue / 0 0 !! (u/C/C/E/EEE F )) F&q)
L ( ( 2]DT U U U U U ) (rc r r ry c j t j | rdS t j | rdS t |t j rdS t |j t j r;t |j t j
r |j j |j j k rdS |
| }t || }|=t | t | k r| ||||| dS dS t j | s| || dS dS )zRCheck for unbalanced tuple unpacking
and unpacking non sequences.
N)r is_inside_abstract_classrn rr r UninferableBaser r r r r3 rg varargr r r r is_iterable _report_unpacking_non_sequence)rC r r ry r r s rd r z!VariablesChecker._check_unpacking9 sH )$ / / F !$ ' ' F h 4 5 5 F x 8 8 4:uz22
8?#999
F &&x00+D(;; 7||s6{{**11(GVW +*
"8,, ? / /g > > > > > ? ?rc rf c P t | t j t j ft z r| S t | t j rIt d | D r d |
D S dS )z/Return the list of values of the `Assign` node.c 3 F K | ] }| d k V dS )ztyping.NamedTupleN)r? )r r s rd r z4VariablesChecker._nodes_to_unpack.._ sC 6
6
8@HNN 3 36
6
6
6
6
6
rc c F g | ] }t |t j | S rb )rr r r r s rd rK z5VariablesChecker._nodes_to_unpack..b s* PPP!
1e>N0O0OPAPPPrc N) rr r r0 r+ r r rn r@ r ancestorsr )r s rd r z!VariablesChecker._nodes_to_unpackZ s dU[%* 5
B C C !;;== dG , - - Q# 6
6
DHNNDTDT6
6
6
3
3
Q QPt{{}}PPP Ptrc r r c
|t | t | dk rdndt | t | dk rdndf}t |t rdnd}| |||t d S )Nr[ r r8 r) r )r r rs )r rr r r r )rC r r ry r r r symbols rd r z-VariablesChecker._report_unbalanced_unpackinge s
LLg,,!##BB KKf++""BB
(J//
. ' '-
d)LLLLLrc c n |r| d sd| }| d|| d S )N r# rm )r r )rC r r s rd r z/VariablesChecker._report_unpacking_non_sequence| sL $7--c22 $#'mmG 17KKKKKrc _base_nodes.ImportNoderu module_namesnodes.Module | Nonec X |r| d }|dk rd}n t | | d }t |t
j sdS nW# t j $ r4 |j | j
v rY dS | d||j f| Y dS t j $ r Y dS w xY w||r:|r|j nd}| d|d
| |f dS t |t
j r|S dS )zCheck that module_names (list of string) are accessible through the
given module, if the latest access name corresponds to a module, return it.
r __dict__Nr r r rm )r% r~ r r rr r r rn rw rg r r r rP )rC r ru r rg rm s rd r z$VariablesChecker._check_module_attrs s ##A&&Dz!!
fnnT 2 21 5 ; ; = =>>!&%,77 4 (
;$"777 44 'tV[.A ! tt)
tt
! $ %+;fkkG #$chh|6L6Lg5V
4 fel + + Mts AA9 9 C
C
;C
C
r r c t | d }t |t j rd S | dvr)|j |j }}| d||| d S t |dd D ]} t |
}n# t j $ r Y 7w xY wt |t j rV|j
s^t |t j rt |j t" s+| d| | |j }||v r||= ||j vr|j s| d |f| t* j |j d
}t* j | d k rx|j d z |z } t j | d # t< $ r | d |f| Y t> $ r Y w xY wd S )
Nr# >
builtins.listbuiltins.tupler )r] r r r rb r r r r rD r ) r~ igetattrrr r r pytypetolinenor r r r rn r r r r r rh r rp r* ospathsplitextr basenamerg modutilsfile_from_modpathr ImportError SyntaxError)
rC r r assignedr] colr elt_namer rg s
rd r& zVariablesChecker._check_all s
i0011 h 4 5 5 F ?? $G G G )8+>#D 1SW X X X F8VR00 ) ! ) !C
,,)
(D$899
?
h 44
J= =
!5CMMOORU VVV ~H<'' *t{**| !$$0{ % "w / / : :1 =Hw''11Z?? #y3 9
! # , > >tzz# O O O O * , , 8{QT - + ! ! ! !D !K) ! ) !s* !B55CC 2H#I: IIdict[str, nodes.NodeNG]c | j rd S | D ]#\ }}|D ]}| d|f| $d S )Nr r )r r r )rC r rg node_lstr s rd r' z VariablesChecker._check_globals sw . F * 0 0 2 2 M MND(
M
M !2$t LLLL
M M Mrc c t | }t }t j t }|D ]\ }}|j D ]}|d x}} | dk r|}|d }
||v r"|||
fvr)| | | | j v p|
| j v } |
o4| j j j
o#| j j j
|
} t |t j s!t |t j ry|j srt |t j rt" | r| s| r|
d| }
n| d|
}
t' | s| d|
| 4t |t j r|j t* k rt" | rzt- || r| s| r| dk r$||j |f | |
| d|j }
n| d|j d |
}
t' | s| d|
| | D ]y\ }}t3 | dk r |d }n2d
d |d d D d
|d }| d||d f|d z| `d S )Nr r r[ rQ rP r r rR rS rN c 3 K | ]}|V d S r rb r s rd r z2VariablesChecker._check_imports..5 s" = =q = = = = = =rc r z and r ) r r r? r r@ r r r r r( r^ r` rr r r rs rm SPECIAL_OBJsearchr r rt rw r r r rP r )rC r local_namescheckedunused_wildcard_importsrg re r real_name
imported_nameas_nameis_type_annotation_importis_dummy_importr[ ru unused_list
arg_strings rd r+ z VariablesChecker._check_imports s &|44 %%
#D ) ) & D S D SJD$ : C
S C
S,3AJ6 M C'' $I!!* '' 7 333 I&&& "T%@@ > $"== * N *>N *>DDWMM dEL11 -S tU%566-S?C|-S "$(899 !k>P>P%? ? !
!0 !O ! ! 7
7 7!. F FW F F1$77 O (( s(NNN e&677 SDLF>##(D(,,T488 )-)9$$B$)?
% aA * . .tR 8 8 "- J!(EL88 t(<=== $ 9
%0$6$:$:4$D$D !%:
!$+u|;; EE < M M 000#D)) 14;-AAA
1TG L L Lrc nodes.Subscriptc d t j |j }| || d S r )r r slice _check_potential_index_errorrC r inferred_slices rd visit_subscriptz VariablesChecker.visit_subscript s0 )$*55 ))$?????rc r nodes.NodeNG | Nonec P t |t j rt |j t sdS t |j t j t j f rDt |j j |j dz k r | d|t dS dS )z,Check for the potential-index-error message.Nr[ r( rr ) rr r r r intr0 r+ r r r r r s rd r z-VariablesChecker._check_potential_index_error s
.%+66 j #?
?
F dj5;
"; < < 4:?##n&:Q&>>> +$9 !
F
rc nodes.Constc | dk rdS t j | sdS |j }t |t
j r|j }t |t
j r;t | d }|t j
|d rdS t |j }|
| dS # t $ r Y dS t j $ r Y dS w xY w)zTake note of names that appear inside string literal type annotations
unless the string is a parameter to `typing.Literal` or `typing.Annotation`.
z builtins.strN) AnnotatedLiteral)r r r+ r rr r r0 r} r~ r{ is_typing_memberr r ra
ValueErrorrn AstroidSyntaxError)rC r r originr s rd visit_constz VariablesChecker.visit_const s ;;==N * * F7== F fek * * #]F feo . . &--//66F!e&<0' '! %dj11J , ,Z 8 8 8 8 8 DD) DD s /)C
C9'C98C9r r$ ri r< )r r ri r< )r r ri r< )r r- ri r< )r r9 ri r< )r= r9 ri r< )r rC ri r< )r= rC ri r< )r rJ ri r< )r= rJ ri r< )r rO ri r< )r= rO ri r< )r r ri r< )r rp ri r< )r r ri r< )r r ri r< )r r ri r< )r r ri r< )r r re r ri r< )r r r7 r; r r ri r ) r r re r r rz r r; r rh ri r )r r ri r< )r rf ri r< )r r ri r< )r r ri r< )r= r ri r< )r r ri r< )r r ri r< )ri r )ri r )r r r r ri r )r r r r re r r r r rz r rz r rh r r ri r )r r ri r )r r r r ri r )r r r r- r r` ri r )r r, r- r. ri r )r r ri r )r r4 ri r< )rg rh r r re r r r rk r rl r ri r< )re r rg rh ri r\ ) rg rh r r re r rU rc rk r ri r< )r r ri r< )re r ri r )rg rh ri r )r r ri r )rz r ri r< )r r ri r< )r r r r ry r` ri r< )r r ri rf ) r r r r ry r` r r` r rh ri r< )r r r rh ri r< )r r ru r r rc ri r )r r r r ri r< )r r ri r< )r r ri r< )r r ri r< )ry r- r r ri r )r r ri r< )r r r r ri r< )r r ri r< )Ur\ r] r^ r_ rg r1 msgsIGNORED_ARGUMENT_NAMESoptionsrD r only_required_for_messagesr r r! r, r1 r8 r< rA rF rI rL rN rQ rS r^ ro visit_asyncfunctiondefleave_asyncfunctiondefr r r r r r r r r r r r r r r r r r" r r r r r r r r r r r r r ri rZ rV r r r[ r} ra r r r r r r r r& r' r+ r$ r r r r
__classcell__)r s @rd r| r| t s D D
%"
"X %<
" 3!
) (1
* 3.
"
%1 %T
, %a
) 3B
[VGp3 3 3 3 3 3 &U%# X X X X@0 0 0 0 P P P P &U% ) ) ) )(> > > > (? ? ? ?
F F F F
F F F F
F F F F
&L &L &L &LP, , , ,\ / .%U%#& ?M ?M ?M ?MB" " " "
!
!
!
! &U%&<==
C
C
C >=
C &U%&<==/ / / >=/
.N .N .N .N`% % % %PHA HA HA HAT &U%&9::> > > ;:>, &U%&9::D D D ;:D4 &U%$ #
,F F F F
0 0 0 00 0 0 09 9 9 9
@ @ @ _@ 2 2 2 _2 F F F _F 5 5 5 \52 \8 |L |L |L \|L| "
"
"
\"
H< < < <| A A A \A, \ &
&
&
&
RNW NW NW NWbeA eA eA eAN+ + + +"3Y 3Y 3Y 3Yj0V 0V 0V 0VdN N N N
E E E E 1 1 1 \ 1
2? ? ? ? V V V V< ? ? ? ?B \M M M M.L L L L
# # # #J3! 3! 3! 3!jM M M MW W W W r ) ) ) )4 4 4 4l@ @ @ @
& &U% rc r| r r$ r< c J | t | d S r )register_checkerr| )r s rd registerr s%
,V 4 455555rc )re rf rg rh ri rj )ry rz rg r{ ri r| )r r r r ri rh )r r r rz r rz ri r )r r rg rh ri r )r r ri r )rg rh r rz ri r )re r r r ri r )r r ri r )r r ri r )re r r r ri r r )`r_ r% r r? r> r r resysr collections.abcr r r enumr functoolsr r( r
r r rn r
r r r
astroid.nodesr astroid.typingr pylint.checkersr r pylint.checkers.utilsr r r pylint.constantsr r r pylint.interfacesr r r r
pylint.typingr version_infor" astroid.decoratorsr# pylint.lintr$ compiler rt r r rA r~ frozenset TYPING_NAMESr
DictValuesDictKeysr node_classesr* r r r r r r r r rZ rw r r r r r r r r r r r1 r9 r3 r; r| r rb rc rd r sH
* ) ) " " " " " "
# # # # # # 9 9 9 9 9 9 9 9 9 9 1 1 1 1 1 1 1 1 1 1 4 4 4 4 4 4 4 4 4 4 4 4 % % % % % % * * * * * * . . . . . . . .
F E E E E E E E E E N N N N N N N N N N N N 0 0 0 0 0 0v )))))))DDDDDD %$$$$$$bj+,, #$<== ' .
y6 6 68 8 v O O O M #
L O O J L K
$
4 & .O* O* O* O*d- - - -+@ +@ +@ +@\ , 6 6 6 6 $P+ P+ P+ P+( )P+2 3P+< =P+F GP+R SP+` aP+n oP+z {P+D EP+N OP+X YP+d eP+n oP+x yP+H -$H BCD 0 U >?@ UP+ P+ P+ P P P Pf J A A A A A A A A JC! C! C! C! C!{ C! C! C!LB6 6 6 6 6 6rc