1j{V \ U d Z ddlmZ ddlZddlmZ ddlmZ ddlm Z ddl
Z
ddl
m Z ddl m
Z
dd lmZmZ dd
lmZ e rdd lmZ d d
ddddddddd
Zded< ej d Z eddh Zd Zd Z d Z ed Z d7d$Z d8d(Z d9d*Z!d:d.Z"d;d0Z# G d1 d2e
Z$d> 13C D D D44 E ? udiikk())K_*
i . . '!I)glG4E%FGG i . . & >DD %D ) ) ) $ $%; < < * ;..44 5 bool_op nodes.BoolOpintc d}| D ]4}t |t j r|t | z
}/|dz
}5|S )zCounts the number of boolean expressions in BoolOp `bool_op` (recursive).
example: a and (b or c or (d and e)) ==> 5 boolean expressions
r ) get_childrenr2 r3 BoolOp_count_boolean_expressions)rC nb_bool_expr bool_exprs r@ rJ rJ s_
L ))++ i 0 0 6y A A ALL A LL rB nodes.ClassDefc t d | D }| D ]1}t |j r|j dk r|dz
}2|S )Nc 3 N K | ] }|j d dV !dS _rG Nr8
startswith.0methods r@ z*_count_methods_in_class.. s8 XXFFK !! <<>>_ , , LLL KK f . .e . < < = = =
>
>
>
>
>rB set[nodes.ClassDef]c < t t | | S N)r/ rl )r% r` s r@ _get_parentsrp s 77 8 88rB c 4 e Zd ZdZdZeZddddddfd d
ddd dfd d
ddddfddddddfddddddfddddddfdddd d dfd dddd dfd d!ddd"dfd#d$ddd%dfd&dddd'dfd(g d)d*d+dff ZdW fd0 ZdXd1Z dYd3Z
e d4d5d6d7 dZd: Z e d6d7 dZd; Z
e dd?d@dA d[dC ZeZ e dd?d@ d[dD ZeZd\dGZd]dIZd^dKZd_dMZ e dNd= d`dP Zd`dQZdadSZeZdbdcdVZ xZS )dMisdesignCheckerzChecker of potential misdesigns.
Checks for sign of poor/misdesign:
* number of methods, attributes, local variables...
* size, complexity of functions, methods
designzmax-args rE zz2Maximum number of arguments for function / method.)defaulttypemetavarhelpz
max-locals z4Maximum number of locals for function / method body.z max-returns zz2Maximum number of parents for a class (see R0901).zignored-parents csvz%zOList of qualified class names to ignore when counting class parents (see R0901)zmax-attributesz5Maximum number of attributes for a class (see R0902).zmin-public-methods z9Minimum number of public methods for a class (see R0903).zmax-public-methods z9Maximum number of public methods for a class (see R0904).z
max-bool-exprzEMaximum number of boolean expressions in an if statement (see R0916).z exclude-too-few-public-methods
regexp_csvz[,...]zfList of regular expressions of class ancestor names to ignore when counting public methods (see R0903)linterr r' Nonec V t | | | | d S ro )superrX )selfr __class__s r@ rX zMisdesignChecker.__init__ s3
@ rB c | j j g | _ t t
| _ g | _ | j j j | _
dS )zInitialize visit variables.N) r statsreset_node_count_returnsr rE _branches_stmtsconfig exclude_too_few_public_methods _exclude_too_few_public_methods)r s r@ openzMisdesignChecker.open sO **,,,
$S)) K =
,,,rB amountc d t | j D ]\ }}| j |xx |z
cc< d S ro ) enumerater )r r irQ s r@ _inc_all_stmtsz MisdesignChecker._inc_all_stmts sC dk** % %DAq KNNNf $NNNN % %rB r
r r r r% rM c t |t | j j j }t
| }|| j j j k r)| d||| j j j f t
|j | j j j
k r=| d|t
|j | j j j
f dS dS )zFCheck size of inheritance hierarchy and number of instance attributes.r
r% argsr N) rp STDLIB_CLASSES_IGNORE_ANCESTORunionr r r` len max_parents add_messageinstance_attrsmax_attributes)r r% ri
nb_parentss r@ visit_classdefz MisdesignChecker.visit_classdef s * 0 01C1S T T
\\
*6 6 6 $ $+"4"@A
t" # #dk&8&G G G .$-.. 0B0QR
H GrB c H t d | D }|| j j j k r)| d||| j j j f |j dk rA| j r:| D ]%t fd| j D r dS &|j dk st | rdS t | }|| j j j k r+| d||| j j j f dS dS )z Check number of public methods.c 3 N K | ] }|j d dV !dS rP rR rT s r@ rW z2MisdesignChecker.leave_classdef.. sK
FK4J4J34O4O
rB r r classc 3 f K | ]+}| V ,d S ro )matchr+ )rU patternr= s r@ rW z2MisdesignChecker.leave_classdef.. sM MM(.."2"233 rB Nr )
rY r[ r r max_public_methodsr rv r r* anyrA r_ min_public_methods)r r%
my_methodsr^ r= s @r@ leave_classdefz MisdesignChecker.leave_classdef s
NN , ,
*= = = ) $+"4"GH
9 D$H NN , ,
#'#G FF 9 #A$#G#G F
.d33 +> > > (!4;#5#HI
? >rB r r r r r zkeyword-arg-before-varargnodes.FunctionDefc r | j d |j j }| j j j |}d}rt
fd|D }t | |z
}|| j j j k r6| d|t | | j j j f nd}t |j
|z
}d|j
v r|dz }|| j j j k r)| d||| j j j f | j d dS ) zeCheck function name, docstring, arguments, redefinition,
variable names, max locals.
r Nc 3 P K | ] } |j d V !dS )rG N)r r8 )rU argignored_argument_namess r@ rW z5MisdesignChecker.visit_functiondef.. sM ' ' )?)E)Ech)O)O'' ' ' ' ' 'rB r r rQ rG r )
r appendr r r r rY r max_argsr r1
max_localsr )r r% r ignored_args_numargnumlocnumr s @r@ visit_functiondefz"MisdesignChecker.visit_functiondef su
Q y~!%!3!J %
#& ' ' ' '!%' ' ' $ $ YY!11F *333 ( d))T[%7%@A ! ! T[!!$44 $+ aKF DK&1 1 1 ! dk 0 ;<
1 rB c | j }|| j j j k r)| d||| j j j f | j | }|| j j j k r)| d||| j j j f | j }|| j j j k r+| d||| j j j f dS dS )zlMost of the work is done here on close:
checks for max returns, branch, return in __init__.
r r r r N)
r rf r r max_returnsr r max_branchesr max_statements)r r% returnsbranchesstmtss r@ leave_functiondefz"MisdesignChecker.leave_functiondef! s -##%% T['3 3 3 , t{ 1 =>
>$' dk(5 5 5 # 2 ?@
!! 4;%4 4 4 %T[ / >?
5 4rB rQ nodes.Returnc B | j sdS | j dxx dz
cc< dS )zCount number of returns.NrG )r )r rQ s r@ visit_returnz MisdesignChecker.visit_returnE s5 } F
bQ rB nodes.NodeNGc B |j r| d dS dS )zXDefault visit method -> increments the statements counter if
necessary.
rG N) is_statementr r r% s r@
visit_defaultz MisdesignChecker.visit_defaultK s3 # " " " " " # #rB nodes.TryExceptc t |j }|j r|dz
}| || | | dS Increments the branches counter.rG N)r handlersorelse _inc_branchr r r% r s r@ visit_tryexceptz MisdesignChecker.visit_tryexceptR sT t}%% ; MH x((( H%%%%%rB nodes.TryFinallyc \ | |d | d dS )r r N)r r r s r@ visit_tryfinallyz!MisdesignChecker.visit_tryfinallyZ s2 q!!! A rB r nodes.Ifc | | d}|j rBt |j dk s%t |j d t j s|dz
}| || | | dS )z?Increments the branches counter and checks boolean expressions.rG r N)_check_boolean_expressionsr r r2 r3 Ifr r r s r@ visit_ifzMisdesignChecker.visit_if_ s
''--- ; q
4;q>7:(N(N MH x((( H%%%%%rB c |j }t |t j sdS t | }|| j j j k r+| d||| j j j f dS dS )zvGo through "if" node `node` and count its boolean expressions
if the 'if' node test is a BoolOp node.
Nr r ) testr2 r3 rI rJ r r
max_bool_exprr )r r% conditionrK s r@ r z+MisdesignChecker._check_boolean_expressionsl s I )W^44 F1)<< $+,: : : . "DK$6$DE
; :rB nodes.Whilec N d}|j r|dz
}| || dS r )r r r s r@ visit_whilez MisdesignChecker.visit_while{ s6 ; MH x(((((rB rG branchesnumc T | j | xx |z
cc< dS )r N)r scope)r r% r s r@ r z MisdesignChecker._inc_branch s. tzz||$$$ 3$$$$$rB r r r' r )r' r )r rE r' r )r% rM r' r )r% r r' r )rQ r r' r )r% r r' r )r% r r' r )r% r r' r )r% r r' r )r% r r' r )rG )r% r r rE r' r ) __name__
__module__ __qualname____doc__r8 r! msgsoptionsrX r r r
r r r visit_asyncfunctiondefr leave_asyncfunctiondefr r r r r r r visit_forr
__classcell__)r s @r@ rr rr s D D
"L
"N
"
"N
"Q
"L
Bi
"
! "
! "
")
- $5E
SsGj
% % % % & !
* 8:STT+ + + UT+Z $ #
' ' ' ' R / $ 6 / # # # #& & & &
>@STT
&
&
& UT
&
) ) ) ) I4 4 4 4 4 4 4 4 4rB rr r r r c J | t | d S ro )register_checkerrr )r s r@ registerr s%
,V 4 455555rB )r% r& r' r( )rC rD r' rE )r% rM r' rE )r% rM r` ra r' rb )r% rM r` ra r' rm r )&r
__future__r re collectionsr collections.abcr typingr r3 r pylint.checkersr pylint.checkers.utilsr r
pylint.typingr pylint.lintr r! __annotations__compiler\ frozensetr: r< r, r- r rA rJ r_ rl rp rr r r~ rB r@ r s8
& % % " " " " " " # # # # # # $ $ $ $ $ $ ' ' ' ' ' ' E E E E E E E E 0 0 0 0 0 0 %$$$$$$
k: : < < < <z bj+,, "K#9:: ' % "+LN" N" b @ !> !> !> !>H9 9 9 9 w4 w4 w4 w4 w4{ w4 w4 w4t 6 6 6 6 6 6rB