OhZBdZddlmZddlmZddlmZGddeZy)z altgraph.ObjectGraph - Graph of objects with an identifier ========================================================== A graph of objects that have a "graphident" attribute. graphident is the key for the object in the graph ) GraphError)Graph) filter_stackceZdZdZddZdZddZdZdZdZ d Z d Z d Z d Z d ZdZdZdZdZddZdZdZdZdZy) ObjectGraphzv A graph of objects that have a "graphident" attribute. graphident is the key for the object in the graph Ncx| t}||_||_||_d|_|j |dyNr)r graphidentgraphdebugindentadd_node)selfr r s f/mnt/c/Users/Administrator/Desktop/help_/test_env/lib/python3.12/site-packages/altgraph/ObjectGraph.py__init__zObjectGraph.__init__s8 =GE    tT"c4dt|jdS)N<>)type__name__)rs r__repr__zObjectGraph.__repr__sd,,..rcf||}|j|}|jj||S)z Iterate over the subgraph that is entirely reachable by condition starting from the given start node or the ObjectGraph root )start condition) getRawIdentr iterdata)rrrs rflattenzObjectGraph.flatten s8 =E  'zz"")"DDrc#K|jD]=}|jj|}|!|jj|?ywN)r node_data)ridentnodes rnodeszObjectGraph.nodes*sHZZ 2E::''.Djj**511 2s -A Ac|}j|}jj|\}}}}fd}||d||dfS)Nc3Kt}fd|DD]0}||}||vs j||j|2yw)Nc3TK|]}jj|!ywr )r describe_edge).0ers r z.iter_edges..8s A 003As%()setfindNodeadd)lstnseentplr"rs r iter_edgesz)ObjectGraph.get_edges..iter_edges6sM5DASA $A$--..HHUO  $s "A 'A )rr describe_node)rr#r_outrawincrawr3s` r get_edgeszObjectGraph.get_edges0sZ <D  &#zz77>1ff $&!$j&;;;rc||}|j|}|j|}|jj||}|jj|Sr )rr edge_by_node edge_data)rfromNodetoNoderstopedges redgeDatazObjectGraph.edgeData@sX  H  *'zz&&ud3zz##D))rc||}|j|}|j|}|jj||}|jj||yr )rr r<update_edge_data)rr>r?rBrr@rAs rupdateEdgeDatazObjectGraph.updateEdgeDataHsW  H  *'zz&&ud3 ##D(3rct|j||\}}}|D]#\}}|jj||d%|D]}|jj|t |dz t |t |fS)z Filter the ObjectGraph in-place by removing all edges to nodes that do not match every filter in the given filter list Returns a tuple containing the number of: (nodes_visited, nodes_removed, nodes_orphaned) orphanr=)rr add_edge hide_nodelen)rfiltersvisitedremovesorphans last_goodtailr#s r filterStackzObjectGraph.filterStackPs%1T7$K!'& EOIt JJ   48  D E 'D JJ  & '7|aWs7|;;rcb|j|}||jj|yy)zC Remove the given node from the graph if it exists N)getIdentr rKrr#r"s r removeNodezObjectGraph.removeNodebs/ d#   JJ  ' rc||}|j|}|j|}|?|< |jj||}|y|jj|;yy)z: Remove all edges from fromnode to tonode N)rUr r< hide_edge)rfromnodetonode fromidenttoidentrAs rremoveReferencezObjectGraph.removeReferencejsv  HMM(+ --'  W%8zz..y'B< $$T* &9 rcl|j|}||S|j|}|y|jS)z5 Get the graph identifier for a node N)rr-r rVs rrUzObjectGraph.getIdentys?  &  L}}T" <rc,||ur|St|dd}|S)z6 Get the identifier for a node object r N)getattrrVs rrzObjectGraph.getRawIdents# 4<KlD1 rc(|j|duSr )r-rr#s r __contains__zObjectGraph.__contains__s}}T"$..rc|j|}||} |jj|S#t$rYywxYw)z, Find the node on the graph N)rr r!KeyErrorrVs rr-zObjectGraph.findNodesJ  & =E ::''. .  s 2 >>c|jdd| |jj|jy#t$r)|jj |j|YywxYw)z@ Add a node to the graph referenced by the root addNodeN)msgr restore_noder rrrcs rrizObjectGraph.addNodesV It$ 7 JJ # #DOO 4 7 JJ   6 7s%;/A-,A-c||}|j||j|}}||y|jdd||||jj|||y)z< Create a reference from fromnode to tonode NrhcreateReferencerH)rUrjr rJ)rrZr[r=r\r]s rrmzObjectGraph.createReferencese  H!]]84dmmF6K7    %xC Iw)Drcf|j|}|||g|i|}|j||S)zl Add a node of type cls to the graph if it does not already exist by the given name )r-ri)rclsnameargskwms r createNodezObjectGraph.createNodes; MM$  9D&4&2&A LLOrc |rM||jkr=td|jz|ddjt t |yyy)z< Print a debug message with the given level z  N)r printr joinmapreprrlevelsrqs rrjzObjectGraph.msgs@ $**$ tdkk11chhs46OP Q%1rct||jkr)|j||g||jdz|_yy)z2 Print a debug message and indent rIN)r rjr r{s rmsginzObjectGraph.msgins9 DJJ  DHHUA % %++/DK rct||jkr)|jdz |_|j||g|yy)z2 Dedent and print a debug message rIN)r r rjr{s rmsgoutzObjectGraph.msgouts9 DJJ ++/DK DHHUA % % rr )NNr )r __module__ __qualname____doc__rrrr$r:rBrErSrWr^rUrrdr-rirmrtrjrrrrrrsn #/E2 < *4<$( + /  7 E R*&rrN) raltgraphraltgraph.Graphraltgraph.GraphUtilrobjectrrrrrs# +F&&F&r