Home
last modified time | relevance | path

Searched defs:lo (Results 1 – 24 of 24) sorted by relevance

/libcore/luni/src/test/java/libcore/java/net/
DNetworkInterfaceTest.java42 NetworkInterface lo = NetworkInterface.getByName("lo"); in testIPv6() local
102 NetworkInterface lo = NetworkInterface.getByName("lo"); in testLoopback() local
152 NetworkInterface lo = NetworkInterface.getByName("lo"); in testInterfaceRemoval() local
/libcore/ojluni/src/main/java/java/util/
DComparableTimSort.java175 static void sort(Object[] a, int lo, int hi, Object[] work, int workBase, int workLen) { in sort()
176 assert a != null && lo >= 0 && lo <= hi && hi <= a.length; in sort() local
240 private static void binarySort(Object[] a, int lo, int hi, int start) { in binarySort()
241 assert lo <= start && start <= hi; in binarySort() local
309 private static int countRunAndMakeAscending(Object[] a, int lo, int hi) { in countRunAndMakeAscending()
DArrayPrefixHelpers.java81 final int lo, hi, origin, fence, threshold; field in ArrayPrefixHelpers.CumulateTask
86 T[] array, int lo, int hi) { in CumulateTask()
99 int lo, int hi) { in CumulateTask()
233 final int lo, hi, origin, fence, threshold; field in ArrayPrefixHelpers.LongCumulateTask
238 long[] array, int lo, int hi) { in LongCumulateTask()
251 int lo, int hi) { in LongCumulateTask()
383 final int lo, hi, origin, fence, threshold; field in ArrayPrefixHelpers.DoubleCumulateTask
388 double[] array, int lo, int hi) { in DoubleCumulateTask()
401 int lo, int hi) { in DoubleCumulateTask()
533 final int lo, hi, origin, fence, threshold; field in ArrayPrefixHelpers.IntCumulateTask
[all …]
DTimSort.java206 static <T> void sort(T[] a, int lo, int hi, Comparator<? super T> c, in sort()
208 assert c != null && a != null && lo >= 0 && lo <= hi && hi <= a.length; in sort() local
273 private static <T> void binarySort(T[] a, int lo, int hi, int start, in binarySort()
275 assert lo <= start && start <= hi; in binarySort() local
343 private static <T> int countRunAndMakeAscending(T[] a, int lo, int hi, in countRunAndMakeAscending()
DPriorityQueue.java848 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
887 int hi = getFence(), lo = index; in tryAdvance() local
DWeakHashMap.java1082 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1162 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1239 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
DHashMap.java943 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1016 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
1088 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
DSpliterators.java934 int lo = index, mid = (lo + fence) >>> 1; in trySplit() local
1019 int lo = index, mid = (lo + fence) >>> 1; in trySplit() local
1102 int lo = index, mid = (lo + fence) >>> 1; in trySplit() local
1185 int lo = index, mid = (lo + fence) >>> 1; in trySplit() local
DIdentityHashMap.java1427 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit() local
1484 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit() local
1543 int hi = getFence(), lo = index, mid = ((lo + hi) >>> 1) & ~1; in trySplit() local
DTreeMap.java1385 final K lo, hi; field in TreeMap.NavigableSubMap
1390 boolean fromStart, K lo, boolean loInclusive, in NavigableSubMap()
1879 boolean fromStart, K lo, boolean loInclusive, in AscendingSubMap()
1971 boolean fromStart, K lo, boolean loInclusive, in DescendingSubMap()
2573 private final TreeMapEntry<K,V> buildFromSorted(int level, int lo, int hi, in buildFromSorted()
DVector.java1311 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
DArrayList.java1325 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
/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.java57 int lo = index, mid = (lo + limit) >>> 1; in trySplit() local
/libcore/libart/src/main/java/java/lang/
DStringFactory.java160 int lo = 0xdc00 | (x & 0x3ff); in newStringFromBytes() local
/libcore/luni/src/test/java/libcore/io/
DOsTest.java305 NetworkInterface lo = NetworkInterface.getByName("lo"); in test_PacketSocketAddress() local
/libcore/ojluni/src/main/java/java/lang/
DString.java1476 final char lo = Character.lowSurrogate(ch); in indexOfSupplementary() local
1570 char lo = Character.lowSurrogate(ch); in lastIndexOfSupplementary() local
/libcore/ojluni/src/main/java/sun/security/x509/
DAVA.java539 int lo = Character.digit((char)c2, 16); in getEmbeddedHexPair() local
/libcore/luni/src/main/java/java/util/concurrent/
DPriorityBlockingQueue.java928 int hi = getFence(), lo = index, mid = (lo + hi) >>> 1; in trySplit() local
DCompletableFuture.java1301 int lo, int hi) { in andTree()
1557 int lo, int hi) { in orTree()
DConcurrentSkipListMap.java2544 private final K lo; field in ConcurrentSkipListMap.SubMap
DConcurrentHashMap.java2491 TreeNode<K,V> lo = null, loTail = null; in transfer() local
/libcore/ojluni/src/main/java/java/awt/font/
DNumericShaper.java573 int lo = 0; in rangeForCodePoint() local