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: more input lists

Browse Source
This commit is contained in:
Daniel Langbein 2024-12-16 21:06:11 +00:00
parent 3fbee13d07
commit 8379570f9a
Signed by: langfingaz
GPG Key ID: 6C47C753F0823002
6 changed files with 20 additions and 25 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
app/src/main/java/de/uni_marburg/powersort/data/AscendingIntegers.java
View File

@ -3,11 +3,9 @@ package de.uni_marburg.powersort.data;
import de.uni_marburg.powersort.benchmark.IntegerArray;
import de.uni_marburg.powersort.benchmark.LongFormatter;
import static de.uni_marburg.powersort.data.DataArraySizes.SIZE_ASC;
public class AscendingIntegers extends IntegerSupplier {
public AscendingIntegers() {
super(IntegerArray.ascending( 1, SIZE_ASC));
public AscendingIntegers(int size) {
super(IntegerArray.ascending( 1, size));
}
@Override

7
app/src/main/java/de/uni_marburg/powersort/data/DataArraySizes.java
View File

@ -1,7 +0,0 @@
package de.uni_marburg.powersort.data;
public interface DataArraySizes {
int SIZE_RAND = 50_000_000;
int SIZE_ASC = 50_000_000;
int SIZE_DESC = 50_000_000;
}

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

@ -4,18 +4,23 @@ public enum DataEnum {
RANDOM_INTEGERS,
ASCENDING_INTEGERS,
DESCENDING_INTEGERS,
ASCENDING_RUNS;
ASCENDING_RUNS,
ASCENDING_RUNS_WITH_OVERLAP;
public ObjectSupplier get() {
// We use a seed to get the same random list every time -> Repeatable benchmarks on same input data!
// final long seed = 3651660232967549736L; // System.nanoTime() ++ Math.random()
final long seed = 140506881906827520L; // (long) 'P' * (long) 'O' *(long) 'W' * (long) 'E' * (long) 'R' * (long) 'S' * (long) 'O' * (long) 'R' * (long) 'T';
int longListSize = 50_000_000;
return switch (this) {
case RANDOM_INTEGERS -> new RandomIntegers(seed);
case ASCENDING_INTEGERS -> new AscendingIntegers();
case DESCENDING_INTEGERS -> new DescendingIntegers();
case ASCENDING_RUNS -> AscendingRuns.newAscendingRuns(10000, 10000, -10000);
case RANDOM_INTEGERS -> new RandomIntegers(longListSize, seed);
case ASCENDING_INTEGERS -> new AscendingIntegers(longListSize);
case DESCENDING_INTEGERS -> new DescendingIntegers(longListSize);
case ASCENDING_RUNS -> AscendingRuns.newAscendingRuns(10_000, 10_000, -10_000);
case ASCENDING_RUNS_WITH_OVERLAP -> AscendingRuns.newAscendingRuns(10_000, 10_000, -5_000);
};
}
}

6
app/src/main/java/de/uni_marburg/powersort/data/DescendingIntegers.java
View File

@ -3,11 +3,9 @@ package de.uni_marburg.powersort.data;
import de.uni_marburg.powersort.benchmark.IntegerArray;
import de.uni_marburg.powersort.benchmark.LongFormatter;
import static de.uni_marburg.powersort.data.DataArraySizes.SIZE_DESC;
public class DescendingIntegers extends IntegerSupplier {
public DescendingIntegers() {
super(IntegerArray.descending(SIZE_DESC, 1));
public DescendingIntegers(int size) {
super(IntegerArray.descending(size, 1));
}
@Override

6
app/src/main/java/de/uni_marburg/powersort/data/RandomIntegers.java
View File

@ -3,11 +3,9 @@ package de.uni_marburg.powersort.data;
import de.uni_marburg.powersort.benchmark.IntegerArray;
import de.uni_marburg.powersort.benchmark.LongFormatter;
import static de.uni_marburg.powersort.data.DataArraySizes.SIZE_RAND;
public class RandomIntegers extends IntegerSupplier {
public RandomIntegers(final long seed) {
super(IntegerArray.random(SIZE_RAND, seed));
public RandomIntegers(final int size, final long seed) {
super(IntegerArray.random(size, seed));
}
@Override

5
app/src/main/java/de/uni_marburg/powersort/sort/SortEnum.java
View File

@ -1,17 +1,20 @@
package de.uni_marburg.powersort.sort;
import de.uni_marburg.powersort.FinnSort.FinnSort;
import de.uni_marburg.powersort.benchmark.NaturalOrder;
public enum SortEnum {
// BUBBLE_SORT,
MERGE_SORT,
TIM_SORT;
TIM_SORT,
FIN_SORT;
public SimpleSort get() {
return switch (this) {
// case BUBBLE_SORT -> array -> BubbleSort.sort(array, NaturalOrder.INSTANCE);
case MERGE_SORT -> array -> MergeSort.legacyMergeSort(array, NaturalOrder.INSTANCE);
case TIM_SORT -> array -> TimSort.sort(array, 0, array.length, NaturalOrder.INSTANCE, null, 0, 0);
case FIN_SORT -> array -> FinnSort.sort(array, NaturalOrder.INSTANCE);
};
}
}