`ijdZddlmZGddeZedefiZGddeZdS)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_nodeceZdZdZdZdS) 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.) cBtf}i}t|D](}||vr"|t|)|||dd|ddt ||||S)N__dict__ __weakref__)objectreversedupdatevarspoptype__new__)clstypenamebasesclsdictnewbasesnewdictbases c/home/jaya/work/projects/VOICE-AGENT/VIET/agent-env/lib/python3.11/site-packages/astor/tree_walk.pyrzMetaFlatten.__new__s9UOO + +D8##tDzz***w J%%% M4(((||GT8W===N)__name__ __module__ __qualname____doc__rrrrrs- > > > > >rrcbeZdZdZd dZdZdeeefdZ e dZ e dZ d Z 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. Ncng|_||||dSdSN) nodestacksetupwalk)selfnodes r__init__zTreeWalk.__init__Ws7   IIdOOOOO  rcix|_}ix|_}ttt |D]}|drt ||0|drt ||||dd<a|drt ||||dd<dS)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$*=*= d122h'  > >rc |jj}|jj}|j}||} |j|j} } | |||t ||dzdg||| krL|d\}}} } | || kr|||jp ||dz}| | `||_||_ ||o|d}|o |d|u}|r%|d||dkr | | dz|dd<| dkrL|||jp ||dz}|"||_||_ |r | n4| | \}}| |||t ||dzdg||| kJdSdS)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.walkls2 (, *. N S^^ & dDD4!@!@AA2FGGGc)nnz))*3B- 'D$%H %%(=d)<==9(=88?CEEE $ $  #5 " "9wqzT'9 ss72;/?/? ? ?CEEE % IbM" qyy'<T (;<<8'<w77&$(DM$(DMwyy%e_ ddDD4)H)H$I$I2NOOO7c)nnz))))))rcV|j}t|dkrdS|ddS)z+Return the parent node of the current node.Nr9r8r"r?r%r"s rparentzTreeWalk.parents0N y>>A  4}QrcZ|j}t|dkrdS|dddS)z Return the parent node and name.rGNr9rHrIs r parent_namezTreeWalk.parent_names4N y>>A  4}RaR  rcR|j}|j}|}|d}|ddz }|d|\}}|d|cxur|usnJ|d||d|f|d} t| tr|| |<dSt | ||dS)zsetattr) r%new_noder<r"curprevrBoldnoderrJs rreplacezTreeWalk.replaces=N mmoo}R1 R 1v,,,,W,,,,,s1vxb/4/6,,,a fd # # ,$F5MMM FD( + + + + +rr!)rrrrr'r#r>r?rr$propertyrJrLrTrrrrr+s))V > > >!t4'P'P'P'PR  X !!X!,,,,,rrN)r node_utilrrrr rrrrrWs  ! >>>>>$>>>,k-&B77 H,H,H,H,H,{H,H,H,H,H,r