12 #include "xml-tree.hpp"
16 const xml_tree::node_t xml_tree::NIL;
17 const xml_tree::node_t xml_tree::ROOT;
20 const xml_tree::tag_t xml_tree::NIL_TAG_ID;
21 const char* xml_tree::NIL_TAG = "<!NIL!>";
22 const xml_tree::tag_t xml_tree::DOCUMENT_OPEN_TAG_ID;
23 const char* xml_tree::DOCUMENT_OPEN_TAG = "";
24 const xml_tree::tag_t xml_tree::ATTRIBUTE_OPEN_TAG_ID;
25 const char* xml_tree::ATTRIBUTE_OPEN_TAG = "<@>";
26 const xml_tree::tag_t xml_tree::PCDATA_OPEN_TAG_ID;
27 const char* xml_tree::PCDATA_OPEN_TAG = "<$>";
28 const xml_tree::tag_t xml_tree::ATTRIBUTE_DATA_OPEN_TAG_ID;
29 const char* xml_tree::ATTRIBUTE_DATA_OPEN_TAG = "<@$>";
30 const xml_tree::tag_t xml_tree::CLOSE_TAG_ID;
31 const char* xml_tree::CLOSE_TAG = "</>";
34 static int bits8 (int t ) {
45 static bool array_mem(xml_tree::tag_t *a, xml_tree::tag_t t)
47 for(; *a != xml_tree::NIL_TAG_ID; a++){
48 if (*a >= t) return (*a == t);
53 static void ufread(void *ptr, size_t size, size_t nmemb, FILE *stream)
56 res = fread(ptr,size,nmemb,stream);
58 throw std::runtime_error("ufread I/O error" );
62 static void ufwrite(const void *ptr, size_t size, size_t nmemb, FILE *stream)
65 res = fwrite(ptr,size,nmemb,stream);
67 throw std::runtime_error("ufwrite I/O error");
79 xml_tree::xml_tree(std::vector<int32_t> *tags_,
80 std::unordered_map<std::string, int32_t> *tag_ids,
81 bit_vector *parbitmap,
83 SXSI::TextCollectionBuilder *tc_builder,
84 SXSI::TextCollectionBuilder::index_type_t idx_type,
85 bit_vector *textbitmap)
90 size_t npar = parbitmap->size();
92 par = bp_construct(npar,
93 parbitmap->get_vector_ptr(),
97 this->tag_ids = tag_ids;
98 tag_names = new std::vector<std::string>();
99 tag_names->resize(tag_ids->size());
100 for(auto val : *(this->tag_ids))
101 (*this->tag_names)[val.second] = val.first;
103 uint32_t max_tag = tag_names->size() - 1;
104 bit_vector *tmp_bitmap = new bit_vector(npar, 1, 0);
106 for(int32_t i = 0; i <= max_tag; i++){
108 for (size_t k = 0; k < npar; k++){
109 bool t = (i == (*tags_)[k]);
110 tmp_bitmap->set(k, t);
113 buff = tmp_bitmap->get_vector_ptr();
114 this->tags.push_back(new static_bitsequence_sdarray(buff, npar, ones));
120 //static_bitsequence_builder *bmb = new static_bitsequence_builder_sdarray();
121 //alphabet_mapper *am = new alphabet_mapper_none();
123 // this->tags = new static_sequence_bs((uint32_t*)&((*tags)[0]), npar, am, bmb);
125 bits_per_tag = bits8(max_tag);
127 tag_seq = new uint32_t[uint_len(bits_per_tag, tag_seq_len)];
128 for(size_t i = 0; i < (size_t) tag_seq_len; i++)
129 set_field(tag_seq, bits_per_tag, i, (uint32_t) (*tags_)[i]);
138 uint32_t * textbm = textbitmap->get_vector_ptr();
139 text_positions = new static_bitsequence_rrr02(textbm,
145 this->text_index_type = idx_type;
146 text_collection = tc_builder->InitTextCollection();
152 xml_tree::~xml_tree()
156 for(int i = 0; i < tag_names->size(); i++){
165 if (text_collection) delete text_collection;
166 if (text_positions) delete text_positions;
169 bool xml_tree::is_child(xml_tree::node_t x, xml_tree::node_t y) const
171 return !is_leaf(x) && is_ancestor(y, x) && depth(x)+1 == depth(y);
174 uint32_t xml_tree::depth(xml_tree::node_t x) const
176 return bp_depth(this->par, x);
180 uint32_t xml_tree::preorder(xml_tree::node_t x) const
182 return bp_preorder_rank(this->par, x);
185 uint32_t xml_tree::postorder(xml_tree::node_t x) const
187 return bp_postorder_rank(this->par, x);
191 xml_tree::select_child(xml_tree::node_t x, xml_tree::tag_t *tags) const
193 if (is_nil(x) || is_leaf(x)) return xml_tree::NIL;
194 xml_tree::node_t child = first_child(x);
195 if (array_mem(tags, tag(child))) return child;
196 return select_sibling(child, tags);
201 xml_tree::select_sibling(xml_tree::node_t x, xml_tree::tag_t *tags) const
203 xml_tree::node_t sibling = next_sibling(x);
205 while(!is_nil(sibling)) {
207 if (array_mem(tags, t)) return sibling;
208 sibling = next_sibling(sibling);
214 void xml_tree::save(int fd, char* s)
219 fp = fdopen(fd2, "w");
221 if (fd == 0) throw(std::runtime_error(strerror(errno)));
222 saveTree(par, fp); //TODO use new api
224 int ntags = tag_names->size();
226 ufwrite(&ntags, sizeof(int), 1, fp);
227 for (int i = 0; i < ntags;i++)
228 fprintf(fp, "%s\n", tag_names->at(i).c_str());
231 for(int i = 0; i < ntags; i++)
234 ufwrite(&bits_per_tag, sizeof(uint),1,fp);
235 ufwrite(&tag_seq_len, sizeof(uint),1,fp);
236 ufwrite(tag_seq, sizeof(uint), uint_len(bits_per_tag, tag_seq_len), fp);
238 bool disable_tc = text_collection == 0 || text_positions == 0;
240 ufwrite(&disable_tc, sizeof(bool),1,fp);
243 text_positions->save(fp);
244 ufwrite(&text_index_type,
245 sizeof(TextCollectionBuilder::index_type_t),
249 switch (text_index_type){
250 case TextCollectionBuilder::index_type_default:
251 file.append("_default");
253 case TextCollectionBuilder::index_type_swcsa:
254 file.append("_swcsa");
256 case TextCollectionBuilder::index_type_rlcsa:
257 file.append("_rlcsa");
261 text_collection->Save(fp, file.c_str());
269 xml_tree* xml_tree::load(int fd, char* name, bool load_tc, int sf)
276 fp = fdopen(fd, "r");
277 xml_tree *tree = new xml_tree();
279 tree->par = loadTree(fp); //TODO use new api
280 tree->tag_names = new std::vector<std::string>();
281 tree->tag_ids = new std::unordered_map<std::string, xml_tree::tag_t>();
285 ufread(&ntags, sizeof(int), 1, fp);
287 for (i = 0; i < ntags; i++) {
288 if (fgets(buffer, 1022, fp) != buffer)
289 throw std::runtime_error("xml_tree::load: cannot read tag list");
291 // remove the trailing \n
293 tree->tag_names->push_back(s);
294 tree->tag_ids->insert(std::make_pair(s,
295 static_cast<xml_tree::tag_t>(i)));
299 for(int i = 0; i < ntags; i++){
300 tree->tags.push_back(static_bitsequence_sdarray::load(fp));
303 //tree->tags = static_sequence_bs::load(fp);
304 ufread(&tree->bits_per_tag, sizeof(uint), 1, fp);
305 fprintf(stderr, "\nBits per tag: %u\n", tree->bits_per_tag);
306 ufread(&tree->tag_seq_len, sizeof(uint), 1, fp);
307 size_t size = uint_len(tree->bits_per_tag, tree->tag_seq_len);
308 tree->tag_seq = new uint[size];
309 ufread(tree->tag_seq, sizeof(uint), size, fp);
312 ufread(&disable_tc, sizeof(bool), 1, fp);
314 if (disable_tc || !load_tc) {
315 tree->text_positions = 0;
316 tree->text_collection = 0;
319 tree->text_positions = static_bitsequence_rrr02::load(fp);
321 ufread(&tree->text_index_type,
322 sizeof(TextCollectionBuilder::index_type_t), 1, fp);
324 std::string file(name);
325 switch (tree->text_index_type){
326 case TextCollectionBuilder::index_type_default:
327 file.append("_default");
329 case TextCollectionBuilder::index_type_swcsa:
330 file.append("_swcsa");
332 case TextCollectionBuilder::index_type_rlcsa:
333 file.append("_rlcsa");
338 tree->text_collection =
339 TextCollection::Load(fp,
341 TextCollection::index_mode_default,
350 uint32_t xml_tree::num_children(xml_tree::node_t x) const
352 return bp_degree(par, x);
355 uint32_t xml_tree::child_pos(xml_tree::node_t x) const
357 return bp_child_rank(par, x);
360 xml_tree::node_t xml_tree::child(xml_tree::node_t x, uint32_t i) const
362 if (i < 10) return bp_naive_child(par, x, i);
363 else bp_child(par, x, i);
366 std::pair<int32_t, int32_t> xml_tree::text_id_range(xml_tree::node_t x) const
369 xml_tree::node_t y = bp_find_close(par, x);
373 i = text_positions->rank1(x-1);
375 j = text_positions->rank1(y);
376 // fprintf(stderr, "Rank of node %i is %i, rank of closing %i is %i\n", x, i, y, j);
378 return std::make_pair(xml_tree::NIL, xml_tree::NIL);
380 return std::make_pair(i, j);
383 int32_t xml_tree::text_id(xml_tree::node_t x) const
385 return (int32_t) text_positions->rank1(x) - 1;
388 unsigned char* xml_tree::get_text(int32_t id) const
390 unsigned char * s = text_collection->GetText(id);
391 return s + (s[0] == 1);
394 void xml_tree::uflush(int fd)
396 size_t size = print_buffer->size();
397 if (size < BUFFER_SIZE) return;
401 void xml_tree::flush(int fd)
403 uflush_r(fd, print_buffer->size());
407 void xml_tree::uflush_r(int fd, size_t s)
409 if (s == 0 || print_buffer == 0 || fd <= 0) return;
412 written = write(fd, print_buffer->data(), s);
413 if ((written < 0) && (errno == EAGAIN || errno == EINTR)){
418 print_buffer->clear();
421 void xml_tree::uput_str(std::string s, int fd)
423 print_buffer->append(s);
426 void xml_tree::uputs(const char* s, int fd)
428 print_buffer->append(s);
431 void xml_tree::uputc(const char c, int fd)
433 print_buffer->push_back(c);
437 const char * xml_tree::get_tag_name_by_ref(xml_tree::tag_t tagid) const
441 if (tagid < 0 || tagid >= tag_names->size())
442 return "<INVALID TAG>";
444 return (const char *) (*tag_names)[tagid].c_str();
447 xml_tree::tag_t xml_tree::register_tag(char *s)
449 auto found = tag_ids->find(std::string(s));
450 if (found == tag_ids->end())
451 return xml_tree::NIL_TAG_ID;
453 return (*found).second;
456 size_t xml_tree::uprintf(const char*s, int fd)
458 if (s == 0) return 0;
461 for (i = 0; (c = s[i]); i++) {
486 void xml_tree::print(xml_tree::node_t x, int fd, bool no_text)
489 if (print_buffer == 0) {
490 print_buffer = new std::string(BUFFER_SIZE, 0);
491 print_buffer->clear();
492 print_stack = new std::vector<std::string>();
493 print_stack->reserve(256);
496 xml_tree::node_t fin = bp_find_close(par, x);
497 xml_tree::node_t n = x;
498 xml_tree::tag_t label = tag(n);
499 unsigned char * orig_text;
500 unsigned char * current_text;
502 auto r = text_id_range(x);
503 if (r.first == xml_tree::NIL)
506 current_text = text_collection->GetText(r.first, r.second);
507 current_text += (current_text[0] == 1);
510 //fprintf(stderr, "Printing node %i, tag: %s\n", x, get_tag_name_by_ref(tag(x)));
511 // fprintf(stderr, "Beggining of text is (%i):%s\n", r.first, current_text);
516 orig_text = current_text;
522 if (bp_inspect(par, n)) {
523 if (label == xml_tree::PCDATA_OPEN_TAG_ID){
527 read = uprintf( (const char*) current_text, fd);
528 current_text += read + 1;
530 n += 2; // skip closin $
535 uput_str((*tag_names)[label], fd);
537 if (bp_inspect(par, n)) {
538 print_stack->push_back((*tag_names)[label]);
540 if (label == xml_tree::ATTRIBUTE_OPEN_TAG_ID) {
542 if (no_text) uputs("><@@>", fd);
544 while (bp_inspect(par, n))
547 uputs((const char*) &(get_tag_name_by_ref(tag(n))[3]), fd);
549 uputs("<$@/></", fd);
550 uputs((const char*) &(get_tag_name_by_ref(tag(n))[3]), fd);
555 uputs((const char*) &(get_tag_name_by_ref(tag(n))[3]), fd);
558 read = uprintf((const char*) current_text, fd);
559 current_text += read + 1;
579 uput_str(print_stack->back(), fd);
581 print_stack->pop_back();
583 } while (!bp_inspect(par, n) && !print_stack->empty());
587 if (orig_text && text_index_type != TextCollectionBuilder::index_type_default)
588 if (*orig_text == '\0')
589 text_collection->DeleteText(orig_text - 1);
591 text_collection->DeleteText(orig_text);
595 // void xml_tree::print(xml_tree::node_t x, int fd, bool no_text)
597 // if (print_buffer == 0) {
598 // print_buffer = new std::string(BUFFER_SIZE, 0);
599 // print_buffer->clear();
600 // print_stack = new std::vector<std::string>();
601 // print_stack->reserve(256);
604 // xml_tree::node_t fin = bp_find_close(par, x);
605 // xml_tree::node_t n = x;
606 // xml_tree::tag_t label = tag(n);
607 // unsigned char * current_text;
610 // while (n <= fin) {
612 // if (bp_inspect(par, n)) {
613 // if (label == xml_tree::PCDATA_OPEN_TAG_ID){
615 // uputs("<$/>", fd);
617 // current_text = get_text(text_id(n));
618 // uprintf( (const char*) (current_text + (current_text[0] == 1)), fd);
620 // if (current_text && text_index_type != TextCollectionBuilder::index_type_default)
621 // text_collection->DeleteText(current_text);
623 // n += 2; // skip closin $
628 // uput_str((*tag_names)[label], fd);
630 // if (bp_inspect(par, n)) {
631 // print_stack->push_back((*tag_names)[label]);
633 // if (label == xml_tree::ATTRIBUTE_OPEN_TAG_ID) {
635 // if (no_text) uputs("><@@>", fd);
637 // while (bp_inspect(par, n))
640 // uputs((const char*) &(get_tag_name_by_ref(tag(n))[3]), fd);
642 // uputs("<$@/></", fd);
643 // uputs((const char*) &(get_tag_name_by_ref(tag(n))[3]), fd);
648 // uputs((const char*) &(get_tag_name_by_ref(tag(n))[3]), fd);
651 // current_text = get_text(text_id(n));
652 // uprintf((const char*) (current_text + (current_text[0] == 1)), fd);
653 // if (current_text && text_index_type != TextCollectionBuilder::index_type_default)
654 // text_collection->DeleteText(current_text);
660 // uputs("</@@>", fd);
661 // else uputc('>', fd);
674 // uput_str(print_stack->back(), fd);
676 // print_stack->pop_back();
678 // } while (!bp_inspect(par, n) && !print_stack->empty());
687 static inline uchar * next_char(uchar *s, size_t &numtexts)
695 if (numtexts == 0) return 0;
703 static inline bool naive_char_contains(uchar const *s, uchar c, size_t numtexts)
706 while(numtexts != 0){
708 if (c == sc) return true;
709 if (sc == 0) numtexts--;
715 bool xml_tree::naive_contains(xml_tree::node_t n, uchar const *w) const
719 // fprintf(stderr, "Calling naive_contains on node: %i, with tag: %s\n",
721 // get_tag_name_by_ref(tag(n)));
723 std::pair<int32_t, int32_t> range = text_id_range(n);
725 //pattern is at least one char
726 if (range.first == xml_tree::NIL)
729 uchar * text = this->text_collection->GetText(range.first, range.second);
731 subtree_tags(n, ATTRIBUTE_DATA_OPEN_TAG_ID) +
732 subtree_tags(n, PCDATA_OPEN_TAG_ID);
735 return naive_char_contains(text, w[0], num_texts);
743 // fprintf(stderr, "Current char in s: %c, num_texts is: %lu\n", *s, num_texts);
747 nnum_texts = num_texts;
749 // fprintf(stderr, " Current char in w: %c, num_texts is: %lu\n", *ww, num_texts);
750 // fprintf(stderr, " Current char in s: %c\n", *ss);
753 if (*ww == 0) return true;
754 if (*ww != *ss) break;
756 ss = next_char(ss, nnum_texts);
757 if (ss == 0) return (*ww == 0);
759 // fprintf(stderr, "Not found, returning\n");
761 // fprintf(stderr, "Current string s is: %s\n", s);
762 s = next_char(s, num_texts);
763 if (s == 0) return false;
764 // fprintf(stderr, "After next_char, string s is: %s\n", s);