mymalloc(b->da,1,0);\r
darray_construct(b->da,n,B, opt & OPT_FAST_PREORDER_SELECT);\r
b->idx_size += b->da->idx_size;\r
- //Kim : commented this and the following ones, they polute the printing of the query answer\r
+ //Kim: comment this and the following, they polute the printing of the xpath library\r
//printf("preorder rank/select table: %d bytes (%1.2f bpc)\n",b->da->idx_size,(double)b->da->idx_size*8/n);\r
\r
make_matchtbl();\r
if (opt & OPT_LEAF) {\r
mymalloc(b->da_leaf,1,0);\r
darray_pat_construct(b->da_leaf, n, B, 2, 0x2, opt & OPT_FAST_LEAF_SELECT);\r
- printf("leaf rank/select table: %d bytes (%1.2f bpc)\n",b->da_leaf->idx_size,(double)b->da_leaf->idx_size*8/n);\r
+ //printf("leaf rank/select table: %d bytes (%1.2f bpc)\n",b->da_leaf->idx_size,(double)b->da_leaf->idx_size*8/n);\r
b->idx_size += b->da_leaf->idx_size; \r
} else {\r
b->da_leaf = NULL;\r
if (opt & OPT_INORDER) {\r
mymalloc(b->da_inorder,1,0);\r
darray_pat_construct(b->da_inorder, n, B, 2, 0x1, opt & OPT_FAST_INORDER_SELECT);\r
- printf("inorder rank/select table: %d bytes (%1.2f bpc)\n",b->da_inorder->idx_size,(double)b->da_inorder->idx_size*8/n);\r
+ //printf("inorder rank/select table: %d bytes (%1.2f bpc)\n",b->da_inorder->idx_size,(double)b->da_inorder->idx_size*8/n);\r
b->idx_size += b->da_inorder->idx_size;\r
} else {\r
b->da_inorder = NULL;\r