Lines Matching full:left

89     QTreeNode *left;        /* left subtree */  member
91 gint8 balance; /* height (right) - height (left) */
125 node->left = NULL; in q_tree_node_new()
240 tmp = tmp->left; in q_tree_node_first()
264 tmp = node->left; in q_tree_node_previous()
297 tmp = tmp->left; in q_tree_node_next()
584 node = node->left; in q_tree_insert_internal()
588 child->left = node->left; in q_tree_insert_internal()
590 node->left = child; in q_tree_insert_internal()
607 child->left = node; in q_tree_insert_internal()
627 gboolean left_node = (bparent && node == bparent->left); in q_tree_insert_internal()
628 g_assert(!bparent || bparent->left == node || bparent->right == node); in q_tree_insert_internal()
635 bparent->left = node; in q_tree_insert_internal()
755 node = node->left; in q_tree_remove_internal()
771 g_assert(!parent || parent->left == node || parent->right == node); in q_tree_remove_internal()
772 left_node = (parent && node == parent->left); in q_tree_remove_internal()
780 parent->left = node->left; in q_tree_remove_internal()
790 tmp->left = node->left; in q_tree_remove_internal()
795 parent->left = node->right; in q_tree_remove_internal()
803 /* node has a left child */ in q_tree_remove_internal()
809 tree->root = node->left; in q_tree_remove_internal()
811 parent->left = node->left; in q_tree_remove_internal()
814 parent->right = node->left; in q_tree_remove_internal()
819 QTreeNode *prev = node->left; in q_tree_remove_internal()
829 next = next->left; in q_tree_remove_internal()
838 nextp->left = next->right; in q_tree_remove_internal()
858 next->left = node->left; in q_tree_remove_internal()
864 parent->left = next; in q_tree_remove_internal()
876 bparent->left == balance || in q_tree_remove_internal()
878 left_node = (bparent && balance == bparent->left); in q_tree_remove_internal()
885 bparent->left = balance; in q_tree_remove_internal()
1147 node = node->left; in q_tree_height()
1171 if (node->left->balance > 0) { in q_tree_node_balance()
1172 node->left = q_tree_node_rotate_left(node->left); in q_tree_node_balance()
1206 node = node->left; in q_tree_find_node()
1237 node = node->left; in q_tree_node_search()
1258 node->right = right->left; in q_tree_node_rotate_left()
1263 right->left = node; in q_tree_node_rotate_left()
1290 QTreeNode *left; in q_tree_node_rotate_right() local
1294 left = node->left; in q_tree_node_rotate_right()
1296 if (left->right_child) { in q_tree_node_rotate_right()
1297 node->left = left->right; in q_tree_node_rotate_right()
1300 left->right_child = TRUE; in q_tree_node_rotate_right()
1302 left->right = node; in q_tree_node_rotate_right()
1305 b_bal = left->balance; in q_tree_node_rotate_right()
1309 left->balance = b_bal + 1; in q_tree_node_rotate_right()
1311 left->balance = a_bal + 2; in q_tree_node_rotate_right()
1316 left->balance = b_bal + 1; in q_tree_node_rotate_right()
1318 left->balance = a_bal + b_bal + 2; in q_tree_node_rotate_right()
1323 return left; in q_tree_node_rotate_right()
1338 left_height = q_tree_node_height(node->left); in q_tree_node_height()
1366 g_assert(tmp->left == node); in q_tree_node_check()
1373 left_height = q_tree_node_height(node->left); in q_tree_node_check()
1383 q_tree_node_check(node->left); in q_tree_node_check()