Lines Matching refs:TEST
47 #define TEST(m,cond) G_STMT_START { failed = !(cond); \
101 TEST (NULL, g_node_depth (root) == 1 && g_node_max_height (root) == 1);
105 TEST (NULL, root->children == node_B);
114 TEST (NULL, root->children->next == node_F);
124 TEST (NULL, g_node_depth (root) == 1);
125 TEST (NULL, g_node_max_height (root) == 4);
126 TEST (NULL, g_node_depth (node_G->children->next) == 4);
127 TEST (NULL, g_node_n_nodes (root, G_TRAVERSE_LEAFS) == 7);
128 TEST (NULL, g_node_n_nodes (root, G_TRAVERSE_NON_LEAFS) == 4);
129 TEST (NULL, g_node_n_nodes (root, G_TRAVERSE_ALL) == 11);
130 TEST (NULL, g_node_max_height (node_F) == 3);
131 TEST (NULL, g_node_n_children (node_G) == 4);
132 TEST (NULL, g_node_find_child (root, G_TRAVERSE_ALL, C2P ('F')) == node_F);
133 TEST (NULL, g_node_find (root, G_LEVEL_ORDER, G_TRAVERSE_NON_LEAFS, C2P ('I')) == NULL);
134 TEST (NULL, g_node_find (root, G_IN_ORDER, G_TRAVERSE_LEAFS, C2P ('J')) == node_J);
139 TEST (NULL, P2C (node->data) == ('C' + i));
143 TEST (NULL, g_node_child_position (node_G, g_node_nth_child (node_G, i)) == i);
159 TEST (tstring, strcmp (tstring, "ABCDEFGHIJK") == 0);
162 TEST (tstring, strcmp (tstring, "CDEBHIJKGFA") == 0);
165 TEST (tstring, strcmp (tstring, "CBDEAHGIJKF") == 0);
168 TEST (tstring, strcmp (tstring, "ABFCDEGHIJK") == 0);
172 TEST (tstring, strcmp (tstring, "CDEHIJK") == 0);
175 TEST (tstring, strcmp (tstring, "ABFG") == 0);
182 TEST (tstring, strcmp (tstring, "ABFEDCGKJIH") == 0);
189 TEST (tstring, strcmp (tstring, "ABFEDCGLMKJIH") == 0);
205 TEST (NULL, g_node_max_height (root) > 100);
206 TEST (NULL, g_node_n_nodes (root, G_TRAVERSE_ALL) == 1 + 2048);
