X-Git-Url: https://git.donarmstrong.com/?a=blobdiff_plain;f=phylodiversitycommand.h;h=ec372ba20acac93709ca4fff0b58c8a42dadf048;hb=d3e27ba055f6765044b885cded5302d9cece161a;hp=5d0cccf249099ac51d86b58e41e5098793ef3f3c;hpb=0caf3fbabaa3ece404f8ce77f4c883dc5b1bf1dc;p=mothur.git diff --git a/phylodiversitycommand.h b/phylodiversitycommand.h index 5d0cccf..ec372ba 100644 --- a/phylodiversitycommand.h +++ b/phylodiversitycommand.h @@ -11,7 +11,7 @@ */ #include "command.hpp" -#include "treemap.h" +#include "counttable.h" #include "sharedutilities.h" #include "tree.h" @@ -25,24 +25,27 @@ class PhyloDiversityCommand : public Command { vector setParameters(); string getCommandName() { return "phylo.diversity"; } string getCommandCategory() { return "Hypothesis Testing"; } - string getHelpString(); + + string getHelpString(); + string getOutputPattern(string); string getCitation() { return "Faith DP (1994). Phylogenetic pattern and the quantification of organismal biodiversity. Philos Trans R Soc Lond B Biol Sci 345: 45-58. \nhttp://www.mothur.org/wiki/Phylo.diversity"; } string getDescription() { return "phylo.diversity"; } int execute(); void help() { m->mothurOut(getHelpString()); } private: - TreeMap* tmap; + CountTable* ct; float freq; int iters, processors, numUniquesInName; bool abort, rarefy, summary, collect, scale; - string groups, outputDir, treefile, groupfile, namefile; + string groups, outputDir, treefile, groupfile, namefile, countfile; vector Groups, outputNames; //holds groups to be used, and outputFile names + map getRootForGroups(Tree* t); int readNamesFile(); void printData(set&, map< string, vector >&, ofstream&, int); void printSumData(map< string, vector >&, ofstream&, int); - vector calcBranchLength(Tree*, int, map< string, set >&); + vector calcBranchLength(Tree*, int, vector< map >&, map); int driver(Tree*, map< string, vector >&, map >&, int, int, vector&, set&, ofstream&, ofstream&, bool); int createProcesses(vector&, Tree*, map< string, vector >&, map >&, int, int, vector&, set&, ofstream&, ofstream&);