Searched refs:right (Results 1 – 9 of 9) sorted by relevance
29 struct heap_node* right; member85 sibling = child->right; in heap_node_swap()87 child->right = parent; in heap_node_swap()95 if (parent->right != NULL) in heap_node_swap()116 newnode->right = NULL; in HEAP_EXPORT()131 child = &(*child)->right; in HEAP_EXPORT()174 max = &(*max)->right; in HEAP_EXPORT()197 child->right = node->right; in HEAP_EXPORT()204 if (child->right != NULL) { in HEAP_EXPORT()224 if (child->right != NULL && less_than(child->right, smallest)) in HEAP_EXPORT()[all …]
7 Prepare handles will run the given callback once per loop iteration, right
7 Check handles will run the given callback once per loop iteration, right
7 Idle handles will run the given callback once per loop iteration, right
72 #. Pending callbacks are called. All I/O callbacks are called right after polling for I/O, for the79 #. Prepare handle callbacks are called. Prepare handles get their callbacks called right before97 #. Check handle callbacks are called. Check handles get their callbacks called right after the
159 Licensor waives and/or agrees not to assert any right or191 1. Moral rights, such as the right of integrity, are not202 3. To the extent possible, the Licensor waives any right to207 reserves any right to collect such royalties.267 a. for the avoidance of doubt, Section 2(a)(1) grants You the right320 b. Where Your right to use the Licensed Material has terminated under330 right the Licensor may have to seek remedies for Your violations
314 quite simple as long as your library exports the right symbols. Be careful with430 *n* C Moves cursor right by n columns
358 a mutex or rwlock to ensure accesses are performed in the right order.
413 passing in the handle (``client``) as the right argument. With this our
Completed in 23 milliseconds
