if (m->control_pressed) { for (int j = 0; j < newLookup.size(); j++) { delete newLookup[j]; } for (int j = 0; j < lookup.size(); j++) { delete lookup[j]; } return 0; }
//is this otu on the list
if (m->control_pressed) { for (int j = 0; j < newLookup.size(); j++) { delete newLookup[j]; } for (int j = 0; j < lookup.size(); j++) { delete lookup[j]; } return 0; }
//is this otu on the list
numSelected++; wroteSomething = true;
newLabels.push_back(m->currentBinLabels[i]);
for (int j = 0; j < newLookup.size(); j++) { //add this OTU to the new lookup
numSelected++; wroteSomething = true;
newLabels.push_back(m->currentBinLabels[i]);
for (int j = 0; j < newLookup.size(); j++) { //add this OTU to the new lookup
int pos = newtax.find(noConfidenceTaxons[j]);
if (pos != string::npos) { //this sequence contains the taxon the user wants
int pos = newtax.find(noConfidenceTaxons[j]);
if (pos != string::npos) { //this sequence contains the taxon the user wants
out << otuLabel << '\t' << numReps << '\t' << tax << endl;
//since you belong to at least one of the taxons we want you are included so no need to search for other
break;
out << otuLabel << '\t' << numReps << '\t' << tax << endl;
//since you belong to at least one of the taxons we want you are included so no need to search for other
break;
int pos = newtax.find(noConfidenceTaxons[j]);
if (pos != string::npos) { //this sequence contains the taxon the user wants
int pos = newtax.find(noConfidenceTaxons[j]);
if (pos != string::npos) { //this sequence contains the taxon the user wants
out << otuLabel << '\t' << numReps << '\t' << tax << endl;
//since you belong to at least one of the taxons we want you are included so no need to search for other
break;
out << otuLabel << '\t' << numReps << '\t' << tax << endl;
//since you belong to at least one of the taxons we want you are included so no need to search for other
break;