Searched refs:left (Results 1 – 7 of 7) sorted by relevance
28 struct heap_node* left; member83 if (child->left == child) { in heap_node_swap()84 child->left = parent; in heap_node_swap()88 sibling = child->left; in heap_node_swap()93 if (parent->left != NULL) in heap_node_swap()115 newnode->left = NULL; in HEAP_EXPORT()176 max = &(*max)->left; in HEAP_EXPORT()196 child->left = node->left; in HEAP_EXPORT()200 if (child->left != NULL) { in HEAP_EXPORT()222 if (child->left != NULL && less_than(child->left, smallest)) in HEAP_EXPORT()[all …]
293 struct type *left; \295 while ((left = RB_LEFT(elm, field)) != NULL) \296 elm = left; \325 left = parent; \327 RB_AUGMENT(left); \328 } while ((left = RB_PARENT(left, field)) != NULL); \
51 left out.
128 or requests left), or non-zero if more callbacks are expected (meaning132 or requests left), or non-zero if more callbacks are expected (meaning
228 no space left on device
278 active `and` referenced handles left. The user can force the loop to exit early
428 H Moves cursor to certain position, default top-left
Completed in 15 milliseconds