ynkmr/Sourcetrail
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

data: Improved graph retrieval to use fixed number of requests

Browse Source
This commit is contained in:
Eberhard Graether
2016-03-30 12:26:19 +02:00
parent a662424e2b
commit cec370cfff
2 changed files with 115 additions and 95 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/lib/data/Storage.h
+4 -6
View File
@@ -93,13 +93,11 @@ private:
Id getLastVisibleParentNodeId(const Id nodeId) const;
std::vector<Id> getAllChildNodeIds(const Id nodeId) const;
void addEdgeAndAllChildrenToGraph(const Id edgeId, Graph* graph) const;
Node* addNodeAndAllChildrenToGraph(const Id nodeId, Graph* graph) const;
void addNodesToGraph(const std::vector<Id>& nodeIds, Graph* graph) const;
void addEdgesToGraph(const std::vector<Id>& edgeIds, Graph* graph) const;
void addNodesAndEdgesToGraph(const std::vector<Id>& nodeIds, const std::vector<Id>& edgeIds, Graph* graph) const;
void addAggregationEdgesToGraph(const Id nodeId, Graph* graph) const;
void addNodesToGraph(const std::vector<Id> nodeIds, Graph* graph) const;
void addEdgesToGraph(const std::vector<Id> edgeIds, Graph* graph) const;
void addComponentAccessToGraph(Graph* graph) const;
void buildSearchIndex();