/libcore/ojluni/src/test/java/util/concurrent/tck/ |
D | CountedCompleter8Test.java | 68 int mid = (lo + hi) >>> 1; in forEach1() local 92 int mid = (lo + hi) >>> 1; in forEach2() local
|
D | RecursiveActionTest.java | 1229 int mid = (lo + hi) >>> 1; in compute() local 1240 void merge(int lo, int mid, int hi) { in merge()
|
/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 | 534 final Character mid = new Character((char) (Character.MAX_VALUE / 2)); in test_compareToLjava_lang_Byte() local
|
/libcore/ojluni/src/test/java/nio/Buffer/ |
D | Chars.java | 55 int mid = cb.capacity() >>> 1; in randomizeRange() local
|
/libcore/ojluni/src/main/java/java/util/ |
D | ArrayPrefixHelpers.java | 152 int mid = (l + h) >>> 1; in compute() local 306 int mid = (l + h) >>> 1; in compute() local 458 int mid = (l + h) >>> 1; in compute() local 610 int mid = (l + h) >>> 1; in compute() local
|
D | Collections.java | 272 int mid = (low + high) >>> 1; in indexedBinarySearch() local 294 int mid = (low + high) >>> 1; in iteratorBinarySearch() local 378 int mid = (low + high) >>> 1; in indexedBinarySearch() local 398 int mid = (low + high) >>> 1; in iteratorBinarySearch() local 881 int mid = -distance % size; in rotate2() local
|
D | ComparableTimSort.java | 261 int mid = (left + right) >>> 1; in binarySort() local
|
D | WeakHashMap.java | 1107 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local 1187 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local 1264 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 | 978 int lo = index, mid = (lo + fence) >>> 1; in trySplit() local 1063 int lo = index, mid = (lo + fence) >>> 1; in trySplit() local 1146 int lo = index, mid = (lo + fence) >>> 1; in trySplit() local 1229 int lo = index, mid = (lo + fence) >>> 1; in trySplit() local
|
D | Arrays.java | 1187 int mid = (low + high) >>> 1; in mergeSort() local 1674 int mid = (low + high) >>> 1; in binarySearch0() local 1755 int mid = (low + high) >>> 1; in binarySearch0() local 1836 int mid = (low + high) >>> 1; in binarySearch0() local 1917 int mid = (low + high) >>> 1; in binarySearch0() local 1998 int mid = (low + high) >>> 1; in binarySearch0() local 2081 int mid = (low + high) >>> 1; in binarySearch0() local 2172 int mid = (low + high) >>> 1; in binarySearch0() local 2278 int mid = (low + high) >>> 1; in binarySearch0() local 2386 int mid = (low + high) >>> 1; in binarySearch0() local
|
D | IdentityHashMap.java | 1427 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit() local 1484 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit() local 1543 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit() local
|
D | PriorityQueue.java | 862 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
|
D | AbstractList.java | 697 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
|
D | BitSet.java | 1336 int mid = (lo + hi) >>> 1; in stream() local
|
D | HashMap.java | 1687 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local 1759 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local 1830 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
|
/libcore/luni/src/test/java/libcore/java/util/concurrent/ |
D | CountedCompleterTest.java | 57 int mid = (lo + hi) >>> 1; in chooseOne() local
|
/libcore/ojluni/src/main/native/ |
D | jni_util.c | 198 jmethodID mid; in JNU_CallStaticMethodByName() local 295 jmethodID mid; in JNU_CallMethodByNameV() local 957 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/lang/ |
D | StringLatin1.java | 685 int mid = skipLineSeparator(indexOfLineSeparator(half)); in trySplit() local 779 int lo = index, mid = (lo + fence) >>> 1; in trySplit() local
|
/libcore/ojluni/src/test/java/lang/invoke/ |
D | PermuteArgsTest.java | 380 int mid = start + (end - start)/2; in reverse() local
|
/libcore/ojluni/src/main/java/java/util/concurrent/ |
D | PriorityBlockingQueue.java | 958 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
|
/libcore/ojluni/src/main/java/java/awt/font/ |
D | NumericShaper.java | 576 int mid = (lo + hi) / 2; in rangeForCodePoint() local
|