QHash uses a tree to store elements, so that the lookup time is optimial, so the order of elements is not preserved. If you need the order of the elements to be maintained, use QMap instead, just be prepared for slower lookups.
The "Q"
Re: about QHash elements order
QHash uses a tree to store elements, so that the lookup time is optimial, so the order of elements is not preserved. If you need the order of the elements to be maintained, use QMap instead, just be prepared for slower lookups.
bruce1007 (26th August 2006)
Posting Permissions
Reply With Quote
Bookmarks