https://gcc.gnu.org/bugzilla/show_bug.cgi?id=101163
--- Comment #4 from Richard Biener <rguenth at gcc dot gnu.org> --- OTOH the "binary search tables" are vectors which of course makes them hard to build incrementally since insert is O(n). It might be possible to use a hash-table in the storage place of said vector storage during construction and then compact that down to the current binary search vector when finalized.
