From: [email protected] 
<[email protected]> on behalf of 
Kevin Kofler <[email protected]>
> If you have large objects, and insert or remove items within the list,
> QVector will have to move (or even copy&delete, if they're not movable)
> large amounts of data. Unless you use a QVector<T*>, but that loses the
> value semantics in several places. And a QLinkedList is not an option if you
> also need O(1) (or anything faster than O(n), even) item retrieval. Pointer
> arrays have their advantages.

It depends if you care about the order of the container. If you don't and my 
experience you don't care in many cases you can simply use std::remove_if + 
erase 
and being very efficient.  
_______________________________________________
Development mailing list
[email protected]
http://lists.qt-project.org/mailman/listinfo/development

Reply via email to