Searched refs:hint (Results 1 – 4 of 4) sorted by relevance
| /libcore/ojluni/src/main/java/java/util/ |
| D | ComparableTimSort.java | 500 int base, int len, int hint) { in gallopLeft() argument
501 assert len > 0 && hint >= 0 && hint < len; in gallopLeft()
505 if (key.compareTo(a[base + hint]) > 0) { in gallopLeft()
507 int maxOfs = len - hint; in gallopLeft()
508 while (ofs < maxOfs && key.compareTo(a[base + hint + ofs]) > 0) { in gallopLeft()
518 lastOfs += hint; in gallopLeft()
519 ofs += hint; in gallopLeft()
522 final int maxOfs = hint + 1; in gallopLeft()
523 while (ofs < maxOfs && key.compareTo(a[base + hint - ofs]) <= 0) { in gallopLeft()
534 lastOfs = hint - ofs; in gallopLeft()
[all …]
|
| D | TimSort.java | 533 private static <T> int gallopLeft(T key, T[] a, int base, int len, int hint, in gallopLeft() argument
535 assert len > 0 && hint >= 0 && hint < len; in gallopLeft()
538 if (c.compare(key, a[base + hint]) > 0) { in gallopLeft()
540 int maxOfs = len - hint; in gallopLeft()
541 while (ofs < maxOfs && c.compare(key, a[base + hint + ofs]) > 0) { in gallopLeft()
551 lastOfs += hint; in gallopLeft()
552 ofs += hint; in gallopLeft()
555 final int maxOfs = hint + 1; in gallopLeft()
556 while (ofs < maxOfs && c.compare(key, a[base + hint - ofs]) <= 0) { in gallopLeft()
567 lastOfs = hint - ofs; in gallopLeft()
[all …]
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| D | ForkJoinPool.java | 783 int hint; // randomization and stealer index hint field in ForkJoinPool.WorkQueue
1583 w.hint = s; // use as random seed in registerWorker()
1901 long seed = w.hint * 0xdaba0b6eb09322e3L; // initial random seed in runWorker()
2072 for (int h = j.hint | 1, k = 0, i;;) { in helpStealer()
2075 j.hint = i; in helpStealer()
|
| /libcore/benchmarks/src/benchmarks/regression/ |
| D | R.java | 1700 public static final int hint = 0; field in R
|