-/* static_sequence_wvtree.h
+/* static_sequence_wvtree.cpp
* Copyright (C) 2008, Francisco Claude, all rights reserved.
*
* static_sequence_wvtree definition
for(uint i=0;i<n;i++)
symbols[i] = am->map(symbols[i]);
this->am = am;
+ am->use();
this->c=c;
+ c->use();
root = new wt_node_internal(symbols, n, 0, c, bmb);
for(uint i=0;i<n;i++)
symbols[i] = am->unmap(symbols[i]);
static_sequence_wvtree::~static_sequence_wvtree() {
delete root;
- delete am;
- delete c;
+ am->unuse();
+ c->unuse();
}
uint static_sequence_wvtree::rank(uint symbol, uint pos) {
static_sequence_wvtree * ret = new static_sequence_wvtree();
if(fread(&ret->n,sizeof(uint),1,fp)!=1) return NULL;
ret->c = wt_coder::load(fp);
+ ret->c->use();
ret->am = alphabet_mapper::load(fp);
+ ret->am->use();
ret->root = wt_node::load(fp);
return ret;
}