From 4e5bf05518e3b3c4558156731e221346cae0e775 Mon Sep 17 00:00:00 2001
From: Siarhei Fedartsou <siarhei.fedartsou@gmail.com>
Date: Tue, 11 Jun 2024 17:53:40 +0200
Subject: [PATCH] Try to use boost::fast_pool_allocator in QueryHeap

---
 include/util/query_heap.hpp | 12 +++++++++++-
 1 file changed, 11 insertions(+), 1 deletion(-)

diff --git a/include/util/query_heap.hpp b/include/util/query_heap.hpp
index 9ded36c9e..5796c3563 100644
--- a/include/util/query_heap.hpp
+++ b/include/util/query_heap.hpp
@@ -5,6 +5,7 @@
 #include <boost/heap/d_ary_heap.hpp>
 
 #include <algorithm>
+#include <boost/pool/pool_alloc.hpp>
 #include <cstdint>
 #include <limits>
 #include <map>
@@ -121,7 +122,16 @@ template <typename NodeID, typename Key> class UnorderedMapStorage
     void Clear() { nodes.clear(); }
 
   private:
-    std::unordered_map<NodeID, Key> nodes;
+    template <typename T>
+    using PoolAllocator = boost::fast_pool_allocator<T,
+                                                     boost::default_user_allocator_new_delete,
+                                                     boost::details::pool::null_mutex>;
+
+    template <typename K, typename V>
+    using UnorderedMap = std::
+        unordered_map<K, V, std::hash<K>, std::equal_to<K>, PoolAllocator<std::pair<const K, V>>>;
+
+    UnorderedMap<NodeID, Key> nodes;
 };
 
 template <typename NodeID,