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) {
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],l))
80 bitmap = bmb->build(ibitmap, n);
82 uint count_right = bitmap->rank1(n-1);
83 uint count_left = n-count_right+1;
84 uchar * left = new uchar[count_left+1];
85 uchar * right = new uchar[count_right+1];
86 count_right = count_left = 0;
87 bool match_left = true, match_right = true;
88 for(uint i=0;i<n;i++) {
89 if(bitmap->access(i)) {
90 right[count_right++]=symbols[i];
92 if(right[count_right-1]!=right[count_right-2])
96 left[count_left++]=symbols[i];
98 if(left[count_left-1]!=left[count_left-2])
103 if(match_left/* && c->done(left[0],l+1)*/)
104 left_child = new wt_node_leaf((uint)left[0], count_left);
106 left_child = new wt_node_internal(left, count_left, l+1, c, bmb);
111 if(match_right/* && c->done(right[0],l+1)*/)
112 right_child = new wt_node_leaf((uint)right[0], count_right);
114 right_child = new wt_node_internal(right, count_right, l+1, c, bmb);
123 wt_node_internal::wt_node_internal() { }
125 wt_node_internal::~wt_node_internal() {
127 if(right_child!=NULL) delete right_child;
128 if(left_child!=NULL) delete left_child;
131 uint wt_node_internal::rank(uint symbol, uint pos, uint l, wt_coder * c) {
132 bool is_set = c->is_set(symbol,l);
134 if(left_child==NULL) return 0;
135 return left_child->rank(symbol, bitmap->rank0(pos)-1,l+1,c);
138 if(right_child==NULL) return 0;
139 return right_child->rank(symbol, bitmap->rank1(pos)-1,l+1,c);
143 uint wt_node_internal::select(uint symbol, uint pos, uint l, wt_coder * c) {
144 bool is_set = c->is_set(symbol, l);
149 uint new_pos = left_child->select(symbol, pos, l+1,c);
150 if(new_pos+1==0) return (uint)(-1);
151 ret = bitmap->select0(new_pos)+1;
153 if(right_child==NULL)
155 uint new_pos = right_child->select(symbol, pos, l+1,c);
156 if(new_pos+1==0) return (uint)(-1);
157 ret = bitmap->select1(new_pos)+1;
159 if(ret==0) return (uint)-1;
163 uint wt_node_internal::access(uint pos) {
164 bool is_set = bitmap->access(pos);
166 assert(left_child!=NULL);
167 return left_child->access(bitmap->rank0(pos)-1);
169 assert(right_child!=NULL);
170 return right_child->access(bitmap->rank1(pos)-1);
174 uint wt_node_internal::size() {
175 uint s = bitmap->size()+sizeof(wt_node_internal);
177 s += left_child->size();
178 if(right_child!=NULL)
179 s += right_child->size();
183 uint wt_node_internal::save(FILE *fp) {
184 uint wr = WT_NODE_INTERNAL_HDR;
185 wr = fwrite(&wr,sizeof(uint),1,fp);
187 if(bitmap->save(fp)) return 1;
188 if(left_child!=NULL) {
189 if(left_child->save(fp)) return 1;
191 wr = WT_NODE_NULL_HDR;
192 wr = fwrite(&wr,sizeof(uint),1,fp);
195 if(right_child!=NULL) {
196 if(right_child->save(fp)) return 1;
198 wr = WT_NODE_NULL_HDR;
199 wr = fwrite(&wr,sizeof(uint),1,fp);
205 wt_node_internal * wt_node_internal::load(FILE *fp) {
207 if(fread(&rd,sizeof(uint),1,fp)!=1) return NULL;
208 if(rd!=WT_NODE_INTERNAL_HDR) return NULL;
209 wt_node_internal * ret = new wt_node_internal();
210 ret->bitmap = static_bitsequence::load(fp);
211 ret->left_child = wt_node::load(fp);
212 ret->right_child = wt_node::load(fp);