X-Git-Url: http://git.nguyen.vg/gitweb/?a=blobdiff_plain;f=libcds%2Fsrc%2Fstatic_sequence%2Fwt_node_internal.cpp;h=2219e9b616fba503cfd67263098d6f34b7c167d3;hb=05fd88499f496b8585622bee8b3f13a442f6bd6e;hp=d39ea4b126be3f11cd79adc1b2363ad6e1a82cb4;hpb=816fe5fd2e5c2ef306227c6870a45b026b923f2e;p=SXSI%2FXMLTree.git diff --git a/libcds/src/static_sequence/wt_node_internal.cpp b/libcds/src/static_sequence/wt_node_internal.cpp index d39ea4b..2219e9b 100644 --- a/libcds/src/static_sequence/wt_node_internal.cpp +++ b/libcds/src/static_sequence/wt_node_internal.cpp @@ -138,6 +138,95 @@ wt_node_internal::wt_node_internal(uchar * symbols, uint n, uint l, wt_coder * c delete [] right; } +wt_node_internal::wt_node_internal(uchar * symbols, uint n, uint l, wt_coder * c, static_bitsequence_builder * bmb, uint left, uint *done) { + uint * ibitmap = new uint[n/W+1]; + for(uint i=0;iis_set((uint)symbols[i + left],l)) + bitset(ibitmap,i); + bitmap = bmb->build(ibitmap, n); + delete [] ibitmap; + + uint count_right = bitmap->rank1(n-1); + uint count_left = n-count_right; +/* uchar * leftarr = new uchar[count_left+1]; + uchar * rightarr = new uchar[count_right+1]; + count_right = count_left = 0; + for(uint i=0;iaccess(i)) { + rightarr[count_right++]=symbols[i+left]; + } + else { + leftarr[count_left++]=symbols[i+left]; + } + } +*/ + + for (uint i=0;iis_set(swap,l)) + j = bitmap->rank0(k)-1; + else + j = count_left + bitmap->rank1(k)-1; + uchar temp = symbols[j+left]; + symbols[j+left] = swap; + swap = temp; + set_field(done,1,k+left,1); + } + + while (get_field(done,1,i+left)) + ++i; + } + + // checking + /* for (uint i=0;iis_set(symbols[i+left], l)) + { + std::cout << symbols[i+left] << " != " << leftarr[i] << " lev = " << l << "\n"; + exit(0); + } + for (uint i=count_left;iis_set(symbols[i+left],l)) + std::cout << symbols[i+left] << " != " << rightarr[i-count_left] << " lev = " << l << "\n"; + */ + bool match_left = true, match_right = true; + for (uint i=1; i < count_left; i++) + if (symbols[i+left] != symbols[i+left-1]) + match_left = false; + for (uint i=count_left + 1; i < n; i++) + if (symbols[i+left] != symbols[i+left-1]) + match_right = false; + + + if(count_left>0) { + if(match_left/* && c->done(left[0],l+1)*/) + left_child = new wt_node_leaf((uint)symbols[left], count_left); + else + left_child = new wt_node_internal(symbols, count_left, l+1, c, bmb, left, done); + } else { + left_child = NULL; + } + if(count_right>0) { + if(match_right/* && c->done(right[0],l+1)*/) + right_child = new wt_node_leaf((uint)symbols[left+count_left], count_right); + else + right_child = new wt_node_internal(symbols, count_right, l+1, c, bmb, left+count_left, done); + } else { + right_child = NULL; + } +} + wt_node_internal::wt_node_internal() { }