CODEWITHSUNDEEP
c++qtsortingqtcoreqlist
user3545931
user3545931

Reputation: 61

How to use qSort with custom types in QList?

I have a problem with sorting a QList containing instances of a struct:

class modelHeuristic
{

    typedef struct {

         QString c;
         QString t;
         double value;
     }Saving;

public:

QList<Saving> list_saving;

#include "klarkeright.h"

klarkeRight::klarkeRight()
{


}
void klarkeRight::Algoritmo_Asimetrico(modelHeuristic *model)
{

    qSort(model->list_saving.begin(), model->list_saving.end());

}

error: invalid operands to binary expression ('const modelHeuristic::Saving' and 'const modelHeuristic::Saving') return (t1 < t2);

Upvotes: 3

Views: 12105

Answers (2)

L&#225;szl&#243; Papp
L&#225;szl&#243; Papp

Reputation: 53173

First of all, QtAlgorithms is mostly deprecated and you should not use it. Please use std::sort instead as recommended by the Qt documentation.

Otherwise, you will need to implement the actual comparison functionality as you seem to be working with custom types. Naturally, the generic algorithm cannot know how to compare to custom items like that. That is what the error is trying to indicate.

Then, you will either need to pass that function to the sorting algorithm as the third argument, or name it operator<. I prefer being explicit, especially since then you can restrict your comparison to the class where it is tied to anyway.

Therefore, I would write something like this:

main.cpp

#include <QtAlgorithms>
#include <QString>
#include <QList>

class modelHeuristic
{
    typedef struct {
        QString c;
        QString t;
        double value;
    } Saving;
    public:    
        static bool savingComparison(const Saving &s1, const Saving &s2)
        {
            return s1.value < s2.value; // This is just an example
        }

        QList<Saving> list_saving;
};

int main()
{
    modelHeuristic *model = new modelHeuristic();
    // This is not doing anything useful with an empty list
    // that is constructed, but it shows how to get the theory right!
    // Also, you really wish to use std::sort here instead.
    qSort(model->list_saving.begin(), model->list_saving.end(), modelHeuristic::savingComparison);
    return 0;
}

main.pro

TEMPLATE = app
TARGET = main
QT = core
SOURCES += main.cpp

Build and Run

qmake && make && ./main

Please refer to the documentation for details.

Upvotes: 6

king_nak
king_nak

Reputation: 11513

To perform sorting you generally need some ordering of the elements to be sorted. You cannot sort a list if you don't have a mechanism that tells what element comes before another element.

qSort (and most other sorting algorithms) use the operator < to compare elements. You do not specify such a operator.

How should the compiler (or anyone) know if one Saving should be placed before another Saving object?

is Saving {"Test", "foo", 1.2} before Saving {"bar", "baz", 1000000}?

Implement the operator < acording to your sortin rules:

typedef struct {

     QString c;
     QString t;
     double value;
 } Saving;

 bool operator < (const Saving &s1, const Saving &s2) {
     /*Your comparsion code */ 
 }

This is what you compiler is telling you:

error: invalid operands to binary expression ('const modelHeuristic::Saving' and 'const modelHeuristic::Saving') return (t1 < t2);

It cannot compare two Savings using <

Upvotes: 3

Related Questions