https://gcc.gnu.org/bugzilla/show_bug.cgi?id=101163
Jakub Jelinek <jakub at gcc dot gnu.org> changed:
What |Removed |Added
----------------------------------------------------------------------------
CC| |jakub at gcc dot gnu.org,
| |jason at gcc dot gnu.org,
| |mpolacek at gcc dot gnu.org,
| |ppalka at gcc dot gnu.org
--- Comment #3 from Jakub Jelinek <jakub at gcc dot gnu.org> ---
There are binary search tables used for name-lookup later on (once the type is
completed), linear searches are used while the class is constructed.
Perhaps a way out of this would be to have a hybrid lookup during the
construction, use linear searches like now, but once more than certain number
of members is added (a few hundred?), (re)build partial binary search tables
after each such number of new members is added and if not found in the binary
search tables, do the linear search on the rest.
