1 #ifndef XML_TREE_INTERNAL__
2 #error "xml-tree-inc.hpp should not be included directly"
5 #ifndef XML_TREE_INC_HPP_
6 #define XML_TREE_INC_HPP_
10 inline uint32_t xml_tree::size() const
12 return tag_seq_len / 2;
15 inline uint32_t xml_tree::num_tags() const
17 return tag_names->size();
20 inline uint32_t xml_tree::subtree_size(xml_tree::node_t x) const
22 return x == root() ? this->par->n/2 : bp_subtree_size(this->par, x);
26 xml_tree::subtree_tags(xml_tree::node_t x, xml_tree::tag_t label) const
28 xml_tree::node_t y = bp_find_close(this->par, x);
31 for (xml_tree::node_t i = x; i <= y; ++i)
32 count += (tag(i) == label);
35 return tags[label]->rank(y) - tags[label]->rank(x);
39 inline uint32_t xml_tree::subtree_elements(xml_tree::node_t x) const
42 int32_t size = bp_subtree_size(par, x) - 1;
43 if (size <= 0) return 0;
44 uint32_t num_texts = subtree_tags(x, xml_tree::PCDATA_OPEN_TAG_ID);
45 uint32_t num_atts = subtree_tags(x, xml_tree::ATTRIBUTE_OPEN_TAG_ID);
46 uint32_t num_att_data = subtree_tags(x, xml_tree::ATTRIBUTE_DATA_OPEN_TAG_ID);
49 size -= 2*num_att_data;
50 return (uint32_t) size;
54 inline bool xml_tree::is_leaf(xml_tree::node_t x) const
56 return !bp_inspect(this->par, x+1);
59 inline bool xml_tree::is_open(xml_tree::node_t x) const
61 return bp_inspect(this->par, x);
64 inline bool xml_tree::is_ancestor(xml_tree::node_t x,
65 xml_tree::node_t y) const
67 return bp_is_ancestor(this->par, x, y);
71 xml_tree::is_right_descendant(xml_tree::node_t x,
72 xml_tree::node_t y) const
76 && (y <= bp_parent_close(this->par, x))
77 && (y >= bp_find_close(this->par, x));
80 inline bool xml_tree::is_first_child(xml_tree::node_t x) const
82 return (x <= this->root()) || (bp_inspect(this->par, x - 1));
85 inline bool xml_tree::is_nil(xml_tree::node_t x) const
87 return (x == xml_tree::NIL);
90 inline xml_tree::tag_t xml_tree::tag(xml_tree::node_t x) const
92 if (bits_per_tag == 8)
93 return (xml_tree::tag_t) (((unsigned char*) tag_seq)[x]);
95 return get_field(tag_seq, bits_per_tag, x);
98 inline xml_tree::node_t xml_tree::root() const
100 return xml_tree::ROOT;
104 inline xml_tree::node_t xml_tree::parent(xml_tree::node_t x) const
106 return bp_parent(this->par, x);
109 inline xml_tree::node_t xml_tree::first_child(node_t x) const
111 xml_tree::node_t result = bp_first_child(this->par, x);
115 inline xml_tree::node_t xml_tree::last_child(xml_tree::node_t x) const
118 return xml_tree::NIL;
120 return bp_find_open(this->par, bp_find_close(this->par, x) - 1);
123 inline xml_tree::node_t xml_tree::next_sibling(xml_tree::node_t x) const
125 xml_tree::node_t result = bp_next_sibling(this->par, x);
129 inline xml_tree::node_t xml_tree::prev_sibling(xml_tree::node_t x) const
131 return bp_prev_sibling(this->par, x);
134 inline xml_tree::node_t xml_tree::first_element(xml_tree::node_t x) const
136 xml_tree::node_t n = first_child(x);
137 if (is_nil(n)) return xml_tree::NIL;
139 case xml_tree::ATTRIBUTE_OPEN_TAG_ID:
141 if (is_nil(n) || tag(n) != xml_tree::PCDATA_OPEN_TAG_ID) return n;
143 case PCDATA_OPEN_TAG_ID:
145 return bp_inspect(this->par, n) ? n : xml_tree::NIL;
151 inline xml_tree::node_t xml_tree::next_element(xml_tree::node_t x) const
154 if (is_nil(x)) return x;
155 if (tag(x) == xml_tree::PCDATA_OPEN_TAG_ID){
156 xml_tree::node_t y = x + 2;
157 return bp_inspect(this->par, y) ? y : xml_tree::NIL;
163 inline xml_tree::node_t xml_tree::tagged_next_close(xml_tree::node_t x,
164 xml_tree::tag_t label) const
166 xml_tree::node_t i=x;
167 for(i = x+1; i < std::min(x+100, this->par->n); i++)
171 return tags[label]->select_next(i);
174 inline xml_tree::node_t xml_tree::tagged_next(xml_tree::node_t x,
175 xml_tree::tag_t label) const
177 return tags[label]->select_next(x);
180 inline xml_tree::node_t
181 xml_tree::tagged_descendant(xml_tree::node_t x,
182 xml_tree::tag_t tag) const
184 xml_tree::node_t y = tagged_next(x, tag);
185 return is_nil(y) || !is_ancestor(x, y) ? xml_tree::NIL : y;
188 inline xml_tree::node_t
189 xml_tree::tagged_following_before(xml_tree::node_t x,
191 xml_tree::node_t limit) const
193 xml_tree::node_t close = bp_find_close(this->par, x);
194 xml_tree::node_t s = tagged_next(close, tag);
195 return (s < limit) ? s : xml_tree::NIL;
199 inline xml_tree::node_t xml_tree::tagged_child(xml_tree::node_t x,
200 xml_tree::tag_t t) const
202 xml_tree::node_t c = first_child(x);
203 xml_tree::node_t result;
204 if (is_nil(c) || tag(c) == t)
207 return tagged_sibling(c, t);
210 inline xml_tree::node_t xml_tree::tagged_sibling(xml_tree::node_t x,
211 xml_tree::tag_t t) const
213 xml_tree::node_t sibling = next_sibling(x);
214 xml_tree::tag_t stag;
215 while (sibling != xml_tree::NIL) {
219 sibling = next_sibling(sibling);
224 inline xml_tree::node_t
225 xml_tree::select_descendant(xml_tree::node_t x, xml_tree::tag_t *tags) const
227 if (is_leaf(x)) return xml_tree::NIL;
228 auto min = xml_tree::NIL;
229 auto aux = xml_tree::NIL;
230 for(; *tags != xml_tree::NIL_TAG_ID; ++tags){
231 aux = tagged_next(x, *tags);
232 if ((unsigned int) aux < (unsigned int) min) min = aux;
234 return (min == xml_tree::NIL || is_ancestor(x, min)) ? min : xml_tree::NIL;
238 inline xml_tree::node_t
239 xml_tree::select_following_before(xml_tree::node_t x, xml_tree::tag_t *tags,
240 xml_tree::node_t limit) const
242 auto min = xml_tree::NIL;
243 auto aux = xml_tree::NIL;
244 auto close = bp_find_close(this->par, x);
246 for(; *tags != xml_tree::NIL_TAG_ID; ++tags){
247 aux = tagged_next(close, *tags);
248 if ((unsigned int) aux < (unsigned int) min) min = aux;
251 return (min == xml_tree::NIL || min < limit) ? min : xml_tree::NIL;
255 xml_tree::node_t xml_tree::closing(xml_tree::node_t x) const
257 return bp_find_close(this->par, x);
261 inline SXSI::TextCollection *xml_tree::get_text_collection() const
263 return text_collection;
266 inline xml_tree::node_t xml_tree::parent_node(int32_t d) const
268 xml_tree::node_t res = text_positions->select1(d+1);
269 return (xml_tree::node_t) res;
272 inline SXSI::TextCollection::document_result
273 xml_tree::prefix(uchar const *s) const
275 return text_collection->Prefix(s);
278 inline SXSI::TextCollection::document_result
279 xml_tree::suffix(uchar const *s) const
281 return text_collection->Suffix(s);
284 inline SXSI::TextCollection::document_result
285 xml_tree::equals(uchar const *s) const
287 return text_collection->Equal(s);
290 inline SXSI::TextCollection::document_result
291 xml_tree::contains(uchar const *s) const
293 return text_collection->Contains(s);
296 inline SXSI::TextCollection::document_result
297 xml_tree::less_than(uchar const *s) const
299 return text_collection->LessThan(s);
303 #endif //XML_TREE_INC_HPP_