Merge pull request bitcoin#367 from qtumproject/neil/fix-gitian-build

fix gitian build

Author: qtum-neil

src/coins.h

@@ -16,9 +16,6 @@
 #include <assert.h>
 #include <stdint.h>
 
-#include <boost/foreach.hpp>
-#include <boost/unordered_map.hpp>
-
 /**
  * A UTXO entry.
  *
@@ -125,7 +122,7 @@ struct CCoinsCacheEntry
     explicit CCoinsCacheEntry(Coin&& coin_) : coin(std::move(coin_)), flags(0) {}
 };
 
-typedef boost::unordered_map<COutPoint, CCoinsCacheEntry, SaltedOutpointHasher> CCoinsMap;
+typedef std::unordered_map<COutPoint, CCoinsCacheEntry, SaltedOutpointHasher> CCoinsMap;
 
 /** Cursor for iterating over CoinsView state */
 class CCoinsViewCursor

src/memusage.h

@@ -167,6 +167,26 @@ static inline size_t DynamicUsage(const boost::unordered_map<X, Y, Z>& m)
     return MallocUsage(sizeof(boost_unordered_node<std::pair<const X, Y> >)) * m.size() + MallocUsage(sizeof(void*) * m.bucket_count());
 }
 
+//std version
+template<typename Xstd>
+struct unordered_node : private Xstd
+{
+private:
+    void* ptr;
+};
+
+template<typename Xstd, typename Y>
+static inline size_t DynamicUsage(const std::unordered_set<Xstd, Y>& s)
+{
+    return MallocUsage(sizeof(unordered_node<Xstd>)) * s.size() + MallocUsage(sizeof(void*) * s.bucket_count());
+}
+
+template<typename Xstd, typename Y, typename Z>
+static inline size_t DynamicUsage(const std::unordered_map<Xstd, Y, Z>& m)
+{
+    return MallocUsage(sizeof(unordered_node<std::pair<const Xstd, Y> >)) * m.size() + MallocUsage(sizeof(void*) * m.bucket_count());
+}
+
 }
 
 #endif // BITCOIN_MEMUSAGE_H