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: update filter

Browse Source
This commit is contained in:
Daniel Langbein 2024-12-30 16:37:45 +00:00
parent 48a2db7bee
commit 798ed8502c
Signed by: langfingaz
GPG Key ID: 6C47C753F0823002
1 changed files with 14 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
app/src/main/java/de/uni_marburg/powersort/benchmark/Filter.java
View File

@ -11,13 +11,24 @@ public class Filter {
} }
public static boolean isFiltered(DataEnum d, SortEnum s) { public static boolean isFiltered(DataEnum d, SortEnum s) {
// To skip some of the inputs for all inputs, uncomment it here.
// if (List.of(
// DataEnum.RANDOM_INTEGERS_300M,
// DataEnum.ASCENDING_INTEGERS_300M,
// DataEnum.DESCENDING_INTEGERS_250M,
// DataEnum.ASCENDING_RUNS_1M,
// DataEnum.ASCENDING_RUNS_WITH_OVERLAP_1M
// ).contains(d)) {
// return true;
// }
if (s == SortEnum.QUICK_SORT) { if (s == SortEnum.QUICK_SORT) {
return List.of( return List.of(
DataEnum.RANDOM_INTEGERS_300M, DataEnum.RANDOM_INTEGERS_300M,
DataEnum.ASCENDING_INTEGERS_300M, DataEnum.ASCENDING_INTEGERS_300M,
DataEnum.DESCENDING_INTEGERS_250M, DataEnum.DESCENDING_INTEGERS_250M,
DataEnum.ASCENDING_RUNS_1M DataEnum.ASCENDING_RUNS_1M,
DataEnum.ASCENDING_RUNS_WITH_OVERLAP_1M
).contains(d); ).contains(d);
} }
@ -40,7 +51,8 @@ public class Filter {
// TODO: Remove this once performance of FinnSort improved // TODO: Remove this once performance of FinnSort improved
if (s == SortEnum.FINN_SORT) { if (s == SortEnum.FINN_SORT) {
return List.of( return List.of(
DataEnum.DESCENDING_INTEGERS_250M DataEnum.DESCENDING_INTEGERS_250M,
DataEnum.ASCENDING_RUNS_1M
).contains(d); ).contains(d);
} }