X-Git-Url: https://git.donarmstrong.com/?a=blobdiff_plain;f=tree.h;h=a5259552d8fa09f18d1e81b1776ef94f84724748;hb=c53c53b0280452e1c3a087fbf807b2e508cd66c4;hp=63c7d5f5cdc2a170e2eef909565842dcbf1fcef2;hpb=60fdefb3a300b59c3bbeffdca8a5f1f30c6a43af;p=mothur.git

diff --git a/tree.h b/tree.h
index 63c7d5f..a525955 100644
--- a/tree.h
+++ b/tree.h
@@ -10,41 +10,56 @@
  *
  */
 
-using namespace std;
-
-#include <string>
-#include <iostream>
-#include <vector>
 #include "treenode.h"
 #include "globaldata.hpp"
 
+class GlobalData;
 /* This class represents the treefile. */
 
-
-
 class Tree {
-	public: 
-		Tree();  
-		~Tree() {};
-		
-		Tree generateRandomTree();
-		void createNewickFile();
-		int getIndex(string);
-		void setIndex(string, int);
-		int getNumNodes() { return numNodes; }
-		int getNumLeaves(){	return numLeaves;}
-		vector<Node> tree;		//the first n nodes are the leaves, where n is the number of sequences.
-		
-	private:
-		GlobalData* globaldata;
-		int findRoot();  //return index of root node
-		void printBranch(int);  //recursively print out tree
-		int numNodes, numLeaves;
-		ofstream out;
-		string filename;
+public: 
+	Tree();		//to generate a tree from a file
+	~Tree();
+	
+	void getCopy(Tree*);  //makes tree a copy of the one passed in.
+	void assembleRandomTree();
+	void assembleRandomUnifracTree(vector<string>);
+	void assembleRandomUnifracTree(string, string);
+	void createNewickFile(string);
+	int getIndex(string);
+	void setIndex(string, int);
+	int getNumNodes() { return numNodes; }
+	int getNumLeaves(){	return numLeaves; }
+	map<string, int> mergeUserGroups(int, vector<string>);  //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();		
+	
+	vector<Node> tree;		//the first n nodes are the leaves, where n is the number of sequences.
+private:
+	GlobalData* globaldata;
+	int numNodes, numLeaves;
+	ofstream out;
+	string filename;
+	
+	map<string, int>::iterator it, it2;
+	map<string, int> mergeGroups(int);  //returns a map with a groupname and the number of times that group was seen in the children
+	
+	map<string,int> mergeGcounts(int);
+	void randomTopology();
+	void randomBlengths();
+	void randomLabels(vector<string>);
+	void randomLabels(string, string);
+	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.
+	void readTreeString(ifstream&);
 };
 
-
-
-
-#endif
\ No newline at end of file
+#endif