Home
last modified time | relevance | path

Searched refs: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() argument
118 this.lo = this.origin = lo; this.hi = this.fence = hi; in CumulateTask()
121 (p = (hi - lo) / (ForkJoinPool.getCommonPoolParallelism() << 3)) in CumulateTask()
128 int lo, int hi) { in CumulateTask() argument
133 this.lo = lo; this.hi = hi; in CumulateTask()
143 outer: while ((l = t.lo) >= 0 && (h = t.hi) <= a.length) { in compute()
235 par.out = (rt.hi == fnc ? lout : in compute()
262 final int lo, hi, origin, fence, threshold; field in ArrayPrefixHelpers.LongCumulateTask
267 long[] array, int lo, int hi) { in LongCumulateTask() argument
[all …]
DWeakHashMap.java1081 int hi; in getFence() local
1082 if ((hi = fence) < 0) { in getFence()
1086 hi = fence = m.table.length; in getFence()
1088 return hi; in getFence()
1106 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1113 int i, hi, mc; in forEachRemaining() local
1118 if ((hi = fence) < 0) { in forEachRemaining()
1120 hi = fence = tab.length; in forEachRemaining()
1124 if (tab.length >= hi && (i = index) >= 0 && in forEachRemaining()
1125 (i < (index = hi) || current != null)) { in forEachRemaining()
[all …]
DComparableTimSort.java179 static void sort(Object[] a, int lo, int hi, Object[] work, int workBase, int workLen) { in sort() argument
180 assert a != null && lo >= 0 && lo <= hi && hi <= a.length; in sort()
182 int nRemaining = hi - lo; in sort()
188 int initRunLen = countRunAndMakeAscending(a, lo, hi); in sort()
189 binarySort(a, lo, hi, lo + initRunLen); in sort()
202 int runLen = countRunAndMakeAscending(a, lo, hi); in sort()
221 assert lo == hi; in sort() local
244 private static void binarySort(Object[] a, int lo, int hi, int start) { in binarySort() argument
245 assert lo <= start && start <= hi; in binarySort()
248 for ( ; start < hi; start++) { in binarySort()
[all …]
DTimSort.java210 static <T> void sort(T[] a, int lo, int hi, Comparator<? super T> c, in sort() argument
212 assert c != null && a != null && lo >= 0 && lo <= hi && hi <= a.length; in sort()
214 int nRemaining = hi - lo; in sort()
220 int initRunLen = countRunAndMakeAscending(a, lo, hi, c); in sort()
221 binarySort(a, lo, hi, lo + initRunLen, c); in sort()
234 int runLen = countRunAndMakeAscending(a, lo, hi, 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() argument
279 assert lo <= start && start <= hi; in binarySort()
282 for ( ; start < hi; start++) { in binarySort()
[all …]
DPriorityQueue.java839 int hi; in getFence() local
840 if ((hi = fence) < 0) { in getFence()
842 hi = fence = pq.size; in getFence()
844 return hi; in getFence()
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
861 if ((hi = fence) < 0) { in forEachRemaining()
863 hi = q.size; in forEachRemaining()
867 if ((i = index) >= 0 && (index = hi) <= a.length) { in forEachRemaining()
869 if (i < hi) { in forEachRemaining()
[all …]
DDualPivotQuicksort.java128 for (int lo = run[count] - 1, hi = k; ++lo < --hi; ) { in sort()
129 int t = a[lo]; a[lo] = a[hi]; a[hi] = t; in sort()
185 int hi = run[k], mi = run[k - 1]; in sort() local
186 for (int i = run[k - 2], p = i, q = mi; i < hi; ++i) { in sort()
187 if (q >= hi || p < mi && a[p + ao] <= a[q + ao]) { in sort()
193 run[++last] = hi; in sort()
576 for (int lo = run[count] - 1, hi = k; ++lo < --hi; ) { in sort()
577 long t = a[lo]; a[lo] = a[hi]; a[hi] = t; in sort()
633 int hi = run[k], mi = run[k - 1]; in sort() local
634 for (int i = run[k - 2], p = i, q = mi; i < hi; ++i) { in sort()
[all …]
DIdentityHashMap.java1400 int hi; in getFence() local
1401 if ((hi = fence) < 0) { in getFence()
1404 hi = fence = map.table.length; in getFence()
1406 return hi; in getFence()
1424 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit() local
1434 int i, hi, mc; Object key; in forEachRemaining() local
1437 (i = index) >= 0 && (index = hi = getFence()) <= a.length) { in forEachRemaining()
1438 for (; i < hi; i += 2) { in forEachRemaining()
1453 int hi = getFence(); in tryAdvance() local
1454 while (index < hi) { in tryAdvance()
[all …]
DAbstractList.java683 int hi; in getFence() local
685 if ((hi = fence) < 0) { in getFence()
689 hi = fence = lst.size(); in getFence()
691 return hi; in getFence()
695 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
703 int hi = getFence(), i = index; in tryAdvance() local
704 if (i < hi) { in tryAdvance()
716 int hi = getFence(); in forEachRemaining() local
718 index = hi; in forEachRemaining()
719 for (; i < hi; i++) { in forEachRemaining()
DVector.java1381 int hi; in getFence() local
1382 if ((hi = fence) < 0) { in getFence()
1386 hi = fence = list.elementCount; in getFence()
1389 return hi; in getFence()
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
1421 if ((hi = fence) < 0) { in forEachRemaining()
1425 hi = fence = lst.elementCount; in forEachRemaining()
1430 if (a != null && (i = index) >= 0 && (index = hi) <= a.length) { in forEachRemaining()
1431 while (i < hi) in forEachRemaining()
DArrayList.java1340 int hi; // (a specialized variant appears in method forEach) in getFence() local
1342 if ((hi = fence) < 0) { in getFence()
1344 hi = fence = 0; in getFence()
1347 hi = fence = lst.size; in getFence()
1350 return hi; in getFence()
1354 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1363 int hi = getFence(), i = index; in tryAdvance() local
1364 if (i < hi) { in tryAdvance()
1376 int i, hi, mc; // hoist accesses and checks from loop in forEachRemaining() local
1381 if ((hi = fence) < 0) { in forEachRemaining()
[all …]
DHashMap.java1500 int hi; in getFence() local
1501 if ((hi = fence) < 0) { in getFence()
1506 hi = fence = (tab == null) ? 0 : tab.length; in getFence()
1508 return hi; in getFence()
1526 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1533 int i, hi, mc; in forEachRemaining() local
1538 if ((hi = fence) < 0) { in forEachRemaining()
1540 hi = fence = (tab == null) ? 0 : tab.length; in forEachRemaining()
1544 if (tab != null && tab.length >= hi && in forEachRemaining()
1545 (i = index) >= 0 && (i < (index = hi) || current != null)) { in forEachRemaining()
[all …]
DUUID.java385 long hi = 1L << (digits * 4); in digits() local
386 return Long.toHexString(hi | (val & (hi - 1))).substring(1); in digits()
DSpliterators.java943 Object[] a; int i, hi; // hoist accesses and checks from loop in forEachRemaining() local
946 if ((a = array).length >= (hi = fence) && in forEachRemaining()
947 (i = index) >= 0 && i < (index = hi)) { in forEachRemaining()
948 do { action.accept((T)a[i]); } while (++i < hi); in forEachRemaining()
1027 int[] a; int i, hi; // hoist accesses and checks from loop in forEachRemaining() local
1030 if ((a = array).length >= (hi = fence) && in forEachRemaining()
1031 (i = index) >= 0 && i < (index = hi)) { in forEachRemaining()
1032 do { action.accept(a[i]); } while (++i < hi); in forEachRemaining()
1110 long[] a; int i, hi; // hoist accesses and checks from loop in forEachRemaining() local
1113 if ((a = array).length >= (hi = fence) && in forEachRemaining()
[all …]
DTreeMap.java1365 final K lo, hi; field in TreeMap.NavigableSubMap
1371 boolean toEnd, K hi, boolean hiInclusive) { in NavigableSubMap() argument
1373 if (m.compare(lo, hi) > 0) in NavigableSubMap()
1379 m.compare(hi, hi); in NavigableSubMap()
1387 this.hi = hi; in NavigableSubMap()
1404 int c = m.compare(key, hi); in tooHigh()
1417 && (toEnd || m.compare(hi, key) >= 0); in inClosedRange()
1441 (hiInclusive ? m.getFloorEntry(hi) : in absHighest()
1442 m.getLowerEntry(hi))); in absHighest()
1477 m.getHigherEntry(hi) : in absHighFence()
[all …]
/libcore/ojluni/src/main/java/java/io/
DStreamTokenizer.java274 public void wordChars(int low, int hi) { in wordChars() argument
277 if (hi >= ctype.length) in wordChars()
278 hi = ctype.length - 1; in wordChars()
279 while (low <= hi) in wordChars()
295 public void whitespaceChars(int low, int hi) { in whitespaceChars() argument
298 if (hi >= ctype.length) in whitespaceChars()
299 hi = ctype.length - 1; in whitespaceChars()
300 while (low <= hi) in whitespaceChars()
315 public void ordinaryChars(int low, int hi) { in ordinaryChars() argument
318 if (hi >= ctype.length) in ordinaryChars()
[all …]
/libcore/jsr166-tests/src/test/java/jsr166/
DThreadLocalRandom8Test.java126 final int lo = least, hi = bound; in testBoundedInts() local
127 r.ints(size, lo, hi).parallel().forEach( in testBoundedInts()
129 if (x < lo || x >= hi) in testBoundedInts()
145 final long lo = least, hi = bound; in testBoundedLongs() local
146 r.longs(size, lo, hi).parallel().forEach( in testBoundedLongs()
148 if (x < lo || x >= hi) in testBoundedLongs()
164 final double lo = least, hi = bound; in testBoundedDoubles() local
165 r.doubles(size, lo, hi).parallel().forEach( in testBoundedDoubles()
167 if (x < lo || x >= hi) in testBoundedDoubles()
DRecursiveActionTest.java1208 final long[] array; final int lo, hi; field in RecursiveActionTest.SortTask
1209 SortTask(long[] array, int lo, int hi) { in SortTask() argument
1210 this.array = array; this.lo = lo; this.hi = hi; in SortTask()
1214 if (hi - lo < THRESHOLD) in compute()
1215 sortSequentially(lo, hi); in compute()
1217 int mid = (lo + hi) >>> 1; in compute()
1219 new SortTask(array, mid, hi)); in compute()
1220 merge(lo, mid, hi); in compute()
1225 void sortSequentially(int lo, int hi) { in sortSequentially() argument
1226 Arrays.sort(array, lo, hi); in sortSequentially()
[all …]
/libcore/ojluni/src/main/java/java/util/concurrent/
DCopyOnWriteArrayList.java1307 int hi = offset + size; in forEach() local
1311 if (lo < 0 || hi > a.length) in forEach()
1313 for (int i = lo; i < hi; ++i) { in forEach()
1323 int hi = offset + size; in replaceAll() local
1328 if (lo < 0 || hi > len) in replaceAll()
1331 for (int i = lo; i < hi; ++i) { in replaceAll()
1342 int hi = offset + size; in sort() local
1347 if (lo < 0 || hi > len) in sort()
1351 Arrays.sort(es, lo, hi, c); in sort()
1363 int hi = offset + n; in removeAll() local
[all …]
DPriorityBlockingQueue.java950 int hi; in getFence() local
951 if ((hi = fence) < 0) in getFence()
952 hi = fence = (array = queue.toArray()).length; in getFence()
953 return hi; in getFence()
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
969 if ((hi = fence) <= a.length && in forEachRemaining()
970 (i = index) >= 0 && i < (index = hi)) { in forEachRemaining()
971 do { action.accept((E)a[i]); } while (++i < hi); in forEachRemaining()
DCompletableFuture.java1332 int lo, int hi) { in andTree() argument
1334 if (lo > hi) // empty in andTree()
1338 int mid = (lo + hi) >>> 1; in andTree()
1341 (b = (lo == hi ? a : (hi == mid+1) ? cfs[hi] : in andTree()
1342 andTree(cfs, mid+1, hi))) == null) in andTree()
1588 int lo, int hi) { in orTree() argument
1590 if (lo <= hi) { in orTree()
1592 int mid = (lo + hi) >>> 1; in orTree()
1595 (b = (lo == hi ? a : (hi == mid+1) ? cfs[hi] : in orTree()
1596 orTree(cfs, mid+1, hi))) == null) in orTree()
/libcore/ojluni/src/main/java/java/nio/
DCharBufferSpliterator.java69 int hi = limit; in forEachRemaining() local
70 index = hi; in forEachRemaining()
71 while (i < hi) { in forEachRemaining()
/libcore/ojluni/src/main/java/java/nio/file/attribute/
DFileTime.java426 long hi = Math.floorDiv(zeroSecs, SECONDS_PER_10000_YEARS) + 1; in toString() local
429 year = ldt.getYear() + (int)hi * 10000; in toString()
433 long hi = zeroSecs / SECONDS_PER_10000_YEARS; in toString() local
436 year = ldt.getYear() + (int)hi * 10000; in toString()
/libcore/ojluni/src/main/java/sun/misc/
DFDBigInteger.java470 int hi = prev >>> anticount; in leftShift() local
472 if (hi != 0) { in leftShift()
474 result[nWords] = hi; in leftShift()
502 int hi = prev >>> anticount; in leftShift() local
505 if (hi != 0) { in leftShift()
509 result[nWords++] = hi; in leftShift()
/libcore/ojluni/src/main/java/java/awt/font/
DNumericShaper.java574 int hi = ranges.length - 1; in rangeForCodePoint() local
575 while (lo <= hi) { in rangeForCodePoint()
576 int mid = (lo + hi) / 2; in rangeForCodePoint()
579 hi = mid - 1; in rangeForCodePoint()
/libcore/ojluni/src/main/java/java/lang/
DString.java1569 final char hi = Character.highSurrogate(ch); in indexOfSupplementary() local
1573 if (charAt(i) == hi && charAt(i + 1) == lo) { in indexOfSupplementary()
1663 char hi = Character.highSurrogate(ch); in lastIndexOfSupplementary() local
1667 if (charAt(i) == hi && charAt(i + 1) == lo) { in lastIndexOfSupplementary()

12