FM / __pycache_

/usr/lib64/python3.9/lib2to3/__pycache__/

/usr/lib64/python3.9/lib2to3/__pycache__

Name	Size	Mode	Actions
btm_matcher.cpython-39.opt-1.pyc	4877	0644	edit dl rm
btm_matcher.cpython-39.opt-2.pyc	3306	0644	edit dl rm
btm_matcher.cpython-39.pyc	4877	0644	edit dl rm
btm_utils.cpython-39.opt-1.pyc	6148	0644	edit dl rm
btm_utils.cpython-39.opt-2.pyc	4636	0644	edit dl rm
btm_utils.cpython-39.pyc	6148	0644	edit dl rm
fixer_base.cpython-39.opt-1.pyc	6255	0644	edit dl rm
fixer_base.cpython-39.opt-2.pyc	3504	0644	edit dl rm
fixer_base.cpython-39.pyc	6255	0644	edit dl rm
fixer_util.cpython-39.opt-1.pyc	12170	0644	edit dl rm
fixer_util.cpython-39.opt-2.pyc	10007	0644	edit dl rm
fixer_util.cpython-39.pyc	12170	0644	edit dl rm
main.cpython-39.opt-1.pyc	8671	0644	edit dl rm
main.cpython-39.opt-2.pyc	6918	0644	edit dl rm
main.cpython-39.pyc	8689	0644	edit dl rm
patcomp.cpython-39.opt-1.pyc	5389	0644	edit dl rm
patcomp.cpython-39.opt-2.pyc	4881	0644	edit dl rm
patcomp.cpython-39.pyc	5605	0644	edit dl rm
pygram.cpython-39.opt-1.pyc	1262	0644	edit dl rm
pygram.cpython-39.opt-2.pyc	1057	0644	edit dl rm
pygram.cpython-39.pyc	1262	0644	edit dl rm
pytree.cpython-39.opt-1.pyc	23672	0644	edit dl rm
pytree.cpython-39.opt-2.pyc	14969	0644	edit dl rm
pytree.cpython-39.pyc	24295	0644	edit dl rm
refactor.cpython-39.opt-1.pyc	20613	0644	edit dl rm
refactor.cpython-39.opt-2.pyc	16567	0644	edit dl rm
refactor.cpython-39.pyc	20643	0644	edit dl rm
__init__.cpython-39.opt-1.pyc	302	0644	edit dl rm
__init__.cpython-39.opt-2.pyc	302	0644	edit dl rm
__init__.cpython-39.pyc	302	0644	edit dl rm
__main__.cpython-39.opt-1.pyc	215	0644	edit dl rm
__main__.cpython-39.opt-2.pyc	215	0644	edit dl rm
__main__.cpython-39.pyc	215	0644	edit dl rm

Edit: /usr/lib64/python3.9/lib2to3/__pycache__/fixer_util.cpython-39.opt-1.pyc (12170B)

a �if;�@s�dZddlmZddlmZmZddlmZddl m Z dd�Zdd �Zd d�Z dd �ZdNdd�Zdd�Zdd�Zdd�Ze�e �fdd�ZdOdd�Zdd�Zdd�ZdPdd �Zd!d"�ZdQd#d$�ZdRd%d&�Zd'd(�Zd)d*�Zd+d,�Zd-d.�Zd/d0�Zhd1�Z d2d3�Z!d4a"d5a#d6a$d7a%d8d9�Z&d:d;�Z'dd?�Z)d@dA�Z*dBdC�Z+dDdE�Z,dFdG�Z-ej.ej/hZ0dSdHdI�Z1ej/ej.ej2hZ3dJdK�Z4dTdLdM�Z5dS)Uz1Utility functions, node construction macros, etc.�)�token)�Leaf�Node)�python_symbols)�patcompcCsttj|ttjd�|g�S)N�=)r�syms�argumentrr�EQUAL)�keyword�value�r �*/usr/lib64/python3.9/lib2to3/fixer_util.py� KeywordArgs�rcCsttjd�S)N�()rr�LPARr r r r�LParensrcCsttjd�S)N�))rr�RPARr r r r�RParensrcCsHt|t�s|g}t|t�s&d|_|g}ttj|ttjddd�g|�S)zBuild an assignment statement� r��prefix) � isinstance�listrrr�atomrrr )�target�sourcer r r�Assigns �rNcCsttj||d�S)zReturn a NAME leafr)rr�NAME)�namerr r r�Name$sr!cCs|ttjt�|g�gS)zA node tuple for obj.attr)rr�trailer�Dot)�obj�attrr r r�Attr(sr&cCsttjd�S)zA comma leaf�,)rr�COMMAr r r r�Comma,sr)cCsttjd�S)zA period (.) leaf�.)rr�DOTr r r rr#0sr#cCs4ttj|��|��g�}|r0|�dttj|��|S)z-A parenthesised argument list, used by Call()r)rrr"�clone�insert_child�arglist)�argsZlparenZrparen�noder r r�ArgList4sr1cCs&ttj|t|�g�}|dur"||_|S)zA function callN)rr�powerr1r)� func_namer/rr0r r r�Call;sr4cCsttjd�S)zA newline literal� �rr�NEWLINEr r r r�NewlineBsr8cCsttjd�S)zA blank line�r6r r r r� BlankLineFsr:cCsttj||d�S)Nr)rr�NUMBER)�nrr r r�NumberJsr=cCs"ttjttjd�|ttjd�g�S)zA numeric or string subscript�[�])rrr"rr�LBRACE�RBRACE)Z index_noder r r� SubscriptMs �rBcCsttj||d�S)z A string leafr)rr�STRING)�stringrr r r�StringSsrEc Cs�d|_d|_d|_ttjd�}d|_ttjd�}d|_||||g}|rtd|_ttjd�}d|_|�ttj||g��ttj|ttj |�g�}ttj ttjd�|ttjd�g�S)zuA list comprehension of the form [xp for fp in it if test]. If test is None, the "if test" part is omitted. r9r�for�in�ifr>r?) rrrr�appendrrZcomp_ifZ listmakerZcomp_forrr@rA) Zxp�fp�it�testZfor_leafZin_leafZ inner_argsZif_leaf�innerr r r�ListCompWs( ��rNcCsV|D]}|��qttjd�ttj|dd�ttjddd�ttj|�g}ttj|�}|S)zO Return an import statement in the form: from package import name_leafs�fromrr�import)�removerrrrr�import_as_names�import_from)Zpackage_nameZ name_leafsZleaf�children�impr r r� FromImportos �rVc Cs�|d��}|jtjkr"|��}nttj|��g�}|d}|rNdd�|D�}ttjtt|d�t|d��ttj|d��||d��g�g|�}|j |_ |S) zfReturns an import statement and calls a method of the module: import module module.name()r$�aftercSsg|]}|��qSr )r,)�.0r<r r r� ��z!ImportAndCall..�rZlparZrpar) r,�typerr.rr2r&r!r"r)r0�results�namesr$Z newarglistrW�newr r r� ImportAndCall�s* ��r`cCs�t|t�r |jt�t�gkr dSt|t�o�t|j�dko�t|jdt�o�t|jdt�o�t|jdt�o�|jdjdko�|jdjdkS)z(Does the node represent a tuple literal?T�r[r�rr)rrrTrr�lenrr�r0r r r�is_tuple�s ��recCsXt|t�oVt|j�dkoVt|jdt�oVt|jdt�oV|jdjdkoV|jdjdkS)z'Does the node represent a list literal?rr[��r>r?)rrrcrTrrrdr r r�is_list�s ��rgcCsttjt�|t�g�S�N)rrrrrrdr r r�parenthesize�sri> �sorted�sum�anyr�set�tuple�all�min� enumerate�maxccs$t||�}|r |Vt||�}q dS)alFollow an attribute chain. If you have a chain of objects where a.foo -> b, b.foo-> c, etc, use this to iterate over all objects in the chain. Iteration is terminated by getattr(x, attr) is None. Args: obj: the starting object attr: the name of the chaining attribute Yields: Each successive object in the chain. N)�getattr)r$r%�nextr r r� attr_chain�s ruzefor_stmt< 'for' any 'in' node=any ':' any* > | comp_for< 'for' any 'in' node=any any* > z� power< ( 'iter' | 'list' | 'tuple' | 'sorted' | 'set' | 'sum' | 'any' | 'all' | 'enumerate' | (any* trailer< '.' 'join' >) ) trailer< '(' node=any ')' > any* > z` power< ( 'sorted' | 'enumerate' ) trailer< '(' arglist ')' > any* > FcCspts&t�t�at�t�at�t�adatttg}t|t|d��D]*\}}i}|�||�r@|d|ur@dSq@dS)a Returns true if node is in an environment where all that is required of it is being iterable (ie, it doesn't matter if it returns a list or an iterator). See test_map_nochange in test_fixers.py for some examples and tests. T�parentr0F) � pats_builtr�compile_pattern�p0�p1�p2�zipru�match)r0�patterns�patternrvr]r r r�in_special_context�s r�cCs�|j}|dur|jtjkrdS|j}|jtjtjfvr:dS|jtjkrX|j d|urXdS|jtj ks�|jtjkr�|dur�|jtjks�|j d|ur�dSdS)zG Check that something isn't an attribute or function name etc. NFr[T) Zprev_siblingr\rr+rvr�funcdef�classdef� expr_stmtrT� parametersZ typedargslistr()r0�prevrvr r r�is_probably_builtin�s& �� r�cCsJ|durF|jtjkr>t|j�dkr>|jd}|jtjkr>|jS|j}qdS)zFind the indentation of *node*.Nrbrr9) r\r�suitercrTr�INDENTrrv)r0�indentr r r�find_indentations r�cCs>|jtjkr|S|��}|jd}|_ttj|g�}||_|Srh)r\rr�r,rvr)r0rvr�r r r� make_suitesr�cCs$|jtjkr |j}|std��q|S)zFind the top level namespace.z,root found before file_input node was found.)r\rZ file_inputrv� ValueErrorrdr r r� find_root&s r�cCst|t|�|�}t|�S)z� Returns true if name is imported from package at the top level of the tree which node belongs to. To cover the case of an import like 'import foo', use None for the package and 'foo' for the name. )�find_bindingr��bool)�packager r0Zbindingr r r�does_tree_import/sr�cCs|jtjtjfvS)z0Returns true if the node is an import statement.)r\r�import_namerSrdr r r� is_import7sr�cCs.dd�}t|�}t|||�r dSd}}t|j�D]F\}}||�sDq2t|j|d��D]\}}||�sVqlqV||}qzq2|dkr�t|j�D]8\}}|jtjkr�|jr�|jdjtjkr�|d}q�q�|dur�t tj ttjd�ttj|dd�g�} nt |ttj|dd�g�} | t�g} |�|t tj| ��dS) z\ Works like `does_tree_import` but adds an import statement if it was not imported. cSs |jtjko|jot|jd�S)Nr[)r\r�simple_stmtrTr�rdr r r�is_import_stmt>s�z$touch_import..is_import_stmtNr[rrPrr)r�r�rqrTr\rr�rrCrr�rrrVr8r-)r�r r0r��rootZ insert_pos�offset�idxZnode2�import_rTr r r�touch_import;s8� � r�cCs�|jD�]�}d}|jtjkrVt||jd�r4|St|t|jd�|�}|rR|}�n0|jtjtjfvr�t|t|jd�|�}|r�|}�n�|jtj k�rt|t|jd�|�}|r�|}nTt |jdd��D]@\}}|jtjkr�|j dkr�t|t|j|d�|�}|r�|}q�nx|jtv�r2|jdj |k�r2|}nTt|||��rF|}n@|jtjk�rbt|||�}n$|jtjk�r�t||jd��r�|}|r|�s�|St|�r|SqdS) z� Returns the node which binds variable name, otherwise None. If optional argument package is supplied, only imports will be returned. See test cases for examples.Nrrfrbra�:�r[)rTr\rZfor_stmt�_findr�r�Zif_stmtZ while_stmtZtry_stmtrqr�COLONr� _def_syms�_is_import_bindingr�r�r�)r r0r��child�retr<�iZkidr r rr�isB r�cCsT|g}|rP|��}|jdkr4|jtvr4|�|j�q|jtjkr|j|kr|SqdS)N�)�popr\�_block_syms�extendrTrrr)r r0Znodesr r rr��sr�cCs�|jtjkr�|s�|jd}|jtjkrx|jD]H}|jtjkrV|jdj|krt|Sq,|jtjkr,|j|kr,|Sq,nL|jtjkr�|jd}|jtjkr�|j|kr�|Sn|jtjkr�|j|kr�|Sn�|jtj k�r�|r�t |jd��|kr�dS|jd}|�rtd|��rdS|jtj k�r0t||��r0|S|jtjk�rh|jd}|jtjk�r�|j|k�r�|Sn6|jtjk�r�|j|k�r�|S|�r�|jtjk�r�|SdS)z� Will return node if node will import name, or node will import * from package. None is returned otherwise. See test cases for examples. rrbrfNra�as)r\rr�rTZdotted_as_namesZdotted_as_namerrrrS�str�stripr�rRZimport_as_name�STAR)r0r r�rUr��lastr<r r rr��s@ r�)N)NN)N)N)N)N)N)6�__doc__Zpgen2rZpytreerrZpygramrrr9rrrrrr!r&r)r#r1r4r8r:r=rBrErNrVr`rergriZconsuming_callsruryrzr{rwr�r�r�r�r�r�r�r�r�r�r�r�r"r�r�r�r r r r�sX - *