/libcore/luni/src/test/java/libcore/java/util/concurrent/ |
D | CountedCompleterTest.java | 44 final int lo; in chooseOne() field in CountedCompleterTest.Task 48 Task(Task parent, int lo, int hi) { in chooseOne() 138 final int lo; in completeAllChildren() field in CountedCompleterTest.MainTask 141 MainTask(ForkJoinPool pool, int lo, int hi) { in completeAllChildren()
|
/libcore/luni/src/test/java/libcore/java/net/ |
D | NetworkInterfaceTest.java | 59 NetworkInterface lo = NetworkInterface.getByName("lo"); in testIPv6() local 125 NetworkInterface lo = NetworkInterface.getByName("lo"); in testLoopback() local 175 NetworkInterface lo = NetworkInterface.getByName("lo"); in testInterfaceRemoval() local
|
/libcore/ojluni/src/main/java/java/util/ |
D | ComparableTimSort.java | 179 static void sort(Object[] a, int lo, int hi, Object[] work, int workBase, int workLen) { in sort() 180 assert a != null && lo >= 0 && lo <= hi && hi <= a.length; in sort() local 244 private static void binarySort(Object[] a, int lo, int hi, int start) { in binarySort() 245 assert lo <= start && start <= hi; in binarySort() local 313 private static int countRunAndMakeAscending(Object[] a, int lo, int hi) { in countRunAndMakeAscending()
|
D | ArrayPrefixHelpers.java | 110 final int lo, hi, origin, fence, threshold; field in ArrayPrefixHelpers.CumulateTask 115 T[] array, int lo, int hi) { in CumulateTask() 128 int lo, int hi) { in CumulateTask() 262 final int lo, hi, origin, fence, threshold; field in ArrayPrefixHelpers.LongCumulateTask 267 long[] array, int lo, int hi) { in LongCumulateTask() 280 int lo, int hi) { in LongCumulateTask() 412 final int lo, hi, origin, fence, threshold; field in ArrayPrefixHelpers.DoubleCumulateTask 417 double[] array, int lo, int hi) { in DoubleCumulateTask() 430 int lo, int hi) { in DoubleCumulateTask() 562 final int lo, hi, origin, fence, threshold; field in ArrayPrefixHelpers.IntCumulateTask [all …]
|
D | TimSort.java | 210 static <T> void sort(T[] a, int lo, int hi, Comparator<? super T> c, in sort() 212 assert c != null && a != null && lo >= 0 && lo <= hi && hi <= a.length; in sort() local 277 private static <T> void binarySort(T[] a, int lo, int hi, int start, in binarySort() 279 assert lo <= start && start <= hi; in binarySort() local 347 private static <T> int countRunAndMakeAscending(T[] a, int lo, int hi, in countRunAndMakeAscending()
|
D | PriorityQueue.java | 848 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local 887 int hi = getFence(), lo = index; in tryAdvance() 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 | TreeMap.java | 1365 final K lo, hi; field in TreeMap.NavigableSubMap 1370 boolean fromStart, K lo, boolean loInclusive, in NavigableSubMap() 1859 boolean fromStart, K lo, boolean loInclusive, in AscendingSubMap() 1949 boolean fromStart, K lo, boolean loInclusive, in DescendingSubMap() 2557 private final TreeMapEntry<K,V> buildFromSorted(int level, int lo, int hi, in buildFromSorted()
|
D | AbstractList.java | 695 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
|
/libcore/jsr166-tests/src/test/java/jsr166/ |
D | ThreadLocalRandom8Test.java | 126 final int lo = least, hi = bound; in testBoundedInts() local 145 final long lo = least, hi = bound; in testBoundedLongs() local 164 final double lo = least, hi = bound; in testBoundedDoubles() local
|
D | RecursiveActionTest.java | 1208 final long[] array; final int lo, hi; field in RecursiveActionTest.SortTask 1209 SortTask(long[] array, int lo, int hi) { in SortTask() 1225 void sortSequentially(int lo, int hi) { in sortSequentially() 1228 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/ojluni/src/main/java/java/nio/file/attribute/ |
D | FileTime.java | 427 long lo = Math.floorMod(zeroSecs, SECONDS_PER_10000_YEARS); in toString() local 434 long lo = zeroSecs % SECONDS_PER_10000_YEARS; in toString() local
|
/libcore/ojluni/src/main/java/java/util/concurrent/ |
D | CopyOnWriteArrayList.java | 1306 int lo = offset; in forEach() local 1322 int lo = offset; in replaceAll() local 1341 int lo = offset; in sort() local 1362 int lo = offset; in removeAll() local 1398 int lo = offset; in retainAll() local 1434 int lo = offset; in removeIf() local 1465 int lo = offset; in spliterator() local
|
D | PriorityBlockingQueue.java | 957 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
|
D | ConcurrentSkipListMap.java | 2573 private final K lo; field in ConcurrentSkipListMap.SubMap
|
/libcore/ojluni/src/test/java/util/concurrent/tck/ |
D | RecursiveActionTest.java | 1220 final long[] array; final int lo, hi; field in RecursiveActionTest.SortTask 1221 SortTask(long[] array, int lo, int hi) { in SortTask() 1237 void sortSequentially(int lo, int hi) { in sortSequentially() 1240 void merge(int lo, int mid, int hi) { in merge()
|
/libcore/luni/src/test/java/libcore/android/system/ |
D | OsTest.java | 632 NetworkInterface lo = NetworkInterface.getByName("lo"); in test_PacketSocketAddress() local
|
/libcore/ojluni/src/main/java/java/lang/ |
D | String.java | 1570 final char lo = Character.lowSurrogate(ch); in indexOfSupplementary() local 1664 char lo = Character.lowSurrogate(ch); in lastIndexOfSupplementary() local
|
/libcore/ojluni/src/main/java/sun/security/x509/ |
D | AVA.java | 541 int lo = Character.digit((char)c2, 16); in getEmbeddedHexPair() local
|
/libcore/ojluni/src/main/java/java/awt/font/ |
D | NumericShaper.java | 573 int lo = 0; in rangeForCodePoint() local
|