fixed a bug in calculating the # of ambig bases

[mothur.git] / readtree.h

diff --git a/readtree.h b/readtree.h
index 250b1db898546981b0969b7323095bbedd35a875..3df0e0a5f1312aaf3be2ee1f0c35bc5c93afb695 100644 (file)
--- a/readtree.h
+++ b/readtree.h
@@ -11,8 +11,8 @@
 
 using namespace std;
 
+#include "mothur.h"
 #include "globaldata.hpp"
-#include "utilities.hpp"
 #include "tree.h"
 
 #define MAX_LINE               513
@@ -27,7 +27,7 @@ class ReadTree {
                ReadTree(); 
                ~ReadTree() {};
                
-               virtual void read() {};
+               virtual int read() = 0;
                int readSpecialChar(istream&, char, string);
                int readNodeChar(istream& f);
                float readBranchLength(istream& f);
@@ -36,6 +36,7 @@ class ReadTree {
                GlobalData* globaldata;
                int numNodes, numLeaves;
                
+               
 };
 
 /****************************************************************************/
@@ -43,18 +44,20 @@ class ReadTree {
 class ReadNewickTree : public ReadTree {
        
 public:
-       ReadNewickTree(string file) : treeFile(file) { openInputFile(file, filehandle); } 
+       ReadNewickTree(string file) : treeFile(file) { openInputFile(file, filehandle); readOk = 0; } 
        ~ReadNewickTree() {};
-       void read();
+       int read();
        
 private:
        Tree* T;
        int readNewickInt(istream&, int&, Tree*);
-       void readTreeString();
+       int readTreeString();
        void nexusTranslation();
        ifstream filehandle;
        string treeFile;
        string holder;
+       int readOk;  // readOk = 0 means success, readOk = 1 means errors.
+       
 };
 
 /****************************************************************************/