|
ROSE
0.9.6a
|
|
ROSE
0.9.6a
|
class hierarchy does not have multiple edges, so "setS" is used as vertex list More...
#include <Classhierarchy.h>
Public Member Functions | |
| Classhierarchy (long pid, long type, GlobalDatabaseConnection *gdb) | |
| constructor More... | |
| ~Classhierarchy () | |
| destructor More... | |
| void | inheritVirtualFunctions () |
| init virtual fucntion inheritance More... | |
| vector < SgMemberFunctionDeclaration * > | searchMemberFunctionCalls (SgMemberFunctionDeclaration *) |
| search for all possible (virtual) function calls More... | |
 Public Member Functions inherited from DatabaseGraph< typesRowdata, EdgeTypeEmpty, setS, vecS, bidirectionalS, property< vertex_classhierarchy_t, chVertexData, GraphvizVertexProperty >, GraphvizEdgeProperty, GraphvizGraphProperty > | |
| DatabaseGraph (long pid, long type, sqlite3x::sqlite3_connection *gdb) | |
| constructor More... | |
| ~DatabaseGraph () | |
| destructor More... | |
| dbgVertex | insertVertex (typesRowdata &e1, std::string name) |
| add a vertex to the graph, returns the boost vertex descriptor More... | |
| dbgVertex | insertVertex (typesRowdata &e, std::string name, int subgraphId, std::string subgraphName) |
| add a vertex with subgraph information - subgraphs are currently not supported!!! More... | |
| dbgEdgeReturn | insertEdge (typesRowdata &e1, typesRowdata &e2, EdgeTypeEmpty &value) |
| insert an edge between e1 and e2 More... | |
| dbgEdgeReturn | insertEdge (typesRowdata &e1, typesRowdata &e2) |
| insert an edge between e1 and e2, using the empty edge data class More... | |
| bool | searchEdge (EdgeTypeEmpty &edge, dbgEdge &edesc) const |
| search for a specific edge in the graph, using operator= on the id, returns false if not found More... | |
| void | setSubgraphInit (int refcol, dbRow *rowdata, int namecol) |
| set subgraph initialization information More... | |
| int | clearSuccessors (typesRowdata &parent) |
| remove all successor pointers from a node More... | |
| int | removeNode (typesRowdata &node) |
| remove node from the tree More... | |
| int | nodeIsUsed (typesRowdata &node) |
| check if there is an edge in the graph pointing to this node More... | |
| int | getGraphId () |
| get graph id (this function creates an graphdata entry, if the id is not retrieved by another function yet) More... | |
| void | setNodeNameColumn (int set) |
| set the column number of the VertexType column to take the node names from More... | |
| int | loadFromDatabase (void) |
| load graph from datbase More... | |
| int | writeToDatabase (void) |
| store graph in datbase More... | |
| void | writeToDOTFile (std::string filename) |
| write DOT graph to filename More... | |
| void | writeAdjacencyMatrixToFileRaw (std::string filename) |
| write the adjacency matrix to a file (only integer matrix entries, raw file format) More... | |
| void | writeAdjacencyMatrixToFileMcl (std::string filename) |
| write the adjacency matrix to a file (in MCL raw file format for mcxassemble) More... | |
Additional Inherited Members | |
| Public Types inherited from DatabaseGraph< typesRowdata, EdgeTypeEmpty, setS, vecS, bidirectionalS, property< vertex_classhierarchy_t, chVertexData, GraphvizVertexProperty >, GraphvizEdgeProperty, GraphvizGraphProperty > | |
| typedef boost::adjacency_list < setS, vecS, bidirectionalS, boost::property < boost::vertex_index1_t, std::size_t, boost::property < boost::vertex_name_t, std::string, boost::property < boost::vertex_color_t, boost::default_color_type, boost::property < boost::vertex_dbg_data_t, typesRowdata, property < vertex_classhierarchy_t, chVertexData, GraphvizVertexProperty > > > > >, boost::property < boost::edge_dbg_data_t, EdgeTypeEmpty, GraphvizEdgeProperty > , boost::property < boost::graph_dbg_data_t, int, GraphvizGraphProperty > > | dbgType |
| boost graph typedefs More... | |
| typedef boost::graph_traits < dbgType >::vertex_descriptor | dbgVertex |
| typedef boost::graph_traits < dbgType >::vertex_iterator | dbgVertexIterator |
| typedef boost::graph_traits < dbgType >::edge_descriptor | dbgEdge |
| typedef boost::graph_traits < dbgType >::edge_iterator | dbgEdgeIterator |
| typedef std::pair< bool, dbgEdge > | dbgEdgeReturn |
class hierarchy does not have multiple edges, so "setS" is used as vertex list
Definition at line 38 of file Classhierarchy.h.
|
inline |
constructor
Definition at line 46 of file Classhierarchy.h.
|
inline |
destructor
Definition at line 53 of file Classhierarchy.h.
| void Classhierarchy::inheritVirtualFunctions | ( | ) |
init virtual fucntion inheritance
| vector<SgMemberFunctionDeclaration*> Classhierarchy::searchMemberFunctionCalls | ( | SgMemberFunctionDeclaration * | ) |
search for all possible (virtual) function calls
1.8.4 
