This is the mail archive of the
libstdc++@gcc.gnu.org
mailing list for the libstdc++ project.
Re: Hunting for performance regressions in libstdc++
Paolo Carlini wrote:
>Ok, I think my only remaining doubt is the following (don't know if you
>want to help to clarify this point, not really part of DR 233 ;) AFAICS,
>in case of map/set things seem less efficient, the worst case being *3*
>comparisons. That is, x < *p, then, if it fails, *p < x and x < *(p +
>1).
>
Worst case, to be clear. Because in this case, as you also reminded
above, it can happen that no insertion takes place at all.
Paolo.