[Interest] initialising a dictionary-type container instance with a static table?

[Konstantin Shegunov]

On Mon, Jan 2, 2017 at 4:47 PM, René J.V. Bertin <rjvbertin at gmail.com>
wrote:
>
> And that seems surprising, one could expect it to be more efficient to add
> items sequentially to a list that would maintain a sequential order anyway.
> But I'll take your word for it, I'm not a computer scientist by any kind of
> formal training :)
>

Me neither, I'm a lowly physicist. ;)
I assume the choice of underlying data structure was made so even in the
worst case scenario the complexity is logarithmic, in contrast with QHash
where the worst case scenario gives you a whooping linear complexity on
insertion.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.qt-project.org/pipermail/interest/attachments/20170102/8044f074/attachment.html>