Searched refs:hint (Results 1 – 4 of 4) sorted by relevance
| /libcore/luni/src/main/java/java/util/ |
| D | ComparableTimSort.java | 470 int base, int len, int hint) { in gallopLeft() argument
471 if (DEBUG) assert len > 0 && hint >= 0 && hint < len; in gallopLeft()
475 if (key.compareTo(a[base + hint]) > 0) { in gallopLeft()
477 int maxOfs = len - hint; in gallopLeft()
478 while (ofs < maxOfs && key.compareTo(a[base + hint + ofs]) > 0) { in gallopLeft()
488 lastOfs += hint; in gallopLeft()
489 ofs += hint; in gallopLeft()
492 final int maxOfs = hint + 1; in gallopLeft()
493 while (ofs < maxOfs && key.compareTo(a[base + hint - ofs]) <= 0) { in gallopLeft()
504 lastOfs = hint - ofs; in gallopLeft()
[all …]
|
| D | TimSort.java | 502 private static <T> int gallopLeft(T key, T[] a, int base, int len, int hint, in gallopLeft() argument
504 if (DEBUG) assert len > 0 && hint >= 0 && hint < len; in gallopLeft()
507 if (c.compare(key, a[base + hint]) > 0) { in gallopLeft()
509 int maxOfs = len - hint; in gallopLeft()
510 while (ofs < maxOfs && c.compare(key, a[base + hint + ofs]) > 0) { in gallopLeft()
520 lastOfs += hint; in gallopLeft()
521 ofs += hint; in gallopLeft()
524 final int maxOfs = hint + 1; in gallopLeft()
525 while (ofs < maxOfs && c.compare(key, a[base + hint - ofs]) <= 0) { in gallopLeft()
536 lastOfs = hint - ofs; in gallopLeft()
[all …]
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| D | ForkJoinPool.java | 633 int hint; // steal index hint field in ForkJoinPool.WorkQueue
654 this.hint = seed; // store initial seed for runWorker in WorkQueue()
1636 for (int r = w.hint; scan(w, r) == 0; ) { in runWorker()
1820 if ((v = ws[h = (j.hint | 1) & m]) == null || in tryHelpStealer()
1828 j.hint = h; // save hint in tryHelpStealer()
|
| /libcore/benchmarks/src/benchmarks/regression/ |
| D | R.java | 1700 public static final int hint = 0; field in R
|