X-Git-Url: https://git.donarmstrong.com/?a=blobdiff_plain;f=sharedbraycurtis.cpp;h=3711ce77cbb312e5dc2ee2aba14e1856bb942d12;hb=bd27c2b0612942815b7417c79f7ee41f669a2a34;hp=299939dbfd156d1e5d9724fb112a4c5e3292c5a1;hpb=510b1cfc25cd79391d6973ca20c5ec25fb1bb3b2;p=mothur.git diff --git a/sharedbraycurtis.cpp b/sharedbraycurtis.cpp index 299939d..3711ce7 100644 --- a/sharedbraycurtis.cpp +++ b/sharedbraycurtis.cpp @@ -15,7 +15,7 @@ EstOutput BrayCurtis::getValues(vector shared) { try { data.resize(1,0); - int sumSharedA, sumSharedB, sumSharedAB, tempA, tempB; + double sumSharedA, sumSharedB, sumSharedAB, tempA, tempB; sumSharedA = 0; sumSharedB = 0; sumSharedAB = 0; /*Xi, Yi = abundance of the ith shared OTU in A and B @@ -24,7 +24,7 @@ EstOutput BrayCurtis::getValues(vector shared) { sumSharedAB = the sum of the minimum otus int all shared otus in AB. */ - for (int i = 0; i < shared[0]->size(); i++) { + for (int i = 0; i < shared[0]->getNumBins(); i++) { //store in temps to avoid multiple repetitive function calls tempA = shared[0]->getAbundance(i); tempB = shared[1]->getAbundance(i); @@ -37,14 +37,14 @@ EstOutput BrayCurtis::getValues(vector shared) { else { sumSharedAB += tempB; } } - data[0] = (2 * sumSharedAB) / (float)( sumSharedA + sumSharedB); + data[0] = 1.0 - (2 * sumSharedAB) / (float)( sumSharedA + sumSharedB); if (isnan(data[0]) || isinf(data[0])) { data[0] = 0; } return data; } catch(exception& e) { - errorOut(e, "BrayCurtis", "getValues"); + m->errorOut(e, "BrayCurtis", "getValues"); exit(1); } }