| /libcore/luni/src/main/java/java/util/ |
| D | ComparableTimSort.java | 145 static void sort(Object[] a, int lo, int hi) { in sort() argument
146 Arrays.checkStartAndEnd(a.length, lo, hi); in sort()
147 int nRemaining = hi - lo; in sort()
153 int initRunLen = countRunAndMakeAscending(a, lo, hi); in sort()
154 binarySort(a, lo, hi, lo + initRunLen); in sort()
167 int runLen = countRunAndMakeAscending(a, lo, hi); in sort()
172 binarySort(a, lo, lo + force, lo + runLen); in sort()
177 ts.pushRun(lo, runLen); in sort()
181 lo += runLen; in sort()
186 if (DEBUG) assert lo == hi; in sort()
[all …]
|
| D | TimSort.java | 172 static <T> void sort(T[] a, int lo, int hi, Comparator<? super T> c) { in sort() argument
174 Arrays.sort(a, lo, hi); in sort()
178 Arrays.checkStartAndEnd(a.length, lo, hi); in sort()
179 int nRemaining = hi - lo; in sort()
185 int initRunLen = countRunAndMakeAscending(a, lo, hi, c); in sort()
186 binarySort(a, lo, hi, lo + initRunLen, c); in sort()
199 int runLen = countRunAndMakeAscending(a, lo, hi, c); in sort()
204 binarySort(a, lo, lo + force, lo + runLen, c); in sort()
209 ts.pushRun(lo, runLen); in sort()
213 lo += runLen; in sort()
[all …]
|
| D | Arrays.java | 190 int lo = startIndex; in binarySearch() local
193 while (lo <= hi) { in binarySearch()
194 int mid = (lo + hi) >>> 1; in binarySearch()
198 lo = mid + 1; in binarySearch()
205 return ~lo; // value not present in binarySearch()
240 int lo = startIndex; in binarySearch() local
243 while (lo <= hi) { in binarySearch()
244 int mid = (lo + hi) >>> 1; in binarySearch()
248 lo = mid + 1; in binarySearch()
255 return ~lo; // value not present in binarySearch()
[all …]
|
| D | TreeMap.java | 1694 Object lo;
1703 this.lo = from;
1720 return m.new BoundedMap(ascending, (K) lo, fromBound, (K) hi, toBound);
|
| /libcore/luni/src/test/java/libcore/java/net/ |
| D | NetworkInterfaceTest.java | 34 NetworkInterface lo = NetworkInterface.getByName("lo"); in testIPv6() local
35 Set<InetAddress> actual = new HashSet<InetAddress>(Collections.list(lo.getInetAddresses())); in testIPv6()
75 NetworkInterface lo = NetworkInterface.getByName("lo"); in testLoopback() local
76 assertNull(lo.getHardwareAddress()); in testLoopback()
77 for (InterfaceAddress ia : lo.getInterfaceAddresses()) { in testLoopback()
|
| /libcore/jsr166-tests/src/test/java/jsr166/ |
| D | RecursiveActionTest.java | 1196 final long[] array; final int lo, hi; field in RecursiveActionTest.SortTask
1197 SortTask(long[] array, int lo, int hi) { in SortTask() argument
1198 this.array = array; this.lo = lo; this.hi = hi; in SortTask()
1202 if (hi - lo < THRESHOLD) in compute()
1203 sortSequentially(lo, hi); in compute()
1205 int mid = (lo + hi) >>> 1; in compute()
1206 invokeAll(new SortTask(array, lo, mid), in compute()
1208 merge(lo, mid, hi); in compute()
1213 void sortSequentially(int lo, int hi) { in sortSequentially() argument
1214 Arrays.sort(array, lo, hi); in sortSequentially()
[all …]
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| D | ConcurrentSkipListMap.java | 2453 private final K lo; field in ConcurrentSkipListMap.SubMap
2479 this.lo = fromKey; in SubMap()
2489 if (lo != null) { in tooLow()
2490 int c = m.compare(key, lo); in tooLow()
2539 if (lo == null) in loNode()
2542 return m.findNear(lo, GT|EQ); in loNode()
2544 return m.findNear(lo, GT); in loNode()
2806 if (lo != null) { in newSubMap()
2808 fromKey = lo; in newSubMap()
2812 int c = m.compare(fromKey, lo); in newSubMap()
[all …]
|
| D | ConcurrentHashMap.java | 1763 TreeNode<K,V> lo = null, loTail = null; in transfer() local
1772 lo = p; in transfer()
1787 ln = (lc <= UNTREEIFY_THRESHOLD) ? untreeify(lo) : in transfer()
1788 (hc != 0) ? new TreeBin<K,V>(lo) : t; in transfer()
|
| /libcore/luni/src/main/native/ |
| D | java_math_NativeBN.cpp | 124 int lo = (int)dw; // This truncates implicitly. in NativeBN_putULongInt()
125 a->d[0] = lo; in NativeBN_putULongInt()
|
| /libcore/libart/src/main/java/java/lang/ |
| D | String.java | 314 int lo = 0xdc00 | (x & 0x3ff); in String() local
316 v[s++] = (char) lo; in String()
|