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

Update README.md

Browse Source
This commit is contained in:
greg
2019-03-02 21:35:56 -05:00
parent c53ffb5d5d
commit da0745cd8a
1 changed files with 6 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files
README.md
Vendored
+6 -6
View File
@@ -127,11 +127,11 @@ and here is the code for the multi-threaded insert:
template <class HT>
struct TD
{
int64_t thread_idx;
int64_t num_threads;
int64_t cnt;
HT &hash;
RSU rsu; // generates a random sequence of unique integers
int64_t thread_idx; // index of this thread (0 to num_threads)
int64_t num_threads; // number of threads inserting values into the hash_map
int64_t cnt; // number of values to insert (10 million in this benchmark)
HT &hash; // the absl::parallel_flat_hash_map
RSU rsu; // generates a random sequence of unique integers
};
// --------------------------------------------------------------------------
@@ -158,7 +158,7 @@ void _fill_random_inner_thr(TD<HT> td)
template <class HT>
void _fill_random_inner_mt(int64_t cnt, HT &hash, RSU &rsu)
{
constexpr int64_t num_threads = 8; // has to be a power of two
constexpr int64_t num_threads = 8; // has to be a power of two
std::unique_ptr<std::thread> threads[num_threads];
for (int64_t i=0; i<num_threads; ++i)