10 #define mymalloc(p,n,f) { \
\r
11 p = (__typeof__(p)) malloc((n)*sizeof(*p)); \
\r
12 if ((p)==NULL) {printf("not enough memory (%d bytes) in line %d\n",msize,__LINE__); \
\r
14 msize += (f)*(n)*sizeof(*p); \
\r
17 int postorder_select_bsearch(bp *b,int s);
\r
19 int naive_depth(bp *b, int s)
\r
22 if (s < 0) return 0;
\r
24 for (i=0; i<=s; i++) {
\r
25 if (getbit(b->B,i)==OP) {
\r
34 void printbp(bp *b, int s, int t)
\r
38 for (i=s; i<=t; i++) {
\r
39 if (getbit(b->B,i)==OP) {
\r
50 int *matchtbl,*parenttbl;
\r
51 void make_naivetbl(pb *B,int n)
\r
56 mymalloc(matchtbl,n,0);
\r
57 mymalloc(parenttbl,n,0);
\r
58 mymalloc(stack,n,0);
\r
60 for (i=0; i<n; i++) matchtbl[i] = parenttbl[i] = -1;
\r
65 for (i=0; i<n; i++) {
\r
66 if (getbit(B,i)==OP) {
\r
69 parenttbl[i] = stack[v-1];
\r
74 matchtbl[stack[v]] = i; // close
\r
75 matchtbl[i] = stack[v]; // open
\r
84 int popCount[1<<ETW];
\r
85 int fwdtbl[(2*ETW+1)*(1<<ETW)];
\r
86 int bwdtbl[(2*ETW+1)*(1<<ETW)];
\r
88 int mintbl_li[1<<ETW], mintbl_lv[1<<ETW];
\r
89 int mintbl_ri[1<<ETW], mintbl_rv[1<<ETW];
\r
90 int maxtbl_li[1<<ETW], maxtbl_lv[1<<ETW];
\r
91 int maxtbl_ri[1<<ETW], maxtbl_rv[1<<ETW];
\r
93 int minmaxtbl_i[4][1<<ETW], minmaxtbl_v[4][1<<ETW];
\r
95 int degtbl2[(2*ETW+1)*(1<<ETW)];
\r
96 int childtbl[(ETW)*(1<<ETW)];
\r
97 int childtbl2[2*ETW+1][ETW][(1<<ETW)];
\r
98 int depthtbl[(2*ETW+1)*(1<<ETW)];
\r
100 void make_matchtbl(void)
\r
109 for (x = 0; x < (1<<ETW); x++) {
\r
110 setbits(buf,0,ETW,x);
\r
111 for (r=-ETW; r<=ETW; r++) fwdtbl[((r+ETW)<<ETW)+x] = ETW;
\r
112 for (r=-ETW; r<=ETW; r++) bwdtbl[((r+ETW)<<ETW)+x] = ETW;
\r
113 for (r=-ETW; r<=ETW; r++) degtbl2[((r+ETW)<<ETW)+x] = 0;
\r
114 for (r=-ETW; r<=ETW; r++) depthtbl[((r+ETW)<<ETW)+x] = 0;
\r
117 for (i=0; i<ETW; i++) {
\r
118 if (getbit(buf,i)==OP) {
\r
123 if (fwdtbl[((r+ETW)<<ETW)+x] == ETW) fwdtbl[((r+ETW)<<ETW)+x] = i;
\r
127 for (i=ETW-1; i>=0; i--) {
\r
128 if (getbit(buf,i)==OP) {
\r
133 if (bwdtbl[((r+ETW)<<ETW)+x] == ETW) bwdtbl[((r+ETW)<<ETW)+x] = ETW-1-i;
\r
137 for (i=0; i<ETW; i++) {
\r
138 if (getbit(buf,i)==OP) {
\r
143 depthtbl[((r+ETW)<<ETW)+x] += (1<<(ETW-1));
\r
147 for (i=0; i<ETW; i++) {
\r
148 if (getbit(buf,i)==OP) r++;
\r
152 r = 0; m = 0; M = 0;
\r
153 m = ETW+1; M = -ETW-1;
\r
154 //maxtbl_lv[x] = -ETW-1;
\r
155 //mintbl_lv[x] = ETW+1;
\r
156 minmaxtbl_v[OPT_MAX | OPT_LEFT][x] = -ETW-1;
\r
157 minmaxtbl_v[OPT_MIN | OPT_LEFT][x] = ETW+1;
\r
159 for (i=0; i<ETW; i++) {
\r
160 if (getbit(buf,i)==OP) {
\r
164 //maxtbl_li[x] = i; maxtbl_lv[x] = r;
\r
165 minmaxtbl_i[OPT_MAX | OPT_LEFT][x] = i;
\r
166 minmaxtbl_v[OPT_MAX | OPT_LEFT][x] = r;
\r
172 childtbl[((deg-1)<<ETW) + x] = i;
\r
176 //mintbl_li[x] = i; mintbl_lv[x] = r;
\r
177 minmaxtbl_i[OPT_MIN | OPT_LEFT][x] = i;
\r
178 minmaxtbl_v[OPT_MIN | OPT_LEFT][x] = r;
\r
180 childtbl[((deg-1)<<ETW) + x] = i;
\r
183 if (r <= m) degtbl2[((r+ETW)<<ETW)+x]++;
\r
187 r = 0; m = 0; M = 0;
\r
188 //maxtbl_rv[x] = -ETW-1;
\r
189 //mintbl_rv[x] = ETW+1;
\r
190 minmaxtbl_v[OPT_MAX | OPT_RIGHT][x] = -ETW-1;
\r
191 minmaxtbl_v[OPT_MIN | OPT_RIGHT][x] = ETW+1;
\r
192 for (i=0; i<ETW; i++) {
\r
193 if (getbit(buf,i)==OP) {
\r
197 //maxtbl_ri[x] = i; maxtbl_rv[x] = r;
\r
198 minmaxtbl_i[OPT_MAX | OPT_RIGHT][x] = i;
\r
199 minmaxtbl_v[OPT_MAX | OPT_RIGHT][x] = r;
\r
205 //mintbl_ri[x] = i; mintbl_rv[x] = r;
\r
206 minmaxtbl_i[OPT_MIN | OPT_RIGHT][x] = i;
\r
207 minmaxtbl_v[OPT_MIN | OPT_RIGHT][x] = r;
\r
212 for (i = 0; i < ETW; i++) {
\r
213 for (j = -ETW; j <= ETW; j++) {
\r
214 childtbl2[j+ETW][i][x] = -1;
\r
218 for (j=-ETW; j<=ETW; j++) {
\r
222 for (i = 0; i < ETW; i++) {
\r
223 if (getbit(buf,i)==OP) {
\r
230 childtbl2[j+ETW][ith-1][x] = i;
\r
240 int bp_construct(bp *b,int n, pb *B, int opt)
\r
250 int r; // # of minimum values
\r
254 printf("warning: SB=%d should be a multiple of D=%d\n",SB,D);
\r
255 // not necessarily?
\r
257 if (SB % RRR != 0) {
\r
258 printf("warning: SB=%d should be a multiple of RRR=%d\n",SB,RRR);
\r
273 b->da_inorder = NULL;
\r
274 b->da_postorder = NULL;
\r
275 b->da_dfuds_leaf = NULL;
\r
276 mymalloc(b->da,1,0);
\r
277 darray_construct(b->da,n,B, opt & OPT_FAST_PREORDER_SELECT);
\r
278 b->idx_size += b->da->idx_size;
\r
279 //Kim: comment this and the following, they polute the printing of the xpath library
\r
280 //printf("preorder rank/select table: %d bytes (%1.2f bpc)\n",b->da->idx_size,(double)b->da->idx_size*8/n);
\r
285 mymalloc(sm, ns, 0); b->idx_size += ns * sizeof(*sm);
\r
286 mymalloc(sM, ns, 0); b->idx_size += ns * sizeof(*sM);
\r
289 if (opt & OPT_DEGREE) {
\r
290 mymalloc(sd, ns, 0); b->idx_size += ns * sizeof(*sd);
\r
292 //printf("SB degree table: %d bytes (%1.2f bpc)\n",ns * sizeof(*sd), (double)ns * sizeof(*sd) * 8/n);
\r
294 //printf("SB table: %d bytes (%1.2f bpc)\n",ns * sizeof(*sm) * 2, (double)ns * sizeof(*sm)*2 * 8/n);
\r
296 for (i=0; i<n; i++) {
\r
310 if (i % SB == SB-1 || i==n-1) {
\r
311 ds = depth(b,(i/SB)*SB-1);
\r
312 if (m - ds + SB < 0 || m - ds + SB > 255) {
\r
313 printf("error m=%d ds=%d\n",m,ds);
\r
315 if (M - ds + 1 < 0 || M - ds + 1 > 255) {
\r
316 printf("error M=%d ds=%d\n",M,ds);
\r
318 sm[i/SB] = m - ds + SB;
\r
319 sM[i/SB] = M - ds + 1;
\r
320 if (opt & OPT_DEGREE) sd[i/SB] = r;
\r
326 for (i=0;i<n/SB;i++) printf("%d ",sd[i]);
\r
332 m_ofs = 1 << blog(nm-1);
\r
335 mymalloc(mm, nm + m_ofs, 0); b->idx_size += (nm+m_ofs) * sizeof(*mm);
\r
336 mymalloc(mM, nm + m_ofs, 0); b->idx_size += (nm+m_ofs) * sizeof(*mM);
\r
339 if (opt & OPT_DEGREE) {
\r
340 mymalloc(md, nm + m_ofs, 0); b->idx_size += (nm+m_ofs) * sizeof(*md);
\r
342 //printf("MB degree table: %d bytes (%1.2f bpc)\n",(nm+m_ofs) * sizeof(*md), (double)(nm+m_ofs) * sizeof(*md) * 8/n);
\r
344 //printf("MB table: %d bytes (%1.2f bpc)\n",(nm+m_ofs) * sizeof(*mm) * 2, (double)(nm+m_ofs) * sizeof(*mm)*2 * 8/n);
\r
346 for (i=0; i<n; i++) {
\r
359 if (i % MB == MB-1 || i==n-1) {
\r
360 mm[m_ofs+ i/MB] = m;
\r
361 mM[m_ofs+ i/MB] = M;
\r
362 if (opt & OPT_DEGREE) md[m_ofs+ i/MB] = r;
\r
366 for (j=m_ofs-1; j > 0; j--) {
\r
368 if (j*2 < nm + m_ofs) m = mm[j*2];
\r
369 if (j*2+1 < nm + m_ofs) m = min(m,mm[j*2+1]);
\r
371 if (j*2 < nm + m_ofs) M = mM[j*2];
\r
372 if (j*2+1 < nm + m_ofs) M = max(M,mM[j*2+1]);
\r
373 mm[j] = m; mM[j] = M;
\r
374 if (opt & OPT_DEGREE) {
\r
376 if (j*2 < nm + m_ofs) d = md[j*2];
\r
377 if (j*2+1 < nm + m_ofs) {
\r
378 if (mm[j*2] == mm[j*2+1]) d += md[j*2+1];
\r
379 if (mm[j*2] > mm[j*2+1]) d = md[j*2+1];
\r
386 if (opt & OPT_DEGREE) {
\r
393 for (i=0;i<m_ofs + n/MB;i++) printf("%d ",md[i]);
\r
397 if (opt & OPT_LEAF) {
\r
398 mymalloc(b->da_leaf,1,0);
\r
399 darray_pat_construct(b->da_leaf, n, B, 2, 0x2, opt & OPT_FAST_LEAF_SELECT);
\r
400 //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
401 b->idx_size += b->da_leaf->idx_size;
\r
406 if (opt & OPT_INORDER) {
\r
407 mymalloc(b->da_inorder,1,0);
\r
408 darray_pat_construct(b->da_inorder, n, B, 2, 0x1, opt & OPT_FAST_INORDER_SELECT);
\r
409 //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
410 b->idx_size += b->da_inorder->idx_size;
\r
412 b->da_inorder = NULL;
\r
415 if (opt & OPT_FAST_POSTORDER_SELECT) {
\r
416 mymalloc(b->da_postorder,1,0);
\r
417 darray_pat_construct(b->da_postorder, n, B, 1, 0x0, (opt & OPT_FAST_POSTORDER_SELECT) | OPT_NO_RANK);
\r
418 //printf("postorder rank/select table: %d bytes (%1.2f bpc)\n",b->da_postorder->idx_size,(double)b->da_postorder->idx_size*8/n);
\r
419 b->idx_size += b->da_postorder->idx_size;
\r
421 b->da_postorder = NULL;
\r
424 if (opt & OPT_DFUDS_LEAF) {
\r
425 mymalloc(b->da_dfuds_leaf,1,0);
\r
426 darray_pat_construct(b->da_dfuds_leaf, n, B, 2, 0x0, opt & OPT_FAST_DFUDS_LEAF_SELECT);
\r
427 //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);
\r
428 b->idx_size += b->da_dfuds_leaf->idx_size;
\r
430 b->da_dfuds_leaf = NULL;
\r
436 // destroyTree: frees the memory of tree.
\r
437 void destroyTree(bp *b) {
\r
438 if (!b) return; // nothing to free
\r
440 destroyDarray(b->da); // destroys da data structure
\r
441 if (b->da) free(b->da);
\r
443 if (b->sm) free(b->sm);
\r
444 if (b->sM) free(b->sM);
\r
445 if (b->sd) free(b->sd);
\r
446 if (b->mm) free(b->mm);
\r
447 if (b->mM) free(b->mM);
\r
448 if (b->md) free(b->md);
\r
450 destroyDarray(b->da_leaf);
\r
451 if (b->da_leaf) free(b->da_leaf);
\r
453 destroyDarray(b->da_inorder);
\r
454 if (b->da_inorder) free(b->da_inorder);
\r
456 destroyDarray(b->da_postorder);
\r
457 if (b->da_postorder) free(b->da_postorder);
\r
459 destroyDarray(b->da_dfuds_leaf);
\r
460 if (b->da_dfuds_leaf) free(b->da_dfuds_leaf);
\r
464 // saveTree: saves parentheses data structure to file
\r
465 // By Diego Arroyuelo
\r
466 void saveTree(bp *b, FILE *fp) {
\r
468 if (fwrite(&(b->n), sizeof(int), 1, fp) != 1) {
\r
469 printf("Error: cannot save number of parentheses to file\n");
\r
473 if (fwrite(b->B, sizeof(pb), (b->n+D-1)/D, fp) != ((b->n+D-1)/D)) {
\r
474 printf("Error: cannot save parentheses sequence to file\n");
\r
478 if (fwrite(&(b->opt), sizeof(int), 1, fp) != 1) {
\r
479 printf("Error: cannot save opt in parentheses to file\n");
\r
484 // loadTree: load parentheses data structure from file
\r
485 // By Diego Arroyuelo
\r
486 void loadTree(bp *b, FILE *fp) {
\r
491 if (fread(&n, sizeof(int), 1, fp) != 1) {
\r
492 printf("Error: cannot read number of parentheses from file\n");
\r
496 mymalloc(B,(n+D-1)/D,0);
\r
498 if (fread(B, sizeof(pb), (n+D-1)/D, fp) != ((n+D-1)/D)) {
\r
499 printf("Error: cannot read parentheses sequence from file\n");
\r
503 if (fread(&opt, sizeof(int), 1, fp) != 1) {
\r
504 printf("Error: cannot read opt in parentheses from file\n");
\r
508 bp_construct(b, n, B, opt);
\r
514 int naive_fwd_excess(bp *b,int s, int rel)
\r
518 n = b->n; B = b->B;
\r
520 for (i=s+1; i<n; i++) {
\r
521 if (getbit(B,i)==OP) {
\r
526 if (v == rel) return i;
\r
531 int naive_bwd_excess(bp *b,int s, int rel)
\r
537 for (i=s; i>=0; i--) {
\r
538 if (getbit(B,i)==OP) {
\r
543 if (v == rel) return i-1;
\r
548 int naive_search_SB_l(bp *b, int i, int rel)
\r
552 il = (i / SB) * SB;
\r
553 for (; i>=il; i--) {
\r
554 if (getbit(b->B,i)==OP) {
\r
559 if (rel == 0) return i-1;
\r
561 if (i < 0) return -2;
\r
565 int naive_rmq(bp *b, int s, int t,int opt)
\r
569 if (opt & OPT_RIGHT) {
\r
570 d = dm = depth(b,t); im = t;
\r
573 if (getbit(b->B,i+1)==CP) {
\r
575 if (opt & OPT_MAX) {
\r
582 if (!(opt & OPT_MAX)) {
\r
591 d = dm = depth(b,s); im = s;
\r
594 if (getbit(b->B,i)==OP) {
\r
596 if (opt & OPT_MAX) {
\r
603 if (!(opt & OPT_MAX)) {
\r
615 int root_node(bp *b)
\r
621 int rank_open(bp *b, int s)
\r
623 return darray_rank(b->da,s);
\r
626 int rank_close(bp *b, int s)
\r
628 return s+1 - darray_rank(b->da,s);
\r
631 int select_open(bp *b, int s)
\r
633 if (b->opt & OPT_FAST_PREORDER_SELECT) {
\r
634 return darray_select(b->da,s,1);
\r
636 return darray_select_bsearch(b->da,s,getpat_preorder);
\r
640 int select_close(bp *b, int s)
\r
642 if (b->opt & OPT_FAST_POSTORDER_SELECT) {
\r
643 return darray_pat_select(b->da_postorder,s,getpat_postorder);
\r
645 return postorder_select_bsearch(b,s);
\r
649 ///////////////////////////////////////////
\r
650 // find_close(bp *b,int s)
\r
651 // returns the matching close parenthesis of s
\r
652 ///////////////////////////////////////////
\r
653 int find_close(bp *b,int s)
\r
655 return fwd_excess(b,s,-1);
\r
658 ///////////////////////////////////////////
\r
659 // find_open(bp *b,int s)
\r
660 // returns the matching open parenthesis of s
\r
661 ///////////////////////////////////////////
\r
662 int find_open(bp *b,int s)
\r
665 r = bwd_excess(b,s,0);
\r
666 if (r >= -1) return r+1;
\r
670 ///////////////////////////////////////////
\r
671 // parent(bp *b,int s)
\r
672 // returns the parent of s
\r
673 // -1 if s is the root
\r
674 ///////////////////////////////////////////
\r
675 int parent(bp *b,int s)
\r
678 r = bwd_excess(b,s,-2);
\r
679 if (r >= -1) return r+1;
\r
683 int enclose(bp *b,int s)
\r
685 return parent(b,s);
\r
688 ///////////////////////////////////////////
\r
689 // level_ancestor(bp *b,int s,int d)
\r
690 // returns the ancestor of s with relative depth d (d < 0)
\r
691 // -1 if no such node
\r
692 ///////////////////////////////////////////
\r
693 int level_ancestor(bp *b,int s,int d)
\r
696 r = bwd_excess(b,s,d-1);
\r
697 if (r >= -1) return r+1;
\r
701 ///////////////////////////////////////////
\r
702 // lca(bp *b, int s, int t)
\r
703 // returns the lowest common ancestor of s and t
\r
704 ///////////////////////////////////////////
\r
705 int lca(bp *b, int s, int t)
\r
707 return parent(b,rmq(b,s,t,0)+1);
\r
711 ///////////////////////////////////////////
\r
712 // preorder_rank(bp *b,int s)
\r
713 // returns the preorder (>= 1) of node s (s >= 0)
\r
714 ///////////////////////////////////////////
\r
715 int preorder_rank(bp *b,int s)
\r
717 return darray_rank(b->da,s);
\r
720 ///////////////////////////////////////////
\r
721 // preorder_select(bp *b,int s)
\r
722 // returns the node with preorder s (s >= 1)
\r
723 // -1 if no such node
\r
724 ///////////////////////////////////////////
\r
725 int preorder_select(bp *b,int s)
\r
727 // no error handling
\r
728 if (b->opt & OPT_FAST_PREORDER_SELECT) {
\r
729 return darray_select(b->da,s,1);
\r
731 return darray_select_bsearch(b->da,s,getpat_preorder);
\r
735 ///////////////////////////////////////////
\r
736 // postorder_rank(bp *b,int s)
\r
737 // returns the postorder (>= 1) of node s (s >= 0)
\r
738 // -1 if s-th bit is not OP
\r
739 ///////////////////////////////////////////
\r
740 int postorder_rank(bp *b,int s)
\r
743 if (inspect(b,s) == CP) return -1;
\r
744 t = find_close(b,s);
\r
745 // return t+1 - darray_rank(b->da,t);
\r
746 return rank_close(b,t);
\r
749 int postorder_select_bsearch(bp *b,int s)
\r
753 if (s == 0) return -1;
\r
755 if (s > b->da->n - b->da->m) {
\r
758 l = 0; r = b->da->n - 1;
\r
762 //printf("m=%d rank=%d s=%d\n",m,m+1 - darray_rank(b->da,m),s);
\r
763 if (m+1 - darray_rank(b->da,m) >= s) {
\r
772 ///////////////////////////////////////////
\r
773 // postorder_select(bp *b,int s)
\r
774 // returns the position of CP of the node with postorder s (>= 1)
\r
775 ///////////////////////////////////////////
\r
776 int postorder_select(bp *b,int s)
\r
779 if (b->opt & OPT_FAST_POSTORDER_SELECT) {
\r
780 return darray_pat_select(b->da_postorder,s,getpat_postorder);
\r
782 return postorder_select_bsearch(b->da,s);
\r
785 return select_close(b,s);
\r
789 ///////////////////////////////////////////
\r
790 // leaf_rank(bp *b,int s)
\r
791 // returns the number of leaves to the left of s
\r
792 ///////////////////////////////////////////
\r
793 int leaf_rank(bp *b,int s)
\r
795 if ((b->opt & OPT_LEAF) == 0) {
\r
796 printf("leaf_rank: error!!! not supported\n");
\r
802 return darray_pat_rank(b->da_leaf,s,getpat_leaf);
\r
805 ///////////////////////////////////////////
\r
806 // leaf_select(bp *b,int s)
\r
807 // returns the position of s-th leaf
\r
808 ///////////////////////////////////////////
\r
809 int leaf_select(bp *b,int s)
\r
811 if ((b->opt & OPT_LEAF) == 0) {
\r
812 printf("leaf_select: error!!! not supported\n");
\r
815 if (s > b->da_leaf->m) return -1;
\r
816 if (b->opt & OPT_FAST_LEAF_SELECT) {
\r
817 return darray_pat_select(b->da_leaf,s,getpat_leaf);
\r
819 return darray_select_bsearch(b->da_leaf,s,getpat_leaf);
\r
824 ///////////////////////////////////////////
\r
825 // inorder_rank(bp *b,int s)
\r
826 // returns the number of ")(" (s >= 0)
\r
827 ///////////////////////////////////////////
\r
828 int inorder_rank(bp *b,int s)
\r
830 if ((b->opt & OPT_INORDER) == 0) {
\r
831 printf("inorder_rank: error!!! not supported\n");
\r
837 return darray_pat_rank(b->da_inorder,s,getpat_inorder);
\r
840 ///////////////////////////////////////////
\r
841 // inorder_select(bp *b,int s)
\r
842 // returns the s-th position of ")(" (s >= 1)
\r
843 ///////////////////////////////////////////
\r
844 int inorder_select(bp *b,int s)
\r
846 if ((b->opt & OPT_INORDER) == 0) {
\r
847 printf("inorder_select: error!!! not supported\n");
\r
850 if (b->opt & OPT_FAST_INORDER_SELECT) {
\r
851 return darray_pat_select(b->da_inorder,s,getpat_inorder);
\r
853 return darray_select_bsearch(b->da_inorder,s,getpat_inorder);
\r
857 ///////////////////////////////////////////
\r
858 // leftmost_leaf(bp *b, int s)
\r
859 ///////////////////////////////////////////
\r
860 int leftmost_leaf(bp *b, int s)
\r
862 if ((b->opt & OPT_LEAF) == 0) {
\r
863 printf("leftmost_leaf: error!!! not supported\n");
\r
866 return leaf_select(b,leaf_rank(b,s)+1);
\r
869 ///////////////////////////////////////////
\r
870 // rightmost_leaf(bp *b, int s)
\r
871 ///////////////////////////////////////////
\r
872 int rightmost_leaf(bp *b, int s)
\r
875 if ((b->opt & OPT_LEAF) == 0) {
\r
876 printf("leftmost_leaf: error!!! not supported\n");
\r
879 t = find_close(b,s);
\r
880 return leaf_select(b,leaf_rank(b,t));
\r
885 ///////////////////////////////////////////
\r
886 // inspect(bp *b, int s)
\r
887 // returns OP (==1) or CP (==0) at s-th bit (0 <= s < n)
\r
888 ///////////////////////////////////////////
\r
889 int inspect(bp *b, int s)
\r
891 if (s < 0 || s >= b->n) {
\r
892 printf("inspect: error s=%d is out of [%d,%d]\n",s,0,b->n-1);
\r
894 return getbit(b->B,s);
\r
897 int isleaf(bp *b, int s)
\r
899 if (inspect(b,s) != OP) {
\r
900 printf("isleaf: error!!! B[%d] = OP\n",s);
\r
902 if (inspect(b,s+1) == CP) return 1;
\r
907 ///////////////////////////////////////////
\r
908 // subtree_size(bp *b, int s)
\r
909 // returns the number of nodes in the subtree of s
\r
910 ///////////////////////////////////////////
\r
911 int subtree_size(bp *b, int s)
\r
913 return (find_close(b,s) - s + 1) / 2;
\r
916 ///////////////////////////////////////////
\r
917 // first_child(bp *b, int s)
\r
918 // returns the first child
\r
919 // -1 if s is a leaf
\r
920 ///////////////////////////////////////////
\r
921 int first_child(bp *b, int s)
\r
923 if (inspect(b,s+1) == CP) return -1;
\r
927 ///////////////////////////////////////////
\r
928 // next_sibling(bp *b,int s)
\r
929 // returns the next sibling of parent(s)
\r
930 // -1 if s is the last child
\r
931 //////////////////////////////////////////
\r
932 int next_sibling(bp *b, int s)
\r
935 t = find_close(b,s)+1;
\r
937 printf("next_sibling: error s=%d t=%d\n",s,t);
\r
939 if (inspect(b,t) == CP) return -1;
\r
943 ///////////////////////////////////////////
\r
944 // prev_sibling(bp *b,int s)
\r
945 // returns the previous sibling of parent(s)
\r
946 // -1 if s is the first child
\r
947 //////////////////////////////////////////
\r
948 int prev_sibling(bp *b, int s)
\r
952 printf("prev_sibling: error s=%d\n",s);
\r
954 if (s == 0) return -1;
\r
955 if (inspect(b,s-1) == OP) return -1;
\r
956 t = find_open(b,s-1);
\r
960 ///////////////////////////////////////////
\r
961 // deepest_node(bp *b,int s)
\r
962 // returns the first node with the largest depth in the subtree of s
\r
963 ///////////////////////////////////////////
\r
964 int deepest_node(bp *b,int s)
\r
967 t = find_close(b,s);
\r
968 m = rmq(b,s,t, OPT_MAX);
\r
972 ///////////////////////////////////////////
\r
973 // subtree_height(bp *b,int s)
\r
974 // returns the height of the subtree of s
\r
975 // 0 if s is a leaf
\r
976 ///////////////////////////////////////////
\r
977 int subtree_height(bp *b,int s)
\r
980 t = deepest_node(b,s);
\r
981 return depth(b,t) - depth(b,s);
\r
984 int naive_degree(bp *b, int s)
\r
988 t = first_child(b,s);
\r
991 t = next_sibling(b,t);
\r
996 ///////////////////////////////////////////
\r
997 // degree(bp *b, int s)
\r
998 // returns the number of children of s
\r
999 // 0 if s is a leaf
\r
1000 ///////////////////////////////////////////
\r
1001 int degree(bp *b, int s)
\r
1003 if (b->opt & OPT_DEGREE) {
\r
1004 return fast_degree(b,s,b->n,0);
\r
1006 return naive_degree(b,s);
\r
1010 int naive_child(bp *b, int s, int d)
\r
1013 t = first_child(b,s);
\r
1014 for (i = 1; i < d; i++) {
\r
1015 if (t == -1) break;
\r
1016 t = next_sibling(b,t);
\r
1021 ///////////////////////////////////////////
\r
1022 // child(bp *b, int s, int d)
\r
1023 // returns the d-th child of s (1 <= d <= degree(s))
\r
1024 // -1 if no such node
\r
1025 ///////////////////////////////////////////
\r
1026 int child(bp *b, int s, int d)
\r
1029 if (b->opt & OPT_DEGREE) {
\r
1030 //return find_open(b,fast_degree(b,s,b->n,d));
\r
1031 if (d==1) return first_child(b,s);
\r
1032 r = fast_degree(b,s,b->n,d-1)+1;
\r
1033 if (inspect(b,r) == CP) return -1;
\r
1036 return naive_child(b,s,d);
\r
1042 int naive_child_rank(bp *b, int t)
\r
1048 t = prev_sibling(b,t);
\r
1053 ///////////////////////////////////////////
\r
1054 // child_rank(bp *b, int t)
\r
1055 // returns d if t is the d-th child of the parent of t (d >= 1)
\r
1056 // 1 if t is the root
\r
1057 ///////////////////////////////////////////
\r
1058 int child_rank(bp *b, int t)
\r
1061 if (t == root_node(b)) return 1;
\r
1062 if (b->opt & OPT_DEGREE) {
\r
1064 return fast_degree(b,r,t,0)+1;
\r
1066 return naive_child_rank(b,t);
\r
1072 ///////////////////////////////////////////
\r
1073 // is_ancestor(bp *b, int s, int t)
\r
1074 // returns 1 if s is an ancestor of t
\r
1076 ///////////////////////////////////////////
\r
1077 int is_ancestor(bp *b, int s, int t)
\r
1080 v = find_close(b,s);
\r
1081 if (s <= t && t <= v) return 1;
\r
1085 ///////////////////////////////////////////
\r
1086 // distance(bp *b, int s, int t)
\r
1087 // returns the length of the shortest path from s to t in the tree
\r
1088 ///////////////////////////////////////////
\r
1089 int distance(bp *b, int s, int t)
\r
1094 return (depth(b,s) - d) + (depth(b,t) - d);
\r
1097 ///////////////////////////////////////////
\r
1098 // level_next(bp *b, int d)
\r
1099 ///////////////////////////////////////////
\r
1100 int level_next(bp *b,int s)
\r
1103 t = fwd_excess(b,s,0);
\r
1107 ///////////////////////////////////////////
\r
1108 // level_prev(bp *b, int d)
\r
1109 ///////////////////////////////////////////
\r
1110 int level_prev(bp *b,int s)
\r
1113 t = bwd_excess(b,s,0);
\r
1117 ///////////////////////////////////////////
\r
1118 // level_leftmost(bp *b, int d)
\r
1119 ///////////////////////////////////////////
\r
1120 int level_leftmost(bp *b, int d)
\r
1123 if (d < 1) return -1;
\r
1124 if (d == 1) return 0;
\r
1125 t = fwd_excess(b,0,d);
\r
1129 ///////////////////////////////////////////
\r
1130 // level_rigthmost(bp *b, int d)
\r
1131 ///////////////////////////////////////////
\r
1132 int level_rigthmost(bp *b, int d)
\r
1135 if (d < 1) return -1;
\r
1136 if (d == 1) return 0;
\r
1137 t = bwd_excess(b,0,d-1);
\r
1138 return find_open(b,t);
\r
1141 ///////////////////////////////////////////
\r
1142 // leaf_size(bp *b, int s)
\r
1143 ///////////////////////////////////////////
\r
1144 int leaf_size(bp *b, int s)
\r
1147 if ((b->opt & OPT_LEAF) == 0) {
\r
1148 printf("leaf_size: error!!! not supported\n");
\r
1151 t = find_close(b,s);
\r
1152 return leaf_rank(b,t) - leaf_rank(b,s);
\r