out << "ideal_seq_" << (i+1) << '\t' << alignSeqs[i].numIdentical << endl << chunk << endl;
}//end if active i
- if(i % 100 == 0) { pDataArray->m->mothurOut(toString(i) + "\t" + toString(numSeqs - count) + "\t" + toString(count)); pDataArray->m->mothurOutEndLine(); }
+ if(i % 100 == 0) { pDataArray->m->mothurOutJustToScreen(toString(i) + "\t" + toString(numSeqs - count) + "\t" + toString(count)+"\n"); }
}
}else {
if (mismatch > pDataArray->diffs) { mismatch = length; break; } //to far to cluster
}
- if (mismatch <= diffs) {
+ if (mismatch <= pDataArray->diffs) {
//merge
alignSeqs[j].names += ',' + alignSeqs[i].names;
alignSeqs[j].numIdentical += alignSeqs[i].numIdentical;
}//end abundance check
}//end for loop j
- if(i % 100 == 0) { pDataArray->m->mothurOut(toString(i) + "\t" + toString(numSeqs - count) + "\t" + toString(count)); pDataArray->m->mothurOutEndLine(); }
+ if(i % 100 == 0) { pDataArray->m->mothurOutJustToScreen(toString(i) + "\t" + toString(numSeqs - count) + "\t" + toString(count)+"\n"); }
}
for (int i = 0; i < numSeqs; i++) {