X-Git-Url: https://git.donarmstrong.com/?a=blobdiff_plain;f=tree.h;h=c90f51a451461ceca068f743ecefe8fd3e7cba5f;hb=ac1da2a793271cb67f2a2155c5558e1fabdd6aba;hp=d6a3b556f09ca251a2cbad64e07c0187dd50e6b4;hpb=9daea1c357d32c6a7b34c5cbec122b7cfc5c92e3;p=mothur.git diff --git a/tree.h b/tree.h index d6a3b55..c90f51a 100644 --- a/tree.h +++ b/tree.h @@ -10,18 +10,16 @@ * */ -using namespace std; - #include "treenode.h" #include "globaldata.hpp" +class GlobalData; /* This class represents the treefile. */ class Tree { public: Tree(); //to generate a tree from a file - ~Tree() {}; - + ~Tree(); void getCopy(Tree*); //makes tree a copy of the one passed in. void assembleRandomTree(); @@ -34,6 +32,9 @@ public: int getNumLeaves(){ return numLeaves; } map mergeUserGroups(int, vector); //returns a map with a groupname and the number of times that group was seen in the children void printTree(); + void print(ostream&); + void printForBoot(ostream&); + int findRoot(); //return index of root node //this function takes the leaf info and populates the non leaf nodes void assembleTree(); @@ -48,13 +49,17 @@ private: map::iterator it, it2; map mergeGroups(int); //returns a map with a groupname and the number of times that group was seen in the children - map Tree::mergeGcounts(int); + map mergeGcounts(int); void randomTopology(); void randomBlengths(); void randomLabels(vector); void randomLabels(string, string); - int findRoot(); //return index of root node - void printBranch(int); //recursively print out tree + void printBranch(int, ostream&, string); //recursively print out tree + void parseTreeFile(); //parses through tree file to find names of nodes and number of them + //this is required in case user has sequences in the names file that are + //not included in the tree. + //only takes names from the first tree in the tree file and assumes that all trees use the same names. + int readTreeString(ifstream&); }; #endif