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;
99 tag_names = new std::vector<std::string>();
100 tag_names->resize(tag_ids->size());
101 this->attribute_ids = new std::unordered_set<xml_tree::tag_t>();
102 std::unordered_map<std::string, tag_t>::iterator val;
103 for(val = this->tag_ids->begin(); val != this->tag_ids->end(); ++val){
104 (*tag_names)[val->second] = val->first;
105 if (val->first.size() >= 3 &&
106 val->first[0] == '<' &&
107 val->first[1] == '@' &&
108 val->first[2] == '>'){
109 this->attribute_ids->insert(val->second);
113 uint32_t max_tag = tag_names->size() - 1;
114 bit_vector *tmp_bitmap = new bit_vector(npar, 1, 0);
116 for(int32_t i = 0; i <= max_tag; i++){
118 for (size_t k = 0; k < npar; k++){
119 bool t = (i == (*tags_)[k]);
120 tmp_bitmap->set(k, t);
123 buff = tmp_bitmap->get_vector_ptr();
124 this->tags.push_back(new static_bitsequence_sdarray(buff, npar, ones));
130 //static_bitsequence_builder *bmb = new static_bitsequence_builder_sdarray();
131 //alphabet_mapper *am = new alphabet_mapper_none();
133 // this->tags = new static_sequence_bs((uint32_t*)&((*tags)[0]), npar, am, bmb);
135 bits_per_tag = bits8(max_tag);
137 tag_seq = new uint32_t[uint_len(bits_per_tag, tag_seq_len)];
138 for(size_t i = 0; i < (size_t) tag_seq_len; i++)
139 set_field(tag_seq, bits_per_tag, i, (uint32_t) (*tags_)[i]);
148 uint32_t * textbm = textbitmap->get_vector_ptr();
149 text_positions = new static_bitsequence_rrr02(textbm,
155 this->text_index_type = idx_type;
156 text_collection = tc_builder->InitTextCollection();
162 xml_tree::~xml_tree()
166 for(int i = 0; i < tag_names->size(); i++){
175 delete attribute_ids;
176 if (text_collection) delete text_collection;
177 if (text_positions) delete text_positions;
180 bool xml_tree::is_child(xml_tree::node_t x, xml_tree::node_t y) const
182 return !is_leaf(x) && is_ancestor(y, x) && depth(x)+1 == depth(y);
185 uint32_t xml_tree::depth(xml_tree::node_t x) const
187 return bp_depth(this->par, x);
191 uint32_t xml_tree::preorder(xml_tree::node_t x) const
193 return bp_preorder_rank(this->par, x);
196 uint32_t xml_tree::postorder(xml_tree::node_t x) const
198 return bp_postorder_rank(this->par, x);
202 xml_tree::select_child(xml_tree::node_t x, xml_tree::tag_t *tags) const
204 if (is_nil(x) || is_leaf(x)) return xml_tree::NIL;
205 xml_tree::node_t child = first_child(x);
206 if (array_mem(tags, tag(child))) return child;
207 return select_sibling(child, tags);
212 xml_tree::select_sibling(xml_tree::node_t x, xml_tree::tag_t *tags) const
214 xml_tree::node_t sibling = next_sibling(x);
216 while(!is_nil(sibling)) {
218 if (array_mem(tags, t)) return sibling;
219 sibling = next_sibling(sibling);
225 void xml_tree::save(int fd, char* s)
230 fp = fdopen(fd2, "w");
232 if (fd == 0) throw(std::runtime_error(strerror(errno)));
233 saveTree(par, fp); //TODO use new api
235 int ntags = tag_names->size();
237 ufwrite(&ntags, sizeof(int), 1, fp);
238 for (int i = 0; i < ntags;i++)
239 fprintf(fp, "%s\n", tag_names->at(i).c_str());
242 for(int i = 0; i < ntags; i++)
245 ufwrite(&bits_per_tag, sizeof(uint),1,fp);
246 ufwrite(&tag_seq_len, sizeof(uint),1,fp);
247 ufwrite(tag_seq, sizeof(uint), uint_len(bits_per_tag, tag_seq_len), fp);
249 bool disable_tc = text_collection == 0 || text_positions == 0;
251 ufwrite(&disable_tc, sizeof(bool),1,fp);
254 text_positions->save(fp);
255 ufwrite(&text_index_type,
256 sizeof(TextCollectionBuilder::index_type_t),
260 switch (text_index_type){
261 case TextCollectionBuilder::index_type_default:
262 file.append("_default");
264 case TextCollectionBuilder::index_type_swcsa:
265 file.append("_swcsa");
267 case TextCollectionBuilder::index_type_rlcsa:
268 file.append("_rlcsa");
272 text_collection->Save(fp, file.c_str());
280 xml_tree* xml_tree::load(int fd, char* name, bool load_tc, int sf)
287 fp = fdopen(fd, "r");
288 xml_tree *tree = new xml_tree();
290 tree->par = loadTree(fp); //TODO use new api
291 tree->tag_names = new std::vector<std::string>();
292 tree->tag_ids = new std::unordered_map<std::string, xml_tree::tag_t>();
293 tree->attribute_ids = new std::unordered_set<xml_tree::tag_t>();
297 ufread(&ntags, sizeof(int), 1, fp);
299 for (i = 0; i < ntags; i++) {
300 if (fgets(buffer, 1022, fp) != buffer)
301 throw std::runtime_error("xml_tree::load: cannot read tag list");
303 // remove the trailing \n
305 tree->tag_names->push_back(s);
306 tree->tag_ids->insert(std::make_pair(s,
307 static_cast<xml_tree::tag_t>(i)));
308 if (s.size() >= 3 && s[0] == '<' && s[1] == '@' && s[2] == '>'){
309 tree->attribute_ids->insert(static_cast<xml_tree::tag_t>(i));
314 for(int i = 0; i < ntags; i++){
315 tree->tags.push_back(static_bitsequence_sdarray::load(fp));
318 //tree->tags = static_sequence_bs::load(fp);
319 ufread(&tree->bits_per_tag, sizeof(uint), 1, fp);
320 //fprintf(stderr, "\nBits per tag: %u\n", tree->bits_per_tag);
321 ufread(&tree->tag_seq_len, sizeof(uint), 1, fp);
322 size_t size = uint_len(tree->bits_per_tag, tree->tag_seq_len);
323 tree->tag_seq = new uint[size];
324 ufread(tree->tag_seq, sizeof(uint), size, fp);
327 ufread(&disable_tc, sizeof(bool), 1, fp);
329 if (disable_tc || !load_tc) {
330 tree->text_positions = 0;
331 tree->text_collection = 0;
334 tree->text_positions = static_bitsequence_rrr02::load(fp);
336 ufread(&tree->text_index_type,
337 sizeof(TextCollectionBuilder::index_type_t), 1, fp);
339 std::string file(name);
340 switch (tree->text_index_type){
341 case TextCollectionBuilder::index_type_default:
342 file.append("_default");
344 case TextCollectionBuilder::index_type_swcsa:
345 file.append("_swcsa");
347 case TextCollectionBuilder::index_type_rlcsa:
348 file.append("_rlcsa");
353 tree->text_collection =
354 TextCollection::Load(fp,
356 TextCollection::index_mode_default,
365 uint32_t xml_tree::num_children(xml_tree::node_t x) const
367 return bp_degree(par, x);
370 uint32_t xml_tree::child_pos(xml_tree::node_t x) const
372 return bp_child_rank(par, x);
375 xml_tree::node_t xml_tree::child(xml_tree::node_t x, uint32_t i) const
377 if (i < 10) return bp_naive_child(par, x, i);
378 else bp_child(par, x, i);
381 std::pair<int32_t, int32_t> xml_tree::text_id_range(xml_tree::node_t x) const
384 xml_tree::node_t y = bp_find_close(par, x);
388 i = text_positions->rank1(x-1);
389 j = text_positions->rank1(y);
392 return std::make_pair(xml_tree::NIL, xml_tree::NIL);
394 return std::make_pair(i, j);
397 int32_t xml_tree::text_id(xml_tree::node_t x) const
399 return (int32_t) text_positions->rank1(x) - 1;
402 const char* xml_tree::get_text(int32_t id) const
404 const char * s = reinterpret_cast<const char*>(text_collection->GetText(id));
405 return s + (s[0] == 1);
408 void xml_tree::uflush(int fd)
410 size_t size = print_buffer->size();
411 if (size < BUFFER_SIZE) return;
415 void xml_tree::flush(int fd)
417 uflush_r(fd, print_buffer->size());
421 void xml_tree::uflush_r(int fd, size_t s)
423 if (s == 0 || print_buffer == 0 || fd <= 0) return;
426 written = write(fd, print_buffer->data(), s);
427 if ((written < 0) && (errno == EAGAIN || errno == EINTR)){
432 print_buffer->clear();
435 void xml_tree::uput_str(std::string s, int fd)
437 print_buffer->append(s);
440 void xml_tree::uputs(const char* s, int fd)
442 print_buffer->append(s);
445 void xml_tree::uputc(const char c, int fd)
447 print_buffer->push_back(c);
451 const char * xml_tree::get_tag_name_by_ref(xml_tree::tag_t tagid) const
453 if (tagid < 0 || tagid >= tag_names->size())
454 return "<INVALID TAG>";
456 return (*tag_names)[tagid].c_str();
459 xml_tree::tag_t xml_tree::register_tag(char *s)
461 std::unordered_map<std::string, tag_t>::iterator found;
462 found = tag_ids->find(std::string(s));
463 if (found == tag_ids->end())
464 return xml_tree::NIL_TAG_ID;
466 return (*found).second;
469 size_t xml_tree::uprintf(const char*s, int fd)
471 if (s == 0) return 0;
474 for (i = 0; (c = s[i]); i++) {
499 void xml_tree::print(xml_tree::node_t x, int fd, bool no_text)
502 if (print_buffer == 0) {
503 print_buffer = new std::string(BUFFER_SIZE, 0);
504 print_buffer->clear();
505 print_stack = new std::vector<std::string>();
506 print_stack->reserve(256);
509 xml_tree::node_t fin = bp_find_close(par, x);
510 xml_tree::node_t n = x;
511 xml_tree::tag_t label = tag(n);
512 unsigned char * orig_text;
513 unsigned char * current_text;
515 std::pair<int32_t, int32_t> r = text_id_range(x);
516 if (r.first == xml_tree::NIL)
519 current_text = text_collection->GetText(r.first, r.second);
520 current_text += (current_text[0] == 1);
523 //fprintf(stderr, "Printing node %i, tag: %s\n", x, get_tag_name_by_ref(tag(x)));
524 // fprintf(stderr, "Beggining of text is (%i):%s\n", r.first, current_text);
529 orig_text = current_text;
535 if (bp_inspect(par, n)) {
536 if (label == xml_tree::PCDATA_OPEN_TAG_ID){
540 read = uprintf( (const char*) current_text, fd);
541 current_text += read + 1;
543 n += 2; // skip closin $
548 uput_str((*tag_names)[label], fd);
550 if (bp_inspect(par, n)) {
551 print_stack->push_back((*tag_names)[label]);
553 if (label == xml_tree::ATTRIBUTE_OPEN_TAG_ID) {
555 if (no_text) uputs("><@@>", fd);
557 while (bp_inspect(par, n))
560 uputs((const char*) &(get_tag_name_by_ref(tag(n))[3]), fd);
562 uputs("<$@/></", fd);
563 uputs((const char*) &(get_tag_name_by_ref(tag(n))[3]), fd);
568 uputs((const char*) &(get_tag_name_by_ref(tag(n))[3]), fd);
571 current_text += (current_text[0] == 1);
572 read = uprintf((const char*) current_text, fd);
573 current_text += read + 1;
593 uput_str(print_stack->back(), fd);
595 print_stack->pop_back();
597 } while (!bp_inspect(par, n) && !print_stack->empty());
601 if (orig_text && text_index_type != TextCollectionBuilder::index_type_default)
602 if (*orig_text == '\0')
603 text_collection->DeleteText(orig_text - 1);
605 text_collection->DeleteText(orig_text);
610 static inline uchar * next_char(uchar *s, size_t &numtexts)
618 if (numtexts == 0) return 0;
626 static inline bool naive_char_contains(uchar const *s, uchar c, size_t numtexts)
629 while(numtexts != 0){
631 if (c == sc) return true;
632 if (sc == 0) numtexts--;
638 bool xml_tree::naive_contains(xml_tree::node_t n, uchar const *w) const
642 // fprintf(stderr, "Calling naive_contains on node: %i, with tag: %s\n",
644 // get_tag_name_by_ref(tag(n)));
646 std::pair<int32_t, int32_t> range = text_id_range(n);
648 //pattern is at least one char
649 if (range.first == xml_tree::NIL)
652 uchar * text = this->text_collection->GetText(range.first, range.second);
654 subtree_tags(n, ATTRIBUTE_DATA_OPEN_TAG_ID) +
655 subtree_tags(n, PCDATA_OPEN_TAG_ID);
658 return naive_char_contains(text, w[0], num_texts);
666 // fprintf(stderr, "Current char in s: %c, num_texts is: %lu\n", *s, num_texts);
670 nnum_texts = num_texts;
672 // fprintf(stderr, " Current char in w: %c, num_texts is: %lu\n", *ww, num_texts);
673 // fprintf(stderr, " Current char in s: %c\n", *ss);
676 if (*ww == 0) return true;
677 if (*ww != *ss) break;
679 ss = next_char(ss, nnum_texts);
680 if (ss == 0) return (*ww == 0);
682 // fprintf(stderr, "Not found, returning\n");
684 // fprintf(stderr, "Current string s is: %s\n", s);
685 s = next_char(s, num_texts);
686 if (s == 0) return false;
687 // fprintf(stderr, "After next_char, string s is: %s\n", s);