本文整理汇总了C++中Kmer::vertexRank方法的典型用法代码示例。如果您正苦于以下问题：C++ Kmer::vertexRank方法的具体用法？C++ Kmer::vertexRank怎么用？C++ Kmer::vertexRank使用的例子？那么, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类Kmer的用法示例。
在下文中一共展示了Kmer::vertexRank方法的2个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: f1
void f1(){
srand(time(NULL));
int size=1536;
map<int,int> counts;
uint64_t samples=100000000;
uint64_t base=rand();
int wordSize=63;
Kmer kmer;
kmer.setU64(0,base);
int average=samples/size;
while(samples--){
uint64_t first=rand();
uint64_t second=rand();
kmer.setU64(0,first);
kmer.setU64(1,second);
int rank=kmer.vertexRank(size,wordSize,false);
counts[rank]++;
}
vector<int> data;
for(int i=0;i<size;i++){
data.push_back(counts[i]);
//cout<<i<<" "<<counts[i]<<endl;
}
int deviation=average/10;
int min=average-deviation;
int max=average+deviation;
for(int i=0;i<size;i++){
if(counts[i]>=max){
cout<<counts[i]<<" and Max="<<max<<endl;
}
assertIsLower(max,counts[i]);
assert(counts[i]<max);
assert(counts[i]>min);
}
}示例2: work
/**
* work method.
*
* \author Sébastien Boisvert
*
* Code reviews
*
* 2011-09-02 -- Code review by Élénie Godzaridis (found bug with worker states)
*
*/
void FusionWorker::work(){
/*
used tags:
TODO: does the code pay attention when the coverage indicates a repeated k-mer ? repeats slow things down...
RAY_MPI_TAG_ASK_VERTEX_PATHS_SIZE
RAY_MPI_TAG_ASK_VERTEX_PATH
RAY_MPI_TAG_GET_PATH_LENGTH
*/
if(m_isDone)
return;
if(m_position < (int) m_path->size()){
/* get the number of paths */
if(!m_requestedNumberOfPaths){
/*
if(m_position % 1000 == 0){
cout<<"FusionWorker "<<m_workerIdentifier<<" position: ["<<m_position<<"/"<<m_path->size()<<endl;
}
*/
Kmer kmer;
m_path->at(m_position,&kmer);
if(m_reverseStrand)
kmer=kmer.complementVertex(m_parameters->getWordSize(),m_parameters->getColorSpaceMode());
Rank destination=kmer.vertexRank(m_parameters->getSize(),
m_parameters->getWordSize(),m_parameters->getColorSpaceMode());
int elementsPerQuery=m_virtualCommunicator->getElementsPerQuery(RAY_MPI_TAG_ASK_VERTEX_PATHS_SIZE);
MessageUnit*message=(MessageUnit*)m_outboxAllocator->allocate(elementsPerQuery);
int outputPosition=0;
kmer.pack(message,&outputPosition);
Message aMessage(message,elementsPerQuery,destination,
RAY_MPI_TAG_ASK_VERTEX_PATHS_SIZE,m_parameters->getRank());
m_virtualCommunicator->pushMessage(m_workerIdentifier,&aMessage);
m_requestedNumberOfPaths=true;
m_receivedNumberOfPaths=false;
if(m_parameters->hasOption("-debug-fusions2")){
cout<<"worker "<<m_workerIdentifier<<" send RAY_MPI_TAG_ASK_VERTEX_PATHS_SIZE"<<endl;
}
/* receive the number of paths */
}else if(m_requestedNumberOfPaths && !m_receivedNumberOfPaths && m_virtualCommunicator->isMessageProcessed(m_workerIdentifier)){
vector<MessageUnit> response;
m_virtualCommunicator->getMessageResponseElements(m_workerIdentifier,&response);
m_numberOfPaths=response[0];
if(m_parameters->hasOption("-debug-fusions2"))
cout<<"worker "<<m_workerIdentifier<<" Got "<<m_numberOfPaths<<endl;
m_receivedNumberOfPaths=true;
m_pathIndex=0;
m_requestedPath=false;
/* 2^5 */
int maximumNumberOfPathsToProcess=32;
/* don't process repeated stuff */
if(m_numberOfPaths> maximumNumberOfPathsToProcess)
m_numberOfPaths=0;
}else if(m_receivedNumberOfPaths && m_pathIndex < m_numberOfPaths){
/* request a path */
if(!m_requestedPath){
Kmer kmer;
m_path->at(m_position,&kmer);
if(m_reverseStrand)
kmer=kmer.complementVertex(m_parameters->getWordSize(),m_parameters->getColorSpaceMode());
Rank destination=kmer.vertexRank(m_parameters->getSize(),
m_parameters->getWordSize(),m_parameters->getColorSpaceMode());
int elementsPerQuery=m_virtualCommunicator->getElementsPerQuery(RAY_MPI_TAG_ASK_VERTEX_PATH);
MessageUnit*message=(MessageUnit*)m_outboxAllocator->allocate(elementsPerQuery);
int outputPosition=0;
kmer.pack(message,&outputPosition);
message[outputPosition++]=m_pathIndex;
Message aMessage(message,elementsPerQuery,destination,
RAY_MPI_TAG_ASK_VERTEX_PATH,m_parameters->getRank());
m_virtualCommunicator->pushMessage(m_workerIdentifier,&aMessage);
if(m_parameters->hasOption("-debug-fusions2")){
cout<<"worker "<<m_workerIdentifier<<" send RAY_MPI_TAG_ASK_VERTEX_PATH "<<m_pathIndex<<endl;
//.........这里部分代码省略.........