Searched refs:runLen (Results 1 - 6 of 6) sorted by relevance
| /openjdk7/jdk/src/share/classes/sun/java2d/pisces/ |
| H A D | PiscesCache.java | 81 void addRLERun(int val, int runLen) { argument
82 if (runLen > 0) {
83 addTupleToRow(y0, val, runLen);
88 int tx1 = (x0 + runLen - 1) >> TILE_SIZE_LG;
98 if (nextTileXCoord > x0+runLen) {
99 touchedTile[ty][tx] += val * runLen;
120 int lastXCoord = Math.min(x0 + runLen, (tx + 1) << TILE_SIZE_LG);
125 x0 += runLen;
|
| H A D | PiscesTileGenerator.java | 153 // and is encoded as a set of 2-byte pairs (val, runLen)
179 int runLen = 0;
183 runLen = row[pos + 1];
184 assert runLen > 0;
191 System.out.println("len = "+runLen);
198 cx += runLen;
202 runLen = rx1 - rx0;
203 //System.out.println("M["+runLen+"]");
204 while (--runLen >= 0) {
214 System.out.println("len = "+runLen);
[all...] |
| H A D | Renderer.java | 554 int runLen = 1;
559 runLen++;
561 cache.addRLERun(startVal, runLen);
562 runLen = 1;
566 cache.addRLERun(startVal, runLen);
|
| /openjdk7/jdk/src/share/classes/java/util/ |
| H A D | ComparableTimSort.java | 98 * runBase[i] + runLen[i] == runBase[i + 1]
105 private final int[] runLen; field in class:ComparableTimSort
136 runLen = new int[stackLen];
171 int runLen = countRunAndMakeAscending(a, lo, hi);
174 if (runLen < minRun) {
176 binarySort(a, lo, lo + force, lo + runLen);
177 runLen = force;
181 ts.pushRun(lo, runLen);
185 lo += runLen;
186 nRemaining -= runLen;
351 pushRun(int runBase, int runLen) argument
[all...] |
| H A D | TimSort.java | 123 * runBase[i] + runLen[i] == runBase[i + 1]
130 private final int[] runLen; field in class:TimSort
163 runLen = new int[stackLen];
203 int runLen = countRunAndMakeAscending(a, lo, hi, c);
206 if (runLen < minRun) {
208 binarySort(a, lo, lo + force, lo + runLen, c);
209 runLen = force;
213 ts.pushRun(lo, runLen);
217 lo += runLen;
218 nRemaining -= runLen;
385 pushRun(int runBase, int runLen) argument
[all...] |
| /openjdk7/jdk/src/share/classes/sun/print/ |
| H A D | PSPrinterJob.java | 1939 int runLen = 0;
1942 if (runLen == 0) {
1944 runLen=1;
1947 while (runLen < 128 && inIndex < inArr.length &&
1949 runLen++; // count run of same value
1953 if (runLen > 1) {
1954 outArr[outIndex++] = (byte)(257 - runLen);
1956 runLen = 0;
1961 while (runLen < 128 && inIndex < inArr.length &&
1963 runLen
[all...] |
Completed in 399 milliseconds