sffinfo bug with flow grams right index when clipQualRight=0

[mothur.git] / classify.h

diff --git a/classify.h b/classify.h
index 5c5a7ac474ecc0ce7308672e1a606c0052643caa..7b4c1022fef35aacbc33824d99ede551e55b187c 100644 (file)
--- a/classify.h
+++ b/classify.h
@@ -17,27 +17,24 @@
 #include "database.hpp"
 #include "phylotree.h"
 
-
 class Sequence;
 
-
 /**************************************************************************************************/
 
 class Classify {
 
 public:
-       Classify(string, string, string, int, float, float, float, float);
-       
-       virtual ~Classify(){  delete phyloTree; delete database;  };
+       Classify();
+       virtual ~Classify(){};
        virtual string getTaxonomy(Sequence*) = 0;
-       //virtual map<string, int> getConfidenceScores() { return taxConfidenceScore; }
-       //virtual vector<string> parseTax(string);
        virtual string getSimpleTax()  { return simpleTax;      }
+       virtual bool getFlipped()  { return flipped;    }
+       virtual void generateDatabaseAndNames(string, string, string, int, float, float, float, float);
+       virtual void setDistName(string s) {} //for knn, so if distance method is selected with knn you can create the smallest distance file in the right place.
        
 protected:
 
        map<string, string> taxonomy;  //name maps to taxonomy
-       //map<string, int> genusCount;  //maps genus to count - in essence a list of how many seqs are in each taxonomy
        map<string, int>::iterator itTax;
        map<string, string>::iterator it;
        Database* database;
@@ -45,9 +42,14 @@ protected:
        
        string taxFile, templateFile, simpleTax;
        vector<string> names;
+       int threadID, numLevels, numTaxa;
+       bool flip, flipped, shortcuts;
        
-       void readTaxonomy(string);
+       int readTaxonomy(string);
        vector<string> parseTax(string);
+    double getLogExpSum(vector<double>, int&);
+       MothurOut* m;
+       
 };
 
 /**************************************************************************************************/