| /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/main/java/java/lang/ |
| D | StringUTF16.java | 256 int mid = skipLineSeparator(indexOfLineSeparator(half)); in trySplit() local 339 int lo = index, mid = (lo + fence) >>> 1; in trySplit() local 425 int lo = index, mid = (lo + fence) >>> 1; in trySplit() 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 | 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 | 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 | Arrays.java | 1347 int mid = (low + high) >>> 1; in mergeSort() local 1759 int mid = (low + high) >>> 1; in binarySearch0() local 1840 int mid = (low + high) >>> 1; in binarySearch0() local 1921 int mid = (low + high) >>> 1; in binarySearch0() local 2002 int mid = (low + high) >>> 1; in binarySearch0() local 2083 int mid = (low + high) >>> 1; in binarySearch0() local 2166 int mid = (low + high) >>> 1; in binarySearch0() local 2257 int mid = (low + high) >>> 1; in binarySearch0() local 2363 int mid = (low + high) >>> 1; in binarySearch0() local 2471 int mid = (low + high) >>> 1; in binarySearch0() 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 | BitSet.java | 1330 int mid = (lo + hi) >>> 1; in stream() 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
|
| /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 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/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 | 969 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
|