X-Git-Url: https://git.donarmstrong.com/?a=blobdiff_plain;ds=sidebyside;f=mothurout.cpp;h=713bafd0c2a79ec637abdf9d481a0c96c183ee77;hb=d1c97b8c04bb75faca1e76ffad60b37a4d789d3d;hp=bfd1cc1da84a5140869c6766fc1f3de8dc02bf0b;hpb=d39f94cf9bceeae887b211eec862da5c9c77e10d;p=mothur.git

diff --git a/mothurout.cpp b/mothurout.cpp
index bfd1cc1..713bafd 100644
--- a/mothurout.cpp
+++ b/mothurout.cpp
@@ -2864,7 +2864,50 @@ unsigned int MothurOut::fromBase36(string base36){
 	}
 }
 /***********************************************************************/
-
+string  MothurOut::findEdianness() {
+    try {
+        // find real endian type
+        unsigned char EndianTest[2] = {1,0};
+        short x = *(short *)EndianTest;
+        
+        string endianType = "unknown";
+        if(x == 1) { endianType = "BIG_ENDIAN"; }
+        else { endianType = "LITTLE_ENDIAN";    }
+    
+        return endianType;
+    }
+	catch(exception& e) {
+		errorOut(e, "MothurOut", "findEdianness");
+		exit(1);
+	}
+}
+/***********************************************************************/
+double  MothurOut::median(vector<double> x) {
+    try {
+        double value = 0.0;
+        
+        if (x.size() == 0) { } //error
+        else {
+            //For example, if a < b < c, then the median of the list {a, b, c} is b, and, if a < b < c < d, then the median of the list {a, b, c, d} is the mean of b and c; i.e., it is (b + c)/2.
+            sort(x.begin(), x.end());
+            //is x.size even?
+            if ((x.size()%2) == 0) { //size() is even. median = average of 2 midpoints
+                int midIndex1 = (x.size()/2)-1;
+                int midIndex2 = (x.size()/2);
+                value = (x[midIndex1]+ x[midIndex2]) / 2.0;
+            }else { 
+                int midIndex = (x.size()/2);
+                value = x[midIndex];
+            }
+        }
+        return value;
+    }
+	catch(exception& e) {
+		errorOut(e, "MothurOut", "median");
+		exit(1);
+	}
+}
+/***********************************************************************/
 int MothurOut::factorial(int num){
 	try {
 		int total = 1;
@@ -3499,7 +3542,7 @@ vector<double> MothurOut::getStandardDeviation(vector< vector<double> >& dists,
         return stdDev;
     }
 	catch(exception& e) {
-		errorOut(e, "MothurOut", "getAverages");		
+		errorOut(e, "MothurOut", "getStandardDeviation");		
 		exit(1);
 	}
 }
@@ -3782,6 +3825,44 @@ double MothurOut::getStandardDeviation(vector<int>& featureVector){
 	}
 }
 /**************************************************************************************************/
+// returns largest value in vector
+double MothurOut::max(vector<double>& featureVector){
+    try {
+        if (featureVector.size() == 0) { mothurOut("[ERROR]: vector size = 0!\n"); control_pressed=true; return 0.0; }
+        
+        //finds largest
+        double largest = featureVector[0];
+        for (int i = 1; i < featureVector.size(); i++) {
+            if (featureVector[i] > largest) { largest = featureVector[i]; }
+        }
+                
+        return largest;
+    }
+	catch(exception& e) {
+		errorOut(e, "MothurOut", "max");
+		exit(1);
+	}
+}
+/**************************************************************************************************/
+// returns smallest value in vector
+double MothurOut::min(vector<double>& featureVector){
+    try {
+        if (featureVector.size() == 0) { mothurOut("[ERROR]: vector size = 0!\n"); control_pressed=true; return 0.0; }
+        
+        //finds smallest
+        double smallest = featureVector[0];
+        for (int i = 1; i < featureVector.size(); i++) {
+            if (featureVector[i] < smallest) { smallest = featureVector[i]; }
+        }
+        
+        return smallest;
+    }
+	catch(exception& e) {
+		errorOut(e, "MothurOut", "min");
+		exit(1);
+	}
+}
+/**************************************************************************************************/