saberbud/parallel-hashmap
1
0
Fork 0
mirror of https://github.com/greg7mdp/parallel-hashmap.git synced 2026-08-29 16:40:39 +08:00
Code Issues Packages Projects Releases Wiki Activity

fix compilation issue with c++11

Browse Source
This commit is contained in:
greg
2019-04-07 21:16:25 -04:00
parent 5654f72bdd
commit 6170a3a28f
1 changed files with 4 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files
examples/knucleotide.cc
+4 -3
View File
@@ -44,7 +44,7 @@
#include <array>
#include <vector>
#include <cassert>
#include <unordered_map>
#include <parallel_hashmap/phmap.h>
// ------------------------------------------------------------------
struct Cfg {
@@ -123,7 +123,7 @@ private:
// ------------------------------------------------------------------
template <size_t size, typename K = Key<size> >
using HashTable = std::unordered_map<K, unsigned, typename K::Hash>;
using HashTable = phmap::flat_hash_map<K, unsigned, typename K::Hash>;
// ------------------------------------------------------------------
template <size_t size>
@@ -156,7 +156,7 @@ void Calculate(const Cfg::Data& input, size_t begin, HashTable<size>& table)
// ------------------------------------------------------------------
template <size_t size>
auto CalculateInThreads(const Cfg::Data& input)
HashTable<size> CalculateInThreads(const Cfg::Data& input)
{
HashTable<size> hash_tables[cfg.thread_count];
std::thread threads[cfg.thread_count];
@@ -175,6 +175,7 @@ auto CalculateInThreads(const Cfg::Data& input)
for(unsigned i = 1 ; i < cfg.thread_count; ++i)
for(auto& j : hash_tables[i])
frequencies[j.first] += j.second;
// return the 'frequency' by move instead of copy.
return std::move(frequencies);
}