Mirror/powersort
1
0
Fork 0
mirror of https://gitlab.uni-marburg.de/langbeid/powersort.git synced 2025-01-21 19:50:35 +01:00
Code Issues Actions Packages Projects Releases Wiki Activity

benchmark: add input "many ascending runs"

Browse Source
This commit is contained in:
Daniel Langbein 2025-01-14 20:42:13 +00:00
parent 4198e28c79
commit e39a8082e3
Signed by: langfingaz
GPG Key ID: 6C47C753F0823002
2 changed files with 13 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
app/src/jmh/java/de/uni_marburg/powersort/benchmark/JmhCgl.java
View File

@ -18,7 +18,7 @@ import org.openjdk.jmh.annotations.State;
public class JmhCgl extends JmhBase {
// Either all or a selection of input lists.
@Param()
//@Param({"ASCENDING_RUNS", "ASCENDING_RUNS_WITH_OVERLAP"})
//@Param({"ASCENDING_RUNS", "ASCENDING_RUNS_WITH_OVERLAP", "MANY_ASCENDING_RUNS", "MANY_ASCENDING_RUNS_WITH_OVERLAP"})
CglEnum dataEnum;
// Either all or a selection of sort implementations.

15
app/src/main/java/de/uni_marburg/powersort/data/CglEnum.java
View File

@ -8,7 +8,9 @@ public enum CglEnum implements DataEnum {
ASCENDING_INTEGERS,
DESCENDING_INTEGERS,
ASCENDING_RUNS,
ASCENDING_RUNS_WITH_OVERLAP;
ASCENDING_RUNS_WITH_OVERLAP,
MANY_ASCENDING_RUNS,
MANY_ASCENDING_RUNS_WITH_OVERLAP;
@Override
public ObjectSupplier getObjectSupplier() {
@ -17,13 +19,17 @@ public enum CglEnum implements DataEnum {
final long seed = 140506881906827520L; // (long) 'P' * (long) 'O' *(long) 'W' * (long) 'E' * (long) 'R' * (long) 'S' * (long) 'O' * (long) 'R' * (long) 'T';
int listSize = 66_000_000;
int runs = 3010;
int runLength = 3010;
int runs = 3_010;
int runLength = 3_010;
int manyRuns = 30_000;
int shortRunLength = 50;
// Constant factors
double a = 0.96;
double b = 0.25;
double c = 0.81;
double d = 1.0;
return switch (this) {
case RANDOM_INTEGERS -> new RandomIntegers(listSize, seed);
@ -32,6 +38,9 @@ public enum CglEnum implements DataEnum {
case ASCENDING_RUNS -> AscendingRuns.newAscendingRuns(runs, runLength, -1 * runLength);
case ASCENDING_RUNS_WITH_OVERLAP ->
AscendingRuns.newAscendingRuns((int) (c * runs), (int) (c * runLength), (int) (-0.5 * c * runLength));
case MANY_ASCENDING_RUNS -> AscendingRuns.newAscendingRuns(manyRuns, shortRunLength, -1 * shortRunLength);
case MANY_ASCENDING_RUNS_WITH_OVERLAP ->
AscendingRuns.newAscendingRuns((int) (d * manyRuns), (int) (d * shortRunLength), (int) (-0.5 * d * shortRunLength));
};
}
}