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

logic: Improved graph and code view performance

Browse Source 
* added sql index for component_access
* improved policy for expanded code files
* reduced amount of initially expanded code files
* faster DummyEdge creation
* faster DummyNode search by token id
* switched GraphController DummyNodes and DummyEdges to shared_ptr for memory safety
This commit is contained in:
Eberhard Graether
2016-05-21 00:01:46 +02:00
parent 4a6f8cf420
commit 5d2a476813
13 changed files with 335 additions and 346 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/lib/component/controller/helper/DummyNode.h
+16 -16
View File
@@ -73,9 +73,9 @@ public:
bool hasVisibleSubNode() const
{
for (const DummyNode& node : subNodes)
for (std::shared_ptr<DummyNode> node : subNodes)
{
if (node.visible)
if (node->visible)
{
return true;
}
@@ -91,9 +91,9 @@ public:
return true;
}
for (const DummyNode& node : subNodes)
for (std::shared_ptr<DummyNode> node : subNodes)
{
if (node.hasActiveSubNode())
if (node->hasActiveSubNode())
{
return true;
}
@@ -111,9 +111,9 @@ public:
count += 1;
}
for (const DummyNode& node : subNodes)
for (std::shared_ptr<DummyNode> node : subNodes)
{
count += node.getActiveSubNodeCount();
count += node->getActiveSubNodeCount();
}
return count;
@@ -126,9 +126,9 @@ public:
return true;
}
for (const DummyNode& node : subNodes)
for (std::shared_ptr<DummyNode> node : subNodes)
{
if (node.hasConnectedSubNode())
if (node->hasConnectedSubNode())
{
return true;
}
@@ -146,9 +146,9 @@ public:
count += 1;
}
for (const DummyNode& node : subNodes)
for (std::shared_ptr<DummyNode> node : subNodes)
{
count += node.getConnectedSubNodeCount();
count += node->getConnectedSubNodeCount();
}
return count;
@@ -163,9 +163,9 @@ public:
nodes.push_back(this);
}
for (const DummyNode& node : subNodes)
for (std::shared_ptr<DummyNode> node : subNodes)
{
utility::append(nodes, node.getConnectedSubNodes());
utility::append(nodes, node->getConnectedSubNodes());
}
return nodes;
@@ -174,9 +174,9 @@ public:
std::vector<const DummyNode*> getAllBundledNodes() const
{
std::vector<const DummyNode*> nodes;
for (const DummyNode& node : bundledNodes)
for (std::shared_ptr<DummyNode> node : bundledNodes)
{
utility::append(nodes, node.getConnectedSubNodes());
utility::append(nodes, node->getConnectedSubNodes());
}
return nodes;
}
@@ -200,7 +200,7 @@ public:
Id topLevelAncestorId;
Id tokenId;
std::vector<DummyNode> subNodes;
std::vector<std::shared_ptr<DummyNode>> subNodes;
// GraphNode
const Node* data;
@@ -221,7 +221,7 @@ public:
BundleInfo bundleInfo;
// BundleNode
std::vector<DummyNode> bundledNodes;
std::vector<std::shared_ptr<DummyNode>> bundledNodes;
size_t bundledNodeCount;
};