Lines Matching refs:left

222             int left = 0;
225 while (left < right) {
226 int mid = (left + right) >>> 1;
244 left = mid + 1;
248 int n = start - left;
251 positions[left + 2] = positions[left + 1];
252 sortKey[left + 2] = sortKey[left + 1];
253 isDirs[left + 2] = isDirs[left + 1];
254 ids[left + 2] = ids[left + 1];
256 positions[left + 1] = positions[left];
257 sortKey[left + 1] = sortKey[left];
258 isDirs[left + 1] = isDirs[left];
259 ids[left + 1] = ids[left];
262 System.arraycopy(positions, left, positions, left + 1, n);
263 System.arraycopy(sortKey, left, sortKey, left + 1, n);
264 System.arraycopy(isDirs, left, isDirs, left + 1, n);
265 System.arraycopy(ids, left, ids, left + 1, n);
268 positions[left] = pivotPosition;
269 sortKey[left] = pivotValue;
270 isDirs[left] = pivotIsDir;
271 ids[left] = pivotId;
295 int left = 0;
298 while (left < right) {
299 int mid = ((left + right) >>> 1);
327 left = mid + 1;
331 int n = start - left;
334 positions[left + 2] = positions[left + 1];
335 sortKey[left + 2] = sortKey[left + 1];
336 isDirs[left + 2] = isDirs[left + 1];
337 ids[left + 2] = ids[left + 1];
339 positions[left + 1] = positions[left];
340 sortKey[left + 1] = sortKey[left];
341 isDirs[left + 1] = isDirs[left];
342 ids[left + 1] = ids[left];
345 System.arraycopy(positions, left, positions, left + 1, n);
346 System.arraycopy(sortKey, left, sortKey, left + 1, n);
347 System.arraycopy(isDirs, left, isDirs, left + 1, n);
348 System.arraycopy(ids, left, ids, left + 1, n);
351 positions[left] = pivotPosition;
352 sortKey[left] = pivotValue;
353 isDirs[left] = pivotIsDir;
354 ids[left] = pivotId;