File: readcolumn.cpp

package info (click to toggle)
mothur 1.33.3%2Bdfsg-2
  • links: PTS, VCS
  • area: main
  • in suites: jessie, jessie-kfreebsd
  • size: 11,248 kB
  • ctags: 12,231
  • sloc: cpp: 152,046; fortran: 665; makefile: 74; sh: 34
file content (279 lines) | stat: -rw-r--r-- 8,898 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
/*
 *  readcolumn.cpp
 *  Mothur
 *
 *  Created by Sarah Westcott on 4/21/09.
 *  Copyright 2009 Schloss Lab UMASS Amherst. All rights reserved.
 *
 */

#include "readcolumn.h"
#include "progress.hpp"

/***********************************************************************/

ReadColumnMatrix::ReadColumnMatrix(string df) : distFile(df){
	
	successOpen = m->openInputFile(distFile, fileHandle);
	sim = false;
	
}
/***********************************************************************/

ReadColumnMatrix::ReadColumnMatrix(string df, bool s) : distFile(df){
	
	successOpen = m->openInputFile(distFile, fileHandle);
	sim = s;
}

/***********************************************************************/

int ReadColumnMatrix::read(NameAssignment* nameMap){
	try {		

		string firstName, secondName;
		float distance;
		int nseqs = nameMap->size();
        DMatrix->resize(nseqs);
		list = new ListVector(nameMap->getListVector());
	
		Progress* reading = new Progress("Reading matrix:     ", nseqs * nseqs);

		int lt = 1;
		int refRow = 0;	//we'll keep track of one cell - Cell(refRow,refCol) - and see if it's transpose
		int refCol = 0; //shows up later - Cell(refCol,refRow).  If it does, then its a square matrix

		//need to see if this is a square or a triangular matrix...
	
		while(fileHandle && lt == 1){  //let's assume it's a triangular matrix...

		
			fileHandle >> firstName; m->gobble(fileHandle);
            fileHandle >> secondName; m->gobble(fileHandle);
            fileHandle >> distance;	// get the row and column names and distance
            
            if (m->debug) { cout << firstName << '\t' << secondName << '\t' << distance << endl; }
			
			if (m->control_pressed) {  fileHandle.close();  delete reading; return 0; }
	
			map<string,int>::iterator itA = nameMap->find(firstName);
			map<string,int>::iterator itB = nameMap->find(secondName);

			if(itA == nameMap->end()){  m->mothurOut("AAError: Sequence '" + firstName + "' was not found in the names file, please correct\n"); exit(1);  }
			if(itB == nameMap->end()){  m->mothurOut("ABError: Sequence '" + secondName + "' was not found in the names file, please correct\n"); exit(1);  }

			if (distance == -1) { distance = 1000000; }
			else if (sim) { distance = 1.0 - distance;  }  //user has entered a sim matrix that we need to convert.
			
			if(distance < cutoff && itA != itB){
				if(itA->second > itB->second){
                    PDistCell value(itA->second, distance);
                    
                    
					if(refRow == refCol){		// in other words, if we haven't loaded refRow and refCol...
						refRow = itA->second;
						refCol = itB->second;
						DMatrix->addCell(itB->second, value);
					}
					else if(refRow == itA->second && refCol == itB->second){
						lt = 0;
					}
					else{
						DMatrix->addCell(itB->second, value);
					}
				}
				else if(itA->second < itB->second){
					PDistCell value(itB->second, distance);
			
					if(refRow == refCol){		// in other words, if we haven't loaded refRow and refCol...
						refRow = itA->second;
						refCol = itB->second;
						DMatrix->addCell(itA->second, value);
					}
					else if(refRow == itB->second && refCol == itA->second){
						lt = 0;
					}
					else{
						DMatrix->addCell(itA->second, value);
					}
				}
				reading->update(itA->second * nseqs);
			}
			m->gobble(fileHandle);
		}

		if(lt == 0){  // oops, it was square
	
			fileHandle.close();  //let's start over
			DMatrix->clear();  //let's start over
		   
			m->openInputFile(distFile, fileHandle);  //let's start over

			while(fileHandle){
				fileHandle >> firstName; m->gobble(fileHandle);
                fileHandle >> secondName; m->gobble(fileHandle);
                fileHandle >> distance;	// get the row and column names and distance
				
				if (m->control_pressed) {  fileHandle.close();  delete reading; return 0; }
		
				map<string,int>::iterator itA = nameMap->find(firstName);
				map<string,int>::iterator itB = nameMap->find(secondName);
				
				if(itA == nameMap->end()){  m->mothurOut("AAError: Sequence '" + firstName + "' was not found in the names file, please correct\n"); exit(1);  }
				if(itB == nameMap->end()){  m->mothurOut("ABError: Sequence '" + secondName + "' was not found in the names file, please correct\n"); exit(1);  }
				
				if (distance == -1) { distance = 1000000; }
				else if (sim) { distance = 1.0 - distance;  }  //user has entered a sim matrix that we need to convert.
				
				if(distance < cutoff && itA->second > itB->second){
                    PDistCell value(itA->second, distance);
					DMatrix->addCell(itB->second, value);
					reading->update(itA->second * nseqs);
				}
		
				m->gobble(fileHandle);
			}
		}
		
		if (m->control_pressed) {  fileHandle.close();  delete reading; return 0; }
		
		reading->finish();
		fileHandle.close();

		list->setLabel("0");
		
		return 1;

	}
	catch(exception& e) {
		m->errorOut(e, "ReadColumnMatrix", "read");
		exit(1);
	}
}
/***********************************************************************/

int ReadColumnMatrix::read(CountTable* countTable){
	try {		
        
		string firstName, secondName;
		float distance;
		int nseqs = countTable->size();
        
        DMatrix->resize(nseqs);
		list = new ListVector(countTable->getListVector());
        
		Progress* reading = new Progress("Reading matrix:     ", nseqs * nseqs);
        
		int lt = 1;
		int refRow = 0;	//we'll keep track of one cell - Cell(refRow,refCol) - and see if it's transpose
		int refCol = 0; //shows up later - Cell(refCol,refRow).  If it does, then its a square matrix
        
		//need to see if this is a square or a triangular matrix...
               
		while(fileHandle && lt == 1){  //let's assume it's a triangular matrix...
            
            
			fileHandle >> firstName; m->gobble(fileHandle);
            fileHandle >> secondName; m->gobble(fileHandle);
            fileHandle >> distance;	// get the row and column names and distance
            
			if (m->control_pressed) {  fileHandle.close();  delete reading; return 0; }
            
			int itA = countTable->get(firstName);
			int itB = countTable->get(secondName);
            
            if (m->control_pressed) { exit(1); }
            
			if (distance == -1) { distance = 1000000; }
			else if (sim) { distance = 1.0 - distance;  }  //user has entered a sim matrix that we need to convert.
			
			if(distance < cutoff && itA != itB){
				if(itA > itB){
                    PDistCell value(itA, distance);
                    
                    
					if(refRow == refCol){		// in other words, if we haven't loaded refRow and refCol...
						refRow = itA;
						refCol = itB;
						DMatrix->addCell(itB, value);
					}
					else if(refRow == itA && refCol == itB){
						lt = 0;
					}
					else{
						DMatrix->addCell(itB, value);
					}
				}
				else if(itA < itB){
					PDistCell value(itB, distance);
                    
					if(refRow == refCol){		// in other words, if we haven't loaded refRow and refCol...
						refRow = itA;
						refCol = itB;
						DMatrix->addCell(itA, value);
					}
					else if(refRow == itB && refCol == itA){
						lt = 0;
					}
					else{
						DMatrix->addCell(itA, value);
					}
				}
				reading->update(itA * nseqs);
			}
			m->gobble(fileHandle);
		}
        
		if(lt == 0){  // oops, it was square
            
			fileHandle.close();  //let's start over
			DMatrix->clear();  //let's start over
            
			m->openInputFile(distFile, fileHandle);  //let's start over
            
			while(fileHandle){
				fileHandle >> firstName; m->gobble(fileHandle);
                fileHandle >> secondName; m->gobble(fileHandle);
                fileHandle >> distance;	// get the row and column names and distance
				
				if (m->control_pressed) {  fileHandle.close();  delete reading; return 0; }
                
				int itA = countTable->get(firstName);
                int itB = countTable->get(secondName);
                
                
                if (m->control_pressed) { exit(1); }
				
				if (distance == -1) { distance = 1000000; }
				else if (sim) { distance = 1.0 - distance;  }  //user has entered a sim matrix that we need to convert.
				
				if(distance < cutoff && itA > itB){
                    PDistCell value(itA, distance);
					DMatrix->addCell(itB, value);
					reading->update(itA * nseqs);
				}
                
				m->gobble(fileHandle);
			}
		}
		
		if (m->control_pressed) {  fileHandle.close();  delete reading; return 0; }
		
		reading->finish();
		fileHandle.close();
        
		list->setLabel("0");
		
		return 1;
        
	}
	catch(exception& e) {
		m->errorOut(e, "ReadColumnMatrix", "read");
		exit(1);
	}
}

/***********************************************************************/
ReadColumnMatrix::~ReadColumnMatrix(){}
/***********************************************************************/