⚝
One Hat Cyber Team
⚝
Your IP:
216.73.216.30
Server IP:
45.79.8.107
Server:
Linux localhost 5.15.0-140-generic #150-Ubuntu SMP Sat Apr 12 06:00:09 UTC 2025 x86_64
Server Software:
nginx/1.18.0
PHP Version:
8.1.2-1ubuntu2.21
Buat File
|
Buat Folder
Eksekusi
Dir :
~
/
lib
/
python3.10
/
lib2to3
/
__pycache__
/
View File Name :
refactor.cpython-310.pyc
o Šbcsk ã @ s d Z dZddlZddlZddlZddlZddlZddlZddlZddl m Z ddl m Z m Z mZ ddlmZ ddlmZmZ dd lmZ d!d d „ZG d d„ deƒZdd„ Zdd„ Zdd„ Zdd„ Z dd„ Z G dd„ deƒZ G dd „ d e ƒZ G d d „ d eƒZ!G d d „ d e ƒZ"dS )"zÛRefactoring framework. Used as a main program, this can refactor any number of files and/or recursively descend down directories. Imported as a module, this provides infrastructure to write your own refactoring tool. z#Guido van Rossum <guido@python.org>é N)Úchainé )ÚdriverÚtokenizeÚtoken)Ú find_root)ÚpytreeÚpygram)Ú btm_matcherTc C sT t | g g dgƒ}g }t |j¡D ]\}}}| d¡r'|r"|dd… }| |¡ q|S )zEReturn a sorted list of all available fix names in the given package.Ú*Úfix_é N)Ú __import__ÚpkgutilÚ iter_modulesÚ__path__Ú startswithÚappend)Ú fixer_pkgÚ remove_prefixÚpkgÚ fix_namesÚfinderÚnameÚispkg© r ú'/usr/lib/python3.10/lib2to3/refactor.pyÚget_all_fix_names s €r c @ ó e Zd ZdS )Ú _EveryNodeN©Ú__name__Ú __module__Ú __qualname__r r r r r + ó r c C sŽ t | tjtjfƒr| jdu rt‚| jhS t | tjƒr$| jr"t| jƒS t‚t | tj ƒrAt ƒ }| jD ]}|D ] }| t|ƒ¡ q4q0|S t d| ƒ‚)zf Accepts a pytree Pattern Node and returns a set of the pattern types which will match first. Nz$Oh no! I don't understand pattern %s) Ú isinstancer Ú NodePatternÚ LeafPatternÚtyper ÚNegatedPatternÚcontentÚ_get_head_typesÚWildcardPatternÚsetÚupdateÚ Exception)ÚpatÚrÚpÚxr r r r+ / s ÿ r+ c C s¼ t t¡}g }| D ];}|jr1zt|jƒ}W n ty# | |¡ Y q w |D ] }|| |¡ q&q |jdur?||j |¡ q | |¡ q tt j j ¡ t j j ƒD ] }|| |¡ qPt|ƒS )z^ Accepts a list of fixers and returns a dictionary of head node type --> fixer list. N)Ú collectionsÚ defaultdictÚlistÚpatternr+ r r Ú _accept_typer r Úpython_grammarÚ symbol2numberÚvaluesÚtokensÚextendÚdict)Ú fixer_listÚ head_nodesÚeveryÚfixerÚheadsÚ node_typer r r Ú_get_headnode_dictK s( ÿÿ ÿrE c s ‡ fdd„t ˆ dƒD ƒS )zN Return the fully qualified names for fixers in the package pkg_name. c s g | ]}ˆ d | ‘qS ©Ú.r )Ú.0Úfix_name©Úpkg_namer r Ú <listcomp>h s ÿz+get_fixers_from_package.<locals>.<listcomp>F)r rJ r rJ r Úget_fixers_from_packaged s ÿrM c C s | S ©Nr )Úobjr r r Ú _identityk s rP c sj d}t t | ¡j¡‰ ‡ fdd„}ttjt jtj hƒ}t ƒ }zŠ |ƒ \}}||v r*q |tj kr5|r2ncd}n_|tj kr“|dkr“|ƒ \}}|tj ksL|dkrMnR|ƒ \}}|tj ks[|dkr\nH|ƒ \}}|tj kro|dkro|ƒ \}}|tj kr’| |¡ |ƒ \}}|tj ks‡|d krˆn |ƒ \}}|tj kstnnq W t|ƒS W t|ƒS W t|ƒS W t|ƒS ty´ Y t|ƒS w ) NFc s t ˆ ƒ} | d | d fS )Nr r )Únext)Útok©Úgenr r Úadvancer s z(_detect_future_features.<locals>.advanceTÚfromÚ __future__Úimportú(ú,)r Úgenerate_tokensÚioÚStringIOÚreadlineÚ frozensetr ÚNEWLINEÚNLÚCOMMENTr- ÚSTRINGÚNAMEÚOPÚaddÚ StopIteration)ÚsourceÚhave_docstringrU ÚignoreÚfeaturesÚtpÚvaluer rS r Ú_detect_future_featureso s\ û€çýïò þþrn c @ s e Zd ZdZdS )Ú FixerErrorz A fixer could not be loaded.N)r! r" r# Ú__doc__r r r r ro — s ro c @ sê e Zd ZddddœZdZdZd4dd„Zdd „ Zd d „ Zd d „ Z dd„ Z dd„ Z d5dd„Z d5dd„Z dd„ Zd5dd„Zdd„ Zd6d d „Zd d „ Zd d!„ Z d7d"d#„Zd8d$d%„Zd&Zd'Zd(d)„ Zd*d+„ Zd,d-„ Zd.d/„ Zd0d1„ Z d2d3„ Z dS )9ÚRefactoringToolF)Úprint_functionÚ exec_functionÚwrite_unchanged_filesÚFixr Nc C sH || _ |pg | _| j ¡ | _|dur| j |¡ tj ¡ | _| jd r)| jj d= n | jd r3| jj d= | j d¡| _ g | _ t d¡| _g | _d| _tj| jtj| jd | _| ¡ \| _| _g | _t ¡ | _ g | _ g | _ t | j| jƒD ]#}|j r~| j !|¡ qr|| jv rŠ| j "|¡ qr|| jv r•| j "|¡ qrt#| j ƒ| _$t#| j ƒ| _%dS ) zÑInitializer. Args: fixer_names: a list of fixers to import options: a dict with configuration. explicit: a list of fixers to run even if they are explicit. Nrr Úprintrs Úexecrt rq F)ÚconvertÚlogger)&ÚfixersÚexplicitÚ_default_optionsÚcopyÚoptionsr. r r9 ÚgrammarÚkeywordsÚgetrt ÚerrorsÚloggingÚ getLoggerry Ú fixer_logÚwroter ÚDriverr rx Ú get_fixersÚ pre_orderÚ post_orderÚfilesÚbmÚ BottomMatcherÚBMÚ bmi_pre_orderÚbmi_post_orderr Ú BM_compatibleÚ add_fixerr rE Úbmi_pre_order_headsÚbmi_post_order_heads)ÚselfÚ fixer_namesr~ r{ rB r r r Ú__init__¤ sD þ € zRefactoringTool.__init__c C sJ g }g }| j D ]ˆ}t|i i dgƒ}| dd¡d }| | j¡r(|t| jƒd… }| d¡}| jd dd „ |D ƒ¡ }zt ||ƒ}W n t yQ t d ||f ƒd‚w || j | j ƒ} | jrm| jd urm|| jvrm| d |¡ q| d |¡ | jdkr~| | ¡ q| jdkr‰| | ¡ qt d| j ƒ‚t d¡} |j| d |j| d ||fS )a Inspects the options to load the requested patterns and handlers. Returns: (pre_order, post_order), where pre_order is the list of fixers that want a pre-order AST traversal, and post_order is the list that want post-order traversal. r rG r éÿÿÿÿNÚ_Ú c S s g | ]}| ¡ ‘qS r )Útitle)rH r2 r r r rL ë s z.RefactoringTool.get_fixers.<locals>.<listcomp>zCan't find %s.%sTzSkipping optional fixer: %szAdding transformation: %sÚpreÚpostzIllegal fixer order: %rÚ run_order©Úkey)rz r Úrsplitr Ú FILE_PREFIXÚlenÚsplitÚ CLASS_PREFIXÚjoinÚgetattrÚAttributeErrorro r~ r… r{ Ú log_messageÚ log_debugÚorderr ÚoperatorÚ attrgetterÚsort) r• Úpre_order_fixersÚpost_order_fixersÚ fix_mod_pathÚmodrI ÚpartsÚ class_nameÚ fix_classrB Úkey_funcr r r rˆ Û s: ÿ zRefactoringTool.get_fixersc O s ‚ )z Called when an error occurs.r )r• ÚmsgÚargsÚkwdsr r r Ú log_error s zRefactoringTool.log_errorc G s |r|| }| j |¡ dS )zHook to log a message.N)ry Úinfo©r• r· r¸ r r r r© s zRefactoringTool.log_messagec G s |r|| }| j |¡ d S rN )ry Údebugr¼ r r r rª s zRefactoringTool.log_debugc C s dS )zTCalled with the old version, new version, and filename of a refactored file.Nr )r• Úold_textÚnew_textÚfilenameÚequalr r r Ú print_output s z RefactoringTool.print_outputc C s8 |D ]}t j |¡r| |||¡ q| |||¡ qdS )z)Refactor a list of files and directories.N)ÚosÚpathÚisdirÚ refactor_dirÚ refactor_file)r• ÚitemsÚwriteÚ doctests_onlyÚ dir_or_filer r r Úrefactor s üzRefactoringTool.refactorc C sš t jd }t |¡D ]@\}}}| d|¡ | ¡ | ¡ |D ] }| d¡s>t j |¡d |kr>t j ||¡} | | ||¡ q dd„ |D ƒ|dd…< q dS )zÄDescends down a directory and refactor every Python file found. Python files are assumed to have a .py extension. Files and subdirectories starting with '.' are skipped. ÚpyzDescending into %srG r c S s g | ] }| d ¡s|‘qS rF )r )rH Údnr r r rL 2 ó z0RefactoringTool.refactor_dir.<locals>.<listcomp>N) rà ÚextsepÚwalkrª r® r rÄ Úsplitextr¦ rÇ ) r• Údir_namerÉ rÊ Úpy_extÚdirpathÚdirnamesÚ filenamesr Úfullnamer r r rÆ s €öz RefactoringTool.refactor_dirc C s® zt |dƒ}W n ty! } z| d||¡ W Y d}~dS d}~ww zt |j¡d }W | ¡ n| ¡ w tj |d|dd}| ¡ |fW d ƒ S 1 sPw Y dS ) zG Do our best to decode a Python source file correctly. ÚrbzCan't open %s: %sN©NNr r1 rš ©ÚencodingÚnewline) ÚopenÚOSErrorrº r Údetect_encodingr^ Úcloser\ Úread)r• rÀ ÚfÚerrrÜ r r r Ú_read_python_source4 s €þ $ÿz#RefactoringTool._read_python_sourcec C sÀ | |¡\}}|du r dS |d7 }|r9| d|¡ | ||¡}| js&||kr1| |||||¡ dS | d|¡ dS | ||¡}| jsG|rX|jrX| jt|ƒdd… |||d dS | d|¡ dS )zRefactors a file.NÚ zRefactoring doctests in %szNo doctest changes in %sr˜ )rÉ rÜ zNo changes in %s)rå rª Úrefactor_docstringrt Úprocessed_fileÚrefactor_stringÚ was_changedÚstr)r• rÀ rÉ rÊ ÚinputrÜ ÚoutputÚtreer r r rÇ D s ÿz RefactoringTool.refactor_filec C s° t |ƒ}d|v r tj| j_z3z| j |¡}W n# ty9 } z| d||jj |¡ W Y d}~W | j| j_dS d}~ww W | j| j_n| j| j_w ||_ | d|¡ | ||¡ |S )aF Refactor a given input string. Args: data: a string holding the code to be refactored. name: a human-readable name for use in error/log messages. Returns: An AST corresponding to the refactored input stream; None if there were errors during the parse. rr zCan't parse %s: %s: %sNzRefactoring %s) rn r Ú!python_grammar_no_print_statementr r Ú parse_stringr/ rº Ú __class__r! Úfuture_featuresrª Ú refactor_tree)r• Údatar rk rî rä r r r ré [ s& ÿ €ûÿ z RefactoringTool.refactor_stringc C s’ t j ¡ }|r)| d¡ | |d¡}| js||kr"| |d|¡ d S | d¡ d S | |d¡}| js7|rB|jrB| t |ƒd|¡ d S | d¡ d S )Nz Refactoring doctests in stdinz<stdin>zNo doctest changes in stdinzNo changes in stdin) ÚsysÚstdinrâ rª rç rt rè ré rê rë )r• rÊ rì rí rî r r r Úrefactor_stdinv s z RefactoringTool.refactor_stdinc C sÌ t | j| jƒD ]}| ||¡ q| | j| ¡ ¡ | | j| ¡ ¡ | j | ¡ ¡}t | ¡ ƒrÓ| jj D ]˜}||v rÌ|| rÌ|| j tjjdd |jrV|| j tjjd t|| ƒD ]o}||| v rk|| |¡ zt|ƒ W n tyz Y q\w |jr„||jv r„q\| |¡}|rË| ||¡}|durË| |¡ | ¡ D ]}|js¦g |_|j |¡ qž| j | ¡ ¡}|D ]} | |vrÁg || < || || ¡ q·q\q4t | ¡ ƒs0t | j| jƒD ]}| ||¡ qÚ|j S )aÏ Refactors a parse tree (modifying the tree in place). For compatible patterns the bottom matcher module is used. Otherwise the tree is traversed node-to-node for matches. Args: tree: a pytree.Node instance representing the root of the tree to be refactored. name: a human-readable name for this tree. Returns: True if the tree was modified, False otherwise. T)r ÚreverserŸ N) r r‰ rŠ Ú start_treeÚ traverse_byr“ r” rŽ ÚrunÚleavesÚanyr; rz r® r ÚBaseÚdepthÚkeep_line_orderÚ get_linenor6 Úremover Ú ValueErrorÚfixers_appliedÚmatchÚ transformÚreplacer r= Ú finish_treerê ) r• rî r rB Ú match_setÚnodeÚresultsÚnewÚ new_matchesÚfxrr r r ró † sP ý € Ñ1z RefactoringTool.refactor_treec C sV |sdS |D ]"}||j D ]}| |¡}|r'| ||¡}|dur'| |¡ |}q qdS )a Traverse an AST, applying a set of fixers to each node. This is a helper method for refactor_tree(). Args: fixers: a list of fixer instances. traversal: a generator that yields AST nodes. Returns: None N)r( r r r )r• rz Ú traversalr rB r r r r r rú Õ s €úÿzRefactoringTool.traverse_byc C sˆ | j |¡ |du r| |¡d }|du rdS ||k}| ||||¡ |r0| d|¡ | js0dS |r<| ||||¡ dS | d|¡ dS )zR Called when a file has been refactored and there may be changes. Nr zNo changes to %szNot writing changes to %s)r‹ r rå r rª rt Ú write_file)r• r¿ rÀ r¾ rÉ rÜ rÁ r r r rè ì s z RefactoringTool.processed_filec C sÈ z t j|d|dd}W n ty% } z| d||¡ W Y d}~dS d}~ww |) z| |¡ W n tyI } z | d||¡ W Y d}~nd}~ww W d ƒ n1 sTw Y | d|¡ d| _dS ) zÑWrites a string to a file. It first shows a unified diff between the old text and the new text, and then rewrites the file; the latter is only done if the write option is set. Úwrš rÛ zCan't create %s: %sNzCan't write %s: %szWrote changes to %sT)r\ rÞ rß rº rÉ rª r† )r• r¿ rÀ r¾ rÜ Úfprä r r r r s$ €þ€ÿ€ ý zRefactoringTool.write_filez>>> z... c C s g }d}d}d}d}|j ddD ]d}|d7 }| ¡ | j¡r?|dur-| | ||||¡¡ |}|g}| | j¡} |d| … }q|dur\| || j ¡sV||| j ¡ d kr\| |¡ q|durk| | ||||¡¡ d}d}| |¡ q|dur„| | ||||¡¡ d |¡S )aË Refactors a docstring, looking for doctests. This returns a modified version of the input string. It looks for doctests, which start with a ">>>" prompt, and may be continued with "..." prompts, as long as the "..." is indented the same as the ">>>". (Unfortunately we can't use the doctest module's parser, since, like most parsers, it is not geared towards preserving the original source.) Nr T©Úkeependsr ræ rš ) Ú splitlinesÚlstripr ÚPS1r= Úrefactor_doctestÚfindÚPS2Úrstripr r¦ ) r• rì rÀ ÚresultÚblockÚ block_linenoÚindentÚlinenoÚlineÚir r r rç sB ÿ ÿ ÿ ÿ z"RefactoringTool.refactor_docstringc s( z ˆ ||ˆ ¡}W n4 ty= } z(ˆj tj¡r&|D ] }ˆ d| d¡¡ qˆ d|||j j |¡ |W Y d}~S d}~ww ˆ ||¡r’t |ƒj dd}|d|d … ||d d… } }| dg|d ksjJ | ƒ‚|d d¡sy|d d7 < ˆ ˆj | d ¡ g}|r’|‡ ‡fd d „|D ƒ7 }|S ) zÞRefactors one doctest. A doctest is given as a block of lines, the first of which starts with ">>>" (possibly indented), while the remaining lines start with "..." (identically indented). z Source: %sræ z+Can't parse docstring in %s line %s: %s: %sNTr r r˜ r c s g | ] }ˆ ˆj | ‘qS r )r )rH r! ©r r• r r rL ^ rÏ z4RefactoringTool.refactor_doctest.<locals>.<listcomp>)Ú parse_blockr/ ry Ú isEnabledForrƒ ÚDEBUGrª r rº rñ r! ró rë r Úendswithr Úpop) r• r r r rÀ rî rä r! r Úclippedr r# r r D s, ÿ€ú "z RefactoringTool.refactor_doctestc C sÐ | j rd}nd}| js| d|¡ n| d|¡ | jD ]}| |¡ q| jr6| d¡ | jD ]}| |¡ q.| jrdt| jƒdkrF| d¡ n | dt| jƒ¡ | jD ]\}}}| j|g|¢R i |¤Ž qRd S d S ) NÚwerez need to bezNo files %s modified.zFiles that %s modified:z$Warnings/messages while refactoring:r zThere was 1 error:zThere were %d errors:)r† r‹ r© r… r‚ r£ )r• r* ÚfileÚmessager· r¸ r¹ r r r Ú summarizea s( úzRefactoringTool.summarizec C s" | j | |||¡¡}tƒ |_|S )z³Parses a block into a tree. This is necessary to get correct line number / offset information in the parser diagnostics and embedded into the parse tree. )r Ú parse_tokensÚ wrap_toksr_ rò )r• r r r rî r r r r$ x s zRefactoringTool.parse_blockc c sf t | ||¡j¡}|D ]#\}}\}}\} } } ||d 7 }| |d 7 } ||||f| | f| fV q dS )z;Wraps a tokenize stream to systematically modify start/end.r N)r r[ Ú gen_linesÚ__next__) r• r r r r< r( rm Úline0Úcol0Úline1Úcol1Ú line_textr r r r/ ‚ s € øzRefactoringTool.wrap_toksc c sx || j }|| j }|}|D ]'}| |¡r |t|ƒd… V n|| ¡ d kr,dV ntd||f ƒ‚|}q dV q8)z–Generates lines as expected by tokenize from a list of lines. This strips the first len(indent + self.PS1) characters off each line. Nræ zline=%r, prefix=%rTrš )r r r r£ r ÚAssertionError)r• r r Úprefix1Úprefix2Úprefixr! r r r r0 s € ÿzRefactoringTool.gen_linesrÚ )FF)F)NFNrN ) 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/ r0 r r r r rq › sB þ 7( O ÿ + rq c @ r )ÚMultiprocessingUnsupportedNr r r r r r; ¤ r$ r; c sF e Zd Z‡ fdd„Z d ‡ fdd„ Z‡ fdd„Z‡ fd d „Z‡ ZS ) ÚMultiprocessRefactoringToolc s& t t| ƒj|i |¤Ž d | _d | _d S rN )Úsuperr< r— ÚqueueÚ output_lock©r• r¸ Úkwargs©rñ r r r— ª s z$MultiprocessRefactoringTool.__init__Fr c s2 |dkrt tˆƒ |||¡S zdd l‰ W n ty t‚w ˆjd ur'tdƒ‚ˆ ¡ ˆ_ˆ ¡ ˆ_ ‡ ‡fdd„t |ƒD ƒ}z8|D ]}| ¡ q@t tˆƒ |||¡ W ˆj ¡ t |ƒD ]}ˆj d ¡ q[|D ] }| ¡ rp| ¡ qfd ˆ_d S ˆj ¡ t |ƒD ]}ˆj d ¡ q|D ] }| ¡ r”| ¡ qŠd ˆ_w )Nr r z already doing multiple processesc s g | ] }ˆ j ˆjd ‘qS ))Útarget)ÚProcessÚ_child)rH r" ©Úmultiprocessingr• r r rL ¼ s ÿz8MultiprocessRefactoringTool.refactor.<locals>.<listcomp>)r= r< rÌ rG Ú ImportErrorr; r> Ú RuntimeErrorÚ JoinableQueueÚLockr? ÚrangeÚstartr¦ ÚputÚis_alive)r• rÈ rÉ rÊ Ú num_processesÚ processesr2 r" rB rF r rÌ ¯ sL ÿ ÿ ÿ ÿ € ú €z$MultiprocessRefactoringTool.refactorc sf | j ¡ }|d ur1|\}}ztt| ƒj|i |¤Ž W | j ¡ n| j ¡ w | j ¡ }|d us d S d S rN )r> r r= r< rÇ Ú task_done)r• Útaskr¸ rA rB r r rE Ì s ÿÿ ùz"MultiprocessRefactoringTool._childc s4 | j d ur| j ||f¡ d S tt| ƒj|i |¤ŽS rN )r> rN r= r< rÇ r@ rB r r rÇ × s ÿÿz)MultiprocessRefactoringTool.refactor_file)FFr )r! r" r# r— rÌ rE rÇ Ú __classcell__r r rB r r< ¨ s ÿ r< )T)#rp Ú __author__r\ rà r rõ rƒ r¬ r4 Ú itertoolsr Úpgen2r r r Ú fixer_utilr rš r r r rŒ r r/ r r+ rE rM rP rn ro Úobjectrq r; r< r r r r Ú<module> s: (