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());
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;
106 uint32_t max_tag = tag_names->size() - 1;
107 bit_vector *tmp_bitmap = new bit_vector(npar, 1, 0);
109 for(int32_t i = 0; i <= max_tag; i++){
111 for (size_t k = 0; k < npar; k++){
112 bool t = (i == (*tags_)[k]);
113 tmp_bitmap->set(k, t);
116 buff = tmp_bitmap->get_vector_ptr();
117 this->tags.push_back(new static_bitsequence_sdarray(buff, npar, ones));
123 //static_bitsequence_builder *bmb = new static_bitsequence_builder_sdarray();
124 //alphabet_mapper *am = new alphabet_mapper_none();
126 // this->tags = new static_sequence_bs((uint32_t*)&((*tags)[0]), npar, am, bmb);
128 bits_per_tag = bits8(max_tag);
130 tag_seq = new uint32_t[uint_len(bits_per_tag, tag_seq_len)];
131 for(size_t i = 0; i < (size_t) tag_seq_len; i++)
132 set_field(tag_seq, bits_per_tag, i, (uint32_t) (*tags_)[i]);
141 uint32_t * textbm = textbitmap->get_vector_ptr();
142 text_positions = new static_bitsequence_rrr02(textbm,
148 this->text_index_type = idx_type;
149 text_collection = tc_builder->InitTextCollection();
155 xml_tree::~xml_tree()
159 for(int i = 0; i < tag_names->size(); i++){
168 if (text_collection) delete text_collection;
169 if (text_positions) delete text_positions;
172 bool xml_tree::is_child(xml_tree::node_t x, xml_tree::node_t y) const
174 return !is_leaf(x) && is_ancestor(y, x) && depth(x)+1 == depth(y);
177 uint32_t xml_tree::depth(xml_tree::node_t x) const
179 return bp_depth(this->par, x);
183 uint32_t xml_tree::preorder(xml_tree::node_t x) const
185 return bp_preorder_rank(this->par, x);
188 uint32_t xml_tree::postorder(xml_tree::node_t x) const
190 return bp_postorder_rank(this->par, x);
194 xml_tree::select_child(xml_tree::node_t x, xml_tree::tag_t *tags) const
196 if (is_nil(x) || is_leaf(x)) return xml_tree::NIL;
197 xml_tree::node_t child = first_child(x);
198 if (array_mem(tags, tag(child))) return child;
199 return select_sibling(child, tags);
204 xml_tree::select_sibling(xml_tree::node_t x, xml_tree::tag_t *tags) const
206 xml_tree::node_t sibling = next_sibling(x);
208 while(!is_nil(sibling)) {
210 if (array_mem(tags, t)) return sibling;
211 sibling = next_sibling(sibling);
217 void xml_tree::save(int fd, char* s)
222 fp = fdopen(fd2, "w");
224 if (fd == 0) throw(std::runtime_error(strerror(errno)));
225 saveTree(par, fp); //TODO use new api
227 int ntags = tag_names->size();
229 ufwrite(&ntags, sizeof(int), 1, fp);
230 for (int i = 0; i < ntags;i++)
231 fprintf(fp, "%s\n", tag_names->at(i).c_str());
234 for(int i = 0; i < ntags; i++)
237 ufwrite(&bits_per_tag, sizeof(uint),1,fp);
238 ufwrite(&tag_seq_len, sizeof(uint),1,fp);
239 ufwrite(tag_seq, sizeof(uint), uint_len(bits_per_tag, tag_seq_len), fp);
241 bool disable_tc = text_collection == 0 || text_positions == 0;
243 ufwrite(&disable_tc, sizeof(bool),1,fp);
246 text_positions->save(fp);
247 ufwrite(&text_index_type,
248 sizeof(TextCollectionBuilder::index_type_t),
252 switch (text_index_type){
253 case TextCollectionBuilder::index_type_default:
254 file.append("_default");
256 case TextCollectionBuilder::index_type_swcsa:
257 file.append("_swcsa");
259 case TextCollectionBuilder::index_type_rlcsa:
260 file.append("_rlcsa");
264 text_collection->Save(fp, file.c_str());
272 xml_tree* xml_tree::load(int fd, char* name, bool load_tc, int sf)
279 fp = fdopen(fd, "r");
280 xml_tree *tree = new xml_tree();
282 tree->par = loadTree(fp); //TODO use new api
283 tree->tag_names = new std::vector<std::string>();
284 tree->tag_ids = new std::unordered_map<std::string, xml_tree::tag_t>();
288 ufread(&ntags, sizeof(int), 1, fp);
290 for (i = 0; i < ntags; i++) {
291 if (fgets(buffer, 1022, fp) != buffer)
292 throw std::runtime_error("xml_tree::load: cannot read tag list");
294 // remove the trailing \n
296 tree->tag_names->push_back(s);
297 tree->tag_ids->insert(std::make_pair(s,
298 static_cast<xml_tree::tag_t>(i)));
302 for(int i = 0; i < ntags; i++){
303 tree->tags.push_back(static_bitsequence_sdarray::load(fp));
306 //tree->tags = static_sequence_bs::load(fp);
307 ufread(&tree->bits_per_tag, sizeof(uint), 1, fp);
308 fprintf(stderr, "\nBits per tag: %u\n", tree->bits_per_tag);
309 ufread(&tree->tag_seq_len, sizeof(uint), 1, fp);
310 size_t size = uint_len(tree->bits_per_tag, tree->tag_seq_len);
311 tree->tag_seq = new uint[size];
312 ufread(tree->tag_seq, sizeof(uint), size, fp);
315 ufread(&disable_tc, sizeof(bool), 1, fp);
317 if (disable_tc || !load_tc) {
318 tree->text_positions = 0;
319 tree->text_collection = 0;
322 tree->text_positions = static_bitsequence_rrr02::load(fp);
324 ufread(&tree->text_index_type,
325 sizeof(TextCollectionBuilder::index_type_t), 1, fp);
327 std::string file(name);
328 switch (tree->text_index_type){
329 case TextCollectionBuilder::index_type_default:
330 file.append("_default");
332 case TextCollectionBuilder::index_type_swcsa:
333 file.append("_swcsa");
335 case TextCollectionBuilder::index_type_rlcsa:
336 file.append("_rlcsa");
341 tree->text_collection =
342 TextCollection::Load(fp,
344 TextCollection::index_mode_default,
353 uint32_t xml_tree::num_children(xml_tree::node_t x) const
355 return bp_degree(par, x);
358 uint32_t xml_tree::child_pos(xml_tree::node_t x) const
360 return bp_child_rank(par, x);
363 xml_tree::node_t xml_tree::child(xml_tree::node_t x, uint32_t i) const
365 if (i < 10) return bp_naive_child(par, x, i);
366 else bp_child(par, x, i);
369 std::pair<int32_t, int32_t> xml_tree::text_id_range(xml_tree::node_t x) const
372 xml_tree::node_t y = bp_find_close(par, x);
376 i = text_positions->rank1(x-1);
377 j = text_positions->rank1(y);
378 // fprintf(stderr, "Rank of node %i is %i, rank of closing %i is %i\n", x, i, y, j);
380 return std::make_pair(xml_tree::NIL, xml_tree::NIL);
382 return std::make_pair(i, j);
385 int32_t xml_tree::text_id(xml_tree::node_t x) const
387 return (int32_t) text_positions->rank1(x) - 1;
390 unsigned char* xml_tree::get_text(int32_t id) const
392 unsigned char * s = text_collection->GetText(id);
393 return s + (s[0] == 1);
396 void xml_tree::uflush(int fd)
398 size_t size = print_buffer->size();
399 if (size < BUFFER_SIZE) return;
403 void xml_tree::flush(int fd)
405 uflush_r(fd, print_buffer->size());
409 void xml_tree::uflush_r(int fd, size_t s)
411 if (s == 0 || print_buffer == 0 || fd <= 0) return;
414 written = write(fd, print_buffer->data(), s);
415 if ((written < 0) && (errno == EAGAIN || errno == EINTR)){
420 print_buffer->clear();
423 void xml_tree::uput_str(std::string s, int fd)
425 print_buffer->append(s);
428 void xml_tree::uputs(const char* s, int fd)
430 print_buffer->append(s);
433 void xml_tree::uputc(const char c, int fd)
435 print_buffer->push_back(c);
439 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 (*tag_names)[tagid].c_str();
447 xml_tree::tag_t xml_tree::register_tag(char *s)
449 std::unordered_map<std::string, tag_t>::iterator found;
450 found = tag_ids->find(std::string(s));
451 if (found == tag_ids->end())
452 return xml_tree::NIL_TAG_ID;
454 return (*found).second;
457 size_t xml_tree::uprintf(const char*s, int fd)
459 if (s == 0) return 0;
462 for (i = 0; (c = s[i]); i++) {
487 void xml_tree::print(xml_tree::node_t x, int fd, bool no_text)
490 if (print_buffer == 0) {
491 print_buffer = new std::string(BUFFER_SIZE, 0);
492 print_buffer->clear();
493 print_stack = new std::vector<std::string>();
494 print_stack->reserve(256);
497 xml_tree::node_t fin = bp_find_close(par, x);
498 xml_tree::node_t n = x;
499 xml_tree::tag_t label = tag(n);
500 unsigned char * orig_text;
501 unsigned char * current_text;
503 std::pair<int32_t, int32_t> r = text_id_range(x);
504 if (r.first == xml_tree::NIL)
507 current_text = text_collection->GetText(r.first, r.second);
508 current_text += (current_text[0] == 1);
511 //fprintf(stderr, "Printing node %i, tag: %s\n", x, get_tag_name_by_ref(tag(x)));
512 // fprintf(stderr, "Beggining of text is (%i):%s\n", r.first, current_text);
517 orig_text = current_text;
523 if (bp_inspect(par, n)) {
524 if (label == xml_tree::PCDATA_OPEN_TAG_ID){
528 read = uprintf( (const char*) current_text, fd);
529 current_text += read + 1;
531 n += 2; // skip closin $
536 uput_str((*tag_names)[label], fd);
538 if (bp_inspect(par, n)) {
539 print_stack->push_back((*tag_names)[label]);
541 if (label == xml_tree::ATTRIBUTE_OPEN_TAG_ID) {
543 if (no_text) uputs("><@@>", fd);
545 while (bp_inspect(par, n))
548 uputs((const char*) &(get_tag_name_by_ref(tag(n))[3]), fd);
550 uputs("<$@/></", fd);
551 uputs((const char*) &(get_tag_name_by_ref(tag(n))[3]), fd);
556 uputs((const char*) &(get_tag_name_by_ref(tag(n))[3]), fd);
559 current_text += (current_text[0] == 1);
560 read = uprintf((const char*) current_text, fd);
561 current_text += read + 1;
581 uput_str(print_stack->back(), fd);
583 print_stack->pop_back();
585 } while (!bp_inspect(par, n) && !print_stack->empty());
589 if (orig_text && text_index_type != TextCollectionBuilder::index_type_default)
590 if (*orig_text == '\0')
591 text_collection->DeleteText(orig_text - 1);
593 text_collection->DeleteText(orig_text);
598 static inline uchar * next_char(uchar *s, size_t &numtexts)
606 if (numtexts == 0) return 0;
614 static inline bool naive_char_contains(uchar const *s, uchar c, size_t numtexts)
617 while(numtexts != 0){
619 if (c == sc) return true;
620 if (sc == 0) numtexts--;
626 bool xml_tree::naive_contains(xml_tree::node_t n, uchar const *w) const
630 // fprintf(stderr, "Calling naive_contains on node: %i, with tag: %s\n",
632 // get_tag_name_by_ref(tag(n)));
634 std::pair<int32_t, int32_t> range = text_id_range(n);
636 //pattern is at least one char
637 if (range.first == xml_tree::NIL)
640 uchar * text = this->text_collection->GetText(range.first, range.second);
642 subtree_tags(n, ATTRIBUTE_DATA_OPEN_TAG_ID) +
643 subtree_tags(n, PCDATA_OPEN_TAG_ID);
646 return naive_char_contains(text, w[0], num_texts);
654 // fprintf(stderr, "Current char in s: %c, num_texts is: %lu\n", *s, num_texts);
658 nnum_texts = num_texts;
660 // fprintf(stderr, " Current char in w: %c, num_texts is: %lu\n", *ww, num_texts);
661 // fprintf(stderr, " Current char in s: %c\n", *ss);
664 if (*ww == 0) return true;
665 if (*ww != *ss) break;
667 ss = next_char(ss, nnum_texts);
668 if (ss == 0) return (*ww == 0);
670 // fprintf(stderr, "Not found, returning\n");
672 // fprintf(stderr, "Current string s is: %s\n", s);
673 s = next_char(s, num_texts);
674 if (s == 0) return false;
675 // fprintf(stderr, "After next_char, string s is: %s\n", s);