| /libcore/luni/src/main/native/ |
| D | java_io_ObjectStreamClass.cpp | 24 jmethodID mid = env->GetMethodID(c, "getSignature", "()Ljava/lang/String;"); in getSignature() local
25 if (!mid) { in getSignature()
29 return env->CallNonvirtualObjectMethod(object, objectClass, mid); in getSignature()
45 jmethodID mid = env->GetStaticMethodID(targetClass, "<clinit>", "()V"); in ObjectStreamClass_hasClinit() local
47 return (mid != 0); in ObjectStreamClass_hasClinit()
|
| /libcore/luni/src/main/java/java/util/ |
| D | Arrays.java | 194 int mid = (lo + hi) >>> 1; in binarySearch() local
195 byte midVal = array[mid]; in binarySearch()
198 lo = mid + 1; in binarySearch()
200 hi = mid - 1; in binarySearch()
202 return mid; // value found in binarySearch()
244 int mid = (lo + hi) >>> 1; in binarySearch() local
245 char midVal = array[mid]; in binarySearch()
248 lo = mid + 1; in binarySearch()
250 hi = mid - 1; in binarySearch()
252 return mid; // value found in binarySearch()
[all …]
|
| D | ComparableTimSort.java | 227 int mid = (left + right) >>> 1; in binarySort() local
228 if (pivot.compareTo(a[mid]) < 0) in binarySort()
229 right = mid; in binarySort()
231 left = mid + 1; in binarySort()
|
| D | TimSort.java | 260 int mid = (left + right) >>> 1; in binarySort() local
261 if (c.compare(pivot, a[mid]) < 0) in binarySort()
262 right = mid; in binarySort()
264 left = mid + 1; in binarySort()
|
| D | Collections.java | 1436 int low = 0, mid = list.size(), high = mid - 1, result = -1;
1438 mid = (low + high) >>> 1;
1439 if ((result = -list.get(mid).compareTo(object)) > 0) {
1440 low = mid + 1;
1442 return mid;
1444 high = mid - 1;
1447 return -mid - (result < 0 ? 1 : 2);
1491 int low = 0, mid = list.size(), high = mid - 1, result = -1;
1493 mid = (low + high) >>> 1;
1494 if ((result = -comparator.compare(list.get(mid), object)) > 0) {
[all …]
|
| /libcore/jsr166-tests/src/test/java/jsr166/ |
| D | RecursiveActionTest.java | 1205 int mid = (lo + hi) >>> 1; in compute() local
1206 invokeAll(new SortTask(array, lo, mid), in compute()
1207 new SortTask(array, mid, hi)); in compute()
1208 merge(lo, mid, hi); in compute()
1216 void merge(int lo, int mid, int hi) { in merge() argument
1217 long[] buf = Arrays.copyOfRange(array, lo, mid); in merge()
1218 for (int i = 0, j = lo, k = mid; i < buf.length; j++) in merge()
|
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/lang/ |
| D | CharacterTest.java | 533 final Character mid = new Character((char) (Character.MAX_VALUE / 2)); in test_compareToLjava_lang_Byte() local
538 assertTrue(mid.compareTo(mid) == 0); in test_compareToLjava_lang_Byte()
540 assertTrue(max.compareTo(mid) > 0); in test_compareToLjava_lang_Byte()
543 assertTrue(mid.compareTo(max) < 0); in test_compareToLjava_lang_Byte()
544 assertTrue(mid.compareTo(min) > 0); in test_compareToLjava_lang_Byte()
546 assertTrue(min.compareTo(mid) < 0); in test_compareToLjava_lang_Byte()
|
| /libcore/libart/src/main/java/java/lang/ |
| D | Class.java | 971 final int mid = (low + high) >>> 1; in findByName() local
972 final ArtField f = fields[mid]; in findByName()
975 low = mid + 1; in findByName()
979 high = mid - 1; in findByName()
|
| /libcore/luni/src/main/java/java/lang/ |
| D | AbstractStringBuilder.java | 449 for (int i = 0, mid = count / 2; i < mid; i++, --end) { in reverse0()
|
| /libcore/benchmarks/src/benchmarks/regression/ |
| D | R.java | 453 public final int mid = 0; field in R
|