#include "fullmatrix.h"
-
/**************************************************************************/
+
//This constructor reads a distance matrix file and stores the data in the matrix.
-FullMatrix::FullMatrix(ifstream& f) {
+FullMatrix::FullMatrix(ifstream& filehandle) {
try{
- string name;
- f >> numSeqs >> name;
+ globaldata = GlobalData::getInstance();
+ groupmap = globaldata->gGroupmap;
+
+ string name, group;
+ filehandle >> numSeqs >> name;
+
+ //make the matrix filled with zeros
+ matrix.resize(numSeqs);
+ for(int i = 0; i < numSeqs; i++) {
+ matrix[i].resize(numSeqs, 0);
+ }
+
+ group = groupmap->getGroup(name);
+ if(group == "not found") { mothurOut("Error: Sequence '" + name + "' was not found in the group file, please correct."); mothurOutEndLine(); exit(1); }
+ index.resize(numSeqs);
+ index[0].groupName = group;
+ index[0].seqName = name;
+
+ //determine if matrix is square or lower triangle
+ //if it is square read the distances for the first sequence
+ char d;
+ bool square;
+ while((d=filehandle.get()) != EOF){
+
+ //is d a number meaning its square
+ if(isalnum(d)){
+ square = true;
+ filehandle.putback(d);
+
+ for(int i=0;i<numSeqs;i++){
+ filehandle >> matrix[0][i];
+ }
+ break;
+ }
+
+ //is d a line return meaning its lower triangle
+ if(d == '\n'){
+ square = false;
+ break;
+ }
+ }
+
+ //read rest of matrix
+ if (square == true) { readSquareMatrix(filehandle); }
+ else { readLTMatrix(filehandle); }
+
+ //sort sequences so they are gathered in groups for processing
+ sortGroups(0, numSeqs-1);
- matrix.resize(numSeqs);
+ groups.push_back(index[0].groupName);
+ sizes.push_back(1);
+ int groupCount = 0;
+ for(int i=1;i<numSeqs;i++){
+ if(index[i].groupName == index[i-1].groupName){ sizes[groupCount]++; }
+ else{
+ sizes.push_back(1);
+ groups.push_back(index[i].groupName);
+ groupCount++;
+ }
+ }
+ }
+ catch(exception& e) {
+ errorOut(e, "FullMatrix", "FullMatrix");
+ exit(1);
+ }
+}
+/**************************************************************************/
+void FullMatrix::readSquareMatrix(ifstream& filehandle) {
+ try {
+ Progress* reading;
+ reading = new Progress("Reading matrix: ", numSeqs * numSeqs);
+
+ int count = 0;
+
+ string group, name;
+
+ for(int i=1;i<numSeqs;i++){
+ filehandle >> name;
+
+ group = groupmap->getGroup(name);
+ index[i].groupName = group;
+ index[i].seqName = name;
+
+ if(group == "not found") { mothurOut("Error: Sequence '" + name + "' was not found in the group file, please correct."); mothurOutEndLine(); exit(1); }
+
+ for(int j=0;j<numSeqs;j++){
+ filehandle >> matrix[i][j];
+
+ count++;
+ reading->update(count);
+ }
+ }
+ reading->finish();
+ delete reading;
}
catch(exception& e) {
- cout << "Standard Error: " << e.what() << " has occurred in the FullMatrix class Function FullMatrix. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
+ errorOut(e, "FullMatrix", "readSquareMatrix");
exit(1);
}
- catch(...) {
- cout << "An unknown error has occurred in the FullMatrix class function FullMatrix. Please contact Pat Schloss at pschloss@microbio.umass.edu." << "\n";
+}
+/**************************************************************************/
+void FullMatrix::readLTMatrix(ifstream& filehandle) {
+ try {
+ Progress* reading;
+ reading = new Progress("Reading matrix: ", numSeqs * (numSeqs - 1) / 2);
+
+ int count = 0;
+ float distance;
+
+ string group, name;
+
+ for(int i=1;i<numSeqs;i++){
+ filehandle >> name;
+
+ group = groupmap->getGroup(name);
+ index[i].groupName = group;
+ index[i].seqName = name;
+
+ if(group == "not found") { mothurOut("Error: Sequence '" + name + "' was not found in the group file, please correct."); mothurOutEndLine(); exit(1); }
+
+ for(int j=0;j<i;j++){
+ filehandle >> distance;
+
+ matrix[i][j] = distance; matrix[j][i] = distance;
+ count++;
+ reading->update(count);
+ }
+
+ }
+ reading->finish();
+ delete reading;
+ }
+ catch(exception& e) {
+ errorOut(e, "FullMatrix", "readLTMatrix");
+ exit(1);
+ }
+}
+
+/**************************************************************************/
+
+void FullMatrix::sortGroups(int low, int high){
+ try{
+
+ int i = low;
+ int j = high;
+ float y = 0;
+ string name;
+
+ /* compare value */
+ //what group does this row belong to
+ string z = index[(low + high) / 2].groupName;
+
+ /* partition */
+ do {
+ /* find member above ... */
+ while(index[i].groupName < z) i++;
+
+ /* find element below ... */
+ while(index[j].groupName > z) j--;
+
+ if(i <= j) {
+ /* swap rows*/
+ for (int h = 0; h < numSeqs; h++) {
+ y = matrix[i][h];
+ matrix[i][h] = matrix[j][h];
+ matrix[j][h] = y;
+ }
+
+ /* swap columns*/
+ for (int b = 0; b < numSeqs; b++) {
+ y = matrix[b][i];
+ matrix[b][i] = matrix[b][j];
+ matrix[b][j] = y;
+ }
+
+ //swap map elements
+ z = index[i].groupName;
+ index[i].groupName = index[j].groupName;
+ index[j].groupName = z;
+
+ name = index[i].seqName;
+ index[i].seqName = index[j].seqName;
+ index[j].seqName = name;
+
+
+ i++;
+ j--;
+ }
+ } while(i <= j);
+
+ /* recurse */
+ if(low < j)
+ sortGroups(low, j);
+
+ if(i < high)
+ sortGroups(i, high);
+
+
+ }
+ catch(exception& e) {
+ errorOut(e, "FullMatrix", "sortGroups");
exit(1);
}
}
+
/**************************************************************************/
-int FullMatrix::getNumSeqs(){ return numSeqs; }
-/**************************************************************************/
\ No newline at end of file
+
+float FullMatrix::get(int i, int j){ return matrix[i][j]; }
+
+/**************************************************************************/
+
+vector<string> FullMatrix::getGroups(){ return groups; }
+
+/**************************************************************************/
+
+vector<int> FullMatrix::getSizes(){ return sizes; }
+
+/**************************************************************************/
+
+int FullMatrix::getNumGroups(){ return groups.size(); }
+
+/**************************************************************************/
+
+int FullMatrix::getNumSeqs(){ return numSeqs; }
+
+/**************************************************************************/
+
+void FullMatrix::printMatrix(ostream& out) {
+ try{
+ for (int i = 0; i < numSeqs; i++) {
+ out << "row " << i << " group = " << index[i].groupName << " name = " << index[i].seqName << endl;
+ for (int j = 0; j < numSeqs; j++) {
+ out << matrix[i][j] << " ";
+ }
+ out << endl;
+ }
+ }
+ catch(exception& e) {
+ errorOut(e, "FullMatrix", "printMatrix");
+ exit(1);
+ }
+}
+
+/**************************************************************************/
+
projects / mothur.git / blobdiff