Lines Matching defs:direction
82 * int direction; // 0 for "<" (ie. left child); 1 for ">" (right)
222 * NULL: no node in the given direction
226 avl_nearest(avl_tree_t *tree, avl_index_t where, int direction)
238 if (child != direction)
241 return (avl_walk(tree, data, direction));
560 * Insert "new_data" in "tree" in the given "direction" either after or
565 * the AVL_PREV or AVL_NEXT and reverse the insertion direction. Since
576 int direction)
579 int child = direction; /* rely on AVL_BEFORE == 0, AVL_AFTER == 1 */
587 ASSERT(direction == AVL_BEFORE || direction == AVL_AFTER);
591 * node and reverse the insertion direction.