Manuel Dobusch
ec42ef708d
Added simple layouting functions (implementations for simple grid and circle layout). Also the graph displays class members and connections (edges) to or from them "correctly" now. fortune cookie message = Your exotic ideas will lead you to many exciting new adventures.
33 lines
1.2 KiB
C++
33 lines
1.2 KiB
C++
#ifndef GRAPH_ACCESS_PROXY_H
|
|
#define GRAPH_ACCESS_PROXY_H
|
|
|
|
#include "data/access/GraphAccess.h"
|
|
|
|
class GraphAccessProxy: public GraphAccess
|
|
{
|
|
public:
|
|
GraphAccessProxy();
|
|
virtual ~GraphAccessProxy();
|
|
|
|
bool hasSubject() const;
|
|
void setSubject(GraphAccess* subject);
|
|
|
|
// GraphAccess implementation
|
|
virtual Id getIdForNodeWithName(const std::string& name) const;
|
|
virtual std::string getNameForNodeWithId(Id id) const;
|
|
virtual std::vector<std::string> getNamesForNodesWithNamePrefix(const std::string& prefix) const;
|
|
virtual std::vector<Id> getIdsOfNeighbours(const Id id) const;
|
|
virtual std::vector<std::pair<Id, Id>> getNeighbourEdgesOfNode(const Id id) const;
|
|
virtual std::vector<std::pair<Id, Id>> getMemberEdgesOfNode(const Id id) const;
|
|
virtual std::vector<std::pair<Id, Id>> getUsageEdgesOfNode(const Id id) const;
|
|
virtual std::vector<std::pair<Id, Id>> getCallEdgesOfNode(const Id id) const;
|
|
virtual std::vector<std::pair<Id, Id>> getTypeOfEdgesOfNode(const Id id) const;
|
|
virtual std::vector<std::pair<Id, Id>> getReturnTypeOfEdgesOfNode(const Id id) const;
|
|
virtual std::vector<std::pair<Id, Id>> getParameterOfEdgesOfNode(const Id id) const;
|
|
|
|
private:
|
|
GraphAccess* m_subject;
|
|
};
|
|
|
|
#endif // GRAPH_ACCESS_PROXY_H
|