Lines Matching refs:root
259 GNode *root;
268 root = g_node_new (C2P ('A'));
269 g_assert (g_node_depth (root) == 1 && g_node_max_height (root) == 1);
272 g_node_append (root, node_B);
273 g_assert (root->children == node_B);
280 g_node_append (root, node_F);
281 g_assert (root->children->next == node_F);
291 g_assert (g_node_depth (root) == 1);
292 g_assert (g_node_max_height (root) == 4);
294 g_assert (g_node_n_nodes (root, G_TRAVERSE_LEAFS) == 7);
295 g_assert (g_node_n_nodes (root, G_TRAVERSE_NON_LEAFS) == 4);
296 g_assert (g_node_n_nodes (root, G_TRAVERSE_ALL) == 11);
299 g_assert (g_node_find_child (root, G_TRAVERSE_ALL, C2P ('F')) == node_F);
300 g_assert (g_node_find (root, G_LEVEL_ORDER, G_TRAVERSE_NON_LEAFS, C2P ('I')) == NULL);
301 g_assert (g_node_find (root, G_IN_ORDER, G_TRAVERSE_LEAFS, C2P ('J')) == node_J);
325 g_node_traverse (root, G_PRE_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &tstring);
328 g_node_traverse (root, G_POST_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &tstring);
331 g_node_traverse (root, G_IN_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &tstring);
334 g_node_traverse (root, G_LEVEL_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &tstring);
338 g_node_traverse (root, G_LEVEL_ORDER, G_TRAVERSE_LEAFS, -1, node_build_string, &tstring);
341 g_node_traverse (root, G_PRE_ORDER, G_TRAVERSE_NON_LEAFS, -1, node_build_string, &tstring);
348 g_node_traverse (root, G_LEVEL_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &tstring);
353 node = g_node_copy (root);
354 g_assert (g_node_n_nodes (root, G_TRAVERSE_ALL) == g_node_n_nodes (node, G_TRAVERSE_ALL));
355 g_assert (g_node_max_height (root) == g_node_max_height (node));
356 g_node_traverse (root, G_IN_ORDER, G_TRAVERSE_ALL, -1, node_build_string, &tstring);
363 g_node_destroy (root);
367 root = g_node_new (NULL);
368 node = root;
376 g_assert (g_node_max_height (root) > 100);
377 g_assert (g_node_n_nodes (root, G_TRAVERSE_ALL) == 1 + 2048);
379 g_node_destroy (root);
