X-Git-Url: http://git.nguyen.vg/gitweb/?a=blobdiff_plain;f=bp.c;h=ebb98dcca1ec8851b6fb8eaade39504268b503da;hb=149ded5acd5eb350de9ed118ddb1ba359c984c3f;hp=9058ec804b153f51dbb7593c0136900538d32c97;hpb=0bf9688e2615a9fc07860c5762240e4ce26ee5d3;p=SXSI%2FXMLTree.git

diff --git a/bp.c b/bp.c
index 9058ec8..ebb98dc 100644
--- a/bp.c
+++ b/bp.c
@@ -266,7 +266,8 @@ int bp_construct(bp *b,int n, pb *B, int opt)
   mymalloc(b->da,1,0);
   darray_construct(b->da,n,B, opt & OPT_FAST_PREORDER_SELECT);
   b->idx_size += b->da->idx_size;
-  printf("preorder rank/select table: %d bytes (%1.2f bpc)\n",b->da->idx_size,(double)b->da->idx_size*8/n);
+  //Kim : commented this and the following ones, they polute the printing of the query answer
+  //printf("preorder rank/select table: %d bytes (%1.2f bpc)\n",b->da->idx_size,(double)b->da->idx_size*8/n);
 
   make_matchtbl();
 
@@ -278,9 +279,9 @@ int bp_construct(bp *b,int n, pb *B, int opt)
   if (opt & OPT_DEGREE) {
     mymalloc(sd, ns, 0);  b->idx_size += ns * sizeof(*sd);
     b->sd = sd;
-    printf("SB degree table: %d bytes (%1.2f bpc)\n",ns * sizeof(*sd), (double)ns * sizeof(*sd) * 8/n);
+    //printf("SB degree table: %d bytes (%1.2f bpc)\n",ns * sizeof(*sd), (double)ns * sizeof(*sd) * 8/n);
   }
-  printf("SB table: %d bytes (%1.2f bpc)\n",ns * sizeof(*sm) * 2, (double)ns * sizeof(*sm)*2 * 8/n);
+  //printf("SB table: %d bytes (%1.2f bpc)\n",ns * sizeof(*sm) * 2, (double)ns * sizeof(*sm)*2 * 8/n);
 
   for (i=0; i<n; i++) {
     if (i % SB == 0) {
@@ -328,9 +329,9 @@ int bp_construct(bp *b,int n, pb *B, int opt)
   if (opt & OPT_DEGREE) {
     mymalloc(md, nm + m_ofs, 0);  b->idx_size += (nm+m_ofs) * sizeof(*md);
     b->md = md;
-    printf("MB degree table: %d bytes (%1.2f bpc)\n",(nm+m_ofs) * sizeof(*md), (double)(nm+m_ofs) * sizeof(*md) * 8/n);
+    //printf("MB degree table: %d bytes (%1.2f bpc)\n",(nm+m_ofs) * sizeof(*md), (double)(nm+m_ofs) * sizeof(*md) * 8/n);
   }
-  printf("MB table: %d bytes (%1.2f bpc)\n",(nm+m_ofs) * sizeof(*mm) * 2, (double)(nm+m_ofs) * sizeof(*mm)*2 * 8/n);
+  //printf("MB table: %d bytes (%1.2f bpc)\n",(nm+m_ofs) * sizeof(*mm) * 2, (double)(nm+m_ofs) * sizeof(*mm)*2 * 8/n);
 
   for (i=0; i<n; i++) {
     d = depth(b,i);
@@ -404,7 +405,7 @@ int bp_construct(bp *b,int n, pb *B, int opt)
   if (opt & OPT_FAST_POSTORDER_SELECT) {
     mymalloc(b->da_postorder,1,0);
     darray_pat_construct(b->da_postorder, n, B, 1, 0x0, (opt & OPT_FAST_POSTORDER_SELECT) | OPT_NO_RANK);
-    printf("postorder rank/select table: %d bytes (%1.2f bpc)\n",b->da_postorder->idx_size,(double)b->da_postorder->idx_size*8/n);
+    //printf("postorder rank/select table: %d bytes (%1.2f bpc)\n",b->da_postorder->idx_size,(double)b->da_postorder->idx_size*8/n);
     b->idx_size += b->da_postorder->idx_size;
   } else {
     b->da_postorder = NULL;
@@ -413,7 +414,7 @@ int bp_construct(bp *b,int n, pb *B, int opt)
   if (opt & OPT_DFUDS_LEAF) {
     mymalloc(b->da_dfuds_leaf,1,0);
     darray_pat_construct(b->da_dfuds_leaf, n, B, 2, 0x0, opt & OPT_FAST_DFUDS_LEAF_SELECT);
-    printf("dfuds leaf rank/select table: %d bytes (%1.2f bpc)\n",b->da_dfuds_leaf->idx_size,(double)b->da_dfuds_leaf->idx_size*8/n);
+    //printf("dfuds leaf rank/select table: %d bytes (%1.2f bpc)\n",b->da_dfuds_leaf->idx_size,(double)b->da_dfuds_leaf->idx_size*8/n);
     b->idx_size += b->da_dfuds_leaf->idx_size;
   } else {
     b->da_dfuds_leaf = NULL;