On 02/08/2013 09:51 AM, Illya Kovalevskyy wrote:
> Hello.
>
> I found one Google thing, a useful thing -
> http://google-opensource.blogspot.com/2013/01/c-containers-that-save-memory-and-time.html.
> According to benchmarks: they are faster than STL containers.
For some use cases. As they note if
Hi Illya,
I think it is an interesting idea to try B-Trees as an alternative to other
search trees for in-memory data structures. As with any data structure, you
have to consider the circumstances in which they perform better than an
alternative. These days, caches are so large and DRAM latency
On Friday 08 February 2013 10:51:14 Illya Kovalevskyy wrote:
> Hello.
>
> I found one Google thing, a useful thing -
> http://google-opensource.blogspot.com/2013/01/c-containers-that-save-memory->
> and-time.html. According to benchmarks: they are faster than STL containers.
>
> Afaik, Qt uses S
Hello.
I found one Google thing, a useful thing -
http://google-opensource.blogspot.com/2013/01/c-containers-that-save-memory-and-time.html.
According to benchmarks: they are faster than STL containers.
Afaik, Qt uses STL containers in its QVector, QMap, etc. Maybe it's a good
idea to port it to
