Lines Matching refs:tree
51 #define nxt_rbtree_root(tree) \ argument
52 ((tree)->sentinel.left)
55 #define nxt_rbtree_sentinel(tree) \ argument
56 (&(tree)->sentinel)
59 #define nxt_rbtree_is_empty(tree) \ argument
60 (nxt_rbtree_root(tree) == nxt_rbtree_sentinel(tree))
63 #define nxt_rbtree_min(tree) \ argument
64 nxt_rbtree_branch_min(tree, &(tree)->sentinel)
68 nxt_rbtree_branch_min(nxt_rbtree_t *tree, nxt_rbtree_node_t *node) in nxt_rbtree_branch_min() argument
70 while (node->left != nxt_rbtree_sentinel(tree)) { in nxt_rbtree_branch_min()
78 #define nxt_rbtree_is_there_successor(tree, node) \ argument
79 ((node) != nxt_rbtree_sentinel(tree))
83 nxt_rbtree_node_successor(nxt_rbtree_t *tree, nxt_rbtree_node_t *node) in nxt_rbtree_node_successor() argument
87 if (node->right != nxt_rbtree_sentinel(tree)) { in nxt_rbtree_node_successor()
88 return nxt_rbtree_branch_min(tree, node->right); in nxt_rbtree_node_successor()
107 NXT_EXPORT void nxt_rbtree_init(nxt_rbtree_t *tree,
109 NXT_EXPORT void nxt_rbtree_insert(nxt_rbtree_t *tree, nxt_rbtree_part_t *node);
110 NXT_EXPORT nxt_rbtree_node_t *nxt_rbtree_find(nxt_rbtree_t *tree,
112 NXT_EXPORT nxt_rbtree_node_t *nxt_rbtree_find_less_or_equal(nxt_rbtree_t *tree,
115 *nxt_rbtree_find_greater_or_equal(nxt_rbtree_t *tree,
117 NXT_EXPORT void nxt_rbtree_delete(nxt_rbtree_t *tree, nxt_rbtree_part_t *node);
127 NXT_EXPORT nxt_rbtree_node_t *nxt_rbtree_destroy_next(nxt_rbtree_t *tree,