Lines Matching refs:left
197 int left = 0;
200 while (left < right) {
201 int mid = (left + right) >>> 1;
234 left = mid + 1;
238 int n = start - left;
241 positions[left + 2] = positions[left + 1];
242 sortKey[left + 2] = sortKey[left + 1];
243 isDirs[left + 2] = isDirs[left + 1];
245 positions[left + 1] = positions[left];
246 sortKey[left + 1] = sortKey[left];
247 isDirs[left + 1] = isDirs[left];
250 System.arraycopy(positions, left, positions, left + 1, n);
251 System.arraycopy(sortKey, left, sortKey, left + 1, n);
252 System.arraycopy(isDirs, left, isDirs, left + 1, n);
255 positions[left] = pivotPosition;
256 sortKey[left] = pivotValue;
257 isDirs[left] = pivotIsDir;
278 int left = 0;
281 while (left < right) {
282 int mid = ((left + right) >>> 1);
318 left = mid + 1;
322 int n = start - left;
325 positions[left + 2] = positions[left + 1];
326 sortKey[left + 2] = sortKey[left + 1];
327 isDirs[left + 2] = isDirs[left + 1];
328 ids[left + 2] = ids[left + 1];
330 positions[left + 1] = positions[left];
331 sortKey[left + 1] = sortKey[left];
332 isDirs[left + 1] = isDirs[left];
333 ids[left + 1] = ids[left];
336 System.arraycopy(positions, left, positions, left + 1, n);
337 System.arraycopy(sortKey, left, sortKey, left + 1, n);
338 System.arraycopy(isDirs, left, isDirs, left + 1, n);
339 System.arraycopy(ids, left, ids, left + 1, n);
342 positions[left] = pivotPosition;
343 sortKey[left] = pivotValue;
344 isDirs[left] = pivotIsDir;
345 ids[left] = pivotId;