Searched refs:hint (Results 1 – 4 of 4) sorted by relevance
| /libcore/ojluni/src/main/java/java/util/ |
| D | ComparableTimSort.java | 504 int base, int len, int hint) { in gallopLeft() argument
505 assert len > 0 && hint >= 0 && hint < len; in gallopLeft()
509 if (key.compareTo(a[base + hint]) > 0) { in gallopLeft()
511 int maxOfs = len - hint; in gallopLeft()
512 while (ofs < maxOfs && key.compareTo(a[base + hint + ofs]) > 0) { in gallopLeft()
522 lastOfs += hint; in gallopLeft()
523 ofs += hint; in gallopLeft()
526 final int maxOfs = hint + 1; in gallopLeft()
527 while (ofs < maxOfs && key.compareTo(a[base + hint - ofs]) <= 0) { in gallopLeft()
538 lastOfs = hint - ofs; in gallopLeft()
[all …]
|
| D | TimSort.java | 537 private static <T> int gallopLeft(T key, T[] a, int base, int len, int hint, in gallopLeft() argument
539 assert len > 0 && hint >= 0 && hint < len; in gallopLeft()
542 if (c.compare(key, a[base + hint]) > 0) { in gallopLeft()
544 int maxOfs = len - hint; in gallopLeft()
545 while (ofs < maxOfs && c.compare(key, a[base + hint + ofs]) > 0) { in gallopLeft()
555 lastOfs += hint; in gallopLeft()
556 ofs += hint; in gallopLeft()
559 final int maxOfs = hint + 1; in gallopLeft()
560 while (ofs < maxOfs && c.compare(key, a[base + hint - ofs]) <= 0) { in gallopLeft()
571 lastOfs = hint - ofs; in gallopLeft()
[all …]
|
| /libcore/ojluni/src/main/java/java/util/concurrent/ |
| D | ForkJoinPool.java | 814 int hint; // randomization and stealer index hint field in ForkJoinPool.WorkQueue
1615 w.hint = s; // use as random seed in registerWorker()
1933 long seed = w.hint * 0xdaba0b6eb09322e3L; // initial random seed in runWorker()
2104 for (int h = j.hint | 1, k = 0, i;;) { in helpStealer()
2107 j.hint = i; in helpStealer()
|
| /libcore/benchmarks/src/benchmarks/regression/ |
| D | R.java | 1700 public static final int hint = 0; field in R
|