/
opt
/
alt
/
python35
/
lib64
/
python3.5
/
lib2to3
/
__pycache__
/
File Upload :
llllll
Current File: //opt/alt/python35/lib64/python3.5/lib2to3/__pycache__/fixer_util.cpython-35.pyc
��Yf�; � @ sv d Z d d l m Z d d l m Z d d l m Z m Z d d l m Z d d l m Z d d � Z d d � Z d d � Z d d � Z d d d � Z d d � Z d d � Z d d � Z e � e � d d � Z d d d d � Z d d � Z d d � Z d d! d" � Z d# d$ � Z d d% d& � Z d d' d( � Z d) d* � Z d+ d, � Z d- d. � Z d/ d0 � Z d1 d2 � Z! d3 d4 d5 d6 d7 d8 d9 d: d; d< h Z" d= d> � Z# d? a$ d@ a% dA a& dB a' dC dD � Z( dE dF � Z) dG dH � Z* dI dJ � Z+ dK dL � Z, dM dN � Z- dO dP � Z. dQ dR � Z/ e j0 e j1 h Z2 d dS dT � Z3 e j1 e j0 e j4 h Z5 dU dV � Z6 d dW dX � Z7 d S)Yz1Utility functions, node construction macros, etc.� )�islice� )�token)�Leaf�Node)�python_symbols)�patcompc C s% t t j | t t j d � | g � S)N�=)r �symsZargumentr r �EQUAL)�keyword�value� r �7/opt/alt/python35/lib64/python3.5/lib2to3/fixer_util.py� KeywordArg s r c C s t t j d � S)N�()r r �LPARr r r r �LParen s r c C s t t j d � S)N�))r r �RPARr r r r �RParen s r c C sf t | t � s | g } t | t � s9 d | _ | g } t t j | t t j d d d �g | � S)z Build an assignment statement� r �prefix) � isinstance�listr r r �atomr r r )�target�sourcer r r �Assign s r Nc C s t t j | d | �S)zReturn a NAME leafr )r r �NAME)�namer r r r �Name& s r! c C s | t t j t � | g � g S)zA node tuple for obj.attr)r r �trailer�Dot)�obj�attrr r r �Attr* s r& c C s t t j d � S)z A comma leaf�,)r r �COMMAr r r r �Comma. s r) c C s t t j d � S)zA period (.) leaf�.)r r �DOTr r r r r# 2 s r# c C sJ t t j | j � | j � g � } | rF | j d t t j | � � | S)z-A parenthesised argument list, used by Call()r )r r r" �clone� insert_child�arglist)�argsZlparenZrparen�noder r r �ArgList6 s $ r1 c C s7 t t j | t | � g � } | d k r3 | | _ | S)zA function callN)r r �powerr1 r )Z func_namer/ r r0 r r r �Call= s r3 c C s t t j d � S)zA newline literal� )r r �NEWLINEr r r r �NewlineD s r6 c C s t t j d � S)z A blank line� )r r r5 r r r r � BlankLineH s r8 c C s t t j | d | �S)Nr )r r �NUMBER)�nr r r r �NumberL s r; c C s1 t t j t t j d � | t t j d � g � S)z A numeric or string subscript�[�])r r r" r r �LBRACE�RBRACE)Z index_noder r r � SubscriptO s r@ c C s t t j | d | �S)z A string leafr )r r �STRING)�stringr r r r �StringU s rC c C s d | _ d | _ d | _ t t j d � } d | _ t t j d � } d | _ | | | | g } | r� d | _ t t j d � } d | _ | j t t j | | g � � t t j | t t j | � g � } t t j t t j d � | t t j d � 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. r7 r �for�in�ifr< r= ) r r r r �appendr r Zcomp_ifZ listmakerZcomp_forr r> r? ) Zxp�fp�itZtestZfor_leafZin_leafZ inner_argsZif_leaf�innerr r r �ListCompY s$ $ rK c C s x | D] } | j � q Wt t j d � t t j | d d �t t j d d d �t t j | � g } t t j | � } | S)zO Return an import statement in the form: from package import name_leafs�fromr r �import)�remover r r r r �import_as_names� import_from)Z package_nameZ name_leafsZleaf�children�impr r r � FromImportq s rS c C s� | d j � } | j t j k r1 | j � } n t t j | j � g � } | d } | ro d d � | D� } t t j t t | d � t | d � � t t j | d j � | | d j � g � g | � } | j | _ | S) zfReturns an import statement and calls a method of the module: import module module.name()r$ �afterc S s g | ] } | j � � q Sr )r, )�.0r: r r r � <listcomp>� s z!ImportAndCall.<locals>.<listcomp>r r ZlparZrpar) r, �typer r. r r2 r& r! r" r )r0 �results�namesr$ Z newarglistrT �newr r r � ImportAndCall� s Z r[ c C s� t | t � r. | j t � t � g k r. d St | t � o� t | j � d k o� t | j d t � o� t | j d t � o� t | j d t � o� | j d j d k o� | j d j d k S)z(Does the node represent a tuple literal?T� r r � r r )r r rQ r r �lenr r )r0 r r r �is_tuple� s *r_ c C sz t | t � oy t | j � d k oy t | j d t � oy t | j d t � oy | j d j d k oy | j d j d k S)z'Does the node represent a list literal?r r r< r= ���r` )r r r^ rQ r r )r0 r r r �is_list� s ra c C s t t j t � | t � g � S)N)r r r r r )r0 r r r � parenthesize� s rb �sortedr �set�any�all�tuple�sum�min�max� enumeratec c s4 t | | � } x | r/ | Vt | | � } q Wd S)al Follow 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 rn zefor_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<node=any any*> ')' > any* > Fc C s� t s9 t j t � a t j t � a t j t � a d a t t t g } xR t | t | d � � D]8 \ } } i } | j | | � ra | d | k ra d Sqa Wd S)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�parentr0 F) � pats_builtr Zcompile_pattern�p0�p1�p2�ziprn �match)r0 Zpatterns�patternro rX r r r �in_special_context� s %"rw c C s� | j } | d k r+ | j t j k r+ d S| j } | j t j t j f k rS d S| j t j k r| | j d | k r| d S| j t j k s� | j t j k r� | d k r� | j t j k s� | j d | k r� d Sd S)zG Check that something isn't an attribute or function name etc. NFr T) Z prev_siblingrW r r+ ro r �funcdef�classdef� expr_stmtrQ Z parametersZ typedargslistr( )r0 �prevro r r r �is_probably_builtin� s % r| c C sm xf | d k rh | j t j k r\ t | j � d k r\ | j d } | j t j k r\ | j S| j } q Wd S)z Find the indentation of *node*.Nr] r r7 ) rW r �suiter^ rQ r �INDENTr ro )r0 �indentr r r �find_indentation s ' r� c C sW | j t j k r | S| j � } | j d } | _ t t j | g � } | | _ | S)N)rW r r} r, ro r )r0 ro r} r r r � make_suite s r� c C s8 x1 | j t j k r3 | j } | s t d � � q W| S)z Find the top level namespace.z,root found before file_input node was found.)rW r Z file_inputro � ValueError)r0 r r r � find_root( s r� c C s" t | 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 r0 Zbindingr r r �does_tree_import1 s r� c C s | j t j t j f k S)z0Returns true if the node is an import statement.)rW r � import_namerP )r0 r r r � is_import9 s r� c C s� d d � } t | � } t | | | � r. d Sd } } xn t | j � D]] \ } } | | � sc qH x4 t | j | d � � D] \ } } | | � s} Pq} W| | } PqH W| d k rx\ t | j � D]K \ } } | j t j k r� | j r� | j d j t j k r� | d } Pq� W| d k rYt t j t t j d � t t j | d d �g � } n$ t | t t j | d d �g � } | t � g } | j | t t j | � � d S) z\ Works like `does_tree_import` but adds an import statement if it was not imported. c S s, | j t j k o+ | j o+ t | j d � S)Nr )rW r � simple_stmtrQ r� )r0 r r r �is_import_stmt@ s z$touch_import.<locals>.is_import_stmtNr r rM r r )r� r� rk rQ rW r r� r rA r r� r r rS r6 r- ) r� r r0 r� �rootZ insert_pos�offset�idxZnode2�import_rQ r r r � touch_import= s4 & !$r� c C s< x5| j D]*} d } | j t j k rp t | | j d � rB | St | t | j d � | � } | r| } n�| j t j t j f k r� t | t | j d � | � } | r| } n[| j t j k rvt | t | j d � | � } | r� | } qxt | j d d � � D]\ \ } } | j t j k r| j d k rt | t | j | d � | � } | r| } qWn� | j t k r�| j d j | k r�| } np t | | | � r�| } nU | j t j k r�t | | | � } n. | j t j k rt | | j d � r| } | r | s$| St | � r | Sq Wd S) 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.Nr r] r\ �:� r r` r` )rQ rW r Zfor_stmt�_findr� r� Zif_stmtZ while_stmtZtry_stmtrk r �COLONr � _def_syms�_is_import_bindingr� rz r� )r r0 r� �childZretr: �iZkidr r r r� k sH &!# % r� c C s| | g } xl | rw | j � } | j d k rO | j t k rO | j | j � q | j t j k r | j | k r | Sq Wd S)N� )�poprW � _block_syms�extendrQ r r r )r r0 Znodesr r r r� � s !r� c C s$ | j t j k r| r| j d } | j t j k r� x� | j D]Z } | j t j k rw | j d j | k r� | SqB | j t j k rB | j | k rB | SqB Wq | j t j k r� | j d } | j t j k r| j | k r| Sq | j t j k r | j | k r | Sn| j t j k r | rMt | j d � j � | k rMd S| j d } | rst d | � rsd S| j t j k r�t | | � r�| S| j t j k r�| j d } | j t j k r | j | k r | SnA | j t j k r| j | k r| S| r | j t j k r | Sd S)z� Will reuturn node if node will import name, or node will import * from package. None is returned otherwise. See test cases for examples. r r] Nr\ �asr` )rW r r� rQ Zdotted_as_namesZdotted_as_namer r r rP �str�stripr� rO Zimport_as_name�STAR)r0 r r� rR r� Zlastr: r r r r� � s@ ! !!% ! !!r� )8�__doc__� itertoolsr Zpgen2r Zpytreer r Zpygramr r r7 r r r r r r! r& r) r# r1 r3 r6 r8 r; r@ rC rK rS r[ r_ ra rb Zconsuming_callsrn rq rr rs rp rw r| r� r� r� r� r� r� ry rx r� r� r" r� r� r� r r r r �<module> s\ -*
Copyright ©2k19 -
Hexid
|
Tex7ure