Home
last modified time | relevance | path

Searched refs:G_TRAVERSE_LEAFS (Results 1 – 4 of 4) sorted by relevance

/third_party/glib/glib/
Dgnode.c546 else if ((flags & G_TRAVERSE_LEAFS) && in g_node_traverse_pre_order()
583 else if ((flags & G_TRAVERSE_LEAFS) && in g_node_depth_traverse_pre_order()
616 else if ((flags & G_TRAVERSE_LEAFS) && in g_node_traverse_post_order()
654 else if ((flags & G_TRAVERSE_LEAFS) && in g_node_depth_traverse_post_order()
691 else if ((flags & G_TRAVERSE_LEAFS) && in g_node_traverse_in_order()
736 else if ((flags & G_TRAVERSE_LEAFS) && in g_node_depth_traverse_in_order()
760 return (flags & G_TRAVERSE_LEAFS) && func (node, data); in g_node_traverse_level()
984 else if (flags & G_TRAVERSE_LEAFS) in g_node_count_func()
1109 if (flags & G_TRAVERSE_LEAFS) in g_node_find_child()
1271 if (flags & G_TRAVERSE_LEAFS) in g_node_children_foreach()
Dgnode.h45 G_TRAVERSE_LEAFS = G_TRAVERSE_LEAVES, enumerator
/third_party/glib/glib/tests/
Dnode.c96 { G_LEVEL_ORDER, G_TRAVERSE_LEAFS, -1, -1, "CDEHIJK" }, in traversal_test()
292 g_assert_cmpint (g_node_n_nodes (root, G_TRAVERSE_LEAFS), ==, 7); in construct_test()
298 g_assert (g_node_find_child (node_G, G_TRAVERSE_LEAFS, C2P ('H')) == node_H); in construct_test()
301 g_assert (g_node_find (root, G_IN_ORDER, G_TRAVERSE_LEAFS, C2P ('J')) == node_J); in construct_test()
/third_party/glib/tests/
Dtestglib.c290 g_assert (g_node_n_nodes (root, G_TRAVERSE_LEAFS) == 7); in gnode_test()
297 g_assert (g_node_find (root, G_IN_ORDER, G_TRAVERSE_LEAFS, C2P ('J')) == node_J); in gnode_test()
334 g_node_traverse (root, G_LEVEL_ORDER, G_TRAVERSE_LEAFS, -1, node_build_string, &tstring); in gnode_test()