Searched refs:right_node (Results 1 – 3 of 3) sorted by relevance
75 node_t *right_node; in tree_recurse() local82 right_node = rbtn_right_get(node_t, link, node); in tree_recurse()94 if (right_node != NULL) { in tree_recurse()95 assert_false(rbtn_red_get(node_t, link, right_node), in tree_recurse()111 if (right_node != NULL) { in tree_recurse()112 ret += tree_recurse(right_node, black_height, black_depth); in tree_recurse()
34 struct graph_node *right_node; member188 node->parent_node->right_node = node; in graph_indent()191 while (node && node->right_node) { in graph_indent()197 node = node->right_node; in graph_indent()
332 auto* right_node = tree->add_nodes(); in AddLeafNodes() local348 right_node->mutable_leaf()->set_scalar(prev_logit_value + in AddLeafNodes()362 right_node->mutable_leaf()->mutable_vector()->add_value( in AddLeafNodes()