| /libcore/ojluni/src/main/java/java/util/ |
| H A D | ArrayPrefixHelpers.java | 77 * it may also be set earlier for subtrees with lo==0 (the left
110 final int lo, hi, origin, fence, threshold; field in class:ArrayPrefixHelpers.CumulateTask
115 T[] array, int lo, int hi) {
118 this.lo = this.origin = lo; this.hi = this.fence = hi;
121 (p = (hi - lo) / (ForkJoinPool.getCommonPoolParallelism() << 3))
128 int lo, int hi) {
133 this.lo = lo; this.hi = hi;
143 outer: while ((l = t.lo) >
113 CumulateTask(CumulateTask<T> parent, BinaryOperator<T> function, T[] array, int lo, int hi) argument
126 CumulateTask(CumulateTask<T> parent, BinaryOperator<T> function, T[] array, int origin, int fence, int threshold, int lo, int hi) argument
262 final int lo, hi, origin, fence, threshold; field in class:ArrayPrefixHelpers.LongCumulateTask
265 LongCumulateTask(LongCumulateTask parent, LongBinaryOperator function, long[] array, int lo, int hi) argument
278 LongCumulateTask(LongCumulateTask parent, LongBinaryOperator function, long[] array, int origin, int fence, int threshold, int lo, int hi) argument
412 final int lo, hi, origin, fence, threshold; field in class:ArrayPrefixHelpers.DoubleCumulateTask
415 DoubleCumulateTask(DoubleCumulateTask parent, DoubleBinaryOperator function, double[] array, int lo, int hi) argument
428 DoubleCumulateTask(DoubleCumulateTask parent, DoubleBinaryOperator function, double[] array, int origin, int fence, int threshold, int lo, int hi) argument
562 final int lo, hi, origin, fence, threshold; field in class:ArrayPrefixHelpers.IntCumulateTask
565 IntCumulateTask(IntCumulateTask parent, IntBinaryOperator function, int[] array, int lo, int hi) argument
578 IntCumulateTask(IntCumulateTask parent, IntBinaryOperator function, int[] array, int origin, int fence, int threshold, int lo, int hi) argument
[all...] |
| H A D | ComparableTimSort.java | 172 * @param lo the index of the first element, inclusive, to be sorted
179 static void sort(Object[] a, int lo, int hi, Object[] work, int workBase, int workLen) { argument
180 assert a != null && lo >= 0 && lo <= hi && hi <= a.length;
182 int nRemaining = hi - lo;
188 int initRunLen = countRunAndMakeAscending(a, lo, hi);
189 binarySort(a, lo, hi, lo + initRunLen);
202 int runLen = countRunAndMakeAscending(a, lo, hi);
207 binarySort(a, lo, l
244 binarySort(Object[] a, int lo, int hi, int start) argument
313 countRunAndMakeAscending(Object[] a, int lo, int hi) argument
339 reverseRange(Object[] a, int lo, int hi) argument
[all...] |
| H A D | TimSort.java | 202 * @param lo the index of the first element, inclusive, to be sorted
210 static <T> void sort(T[] a, int lo, int hi, Comparator<? super T> c, argument
212 assert c != null && a != null && lo >= 0 && lo <= hi && hi <= a.length;
214 int nRemaining = hi - lo;
220 int initRunLen = countRunAndMakeAscending(a, lo, hi, c);
221 binarySort(a, lo, hi, lo + initRunLen, c);
234 int runLen = countRunAndMakeAscending(a, lo, hi, c);
239 binarySort(a, lo, l
277 binarySort(T[] a, int lo, int hi, int start, Comparator<? super T> c) argument
347 countRunAndMakeAscending(T[] a, int lo, int hi, Comparator<? super T> c) argument
374 reverseRange(Object[] a, int lo, int hi) argument
[all...] |
| H A D | TreeMap.java | 1384 * Endpoints are represented as triples (fromStart, lo,
1388 * if loInclusive is true, lo is the inclusive bound, else lo
1391 final K lo, hi; field in class:TreeMap.NavigableSubMap
1396 boolean fromStart, K lo, boolean loInclusive,
1399 if (m.compare(lo, hi) > 0)
1403 m.compare(lo, lo);
1410 this.lo = lo;
1395 NavigableSubMap(TreeMap<K,V> m, boolean fromStart, K lo, boolean loInclusive, boolean toEnd, K hi, boolean hiInclusive) argument
1884 AscendingSubMap(TreeMap<K,V> m, boolean fromStart, K lo, boolean loInclusive, boolean toEnd, K hi, boolean hiInclusive) argument
1974 DescendingSubMap(TreeMap<K,V> m, boolean fromStart, K lo, boolean loInclusive, boolean toEnd, K hi, boolean hiInclusive) argument
2583 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/ojluni/src/main/java/java/util/concurrent/ |
| H A D | CompletableFuture.java | 1330 int lo, int hi) {
1332 if (lo > hi) // empty
1336 int mid = (lo + hi) >>> 1;
1337 if ((a = (lo == mid ? cfs[lo] :
1338 andTree(cfs, lo, mid))) == null ||
1339 (b = (lo == hi ? a : (hi == mid+1) ? cfs[hi] :
1586 int lo, int hi) {
1588 if (lo <= hi) {
1590 int mid = (lo
1329 andTree(CompletableFuture<?>[] cfs, int lo, int hi) argument
1585 orTree(CompletableFuture<?>[] cfs, int lo, int hi) argument
[all...] |
| H A D | ConcurrentSkipListMap.java | 2573 private final K lo; field in class:ConcurrentSkipListMap.SubMap
2576 /** inclusion flag for lo */
2600 this.lo = fromKey;
2611 return (lo != null && ((c = cpr(cmp, key, lo)) < 0 ||
2655 if (lo == null)
2658 return m.findNear(lo, GT|EQ, cmp);
2660 return m.findNear(lo, GT, cmp);
2929 if (lo != null) {
2931 fromKey = lo;
[all...] |