Hacked By AnonymousFox

Current Path : /opt/alt/python39/lib64/python3.9/lib2to3/__pycache__/
Upload File :
Current File : //opt/alt/python39/lib64/python3.9/lib2to3/__pycache__/refactor.cpython-39.opt-1.pyc

a

R�fsk�@sdZdZddlZddlZddlZddlZddlZddlZddlZddl	m
Z
ddlmZm
Z
mZddlmZddlmZmZdd	lmZd!dd�ZGd
d�de�Zdd�Zdd�Zdd�Zdd�Zdd�ZGdd�de�ZGdd�de�Z Gdd�de�Z!Gdd �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_matcherTcCsTt|ggdg�}g}t�|j�D].\}}}|�d�r |rD|dd�}|�|�q |S)zEReturn a sorted list of all available fix names in the given package.�*�fix_�N)�
__import__�pkgutilZiter_modules�__path__�
startswith�append)Z	fixer_pkgZ
remove_prefixZpkgZ	fix_names�finder�nameZispkg�r�5/opt/alt/python39/lib64/python3.9/lib2to3/refactor.py�get_all_fix_namess
rc@seZdZdS)�
_EveryNodeN��__name__�
__module__�__qualname__rrrrr+srcCs�t|tjtjf�r(|jdur t�|jhSt|tj�rH|jrDt|j�St�t|tj	�r�t
�}|jD]}|D]}|�t|��qhq`|Std|��dS)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)
�
isinstancerZNodePatternZLeafPattern�typerZNegatedPatternZcontent�_get_head_typesZWildcardPattern�set�update�	Exception)Zpat�r�p�xrrrr/s


rc	Cs�t�t�}g}|D]v}|jrbzt|j�}WntyF|�|�Yq�0|D]}||�|�qLq|jdur~||j�|�q|�|�qtt	j
j��t	j
j
�D]}||�|�q�t|�S)z^ Accepts a list of fixers and returns a dictionary
        of head node type --> fixer list.  N)�collections�defaultdict�list�patternrrrZ_accept_typerr	�python_grammarZ
symbol2number�values�tokens�extend�dict)Z
fixer_listZ
head_nodesZevery�fixerZheadsZ	node_typerrr�_get_headnode_dictKs$

�r0cs�fdd�t�d�D�S)zN
    Return the fully qualified names for fixers in the package pkg_name.
    csg|]}�d|�qS��.r)�.0�fix_name�Zpkg_namerr�
<listcomp>hs�z+get_fixers_from_package.<locals>.<listcomp>F)rr5rr5r�get_fixers_from_packageds
�r7cCs|S�Nr)�objrrr�	_identityksr:csVd}t�t�|�j���fdd�}ttjtjtj	h�}t
�}z�|�\}}||vrTq>q>|tjkrl|rf�q6d}q>|tjk�r6|dk�r6|�\}}|tjks�|dkr��q6|�\}}|tjks�|dkrq6|�\}}|tj
kr�|dkr�|�\}}|tjk�r4|�|�|�\}}|tj
k�s.|d	k�r"�q4|�\}}q�q>�q6q>Wnt�yLYn0t|�S)
NFcst��}|d|dfS)Nrr)�next)�tok��genrr�advancersz(_detect_future_features.<locals>.advanceT�fromZ
__future__�import�(�,)r�generate_tokens�io�StringIO�readline�	frozensetr�NEWLINE�NL�COMMENTr �STRING�NAME�OP�add�
StopIteration)�sourceZhave_docstringr?�ignore�features�tp�valuerr=r�_detect_future_featuresosB








rVc@seZdZdZdS)�
FixerErrorzA fixer could not be loaded.N)rrr�__doc__rrrrrW�srWc@s�eZdZdddd�ZdZdZd4dd�Zdd	�Zd
d�Zdd
�Z	dd�Z
dd�Zd5dd�Zd6dd�Z
dd�Zd7dd�Zdd�Zd8dd�Zdd�Zd d!�Zd9d"d#�Zd:d$d%�Zd&Zd'Zd(d)�Zd*d+�Zd,d-�Zd.d/�Zd0d1�Zd2d3�ZdS);�RefactoringToolF)�print_function�
exec_function�write_unchanged_filesZFixrNcCsJ||_|pg|_|j��|_|dur0|j�|�tj��|_|jdrR|jj	d=n|jdrf|jj	d=|j�
d�|_g|_t
�d�|_g|_d|_tj|jtj|jd	�|_|��\|_|_g|_t��|_g|_g|_t|j|j�D]H}|j r�|j�!|�q�||jv�r|j�"|�q�||jvr�|j�"|�q�t#|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.
        NrZ�printr[�execr\rYF)�convert�logger)&�fixers�explicit�_default_options�copy�optionsr!r	r*�grammar�keywords�getr\�errors�loggingZ	getLoggerr`�	fixer_log�wroterZDriverrr_�
get_fixers�	pre_order�
post_order�files�bmZ
BottomMatcher�BMZ
bmi_pre_orderZbmi_post_orderrZ
BM_compatibleZ	add_fixerrr0�bmi_pre_order_heads�bmi_post_order_heads)�selfZfixer_namesrerbr/rrr�__init__�sB



�

zRefactoringTool.__init__c	CsVg}g}|jD�]}t|iidg�}|�dd�d}|�|j�rR|t|j�d�}|�d�}|jd�dd	�|D��}zt	||�}Wn$t
y�td
||f�d�Yn0||j|j
�}	|	jr�|jdur�||jvr�|�d|�q|�d
|�|	jdk�r|�|	�q|	jdk�r|�|	�qtd|	j��qt�d�}
|j|
d�|j|
d�||fS)aInspects 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.
        rr2r���N�_�cSsg|]}|���qSr)�title)r3r$rrrr6��z.RefactoringTool.get_fixers.<locals>.<listcomp>zCan't find %s.%sTzSkipping optional fixer: %szAdding transformation: %sZpreZpostzIllegal fixer order: %rZ	run_order��key)rar�rsplitr�FILE_PREFIX�len�split�CLASS_PREFIX�join�getattr�AttributeErrorrWrerkrb�log_message�	log_debug�orderr�operator�
attrgetter�sort)ruZpre_order_fixersZpost_order_fixersZfix_mod_path�modr4�parts�
class_nameZ	fix_classr/Zkey_funcrrrrm�s:
�
zRefactoringTool.get_fixerscOs�dS)zCalled when an error occurs.Nr)ru�msg�args�kwdsrrr�	log_errorszRefactoringTool.log_errorcGs|r||}|j�|�dS)zHook to log a message.N)r`�info�rur�r�rrrr�szRefactoringTool.log_messagecGs|r||}|j�|�dSr8)r`�debugr�rrrr�
szRefactoringTool.log_debugcCsdS)zTCalled with the old version, new version, and filename of a
        refactored file.Nr)ru�old_text�new_text�filename�equalrrr�print_outputszRefactoringTool.print_outputcCs8|D].}tj�|�r$|�|||�q|�|||�qdS)z)Refactor a list of files and directories.N)�os�path�isdir�refactor_dir�
refactor_file)ru�items�write�
doctests_onlyZdir_or_filerrr�refactorszRefactoringTool.refactorc
Cs�tjd}t�|�D]�\}}}|�d|�|��|��|D]>}|�d�s>tj�|�d|kr>tj�||�}	|�	|	||�q>dd�|D�|dd�<qdS)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 %sr2rcSsg|]}|�d�s|�qSr1)r)r3Zdnrrrr62r{z0RefactoringTool.refactor_dir.<locals>.<listcomp>N)
r��extsep�walkr�r�rr��splitextr�r�)
ruZdir_namer�r�Zpy_ext�dirpathZdirnames�	filenamesr�fullnamerrrr� s

�zRefactoringTool.refactor_dirc
Cs�zt|d�}Wn4tyB}z|�d||�WYd}~dSd}~00zt�|j�d}W|��n
|��0tj|d|dd��}|��|fWd�S1s�0YdS)	zG
        Do our best to decode a Python source file correctly.
        �rbzCan't open %s: %sN)NNrr#ry��encoding�newline)	�open�OSErrorr�r�detect_encodingrG�closerE�read)rur��f�errr�rrr�_read_python_source4sz#RefactoringTool._read_python_sourcecCs�|�|�\}}|durdS|d7}|rn|�d|�|�||�}|jsL||kr`|�|||||�q�|�d|�nH|�||�}|js�|r�|jr�|jt|�dd�|||d�n|�d|�dS)zRefactors a file.N�
zRefactoring doctests in %szNo doctest changes in %srw)r�r�zNo changes in %s)r�r��refactor_docstringr\�processed_file�refactor_string�was_changed�str)rur�r�r��inputr��output�treerrrr�Ds �zRefactoringTool.refactor_filec
Cs�t|�}d|vrtj|j_zfz|j�|�}WnFtyr}z.|�d||jj	|�WYd}~W|j|j_dSd}~00W|j|j_n|j|j_0||_
|�d|�|�||�|S)aFRefactor 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.
        rZzCan't parse %s: %s: %sNzRefactoring %s)
rVr	Z!python_grammar_no_print_statementrrfZparse_stringr"r��	__class__r�future_featuresr��
refactor_tree)ru�datarrSr�r�rrrr�[s"

�
�zRefactoringTool.refactor_stringcCs�tj��}|rN|�d�|�|d�}|js2||krB|�|d|�q�|�d�n:|�|d�}|jsj|r~|jr~|�t	|�d|�n
|�d�dS)NzRefactoring doctests in stdinz<stdin>zNo doctest changes in stdinzNo changes in stdin)
�sys�stdinr�r�r�r\r�r�r�r�)rur�r�r�r�rrr�refactor_stdinvs

zRefactoringTool.refactor_stdinc

Cs�t|j|j�D]}|�||�q|�|j|���|�|j|���|j�|�	��}t
|����r�|jjD�]B}||vrj||rj||j
tjjdd�|jr�||j
tjjd�t||�D]�}|||vr�||�|�zt|�Wnt�y�Yq�Yn0|j�r||jv�rq�|�|�}|r�|�||�}|dur�|�|�|��D] }|j�s\g|_|j�|��qJ|j�|�	��}|D]*}	|	|v�r�g||	<||	�||	��q�q�qjqTt|j|j�D]}|�||��q�|jS)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)rrnroZ
start_tree�traverse_byrsrtrr�runZleaves�anyr+rar�rZBaseZdepthZkeep_line_orderZ
get_linenor(�remover�
ValueErrorZfixers_applied�match�	transform�replacerr-Zfinish_treer�)
rur�rr/Z	match_set�node�results�newZnew_matchesZfxrrrrr��sJ



zRefactoringTool.refactor_treecCsV|sdS|D]D}||jD]4}|�|�}|r|�||�}|dur|�|�|}qqdS)aTraverse 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)rr�r�r�)ruraZ	traversalr�r/r�r�rrrr��s

zRefactoringTool.traverse_bycCs�|j�|�|dur.|�|�d}|dur.dS||k}|�||||�|r`|�d|�|js`dS|rv|�||||�n|�d|�dS)zR
        Called when a file has been refactored and there may be changes.
        NrzNo changes to %szNot writing changes to %s)rprr�r�r�r\�
write_file)rur�r�r�r�r�r�rrrr��szRefactoringTool.processed_filecCs�ztj|d|dd�}Wn4tyJ}z|�d||�WYd}~dSd}~00|�Rz|�|�Wn2ty�}z|�d||�WYd}~n
d}~00Wd�n1s�0Y|�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.
        �wryr�zCan't create %s: %sNzCan't write %s: %szWrote changes to %sT)rEr�r�r�r�r�rl)rur�r�r�r��fpr�rrrr�sBzRefactoringTool.write_filez>>> z... c
	Csg}d}d}d}d}|jdd�D]�}|d7}|���|j�r~|durZ|�|�||||��|}|g}|�|j�}	|d|	�}q |dur�|�||j�s�|||j��dkr�|�	|�q |dur�|�|�||||��d}d}|�	|�q |du�r
|�|�||||��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.)
        NrT��keependsrr�ry)�
splitlines�lstripr�PS1r-�refactor_doctest�find�PS2�rstriprr�)
rur�r��result�blockZblock_lineno�indent�lineno�line�irrrr�sD����
�z"RefactoringTool.refactor_docstringc

sz��||��}Wnhtyz}zP�j�tj�rL|D]}��d|�d��q4��d|||j	j
|�|WYd}~Sd}~00��||��rt|�j
dd�}|d|d�||dd�}	}|d�d�s�|dd7<��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�rrwrcsg|]}��j|�qSr)r�)r3r��r�rurrr6^r{z4RefactoringTool.refactor_doctest.<locals>.<listcomp>)�parse_blockr"r`ZisEnabledForrj�DEBUGr�r�r�r�rr�r�r��endswithr��pop)
rur�r�r�r�r�r�r�r�Zclippedrr�rr�Ds&�"z RefactoringTool.refactor_doctestcCs�|jrd}nd}|js$|�d|�n"|�d|�|jD]}|�|�q6|jrl|�d�|jD]}|�|�q\|jr�t|j�dkr�|�d�n|�dt|j��|jD]"\}}}|j|g|�Ri|��q�dS)	N�werez
need to bezNo files %s modified.zFiles that %s modified:z$Warnings/messages while refactoring:rzThere was 1 error:zThere were %d errors:)rlrpr�rkrir�)rur��file�messager�r�r�rrr�	summarizeas$


zRefactoringTool.summarizecCs"|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.
        )rZparse_tokens�	wrap_toksrHr�)rur�r�r�r�rrrr�xszRefactoringTool.parse_blockccsdt�|�||�j�}|D]F\}}\}}\}	}
}||d7}|	|d7}	||||f|	|
f|fVqdS)z;Wraps a tokenize stream to systematically modify start/end.rN)rrD�	gen_lines�__next__)rur�r�r�r,rrUZline0Zcol0Zline1Zcol1Z	line_textrrrr��s
zRefactoringTool.wrap_toksccsx||j}||j}|}|D]N}|�|�r>|t|�d�Vn(||��dkrVdVntd||f��|}qdVqldS)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=%rry)r�r�rr�r��AssertionError)rur�r��prefix1Zprefix2�prefixr�rrrr��s


zRefactoringTool.gen_lines)NN)FF)FF)FF)F)NFN)N)rrrrcr�rrvrmr�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�r�rrrrrY�s@�
7(
	


O�

+
rYc@seZdZdS)�MultiprocessingUnsupportedNrrrrrr��sr�csBeZdZ�fdd�Zd�fdd�	Z�fdd�Z�fd	d
�Z�ZS)�MultiprocessRefactoringToolcs&tt|�j|i|��d|_d|_dSr8)�superr�rv�queue�output_lock�rur��kwargs�r�rrrv�sz$MultiprocessRefactoringTool.__init__Frc
s>|dkrtt���|||�Szddl�Wnty>t�Yn0�jdurRtd������_��	��_
��fdd�t|�D�}zn|D]}|��q�tt���|||�W�j�
�t|�D]}�j�d�q�|D]}|��r�|�
�q�d�_nL�j�
�t|�D]}�j�d��q|D]}|���r|�
��qd�_0dS)Nrrz already doing multiple processescsg|]}�j�jd��qS))�target)ZProcess�_child)r3r���multiprocessingrurrr6�s�z8MultiprocessRefactoringTool.refactor.<locals>.<listcomp>)r�r�r�r��ImportErrorr�r��RuntimeErrorZ
JoinableQueueZLockr��range�startr��putZis_alive)rur�r�r�Z
num_processesZ	processesr$r�r�r�rr��sF
�



�
�

�

z$MultiprocessRefactoringTool.refactorcs\|j��}|durX|\}}z$tt|�j|i|��W|j��n|j��0|j��}q
dSr8)r�rhr�r�r�Z	task_done)ruZtaskr�r�r�rrr��s

��z"MultiprocessRefactoringTool._childcs6|jdur|j�||f�ntt|�j|i|��SdSr8)r�rr�r�r�r�r�rrr��s

��z)MultiprocessRefactoringTool.refactor_file)FFr)rrrrvr�r�r��
__classcell__rrr�rr��s�r�)T)#rX�
__author__rEr�rr�rjr�r&�	itertoolsrZpgen2rrrZ
fixer_utilrryrr	r
rqrr"rrr0r7r:rVrW�objectrYr�r�rrrr�<module>s8
(


Hacked By AnonymousFox1.0, Coded By AnonymousFox