vector<SeqDist> dists;
float lastRight = distsRight[0].dist;
float lastLeft = distsLeft[0].dist;
- int lasti = 0;
- for (int i = 0; i < distsLeft.size(); i++) {
+ //int lasti = 0;
+ for (int i = 0; i < numWanted+1; i++) {
//add left if you havent already
it = seen.find(db[distsLeft[i].index]->getName());
if (it == seen.end()) {
// cout << "loop-right\t" << db[distsRight[i].index]->getName() << '\t' << distsRight[i].dist << endl;
}
- if (dists.size() > numWanted) { lasti = i; break; } //you have enough results
+ //if (dists.size() > numWanted) { lasti = i; break; } //you have enough results
}
// cout << "lastLeft\t" << lastLeft << endl;
//add in sequences with same distance as last sequence added
- lasti++;
+ /* lasti++;
int i = lasti;
while (i < distsLeft.size()) {
if (distsLeft[i].dist == lastLeft) {
else { break; }
i++;
}
-
- numWanted = seen.size();
+*/
+ numWanted = dists.size();
if (numWanted > dists.size()) {
//m->mothurOut("numwanted is larger than the number of template sequences, adjusting numwanted."); m->mothurOutEndLine();