← Back
Editing: ast.cpython-35.pyc
��Yf�. � @ s� d Z d d l Td d d d � Z d d � Z d d d d � Z d d � Z d d � Z d d d � Z d d � Z d d � Z d d d � Z d d � Z Gd d � d e � Z Gd d � d e � Z d S)!aH ast ~~~ The `ast` module helps Python applications to process trees of the Python abstract syntax grammar. The abstract syntax itself might change with each Python release; this module helps to find out programmatically what the current grammar looks like and allows modifications of it. An abstract syntax tree can be generated by passing `ast.PyCF_ONLY_AST` as a flag to the `compile()` builtin function or by using the `parse()` function from this module. The result will be a tree of objects whose classes all inherit from `ast.AST`. A modified abstract syntax tree can be compiled into a Python code object using the built-in `compile()` function. Additionally various helper functions are provided that make working with the trees simpler. The main intention of the helper functions and this module in general is to provide an easy to use interface for libraries that work tightly with the python syntax (template engines for example). :copyright: Copyright 2008 by Armin Ronacher. :license: Python License. � )�*z <unknown>�execc C s t | | | t � S)zn Parse the source into an AST node. Equivalent to compile(source, filename, mode, PyCF_ONLY_AST). )�compileZ PyCF_ONLY_AST)�source�filename�mode� r �(/opt/alt/python35/lib64/python3.5/ast.py�parse s r c sU t | t � r! t | d d �} t | t � r9 | j } � f d d � � � | � S)a Safely evaluate an expression node or a string containing a Python expression. The string or node provided may only consist of the following Python literal structures: strings, bytes, numbers, tuples, lists, dicts, sets, booleans, and None. r �evalc s t | t t f � r | j St | t � r2 | j St | t � rW t t � | j � � St | t � r| t t � | j � � St | t � r� t t � | j � � St | t � r� t � f d d � t | j | j � D� � St | t � r� | j St | t � rbt | j t t f � rbt | j t t t f � rb� | j � } t | j t � rZ| S| Sn� t | t � r�t | j t t f � r�t | j t t t f � r�t | j t t t f � r�� | j � } � | j � } t | j t � r�| | S| | St d t | � � � d S)Nc 3 s- | ]# \ } } � | � � | � f Vq d S)Nr )�.0�k�v)�_convertr r � <genexpr>= s z1literal_eval.<locals>._convert.<locals>.<genexpr>zmalformed node or string: )!� isinstance�StrZBytes�sZNum�nZTuple�tuple�mapZeltsZList�list�Set�setZDict�dict�zip�keys�valuesZ NameConstant�valueZUnaryOp�opZUAddZUSub�operandZBinOpZAddZSub�right�left� ValueError�repr)�noder r" r! )r r r r 1 s@ z literal_eval.<locals>._convert)r �strr Z Expression�body)Znode_or_stringr )r r � literal_eval& s #r( TFc sG � � � f d d � � t | t � s= t d | j j � � � | � S)a� Return a formatted dump of the tree in *node*. This is mainly useful for debugging purposes. The returned string will show the names and the values for fields. This makes the code impossible to evaluate, so if evaluation is wanted *annotate_fields* must be set to False. Attributes such as line numbers and column offsets are not dumped by default. If this is wanted, *include_attributes* can be set to True. c s t � t � r� � f d d � t � � D� } d � j j d j � rY d d � | D� n d d � | D� � f } � r� � j r� | | r� d p� d 7} | d j � � f d d � � j D� � 7} | d St � t � r� d d j � f d d � � D� � St � � S) Nc s( g | ] \ } } | � | � f � q Sr r )r �a�b)�_formatr r � <listcomp>b s z)dump.<locals>._format.<locals>.<listcomp>z%s(%sz, c s s | ] } d | Vq d S)z%s=%sNr )r �fieldr r r r d s z(dump.<locals>._format.<locals>.<genexpr>c s s | ] \ } } | Vq d S)Nr )r r) r* r r r r f s � c 3 s. | ]$ } d | � t � | � � f Vq d S)z%s=%sN)�getattr)r r) )r+ r% r r r j s �)z[%s]c 3 s | ] } � | � Vq d S)Nr )r �x)r+ r r r n s ) r �AST� iter_fields� __class__�__name__�join� _attributesr r$ )r% Zfields�rv)r+ �annotate_fields�include_attributes)r% r r+ ` s $zdump.<locals>._formatzexpected AST, got %r)r r2 � TypeErrorr4 r5 )r% r9 r: r )r+ r9 r: r �dumpW s r< c C s[ xT d D]L } | | j k r | | j k r t | | � r t | | t | | � � q W| S)z� Copy source location (`lineno` and `col_offset` attributes) from *old_node* to *new_node* if possible, and return *new_node*. �lineno� col_offset)r= r> )r7 �hasattr�setattrr/ )�new_nodeZold_node�attrr r r � copy_locationu s rC c s& � f d d � � � | d d � | S)a{ When you compile a node tree with compile(), the compiler expects lineno and col_offset attributes for every node that supports them. This is rather tedious to fill in for generated nodes, so this helper adds these attributes recursively where not already set, by setting them to the values of the parent node. It works recursively starting at *node*. c s� d | j k r3 t | d � s* | | _ n | j } d | j k rf t | d � s] | | _ n | j } x$ t | � D] } � | | | � qs Wd S)Nr= r> )r7 r? r= r> �iter_child_nodes)r% r= r> �child)�_fixr r rF � s z#fix_missing_locations.<locals>._fix� r r )r% r )rF r �fix_missing_locations� s rH rG c C sC x< t | � D]. } d | j k r t | d d � | | _ q W| S)z� Increment the line number of each node in the tree starting at *node* by *n*. This is useful to "move code" to a different location in a file. r= r )�walkr7 r/ r= )r% r rE r r r �increment_lineno� s rJ c c sE x> | j D]3 } y | t | | � f VWq t k r< Yq Xq Wd S)zs Yield a tuple of ``(fieldname, value)`` for each field in ``node._fields`` that is present on *node*. N)�_fieldsr/ �AttributeError)r% r- r r r r3 � s r3 c c sl xe t | � D]W \ } } t | t � r0 | Vq t | t � r x" | D] } t | t � rF | VqF Wq Wd S)z� Yield all direct child nodes of *node*, that is, all fields that are nodes and all items of fields that are lists of nodes. N)r3 r r2 r )r% �namer- �itemr r r rD � s rD c C s� t | t t t t f � s1 t d | j j � � | j r� t | j d t � r� t | j d j t � r� | r� d d l } | j | j d j j � S| j d j j Sd S)z� Return the docstring for the given node or None if no docstring can be found. If the node provided does not have docstrings a TypeError will be raised. z%r can't have docstringsr N)r ZAsyncFunctionDefZ FunctionDefZClassDefZModuler; r4 r5 r' ZExprr r �inspectZcleandocr )r% ZcleanrO r r r � get_docstring� s rP c c sT d d l m } | | g � } x. | rO | j � } | j t | � � | Vq" Wd S)z� Recursively yield all descendant nodes in the tree starting at *node* (including *node* itself), in no specified order. This is useful if you only want to modify nodes in place and don't care about the context. r )�dequeN)� collectionsrQ �popleft�extendrD )r% rQ Ztodor r r rI � s rI c @ s. e Z d Z d Z d d � Z d d � Z d S)� NodeVisitora< A node visitor base class that walks the abstract syntax tree and calls a visitor function for every node found. This function may return a value which is forwarded by the `visit` method. This class is meant to be subclassed, with the subclass adding visitor methods. 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 `visit` method. 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 | | | j � } | | � S)z Visit a node.Zvisit_)r4 r5 r/ � generic_visit)�selfr% �methodZvisitorr r r �visit� s zNodeVisitor.visitc C s| xu t | � D]g \ } } t | t � rX xI | D]" } t | t � r/ | j | � q/ Wq t | t � r | j | � q Wd S)z9Called if no explicit visitor function exists for a node.N)r3 r r r2 rY )rW r% r- r rN r r r rV � s zNodeVisitor.generic_visitN)r5 � __module__� __qualname__�__doc__rY rV r r r r rU � s rU c @ s" e Z d Z d Z d d � Z d S)�NodeTransformera\ A :class:`NodeVisitor` subclass that walks the abstract syntax tree and allows modification of nodes. The `NodeTransformer` will walk the AST and use the return value of the visitor methods to replace or remove the old node. If the return value of the visitor method is ``None``, the node will be removed from its location, otherwise it is replaced with the return value. The return value may be the original node in which case no replacement takes place. Here is an example transformer that rewrites all occurrences of name lookups (``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 :meth:`generic_visit` method for the node first. For nodes that were part of a collection of statements (that applies to all statement nodes), the visitor 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 | t � r� g } xj | D]b } t | t � r� | j | � } | d k rk q5 n t | t � s� | j | � q5 | j | � q5 W| | d d � <q t | t � r | j | � } | d k r� t | | � q t | | | � q W| S)N) r3 r r r2 rY rT �append�delattrr@ )rW r% r- Z old_valueZ new_valuesr rA r r r rV & s& z NodeTransformer.generic_visitN)r5 rZ r[ r\ rV r r r r r] s "r] N)r\ Z_astr r( r< rC rH rJ r3 rD rP rI �objectrU r] r r r r �<module> s 1 %
Save File
Cancel