mirror of
https://gitlab.uni-marburg.de/langbeid/powersort.git
synced 2025-01-21 19:50:35 +01:00
changing 1 to 0
This commit is contained in:
parent
1ab2bdc2a0
commit
37ea4b6625
@ -23,7 +23,7 @@ public class JmhCgl extends JmhBase {
|
|||||||
|
|
||||||
// Either all or a selection of sort implementations.
|
// Either all or a selection of sort implementations.
|
||||||
//@Param()
|
//@Param()
|
||||||
@Param({"TIM_SORT", "FASTER_FINN_SORT", "IMPL_M_11"})
|
@Param({"TIM_SORT", "FASTER_FINN_SORT", "IMPL_M_11", "IMPL_M_21"})
|
||||||
SortEnum sortEnum;
|
SortEnum sortEnum;
|
||||||
|
|
||||||
@Override
|
@Override
|
||||||
|
@ -12,8 +12,8 @@ public enum SortEnum {
|
|||||||
FASTER_FINN_SORT,
|
FASTER_FINN_SORT,
|
||||||
ASORT,
|
ASORT,
|
||||||
FINN_SORT,
|
FINN_SORT,
|
||||||
IMPL_M_11,
|
IMPL_M_10,
|
||||||
IMPL_M_21,
|
IMPL_M_20,
|
||||||
DPQS,
|
DPQS,
|
||||||
QUICK_SORT,
|
QUICK_SORT,
|
||||||
MERGE_SORT,
|
MERGE_SORT,
|
||||||
@ -27,8 +27,8 @@ public enum SortEnum {
|
|||||||
case MERGE_SORT -> array -> MergeSort.legacyMergeSort(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 TIM_SORT -> array -> TimSort.sort(array, 0, array.length, NaturalOrder.INSTANCE, null, 0, 0);
|
||||||
case FINN_SORT -> array -> FinnSort.sort(array, NaturalOrder.INSTANCE);
|
case FINN_SORT -> array -> FinnSort.sort(array, NaturalOrder.INSTANCE);
|
||||||
case IMPL_M_11 -> array -> IMPL_M_1.powerSort(array,NaturalOrder.INSTANCE);
|
case IMPL_M_10 -> array -> IMPL_M_1.powerSort(array,NaturalOrder.INSTANCE);
|
||||||
case IMPL_M_21 -> array -> IMPL_M_2.sort(array, 0, array.length, NaturalOrder.INSTANCE, null, 0, 0);
|
case IMPL_M_20 -> array -> IMPL_M_2.sort(array, 0, array.length, NaturalOrder.INSTANCE, null, 0, 0);
|
||||||
case FASTER_FINN_SORT -> array -> FasterFinnSort.sort(array, 0, array.length, NaturalOrder.INSTANCE, null, 0, 0);
|
case FASTER_FINN_SORT -> array -> FasterFinnSort.sort(array, 0, array.length, NaturalOrder.INSTANCE, null, 0, 0);
|
||||||
case ASORT -> array -> ASort.sort(array, NaturalOrder.INSTANCE);
|
case ASORT -> array -> ASort.sort(array, NaturalOrder.INSTANCE);
|
||||||
};
|
};
|
||||||
|
@ -2,6 +2,6 @@ package de.uni_marburg.powersort.sort;
|
|||||||
|
|
||||||
public class IMPL_M_1Test extends AbstractSortTest {
|
public class IMPL_M_1Test extends AbstractSortTest {
|
||||||
IMPL_M_1Test() {
|
IMPL_M_1Test() {
|
||||||
sortAlg = SortEnum.IMPL_M_11;
|
sortAlg = SortEnum.IMPL_M_10;
|
||||||
}
|
}
|
||||||
}
|
}
|
Loading…
x
Reference in New Issue
Block a user