Searched refs:step (Results 1 - 10 of 10) sorted by relevance

/libcore/luni/src/test/java/dalvik/system/
H A DVMRuntimeTest.java27 private void doTestNewNonMovableArray(Class<?> componentType, int step, int maxLength) { argument
42 for (int i = 0; i <= maxLength; i += step) {
66 int step = 67;
67 doTestNewNonMovableArray(boolean.class, step, maxLengthForLoop);
68 doTestNewNonMovableArray(byte.class, step, maxLengthForLoop);
69 doTestNewNonMovableArray(char.class, step, maxLengthForLoop);
70 doTestNewNonMovableArray(short.class, step, maxLengthForLoop);
71 doTestNewNonMovableArray(int.class, step, maxLengthForLoop);
72 doTestNewNonMovableArray(long.class, step, maxLengthForLoop);
73 doTestNewNonMovableArray(float.class, step, maxLengthForLoo
81 doTestNewUnpaddedArray(Class<?> componentType, int step, int maxLength) argument
[all...]
/libcore/luni/src/test/java/libcore/java/util/zip/
H A DOldAndroidGZIPStreamTest.java65 byte val, step;
69 step = 1;
74 val += step;
77 step += stepStep;
H A DOldAndroidDeflateTest.java69 * "step" determines how compressible the data is.
74 private void bigTest(int step, int expectedAdler) argument
82 createSample(input, step);
99 byte val, step;
105 step = 1;
110 val += step;
113 step += stepStep;
H A DOldAndroidZipStreamTest.java72 byte val, step;
76 step = 1;
81 val += step;
84 step += stepStep;
H A DOldAndroidZipFileTest.java59 byte val, step;
63 step = 1;
68 val += step;
71 step += stepStep;
/libcore/luni/src/test/java/tests/support/
H A DMockFunction.java42 public void step(FunctionContext fc, String args[]) { method in class:MockFunction
/libcore/ojluni/src/main/java/sun/security/provider/certpath/
H A DAdjacencyList.java38 * actual step in the chain building process, and the associated
68 * <code>POSSIBLE</code> denotes that the current step represents a
118 * Recursive, private method which actually builds the step list from
147 // entered as a possible step before we take any actions
167 // successful step? If there's only one entry without
168 // a throwable, then that's the successful step. Otherwise,
182 // which might be the succeed step...how do we know
250 for (Vertex step : l) {
251 sb.append(step.toString()).append("\n");
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/nio/
H A DByteBufferTest.java2112 int nbytes = 4, bigHead, step;
2115 step = 1;
2118 step = -1;
2125 p += step;
2131 int nbytes = 8, bigHead, step;
2134 step = 1;
2137 step = -1;
2144 p += step;
2150 int nbytes = 2, bigHead, step;
2153 step
[all...]
/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/regex/
H A DMatcherTest.java577 int step = 16; // Ideally 1, but devices are still too slow.
578 for (int i = 0; i < 0x110000; i += step) {
596 int step = 16; // Ideally 1, but devices are still too slow.
597 for (int i = 0; i < 0x110000; i += step) {
606 assertEquals(0x110000 / step, cnt);
/libcore/ojluni/src/main/java/java/util/concurrent/
H A DForkJoinPool.java449 * index and a step value. (The pseudorandom generator need not
1602 int probes = 0; // step by approx half n
1603 int step = (n <= 4) ? 2 : ((n >>> 1) & EVENMASK) + 2;
1604 while (ws[i = (i + step) & m] != null) {
1935 // high bits of prev seed for step; current low bits for idx
1936 int step = (int)(r >>> 48) | 1;
1938 if (scan(w, bound, step, (int)r) < 0 && awaitWork(w) < 0)
1957 * @param step (circular) index increment per iteration (must be odd)
1961 private int scan(WorkQueue w, int bound, int step, int r) { argument
1997 else if ((idx = (idx + step)
[all...]

Completed in 423 milliseconds