Wko U d Z ddlmZ ddlZddlZddlZddlZddlZddlZddl Z ddl
Z
ddl m Z ddl
mZmZmZmZ ddlmZ ddlmZmZmZ ddlmZmZ dd lmZmZm Z m Z m Z m Z m Z m!Z!m"Z"m#Z# ddl$Z$dd
l$m%Z% dd l&m'Z'm(Z(m)Z) dd l*m+Z+m,Z, dd
l-m.Z.m/Z/ ddl0m1Z1m2Z2 erddl3m4Z4 dZ5 ej6 d Z7 e de8 Z9 e de8 Z: G d de Z;e de e9 f Z G d d Z?e de?f Z@ G d d ZA G d d ZB G d de ZCe"d e:e:f ZDe5fdVd$ZEdWd(ZFdXd.ZG G d/ d0e ZH G d1 d2 ZI dYdZd=ZJejK G d> d ZLd?d@iZMdAeNdB< d[dIZO G dJ dKe(eI ZPd\dNZQd]d^dQZRdYd_dTZSeTdUk r eS dS dS )`a A similarities / code duplication command line tool and pylint checker.
The algorithm is based on comparing the hash value of n successive lines of a file.
First the files are read and any line that doesn't fulfill requirement are removed
(comments, docstrings...)
Those stripped lines are stored in the LineSet class which gives access to them.
Then each index of the stripped lines collection is associated with the hash of n
successive entries of the stripped lines starting at the current index (n is the
minimum common lines option).
The common hashes between both linesets are then looked for. If there are matches, then
the match indices in both linesets are stored and associated with the corresponding
couples (start line number/end line number) in both files.
This association is then post-processed to handle the case of successive matches. For
example if the minimum common lines setting is set to four, then the hashes are
computed with four lines. If one of match indices couple (12, 34) is the
successor of another one (11, 33) then it means that there are in fact five lines which
are common.
Once post-processed the values of association table are the result looked for, i.e.
start and end lines numbers of common lines in both files.
) annotationsN) defaultdict)Callable GeneratorIterableSequence)getopt)BufferedIOBaseBufferedReaderBytesIO)chaingroupby)
TYPE_CHECKINGAnyDictList
NamedTupleNewTypeNoReturnTextIOTupleUnion)nodes) BaseCheckerBaseRawFileCheckertable_lines_from_stats)SectionTable)MessageDefinitionTupleOptions) LinterStatsdecoding_stream)PyLinter z.*\w+Index
LineNumberc $ e Zd ZU ded< ded< dS ) LineSpecifsr& line_numberstrtextN__name__
__module__ __qualname____annotations__ i/builddir/build/BUILD/cloudlinux-venv-1.0.10/venv/lib/python3.11/site-packages/pylint/checkers/similar.pyr( r( Q s%
IIIIIr2 r(
LinesChunkSuccessiveLinesLimitsc e Zd ZdZdZd d
Zd S )
CplSuccessiveLinesLimitszHolds a SuccessiveLinesLimits object for each checked file and counts the number
of common lines between both stripped lines collections extracted from both files.
first_file second_fileeffective_cmn_lines_nbr9 r5 r: r; intreturnNonec 0 || _ || _ || _ d S Nr8 )selfr9 r: r; s r3 __init__z!CplSuccessiveLinesLimits.__init__h s! %&&<###r2 N)r9 r5 r: r5 r; r< r= r> )r- r. r/ __doc__ __slots__rB r1 r2 r3 r7 r7 a s: HI= = = = = =r2 r7 LineSetStartCouplec > e Zd ZdZdZdd ZddZddZddZddZ dS )r4 zlThe LinesChunk object computes and stores the hash of some consecutive stripped
lines of a lineset.
_fileid_index_hashfileidr* num_liner< lines
Iterable[str]r= r> c | || _ t | | _ t d |D | _ d S )Nc 3 4 K | ]}t | V d S r@ )hash).0lins r3 z&LinesChunk.__init__.. s( 9 9Cd3ii 9 9 9 9 9 9r2 )rH r% rI sumrJ )rA rK rL rM s r3 rB zLinesChunk.__init__ sD " Q "8__ 9 95 9 9 999
11r2 or boolc Z t |t st S | j |j k S r@ )
isinstancer4 NotImplementedrJ )rA rV s r3 __eq__zLinesChunk.__eq__ s) !Z(( "! !zQW$$r2 c | j S r@ )rJ rA s r3 __hash__zLinesChunk.__hash__ s
zr2 c 8 d| j d| j d| j dS )Nz rG r] s r3 __repr__zLinesChunk.__repr__ s+ X4< X X4; X X$* X X X
r2 c 6 d| j d| j d| j S )NzLinesChunk object for file z, starting at line z
Hash is rG r] s r3 __str__zLinesChunk.__str__ s7
$$,
$
$4;
$
$z
$
$
r2 N)rK r* rL r< rM rN r= r> )rV r r= rW r= r< r= r* )
r- r. r/ rC rD rB r[ r^ r` rb r1 r2 r3 r4 r4 x s /I
2
2
2
2% % % %
r2 c x e Zd ZdZdZddZedd Zedd
Zej dd ZddZ
dS )r5 zA class to handle the numbering of begin and end of successive lines.
:note: Only the end line number can be updated.
_start_endstartr& endr= r> c " || _ || _ d S r@ rf )rA ri rj s r3 rB z SuccessiveLinesLimits.__init__ s "' # r2 c | j S r@ )rg r] s r3 ri zSuccessiveLinesLimits.start s
{r2 c | j S r@ rh r] s r3 rj zSuccessiveLinesLimits.end s
yr2 valuec || _ d S r@ rn rA ro s r3 rj zSuccessiveLinesLimits.end s
r2 r* c ( d| j d| j dS )Nz>rf r] s r3 r` z SuccessiveLinesLimits.__repr__ s E$+EE EEEEr2 N)ri r& rj r& r= r> )r= r& )ro r& r= r> rd ) r- r. r/ rC rD rB propertyri rj setterr` r1 r2 r3 r5 r5 s
#I$ $ $ $ X X Z ZF F F F F Fr2 c H e Zd ZU dZded< ded< ddZdd Zdd
ZddZdS )rE zEIndices in both linesets that mark the beginning of successive lines.r% fst_lineset_indexsnd_lineset_indexr= r* c ( d| j d| j dS )Nz. s$ 99Q!&999999r2 c > g | ]}t |d S r@ )iter)rR irM s r3
z hash_lineset.. s' FFFT%)__FFFr2 )ri rj )r listtuplestripped_linesrange enumeratezipr& r)
IndexErrorr% r5 r4 nameappend) r r
hash2index index2lines
shifted_linesr
succ_linesstart_linenumberend_linenumberindexl_crM s @r3 hash_linesetr s^ T""JK
99'"8999 9 9EFFFFe4D.E.EFFFM#C $788
&
&J%g&r(B(NQR(R S SNNN T a 2"
E u:z:::3 u%%%% { ""s B!!,CC all_couplesCplIndexToCplLines_Tr> c t | D ]}g }| t d }|| v r| | j j | | j _ | | j j | | j _ | | xj dz
c_ | | | t d }|| v |D ](} | | # t $ r Y %w xY wdS )a Removes all successive entries in the dictionary in argument.
:param all_couples: collection that has to be cleaned up from successive entries.
The keys are couples of indices that mark the beginning of common entries
in both linesets. The values have two parts. The first one is the couple
of starting and ending line numbers of common successive lines in the first file.
The second part is the same for the second file.
For example consider the following dict:
>>> all_couples
{(11, 34): ([5, 9], [27, 31]),
(23, 79): ([15, 19], [45, 49]),
(12, 35): ([6, 10], [28, 32])}
There are two successive keys (11, 34) and (12, 35).
It means there are two consecutive similar chunks of lines in both files.
Thus remove last entry and update the last line numbers in the first entry
>>> remove_successive(all_couples)
>>> all_couples
{(11, 34): ([5, 10], [27, 32]),
(23, 79): ([15, 19], [45, 49])}
r N) r keysr r% r9 rj r: r; r popKeyError)r couple to_removetesttargets r3 remove_successiver s1 4 ((**++ a))k!!1>%((++D k!! F
''''
s &C<<
D D ls_1 stindex_1ls_2 stindex_2common_lines_nbc d | j |||z D }d |j |||z D }t d t || D S )a| Return the effective number of common lines between lineset1
and lineset2 filtered from non code lines.
That is to say the number of common successive stripped
lines except those that do not contain code (for example
a line with only an ending parenthesis)
:param ls_1: first lineset
:param stindex_1: first lineset starting index
:param ls_2: second lineset
:param stindex_2: second lineset starting index
:param common_lines_nb: number of common successive stripped lines before being filtered from non code lines
:return: the number of common successive stripped lines that contain code
c Z g | ](}t |j !|j )S r1 REGEX_FOR_LINES_WITH_CONTENTmatchr+ rR lspecifs r3 r z(filter_noncode_lines..D @ ' - -gl ; ; r2 c Z g | ](}t |j !|j )S r1 r r s r3 r z(filter_noncode_lines..I r r2 c 3 ( K | ]
\ }}||k V d S r@ r1 )rR sline_1sline_2s r3 rT z'filter_noncode_lines..N s, XX&6gww'!XXXXXXr2 )r rU r )r r r r r stripped_l1 stripped_l2s r3 filter_noncode_linesr / s * *9y?7R+RS K
*9y?7R+RS K
XX#k;:W:WXXX X XXr2 c V e Zd ZU ded< ded< ded< ded< ded< ded < ded
< d S ) Commonalityr< cmn_lines_nbr fst_lsetr& fst_file_start fst_file_endsnd_lsetsnd_file_start snd_file_endNr, r1 r2 r3 r r Q sf r2 r c r e Zd ZdZeddddfd&d Z d'd(dZd)dZd*dZd+dZ d,dZ
d-d Z d.d Z d/d"Z
d0d%Zd
S )1Similarz-Finds copy-pasted lines of code in a project.F min_linesr< ignore_commentsrW ignore_docstringsignore_importsignore_signaturesr= r> c
t | t r| j j | _ nt j | _ || j _ || j _ || j _ || j _
|| j _ g | _ d S r@ )
rY r linterconfig namespaceargparse Namespacemin_similarity_linesr r r r linesets)rA r r r r r s r3 rB zSimilar.__init__^ sq dK ( ( 2 ![ /DNN % / 1 1DN.7+)8&+<((6%+<(')
r2 Nstreamidr* stream STREAM_TYPESencoding
str | Nonec t |t r |t t || j }n|j } | }n# t
$ r g }Y nw xY w| j t ||| j j
| j j | j j | j j
t | d r | j j nd dS )z)Append a file to search for similarities.Nr line_enabled_callback)rY r
ValueErrorr" readlinesUnicodeDecodeErrorr r r r r r r r hasattrr _is_one_message_enabled)rA r r r r rM s r3
append_streamzSimilar.append_streams s fn - - ) '99CII (I IKKEE! EEE
.0-04**'dk&I&I
s
A AAc x | j j dk rdS | | dS )z=Start looking for similarities and display results on stdout.r N)r r
_display_sims
_compute_simsr] s r3 runz Similar.run s= > .! 3 3 F 4--//00000r2 )list[tuple[int, set[LinesChunkLimits_T]]]c t t }| D ]m}|j }|j }|j }|j }|j }|j }|j } || }
|
D ]} |||f| v s||| f| v r n |
|||f||| fh ng } | D ]!\ }}
|
D ]}|
||f "| |
| S )z'Compute similarities in appended files.)r r
_iter_simsr r r r r r r r itemssortreverse)rA
no_duplicates commonalitynumlineset1 start_line_1
end_line_1lineset2 start_line_2
end_line_2 duplicatecouplessims ensemblescplss r3 r zSimilar._compute_sims s^ BMdBSBS
??,, K *C"+H&5L$1J"+H&5L$1J%c*I$
lJ77BB G G G
E G !<<!<< ;= + 1 1 3 3 ) )NC!
)
) S$K((((
) r2 similaritiesc N | | }t | dS )z(Display computed similarities on stdout.N)_get_similarity_reportprint)rA r reports r3 r zSimilar._display_sims s& ,,\::
f
r2 c
d}d}|D ]\ }}|d| dt | dz
}t | }dx}x}} |D ]\ }}} |d|j d| d | d
z
}|rC|j || D ]3}
||
rd |
dndz
}4||t | d z
z z
}t d
| j D } |d| d| d|dz | z ddz
}|S )z"Create a report from similarities. r
z similar lines in z files
N==:[:z]
z r c 3 4 K | ]}t | V d S r@ lenrR r s r3 rT z1Similar._get_similarity_report.. s( $O$OgS\\$O$O$O$O$O$Or2 z TOTAL lines=z duplicates=z percent= Y@z.2f)r sortedr _real_linesrstriprU r ) rA r r duplicated_line_numbernumberr couples_lline_set
start_lineend_linelinetotal_line_numbers r3 r z Similar._get_similarity_report s &' + D DOFG K6KKS\\KKK KF wI/3 3H 3zH2;
K
K.*hJx}JJ
JJXJJJJ
Q $ 0H1D E Q QD P 5DKKMM 5 5 5 5DPFF "fI0B&C C " "!$$O$O $O$O$O!O!O
R,
R
R0
R
R-58II Q
R
R
R
r2 r r r "Generator[Commonality, None, None]c
# K t || j j \ }t || j j \ }}t }t | }t ||z fd }i } t |t
j d D ]}
t j |
||
D ]o} | d } | d }
t t j || t j ||
| j j | t | |
< pt | | D ]\ }}|j }|j }|j }t% |||j j |j j ||j j |j j }t/ ||||| }|| j j k r|V dS ) at Find similarities in the two given linesets.
This the core of the algorithm. The idea is to compute the hashes of a
minimal number of successive lines of each lineset and then compare the
hashes. Every match of such comparison is stored in a dict that links the
couple of starting indices in both linesets to the couple of corresponding
starting and ending lines in both files.
Last regroups all successive couples in a bigger one. It allows to take into
account common chunk of lines that have more than the minimal number of
successive lines required.
c | d S Nr r1 )mhash_to_index_1s r3 z&Similar._find_common.. s ?1+=a+@ r2 keyrI r r )r; )r r r r r r r N)r r r frozensetr r operator
attrgetter itertoolsproductr7 copyrE r r rx ry r; r r9 ri rj r: r )rA r r index_to_lines_1hash_to_index_2index_to_lines_2hash_1hash_2
common_hashesr c_hashindices_in_linesetsindex_1index_2cml_stripped_lcmn_l
start_index_1
start_index_2nb_common_linescom
eff_cmn_nbr s @r3 _find_commonzSimilar._find_common sB & -9 dn9-
-
)) -9 dn9-
-
)) )2/2F2F2H2H(I(I(1/2F2F2H2H(I(I.4 VO!@!@!@!@/
/
/
-/ ]0CH0M0MNNN F'0'8 ' )@( (
# .a0-a0 -I .w 788I .w 788+/>+N &w88
+&&&%0%6%6%8%8 !NE * .? s% UUU'WUUTUUUUr2 Nr> )rA r@ s r3 combine_mapreduce_dataz Similar.combine_mapreduce_data: s
VU-@UUU
r2 ) r r< r rW r rW r rW r rW 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= r r= r< )r@ rA r= r> )r- r. r/ rC DEFAULT_MIN_SIMILARITY_LINErB r r r r r r9 r r? rE r1 r2 r3 r r [ s 77 5 %"' $"'
* * * * *, KO
>1 1 1 1 % % % %N 2I I I IV@ @ @ @ V V V V V Vr2 r rM rN r rW r r r r !Callable[[str, int], bool] | Nonelist[LineSpecifs]c
|s|r't j d | }|r/d |j D }d t |d D }d} |r2dfd g | }
t t
d
|
D } g } d}
t | d D ]O\ }}|
|d| s| }|r|
s}| d s| d r|dd }
|dd }n>| d s| d r|dd }
|dd }|
r|
|
rd}
d}|r| || } | rd}|r.| dd d }|r|| v rd}|r4|
t |t |dz
Q| S ) a Return tuples of line/line number/line type with leading/trailing white-space and
any ignored code features removed.
:param lines: a collection of lines
:param ignore_comments: if true, any comment in the lines collection is removed from the result
:param ignore_docstrings: if true, any line that is a docstring is removed from the result
:param ignore_imports: if true, any line that is an import is removed from the result
:param ignore_signatures: if true, any line that is part of a function signature is removed from the result
:param line_enabled_callback: If called with "R0801" and a line number, a return value of False will disregard
the line
:return: the collection of line/line number/line type tuples
r c 3 p K | ]1}|j t |t j t j f fV 2d S r@ )linenorY r Import
ImportFrom)rR nodes r3 rT z!stripped_lines..Y sQ $
$
[*TEL%:J+KLL M$
$
$
$
$
$
r2 c H i | ] \ }}|t d |D S )c 3 K | ] \ }}|V
d S r@ r1 )rR _ is_imports r3 rT z,stripped_lines...^ s& KKla KKKKKKr2 )all)rR rM node_is_import_groups r3
z"stripped_lines..] sG
,,
CKK6JKKKKK
r2 c | d S r r1 )r s r3 r z stripped_lines..` s
! r2 r F functionslist[nodes.NodeNG]tree nodes.NodeNGr= c |j D ]z}t |t j t j f r| | t |t j t j t j f r | | {| S )zeRecursively get all functions including nested in the classes from the
tree.
)bodyrY r FunctionDefAsyncFunctionDefr ClassDef)rY r[ rP _get_functionss r3 rb z&stripped_lines.._get_functionsf s
4
4 dU%68N$OPP + $$T*** ^U%68NO 4 #N9d333 r2 c 3 K | ]:}t |j |j r|j d j n |j dz V ;dS )r r N)r rM r^ tolineno)rR funcs r3 rT z!stripped_lines..| sf
/3yO ! ++dma>O r2 Nr )ri R0801z"""z''' zr"""zr'''r$ #r )r+ r) )rY rZ r[ r\ r= rZ )astroidparsejoinr^ r setr
r strip
startswithendswithgetsplitr r( r& )rM r r r r r r[ node_is_import_by_linenoline_begins_importcurrent_line_is_importrY signature_lines
strippedlines docstringrM r rb s @r3 r r B s ( -* -}RWWU^^,, '$
$
$
$
$
07(nn1 1 1
"'
& #N2t,,
!*
MI!%q111 ,5J5J V6
6
,
zz||
$??5)) $T__U-C-C $ $RaRI 8DD__V,, $0G0G $ $QqS I 8D
==++ % $I %7%;%;.& & " &
1::c1%%a(..00D ?!:!:D :fqj3I3IJJJ
r2 c e Zd ZdZ d d!dZd"dZd#dZd$dZd%dZd#dZ d&d Z
e d'd Z e d(d Z
dS ))r zHolds and indexes all the lines of a single source file.
Allows for correspondence between real lines of the source file and stripped ones, which
are the real ones from which undesired patterns have been removed.
FNr r* rM list[str]r rW r r r r rI r= r> c V || _ || _ t |||||| | _ d S )Nr )r r r _stripped_lines)rA r rM r r r r r s r3 rB zLineSet.__init__ sB - "7
r2 c d| j dS )Nz
r r] s r3 rb zLineSet.__str__ s +ty++++r2 r< c * t | j S r@ )r r r] s r3 __len__zLineSet.__len__ s 4#$$$r2 r r( c | j | S r@ r{ )rA r s r3 __getitem__zLineSet.__getitem__ s #E**r2 r{ c " | j |j k S r@ r~ r} s r3 __lt__zLineSet.__lt__ s y5:%%r2 c t | S r@ )idr] s r3 r^ zLineSet.__hash__ s
$xxr2 r c P t |t sdS | j |j k S )NF)rY r __dict__r} s r3 r[ zLineSet.__eq__ s( %)) 5}..r2 rJ c | j S r@ r r] s r3 r zLineSet.stripped_lines s ##r2 c | j S r@ )r r] s r3
real_lineszLineSet.real_lines s r2 )FFFFN)r r* rM ry r rW r rW r rW r rW r rI r= r> rd rc )r r< r= r( )r{ r r= rW r )r= rJ )r= ry )r- r. r/ rC rB rb r r r r^ r[ ru r r r1 r2 r3 r r s !&"' $"'CG
*, , , ,% % % %+ + + +& & & & / / / /
$ $ $ X$ X r2 rf )z Similar lines in %s files
%szduplicate-codezIndicates that a set of similar lines has been detected among multiple file. This usually means that the code should be refactored to avoid this duplication.z!dict[str, MessageDefinitionTuple]MSGSsectr statsr! old_statsLinterStats | Nonec g d}|t ||d z
}| t |ddd dS )z0Make a layout with some stats about duplication.)r nowprevious
differenceduplicated_linesr$ r )childrencolsrheaderscheadersN)r r r )r r r rM s r3 report_similaritiesr sP
2 1 1E
#E96H
I
IIEKKu1q1EEEFFFFFr2 c
e Zd ZU dZdZeZdeddddfdd d
d d dfd
d d
d ddfdd d
d ddfdd d
d ddffZde d< dde
ffZ d'dZ d(d Z
d)d Zd(d Zd*d"Zd+d%Zd&S ),SimilarCheckerzChecks for similarities and duplicated code.
This computation may be memory / CPU intensive, so you
should disable it if you experience some problems.
r zmin-similarity-linesr< zz%Minimum lines number of a similarity.)defaulttypemetavarhelpignore-commentsTynzz4Comments are removed from the similarity computationignore-docstringsz6Docstrings are removed from the similarity computationignore-importsz3Imports are removed from the similarity computationignore-signaturesz6Signatures are removed from the similarity computationr optionsRP0801 Duplicationr r# r= r> c t j | | t | | j j j | j j j | j j j | j j j | j j j d S )N)r r r r r )
r rB r r r r r r r r )rA r s r3 rB zSimilarChecker.__init__; sv #D&111 k(= K . > "k 0 B ;-< "k 0 B
r2 c P g | _ | j j dS )z=Init the checkers: reset linesets and statistics information.N)r r r reset_duplicated_linesr] s r3 openzSimilarChecker.openF s&
0022222r2 rP nodes.Modulec | j j t j dt | 5 }| | j j ||j ddd dS # 1 swxY w Y dS )zProcess a module.
the module's content is accessible via the stream object
stream must implement the readlines method
NzIn pylint 3.0 the current_name attribute of the linter object should be a string. If unknown it should be initialized as an empty string.)r current_namewarningswarnDeprecationWarningr r
file_encoding)rA rP r s r3 process_modulez SimilarChecker.process_moduleK s ; # + MN #
[[]] Uf t{ 7AS T T T U U U U U U U U U U U U U U U U U Us 'A//A36A3c t d | j D }d}| j j }| D ]\ }}g }dx}x}} |D ]*\ }}} | d|j d| d| d +| |r9|j || D ])}
| |
*|
dt | d | f
||t | d z
z z
}|xj
t | z
c_
|xj t! |o|d z |z z
c_ dS )
zBCompute and display similarities on closing (i.e. end of parsing).c 3 4 K | ]}t | V d S r@ r
r s r3 rT z'SimilarChecker.close.._ s( >>WCLL>>>>>>r2 r Nr r r ]rf r )argsr r
)rU r r r r r r r r r add_messager rk nb_duplicated_linesr< percent_duplicated_linesfloat) rA total
duplicatedr r r msgr r r r s r3 closezSimilarChecker.close] s >>
>>>>>
! . . 0 0 3 3LCC.2 2G 2j818
J
J-X
H HH
HHXHHHIIII HHJJJ
. # .z(/B C . .DJJt{{}}---- WCLL$))C..+I J J J #W !12 2JJ
!!S__4!!
&&%0T*u:Lu:T*U*UU&&&&r2 r< c 6 t | S )zPassthru override.)r r? r] s r3 r? zSimilarChecker.get_map_datar s ##D)))r2 datarA c > t | | dS )rC )r@ N)r rE )rA r r s r3 reduce_map_dataz SimilarChecker.reduce_map_datav s#
&&t&FFFFFr2 Nr r# r= r> rF )rP r r= r> rG )r r# r rA r= r> )r- r. r/ rC r r msgsrH r r0 r reportsrB r r r r? r r1 r2 r3 r r s D D
#6 "?
%N
%P
%M
%P
K.G . . . .` -)<=?G
3 3 3 3
U U U U$V V V V** * * *G G G G G Gr2 r r r# c J | t | d S r@ )register_checkerr )r s r3 registerr ~ s$
N6 2 233333r2 statusr c t d t t d t j | dS )z'Display command line usage information.z*finds copy pasted blocks in a set of fileszUsage: symilar [-d|--duplicates min_duplicated_lines] [-i|--ignore-comments] [--ignore-docstrings] [--ignore-imports] [--ignore-signatures] file1...N)r sysexit)r s r3 usager sJ
6777 GGG ` HVr2 argvSequence[str] | Nonec R | t j dd } d}g d}t }d}d}d}d}t t | || \ }} |D ]G\ }
} |
dv rt | }|
dv rt
,|
dv rd }3|
d
v rd }:|
d v rd }A|
d v rd }H| st
d t ||||| } | D ]A}
t |
d
5 }| |
| ddd n # 1 swxY w Y B|
t j d dS )z%Standalone command line access point.Nr hdi)r z duplicates=r r r r F> -d --duplicates> -h--help> -i--ignore-commentsT> --ignore-docstrings> --ignore-imports> --ignore-signatureszutf-8)r r ) r r rH r r r< r r r r r r )r s_optsl_optsr r r r r optsr optvalsimfilenamer s r3 Runr s |x|
F F ,IO N T
FF33JD$ % %S ( ( (CII
$
$
$ GGGG
/
/
/ "OO
+
+
+ $
(
(
( !NN
+
+
+ $
a
?$5~GX C 0 0
(W
-
-
- 0 h / / / 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0GGIIIHQKKKKKs C33C7 :C7 __main__)r r r r< r= r )r r r= r> ) r r r r% r r r r% r r< r= r< r@ )rM rN r rW r rW r rW r rW r rI r= rJ )r r r r! r r r= r> r )r )r r< r= r )r r r= r )UrC
__future__r r r' functoolsr% r# rer r collectionsr collections.abcr r r r r ior
r r r
r typingr r r r r r r r r r ri r pylint.checkersr r r pylint.reporters.ureports.nodesr r
pylint.typingr r pylint.utilsr! r" pylint.lintr# rH compiler r< r% r& r(
HashToIndex_TIndexToLines_Tr r7 r r4 r5 rE LinesChunkLimits_Tr r r r r r total_orderingr r r0 r r r r r r- r1 r2 r3 r st
2 # " " " " "
# # # # # # C C C C C C C C C C C C 6 6 6 6 6 6 6 6 6 6 $ $ $ $ $ $ $ $ S S S S S S S S S S : : : : : : : : 9 9 9 9 9 9 9 9 5 5 5 5 5 5 5 5 %$$$$$$ )rz( 3 3 W\3
'
'
* \4;./
e 445 V^W45 = = = = = = = =( 02J JK $
$
$
$
$
$
$
$
NF F F F F F F F8
: 9j*<= /J&# &# &# &# &#R( ( ( (V Y Y Y YD * dV dV dV dV dV dV dV dVZ @D
f f f f fR 6 6 6 6 6 6 6 6 t + G G G GG G G G G' G G GD4 4 4 4 * * * * *Z zCEEEEE r2