Lines Matching defs:LL
2054 // LL - number of samples that both the primary and the surrogate splits send 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.
2086 LL++; LR--;
2087 if( LL + RR > _best_val && sorted[i].val + epsilon < sorted[i+1].val )
2089 best_val = LL + RR;
2107 double LL = 0, RL = 0, LR, RR;
2128 // now iteratively compute LL, LR, RL and RR for every possible surrogate split value.
2137 LL += w; LR -= w;
2138 if( LL + RR > best_val && sorted[i].val + epsilon < sorted[i+1].val )
2140 best_val = LL + RR;
2167 // LL - number of samples that both the primary and the surrogate splits send to the left
