------- Comment #8 from paolo dot carlini at oracle dot com 2010-08-12 10:55 ------- Maybe averaging over all possible keys, we are fine: the probability to erase the first non-empty bucket is of the order 1 / # buckets, thus decreases exactly as fast as # buckets grows. On the average the slowness of that rare operation should not impact the "O" complexity of erase(const key_type&), should remain asymptotically independent from # buckets, as we want.
-- http://gcc.gnu.org/bugzilla/show_bug.cgi?id=44480
