thanks all, mine.
On Mon, Nov 10, 2014 at 5:34 AM, Alejandro Exojo wrote:
> El Monday 10 November 2014, Robert Steckroth escribió:
> > [SOLVED]: After perusing the qmap.h libraiy I found the reason why QMap
> was
> > keeping a sorted node list.
>
> Please, instea
[SOLVED]: After perusing the qmap.h libraiy I found the reason why QMap was
keeping a sorted node list.
There is a few of these calls to qMapLessThanKey which is doing
variant comparison.
template inline bool qMapLessThanKey(const Key &key1,
const Key &key2) {
return key1 < key2;
}
Any wa
Consider the following program, shouldn't the end() iterator place each key
at the end of the newly created QMap. Instead, the keys and subsequent
iterations are sorted (somehow).
#include
#include
#include
#include
int main(int argc, char *argv[])
{
QCoreApplication a(argc, argv);
