#define mask31 0x0000001F
/** max function */
-#define max(x,y) ((x)>(y)?(x):(y))
+//#define max(x,y) ((x)>(y)?(x):(y))
/** min function */
-#define min(x,y) ((x)<(y)?(x):(y))
+//#define min(x,y) ((x)<(y)?(x):(y))
/** number of bits in a uint */
*/
#include <iostream>
+#include <algorithm>
#include <sstream>
#include <basics.h>
#include <static_bitsequence.h>
for(uint i=0;i<len && !error;i++) {
//cout << "i="<<i<< endl;
if(i>0) {
- if(i%max(1,(bs->length()/100))==0) { cout << "."; cout.flush(); }
- if(i%max(1,(bs->length()/10))==0) { cout << endl; cout.flush(); }
+ if(i%max((uint)1,(bs->length()/100))==0) { cout << "."; cout.flush(); }
+ if(i%max((uint)1,(bs->length()/10))==0) { cout << endl; cout.flush(); }
}
if(bitget(bitseq,i)) ones++;
if(bs->access(i) != (bitget(bitseq,i)!=0)) {
occ[i] = 0;
bool error = false;
for(uint i=0;i<n && !error;i++) {
- if(i!=0 && i%max(1,(n-1)/100)==0) { cout << "."; cout.flush(); }
- if(i!=0 && i%max(1,(n-1)/10)==0) cout << endl;
+ if(i!=0 && i%max((uint)1,(n-1)/100)==0) { cout << "."; cout.flush(); }
+ if(i!=0 && i%max((uint)1,(n-1)/10)==0) cout << endl;
occ[symbols[i]]++;
uint a = /*symbols[i]; /*/ss->access(i);
uint r = /*occ[symbols[i]];/*/ss->rank(symbols[i],i);