]> git.donarmstrong.com Git - mothur.git/blobdiff - tree.cpp
made read.tree not require a groupfile, if one is not given all seqs are assumed...
[mothur.git] / tree.cpp
index 400a72ae388a88c5b94aa2b8a717471f600b33ed..3cb26113f8deb8acf3bf28f7040becf2bac7385f 100644 (file)
--- a/tree.cpp
+++ b/tree.cpp
@@ -9,7 +9,19 @@
 
 #include "tree.h"
 
-
+/*****************************************************************/
+Tree::Tree(string g) {
+       try {
+               globaldata = GlobalData::getInstance();
+               m = MothurOut::getInstance();
+               
+               parseTreeFile();  globaldata->runParse = false;  
+       }
+       catch(exception& e) {
+               m->errorOut(e, "Tree", "Tree - just parse");
+               exit(1);
+       }
+}
 /*****************************************************************/
 Tree::Tree() {
        try {
@@ -69,6 +81,9 @@ void Tree::addNamesToCounts() {
 
                                
                //go through each leaf and update its pcounts and pgroups
+               
+               //float A = clock();
+
                for (int i = 0; i < numLeaves; i++) {
 
                        string name = tree[i].getName();
@@ -78,7 +93,7 @@ void Tree::addNamesToCounts() {
                        if (itNames == globaldata->names.end()) { m->mothurOut(name + " is not in your name file, please correct."); m->mothurOutEndLine(); exit(1);  }
                        else {
                                vector<string> dupNames;
-                               splitAtComma(globaldata->names[name], dupNames);
+                               m->splitAtComma(globaldata->names[name], dupNames);
                                
                                map<string, int>::iterator itCounts;
                                int maxPars = 1;
@@ -132,7 +147,11 @@ void Tree::addNamesToCounts() {
                                tree[i].setGroup(nodeGroups);
                                
                        }//end else
-               }//end for                                      
+               }//end for              
+               
+               //float B = clock();
+               //cout << "addNamesToCounts\t" << (B - A) / CLOCKS_PER_SEC << endl;     
+
        }
        catch(exception& e) {
                m->errorOut(e, "Tree", "addNamesToCounts");
@@ -168,7 +187,8 @@ void Tree::setIndex(string searchName, int index) {
 /*****************************************************************/
 int Tree::assembleTree() {
        try {
-       
+               //float A = clock();
+
                //if user has given a names file we want to include that info in the pgroups and pcount info.
                if(globaldata->names.size() != 0) {  addNamesToCounts();  }
                
@@ -179,7 +199,8 @@ int Tree::assembleTree() {
                        tree[i].pGroups = (mergeGroups(i));
                        tree[i].pcount = (mergeGcounts(i));
                }
-               
+               //float B = clock();
+               //cout << "assembleTree\t" << (B-A) / CLOCKS_PER_SEC << endl;
                return 0;
        }
        catch(exception& e) {
@@ -292,14 +313,14 @@ map<string, int> Tree::mergeUserGroups(int i, vector<string> g) {
                
                //loop through nodes groups removing the ones the user doesn't want
                for(it=tree[lc].pGroups.begin();it!=tree[lc].pGroups.end();){
-                               if (inUsersGroups(it->first, g) != true) {
+                               if (m->inUsersGroups(it->first, g) != true) {
                                        tree[lc].pGroups.erase(it++);
                                }else { it++; }
                }
 
                //loop through nodes groups removing the ones the user doesn't want
                for(it=tree[rc].pGroups.begin();it!=tree[rc].pGroups.end();){
-                               if (inUsersGroups(it->first, g) != true) {
+                               if (m->inUsersGroups(it->first, g) != true) {
                                        tree[rc].pGroups.erase(it++);
                                }else { it++; }
                }
@@ -381,8 +402,8 @@ void Tree::randomLabels(vector<string> g) {
                        //if either of the leaf nodes you are about to switch are not in the users groups then you don't want to switch them.
                        bool treez, treei;
                
-                       treez = inUsersGroups(tree[z].getGroup(), g);
-                       treei = inUsersGroups(tree[i].getGroup(), g);
+                       treez = m->inUsersGroups(tree[z].getGroup(), g);
+                       treei = m->inUsersGroups(tree[i].getGroup(), g);
                        
                        if ((treez == true) && (treei == true)) {
                                //switches node i and node z's info.
@@ -542,10 +563,10 @@ void Tree::printForBoot(ostream& out) {
 void Tree::createNewickFile(string f) {
        try {
                int root = findRoot();
-               //filename = getRootName(globaldata->getTreeFile()) + "newick";
+               //filename = m->getRootName(globaldata->getTreeFile()) + "newick";
                filename = f;
 
-               openOutputFile(filename, out);
+               m->openOutputFile(filename, out);
                
                printBranch(root, out, "branch");
                
@@ -643,7 +664,7 @@ void Tree::parseTreeFile() {
        try {
                string filename = globaldata->getTreeFile();
                ifstream filehandle;
-               openInputFile(filename, filehandle);
+               m->openInputFile(filename, filehandle);
                int c, comment;
                comment = 0;
                int done = 1;
@@ -736,20 +757,39 @@ int Tree::readTreeString(ifstream& filehandle)    {
 //cout << " at beginning of while " <<  k << endl;                     
                        if(c == ')')  {    
                                //to pass over labels in trees
-                               string label = readLabel(filehandle);
+                               c=filehandle.get();
+                               while((c!=',') && (c != -1) && (c!= ':') && (c!=';')){ c=filehandle.get(); }
+                               filehandle.putback(c);
                        }
-                       
                        if(c == ';') { return 0; }
                        if(c == -1) { return 0; }
-                       
                        //if you are a name
                        if((c != '(') && (c != ')') && (c != ',') && (c != ':') && (c != '\n') && (c != '\t') && (c != 32)) { //32 is space
-                               name = readName(filehandle);
+                               name = "";
+                               c = filehandle.get();
+                       //k = c;
+//cout << k << endl;
+                               while ((c != '(') && (c != ')') && (c != ',') && (c != ':') && (c != '\n') && (c != 32) && (c != '\t')) {                       
+                                       name += c;
+                                       c = filehandle.get();
+                       //k = c;
+//cout << " in name while " << k << endl;
+                               }
+                               
+//cout << "name = " << name << endl;
                                globaldata->Treenames.push_back(name);
+                               filehandle.putback(c);
+//k = c;
+//cout << " after putback" <<  k << endl;
                        } 
                        
                        if(c  == ':') { //read until you reach the end of the branch length
-                               string bl = readBranchLength(filehandle);
+                               while ((c != '(') && (c != ')') && (c != ',') && (c != ';') && (c != '\n') && (c != '\t') && (c != 32)) {
+                                       c = filehandle.get();
+       //k = c;
+       //cout << " in branch while " << k << endl;
+                               }
+                               filehandle.putback(c);
                        }
                
                        c = filehandle.get();
@@ -770,68 +810,6 @@ int Tree::readTreeString(ifstream& filehandle)     {
 }      
 
 /*******************************************************/
-string Tree::readLabel(ifstream& filehandle)   {
-       try {
-               
-               string label = "";
-               
-               //to pass over labels in trees
-               int c=filehandle.get();
-               while((c!=',') && (c != -1) && (c!= ':') && (c!=';')){ label += c; c=filehandle.get(); }
-               filehandle.putback(c);
-               
-               return label;
-               
-       }
-       catch(exception& e) {
-               m->errorOut(e, "Tree", "readLabel");
-               exit(1);
-       }
-}      
-/*******************************************************/
-string Tree::readName(ifstream& filehandle)    {
-       try {
-               
-               string name = "";
-               int c = filehandle.get();
-               
-               while ((c != '(') && (c != ')') && (c != ',') && (c != ':') && (c != '\n') && (c != 32) && (c != '\t')) {                       
-                       name += c;
-                       c = filehandle.get();
-               }
-                               
-//cout << "name = " << name << endl;
-               filehandle.putback(c);
-               
-               return name;
-               
-       }
-       catch(exception& e) {
-               m->errorOut(e, "Tree", "readName");
-               exit(1);
-       }
-}      
-/*******************************************************/
-string Tree::readBranchLength(ifstream& filehandle)    {
-       try {
-               
-               string br = "";
-               int c;
-               while ((c != '(') && (c != ')') && (c != ',') && (c != ';') && (c != '\n') && (c != '\t') && (c != 32)) {
-                       br += c;
-                       c = filehandle.get();
-               }
-               filehandle.putback(c);
-               
-               return br;
-               
-       }
-       catch(exception& e) {
-               m->errorOut(e, "Tree", "readBranchLength");
-               exit(1);
-       }
-}      
 
 /*******************************************************/
-/*******************************************************/