Home
last modified time | relevance | path

Searched refs:hi (Results 1 – 25 of 44) 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() argument
63 super(parent); this.lo = lo; this.hi = hi; in forEach1()
67 if (hi - lo >= 2) { in forEach1()
68 int mid = (lo + hi) >>> 1; in forEach1()
71 new Task(this, mid, hi).fork(); // right child in forEach1()
74 else if (hi > lo) in forEach1()
85 final int lo, hi; in forEach2() field in CountedCompleter8Test.Task
86 Task(Task parent, int lo, int hi) { in forEach2() argument
87 super(parent); this.lo = lo; this.hi = hi; in forEach2()
[all …]
DThreadLocalRandom8Test.java149 final int lo = least, hi = bound; in testBoundedInts() local
150 r.ints(size, lo, hi).parallel().forEach( in testBoundedInts()
152 if (x < lo || x >= hi) in testBoundedInts()
168 final long lo = least, hi = bound; in testBoundedLongs() local
169 r.longs(size, lo, hi).parallel().forEach( in testBoundedLongs()
171 if (x < lo || x >= hi) in testBoundedLongs()
187 final double lo = least, hi = bound; in testBoundedDoubles() local
188 r.doubles(size, lo, hi).parallel().forEach( in testBoundedDoubles()
190 if (x < lo || x >= hi) in testBoundedDoubles()
DSplittableRandomTest.java443 final int lo = least, hi = bound;
444 r.ints(size, lo, hi).parallel().forEach(
446 if (x < lo || x >= hi)
462 final long lo = least, hi = bound;
463 r.longs(size, lo, hi).parallel().forEach(
465 if (x < lo || x >= hi)
481 final double lo = least, hi = bound;
482 r.doubles(size, lo, hi).parallel().forEach(
484 if (x < lo || x >= hi)
/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() argument
51 this.hi = hi; in chooseOne()
56 if (hi - lo >= 2) { in chooseOne()
57 int mid = (lo + hi) >>> 1; in chooseOne()
60 new Task(this, mid, hi).fork(); // right child in chooseOne()
62 } else if (hi > lo) { in chooseOne()
139 final int hi; in completeAllChildren() field in CountedCompleterTest.MainTask
141 MainTask(ForkJoinPool pool, int lo, int hi) { in completeAllChildren() argument
145 this.hi = hi; in completeAllChildren()
[all …]
/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() argument
123 this.lo = this.origin = lo; this.hi = this.fence = hi; in CumulateTask()
126 (p = (hi - lo) / (ForkJoinPool.getCommonPoolParallelism() << 3)) in CumulateTask()
133 int lo, int hi) { in CumulateTask() argument
138 this.lo = lo; this.hi = hi; in CumulateTask()
148 outer: while ((l = t.lo) >= 0 && (h = t.hi) <= a.length) { in compute()
240 par.out = (rt.hi == fnc ? lout : in compute()
269 final int lo, hi, origin, fence, threshold; field in ArrayPrefixHelpers.LongCumulateTask
274 long[] array, int lo, int hi) { in LongCumulateTask() argument
[all …]
DWeakHashMap.java1082 int hi; in getFence() local
1083 if ((hi = fence) < 0) { in getFence()
1087 hi = fence = m.table.length; in getFence()
1089 return hi; in getFence()
1107 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1114 int i, hi, mc; in forEachRemaining() local
1119 if ((hi = fence) < 0) { in forEachRemaining()
1121 hi = fence = tab.length; in forEachRemaining()
1125 if (tab.length >= hi && (i = index) >= 0 && in forEachRemaining()
1126 (i < (index = hi) || current != null)) { in forEachRemaining()
[all …]
DComparableTimSort.java179 static void sort(Object[] a, int lo, int hi, Object[] work, int workBase, int workLen) { in sort() argument
180 assert a != null && lo >= 0 && lo <= hi && hi <= a.length; in sort()
182 int nRemaining = hi - lo; in sort()
188 int initRunLen = countRunAndMakeAscending(a, lo, hi); in sort()
189 binarySort(a, lo, hi, lo + initRunLen); in sort()
202 int runLen = countRunAndMakeAscending(a, lo, hi); in sort()
221 assert lo == hi; in sort() local
244 private static void binarySort(Object[] a, int lo, int hi, int start) { in binarySort() argument
245 assert lo <= start && start <= hi; in binarySort()
248 for ( ; start < hi; start++) { in binarySort()
[all …]
DTimSort.java210 static <T> void sort(T[] a, int lo, int hi, Comparator<? super T> c, in sort() argument
212 assert c != null && a != null && lo >= 0 && lo <= hi && hi <= a.length; in sort()
214 int nRemaining = hi - lo; in sort()
220 int initRunLen = countRunAndMakeAscending(a, lo, hi, c); in sort()
221 binarySort(a, lo, hi, lo + initRunLen, c); in sort()
234 int runLen = countRunAndMakeAscending(a, lo, hi, 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() argument
279 assert lo <= start && start <= hi; in binarySort()
282 for ( ; start < hi; start++) { in binarySort()
[all …]
DBitSet.java1245 int hi; in stream() local
1246 if ((hi = fence) < 0) { in stream()
1250 hi = fence = (wordsInUse >= wordIndex(Integer.MAX_VALUE)) in stream()
1256 return hi; in stream()
1263 int hi = getFence(); in stream() local
1265 if (i < 0 || i >= hi) { in stream()
1267 if (i == Integer.MAX_VALUE && hi == Integer.MAX_VALUE) { in stream()
1275 index = nextSetBit(i + 1, wordIndex(hi - 1)); in stream()
1284 int hi = getFence(); in stream() local
1288 if (i >= 0 && i < hi) { in stream()
[all …]
DArrayList.java834 private void shiftTailOverGap(Object[] es, int lo, int hi) { in shiftTailOverGap() argument
835 System.arraycopy(es, hi, es, lo, size - hi); in shiftTailOverGap()
836 for (int to = size, i = (size -= hi - lo); i < to; i++) in shiftTailOverGap()
1539 int hi; // (a specialized variant appears in method forEach) in spliterator() local
1540 if ((hi = fence) < 0) { in spliterator()
1542 hi = fence = offset + size; in spliterator()
1544 return hi; in spliterator()
1548 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in spliterator() local
1556 int hi = getFence(), i = index; in spliterator() local
1557 if (i < hi) { in spliterator()
[all …]
DIdentityHashMap.java1403 int hi; in getFence() local
1404 if ((hi = fence) < 0) { in getFence()
1407 hi = fence = map.table.length; in getFence()
1409 return hi; in getFence()
1427 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit() local
1437 int i, hi, mc; Object key; in forEachRemaining() local
1440 (i = index) >= 0 && (index = hi = getFence()) <= a.length) { in forEachRemaining()
1441 for (; i < hi; i += 2) { in forEachRemaining()
1456 int hi = getFence(); in tryAdvance() local
1457 while (index < hi) { in tryAdvance()
[all …]
DAbstractList.java685 int hi; in getFence() local
687 if ((hi = fence) < 0) { in getFence()
691 hi = fence = lst.size(); in getFence()
693 return hi; in getFence()
697 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
705 int hi = getFence(), i = index; in tryAdvance() local
706 if (i < hi) { in tryAdvance()
718 int hi = getFence(); in forEachRemaining() local
720 index = hi; in forEachRemaining()
721 for (; i < hi; i++) { in forEachRemaining()
DDualPivotQuicksort.java756 int aim, boolean parallel, int[] run, int lo, int hi) { in mergeRuns() argument
758 if (hi - lo == 1) { in mergeRuns()
762 for (int i = run[hi], j = i - offset, low = run[lo]; i > low; in mergeRuns()
771 int mi = lo, rmi = (run[lo] + run[hi]) >>> 1; in mergeRuns()
779 if (parallel && hi - lo > MIN_RUN_COUNT) { in mergeRuns()
780 RunMerger merger = new RunMerger(a, b, offset, 0, run, mi, hi).forkMe(); in mergeRuns()
785 a2 = mergeRuns(a, b, offset, 0, false, run, mi, hi); in mergeRuns()
794 int hi2 = a2 == b ? run[hi] - offset : run[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() argument
[all …]
DVector.java1146 private void shiftTailOverGap(Object[] es, int lo, int hi) { in shiftTailOverGap() argument
1147 System.arraycopy(es, hi, es, lo, elementCount - hi); in shiftTailOverGap()
1148 for (int to = elementCount, i = (elementCount -= hi - lo); i < to; i++) in shiftTailOverGap()
1452 int hi; in getFence() local
1453 if ((hi = fence) < 0) { in getFence()
1457 hi = fence = elementCount; in getFence()
1460 return hi; in getFence()
1464 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1486 final int hi = getFence(); in forEachRemaining() local
1489 for (i = index, index = hi; i < hi; i++) in forEachRemaining()
DHashMap.java1661 int hi; in getFence() local
1662 if ((hi = fence) < 0) { in getFence()
1667 hi = fence = (tab == null) ? 0 : tab.length; in getFence()
1669 return hi; in getFence()
1687 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1694 int i, hi, mc; in forEachRemaining() local
1699 if ((hi = fence) < 0) { in forEachRemaining()
1701 hi = fence = (tab == null) ? 0 : tab.length; in forEachRemaining()
1705 if (tab != null && tab.length >= hi && in forEachRemaining()
1706 (i = index) >= 0 && (i < (index = hi) || current != null)) { in forEachRemaining()
[all …]
DSpliterators.java987 Object[] a; int i, hi; // hoist accesses and checks from loop in forEachRemaining() local
990 if ((a = array).length >= (hi = fence) && in forEachRemaining()
991 (i = index) >= 0 && i < (index = hi)) { in forEachRemaining()
992 do { action.accept((T)a[i]); } while (++i < hi); in forEachRemaining()
1071 int[] a; int i, hi; // hoist accesses and checks from loop in forEachRemaining() local
1074 if ((a = array).length >= (hi = fence) && in forEachRemaining()
1075 (i = index) >= 0 && i < (index = hi)) { in forEachRemaining()
1076 do { action.accept(a[i]); } while (++i < hi); in forEachRemaining()
1154 long[] a; int i, hi; // hoist accesses and checks from loop in forEachRemaining() local
1157 if ((a = array).length >= (hi = fence) && in forEachRemaining()
[all …]
DPriorityQueue.java853 int hi; in getFence() local
854 if ((hi = fence) < 0) { in getFence()
856 hi = fence = size; in getFence()
858 return hi; in getFence()
862 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
872 int i, hi; E e; in forEachRemaining() local
873 for (i = index, index = hi = fence; i < hi; i++) { in forEachRemaining()
/libcore/ojluni/src/main/java/java/io/
DStreamTokenizer.java274 public void wordChars(int low, int hi) { in wordChars() argument
277 if (hi >= ctype.length) in wordChars()
278 hi = ctype.length - 1; in wordChars()
279 while (low <= hi) in wordChars()
295 public void whitespaceChars(int low, int hi) { in whitespaceChars() argument
298 if (hi >= ctype.length) in whitespaceChars()
299 hi = ctype.length - 1; in whitespaceChars()
300 while (low <= hi) in whitespaceChars()
315 public void ordinaryChars(int low, int hi) { in ordinaryChars() argument
318 if (hi >= ctype.length) in ordinaryChars()
[all …]
/libcore/jsr166-tests/src/test/java/jsr166/
DThreadLocalRandom8Test.java126 final int lo = least, hi = bound; in testBoundedInts() local
127 r.ints(size, lo, hi).parallel().forEach( in testBoundedInts()
129 if (x < lo || x >= hi) in testBoundedInts()
145 final long lo = least, hi = bound; in testBoundedLongs() local
146 r.longs(size, lo, hi).parallel().forEach( in testBoundedLongs()
148 if (x < lo || x >= hi) in testBoundedLongs()
164 final double lo = least, hi = bound; in testBoundedDoubles() local
165 r.doubles(size, lo, hi).parallel().forEach( in testBoundedDoubles()
167 if (x < lo || x >= hi) in testBoundedDoubles()
DRecursiveActionTest.java1208 final long[] array; final int lo, hi; field in RecursiveActionTest.SortTask
1209 SortTask(long[] array, int lo, int hi) { in SortTask() argument
1210 this.array = array; this.lo = lo; this.hi = hi; in SortTask()
1214 if (hi - lo < THRESHOLD) in compute()
1215 sortSequentially(lo, hi); in compute()
1217 int mid = (lo + hi) >>> 1; in compute()
1219 new SortTask(array, mid, hi)); in compute()
1220 merge(lo, mid, hi); in compute()
1225 void sortSequentially(int lo, int hi) { in sortSequentially() argument
1226 Arrays.sort(array, lo, hi); in sortSequentially()
[all …]
/libcore/ojluni/src/test/java/util/Random/
DRandomTest.java288 final int lo = least, hi = bound; in testBoundedInts() local
289 r.ints(size, lo, hi). in testBoundedInts()
291 if (x < lo || x >= hi) in testBoundedInts()
308 final long lo = least, hi = bound; in testBoundedLongs() local
309 r.longs(size, lo, hi). in testBoundedLongs()
311 if (x < lo || x >= hi) in testBoundedLongs()
328 final double lo = least, hi = bound; in testBoundedDoubles() local
329 r.doubles(size, lo, hi). in testBoundedDoubles()
331 if (x < lo || x >= hi) in testBoundedDoubles()
/libcore/ojluni/src/main/java/java/nio/
DCharBufferSpliterator.java69 int hi = limit; in forEachRemaining() local
70 index = hi; in forEachRemaining()
71 while (i < hi) { in forEachRemaining()
/libcore/ojluni/src/main/java/java/lang/
DStringUTF16.java531 final char hi = Character.highSurrogate(ch);
535 if (getChar(value, i) == hi && getChar(value, i + 1 ) == lo) {
606 char hi = Character.highSurrogate(ch);
610 if (getChar(value, i) == hi && getChar(value, i + 1) == lo) {
1194 byte[] a; int i, hi; // hoist accesses and checks from loop
1197 if (((a = array).length >> 1) >= (hi = fence) &&
1198 (i = index) >= 0 && i < (index = hi)) {
1201 } while (++i < hi);
1265 byte[] a; int i, hi; // hoist accesses and checks from loop
1268 if (((a = array).length >> 1) >= (hi = fence) &&
[all …]
/libcore/ojluni/src/test/java/lang/StrictMath/
DFdlibmTranslit.java308 double y, hi = 0, lo = 0, c, t; in compute() local
337 hi = x - LN_2_HI[xsb]; in compute()
343 hi = x - t * LN_2_HI[0]; /* t*ln2HI is exact here */ in compute()
346 x = hi - lo; in compute()
361 y = ONE - ((lo - (x * c) / (2.0 - c)) - hi); in compute()
/libcore/ojluni/src/test/java/text/AttributedString/
DAttributedStringTest.java47 private static final Annotation hi = new Annotation("hi"); field in AttributedStringTest
89 string.addAttribute(Attribute.READING, hi, 0, 5); in main()
95 checkIteratorAttribute(iterator, 0, Attribute.READING, hi); in main()
96 checkIteratorAttribute(iterator, 3, Attribute.READING, hi); in main()
134 checkIteratorAttribute(iterator, 0, Attribute.READING, hi); in main()
135 checkIteratorAttribute(iterator, 4, Attribute.READING, hi); in main()

12