10 * Created by Sarah Westcott on 2/19/09.
11 * Copyright 2009 Schloss Lab UMASS Amherst. All rights reserved.
15 /* This file contains all the standard incudes we use in the project as well as some common utilities. */
54 /***********************************************************************/
56 #if defined (__APPLE__) || (__MACH__) || (linux) || (__linux)
59 #include <sys/resource.h>
60 #include <sys/types.h>
65 #include <readline/readline.h>
66 #include <readline/history.h>
70 #include <conio.h> //allows unbuffered screen capture from stdin
71 #include <direct.h> //get cwd
81 #define exp(x) (exp((double) x))
82 #define sqrt(x) (sqrt((double) x))
83 #define log10(x) (log10((double) x))
84 #define log2(x) (log10(x)/log10(2))
85 #define isnan(x) ((x) != (x))
86 #define isinf(x) (fabs(x) == std::numeric_limits<double>::infinity())
88 typedef unsigned long ull;
98 IntNode(int lv, int rv, IntNode* l, IntNode* r) : lvalue(lv), rvalue(rv), left(l), right(r) {};
108 /************************************************************/
112 int smallChild; //used to make linkTable work with list and rabund. represents bin number of this cluster node
113 clusterNode(int num, int par, int kid) : numSeq(num), parent(par), smallChild(kid) {};
115 /************************************************************/
121 seqDist(int s1, int s2, float d) : seq1(s1), seq2(s2), dist(d) {}
124 /************************************************************/
125 struct distlinePair {
130 /************************************************************/
131 struct seqPriorityNode {
136 seqPriorityNode(int n, string s, string nm) : numIdentical(n), seq(s), name(nm) {}
137 ~seqPriorityNode() {}
139 /***************************************************************/
140 struct spearmanRank {
144 spearmanRank(string n, float s) : name(n), score(s) {}
146 //********************************************************************************************************************
147 //sorts highest to lowest
148 inline bool compareSpearman(spearmanRank left, spearmanRank right){
149 return (left.score > right.score);
151 //********************************************************************************************************************
152 //sorts highest to lowest
153 inline bool compareSeqPriorityNodes(seqPriorityNode left, seqPriorityNode right){
154 return (left.numIdentical > right.numIdentical);
156 //********************************************************************************************************************
157 //sorts lowest to highest
158 inline bool compareSpearmanReverse(spearmanRank left, spearmanRank right){
159 return (left.score < right.score);
161 /************************************************************/
162 //sorts lowest to highest
163 inline bool compareDistLinePairs(distlinePair left, distlinePair right){
164 return (left.end < right.end);
166 //********************************************************************************************************************
167 //sorts lowest to highest
168 inline bool compareSequenceDistance(seqDist left, seqDist right){
169 return (left.dist < right.dist);
171 /***********************************************************************/
173 // snagged from http://www.parashift.com/c++-faq-lite/misc-technical-issues.html#faq-39.2
174 // works for now, but there should be a way to do it without killing the whole program
176 class BadConversion : public runtime_error {
178 BadConversion(const string& s) : runtime_error(s){ }
181 //**********************************************************************************************************************
183 void convert(const string& s, T& x, bool failIfLeftoverChars = true){
187 if (!(i >> x) || (failIfLeftoverChars && i.get(c)))
188 throw BadConversion(s);
192 //**********************************************************************************************************************
195 bool convertTestFloat(const string& s, T& x, bool failIfLeftoverChars = true){
199 if (!(i >> x) || (failIfLeftoverChars && i.get(c)))
207 //**********************************************************************************************************************
210 bool convertTest(const string& s, T& x, bool failIfLeftoverChars = true){
214 if (!(i >> x) || (failIfLeftoverChars && i.get(c)))
221 //**********************************************************************************************************************
223 string toString(const T&x){
231 //**********************************************************************************************************************
234 string toHex(const T&x){
243 //**********************************************************************************************************************
246 string toString(const T&x, int i){
251 output << fixed << x;
256 //**********************************************************************************************************************
259 T fromString(const string& s){
260 istringstream stream (s);
266 //**********************************************************************************************************************