4 // functions to convert tag positions to the corresponding tree node and viceversa.
\r
5 // These are implemented in order to be able to change the tree and Tags representations,
\r
6 // without affecting the code so much.
\r
7 // Current implementation corresponds to balanced-parentheses representation for
\r
8 // the tree, and storing 2 tags per tree node (opening and closing tags).
\r
10 // tag position -> tree node
\r
11 inline treeNode tagpos2node(int t) {
\r
15 // tree node -> tag position
\r
16 inline int node2tagpos(treeNode x) {
\r
21 //KIM OJO to prevent suprious "unused result" warnings
\r
23 inline void ufread(void *ptr, size_t size, size_t nmemb, FILE *stream){
\r
25 res = fread(ptr,size,nmemb,stream);
\r
27 throw "ufread I/O error";
\r
32 inline void ufwrite(const void *ptr, size_t size, size_t nmemb, FILE *stream){
\r
34 res = fwrite(ptr,size,nmemb,stream);
\r
36 throw "ufwrite I/O error";
\r
40 // OJO to fail cleanly while doing a realloc
\r
41 // if we can't realloc we are pretty much screwed anyway but
\r
42 // it makes the code clearer to not have a bunch of if (!ptr) { printf("..."); exit(1); };
\r
43 inline void * urealloc(void *ptr, size_t size){
\r
45 void * dest = realloc(ptr,size);
\r
46 //don't fail if we requested size 0
\r
47 if (dest == NULL && size > 0 )
\r
48 throw std::bad_alloc();
\r
53 inline void * ucalloc(size_t nmemb, size_t size){
\r
55 void * dest = calloc(nmemb,size);
\r
56 //don't fail if we requested size 0
\r
57 if (dest == NULL && nmemb > 0 && size > 0 )
\r
58 throw std::bad_alloc();
\r
63 inline void * umalloc(size_t size){
\r
64 void * dest = malloc(size);
\r
65 if (dest == NULL && size > 0)
\r
66 throw std::bad_alloc();
\r
70 void XMLTree::print_stats() {
\r
71 uint total_space = Tags->size()+sizeof(static_sequence*);
\r
72 total_space += sizeof(uint*)+sizeof(uint)*(2+uint_len(tags_blen,tags_len));
\r
73 cout << "Space usage for XMLTree:" << endl
\r
74 << " - tags static_sequence: " << Tags->size()+sizeof(static_sequence*) << endl
\r
75 << " - tags access array: " << sizeof(uint*)+sizeof(uint)*(2+uint_len(tags_blen,tags_len)) << endl
\r
76 << " ... add Diego structures ... " << endl
\r
77 << " *total* " << total_space << endl;
\r
80 // Save: saves XML tree data structure to file.
\r
81 void XMLTree::Save(unsigned char *filename)
\r
85 char filenameaux[1024];
\r
88 sprintf(filenameaux, "%s.srx", filename);
\r
89 fp = fopen(filenameaux, "w");
\r
91 printf("Error: cannot create file %s to store the tree structure of XML collection\n", filenameaux);
\r
95 // first stores the tree topology
\r
98 // stores the table with tag names
\r
99 ufwrite(&ntagnames, sizeof(int), 1, fp);
\r
100 for (i=0; i<ntagnames;i++)
\r
101 fprintf(fp, "%s\n",TagName[i]);
\r
104 // stores the flags
\r
105 ufwrite(&indexing_empty_texts, sizeof(bool), 1, fp);
\r
106 ufwrite(&initialized, sizeof(bool), 1, fp);
\r
107 ufwrite(&finished, sizeof(bool), 1, fp);
\r
108 ufwrite(&disable_tc, sizeof(bool),1,fp);
\r
110 if (!indexing_empty_texts) EBVector->save(fp);
\r
114 ufwrite(&tags_blen,sizeof(uint),1,fp);
\r
115 ufwrite(&tags_len,sizeof(uint),1,fp);
\r
116 ufwrite(tags_fix,sizeof(uint),uint_len(tags_blen,tags_len),fp);
\r
118 // stores the texts
\r
121 int st = CachedText.size();
\r
122 ufwrite(&st, sizeof(int),1,fp);
\r
123 for (int i = 0; i< CachedText.size(); i++){
\r
124 st = CachedText.at(i).size();
\r
125 ufwrite(&st, sizeof(int),1,fp);
\r
126 ufwrite(CachedText.at(i).c_str(),sizeof(char),1+CachedText.at(i).size(),fp);
\r
134 // Load: loads XML tree data structure from file. Returns
\r
135 // a pointer to the loaded data structure
\r
136 XMLTree *XMLTree::Load(unsigned char *filename, int sample_rate_text)
\r
147 // first load the tree topology
\r
148 sprintf(buffer, "%s.srx", filename);
\r
149 fp = fopen(buffer, "r");
\r
151 printf("Error: cannot open file %s to load the tree structure of XML collection\n", buffer);
\r
155 XML_Tree = new XMLTree();
\r
157 XML_Tree->Par = (bp *)umalloc(sizeof(bp));
\r
159 loadTree(XML_Tree->Par, fp);
\r
161 s_tree += sizeof(bp);
\r
163 // stores the table with tag names
\r
164 ufread(&XML_Tree->ntagnames, sizeof(int), 1, fp);
\r
166 s_tree += sizeof(int);
\r
168 XML_Tree->TagName = (unsigned char **)umalloc(XML_Tree->ntagnames*sizeof(unsigned char *));
\r
170 s_tags += sizeof(unsigned char*)*XML_Tree->ntagnames;
\r
173 for (i=0; i<XML_Tree->ntagnames;i++) {
\r
175 // OJO Kim is it needed ?
\r
179 // fscanf chokes on "\n" which is the case for the root element
\r
180 char * r = fgets(buffer,1023,fp);
\r
181 // int r = fscanf(fp, "%s\n",buffer);
\r
183 throw "Cannot read tag list";
\r
185 // strlen is actually the right size, since there is a trailing '\n'
\r
186 int len = strlen((const char*)buffer);
\r
187 XML_Tree->TagName[i] = (unsigned char *)ucalloc(len,sizeof(char));
\r
188 strncpy((char *)XML_Tree->TagName[i], (const char *)buffer,len - 1);
\r
189 s_tags+= len*sizeof(char);
\r
194 ufread(&(XML_Tree->indexing_empty_texts), sizeof(bool), 1, fp);
\r
195 ufread(&(XML_Tree->initialized), sizeof(bool), 1, fp);
\r
196 ufread(&(XML_Tree->finished), sizeof(bool), 1, fp);
\r
197 ufread(&(XML_Tree->disable_tc), sizeof(bool), 1, fp);
\r
199 s_tree+=sizeof(bool)*4;
\r
201 if (!(XML_Tree->indexing_empty_texts)) XML_Tree->EBVector = static_bitsequence_rrr02::load(fp);
\r
203 s_tree+= XML_Tree->EBVector->size();
\r
206 XML_Tree->Tags = static_sequence::load(fp);
\r
207 ufread(&XML_Tree->tags_blen,sizeof(uint),1,fp);
\r
208 ufread(&XML_Tree->tags_len,sizeof(uint),1,fp);
\r
209 XML_Tree->tags_fix = new uint[uint_len(XML_Tree->tags_blen,XML_Tree->tags_len)];
\r
210 ufread(XML_Tree->tags_fix,sizeof(uint),uint_len(XML_Tree->tags_blen,XML_Tree->tags_len),fp);
\r
211 s_tree+=2*sizeof(uint)+sizeof(uint)*uint_len(XML_Tree->tags_blen,XML_Tree->tags_len);
\r
212 s_tree+= XML_Tree->Tags->size();
\r
214 s_text = ftell(fp);
\r
217 if (!XML_Tree->disable_tc){
\r
218 XML_Tree->Text = TextCollection::InitTextCollection(sample_rate_text);
\r
219 XML_Tree->Text->Load(fp,sample_rate_text);
\r
222 ufread(&sst, sizeof(int),1,fp);
\r
223 for (int i=0;i<sst;i++){
\r
224 ufread(&st, sizeof(int),1,fp);
\r
225 char* str = (char*) malloc(sizeof(char)*st+1);
\r
226 ufread(str,sizeof(char),st+1,fp);
\r
227 string cppstr = str;
\r
228 XML_Tree->CachedText.push_back(cppstr);
\r
234 XML_Tree->Text = NULL;
\r
236 s_text = ftell(fp) - s_text;
\r
243 /*std::cerr << "Tree part is " << s_tree/1024 << " Kbytes,\n"
\r
244 << "with node->tagid part " << XML_Tree->Tags->size()/1024+(uint_len(XML_Tree->tags_blen,XML_Tree->tags_len)*sizeof(uint))/1024 << "Kbytes \n"
\r
245 << "size of Tag part : " << XML_Tree->Tags->length () << " elements\n"
\r
246 << "sizof(unsigned int)* " << XML_Tree->Tags->length () << " = " <<
\r
247 sizeof(unsigned int) * XML_Tree->Tags->length () / 1024 << " Kbytes\n"
\r
248 << "Tag part is " << s_tags/1024 << " Kbytes,\n"
\r
249 << "Text collection is " << s_text/1024 << " Kbytes \n";*/
\r
250 XML_Tree->print_stats();
\r
255 // ~XMLTree: frees memory of XML tree.
\r
256 XMLTree::~XMLTree()
\r
261 free(Par); // frees the memory of struct Par
\r
263 for (i=0; i<ntagnames;i++)
\r
268 if (!indexing_empty_texts) {
\r
269 //EBVector->~static_bitsequence_rrr02();
\r
274 //Tags->~static_sequence_wvtree();
\r
278 //Text->~TextCollection();
\r
282 initialized = false;
\r
286 // root(): returns the tree root.
\r
287 treeNode XMLTree::Root()
\r
290 fprintf(stderr, "Root() : Error: data structure has not been constructed properly\n");
\r
293 return root_node(Par);
\r
296 // SubtreeSize(x): the number of nodes (and attributes) in the subtree of node x.
\r
297 int XMLTree::SubtreeSize(treeNode x)
\r
300 fprintf(stderr, "Error: data structure has not been constructed properly\n");
\r
303 return subtree_size(Par, x);
\r
306 // SubtreeTags(x,tag): the number of occurrences of tag within the subtree of node x.
\r
307 int XMLTree::SubtreeTags(treeNode x, TagType tag)
\r
310 fprintf(stderr, "Error: data structure has not been constructed properly\n");
\r
314 x = first_child(Par,x);
\r
317 int s = x + 2*subtree_size(Par, x) - 1;
\r
319 return Tags->rank(tag, s) - Tags->rank(tag, node2tagpos(x)-1);
\r
322 // IsLeaf(x): returns whether node x is leaf or not. In the succinct representation
\r
323 // this is just a bit inspection.
\r
324 bool XMLTree::IsLeaf(treeNode x)
\r
326 return isleaf(Par, x);
\r
329 // IsAncestor(x,y): returns whether node x is ancestor of node y.
\r
330 bool XMLTree::IsAncestor(treeNode x, treeNode y)
\r
333 fprintf(stderr, "Error: data structure has not been constructed properly\n");
\r
337 return is_ancestor(Par, x, y);
\r
340 // IsChild(x,y): returns whether node x is parent of node y.
\r
341 bool XMLTree::IsChild(treeNode x, treeNode y)
\r
344 fprintf(stderr, "Error: data structure has not been constructed properly\n");
\r
348 if (!is_ancestor(Par, x, y)) return false;
\r
349 return depth(Par, x) == (depth(Par, y) + 1);
\r
352 // NumChildren(x): number of children of node x. Constant time with the data structure
\r
354 int XMLTree::NumChildren(treeNode x)
\r
357 fprintf(stderr, "Error: data structure has not been constructed properly\n");
\r
361 return degree(Par, x);
\r
364 // ChildNumber(x): returns i if node x is the i-th children of its parent.
\r
365 int XMLTree::ChildNumber(treeNode x)
\r
368 fprintf(stderr, "Error: data structure has not been constructed properly\n");
\r
372 return child_rank(Par, x);
\r
375 // Depth(x): depth of node x, a simple binary rank on the parentheses sequence.
\r
376 int XMLTree::Depth(treeNode x)
\r
379 fprintf(stderr, "Error: data structure has not been constructed properly\n");
\r
383 return depth(Par, x);
\r
386 // Preorder(x): returns the preorder number of node x, just counting the tree
\r
387 // nodes (i.e., tags, it disregards the texts in the tree).
\r
388 int XMLTree::Preorder(treeNode x)
\r
391 fprintf(stderr, "Error: data structure has not been constructed properly\n");
\r
395 return preorder_rank(Par, x);
\r
398 // Postorder(x): returns the postorder number of node x, just counting the tree
\r
399 // nodes (i.e., tags, it disregards the texts in the tree).
\r
400 int XMLTree::Postorder(treeNode x)
\r
403 fprintf(stderr, "Error: data structure has not been constructed properly\n");
\r
406 return postorder_rank(Par, x);
\r
409 // Tag(x): returns the tag identifier of node x.
\r
410 TagType XMLTree::Tag(treeNode x)
\r
413 fprintf(stderr, "Error: data structure has not been constructed properly\n");
\r
417 return get_field(tags_fix,tags_blen,node2tagpos(x)); //Tags->access(node2tagpos(x));
\r
420 // DocIds(x): returns the range of text identifiers that descend from node x.
\r
421 // returns {NULLT, NULLT} when there are no texts descending from x.
\r
422 range XMLTree::DocIds(treeNode x)
\r
425 fprintf(stderr, "Error: data structure has not been constructed properly\n");
\r
438 if (indexing_empty_texts) { // faster, no rank needed
\r
440 r.max = x+2*subtree_size(Par, x)-2;
\r
442 else { // we are not indexing empty texts, we need rank
\r
443 int min = EBVector->rank1(x-1);
\r
444 int max = EBVector->rank1(x+2*subtree_size(Par, x)-2);
\r
445 if (min==max) { // range is empty, no texts within the subtree of x
\r
449 else { // the range is non-empty, there are texts within the subtree of x
\r
457 // Parent(x): returns the parent node of node x.
\r
458 treeNode XMLTree::Parent(treeNode x)
\r
461 fprintf(stderr, "Error: data structure has not been constructed properly\n");
\r
467 return parent(Par, x);
\r
470 // Child(x,i): returns the i-th child of node x, assuming it exists.
\r
471 treeNode XMLTree::Child(treeNode x, int i)
\r
474 fprintf(stderr, "Error: data structure has not been constructed properly\n");
\r
478 if (i <= OPTD) return naive_child(Par, x, i);
\r
479 else return child(Par, x, i);
\r
482 // FirstChild(x): returns the first child of node x, assuming it exists. Very fast in BP.
\r
483 treeNode XMLTree::FirstChild(treeNode x)
\r
486 fprintf(stderr, "Error: data structure has not been constructed properly\n");
\r
490 return first_child(Par, x);
\r
493 // NextSibling(x): returns the next sibling of node x, assuming it exists.
\r
494 treeNode XMLTree::NextSibling(treeNode x)
\r
497 fprintf(stderr, "Error: data structure has not been constructed properly\n");
\r
500 if (x == Root() || x==NULLT)
\r
503 return next_sibling(Par, x);
\r
506 // PrevSibling(x): returns the previous sibling of node x, assuming it exists.
\r
507 treeNode XMLTree::PrevSibling(treeNode x)
\r
510 fprintf(stderr, "Error: data structure has not been constructed properly\n");
\r
514 return prev_sibling(Par, x);
\r
517 // TaggedChild(x,i,tag): returns the i-th child of node x tagged tag, or NULLT if there is none.
\r
518 // Because of the balanced-parentheses representation of the tree, this operation is not supported
\r
519 // efficiently, just iterating among the children of node x until finding the desired child.
\r
520 treeNode XMLTree::TaggedChild(treeNode x, int i, TagType tag)
\r
523 fprintf(stderr, "Error: data structure has not been constructed properly\n");
\r
529 child = first_child(Par, x); // starts at first child of node x
\r
530 if (child==(treeNode)-1) return NULLT; // node x is a leaf, there is no such child
\r
531 while (child!=(treeNode)-1) {
\r
532 if (get_field(tags_fix,tags_blen,node2tagpos(child)) /*Tags->access(node2tagpos(child))*/ == tag) { // current child is labeled with tag of interest
\r
534 if (i==0) return child; // we have seen i children of x tagged tag, this is the one we are looking for
\r
536 child = next_sibling(Par, x); // OK, let's try with the next child
\r
538 return NULLT; // no such child was found
\r
541 // TaggedDesc(x,tag): returns the first node tagged tag with larger preorder than x and within
\r
542 // the subtree of x. Returns NULLT if there is none.
\r
543 treeNode XMLTree::TaggedDesc(treeNode x, TagType tag)
\r
546 fprintf(stderr, "Error: data structure has not been constructed properly\n");
\r
555 r = (int) Tags->rank(tag, node2tagpos(x));
\r
556 s = (int) Tags->select(tag, r+1);
\r
557 if (s == -1) return NULLT; // there is no such node
\r
558 y = tagpos2node(s); // transforms the tag position into a node position
\r
559 if (!is_ancestor(Par, x, y)) return NULLT; // the next node tagged tag (in preorder) is not within the subtree of x.
\r
563 treeNode XMLTree::TaggedDescOnly(treeNode x,TagType *desctags, unsigned int dtlen)
\r
571 for (unsigned int i = 0; i < dtlen; i ++ )
\r
573 y = TaggedDesc(x,desctags[i]);
\r
574 res = (res == NULLT) || (( res != NULLT) && (y =! NULLT) && y < res) ? y : res;
\r
583 treeNode XMLTree::TaggedBelow(treeNode x, TagType *childtags, unsigned int ctlen,
\r
584 TagType *desctags, unsigned int dtlen)
\r
593 fs = first_child(Par,x);
\r
594 while (fs != NULLT) {
\r
595 tag = get_field(tags_fix,tags_blen,node2tagpos(fs));
\r
597 /* Check for first_child */
\r
598 for (unsigned int i = 0; i < ctlen; i++) {
\r
599 if (childtags[i] == tag)
\r
603 for (unsigned int i = 0; i < dtlen; i++)
\r
604 if (desctags[i] == tag)
\r
607 /* check in the descendants */
\r
609 for (unsigned int i = 0; i < dtlen; i ++ ){
\r
610 /* maybe inline by hand */
\r
611 y = TaggedDesc(fs,desctags[i]);
\r
612 res = (res==NULLT || (y != NULLT) &&(y < res)) ? y : res;
\r
617 fs = next_sibling(Par,fs);
\r
622 treeNode XMLTree::TaggedFollOnly(treeNode x,TagType *folltags, unsigned int ftlen,treeNode root)
\r
625 treeNode res,y,lim;
\r
626 lim = find_close(Par,root);
\r
628 for (unsigned int i = 0; i < ftlen; i ++ )
\r
630 y = TaggedFoll(x,folltags[i]);
\r
631 res = (res == NULLT) || (( res != NULLT) && (y =! NULLT) && y < res) ? y : res;
\r
635 return res < lim ? res : NULLT;
\r
639 treeNode XMLTree::TaggedDescOrFollOnly(treeNode x,TagType *folltags, unsigned int ftlen,treeNode root)
\r
642 treeNode res,y,lim;
\r
644 lim = find_close(Par,root);
\r
646 for (unsigned int i = 0; i < ftlen; i ++ )
\r
649 r = (int) Tags->rank(folltags[i], node2tagpos(x));
\r
650 s = (int) Tags->select(folltags[i], r+1);
\r
652 y = NULLT; // there is no such node
\r
654 y = tagpos2node(s);
\r
658 res = (res == NULLT) || (( res != NULLT) && (y =! NULLT) && y < res) ? y : res;
\r
662 return res < lim ? res : NULLT;
\r
667 // TaggedNext(x,tag): returns the first node tagged tag with larger preorder than x
\r
668 // Returns NULLT if there is none.
\r
669 treeNode XMLTree::TaggedNext(treeNode x, TagType *childtags, unsigned int ctlen,
\r
670 TagType *folltags, unsigned int flen,treeNode root)
\r
672 treeNode y,old_y,lim,res;
\r
674 if (x == NULLT || x == Root())
\r
678 lim = find_close(Par,root);
\r
682 y = next_sibling(Par,x);
\r
683 while (y != NULLT) {
\r
684 tag = get_field(tags_fix,tags_blen,node2tagpos(y));
\r
685 for(unsigned int i = 0; i < ctlen;i++)
\r
686 if (childtags[i] == tag)
\r
689 for(unsigned int i = 0; i < flen;i++)
\r
690 if (folltags[i] == tag)
\r
693 res = TaggedBelow(y,NULL,0,folltags,flen);
\r
697 y = next_sibling(Par,y);
\r
699 //Found nothing in the following sibling of x.
\r
701 for(unsigned int i = 0; i < flen;i++){
\r
702 y = TaggedFoll(x,folltags[i]);
\r
703 res = (y!= x && (res == NULLT || (y != NULLT && y < res)))? y : res;
\r
706 return res < lim ? res : NULLT;
\r
711 // TaggedPrec(x,tag): returns the first node tagged tag with smaller preorder than x and not an
\r
712 // ancestor of x. Returns NULLT if there is none.
\r
713 treeNode XMLTree::TaggedPrec(treeNode x, TagType tag)
\r
716 fprintf(stderr, "Error: data structure has not been constructed properly\n");
\r
721 treeNode node_s, root;
\r
722 r = (int)Tags->rank(tag, node2tagpos(x)-1);
\r
723 if (r==0) return NULLT; // there is no such node.
\r
724 s = (int)Tags->select(tag, r);
\r
725 root = root_node(Par);
\r
726 node_s = tagpos2node(s);
\r
727 while (is_ancestor(Par, node_s, x) && (node_s!=root)) { // the one that we found is an ancestor of x
\r
729 if (r==0) return NULLT; // there is no such node
\r
730 s = (int)Tags->select(tag, r); // we should use select_prev instead when provided
\r
731 node_s = tagpos2node(s);
\r
733 return NULLT; // there is no such node
\r
737 // TaggedFoll(x,tag): returns the first node tagged tag with larger preorder than x and not in
\r
738 // the subtree of x. Returns NULLT if there is none.
\r
739 treeNode XMLTree::TaggedFoll(treeNode x, TagType tag)
\r
742 fprintf(stderr, "Error: data structure has not been constructed properly\n");
\r
747 if (x ==NULLT || x == Root())
\r
750 r = (int) Tags->rank(tag, find_close(Par, x));
\r
751 s = (int) Tags->select(tag, r+1); // select returns -1 in case that there is no r+1-th tag.
\r
752 if (s==-1) return NULLT;
\r
753 else return tagpos2node(s);
\r
757 // TaggedFollowingSibling(x,tag): returns the first node tagged tag with larger preorder than x and not in
\r
758 // the subtree of x. Returns NULLT if there is none.
\r
759 treeNode XMLTree::TaggedFollowingSibling(treeNode x, TagType tag)
\r
762 fprintf(stderr, "Error: data structure has not been constructed properly\n");
\r
767 treeNode ns = next_sibling(Par,x);
\r
769 if (x == NULLT || x == Root() || ns == -1)
\r
772 r = (int) Tags->rank(tag, node2tagpos(ns)-1);
\r
773 s = (int) Tags->select(tag, r+1); // select returns -1 in case that there is no r+1-th tag.
\r
774 if (s==-1) return NULLT;
\r
775 else return tagpos2node(s);
\r
779 // TaggedAncestor(x, tag): returns the closest ancestor of x tagged tag. Return
\r
780 // NULLT is there is none.
\r
781 treeNode XMLTree::TaggedAncestor(treeNode x, TagType tag)
\r
784 fprintf(stderr, "Error: data structure has not been constructed properly\n");
\r
788 if (x == NULLT || x == Root())
\r
791 treeNode s = parent(Par, x), r = Root();
\r
793 if (get_field(tags_fix,tags_blen,node2tagpos(s)) /*Tags->access(node2tagpos(s))*/ == tag) return s;
\r
794 s = parent(Par, s);
\r
800 // PrevText(x): returns the document identifier of the text to the left
\r
801 // of node x, or NULLT if x is the root node or the text is empty.
\r
802 // Assumes Doc ids start from 0.
\r
803 DocID XMLTree::PrevText(treeNode x)
\r
806 fprintf(stderr, "Error: data structure has not been constructed properly\n");
\r
810 if (x == Root()) return NULLT;
\r
811 if (indexing_empty_texts) // faster, no rank needed
\r
813 else { // we are not indexing empty texts, rank is needed
\r
814 if (EBVector->access(x-1) == 0)
\r
815 return (DocID)NULLT; // there is no text to the left of node (text is empty)
\r
817 return (DocID)EBVector->rank1(x-1)-1; //-1 because document ids start from 0
\r
821 // NextText(x): returns the document identifier of the text to the right
\r
822 // of node x, or NULLT if x is the root node. Assumes Doc ids start from 0.
\r
823 DocID XMLTree::NextText(treeNode x)
\r
826 fprintf(stderr, "Error: data structure has not been constructed properly\n");
\r
830 if (x == Root()) return NULLT;
\r
831 if (indexing_empty_texts) // faster, no rank needed
\r
832 return (DocID)x+2*subtree_size(Par, x)-1;
\r
833 else { // we are not indexing empty texts, rank is needed
\r
834 int p = x+2*subtree_size(Par, x)-1;
\r
835 if (EBVector->access(p) == 0) // there is no text to the right of node
\r
836 return (DocID)NULLT;
\r
838 return (DocID)EBVector->rank1(p)-1; //-1 because document ids start from 0
\r
842 // MyText(x): returns the document identifier of the text below node x,
\r
843 // or NULLT if x is not a leaf node or the text is empty. Assumes Doc
\r
844 // ids start from 0.
\r
845 DocID XMLTree::MyText(treeNode x)
\r
848 fprintf(stderr, "Error: data structure has not been constructed properly\n");
\r
852 if (!IsLeaf(x)) return NULLT;
\r
853 if (indexing_empty_texts) // faster, no rank needed
\r
855 else { // we are not indexing empty texts, rank is needed
\r
856 if (EBVector->access(x) == 0) // there is no text below node x
\r
857 return (DocID)NULLT;
\r
859 return (DocID)EBVector->rank1(x)-1; //-1 because document ids start from 0
\r
863 // TextXMLId(d): returns the preorder of document with identifier d in the tree consisting of
\r
864 // all tree nodes and all text nodes. Assumes that the tree root has preorder 1.
\r
865 int XMLTree::TextXMLId(DocID d)
\r
868 fprintf(stderr, "Error: data structure has not been constructed properly\n");
\r
872 if (indexing_empty_texts)
\r
873 return d + rank_open(Par, d)+1; // +1 because root has preorder 1
\r
874 else { // slower, needs rank and select
\r
875 int s = EBVector->select1(d+1);
\r
876 return rank_open(Par, s) + d + 1; // +1 because root has preorder 1
\r
880 // NodeXMLId(x): returns the preorder of node x in the tree consisting
\r
881 // of all tree nodes and all text nodes. Assumes that the tree root has
\r
883 int XMLTree::NodeXMLId(treeNode x)
\r
886 fprintf(stderr, "Error: data structure has not been constructed properly\n");
\r
890 if (indexing_empty_texts)
\r
891 return x - 1 + rank_open(Par, x);
\r
893 if (x == Root()) return 1; // root node has preorder 1
\r
895 return rank_open(Par, x) + EBVector->rank1(x-1);
\r
899 // ParentNode(d): returns the parent node of document identifier d.
\r
900 treeNode XMLTree::ParentNode(DocID d)
\r
903 fprintf(stderr, "Error: data structure has not been constructed properly\n");
\r
911 // OJO : Kim : I added the d+1. before that, else branch was
\r
912 // EBVector->select1(d)
\r
913 // and gave wrong results (I'm really poking a bear with a stick here).
\r
914 if (indexing_empty_texts) s = d;
\r
915 else s = EBVector->select1(d+1);
\r
917 if (inspect(Par,s) == CP) // is a closing parenthesis
\r
918 return parent(Par, find_open(Par, s));
\r
919 else // is an opening parenthesis
\r
920 return (treeNode)s;
\r
923 treeNode XMLTree::PrevNode(DocID d)
\r
926 fprintf(stderr, "Error: data structure has not been constructed properly\n");
\r
935 if (indexing_empty_texts) s = d;
\r
936 else s = EBVector->select1(d+1);
\r
940 if (inspect(Par,s) == CP) // is a closing parenthesis
\r
941 return find_open(Par, s);
\r
942 else // is an opening parenthesis
\r
948 // OpenDocument(empty_texts): it starts the construction of the data structure for
\r
949 // the XML document. Parameter empty_texts indicates whether we index empty texts
\r
950 // in document or not. Returns a non-zero value upon success, NULLT in case of error.
\r
951 int XMLTree::OpenDocument(bool empty_texts, int sample_rate_text,bool dtc)
\r
953 initialized = true;
\r
955 found_attributes = false;
\r
961 indexing_empty_texts = empty_texts;
\r
963 par_aux = (pb *)umalloc(sizeof(pb)*parArraySize);
\r
965 tags_aux = (TagType *) umalloc(sizeof(TagType));
\r
967 TagName = (unsigned char **) umalloc(4*sizeof(unsigned char*));
\r
969 TagName[0] = (unsigned char *) umalloc(4*sizeof(unsigned char));
\r
971 strcpy((char *) TagName[0], "<@>");
\r
973 TagName[1] = (unsigned char *) umalloc(4*sizeof(unsigned char));
\r
975 strcpy((char *) TagName[1], "<$>");
\r
977 //OJO need to put these in the table too.
\r
978 TagName[2] = (unsigned char *) umalloc(5*sizeof(unsigned char));
\r
980 strcpy((char *) TagName[2], "/<@>");
\r
982 TagName[3] = (unsigned char *) umalloc(5*sizeof(unsigned char));
\r
984 strcpy((char *) TagName[3], "/<$>");
\r
987 if (!indexing_empty_texts)
\r
988 empty_texts_aux = (unsigned int *)umalloc(sizeof(unsigned int));
\r
992 Text = TextCollection::InitTextCollection((unsigned)sample_rate_text);
\r
994 return 1; // indicates success in the initialization of the data structure
\r
997 // CloseDocument(): it finishes the construction of the data structure for the XML
\r
998 // document. Tree and tags are represented in the final form, dynamic data
\r
999 // structures are made static, and the flag "finished" is set to true. After that,
\r
1000 // the data structure can be queried.
\r
1001 int XMLTree::CloseDocument()
\r
1003 if (!initialized) { // data structure has not been initialized properly
\r
1004 fprintf(stderr, "Error: data structure has not been initialized properly (by calling method OpenDocument)\n");
\r
1008 // closing parenthesis for the tree root
\r
1009 par_aux = (pb *)urealloc(par_aux, sizeof(pb)*(1+npar/(8*sizeof(pb))));
\r
1011 // creates the data structure for the tree topology
\r
1012 Par = (bp *)umalloc(sizeof(bp));
\r
1013 bp_construct(Par, npar, par_aux, OPT_DEGREE|0);
\r
1014 // creates structure for tags
\r
1015 //static_bitsequence_builder * bmb = new static_bitsequence_builder_brw32(20);
\r
1016 //static_permutation_builder * pmb = new static_permutation_builder_mrrr(PERM_SAMPLE, bmb);
\r
1017 //static_sequence_builder * ssb = new static_sequence_builder_gmr_chunk(bmb, pmb);
\r
1020 // If we found an attribute then "<@>" is present in the tree
\r
1021 // if we didn't then it is not. "<$>" is never present in the tree
\r
1023 for(uint i=0;i<(uint)npar-1;i++)
\r
1024 max_tag = max(max_tag,tags_aux[i]);
\r
1026 int ntagsize = found_attributes ? 2*ntagnames-1 : 2*ntagnames - 2;
\r
1027 tags_aux = (TagType *) urealloc(tags_aux, sizeof(TagType)*(npar + 1));
\r
1028 tags_aux[npar++] = max_tag;
\r
1030 static_bitsequence_builder * bmb = new static_bitsequence_builder_brw32(20);
\r
1031 alphabet_mapper *am = new alphabet_mapper_none();
\r
1032 wt_coder * wc = new wt_coder_huff((uint*)tags_aux,npar,am);
\r
1033 Tags = new static_sequence_wvtree((uint*)tags_aux,npar,wc ,bmb, am);
\r
1034 //Tags = new static_sequence_gmr((uint *) tags_aux, (uint) npar-1,ntagsize, bmb, ssb);
\r
1035 tags_blen = bits(max_tag);
\r
1036 tags_len = (uint)npar;
\r
1037 tags_fix = new uint[uint_len(tags_blen,tags_len)];
\r
1038 for(uint i=0;i<(uint)npar-1;i++)
\r
1039 set_field(tags_fix,tags_blen,i,tags_aux[i]);
\r
1044 // makes the text collection static
\r
1046 Text->MakeStatic();
\r
1048 // creates the data structure marking the non-empty texts (just in the case it is necessary)
\r
1049 if (!indexing_empty_texts) {
\r
1050 EBVector = new static_bitsequence_rrr02((uint *)empty_texts_aux,(ulong)npar,(uint)32);
\r
1051 free (empty_texts_aux);
\r
1052 empty_texts_aux = NULL;
\r
1055 // OJO was leaked before, found by valgrind
\r
1063 return 1; // indicates success in the inicialization
\r
1067 // NewOpenTag(tagname): indicates the event of finding a new opening tag in the document.
\r
1068 // Tag name is given. Returns a non-zero value upon success, and returns NULLT
\r
1069 // in case of failing when trying to insert the new tag.
\r
1070 int XMLTree::NewOpenTag(unsigned char *tagname)
\r
1074 if (!initialized) { // data structure has not been initialized properly
\r
1075 fprintf(stderr, "Error: you cannot insert a new opening tag without first calling method OpenDocument first\n");
\r
1079 // inserts a new opening parentheses in the bit sequence
\r
1080 if (sizeof(pb)*8*parArraySize == npar) { // no space left for the new parenthesis
\r
1081 par_aux = (pb *)urealloc(par_aux, sizeof(pb)*2*parArraySize);
\r
1082 parArraySize *= 2;
\r
1085 setbit(par_aux,npar,OP); // marks a new opening parenthesis
\r
1087 // transforms the tagname into a tag identifier. If the tag is new, we insert
\r
1088 // it in the table.
\r
1089 for (i=0; i<ntagnames; i++)
\r
1090 if (strcmp((const char *)tagname,(const char *)TagName[i])==0) break;
\r
1093 // NewOpenTag("<@>") was called
\r
1095 found_attributes=true;
\r
1097 if (i==ntagnames) { // the tag is a new one, then we insert it
\r
1098 TagName = (unsigned char **)urealloc(TagName, sizeof(char *)*(ntagnames+1));
\r
1101 fprintf(stderr, "Error: not enough memory\n");
\r
1106 TagName[i] = (unsigned char *)umalloc(sizeof(unsigned char)*(strlen((const char *)tagname)+1));
\r
1107 strcpy((char *)TagName[i], (const char *)tagname);
\r
1109 tags_aux = (TagType *) urealloc(tags_aux, sizeof(TagType)*(npar + 1));
\r
1111 tags_aux[npar] = i; // inserts the new tag id within the preorder sequence of tags
\r
1120 // NewClosingTag(tagname): indicates the event of finding a new closing tag in the document.
\r
1121 // Tag name is given. Returns a non-zero value upon success, and returns NULLT
\r
1122 // in case of failing when trying to insert the new tag.
\r
1123 int XMLTree::NewClosingTag(unsigned char *tagname)
\r
1127 if (!initialized) { // data structure has not been initialized properly
\r
1128 fprintf(stderr, "Error: you cannot insert a new closing tag without first calling method OpenDocument first\n");
\r
1132 // inserts a new closing parentheses in the bit sequence
\r
1133 if (sizeof(pb)*8*parArraySize == npar) { // no space left for the new parenthesis
\r
1134 par_aux = (pb *)urealloc(par_aux, sizeof(pb)*2*parArraySize);
\r
1135 parArraySize *= 2;
\r
1138 setbit(par_aux,npar,CP); // marks a new closing parenthesis
\r
1140 // transforms the tagname into a tag identifier. If the tag is new, we insert
\r
1141 // it in the table.
\r
1142 for (i=0; i<ntagnames; i++)
\r
1143 if ((strcmp((const char *)tagname,(const char *)(TagName[i]+1))==0) && (TagName[i][0]=='/')) break;
\r
1145 if (i==ntagnames) { // the tag is a new one, then we insert it
\r
1146 TagName = (unsigned char **)urealloc(TagName, sizeof(char *)*(ntagnames+1));
\r
1149 TagName[i] = (unsigned char *)umalloc(sizeof(char)*(strlen((const char *)tagname)+2));
\r
1150 TagName[i][0] = '/';
\r
1151 strcpy((char *)&(TagName[i][1]), (const char *)tagname);
\r
1154 tags_aux = (TagType *)urealloc(tags_aux, sizeof(TagType)*(npar + 1));
\r
1156 tags_aux[npar] = i; // inserts the new tag id within the preorder sequence of tags
\r
1160 return 1; // success
\r
1165 // NewText(s): indicates the event of finding a new (non-empty) text s in the document.
\r
1166 // The new text is inserted within the text collection. Returns a non-zero value upon
\r
1167 // success, NULLT in case of error.
\r
1168 int XMLTree::NewText(unsigned char *s)
\r
1170 if (!initialized) { // data structure has not been initialized properly
\r
1171 fprintf(stderr, "Error: you cannot insert a new text without first calling method OpenDocument first\n");
\r
1176 XMLTree::NewEmptyText();
\r
1180 if (!indexing_empty_texts) {
\r
1181 empty_texts_aux = (unsigned int *)urealloc(empty_texts_aux, sizeof(pb)*(1+(npar-1)/(8*sizeof(pb))));
\r
1182 bitset(empty_texts_aux, npar-1); // marks the non-empty text with a 1 in the bit vector
\r
1185 Text->InsertText(s);
\r
1186 string cpps = (char*) s;
\r
1187 CachedText.push_back(cpps);
\r
1189 return 1; // success
\r
1192 // NewEmptyText(): indicates the event of finding a new empty text in the document.
\r
1193 // In case of indexing empty and non-empty texts, we insert the empty texts into the
\r
1194 // text collection. In case of indexing only non-empty texts, it just indicates an
\r
1195 // empty text in the bit vector of empty texts. Returns a non-zero value upon
\r
1196 // success, NULLT in case of error.
\r
1197 int XMLTree::NewEmptyText()
\r
1199 unsigned char c = 0;
\r
1200 if (!initialized) { // data structure has not been initialized properly
\r
1201 fprintf(stderr, "Error: you cannot insert a new empty text without first calling method OpenDocument first\n");
\r
1205 if (!indexing_empty_texts) {
\r
1206 empty_texts_aux = (unsigned int *)urealloc(empty_texts_aux, sizeof(pb)*(1+(npar-1)/(8*sizeof(pb))));
\r
1208 bitclean(empty_texts_aux, npar-1); // marks the empty text with a 0 in the bit vector
\r
1210 else Text->InsertText(&c); // we insert the empty text just in case we index all the texts
\r
1212 return 1; // success
\r
1216 // GetTagId: returns the tag identifier corresponding to a given tag name.
\r
1217 // Returns NULLT in case that the tag name does not exists.
\r
1218 TagType XMLTree::GetTagId(unsigned char *tagname)
\r
1221 // this should be changed for more efficient processing
\r
1222 for (i=0; i<ntagnames; i++)
\r
1223 if (strcmp((const char *)tagname,(const char *)TagName[i])==0) break;
\r
1224 if (i==ntagnames) return ntagnames; //(TagType)NULLT; // tagname does not exists in the table
\r
1229 // GetTagName(tagid): returns the tag name of a given tag identifier.
\r
1230 // Returns NULL in case that the tag identifier is not valid.
\r
1231 unsigned char *XMLTree::GetTagName(TagType tagid)
\r
1235 if (tagid >= ntagnames) return NULL; // invalid tag identifier
\r
1236 s = (unsigned char *)umalloc((strlen((const char *)TagName[tagid])+1)*sizeof(unsigned char));
\r
1237 strcpy((char *)s, (const char *)TagName[tagid]);
\r
1242 //KIM : OJO need the two following methods
\r
1244 const unsigned char *XMLTree::GetTagNameByRef(TagType tagid)
\r
1246 if (tagid >= ntagnames) return NULL; // invalid tag identifier
\r
1247 return ((const unsigned char*) TagName[tagid]);
\r
1252 TagType XMLTree::RegisterTag(unsigned char *tagname)
\r
1257 TagType id = XMLTree::GetTagId(tagname);
\r
1260 ntagnames = ntagnames + 1;
\r
1261 TagName = (unsigned char **) urealloc(TagName,ntagnames*(sizeof(unsigned char*)));
\r
1262 TagName[id] = (unsigned char *) umalloc(sizeof(unsigned char)*strlen( (const char*) tagname)+1);
\r
1263 strcpy((char*)TagName[id], (const char *)tagname);
\r