Cross Reference: /openjdk7/jdk/src/share/classes/java/util/Arrays.java

Lines Matching refs:mid
584         int mid = (low + high) >>> 1;
585         mergeSort(dest, src, low, mid, -off);
586         mergeSort(dest, src, mid, high, -off);
590         if (((Comparable)src[mid-1]).compareTo(src[mid]) <= 0) {
596         for(int i = destLow, p = low, q = mid; i < destHigh; i++) {
597             if (q >= high || p < mid && ((Comparable)src[p]).compareTo(src[q])<=0)
768         int mid = (low + high) >>> 1;
769         mergeSort(dest, src, low, mid, -off, c);
770         mergeSort(dest, src, mid, high, -off, c);
774         if (c.compare(src[mid-1], src[mid]) <= 0) {
780         for(int i = destLow, p = low, q = mid; i < destHigh; i++) {
781             if (q >= high || p < mid && c.compare(src[p], src[q]) <= 0)
875             int mid = (low + high) >>> 1;
876             long midVal = a[mid];
879                 low = mid + 1;
881                 high = mid - 1;
883                 return mid; // key found
956             int mid = (low + high) >>> 1;
957             int midVal = a[mid];
960                 low = mid + 1;
962                 high = mid - 1;
964                 return mid; // key found
1037             int mid = (low + high) >>> 1;
1038             short midVal = a[mid];
1041                 low = mid + 1;
1043                 high = mid - 1;
1045                 return mid; // key found
1118             int mid = (low + high) >>> 1;
1119             char midVal = a[mid];
1122                 low = mid + 1;
1124                 high = mid - 1;
1126                 return mid; // key found
1199             int mid = (low + high) >>> 1;
1200             byte midVal = a[mid];
1203                 low = mid + 1;
1205                 high = mid - 1;
1207                 return mid; // key found
1282             int mid = (low + high) >>> 1;
1283             double midVal = a[mid];
1286                 low = mid + 1;  // Neither val is NaN, thisVal is smaller
1288                 high = mid - 1; // Neither val is NaN, thisVal is larger
1293                     return mid;             // Key found
1295                     low = mid + 1;
1297                     high = mid - 1;
1373             int mid = (low + high) >>> 1;
1374             float midVal = a[mid];
1377                 low = mid + 1;  // Neither val is NaN, thisVal is smaller
1379                 high = mid - 1; // Neither val is NaN, thisVal is larger
1384                     return mid;             // Key found
1386                     low = mid + 1;
1388                     high = mid - 1;
1479             int mid = (low + high) >>> 1;
1480             Comparable midVal = (Comparable)a[mid];
1484                 low = mid + 1;
1486                 high = mid - 1;
1488                 return mid; // key found
1583             int mid = (low + high) >>> 1;
1584             T midVal = a[mid];
1587                 low = mid + 1;
1589                 high = mid - 1;
1591                 return mid; // key found