2 #include <static_sequence_wvtree.h>
4 static_sequence_wvtree::static_sequence_wvtree(uint * symbols, uint n, wt_coder * c, static_bitsequence_builder * bmb, alphabet_mapper * am) {
6 symbols[i] = am->map(symbols[i]);
9 cout << "Building..."; cout.flush();
10 root = new wt_node_internal(symbols, n, 0, c, bmb);
11 cout << "done" << endl; cout.flush();
13 symbols[i] = am->unmap(symbols[i]);
16 static_sequence_wvtree::static_sequence_wvtree() {}
19 static_sequence_wvtree::~static_sequence_wvtree() {
25 uint static_sequence_wvtree::rank(uint symbol, uint pos) {
26 return root->rank(am->map(symbol), pos, 0, c);
29 uint static_sequence_wvtree::count(uint s) {
30 return root->rank(am->map(s), len-1, 0, c);
33 uint static_sequence_wvtree::select(uint symbol, uint pos) {
34 return root->select(am->map(symbol), pos, 0, c)-1;
37 uint static_sequence_wvtree::access(uint pos) {
38 return am->unmap(root->access(pos));
41 uint static_sequence_wvtree::size() {
42 /*cout << "WT: " << root->size() << endl;
43 cout << "Coder: " << c->size() << endl;
44 cout << "AM: " << am->size() << endl;*/
45 return sizeof(static_sequence_wvtree)+sizeof(uint)+root->size()+am->size()+c->size();
48 uint static_sequence_wvtree::save(FILE * fp) {
50 wr = fwrite(&wr,sizeof(uint),1,fp);
52 wr = fwrite(&n,sizeof(uint),1,fp);
54 if(c->save(fp)) return 1;
55 if(am->save(fp)) return 1;
56 if(root->save(fp)) return 1;
60 static_sequence_wvtree * static_sequence_wvtree::load(FILE *fp) {
62 if(fread(&rd,sizeof(uint),1,fp)!=1) return NULL;
63 if(rd!=WVTREE_HDR) return NULL;
64 static_sequence_wvtree * ret = new static_sequence_wvtree();
65 if(fread(&ret->n,sizeof(uint),1,fp)!=1) return NULL;
66 ret->c = wt_coder::load(fp);
67 ret->am = alphabet_mapper::load(fp);
68 ret->root = wt_node::load(fp);