Lines Matching refs:right
41 index_tree_node *right;
202 if (node->right != NULL)
203 index_tree_node_end(node->right, allocator, free_func);
234 node->right = NULL;
252 tree->rightmost->right = node;
269 index_tree_node *pivot = node->right;
274 assert(node->parent->right == node);
275 node->parent->right = pivot;
280 node->right = pivot->left;
281 if (node->right != NULL)
282 node->right->parent = node;
296 if (node->right != NULL) {
297 node = node->right;
304 while (node->parent != NULL && node->parent->right == node)
330 node = node->right;
352 s->node.right = NULL;
748 index_stream *right = (index_stream *)(this->node.right);
759 if (right != NULL)
760 index_cat_helper(info, right);
800 assert(g->node.right == NULL);
818 assert(g->node.parent->right == &g->node);
819 g->node.parent->right = &newg->node;
1003 assert(group->node.parent->right == &group->node);
1233 size_t right = group->last;
1235 while (left < right) {
1236 const size_t pos = left + (right - left) / 2;
1240 right = pos;