pugixml number of child nodes

Question

Does a pugixml node object have a number-of-child-nodes method? I cannot find it in the documentation and had to use an iterator as follows:

int n = 0;
for (pugi::xml_node ch_node = xMainNode.child("name"); ch_node; ch_node = ch_node.next_sibling("name")) n++;

No worries, I restored it just now before I read your message here. Thank you for the excellent code! — lsdavies, Feb 12 '13 at 03:09

score 19 · Accepted Answer · answered Jan 15 '13 at 05:26

19

There is no built-in function to compute that directly; one other approach is to use std::distance:

size_t n = std::distance(xMainNode.children("name").begin(), xMainNode.children("name").end());

Of course, this is linear in the number of child nodes; note that computing the number of all child nodes, std::distance(xMainNode.begin(), xMainNode.end()), is also linear - there is no constant-time access to child node count.

answered Jan 15 '13 at 05:26

zeuxcg

8,703
1
22
33

8

Note: This is the author of pugixml. – Homer6 Nov 23 '14 at 18:43

score 3 · Answer 2 · answered Jan 28 '13 at 19:09

3

You could use an expression based on an xpath search (no efficiency guarantees, though):

xMainNode.select_nodes( "name" ).size()

answered Jan 28 '13 at 19:09

arayq2

2,295
13
21

score 1 · Answer 3 · answered Aug 29 '20 at 21:30

1

int children_count(pugi::xml_node node)
{
  int n = 0;
  for (pugi::xml_node child : node.children()) n++;
  return n;
}

answered Aug 29 '20 at 21:30

Pedro Vicente

443
1
5
17

1

I think you should explain your answer – Omar Aug 30 '20 at 02:17

pugixml number of child nodes

3 Answers3