使用 TBB 插入一个无序的 boost bimap

Question

我对 TBB 非常困惑。我正在尝试在无序双图中插入 <key, value> 对，其中 key 是 uint64_t 类型，value 是 string 类型。我尝试创建 loop object，它位于 TBB.h 文件中，看起来像

void ParallelIndex(uint64_t &kmer_len, std::string &split_kmer, std::string &sequence_content,
            uint64_t &sequence_length, size_t &kmer_position ) {
        parallel_for( blocked_range<size_t>(0, sequence_length),
                [&](const blocked_range<size_t>& r) {
            for(i = r.begin(); i < r.end();  ++i ){
                split_kmer = sequence_content.substr(i, kmer_len);
                reference_index_vector.insert(position(kmer_position, split_kmer)); 
                i += kmer_len-1;
                kmer_position += kmer_len;

                }
        }
        );
    }

并且在TBB.cpp中的main函数中，我试图调用函数

index.ParallelIndex(index.kmer_len, index.split_kmer, index.sequence_content,
        index.sequence_length, index.kmer_position );

它从0开始，经过n。我试图将 i 增加 5（第一个 ++i 和 i +=kmer_len-1，就像 i = 0, 5, 10, 15, ... 直到 n），但是 i 只增加了 1.

完整代码如下图：

TBB.cpp

#include <iostream>
#include <string>
#include <algorithm>
#include <boost/bimap.hpp>
#include <boost/bimap/unordered_set_of.hpp>
#include <boost/bimap/unordered_multiset_of.hpp>
#include "tbb/parallel_for.h"
#include "TBB.h"
#include "tbb/tbb.h"
#include <tbb/blocked_range.h>



using namespace tbb;


namespace bimaps = boost::bimaps;
typedef boost::bimap<bimaps::unordered_set_of<uint64_t>,
        bimaps::unordered_multiset_of<std::string> > bimap_reference;
typedef bimap_reference::value_type position;
bimap_reference reference_index_vector;



uint64_t thread_test::create_index::kmer_len = 5;
std::string thread_test::create_index::split_kmer = "";
std::string thread_test::create_index::sequence_content = "ABCDDBACDDDCBBAAACBDAADCBDAAADCBDADADACBDDCBBBCDCBCDAADCBBCDAAAD";
uint64_t thread_test::create_index::sequence_length = 0;
size_t thread_test::create_index::kmer_position = 0;
size_t thread_test::create_index::i = 0;
int main(){
    thread_test::create_index index;
    index.sequence_length = index.sequence_content.length();

    index.ParallelIndex(index.kmer_len, index.split_kmer, index.sequence_content,
            index.sequence_length, index.kmer_position );

    for( bimap_reference::const_iterator iter = reference_index_vector.begin(), iend = reference_index_vector.end();
                iter != iend; ++iter ) {
            std::cout << iter->left << " <--> "<< iter->right <<std::endl;
        }

}

TBB.h

#ifndef TBB_H_
#define TBB_H_

#include<iostream>
#include <algorithm>
#include <utility>
#include <boost/bimap.hpp>
#include <boost/bimap/unordered_set_of.hpp>
#include <boost/bimap/unordered_multiset_of.hpp>
#include "tbb/tbb.h"
#include <tbb/parallel_for.h>
#include <tbb/blocked_range.h>
#include <tbb/mutex.h>


using namespace tbb;


namespace bimaps = boost::bimaps;

typedef boost::bimap<bimaps::unordered_set_of<uint64_t>,
        bimaps::unordered_multiset_of<std::string > > bimap_reference;
typedef bimap_reference::value_type position;
extern bimap_reference reference_index_vector;



namespace thread_test{

class create_index{

public:
    static uint64_t kmer_len;
    static std::string split_kmer;
    static std::string sequence_content;
    static uint64_t sequence_length;
    static size_t kmer_position;
    static size_t i;

//  using lambda function

    void ParallelIndex(uint64_t &kmer_len, std::string &split_kmer, std::string &sequence_content,
            uint64_t &sequence_length, size_t &kmer_position ) {
        parallel_for( blocked_range<size_t>(0, sequence_length),
                [&](const blocked_range<size_t>& r) {
            for(i = r.begin(); i < r.end();  ++i ){
                split_kmer = sequence_content.substr(i, kmer_len);
                reference_index_vector.insert(position(kmer_position, split_kmer));
                i += kmer_len-1;
                kmer_position += kmer_len;
                }
        }
        );
    }
};
}

#endif /* TBB_H_ */

问题是 i 增加了 1，但我尝试如上所述将其增加 5。

Answer 1

将 for(i = r.begin(); i < r.end(); ++i ) 更改为 for(; i < r.end(); ++i )。在第一种情况下，您正在重新初始化 i = r.begin().

使用 TBB 插入一个无序的 boost bimap

Insert into an unordered boost bimap using TBB

c++

tbb

boost-unordered

boost-bimap