On Tue, Jun 11, 2019 at 11:42:32AM +0300, Konstantin Shegunov wrote: > On Tue, Jun 11, 2019 at 11:31 AM Ulf Hermann <ulf.herm...@qt.io> wrote: > > > I imagine that a vector which automatically sorts itself on the first > > lookup after any changes if it's larger than X items could be a drop-in > > replacement for most of the places where I misuse QHash or QMap. X could > > be a template parameter or found by some heuristic. > > > > I though about this as well. There's one caveat though. It can't be > (easily) made COW (if we require it). > [...] > Do I miss something?
I don't think that (non-)COW is a problem in the scenario under discussion. Andre' _______________________________________________ Development mailing list Development@qt-project.org https://lists.qt-project.org/listinfo/development
