/libcore/luni/src/main/java/java/io/ |
D | StreamTokenizer.java | 509 public void ordinaryChars(int low, int hi) { in ordinaryChars() argument 513 if (hi > tokenTypes.length) { in ordinaryChars() 514 hi = tokenTypes.length - 1; in ordinaryChars() 516 for (int i = low; i <= hi; i++) { in ordinaryChars() 642 public void whitespaceChars(int low, int hi) { in whitespaceChars() argument 646 if (hi > tokenTypes.length) { in whitespaceChars() 647 hi = tokenTypes.length - 1; in whitespaceChars() 649 for (int i = low; i <= hi; i++) { in whitespaceChars() 664 public void wordChars(int low, int hi) { in wordChars() argument 668 if (hi > tokenTypes.length) { in wordChars() [all …]
|
/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() 186 if (DEBUG) assert lo == hi; in sort() local 209 private static void binarySort(Object[] a, int lo, int hi, int start) { in binarySort() argument 210 if (DEBUG) assert lo <= start && start <= hi; in binarySort() 213 for ( ; start < hi; start++) { in binarySort() [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() 218 if (DEBUG) assert lo == hi; in sort() local 242 private static <T> void binarySort(T[] a, int lo, int hi, int start, in binarySort() argument 244 if (DEBUG) assert lo <= start && start <= hi; in binarySort() [all …]
|
D | Arrays.java | 191 int hi = endIndex - 1; in binarySearch() local 193 while (lo <= hi) { in binarySearch() 194 int mid = (lo + hi) >>> 1; in binarySearch() 200 hi = mid - 1; in binarySearch() 241 int hi = endIndex - 1; in binarySearch() local 243 while (lo <= hi) { in binarySearch() 244 int mid = (lo + hi) >>> 1; in binarySearch() 250 hi = mid - 1; in binarySearch() 291 int hi = endIndex - 1; in binarySearch() local 293 while (lo <= hi) { in binarySearch() [all …]
|
D | TreeMap.java | 1695 Object hi; 1704 this.hi = to; 1720 return m.new BoundedMap(ascending, (K) lo, fromBound, (K) hi, toBound);
|
/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() 1207 new SortTask(array, mid, hi)); 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 | 2455 private final K hi; field in ConcurrentSkipListMap.SubMap 2480 this.hi = toKey; in SubMap() 2498 if (hi != null) { in tooHigh() 2499 int c = m.compare(key, hi); in tooHigh() 2523 if (hi == null) in isBeforeEnd() 2528 int c = m.compare(k, hi); in isBeforeEnd() 2552 if (hi == null) in hiNode() 2555 return m.findNear(hi, LT|EQ); in hiNode() 2557 return m.findNear(hi, LT); in hiNode() 2817 if (hi != null) { in newSubMap() [all …]
|
D | ConcurrentHashMap.java | 1764 TreeNode<K,V> hi = null, hiTail = null; in transfer() local 1780 hi = p; in transfer() 1789 hn = (hc <= UNTREEIFY_THRESHOLD) ? untreeify(hi) : in transfer() 1790 (lc != 0) ? new TreeBin<K,V>(hi) : t; in transfer()
|
/libcore/luni/src/main/native/ |
D | java_math_NativeBN.cpp | 123 unsigned int hi = dw >> 32; // This shifts without sign extension. in NativeBN_putULongInt() 126 a->d[1] = hi; in NativeBN_putULongInt()
|
/libcore/libart/src/main/java/java/lang/ |
D | String.java | 313 int hi = 0xd800 | (w << 6) | (x >> 10); in String() local 315 v[s++] = (char) hi; in String()
|