Open-Harbor/osrm-backend
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases 3 Wiki Activity

Try to use boost::fast_pool_allocator in QueryHeap

Browse Source
This commit is contained in:
Siarhei Fedartsou 2024-06-11 17:53:40 +02:00
parent 4930d2ef05
commit 4e5bf05518
1 changed files with 11 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
include/util/query_heap.hpp
View File

@ -5,6 +5,7 @@
#include <boost/heap/d_ary_heap.hpp> #include <boost/heap/d_ary_heap.hpp>
#include <algorithm> #include <algorithm>
#include <boost/pool/pool_alloc.hpp>
#include <cstdint> #include <cstdint>
#include <limits> #include <limits>
#include <map> #include <map>
@ -121,7 +122,16 @@ template <typename NodeID, typename Key> class UnorderedMapStorage
void Clear() { nodes.clear(); } void Clear() { nodes.clear(); }
private: 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, template <typename NodeID,