\;jVdZddlmZGddeZedefiZGddeZy)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_nodeceZdZdZdZy) 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.) c tf}i}t|D]!}||vs|jt|#|j||j dd|j ddt j ||||S)N__dict__ __weakref__)objectreversedupdatevarspoptype__new__)clstypenamebasesclsdictnewbasesnewdictbases XG:\00. PROJECTS\API\Inventory\templateJSON\kerjaOCR\Lib\site-packages\astor/tree_walk.pyrzMetaFlatten.__new__ss9UOD8#tDz*$ w J% M4(||GT8W==N)__name__ __module__ __qualname____doc__rrrrrs  >rrcTeZdZdZd dZdZdeeefdZ e dZ e dZ d Z y) 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. NcZg|_|j||j|yyN) nodestacksetupwalk)selfnodes r__init__zTreeWalk.__init__Ws(   IIdO rcBix|_}ix|_}ttt |D]m}|j drt ||&|j drt ||||dd<J|j ds\t ||||dd<oy)zYAll the node-specific handlers are setup at object initialization time. init_pre_Npost_) pre_handlers post_handlerssortedr r startswithgetattr)r%r.r/rs rr#zTreeWalk.setup]s ,.-L-//]4T +,Dw'#d#%()0t)< T!"X&)*1$*= d12h' -rc ,|jj}|jj}|j}||} |j|j } } | |||t ||dzdg||| kDr|d\}}} } | || k\rs|||jxs ||dz}|| P||_||_ ||xr|d}|xr|d|u}|r|d||dk\r| | dz|dd<| dkrD|||jxs ||dz}|D||_||_ |r/| n'| | \}}| |||t ||dzdg||| kDryy)zUWalk the tree starting at a given node. Maintain a stack of nodes. _item_nameNr) r.getr/r"appendr rrcur_nodecur_name)r%r&rlistlenrr.r/r" emptystackr;r subnodesindexhandlercurrentpopstacks rr$z TreeWalk.walkls ((,, **.. NN ^ && dD4!@A2FG)nz)*3B- 'D$%H %(d)<)<=9(8?E $ $  #5 " "9wqzT'9 s72;/? ?E % IbM" qy'T (;(;<8'w7&$(DM$(DMy%e_ ddD4)H$I2NO7)nz)rcH|j}t|dkry|ddS)z+Return the parent node of the current node.Nr9r8r"r?r%r"s rparentzTreeWalk.parents+NN y>A }QrcH|j}t|dkry|dddS)z Return the parent node and name.rGNr9rHrIs r parent_namezTreeWalk.parent_names-NN y>A }Ra  rc|j}|j}|j}|d}|ddz }|d|\}}|d|cxur|usnJ|d||d|f|d} t| tr|| |<yt | ||y)zsetattr) r%new_noder<r"curprevrBoldnoderrJs rreplacezTreeWalk.replaces==NN mmo}R1 R 1v,W, 6s1vxb/4/6 6,a fd #$F5M FD( +rr!)rrrrr'r#r>r?rr$propertyrJrLrTrrrrr+sQ)V >!t4'PR  !!,rrN)r node_utilrrrr rrrrrWs; !>$>,-&B7 H,{H,r