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

Lines Matching refs:high
559      * high is the end index in dest to end sorting
560      * off is the offset to generate corresponding low, high in src
566                                   int high,
568         int length = high - low;
572             for (int i=low; i<high; i++)
581         int destHigh = high;
583         high += off;
584         int mid = (low + high) >>> 1;
586         mergeSort(dest, src, mid, high, -off);
597             if (q >= high || p < mid && ((Comparable)src[p]).compareTo(src[q])<=0)
745      * high is the end index in dest to end sorting
751                                   int low, int high, int off,
753         int length = high - low;
757             for (int i=low; i<high; i++)
765         int destHigh = high;
767         high += off;
768         int mid = (low + high) >>> 1;
770         mergeSort(dest, src, mid, high, -off, c);
781             if (q >= high || p < mid && c.compare(src[p], src[q]) <= 0)
872         int high = toIndex - 1;
874         while (low <= high) {
875             int mid = (low + high) >>> 1;
881                 high = mid - 1;
953         int high = toIndex - 1;
955         while (low <= high) {
956             int mid = (low + high) >>> 1;
962                 high = mid - 1;
1034         int high = toIndex - 1;
1036         while (low <= high) {
1037             int mid = (low + high) >>> 1;
1043                 high = mid - 1;
1115         int high = toIndex - 1;
1117         while (low <= high) {
1118             int mid = (low + high) >>> 1;
1124                 high = mid - 1;
1196         int high = toIndex - 1;
1198         while (low <= high) {
1199             int mid = (low + high) >>> 1;
1205                 high = mid - 1;
1279         int high = toIndex - 1;
1281         while (low <= high) {
1282             int mid = (low + high) >>> 1;
1288                 high = mid - 1; // Neither val is NaN, thisVal is larger
1297                     high = mid - 1;
1370         int high = toIndex - 1;
1372         while (low <= high) {
1373             int mid = (low + high) >>> 1;
1379                 high = mid - 1; // Neither val is NaN, thisVal is larger
1388                     high = mid - 1;
1476         int high = toIndex - 1;
1478         while (low <= high) {
1479             int mid = (low + high) >>> 1;
1486                 high = mid - 1;
1580         int high = toIndex - 1;
1582         while (low <= high) {
1583             int mid = (low + high) >>> 1;
1589                 high = mid - 1;