/libcore/ojluni/src/main/java/java/util/ |
H A D | ArrayPrefixHelpers.java | 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) >= 0 && (h = t.hi) <= a.length) { 235 par.out = (rt.hi 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 | 173 * @param hi the index of the last element, exclusive, 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); 221 assert lo == hi; 239 * @param hi th 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 | 203 * @param hi the index of the last element, exclusive, 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); 253 assert lo == hi; 271 * @param hi th 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 | 1359 * loInclusive) and (toEnd, hi, hiInclusive). If fromStart is 1365 final K lo, hi; field in class:TreeMap.NavigableSubMap 1371 boolean toEnd, K hi, boolean hiInclusive) { 1373 if (m.compare(lo, hi) > 0) 1379 m.compare(hi, hi); 1387 this.hi = hi; 1404 int c = m.compare(key, hi); 1417 && (toEnd || m.compare(hi, ke 1369 NavigableSubMap(TreeMap<K,V> m, boolean fromStart, K lo, boolean loInclusive, boolean toEnd, K hi, boolean hiInclusive) argument 1858 AscendingSubMap(TreeMap<K,V> m, boolean fromStart, K lo, boolean loInclusive, boolean toEnd, K hi, boolean hiInclusive) argument 1948 DescendingSubMap(TreeMap<K,V> m, boolean fromStart, K lo, boolean loInclusive, boolean toEnd, K hi, boolean hiInclusive) argument 2557 buildFromSorted(int level, int lo, int hi, int redLevel, Iterator<?> it, java.io.ObjectInputStream str, V defaultVal) argument [all...] |
/libcore/ojluni/src/main/java/java/io/ |
H A D | StreamTokenizer.java | 272 * @param hi the high end of the range. 274 public void wordChars(int low, int hi) { argument 277 if (hi >= ctype.length) 278 hi = ctype.length - 1; 279 while (low <= hi) 293 * @param hi the high end of the range. 295 public void whitespaceChars(int low, int hi) { argument 298 if (hi >= ctype.length) 299 hi = ctype.length - 1; 300 while (low <= hi) 315 ordinaryChars(int low, int hi) 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; 1219 new SortTask(array, mid, hi)); 1220 merge(lo, mid, hi); 1225 void sortSequentially(int lo, int hi) { 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; 1339 (b = (lo == hi ? a : (hi == mid+1) ? cfs[hi] : 1340 andTree(cfs, mid+1, hi))) == null) 1586 int lo, int hi) { 1588 if (lo <= hi) { 1590 int mid = (lo + hi) >>> 1329 andTree(CompletableFuture<?>[] cfs, int lo, int hi) argument 1585 orTree(CompletableFuture<?>[] cfs, int lo, int hi) argument [all...] |
H A D | ConcurrentSkipListMap.java | 2575 private final K hi; field in class:ConcurrentSkipListMap.SubMap 2578 /** inclusion flag for hi */ 2601 this.hi = toKey; 2617 return (hi != null && ((c = cpr(cmp, key, hi)) > 0 || 2639 if (hi == null) 2644 int c = cpr(cmp, k, hi); 2668 if (hi == null) 2671 return m.findNear(hi, LT|EQ, cmp); 2673 return m.findNear(hi, L [all...] |