//////////////////////////////////////////////////////////////////////////////////// // $Log: markTargetAssociated.pp,v $ // Revision 5.5.1.1 1994/08/24 19:33:05 demeter // *** empty log message *** // // Revision 5.5 1994/08/24 19:33:03 demeter // *** empty log message *** // // Revision 5.4.1.2 1994/02/24 20:56:04 demeter // reimplement object transportation -- cun // // Revision 5.4.1.1 1994/02/24 16:27:27 demeter // spin for the --demeter_5_4-- branch // // Revision 5.4 1994/02/24 16:27:26 demeter // Initial file // // //////////////////////////////////////////////////////////////////////////////////// *operation* void markTargetAssociated(Cd_graph* schema,Vertex_selector* targets) *wrapper* Cd_graph *prefix* (@ adjacencies->markTargetAssociated(schema,targets); @) *wrapper* Adjacency_Nlist *prefix* (@ Adjacency_list_iterator next(*this); Adjacency* each; while (each = next()) { int r = 0; targets->contains(each->get_source(),r); if (r) each->markTargetAssociated(schema,targets); } @) *wrapper* Adjacency *prefix* (@ ns->markTargetAssociated(schema,targets); @) *wrapper* Neighbors *prefix* (@ @) *wrapper* Neighbors_wc *prefix* (@ @) *wrapper* Alternat_ns *prefix* (@ if (alternat_ns) alternat_ns->markTargetAssociated(schema,targets); @) *wrapper* Term_Barlist *prefix* (@ static DemString * markt = new DemString("call"); static DemString * marka = new DemString("propagate"); Term_list_iterator nextt(*this); Term* eacht; while (eacht = nextt()) { if (!markt->g_equal(eacht->get_call())) delete eacht->rset_call((DemString *)markt->g_copy()); Adjacency_list_iterator nexta(*schema->get_adjacencies()); Adjacency* eacha; while (eacha = nexta()) if (eacha->get_source()->equal(eacht->get_vertex())) break; assert(eacha); if (!marka->g_equal(eacha->get_propagate())) delete eacha->rset_propagate((DemString *)marka->g_copy()); eacha->markTargetAssociated(schema,targets); } @)