data: added Graph data structure for storing code semantics in Storage

This change adds graph data structures Token, Node, Edge and Graph for holding code semantics in the Storage and fills them with the parsed data. Things to note: * Token is the base for the classes Edge and Node and holds a unique id. * Graph is the owner of all Nodes and Edges. * A Node saves the Edges it is endpoint of. * An Edge saves the Nodes that are endpoints. * Nodes and Edges are not subclassed. The different Node and Edge types are distinguished by the enums NodeType and EdgeType. Type specific fields are therefore available for all types, a check when assigning them prohibits faulty usage. * Storage uses the Graph::getNodeHierarchy method, which is not strict about knowing type names beforehand. E.g. if A::B is passed in and A doesn't exist so far, then node A gets created as NODE_UNDEFINED with B as it's child. * The Graph methods addNodeAsPlainCopy and addEdgeAsPlainCopy can be used to create a sub-graph without reference to the original, but with the same ids. review id = 19 fortune cookie message = Your cheerful outlook is one of your best assets.
2014-06-30 14:08:01 +02:00
parent 73b74cb618
commit 5ceb7a4b43
28 changed files with 1507 additions and 101 deletions
@@ -0,0 +1,146 @@
+#include "data/graph/Edge.h"
+
+#include <sstream>
+
+#include "data/graph/Node.h"
+#include "utility/logging/logging.h"
+
+Edge::Edge(EdgeType type, Node* from, Node* to)
+	: m_type(type)
+	, m_from(from)
+	, m_to(to)
+	, m_access(ACCESS_NONE)
+{
+	m_from->addEdge(this);
+	m_to->addEdge(this);
+}
+
+Edge::~Edge()
+{
+	m_from->removeEdge(this);
+	m_to->removeEdge(this);
+}
+
+std::shared_ptr<Edge> Edge::createPlainCopy(Node* from, Node* to) const
+{
+	if (from == m_from || to == m_to || from->getId() != m_from->getId() || to->getId() != m_to->getId())
+	{
+		LOG_ERROR("Nodes are not plain copies.");
+		return nullptr;
+	}
+
+	std::shared_ptr<Edge> edge(new Edge(getId(), m_type, from, to));
+
+	edge->setAccess(m_access);
+
+	return edge;
+}
+
+Edge::EdgeType Edge::getType() const
+{
+	return m_type;
+}
+
+Node* Edge::getFrom() const
+{
+	return m_from;
+}
+
+Node* Edge::getTo() const
+{
+	return m_to;
+}
+
+bool Edge::isNode() const
+{
+	return false;
+}
+
+bool Edge::isEdge() const
+{
+	return true;
+}
+
+Edge::AccessType Edge::getAccess() const
+{
+	return m_access;
+}
+
+void Edge::setAccess(AccessType access)
+{
+	if (access != ACCESS_NONE && m_type != EDGE_MEMBER && m_type != EDGE_INHERITANCE)
+	{
+		LOG_ERROR("Setting access on wrong edge type.");
+		return;
+	}
+
+	if (m_access != ACCESS_NONE && access != m_access)
+	{
+		LOG_WARNING("Different AccessType was already set before.");
+	}
+	m_access = access;
+}
+
+std::string Edge::getTypeString() const
+{
+	switch (m_type)
+	{
+	case EDGE_MEMBER:
+		return "has child";
+	case EDGE_TYPE_OF:
+		return "is type of";
+	case EDGE_RETURN_TYPE_OF:
+		return "has return type";
+	case EDGE_PARAMETER_OF:
+		return "has parameter of type";
+	default:
+		LOG_ERROR("TypeString not implemented for edge type.");
+	}
+	return "";
+}
+
+std::string Edge::getAccessString() const
+{
+	switch (m_access)
+	{
+	case ACCESS_PUBLIC:
+		return "public";
+	case ACCESS_PROTECTED:
+		return "protected";
+	case ACCESS_PRIVATE:
+		return "private";
+	case ACCESS_NONE:
+		return "";
+	}
+	return "";
+}
+
+std::string Edge::getAsString() const
+{
+	std::stringstream str;
+	str << "[" << getId() << "] \"" << m_from->getName() << "\" " << getTypeString() << " \"" + m_to->getName() << "\"";
+
+	if (m_access != ACCESS_NONE)
+	{
+		str << " " << getAccessString();
+	}
+
+	return str.str();
+}
+
+Edge::Edge(Id id, EdgeType type, Node* from, Node* to)
+	: Token(id)
+	, m_type(type)
+	, m_from(from)
+	, m_to(to)
+	, m_access(ACCESS_NONE)
+{
+	m_from->addEdge(this);
+	m_to->addEdge(this);
+}
+
+std::ostream& operator<<(std::ostream& ostream, const Edge& edge)
+{
+	ostream << edge.getAsString();
+	return ostream;
+}