Lines Matching refs:left
135 - lexbor_avl_node_height(node->left)); in lexbor_avl_node_balance_factor()
141 short left_height = lexbor_avl_node_height(node->left); in lexbor_avl_node_set_height()
151 lexbor_avl_node_t *node = pos->left; in lexbor_avl_node_rotate_right()
159 pos->left = node->right; in lexbor_avl_node_rotate_right()
177 if (node->left) { in lexbor_avl_node_rotate_left()
178 node->left->parent = pos; in lexbor_avl_node_rotate_left()
181 pos->right = node->left; in lexbor_avl_node_rotate_left()
184 node->left = pos; in lexbor_avl_node_rotate_left()
198 short left_height = lexbor_avl_node_height(node->left); in lexbor_avl_node_balance()
219 parent->left = lexbor_avl_node_rotate_left(node); in lexbor_avl_node_balance()
220 return parent->left; in lexbor_avl_node_balance()
227 if (lexbor_avl_node_balance_factor(node->left) > 0) { in lexbor_avl_node_balance()
228 node->left = lexbor_avl_node_rotate_left(node->left); in lexbor_avl_node_balance()
239 parent->left = lexbor_avl_node_rotate_right(node); in lexbor_avl_node_balance()
240 return parent->left; in lexbor_avl_node_balance()
277 if (node->left == NULL) { in lexbor_avl_insert()
278 node->left = new_node; in lexbor_avl_insert()
288 node = node->left; in lexbor_avl_insert()
334 if (delete_node->left == node) { in lexbor_avl_rotate_for_delete()
335 balance_node = (node->left) ? node->left : node; in lexbor_avl_rotate_for_delete()
350 node->left = delete_node->left; in lexbor_avl_rotate_for_delete()
352 if (delete_node->left != NULL) { in lexbor_avl_rotate_for_delete()
353 delete_node->left->parent = node; in lexbor_avl_rotate_for_delete()
362 if (delete_node->parent->left == delete_node) { in lexbor_avl_rotate_for_delete()
363 delete_node->parent->left = node; in lexbor_avl_rotate_for_delete()
377 if (balance_node->left == delete_node) { in lexbor_avl_rotate_for_delete()
378 balance_node->left = delete_node->right; in lexbor_avl_rotate_for_delete()
406 avl->last_right = lexbor_avl_find_min(node->left); in lexbor_avl_remove()
415 node = node->left; in lexbor_avl_remove()
429 avl->last_right = lexbor_avl_find_min(node->left); in lexbor_avl_remove_by_node()
444 node = node->left; in lexbor_avl_search()
470 while (node->left != NULL) { in lexbor_avl_foreach()
471 node = node->left; in lexbor_avl_foreach()
482 state = parent->left == node; in lexbor_avl_foreach()
506 else if (parent->left != node && parent->right != node) { in lexbor_avl_foreach()
508 if (parent->left != NULL && parent->left->right != NULL) { in lexbor_avl_foreach()
509 node = parent->left; in lexbor_avl_foreach()
534 while (node->left != NULL) { in lexbor_avl_foreach()
535 node = node->left; in lexbor_avl_foreach()
544 else if (node == parent->left) { in lexbor_avl_foreach()
566 lexbor_avl_foreach_recursion(avl, scope->left, callback, ctx); in lexbor_avl_foreach_recursion()
