MCPcopy Create free account
hub / github.com/acl-dev/acl / xml_node_walk

Function xml_node_walk

lib_acl_cpp/samples/xml/xml5/main.cpp:36–46  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

34}
35
36static void xml_node_walk(acl::xml_node& node, int depth)
37{
38 acl::xml_node* child = node.first_child();
39
40 while (child)
41 {
42 xml_node_print(*child, depth);
43 xml_node_walk(*child, depth + 1);
44 child = node.next_child();
45 }
46}
47
48static void test_build(void)
49{

Callers 1

test_buildFunction · 0.70

Calls 3

xml_node_printFunction · 0.70
first_childMethod · 0.45
next_childMethod · 0.45

Tested by 1

test_buildFunction · 0.56

Used in the wild real call sites across dependent graphs

searching dependent graphs…