Lines Matching refs:right
809 node->left = node->right = 0;
1413 try_split_node( node->right );
1417 // calculate direction (left(-1),right(1),missing(0))
2055 // LR - ... primary split sends to the left and the surrogate split sends to the right
2056 // RL - ... primary split sends to the right and the surrogate split sends to the left
2057 // RR - ... both send to the right
2077 // initially all the samples are sent to the right by the surrogate split,
2078 // LR of them are sent to the left by primary split, and RR - to the right.
2126 // initially all the samples are sent to the right by the surrogate split,
2127 // LR of them are sent to the left by primary split, and RR - to the right.
2168 // LR - ... primary split sends to the left and the surrogate split sends to the right
2169 // RL - ... primary split sends to the right and the surrogate split sends to the left
2170 // RR - ... both send to the right
2181 // sent to the left (lc) and to the right (rc) by the primary split
2500 // make sure that every sample is directed either to the left or to the right
2520 CvDTreeNode *left = 0, *right = 0;
2526 // do not physically split the input data between the left and right child nodes
2543 node->right = right = data->new_node( node, nr, new_buf_idx, node->offset +
2548 node->right->sample_count > data->params.min_sample_count);
2563 rdst0 = rdst = data->get_ord_var_data(right, vi);
2580 right->set_num_valid(vi, (int)(rdst - rdst0));
2610 rdst0 = rdst = data->get_cat_var_data(right, vi);
2626 right->set_num_valid(vi, nr1);
2763 for( parent = node->parent; parent && parent->right == node;
2781 node = parent->right;
2815 for( parent = node->parent; parent && parent->right == node;
2822 node = parent->right;
2847 for( parent = node->parent; parent && parent->right == node;
2853 data->free_node( parent->right );
2854 parent->left = parent->right = 0;
2861 node = parent->right;
2994 double diff = node->right->sample_count - node->left->sample_count;
2997 node = dir < 0 ? node->left : node->right;
3034 for( parent = node->parent; parent && parent->right == node;
3041 node = parent->right;
3142 for( parent = node->parent; parent && parent->right == node;
3149 node = parent->right;
3350 parent->left = parent->right = parent->parent = 0;
3362 parent->right = node;
3367 while( parent && parent->right )
