iZBSrSSKJr SSKJr SSKJr "SS\5rg)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_stackc\rSrSrSrSSjrSrSSjrSrSr S r S r S r S r S rSrSrSrSrSrSSjrSrSrSrSrSrg) ObjectGraphzj A graph of objects that have a "graphident" attribute. graphident is the key for the object in the graph NctUc [5nXlXlX lSUlUR US5 gNr)r graphidentgraphdebugindentadd_node)selfr r s AC:\des-py\RoboSAPF\venv\Lib\site-packages\altgraph\ObjectGraph.py__init__ObjectGraph.__init__s2 =GE    tT"c6S[U5R<S3$)N<>)type__name__)rs r__repr__ObjectGraph.__repr__sd,,..rc`UcUnURU5nURRX!S9$)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 rflattenObjectGraph.flatten s6 =E  'zz"""DDrc## URH@nURRU5nUcM#URRU5v MB g7fN)r node_data)ridentnodes rnodesObjectGraph.nodes*sBZZE::''.Djj**511 s ,A"Ac^UcTnTRU5nTRRU5u p4nU4SjnU"US5U"US54$)Nc3># [5nU4SjU5H2nX1nXB;dMTRU5v URU5 M4 g7f)Nc3Z># UH nTRRU5v M" g7fr$)r describe_edge).0ers r .iter_edges..8s#AS 0033Ss(+)setfindNodeadd)lstnseentplr&rs r iter_edges)ObjectGraph.get_edges..iter_edges6sD5DASA$--..HHUO Bs !A)A)rr describe_node)rr'r_outrawincrawr9s` r get_edgesObjectGraph.get_edges0sX <D  &#zz77>1f $&!$j&;;;rcUcUnURU5nURU5nURRX45nURRU5$r$)rr edge_by_node edge_data)rfromNodetoNoderstopedges redgeDataObjectGraph.edgeData@sV  H  *'zz&&u3zz##D))rcUcUnURU5nURU5nURRXE5nURRXc5 gr$)rr rDupdate_edge_data)rrFrGrJrrHrIs rupdateEdgeDataObjectGraph.updateEdgeDataHsS  H  *'zz&&u3 ##D3rc [URX5up#nUHupVURRXVSS9 M! UHnURRU5 M [ U5S- [ U5[ U54$)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) orphanrE)rr add_edge hide_nodelen)rfiltersvisitedremovesorphans last_goodtailr's r filterStackObjectGraph.filterStackPsz%1T$K!'&OI JJ   8  D 'D JJ  &7|aWs7|;;rcdURU5nUbURRU5 gg)z3 Remove the given node from the graph if it exists N)getIdentr rUrr'r&s r removeNodeObjectGraph.removeNodebs/ d#   JJ  ' rcUcUnURU5nURU5nUbAUb=URRX45nUcgURRU5 M<gg)z* Remove all edges from fromnode to tonode N)r`r rD hide_edge)rfromnodetonode fromidenttoidentrIs rremoveReferenceObjectGraph.removeReferencejst  HMM(+ --'  W%8zz..yB< $$T* &9 rcpURU5nUbU$URU5nUcgUR$)z% Get the graph identifier for a node N)rr3r ras rr`ObjectGraph.getIdentys?  &  L}}T" <rc,XLaU$[USS5nU$)z& Get the identifier for a node object r N)getattrras rrObjectGraph.getRawIdents! <KlD1 rc(URU5SL$r$)r3rr's r __contains__ObjectGraph.__contains__s}}T"$..rcURU5nUcUnURRU5$![a gf=f)z Find the node on the graph N)rr r%KeyErrorras rr3ObjectGraph.findNodesJ  & =E ::''. .  s3 AAcURSSU5 URRUR5 g![a) URR URU5 gf=f)z0 Add a node to the graph referenced by the root addNodeN)msgr restore_noder rrrrs rrzObjectGraph.addNodesV It$ 7 JJ # #DOO 4 7 JJ   6 7s%;0A.-A.cUcUnURU5URU5pTUbUcgURSSXU5 URRXEUS9 g)z, Create a reference from fromnode to tonode NrycreateReferencerR)r`r{r rT)rrfrgrErhris rrObjectGraph.createReferences_  H!]]84dmmF6K7    %xC I)DrchURU5nUcU"U/UQ70UD6nURU5 U$)zT Add a node of type cls to the graph if it does not already exist by the given name )r3rz)rclsnameargskwms r createNodeObjectGraph.createNodes; MM$  9D&4&2&A LLOrc U(aPXR::a@[SUR-<U<SSR[ [ U55<35 ggg)z, Print a debug message with the given level z  N)r printrjoinmapreprrlevelsrs rr{ObjectGraph.msgs> **$ tdkk11chhs46OP Q%1rcrXR::a(UR"X/UQ76 URS-Ulgg)z" Print a debug message and indent rSN)r r{rrs rmsginObjectGraph.msgins3 JJ  HHU % %++/DK rcrXR::a(URS- UlUR"X/UQ76 gg)z" Dedent and print a debug message rSN)r rr{rs rmsgoutObjectGraph.msgouts3 JJ ++/DK HHU % % r)r r r rr )NNr$)r __module__ __qualname____firstlineno____doc__rrr!r(rArJrNr]rbrjr`rrsr3rzrrr{rr__static_attributes__rrrrsn #/E2 < *4<$( + /  7 E R*&rrN) raltgraphraltgraph.Graphraltgraph.GraphUtilrobjectrrrrrs# +F&&F&r