| /libcore/ojluni/src/main/java/java/nio/ |
| D | CharBufferSpliterator.java | 57 int lo = index, mid = (lo + limit) >>> 1; in trySplit() local
|
| /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
|
| /libcore/ojluni/src/main/java/java/util/ |
| D | ArrayPrefixHelpers.java | 147 int mid = (l + h) >>> 1; in compute() local
299 int mid = (l + h) >>> 1; in compute() local
449 int mid = (l + h) >>> 1; in compute() local
599 int mid = (l + h) >>> 1; in compute() local
|
| D | Collections.java | 271 int mid = (low + high) >>> 1; in indexedBinarySearch() local
293 int mid = (low + high) >>> 1; in iteratorBinarySearch() local
377 int mid = (low + high) >>> 1; in indexedBinarySearch() local
397 int mid = (low + high) >>> 1; in iteratorBinarySearch() local
854 int mid = -distance % size; in rotate2() local
|
| D | Arrays.java | 1344 int mid = (low + high) >>> 1; in mergeSort() local
1756 int mid = (low + high) >>> 1; in binarySearch0() local
1837 int mid = (low + high) >>> 1; in binarySearch0() local
1918 int mid = (low + high) >>> 1; in binarySearch0() local
1999 int mid = (low + high) >>> 1; in binarySearch0() local
2080 int mid = (low + high) >>> 1; in binarySearch0() local
2163 int mid = (low + high) >>> 1; in binarySearch0() local
2254 int mid = (low + high) >>> 1; in binarySearch0() local
2360 int mid = (low + high) >>> 1; in binarySearch0() local
2468 int mid = (low + high) >>> 1; in binarySearch0() local
|
| D | ComparableTimSort.java | 261 int mid = (left + right) >>> 1; in binarySort() local
|
| D | WeakHashMap.java | 1106 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1186 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1263 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
|
| D | TimSort.java | 295 int mid = (left + right) >>> 1; in binarySort() local
|
| D | Spliterators.java | 934 int lo = index, mid = (lo + fence) >>> 1; in trySplit() local
1019 int lo = index, mid = (lo + fence) >>> 1; in trySplit() local
1102 int lo = index, mid = (lo + fence) >>> 1; in trySplit() local
1185 int lo = index, mid = (lo + fence) >>> 1; in trySplit() local
|
| D | IdentityHashMap.java | 1424 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit() local
1481 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit() local
1540 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit() local
|
| D | PriorityQueue.java | 848 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
|
| D | AbstractList.java | 695 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
|
| D | HashMap.java | 1526 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1598 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1669 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
|
| D | Vector.java | 1393 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
|
| D | ArrayList.java | 1354 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
|
| D | TreeMap.java | 2577 int mid = (lo + hi) >>> 1; in buildFromSorted() local
|
| /libcore/ojluni/src/main/native/ |
| D | jni_util.c | 198 jmethodID mid; in JNU_CallStaticMethodByName() local
295 jmethodID mid; in JNU_CallMethodByNameV() local
954 static jmethodID mid = NULL; in JNU_Equals() local
|
| D | net_util_md.c | 210 int mid = a + (b-a)/2; in findMaxBuf() local
734 jmethodID mid; in parseExclusiveBindProperty() local
|
| /libcore/jsr166-tests/src/test/java/jsr166/ |
| D | RecursiveActionTest.java | 1217 int mid = (lo + hi) >>> 1; in compute() local
1228 void merge(int lo, int mid, int hi) { in merge()
|
| /libcore/ojluni/src/main/java/java/util/concurrent/ |
| D | PriorityBlockingQueue.java | 957 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
|
| D | CompletableFuture.java | 1338 int mid = (lo + hi) >>> 1; in andTree() local
1592 int mid = (lo + hi) >>> 1; in orTree() local
|
| /libcore/ojluni/src/main/java/java/awt/font/ |
| D | NumericShaper.java | 576 int mid = (lo + hi) / 2; in rangeForCodePoint() local
|
| /libcore/benchmarks/src/benchmarks/regression/ |
| D | R.java | 453 public final int mid = 0; field in R
|