Lines Matching refs:le
92 ssize_t le; /* boundary of left equal partition */ in tqs_algorithm() local
116 le = rand() % n; in tqs_algorithm()
117 swap((void **)&X[0], (void **)&X[le]); in tqs_algorithm()
119 le = l = 1; in tqs_algorithm()
126 swap((void **)&X[le++], (void **)&X[l]); in tqs_algorithm()
146 p = MIN(le, l - le); in tqs_algorithm()
154 p = l - le; in tqs_algorithm()
190 ssize_t le; /* boundary of left equal partition */ in rqs_algorithm() local
213 le = rand() % n; in rqs_algorithm()
214 swap((void **)&X[0], (void **)&X[le]); in rqs_algorithm()
217 le = l = 1; in rqs_algorithm()
224 t = X[le]; in rqs_algorithm()
225 X[le] = X[l]; in rqs_algorithm()
227 le++; in rqs_algorithm()
256 p = MIN(le, l - le); in rqs_algorithm()
268 p = l - le; in rqs_algorithm()
272 if (le + n - re - 1 <= 1) in rqs_algorithm()
284 n = le + n - re - 1; in rqs_algorithm()
291 tqs_algorithm(&X[p], le + n - re - 1, collate_fcn, coll_flags); in rqs_algorithm()