Cross Reference: /libcore/ojluni/src/main/java/java/util/Arrays.java

Lines Matching refs:low
1325      * low is the index in dest to start sorting
1327      * off is the offset to generate corresponding low, high in src
1333                                   int low,
1336         int length = high - low;
1340             for (int i=low; i<high; i++)
1341                 for (int j=i; j>low &&
1348         int destLow  = low;
1350         low  += off;
1352         int mid = (low + high) >>> 1;
1353         mergeSort(dest, src, low, mid, -off);
1359             System.arraycopy(src, low, dest, destLow, length);
1364         for(int i = destLow, p = low, q = mid; i < destHigh; i++) {
1755         int low = fromIndex;
1758         while (low <= high) {
1759             int mid = (low + high) >>> 1;
1763                 low = mid + 1;
1769         return -(low + 1);  // key not found.
1836         int low = fromIndex;
1839         while (low <= high) {
1840             int mid = (low + high) >>> 1;
1844                 low = mid + 1;
1850         return -(low + 1);  // key not found.
1917         int low = fromIndex;
1920         while (low <= high) {
1921             int mid = (low + high) >>> 1;
1925                 low = mid + 1;
1931         return -(low + 1);  // key not found.
1998         int low = fromIndex;
2001         while (low <= high) {
2002             int mid = (low + high) >>> 1;
2006                 low = mid + 1;
2012         return -(low + 1);  // key not found.
2079         int low = fromIndex;
2082         while (low <= high) {
2083             int mid = (low + high) >>> 1;
2087                 low = mid + 1;
2093         return -(low + 1);  // key not found.
2162         int low = fromIndex;
2165         while (low <= high) {
2166             int mid = (low + high) >>> 1;
2170                 low = mid + 1;  // Neither val is NaN, thisVal is smaller
2179                     low = mid + 1;
2184         return -(low + 1);  // key not found.
2253         int low = fromIndex;
2256         while (low <= high) {
2257             int mid = (low + high) >>> 1;
2261                 low = mid + 1;  // Neither val is NaN, thisVal is smaller
2270                     low = mid + 1;
2275         return -(low + 1);  // key not found.
2359         int low = fromIndex;
2362         while (low <= high) {
2363             int mid = (low + high) >>> 1;
2370                 low = mid + 1;
2376         return -(low + 1);  // key not found.
2467         int low = fromIndex;
2470         while (low <= high) {
2471             int mid = (low + high) >>> 1;
2475                 low = mid + 1;
2481         return -(low + 1);  // key not found.