\r
R.n = 2*n-1;\r
R.lgn = lg(n);\r
- fprintf(stderr,"Size of the result set : %i elements, %li kB\n", n,\r
- (((R.n+W-1)/W)*sizeof(int)/1024));\r
+ //fprintf(stderr,"Size of the result set : %i elements, %li kB\n", n,\r
+ //(((R.n+W-1)/W)*sizeof(int)/1024));\r
R.tree = (int*) malloc (((R.n+W-1)/W)*sizeof(int));\r
clearBit(R.tree,0); // clear all\r
return R;\r