https://gcc.gnu.org/bugzilla/show_bug.cgi?id=68303
--- Comment #6 from Jonathan Wakely ---
But it doesn't make a huge difference and iteration is still much faster for <=
17 elements:
| GCC 9 | | GCC 10 | | 10 wrapped |
0=0.696880 0=0.700247 0=0.110166
1=0.705601 1=0.67
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=68303
--- Comment #5 from Jonathan Wakely ---
(In reply to Jonathan Wakely from comment #4)
> Patch posted to https://gcc.gnu.org/ml/gcc-patches/2018-10/msg00903.html
> Reviewed at https://gcc.gnu.org/ml/gcc-patches/2019-05/msg02120.html
As pointed ou
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=68303
--- Comment #4 from Jonathan Wakely ---
Patch posted to https://gcc.gnu.org/ml/gcc-patches/2018-10/msg00903.html
Reviewed at https://gcc.gnu.org/ml/gcc-patches/2019-05/msg02120.html
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=68303
--- Comment #3 from François Dumont ---
Even if I always considered unordered containers to be high volume containers
that's an interesting idea.
As this is a pretty old entry I guess I'll have to try it myself.
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=68303
Andrew Pinski changed:
What|Removed |Added
Status|UNCONFIRMED |NEW
Last reconfirmed|
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=68303
Jan Kratochvil changed:
What|Removed |Added
CC||jan.kratochvil at redhat dot
com
--- C
