X-Git-Url: https://git.donarmstrong.com/?p=mothur.git;a=blobdiff_plain;f=database.cpp;h=f587f42f4440261934277d2adab1e8fe006f97ee;hp=b661d41402fc715b8073266d11c23224ad65a781;hb=050a3ff02473a3d4c0980964e1a9ebe52e55d6b8;hpb=bfbc55964f1977da72c2cea984288a427d370a59 diff --git a/database.cpp b/database.cpp index b661d41..f587f42 100644 --- a/database.cpp +++ b/database.cpp @@ -7,52 +7,28 @@ * */ -using namespace std; - #include "mothur.h" #include "sequence.hpp" #include "database.hpp" /**************************************************************************************************/ -Database::Database(string fastaFileName){ - - ifstream fastaFile(fastaFileName.c_str()); - if(!fastaFile) { - cerr << "Error: Could not open " << fastaFileName << endl; - exit(1); - } - cout << endl << "Reading in the " << fastaFileName << " template sequences...\t"; cout.flush(); - - numSeqs=count(istreambuf_iterator(fastaFile),istreambuf_iterator(), '>'); - fastaFile.seekg(0); - - templateSequences.resize(numSeqs); - - string seqName, sequence; - for(int i=0;i> seqName; - templateSequences[i]->setName(seqName); - - char letter; - string aligned; - - while(fastaFile && (letter=fastaFile.get()) != '>'){ - if(isprint(letter)){ - letter = toupper(letter); - aligned += letter; - } - } - templateSequences[i]->setAligned(aligned); - templateSequences[i]->setUnaligned(aligned); - fastaFile.putback(letter); - } - - fastaFile.close(); - cout << "DONE." << endl; cout.flush(); - +Database::Database(){ + longest = 0; + numSeqs = 0; + m = MothurOut::getInstance(); } +/**************************************************************************************************/ + +Database::~Database(){} + +/**************************************************************************************************/ + +float Database::getSearchScore() { return searchScore; } // we're assuming that the search is already done + + +/**************************************************************************************************/ + +int Database::getLongestBase() { return longest+1; } /**************************************************************************************************/