]> git.donarmstrong.com Git - mothur.git/blobdiff - decalc.h
modified mpi code to save ram by writing out every 10 seqs.
[mothur.git] / decalc.h
index 5f0a82025c557a75c3adc4715526fa17bd5fe5a5..da663e80f786d1a98b646fe856bbe32522dd2c42 100644 (file)
--- a/decalc.h
+++ b/decalc.h
@@ -36,16 +36,17 @@ class DeCalculator {
 
        public:
                
-               DeCalculator() {};
+               DeCalculator() { m = MothurOut::getInstance(); }
                ~DeCalculator() {};
                
-               vector<Sequence*> findClosest(Sequence*, vector<Sequence*>, int);  //takes querySeq, a reference db and numWanted - returns indexes to closest seqs in db
+               vector<Sequence*> findClosest(Sequence*, vector<Sequence*>, int&, vector<int>&);  //takes querySeq, a reference db, numWanted and indexes 
+               Sequence* findClosest(Sequence*, vector<Sequence*>);
                set<int> getPos() {  return h;  }
                void setMask(string); 
                void setAlignmentLength(int l) {  alignLength = l;  }
                void runMask(Sequence*);
                void trimSeqs(Sequence*, Sequence*, map<int, int>&);
-               void trimSeqs(Sequence*, vector<Sequence*>);
+               map<int, int> trimSeqs(Sequence*, vector<Sequence*>);
                void removeObviousOutliers(vector< vector<quanMember> >&, int);
                vector<float> calcFreq(vector<Sequence*>, string);
                vector<int> findWindows(Sequence*, int, int, int&, int);
@@ -70,6 +71,7 @@ class DeCalculator {
                set<int> h;
                int alignLength;
                map<int, int> maskMap;
+               MothurOut* m;
 
 };