int sst;\r
int st;\r
ufread(&sst, sizeof(int),1,fp);\r
int sst;\r
int st;\r
ufread(&sst, sizeof(int),1,fp);\r
\r
// If we found an attribute then "<@>" is present in the tree\r
// if we didn't then it is not. "<$>" is never present in the tree\r
\r
// If we found an attribute then "<@>" is present in the tree\r
// if we didn't then it is not. "<$>" is never present in the tree\r
- //uint max_tag = 0;\r
- //for(uint i=0;i<(uint)npar-1;i++)\r
- // max_tag = max(max_tag,tags_aux[i]);\r
+ uint max_tag = 0;\r
+ for(uint i=0;i<(uint)npar-1;i++)\r
+ max_tag = max(max_tag,tags_aux[i]);\r
//max_tag++;\r
//tags_aux = (TagType *) urealloc(tags_aux, sizeof(TagType)*(npar + 1));\r
//tags_aux[npar++] = max_tag;\r
//max_tag++;\r
//tags_aux = (TagType *) urealloc(tags_aux, sizeof(TagType)*(npar + 1));\r
//tags_aux[npar++] = max_tag;\r
// creates the data structure marking the non-empty texts (just in the case it is necessary)\r
if (!indexing_empty_texts) {\r
EBVector = new static_bitsequence_rrr02((uint *)empty_texts_aux,(ulong)npar,(uint)32);\r
// creates the data structure marking the non-empty texts (just in the case it is necessary)\r
if (!indexing_empty_texts) {\r
EBVector = new static_bitsequence_rrr02((uint *)empty_texts_aux,(ulong)npar,(uint)32);\r