#include <map>
#include <string>
#include <list>
+#include <string.h>
//math
#include <cmath>
#include <sys/wait.h>
#include <sys/time.h>
#include <sys/resource.h>
+ #include <sys/types.h>
+ #include <sys/stat.h>
#include <unistd.h>
#ifdef USE_READLINE
#include <direct.h> //get cwd
#include <windows.h>
#include <psapi.h>
-
+ #include <direct.h>
#endif
using namespace std;
};
/************************************************************/
+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) {}
+};
+//********************************************************************************************************************
+//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);
+}
+/************************************************************/
//sorts lowest to highest
inline bool compareDistLinePairs(distlinePair left, distlinePair right){
return (left.end < right.end);
}
//**********************************************************************************************************************
+template<class T>
+T fromString(const string& s){
+ istringstream stream (s);
+ T t;
+ stream >> t;
+ return t;
+}
+
+//**********************************************************************************************************************
+
#endif