loot/libloot
0
0
Fork 0
mirror of https://github.com/loot/libloot.git synced 2026-07-27 14:16:01 -07:00
Code Issues Packages Projects Releases Wiki Activity

Use boost::container::deque instead of std::deque

Browse Source 
This improves sorting performance by 31%.
This commit is contained in:
Oliver Hamlet
2025-01-17 20:18:34 +00:00
parent 4ec93727d2
commit 9104620ef8
1 changed files with 3 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/api/sorting/plugin_graph.cpp
+3 -2
View File
@@ -25,6 +25,7 @@
#include "plugin_graph.h"
#include <boost/algorithm/string.hpp>
#include <boost/container/deque.hpp>
#include <boost/graph/breadth_first_search.hpp>
#include <boost/graph/iteration_macros.hpp>
#include <boost/graph/topological_sort.hpp>
@@ -474,8 +475,8 @@ bool FindPath(RawPluginGraph& graph,
const vertex_t& fromVertex,
const vertex_t& toVertex,
BidirVisitor& visitor) {
std::queue<vertex_t> forwardQueue;
std::queue<vertex_t> reverseQueue;
std::queue<vertex_t, boost::container::deque<vertex_t>> forwardQueue;
std::queue<vertex_t, boost::container::deque<vertex_t>> reverseQueue;
boost::unordered_flat_set<vertex_t> forwardVisited;
boost::unordered_flat_set<vertex_t> reverseVisited;