Home
last modified time | relevance | path

Searched refs:lo (Results 1 – 25 of 26) sorted by relevance

12

/libcore/luni/src/test/java/libcore/java/net/
DNetworkInterfaceTest.java42 NetworkInterface lo = NetworkInterface.getByName("lo"); in testIPv6() local
43 Set<InetAddress> actual = new HashSet<InetAddress>(Collections.list(lo.getInetAddresses())); in testIPv6()
102 NetworkInterface lo = NetworkInterface.getByName("lo"); in testLoopback() local
103 assertNull(lo.getHardwareAddress()); in testLoopback()
104 for (InterfaceAddress ia : lo.getInterfaceAddresses()) { in testLoopback()
152 NetworkInterface lo = NetworkInterface.getByName("lo"); in testInterfaceRemoval() local
159 nameField.set(lo, "noSuchInterface"); in testInterfaceRemoval()
162 lo.getHardwareAddress(); in testInterfaceRemoval()
167 lo.getMTU(); in testInterfaceRemoval()
172 lo.isLoopback(); in testInterfaceRemoval()
[all …]
/libcore/ojluni/src/main/java/java/util/
DArrayPrefixHelpers.java81 final int lo, hi, origin, fence, threshold; field in ArrayPrefixHelpers.CumulateTask
86 T[] array, int lo, int hi) { in CumulateTask() argument
89 this.lo = this.origin = lo; this.hi = this.fence = hi; in CumulateTask()
92 (p = (hi - lo) / (ForkJoinPool.getCommonPoolParallelism() << 3)) in CumulateTask()
99 int lo, int hi) { in CumulateTask() argument
104 this.lo = lo; this.hi = hi; in CumulateTask()
114 outer: while ((l = t.lo) >= 0 && (h = t.hi) <= a.length) { in compute()
210 par.lo == org) ? CUMULATE : 0); in compute()
233 final int lo, hi, origin, fence, threshold; field in ArrayPrefixHelpers.LongCumulateTask
238 long[] array, int lo, int hi) { in LongCumulateTask() argument
[all …]
DComparableTimSort.java175 static void sort(Object[] a, int lo, int hi, Object[] work, int workBase, int workLen) { in sort() argument
176 assert a != null && lo >= 0 && lo <= hi && hi <= a.length; in sort() local
178 int nRemaining = hi - lo; in sort()
184 int initRunLen = countRunAndMakeAscending(a, lo, hi); in sort()
185 binarySort(a, lo, hi, lo + initRunLen); in sort()
198 int runLen = countRunAndMakeAscending(a, lo, hi); in sort()
203 binarySort(a, lo, lo + force, lo + runLen); in sort()
208 ts.pushRun(lo, runLen); in sort()
212 lo += runLen; in sort()
217 assert lo == hi; in sort()
[all …]
DTimSort.java206 static <T> void sort(T[] a, int lo, int hi, Comparator<? super T> c, in sort() argument
208 assert c != null && a != null && lo >= 0 && lo <= hi && hi <= a.length; in sort() local
210 int nRemaining = hi - lo; in sort()
216 int initRunLen = countRunAndMakeAscending(a, lo, hi, c); in sort()
217 binarySort(a, lo, hi, lo + initRunLen, c); in sort()
230 int runLen = countRunAndMakeAscending(a, lo, hi, c); in sort()
235 binarySort(a, lo, lo + force, lo + runLen, c); in sort()
240 ts.pushRun(lo, runLen); in sort()
244 lo += runLen; in sort()
249 assert lo == hi; in sort()
[all …]
DArraysParallelSortHelpers.java181 for (int lo = 0; lo < rh; ) { in compute()
182 int rm = (lo + rh) >>> 1; in compute()
186 lo = rm + 1; in compute()
194 for (int lo = 0; lo < lh; ) { in compute()
195 int lm = (lo + lh) >>> 1; in compute()
199 lo = lm + 1; in compute()
294 for (int lo = 0; lo < rh; ) { in compute()
295 int rm = (lo + rh) >>> 1; in compute()
299 lo = rm + 1; in compute()
307 for (int lo = 0; lo < lh; ) { in compute()
[all …]
DPriorityQueue.java848 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
849 return (lo >= mid) ? null : in trySplit()
850 new PriorityQueueSpliterator<>(pq, lo, index = mid, in trySplit()
887 int hi = getFence(), lo = index; in tryAdvance() local
888 if (lo >= 0 && lo < hi) { in tryAdvance()
889 index = lo + 1; in tryAdvance()
890 @SuppressWarnings("unchecked") E e = (E)pq.queue[lo]; in tryAdvance()
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()
196 for (int i = right, lo = run[count - 1]; --i >= lo; 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()
644 for (int i = right, lo = run[count - 1]; --i >= lo; in sort()
1060 for (int lo = run[count] - 1, hi = k; ++lo < --hi; ) { in doSort()
1061 short t = a[lo]; a[lo] = a[hi]; a[hi] = t; in doSort()
1128 for (int i = right, lo = run[count - 1]; --i >= lo; in doSort()
1544 for (int lo = run[count] - 1, hi = k; ++lo < --hi; ) { in doSort()
[all …]
DSpliterators.java934 int lo = index, mid = (lo + fence) >>> 1; in trySplit() local
935 return (lo >= mid) in trySplit()
937 : new ArraySpliterator<>(array, lo, index = mid, characteristics); in trySplit()
1019 int lo = index, mid = (lo + fence) >>> 1; in trySplit() local
1020 return (lo >= mid) in trySplit()
1022 : new IntArraySpliterator(array, lo, index = mid, characteristics); in trySplit()
1102 int lo = index, mid = (lo + fence) >>> 1; in trySplit() local
1103 return (lo >= mid) in trySplit()
1105 : new LongArraySpliterator(array, lo, index = mid, characteristics); in trySplit()
1185 int lo = index, mid = (lo + fence) >>> 1; in trySplit() local
[all …]
DWeakHashMap.java1082 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1083 return (lo >= mid) ? null : in trySplit()
1084 new KeySpliterator<K,V>(map, lo, index = mid, est >>>= 1, in trySplit()
1162 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1163 return (lo >= mid) ? null : in trySplit()
1164 new ValueSpliterator<K,V>(map, lo, index = mid, est >>>= 1, in trySplit()
1239 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1240 return (lo >= mid) ? null : in trySplit()
1241 new EntrySpliterator<K,V>(map, lo, index = mid, est >>>= 1, in trySplit()
DTreeMap.java1385 final K lo, hi; field in TreeMap.NavigableSubMap
1390 boolean fromStart, K lo, boolean loInclusive, in NavigableSubMap() argument
1393 if (m.compare(lo, hi) > 0) in NavigableSubMap()
1397 m.compare(lo, lo); in NavigableSubMap()
1404 this.lo = lo; in NavigableSubMap()
1415 int c = m.compare(key, lo); in tooLow()
1436 return (fromStart || m.compare(key, lo) >= 0) in inClosedRange()
1453 (loInclusive ? m.getCeilingEntry(lo) : in absLowest()
1454 m.getHigherEntry(lo))); in absLowest()
1504 m.getLowerEntry(lo) : in absLowFence()
[all …]
DIdentityHashMap.java1427 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit() local
1428 return (lo >= mid) ? null : in trySplit()
1429 new KeySpliterator<K,V>(map, lo, index = mid, est >>>= 1, in trySplit()
1484 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit() local
1485 return (lo >= mid) ? null : in trySplit()
1486 new ValueSpliterator<K,V>(map, lo, index = mid, est >>>= 1, in trySplit()
1543 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit() local
1544 return (lo >= mid) ? null : in trySplit()
1545 new EntrySpliterator<K,V>(map, lo, index = mid, est >>>= 1, in trySplit()
DHashMap.java943 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
944 return (lo >= mid || current != null) ? null : in trySplit()
945 new KeySpliterator<>(map, lo, index = mid, est >>>= 1, in trySplit()
1016 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1017 return (lo >= mid || current != null) ? null : in trySplit()
1018 new ValueSpliterator<>(map, lo, index = mid, est >>>= 1, in trySplit()
1088 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1089 return (lo >= mid || current != null) ? null : in trySplit()
1090 new EntrySpliterator<>(map, lo, index = mid, est >>>= 1, in trySplit()
DVector.java1311 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1312 return (lo >= mid) ? null : in trySplit()
1313 new VectorSpliterator<E>(list, array, lo, index = mid, in trySplit()
DArrayList.java1325 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1326 return (lo >= mid) ? null : // divide range in half unless too small in trySplit()
1327 new ArrayListSpliterator<E>(list, lo, index = mid, in trySplit()
/libcore/ojluni/src/main/java/java/nio/
DCharBufferSpliterator.java57 int lo = index, mid = (lo + limit) >>> 1; in trySplit() local
58 return (lo >= mid) in trySplit()
60 : new CharBufferSpliterator(buffer, lo, index = mid); in trySplit()
/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()
1218 invokeAll(new SortTask(array, lo, mid), 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/libart/src/main/java/java/lang/
DStringFactory.java160 int lo = 0xdc00 | (x & 0x3ff); in newStringFromBytes() local
162 v[s++] = (char) lo; in newStringFromBytes()
/libcore/ojluni/src/main/java/java/awt/font/
DNumericShaper.java573 int lo = 0; in rangeForCodePoint() local
575 while (lo <= hi) { in rangeForCodePoint()
576 int mid = (lo + hi) / 2; in rangeForCodePoint()
581 lo = mid + 1; in rangeForCodePoint()
/libcore/luni/src/main/java/java/util/concurrent/
DPriorityBlockingQueue.java928 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
929 return (lo >= mid) ? null : in trySplit()
930 new PBQSpliterator<E>(queue, array, lo, index = mid); in trySplit()
DCompletableFuture.java1301 int lo, int hi) { in andTree() argument
1303 if (lo > hi) // empty in andTree()
1307 int mid = (lo + hi) >>> 1; in andTree()
1308 if ((a = (lo == mid ? cfs[lo] : in andTree()
1309 andTree(cfs, lo, mid))) == null || in andTree()
1310 (b = (lo == hi ? a : (hi == mid+1) ? cfs[hi] : in andTree()
1557 int lo, int hi) { in orTree() argument
1559 if (lo <= hi) { in orTree()
1561 int mid = (lo + hi) >>> 1; in orTree()
1562 if ((a = (lo == mid ? cfs[lo] : in orTree()
[all …]
DConcurrentSkipListMap.java2544 private final K lo; field in ConcurrentSkipListMap.SubMap
2571 this.lo = fromKey; in SubMap()
2582 return (lo != null && ((c = cpr(cmp, key, lo)) < 0 || in tooLow()
2626 if (lo == null) in loNode()
2629 return m.findNear(lo, GT|EQ, cmp); in loNode()
2631 return m.findNear(lo, GT, cmp); in loNode()
2900 if (lo != null) { in newSubMap()
2902 fromKey = lo; in newSubMap()
2906 int c = cpr(cmp, fromKey, lo); in newSubMap()
2958 return new SubMap<K,V>(m, lo, loInclusive, in descendingMap()
/libcore/ojluni/src/main/java/java/lang/
DString.java1476 final char lo = Character.lowSurrogate(ch); in indexOfSupplementary() local
1479 if (charAt(i) == hi && charAt(i + 1) == lo) { in indexOfSupplementary()
1570 char lo = Character.lowSurrogate(ch); in lastIndexOfSupplementary() local
1573 if (charAt(i) == hi && charAt(i + 1) == lo) { in lastIndexOfSupplementary()
/libcore/luni/src/test/java/libcore/io/
DOsTest.java305 NetworkInterface lo = NetworkInterface.getByName("lo"); in test_PacketSocketAddress() local
307 PacketSocketAddress addr = new PacketSocketAddress((short) ETH_P_IPV6, lo.getIndex()); in test_PacketSocketAddress()
312 assertEquals(lo.getIndex(), bound.sll_ifindex); in test_PacketSocketAddress()
/libcore/ojluni/src/main/java/sun/security/x509/
DAVA.java539 int lo = Character.digit((char)c2, 16); in getEmbeddedHexPair() local
540 return new Byte((byte)((hi<<4) + lo)); in getEmbeddedHexPair()

12