1286 bytes when using an initializer list,
7414 bytes for the insert(..., ...) sequence.
Change-Id: I10ad8b10fea962feb01e9dbb31a542a4b66680a7
Reviewed-by: Eike Ziller <eike.ziller@theqtcompany.com>
Reviewed-by: Christian Stenger <christian.stenger@theqtcompany.com>
That's for a structure mimicking QMakeStepConfig, comparing
a.x == b.x && a.y == b.y ... with
std::tie(a.x, a.y, ...) == std::tie(b.x, b.y, ...)
Executive summary: gcc 4.9.1 optimizes the traditional == && == better.
This is solely due to the sequence of four bools in the struct.
Change-Id: I77cc8d685c6b7b7ead651cd1f44ff1b2e9b39f3d
Reviewed-by: Daniel Teske <daniel.teske@theqtcompany.com>
This helps to compare code sizes generated by lambdas.
Change-Id: I6734a26f59ec622ec8d4dfdea2c9e83340c11d73
Reviewed-by: Christian Stenger <christian.stenger@theqtcompany.com>
