#include "pp.h" void Cd_graph::get_subclasses( Vertex* avertex,Vertex_List* result,Path_constraint_exp* c ) { DEM_TRACE("Cd_graph","void Cd_graph::get_subclasses(Vertex* avertex,Vertex_List* result,Path_constraint_exp* c)"); // prefix class wrappers adjacencies->get_subclasses(avertex, result, c); // suffix class wrappers } void Adjacency_Nlist::get_subclasses( Vertex* avertex,Vertex_List* result,Path_constraint_exp* c ) { DEM_TRACE("Adjacency_Nlist","void Adjacency_Nlist::get_subclasses(Vertex* avertex,Vertex_List* result,Path_constraint_exp* c)"); // prefix class wrappers Adjacency_list_iterator next(*this); Adjacency* each; while (each = next()) if (each->get_source()->equal(avertex)) { result->append(each->get_source()); each->get_subclasses(this,result,c); return; } // suffix class wrappers } void Adjacency::get_subclasses( Adjacency_Nlist* adjs,Vertex_List* result,Path_constraint_exp* c ) { DEM_TRACE("Adjacency","void Adjacency::get_subclasses(Adjacency_Nlist* adjs,Vertex_List* result,Path_constraint_exp* c)"); // prefix class wrappers ns->get_subclasses(source, adjs, result, c); // suffix class wrappers } void Neighbors::get_subclasses( Vertex* source,Adjacency_Nlist* adjs,Vertex_List* result,Path_constraint_exp* c ) { DEM_TRACE("Neighbors","void Neighbors::get_subclasses(Vertex* source,Adjacency_Nlist* adjs,Vertex_List* result,Path_constraint_exp* c)"); // prefix class wrappers // suffix class wrappers } void Alternat_ns::get_subclasses( Vertex* source,Adjacency_Nlist* adjs,Vertex_List* result,Path_constraint_exp* c ) { DEM_TRACE("Alternat_ns","void Alternat_ns::get_subclasses(Vertex* source,Adjacency_Nlist* adjs,Vertex_List* result,Path_constraint_exp* c)"); // prefix class wrappers if (alternat_ns) alternat_ns->get_subclasses(source, adjs, result, c); // suffix class wrappers } void Term_Barlist::get_subclasses( Vertex* source,Adjacency_Nlist* adjs,Vertex_List* result,Path_constraint_exp* c ) { DEM_TRACE("Term_Barlist","void Term_Barlist::get_subclasses(Vertex* source,Adjacency_Nlist* adjs,Vertex_List* result,Path_constraint_exp* c)"); // prefix class wrappers static DemString * mark = new DemString("bypassing"); Term_list_iterator next(*this); Term* each; while (each = next()) if (!mark->g_equal(each->get_bypassing())) { if (c && c->isXInhEdgeInTheList(each->get_vertex(), source)) continue; adjs->get_subclasses(each->get_vertex(),result,c); } // suffix class wrappers }