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 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->rank(label, y) - tags->rank(label, x);
39 inline bool xml_tree::is_leaf(xml_tree::node_t x) const
41 return !bp_inspect(this->par, x+1);
44 inline bool xml_tree::is_open(xml_tree::node_t x) const
46 return bp_inspect(this->par, x);
49 inline bool xml_tree::is_ancestor(xml_tree::node_t x,
50 xml_tree::node_t y) const
52 return bp_is_ancestor(this->par, x, y);
56 xml_tree::is_right_descendant(xml_tree::node_t x,
57 xml_tree::node_t y) const
61 && (y <= bp_parent_close(this->par, x))
62 && (y >= bp_find_close(this->par, x));
65 inline bool xml_tree::is_first_child(xml_tree::node_t x) const
67 return (x <= this->root()) || (bp_inspect(this->par, x - 1));
70 inline bool xml_tree::is_nil(xml_tree::node_t x) const
72 return (x == xml_tree::NIL);
75 inline xml_tree::tag_t xml_tree::tag(xml_tree::node_t x) const
77 if (bits_per_tag == 8)
78 return (xml_tree::tag_t) (((unsigned char*) tag_seq)[x]);
80 return get_field(tag_seq, bits_per_tag, x);
83 inline xml_tree::node_t xml_tree::root() const
85 return xml_tree::ROOT;
89 inline xml_tree::node_t xml_tree::parent(xml_tree::node_t x) const
91 return bp_parent(this->par, x);
94 inline xml_tree::node_t xml_tree::first_child(node_t x) const
96 xml_tree::node_t result = bp_first_child(this->par, x);
100 inline xml_tree::node_t xml_tree::last_child(xml_tree::node_t x) const
103 return xml_tree::NIL;
105 return bp_find_open(this->par, bp_find_close(this->par, x) - 1);
108 inline xml_tree::node_t xml_tree::next_sibling(xml_tree::node_t x) const
110 xml_tree::node_t result = bp_next_sibling(this->par, x);
114 inline xml_tree::node_t xml_tree::prev_sibling(xml_tree::node_t x) const
116 return bp_prev_sibling(this->par, x);
119 inline xml_tree::node_t xml_tree::first_element(xml_tree::node_t x) const
121 xml_tree::node_t n = first_child(x);
122 if (is_nil(n)) return xml_tree::NIL;
124 case xml_tree::ATTRIBUTE_OPEN_TAG_ID:
126 if (is_nil(n) || tag(n) != xml_tree::PCDATA_OPEN_TAG_ID) return n;
128 case PCDATA_OPEN_TAG_ID:
130 return bp_inspect(this->par, n) ? n : xml_tree::NIL;
136 inline xml_tree::node_t xml_tree::next_element(xml_tree::node_t x) const
139 if (is_nil(x)) return x;
140 if (tag(x) == xml_tree::PCDATA_OPEN_TAG_ID){
141 xml_tree::node_t y = x + 2;
142 return bp_inspect(this->par, y) ? y : xml_tree::NIL;
147 inline xml_tree::node_t xml_tree::tagged_next(node_t x, tag_t tag) const
149 return this->tags->select_next(tag, x);
152 inline xml_tree::node_t
153 xml_tree::tagged_descendant(xml_tree::node_t x,
154 xml_tree::tag_t tag) const
156 xml_tree::node_t y = tagged_next(x, tag);
157 return is_nil(y) || !is_ancestor(x, y) ? xml_tree::NIL : y;
160 inline xml_tree::node_t
161 xml_tree::tagged_following_before(xml_tree::node_t x,
163 xml_tree::node_t limit) const
165 xml_tree::node_t close = bp_find_close(this->par, x);
166 xml_tree::node_t s = tagged_next(close, tag);
167 return (s < limit) ? s : xml_tree::NIL;
171 inline xml_tree::node_t xml_tree::tagged_child(xml_tree::node_t x,
172 xml_tree::tag_t t) const
174 xml_tree::node_t c = first_child(x);
175 xml_tree::node_t result;
176 if (is_nil(c) || tag(c) == t)
179 return tagged_sibling(c, t);
182 inline xml_tree::node_t xml_tree::tagged_sibling(xml_tree::node_t x,
183 xml_tree::tag_t t) const
185 xml_tree::node_t sibling = next_sibling(x);
186 xml_tree::tag_t stag;
187 while (sibling != xml_tree::NIL) {
191 sibling = next_sibling(sibling);
196 xml_tree::node_t xml_tree::closing(xml_tree::node_t x) const
198 return bp_find_close(this->par, x);
202 inline SXSI::TextCollection *xml_tree::get_text_collection() const
204 return text_collection;
207 inline xml_tree::node_t xml_tree::parent_node(int32_t d) const
209 return (xml_tree::node_t) text_positions->select1(d + 1);
212 inline SXSI::TextCollection::document_result
213 xml_tree::prefix(uchar const *s) const
215 return text_collection->Prefix(s);
218 inline SXSI::TextCollection::document_result
219 xml_tree::suffix(uchar const *s) const
221 return text_collection->Suffix(s);
224 inline SXSI::TextCollection::document_result
225 xml_tree::equals(uchar const *s) const
227 return text_collection->Equal(s);
230 inline SXSI::TextCollection::document_result
231 xml_tree::contains(uchar const *s) const
233 return text_collection->Contains(s);
236 inline SXSI::TextCollection::document_result
237 xml_tree::less_than(uchar const *s) const
239 return text_collection->LessThan(s);
243 #endif //XML_TREE_INC_HPP_