Lines Matching defs:RR
2057 // RR - ... both send to the right
2063 int LL = 0, RL = 0, LR, RR;
2074 RR = (sum_abs + sum) >> 1;
2078 // LR of them are sent to the left by primary split, and RR - to the right.
2079 // now iteratively compute LL, LR, RL and RR for every possible surrogate split value.
2087 if( LL + RR > _best_val && sorted[i].val + epsilon < sorted[i+1].val )
2089 best_val = LL + RR;
2095 RL++; RR--;
2107 double LL = 0, RL = 0, LR, RR;
2123 RR = (sum_abs + sum)*0.5;
2127 // LR of them are sent to the left by primary split, and RR - to the right.
2128 // now iteratively compute LL, LR, RL and RR for every possible surrogate split value.
2138 if( LL + RR > best_val && sorted[i].val + epsilon < sorted[i+1].val )
2140 best_val = LL + RR;
2146 RL += w; RR -= w;
2170 // RR - ... both send to the right
