Home
last modified time | relevance | path

Searched defs:lo (Results 1 – 25 of 38) sorted by relevance

12

/libcore/ojluni/src/test/java/util/concurrent/tck/
DCountedCompleter8Test.java61 final int lo, hi; in forEach1() field in CountedCompleter8Test.Task
62 Task(Task parent, int lo, int hi) { in forEach1()
85 final int lo, hi; in forEach2() field in CountedCompleter8Test.Task
86 Task(Task parent, int lo, int hi) { in forEach2()
109 final int lo, hi; in forEach3() field in CountedCompleter8Test.Task
110 Task(Task parent, int lo, int hi) { in forEach3()
131 final int lo, hi; in forEach4() field in CountedCompleter8Test.Task
132 Task(Task parent, int lo, int hi) { in forEach4()
DThreadLocalRandom8Test.java149 final int lo = least, hi = bound; in testBoundedInts() local
168 final long lo = least, hi = bound; in testBoundedLongs() local
187 final double lo = least, hi = bound; in testBoundedDoubles() local
DRecursiveActionTest.java1220 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/java/util/concurrent/
DCountedCompleterTest.java44 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/
DNetworkInterfaceTest.java60 NetworkInterface lo = NetworkInterface.getByName("lo"); in testIPv6() local
129 NetworkInterface lo = NetworkInterface.getByName("lo"); in testLoopback() local
179 NetworkInterface lo = NetworkInterface.getByName("lo"); in testInterfaceRemoval() local
/libcore/ojluni/src/main/java/java/util/
DArrayPrefixHelpers.java115 final int lo, hi, origin, fence, threshold; field in ArrayPrefixHelpers.CumulateTask
120 T[] array, int lo, int hi) { in CumulateTask()
133 int lo, int hi) { in CumulateTask()
269 final int lo, hi, origin, fence, threshold; field in ArrayPrefixHelpers.LongCumulateTask
274 long[] array, int lo, int hi) { in LongCumulateTask()
287 int lo, int hi) { in LongCumulateTask()
421 final int lo, hi, origin, fence, threshold; field in ArrayPrefixHelpers.DoubleCumulateTask
426 double[] array, int lo, int hi) { in DoubleCumulateTask()
439 int lo, int hi) { in DoubleCumulateTask()
573 final int lo, hi, origin, fence, threshold; field in ArrayPrefixHelpers.IntCumulateTask
[all …]
DComparableTimSort.java179 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()
DTimSort.java210 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()
DDualPivotQuicksort.java756 int aim, boolean parallel, int[] run, int lo, int hi) { in mergeRuns()
828 int lo = lo1; lo1 = lo2; lo2 = lo; in mergeParts() local
1510 int aim, boolean parallel, int[] run, int lo, int hi) { in mergeRuns()
1582 int lo = lo1; lo1 = lo2; lo2 = lo; in mergeParts() local
3051 int aim, boolean parallel, int[] run, int lo, int hi) { in mergeRuns()
3123 int lo = lo1; lo1 = lo2; lo2 = lo; in mergeParts() local
3857 int aim, boolean parallel, int[] run, int lo, int hi) { in mergeRuns()
3929 int lo = lo1; lo1 = lo2; lo2 = lo; in mergeParts() local
DWeakHashMap.java1107 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
DSpliterators.java978 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
DIdentityHashMap.java1427 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
DVector.java1146 private void shiftTailOverGap(Object[] es, int lo, int hi) { in shiftTailOverGap()
1464 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
DPriorityQueue.java862 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
DArrayList.java834 private void shiftTailOverGap(Object[] es, int lo, int hi) { in shiftTailOverGap()
1548 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in spliterator() local
/libcore/jsr166-tests/src/test/java/jsr166/
DThreadLocalRandom8Test.java126 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
DRecursiveActionTest.java1208 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/test/java/util/Random/
DRandomTest.java288 final int lo = least, hi = bound; in testBoundedInts() local
308 final long lo = least, hi = bound; in testBoundedLongs() local
328 final double lo = least, hi = bound; in testBoundedDoubles() local
DRandomTestChiSquared.java139 double lo = chiSquaredBounds[N][0]; in chiSquaredTest() local
/libcore/ojluni/src/main/java/java/nio/
DCharBufferSpliterator.java57 int lo = index, mid = (lo + limit) >>> 1; in trySplit() local
/libcore/ojluni/src/main/java/java/nio/file/attribute/
DFileTime.java427 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/test/java/lang/StrictMath/
DFdlibmTranslit.java308 double y, hi = 0, lo = 0, c, t; in compute() local
/libcore/ojluni/src/main/java/java/util/concurrent/
DPriorityBlockingQueue.java958 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
965 final int hi = getFence(), lo = index; in forEachRemaining() local
/libcore/ojluni/src/main/java/java/math/
DBigDecimal.java5546 private static long make64(long hi, long lo) { in make64()
5696 private static BigDecimal doRound128(long hi, long lo, int sign, int scale, MathContext mc) { in doRound128()
5736 private static int precision(long hi, long lo){ in precision()
/libcore/luni/src/test/java/libcore/android/system/
DOsTest.java646 NetworkInterface lo = NetworkInterface.getByName("lo"); in test_PacketSocketAddress() local

12