X-Git-Url: https://git.donarmstrong.com/?p=mothur.git;a=blobdiff_plain;f=tree.h;h=c8e8478edb8f313ab16d4dbeebf0a3d60a0a2698;hp=7fc383806c946d8f22efab62c648f19095313feb;hb=615301e57c25e241356a9c2380648d117709458d;hpb=825512fb96e5bb00e08665396d9fa6a8c4da5a68 diff --git a/tree.h b/tree.h index 7fc3838..c8e8478 100644 --- a/tree.h +++ b/tree.h @@ -10,23 +10,28 @@ * */ -using namespace std; - #include "treenode.h" -#include "globaldata.hpp" - +#include "counttable.h" /* This class represents the treefile. */ class Tree { public: - Tree(); //to generate a tree from a file + Tree(string); //do not use tree generated by this constructor its just to extract the treenames, its a chicken before the egg thing that needs to be revisited. + Tree(int, CountTable*); + Tree(CountTable*); //to generate a tree from a file + Tree(CountTable*, vector< vector >&); //create tree from sim matrix ~Tree(); - + CountTable* getCountTable() { return ct; } void getCopy(Tree*); //makes tree a copy of the one passed in. + void getCopy(Tree* copy, bool); //makes a copy of the tree structure passed in, (just parents, children and br). Used with the Tree(TreeMap*) constructor. Assumes the tmap already has set seqs groups you want. Used by subsample to reassign seqs you don't want included to group "doNotIncludeMe". + void getSubTree(Tree*, vector); //makes tree a that contains only the names passed in. + //int getSubTree(Tree* originalToCopy, vector seqToInclude, map nameMap); //used with (int, TreeMap) constructor. SeqsToInclude contains subsample wanted - assumes these are unique seqs and size of vector=numLeaves passed into constructor. nameMap is unique -> redundantList can be empty if no namesfile was provided. + void assembleRandomTree(); void assembleRandomUnifracTree(vector); void assembleRandomUnifracTree(string, string); + void createNewickFile(string); int getIndex(string); void setIndex(string, int); @@ -35,28 +40,45 @@ public: 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&); + void print(ostream&, string); + void print(ostream&, map); int findRoot(); //return index of root node //this function takes the leaf info and populates the non leaf nodes - void assembleTree(); + int assembleTree(); vector tree; //the first n nodes are the leaves, where n is the number of sequences. + map< string, vector > groupNodeInfo; //maps group to indexes of leaf nodes with that group, different groups may contain same node because of names file. + private: - GlobalData* globaldata; + CountTable* ct; int numNodes, numLeaves; ofstream out; string filename; + //map names; 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 mergeGcounts(int); + map indexes; //maps seqName -> index in tree vector + + void addNamesToCounts(map); void randomTopology(); void randomBlengths(); void randomLabels(vector); - void randomLabels(string, string); - void printBranch(int, ostream&, string); //recursively print out tree + //void randomLabels(string, string); + void printBranch(int, ostream&, map); //recursively print out tree + void printBranch(int, ostream&, string); + int 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&); + int populateNewTree(vector&, int, int&); + void printBranch(int, ostream&, string, vector&); + + MothurOut* m; + }; #endif