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 ) {
47 static void ufread(void *ptr, size_t size, size_t nmemb, FILE *stream)
50 res = fread(ptr,size,nmemb,stream);
52 throw std::runtime_error("ufread I/O error" );
56 static void ufwrite(const void *ptr, size_t size, size_t nmemb, FILE *stream)
59 res = fwrite(ptr,size,nmemb,stream);
61 throw std::runtime_error("ufwrite I/O error");
73 xml_tree::xml_tree(std::vector<int32_t> *tags,
74 std::unordered_map<std::string, int32_t> *tag_ids,
75 bit_vector *parbitmap,
77 SXSI::TextCollectionBuilder *tc_builder,
78 SXSI::TextCollectionBuilder::index_type_t idx_type,
79 bit_vector *textbitmap)
84 size_t npar = parbitmap->size();
87 par = bp_construct(npar,
88 parbitmap->get_vector_ptr(),
92 this->tag_ids = tag_ids;
93 tag_names = new std::vector<std::string>();
94 tag_names->resize(tag_ids->size());
95 for(auto val : *(this->tag_ids))
96 (*this->tag_names)[val.second] = val.first;
98 uint32_t max_tag = tag_names->size() - 1;
99 static_bitsequence_builder *bmb = new static_bitsequence_builder_sdarray();
100 alphabet_mapper *am = new alphabet_mapper_none();
102 this->tags = new static_sequence_bs((uint32_t*)&((*tags)[0]), npar, am, bmb);
103 bits_per_tag = bits8(max_tag);
105 tag_seq = new uint32_t[uint_len(bits_per_tag, tag_seq_len)];
106 for(size_t i = 0; i < (size_t) tag_seq_len; i++)
107 set_field(tag_seq, bits_per_tag, i, (uint32_t) (*tags)[i]);
116 uint32_t * textbm = textbitmap->get_vector_ptr();
117 text_positions = new static_bitsequence_rrr02(textbm,
123 this->text_index_type = idx_type;
124 fprintf(stderr, "Before!\n");
126 text_collection = tc_builder->InitTextCollection();
127 fprintf(stderr, "After!\n");
135 xml_tree::~xml_tree()
143 if (text_collection) delete text_collection;
144 if (text_positions) delete text_positions;
147 bool xml_tree::is_child(xml_tree::node_t x, xml_tree::node_t y) const
149 return !is_leaf(x) && is_ancestor(y, x) && depth(x)+1 == depth(y);
152 uint32_t xml_tree::depth(xml_tree::node_t x) const
154 return bp_depth(this->par, x);
158 uint32_t xml_tree::preorder(xml_tree::node_t x) const
160 return bp_preorder_rank(this->par, x);
163 uint32_t xml_tree::postorder(xml_tree::node_t x) const
165 return bp_postorder_rank(this->par, x);
169 xml_tree::select_child(xml_tree::node_t x,
170 std::unordered_set<tag_t> *tags) const
172 if (is_nil(x) || is_leaf(x)) return xml_tree::NIL;
173 xml_tree::node_t child = first_child(x);
174 if (tags->find(tag(child)) != tags->end()) return child;
175 return select_sibling(child, tags);
179 xml_tree::select_descendant(xml_tree::node_t x,
180 std::unordered_set<tag_t> *tags) const
182 if (is_leaf(x)) return xml_tree::NIL;
183 auto min = xml_tree::NIL;
184 auto aux = xml_tree::NIL;
185 for(auto tag = tags->begin(); tag != tags->end(); ++ tag){
186 aux = tagged_descendant(x, *tag);
187 if ((unsigned int) aux < (unsigned int) min) min = aux;
193 xml_tree::select_sibling(xml_tree::node_t x,
194 std::unordered_set<tag_t> *tags) const
196 xml_tree::node_t sibling = next_sibling(x);
198 while(!is_nil(sibling)) {
200 if (tags->find(t) != tags->end()) return sibling;
201 sibling = next_sibling(sibling);
207 xml_tree::select_following_before(xml_tree::node_t x,
208 std::unordered_set<tag_t> *tags,
209 xml_tree::node_t limit) const
211 auto min = xml_tree::NIL;
212 auto aux = xml_tree::NIL;
213 for(auto tag = tags->begin(); tag != tags->end(); ++tag){
214 aux = tagged_following_before(x, *tag, limit);
215 if ((unsigned int) aux < (unsigned int) min) min = aux;
220 void xml_tree::save(int fd, char* s)
225 fp = fdopen(fd2, "w");
227 if (fd == 0) throw(std::runtime_error(strerror(errno)));
228 saveTree(par, fp); //TODO use new api
230 int ntags = tag_names->size();
232 ufwrite(&ntags, sizeof(int), 1, fp);
233 for (int i = 0; i < ntags;i++)
234 fprintf(fp, "%s\n", tag_names->at(i).c_str());
238 ufwrite(&bits_per_tag, sizeof(uint),1,fp);
239 ufwrite(&tag_seq_len, sizeof(uint),1,fp);
240 ufwrite(tag_seq, sizeof(uint), uint_len(bits_per_tag, tag_seq_len), fp);
242 bool disable_tc = text_collection == 0 || text_positions == 0;
244 ufwrite(&disable_tc, sizeof(bool),1,fp);
245 fprintf(stderr, "whoot\n");
248 text_positions->save(fp);
249 ufwrite(&text_index_type,
250 sizeof(TextCollectionBuilder::index_type_t),
254 switch (text_index_type){
255 case TextCollectionBuilder::index_type_default:
256 file.append("_default");
258 case TextCollectionBuilder::index_type_swcsa:
259 file.append("_swcsa");
261 case TextCollectionBuilder::index_type_rlcsa:
262 file.append("_rlcsa");
266 text_collection->Save(fp, file.c_str());
274 xml_tree* xml_tree::load(int fd, char* name, bool load_tc, int sf)
281 fp = fdopen(fd, "r");
282 xml_tree *tree = new xml_tree();
284 tree->par = loadTree(fp); //TODO use new api
285 tree->tag_names = new std::vector<std::string>();
286 tree->tag_ids = new std::unordered_map<std::string, xml_tree::tag_t>();
290 ufread(&ntags, sizeof(int), 1, fp);
292 for (i = 0; i < ntags; i++) {
293 if (fgets(buffer, 1022, fp) != buffer)
294 throw std::runtime_error("xml_tree::load: cannot read tag list");
296 // remove the trailing \n
298 tree->tag_names->push_back(s);
299 tree->tag_ids->insert(std::make_pair(s,
300 static_cast<xml_tree::tag_t>(i)));
304 tree->tags = static_sequence::load(fp);
305 ufread(&tree->bits_per_tag, sizeof(uint), 1, fp);
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,
348 uint32_t xml_tree::subtree_elements(xml_tree::node_t x) const
351 uint32_t size = bp_subtree_size(par, x);
353 x = bp_first_child(par,x);
357 int s = x + 2*size - 1;
359 tags->rank(xml_tree::PCDATA_OPEN_TAG_ID, s) -
360 tags->rank(xml_tree::PCDATA_OPEN_TAG_ID, x-1);
363 xml_tree::node_t fin = bp_find_close(par, x);
364 xml_tree::node_t y = tags->select_next(xml_tree::ATTRIBUTE_OPEN_TAG_ID, x);
365 while (y != xml_tree::NIL && y < fin){
366 size -= subtree_size(y);
367 y = tags->select_next(xml_tree::ATTRIBUTE_OPEN_TAG_ID, y);
372 uint32_t xml_tree::num_children(xml_tree::node_t x) const
374 return bp_degree(par, x);
377 uint32_t xml_tree::child_pos(xml_tree::node_t x) const
379 return bp_child_rank(par, x);
382 xml_tree::node_t xml_tree::child(xml_tree::node_t x, uint32_t i) const
384 if (i < 10) return bp_naive_child(par, x, i);
385 else bp_child(par, x, i);
388 std::pair<int32_t, int32_t> xml_tree::text_id_range(xml_tree::node_t x) const
391 i = text_positions->rank1(x - 1);
392 j = text_positions->rank1(x + 2 * bp_subtree_size(par, x) - 2);
394 return std::make_pair(xml_tree::NIL, xml_tree::NIL);
396 return std::make_pair(i + 1, j);
399 int32_t xml_tree::text_id(xml_tree::node_t x) const
401 return (int32_t) text_positions->rank1(x) - 1;
404 unsigned char* xml_tree::get_text(int32_t id) const
406 unsigned char * s = text_collection->GetText(id);
407 return s + (s[0] == 1);
410 void xml_tree::uflush(int fd)
412 size_t size = print_buffer->size();
413 if (size < BUFFER_SIZE) return;
416 void xml_tree::flush(int fd)
418 uflush_r(fd, print_buffer->size());
422 void xml_tree::uflush_r(int fd, size_t s)
427 written = write(fd, print_buffer->data(), s);
428 if ((written < 0) && (errno == EAGAIN || errno == EINTR))
432 print_buffer->clear();
434 void xml_tree::uput_str(std::string s, int fd)
436 print_buffer->append(s);
439 void xml_tree::uputs(const char* s, int fd)
441 print_buffer->append(s);
444 void xml_tree::uputc(const char c, int fd)
446 print_buffer->push_back(c);
450 const char * xml_tree::get_tag_name_by_ref(xml_tree::tag_t tagid) const
454 if (tagid < 0 || tagid >= tag_names->size())
455 return "<INVALID TAG>";
457 return (const char *) (*tag_names)[tagid].c_str();
460 xml_tree::tag_t xml_tree::register_tag(char *s)
462 auto 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(int fd, xml_tree::node_t x, bool no_text)
501 if (print_buffer == 0) {
502 print_buffer = new std::string(BUFFER_SIZE, 0);
503 print_buffer->clear();
504 print_stack = new std::vector<std::string>();
505 print_stack->reserve(256);
507 xml_tree::node_t fin = bp_find_close(par, x);
508 xml_tree::node_t n = x;
509 xml_tree::tag_t label = tag(n);
510 unsigned char * orig_text;
511 unsigned char * current_text;
513 auto r = text_id_range(x);
514 if (r.first == xml_tree::NIL)
517 current_text = get_text(r.first);
519 orig_text = current_text;
524 if (bp_inspect(par, n)) {
525 if (label == xml_tree::PCDATA_OPEN_TAG_ID){
529 read = uprintf( (const char*) current_text, fd);
530 current_text += read + 1;
532 n += 2; // skip closin $
537 uput_str((*tag_names)[label], fd);
539 if (bp_inspect(par, n)) {
540 print_stack->push_back((*tag_names)[label]);
542 if (label == xml_tree::ATTRIBUTE_OPEN_TAG_ID) {
544 if (no_text) uputs("><@@>", fd);
546 while (bp_inspect(par, n))
549 uputs((const char*) &(get_tag_name_by_ref(tag(n))[3]), fd);
551 uputs("<$@/></", fd);
552 uputs((const char*) &(get_tag_name_by_ref(tag(n))[3]), fd);
557 uputs((const char*) &(get_tag_name_by_ref(tag(n))[3]), fd);
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);