Lines Matching defs:low
558 * low is the index in dest to start sorting
560 * off is the offset to generate corresponding low, high in src
565 int low,
568 int length = high - low;
572 for (int i=low; i<high; i++)
573 for (int j=i; j>low &&
580 int destLow = low;
582 low += off;
584 int mid = (low + high) >>> 1;
585 mergeSort(dest, src, low, mid, -off);
591 System.arraycopy(src, low, dest, destLow, length);
596 for(int i = destLow, p = low, q = mid; i < destHigh; i++) {
744 * low is the index in dest to start sorting
746 * off is the offset into src corresponding to low in dest
751 int low, int high, int off,
753 int length = high - low;
757 for (int i=low; i<high; i++)
758 for (int j=i; j>low && c.compare(dest[j-1], dest[j])>0; j--)
764 int destLow = low;
766 low += off;
768 int mid = (low + high) >>> 1;
769 mergeSort(dest, src, low, mid, -off, c);
775 System.arraycopy(src, low, dest, destLow, length);
780 for(int i = destLow, p = low, q = mid; i < destHigh; i++) {
871 int low = fromIndex;
874 while (low <= high) {
875 int mid = (low + high) >>> 1;
879 low = mid + 1;
885 return -(low + 1); // key not found.
952 int low = fromIndex;
955 while (low <= high) {
956 int mid = (low + high) >>> 1;
960 low = mid + 1;
966 return -(low + 1); // key not found.
1033 int low = fromIndex;
1036 while (low <= high) {
1037 int mid = (low + high) >>> 1;
1041 low = mid + 1;
1047 return -(low + 1); // key not found.
1114 int low = fromIndex;
1117 while (low <= high) {
1118 int mid = (low + high) >>> 1;
1122 low = mid + 1;
1128 return -(low + 1); // key not found.
1195 int low = fromIndex;
1198 while (low <= high) {
1199 int mid = (low + high) >>> 1;
1203 low = mid + 1;
1209 return -(low + 1); // key not found.
1278 int low = fromIndex;
1281 while (low <= high) {
1282 int mid = (low + high) >>> 1;
1286 low = mid + 1; // Neither val is NaN, thisVal is smaller
1295 low = mid + 1;
1300 return -(low + 1); // key not found.
1369 int low = fromIndex;
1372 while (low <= high) {
1373 int mid = (low + high) >>> 1;
1377 low = mid + 1; // Neither val is NaN, thisVal is smaller
1386 low = mid + 1;
1391 return -(low + 1); // key not found.
1475 int low = fromIndex;
1478 while (low <= high) {
1479 int mid = (low + high) >>> 1;
1484 low = mid + 1;
1490 return -(low + 1); // key not found.
1579 int low = fromIndex;
1582 while (low <= high) {
1583 int mid = (low + high) >>> 1;
1587 low = mid + 1;
1593 return -(low + 1); // key not found.