5cb0368516
QMap used to use a skiplist in Qt 4.x, which has variable sized nodes and we can thus not optimise using custom allocators. The rewrite now uses a red-black tree, and all allocations and tree operations happen in the cpp file. This will allow us to introduce custom allocation schemes in later versions of Qt. Added some more tests and a benchmark. Memory consumption of the new QMap implementation is pretty much the same as before. Performance of insertion and lookup has increased by 10-30%. iteration is slower, but still extremely fast and should not matter compared to the work usually done when iterating. Change-Id: I8796c0e4b207d01111e2ead7ae55afb464dd88f5 Reviewed-by: Thiago Macieira <thiago.macieira@intel.com>
18 lines
340 B
Prolog
18 lines
340 B
Prolog
TEMPLATE = subdirs
|
|
SUBDIRS = \
|
|
containers-associative \
|
|
containers-sequential \
|
|
qbytearray \
|
|
qcontiguouscache \
|
|
qlist \
|
|
qmap \
|
|
qrect \
|
|
qregexp \
|
|
qstring \
|
|
qstringbuilder \
|
|
qstringlist \
|
|
qvector \
|
|
qalgorithms
|
|
|
|
!*g++*: SUBDIRS -= qstring
|