auto-sorted qtl container

[tuli]

I am using a std::set<int> to keep a list of sorted ints. The set is automatically sorted, so i can add a value at any time, and the set will be reordered.

The QTL equivalent (?) however, is QHash-based, which i would seem unnecessary here. The items are also not sorted.

So what's the QTL equivalence of the STL set<int> ?

std::set<int> sss;
	sss.insert(0x100);
	sss.insert(0x10);
	sss.insert(0);
	sss.insert(0x1000);
//sss -> 0,0x10,0x100,0x1000
 
 
	QSet<int> aaa;
	aaa.insert(0x100);
	aaa.insert(0x10);
	aaa.insert(0);
	aaa.insert(0x1000);
//aaa -> 0x100,0x10,0,0x1000

std::set<int> sss;
	sss.insert(0x100);
	sss.insert(0x10);
	sss.insert(0);
	sss.insert(0x1000);
//sss -> 0,0x10,0x100,0x1000


	QSet<int> aaa;
	aaa.insert(0x100);
	aaa.insert(0x10);
	aaa.insert(0);
	aaa.insert(0x1000);
//aaa -> 0x100,0x10,0,0x1000

To copy to clipboard, switch view to plain text mode 

[wysota]

Hmmm.... QSet?

[amleto]

Hmmm.... QSet?

That is not ordered either

[wysota]

A set is not ordered. An ordered set is a list.

[ChrisW67]

A std::set is ordered and contains no duplicates (unlike a list). QSet, on the other hand, does not preserve order: it is closer to the mathematical notion of a set.

Using QMap keys only would be the closest match if uniqueness and order is important.

QMap<int,int> sss;
sss.insert(0x100, 0);  // value is irrelevant
sss.insert(0x10, 0);
sss.insert(0, 0);
sss.insert(0x1000, 0);
qDebug() << sss.keys();
// (0, 16, 256, 4096)

QMap<int,int> sss;
sss.insert(0x100, 0);  // value is irrelevant
sss.insert(0x10, 0);
sss.insert(0, 0);
sss.insert(0x1000, 0);
qDebug() << sss.keys();
// (0, 16, 256, 4096)

To copy to clipboard, switch view to plain text mode 

If uniqueness is not a requirement then a simple QList that you sort before access is a good match.

[wysota]

You can always use this simple scheme:

QList<int> list;
 
int valueToInsert = 42;
QList::iterator iter = qLowerBound(list.begin(), list.end(), valueToInsert);
if(iter == list.end() || *iter != valueToInsert) list.insert(iter, valueToInsert);

QList<int> list;

int valueToInsert = 42;
QList::iterator iter = qLowerBound(list.begin(), list.end(), valueToInsert);
if(iter == list.end() || *iter != valueToInsert) list.insert(iter, valueToInsert);

To copy to clipboard, switch view to plain text mode 

[tuli]

Kay, so taht's not possible. Using QMap with a dummy .data field seems a little too messy to me, using QList<> as suggested by wysota is ofcourse possible.
Thanks all, guess i'll go with that.

Lil follow-up problem:
I can only get const References to the items contained in the list. Why?

MyClass& LeFunc(...)
{
	QList<MyClass> list;
 
	...
 
	Q_FOREACH(MyClass& i, list) //error C2440: 'initializing' : cannot convert from 'const MyClass' to 'MyClass &'
	{
		if(i.thisisit())
			return i;
	}
 
	...
 
}

MyClass& LeFunc(...)
{
	QList<MyClass> list;

	...
	
	Q_FOREACH(MyClass& i, list) //error C2440: 'initializing' : cannot convert from 'const MyClass' to 'MyClass &'
	{
		if(i.thisisit())
			return i;
	}
	
	...

}

To copy to clipboard, switch view to plain text mode 

[wysota]

Because foreach makes a copy of the container. It's for immutable loops only.

[tuli]

Makes snese.
Although this doesnt work either:

for(QList<MyClass>::iterator it=list.begin(); it != list.end(); ++it) //error C2440: 'initializing' : cannot convert from 'QList<T>::const_iterator' to 'QList<T>::iterator'
	{
		if(it->thisisit())
			return *it;
	}

for(QList<MyClass>::iterator it=list.begin(); it != list.end(); ++it) //error C2440: 'initializing' : cannot convert from 'QList<T>::const_iterator' to 'QList<T>::iterator'
	{
		if(it->thisisit())
			return *it;
	}

To copy to clipboard, switch view to plain text mode 

[wysota]

Apparently your "list" is const. Why do you insist on using a non-const iterator here?