1 /* wt_node_internal.cpp
2 * Copyright (C) 2008, Francisco Claude, all rights reserved.
6 * This library is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU Lesser General Public
8 * License as published by the Free Software Foundation; either
9 * version 2.1 of the License, or (at your option) any later version.
11 * This library is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * Lesser General Public License for more details.
16 * You should have received a copy of the GNU Lesser General Public
17 * License along with this library; if not, write to the Free Software
18 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
22 #include <wt_node_internal.h>
24 wt_node_internal::wt_node_internal(uint * symbols, uint n, uint l, wt_coder * c, static_bitsequence_builder * bmb) {
25 uint * ibitmap = new uint[n/W+1];
26 for(uint i=0;i<n/W+1;i++)
29 if(c->is_set(symbols[i],l))
31 bitmap = bmb->build(ibitmap, n);
33 uint count_right = bitmap->rank1(n-1);
34 uint count_left = n-count_right+1;
35 uint * left = new uint[count_left+1];
36 uint * right = new uint[count_right+1];
37 count_right = count_left = 0;
38 bool match_left = true, match_right = true;
39 for(uint i=0;i<n;i++) {
40 if(bitmap->access(i)) {
41 right[count_right++]=symbols[i];
43 if(right[count_right-1]!=right[count_right-2])
47 left[count_left++]=symbols[i];
49 if(left[count_left-1]!=left[count_left-2])
54 if(match_left/* && c->done(left[0],l+1)*/)
55 left_child = new wt_node_leaf(left[0], count_left);
57 left_child = new wt_node_internal(left, count_left, l+1, c, bmb);
62 if(match_right/* && c->done(right[0],l+1)*/)
63 right_child = new wt_node_leaf(right[0], count_right);
65 right_child = new wt_node_internal(right, count_right, l+1, c, bmb);
73 wt_node_internal::wt_node_internal(uchar * symbols, uint n, uint l, wt_coder * c, static_bitsequence_builder * bmb, uint left, uint *done) {
74 uint * ibitmap = new uint[n/W+1];
75 for(uint i=0;i<n/W+1;i++)
78 if(c->is_set((uint)symbols[i + left],l))
80 bitmap = bmb->build(ibitmap, n);
83 uint count_right = bitmap->rank1(n-1);
84 uint count_left = n-count_right;
86 for (uint i=0;i<n;i++)
87 set_field(done, 1, i+left, 0);
89 for (uint i = 0; i < n; )
92 uchar swap = symbols[j+left];
93 while (!get_field(done, 1, j+left)) { // swapping
95 if (!c->is_set(swap,l))
96 j = bitmap->rank0(k)-1;
98 j = count_left + bitmap->rank1(k)-1;
99 uchar temp = symbols[j+left];
100 symbols[j+left] = swap;
102 set_field(done,1,k+left,1);
105 while (get_field(done,1,i+left))
109 bool match_left = true, match_right = true;
110 for (uint i=1; i < count_left; i++)
111 if (symbols[i+left] != symbols[i+left-1])
113 for (uint i=count_left + 1; i < n; i++)
114 if (symbols[i+left] != symbols[i+left-1])
119 if(match_left/* && c->done(left[0],l+1)*/)
120 left_child = new wt_node_leaf((uint)symbols[left], count_left);
122 left_child = new wt_node_internal(symbols, count_left, l+1, c, bmb, left, done);
127 if(match_right/* && c->done(right[0],l+1)*/)
128 right_child = new wt_node_leaf((uint)symbols[left+count_left], count_right);
130 right_child = new wt_node_internal(symbols, count_right, l+1, c, bmb, left+count_left, done);
137 wt_node_internal::wt_node_internal() { }
139 wt_node_internal::~wt_node_internal() {
141 if(right_child!=NULL) delete right_child;
142 if(left_child!=NULL) delete left_child;
145 uint wt_node_internal::rank(uint symbol, uint pos, uint l, wt_coder * c) {
146 bool is_set = c->is_set(symbol,l);
148 if(left_child==NULL) return 0;
149 return left_child->rank(symbol, bitmap->rank0(pos)-1,l+1,c);
152 if(right_child==NULL) return 0;
153 return right_child->rank(symbol, bitmap->rank1(pos)-1,l+1,c);
157 // return value is rank of symbol (less or equal to the given symbol) that has rank > 0,
158 // the parameter symbol is updated accordinly
159 uint wt_node_internal::rankLessThan(uint &symbol, uint pos)
164 // cout << "pos = " << pos << ", symbol = " << symbol << endl;
168 if(right_child!=NULL)
169 result = right_child->rankLessThan(symbol, bitmap->rank1(pos)-1);
170 if(result == (uint)-1 && left_child!=NULL)
171 return left_child->rankLessThan(symbol, bitmap->rank0(pos)-1);
176 uint wt_node_internal::select(uint symbol, uint pos, uint l, wt_coder * c) {
177 bool is_set = c->is_set(symbol, l);
182 uint new_pos = left_child->select(symbol, pos, l+1,c);
183 if(new_pos+1==0) return (uint)(-1);
184 ret = bitmap->select0(new_pos)+1;
186 if(right_child==NULL)
188 uint new_pos = right_child->select(symbol, pos, l+1,c);
189 if(new_pos+1==0) return (uint)(-1);
190 ret = bitmap->select1(new_pos)+1;
192 if(ret==0) return (uint)-1;
196 uint wt_node_internal::access(uint pos) {
197 bool is_set = bitmap->access(pos);
199 assert(left_child!=NULL);
200 return left_child->access(bitmap->rank0(pos)-1);
202 assert(right_child!=NULL);
203 return right_child->access(bitmap->rank1(pos)-1);
207 // Returns the value at given position and its rank
208 uint wt_node_internal::access(uint pos, uint &rank)
210 bool is_set = bitmap->access(pos);
214 pos = bitmap->rank0(pos)-1;
215 return left_child->access(pos, rank);
220 pos = bitmap->rank1(pos)-1;
221 return right_child->access(pos, rank);
226 void wt_node_internal::access(vector<int> &result, uint i, uint j, uint min, uint max, uint l, uint pivot)
228 uint symbol = pivot | (1 << l);
229 // std::cout << "At l = " << l << ", [" << i << ", " << j << "], [" << min << ", " << max << "], symbol = " << symbol << std::endl;
231 if (j < i || max < min)
239 newi = bitmap->rank0(i - 1);
240 uint newj = bitmap->rank0(j);
242 uint newmax = max < symbol - 1 ? max : symbol - 1;
243 if (left_child != NULL && newj > 0)
244 left_child->access(result, newi, newj-1, min, newmax, l-1, pivot);
252 newi = bitmap->rank1(i - 1);
253 uint newj = bitmap->rank1(j);
255 uint newmin = min > symbol ? min : symbol;
256 if (right_child != NULL && newj > 0)
257 right_child->access(result, newi, newj-1, newmin, max, l-1, symbol);
261 void wt_node_internal::access(vector<int> &result, uint i, uint j)
263 // std::cout << "At l = " << l << ", [" << i << ", " << j << "], [" << min << ", " << max << "], symbol = " << symbol << std::endl;
272 newi = bitmap->rank0(i - 1);
273 uint newj = bitmap->rank0(j);
275 if (left_child != NULL && newj > 0)
276 left_child->access(result, newi, newj-1);
283 newi = bitmap->rank1(i - 1);
284 uint newj = bitmap->rank1(j);
286 if (right_child != NULL && newj > 0)
287 right_child->access(result, newi, newj-1);
292 uint wt_node_internal::access(uint i, uint j, uint min, uint max, uint l, uint pivot)
295 uint symbol = pivot | (1 << l);
296 // std::cout << "At l = " << l << ", [" << i << ", " << j << "], [" << min << ", " << max << "], symbol = " << symbol << std::endl;
298 if (j < i || max < min)
306 newi = bitmap->rank0(i - 1);
307 uint newj = bitmap->rank0(j);
309 uint newmax = max < symbol - 1 ? max : symbol - 1;
310 if (left_child != NULL && newj > 0)
311 count += left_child->access(newi, newj-1, min, newmax, l-1, pivot);
319 newi = bitmap->rank1(i - 1);
320 uint newj = bitmap->rank1(j);
322 uint newmin = min > symbol ? min : symbol;
323 if (right_child != NULL && newj > 0)
324 count += right_child->access(newi, newj-1, newmin, max, l-1, symbol);
330 uint wt_node_internal::size() {
331 uint s = bitmap->size()+sizeof(wt_node_internal);
333 s += left_child->size();
334 if(right_child!=NULL)
335 s += right_child->size();
339 uint wt_node_internal::save(FILE *fp) {
340 uint wr = WT_NODE_INTERNAL_HDR;
341 wr = fwrite(&wr,sizeof(uint),1,fp);
343 if(bitmap->save(fp)) return 1;
344 if(left_child!=NULL) {
345 if(left_child->save(fp)) return 1;
347 wr = WT_NODE_NULL_HDR;
348 wr = fwrite(&wr,sizeof(uint),1,fp);
351 if(right_child!=NULL) {
352 if(right_child->save(fp)) return 1;
354 wr = WT_NODE_NULL_HDR;
355 wr = fwrite(&wr,sizeof(uint),1,fp);
361 wt_node_internal * wt_node_internal::load(FILE *fp) {
363 if(fread(&rd,sizeof(uint),1,fp)!=1) return NULL;
364 if(rd!=WT_NODE_INTERNAL_HDR) return NULL;
365 wt_node_internal * ret = new wt_node_internal();
366 ret->bitmap = static_bitsequence::load(fp);
367 ret->left_child = wt_node::load(fp);
368 ret->right_child = wt_node::load(fp);