Class describes a sorting algorithm which sorts the DataSet in order to put the first elements of the sorted list near the baseline and the last to the outside The dataitems are added to the top and bottom alternating. More...
#include <insideoutgraphsorter.h>
Public Member Functions | |
InsideOutGraphSorter (QObject *parent) | |
QString | GetName () |
Gets the name of the algorithm to display in the GUI. | |
Public Member Functions inherited from GraphSorter | |
GraphSorter (QObject *parent) | |
void | Sort (DataSet &data, const SortingAttribute attribute) |
Sorts the dataset in a preprocessing step according to its dataitems sorting attribute value. More... | |
Additional Inherited Members | |
Public Types inherited from GraphSorter | |
enum | SortingAttribute { OnsetTimeASC = 0, OnsetTimeDESC, VolatilityASC, VolatilityDESC, SIZE_OF_ENUM } |
List of attributes used to sort the dataset. | |
Static Public Attributes inherited from GraphSorter | |
static const char *const | sortingAttribute_str [SortingAttribute::SIZE_OF_ENUM] ={"OnsetTime asc", "OnsetTime desc", "Volatility asc", "Volatility desc"} |
String value of the sorting attributes used to display in the GUI. | |
Class describes a sorting algorithm which sorts the DataSet in order to put the first elements of the sorted list near the baseline and the last to the outside The dataitems are added to the top and bottom alternating.