| /libcore/ojluni/src/main/java/java/util/ |
| H A D | ArrayPrefixHelpers.java | 48 * it may also be set earlier for subtrees with lo==0 (the left
81 final int lo, hi, origin, fence, threshold; field in class:ArrayPrefixHelpers.CumulateTask
86 T[] array, int lo, int hi) {
89 this.lo = this.origin = lo; this.hi = this.fence = hi;
92 (p = (hi - lo) / (ForkJoinPool.getCommonPoolParallelism() << 3))
99 int lo, int hi) {
104 this.lo = lo; this.hi = hi;
114 outer: while ((l = t.lo) >
84 CumulateTask(CumulateTask<T> parent, BinaryOperator<T> function, T[] array, int lo, int hi) argument
97 CumulateTask(CumulateTask<T> parent, BinaryOperator<T> function, T[] array, int origin, int fence, int threshold, int lo, int hi) argument
233 final int lo, hi, origin, fence, threshold; field in class:ArrayPrefixHelpers.LongCumulateTask
236 LongCumulateTask(LongCumulateTask parent, LongBinaryOperator function, long[] array, int lo, int hi) argument
249 LongCumulateTask(LongCumulateTask parent, LongBinaryOperator function, long[] array, int origin, int fence, int threshold, int lo, int hi) argument
383 final int lo, hi, origin, fence, threshold; field in class:ArrayPrefixHelpers.DoubleCumulateTask
386 DoubleCumulateTask(DoubleCumulateTask parent, DoubleBinaryOperator function, double[] array, int lo, int hi) argument
399 DoubleCumulateTask(DoubleCumulateTask parent, DoubleBinaryOperator function, double[] array, int origin, int fence, int threshold, int lo, int hi) argument
533 final int lo, hi, origin, fence, threshold; field in class:ArrayPrefixHelpers.IntCumulateTask
536 IntCumulateTask(IntCumulateTask parent, IntBinaryOperator function, int[] array, int lo, int hi) argument
549 IntCumulateTask(IntCumulateTask parent, IntBinaryOperator function, int[] array, int origin, int fence, int threshold, int lo, int hi) argument
[all...] |
| H A D | ComparableTimSort.java | 168 * @param lo the index of the first element, inclusive, to be sorted
175 static void sort(Object[] a, int lo, int hi, Object[] work, int workBase, int workLen) { argument
176 assert a != null && lo >= 0 && lo <= hi && hi <= a.length;
178 int nRemaining = hi - lo;
184 int initRunLen = countRunAndMakeAscending(a, lo, hi);
185 binarySort(a, lo, hi, lo + initRunLen);
198 int runLen = countRunAndMakeAscending(a, lo, hi);
203 binarySort(a, lo, l
240 binarySort(Object[] a, int lo, int hi, int start) argument
309 countRunAndMakeAscending(Object[] a, int lo, int hi) argument
335 reverseRange(Object[] a, int lo, int hi) argument
[all...] |
| H A D | TimSort.java | 198 * @param lo the index of the first element, inclusive, to be sorted
206 static <T> void sort(T[] a, int lo, int hi, Comparator<? super T> c, argument
208 assert c != null && a != null && lo >= 0 && lo <= hi && hi <= a.length;
210 int nRemaining = hi - lo;
216 int initRunLen = countRunAndMakeAscending(a, lo, hi, c);
217 binarySort(a, lo, hi, lo + initRunLen, c);
230 int runLen = countRunAndMakeAscending(a, lo, hi, c);
235 binarySort(a, lo, l
273 binarySort(T[] a, int lo, int hi, int start, Comparator<? super T> c) argument
343 countRunAndMakeAscending(T[] a, int lo, int hi, Comparator<? super T> c) argument
370 reverseRange(Object[] a, int lo, int hi) argument
[all...] |
| H A D | TreeMap.java | 1378 * Endpoints are represented as triples (fromStart, lo,
1382 * if loInclusive is true, lo is the inclusive bound, else lo
1385 final K lo, hi; field in class:TreeMap.NavigableSubMap
1390 boolean fromStart, K lo, boolean loInclusive,
1393 if (m.compare(lo, hi) > 0)
1397 m.compare(lo, lo);
1404 this.lo = lo;
1389 NavigableSubMap(TreeMap<K,V> m, boolean fromStart, K lo, boolean loInclusive, boolean toEnd, K hi, boolean hiInclusive) argument
1878 AscendingSubMap(TreeMap<K,V> m, boolean fromStart, K lo, boolean loInclusive, boolean toEnd, K hi, boolean hiInclusive) argument
1970 DescendingSubMap(TreeMap<K,V> m, boolean fromStart, K lo, boolean loInclusive, boolean toEnd, K hi, boolean hiInclusive) argument
2573 buildFromSorted(int level, int lo, int hi, int redLevel, Iterator<?> it, java.io.ObjectInputStream str, V defaultVal) argument
[all...] |
| /libcore/jsr166-tests/src/test/java/jsr166/ |
| H A D | RecursiveActionTest.java | 1208 final long[] array; final int lo, hi; field in class:RecursiveActionTest.SortTask
1209 SortTask(long[] array, int lo, int hi) { argument
1210 this.array = array; this.lo = lo; this.hi = hi;
1214 if (hi - lo < THRESHOLD)
1215 sortSequentially(lo, hi);
1217 int mid = (lo + hi) >>> 1;
1218 invokeAll(new SortTask(array, lo, mid),
1220 merge(lo, mid, hi);
1225 void sortSequentially(int lo, in argument
1228 merge(int lo, int mid, int hi) argument
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| H A D | CompletableFuture.java | 1301 int lo, int hi) {
1303 if (lo > hi) // empty
1307 int mid = (lo + hi) >>> 1;
1308 if ((a = (lo == mid ? cfs[lo] :
1309 andTree(cfs, lo, mid))) == null ||
1310 (b = (lo == hi ? a : (hi == mid+1) ? cfs[hi] :
1557 int lo, int hi) {
1559 if (lo <= hi) {
1561 int mid = (lo
1300 andTree(CompletableFuture<?>[] cfs, int lo, int hi) argument
1556 orTree(CompletableFuture<?>[] cfs, int lo, int hi) argument
[all...] |
| H A D | ConcurrentSkipListMap.java | 2544 private final K lo; field in class:ConcurrentSkipListMap.SubMap
2547 /** inclusion flag for lo */
2571 this.lo = fromKey;
2582 return (lo != null && ((c = cpr(cmp, key, lo)) < 0 ||
2626 if (lo == null)
2629 return m.findNear(lo, GT|EQ, cmp);
2631 return m.findNear(lo, GT, cmp);
2900 if (lo != null) {
2902 fromKey = lo;
[all...] |