X-Git-Url: https://git.donarmstrong.com/?p=mothur.git;a=blobdiff_plain;f=treegroupscommand.h;h=36c852bd8ef545894b9aa00245064eb112e236c6;hp=6790afb73984377c1aba8f6488a3cf1c2e544280;hb=1a20e24ee786195ab0e1cccd4f5aede7a88f3f4e;hpb=28bcfc4a41b8b82f66636587e0d4d355d07cbdd1 diff --git a/treegroupscommand.h b/treegroupscommand.h index 6790afb..36c852b 100644 --- a/treegroupscommand.h +++ b/treegroupscommand.h @@ -15,7 +15,7 @@ #include "groupmap.h" #include "validcalculator.h" #include "tree.h" -#include "treemap.h" +#include "counttable.h" #include "readmatrix.hpp" #include "readcolumn.h" #include "readphylip.h" @@ -78,8 +78,9 @@ public: vector setParameters(); string getCommandName() { return "tree.shared"; } string getCommandCategory() { return "OTU-Based Approaches"; } - string getOutputFileNameTag(string, string); + string getHelpString(); + string getOutputPattern(string); string getCitation() { return "http://www.mothur.org/wiki/Tree.shared"; } string getDescription() { return "generate a tree file that describes the dissimilarity among groups"; } @@ -104,13 +105,13 @@ private: NameAssignment* nameMap; ListVector* list; - TreeMap* tmap; + CountTable* ct; Tree* t; InputData* input; vector treeCalculators; vector lookup; string lastLabel; - string format, groupNames, filename, sharedfile, inputfile; + string format, groupNames, filename, sharedfile, countfile, inputfile; int numGroups, subsampleSize, iters, processors; ofstream out; float precision, cutoff; @@ -138,6 +139,7 @@ struct treeSharedData { unsigned long long start; unsigned long long end; MothurOut* m; + int count; treeSharedData(){} treeSharedData(MothurOut* mout, unsigned long long st, unsigned long long en, vector est, vector lu) { @@ -146,6 +148,7 @@ struct treeSharedData { end = en; Estimators = est; thisLookup = lu; + count=0; } }; /**************************************************************************************************/ @@ -248,6 +251,8 @@ static DWORD WINAPI MyTreeSharedThreadFunction(LPVOID lpParam){ vector subset; for (int k = pDataArray->start; k < pDataArray->end; k++) { // pass cdd each set of groups to compare + pDataArray->count++; + for (int l = 0; l < k; l++) { if (k != l) { //we dont need to similiarity of a groups to itself