[Development] implicit sharing and iterators in qt containers

[Mandeep Sandhu]

>
>
> I'd expect to be able to use keys that do not define qHash or qLess.
>
Why?

>
> Search would be O(n). So be it.
>

Well it wouldn't be much of a "map" then, would it? I see OrderedMap
similar to a QMap, just with a different key ordering scheme. So in that
way, constant time lookups would be _must_ I would say (although QMap
lookups log(n) time). It is after all a key-value store.

-mandeep


>
> --
> Thiago Macieira - thiago.macieira (AT) intel.com
>   Software Architect - Intel Open Source Technology Center
>
> _______________________________________________
> Development mailing list
> Development at qt-project.org
> http://lists.qt-project.org/mailman/listinfo/development
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.qt-project.org/pipermail/development/attachments/20170731/62790073/attachment.html>