From 5af5b8ccc7ea904325f4785dea5798db666d325e Mon Sep 17 00:00:00 2001 From: Oliver Hamlet Date: Fri, 17 Jan 2025 18:46:15 +0000 Subject: [PATCH] Use boost::container::deque instead of std::deque This improves sorting performance by 31%. --- src/api/sorting/plugin_graph.cpp | 5 +++-- 1 file changed, 3 insertions(+), 2 deletions(-) diff --git a/src/api/sorting/plugin_graph.cpp b/src/api/sorting/plugin_graph.cpp index be0eb70f..d190f7db 100644 --- a/src/api/sorting/plugin_graph.cpp +++ b/src/api/sorting/plugin_graph.cpp @@ -25,6 +25,7 @@ #include "plugin_graph.h" #include +#include #include #include #include @@ -474,8 +475,8 @@ bool FindPath(RawPluginGraph& graph, const vertex_t& fromVertex, const vertex_t& toVertex, BidirVisitor& visitor) { - std::queue forwardQueue; - std::queue reverseQueue; + std::queue> forwardQueue; + std::queue> reverseQueue; boost::unordered_flat_set forwardVisited; boost::unordered_flat_set reverseVisited;