* Dotur
*
* Created by Sarah Westcott on 12/9/08.
- * Copyright 2008 __MyCompanyName__. All rights reserved.
+ * Copyright 2008 Schloss Lab UMASS Amherst. All rights reserved.
*
*/
-using namespace std;
-
-
#include "sharedordervector.h"
-#include "datavector.hpp"
-#include "utilities.hpp"
-#include <exception>
+#include "sharedutilities.h"
/***********************************************************************/
updateStats();
}
-/***********************************************************************
+/***********************************************************************/
+//This function is used to read a .shared file for the collect.shared, rarefaction.shared and summary.shared commands
+//if you don't use a list and groupfile.
-SharedOrderVector::SharedOrderVector(ifstream& f) : DataVector() {
+SharedOrderVector::SharedOrderVector(ifstream& f) : DataVector() { //reads in a shared file
try {
- int hold;
-
- f >> label;
- f >> hold;
-
- data.assign(hold, -1);
-
- int inputData;
-
- for(int i=0;i<hold;i++){
+ globaldata = GlobalData::getInstance();
+ maxRank = 0; numBins = 0; numSeqs = 0;
+
+ if (globaldata->gGroupmap == NULL) { groupmap = new GroupMap(); }
+
+ int num, inputData, count;
+ count = 0; numSeqs = 0;
+ string holdLabel, nextLabel, groupN;
+ individual newguy;
+
+ //read in first row since you know there is at least 1 group.
+ f >> label >> groupN >> num;
+ holdLabel = label;
+
+ if (globaldata->gGroupmap == NULL) {
+ //save group in groupmap
+ groupmap->namesOfGroups.push_back(groupN);
+ groupmap->groupIndex[groupN] = 0;
+ }
+
+ for(int i=0;i<num;i++){
f >> inputData;
- set(i, inputData);
+
+ for (int j = 0; j < inputData; j++) {
+ push_back(i, i, groupN);
+ numSeqs++;
+ }
+ }
+
+ if (f.eof() != true) { f >> nextLabel; }
+
+ //read the rest of the groups info in
+ while ((nextLabel == holdLabel) && (f.eof() != true)) {
+ f >> groupN >> num;
+ count++;
+
+ if (globaldata->gGroupmap == NULL) {
+ //save group in groupmap
+ groupmap->namesOfGroups.push_back(groupN);
+ groupmap->groupIndex[groupN] = count;
+ }
+
+ for(int i=0;i<num;i++){
+ f >> inputData;
+
+ for (int j = 0; j < inputData; j++) {
+ push_back(i, i, groupN);
+ numSeqs++;
+ }
+ }
+
+
+ if (f.eof() != true) { f >> nextLabel; }
+
}
+
+ //put file pointer back since you are now at a new distance label
+ for (int i = 0; i < nextLabel.length(); i++) { f.unget(); }
+ if (globaldata->gGroupmap == NULL) { globaldata->gGroupmap = groupmap; }
+
updateStats();
+
}
catch(exception& e) {
- cout << "Standard Error: " << e.what() << " has occurred in the SharedOrderVector class Function SharedOrderVector. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
- exit(1);
- }
- catch(...) {
- cout << "An unknown error has occurred in the SharedOrderVector class function SharedOrderVector. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
+ errorOut(e, "SharedOrderVector", "SharedOrderVector");
exit(1);
}
}
-
/***********************************************************************/
-
int SharedOrderVector::getNumBins(){
- if(needToUpdate == 1){ updateStats(); }
return numBins;
}
/***********************************************************************/
int SharedOrderVector::getNumSeqs(){
- if(needToUpdate == 1){ updateStats(); }
return numSeqs;
}
/***********************************************************************/
int SharedOrderVector::getMaxRank(){
- if(needToUpdate == 1){ updateStats(); }
return maxRank;
}
data[index].group = groupName;
data[index].bin = binNumber;
data[index].abundance = abund;
- needToUpdate = 1;
-
+ //if (abund > maxRank) { maxRank = abund; }
+ updateStats();
}
/***********************************************************************/
/***********************************************************************/
-
+//commented updateStats out to improve speed, but whoever calls this must remember to update when they are done with all the pushbacks they are doing
void SharedOrderVector::push_back(int binNumber, int abund, string groupName){
individual newGuy;
newGuy.group = groupName;
newGuy.abundance = abund;
newGuy.bin = binNumber;
data.push_back(newGuy);
- needToUpdate = 1;
+ //numSeqs++;
+ //numBins++;
+ //if (abund > maxRank) { maxRank = abund; }
+ //updateStats();
}
/***********************************************************************/
output << endl;
}
catch(exception& e) {
- cout << "Standard Error: " << e.what() << " has occurred in the SharedOrderVector class Function print. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
- exit(1);
- }
- catch(...) {
- cout << "An unknown error has occurred in the SharedOrderVector class function print. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
+ errorOut(e, "SharedOrderVector", "print");
exit(1);
}
}
/***********************************************************************/
void SharedOrderVector::resize(int){
- cout << "resize() did nothing in class SharedOrderVector";
+ mothurOut("resize() did nothing in class SharedOrderVector");
}
/***********************************************************************/
return rav;
}
catch(exception& e) {
- cout << "Standard Error: " << e.what() << " has occurred in the SharedOrderVector class Function getRAbundVector. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
+ errorOut(e, "SharedOrderVector", "getRAbundVector");
exit(1);
}
- catch(...) {
- cout << "An unknown error has occurred in the SharedOrderVector class function getRAbundVector. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
- exit(1);
- }
}
/***********************************************************************/
return ov;
}
catch(exception& e) {
- cout << "Standard Error: " << e.what() << " has occurred in the SharedOrderVector class Function getOrderVector. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
- exit(1);
- }
- catch(...) {
- cout << "An unknown error has occurred in the SharedOrderVector class function getOrderVector. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
+ errorOut(e, "SharedOrderVector", "getOrderVector");
exit(1);
}
}
return rav.getSAbundVector();
}
+/***********************************************************************/
+SharedRAbundVector SharedOrderVector::getSharedRAbundVector(string group) {
+ try {
+ SharedRAbundVector sharedRav(data.size());
+
+ sharedRav.setLabel(label);
+ sharedRav.setGroup(group);
+
+ for (int i = 0; i < data.size(); i++) {
+ if (data[i].group == group) {
+ sharedRav.set(data[i].abundance, sharedRav.getAbundance(data[i].abundance) + 1, data[i].group);
+ }
+ }
+ return sharedRav;
+ }
+ catch(exception& e) {
+ errorOut(e, "SharedOrderVector", "getSharedRAbundVector");
+ exit(1);
+ }
+}
+/***********************************************************************/
+vector<SharedRAbundVector*> SharedOrderVector::getSharedRAbundVector() {
+ try {
+ SharedUtil* util;
+ util = new SharedUtil();
+ vector<SharedRAbundVector*> lookup;
+
+ util->setGroups(globaldata->Groups, globaldata->gGroupmap->namesOfGroups);
+ util->getSharedVectors(globaldata->Groups, lookup, this);
+
+ return lookup;
+ }
+ catch(exception& e) {
+ errorOut(e, "SharedOrderVector", "getSharedRAbundVector");
+ exit(1);
+ }
+}
+/***********************************************************************/
+SharedSAbundVector SharedOrderVector::getSharedSAbundVector(string group) {
+ try {
+
+ SharedRAbundVector sharedRav(this->getSharedRAbundVector(group));
+ return sharedRav.getSharedSAbundVector();
+
+ }
+ catch(exception& e) {
+ errorOut(e, "SharedOrderVector", "getSharedSAbundVector");
+ exit(1);
+ }
+}
/***********************************************************************/
SharedOrderVector SharedOrderVector::getSharedOrderVector(){
+ random_shuffle(data.begin(), data.end());
return *this;
}
numBins = 0;
maxRank = 0;
- for(int i=0;i<data.size();i++){
- if(data[i].bin != -1){
- numSeqs++;
- }
- }
-
- vector<individual> hold(numSeqs);
-
+ numSeqs = data.size();
+
+ vector<int> hold(numSeqs, 0);
for(int i=0;i<numSeqs;i++){
- if(data[i].bin != -1){
- hold[data[i].bin].bin = hold[data[i].bin].bin+1;
- }
+ hold[data[i].bin] = hold[data[i].bin]+1;
}
-
+
for(int i=0;i<numSeqs;i++){
- if(data[i].bin > numBins) { numBins = data[i].bin; }
- if(data[i].abundance > maxRank) { maxRank = data[i].abundance; }
+ if(hold[i] > 0) { numBins++; }
+ if(hold[i] > maxRank) { maxRank = hold[i]; }
}
- numBins++; //if you have 10 bins largest .bin is 9 since we start at 0.
+
}
catch(exception& e) {
- cout << "Standard Error: " << e.what() << " has occurred in the SharedOrderVector class Function updateStats. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
+ errorOut(e, "SharedOrderVector", "updateStats");
exit(1);
}
- catch(...) {
- cout << "An unknown error has occurred in the SharedOrderVector class function updateStats. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
- exit(1);
- }
}
/***********************************************************************/