Searched refs:hint (Results 1 - 4 of 4) sorted by relevance
/libcore/ojluni/src/main/java/java/util/ |
H A D | ComparableTimSort.java | 495 * @param hint the index at which to begin the search, 0 <= hint < n. 496 * The closer hint is to the result, the faster this method will run. 504 int base, int len, int hint) { 505 assert len > 0 && hint >= 0 && hint < len; 509 if (key.compareTo(a[base + hint]) > 0) { 510 // Gallop right until a[base+hint+lastOfs] < key <= a[base+hint+ofs] 511 int maxOfs = len - hint; 503 gallopLeft(Comparable<Object> key, Object[] a, int base, int len, int hint) argument 573 gallopRight(Comparable<Object> key, Object[] a, int base, int len, int hint) argument [all...] |
H A D | TimSort.java | 528 * @param hint the index at which to begin the search, 0 <= hint < n. 529 * The closer hint is to the result, the faster this method will run. 537 private static <T> int gallopLeft(T key, T[] a, int base, int len, int hint, argument 539 assert len > 0 && hint >= 0 && hint < len; 542 if (c.compare(key, a[base + hint]) > 0) { 543 // Gallop right until a[base+hint+lastOfs] < key <= a[base+hint+ofs] 544 int maxOfs = len - hint; 607 gallopRight(T key, T[] a, int base, int len, int hint, Comparator<? super T> c) argument [all...] |
/libcore/ojluni/src/main/java/java/util/concurrent/ |
H A D | ForkJoinPool.java | 553 * stale/wrong) of where to locate them. It is only a hint 554 * because a worker might have had multiple steals and the hint 812 int hint; // randomization and stealer index hint field in class:ForkJoinPool.WorkQueue 1612 w.hint = s; // use as random seed 1930 long seed = w.hint * 0xdaba0b6eb09322e3L; // initial random seed 2101 for (int h = j.hint | 1, k = 0, i;;) { 2104 j.hint = i;
|
/libcore/benchmarks/src/benchmarks/regression/ |
H A D | R.java | 1700 public static final int hint = 0; field in class:R
|
Completed in 394 milliseconds