+/************************************************************/
+struct seqPriorityNode {
+ int numIdentical;
+ string seq;
+ string name;
+ seqPriorityNode() {}
+ seqPriorityNode(int n, string s, string nm) : numIdentical(n), seq(s), name(nm) {}
+ ~seqPriorityNode() {}
+};
+/***************************************************************/
+struct spearmanRank {
+ string name;
+ float score;
+
+ spearmanRank(string n, float s) : name(n), score(s) {}
+};
+//***********************************************************************
+inline bool compareIndexes(PDistCell left, PDistCell right){
+ return (left.index > right.index);
+}
+//********************************************************************************************************************
+inline bool compareSpearman(spearmanRank left, spearmanRank right){
+ return (left.score < right.score);
+}
+//********************************************************************************************************************
+//sorts highest to lowest
+inline bool compareSeqPriorityNodes(seqPriorityNode left, seqPriorityNode right){
+ 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;
+}
+