Home
last modified time | relevance | path

Searched defs:hi (Results 1 – 25 of 29) sorted by relevance

12

/libcore/ojluni/src/main/java/java/util/
DArrayPrefixHelpers.java110 final int lo, hi, origin, fence, threshold; field in ArrayPrefixHelpers.CumulateTask
115 T[] array, int lo, int hi) { in CumulateTask()
128 int lo, int hi) { in CumulateTask()
262 final int lo, hi, origin, fence, threshold; field in ArrayPrefixHelpers.LongCumulateTask
267 long[] array, int lo, int hi) { in LongCumulateTask()
280 int lo, int hi) { in LongCumulateTask()
412 final int lo, hi, origin, fence, threshold; field in ArrayPrefixHelpers.DoubleCumulateTask
417 double[] array, int lo, int hi) { in DoubleCumulateTask()
430 int lo, int hi) { in DoubleCumulateTask()
562 final int lo, hi, origin, fence, threshold; field in ArrayPrefixHelpers.IntCumulateTask
[all …]
DComparableTimSort.java179 static void sort(Object[] a, int lo, int hi, Object[] work, int workBase, int workLen) { in sort()
221 assert lo == hi; in sort() local
244 private static void binarySort(Object[] a, int lo, int hi, int start) { in binarySort()
313 private static int countRunAndMakeAscending(Object[] a, int lo, int hi) { in countRunAndMakeAscending()
DTimSort.java210 static <T> void sort(T[] a, int lo, int hi, Comparator<? super T> 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()
347 private static <T> int countRunAndMakeAscending(T[] a, int lo, int hi, in countRunAndMakeAscending()
DWeakHashMap.java1081 int hi; in getFence() local
1106 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1113 int i, hi, mc; in forEachRemaining() local
1147 int hi; in tryAdvance() local
1186 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1193 int i, hi, mc; in forEachRemaining() local
1225 int hi; in tryAdvance() local
1263 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1271 int i, hi, mc; in forEachRemaining() local
1307 int hi; in tryAdvance() local
DIdentityHashMap.java1400 int hi; in getFence() local
1424 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit() local
1434 int i, hi, mc; Object key; in forEachRemaining() local
1453 int hi = getFence(); in tryAdvance() local
1481 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit() local
1490 int i, hi, mc; in forEachRemaining() local
1510 int hi = getFence(); in tryAdvance() local
1540 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit() local
1549 int i, hi, mc; in forEachRemaining() local
1574 int hi = getFence(); in tryAdvance() local
DPriorityQueue.java839 int hi; in getFence() local
848 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
856 int i, hi, mc; // hoist accesses and checks from loop in forEachRemaining() local
887 int hi = getFence(), lo = index; in tryAdvance() local
DDualPivotQuicksort.java185 int hi = run[k], mi = run[k - 1]; in sort() local
633 int hi = run[k], mi = run[k - 1]; in sort() local
1117 int hi = run[k], mi = run[k - 1]; in doSort() local
1601 int hi = run[k], mi = run[k - 1]; in doSort() local
2037 int hi = right; in sort() local
2181 int hi = run[k], mi = run[k - 1]; in doSort() local
2576 int hi = right; in sort() local
2720 int hi = run[k], mi = run[k - 1]; in doSort() local
DAbstractList.java683 int hi; in getFence() local
695 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
703 int hi = getFence(), i = index; in tryAdvance() local
716 int hi = getFence(); in forEachRemaining() local
DUUID.java385 long hi = 1L << (digits * 4); in digits() local
DHashMap.java1500 int hi; in getFence() local
1526 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1533 int i, hi, mc; in forEachRemaining() local
1562 int hi; in tryAdvance() local
1598 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1605 int i, hi, mc; in forEachRemaining() local
1634 int hi; in tryAdvance() local
1669 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1676 int i, hi, mc; in forEachRemaining() local
1705 int hi; in tryAdvance() local
DArrayList.java1340 int hi; // (a specialized variant appears in method forEach) in getFence() local
1354 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1363 int hi = getFence(), i = index; in tryAdvance() local
1376 int i, hi, mc; // hoist accesses and checks from loop in forEachRemaining() local
DVector.java1381 int hi; in getFence() local
1393 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1416 int i, hi; // hoist accesses and checks from loop in forEachRemaining() local
DSpliterators.java943 Object[] a; int i, hi; // hoist accesses and checks from loop in forEachRemaining() local
1027 int[] a; int i, hi; // hoist accesses and checks from loop in forEachRemaining() local
1110 long[] a; int i, hi; // hoist accesses and checks from loop in forEachRemaining() local
1193 double[] a; int i, hi; // hoist accesses and checks from loop in forEachRemaining() local
DTreeMap.java1365 final K lo, hi; field in TreeMap.NavigableSubMap
1371 boolean toEnd, K hi, boolean hiInclusive) { in NavigableSubMap()
1860 boolean toEnd, K hi, boolean hiInclusive) { in AscendingSubMap()
1950 boolean toEnd, K hi, boolean hiInclusive) { in DescendingSubMap()
2557 private final TreeMapEntry<K,V> buildFromSorted(int level, int lo, int hi, in buildFromSorted()
/libcore/ojluni/src/main/java/java/io/
DStreamTokenizer.java274 public void wordChars(int low, int hi) { in wordChars()
295 public void whitespaceChars(int low, int hi) { in whitespaceChars()
315 public void ordinaryChars(int low, int hi) { in ordinaryChars()
/libcore/jsr166-tests/src/test/java/jsr166/
DThreadLocalRandom8Test.java126 final int lo = least, hi = bound; in testBoundedInts() local
145 final long lo = least, hi = bound; in testBoundedLongs() local
164 final double lo = least, hi = bound; in testBoundedDoubles() local
DRecursiveActionTest.java1208 final long[] array; final int lo, hi; field in RecursiveActionTest.SortTask
1209 SortTask(long[] array, int lo, int hi) { in SortTask()
1225 void sortSequentially(int lo, int hi) { in sortSequentially()
1228 void merge(int lo, int mid, int hi) { in merge()
/libcore/ojluni/src/main/java/java/nio/
DCharBufferSpliterator.java69 int hi = limit; in forEachRemaining() local
/libcore/ojluni/src/main/java/java/nio/file/attribute/
DFileTime.java426 long hi = Math.floorDiv(zeroSecs, SECONDS_PER_10000_YEARS) + 1; in toString() local
433 long hi = zeroSecs / SECONDS_PER_10000_YEARS; in toString() local
/libcore/ojluni/src/main/java/java/util/concurrent/
DCopyOnWriteArrayList.java1307 int hi = offset + size; in forEach() local
1323 int hi = offset + size; in replaceAll() local
1342 int hi = offset + size; in sort() local
1363 int hi = offset + n; in removeAll() local
1399 int hi = offset + n; in retainAll() local
1435 int hi = offset + n; in removeIf() local
1466 int hi = offset + size; in spliterator() local
DPriorityBlockingQueue.java950 int hi; in getFence() local
957 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
964 Object[] a; int i, hi; // hoist accesses and checks from loop in forEachRemaining() local
/libcore/ojluni/src/main/java/sun/misc/
DFDBigInteger.java470 int hi = prev >>> anticount; in leftShift() local
502 int hi = prev >>> anticount; in leftShift() local
/libcore/ojluni/src/main/java/java/lang/
DString.java1569 final char hi = Character.highSurrogate(ch); in indexOfSupplementary() local
1663 char hi = Character.highSurrogate(ch); in lastIndexOfSupplementary() local
/libcore/ojluni/src/main/java/sun/security/x509/
DAVA.java540 int hi = Character.digit((char)c1, 16); in getEmbeddedHexPair() local
/libcore/ojluni/src/main/java/java/awt/font/
DNumericShaper.java574 int hi = ranges.length - 1; in rangeForCodePoint() local

12