#include "mothurout.h"
+
/******************************************************/
MothurOut* MothurOut::getInstance() {
if( _uniqueInstance == 0) {
}
}
/*********************************************************************************************/
+void MothurOut::setOutputDir(string pathname) {
+ try {
+ outputDir = pathname;
+ }
+ catch(exception& e) {
+ errorOut(e, "MothurOut", "setOutputDir");
+ exit(1);
+ }
+}
+/*********************************************************************************************/
void MothurOut::closeLog() {
try {
}
/***********************************************************************/
+#if defined (__APPLE__) || (__MACH__) || (linux) || (__linux)
#ifdef USE_COMPRESSION
inline bool endsWith(string s, const char * suffix){
size_t suffixLength = strlen(suffix);
return s.size() >= suffixLength && s.substr(s.size() - suffixLength, suffixLength).compare(suffix) == 0;
}
#endif
+#endif
string MothurOut::getRootName(string longName){
try {
string rootName = longName;
+#if defined (__APPLE__) || (__MACH__) || (linux) || (__linux)
#ifdef USE_COMPRESSION
if (endsWith(rootName, ".gz") || endsWith(rootName, ".bz2")) {
int pos = rootName.find_last_of('.');
cerr << "shortening " << longName << " to " << rootName << "\n";
}
#endif
-
+#endif
if(rootName.find_last_of(".") != rootName.npos){
int pos = rootName.find_last_of('.')+1;
rootName = rootName.substr(0, pos);
//check for blank file
gobble(fileHandle);
if (fileHandle.eof()) { fileHandle.close(); return true; }
+ fileHandle.close();
}
return false;
}
#if defined (__APPLE__) || (__MACH__) || (linux) || (__linux)
if (path.find("~") != -1) { //go to home directory
- string homeDir = getenv ("HOME");
+ string homeDir;
+
+ char *homepath = NULL;
+ homepath = getenv ("HOME");
+ if ( homepath != NULL) { homeDir = homepath; }
+ else { homeDir = ""; }
+
newFileName = homeDir + fileName.substr(fileName.find("~")+1);
return newFileName;
}else { //find path
- if (path.rfind("./") == -1) { return fileName; } //already complete name
+ if (path.rfind("./") == string::npos) { return fileName; } //already complete name
else { newFileName = fileName.substr(fileName.rfind("./")+2); } //save the complete part of the name
- char* cwdpath = new char[1024];
+ //char* cwdpath = new char[1024];
+ //size_t size;
+ //cwdpath=getcwd(cwdpath,size);
+ //cwd = cwdpath;
+
+ char *cwdpath = NULL;
+ cwdpath = getcwd(NULL, 0); // or _getcwd
+ if ( cwdpath != NULL) { cwd = cwdpath; }
+ else { cwd = ""; }
- size_t size;
- cwdpath=getcwd(cwdpath,size);
-
- cwd = cwdpath;
//rip off first '/'
string simpleCWD;
//break apart the current working directory
vector<string> dirs;
- while (simpleCWD.find_first_of('/') != -1) {
+ while (simpleCWD.find_first_of('/') != string::npos) {
string dir = simpleCWD.substr(0,simpleCWD.find_first_of('/'));
simpleCWD = simpleCWD.substr(simpleCWD.find_first_of('/')+1, simpleCWD.length());
dirs.push_back(dir);
int index = dirs.size()-1;
- while((pos = path.rfind("./")) != -1) { //while you don't have a complete path
+ while((pos = path.rfind("./")) != string::npos) { //while you don't have a complete path
if (pos == 0) { break; //you are at the end
}else if (path[(pos-1)] == '.') { //you want your parent directory ../
path = path.substr(0, pos-1);
return newFileName;
}
#else
- if (path.find("~") != -1) { //go to home directory
+ if (path.find("~") != string::npos) { //go to home directory
string homeDir = getenv ("HOMEPATH");
newFileName = homeDir + fileName.substr(fileName.find("~")+1);
return newFileName;
}else { //find path
- if (path.rfind(".\\") == -1) { return fileName; } //already complete name
+ if (path.rfind(".\\") == string::npos) { return fileName; } //already complete name
else { newFileName = fileName.substr(fileName.rfind(".\\")+2); } //save the complete part of the name
char *cwdpath = NULL;
int index = dirs.size()-1;
- while((pos = path.rfind(".\\")) != -1) { //while you don't have a complete path
+ while((pos = path.rfind(".\\")) != string::npos) { //while you don't have a complete path
if (pos == 0) { break; //you are at the end
}else if (path[(pos-1)] == '.') { //you want your parent directory ../
path = path.substr(0, pos-1);
try {
//get full path name
string completeFileName = getFullPathName(fileName);
-
+#if defined (__APPLE__) || (__MACH__) || (linux) || (__linux)
#ifdef USE_COMPRESSION
// check for gzipped or bzipped file
if (endsWith(completeFileName, ".gz") || endsWith(completeFileName, ".bz2")) {
}
}
#endif
-
+#endif
fileHandle.open(completeFileName.c_str());
if(!fileHandle) {
+ //mothurOut("[ERROR]: Could not open " + completeFileName); mothurOutEndLine();
return 1;
}else {
//check for blank file
//get full path name
string completeFileName = getFullPathName(fileName);
-
+#if defined (__APPLE__) || (__MACH__) || (linux) || (__linux)
#ifdef USE_COMPRESSION
// check for gzipped or bzipped file
if (endsWith(completeFileName, ".gz") || endsWith(completeFileName, ".bz2")) {
}
}
#endif
-
+#endif
fileHandle.open(completeFileName.c_str());
if(!fileHandle) {
try {
string completeFileName = getFullPathName(fileName);
-
+#if defined (__APPLE__) || (__MACH__) || (linux) || (__linux)
#ifdef USE_COMPRESSION
// check for gzipped file
if (endsWith(completeFileName, ".gz") || endsWith(completeFileName, ".bz2")) {
}
}
#endif
-
+#endif
fileHandle.open(completeFileName.c_str(), ios::trunc);
if(!fileHandle) {
mothurOut("[ERROR]: Could not open " + completeFileName); mothurOutEndLine();
//open output file in append mode
openOutputFileAppend(filename, output);
int ableToOpen = openInputFile(temp, input, "no error");
+ //int ableToOpen = openInputFile(temp, input);
if (ableToOpen == 0) { //you opened it
while(char c = input.get()){
in.seekg(size);
- while(char c = in.get()){
+ while(in.get()){
if(in.eof()) { break; }
else { size++; }
}
//sanity check filePos
for (int i = 0; i < (filePos.size()-1); i++) {
- if (filePos[(i+1)] <= filePos[i]) { cout << "erasing " << (i+1) << endl; filePos.erase(filePos.begin()+(i+1)); i--; }
+ if (filePos[(i+1)] <= filePos[i]) { filePos.erase(filePos.begin()+(i+1)); i--; }
}
proc = (filePos.size() - 1);
exit(1);
}
}
-
+/**************************************************************************************************/
+unsigned int MothurOut::fromBase36(string base36){
+ try {
+ unsigned int num = 0;
+
+ map<char, int> converts;
+ converts['A'] = 0;
+ converts['a'] = 0;
+ converts['B'] = 1;
+ converts['b'] = 1;
+ converts['C'] = 2;
+ converts['c'] = 2;
+ converts['D'] = 3;
+ converts['d'] = 3;
+ converts['E'] = 4;
+ converts['e'] = 4;
+ converts['F'] = 5;
+ converts['f'] = 5;
+ converts['G'] = 6;
+ converts['g'] = 6;
+ converts['H'] = 7;
+ converts['h'] = 7;
+ converts['I'] = 8;
+ converts['i'] = 8;
+ converts['J'] = 9;
+ converts['j'] = 9;
+ converts['K'] = 10;
+ converts['k'] = 10;
+ converts['L'] = 11;
+ converts['l'] = 11;
+ converts['M'] = 12;
+ converts['m'] = 12;
+ converts['N'] = 13;
+ converts['n'] = 13;
+ converts['O'] = 14;
+ converts['o'] = 14;
+ converts['P'] = 15;
+ converts['p'] = 15;
+ converts['Q'] = 16;
+ converts['q'] = 16;
+ converts['R'] = 17;
+ converts['r'] = 17;
+ converts['S'] = 18;
+ converts['s'] = 18;
+ converts['T'] = 19;
+ converts['t'] = 19;
+ converts['U'] = 20;
+ converts['u'] = 20;
+ converts['V'] = 21;
+ converts['v'] = 21;
+ converts['W'] = 22;
+ converts['w'] = 22;
+ converts['X'] = 23;
+ converts['x'] = 23;
+ converts['Y'] = 24;
+ converts['y'] = 24;
+ converts['Z'] = 25;
+ converts['z'] = 25;
+ converts['0'] = 26;
+ converts['1'] = 27;
+ converts['2'] = 28;
+ converts['3'] = 29;
+ converts['4'] = 30;
+ converts['5'] = 31;
+ converts['6'] = 32;
+ converts['7'] = 33;
+ converts['8'] = 34;
+ converts['9'] = 35;
+
+ int i = 0;
+ while (i < base36.length()) {
+ char c = base36[i];
+ num = 36 * num + converts[c];
+ i++;
+ }
+
+ return num;
+
+ }
+ catch(exception& e) {
+ errorOut(e, "MothurOut", "fromBase36");
+ exit(1);
+ }
+}
/***********************************************************************/
int MothurOut::factorial(int num){
//This function parses the estimator options and puts them in a vector
void MothurOut::splitAtChar(string& estim, vector<string>& container, char symbol) {
try {
- string individual;
-
- while (estim.find_first_of(symbol) != -1) {
- individual = estim.substr(0,estim.find_first_of(symbol));
- if ((estim.find_first_of(symbol)+1) <= estim.length()) { //checks to make sure you don't have dash at end of string
- estim = estim.substr(estim.find_first_of(symbol)+1, estim.length());
+ string individual = "";
+ int estimLength = estim.size();
+ for(int i=0;i<estimLength;i++){
+ if(estim[i] == symbol){
container.push_back(individual);
+ individual = "";
+ }
+ else{
+ individual += estim[i];
}
}
- //get last one
- container.push_back(estim);
+ container.push_back(individual);
+
}
catch(exception& e) {
errorOut(e, "MothurOut", "splitAtChar");
}
//go through users set and make them floats
- for(it = userLabels.begin(); it != userLabels.end(); ++it) {
+ for(it = userLabels.begin(); it != userLabels.end();) {
float temp;
if ((*it != "unique") && (convertTestFloat(*it, temp) == true)){
convert(*it, temp);
orderFloat.push_back(temp);
userMap[*it] = temp;
+ it++;
}else if (*it == "unique") {
orderFloat.push_back(-1.0);
userMap["unique"] = -1.0;
+ it++;
}else {
- if (errorOff == "") { cout << *it << " is not a valid label." << endl; }
- userLabels.erase(*it);
- it--;
+ if (errorOff == "") { mothurOut(*it + " is not a valid label."); mothurOutEndLine(); }
+ userLabels.erase(it++);
}
}
if (orderFloat[i] < labelFloat) {
smaller = true;
if (orderFloat[i] == -1) {
- if (errorOff == "") { cout << "Your file does not include the label unique." << endl; }
+ if (errorOff == "") { mothurOut("Your file does not include the label unique."); mothurOutEndLine(); }
userLabels.erase("unique");
}
else {
- if (errorOff == "") { cout << "Your file does not include the label " << endl; }
+ if (errorOff == "") { mothurOut("Your file does not include the label "); mothurOutEndLine(); }
string s = "";
for (it2 = userMap.begin(); it2!= userMap.end(); it2++) {
if (it2->second == orderFloat[i]) {
break;
}
}
- if (errorOff == "") {cout << s << ". I will use the next smallest distance. " << endl; }
+ if (errorOff == "") {mothurOut( s + ". I will use the next smallest distance. "); mothurOutEndLine(); }
}
//since they are sorted once you find a bigger one stop looking
}else { break; }
exit(1);
}
}
+
/**************************************************************************************************/
projects / mothur.git / blobdiff