Use std::unordered_{map,set} (C++11) instead of boost::unordered_{map…

…,set} Cherry-picked from: 246a02f
xanimo · Mar 29, 2024 · 936b91f · 936b91f
1 parent e23ff6e
commit 936b91f
Show file tree

Hide file tree

Showing 2 changed files with 1 addition and 20 deletions.
diff --git a/src/memusage.h b/src/memusage.h
@@ -15,9 +15,6 @@
 #include <unordered_map>
 #include <unordered_set>
 
-#include <boost/unordered_set.hpp>
-#include <boost/unordered_map.hpp>
-
 namespace memusage
 {
 
@@ -147,27 +144,13 @@ static inline size_t DynamicUsage(const std::shared_ptr<X>& p)
     return p ? MallocUsage(sizeof(X)) + MallocUsage(sizeof(stl_shared_counter)) : 0;
 }
 
-// Boost data structures
-
 template<typename X>
 struct unordered_node : private X
 {
 private:
     void* ptr;
 };
 
-template<typename X, typename Y>
-static inline size_t DynamicUsage(const boost::unordered_set<X, Y>& s)
-{
-    return MallocUsage(sizeof(unordered_node<X>)) * s.size() + MallocUsage(sizeof(void*) * s.bucket_count());
-}
-
-template<typename X, typename Y, typename Z>
-static inline size_t DynamicUsage(const boost::unordered_map<X, Y, Z>& m)
-{
-    return MallocUsage(sizeof(unordered_node<std::pair<const X, Y> >)) * m.size() + MallocUsage(sizeof(void*) * m.bucket_count());
-}
-
 template<typename X, typename Y>
 static inline size_t DynamicUsage(const std::unordered_set<X, Y>& s)
 {

diff --git a/src/validation.h b/src/validation.h
@@ -32,8 +32,6 @@
 
 #include <atomic>
 
-#include <boost/unordered_map.hpp>
-
 class CBlockIndex;
 class CBlockTreeDB;
 class CBloomFilter;
@@ -165,7 +163,7 @@ struct BlockHasher
 extern CScript COINBASE_FLAGS;
 extern CCriticalSection cs_main;
 extern CTxMemPool mempool;
-typedef boost::unordered_map<uint256, CBlockIndex*, BlockHasher> BlockMap;
+typedef std::unordered_map<uint256, CBlockIndex*, BlockHasher> BlockMap;
 extern BlockMap mapBlockIndex;
 extern uint64_t nLastBlockTx;
 extern uint64_t nLastBlockSize;