sort

[av2306]

HI,

I have data(int, string). for ex: {(23,"z"),(23,"c"),(100,"ex"),(1,"zz"),(2,"345")}

I want to sort combination of two keys.

output: {(1,"zz"),(2,"345"),(23,"c"),(23,"z"),(100,"ex")}

What is the right data structure to store two values and sort on two keys?

Thanks.

[anda_skoa]

Easiest way is to put the values in to instances of a class or struct and have that class implement a "less than" operator

struct Data
{
   int i;
   QString s;
 
    bool operator<(const Data& other) const
    {
        // return true if "this" is less than "other", otherwise return false;
    }
};

struct Data
{
   int i;
   QString s;

    bool operator<(const Data& other) const
    {
        // return true if "this" is less than "other", otherwise return false;
    }
};

To copy to clipboard, switch view to plain text mode 

The put into a QList or QVector and use qSort()

Cheers,
_

[d_stranz]

Or try the completely heretical concept using the C++ standard library std:: pair< int, QString > instead of defining a new class. std:: pair<> already has the comparison operators defined by default (and will sort the pairs exactly the way you asked).

[ChrisW67]

Or (if heresy is not your thing you could use QPair the same way.

[av2306]

Thank you all. Let me try. :-)