xml_tree::node_t y = bp_find_close(this->par, x);
if (y - x < 10) {
uint32_t count = 0;
- for(xml_tree::node_t i = x; i < y; i++)
+ for (xml_tree::node i = x; i <= y; ++i)
count += (tag(i) == label);
return count;
} else {
- return tags[label]->rank(y) - tags[label]->rank(x);
- };
+ return tags[label]->rank(y) - tags[label]->rank(x);
+ }
}
inline uint32_t xml_tree::subtree_elements(xml_tree::node_t x,