#include "ordervector.hpp"
#include "listvector.hpp"
+//sorts highest to lowest
+/***********************************************************************/
+inline bool abundNamesSort(string left, string right){
+
+ int countLeft = 0;
+ if(left != ""){
+ countLeft = 1;
+ for(int i=0;i<left.size();i++){ if(left[i] == ','){ countLeft++; } }
+ }
+
+ int countRight = 0;
+ if(right != ""){
+ countRight = 1;
+ for(int i=0;i<right.size();i++){ if(right[i] == ','){ countRight++; } }
+ }
+
+ if (countLeft > countRight) {
+ return true;
+ }
+ return false;
+}
/***********************************************************************/
try {
for(int i=0;i<data.size();i++){
if(data[i] != ""){
- int binSize = getNumNames(data[i]);
+ int binSize = m->getNumNames(data[i]);
numBins = i+1;
if(binSize > maxRank) { maxRank = binSize; }
numSeqs += binSize;
}
}
catch(exception& e) {
- errorOut(e, "ListVector", "ListVector");
+ m->errorOut(e, "ListVector", "ListVector");
exit(1);
}
}
f >> inputData;
set(i, inputData);
}
+ m->gobble(f);
}
catch(exception& e) {
- errorOut(e, "ListVector", "ListVector");
+ m->errorOut(e, "ListVector", "ListVector");
exit(1);
}
}
void ListVector::set(int binNumber, string seqNames){
try {
- int nNames_old = getNumNames(data[binNumber]);
+ int nNames_old = m->getNumNames(data[binNumber]);
data[binNumber] = seqNames;
- int nNames_new = getNumNames(seqNames);
+ int nNames_new = m->getNumNames(seqNames);
if(nNames_old == 0) { numBins++; }
if(nNames_new == 0) { numBins--; }
numSeqs += (nNames_new - nNames_old);
}
catch(exception& e) {
- errorOut(e, "ListVector", "set");
+ m->errorOut(e, "ListVector", "set");
exit(1);
}
}
void ListVector::push_back(string seqNames){
try {
data.push_back(seqNames);
- int nNames = getNumNames(seqNames);
+ int nNames = m->getNumNames(seqNames);
numBins++;
numSeqs += nNames;
}
catch(exception& e) {
- errorOut(e, "ListVector", "push_back");
+ m->errorOut(e, "ListVector", "push_back");
exit(1);
}
}
try {
output << label << '\t' << numBins << '\t';
- for(int i=0;i<data.size();i++){
- if(data[i] != ""){
- output << data[i] << '\t';
+ vector<string> hold = data;
+ sort(hold.begin(), hold.end(), abundNamesSort);
+
+ for(int i=0;i<hold.size();i++){
+ if(hold[i] != ""){
+ output << hold[i] << '\t';
}
}
output << endl;
}
catch(exception& e) {
- errorOut(e, "ListVector", "print");
+ m->errorOut(e, "ListVector", "print");
exit(1);
}
}
RAbundVector rav;
for(int i=0;i<data.size();i++){
- int binSize = getNumNames(data[i]);
+ int binSize = m->getNumNames(data[i]);
rav.push_back(binSize);
}
return rav;
}
catch(exception& e) {
- errorOut(e, "ListVector", "getRAbundVector");
+ m->errorOut(e, "ListVector", "getRAbundVector");
exit(1);
}
}
SAbundVector sav(maxRank+1);
for(int i=0;i<data.size();i++){
- int binSize = getNumNames(data[i]);
+ int binSize = m->getNumNames(data[i]);
sav.set(binSize, sav.get(binSize) + 1);
}
sav.set(0, 0);
return sav;
}
catch(exception& e) {
- errorOut(e, "ListVector", "getSAbundVector");
+ m->errorOut(e, "ListVector", "getSAbundVector");
exit(1);
}
}
OrderVector ov;
for(int i=0;i<data.size();i++){
- int binSize = getNumNames(data[i]);
+ int binSize = m->getNumNames(data[i]);
for(int j=0;j<binSize;j++){
ov.push_back(i);
}
}
else{
if(orderMap->count(seqName) == 0){
- mothurOut(seqName + " not found, check *.names file\n");
+ m->mothurOut(seqName + " not found, check *.names file\n");
exit(1);
}
}
if(orderMap->count(seqName) == 0){
- mothurOut(seqName + " not found, check *.names file\n");
+ m->mothurOut(seqName + " not found, check *.names file\n");
exit(1);
}
ov.set((*orderMap)[seqName], i);
}
}
catch(exception& e) {
- errorOut(e, "ListVector", "getOrderVector");
+ m->errorOut(e, "ListVector", "getOrderVector");
exit(1);
}
}