made get.oturep more memory efficient by breaking the work into 2 pieces.

[mothur.git] / knn.cpp

diff --git a/knn.cpp b/knn.cpp
index 93a7aa33faa6e2e1d9cb43c0505464056cbb1f08..64b5b3a288db8ce2f1d6da7e08af90bd8e26e613 100644 (file)
--- a/knn.cpp
+++ b/knn.cpp
@@ -11,14 +11,22 @@
 
 /**************************************************************************************************/
 Knn::Knn(string tfile, string tempFile, string method, int kmerSize, float gapOpen, float gapExtend, float match, float misMatch, int n) 
-: Classify(tfile, tempFile, method, kmerSize, gapOpen, gapExtend, match, misMatch), num(n)  {}
+: Classify(), num(n)  {
+       try {
+               //create search database and names vector
+               generateDatabaseAndNames(tfile, tempFile, method, kmerSize, gapOpen, gapExtend, match, misMatch);
+       }
+       catch(exception& e) {
+               m->errorOut(e, "Knn", "Knn");
+               exit(1);
+       }
+}
 /**************************************************************************************************/
 string Knn::getTaxonomy(Sequence* seq) {
        try {
                string tax;
                
                //use database to find closest seq
-
                vector<int> closest = database->findClosestSequences(seq, num);
                
                if (m->control_pressed) { return tax; }