for (int i = 0; i < lookup.size(); i++) { delete lookup[i]; lookup[i] = NULL; }
lookup.clear();
+ if (globaldata->saveNextLabel == "") { f >> label; }
+ else { label = globaldata->saveNextLabel; }
+
//read in first row since you know there is at least 1 group.
- f >> label >> groupN >> num;
+ f >> groupN >> num;
+
holdLabel = label;
//add new vector to lookup
//numSeqs += inputData;
//numBins++;
if (inputData > maxRank) { maxRank = inputData; }
-
}
m->gobble(f);
- if (f.eof() != true) { f >> nextLabel; }
-
+ if (!(f.eof())) { f >> nextLabel; }
+
//read the rest of the groups info in
while ((nextLabel == holdLabel) && (f.eof() != true)) {
f >> groupN >> num;
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(); }
+
+ globaldata->saveNextLabel = nextLabel;
if (globaldata->gGroupmap == NULL) { globaldata->gGroupmap = groupmap; }
}
/***********************************************************************/
+void SharedRAbundVector::clear(){
+ numBins = 0;
+ maxRank = 0;
+ numSeqs = 0;
+ data.clear();
+ for (int i = 0; i < lookup.size(); i++) { delete lookup[i]; lookup[i] = NULL; }
+ lookup.clear();
+}
+/***********************************************************************/
+
void SharedRAbundVector::push_back(int binSize, string groupName){
try {
individual newGuy;
OrderVector SharedRAbundVector::getOrderVector(map<string,int>* nameMap = NULL) {
try {
OrderVector ov;
-
- for(int i=0;i<data.size();i++){
+ for(int i=0;i<numBins;i++){
for(int j=0;j<data[i].abundance;j++){
ov.push_back(i);
}
}
random_shuffle(ov.begin(), ov.end());
-
+
ov.setLabel(label);
+
return ov;
}
catch(exception& e) {