7 #define mymalloc(p,n,f) {p =(__typeof__(p)) malloc((n)*sizeof(*p)); msize += (f)*(n)*sizeof(*p); /* if (f) printf("malloc %d bytes at line %d total %d\n",(n)*sizeof(*p),__LINE__,msize); */ if ((p)==NULL) {printf("not enough memory (%d bytes) in line %d\n",msize,__LINE__); exit(1);};}
\r
9 int postorder_select_bsearch(bp *b,int s);
\r
11 int naive_depth(bp *b, int s)
\r
14 if (s < 0) return 0;
\r
16 for (i=0; i<=s; i++) {
\r
17 if (getbit(b->B,i)==OP) {
\r
26 void printbp(bp *b, int s, int t)
\r
30 for (i=s; i<=t; i++) {
\r
31 if (getbit(b->B,i)==OP) {
\r
42 int *matchtbl,*parenttbl;
\r
43 void make_naivetbl(pb *B,int n)
\r
48 mymalloc(matchtbl,n,0);
\r
49 mymalloc(parenttbl,n,0);
\r
50 mymalloc(stack,n,0);
\r
52 for (i=0; i<n; i++) matchtbl[i] = parenttbl[i] = -1;
\r
57 for (i=0; i<n; i++) {
\r
58 if (getbit(B,i)==OP) {
\r
61 parenttbl[i] = stack[v-1];
\r
66 matchtbl[stack[v]] = i; // close
\r
67 matchtbl[i] = stack[v]; // open
\r
76 int popCount[1<<ETW];
\r
77 int fwdtbl[(2*ETW+1)*(1<<ETW)];
\r
78 int bwdtbl[(2*ETW+1)*(1<<ETW)];
\r
80 int mintbl_li[1<<ETW], mintbl_lv[1<<ETW];
\r
81 int mintbl_ri[1<<ETW], mintbl_rv[1<<ETW];
\r
82 int maxtbl_li[1<<ETW], maxtbl_lv[1<<ETW];
\r
83 int maxtbl_ri[1<<ETW], maxtbl_rv[1<<ETW];
\r
85 int minmaxtbl_i[4][1<<ETW], minmaxtbl_v[4][1<<ETW];
\r
87 int degtbl2[(2*ETW+1)*(1<<ETW)];
\r
88 int childtbl[(ETW)*(1<<ETW)];
\r
89 int childtbl2[2*ETW+1][ETW][(1<<ETW)];
\r
90 int depthtbl[(2*ETW+1)*(1<<ETW)];
\r
92 void make_matchtbl(void)
\r
99 for (x = 0; x < (1<<ETW); x++) {
\r
100 setbits(buf,0,ETW,x);
\r
101 for (r=-ETW; r<=ETW; r++) fwdtbl[((r+ETW)<<ETW)+x] = ETW;
\r
102 for (r=-ETW; r<=ETW; r++) bwdtbl[((r+ETW)<<ETW)+x] = ETW;
\r
103 for (r=-ETW; r<=ETW; r++) degtbl2[((r+ETW)<<ETW)+x] = 0;
\r
104 for (r=-ETW; r<=ETW; r++) depthtbl[((r+ETW)<<ETW)+x] = 0;
\r
107 for (i=0; i<ETW; i++) {
\r
108 if (getbit(buf,i)==OP) {
\r
113 if (fwdtbl[((r+ETW)<<ETW)+x] == ETW) fwdtbl[((r+ETW)<<ETW)+x] = i;
\r
117 for (i=ETW-1; i>=0; i--) {
\r
118 if (getbit(buf,i)==OP) {
\r
123 if (bwdtbl[((r+ETW)<<ETW)+x] == ETW) bwdtbl[((r+ETW)<<ETW)+x] = ETW-1-i;
\r
127 for (i=0; i<ETW; i++) {
\r
128 if (getbit(buf,i)==OP) {
\r
133 depthtbl[((r+ETW)<<ETW)+x] += (1<<(ETW-1));
\r
137 for (i=0; i<ETW; i++) {
\r
138 if (getbit(buf,i)==OP) r++;
\r
142 r = 0; m = 0; M = 0;
\r
143 m = ETW+1; M = -ETW-1;
\r
144 //maxtbl_lv[x] = -ETW-1;
\r
145 //mintbl_lv[x] = ETW+1;
\r
146 minmaxtbl_v[OPT_MAX | OPT_LEFT][x] = -ETW-1;
\r
147 minmaxtbl_v[OPT_MIN | OPT_LEFT][x] = ETW+1;
\r
149 for (i=0; i<ETW; i++) {
\r
150 if (getbit(buf,i)==OP) {
\r
154 //maxtbl_li[x] = i; maxtbl_lv[x] = r;
\r
155 minmaxtbl_i[OPT_MAX | OPT_LEFT][x] = i;
\r
156 minmaxtbl_v[OPT_MAX | OPT_LEFT][x] = r;
\r
162 childtbl[((deg-1)<<ETW) + x] = i;
\r
166 //mintbl_li[x] = i; mintbl_lv[x] = r;
\r
167 minmaxtbl_i[OPT_MIN | OPT_LEFT][x] = i;
\r
168 minmaxtbl_v[OPT_MIN | OPT_LEFT][x] = r;
\r
170 childtbl[((deg-1)<<ETW) + x] = i;
\r
173 if (r <= m) degtbl2[((r+ETW)<<ETW)+x]++;
\r
177 r = 0; m = 0; M = 0;
\r
178 //maxtbl_rv[x] = -ETW-1;
\r
179 //mintbl_rv[x] = ETW+1;
\r
180 minmaxtbl_v[OPT_MAX | OPT_RIGHT][x] = -ETW-1;
\r
181 minmaxtbl_v[OPT_MIN | OPT_RIGHT][x] = ETW+1;
\r
182 for (i=0; i<ETW; i++) {
\r
183 if (getbit(buf,i)==OP) {
\r
187 //maxtbl_ri[x] = i; maxtbl_rv[x] = r;
\r
188 minmaxtbl_i[OPT_MAX | OPT_RIGHT][x] = i;
\r
189 minmaxtbl_v[OPT_MAX | OPT_RIGHT][x] = r;
\r
195 //mintbl_ri[x] = i; mintbl_rv[x] = r;
\r
196 minmaxtbl_i[OPT_MIN | OPT_RIGHT][x] = i;
\r
197 minmaxtbl_v[OPT_MIN | OPT_RIGHT][x] = r;
\r
202 for (i = 0; i < ETW; i++) {
\r
203 for (j = -ETW; j <= ETW; j++) {
\r
204 childtbl2[j+ETW][i][x] = -1;
\r
208 for (j=-ETW; j<=ETW; j++) {
\r
212 for (i = 0; i < ETW; i++) {
\r
213 if (getbit(buf,i)==OP) {
\r
220 childtbl2[j+ETW][ith-1][x] = i;
\r
230 int bp_construct(bp *b,int n, pb *B, int opt)
\r
240 int r; // # of minimum values
\r
244 printf("warning: SB=%d should be a multiple of D=%d\n",SB,D);
\r
245 // not necessarily?
\r
247 if (SB % RRR != 0) {
\r
248 printf("warning: SB=%d should be a multiple of RRR=%d\n",SB,RRR);
\r
263 b->da_inorder = NULL;
\r
264 b->da_postorder = NULL;
\r
265 b->da_dfuds_leaf = NULL;
\r
266 mymalloc(b->da,1,0);
\r
267 darray_construct(b->da,n,B, opt & OPT_FAST_PREORDER_SELECT);
\r
268 b->idx_size += b->da->idx_size;
\r
269 printf("preorder rank/select table: %d bytes (%1.2f bpc)\n",b->da->idx_size,(double)b->da->idx_size*8/n);
\r
274 mymalloc(sm, ns, 0); b->idx_size += ns * sizeof(*sm);
\r
275 mymalloc(sM, ns, 0); b->idx_size += ns * sizeof(*sM);
\r
278 if (opt & OPT_DEGREE) {
\r
279 mymalloc(sd, ns, 0); b->idx_size += ns * sizeof(*sd);
\r
281 printf("SB degree table: %d bytes (%1.2f bpc)\n",ns * sizeof(*sd), (double)ns * sizeof(*sd) * 8/n);
\r
283 printf("SB table: %d bytes (%1.2f bpc)\n",ns * sizeof(*sm) * 2, (double)ns * sizeof(*sm)*2 * 8/n);
\r
285 for (i=0; i<n; i++) {
\r
299 if (i % SB == SB-1 || i==n-1) {
\r
300 ds = depth(b,(i/SB)*SB-1);
\r
301 if (m - ds + SB < 0 || m - ds + SB > 255) {
\r
302 printf("error m=%d ds=%d\n",m,ds);
\r
304 if (M - ds + 1 < 0 || M - ds + 1 > 255) {
\r
305 printf("error M=%d ds=%d\n",M,ds);
\r
307 sm[i/SB] = m - ds + SB;
\r
308 sM[i/SB] = M - ds + 1;
\r
309 if (opt & OPT_DEGREE) sd[i/SB] = r;
\r
315 for (i=0;i<n/SB;i++) printf("%d ",sd[i]);
\r
321 m_ofs = 1 << blog(nm-1);
\r
324 mymalloc(mm, nm + m_ofs, 0); b->idx_size += (nm+m_ofs) * sizeof(*mm);
\r
325 mymalloc(mM, nm + m_ofs, 0); b->idx_size += (nm+m_ofs) * sizeof(*mM);
\r
328 if (opt & OPT_DEGREE) {
\r
329 mymalloc(md, nm + m_ofs, 0); b->idx_size += (nm+m_ofs) * sizeof(*md);
\r
331 printf("MB degree table: %d bytes (%1.2f bpc)\n",(nm+m_ofs) * sizeof(*md), (double)(nm+m_ofs) * sizeof(*md) * 8/n);
\r
333 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
335 for (i=0; i<n; i++) {
\r
348 if (i % MB == MB-1 || i==n-1) {
\r
349 mm[m_ofs+ i/MB] = m;
\r
350 mM[m_ofs+ i/MB] = M;
\r
351 if (opt & OPT_DEGREE) md[m_ofs+ i/MB] = r;
\r
355 for (j=m_ofs-1; j > 0; j--) {
\r
357 if (j*2 < nm + m_ofs) m = mm[j*2];
\r
358 if (j*2+1 < nm + m_ofs) m = min(m,mm[j*2+1]);
\r
360 if (j*2 < nm + m_ofs) M = mM[j*2];
\r
361 if (j*2+1 < nm + m_ofs) M = max(M,mM[j*2+1]);
\r
362 mm[j] = m; mM[j] = M;
\r
363 if (opt & OPT_DEGREE) {
\r
365 if (j*2 < nm + m_ofs) d = md[j*2];
\r
366 if (j*2+1 < nm + m_ofs) {
\r
367 if (mm[j*2] == mm[j*2+1]) d += md[j*2+1];
\r
368 if (mm[j*2] > mm[j*2+1]) d = md[j*2+1];
\r
375 if (opt & OPT_DEGREE) {
\r
382 for (i=0;i<m_ofs + n/MB;i++) printf("%d ",md[i]);
\r
386 if (opt & OPT_LEAF) {
\r
387 mymalloc(b->da_leaf,1,0);
\r
388 darray_pat_construct(b->da_leaf, n, B, 2, 0x2, opt & OPT_FAST_LEAF_SELECT);
\r
389 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
390 b->idx_size += b->da_leaf->idx_size;
\r
395 if (opt & OPT_INORDER) {
\r
396 mymalloc(b->da_inorder,1,0);
\r
397 darray_pat_construct(b->da_inorder, n, B, 2, 0x1, opt & OPT_FAST_INORDER_SELECT);
\r
398 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
399 b->idx_size += b->da_inorder->idx_size;
\r
401 b->da_inorder = NULL;
\r
404 if (opt & OPT_FAST_POSTORDER_SELECT) {
\r
405 mymalloc(b->da_postorder,1,0);
\r
406 darray_pat_construct(b->da_postorder, n, B, 1, 0x0, (opt & OPT_FAST_POSTORDER_SELECT) | OPT_NO_RANK);
\r
407 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
408 b->idx_size += b->da_postorder->idx_size;
\r
410 b->da_postorder = NULL;
\r
413 if (opt & OPT_DFUDS_LEAF) {
\r
414 mymalloc(b->da_dfuds_leaf,1,0);
\r
415 darray_pat_construct(b->da_dfuds_leaf, n, B, 2, 0x0, opt & OPT_FAST_DFUDS_LEAF_SELECT);
\r
416 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
417 b->idx_size += b->da_dfuds_leaf->idx_size;
\r
419 b->da_dfuds_leaf = NULL;
\r
425 // destroyTree: frees the memory of tree.
\r
426 void destroyTree(bp *b) {
\r
427 if (!b) return; // nothing to free
\r
429 destroyDarray(b->da); // destroys da data structure
\r
430 if (b->da) free(b->da);
\r
432 if (b->sm) free(b->sm);
\r
433 if (b->sM) free(b->sM);
\r
434 if (b->sd) free(b->sd);
\r
435 if (b->mm) free(b->mm);
\r
436 if (b->mM) free(b->mM);
\r
437 if (b->md) free(b->md);
\r
439 destroyDarray(b->da_leaf);
\r
440 if (b->da_leaf) free(b->da_leaf);
\r
442 destroyDarray(b->da_inorder);
\r
443 if (b->da_inorder) free(b->da_inorder);
\r
445 destroyDarray(b->da_postorder);
\r
446 if (b->da_postorder) free(b->da_postorder);
\r
448 destroyDarray(b->da_dfuds_leaf);
\r
449 if (b->da_dfuds_leaf) free(b->da_dfuds_leaf);
\r
453 // saveTree: saves parentheses data structure to file
\r
454 // By Diego Arroyuelo
\r
455 void saveTree(bp *b, FILE *fp) {
\r
457 if (fwrite(&(b->n), sizeof(int), 1, fp) != 1) {
\r
458 printf("Error: cannot save number of parentheses to file\n");
\r
462 if (fwrite(b->B, sizeof(pb), (b->n+D-1)/D, fp) != ((b->n+D-1)/D)) {
\r
463 printf("Error: cannot save parentheses sequence to file\n");
\r
467 if (fwrite(&(b->opt), sizeof(int), 1, fp) != 1) {
\r
468 printf("Error: cannot save opt in parentheses to file\n");
\r
473 // loadTree: load parentheses data structure from file
\r
474 // By Diego Arroyuelo
\r
475 void loadTree(bp *b, FILE *fp) {
\r
480 if (fread(&n, sizeof(int), 1, fp) != 1) {
\r
481 printf("Error: cannot read number of parentheses from file\n");
\r
485 mymalloc(B,(n+D-1)/D,0);
\r
487 if (fread(B, sizeof(pb), (n+D-1)/D, fp) != ((n+D-1)/D)) {
\r
488 printf("Error: cannot read parentheses sequence from file\n");
\r
492 if (fread(&opt, sizeof(int), 1, fp) != 1) {
\r
493 printf("Error: cannot read opt in parentheses from file\n");
\r
497 bp_construct(b, n, B, opt);
\r
503 int naive_fwd_excess(bp *b,int s, int rel)
\r
507 n = b->n; B = b->B;
\r
509 for (i=s+1; i<n; i++) {
\r
510 if (getbit(B,i)==OP) {
\r
515 if (v == rel) return i;
\r
520 int naive_bwd_excess(bp *b,int s, int rel)
\r
526 for (i=s; i>=0; i--) {
\r
527 if (getbit(B,i)==OP) {
\r
532 if (v == rel) return i-1;
\r
537 int naive_search_SB_l(bp *b, int i, int rel)
\r
541 il = (i / SB) * SB;
\r
542 for (; i>=il; i--) {
\r
543 if (getbit(b->B,i)==OP) {
\r
548 if (rel == 0) return i-1;
\r
550 if (i < 0) return -2;
\r
554 int naive_rmq(bp *b, int s, int t,int opt)
\r
558 if (opt & OPT_RIGHT) {
\r
559 d = dm = depth(b,t); im = t;
\r
562 if (getbit(b->B,i+1)==CP) {
\r
564 if (opt & OPT_MAX) {
\r
571 if (!(opt & OPT_MAX)) {
\r
580 d = dm = depth(b,s); im = s;
\r
583 if (getbit(b->B,i)==OP) {
\r
585 if (opt & OPT_MAX) {
\r
592 if (!(opt & OPT_MAX)) {
\r
604 int root_node(bp *b)
\r
610 int rank_open(bp *b, int s)
\r
612 return darray_rank(b->da,s);
\r
615 int rank_close(bp *b, int s)
\r
617 return s+1 - darray_rank(b->da,s);
\r
620 int select_open(bp *b, int s)
\r
622 if (b->opt & OPT_FAST_PREORDER_SELECT) {
\r
623 return darray_select(b->da,s,1);
\r
625 return darray_select_bsearch(b->da,s,getpat_preorder);
\r
629 int select_close(bp *b, int s)
\r
631 if (b->opt & OPT_FAST_POSTORDER_SELECT) {
\r
632 return darray_pat_select(b->da_postorder,s,getpat_postorder);
\r
634 return postorder_select_bsearch(b,s);
\r
638 ///////////////////////////////////////////
\r
639 // find_close(bp *b,int s)
\r
640 // returns the matching close parenthesis of s
\r
641 ///////////////////////////////////////////
\r
642 int find_close(bp *b,int s)
\r
644 return fwd_excess(b,s,-1);
\r
647 ///////////////////////////////////////////
\r
648 // find_open(bp *b,int s)
\r
649 // returns the matching open parenthesis of s
\r
650 ///////////////////////////////////////////
\r
651 int find_open(bp *b,int s)
\r
654 r = bwd_excess(b,s,0);
\r
655 if (r >= -1) return r+1;
\r
659 ///////////////////////////////////////////
\r
660 // parent(bp *b,int s)
\r
661 // returns the parent of s
\r
662 // -1 if s is the root
\r
663 ///////////////////////////////////////////
\r
664 int parent(bp *b,int s)
\r
667 r = bwd_excess(b,s,-2);
\r
668 if (r >= -1) return r+1;
\r
672 int enclose(bp *b,int s)
\r
674 return parent(b,s);
\r
677 ///////////////////////////////////////////
\r
678 // level_ancestor(bp *b,int s,int d)
\r
679 // returns the ancestor of s with relative depth d (d < 0)
\r
680 // -1 if no such node
\r
681 ///////////////////////////////////////////
\r
682 int level_ancestor(bp *b,int s,int d)
\r
685 r = bwd_excess(b,s,d-1);
\r
686 if (r >= -1) return r+1;
\r
690 ///////////////////////////////////////////
\r
691 // lca(bp *b, int s, int t)
\r
692 // returns the lowest common ancestor of s and t
\r
693 ///////////////////////////////////////////
\r
694 int lca(bp *b, int s, int t)
\r
696 return parent(b,rmq(b,s,t,0)+1);
\r
700 ///////////////////////////////////////////
\r
701 // preorder_rank(bp *b,int s)
\r
702 // returns the preorder (>= 1) of node s (s >= 0)
\r
703 ///////////////////////////////////////////
\r
704 int preorder_rank(bp *b,int s)
\r
706 return darray_rank(b->da,s);
\r
709 ///////////////////////////////////////////
\r
710 // preorder_select(bp *b,int s)
\r
711 // returns the node with preorder s (s >= 1)
\r
712 // -1 if no such node
\r
713 ///////////////////////////////////////////
\r
714 int preorder_select(bp *b,int s)
\r
716 // no error handling
\r
717 if (b->opt & OPT_FAST_PREORDER_SELECT) {
\r
718 return darray_select(b->da,s,1);
\r
720 return darray_select_bsearch(b->da,s,getpat_preorder);
\r
724 ///////////////////////////////////////////
\r
725 // postorder_rank(bp *b,int s)
\r
726 // returns the postorder (>= 1) of node s (s >= 0)
\r
727 // -1 if s-th bit is not OP
\r
728 ///////////////////////////////////////////
\r
729 int postorder_rank(bp *b,int s)
\r
732 if (inspect(b,s) == CP) return -1;
\r
733 t = find_close(b,s);
\r
734 // return t+1 - darray_rank(b->da,t);
\r
735 return rank_close(b,t);
\r
738 int postorder_select_bsearch(bp *b,int s)
\r
742 if (s == 0) return -1;
\r
744 if (s > b->da->n - b->da->m) {
\r
747 l = 0; r = b->da->n - 1;
\r
751 //printf("m=%d rank=%d s=%d\n",m,m+1 - darray_rank(b->da,m),s);
\r
752 if (m+1 - darray_rank(b->da,m) >= s) {
\r
761 ///////////////////////////////////////////
\r
762 // postorder_select(bp *b,int s)
\r
763 // returns the position of CP of the node with postorder s (>= 1)
\r
764 ///////////////////////////////////////////
\r
765 int postorder_select(bp *b,int s)
\r
768 if (b->opt & OPT_FAST_POSTORDER_SELECT) {
\r
769 return darray_pat_select(b->da_postorder,s,getpat_postorder);
\r
771 return postorder_select_bsearch(b->da,s);
\r
774 return select_close(b,s);
\r
778 ///////////////////////////////////////////
\r
779 // leaf_rank(bp *b,int s)
\r
780 // returns the number of leaves to the left of s
\r
781 ///////////////////////////////////////////
\r
782 int leaf_rank(bp *b,int s)
\r
784 if ((b->opt & OPT_LEAF) == 0) {
\r
785 printf("leaf_rank: error!!! not supported\n");
\r
791 return darray_pat_rank(b->da_leaf,s,getpat_leaf);
\r
794 ///////////////////////////////////////////
\r
795 // leaf_select(bp *b,int s)
\r
796 // returns the position of s-th leaf
\r
797 ///////////////////////////////////////////
\r
798 int leaf_select(bp *b,int s)
\r
800 if ((b->opt & OPT_LEAF) == 0) {
\r
801 printf("leaf_select: error!!! not supported\n");
\r
804 if (s > b->da_leaf->m) return -1;
\r
805 if (b->opt & OPT_FAST_LEAF_SELECT) {
\r
806 return darray_pat_select(b->da_leaf,s,getpat_leaf);
\r
808 return darray_select_bsearch(b->da_leaf,s,getpat_leaf);
\r
813 ///////////////////////////////////////////
\r
814 // inorder_rank(bp *b,int s)
\r
815 // returns the number of ")(" (s >= 0)
\r
816 ///////////////////////////////////////////
\r
817 int inorder_rank(bp *b,int s)
\r
819 if ((b->opt & OPT_INORDER) == 0) {
\r
820 printf("inorder_rank: error!!! not supported\n");
\r
826 return darray_pat_rank(b->da_inorder,s,getpat_inorder);
\r
829 ///////////////////////////////////////////
\r
830 // inorder_select(bp *b,int s)
\r
831 // returns the s-th position of ")(" (s >= 1)
\r
832 ///////////////////////////////////////////
\r
833 int inorder_select(bp *b,int s)
\r
835 if ((b->opt & OPT_INORDER) == 0) {
\r
836 printf("inorder_select: error!!! not supported\n");
\r
839 if (b->opt & OPT_FAST_INORDER_SELECT) {
\r
840 return darray_pat_select(b->da_inorder,s,getpat_inorder);
\r
842 return darray_select_bsearch(b->da_inorder,s,getpat_inorder);
\r
846 ///////////////////////////////////////////
\r
847 // leftmost_leaf(bp *b, int s)
\r
848 ///////////////////////////////////////////
\r
849 int leftmost_leaf(bp *b, int s)
\r
851 if ((b->opt & OPT_LEAF) == 0) {
\r
852 printf("leftmost_leaf: error!!! not supported\n");
\r
855 return leaf_select(b,leaf_rank(b,s)+1);
\r
858 ///////////////////////////////////////////
\r
859 // rightmost_leaf(bp *b, int s)
\r
860 ///////////////////////////////////////////
\r
861 int rightmost_leaf(bp *b, int s)
\r
864 if ((b->opt & OPT_LEAF) == 0) {
\r
865 printf("leftmost_leaf: error!!! not supported\n");
\r
868 t = find_close(b,s);
\r
869 return leaf_select(b,leaf_rank(b,t));
\r
874 ///////////////////////////////////////////
\r
875 // inspect(bp *b, int s)
\r
876 // returns OP (==1) or CP (==0) at s-th bit (0 <= s < n)
\r
877 ///////////////////////////////////////////
\r
878 int inspect(bp *b, int s)
\r
880 if (s < 0 || s >= b->n) {
\r
881 printf("inspect: error s=%d is out of [%d,%d]\n",s,0,b->n-1);
\r
883 return getbit(b->B,s);
\r
886 int isleaf(bp *b, int s)
\r
888 if (inspect(b,s) != OP) {
\r
889 printf("isleaf: error!!! B[%d] = OP\n",s);
\r
891 if (inspect(b,s+1) == CP) return 1;
\r
896 ///////////////////////////////////////////
\r
897 // subtree_size(bp *b, int s)
\r
898 // returns the number of nodes in the subtree of s
\r
899 ///////////////////////////////////////////
\r
900 int subtree_size(bp *b, int s)
\r
902 return (find_close(b,s) - s + 1) / 2;
\r
905 ///////////////////////////////////////////
\r
906 // first_child(bp *b, int s)
\r
907 // returns the first child
\r
908 // -1 if s is a leaf
\r
909 ///////////////////////////////////////////
\r
910 int first_child(bp *b, int s)
\r
912 if (inspect(b,s+1) == CP) return -1;
\r
916 ///////////////////////////////////////////
\r
917 // next_sibling(bp *b,int s)
\r
918 // returns the next sibling of parent(s)
\r
919 // -1 if s is the last child
\r
920 //////////////////////////////////////////
\r
921 int next_sibling(bp *b, int s)
\r
924 t = find_close(b,s)+1;
\r
926 printf("next_sibling: error s=%d t=%d\n",s,t);
\r
928 if (inspect(b,t) == CP) return -1;
\r
932 ///////////////////////////////////////////
\r
933 // prev_sibling(bp *b,int s)
\r
934 // returns the previous sibling of parent(s)
\r
935 // -1 if s is the first child
\r
936 //////////////////////////////////////////
\r
937 int prev_sibling(bp *b, int s)
\r
941 printf("prev_sibling: error s=%d\n",s);
\r
943 if (s == 0) return -1;
\r
944 if (inspect(b,s-1) == OP) return -1;
\r
945 t = find_open(b,s-1);
\r
949 ///////////////////////////////////////////
\r
950 // deepest_node(bp *b,int s)
\r
951 // returns the first node with the largest depth in the subtree of s
\r
952 ///////////////////////////////////////////
\r
953 int deepest_node(bp *b,int s)
\r
956 t = find_close(b,s);
\r
957 m = rmq(b,s,t, OPT_MAX);
\r
961 ///////////////////////////////////////////
\r
962 // subtree_height(bp *b,int s)
\r
963 // returns the height of the subtree of s
\r
964 // 0 if s is a leaf
\r
965 ///////////////////////////////////////////
\r
966 int subtree_height(bp *b,int s)
\r
969 t = deepest_node(b,s);
\r
970 return depth(b,t) - depth(b,s);
\r
973 int naive_degree(bp *b, int s)
\r
977 t = first_child(b,s);
\r
980 t = next_sibling(b,t);
\r
985 ///////////////////////////////////////////
\r
986 // degree(bp *b, int s)
\r
987 // returns the number of children of s
\r
988 // 0 if s is a leaf
\r
989 ///////////////////////////////////////////
\r
990 int degree(bp *b, int s)
\r
992 if (b->opt & OPT_DEGREE) {
\r
993 return fast_degree(b,s,b->n,0);
\r
995 return naive_degree(b,s);
\r
999 int naive_child(bp *b, int s, int d)
\r
1002 t = first_child(b,s);
\r
1003 for (i = 1; i < d; i++) {
\r
1004 if (t == -1) break;
\r
1005 t = next_sibling(b,t);
\r
1010 ///////////////////////////////////////////
\r
1011 // child(bp *b, int s, int d)
\r
1012 // returns the d-th child of s (1 <= d <= degree(s))
\r
1013 // -1 if no such node
\r
1014 ///////////////////////////////////////////
\r
1015 int child(bp *b, int s, int d)
\r
1018 if (b->opt & OPT_DEGREE) {
\r
1019 //return find_open(b,fast_degree(b,s,b->n,d));
\r
1020 if (d==1) return first_child(b,s);
\r
1021 r = fast_degree(b,s,b->n,d-1)+1;
\r
1022 if (inspect(b,r) == CP) return -1;
\r
1025 return naive_child(b,s,d);
\r
1031 int naive_child_rank(bp *b, int t)
\r
1037 t = prev_sibling(b,t);
\r
1042 ///////////////////////////////////////////
\r
1043 // child_rank(bp *b, int t)
\r
1044 // returns d if t is the d-th child of the parent of t (d >= 1)
\r
1045 // 1 if t is the root
\r
1046 ///////////////////////////////////////////
\r
1047 int child_rank(bp *b, int t)
\r
1050 if (t == root_node(b)) return 1;
\r
1051 if (b->opt & OPT_DEGREE) {
\r
1053 return fast_degree(b,r,t,0)+1;
\r
1055 return naive_child_rank(b,t);
\r
1061 ///////////////////////////////////////////
\r
1062 // is_ancestor(bp *b, int s, int t)
\r
1063 // returns 1 if s is an ancestor of t
\r
1065 ///////////////////////////////////////////
\r
1066 int is_ancestor(bp *b, int s, int t)
\r
1069 v = find_close(b,s);
\r
1070 if (s <= t && t <= v) return 1;
\r
1074 ///////////////////////////////////////////
\r
1075 // distance(bp *b, int s, int t)
\r
1076 // returns the length of the shortest path from s to t in the tree
\r
1077 ///////////////////////////////////////////
\r
1078 int distance(bp *b, int s, int t)
\r
1083 return (depth(b,s) - d) + (depth(b,t) - d);
\r
1086 ///////////////////////////////////////////
\r
1087 // level_next(bp *b, int d)
\r
1088 ///////////////////////////////////////////
\r
1089 int level_next(bp *b,int s)
\r
1092 t = fwd_excess(b,s,0);
\r
1096 ///////////////////////////////////////////
\r
1097 // level_prev(bp *b, int d)
\r
1098 ///////////////////////////////////////////
\r
1099 int level_prev(bp *b,int s)
\r
1102 t = bwd_excess(b,s,0);
\r
1106 ///////////////////////////////////////////
\r
1107 // level_leftmost(bp *b, int d)
\r
1108 ///////////////////////////////////////////
\r
1109 int level_leftmost(bp *b, int d)
\r
1112 if (d < 1) return -1;
\r
1113 if (d == 1) return 0;
\r
1114 t = fwd_excess(b,0,d);
\r
1118 ///////////////////////////////////////////
\r
1119 // level_rigthmost(bp *b, int d)
\r
1120 ///////////////////////////////////////////
\r
1121 int level_rigthmost(bp *b, int d)
\r
1124 if (d < 1) return -1;
\r
1125 if (d == 1) return 0;
\r
1126 t = bwd_excess(b,0,d-1);
\r
1127 return find_open(b,t);
\r
1130 ///////////////////////////////////////////
\r
1131 // leaf_size(bp *b, int s)
\r
1132 ///////////////////////////////////////////
\r
1133 int leaf_size(bp *b, int s)
\r
1136 if ((b->opt & OPT_LEAF) == 0) {
\r
1137 printf("leaf_size: error!!! not supported\n");
\r
1140 t = find_close(b,s);
\r
1141 return leaf_rank(b,t) - leaf_rank(b,s);
\r