관리-도구
편집 파일: _ast_util.cpython-37.pyc
B �C]�O � @ sr d Z ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ dd lm Z dd lm Z dd lm Z dd lm Z dd lm Z ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ dd lm Z dd lm Z dd lm Z dd lm Z dd lm Z dd!l!m"Z" ed"ed#iZ#ed$e d%ed&ed'e d(ed)ed*e d+ed,ed-ed.i Z$e d/e d0e d1ed2ed3ed4ed5ed6ed7ed8i Z%ed9ed:e d$e d%iZ&i Z'e'�(e#� e'�(e$� e'�(e%� e'�(e&� dHd=d>�Z)d?d@� Z*G dAdB� dBe+�Z,G dCdD� dDe,�Z-G dEdF� dFe,�Z.dGS )Iz� ast ~~~ This is a stripped down version of Armin Ronacher's ast module. :copyright: Copyright 2008 by Armin Ronacher. :license: Python License. � )�Add)�And)�AST)�BitAnd)�BitOr)�BitXor)�Div)�Eq)�FloorDiv)�Gt)�GtE)�If)�In)�Invert)�Is)�IsNot)�LShift)�Lt)�LtE)�Mod)�Mult)�Name)�Not)�NotEq)�NotIn)�Or)� PyCF_ONLY_AST)�RShift)�Sub)�UAdd)�USub)�arg_stringname�and�or�+�-�*�/z//�%z<<z>>�|�&�^z==�>z>=�in�iszis not�<z<=z!=znot in�~�not� <unknown>�execc C s t | ||t�S )z%Parse an expression into an AST node.)�compiler )�expr�filename�mode� r8 �?/opt/alt/python37/lib/python3.7/site-packages/mako/_ast_util.py�parseZ s r: c c sR t | d�r| jsdS x8| jD ].}y|t| |�fV W q tk rH Y q X q W dS )zAIterate over all fields of a node, only yielding existing fields.�_fieldsN)�hasattrr; �getattr�AttributeError)�node�fieldr8 r8 r9 � iter_fields_ s rA c @ s( e Zd ZdZdd� Zdd� Zdd� ZdS ) � NodeVisitora� Walks the abstract syntax tree and call visitor functions for every node found. The visitor functions may return values which will be forwarded by the `visit` method. Per default the visitor functions for the nodes are ``'visit_'`` + class name of the node. So a `TryFinally` node visit function would be `visit_TryFinally`. This behavior can be changed by overriding the `get_visitor` function. If no visitor function exists for a node (return value `None`) the `generic_visit` visitor is used instead. Don't use the `NodeVisitor` if you want to apply changes to nodes during traversing. For this a special visitor exists (`NodeTransformer`) that allows modifications. c C s d|j j }t| |d�S )z� Return the visitor function for this node or `None` if no visitor exists for this node. In that case the generic visit function is used instead. �visit_N)� __class__�__name__r= )�selfr? �methodr8 r8 r9 � get_visitor} s zNodeVisitor.get_visitorc C s$ | � |�}|dk r||�S | �|�S )z Visit a node.N)rH � generic_visit)rF r? �fr8 r8 r9 �visit� s zNodeVisitor.visitc C s\ xVt |�D ]J\}}t|t�r@x6|D ]}t|t�r"| �|� q"W q t|t�r | �|� q W dS )z9Called if no explicit visitor function exists for a node.N)rA � isinstance�listr rK )rF r? r@ �value�itemr8 r8 r9 rI � s zNodeVisitor.generic_visitN)rE � __module__� __qualname__�__doc__rH rK rI r8 r8 r8 r9 rB k s rB c @ s e Zd ZdZdd� ZdS )�NodeTransformera Walks the abstract syntax tree and allows modifications of nodes. The `NodeTransformer` will walk the AST and use the return value of the visitor functions to replace or remove the old node. If the return value of the visitor function is `None` the node will be removed from the previous location otherwise it's replaced with the return value. The return value may be the original node in which case no replacement takes place. Here an example transformer that rewrites all `foo` to `data['foo']`:: class RewriteName(NodeTransformer): def visit_Name(self, node): return copy_location(Subscript( value=Name(id='data', ctx=Load()), slice=Index(value=Str(s=node.id)), ctx=node.ctx ), node) Keep in mind that if the node you're operating on has child nodes you must either transform the child nodes yourself or call the generic visit function for the node first. Nodes that were part of a collection of statements (that applies to all statement nodes) may also return a list of nodes rather than just a single node. Usually you use the transformer like this:: node = YourTransformer().visit(node) c C s� x�t |�D ]�\}}t||d �}t|t�r�g }xL|D ]D}t|t�rl| �|�}|d krVq2nt|t�sl|�|� q2|�|� q2W ||d d �< q t|t�r | �|�}|d kr�t||� q t |||� q W |S )N) rA r= rL rM r rK �extend�append�delattr�setattr)rF r? r@ � old_value� new_valuesrN �new_noder8 r8 r9 rI � s( z NodeTransformer.generic_visitN)rE rP rQ rR rI r8 r8 r8 r9 rS � s "rS c @ s e Zd ZdZdd� Zdd� Zd�dd�Zd d � Zd d � Zd d� Z dd� Z dd� Z dd� Z dd� Z dd� Zdd� Zdd � Zd d � Zd d � Zd!d"� Zd#d$� Zd%d&� Zd'd(� Zd)d*� Zd+d,� Zd-d.� Zd/d0� Zd1d2� Zd3d4� Z d5d6� Z d7d8� Z d9d:� Z d;d<� Z d=d>� Z!d?d@� Z"dAdB� Z#dCdD� Z$dEdF� Z%dGdH� Z&dIdJ� Z'dKdL� Z(dMdN� Z)dOdP� Z*dQdR� Z+e+dSdT�Z,e+dUdV�Z-[+dWdX� Z.dYdZ� Z/d[d\� Z0d]d^� Z1d_d`� Z2dadb� Z3dcdd� Z4dedf� Z5dgdh� Z6didj� Z7dkdl� Z8dmdn� Z9e9dSdT�Z:e9dodp�Z;e9dUdV�Z<[9dqdr� Z=dsdt� Z>dudv� Z?dwdx� Z@dydz� ZAd{d|� ZBd}d~� ZCdS )��SourceGeneratorz� This visitor is able to transform a well formed syntax tree into python sourcecode. For more details have a look at the docstring of the `node_to_source` function. c C s g | _ || _d| _d| _d S )Nr )�result� indent_with� indentation� new_lines)rF r] r8 r8 r9 �__init__� s zSourceGenerator.__init__c C sH | j r8| jr | j�d| j � | j�| j| j � d| _ | j�|� d S )N� r )r_ r\ rU r] r^ )rF �xr8 r8 r9 �write� s zSourceGenerator.write� c C s t | j|�| _d S )N)�maxr_ )rF �nr8 r8 r9 �newline� s zSourceGenerator.newlinec C s> d| _ | jd7 _x|D ]}| �|� qW | jd8 _d S )NTrd )Znew_liner^ rK )rF Z statements�stmtr8 r8 r9 �body� s zSourceGenerator.bodyc C s4 | � |j � |jr0| �� | �d� | � |j� d S )Nzelse:)ri �orelserg rc )rF r? r8 r8 r9 � body_or_else� s z SourceGenerator.body_or_elsec s� g �� �fdd�}d gt |j�t |j� }xJt|j||j �D ]4\}}|� � �|� |d k r@� �d� � �|� q@W |jd k r�|� � �dt|j� � |jd k r�|� � �dt|j� � d S )Nc s �r� � d� n ��d� d S )Nz, T)rc rU r8 )rF � want_commar8 r9 � write_comma� s z.SourceGenerator.signature.<locals>.write_comma�=r& z**) �len�args�defaults�ziprK rc �varargr! �kwarg)rF r? rm �padding�arg�defaultr8 )rF rl r9 � signature� s zSourceGenerator.signaturec C s0 x*|j D ] }| �� | �d� | �|� qW d S )N�@)Zdecorator_listrg rc rK )rF r? � decoratorr8 r8 r9 � decorators s zSourceGenerator.decoratorsc C sR | � � x.t|j�D ] \}}|r*| �d� | �|� qW | �d� | �|j� d S )Nz, z = )rg � enumerate�targetsrc rK rN )rF r? �idx�targetr8 r8 r9 � visit_Assign s z SourceGenerator.visit_Assignc C s< | � � | �|j� | �tt|j� d � | �|j� d S )Nrn )rg rK r rc � BINOP_SYMBOLS�type�oprN )rF r? r8 r8 r9 �visit_AugAssign# s z SourceGenerator.visit_AugAssignc C sV | � � | �dd|j |jf � x.t|j�D ] \}}|rD| �d� | �|� q.W d S )Nzfrom %s%s import �.z, )rg rc �level�moduler| �names)rF r? r~ rO r8 r8 r9 �visit_ImportFrom) s z SourceGenerator.visit_ImportFromc C s0 | � � x"|jD ]}| �d� | �|� qW d S )Nzimport )rg r� rc rK )rF r? rO r8 r8 r9 � visit_Import1 s z SourceGenerator.visit_Importc C s | � � | �|� d S )N)rg rI )rF r? r8 r8 r9 � visit_Expr7 s zSourceGenerator.visit_Exprc C sT | j dd� | �|� | � � | �d|j � | �|j� | �d� | �|j� d S )N� )rf zdef %s(z):)rg r{ rc �namerx rp ri )rF r? r8 r8 r9 �visit_FunctionDef; s z!SourceGenerator.visit_FunctionDefc s g � � �fdd�}�j dd� ��|� �� � ��d|j � x |jD ]}|� ��|� qHW t|d�r�x0|jD ]&}|� ��|jd � ��|j � qrW t |dd �r�|� ��d � ��|j � t |d d �r�|� ��d � ��|j � ��� r�d p�d � �� |j � d S )Nc s( � r�� d� n� �d� �� d� d S )Nz, T�()rc rU r8 )� have_argsrF r8 r9 �paren_or_commaG s z6SourceGenerator.visit_ClassDef.<locals>.paren_or_comma� )rf zclass %s�keywordsrn �starargsr& �kwargsz**z):�:)rg r{ rc r� �basesrK r< r� rv rN r= r� r� ri )rF r? r� �base�keywordr8 )r� rF r9 �visit_ClassDefD s0 z SourceGenerator.visit_ClassDefc C s� | � � | �d� | �|j� | �d� | �|j� x�|j}t|�dkr�t|d t�r�|d }| � � | �d� | �|j� | �d� | �|j� q6| � � | �d� | �|� P q6W d S )Nzif r� rd r zelif zelse:) rg rc rK �testri rj ro rL r )rF r? Zelse_r8 r8 r9 �visit_Ifg s$ zSourceGenerator.visit_Ifc C sL | � � | �d� | �|j� | �d� | �|j� | �d� | �|� d S )Nzfor z in r� )rg rc rK r �iterrk )rF r? r8 r8 r9 � visit_For| s zSourceGenerator.visit_Forc C s6 | � � | �d� | �|j� | �d� | �|� d S )Nzwhile r� )rg rc rK r� rk )rF r? r8 r8 r9 � visit_While� s zSourceGenerator.visit_Whilec C sX | � � | �d� | �|j� |jd k r>| �d� | �|j� | �d� | �|j� d S )Nzwith z as r� )rg rc rK Z context_exprZ optional_varsri )rF r? r8 r8 r9 � visit_With� s zSourceGenerator.visit_Withc C s | � � | �d� d S )N�pass)rg rc )rF r? r8 r8 r9 � visit_Pass� s zSourceGenerator.visit_Passc C sz | � � | �d� d}|jd k r:| �d� | �|j� d}x*|jD ] }|rT| �d� | �|� d}qBW |jsv| �d� d S )Nzprint Fz >> Tz, �,)rg rc �destrK �values�nl)rF r? rl rN r8 r8 r9 � visit_Print� s zSourceGenerator.visit_Printc C sD | � � | �d� x,t|�D ] \}}|r2| �d� | �|� q W d S )Nzdel z, )rg rc r| rK )rF r? r~ r r8 r8 r9 � visit_Delete� s z SourceGenerator.visit_Deletec C s< | � � | �d� | �|j� x|jD ]}| �|� q&W d S )Nztry:)rg rc ri �handlersrK )rF r? �handlerr8 r8 r9 �visit_TryExcept� s z SourceGenerator.visit_TryExceptc C s@ | � � | �d� | �|j� | � � | �d� | �|j� d S )Nztry:zfinally:)rg rc ri Z finalbody)rF r? r8 r8 r9 �visit_TryFinally� s z SourceGenerator.visit_TryFinallyc C s" | � � | �dd�|j� � d S )Nzglobal z, )rg rc �joinr� )rF r? r8 r8 r9 � visit_Global� s z SourceGenerator.visit_Globalc C s" | � � | �dd�|j� � d S )Nz nonlocal z, )rg rc r� r� )rF r? r8 r8 r9 �visit_Nonlocal� s z SourceGenerator.visit_Nonlocalc C s" | � � | �d� | �|j� d S )Nzreturn )rg rc rK rN )rF r? r8 r8 r9 � visit_Return� s z SourceGenerator.visit_Returnc C s | � � | �d� d S )N�break)rg rc )rF r? r8 r8 r9 � visit_Break� s zSourceGenerator.visit_Breakc C s | � � | �d� d S )N�continue)rg rc )rF r? r8 r8 r9 �visit_Continue� s z SourceGenerator.visit_Continuec C s� | � � | �d� t|d�r^|jd k r^| �d� | �|j� |jd k r�| �d� | �|j� n`t|d�r�|jd k r�| �|j� |jd k r�| �d� | �|j� |jd k r�| �d� | �|j� d S )N�raise�exc� z from r� z, ) rg rc r< r� rK �causer� �instZtback)rF r? r8 r8 r9 � visit_Raise� s zSourceGenerator.visit_Raisec C s | � |j� | �d|j � d S )Nr� )rK rN rc �attr)rF r? r8 r8 r9 �visit_Attribute� s z SourceGenerator.visit_Attributec s� g �� �fdd�}� � |j� � �d� x |jD ]}|� � � |� q0W x0|jD ]&}|� � �|jd � � � |j� qPW t|dd �r�|� � �d� � � |j� t|dd �r�|� � �d� � � |j � � �d � d S ) Nc s �r� � d� n ��d� d S )Nz, T)rc rU r8 )rF rl r8 r9 rm � s z/SourceGenerator.visit_Call.<locals>.write_commar� rn r� r& r� z**�)) rK �funcrc rp r� rv rN r= r� r� )rF r? rm rv r� r8 )rF rl r9 � visit_Call� s( zSourceGenerator.visit_Callc C s | � |j� d S )N)rc �id)rF r? r8 r8 r9 � visit_Name s zSourceGenerator.visit_Namec C s | � t|j�� d S )N)rc �strrN )rF r? r8 r8 r9 �visit_NameConstant s z"SourceGenerator.visit_NameConstantc C s | � |j� d S )N)rc rv )rF r? r8 r8 r9 � visit_arg s zSourceGenerator.visit_argc C s | � t|j�� d S )N)rc �repr�s)rF r? r8 r8 r9 � visit_Str s zSourceGenerator.visit_Strc C s | � t|j�� d S )N)rc r� r� )rF r? r8 r8 r9 � visit_Bytes s zSourceGenerator.visit_Bytesc C s | � t|j�� d S )N)rc r� rf )rF r? r8 r8 r9 � visit_Num s zSourceGenerator.visit_Numc C s | � t|j�� d S )N)rc r� rN )rF r? r8 r8 r9 �visit_Constant s z SourceGenerator.visit_Constantc C sT | � d� d}x.t|j�D ] \}}|r0| � d� | �|� qW | � |rJdpLd� d S )Nr� ���z, r� z,))rc r| �eltsrK )rF r? r~ rO r8 r8 r9 � visit_Tuple" s zSourceGenerator.visit_Tuplec s � �fdd�}|S )Nc sH | � � � x.t|j�D ] \}}|r,| � d� | �|� qW | � �� d S )Nz, )rc r| r� rK )rF r? r~ rO )�left�rightr8 r9 rK , s z-SourceGenerator.sequence_visit.<locals>.visitr8 )r� r� rK r8 )r� r� r9 �sequence_visit+ s z SourceGenerator.sequence_visit�[�]�{�}c C sh | � d� xNtt|j|j��D ]8\}\}}|r8| � d� | �|� | � d� | �|� q W | � d� d S )Nr� z, z: r� )rc r| rr �keysr� rK )rF r? r~ �keyrN r8 r8 r9 � visit_Dict: s zSourceGenerator.visit_Dictc C sH | � d� | �|j� | � dtt|j� � | �|j� | � d� d S )Nr� z %s r� )rc rK r� r� r� r� r� )rF r? r8 r8 r9 � visit_BinOpD s zSourceGenerator.visit_BinOpc C sV | � d� x<t|j�D ].\}}|r:| � dtt|j� � | �|� qW | � d� d S )Nr� z %s r� )rc r| r� �BOOLOP_SYMBOLSr� r� rK )rF r? r~ rN r8 r8 r9 � visit_BoolOpK s z SourceGenerator.visit_BoolOpc C s` | � d� | �|j� x:t|j|j�D ](\}}| � dtt|� � | �|� q&W | � d� d S )Nr� z %s r� )rc rK r� rr ZopsZ comparators� CMPOP_SYMBOLSr� )rF r? r� r� r8 r8 r9 � visit_CompareS s z SourceGenerator.visit_Comparec C sN | � d� tt|j� }| � |� |dkr4| � d� | �|j� | � d� d S )Nr� r1 r� r� )rc �UNARYOP_SYMBOLSr� r� rK �operand)rF r? r� r8 r8 r9 � visit_UnaryOp[ s z SourceGenerator.visit_UnaryOpc C s0 | � |j� | �d� | � |j� | �d� d S )Nr� r� )rK rN rc �slice)rF r? r8 r8 r9 �visit_Subscriptd s z SourceGenerator.visit_Subscriptc C sr |j d k r| �|j � | �d� |jd k r6| �|j� |jd k rn| �d� t|jt�rb|jjdksn| �|j� d S )Nr� �None)�lowerrK rc �upper�steprL r r� )rF r? r8 r8 r9 � visit_Slicej s zSourceGenerator.visit_Slicec C s0 x*|j D ] \}}|r | �d� | �|� qW d S )Nz, )Zdimsrc rK )rF r? r~ rO r8 r8 r9 �visit_ExtSliceu s z SourceGenerator.visit_ExtSlicec C s | � d� | �|j� d S )Nzyield )rc rK rN )rF r? r8 r8 r9 � visit_Yield{ s zSourceGenerator.visit_Yieldc C s0 | � d� | �|j� | � d� | �|j� d S )Nzlambda z: )rc rx rp rK ri )rF r? r8 r8 r9 � visit_Lambda s z SourceGenerator.visit_Lambdac C s | � d� d S )N�Ellipsis)rc )rF r? r8 r8 r9 �visit_Ellipsis� s z SourceGenerator.visit_Ellipsisc s � �fdd�}|S )Nc s> | � � � | �|j� x|jD ]}| �|� q W | � �� d S )N)rc rK �elt� generators)rF r? � comprehension)r� r� r8 r9 rK � s z.SourceGenerator.generator_visit.<locals>.visitr8 )r� r� rK r8 )r� r� r9 �generator_visit� s z SourceGenerator.generator_visitr� r� c C sT | � d� | �|j� | � d� | �|j� x|jD ]}| �|� q4W | � d� d S )Nr� z: r� )rc rK r� rN r� )rF r? r� r8 r8 r9 �visit_DictComp� s z SourceGenerator.visit_DictCompc C s< | � |j� | �d� | � |j� | �d� | � |j� d S )Nz if z else )rK ri rc r� rj )rF r? r8 r8 r9 � visit_IfExp� s zSourceGenerator.visit_IfExpc C s | � d� | �|j� d S )Nr& )rc rK rN )rF r? r8 r8 r9 � visit_Starred� s z SourceGenerator.visit_Starredc C s$ | � d� | �|j� | � d� d S )N�`)rc rK rN )rF r? r8 r8 r9 � visit_Repr� s zSourceGenerator.visit_Reprc C s* | � |j� |jd k r&| � d|j � d S )Nz as )rc r� Zasname)rF r? r8 r8 r9 � visit_alias� s zSourceGenerator.visit_aliasc C sZ | � d� | �|j� | � d� | �|j� |jrVx"|jD ]}| � d� | �|� q:W d S )Nz for z in z if )rc rK r r� Zifs)rF r? Zif_r8 r8 r9 �visit_comprehension� s z#SourceGenerator.visit_comprehensionc C sl | � � | �d� |jd k rR| �d� | �|j� |jd k rR| �d� | �|j� | �d� | �|j� d S )N�exceptr� z as r� )rg rc r� rK r� ri )rF r? r8 r8 r9 �visit_excepthandler� s z#SourceGenerator.visit_excepthandlerN)rd )DrE rP rQ rR r` rc rg ri rk rx 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� Z visit_ListZ visit_Setr� r� r� r� r� r� r� r� r� r� r� r� Zvisit_ListCompZvisit_GeneratorExpZ visit_SetCompr� r� r� r� r� r� r� r8 r8 r8 r9 r[ � s� # r[ N)r2 r3 )/rR �_astr 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 Z mako.compatr! r� r� r� r� Z ALL_SYMBOLS�updater: rA �objectrB rS r[ r8 r8 r8 r9 �<module> s� -<