o e@sBdZddlmZGdddeZedefiZGdddeZdS)a  Part of the astor library for Python AST manipulation. License: 3-clause BSD Copyright 2012 (c) Patrick Maupin Copyright 2013 (c) Berker Peksag This file contains a TreeWalk class that views a node tree as a unified whole and allows several modes of traversal. ) iter_nodec@seZdZdZddZdS) MetaFlattenzThis metaclass is used to flatten classes to remove class hierarchy. This makes it easier to manipulate classes (find attributes in a single dict, etc.) cCs`tf}i}t|D] }||vr|t|q |||dd|ddt||||S)N__dict__ __weakref__)objectreversedupdatevarspoptype__new__)ZclstypenamebasesZclsdictZnewbasesZnewdictbaser?D:\Projects\ConvertPro\env\Lib\site-packages\astor/tree_walk.pyr s    zMetaFlatten.__new__N)__name__ __module__ __qualname____doc__r rrrrrs rc@sTeZdZdZdddZddZdeeefdd Z e d d Z e d d Z ddZ dS)TreeWalkaThe TreeWalk class can be used as a superclass in order to walk an AST or similar tree. Unlike other treewalkers, this class can walk a tree either recursively or non-recursively. Subclasses can define methods with the following signatures:: def pre_xxx(self): pass def post_xxx(self): pass def init_xxx(self): pass Where 'xxx' is one of: - A class name - An attribute member name concatenated with '_name' For example, 'pre_targets_name' will process nodes that are referenced by the name 'targets' in their parent's node. - An attribute member name concatenated with '_item' For example, 'pre_targets_item' will process nodes that are in a list that is the targets attribute of some node. pre_xxx will process a node before processing any of its subnodes. if the return value from pre_xxx evalates to true, then walk will not process any of the subnodes. Those can be manually processed, if desired, by calling self.walk(node) on the subnodes before returning True. post_xxx will process a node after processing all its subnodes. init_xxx methods can decorate the class instance with subclass-specific information. A single init_whatever method could be written, but to make it easy to keep initialization with use, any number of init_xxx methods can be written. They will be called in alphabetical order. NcCs(g|_||dur||dSdSN) nodestacksetupwalk)selfnoderrr__init__Ws zTreeWalk.__init__cCsi|_}i|_}ttt|D]/}|dr t||q|dr1t||||dd<q|drAt||||dd<qdS)zYAll the node-specific handlers are setup at object initialization time. Zinit_Zpre_NZpost_) pre_handlers post_handlerssortedr r startswithgetattr)rr r!r rrrr]s     zTreeWalk.setupcCs||jj}|jj}|j}||} |j|j} } | |||t||ddg||| kr|d\}}} } | || kru|||jpE||d}|durN| q%||_||_ ||o\|d}|od|d|u}|rt|d||dkrt| q%| d|dd<| dkr|||jp||d}|dur||_||_ |r| n| | \}}| |||t||ddg||| ks+dSdS)zUWalk the tree starting at a given node. Maintain a stack of nodes. Z_item_nameNr) r getr!rappendr rrcur_nodeZcur_name)rrr listlenr r r!rZ emptystackr+r ZsubnodesindexhandlercurrentZpopstackrrrrlsJ      z TreeWalk.walkcCs"|j}t|dkr dS|ddS)z+Return the parent node of the current node.Nr)r(rr.rrrrrparents  zTreeWalk.parentcCs&|j}t|dkr dS|dddS)z Return the parent node and name.r2Nr)r3r4rrr parent_names zTreeWalk.parent_namec Cs|j}|j}|}|d}|dd}|d|\}}|d|ur(|us5nJ|d||d|f|d} t| trD|| |<dSt| ||dS)zs