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 if the sum of all items at the top is less than the sum of all items at the bottom or at the bottom otherwise. More...
#include <weightedgraphsorter.h>
Public Member Functions | |
WeightedGraphSorter (QObject *parent) | |
QString | GetName () |
Returns a user-presentable name for the object. | |
![]() | |
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 | |
![]() | |
enum | SortingAttribute { OnsetTimeASC = 0, OnsetTimeDESC, VolatilityASC, VolatilityDESC, SIZE_OF_ENUM } |
List of attributes used to sort the dataset. | |
![]() | |
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 if the sum of all items at the top is less than the sum of all items at the bottom or at the bottom otherwise.