Switch optimization for many cases guarantees equal access time for any case? ( C++ )

Question

I\'ve seen answers here for specific languages, about switches with more than 5 cases being optimized with jump tables to guarantee constant access time for any case.
Is

Answer 1

For gcc's implementation see:

http://old.nabble.com/optimization-of-switch-statements-on-i386-to15366926.html#a15367662