data: refactored file clearing on reparse to use TaskClearStorage

src/lib/data/graph/Edge.cpp

@@ -117,24 +117,6 @@ std::string Edge::getName() const
 	return getTypeString() + ":" + getFrom()->getFullName() + "->" + getTo()->getFullName();
 }
 
-void Edge::splitName(const std::string& name, EdgeType* type, std::string* fromName, std::string* toName)
-{
-	EdgeTypeMask mask = 1;
-	std::string typeStr = utility::substrBefore(name, ':');
-
-	while (typeStr != getTypeString(static_cast<EdgeType>(mask)))
-	{
-		mask = mask << 1;
-	}
-
-	*type = static_cast<EdgeType>(mask);
-
-	std::string names = utility::substrAfter(name, ':');
-
-	*fromName = utility::substrBefore(names, '-');
-	*toName = utility::substrAfter(utility::substrAfter(names, '-'), '>');
-}
-
 bool Edge::isNode() const
 {
 	return false;

src/lib/data/graph/Edge.h

@@ -54,7 +54,6 @@ public:
 	Node* getTo() const;
 
 	std::string getName() const;
-	static void splitName(const std::string& name, EdgeType* type, std::string* fromName, std::string* toName);
 
 	// Token implementation
 	virtual bool isNode() const;

src/lib/data/graph/Node.cpp

@@ -156,6 +156,11 @@ std::string Node::getFullName() const
 	return m_nameHierarchy.getFullName();
 }
 
+NameHierarchy Node::getNameHierarchy() const
+{
+	return m_nameHierarchy;
+}
+
 const std::vector<Edge*>& Node::getEdges() const
 {
 	return m_edges;

src/lib/data/graph/Node.h

@@ -62,6 +62,7 @@ public:
 
 	std::string getName() const;
 	std::string getFullName() const;
+	NameHierarchy getNameHierarchy() const;
 
 	const std::vector<Edge*>& getEdges() const;