Lines Matching refs:le
94 ssize_t le; /* boundary of left equal partition */
118 le = rand() % n;
119 swap((void **)&X[0], (void **)&X[le]);
121 le = l = 1;
128 swap((void **)&X[le++], (void **)&X[l]);
148 p = MIN(le, l - le);
156 p = l - le;
192 ssize_t le; /* boundary of left equal partition */
215 le = rand() % n;
216 swap((void **)&X[0], (void **)&X[le]);
219 le = l = 1;
226 t = X[le];
227 X[le] = X[l];
229 le++;
258 p = MIN(le, l - le);
270 p = l - le;
274 if (le + n - re - 1 <= 1)
282 * Equivalent recursion: rqs_algorithm(&X[p], le + n - re - 1,
286 n = le + n - re - 1;
293 tqs_algorithm(&X[p], le + n - re - 1, collate_fcn, coll_flags);