Lines Matching defs:RL
2056 // RL - ... primary split sends to the right and the surrogate split sends to the left
2063 int LL = 0, RL = 0, LR, RR;
2079 // now iteratively compute LL, LR, RL and RR for every possible surrogate split value.
2095 RL++; RR--;
2096 if( RL + LR > _best_val && sorted[i].val + epsilon < sorted[i+1].val )
2098 best_val = RL + LR;
2107 double LL = 0, RL = 0, LR, RR;
2128 // now iteratively compute LL, LR, RL and RR for every possible surrogate split value.
2146 RL += w; RR -= w;
2147 if( RL + LR > best_val && sorted[i].val + epsilon < sorted[i+1].val )
2149 best_val = RL + LR;
2169 // RL - ... primary split sends to the right and the surrogate split sends to the left
