/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/java.base/share/classes/java/util/ |
H A D | ComparableTimSort.java | 110 private final int[] runLen; field in ComparableTimSort 208 runLen = force; in sort() 216 lo += runLen; in sort() 383 this.runLen[stackSize] = runLen; 406 if (n > 0 && runLen[n-1] <= runLen[n] + runLen[n+1] || 407 n > 1 && runLen[n-2] <= runLen[n] + runLen[n-1]) { 408 if (runLen[n - 1] < runLen[n + 1]) 410 } else if (n < 0 || runLen[n] > runLen[n + 1]) { 424 if (n > 0 && runLen[n - 1] < runLen[n + 1]) in mergeForceCollapse() 444 int len1 = runLen[i]; in mergeAt() [all …]
|
H A D | TimSort.java | 135 private final int[] runLen; field in TimSort 240 runLen = force; in sort() 248 lo += runLen; in sort() 418 this.runLen[stackSize] = runLen; 441 if (n > 0 && runLen[n-1] <= runLen[n] + runLen[n+1] || 442 n > 1 && runLen[n-2] <= runLen[n] + runLen[n-1]) { 443 if (runLen[n - 1] < runLen[n + 1]) 445 } else if (n < 0 || runLen[n] > runLen[n + 1]) { 459 if (n > 0 && runLen[n - 1] < runLen[n + 1]) in mergeForceCollapse() 478 int len1 = runLen[i]; in mergeAt() [all …]
|
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/java.base/share/classes/java/util/ |
H A D | ComparableTimSort.java | 110 private final int[] runLen; field in ComparableTimSort 208 runLen = force; in sort() 216 lo += runLen; in sort() 383 this.runLen[stackSize] = runLen; 406 if (n > 0 && runLen[n-1] <= runLen[n] + runLen[n+1] || 407 n > 1 && runLen[n-2] <= runLen[n] + runLen[n-1]) { 408 if (runLen[n - 1] < runLen[n + 1]) 410 } else if (n < 0 || runLen[n] > runLen[n + 1]) { 424 if (n > 0 && runLen[n - 1] < runLen[n + 1]) in mergeForceCollapse() 444 int len1 = runLen[i]; in mergeAt() [all …]
|
H A D | TimSort.java | 135 private final int[] runLen; field in TimSort 240 runLen = force; in sort() 248 lo += runLen; in sort() 418 this.runLen[stackSize] = runLen; 441 if (n > 0 && runLen[n-1] <= runLen[n] + runLen[n+1] || 442 n > 1 && runLen[n-2] <= runLen[n] + runLen[n-1]) { 443 if (runLen[n - 1] < runLen[n + 1]) 445 } else if (n < 0 || runLen[n] > runLen[n + 1]) { 459 if (n > 0 && runLen[n - 1] < runLen[n + 1]) in mergeForceCollapse() 478 int len1 = runLen[i]; in mergeAt() [all …]
|
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/java.base/share/classes/java/util/ |
H A D | ComparableTimSort.java | 110 private final int[] runLen; field in ComparableTimSort 208 runLen = force; in sort() 216 lo += runLen; in sort() 383 this.runLen[stackSize] = runLen; 406 if (n > 0 && runLen[n-1] <= runLen[n] + runLen[n+1] || 407 n > 1 && runLen[n-2] <= runLen[n] + runLen[n-1]) { 408 if (runLen[n - 1] < runLen[n + 1]) 410 } else if (n < 0 || runLen[n] > runLen[n + 1]) { 424 if (n > 0 && runLen[n - 1] < runLen[n + 1]) in mergeForceCollapse() 444 int len1 = runLen[i]; in mergeAt() [all …]
|
H A D | TimSort.java | 135 private final int[] runLen; field in TimSort 240 runLen = force; in sort() 248 lo += runLen; in sort() 418 this.runLen[stackSize] = runLen; 441 if (n > 0 && runLen[n-1] <= runLen[n] + runLen[n+1] || 442 n > 1 && runLen[n-2] <= runLen[n] + runLen[n-1]) { 443 if (runLen[n - 1] < runLen[n + 1]) 445 } else if (n < 0 || runLen[n] > runLen[n + 1]) { 459 if (n > 0 && runLen[n - 1] < runLen[n + 1]) in mergeForceCollapse() 478 int len1 = runLen[i]; in mergeAt() [all …]
|
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/java.base/share/classes/java/util/ |
H A D | ComparableTimSort.java | 110 private final int[] runLen; field in ComparableTimSort 208 runLen = force; in sort() 216 lo += runLen; in sort() 383 this.runLen[stackSize] = runLen; 406 if (n > 0 && runLen[n-1] <= runLen[n] + runLen[n+1] || 407 n > 1 && runLen[n-2] <= runLen[n] + runLen[n-1]) { 408 if (runLen[n - 1] < runLen[n + 1]) 410 } else if (n < 0 || runLen[n] > runLen[n + 1]) { 424 if (n > 0 && runLen[n - 1] < runLen[n + 1]) in mergeForceCollapse() 444 int len1 = runLen[i]; in mergeAt() [all …]
|
H A D | TimSort.java | 135 private final int[] runLen; field in TimSort 240 runLen = force; in sort() 248 lo += runLen; in sort() 418 this.runLen[stackSize] = runLen; 441 if (n > 0 && runLen[n-1] <= runLen[n] + runLen[n+1] || 442 n > 1 && runLen[n-2] <= runLen[n] + runLen[n-1]) { 443 if (runLen[n - 1] < runLen[n + 1]) 445 } else if (n < 0 || runLen[n] > runLen[n + 1]) { 459 if (n > 0 && runLen[n - 1] < runLen[n + 1]) in mergeForceCollapse() 478 int len1 = runLen[i]; in mergeAt() [all …]
|
/dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/java.base/share/classes/java/util/ |
H A D | ComparableTimSort.java | 110 private final int[] runLen; field in ComparableTimSort 208 runLen = force; in sort() 216 lo += runLen; in sort() 383 this.runLen[stackSize] = runLen; 406 if (n > 0 && runLen[n-1] <= runLen[n] + runLen[n+1] || 407 n > 1 && runLen[n-2] <= runLen[n] + runLen[n-1]) { 408 if (runLen[n - 1] < runLen[n + 1]) 410 } else if (n < 0 || runLen[n] > runLen[n + 1]) { 424 if (n > 0 && runLen[n - 1] < runLen[n + 1]) in mergeForceCollapse() 444 int len1 = runLen[i]; in mergeAt() [all …]
|
H A D | TimSort.java | 135 private final int[] runLen; field in TimSort 240 runLen = force; in sort() 248 lo += runLen; in sort() 418 this.runLen[stackSize] = runLen; 441 if (n > 0 && runLen[n-1] <= runLen[n] + runLen[n+1] || 442 n > 1 && runLen[n-2] <= runLen[n] + runLen[n-1]) { 443 if (runLen[n - 1] < runLen[n + 1]) 445 } else if (n < 0 || runLen[n] > runLen[n + 1]) { 459 if (n > 0 && runLen[n - 1] < runLen[n + 1]) in mergeForceCollapse() 478 int len1 = runLen[i]; in mergeAt() [all …]
|
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/java.base/share/classes/java/util/ |
H A D | ComparableTimSort.java | 110 private final int[] runLen; field in ComparableTimSort 208 runLen = force; in sort() 216 lo += runLen; in sort() 383 this.runLen[stackSize] = runLen; 406 if (n > 0 && runLen[n-1] <= runLen[n] + runLen[n+1] || 407 n > 1 && runLen[n-2] <= runLen[n] + runLen[n-1]) { 408 if (runLen[n - 1] < runLen[n + 1]) 410 } else if (n < 0 || runLen[n] > runLen[n + 1]) { 424 if (n > 0 && runLen[n - 1] < runLen[n + 1]) in mergeForceCollapse() 444 int len1 = runLen[i]; in mergeAt() [all …]
|
H A D | TimSort.java | 135 private final int[] runLen; field in TimSort 240 runLen = force; in sort() 248 lo += runLen; in sort() 418 this.runLen[stackSize] = runLen; 441 if (n > 0 && runLen[n-1] <= runLen[n] + runLen[n+1] || 442 n > 1 && runLen[n-2] <= runLen[n] + runLen[n-1]) { 443 if (runLen[n - 1] < runLen[n + 1]) 445 } else if (n < 0 || runLen[n] > runLen[n + 1]) { 459 if (n > 0 && runLen[n - 1] < runLen[n + 1]) in mergeForceCollapse() 478 int len1 = runLen[i]; in mergeAt() [all …]
|
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/java.base/share/classes/java/util/ |
H A D | ComparableTimSort.java | 110 private final int[] runLen; field in ComparableTimSort 208 runLen = force; in sort() 216 lo += runLen; in sort() 383 this.runLen[stackSize] = runLen; 406 if (n > 0 && runLen[n-1] <= runLen[n] + runLen[n+1] || 407 n > 1 && runLen[n-2] <= runLen[n] + runLen[n-1]) { 408 if (runLen[n - 1] < runLen[n + 1]) 410 } else if (n < 0 || runLen[n] > runLen[n + 1]) { 424 if (n > 0 && runLen[n - 1] < runLen[n + 1]) in mergeForceCollapse() 444 int len1 = runLen[i]; in mergeAt() [all …]
|
H A D | TimSort.java | 135 private final int[] runLen; field in TimSort 240 runLen = force; in sort() 248 lo += runLen; in sort() 418 this.runLen[stackSize] = runLen; 441 if (n > 0 && runLen[n-1] <= runLen[n] + runLen[n+1] || 442 n > 1 && runLen[n-2] <= runLen[n] + runLen[n-1]) { 443 if (runLen[n - 1] < runLen[n + 1]) 445 } else if (n < 0 || runLen[n] > runLen[n + 1]) { 459 if (n > 0 && runLen[n - 1] < runLen[n + 1]) in mergeForceCollapse() 478 int len1 = runLen[i]; in mergeAt() [all …]
|
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/java.base/share/classes/java/util/ |
H A D | ComparableTimSort.java | 110 private final int[] runLen; field in ComparableTimSort 208 runLen = force; in sort() 216 lo += runLen; in sort() 383 this.runLen[stackSize] = runLen; 406 if (n > 0 && runLen[n-1] <= runLen[n] + runLen[n+1] || 407 n > 1 && runLen[n-2] <= runLen[n] + runLen[n-1]) { 408 if (runLen[n - 1] < runLen[n + 1]) 410 } else if (n < 0 || runLen[n] > runLen[n + 1]) { 424 if (n > 0 && runLen[n - 1] < runLen[n + 1]) in mergeForceCollapse() 444 int len1 = runLen[i]; in mergeAt() [all …]
|
H A D | TimSort.java | 135 private final int[] runLen; field in TimSort 240 runLen = force; in sort() 248 lo += runLen; in sort() 418 this.runLen[stackSize] = runLen; 441 if (n > 0 && runLen[n-1] <= runLen[n] + runLen[n+1] || 442 n > 1 && runLen[n-2] <= runLen[n] + runLen[n-1]) { 443 if (runLen[n - 1] < runLen[n + 1]) 445 } else if (n < 0 || runLen[n] > runLen[n + 1]) { 459 if (n > 0 && runLen[n - 1] < runLen[n + 1]) in mergeForceCollapse() 478 int len1 = runLen[i]; in mergeAt() [all …]
|
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/skia/docs/examples/ |
H A D | Canvas_drawTextBlob.cpp | 19 for (auto runLen : runs) { 20 font.setSize(1 == runLen ? 20 : 50); 22 textBlobBuilder.allocRun(font, runLen, textPos.fX, textPos.fY); 23 memcpy(run.glyphs, &glyphs[glyphIndex], sizeof(glyphs[0]) * runLen); 24 paint.setTextSize(1 == runLen ? 20 : 50); 25 textPos.fX += paint.measureText(&glyphs[glyphIndex], sizeof(glyphs[0]) * runLen, nullptr); 26 glyphIndex += runLen;
|
H A D | TextBlob_bounds.cpp | 19 for (auto runLen : runs) { 20 font.setSize(1 == runLen ? 20 : 50); 21 paint.setTextSize(1 == runLen ? 20 : 50); 23 textBlobBuilder.allocRun(font, runLen, textPos.fX, textPos.fY); 24 memcpy(run.glyphs, &glyphs[glyphIndex], sizeof(glyphs[0]) * runLen); 25 textPos.fX += paint.measureText(&glyphs[glyphIndex], sizeof(glyphs[0]) * runLen, nullptr); 26 glyphIndex += runLen;
|
H A D | TextBlob_uniqueID.cpp | 22 for (auto runLen : runs) { 23 font.setSize(1 == runLen ? 20 : 50); 24 paint.setTextSize(1 == runLen ? 20 : 50); 26 textBlobBuilder.allocRun(font, runLen, textPos.fX, textPos.fY); 27 memcpy(run.glyphs, &glyphs[glyphIndex], sizeof(glyphs[0]) * runLen); 28 … textPos.fX += paint.measureText(&glyphs[glyphIndex], sizeof(glyphs[0]) * runLen, nullptr); 29 glyphIndex += runLen;
|
/dports/java/openjdk8/jdk8u-jdk8u312-b07.1/jdk/src/share/classes/java/util/ |
H A D | ComparableTimSort.java | 110 private final int[] runLen; field in ComparableTimSort 208 runLen = force; in sort() 216 lo += runLen; in sort() 217 nRemaining -= runLen; in sort() 383 this.runLen[stackSize] = runLen; 401 if (n > 0 && runLen[n-1] <= runLen[n] + runLen[n+1]) { 402 if (runLen[n - 1] < runLen[n + 1]) 405 } else if (runLen[n] <= runLen[n + 1]) { 420 if (n > 0 && runLen[n - 1] < runLen[n + 1]) in mergeForceCollapse() 440 int len1 = runLen[i]; in mergeAt() [all …]
|
H A D | TimSort.java | 135 private final int[] runLen; field in TimSort 240 runLen = force; in sort() 248 lo += runLen; in sort() 418 this.runLen[stackSize] = runLen; 436 if (n > 0 && runLen[n-1] <= runLen[n] + runLen[n+1]) { 437 if (runLen[n - 1] < runLen[n + 1]) 440 } else if (runLen[n] <= runLen[n + 1]) { 455 if (n > 0 && runLen[n - 1] < runLen[n + 1]) in mergeForceCollapse() 474 int len1 = runLen[i]; in mergeAt() 485 runLen[i] = len1 + len2; in mergeAt() [all …]
|
/dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/jdk/src/share/classes/java/util/ |
H A D | ComparableTimSort.java | 110 private final int[] runLen; field in ComparableTimSort 208 runLen = force; in sort() 216 lo += runLen; in sort() 217 nRemaining -= runLen; in sort() 383 this.runLen[stackSize] = runLen; 401 if (n > 0 && runLen[n-1] <= runLen[n] + runLen[n+1]) { 402 if (runLen[n - 1] < runLen[n + 1]) 405 } else if (runLen[n] <= runLen[n + 1]) { 420 if (n > 0 && runLen[n - 1] < runLen[n + 1]) in mergeForceCollapse() 440 int len1 = runLen[i]; in mergeAt() [all …]
|
H A D | TimSort.java | 135 private final int[] runLen; field in TimSort 240 runLen = force; in sort() 248 lo += runLen; in sort() 418 this.runLen[stackSize] = runLen; 436 if (n > 0 && runLen[n-1] <= runLen[n] + runLen[n+1]) { 437 if (runLen[n - 1] < runLen[n + 1]) 440 } else if (runLen[n] <= runLen[n + 1]) { 455 if (n > 0 && runLen[n - 1] < runLen[n + 1]) in mergeForceCollapse() 474 int len1 = runLen[i]; in mergeAt() 485 runLen[i] = len1 + len2; in mergeAt() [all …]
|
/dports/devel/spark/spark-2.1.1/core/src/main/java/org/apache/spark/util/collection/ |
H A D | TimSort.java | 145 if (runLen < minRun) { in sort() 148 runLen = force; in sort() 156 lo += runLen; in sort() 157 nRemaining -= runLen; in sort() 428 this.runLen[stackSize] = runLen; in pushRun() 446 if ( (n >= 1 && runLen[n-1] <= runLen[n] + runLen[n+1]) in mergeCollapse() 447 || (n >= 2 && runLen[n-2] <= runLen[n] + runLen[n-1])) { in mergeCollapse() 448 if (runLen[n - 1] < runLen[n + 1]) in mergeCollapse() 450 } else if (runLen[n] > runLen[n + 1]) { in mergeCollapse() 464 if (n > 0 && runLen[n - 1] < runLen[n + 1]) in mergeForceCollapse() [all …]
|
/dports/java/openjdk8/jdk8u-jdk8u312-b07.1/jdk/src/share/classes/sun/java2d/pisces/ |
H A D | PiscesCache.java | 81 void addRLERun(int val, int runLen) { in addRLERun() argument 82 if (runLen > 0) { in addRLERun() 83 addTupleToRow(y0, val, runLen); in addRLERun() 88 int tx1 = (x0 + runLen - 1) >> TILE_SIZE_LG; in addRLERun() 98 if (nextTileXCoord > x0+runLen) { in addRLERun() 99 touchedTile[ty][tx] += val * runLen; in addRLERun() 120 int lastXCoord = Math.min(x0 + runLen, (tx + 1) << TILE_SIZE_LG); in addRLERun() 125 x0 += runLen; in addRLERun()
|