sA = lookup[0]->getSAbundVector(); sabundA = &sA;
sB = lookup[1]->getSAbundVector(); sabundB = &sB;
sC = lookup[2]->getSAbundVector(); sabundC = &sC;
sA = lookup[0]->getSAbundVector(); sabundA = &sA;
sB = lookup[1]->getSAbundVector(); sabundB = &sB;
sC = lookup[2]->getSAbundVector(); sabundC = &sC;
//merge BC and estimate with shared with A
SharedRAbundVector* merge = new SharedRAbundVector();
for (int j = 0; j < lookup[1]->size(); j++) {
//merge BC and estimate with shared with A
SharedRAbundVector* merge = new SharedRAbundVector();
for (int j = 0; j < lookup[1]->size(); j++) {
sharedABC3 = sharedAC[0] + sharedBC[0] - sharedCwithAB[0];
//if any of the possible m's are - throw them out
sharedABC3 = sharedAC[0] + sharedBC[0] - sharedCwithAB[0];
//if any of the possible m's are - throw them out
- if (sharedABC1 < 0.0) { sharedABC1 = 0; }
- if (sharedABC2 < 0.0) { sharedABC2 = 0; }
- if (sharedABC3 < 0.0) { sharedABC3 = 0; }
+ if (sharedABC1 < 0.00001) { sharedABC1 = 0; }
+ if (sharedABC2 < 0.00001) { sharedABC2 = 0; }
+ if (sharedABC3 < 0.00001) { sharedABC3 = 0; }
//sharedABC is the minimum of the 3 possibilities
if ((sharedABC1 < sharedABC2) && (sharedABC1 < sharedABC3)) { sharedABC = sharedABC1; }
//sharedABC is the minimum of the 3 possibilities
if ((sharedABC1 < sharedABC2) && (sharedABC1 < sharedABC3)) { sharedABC = sharedABC1; }
sharedBwithAC.push_back(sharedAB[0] + sharedBC[0] - sharedABC);
sharedCwithAB.push_back(sharedAC[0] + sharedBC[0] - sharedABC);
}
sharedBwithAC.push_back(sharedAB[0] + sharedBC[0] - sharedABC);
sharedCwithAB.push_back(sharedAC[0] + sharedBC[0] - sharedABC);
}