1

我对TBB. 我正在尝试将<key, value>pair 插入无序 bimap 中，其中keyis 是 typeuint64_t并且value是 type 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;

                }
        }
        );
    }

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

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

它从 0 开始并经过 n。我试图增加i5（首先++i和i +=kmer_len-1，就像i = 0, 5, 10, 15, ...直到 n），但i只增加 1。

完整代码如下所示：

待定文件

#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;
        }

}

待定.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，如上所述。

4

1 回答 1

1

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

于 2018-03-09T12:03:33.387 回答