Home
last modified time | relevance | path

Searched defs:hi (Results 1 – 25 of 37) 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.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()
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.java1403 int hi; in getFence() local
1427 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit() local
1437 int i, hi, mc; Object key; in forEachRemaining() local
1456 int hi = getFence(); in tryAdvance() local
1484 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit() local
1493 int i, hi, mc; in forEachRemaining() local
1513 int hi = getFence(); in tryAdvance() local
1543 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit() local
1552 int i, hi, mc; in forEachRemaining() local
1577 int hi = getFence(); in tryAdvance() 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
DBitSet.java1245 int hi; in stream() local
1263 int hi = getFence(); in stream() local
1284 int hi = getFence(); in stream() local
1321 int hi = getFence(); in stream() local
DPriorityQueue.java853 int hi; in getFence() local
862 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
872 int i, hi; E e; in forEachRemaining() local
DHashMap.java1632 int hi; in getFence() local
1658 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1665 int i, hi, mc; in forEachRemaining() local
1694 int hi; in tryAdvance() local
1730 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1737 int i, hi, mc; in forEachRemaining() local
1766 int hi; in tryAdvance() local
1801 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1808 int i, hi, mc; in forEachRemaining() local
1837 int hi; in tryAdvance() local
DVector.java1146 private void shiftTailOverGap(Object[] es, int lo, int hi) { in shiftTailOverGap()
1458 int hi; in getFence() local
1470 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1492 final int hi = getFence(); in forEachRemaining() local
DDualPivotQuicksort.java756 int aim, boolean parallel, int[] run, int lo, int hi) { in mergeRuns()
829 int hi = hi1; hi1 = hi2; hi2 = hi; in mergeParts() local
1510 int aim, boolean parallel, int[] run, int lo, int hi) { in mergeRuns()
1583 int hi = hi1; hi1 = hi2; hi2 = hi; in mergeParts() local
3051 int aim, boolean parallel, int[] run, int lo, int hi) { in mergeRuns()
3124 int hi = hi1; hi1 = hi2; hi2 = hi; in mergeParts() local
3857 int aim, boolean parallel, int[] run, int lo, int hi) { in mergeRuns()
3930 int hi = hi1; hi1 = hi2; hi2 = hi; in mergeParts() local
DArrayList.java752 private void shiftTailOverGap(Object[] es, int lo, int hi) { in shiftTailOverGap()
1454 int hi; // (a specialized variant appears in method forEach) in spliterator() local
1463 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in spliterator() local
1471 int hi = getFence(), i = index; in spliterator() local
1485 int i, hi, mc; // hoist accesses and checks from loop in spliterator() local
DUUID.java469 long hi = 1L << (digits * 4); in digits() 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/test/java/lang/StackWalker/
DLocalsAndOperands.java264 String hi = "himom"; in testLocalsUnused() local
281 String hi = "himom"; in testLocalsKeepAlive() local
300 String hi, long l, in testLocalsKeepAliveArgs()
/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/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

12