/openjdk9/nashorn/test/lib/ |
H A D | benchmark.js | 34 runs = 0; 37 runs++; 45 period = totalTime / runs;
|
/openjdk9/jdk/src/java.base/share/classes/sun/text/bidi/ |
H A D | BidiLine.java | 64 * The implementation of the access to same-level-runs and of the reordering 70 * same-level-runs is created. Reordering then is done on this vector. 75 * This is inefficient if there are many very short runs. If the average run 157 lineBidi.runs = new BidiRun[0]; 304 int start = bidiBase.runs[runIndex].start; 306 byte level = bidiBase.runs[runIndex].level; 310 bidiBase.runs[runIndex].limit - 311 bidiBase.runs[runIndex - 1].limit; 313 limit = start + bidiBase.runs[0].limit; 321 bidiBase.runs [all...] |
H A D | BidiBase.java | 81 * Some of the API methods provide access to "runs". Such a 254 * // render runs on a line sequentially, always from left to right 268 * // from the style runs with the directional runs 276 * // (possibly) multiple style runs intersecting with it 282 * // iterate over style runs 349 * // iterate over directional runs 356 * // iterate over both directional and style runs 706 * keep combining characters after their base characters in RTL runs 715 * replace characters with the "mirrored" property in RTL runs 1124 BidiRun[] runs; field in class:BidiBase [all...] |
H A D | BidiWriter.java | 58 * semantically write RTL runs in reverse and later reverse them again. 127 * RTL runs need to be copied to the destination in reverse order 294 * Iterate through all visual runs and copy the run text segments to 327 markFlag = bidi.runs[run].insertRemove;
|
/openjdk9/jdk/test/java/util/logging/ |
H A D | LoggingDeadlock.java | 62 int runs = (int) Math.random() * 1000000; 65 for (int i = 0; i < runs; ++i) {
|
H A D | DrainFindDeadlockTest.java | 69 int runs = (int) Math.random() * 1000000; 72 for (int i=0; i<runs; ++i) {
|
/openjdk9/jdk/test/java/util/Arrays/ |
H A D | TimSortStackSize2.java | 120 private final List<Long> runs = new ArrayList<Long>(); field in class:TimSortStackSize2 139 * Adds a sequence x_1, ..., x_n of run lengths to <code>runs</code> such that:<br> 145 * @param X The sum of the sequence that should be added to runs. 153 // add x_1=MIN+1, x_2=MIN, x_3=X-newTotal to runs 156 // add x_1=MIN+1, x_2=MIN, x_3=MIN+2, x_4=X-newTotal to runs 159 // add x_1=MIN+1, x_2=MIN, x_3=MIN+2, x_4=2MIN+2, x_5=X-newTotal to runs 162 // add x_1=MIN+1, x_2=MIN, x_3=MIN+2, x_4=2MIN+2, x_5=3MIN+4, x_6=X-newTotal to runs 165 runs.add(0, X - newTotal); 167 runs.add(0, X); 171 * Fills <code>runs</cod [all...] |
/openjdk9/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.core.test/src/org/graalvm/compiler/core/test/debug/ |
H A D | MethodMetricsTestInterception02.java | 74 int runs = 0; 85 runs++; 108 return runs;
|
/openjdk9/hotspot/test/compiler/membars/ |
H A D | DekkerTest.java | 156 final int runs = 30; 158 for (int c = 0; c < runs; ++c) {
|
/openjdk9/nashorn/test/script/basic/ |
H A D | runsunspider.js | 25 * runsunspider : runs the sunspider tests and checks for compliance 48 var runs = 0; variable 62 runs++; 144 pprint("Doing hot runs."); 688 pprint('\n' + runs + "/" + tests.length + " tests were successfully run in " + total_time + " ms ");
|
/openjdk9/jdk/src/demo/share/java2d/J2DBench/src/j2dbench/tests/text/ |
H A D | TextTests.java | 358 // (tl, as) num style runs 496 int[] runs = { 1, 2, 4, 8 }; 498 runs, 499 intStringList(runs), 500 intStringList(runs, " runs"),
|
/openjdk9/jdk/test/sun/security/krb5/auto/ |
H A D | ReplayCacheTestProc.java | 50 * This test runs multiple acceptor Procs to mimic AP-REQ replays. 58 * - test.runs on manual runs. If empty, a iterate through all pattern 66 * - test.autoruns on number of automatic runs 169 // Manual runs 170 String userRuns = System.getProperty("test.runs"); 209 String[] runs = userRuns.split(","); 210 result = new Ex[runs.length]; 211 for (int i = 0; i < runs.length; i++) { 212 UserRun run = new UserRun(runs[ [all...] |
/openjdk9/jdk/test/java/util/Collection/ |
H A D | RemoveMicroBenchmark.java | 66 * Be patient; this program runs for a very long time. 67 * For faster runs, restrict execution using command line args. 132 int runs = 0; 134 do { job.work(); runs++; } 136 nanoss[i] = totalTime/runs;
|
H A D | IteratorMicroBenchmark.java | 65 * Be patient; this program runs for a very long time. 66 * For faster runs, restrict execution using command line args. 133 int runs = 0; 135 do { job.work(); runs++; } 137 nanoss[i] = totalTime/runs;
|
/openjdk9/jdk/test/java/util/ArrayList/ |
H A D | IteratorMicroBenchmark.java | 50 * Be patient; this program runs for a very long time. 51 * For faster runs, restrict execution using command line args. 99 int runs = 0; 101 do { job.work(); runs++; } 103 nanoss[i] = totalTime/runs;
|
/openjdk9/jdk/test/java/util/regex/ |
H A D | RegExTest.java | 3381 for (int runs = 0; runs<1000; runs++) { 3467 for (int runs = 0; runs<1000; runs++) {
|