Searched refs:lo (Results 1 - 25 of 27) sorted by relevance

12

/libcore/ojluni/src/main/java/java/nio/
H A DCharBufferSpliterator.java57 int lo = index, mid = (lo + limit) >>> 1;
58 return (lo >= mid)
60 : new CharBufferSpliterator(buffer, lo, index = mid);
/libcore/luni/src/test/java/libcore/java/net/
H A DNetworkInterfaceTest.java54 NetworkInterface lo = NetworkInterface.getByName("lo");
55 Set<InetAddress> actual = new HashSet<InetAddress>(Collections.list(lo.getInetAddresses()));
114 NetworkInterface lo = NetworkInterface.getByName("lo");
115 assertNull(lo.getHardwareAddress());
116 for (InterfaceAddress ia : lo.getInterfaceAddresses()) {
164 NetworkInterface lo = NetworkInterface.getByName("lo");
171 nameField.set(lo, "noSuchInterfac
[all...]
/libcore/ojluni/src/main/java/java/util/
H A DComparableTimSort.java172 * @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 DTimSort.java202 * @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 DArrayPrefixHelpers.java77 * 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 DArraysParallelSortHelpers.java181 for (int lo = 0; lo < rh; ) {
182 int rm = (lo + rh) >>> 1;
186 lo = rm + 1;
194 for (int lo = 0; lo < lh; ) {
195 int lm = (lo + lh) >>> 1;
199 lo = lm + 1;
294 for (int lo = 0; lo < r
[all...]
H A DPriorityQueue.java848 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1;
849 return (lo >= mid) ? null :
850 new PriorityQueueSpliterator<>(pq, lo, index = mid,
887 int hi = getFence(), lo = index;
888 if (lo >= 0 && lo < hi) {
889 index = lo + 1;
890 @SuppressWarnings("unchecked") E e = (E)pq.queue[lo];
H A DSpliterators.java934 int lo = index, mid = (lo + fence) >>> 1;
935 return (lo >= mid)
937 : new ArraySpliterator<>(array, lo, index = mid, characteristics);
1019 int lo = index, mid = (lo + fence) >>> 1;
1020 return (lo >= mid)
1022 : new IntArraySpliterator(array, lo, index = mid, characteristics);
1102 int lo = index, mid = (lo
[all...]
H A DDualPivotQuicksort.java128 for (int lo = run[count] - 1, hi = k; ++lo < --hi; ) {
129 int t = a[lo]; a[lo] = a[hi]; a[hi] = t;
196 for (int i = right, lo = run[count - 1]; --i >= lo;
576 for (int lo = run[count] - 1, hi = k; ++lo < --hi; ) {
577 long t = a[lo]; a[lo]
[all...]
H A DIdentityHashMap.java1424 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1;
1425 return (lo >= mid) ? null :
1426 new KeySpliterator<K,V>(map, lo, index = mid, est >>>= 1,
1481 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1;
1482 return (lo >= mid) ? null :
1483 new ValueSpliterator<K,V>(map, lo, index = mid, est >>>= 1,
1540 int hi = getFence(), lo = index, mid = ((lo
[all...]
H A DWeakHashMap.java1106 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1;
1107 return (lo >= mid) ? null :
1108 new KeySpliterator<K,V>(map, lo, index = mid, est >>>= 1,
1186 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1;
1187 return (lo >= mid) ? null :
1188 new ValueSpliterator<K,V>(map, lo, index = mid, est >>>= 1,
1263 int hi = getFence(), lo = index, mid = (lo
[all...]
H A DTreeMap.java1358 * Endpoints are represented as triples (fromStart, lo,
1362 * if loInclusive is true, lo is the inclusive bound, else lo
1365 final K lo, hi; field in class:TreeMap.NavigableSubMap
1370 boolean fromStart, K lo, boolean loInclusive,
1373 if (m.compare(lo, hi) > 0)
1377 m.compare(lo, lo);
1384 this.lo = lo;
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...]
H A DVector.java1385 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1;
1386 return (lo >= mid) ? null :
1387 new VectorSpliterator<E>(list, array, lo, index = mid,
H A DHashMap.java1526 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1;
1527 return (lo >= mid || current != null) ? null :
1528 new KeySpliterator<>(map, lo, index = mid, est >>>= 1,
1598 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1;
1599 return (lo >= mid || current != null) ? null :
1600 new ValueSpliterator<>(map, lo, index = mid, est >>>= 1,
1669 int hi = getFence(), lo = index, mid = (lo
[all...]
H A DArrayList.java1354 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1;
1355 return (lo >= mid) ? null : // divide range in half unless too small
1356 new ArrayListSpliterator<E>(list, lo, index = mid,
/libcore/jsr166-tests/src/test/java/jsr166/
H A DThreadLocalRandom8Test.java126 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 DRecursiveActionTest.java1208 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 DCopyOnWriteArrayList.java1311 int lo = offset;
1316 if (lo < 0 || hi > a.length)
1318 for (int i = lo; i < hi; ++i) {
1327 int lo = offset;
1333 if (lo < 0 || hi > len)
1336 for (int i = lo; i < hi; ++i) {
1346 int lo = offset;
1352 if (lo < 0 || hi > len)
1356 Arrays.sort(es, lo, hi, c);
1367 int lo
[all...]
H A DPriorityBlockingQueue.java957 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1;
958 return (lo >= mid) ? null :
959 new PBQSpliterator<E>(queue, array, lo, index = mid);
H A DCompletableFuture.java1330 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 DConcurrentSkipListMap.java2573 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...]
/libcore/ojluni/src/main/java/java/nio/file/attribute/
H A DFileTime.java427 long lo = Math.floorMod(zeroSecs, SECONDS_PER_10000_YEARS);
428 ldt = LocalDateTime.ofEpochSecond(lo - SECONDS_0000_TO_1970, nanos, ZoneOffset.UTC);
434 long lo = zeroSecs % SECONDS_PER_10000_YEARS;
435 ldt = LocalDateTime.ofEpochSecond(lo - SECONDS_0000_TO_1970, nanos, ZoneOffset.UTC);
/libcore/ojluni/src/main/java/java/awt/font/
H A DNumericShaper.java573 int lo = 0;
575 while (lo <= hi) {
576 int mid = (lo + hi) / 2;
581 lo = mid + 1;
/libcore/ojluni/src/main/java/java/lang/
H A DString.java1570 final char lo = Character.lowSurrogate(ch);
1573 if (charAt(i) == hi && charAt(i + 1) == lo) {
1664 char lo = Character.lowSurrogate(ch);
1667 if (charAt(i) == hi && charAt(i + 1) == lo) {
/libcore/luni/src/test/java/libcore/libcore/io/
H A DOsTest.java322 NetworkInterface lo = NetworkInterface.getByName("lo");
324 PacketSocketAddress addr = new PacketSocketAddress((short) ETH_P_IPV6, lo.getIndex());
329 assertEquals(lo.getIndex(), bound.sll_ifindex);

Completed in 555 milliseconds

12