Home
last modified time | relevance | path

Searched defs:hi (Results 1 – 25 of 36) 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.java45 final int hi; in chooseOne() field in CountedCompleterTest.Task
48 Task(Task parent, int lo, int hi) { in chooseOne()
139 final int hi; in completeAllChildren() field in CountedCompleterTest.MainTask
141 MainTask(ForkJoinPool pool, int lo, int hi) { in completeAllChildren()
/libcore/ojluni/src/main/java/java/util/
DArrayPrefixHelpers.java110 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 …]
DComparableTimSort.java179 static void sort(Object[] a, int lo, int hi, Object[] work, int workBase, int workLen) { in sort()
221 assert lo == hi; in sort() local
244 private static void binarySort(Object[] a, int lo, int hi, int start) { in binarySort()
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()
253 assert lo == hi; in sort() local
277 private static <T> void binarySort(T[] a, int lo, int hi, int start, in binarySort()
347 private static <T> int countRunAndMakeAscending(T[] a, int lo, int hi, in countRunAndMakeAscending()
DWeakHashMap.java1082 int hi; in getFence() local
1107 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1114 int i, hi, mc; in forEachRemaining() local
1148 int hi; in tryAdvance() local
1187 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1194 int i, hi, mc; in forEachRemaining() local
1226 int hi; in tryAdvance() local
1264 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1272 int i, hi, mc; in forEachRemaining() local
1308 int hi; in tryAdvance() local
DIdentityHashMap.java1400 int hi; in getFence() local
1424 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit() local
1434 int i, hi, mc; Object key; in forEachRemaining() local
1453 int hi = getFence(); in tryAdvance() local
1481 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit() local
1490 int i, hi, mc; in forEachRemaining() local
1510 int hi = getFence(); in tryAdvance() local
1540 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit() local
1549 int i, hi, mc; in forEachRemaining() local
1574 int hi = getFence(); in tryAdvance() local
DPriorityQueue.java839 int hi; in getFence() local
848 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
856 int i, hi, mc; // hoist accesses and checks from loop in forEachRemaining() local
887 int hi = getFence(), lo = index; in tryAdvance() local
DDualPivotQuicksort.java198 int hi = run[k], mi = run[k - 1]; in sort() local
664 int hi = run[k], mi = run[k - 1]; in sort() local
1166 int hi = run[k], mi = run[k - 1]; in doSort() local
1668 int hi = run[k], mi = run[k - 1]; in doSort() local
2104 int hi = right; in sort() local
2266 int hi = run[k], mi = run[k - 1]; in doSort() local
2661 int hi = right; in sort() local
2823 int hi = run[k], mi = run[k - 1]; in doSort() local
DBitSet.java1239 int hi; in stream() local
1257 int hi = getFence(); in stream() local
1278 int hi = getFence(); in stream() local
1315 int hi = getFence(); in stream() local
DAbstractList.java683 int hi; in getFence() local
695 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
703 int hi = getFence(), i = index; in tryAdvance() local
716 int hi = getFence(); in forEachRemaining() local
DUUID.java385 long hi = 1L << (digits * 4); in digits() local
DHashMap.java1500 int hi; in getFence() local
1526 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1533 int i, hi, mc; in forEachRemaining() local
1562 int hi; in tryAdvance() local
1598 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1605 int i, hi, mc; in forEachRemaining() local
1634 int hi; in tryAdvance() local
1669 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1676 int i, hi, mc; in forEachRemaining() local
1705 int hi; in tryAdvance() local
DArrayList.java1340 int hi; // (a specialized variant appears in method forEach) in getFence() local
1354 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1363 int hi = getFence(), i = index; in tryAdvance() local
1376 int i, hi, mc; // hoist accesses and checks from loop in forEachRemaining() local
DVector.java1381 int hi; in getFence() local
1393 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1416 int i, hi; // hoist accesses and checks from loop in forEachRemaining() local
DSpliterators.java943 Object[] a; int i, hi; // hoist accesses and checks from loop in forEachRemaining() local
1027 int[] a; int i, hi; // hoist accesses and checks from loop in forEachRemaining() local
1110 long[] a; int i, hi; // hoist accesses and checks from loop in forEachRemaining() local
1193 double[] a; int i, hi; // hoist accesses and checks from loop in forEachRemaining() local
/libcore/ojluni/src/main/java/java/io/
DStreamTokenizer.java274 public void wordChars(int low, int hi) { in wordChars()
295 public void whitespaceChars(int low, int hi) { in whitespaceChars()
315 public void ordinaryChars(int low, int hi) { in ordinaryChars()
/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/main/java/java/nio/
DCharBufferSpliterator.java69 int hi = limit; in forEachRemaining() local
/libcore/ojluni/src/main/java/java/nio/file/attribute/
DFileTime.java426 long hi = Math.floorDiv(zeroSecs, SECONDS_PER_10000_YEARS) + 1; in toString() local
433 long hi = zeroSecs / SECONDS_PER_10000_YEARS; in toString() local
/libcore/ojluni/src/main/java/java/lang/
DStringUTF16.java351 String a; int i, hi; // hoist accesses and checks from loop in forEachRemaining() local
448 String a; int i, hi; // hoist accesses and checks from loop in forEachRemaining() local
482 private static int advance(String a, int i, int hi, IntConsumer action) { in advance()
/libcore/ojluni/src/test/java/lang/StrictMath/
DFdlibmTranslit.java308 double y, hi = 0, lo = 0, c, t; in compute() local

12