/libcore/ojluni/src/main/java/java/nio/ |
H A D | CharBufferSpliterator.java | 69 int hi = limit; 70 index = hi; 71 while (i < hi) {
|
/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 | WeakHashMap.java | 1081 int hi; 1082 if ((hi = fence) < 0) { 1086 hi = fence = m.table.length; 1088 return hi; 1106 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; 1113 int i, hi, mc; 1118 if ((hi = fence) < 0) { 1120 hi = fence = tab.length; 1124 if (tab.length >= hi [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 | PriorityQueue.java | 839 int hi; 840 if ((hi = fence) < 0) { 842 hi = fence = pq.size; 844 return hi; 848 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; 856 int i, hi, mc; // hoist accesses and checks from loop 861 if ((hi = fence) < 0) { 863 hi = q.size; 867 if ((i = index) >= 0 && (index = hi) < [all...] |
H A D | IdentityHashMap.java | 1400 int hi; 1401 if ((hi = fence) < 0) { 1404 hi = fence = map.table.length; 1406 return hi; 1424 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; 1434 int i, hi, mc; Object key; 1437 (i = index) >= 0 && (index = hi = getFence()) <= a.length) { 1438 for (; i < hi; i += 2) { 1453 int hi [all...] |
H A D | DualPivotQuicksort.java | 128 for (int lo = run[count] - 1, hi = k; ++lo < --hi; ) { 129 int t = a[lo]; a[lo] = a[hi]; a[hi] = t; 185 int hi = run[k], mi = run[k - 1]; 186 for (int i = run[k - 2], p = i, q = mi; i < hi; ++i) { 187 if (q >= hi || p < mi && a[p + ao] <= a[q + ao]) { 193 run[++last] = hi; 576 for (int lo = run[count] - 1, hi = k; ++lo < --hi; ) { [all...] |
H A D | UUID.java | 385 long hi = 1L << (digits * 4); 386 return Long.toHexString(hi | (val & (hi - 1))).substring(1);
|
H A D | Vector.java | 1373 int hi; 1374 if ((hi = fence) < 0) { 1378 hi = fence = list.elementCount; 1381 return hi; 1385 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; 1408 int i, hi; // hoist accesses and checks from loop 1413 if ((hi = fence) < 0) { 1417 hi = fence = lst.elementCount; 1422 if (a != null && (i = index) >= 0 && (index = hi) < [all...] |
H A D | Spliterators.java | 943 Object[] a; int i, hi; // hoist accesses and checks from loop 946 if ((a = array).length >= (hi = fence) && 947 (i = index) >= 0 && i < (index = hi)) { 948 do { action.accept((T)a[i]); } while (++i < hi); 1027 int[] a; int i, hi; // hoist accesses and checks from loop 1030 if ((a = array).length >= (hi = fence) && 1031 (i = index) >= 0 && i < (index = hi)) { 1032 do { action.accept(a[i]); } while (++i < hi); 1110 long[] a; int i, hi; // hoist accesses and checks from loop 1113 if ((a = array).length >= (hi [all...] |
H A D | HashMap.java | 1500 int hi; 1501 if ((hi = fence) < 0) { 1506 hi = fence = (tab == null) ? 0 : tab.length; 1508 return hi; 1526 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; 1533 int i, hi, mc; 1538 if ((hi = fence) < 0) { 1540 hi = fence = (tab == null) ? 0 : tab.length; 1544 if (tab != null && tab.length >= hi [all...] |
H A D | ArrayList.java | 1340 int hi; // (a specialized variant appears in method forEach) 1342 if ((hi = fence) < 0) { 1344 hi = fence = 0; 1347 hi = fence = lst.size; 1350 return hi; 1354 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; 1363 int hi = getFence(), i = index; 1364 if (i < hi) { 1376 int i, hi, m [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 | ThreadLocalRandom8Test.java | 126 final int lo = least, hi = bound; 127 r.ints(size, lo, hi).parallel().forEach( 129 if (x < lo || x >= hi) 145 final long lo = least, hi = bound; 146 r.longs(size, lo, hi).parallel().forEach( 148 if (x < lo || x >= hi) 164 final double lo = least, hi = bound; 165 r.doubles(size, lo, hi).parallel().forEach( 167 if (x < lo || x >= hi)
|
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 | CopyOnWriteArrayList.java | 1312 int hi = offset + size; 1316 if (lo < 0 || hi > a.length) 1318 for (int i = lo; i < hi; ++i) { 1328 int hi = offset + size; 1333 if (lo < 0 || hi > len) 1336 for (int i = lo; i < hi; ++i) { 1347 int hi = offset + size; 1352 if (lo < 0 || hi > len) 1356 Arrays.sort(es, lo, hi, c); 1368 int hi [all...] |
H A D | PriorityBlockingQueue.java | 950 int hi; 951 if ((hi = fence) < 0) 952 hi = fence = (array = queue.toArray()).length; 953 return hi; 957 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; 964 Object[] a; int i, hi; // hoist accesses and checks from loop 969 if ((hi = fence) <= a.length && 970 (i = index) >= 0 && i < (index = hi)) { 971 do { action.accept((E)a[i]); } while (++i < hi); [all...] |
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...] |
/libcore/ojluni/src/main/java/java/nio/file/attribute/ |
H A D | FileTime.java | 426 long hi = Math.floorDiv(zeroSecs, SECONDS_PER_10000_YEARS) + 1; 429 year = ldt.getYear() + (int)hi * 10000; 433 long hi = zeroSecs / SECONDS_PER_10000_YEARS; 436 year = ldt.getYear() + (int)hi * 10000;
|
/libcore/ojluni/src/main/java/sun/misc/ |
H A D | FDBigInteger.java | 470 int hi = prev >>> anticount; 472 if (hi != 0) { 474 result[nWords] = hi; 502 int hi = prev >>> anticount; 505 if (hi != 0) { 509 result[nWords++] = hi;
|
/libcore/ojluni/src/main/java/java/awt/font/ |
H A D | NumericShaper.java | 574 int hi = ranges.length - 1; 575 while (lo <= hi) { 576 int mid = (lo + hi) / 2; 579 hi = mid - 1;
|
/libcore/ojluni/src/main/java/java/lang/ |
H A D | String.java | 1569 final char hi = Character.highSurrogate(ch); 1573 if (charAt(i) == hi && charAt(i + 1) == lo) { 1663 char hi = Character.highSurrogate(ch); 1667 if (charAt(i) == hi && charAt(i + 1) == lo) {
|