X-Git-Url: https://git.donarmstrong.com/?p=mothur.git;a=blobdiff_plain;f=mothur.h;h=32f4778a7c1ee19db25eeb4e1eafaf74fabcd617;hp=25b803fa393e27d0c2811e62efdeb042ce390dec;hb=d1c97b8c04bb75faca1e76ffad60b37a4d789d3d;hpb=f687723a8357916e86a05116978e6869b039ce36

diff --git a/mothur.h b/mothur.h
index 25b803f..32f4778 100644
--- a/mothur.h
+++ b/mothur.h
@@ -127,6 +127,21 @@ struct PDistCell{
 	PDistCell() :  index(0), dist(0) {};
 	PDistCell(ull c, float d) :  index(c), dist(d) {}
 };
+/***********************************************************************/
+struct consTax{
+	string name;
+    string taxonomy;
+    int abundance;
+	consTax() :  name(""), taxonomy("unknown"), abundance(0) {};
+	consTax(string n, string t, int a) :  name(n), taxonomy(t), abundance(a) {}
+};
+/***********************************************************************/
+struct consTax2{
+    string taxonomy;
+    int abundance;
+	consTax2() :  taxonomy("unknown"), abundance(0) {};
+	consTax2(string t, int a) :  taxonomy(t), abundance(a) {}
+};
 /************************************************************/
 struct clusterNode {
 	int numSeq;
@@ -158,6 +173,15 @@ struct seqPriorityNode {
 	seqPriorityNode(int n, string s, string nm) : numIdentical(n), seq(s), name(nm) {}
 	~seqPriorityNode() {}
 };
+/************************************************************/
+struct compGroup {
+	string group1;
+	string group2;
+	compGroup() {}
+	compGroup(string s, string nm) : group1(s), group2(nm) {}
+    string getCombo() { return group1+"-"+group2; }
+	~compGroup() {}
+};
 /***************************************************************/
 struct spearmanRank {
 	string name;
@@ -170,20 +194,21 @@ inline bool compareIndexes(PDistCell left, PDistCell right){
 	return (left.index > right.index);	
 }
 //********************************************************************************************************************
-//sorts highest to lowest
 inline bool compareSpearman(spearmanRank left, spearmanRank right){
 	return (left.score < right.score);	
 } 
 //********************************************************************************************************************
 //sorts highest to lowest
 inline bool compareSeqPriorityNodes(seqPriorityNode left, seqPriorityNode right){
-	return (left.numIdentical > right.numIdentical);	
-} 
-//********************************************************************************************************************
-//sorts lowest to highest
-inline bool compareSpearmanReverse(spearmanRank left, spearmanRank right){
-	return (left.score < right.score);	
+	if (left.numIdentical > right.numIdentical) {
+        return true;
+    }else if (left.numIdentical == right.numIdentical) {
+        if (left.seq > right.seq) { return true; }
+        else { return false; }
+    }
+    return false;	
 } 
+ 
 /************************************************************/
 //sorts lowest to highest
 inline bool compareDistLinePairs(distlinePair left, distlinePair right){
@@ -193,7 +218,15 @@ inline bool compareDistLinePairs(distlinePair left, distlinePair right){
 //sorts lowest to highest
 inline bool compareSequenceDistance(seqDist left, seqDist right){
 	return (left.dist < right.dist);	
-} 
+}
+//********************************************************************************************************************
+//returns sign of double
+inline double sign(double temp){
+	//find sign
+    if (temp > 0)       { return 1.0;   }
+    else if (temp < 0)  { return -1.0;  }
+    return 0;
+}
 /***********************************************************************/
 
 // snagged from http://www.parashift.com/c++-faq-lite/misc-technical-issues.html#faq-39.2