I think I have some basic results from a simple experiment.
I constructed a Switch with cases 0 thru 6 (and a default)
I measured time for each case and it appears constant for each case. This would make sense for a jump table. The resolution of the micros is too coarse (8us or 16us) which makes sense (my target runs at 8MHz)
I then changed case 6 to case 7, the program size increases by two bytes, case 6 to 8 increases by 4 bytes.
I think this makes the argument that a jump table was created since there would be one or two empty locations corresponding to missing case 6 (and later case 7).
If I randomly reorder the cases from (6,2,4,3,5,1,0), the program size is the same as (0,1,2,3,4,5,6). This would suggest that the compiler still made a jump table and was smart enough to reorder. Randomly changing any of the parameters to 7 increased the size by 2 bytes again. This includes substituting for 0.
If I replace case 6 with a much larger number, the compiler increased the program size 14 bytes. I did this with both 24 and 34. I am speculating that the compiler maybe handles that case by exception (and maybe also the default case)
I didn't work too hard to decipher the assembly code since I built my experiment into a fairly large program and disassembly is hard to read without good labels. I glanced at it and then moved on.
I have quite a bit of embedded experience, mostly with DSPs. This is my first Arduino and AVR project, so I am still learning the environment and I have not learned the assembly language.
Does a short jump take two bytes? This would help support the jump table conclusion.
If I have this wrong, please jump in and clarify.
Al